blob: d0deecc4de938440c99c1c6778ca0917e71491d0 [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>
Stefan Richtera2cdebe2008-03-08 22:38:16 +010024#include <asm/bug.h>
Stefan Richterb5d2a5e2008-01-25 18:57:41 +010025#include <asm/system.h>
Kristian Høgsberg3038e352006-12-19 19:58:27 -050026#include "fw-transaction.h"
27#include "fw-topology.h"
28
Kristian Høgsberga77754a2007-05-07 20:33:35 -040029#define SELF_ID_PHY_ID(q) (((q) >> 24) & 0x3f)
30#define SELF_ID_EXTENDED(q) (((q) >> 23) & 0x01)
31#define SELF_ID_LINK_ON(q) (((q) >> 22) & 0x01)
32#define SELF_ID_GAP_COUNT(q) (((q) >> 16) & 0x3f)
33#define SELF_ID_PHY_SPEED(q) (((q) >> 14) & 0x03)
34#define SELF_ID_CONTENDER(q) (((q) >> 11) & 0x01)
35#define SELF_ID_PHY_INITIATOR(q) (((q) >> 1) & 0x01)
36#define SELF_ID_MORE_PACKETS(q) (((q) >> 0) & 0x01)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050037
Kristian Høgsberga77754a2007-05-07 20:33:35 -040038#define SELF_ID_EXT_SEQUENCE(q) (((q) >> 20) & 0x07)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050039
40static u32 *count_ports(u32 *sid, int *total_port_count, int *child_port_count)
41{
42 u32 q;
43 int port_type, shift, seq;
44
45 *total_port_count = 0;
46 *child_port_count = 0;
47
48 shift = 6;
49 q = *sid;
50 seq = 0;
51
52 while (1) {
53 port_type = (q >> shift) & 0x03;
54 switch (port_type) {
55 case SELFID_PORT_CHILD:
56 (*child_port_count)++;
57 case SELFID_PORT_PARENT:
58 case SELFID_PORT_NCONN:
59 (*total_port_count)++;
60 case SELFID_PORT_NONE:
61 break;
62 }
63
64 shift -= 2;
65 if (shift == 0) {
Kristian Høgsberga77754a2007-05-07 20:33:35 -040066 if (!SELF_ID_MORE_PACKETS(q))
Kristian Høgsberg3038e352006-12-19 19:58:27 -050067 return sid + 1;
68
69 shift = 16;
70 sid++;
71 q = *sid;
72
Kristian Høgsbergc781c062007-05-07 20:33:32 -040073 /*
74 * Check that the extra packets actually are
Kristian Høgsberg3038e352006-12-19 19:58:27 -050075 * extended self ID packets and that the
76 * sequence numbers in the extended self ID
Kristian Høgsbergc781c062007-05-07 20:33:32 -040077 * packets increase as expected.
78 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -050079
Kristian Høgsberga77754a2007-05-07 20:33:35 -040080 if (!SELF_ID_EXTENDED(q) ||
81 seq != SELF_ID_EXT_SEQUENCE(q))
Kristian Høgsberg3038e352006-12-19 19:58:27 -050082 return NULL;
83
84 seq++;
85 }
86 }
87}
88
89static int get_port_type(u32 *sid, int port_index)
90{
91 int index, shift;
92
93 index = (port_index + 5) / 8;
94 shift = 16 - ((port_index + 5) & 7) * 2;
95 return (sid[index] >> shift) & 0x03;
96}
97
Adrian Bunk95688e92007-01-22 19:17:37 +010098static struct fw_node *fw_node_create(u32 sid, int port_count, int color)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050099{
100 struct fw_node *node;
101
Kristian Høgsberg2d826cc2007-05-09 19:23:14 -0400102 node = kzalloc(sizeof(*node) + port_count * sizeof(node->ports[0]),
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500103 GFP_ATOMIC);
104 if (node == NULL)
105 return NULL;
106
107 node->color = color;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400108 node->node_id = LOCAL_BUS | SELF_ID_PHY_ID(sid);
109 node->link_on = SELF_ID_LINK_ON(sid);
110 node->phy_speed = SELF_ID_PHY_SPEED(sid);
Stefan Richterc9755e12008-03-24 20:54:28 +0100111 node->initiated_reset = SELF_ID_PHY_INITIATOR(sid);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500112 node->port_count = port_count;
113
114 atomic_set(&node->ref_count, 1);
115 INIT_LIST_HEAD(&node->link);
116
117 return node;
118}
119
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400120/*
121 * Compute the maximum hop count for this node and it's children. The
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500122 * maximum hop count is the maximum number of connections between any
123 * two nodes in the subtree rooted at this node. We need this for
124 * setting the gap count. As we build the tree bottom up in
125 * build_tree() below, this is fairly easy to do: for each node we
126 * maintain the max hop count and the max depth, ie the number of hops
127 * to the furthest leaf. Computing the max hop count breaks down into
128 * two cases: either the path goes through this node, in which case
129 * the hop count is the sum of the two biggest child depths plus 2.
130 * Or it could be the case that the max hop path is entirely
131 * containted in a child tree, in which case the max hop count is just
132 * the max hop count of this child.
133 */
134static void update_hop_count(struct fw_node *node)
135{
136 int depths[2] = { -1, -1 };
137 int max_child_hops = 0;
138 int i;
139
140 for (i = 0; i < node->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200141 if (node->ports[i] == NULL)
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500142 continue;
143
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200144 if (node->ports[i]->max_hops > max_child_hops)
145 max_child_hops = node->ports[i]->max_hops;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500146
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200147 if (node->ports[i]->max_depth > depths[0]) {
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500148 depths[1] = depths[0];
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200149 depths[0] = node->ports[i]->max_depth;
150 } else if (node->ports[i]->max_depth > depths[1])
151 depths[1] = node->ports[i]->max_depth;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500152 }
153
154 node->max_depth = depths[0] + 1;
155 node->max_hops = max(max_child_hops, depths[0] + depths[1] + 2);
156}
157
Stefan Richtere5f84f82007-10-07 02:10:11 +0200158static inline struct fw_node *fw_node(struct list_head *l)
159{
160 return list_entry(l, struct fw_node, link);
161}
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500162
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500163/**
164 * build_tree - Build the tree representation of the topology
165 * @self_ids: array of self IDs to create the tree from
166 * @self_id_count: the length of the self_ids array
167 * @local_id: the node ID of the local node
168 *
169 * This function builds the tree representation of the topology given
170 * by the self IDs from the latest bus reset. During the construction
171 * of the tree, the function checks that the self IDs are valid and
Yann Dirsonc1b91ce2007-10-07 02:21:29 +0200172 * internally consistent. On succcess this function returns the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500173 * fw_node corresponding to the local card otherwise NULL.
174 */
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500175static struct fw_node *build_tree(struct fw_card *card,
176 u32 *sid, int self_id_count)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500177{
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500178 struct fw_node *node, *child, *local_node, *irm_node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500179 struct list_head stack, *h;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500180 u32 *next_sid, *end, q;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500181 int i, port_count, child_port_count, phy_id, parent_count, stack_depth;
Stefan Richter24d40122007-06-18 19:44:12 +0200182 int gap_count;
183 bool beta_repeaters_present;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500184
185 local_node = NULL;
186 node = NULL;
187 INIT_LIST_HEAD(&stack);
188 stack_depth = 0;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500189 end = sid + self_id_count;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500190 phy_id = 0;
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500191 irm_node = NULL;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400192 gap_count = SELF_ID_GAP_COUNT(*sid);
Stefan Richter24d40122007-06-18 19:44:12 +0200193 beta_repeaters_present = false;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500194
195 while (sid < end) {
196 next_sid = count_ports(sid, &port_count, &child_port_count);
197
198 if (next_sid == NULL) {
199 fw_error("Inconsistent extended self IDs.\n");
200 return NULL;
201 }
202
203 q = *sid;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400204 if (phy_id != SELF_ID_PHY_ID(q)) {
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500205 fw_error("PHY ID mismatch in self ID: %d != %d.\n",
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400206 phy_id, SELF_ID_PHY_ID(q));
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500207 return NULL;
208 }
209
210 if (child_port_count > stack_depth) {
211 fw_error("Topology stack underflow\n");
212 return NULL;
213 }
214
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400215 /*
216 * Seek back from the top of our stack to find the
217 * start of the child nodes for this node.
218 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500219 for (i = 0, h = &stack; i < child_port_count; i++)
220 h = h->prev;
Yann Dirsonc1b91ce2007-10-07 02:21:29 +0200221 /*
222 * When the stack is empty, this yields an invalid value,
223 * but that pointer will never be dereferenced.
224 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500225 child = fw_node(h);
226
227 node = fw_node_create(q, port_count, card->color);
228 if (node == NULL) {
Stefan Richter8a8cea22007-06-09 19:26:22 +0200229 fw_error("Out of memory while building topology.\n");
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500230 return NULL;
231 }
232
233 if (phy_id == (card->node_id & 0x3f))
234 local_node = node;
235
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400236 if (SELF_ID_CONTENDER(q))
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500237 irm_node = node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500238
239 parent_count = 0;
240
241 for (i = 0; i < port_count; i++) {
242 switch (get_port_type(sid, i)) {
243 case SELFID_PORT_PARENT:
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400244 /*
245 * Who's your daddy? We dont know the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500246 * parent node at this time, so we
247 * temporarily abuse node->color for
248 * remembering the entry in the
249 * node->ports array where the parent
250 * node should be. Later, when we
251 * handle the parent node, we fix up
252 * the reference.
253 */
254 parent_count++;
255 node->color = i;
256 break;
257
258 case SELFID_PORT_CHILD:
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200259 node->ports[i] = child;
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400260 /*
261 * Fix up parent reference for this
262 * child node.
263 */
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200264 child->ports[child->color] = node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500265 child->color = card->color;
266 child = fw_node(child->link.next);
267 break;
268 }
269 }
270
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400271 /*
272 * Check that the node reports exactly one parent
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500273 * port, except for the root, which of course should
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400274 * have no parents.
275 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500276 if ((next_sid == end && parent_count != 0) ||
277 (next_sid < end && parent_count != 1)) {
278 fw_error("Parent port inconsistency for node %d: "
279 "parent_count=%d\n", phy_id, parent_count);
280 return NULL;
281 }
282
283 /* Pop the child nodes off the stack and push the new node. */
284 __list_del(h->prev, &stack);
285 list_add_tail(&node->link, &stack);
286 stack_depth += 1 - child_port_count;
287
Stefan Richter24d40122007-06-18 19:44:12 +0200288 if (node->phy_speed == SCODE_BETA &&
289 parent_count + child_port_count > 1)
290 beta_repeaters_present = true;
291
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400292 /*
Stefan Richter25b1c3d2008-03-24 20:57:12 +0100293 * If PHYs report different gap counts, set an invalid count
294 * which will force a gap count reconfiguration and a reset.
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400295 */
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400296 if (SELF_ID_GAP_COUNT(q) != gap_count)
Stefan Richter25b1c3d2008-03-24 20:57:12 +0100297 gap_count = 0;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500298
299 update_hop_count(node);
300
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500301 sid = next_sid;
302 phy_id++;
303 }
304
305 card->root_node = node;
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500306 card->irm_node = irm_node;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500307 card->gap_count = gap_count;
Stefan Richter24d40122007-06-18 19:44:12 +0200308 card->beta_repeaters_present = beta_repeaters_present;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500309
310 return local_node;
311}
312
Kristian Høgsberga98e2712007-05-07 20:33:34 -0400313typedef void (*fw_node_callback_t)(struct fw_card * card,
314 struct fw_node * node,
315 struct fw_node * parent);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500316
Stefan Richter53dca512008-12-14 21:47:04 +0100317static void for_each_fw_node(struct fw_card *card, struct fw_node *root,
318 fw_node_callback_t callback)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500319{
320 struct list_head list;
321 struct fw_node *node, *next, *child, *parent;
322 int i;
323
324 INIT_LIST_HEAD(&list);
325
326 fw_node_get(root);
327 list_add_tail(&root->link, &list);
328 parent = NULL;
329 list_for_each_entry(node, &list, link) {
330 node->color = card->color;
331
332 for (i = 0; i < node->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200333 child = node->ports[i];
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500334 if (!child)
335 continue;
336 if (child->color == card->color)
337 parent = child;
338 else {
339 fw_node_get(child);
340 list_add_tail(&child->link, &list);
341 }
342 }
343
344 callback(card, node, parent);
345 }
346
347 list_for_each_entry_safe(node, next, &list, link)
348 fw_node_put(node);
349}
350
Stefan Richter53dca512008-12-14 21:47:04 +0100351static void report_lost_node(struct fw_card *card,
352 struct fw_node *node, struct fw_node *parent)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500353{
354 fw_node_event(card, node, FW_NODE_DESTROYED);
355 fw_node_put(node);
Stefan Richterd6f95a32008-11-29 18:56:47 +0100356
357 /* Topology has changed - reset bus manager retry counter */
358 card->bm_retries = 0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500359}
360
Stefan Richter53dca512008-12-14 21:47:04 +0100361static void report_found_node(struct fw_card *card,
362 struct fw_node *node, struct fw_node *parent)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500363{
364 int b_path = (node->phy_speed == SCODE_BETA);
365
366 if (parent != NULL) {
Stefan Richter748086e2007-01-27 16:59:15 +0100367 /* min() macro doesn't work here with gcc 3.4 */
368 node->max_speed = parent->max_speed < node->phy_speed ?
369 parent->max_speed : node->phy_speed;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500370 node->b_path = parent->b_path && b_path;
371 } else {
372 node->max_speed = node->phy_speed;
373 node->b_path = b_path;
374 }
375
376 fw_node_event(card, node, FW_NODE_CREATED);
Stefan Richterd6f95a32008-11-29 18:56:47 +0100377
378 /* Topology has changed - reset bus manager retry counter */
379 card->bm_retries = 0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500380}
381
382void fw_destroy_nodes(struct fw_card *card)
383{
384 unsigned long flags;
385
386 spin_lock_irqsave(&card->lock, flags);
387 card->color++;
388 if (card->local_node != NULL)
389 for_each_fw_node(card, card->local_node, report_lost_node);
Stefan Richter15803472008-02-24 18:57:23 +0100390 card->local_node = NULL;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500391 spin_unlock_irqrestore(&card->lock, flags);
392}
393
394static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)
395{
396 struct fw_node *tree;
397 int i;
398
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200399 tree = node1->ports[port];
400 node0->ports[port] = tree;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500401 for (i = 0; i < tree->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200402 if (tree->ports[i] == node1) {
403 tree->ports[i] = node0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500404 break;
405 }
406 }
407}
408
409/**
410 * update_tree - compare the old topology tree for card with the new
411 * one specified by root. Queue the nodes and mark them as either
412 * found, lost or updated. Update the nodes in the card topology tree
413 * as we go.
414 */
Stefan Richter53dca512008-12-14 21:47:04 +0100415static void update_tree(struct fw_card *card, struct fw_node *root)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500416{
417 struct list_head list0, list1;
Jay Fenlason77e55712008-10-16 18:00:15 -0400418 struct fw_node *node0, *node1, *next1;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500419 int i, event;
420
421 INIT_LIST_HEAD(&list0);
422 list_add_tail(&card->local_node->link, &list0);
423 INIT_LIST_HEAD(&list1);
424 list_add_tail(&root->link, &list1);
425
426 node0 = fw_node(list0.next);
427 node1 = fw_node(list1.next);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500428
429 while (&node0->link != &list0) {
Stefan Richtera2cdebe2008-03-08 22:38:16 +0100430 WARN_ON(node0->port_count != node1->port_count);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500431
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500432 if (node0->link_on && !node1->link_on)
433 event = FW_NODE_LINK_OFF;
434 else if (!node0->link_on && node1->link_on)
435 event = FW_NODE_LINK_ON;
Stefan Richterc9755e12008-03-24 20:54:28 +0100436 else if (node1->initiated_reset && node1->link_on)
437 event = FW_NODE_INITIATED_RESET;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500438 else
439 event = FW_NODE_UPDATED;
440
441 node0->node_id = node1->node_id;
442 node0->color = card->color;
443 node0->link_on = node1->link_on;
444 node0->initiated_reset = node1->initiated_reset;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500445 node0->max_hops = node1->max_hops;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500446 node1->color = card->color;
447 fw_node_event(card, node0, event);
448
449 if (card->root_node == node1)
450 card->root_node = node0;
451 if (card->irm_node == node1)
452 card->irm_node = node0;
453
454 for (i = 0; i < node0->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200455 if (node0->ports[i] && node1->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400456 /*
457 * This port didn't change, queue the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500458 * connected node for further
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400459 * investigation.
460 */
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200461 if (node0->ports[i]->color == card->color)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500462 continue;
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200463 list_add_tail(&node0->ports[i]->link, &list0);
464 list_add_tail(&node1->ports[i]->link, &list1);
465 } else if (node0->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400466 /*
467 * The nodes connected here were
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500468 * unplugged; unref the lost nodes and
469 * queue FW_NODE_LOST callbacks for
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400470 * them.
471 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500472
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_lost_node);
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200475 node0->ports[i] = NULL;
476 } else if (node1->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400477 /*
478 * One or more node were connected to
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500479 * this port. Move the new nodes into
480 * the tree and queue FW_NODE_CREATED
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400481 * callbacks for them.
482 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500483 move_tree(node0, node1, i);
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200484 for_each_fw_node(card, node0->ports[i],
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500485 report_found_node);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500486 }
487 }
488
489 node0 = fw_node(node0->link.next);
Jay Fenlason77e55712008-10-16 18:00:15 -0400490 next1 = fw_node(node1->link.next);
491 fw_node_put(node1);
492 node1 = next1;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500493 }
494}
495
Stefan Richter53dca512008-12-14 21:47:04 +0100496static void update_topology_map(struct fw_card *card,
497 u32 *self_ids, int self_id_count)
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500498{
499 int node_count;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500500
501 card->topology_map[1]++;
502 node_count = (card->root_node->node_id & 0x3f) + 1;
503 card->topology_map[2] = (node_count << 16) | self_id_count;
Kristian Høgsberge1755692007-05-07 20:33:31 -0400504 card->topology_map[0] = (self_id_count + 2) << 16;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500505 memcpy(&card->topology_map[3], self_ids, self_id_count * 4);
Kristian Høgsberge1755692007-05-07 20:33:31 -0400506 fw_compute_block_crc(card->topology_map);
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500507}
508
Stefan Richter53dca512008-12-14 21:47:04 +0100509void fw_core_handle_bus_reset(struct fw_card *card, int node_id, int generation,
510 int self_id_count, u32 *self_ids)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500511{
512 struct fw_node *local_node;
513 unsigned long flags;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500514
Stefan Richtera5c7f472008-03-19 22:02:40 +0100515 /*
516 * If the selfID buffer is not the immediate successor of the
517 * previously processed one, we cannot reliably compare the
518 * old and new topologies.
519 */
Stefan Richter8cd0bbb2008-03-24 20:56:40 +0100520 if (!is_next_generation(generation, card->generation) &&
Stefan Richtera5c7f472008-03-19 22:02:40 +0100521 card->local_node != NULL) {
522 fw_notify("skipped bus generations, destroying all nodes\n");
523 fw_destroy_nodes(card);
524 card->bm_retries = 0;
525 }
526
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500527 spin_lock_irqsave(&card->lock, flags);
528
Stefan Richter7889b602009-03-10 21:09:28 +0100529 card->broadcast_channel_allocated = false;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500530 card->node_id = node_id;
Stefan Richterb5d2a5e2008-01-25 18:57:41 +0100531 /*
532 * Update node_id before generation to prevent anybody from using
533 * a stale node_id together with a current generation.
534 */
535 smp_wmb();
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500536 card->generation = generation;
Kristian Høgsberg931c4832007-01-26 00:38:45 -0500537 card->reset_jiffies = jiffies;
Jay Fenlason0fa1986f2008-11-29 17:44:57 +0100538 fw_schedule_bm_work(card, 0);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500539
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500540 local_node = build_tree(card, self_ids, self_id_count);
541
542 update_topology_map(card, self_ids, self_id_count);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500543
544 card->color++;
545
546 if (local_node == NULL) {
547 fw_error("topology build failed\n");
548 /* FIXME: We need to issue a bus reset in this case. */
549 } else if (card->local_node == NULL) {
550 card->local_node = local_node;
551 for_each_fw_node(card, local_node, report_found_node);
552 } else {
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500553 update_tree(card, local_node);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500554 }
555
556 spin_unlock_irqrestore(&card->lock, flags);
557}
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500558EXPORT_SYMBOL(fw_core_handle_bus_reset);