71                         assert(node->prev->next == node);  in bus_match_node_free()
72                         node->prev->next = node->next;  in bus_match_node_free()
75                         node->parent->child = node->next;  in bus_match_node_free()
78                 if (node->next)  in bus_match_node_free()
79                         node->next->prev = node->prev;  in bus_match_node_free()
294                                 return bus_match_run(bus, node->next, m);  in bus_match_run()
329                 return bus_match_run(bus, node->next, m);  in bus_match_run()
407                 for (struct bus_match_node *c = node->child; c; c = c->next) {  in bus_match_run()
423         return bus_match_run(bus, node->next, m);  in bus_match_run()
441         for (c = where->child; c && c->type != t; c = c->next)  in bus_match_add_compare_value()
452 …                  for (n = c->child; n && !value_node_same(n, t, value_u8, value_str); n = n->next)  in bus_match_add_compare_value()
470                 c->next = where->child;  in bus_match_add_compare_value()
471                 if (c->next)  in bus_match_add_compare_value()
472                         c->next->prev = c;  in bus_match_add_compare_value()
517                 n->next = c->child;  in bus_match_add_compare_value()
518                 if (n->next)  in bus_match_add_compare_value()
519                         n->next->prev = n;  in bus_match_add_compare_value()
554         n->next = where->child;  in bus_match_add_leaf()
555         if (n->next)  in bus_match_add_leaf()
556                 n->next->prev = n;  in bus_match_add_leaf()
1037         for (struct bus_match_node *c = node->child; c; c = c->next)  in bus_match_dump()