63         assert(!node->child);  in bus_match_node_free()
67         if (node->parent->child) {  in bus_match_node_free()
74                         assert(node->parent->child == node);  in bus_match_node_free()
75                         node->parent->child = node->next;  in bus_match_node_free()
108         if (node->child)  in bus_match_node_maybe_free()
270                 return bus_match_run(bus, node->child, m);  in bus_match_run()
279                 assert(node->child);  in bus_match_run()
280                 return bus_match_run(bus, node->child, m);  in bus_match_run()
407                 for (struct bus_match_node *c = node->child; c; c = c->next) {  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()
473                 where->child = c;  in bus_match_add_compare_value()
517                 n->next = c->child;  in bus_match_add_compare_value()
520                 c->child = n;  in bus_match_add_compare_value()
554         n->next = where->child;  in bus_match_add_leaf()
561         where->child = n;  in bus_match_add_leaf()
953         while ((c = node->child))  in bus_match_free()
1037         for (struct bus_match_node *c = node->child; c; c = c->next)  in bus_match_dump()