Lines Matching refs:node
18 struct rb_node node;
38 struct rb_node *node = root->rb_node;
40 while (node) {
41 struct badblock *bblk = rb_entry(node, struct badblock, node);
44 node = node->rb_left;
46 node = node->rb_right;
62 bblk = rb_entry(parent, struct badblock, node);
72 rb_link_node(&new->node, parent, link);
73 rb_insert_color(&new->node, root);
95 rb_erase(&bblock->node, &dd->badblocklist);
195 rb_erase(&bblk->node, &dd->badblocklist);
243 struct rb_node *node = NULL, *nnode = NULL;
252 node = nnode;
253 nnode = rb_next(node);
254 rb_erase(node, tree);
256 kfree(node);
292 struct rb_node *node;
299 for (node = rb_first(&badblocklist); node; node = rb_next(node)) {
300 bblk = rb_entry(node, struct badblock, node);