blob: 45e6f9bfe99caea57afd13cb4a6c7be4ba145c86 [file] [log] [blame]
Kristian Høgsbergc781c062007-05-07 20:33:32 -04001/*
2 * Incremental bus scan, based on bus topology
Kristian Høgsberg3038e352006-12-19 19:58:27 -05003 *
4 * Copyright (C) 2004-2006 Kristian Hoegsberg <krh@bitplanet.net>
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software Foundation,
18 * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
19 */
20
21#include <linux/module.h>
22#include <linux/wait.h>
23#include <linux/errno.h>
24#include "fw-transaction.h"
25#include "fw-topology.h"
26
Kristian Høgsberga77754a2007-05-07 20:33:35 -040027#define SELF_ID_PHY_ID(q) (((q) >> 24) & 0x3f)
28#define SELF_ID_EXTENDED(q) (((q) >> 23) & 0x01)
29#define SELF_ID_LINK_ON(q) (((q) >> 22) & 0x01)
30#define SELF_ID_GAP_COUNT(q) (((q) >> 16) & 0x3f)
31#define SELF_ID_PHY_SPEED(q) (((q) >> 14) & 0x03)
32#define SELF_ID_CONTENDER(q) (((q) >> 11) & 0x01)
33#define SELF_ID_PHY_INITIATOR(q) (((q) >> 1) & 0x01)
34#define SELF_ID_MORE_PACKETS(q) (((q) >> 0) & 0x01)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050035
Kristian Høgsberga77754a2007-05-07 20:33:35 -040036#define SELF_ID_EXT_SEQUENCE(q) (((q) >> 20) & 0x07)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050037
38static u32 *count_ports(u32 *sid, int *total_port_count, int *child_port_count)
39{
40 u32 q;
41 int port_type, shift, seq;
42
43 *total_port_count = 0;
44 *child_port_count = 0;
45
46 shift = 6;
47 q = *sid;
48 seq = 0;
49
50 while (1) {
51 port_type = (q >> shift) & 0x03;
52 switch (port_type) {
53 case SELFID_PORT_CHILD:
54 (*child_port_count)++;
55 case SELFID_PORT_PARENT:
56 case SELFID_PORT_NCONN:
57 (*total_port_count)++;
58 case SELFID_PORT_NONE:
59 break;
60 }
61
62 shift -= 2;
63 if (shift == 0) {
Kristian Høgsberga77754a2007-05-07 20:33:35 -040064 if (!SELF_ID_MORE_PACKETS(q))
Kristian Høgsberg3038e352006-12-19 19:58:27 -050065 return sid + 1;
66
67 shift = 16;
68 sid++;
69 q = *sid;
70
Kristian Høgsbergc781c062007-05-07 20:33:32 -040071 /*
72 * Check that the extra packets actually are
Kristian Høgsberg3038e352006-12-19 19:58:27 -050073 * extended self ID packets and that the
74 * sequence numbers in the extended self ID
Kristian Høgsbergc781c062007-05-07 20:33:32 -040075 * packets increase as expected.
76 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -050077
Kristian Høgsberga77754a2007-05-07 20:33:35 -040078 if (!SELF_ID_EXTENDED(q) ||
79 seq != SELF_ID_EXT_SEQUENCE(q))
Kristian Høgsberg3038e352006-12-19 19:58:27 -050080 return NULL;
81
82 seq++;
83 }
84 }
85}
86
87static int get_port_type(u32 *sid, int port_index)
88{
89 int index, shift;
90
91 index = (port_index + 5) / 8;
92 shift = 16 - ((port_index + 5) & 7) * 2;
93 return (sid[index] >> shift) & 0x03;
94}
95
Adrian Bunk95688e92007-01-22 19:17:37 +010096static struct fw_node *fw_node_create(u32 sid, int port_count, int color)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050097{
98 struct fw_node *node;
99
Kristian Høgsberg2d826cc2007-05-09 19:23:14 -0400100 node = kzalloc(sizeof(*node) + port_count * sizeof(node->ports[0]),
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500101 GFP_ATOMIC);
102 if (node == NULL)
103 return NULL;
104
105 node->color = color;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400106 node->node_id = LOCAL_BUS | SELF_ID_PHY_ID(sid);
107 node->link_on = SELF_ID_LINK_ON(sid);
108 node->phy_speed = SELF_ID_PHY_SPEED(sid);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500109 node->port_count = port_count;
110
111 atomic_set(&node->ref_count, 1);
112 INIT_LIST_HEAD(&node->link);
113
114 return node;
115}
116
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400117/*
118 * Compute the maximum hop count for this node and it's children. The
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500119 * maximum hop count is the maximum number of connections between any
120 * two nodes in the subtree rooted at this node. We need this for
121 * setting the gap count. As we build the tree bottom up in
122 * build_tree() below, this is fairly easy to do: for each node we
123 * maintain the max hop count and the max depth, ie the number of hops
124 * to the furthest leaf. Computing the max hop count breaks down into
125 * two cases: either the path goes through this node, in which case
126 * the hop count is the sum of the two biggest child depths plus 2.
127 * Or it could be the case that the max hop path is entirely
128 * containted in a child tree, in which case the max hop count is just
129 * the max hop count of this child.
130 */
131static void update_hop_count(struct fw_node *node)
132{
133 int depths[2] = { -1, -1 };
134 int max_child_hops = 0;
135 int i;
136
137 for (i = 0; i < node->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200138 if (node->ports[i] == NULL)
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500139 continue;
140
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200141 if (node->ports[i]->max_hops > max_child_hops)
142 max_child_hops = node->ports[i]->max_hops;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500143
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200144 if (node->ports[i]->max_depth > depths[0]) {
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500145 depths[1] = depths[0];
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200146 depths[0] = node->ports[i]->max_depth;
147 } else if (node->ports[i]->max_depth > depths[1])
148 depths[1] = node->ports[i]->max_depth;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500149 }
150
151 node->max_depth = depths[0] + 1;
152 node->max_hops = max(max_child_hops, depths[0] + depths[1] + 2);
153}
154
Stefan Richtere5f84f82007-10-07 02:10:11 +0200155static inline struct fw_node *fw_node(struct list_head *l)
156{
157 return list_entry(l, struct fw_node, link);
158}
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500159
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500160/**
161 * build_tree - Build the tree representation of the topology
162 * @self_ids: array of self IDs to create the tree from
163 * @self_id_count: the length of the self_ids array
164 * @local_id: the node ID of the local node
165 *
166 * This function builds the tree representation of the topology given
167 * by the self IDs from the latest bus reset. During the construction
168 * of the tree, the function checks that the self IDs are valid and
169 * internally consistent. On succcess this funtions returns the
170 * fw_node corresponding to the local card otherwise NULL.
171 */
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500172static struct fw_node *build_tree(struct fw_card *card,
173 u32 *sid, int self_id_count)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500174{
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500175 struct fw_node *node, *child, *local_node, *irm_node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500176 struct list_head stack, *h;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500177 u32 *next_sid, *end, q;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500178 int i, port_count, child_port_count, phy_id, parent_count, stack_depth;
Stefan Richter24d40122007-06-18 19:44:12 +0200179 int gap_count;
180 bool beta_repeaters_present;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500181
182 local_node = NULL;
183 node = NULL;
184 INIT_LIST_HEAD(&stack);
185 stack_depth = 0;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500186 end = sid + self_id_count;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500187 phy_id = 0;
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500188 irm_node = NULL;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400189 gap_count = SELF_ID_GAP_COUNT(*sid);
Stefan Richter24d40122007-06-18 19:44:12 +0200190 beta_repeaters_present = false;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500191
192 while (sid < end) {
193 next_sid = count_ports(sid, &port_count, &child_port_count);
194
195 if (next_sid == NULL) {
196 fw_error("Inconsistent extended self IDs.\n");
197 return NULL;
198 }
199
200 q = *sid;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400201 if (phy_id != SELF_ID_PHY_ID(q)) {
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500202 fw_error("PHY ID mismatch in self ID: %d != %d.\n",
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400203 phy_id, SELF_ID_PHY_ID(q));
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500204 return NULL;
205 }
206
207 if (child_port_count > stack_depth) {
208 fw_error("Topology stack underflow\n");
209 return NULL;
210 }
211
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400212 /*
213 * Seek back from the top of our stack to find the
214 * start of the child nodes for this node.
215 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500216 for (i = 0, h = &stack; i < child_port_count; i++)
217 h = h->prev;
218 child = fw_node(h);
219
220 node = fw_node_create(q, port_count, card->color);
221 if (node == NULL) {
Stefan Richter8a8cea22007-06-09 19:26:22 +0200222 fw_error("Out of memory while building topology.\n");
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500223 return NULL;
224 }
225
226 if (phy_id == (card->node_id & 0x3f))
227 local_node = node;
228
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400229 if (SELF_ID_CONTENDER(q))
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500230 irm_node = node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500231
232 parent_count = 0;
233
234 for (i = 0; i < port_count; i++) {
235 switch (get_port_type(sid, i)) {
236 case SELFID_PORT_PARENT:
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400237 /*
238 * Who's your daddy? We dont know the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500239 * parent node at this time, so we
240 * temporarily abuse node->color for
241 * remembering the entry in the
242 * node->ports array where the parent
243 * node should be. Later, when we
244 * handle the parent node, we fix up
245 * the reference.
246 */
247 parent_count++;
248 node->color = i;
249 break;
250
251 case SELFID_PORT_CHILD:
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200252 node->ports[i] = child;
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400253 /*
254 * Fix up parent reference for this
255 * child node.
256 */
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200257 child->ports[child->color] = node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500258 child->color = card->color;
259 child = fw_node(child->link.next);
260 break;
261 }
262 }
263
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400264 /*
265 * Check that the node reports exactly one parent
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500266 * port, except for the root, which of course should
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400267 * have no parents.
268 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500269 if ((next_sid == end && parent_count != 0) ||
270 (next_sid < end && parent_count != 1)) {
271 fw_error("Parent port inconsistency for node %d: "
272 "parent_count=%d\n", phy_id, parent_count);
273 return NULL;
274 }
275
276 /* Pop the child nodes off the stack and push the new node. */
277 __list_del(h->prev, &stack);
278 list_add_tail(&node->link, &stack);
279 stack_depth += 1 - child_port_count;
280
Stefan Richter24d40122007-06-18 19:44:12 +0200281 if (node->phy_speed == SCODE_BETA &&
282 parent_count + child_port_count > 1)
283 beta_repeaters_present = true;
284
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400285 /*
286 * If all PHYs does not report the same gap count
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500287 * setting, we fall back to 63 which will force a gap
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400288 * count reconfiguration and a reset.
289 */
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400290 if (SELF_ID_GAP_COUNT(q) != gap_count)
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500291 gap_count = 63;
292
293 update_hop_count(node);
294
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500295 sid = next_sid;
296 phy_id++;
297 }
298
299 card->root_node = node;
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500300 card->irm_node = irm_node;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500301 card->gap_count = gap_count;
Stefan Richter24d40122007-06-18 19:44:12 +0200302 card->beta_repeaters_present = beta_repeaters_present;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500303
304 return local_node;
305}
306
Kristian Høgsberga98e2712007-05-07 20:33:34 -0400307typedef void (*fw_node_callback_t)(struct fw_card * card,
308 struct fw_node * node,
309 struct fw_node * parent);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500310
311static void
312for_each_fw_node(struct fw_card *card, struct fw_node *root,
313 fw_node_callback_t callback)
314{
315 struct list_head list;
316 struct fw_node *node, *next, *child, *parent;
317 int i;
318
319 INIT_LIST_HEAD(&list);
320
321 fw_node_get(root);
322 list_add_tail(&root->link, &list);
323 parent = NULL;
324 list_for_each_entry(node, &list, link) {
325 node->color = card->color;
326
327 for (i = 0; i < node->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200328 child = node->ports[i];
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500329 if (!child)
330 continue;
331 if (child->color == card->color)
332 parent = child;
333 else {
334 fw_node_get(child);
335 list_add_tail(&child->link, &list);
336 }
337 }
338
339 callback(card, node, parent);
340 }
341
342 list_for_each_entry_safe(node, next, &list, link)
343 fw_node_put(node);
344}
345
346static void
347report_lost_node(struct fw_card *card,
348 struct fw_node *node, struct fw_node *parent)
349{
350 fw_node_event(card, node, FW_NODE_DESTROYED);
351 fw_node_put(node);
352}
353
354static void
355report_found_node(struct fw_card *card,
356 struct fw_node *node, struct fw_node *parent)
357{
358 int b_path = (node->phy_speed == SCODE_BETA);
359
360 if (parent != NULL) {
Stefan Richter748086e2007-01-27 16:59:15 +0100361 /* min() macro doesn't work here with gcc 3.4 */
362 node->max_speed = parent->max_speed < node->phy_speed ?
363 parent->max_speed : node->phy_speed;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500364 node->b_path = parent->b_path && b_path;
365 } else {
366 node->max_speed = node->phy_speed;
367 node->b_path = b_path;
368 }
369
370 fw_node_event(card, node, FW_NODE_CREATED);
371}
372
373void fw_destroy_nodes(struct fw_card *card)
374{
375 unsigned long flags;
376
377 spin_lock_irqsave(&card->lock, flags);
378 card->color++;
379 if (card->local_node != NULL)
380 for_each_fw_node(card, card->local_node, report_lost_node);
381 spin_unlock_irqrestore(&card->lock, flags);
382}
383
384static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)
385{
386 struct fw_node *tree;
387 int i;
388
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200389 tree = node1->ports[port];
390 node0->ports[port] = tree;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500391 for (i = 0; i < tree->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200392 if (tree->ports[i] == node1) {
393 tree->ports[i] = node0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500394 break;
395 }
396 }
397}
398
399/**
400 * update_tree - compare the old topology tree for card with the new
401 * one specified by root. Queue the nodes and mark them as either
402 * found, lost or updated. Update the nodes in the card topology tree
403 * as we go.
404 */
405static void
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500406update_tree(struct fw_card *card, struct fw_node *root)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500407{
408 struct list_head list0, list1;
409 struct fw_node *node0, *node1;
410 int i, event;
411
412 INIT_LIST_HEAD(&list0);
413 list_add_tail(&card->local_node->link, &list0);
414 INIT_LIST_HEAD(&list1);
415 list_add_tail(&root->link, &list1);
416
417 node0 = fw_node(list0.next);
418 node1 = fw_node(list1.next);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500419
420 while (&node0->link != &list0) {
421
422 /* assert(node0->port_count == node1->port_count); */
423 if (node0->link_on && !node1->link_on)
424 event = FW_NODE_LINK_OFF;
425 else if (!node0->link_on && node1->link_on)
426 event = FW_NODE_LINK_ON;
427 else
428 event = FW_NODE_UPDATED;
429
430 node0->node_id = node1->node_id;
431 node0->color = card->color;
432 node0->link_on = node1->link_on;
433 node0->initiated_reset = node1->initiated_reset;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500434 node0->max_hops = node1->max_hops;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500435 node1->color = card->color;
436 fw_node_event(card, node0, event);
437
438 if (card->root_node == node1)
439 card->root_node = node0;
440 if (card->irm_node == node1)
441 card->irm_node = node0;
442
443 for (i = 0; i < node0->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200444 if (node0->ports[i] && node1->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400445 /*
446 * This port didn't change, queue the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500447 * connected node for further
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400448 * investigation.
449 */
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200450 if (node0->ports[i]->color == card->color)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500451 continue;
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200452 list_add_tail(&node0->ports[i]->link, &list0);
453 list_add_tail(&node1->ports[i]->link, &list1);
454 } else if (node0->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400455 /*
456 * The nodes connected here were
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500457 * unplugged; unref the lost nodes and
458 * queue FW_NODE_LOST callbacks for
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400459 * them.
460 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500461
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200462 for_each_fw_node(card, node0->ports[i],
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500463 report_lost_node);
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200464 node0->ports[i] = NULL;
465 } else if (node1->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400466 /*
467 * One or more node were connected to
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500468 * this port. Move the new nodes into
469 * the tree and queue FW_NODE_CREATED
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400470 * callbacks for them.
471 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500472 move_tree(node0, node1, i);
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200473 for_each_fw_node(card, node0->ports[i],
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500474 report_found_node);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500475 }
476 }
477
478 node0 = fw_node(node0->link.next);
479 node1 = fw_node(node1->link.next);
480 }
481}
482
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500483static void
484update_topology_map(struct fw_card *card, u32 *self_ids, int self_id_count)
485{
486 int node_count;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500487
488 card->topology_map[1]++;
489 node_count = (card->root_node->node_id & 0x3f) + 1;
490 card->topology_map[2] = (node_count << 16) | self_id_count;
Kristian Høgsberge1755692007-05-07 20:33:31 -0400491 card->topology_map[0] = (self_id_count + 2) << 16;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500492 memcpy(&card->topology_map[3], self_ids, self_id_count * 4);
Kristian Høgsberge1755692007-05-07 20:33:31 -0400493 fw_compute_block_crc(card->topology_map);
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500494}
495
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500496void
497fw_core_handle_bus_reset(struct fw_card *card,
498 int node_id, int generation,
499 int self_id_count, u32 * self_ids)
500{
501 struct fw_node *local_node;
502 unsigned long flags;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500503
504 fw_flush_transactions(card);
505
506 spin_lock_irqsave(&card->lock, flags);
507
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400508 /*
509 * If the new topology has a different self_id_count the topology
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500510 * changed, either nodes were added or removed. In that case we
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400511 * reset the IRM reset counter.
512 */
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500513 if (card->self_id_count != self_id_count)
Kristian Høgsberg931c4832007-01-26 00:38:45 -0500514 card->bm_retries = 0;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500515
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500516 card->node_id = node_id;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500517 card->generation = generation;
Kristian Høgsberg931c4832007-01-26 00:38:45 -0500518 card->reset_jiffies = jiffies;
Kristian Høgsberg993baca2007-02-06 14:49:35 -0500519 schedule_delayed_work(&card->work, 0);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500520
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500521 local_node = build_tree(card, self_ids, self_id_count);
522
523 update_topology_map(card, self_ids, self_id_count);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500524
525 card->color++;
526
527 if (local_node == NULL) {
528 fw_error("topology build failed\n");
529 /* FIXME: We need to issue a bus reset in this case. */
530 } else if (card->local_node == NULL) {
531 card->local_node = local_node;
532 for_each_fw_node(card, local_node, report_found_node);
533 } else {
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500534 update_tree(card, local_node);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500535 }
536
537 spin_unlock_irqrestore(&card->lock, flags);
538}
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500539EXPORT_SYMBOL(fw_core_handle_bus_reset);