Searched refs:n3 (Results 1 – 1 of 1) sorted by relevance
364 struct rb_node *n, *n3; in wnd_remove_free_ext() local392 n3 = rb_next(n); in wnd_remove_free_ext()394 while (n3) { in wnd_remove_free_ext()395 e3 = rb_entry(n3, struct e_node, start.node); in wnd_remove_free_ext()411 n3 = rb_next(n3); in wnd_remove_free_ext()419 n3 = rb_first(&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()431 n3 = rb_next(&e->count.node); in wnd_remove_free_ext()433 if (!n3) { in wnd_remove_free_ext()436 e3 = rb_entry(n3, struct e_node, count.node); in wnd_remove_free_ext()