60 static void bus_match_node_free(struct bus_match_node *node) {  in bus_match_node_free()
102 static bool bus_match_node_maybe_free(struct bus_match_node *node) {  in bus_match_node_maybe_free()
119                 struct bus_match_node *node,  in value_node_test()
203                 struct bus_match_node *node,  in value_node_same()
239                 struct bus_match_node *node,  in bus_match_run()
378                 struct bus_match_node *found;  in bus_match_run()
407                 for (struct bus_match_node *c = node->child; c; c = c->next) {  in bus_match_run()
427                 struct bus_match_node *where,  in bus_match_add_compare_value()
431                 struct bus_match_node **ret) {  in bus_match_add_compare_value()
433         struct bus_match_node *c, *n = NULL;  in bus_match_add_compare_value()
462                 c = new0(struct bus_match_node, 1);  in bus_match_add_compare_value()
490         n = new0(struct bus_match_node, 1);  in bus_match_add_compare_value()
539                 struct bus_match_node *where,  in bus_match_add_leaf()
542         struct bus_match_node *n;  in bus_match_add_leaf()
548         n = new0(struct bus_match_node, 1);  in bus_match_add_leaf()
883                 struct bus_match_node *root,  in bus_match_add()
907                 struct bus_match_node *root,  in bus_match_remove()
910         struct bus_match_node *node, *pp;  in bus_match_remove()
939 void bus_match_free(struct bus_match_node *node) {  in bus_match_free()
940         struct bus_match_node *c;  in bus_match_free()
1010 void bus_match_dump(FILE *out, struct bus_match_node *node, unsigned level) {  in bus_match_dump()
1032                 struct bus_match_node *c;  in bus_match_dump()
1037         for (struct bus_match_node *c = node->child; c; c = c->next)  in bus_match_dump()