38                                              uint64_t start, uint64_t count)  in page_range_tree_insert_new()  argument
45     *key = range->start = start;  in page_range_tree_insert_new()
52                                 uint64_t start, uint64_t count,  in hvb_page_range_tree_insert()  argument
60     assert(!SUM_OVERFLOW_U64(start, count));  in hvb_page_range_tree_insert()
65     node = g_tree_upper_bound(tree.t, &start);  in hvb_page_range_tree_insert()
75         intersection = page_range_intersection_size(range, start, count);  in hvb_page_range_tree_insert()
76         joinable = page_range_joinable_right(range, start, count);  in hvb_page_range_tree_insert()
83          * already has a higher key (the start of its range).  in hvb_page_range_tree_insert()
88         node = page_range_tree_insert_new(tree, start, count);  in hvb_page_range_tree_insert()
101         count += start - range->start;  in hvb_page_range_tree_insert()
113                                                     range->start, range->count);  in hvb_page_range_tree_insert()
115                                             range->start, range->count);  in hvb_page_range_tree_insert()
125         count = rangecur->count + (rangecur->start - range->start);  in hvb_page_range_tree_insert()
129         start = rangecur->start;  in hvb_page_range_tree_insert()
132         g_tree_remove(tree.t, &start);  in hvb_page_range_tree_insert()
150     out->start = range->start;  in hvb_page_range_tree_pop()
152     /* can't modify range->start as it is the node key */  in hvb_page_range_tree_pop()
154         out->start += range->count - maxcount;  in hvb_page_range_tree_pop()
160         g_tree_remove(tree.t, &out->start);  in hvb_page_range_tree_pop()
167                                     uint64_t start, uint64_t count)  in hvb_page_range_tree_intree_any()  argument
176     node = g_tree_upper_bound(tree.t, &start);  in hvb_page_range_tree_intree_any()
180          * already has a higher key (the start of its range).  in hvb_page_range_tree_intree_any()
187     /* node range start <= range start */  in hvb_page_range_tree_intree_any()
190         /* node range start > range start */  in hvb_page_range_tree_intree_any()
202         if (range->start >= start + count) {  in hvb_page_range_tree_intree_any()
206         if (page_range_intersection_size(range, start, count) > 0) {  in hvb_page_range_tree_intree_any()