firewire: core: optimize Topology Map creation
The Topology Map of the local node was created in CPU byte order, then a temporary big endian copy was created to compute the CRC, and when a read request to the Topology Map arrived it had to be converted to big endian byte order again. We now generate it in big endian byte order in the first place. This also rids us of 1000 bytes stack usage in tasklet context. Signed-off-by: Stefan Richter <stefanr@s5r6.in-berlin.de>
This commit is contained in:
parent
fe242579e9
commit
cb7c96da36
@ -38,7 +38,7 @@
|
|||||||
|
|
||||||
#include "core.h"
|
#include "core.h"
|
||||||
|
|
||||||
static int __compute_block_crc(__be32 *block)
|
int fw_compute_block_crc(__be32 *block)
|
||||||
{
|
{
|
||||||
int length;
|
int length;
|
||||||
u16 crc;
|
u16 crc;
|
||||||
@ -50,19 +50,6 @@ static int __compute_block_crc(__be32 *block)
|
|||||||
return length;
|
return length;
|
||||||
}
|
}
|
||||||
|
|
||||||
int fw_compute_block_crc(u32 *block)
|
|
||||||
{
|
|
||||||
__be32 be32_block[256];
|
|
||||||
int i, length;
|
|
||||||
|
|
||||||
length = (*block >> 16) & 0xff;
|
|
||||||
for (i = 0; i < length; i++)
|
|
||||||
be32_block[i] = cpu_to_be32(block[i + 1]);
|
|
||||||
*block |= crc_itu_t(0, (u8 *) be32_block, length * 4);
|
|
||||||
|
|
||||||
return length;
|
|
||||||
}
|
|
||||||
|
|
||||||
static DEFINE_MUTEX(card_mutex);
|
static DEFINE_MUTEX(card_mutex);
|
||||||
static LIST_HEAD(card_list);
|
static LIST_HEAD(card_list);
|
||||||
|
|
||||||
@ -141,7 +128,7 @@ static size_t generate_config_rom(struct fw_card *card, __be32 *config_rom)
|
|||||||
* the bus info block, which is always the case for this
|
* the bus info block, which is always the case for this
|
||||||
* implementation. */
|
* implementation. */
|
||||||
for (i = 0; i < j; i += length + 1)
|
for (i = 0; i < j; i += length + 1)
|
||||||
length = __compute_block_crc(config_rom + i);
|
length = fw_compute_block_crc(config_rom + i);
|
||||||
|
|
||||||
return j;
|
return j;
|
||||||
}
|
}
|
||||||
|
@ -28,9 +28,9 @@
|
|||||||
#include <linux/module.h>
|
#include <linux/module.h>
|
||||||
#include <linux/slab.h>
|
#include <linux/slab.h>
|
||||||
#include <linux/spinlock.h>
|
#include <linux/spinlock.h>
|
||||||
#include <linux/string.h>
|
|
||||||
|
|
||||||
#include <asm/atomic.h>
|
#include <asm/atomic.h>
|
||||||
|
#include <asm/byteorder.h>
|
||||||
#include <asm/system.h>
|
#include <asm/system.h>
|
||||||
|
|
||||||
#include "core.h"
|
#include "core.h"
|
||||||
@ -510,13 +510,16 @@ static void update_tree(struct fw_card *card, struct fw_node *root)
|
|||||||
static void update_topology_map(struct fw_card *card,
|
static void update_topology_map(struct fw_card *card,
|
||||||
u32 *self_ids, int self_id_count)
|
u32 *self_ids, int self_id_count)
|
||||||
{
|
{
|
||||||
int node_count;
|
int node_count = (card->root_node->node_id & 0x3f) + 1;
|
||||||
|
__be32 *map = card->topology_map;
|
||||||
|
|
||||||
|
*map++ = cpu_to_be32((self_id_count + 2) << 16);
|
||||||
|
*map++ = cpu_to_be32(be32_to_cpu(card->topology_map[1]) + 1);
|
||||||
|
*map++ = cpu_to_be32((node_count << 16) | self_id_count);
|
||||||
|
|
||||||
|
while (self_id_count--)
|
||||||
|
*map++ = cpu_to_be32p(self_ids++);
|
||||||
|
|
||||||
card->topology_map[1]++;
|
|
||||||
node_count = (card->root_node->node_id & 0x3f) + 1;
|
|
||||||
card->topology_map[2] = (node_count << 16) | self_id_count;
|
|
||||||
card->topology_map[0] = (self_id_count + 2) << 16;
|
|
||||||
memcpy(&card->topology_map[3], self_ids, self_id_count * 4);
|
|
||||||
fw_compute_block_crc(card->topology_map);
|
fw_compute_block_crc(card->topology_map);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -810,8 +810,7 @@ static void handle_topology_map(struct fw_card *card, struct fw_request *request
|
|||||||
int speed, unsigned long long offset,
|
int speed, unsigned long long offset,
|
||||||
void *payload, size_t length, void *callback_data)
|
void *payload, size_t length, void *callback_data)
|
||||||
{
|
{
|
||||||
int i, start, end;
|
int start;
|
||||||
__be32 *map;
|
|
||||||
|
|
||||||
if (!TCODE_IS_READ_REQUEST(tcode)) {
|
if (!TCODE_IS_READ_REQUEST(tcode)) {
|
||||||
fw_send_response(card, request, RCODE_TYPE_ERROR);
|
fw_send_response(card, request, RCODE_TYPE_ERROR);
|
||||||
@ -824,11 +823,7 @@ static void handle_topology_map(struct fw_card *card, struct fw_request *request
|
|||||||
}
|
}
|
||||||
|
|
||||||
start = (offset - topology_map_region.start) / 4;
|
start = (offset - topology_map_region.start) / 4;
|
||||||
end = start + length / 4;
|
memcpy(payload, &card->topology_map[start], length);
|
||||||
map = payload;
|
|
||||||
|
|
||||||
for (i = 0; i < length / 4; i++)
|
|
||||||
map[i] = cpu_to_be32(card->topology_map[start + i]);
|
|
||||||
|
|
||||||
fw_send_response(card, request, RCODE_COMPLETE);
|
fw_send_response(card, request, RCODE_COMPLETE);
|
||||||
}
|
}
|
||||||
|
@ -94,7 +94,7 @@ int fw_card_add(struct fw_card *card,
|
|||||||
u32 max_receive, u32 link_speed, u64 guid);
|
u32 max_receive, u32 link_speed, u64 guid);
|
||||||
void fw_core_remove_card(struct fw_card *card);
|
void fw_core_remove_card(struct fw_card *card);
|
||||||
int fw_core_initiate_bus_reset(struct fw_card *card, int short_reset);
|
int fw_core_initiate_bus_reset(struct fw_card *card, int short_reset);
|
||||||
int fw_compute_block_crc(u32 *block);
|
int fw_compute_block_crc(__be32 *block);
|
||||||
void fw_schedule_bm_work(struct fw_card *card, unsigned long delay);
|
void fw_schedule_bm_work(struct fw_card *card, unsigned long delay);
|
||||||
|
|
||||||
static inline struct fw_card *fw_card_get(struct fw_card *card)
|
static inline struct fw_card *fw_card_get(struct fw_card *card)
|
||||||
|
@ -117,7 +117,7 @@ struct fw_card {
|
|||||||
|
|
||||||
bool broadcast_channel_allocated;
|
bool broadcast_channel_allocated;
|
||||||
u32 broadcast_channel;
|
u32 broadcast_channel;
|
||||||
u32 topology_map[(CSR_TOPOLOGY_MAP_END - CSR_TOPOLOGY_MAP) / 4];
|
__be32 topology_map[(CSR_TOPOLOGY_MAP_END - CSR_TOPOLOGY_MAP) / 4];
|
||||||
};
|
};
|
||||||
|
|
||||||
struct fw_attribute_group {
|
struct fw_attribute_group {
|
||||||
|
Loading…
Reference in New Issue
Block a user