131 	node = rb_first(&wnd->start_tree);  in wnd_close()
135 		rb_erase(node, &wnd->start_tree);  in wnd_close()
247 		n = rb_lookup(&wnd->start_tree, bit);  in wnd_add_free_ext()
250 			n = rb_first(&wnd->start_tree);  in wnd_add_free_ext()
258 				rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
277 			rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
334 		rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
352 	rb_insert_start(&wnd->start_tree, e);  in wnd_add_free_ext()
370 	n = rb_lookup(&wnd->start_tree, bit);  in wnd_remove_free_ext()
412 			rb_erase(&e3->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
448 			rb_erase(&e->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
472 		rb_erase(&e->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
484 		rb_insert_start(&wnd->start_tree, e);  in wnd_remove_free_ext()
800 	if (!RB_EMPTY_ROOT(&wnd->start_tree))  in wnd_set_used()
899 	if (RB_EMPTY_ROOT(&wnd->start_tree))  in wnd_is_free()
902 	n = rb_lookup(&wnd->start_tree, bit);  in wnd_is_free()
935 	if (RB_EMPTY_ROOT(&wnd->start_tree))  in wnd_is_used()
939 	n = rb_lookup(&wnd->start_tree, end - 1);  in wnd_is_used()
1025 	if (RB_EMPTY_ROOT(&wnd->start_tree)) {  in wnd_find()
1039 	cr = wnd->start_tree.rb_node;  in wnd_find()
1106 			struct rb_root start_tree;  in wnd_find()  local
1108 			memcpy(&start_tree, &wnd->start_tree,  in wnd_find()
1110 			memset(&wnd->start_tree, 0, sizeof(struct rb_root));  in wnd_find()
1120 			memcpy(&wnd->start_tree, &start_tree,  in wnd_find()
1423 	if (!RB_EMPTY_ROOT(&wnd->start_tree) && len)  in wnd_zone_set()