|
@@ -166,7 +166,7 @@ static inline struct fw_node *fw_node(struct list_head *l)
|
|
* This function builds the tree representation of the topology given
|
|
* This function builds the tree representation of the topology given
|
|
* by the self IDs from the latest bus reset. During the construction
|
|
* by the self IDs from the latest bus reset. During the construction
|
|
* of the tree, the function checks that the self IDs are valid and
|
|
* of the tree, the function checks that the self IDs are valid and
|
|
- * internally consistent. On succcess this funtions returns the
|
|
|
|
|
|
+ * internally consistent. On succcess this function returns the
|
|
* fw_node corresponding to the local card otherwise NULL.
|
|
* fw_node corresponding to the local card otherwise NULL.
|
|
*/
|
|
*/
|
|
static struct fw_node *build_tree(struct fw_card *card,
|
|
static struct fw_node *build_tree(struct fw_card *card,
|
|
@@ -215,6 +215,10 @@ static struct fw_node *build_tree(struct fw_card *card,
|
|
*/
|
|
*/
|
|
for (i = 0, h = &stack; i < child_port_count; i++)
|
|
for (i = 0, h = &stack; i < child_port_count; i++)
|
|
h = h->prev;
|
|
h = h->prev;
|
|
|
|
+ /*
|
|
|
|
+ * When the stack is empty, this yields an invalid value,
|
|
|
|
+ * but that pointer will never be dereferenced.
|
|
|
|
+ */
|
|
child = fw_node(h);
|
|
child = fw_node(h);
|
|
|
|
|
|
node = fw_node_create(q, port_count, card->color);
|
|
node = fw_node_create(q, port_count, card->color);
|