Lines Matching defs:uid_idx
1161 unsigned int i, uid_idx, uid_count, shift_count;
1175 for (i = 0, uid_idx = 0, seq_high = 0;; ) {
1177 while (uid_idx < uid_count &&
1179 I_MAX(shifts[i].seq1, seq_high) > uids[uid_idx].seq2))
1181 i_assert(uids[uid_idx].seq1 >= shift_sum);
1182 uids[uid_idx].seq1 -= shift_sum;
1183 uids[uid_idx].seq2 -= shift_sum;
1184 child_sum += uids[uid_idx].seq2 -
1185 uids[uid_idx].seq1 + 1;
1187 if (uid_idx > 0 &&
1188 uids[uid_idx-1].seq2 >= uids[uid_idx].seq1 - 1) {
1190 i_assert(uids[uid_idx-1].seq2 ==
1191 uids[uid_idx].seq1 - 1);
1192 uids[uid_idx-1].seq2 = uids[uid_idx].seq2;
1193 array_delete(uids_arr, uid_idx, 1);
1197 if (uid_idx == 0)
1201 uids[uid_idx].seq1 -
1202 uids[uid_idx-1].seq2 - 1;
1204 uid_idx++;
1207 if (uid_idx == uid_count)
1212 if (shift.seq2 < uids[uid_idx].seq1) {
1218 if (shift.seq1 < uids[uid_idx].seq1) {
1219 shift_sum += uids[uid_idx].seq1 - shift.seq1;
1220 shift.seq1 = uids[uid_idx].seq1;
1224 shift.seq1 - uids[uid_idx].seq1;
1226 I_MIN(shift.seq2, uids[uid_idx].seq2) -
1236 if (shift.seq2 <= uids[uid_idx].seq2)
1239 seq_high = uids[uid_idx].seq2 + 1;
1251 if (uids[uid_idx].seq1 +
1252 child_shift_count > uids[uid_idx].seq2) {
1254 array_delete(uids_arr, uid_idx, 1);
1259 uids[uid_idx].seq1 += child_shift_count;
1263 I_MIN(shift.seq2, uids[uid_idx].seq2));