blob: 93ec64cdeef74d8f931a7056a9354f17a7415019 [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
Stefan Richtere8ca9702009-06-04 21:09:38 +020021#include <linux/bug.h>
Kristian Høgsberg3038e352006-12-19 19:58:27 -050022#include <linux/errno.h>
Stefan Richter77c9a5d2009-06-05 16:26:18 +020023#include <linux/firewire.h>
24#include <linux/firewire-constants.h>
Stefan Richtere8ca9702009-06-04 21:09:38 +020025#include <linux/jiffies.h>
26#include <linux/kernel.h>
27#include <linux/list.h>
28#include <linux/module.h>
29#include <linux/slab.h>
30#include <linux/spinlock.h>
Stefan Richtere8ca9702009-06-04 21:09:38 +020031
32#include <asm/atomic.h>
Stefan Richtercb7c96d2009-10-08 00:42:53 +020033#include <asm/byteorder.h>
Stefan Richterb5d2a5e2008-01-25 18:57:41 +010034#include <asm/system.h>
Stefan Richtere8ca9702009-06-04 21:09:38 +020035
Stefan Richter77c9a5d2009-06-05 16:26:18 +020036#include "core.h"
Kristian Høgsberg3038e352006-12-19 19:58:27 -050037
Kristian Høgsberga77754a2007-05-07 20:33:35 -040038#define SELF_ID_PHY_ID(q) (((q) >> 24) & 0x3f)
39#define SELF_ID_EXTENDED(q) (((q) >> 23) & 0x01)
40#define SELF_ID_LINK_ON(q) (((q) >> 22) & 0x01)
41#define SELF_ID_GAP_COUNT(q) (((q) >> 16) & 0x3f)
42#define SELF_ID_PHY_SPEED(q) (((q) >> 14) & 0x03)
43#define SELF_ID_CONTENDER(q) (((q) >> 11) & 0x01)
44#define SELF_ID_PHY_INITIATOR(q) (((q) >> 1) & 0x01)
45#define SELF_ID_MORE_PACKETS(q) (((q) >> 0) & 0x01)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050046
Kristian Høgsberga77754a2007-05-07 20:33:35 -040047#define SELF_ID_EXT_SEQUENCE(q) (((q) >> 20) & 0x07)
Kristian Høgsberg3038e352006-12-19 19:58:27 -050048
Stefan Richter77c9a5d2009-06-05 16:26:18 +020049#define SELFID_PORT_CHILD 0x3
50#define SELFID_PORT_PARENT 0x2
51#define SELFID_PORT_NCONN 0x1
52#define SELFID_PORT_NONE 0x0
53
Kristian Høgsberg3038e352006-12-19 19:58:27 -050054static u32 *count_ports(u32 *sid, int *total_port_count, int *child_port_count)
55{
56 u32 q;
57 int port_type, shift, seq;
58
59 *total_port_count = 0;
60 *child_port_count = 0;
61
62 shift = 6;
63 q = *sid;
64 seq = 0;
65
66 while (1) {
67 port_type = (q >> shift) & 0x03;
68 switch (port_type) {
69 case SELFID_PORT_CHILD:
70 (*child_port_count)++;
71 case SELFID_PORT_PARENT:
72 case SELFID_PORT_NCONN:
73 (*total_port_count)++;
74 case SELFID_PORT_NONE:
75 break;
76 }
77
78 shift -= 2;
79 if (shift == 0) {
Kristian Høgsberga77754a2007-05-07 20:33:35 -040080 if (!SELF_ID_MORE_PACKETS(q))
Kristian Høgsberg3038e352006-12-19 19:58:27 -050081 return sid + 1;
82
83 shift = 16;
84 sid++;
85 q = *sid;
86
Kristian Høgsbergc781c062007-05-07 20:33:32 -040087 /*
88 * Check that the extra packets actually are
Kristian Høgsberg3038e352006-12-19 19:58:27 -050089 * extended self ID packets and that the
90 * sequence numbers in the extended self ID
Kristian Høgsbergc781c062007-05-07 20:33:32 -040091 * packets increase as expected.
92 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -050093
Kristian Høgsberga77754a2007-05-07 20:33:35 -040094 if (!SELF_ID_EXTENDED(q) ||
95 seq != SELF_ID_EXT_SEQUENCE(q))
Kristian Høgsberg3038e352006-12-19 19:58:27 -050096 return NULL;
97
98 seq++;
99 }
100 }
101}
102
103static int get_port_type(u32 *sid, int port_index)
104{
105 int index, shift;
106
107 index = (port_index + 5) / 8;
108 shift = 16 - ((port_index + 5) & 7) * 2;
109 return (sid[index] >> shift) & 0x03;
110}
111
Adrian Bunk95688e92007-01-22 19:17:37 +0100112static struct fw_node *fw_node_create(u32 sid, int port_count, int color)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500113{
114 struct fw_node *node;
115
Kristian Høgsberg2d826cc2007-05-09 19:23:14 -0400116 node = kzalloc(sizeof(*node) + port_count * sizeof(node->ports[0]),
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500117 GFP_ATOMIC);
118 if (node == NULL)
119 return NULL;
120
121 node->color = color;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400122 node->node_id = LOCAL_BUS | SELF_ID_PHY_ID(sid);
123 node->link_on = SELF_ID_LINK_ON(sid);
124 node->phy_speed = SELF_ID_PHY_SPEED(sid);
Stefan Richterc9755e12008-03-24 20:54:28 +0100125 node->initiated_reset = SELF_ID_PHY_INITIATOR(sid);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500126 node->port_count = port_count;
127
128 atomic_set(&node->ref_count, 1);
129 INIT_LIST_HEAD(&node->link);
130
131 return node;
132}
133
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400134/*
135 * Compute the maximum hop count for this node and it's children. The
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500136 * maximum hop count is the maximum number of connections between any
137 * two nodes in the subtree rooted at this node. We need this for
138 * setting the gap count. As we build the tree bottom up in
139 * build_tree() below, this is fairly easy to do: for each node we
140 * maintain the max hop count and the max depth, ie the number of hops
141 * to the furthest leaf. Computing the max hop count breaks down into
142 * two cases: either the path goes through this node, in which case
143 * the hop count is the sum of the two biggest child depths plus 2.
144 * Or it could be the case that the max hop path is entirely
145 * containted in a child tree, in which case the max hop count is just
146 * the max hop count of this child.
147 */
148static void update_hop_count(struct fw_node *node)
149{
150 int depths[2] = { -1, -1 };
151 int max_child_hops = 0;
152 int i;
153
154 for (i = 0; i < node->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200155 if (node->ports[i] == NULL)
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500156 continue;
157
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200158 if (node->ports[i]->max_hops > max_child_hops)
159 max_child_hops = node->ports[i]->max_hops;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500160
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200161 if (node->ports[i]->max_depth > depths[0]) {
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500162 depths[1] = depths[0];
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200163 depths[0] = node->ports[i]->max_depth;
164 } else if (node->ports[i]->max_depth > depths[1])
165 depths[1] = node->ports[i]->max_depth;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500166 }
167
168 node->max_depth = depths[0] + 1;
169 node->max_hops = max(max_child_hops, depths[0] + depths[1] + 2);
170}
171
Stefan Richtere5f84f82007-10-07 02:10:11 +0200172static inline struct fw_node *fw_node(struct list_head *l)
173{
174 return list_entry(l, struct fw_node, link);
175}
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500176
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500177/**
178 * build_tree - Build the tree representation of the topology
179 * @self_ids: array of self IDs to create the tree from
180 * @self_id_count: the length of the self_ids array
181 * @local_id: the node ID of the local node
182 *
183 * This function builds the tree representation of the topology given
184 * by the self IDs from the latest bus reset. During the construction
185 * of the tree, the function checks that the self IDs are valid and
André Goddard Rosaaf901ca2009-11-14 13:09:05 -0200186 * internally consistent. On success this function returns the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500187 * fw_node corresponding to the local card otherwise NULL.
188 */
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500189static struct fw_node *build_tree(struct fw_card *card,
190 u32 *sid, int self_id_count)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500191{
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500192 struct fw_node *node, *child, *local_node, *irm_node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500193 struct list_head stack, *h;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500194 u32 *next_sid, *end, q;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500195 int i, port_count, child_port_count, phy_id, parent_count, stack_depth;
Stefan Richter24d40122007-06-18 19:44:12 +0200196 int gap_count;
197 bool beta_repeaters_present;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500198
199 local_node = NULL;
200 node = NULL;
201 INIT_LIST_HEAD(&stack);
202 stack_depth = 0;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500203 end = sid + self_id_count;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500204 phy_id = 0;
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500205 irm_node = NULL;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400206 gap_count = SELF_ID_GAP_COUNT(*sid);
Stefan Richter24d40122007-06-18 19:44:12 +0200207 beta_repeaters_present = false;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500208
209 while (sid < end) {
210 next_sid = count_ports(sid, &port_count, &child_port_count);
211
212 if (next_sid == NULL) {
213 fw_error("Inconsistent extended self IDs.\n");
214 return NULL;
215 }
216
217 q = *sid;
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400218 if (phy_id != SELF_ID_PHY_ID(q)) {
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500219 fw_error("PHY ID mismatch in self ID: %d != %d.\n",
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400220 phy_id, SELF_ID_PHY_ID(q));
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500221 return NULL;
222 }
223
224 if (child_port_count > stack_depth) {
225 fw_error("Topology stack underflow\n");
226 return NULL;
227 }
228
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400229 /*
230 * Seek back from the top of our stack to find the
231 * start of the child nodes for this node.
232 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500233 for (i = 0, h = &stack; i < child_port_count; i++)
234 h = h->prev;
Yann Dirsonc1b91ce2007-10-07 02:21:29 +0200235 /*
236 * When the stack is empty, this yields an invalid value,
237 * but that pointer will never be dereferenced.
238 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500239 child = fw_node(h);
240
241 node = fw_node_create(q, port_count, card->color);
242 if (node == NULL) {
Stefan Richter8a8cea22007-06-09 19:26:22 +0200243 fw_error("Out of memory while building topology.\n");
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500244 return NULL;
245 }
246
247 if (phy_id == (card->node_id & 0x3f))
248 local_node = node;
249
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400250 if (SELF_ID_CONTENDER(q))
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500251 irm_node = node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500252
253 parent_count = 0;
254
255 for (i = 0; i < port_count; i++) {
256 switch (get_port_type(sid, i)) {
257 case SELFID_PORT_PARENT:
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400258 /*
259 * Who's your daddy? We dont know the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500260 * parent node at this time, so we
261 * temporarily abuse node->color for
262 * remembering the entry in the
263 * node->ports array where the parent
264 * node should be. Later, when we
265 * handle the parent node, we fix up
266 * the reference.
267 */
268 parent_count++;
269 node->color = i;
270 break;
271
272 case SELFID_PORT_CHILD:
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200273 node->ports[i] = child;
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400274 /*
275 * Fix up parent reference for this
276 * child node.
277 */
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200278 child->ports[child->color] = node;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500279 child->color = card->color;
280 child = fw_node(child->link.next);
281 break;
282 }
283 }
284
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400285 /*
286 * Check that the node reports exactly one parent
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500287 * port, except for the root, which of course should
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400288 * have no parents.
289 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500290 if ((next_sid == end && parent_count != 0) ||
291 (next_sid < end && parent_count != 1)) {
292 fw_error("Parent port inconsistency for node %d: "
293 "parent_count=%d\n", phy_id, parent_count);
294 return NULL;
295 }
296
297 /* Pop the child nodes off the stack and push the new node. */
298 __list_del(h->prev, &stack);
299 list_add_tail(&node->link, &stack);
300 stack_depth += 1 - child_port_count;
301
Stefan Richter24d40122007-06-18 19:44:12 +0200302 if (node->phy_speed == SCODE_BETA &&
303 parent_count + child_port_count > 1)
304 beta_repeaters_present = true;
305
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400306 /*
Stefan Richter25b1c3d2008-03-24 20:57:12 +0100307 * If PHYs report different gap counts, set an invalid count
308 * which will force a gap count reconfiguration and a reset.
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400309 */
Kristian Høgsberga77754a2007-05-07 20:33:35 -0400310 if (SELF_ID_GAP_COUNT(q) != gap_count)
Stefan Richter25b1c3d2008-03-24 20:57:12 +0100311 gap_count = 0;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500312
313 update_hop_count(node);
314
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500315 sid = next_sid;
316 phy_id++;
317 }
318
319 card->root_node = node;
Kristian Høgsberg93e4fd42007-03-27 09:42:39 -0500320 card->irm_node = irm_node;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500321 card->gap_count = gap_count;
Stefan Richter24d40122007-06-18 19:44:12 +0200322 card->beta_repeaters_present = beta_repeaters_present;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500323
324 return local_node;
325}
326
Kristian Høgsberga98e2712007-05-07 20:33:34 -0400327typedef void (*fw_node_callback_t)(struct fw_card * card,
328 struct fw_node * node,
329 struct fw_node * parent);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500330
Stefan Richter53dca512008-12-14 21:47:04 +0100331static void for_each_fw_node(struct fw_card *card, struct fw_node *root,
332 fw_node_callback_t callback)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500333{
334 struct list_head list;
335 struct fw_node *node, *next, *child, *parent;
336 int i;
337
338 INIT_LIST_HEAD(&list);
339
340 fw_node_get(root);
341 list_add_tail(&root->link, &list);
342 parent = NULL;
343 list_for_each_entry(node, &list, link) {
344 node->color = card->color;
345
346 for (i = 0; i < node->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200347 child = node->ports[i];
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500348 if (!child)
349 continue;
350 if (child->color == card->color)
351 parent = child;
352 else {
353 fw_node_get(child);
354 list_add_tail(&child->link, &list);
355 }
356 }
357
358 callback(card, node, parent);
359 }
360
361 list_for_each_entry_safe(node, next, &list, link)
362 fw_node_put(node);
363}
364
Stefan Richter53dca512008-12-14 21:47:04 +0100365static void report_lost_node(struct fw_card *card,
366 struct fw_node *node, struct fw_node *parent)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500367{
368 fw_node_event(card, node, FW_NODE_DESTROYED);
369 fw_node_put(node);
Stefan Richterd6f95a32008-11-29 18:56:47 +0100370
371 /* Topology has changed - reset bus manager retry counter */
372 card->bm_retries = 0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500373}
374
Stefan Richter53dca512008-12-14 21:47:04 +0100375static void report_found_node(struct fw_card *card,
376 struct fw_node *node, struct fw_node *parent)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500377{
378 int b_path = (node->phy_speed == SCODE_BETA);
379
380 if (parent != NULL) {
Stefan Richter748086e2007-01-27 16:59:15 +0100381 /* min() macro doesn't work here with gcc 3.4 */
382 node->max_speed = parent->max_speed < node->phy_speed ?
383 parent->max_speed : node->phy_speed;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500384 node->b_path = parent->b_path && b_path;
385 } else {
386 node->max_speed = node->phy_speed;
387 node->b_path = b_path;
388 }
389
390 fw_node_event(card, node, FW_NODE_CREATED);
Stefan Richterd6f95a32008-11-29 18:56:47 +0100391
392 /* Topology has changed - reset bus manager retry counter */
393 card->bm_retries = 0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500394}
395
396void fw_destroy_nodes(struct fw_card *card)
397{
398 unsigned long flags;
399
400 spin_lock_irqsave(&card->lock, flags);
401 card->color++;
402 if (card->local_node != NULL)
403 for_each_fw_node(card, card->local_node, report_lost_node);
Stefan Richter15803472008-02-24 18:57:23 +0100404 card->local_node = NULL;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500405 spin_unlock_irqrestore(&card->lock, flags);
406}
407
408static void move_tree(struct fw_node *node0, struct fw_node *node1, int port)
409{
410 struct fw_node *tree;
411 int i;
412
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200413 tree = node1->ports[port];
414 node0->ports[port] = tree;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500415 for (i = 0; i < tree->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200416 if (tree->ports[i] == node1) {
417 tree->ports[i] = node0;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500418 break;
419 }
420 }
421}
422
423/**
424 * update_tree - compare the old topology tree for card with the new
425 * one specified by root. Queue the nodes and mark them as either
426 * found, lost or updated. Update the nodes in the card topology tree
427 * as we go.
428 */
Stefan Richter53dca512008-12-14 21:47:04 +0100429static void update_tree(struct fw_card *card, struct fw_node *root)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500430{
431 struct list_head list0, list1;
Jay Fenlason77e55712008-10-16 18:00:15 -0400432 struct fw_node *node0, *node1, *next1;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500433 int i, event;
434
435 INIT_LIST_HEAD(&list0);
436 list_add_tail(&card->local_node->link, &list0);
437 INIT_LIST_HEAD(&list1);
438 list_add_tail(&root->link, &list1);
439
440 node0 = fw_node(list0.next);
441 node1 = fw_node(list1.next);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500442
443 while (&node0->link != &list0) {
Stefan Richtera2cdebe2008-03-08 22:38:16 +0100444 WARN_ON(node0->port_count != node1->port_count);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500445
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500446 if (node0->link_on && !node1->link_on)
447 event = FW_NODE_LINK_OFF;
448 else if (!node0->link_on && node1->link_on)
449 event = FW_NODE_LINK_ON;
Stefan Richterc9755e12008-03-24 20:54:28 +0100450 else if (node1->initiated_reset && node1->link_on)
451 event = FW_NODE_INITIATED_RESET;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500452 else
453 event = FW_NODE_UPDATED;
454
455 node0->node_id = node1->node_id;
456 node0->color = card->color;
457 node0->link_on = node1->link_on;
458 node0->initiated_reset = node1->initiated_reset;
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500459 node0->max_hops = node1->max_hops;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500460 node1->color = card->color;
461 fw_node_event(card, node0, event);
462
463 if (card->root_node == node1)
464 card->root_node = node0;
465 if (card->irm_node == node1)
466 card->irm_node = node0;
467
468 for (i = 0; i < node0->port_count; i++) {
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200469 if (node0->ports[i] && node1->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400470 /*
471 * This port didn't change, queue the
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500472 * connected node for further
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400473 * investigation.
474 */
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200475 if (node0->ports[i]->color == card->color)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500476 continue;
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200477 list_add_tail(&node0->ports[i]->link, &list0);
478 list_add_tail(&node1->ports[i]->link, &list1);
479 } else if (node0->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400480 /*
481 * The nodes connected here were
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500482 * unplugged; unref the lost nodes and
483 * queue FW_NODE_LOST callbacks for
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400484 * them.
485 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500486
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200487 for_each_fw_node(card, node0->ports[i],
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500488 report_lost_node);
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200489 node0->ports[i] = NULL;
490 } else if (node1->ports[i]) {
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400491 /*
492 * One or more node were connected to
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500493 * this port. Move the new nodes into
494 * the tree and queue FW_NODE_CREATED
Kristian Høgsbergc781c062007-05-07 20:33:32 -0400495 * callbacks for them.
496 */
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500497 move_tree(node0, node1, i);
Stefan Richterdae1a3a2007-06-17 23:39:58 +0200498 for_each_fw_node(card, node0->ports[i],
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500499 report_found_node);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500500 }
501 }
502
503 node0 = fw_node(node0->link.next);
Jay Fenlason77e55712008-10-16 18:00:15 -0400504 next1 = fw_node(node1->link.next);
505 fw_node_put(node1);
506 node1 = next1;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500507 }
508}
509
Stefan Richter53dca512008-12-14 21:47:04 +0100510static void update_topology_map(struct fw_card *card,
511 u32 *self_ids, int self_id_count)
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500512{
Stefan Richtercb7c96d2009-10-08 00:42:53 +0200513 int node_count = (card->root_node->node_id & 0x3f) + 1;
514 __be32 *map = card->topology_map;
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500515
Stefan Richtercb7c96d2009-10-08 00:42:53 +0200516 *map++ = cpu_to_be32((self_id_count + 2) << 16);
517 *map++ = cpu_to_be32(be32_to_cpu(card->topology_map[1]) + 1);
518 *map++ = cpu_to_be32((node_count << 16) | self_id_count);
519
520 while (self_id_count--)
521 *map++ = cpu_to_be32p(self_ids++);
522
Kristian Høgsberge1755692007-05-07 20:33:31 -0400523 fw_compute_block_crc(card->topology_map);
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500524}
525
Stefan Richter53dca512008-12-14 21:47:04 +0100526void fw_core_handle_bus_reset(struct fw_card *card, int node_id, int generation,
527 int self_id_count, u32 *self_ids)
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500528{
529 struct fw_node *local_node;
530 unsigned long flags;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500531
Stefan Richtera5c7f472008-03-19 22:02:40 +0100532 /*
533 * If the selfID buffer is not the immediate successor of the
534 * previously processed one, we cannot reliably compare the
535 * old and new topologies.
536 */
Stefan Richter8cd0bbb2008-03-24 20:56:40 +0100537 if (!is_next_generation(generation, card->generation) &&
Stefan Richtera5c7f472008-03-19 22:02:40 +0100538 card->local_node != NULL) {
539 fw_notify("skipped bus generations, destroying all nodes\n");
540 fw_destroy_nodes(card);
541 card->bm_retries = 0;
542 }
543
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500544 spin_lock_irqsave(&card->lock, flags);
545
Stefan Richter7889b602009-03-10 21:09:28 +0100546 card->broadcast_channel_allocated = false;
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500547 card->node_id = node_id;
Stefan Richterb5d2a5e2008-01-25 18:57:41 +0100548 /*
549 * Update node_id before generation to prevent anybody from using
550 * a stale node_id together with a current generation.
551 */
552 smp_wmb();
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500553 card->generation = generation;
Kristian Høgsberg931c4832007-01-26 00:38:45 -0500554 card->reset_jiffies = jiffies;
Jay Fenlason0fa1986f2008-11-29 17:44:57 +0100555 fw_schedule_bm_work(card, 0);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500556
Kristian Høgsberg473d28c2007-03-07 12:12:55 -0500557 local_node = build_tree(card, self_ids, self_id_count);
558
559 update_topology_map(card, self_ids, self_id_count);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500560
561 card->color++;
562
563 if (local_node == NULL) {
564 fw_error("topology build failed\n");
565 /* FIXME: We need to issue a bus reset in this case. */
566 } else if (card->local_node == NULL) {
567 card->local_node = local_node;
568 for_each_fw_node(card, local_node, report_found_node);
569 } else {
Kristian Høgsberg83db8012007-01-26 00:37:50 -0500570 update_tree(card, local_node);
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500571 }
572
573 spin_unlock_irqrestore(&card->lock, flags);
574}
Kristian Høgsberg3038e352006-12-19 19:58:27 -0500575EXPORT_SYMBOL(fw_core_handle_bus_reset);