Lines Matching defs:rvq
230 __nis_rule_value_t *rvq;
235 rvq = initRuleValue(1, 0);
236 if (rvq == 0)
255 freeRuleValue(rvq, 1);
277 /* Add col=val pair to 'rvq' */
278 if (addSCol2RuleValue(index[n], value, rvq)) {
279 freeRuleValue(rvq, 1);
298 for (n = 0, niv = 1; n < rvq->numColumns; n++) {
299 if (rvq->colVal[n].numVals > 1)
300 niv *= rvq->colVal[n].numVals;
308 if (rvq->numColumns <= 0) {
309 freeRuleValue(rvq, *numVals);
316 * different values), 'rvq' will have one or more multi-valued
326 * entry, so 'rvq' is complete, and '*numVals' == 1.
347 * element a clone of 'rvq', we save a lot of code. The
350 * least one rvq->colVal[].val array has more than one
351 * element. Hence, making 'rv' a clone of 'rvq' will waste
358 rv = initRuleValue(niv, rvq);
360 freeRuleValue(rvq, 1);
366 * For each column value in 'rvq', copy to the appropriate
371 * We do this by traversing the rv[] array 'rvq->numColumns'
373 * for rvq->colVal[i]. A repeat factor 'repeat' starts out
374 * at '1', and is multiplied by 'rvq->colVal[i].numVals'
376 * rvq->colVal[i].val[j] is repeated 'repeat' times.
379 * an I-dimensional array (I = rvq->numColumns), where
381 * rvq->colVal[i]. The I-dimensional array is stored
384 * Since the 'rv' elements start out as copies of 'rvq',
385 * we achieve the "copy" of the 'rvq' column values by
388 for (i = 0, repeat = 1; i < rvq->numColumns; i++) {
412 * rvq->colVal[i].numVals, start over on
420 if (j >= rvq->colVal[i].numVals)
424 repeat *= rvq->colVal[i].numVals;
428 freeRuleValue(rvq, 1);
429 rvq = rv;
435 freeRuleValue(rvq, *numVals);
440 * Create queries from the rvq[] array.
445 qc = am(myself, rvq[a].numColumns * sizeof (*qc));
447 for (nn = 0, i = 0; i < rvq[a].numColumns; i++) {
449 if (strcmp(rvq[a].colName[i],
457 if (rvq[a].colVal[i].numVals > 0) {
459 rvq[a].colVal[i].val[0].length,
460 rvq[a].colVal[i].val[0].value);
466 myself, a, rvq[a].colName[i]);
479 freeRuleValue(rvq, *numVals);
485 *rvP = rvq;
487 freeRuleValue(rvq, 1);