Cross Reference: /illumos-gate/usr/src/lib/libnisdb/ldap

Lines Matching refs:numVals
61 				for (j = 0; j < rv[n].colVal[i].numVals; j++) {
64 				if (rv[n].colVal[i].numVals > 0)
78 				for (j = 0; j < rv[n].attrVal[i].numVals;
82 				if (rv[n].attrVal[i].numVals > 0)
180 		for (j = 0; j < s->colVal[i].numVals; j++) {
190 		for (j = 0; j < s->attrVal[i].numVals; j++) {
278 			if (inVal[i].numVals < 0) {
289 			 * 'numVals' field to -1.
292 				for (j = 0; j < inVal[i].numVals; j++) {
297 				inVal[i].numVals = -1;
302 			for (j = 0; j < inVal[i].numVals; j++) {
309 			if (j < inVal[i].numVals)
314 					(inVal[i].numVals+1) *
319 			v[inVal[i].numVals].length = copyLen;
320 			v[inVal[i].numVals].value = am(msg, valueLen);
321 			if (v[inVal[i].numVals].value == 0 &&
326 			memcpy(v[inVal[i].numVals].value, value, copyLen);
327 			inVal[i].numVals++;
337 	 * __nis_value_t with the numVals field set to -1.
374 		inVal[num].numVals = 1;
377 		inVal[num].numVals = -1;
580 		 * with numVals == -1, so we return such a creature.
585 			val->numVals = -1;
659 	if (rval->numVals == 1 && rval->val[0].value == 0) {
701 						tmpval->numVals == 1)
726 	if (lval == 0 || lval->numVals <= 0) {
732 	for (i = 0, j = 0; i < lval->numVals; i++) {
733 		/* Special case: rval->numVals < 0 means deletion */
734 		if (rval->numVals < 0) {
740 		if (j >= rval->numVals)
741 			j = (rval->numVals > 0) ? rval->numVals-1 : 0;
742 		for (; j < rval->numVals; j++) {
800 			for (j = 0; j < rv->attrVal[i].numVals; j++)
802 			if (rv->attrVal[i].numVals > 0)
835 			for (j = 0; j < rv->colVal[i].numVals; j++)
837 			if (rv->colVal[i].numVals > 0)
935 	for (i = 0; i < val->numVals; i++) {
1026  * in the returned array will have unique 'dn'. On entry, *numVals
1031 mergeRuleValueWithSameDN(__nis_rule_value_t *rv, int *numVals) {
1037 	if (numVals == 0)
1040 	for (i = 0; i < *numVals; i++) {
1051 						*numVals = -1;
1057 					*numVals = -1;
1066 					*numVals = -1;
1074 	*numVals = count;