Lines Matching defs:rb_node

97 			struct rb_node rb_node;
118 			struct rb_node rb_node;
309 	struct rb_node *rb_node;
315 	rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr);
316 	if (rb_node) {
317 		node = rb_entry(rb_node, struct mapping_node, rb_node);
384 			rb_erase(&cur->rb_node, &cache->rb_root);
482 	struct rb_node *rb_node;
494 	rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, &node->simple_node);
496 	if (rb_node) {
514 	struct rb_node *rb_node;
521 		rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
523 		if (rb_node) {
524 			node = rb_entry(rb_node, struct mapping_node, rb_node);
525 			rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
526 			RB_CLEAR_NODE(&node->rb_node);
557 	struct rb_node *rb_node;
562 	rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
564 	if (rb_node) {
565 		node = rb_entry(rb_node, struct mapping_node, rb_node);
566 		rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
576 	rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, &node->simple_node);
578 	if (rb_node)
1917 	struct rb_node *rb_node;
1918 	while ((rb_node = rb_first(blocks))) {
1919 		block = rb_entry(rb_node, struct tree_block, rb_node);
1920 		rb_erase(rb_node, blocks);
2606 	rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2614 	rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
2623 	rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {
3046 	struct rb_node *rb_node;
3126 	rb_node = rb_simple_insert(blocks, &block->simple_node);
3127 	if (rb_node)
3827 			&rc->reloc_root_tree.rb_root, rb_node)