Searched defs:idx1 (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
94 idx1 = range[i].seq1 - first_new_seq;
96 for (idx = idx1; idx <= idx2; idx++)
/dovecot/src/lib/
H A Dpriorityq.c48 unsigned int idx1, unsigned int idx2)
53 i_assert(items[idx1]->idx == idx1);
56 items[idx1]->idx = idx2;
57 items[idx2]->idx = idx1;
60 tmp = items[idx1];
61 items[idx1] = items[idx2];
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
121 seq_range_lookup(array, seq1, &idx1);
133 if (idx1 == count) {
135 } else if (seq1 < data[idx1].seq1) {
139 overcounted += seq1 - data[idx1].seq1;
155 for (i = idx1; i < countidx2; i++)
162 if (idx1 > 0 && data[idx1-1].seq2+1 == seq1)
163 idx1--;
165 if (idx1
[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
384 idx1 = array_get(k1, &count1);
391 if (idx1[i] != idx2[i]) {
394 if (idx1[i] == idx2[j])
/dovecot/src/plugins/virtual/
H A Dvirtual-sync.c1037 unsigned int i, idx1, count; local
1046 &idx1);
1048 for (i = idx1; i < count; i++) {
1063 unsigned int idx1, idx2; local
1079 &idx1, &idx2))
1082 for (; idx1 <= idx2; idx1++) {
1083 vuid = uidmap[idx1].virtual_uid;
1096 uidmap[idx1].real_uid);

Completed in 168 milliseconds