55     GTreeNode *node;  in hvb_page_range_tree_insert()  local
65     node = g_tree_upper_bound(tree.t, &start);  in hvb_page_range_tree_insert()
66     if (node) {  in hvb_page_range_tree_insert()
67         node = g_tree_node_previous(node);  in hvb_page_range_tree_insert()
69         node = g_tree_node_last(tree.t);  in hvb_page_range_tree_insert()
72     if (node) {  in hvb_page_range_tree_insert()
73         range = g_tree_node_value(node);  in hvb_page_range_tree_insert()
79     if (!node ||  in hvb_page_range_tree_insert()
82          * !node case: the tree is empty or the very first node in the tree  in hvb_page_range_tree_insert()
88         node = page_range_tree_insert_new(tree, start, count);  in hvb_page_range_tree_insert()
89         assert(node);  in hvb_page_range_tree_insert()
90         range = g_tree_node_value(node);  in hvb_page_range_tree_insert()
106     for (node = g_tree_node_next(node); node; ) {  in hvb_page_range_tree_insert()
109         rangecur = g_tree_node_value(node);  in hvb_page_range_tree_insert()
117             /* the current node is disjoint */  in hvb_page_range_tree_insert()
128         /* the current node was merged in, remove it */  in hvb_page_range_tree_insert()
130         node = g_tree_node_next(node);  in hvb_page_range_tree_insert()
139     GTreeNode *node;  in hvb_page_range_tree_pop()  local
142     node = g_tree_node_last(tree.t);  in hvb_page_range_tree_pop()
143     if (!node) {  in hvb_page_range_tree_pop()
147     range = g_tree_node_value(node);  in hvb_page_range_tree_pop()
152     /* can't modify range->start as it is the node key */  in hvb_page_range_tree_pop()
169     GTreeNode *node;  in hvb_page_range_tree_intree_any()  local
175     /* find the first node that can possibly intersect our range */  in hvb_page_range_tree_intree_any()
176     node = g_tree_upper_bound(tree.t, &start);  in hvb_page_range_tree_intree_any()
177     if (node) {  in hvb_page_range_tree_intree_any()
179          * a NULL node below means that the very first node in the tree  in hvb_page_range_tree_intree_any()
182         node = g_tree_node_previous(node);  in hvb_page_range_tree_intree_any()
184         /* a NULL node below means that the tree is empty */  in hvb_page_range_tree_intree_any()
185         node = g_tree_node_last(tree.t);  in hvb_page_range_tree_intree_any()
187     /* node range start <= range start */  in hvb_page_range_tree_intree_any()
189     if (!node) {  in hvb_page_range_tree_intree_any()
190         /* node range start > range start */  in hvb_page_range_tree_intree_any()
191         node = g_tree_node_first(tree.t);  in hvb_page_range_tree_intree_any()
194     for ( ; node; node = g_tree_node_next(node)) {  in hvb_page_range_tree_intree_any()
195         PageRange *range = g_tree_node_value(node);  in hvb_page_range_tree_intree_any()
199          * if this node starts beyond or at the end of our range so does  in hvb_page_range_tree_intree_any()