Lines Matching defs:numVals
89 val->numVals = 1;
130 int i, j, res, numVals, oldlen, count;
163 tempVal, &numVals, sepset, &str);
178 for (j = 0; j < numVals; j++)
188 for (j = 0; j < numVals; j++) {
196 for (; j < numVals; j++)
256 int valueLen, comLen, numVals, nr, count = 1;
368 &numVals, 0, 0);
383 * This code assumes that numVals will be less than or
388 for (i = 0, *statP = SUCCESS; i < numVals; i++) {
446 for (i = 0; i < numVals; i++)
466 for (i = 0; i < numVals; i++)
493 * - rv is an array of numVals rule-values each containing
508 __nis_rule_value_t *trv, int numVals, char *domain) {
584 for (j = 0; j < numVals; j++) {
594 if (val->numVals > 0) {
692 if (rval->numVals <= 0) {
705 if (rval->numVals > 1) {
707 nrq = rval->numVals;
709 nrq = 1 + ((rval->numVals-1)/numItems);
749 if (k >= rval->numVals) {
872 if ((*nv = rv->colVal[i].numVals) == 0)
978 for (j = 0; j < rv->colVal[i].numVals; j++) {
988 for (j = 0; j < rv->colVal[i].numVals; j++) {
1450 for (j = 1; j < val->numVals; j++) {
1464 val->val[j--] = val->val[--val->numVals];
1467 for (k = j + 1; k < val->numVals; k++)
1470 val->numVals--;