135 	node = rb_first(&wnd->start_tree);  in wnd_close()
139 		rb_erase(node, &wnd->start_tree);  in wnd_close()
251 		n = rb_lookup(&wnd->start_tree, bit);  in wnd_add_free_ext()
254 			n = rb_first(&wnd->start_tree);  in wnd_add_free_ext()
262 				rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
281 			rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
338 		rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
356 	rb_insert_start(&wnd->start_tree, e);  in wnd_add_free_ext()
374 	n = rb_lookup(&wnd->start_tree, bit);  in wnd_remove_free_ext()
416 			rb_erase(&e3->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
452 			rb_erase(&e->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
476 		rb_erase(&e->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
488 		rb_insert_start(&wnd->start_tree, e);  in wnd_remove_free_ext()
810 	if (!RB_EMPTY_ROOT(&wnd->start_tree))  in wnd_set_used()
871 	if (RB_EMPTY_ROOT(&wnd->start_tree))  in wnd_is_free()
874 	n = rb_lookup(&wnd->start_tree, bit);  in wnd_is_free()
907 	if (RB_EMPTY_ROOT(&wnd->start_tree))  in wnd_is_used()
911 	n = rb_lookup(&wnd->start_tree, end - 1);  in wnd_is_used()
998 	if (RB_EMPTY_ROOT(&wnd->start_tree)) {  in wnd_find()
1012 	cr = wnd->start_tree.rb_node;  in wnd_find()
1079 			struct rb_root start_tree;  in wnd_find()  local
1081 			memcpy(&start_tree, &wnd->start_tree,  in wnd_find()
1083 			memset(&wnd->start_tree, 0, sizeof(struct rb_root));  in wnd_find()
1093 			memcpy(&wnd->start_tree, &start_tree,  in wnd_find()
1404 	if (!RB_EMPTY_ROOT(&wnd->start_tree) && len)  in wnd_zone_set()