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

Lines Matching defs:numVals
254 			for (i = 0; i < val[c].numVals; i++) {
280 		n[c].numVals = val[c].numVals;
281 		if (n[c].numVals > 0) {
282 			n[c].val = am(myself, n[c].numVals *
291 		for (i = 0; i < n[c].numVals; i++) {
348 	for (i = 0; i < val->numVals; i++) {
431 	for (i = 0; i < val->numVals; i++) {
611 				if (nameVal[i].numVals <= 0)
718 			for (i = 0; i < val->numVals; ) {
719 				for (j = 0; j < exVal->numVals; j++) {
727 				if (j < exVal->numVals) {
731 					for (k = i; k < val->numVals - 1; k++) {
736 					val->numVals--;
744 			 * If val->numVals <= 0, then we have no val to
747 			if (val->numVals <= 0) {
812 		val->numVals = 1;
845 			val->numVals = 1;
864 			val->numVals = 0;
904 	if (v1 == 0 || v1->numVals <= 0)
906 	if (v2 == 0 || v2->numVals <= 0)
920 		nv = v1->numVals * v2->numVals;
922 		nv = v2->numVals;
924 		nv = v1->numVals;
938 		for (i1 = 0, n = 0; i1 < v1->numVals; i1++) {
939 			for (i2 = 0; i2 < v2->numVals; i2++) {
964 		for (i2 = 0; i2 < v2->numVals; i2++) {
965 			for (i1 = 0, n = 0; i1 < v1->numVals; i1++) {
990 		for (i1 = 0, n = 0; i1 < v1->numVals; i1++) {
991 			for (i2 = 0; i2 < v2->numVals; i2++) {
1016 		for (i1 = 0, n = 0; i1 < v1->numVals; i1++) {
1017 			for (i2 = 0; i2 < v2->numVals; i2++) {
1053 	v->numVals = n;
1147 				for (j = 0; j < val->numVals; j++) {
1282 		val->numVals = 1;
1304 		val->numVals = 1;
1607 	if (v1 == 0 || v1->numVals <= 0)
1609 	if (v2 == 0 || v2->numVals <= 0)
1615 	n = v1->numVals + v2->numVals;
1625 	v->numVals = 0;
1629 		int			numv = (a == 0) ? v1->numVals :
1630 							v2->numVals;
1644 			v->val[v->numVals].value = am(myself, alen);
1645 			if (v->val[v->numVals].value == 0) {
1649 			memcpy(v->val[v->numVals].value, val[i].value, clen);
1650 			v->val[v->numVals].length = val[i].length;
1651 			v->numVals++;
1668 	else if (delim == 0 || val->val == 0 || val->numVals <= 0 ||
1675 	nv = val->numVals;
1678 	val->numVals = 0;
1711 					(val->numVals+1) *
1724 			val->val[val->numVals].value = newstr;
1725 			val->val[val->numVals].length = strlen(newstr) + 1;
1726 			val->numVals++;
2080  * If there is more than one input value (inVal->numVals > 1), the
2092 		int *numVals, char *sepset, char **outstr) {
2100 		inVal == 0 || inVal->numVals < 1 || inVal->type != vt_string)
2135 		v[0]->numVals = 0;
2137 		if (numVals != 0)
2138 			*numVals = 1;
2157 		v[n]->numVals = 0;
2158 		v[n]->val = am(myself, inVal->numVals * sizeof (v[n]->val[0]));
2167 		for (i = 0; i < inVal->numVals; i++) {
2174 	for (i = 0; i < inVal->numVals; i++) {
2185 					v[ni]->numVals < inVal->numVals) {
2186 				v[ni]->val[v[ni]->numVals].value = valstr;
2187 				v[ni]->val[v[ni]->numVals].length =
2189 				v[ni]->numVals++;
2203 	if (numVals != 0)
2204 		*numVals = numItems;
2235 			val->numVals <= 0 || val->type != vt_string) {
2259 	nv = val->numVals;
2262 	val->numVals = 0;
2293 					(val->numVals+1) *
2305 		val->val[val->numVals].value = newstr;
2306 		val->val[val->numVals].length = strlen(newstr) + 1;
2307 		val->numVals++;
2327 		for (i = 0; i < val->numVals; i++) {