Lines Matching defs:idx1
119 unsigned int idx1, idx2, count;
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 == idx2 &&
167 (idx1 == 0 || data[idx1-1].seq2 < seq1-1)) {
171 array_insert(array, idx1, &value, 1);
173 i_assert(idx1 < count);
174 if (seq1 < data[idx1].seq1)
175 data[idx1].seq1 = seq1;
176 if (seq2 > data[idx1].seq2) {
182 data[idx1].seq2 = seq2;
184 data[idx1].seq2 = data[idx2].seq2;
186 array_delete(array, idx1 + 1, idx2 - idx1);