Lines Matching refs:count

12 	unsigned int idx, left_idx, right_idx, count;
14 data = array_get(array, &count);
15 i_assert(count < INT_MAX);
17 idx = 0; left_idx = 0; right_idx = count;
41 unsigned int idx, count;
45 data = array_get_modifiable(array, &count);
46 if (count == 0) {
52 if (data[count-1].seq2 < seq) {
53 if (data[count-1].seq2 == seq-1) {
55 data[count-1].seq2 = seq;
76 /* idx == count couldn't happen because we already handle it above */
77 i_assert(idx < count && data[idx].seq1 >= seq);
91 i_assert(idx+1 < count); /* already handled above */
119 unsigned int idx1, idx2, count;
124 data = array_get_modifiable(array, &count);
133 if (idx1 == count) {
138 /* count the whole of this range, which is an overcount */
143 if (idx2 == count) {
148 /* count the whole of this range, which is an overcount */
150 countidx2++; /* may become == count i.e. past the end */
154 /* Now count how many we're not adding */
166 (idx2 == count || (seq2 < (uint32_t)-1 && data[idx2].seq1 > seq2+1)) &&
173 i_assert(idx1 < count);
178 if (idx2 == count ||
199 unsigned int count;
200 seq_range_array_add_range_internal(array, seq1, seq2, &count);
201 return count;
221 unsigned int idx, left_idx, right_idx, count;
226 data = array_get_modifiable(array, &count);
227 if (count == 0)
231 if (seq > data[count-1].seq2 || seq < data[0].seq1) {
235 if (data[count-1].seq2 == seq) {
237 if (data[count-1].seq1 != data[count-1].seq2)
238 data[count-1].seq2--;
240 array_delete(array, count-1, 1);
254 i_assert(count < INT_MAX);
255 left_idx = 0; right_idx = count;
295 unsigned int idx, idx2, count, remove_count = 0;
314 data = array_get(array, &count);
317 if (idx == count)
321 for (idx2 = idx; idx2 < count; idx2++) {
344 uint32_t n, uint32_t count)
349 if (count == 0)
357 if (count-1 >= (uint32_t)-1 - n ||
358 !seq_range_array_iter_nth(&iter, n + (count-1), &seq2)) {
359 /* count points beyond array */
369 unsigned int i, count, ret = 0;
372 src_range = array_get(src, &count);
373 for (i = 0; i < count; i++) {
429 unsigned int i, count;
433 range = array_get_modifiable(array, &count);
436 count = 0;
438 if (count == 0) {
448 i_assert(range[count-1].seq2 <= max_seq);
456 for (i = 0; i < count; ) {
461 range = array_get_modifiable(array, &count);
472 i_assert(i == count);
495 unsigned int i, count, diff;
503 range = array_get(iter->array, &count);
504 for (i = iter->prev_idx; i < count; i++) {