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