Lines Matching refs:rb_node
213 struct rb_node *node; in ext4_es_print_tree()
220 es = rb_entry(node, struct extent_status, rb_node); in ext4_es_print_tree()
245 struct rb_node *node = root->rb_node; in __es_tree_search()
249 es = rb_entry(node, struct extent_status, rb_node); in __es_tree_search()
262 node = rb_next(&es->rb_node); in __es_tree_search()
263 return node ? rb_entry(node, struct extent_status, rb_node) : in __es_tree_search()
295 struct rb_node *node; in __es_find_extent_range()
316 while ((node = rb_next(&es1->rb_node)) != NULL) { in __es_find_extent_range()
317 es1 = rb_entry(node, struct extent_status, rb_node); in __es_find_extent_range()
604 struct rb_node *node; in ext4_es_try_to_merge_left()
606 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left()
610 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_try_to_merge_left()
615 rb_erase(&es->rb_node, &tree->root); in ext4_es_try_to_merge_left()
628 struct rb_node *node; in ext4_es_try_to_merge_right()
630 node = rb_next(&es->rb_node); in ext4_es_try_to_merge_right()
634 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_try_to_merge_right()
822 struct rb_node **p = &tree->root.rb_node; in __es_insert_extent()
823 struct rb_node *parent = NULL; in __es_insert_extent()
828 es = rb_entry(parent, struct extent_status, rb_node); in __es_insert_extent()
868 rb_link_node(&es->rb_node, parent, p); in __es_insert_extent()
869 rb_insert_color(&es->rb_node, &tree->root); in __es_insert_extent()
1036 struct rb_node *node; in ext4_es_lookup_extent()
1058 node = tree->root.rb_node; in ext4_es_lookup_extent()
1060 es1 = rb_entry(node, struct extent_status, rb_node); in ext4_es_lookup_extent()
1082 node = rb_next(&es1->rb_node); in ext4_es_lookup_extent()
1085 rb_node); in ext4_es_lookup_extent()
1125 struct rb_node *node; in init_rsvd()
1140 node = rb_prev(&es->rb_node); in init_rsvd()
1143 rb_node) : NULL; in init_rsvd()
1247 struct rb_node *node = root->rb_node; in __pr_tree_search()
1251 pr = rb_entry(node, struct pending_reservation, rb_node); in __pr_tree_search()
1262 node = rb_next(&pr->rb_node); in __pr_tree_search()
1264 rb_node) : NULL; in __pr_tree_search()
1291 struct rb_node *node; in get_rsvd()
1322 node = rb_prev(&es->rb_node); in get_rsvd()
1325 es = rb_entry(node, struct extent_status, rb_node); in get_rsvd()
1331 node = rb_next(&right_es->rb_node); in get_rsvd()
1333 rb_node) : NULL; in get_rsvd()
1342 node = rb_next(&es->rb_node); in get_rsvd()
1346 rb_node); in get_rsvd()
1385 node = rb_next(&pr->rb_node); in get_rsvd()
1386 rb_erase(&pr->rb_node, &tree->root); in get_rsvd()
1391 rb_node); in get_rsvd()
1418 struct rb_node *node; in __es_remove_extent()
1490 node = rb_next(&es->rb_node); in __es_remove_extent()
1492 es = rb_entry(node, struct extent_status, rb_node); in __es_remove_extent()
1500 node = rb_next(&es->rb_node); in __es_remove_extent()
1501 rb_erase(&es->rb_node, &tree->root); in __es_remove_extent()
1507 es = rb_entry(node, struct extent_status, rb_node); in __es_remove_extent()
1821 struct rb_node *node; in es_do_reclaim_extents()
1834 node = rb_next(&es->rb_node); in es_do_reclaim_extents()
1843 rb_erase(&es->rb_node, &tree->root); in es_do_reclaim_extents()
1849 es = rb_entry(node, struct extent_status, rb_node); in es_do_reclaim_extents()
1891 struct rb_node *node; in ext4_clear_inode_es()
1898 es = rb_entry(node, struct extent_status, rb_node); in ext4_clear_inode_es()
1901 rb_erase(&es->rb_node, &tree->root); in ext4_clear_inode_es()
1913 struct rb_node *node; in ext4_print_pending_tree()
1920 pr = rb_entry(node, struct pending_reservation, rb_node); in ext4_print_pending_tree()
1961 struct rb_node *node; in __get_pending()
1965 node = (&tree->root)->rb_node; in __get_pending()
1968 pr = rb_entry(node, struct pending_reservation, rb_node); in __get_pending()
1995 struct rb_node **p = &tree->root.rb_node; in __insert_pending()
1996 struct rb_node *parent = NULL; in __insert_pending()
2005 pr = rb_entry(parent, struct pending_reservation, rb_node); in __insert_pending()
2029 rb_link_node(&pr->rb_node, parent, p); in __insert_pending()
2030 rb_insert_color(&pr->rb_node, &tree->root); in __insert_pending()
2055 rb_erase(&pr->rb_node, &tree->root); in __remove_pending()