40     PageRange *range = g_malloc(sizeof(*range));  in page_range_tree_insert_new()  local
44     *key = range->start = start;  in page_range_tree_insert_new()
45     range->count = count;  in page_range_tree_insert_new()
47     return g_tree_insert_node(tree.t, key, range);  in page_range_tree_insert_new()
57     PageRange *range;  in hvb_page_range_tree_insert()  local
72         range = g_tree_node_value(node);  in hvb_page_range_tree_insert()
73         assert(range);  in hvb_page_range_tree_insert()
74         intersection = page_range_intersection_size(range, start, count);  in hvb_page_range_tree_insert()
75         joinable = page_range_joinable_right(range, start, count);  in hvb_page_range_tree_insert()
89         range = g_tree_node_value(node);  in hvb_page_range_tree_insert()
90         assert(range);  in hvb_page_range_tree_insert()
100         count += start - range->start;  in hvb_page_range_tree_insert()
101         range->count = MAX(range->count, count);  in hvb_page_range_tree_insert()
112                                                     range->start, range->count);  in hvb_page_range_tree_insert()
114                                             range->start, range->count);  in hvb_page_range_tree_insert()
124         count = rangecur->count + (rangecur->start - range->start);  in hvb_page_range_tree_insert()
125         range->count = MAX(range->count, count);  in hvb_page_range_tree_insert()
139     PageRange *range;  in hvb_page_range_tree_pop()  local
146     range = g_tree_node_value(node);  in hvb_page_range_tree_pop()
147     assert(range);  in hvb_page_range_tree_pop()
149     out->start = range->start;  in hvb_page_range_tree_pop()
152     if (range->count > maxcount) {  in hvb_page_range_tree_pop()
153         out->start += range->count - maxcount;  in hvb_page_range_tree_pop()
155         range->count -= maxcount;  in hvb_page_range_tree_pop()
157         out->count = range->count;  in hvb_page_range_tree_pop()
194         PageRange *range = g_tree_node_value(node);  in hvb_page_range_tree_intree_any()  local
196         assert(range);  in hvb_page_range_tree_intree_any()
201         if (range->start >= start + count) {  in hvb_page_range_tree_intree_any()
205         if (page_range_intersection_size(range, start, count) > 0) {  in hvb_page_range_tree_intree_any()