Lines Matching defs:node
407 RB_CLEAR_NODE(&label->node);
606 rb_erase(&label->node, &ls->root);
641 rb_replace_node(&old->node, &new->node, &ls->root);
674 /* Figure out where to put new node */
677 struct aa_label *this = rb_entry(*new, struct aa_label, node);
700 /* Add new node and rebalance tree. */
701 rb_link_node(&label->node, parent, new);
702 rb_insert_color(&label->node, &ls->root);
722 struct rb_node *node;
728 node = vec_labelset(vec, n)->root.rb_node;
729 while (node) {
730 struct aa_label *this = rb_entry(node, struct aa_label, node);
734 node = node->rb_left;
736 node = node->rb_right;
1144 struct rb_node *node;
1153 node = ls->root.rb_node;
1154 while (node) {
1155 struct aa_label *this = container_of(node, struct aa_label,
1156 node);
1160 node = node->rb_left;
1162 node = node->rb_right;
1983 struct rb_node *node;
1989 for (node = rb_first(&ls->root); node; node = rb_first(&ls->root)) {
1990 struct aa_label *this = rb_entry(node, struct aa_label, node);
2015 struct rb_node *node;
2022 __labelset_for_each(ls, node) {
2023 label = rb_entry(node, struct aa_label, node);