Home
last modified time | relevance | path

Searched refs:add_range (Results 1 – 2 of 2) sorted by relevance

/trusty/user/app/storage/
Dtransaction.c85 struct block_range add_range = BLOCK_RANGE_INITIAL_VALUE(add_range); in transaction_merge_free_sets() local
107 add_range = block_set_find_next_range(tr, set_a, next_block); in transaction_merge_free_sets()
111 __func__, add_range.start, add_range.end - 1, in transaction_merge_free_sets()
114 assert(!block_range_overlap(delete_range, add_range)); in transaction_merge_free_sets()
115 if (block_range_before(delete_range, add_range)) { in transaction_merge_free_sets()
122 } else if (!block_range_empty(add_range)) { in transaction_merge_free_sets()
123 assert(add_range.start >= next_block); in transaction_merge_free_sets()
124 tr->min_free_block = add_range.end; in transaction_merge_free_sets()
126 block_set_add_range(tr, new_set, add_range); in transaction_merge_free_sets()
128 next_block = add_range.end; in transaction_merge_free_sets()
[all …]
Dblock_set.c59 struct block_range add_range) { in block_range_extend() argument
61 range->end - 1, add_range.start, add_range.end - 1); in block_range_extend()
62 assert(!block_range_empty(add_range)); in block_range_extend()
63 assert(!block_range_overlap(*range, add_range)); in block_range_extend()
68 if (add_range.end == range->start) { in block_range_extend()
69 range->start = add_range.start; in block_range_extend()
70 } else if (add_range.start == range->end) { in block_range_extend()
71 range->end = add_range.end; in block_range_extend()