Lines Matching defs:idx2
119 unsigned int idx1, idx2, count;
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 == count ||
179 data[idx2].seq1 > seq2+1)
180 idx2--;
181 if (seq2 >= data[idx2].seq2) {
184 data[idx1].seq2 = data[idx2].seq2;
186 array_delete(array, idx1 + 1, idx2 - idx1);
295 unsigned int idx, idx2, count, remove_count = 0;
321 for (idx2 = idx; idx2 < count; idx2++) {
322 if (data[idx2].seq1 > seq2)
324 remove_count += data[idx2].seq2 - data[idx2].seq1 + 1;
326 array_delete(array, idx, idx2-idx);