Lines Matching refs:nq
625 int i, nq, nn;
632 nq = *numQueries;
633 new = am(myself, nq * sizeof (new[0]));
635 attr = am(myself, nq * sizeof (attr[0]));
640 freeQueries(q, nq);
643 freeObjAttr(*objAttr, nq);
650 for (i = 0, nn = 0; i < nq; i++) {
695 int nq;
707 for (r = 0, nq = 0; r < t->numRulesFromLDAP; r++) {
795 * Of course, we already have 'nq' db_query's from previous
796 * rules, so the resulting number of queries is max(1,nq)
813 if (nq <= 0)
816 ntq = nq * nrq;
818 if (ntq > nq) {
827 freeQueries(query, nq);
828 freeObjAttr(attr, nq);
839 * remembering that realloc() has done the first 'nq'
847 for (j = 0; j < nq; j++) {
848 query[(nq*i)+j] = cloneQuery(query[j],
850 if (query[(nq*i)+j] == 0 &&
853 attr[(nq*i)+j] = cloneObjAttr(attr[j]);
854 if (attr[(nq*i)+j] == 0 &&
870 * Special case if nq == 0 (i.e., the first time we
875 if (nq <= 0) {
1017 nq = ntq;
1022 if (nq <= 0) {
1030 query = filterQuery(t, query, qin, &attr, &nq);
1032 query = filterQuery(0, query, qin, &attr, &nq);
1036 *numQueries = nq;
1041 freeObjAttr(attr, nq);
1057 int i, nqp, nq, *nnp = 0, nv;
1085 for (i = 0, nq = 0, nqp = 0; i < nv; i++) {
1091 nq += nnp[nqp];
1096 if (nqp == 0 || nq <= 0)
1099 q = am(myself, nq * sizeof (q[0]));
1100 attr = am(myself, nq * sizeof (attr[0]));
1102 nq = 0;
1107 for (i = 0, nq = 0; i < nqp; i++) {
1108 (void) memcpy(&q[nq], qp[i], nnp[i] * sizeof (qp[i][0]));
1109 (void) memcpy(&attr[nq], atp[i], nnp[i] * sizeof (atp[i][0]));
1110 nq += nnp[i];
1115 *numQueries = nq;
1119 freeObjAttr(attr, nq);