13 	return count == 1 && range[0].seq1 == 0 &&  in seq_range_is_overflowed()
31 		if (data[idx].seq1 <= seq) {  in seq_range_lookup()
54 	value.seq1 = value.seq2 = seq;  in seq_range_array_add_slow_path()
63 	i_assert(idx < count && data[idx].seq1 >= seq);  in seq_range_array_add_slow_path()
64 	i_assert(data[idx].seq1 > seq || data[idx].seq2 < seq);  in seq_range_array_add_slow_path()
66 	if (data[idx].seq1 == seq+1) {  in seq_range_array_add_slow_path()
67 		data[idx].seq1 = seq;  in seq_range_array_add_slow_path()
79 			if (data[idx+1].seq1 == seq+1) {  in seq_range_array_add_slow_path()
81 				data[idx+1].seq1 = data[idx].seq1;  in seq_range_array_add_slow_path()
97 	value.seq1 = value.seq2 = seq;  in seq_range_array_add()
110 	} else if (data[0].seq1 > seq) {  in seq_range_array_add()
111 		if (data[0].seq1-1 == seq) {  in seq_range_array_add()
113 			data[0].seq1 = seq;  in seq_range_array_add()
134 				   uint32_t seq1, uint32_t seq2,  in seq_range_array_add_range_internal()  argument
140 	seq_range_lookup(array, seq1, &idx1);  in seq_range_array_add_range_internal()
147 		unsigned int added = seq2+1 - seq1;  in seq_range_array_add_range_internal()
154 		} else if (seq1 < data[idx1].seq1) {  in seq_range_array_add_range_internal()
158 			overcounted += seq1 - data[idx1].seq1;  in seq_range_array_add_range_internal()
164 		} else  if (seq2 < data[idx2].seq1) {  in seq_range_array_add_range_internal()
175 			notadded += data[i].seq2+1 - data[i].seq1;  in seq_range_array_add_range_internal()
181 	if (idx1 > 0 && data[idx1-1].seq2+1 == seq1)  in seq_range_array_add_range_internal()
185 	    (idx2 == count || (seq2 < (uint32_t)-1 && data[idx2].seq1 > seq2+1)) &&  in seq_range_array_add_range_internal()
186 	    (idx1 == 0 || data[idx1-1].seq2 < seq1-1)) {  in seq_range_array_add_range_internal()
188 		value.seq1 = seq1;  in seq_range_array_add_range_internal()
193 		if (seq1 < data[idx1].seq1)  in seq_range_array_add_range_internal()
194 			data[idx1].seq1 = seq1;  in seq_range_array_add_range_internal()
198 			    data[idx2].seq1 > seq2+1)  in seq_range_array_add_range_internal()
212 			       uint32_t seq1, uint32_t seq2)  in seq_range_array_add_range()  argument
214 	seq_range_array_add_range_internal(array, seq1, seq2, NULL);  in seq_range_array_add_range()
217 					     uint32_t seq1, uint32_t seq2)  in seq_range_array_add_range_count()  argument
220 	seq_range_array_add_range_internal(array, seq1, seq2, &count);  in seq_range_array_add_range_count()
235 		seq_range_array_add_range(dest, range->seq1, range->seq2);  in seq_range_array_merge()
248 		uint32_t first_seq = src_range[src_idx].seq1;  in seq_range_array_merge_n()
275 	if (seq > data[count-1].seq2 || seq < data[0].seq1) {  in seq_range_array_remove()
281 		if (data[count-1].seq1 != data[count-1].seq2)  in seq_range_array_remove()
287 	if (data[0].seq1 == seq) {  in seq_range_array_remove()
289 		if (data[0].seq1 != data[0].seq2)  in seq_range_array_remove()
290 			data[0].seq1++;  in seq_range_array_remove()
303 		if (data[idx].seq1 > seq)  in seq_range_array_remove()
309 			if (data[idx].seq1 == seq) {  in seq_range_array_remove()
310 				if (data[idx].seq1 == data[idx].seq2) {  in seq_range_array_remove()
316 					data[idx].seq1++;  in seq_range_array_remove()
323 				value.seq1 = seq + 1;  in seq_range_array_remove()
336 					  uint32_t seq1, uint32_t seq2)  in seq_range_array_remove_range()  argument
346 	if (seq_range_array_remove(array, seq1))  in seq_range_array_remove_range()
348 	if (seq1 == seq2)  in seq_range_array_remove_range()
350 	seq1++;  in seq_range_array_remove_range()
354 	if (seq1 > seq2)  in seq_range_array_remove_range()
359 	seq_range_lookup(array, seq1, &idx);  in seq_range_array_remove_range()
364 	i_assert(data[idx].seq1 >= seq1);  in seq_range_array_remove_range()
366 		if (data[idx2].seq1 > seq2)  in seq_range_array_remove_range()
382 		count = seq_range_array_remove_range(dest, src_range->seq1,  in seq_range_array_remove_seq_range()
394 	uint32_t seq1, seq2;  in seq_range_array_remove_nth()  local
400 	if (!seq_range_array_iter_nth(&iter, n, &seq1)) {  in seq_range_array_remove_nth()
409 	seq_range_array_remove_range(array, seq1, seq2);  in seq_range_array_remove_nth()
421 		if (last_seq + 1 < src_range[i].seq1) {  in seq_range_array_intersect()
423 				last_seq + 1, src_range[i].seq1 - 1);  in seq_range_array_intersect()
454 		if (range1[i1].seq1 <= range2[i2].seq2 &&  in seq_range_array_have_common()
455 		    range1[i1].seq2 >= range2[i2].seq1)  in seq_range_array_have_common()
458 		if (range1[i1].seq1 < range2[i2].seq1)  in seq_range_array_have_common()
495 		value.seq1 = min_seq;  in seq_range_array_invert()
500 	i_assert(range[0].seq1 >= min_seq);  in seq_range_array_invert()
503 	if (range[0].seq1 == min_seq && range[0].seq2 == max_seq) {  in seq_range_array_invert()
512 		if (range[i].seq1 == prev_min_seq) {  in seq_range_array_invert()
516 			range[i].seq2 = range[i].seq1 - 1;  in seq_range_array_invert()
517 			range[i].seq1 = prev_min_seq;  in seq_range_array_invert()
531 		value.seq1 = min_seq;  in seq_range_array_invert()
558 		diff = range[i].seq2 - range[i].seq1;  in seq_range_array_iter_nth()
561 			*seq_r = range[i].seq1 + (n - iter->prev_n);  in seq_range_array_iter_nth()