count_tree
e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node);
rb_erase(&e->count.node, &wnd->count_tree);
rb_erase(&e->count.node, &wnd->count_tree);
n = rb_last(&wnd->count_tree);
rb_erase(&e->count.node, &wnd->count_tree);
rb_insert_count(&wnd->count_tree, e);
rb_erase(&e3->count.node, &wnd->count_tree);
rb_insert_count(&wnd->count_tree, e3);
rb_erase(&e3->count.node, &wnd->count_tree);
n3 = rb_first(&wnd->count_tree);
rb_erase(&e->count.node, &wnd->count_tree);
rb_insert_count(&wnd->count_tree, e);
rb_erase(&e->count.node, &wnd->count_tree);
rb_erase(&e->count.node, &wnd->count_tree);
rb_insert_count(&wnd->count_tree, e);
e = rb_entry(rb_last(&wnd->count_tree), struct e_node,
rb_erase(&e->count.node, &wnd->count_tree);
rb_insert_count(&wnd->count_tree, e);
struct rb_root count_tree; // Extents, sorted by 'count + start'.
return count_tree(net, skb, l3num, data, key);