fs/ext4/extents_status.c

182 	struct rb_node *node;
189 		es = rb_entry(node, struct extent_status, rb_node);
214 	struct rb_node *node = root->rb_node;
218 		es = rb_entry(node, struct extent_status, rb_node);
231 		node = rb_next(&es->rb_node);
232 		return node ? rb_entry(node, struct extent_status, rb_node) :
264 	struct rb_node *node;
285 		while ((node = rb_next(&es1->rb_node)) != NULL) {
286 			es1 = rb_entry(node, struct extent_status, rb_node);
571 	struct rb_node *node;
573 	node = rb_prev(&es->rb_node);
577 	es1 = rb_entry(node, struct extent_status, rb_node);
582 		rb_erase(&es->rb_node, &tree->root);
595 	struct rb_node *node;
597 	node = rb_next(&es->rb_node);
601 	es1 = rb_entry(node, struct extent_status, rb_node);
789 	struct rb_node **p = &tree->root.rb_node;
790 	struct rb_node *parent = NULL;
795 		es = rb_entry(parent, struct extent_status, rb_node);
835 	rb_link_node(&es->rb_node, parent, p);
836 	rb_insert_color(&es->rb_node, &tree->root);
987 	struct rb_node *node;
1009 	node = tree->root.rb_node;
1011 		es1 = rb_entry(node, struct extent_status, rb_node);
1033 			node = rb_next(&es1->rb_node);
1036 					       rb_node);
1076 	struct rb_node *node;
1091 			node = rb_prev(&es->rb_node);
1094 						      rb_node) : NULL;
1199 	struct rb_node *node = root->rb_node;
1203 		pr = rb_entry(node, struct pending_reservation, rb_node);
1214 		node = rb_next(&pr->rb_node);
1216 				       rb_node) : NULL;
1244 	struct rb_node *node;
1275 			node = rb_prev(&es->rb_node);
1278 			es = rb_entry(node, struct extent_status, rb_node);
1284 				node = rb_next(&right_es->rb_node);
1286 						     rb_node) : NULL;
1295 				node = rb_next(&es->rb_node);
1299 					      rb_node);
1338 				node = rb_next(&pr->rb_node);
1339 				rb_erase(&pr->rb_node, &tree->root);
1344 					      rb_node);
1371 	struct rb_node *node;
1443 		node = rb_next(&es->rb_node);
1445 			es = rb_entry(node, struct extent_status, rb_node);
1453 		node = rb_next(&es->rb_node);
1454 		rb_erase(&es->rb_node, &tree->root);
1460 		es = rb_entry(node, struct extent_status, rb_node);
1775 	struct rb_node *node;
1788 		node = rb_next(&es->rb_node);
1797 		rb_erase(&es->rb_node, &tree->root);
1803 		es = rb_entry(node, struct extent_status, rb_node);
1845 	struct rb_node *node;
1852 		es = rb_entry(node, struct extent_status, rb_node);
1855 			rb_erase(&es->rb_node, &tree->root);
1867 	struct rb_node *node;
1874 		pr = rb_entry(node, struct pending_reservation, rb_node);
1915 	struct rb_node *node;
1919 	node = (&tree->root)->rb_node;
1922 		pr = rb_entry(node, struct pending_reservation, rb_node);
1949 	struct rb_node **p = &tree->root.rb_node;
1950 	struct rb_node *parent = NULL;
1959 		pr = rb_entry(parent, struct pending_reservation, rb_node);
1983 	rb_link_node(&pr->rb_node, parent, p);
1984 	rb_insert_color(&pr->rb_node, &tree->root);
2008 		rb_erase(&pr->rb_node, &tree->root);
2153 	struct rb_node *node;
2181 		node = rb_next(&es->rb_node);
2184 		es = rb_entry(node, struct extent_status, rb_node);