Lines Matching defs:node
410 RB_CLEAR_NODE(&label->node);
608 rb_erase(&label->node, &ls->root);
643 rb_replace_node(&old->node, &new->node, &ls->root);
676 /* Figure out where to put new node */
679 struct aa_label *this = rb_entry(*new, struct aa_label, node);
702 /* Add new node and rebalance tree. */
703 rb_link_node(&label->node, parent, new);
704 rb_insert_color(&label->node, &ls->root);
724 struct rb_node *node;
730 node = vec_labelset(vec, n)->root.rb_node;
731 while (node) {
732 struct aa_label *this = rb_entry(node, struct aa_label, node);
736 node = node->rb_left;
738 node = node->rb_right;
1145 struct rb_node *node;
1154 node = ls->root.rb_node;
1155 while (node) {
1156 struct aa_label *this = container_of(node, struct aa_label,
1157 node);
1161 node = node->rb_left;
1163 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);