Lines Matching defs:iq
784 * There are four cases, depending on the values of 'old[iq]' and
785 * 'new[iq]':
787 * (1) old[iq] == 0 && new[iq] == 0
790 * (2) old[iq] == 0 && new[iq] != 0
794 * (3) old[iq] != 0 && new[iq] == 0
798 * (4) old[iq] != 0 && new[iq] != 0
806 * If 'firstOnly' is set, only the first old[iq]/new[iq] pair is used
821 int i, n, rnq, iq, r, ret = LDAP_SUCCESS;
887 for (iq = 0, rnq = 0; iq < nq; iq++) {
890 if ((old == 0 || old[iq] == 0) &&
891 (new == 0 || new[iq] == 0))
901 (old != 0 && old[iq] != 0) ? old[iq] : new[iq], 1, 0,
910 idx = iq * maxMatches;
924 (old != 0) ? old[iq] : 0,
925 (new != 0) ? new[iq] : 0,
926 (rvIn != 0) ? &rvIn[iq] : 0,
963 if ((iq == 0 || !firstOnly) && dnt != 0) {