Searched defs:idx2 (Results 1 - 6 of 6) sorted by relevance

/dovecot/src/lib-index/
H A Dmail-index-transaction-sort-appends.c68 uint32_t idx, idx1, idx2; local
95 idx2 = range[i].seq2 - first_new_seq;
96 for (idx = idx1; idx <= idx2; idx++)
/dovecot/src/lib/
H A Dpriorityq.c48 unsigned int idx1, unsigned int idx2)
54 i_assert(items[idx2]->idx == idx2);
56 items[idx1]->idx = idx2;
57 items[idx2]->idx = idx1;
61 items[idx1] = items[idx2];
62 items[idx2] = tmp;
47 heap_items_swap(struct priorityq_item **items, unsigned int idx1, unsigned int idx2) argument
H A Dseq-range-array.c119 unsigned int idx1, idx2, count; local
122 seq_range_lookup(array, seq2, &idx2);
129 unsigned int countidx2 = idx2;
143 if (idx2 == count) {
145 } else if (seq2 < data[idx2].seq1) {
149 overcounted += data[idx2].seq2 - seq2;
165 if (idx1 == idx2 &&
166 (idx2 == count || (seq2 < (uint32_t)-1 && data[idx2].seq1 > seq2+1)) &&
178 if (idx2
295 unsigned int idx, idx2, count, remove_count = 0; local
[all...]
H A Dstats-dist.c120 unsigned int idx1 = (count-1)/2, idx2 = count/2; local
121 return (stats->samples[idx1] + stats->samples[idx2]) / 2;
/dovecot/src/lib-storage/index/
H A Dindex-sync.c374 const unsigned int *idx1, *idx2; local
385 idx2 = array_get(k2, &count2);
391 if (idx1[i] != idx2[i]) {
394 if (idx1[i] == idx2[j])
/dovecot/src/plugins/virtual/
H A Dvirtual-sync.c1063 unsigned int idx1, idx2; local
1079 &idx1, &idx2))
1082 for (; idx1 <= idx2; idx1++) {

Completed in 14 milliseconds