Lines Matching defs:numVals
226 __nis_rule_value_t **rvP, int *numVals) {
239 if (numVals == 0)
240 numVals = &nv;
241 *numVals = 0;
299 if (rvq->colVal[n].numVals > 1)
300 niv *= rvq->colVal[n].numVals;
303 *numVals = 1;
309 freeRuleValue(rvq, *numVals);
310 *numVals = 0;
326 * entry, so 'rvq' is complete, and '*numVals' == 1.
329 * '*numVals' reflects the number of NIS+ entries, and no
341 if (niv > 1 && *numVals == 1) {
361 *numVals = 0;
374 * at '1', and is multiplied by 'rvq->colVal[i].numVals'
395 for (k = 0; k < rv[n].colVal[i].numVals; k++) {
402 rv[n].colVal[i].numVals = 1;
412 * rvq->colVal[i].numVals, start over on
420 if (j >= rvq->colVal[i].numVals)
424 repeat *= rvq->colVal[i].numVals;
427 *numVals = niv;
433 q = am(myself, *numVals * sizeof (q[0]));
435 freeRuleValue(rvq, *numVals);
442 for (a = 0; a < *numVals; a++) {
457 if (rvq[a].colVal[i].numVals > 0) {
479 freeRuleValue(rvq, *numVals);
488 *numVals = 0;
754 tmpval->numVals == 1)
773 if (lval == 0 || lval->numVals <= 0 || rval->numVals <= 0) {
783 * single A single value (numVals == 1)
801 if (rval->numVals > 1) {
802 if (lval->numVals == 1 && lval->repeat)
803 nrq = rval->numVals;
804 else if (lval->numVals > 1 && rval->repeat)
805 nrq = 1 + ((rval->numVals-1)/lval->numVals);
904 for (i = 0, ir = 0; i < lval->numVals; i++) {
930 ir = (j < rval->numVals) ?
931 j : rval->numVals - 1;