Lines Matching full:count
38 uint64_t start, uint64_t count) in page_range_tree_insert_new() argument
43 assert(count > 0); in page_range_tree_insert_new()
46 range->count = count; 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()
61 if (count == 0) { 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()
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()
102 range->count = MAX(range->count, count); 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()
126 range->count = MAX(range->count, count); in hvb_page_range_tree_insert()
153 if (range->count > maxcount) { in hvb_page_range_tree_pop()
154 out->start += range->count - maxcount; in hvb_page_range_tree_pop()
155 out->count = maxcount; in hvb_page_range_tree_pop()
156 range->count -= maxcount; in hvb_page_range_tree_pop()
158 out->count = range->count; in hvb_page_range_tree_pop()
167 uint64_t start, uint64_t count) in hvb_page_range_tree_intree_any() argument
171 if (count == 0) { 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()