Lines Matching defs:seq1
21 if (data[idx].seq1 <= seq) {
43 value.seq1 = value.seq2 = seq;
61 if (data[0].seq1 > seq) {
62 if (data[0].seq1-1 == seq) {
64 data[0].seq1 = seq;
77 i_assert(idx < count && data[idx].seq1 >= seq);
78 i_assert(data[idx].seq1 > seq || data[idx].seq2 < seq);
80 if (data[idx].seq1 == seq+1) {
81 data[idx].seq1 = seq;
93 if (data[idx+1].seq1 == seq+1) {
95 data[idx+1].seq1 = data[idx].seq1;
115 uint32_t seq1, uint32_t seq2,
121 seq_range_lookup(array, seq1, &idx1);
128 unsigned int added = seq2+1 - seq1;
135 } else if (seq1 < data[idx1].seq1) {
139 overcounted += seq1 - data[idx1].seq1;
145 } else if (seq2 < data[idx2].seq1) {
156 notadded += data[i].seq2+1 - data[i].seq1;
162 if (idx1 > 0 && data[idx1-1].seq2+1 == seq1)
166 (idx2 == count || (seq2 < (uint32_t)-1 && data[idx2].seq1 > seq2+1)) &&
167 (idx1 == 0 || data[idx1-1].seq2 < seq1-1)) {
169 value.seq1 = seq1;
174 if (seq1 < data[idx1].seq1)
175 data[idx1].seq1 = seq1;
179 data[idx2].seq1 > seq2+1)
192 uint32_t seq1, uint32_t seq2)
194 seq_range_array_add_range_internal(array, seq1, seq2, NULL);
197 uint32_t seq1, uint32_t seq2)
200 seq_range_array_add_range_internal(array, seq1, seq2, &count);
215 seq_range_array_add_range(dest, range->seq1, range->seq2);
231 if (seq > data[count-1].seq2 || seq < data[0].seq1) {
237 if (data[count-1].seq1 != data[count-1].seq2)
243 if (data[0].seq1 == seq) {
245 if (data[0].seq1 != data[0].seq2)
246 data[0].seq1++;
259 if (data[idx].seq1 > seq)
265 if (data[idx].seq1 == seq) {
266 if (data[idx].seq1 == data[idx].seq2) {
272 data[idx].seq1++;
279 value.seq1 = seq + 1;
292 uint32_t seq1, uint32_t seq2)
302 if (seq_range_array_remove(array, seq1))
304 if (seq1 == seq2)
306 seq1++;
310 if (seq1 > seq2)
315 seq_range_lookup(array, seq1, &idx);
320 i_assert(data[idx].seq1 >= seq1);
322 if (data[idx2].seq1 > seq2)
324 remove_count += data[idx2].seq2 - data[idx2].seq1 + 1;
337 ret += seq_range_array_remove_range(dest, src_range->seq1,
347 uint32_t seq1, seq2;
353 if (!seq_range_array_iter_nth(&iter, n, &seq1)) {
362 seq_range_array_remove_range(array, seq1, seq2);
374 if (last_seq + 1 < src_range[i].seq1) {
376 last_seq + 1, src_range[i].seq1 - 1);
403 if (range1[i1].seq1 <= range2[i2].seq2 &&
404 range1[i1].seq2 >= range2[i2].seq1)
407 if (range1[i1].seq1 < range2[i2].seq1)
421 seq_count += range->seq2 - range->seq1 + 1;
442 value.seq1 = min_seq;
447 i_assert(range[0].seq1 >= min_seq);
450 if (range[0].seq1 == min_seq && range[0].seq2 == max_seq) {
459 if (range[i].seq1 == prev_min_seq) {
463 range[i].seq2 = range[i].seq1 - 1;
464 range[i].seq1 = prev_min_seq;
478 value.seq1 = min_seq;
505 diff = range[i].seq2 - range[i].seq1;
508 *seq_r = range[i].seq1 + (n - iter->prev_n);