26 	struct rb_node node;  member
125 	struct rb_node *node, *next;  in wnd_close()  local
131 	node = rb_first(&wnd->start_tree);  in wnd_close()
133 	while (node) {  in wnd_close()
134 		next = rb_next(node);  in wnd_close()
135 		rb_erase(node, &wnd->start_tree);  in wnd_close()
137 				rb_entry(node, struct e_node, start.node));  in wnd_close()
138 		node = next;  in wnd_close()
150 		k = rb_entry(*p, struct rb_node_key, node);  in rb_lookup()
154 			r = &k->node;  in rb_lookup()
157 			return &k->node;  in rb_lookup()
176 			rb_entry(parent = *p, struct e_node, count.node);  in rb_insert_count()
192 	rb_link_node(&e->count.node, parent, p);  in rb_insert_count()
193 	rb_insert_color(&e->count.node, root);  in rb_insert_count()
211 		k = rb_entry(parent, struct e_node, start.node);  in rb_insert_start()
222 	rb_link_node(&e->start.node, parent, p);  in rb_insert_start()
223 	rb_insert_color(&e->start.node, root);  in rb_insert_start()
252 			e = rb_entry(n, struct e_node, start.node);  in wnd_add_free_ext()
258 				rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
259 				rb_erase(&e->count.node, &wnd->count_tree);  in wnd_add_free_ext()
268 			e = rb_entry(n, struct e_node, start.node);  in wnd_add_free_ext()
277 			rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
278 			rb_erase(&e->count.node, &wnd->count_tree);  in wnd_add_free_ext()
320 		e = rb_entry(n, struct e_node, count.node);  in wnd_add_free_ext()
328 			e2 = rb_entry(n, struct e_node, count.node);  in wnd_add_free_ext()
334 		rb_erase(&e->start.node, &wnd->start_tree);  in wnd_add_free_ext()
335 		rb_erase(&e->count.node, &wnd->count_tree);  in wnd_add_free_ext()
375 	e = rb_entry(n, struct e_node, start.node);  in wnd_remove_free_ext()
395 			e3 = rb_entry(n3, struct e_node, start.node);  in wnd_remove_free_ext()
405 				rb_erase(&e3->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
412 			rb_erase(&e3->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
413 			rb_erase(&e3->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
421 			n3 ? rb_entry(n3, struct e_node, count.node)->count.key :  in wnd_remove_free_ext()
428 	} else if (rb_prev(&e->count.node)) {  in wnd_remove_free_ext()
431 		n3 = rb_next(&e->count.node);  in wnd_remove_free_ext()
436 			e3 = rb_entry(n3, struct e_node, count.node);  in wnd_remove_free_ext()
444 			rb_erase(&e->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
448 			rb_erase(&e->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
449 			rb_erase(&e->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
455 	rb_erase(&e->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
467 			     count.node);  in wnd_remove_free_ext()
472 		rb_erase(&e->start.node, &wnd->start_tree);  in wnd_remove_free_ext()
473 		rb_erase(&e->count.node, &wnd->count_tree);  in wnd_remove_free_ext()
884 	e = rb_entry(n, struct e_node, start.node);  in wnd_is_free()
922 	e = rb_entry(n, struct e_node, start.node);  in wnd_is_used()
1014 		e = rb_entry(cr, struct e_node, start.node);  in wnd_find()
1029 			e = pr ? rb_entry(pr, struct e_node, start.node) : NULL;  in wnd_find()
1060 	e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node);  in wnd_find()