diff options
author | Stefan Richter <stefanr@s5r6.in-berlin.de> | 2007-06-17 17:39:58 -0400 |
---|---|---|
committer | Stefan Richter <stefanr@s5r6.in-berlin.de> | 2007-07-09 18:07:44 -0400 |
commit | dae1a3aa8ebdd30fbba56a8d4e22f92455fb0861 (patch) | |
tree | 4c2ce5c4943a41545f30eed31f3498b659056afc /drivers/firewire/fw-topology.c | |
parent | f1397490017e337446c6a8b0562b584679a604a6 (diff) |
firewire: simplify a struct type
cleanup after "firewire: support S100B...S400B and link slower than PHY"
Signed-off-by: Stefan Richter <stefanr@s5r6.in-berlin.de>
Signed-off-by: Kristian Høgsberg <krh@redhat.com>
Diffstat (limited to 'drivers/firewire/fw-topology.c')
-rw-r--r-- | drivers/firewire/fw-topology.c | 48 |
1 files changed, 23 insertions, 25 deletions
diff --git a/drivers/firewire/fw-topology.c b/drivers/firewire/fw-topology.c index 77e3f8276007..39e5cd12aa52 100644 --- a/drivers/firewire/fw-topology.c +++ b/drivers/firewire/fw-topology.c | |||
@@ -135,17 +135,17 @@ static void update_hop_count(struct fw_node *node) | |||
135 | int i; | 135 | int i; |
136 | 136 | ||
137 | for (i = 0; i < node->port_count; i++) { | 137 | for (i = 0; i < node->port_count; i++) { |
138 | if (node->ports[i].node == NULL) | 138 | if (node->ports[i] == NULL) |
139 | continue; | 139 | continue; |
140 | 140 | ||
141 | if (node->ports[i].node->max_hops > max_child_hops) | 141 | if (node->ports[i]->max_hops > max_child_hops) |
142 | max_child_hops = node->ports[i].node->max_hops; | 142 | max_child_hops = node->ports[i]->max_hops; |
143 | 143 | ||
144 | if (node->ports[i].node->max_depth > depths[0]) { | 144 | if (node->ports[i]->max_depth > depths[0]) { |
145 | depths[1] = depths[0]; | 145 | depths[1] = depths[0]; |
146 | depths[0] = node->ports[i].node->max_depth; | 146 | depths[0] = node->ports[i]->max_depth; |
147 | } else if (node->ports[i].node->max_depth > depths[1]) | 147 | } else if (node->ports[i]->max_depth > depths[1]) |
148 | depths[1] = node->ports[i].node->max_depth; | 148 | depths[1] = node->ports[i]->max_depth; |
149 | } | 149 | } |
150 | 150 | ||
151 | node->max_depth = depths[0] + 1; | 151 | node->max_depth = depths[0] + 1; |
@@ -245,12 +245,12 @@ static struct fw_node *build_tree(struct fw_card *card, | |||
245 | break; | 245 | break; |
246 | 246 | ||
247 | case SELFID_PORT_CHILD: | 247 | case SELFID_PORT_CHILD: |
248 | node->ports[i].node = child; | 248 | node->ports[i] = child; |
249 | /* | 249 | /* |
250 | * Fix up parent reference for this | 250 | * Fix up parent reference for this |
251 | * child node. | 251 | * child node. |
252 | */ | 252 | */ |
253 | child->ports[child->color].node = node; | 253 | child->ports[child->color] = node; |
254 | child->color = card->color; | 254 | child->color = card->color; |
255 | child = fw_node(child->link.next); | 255 | child = fw_node(child->link.next); |
256 | break; | 256 | break; |
@@ -321,7 +321,7 @@ for_each_fw_node(struct fw_card *card, struct fw_node *root, | |||
321 | node->color = card->color; | 321 | node->color = card->color; |
322 | 322 | ||
323 | for (i = 0; i < node->port_count; i++) { | 323 | for (i = 0; i < node->port_count; i++) { |
324 | child = node->ports[i].node; | 324 | child = node->ports[i]; |
325 | if (!child) | 325 | if (!child) |
326 | continue; | 326 | continue; |
327 | if (child->color == card->color) | 327 | if (child->color == card->color) |
@@ -382,11 +382,11 @@ static void move_tree(struct fw_node *node0, struct fw_node *node1, int port) | |||
382 | struct fw_node *tree; | 382 | struct fw_node *tree; |
383 | int i; | 383 | int i; |
384 | 384 | ||
385 | tree = node1->ports[port].node; | 385 | tree = node1->ports[port]; |
386 | node0->ports[port].node = tree; | 386 | node0->ports[port] = tree; |
387 | for (i = 0; i < tree->port_count; i++) { | 387 | for (i = 0; i < tree->port_count; i++) { |
388 | if (tree->ports[i].node == node1) { | 388 | if (tree->ports[i] == node1) { |
389 | tree->ports[i].node = node0; | 389 | tree->ports[i] = node0; |
390 | break; | 390 | break; |
391 | } | 391 | } |
392 | } | 392 | } |
@@ -437,19 +437,17 @@ update_tree(struct fw_card *card, struct fw_node *root) | |||
437 | card->irm_node = node0; | 437 | card->irm_node = node0; |
438 | 438 | ||
439 | for (i = 0; i < node0->port_count; i++) { | 439 | for (i = 0; i < node0->port_count; i++) { |
440 | if (node0->ports[i].node && node1->ports[i].node) { | 440 | if (node0->ports[i] && node1->ports[i]) { |
441 | /* | 441 | /* |
442 | * This port didn't change, queue the | 442 | * This port didn't change, queue the |
443 | * connected node for further | 443 | * connected node for further |
444 | * investigation. | 444 | * investigation. |
445 | */ | 445 | */ |
446 | if (node0->ports[i].node->color == card->color) | 446 | if (node0->ports[i]->color == card->color) |
447 | continue; | 447 | continue; |
448 | list_add_tail(&node0->ports[i].node->link, | 448 | list_add_tail(&node0->ports[i]->link, &list0); |
449 | &list0); | 449 | list_add_tail(&node1->ports[i]->link, &list1); |
450 | list_add_tail(&node1->ports[i].node->link, | 450 | } else if (node0->ports[i]) { |
451 | &list1); | ||
452 | } else if (node0->ports[i].node) { | ||
453 | /* | 451 | /* |
454 | * The nodes connected here were | 452 | * The nodes connected here were |
455 | * unplugged; unref the lost nodes and | 453 | * unplugged; unref the lost nodes and |
@@ -457,10 +455,10 @@ update_tree(struct fw_card *card, struct fw_node *root) | |||
457 | * them. | 455 | * them. |
458 | */ | 456 | */ |
459 | 457 | ||
460 | for_each_fw_node(card, node0->ports[i].node, | 458 | for_each_fw_node(card, node0->ports[i], |
461 | report_lost_node); | 459 | report_lost_node); |
462 | node0->ports[i].node = NULL; | 460 | node0->ports[i] = NULL; |
463 | } else if (node1->ports[i].node) { | 461 | } else if (node1->ports[i]) { |
464 | /* | 462 | /* |
465 | * One or more node were connected to | 463 | * One or more node were connected to |
466 | * this port. Move the new nodes into | 464 | * this port. Move the new nodes into |
@@ -468,7 +466,7 @@ update_tree(struct fw_card *card, struct fw_node *root) | |||
468 | * callbacks for them. | 466 | * callbacks for them. |
469 | */ | 467 | */ |
470 | move_tree(node0, node1, i); | 468 | move_tree(node0, node1, i); |
471 | for_each_fw_node(card, node0->ports[i].node, | 469 | for_each_fw_node(card, node0->ports[i], |
472 | report_found_node); | 470 | report_found_node); |
473 | } | 471 | } |
474 | } | 472 | } |