Home
last modified time | relevance | path

Searched refs:numVals (Results 1 – 15 of 15) sorted by relevance

/illumos-gate/usr/src/lib/libnisdb/
H A Dldap_ruleval.c61 for (j = 0; j < rv[n].colVal[i].numVals; j++) { in freeRuleValue()
64 if (rv[n].colVal[i].numVals > 0) in freeRuleValue()
78 for (j = 0; j < rv[n].attrVal[i].numVals; in freeRuleValue()
82 if (rv[n].attrVal[i].numVals > 0) in freeRuleValue()
180 for (j = 0; j < s->colVal[i].numVals; j++) { in mergeRuleValue()
190 for (j = 0; j < s->attrVal[i].numVals; j++) { in mergeRuleValue()
278 if (inVal[i].numVals < 0) { in addVal2RuleValue()
292 for (j = 0; j < inVal[i].numVals; j++) { in addVal2RuleValue()
297 inVal[i].numVals = -1; in addVal2RuleValue()
302 for (j = 0; j < inVal[i].numVals; j++) { in addVal2RuleValue()
[all …]
H A Dldap_val.c254 for (i = 0; i < val[c].numVals; i++) { in freeValue()
280 n[c].numVals = val[c].numVals; in cloneValue()
281 if (n[c].numVals > 0) { in cloneValue()
282 n[c].val = am(myself, n[c].numVals * in cloneValue()
291 for (i = 0; i < n[c].numVals; i++) { in cloneValue()
348 for (i = 0; i < val->numVals; i++) { in berEncode()
431 for (i = 0; i < val->numVals; i++) { in berDecode()
611 if (nameVal[i].numVals <= 0) in getMappingItemVal()
718 for (i = 0; i < val->numVals; ) { in getMappingItemVal()
719 for (j = 0; j < exVal->numVals; j++) { in getMappingItemVal()
[all …]
H A Dldap_nisdbquery.c226 __nis_rule_value_t **rvP, int *numVals) { in createQuery() argument
239 if (numVals == 0) in createQuery()
240 numVals = &nv; in createQuery()
241 *numVals = 0; in createQuery()
299 if (rvq->colVal[n].numVals > 1) in createQuery()
300 niv *= rvq->colVal[n].numVals; in createQuery()
303 *numVals = 1; in createQuery()
309 freeRuleValue(rvq, *numVals); in createQuery()
310 *numVals = 0; in createQuery()
341 if (niv > 1 && *numVals == 1) { in createQuery()
[all …]
H A Dldap_ldap.c79 if (eVal->type != vt_string || eVal->numVals <= 0) { in lookupLDAP()
86 eVal->numVals == 1 && in lookupLDAP()
243 val == 0 || val->numVals < -1 || val->numVals == 0) in storeLDAP()
305 eVal->numVals <= 0) { in storeLDAP()
344 if (val->numVals > 0) { in storeLDAP()
362 if (index < val->numVals) in storeLDAP()
365 six = val->numVals - 1; in storeLDAP()
367 nix = 1 + (six - (val->numVals - 1)); in storeLDAP()
382 rv->attrVal[0].numVals++; in storeLDAP()
H A Dldap_map.c199 int n, numVals, numMatches = 0; in mapFromLDAP() local
227 for (numVals = 0, n = 0; n < numMatches; n++) { in mapFromLDAP()
262 for (i = 0; i < numVals; i++) in mapFromLDAP()
300 numVals = nqt; in mapFromLDAP()
307 (numVals+nqt) * sizeof (q[0])); in mapFromLDAP()
310 (numVals+nqt) * sizeof (attr[0])); in mapFromLDAP()
315 (numVals+nqt) * sizeof (q[0])); in mapFromLDAP()
316 for (i = 0; i < numVals; i++) in mapFromLDAP()
326 freeObjAttr(attr, numVals); in mapFromLDAP()
333 (void) memcpy(&q[numVals], qt, in mapFromLDAP()
[all …]
H A Dldap_op.c317 for (j = 0; j < rv->attrVal[i].numVals; j++) { in createLdapRequest()
1349 int stat, numEntries, numVals, tnv, done, lprEc; in ldapSearch() local
1401 freeRuleValue(rv, numVals); in ldapSearch()
1420 freeRuleValue(rv, numVals); in ldapSearch()
1438 freeRuleValue(rv, numVals); in ldapSearch()
1448 numVals = 0; in ldapSearch()
1474 freeRuleValue(rv, numVals); in ldapSearch()
1499 freeRuleValue(rv, numVals); in ldapSearch()
1540 freeRuleValue(rv, numVals); in ldapSearch()
1552 freeRuleValue(rv, numVals); in ldapSearch()
[all …]
H A Dldap_print.c40 for (i = 0; i < val->numVals; i++) { in printMappingFormat()
57 for (i = 0; i < val->numVals; i++) { in printMappingFormatArray()
111 for (j = 0; j < val->numVals; j++) { in printMappingItem()
320 if (rv->colVal[i].numVals == 1) { in printRuleValue()
333 for (j = 0; j < rv->colVal[i].numVals; j++) { in printRuleValue()
355 if (rv->attrVal[i].numVals == 1) { in printRuleValue()
370 for (j = 0; j < rv->attrVal[i].numVals; j++) { in printRuleValue()
H A Dldap_structs.h60 int numVals; member
H A Dldap_nisdbquery.h49 __nis_rule_value_t **rvP, int *numVals);
H A Dldap_ruleval.h83 int *numVals);
H A Dldap_val.h116 __nis_value_t *inVal, int *numVals,
H A Dldap_util.c725 for (i = 0; i < val->numVals; i++) { in escapeSpecialChars()
768 for (i = 0; i < val->numVals; i++) { in removeEscapeChars()
H A Dldap_attr.c423 rv[irv].attrVal[iv].numVals >= 1 && in findDNs()
/illumos-gate/usr/src/lib/libnisdb/yptol/
H A Ddit_access_utils.c89 val->numVals = 1; in stringToValue()
130 int i, j, res, numVals, oldlen, count; in processSplitField() local
163 tempVal, &numVals, sepset, &str); in processSplitField()
178 for (j = 0; j < numVals; j++) in processSplitField()
188 for (j = 0; j < numVals; j++) { in processSplitField()
196 for (; j < numVals; j++) in processSplitField()
256 int valueLen, comLen, numVals, nr, count = 1; in datumToRuleValue() local
368 &numVals, 0, 0); in datumToRuleValue()
388 for (i = 0, *statP = SUCCESS; i < numVals; i++) { in datumToRuleValue()
446 for (i = 0; i < numVals; i++) in datumToRuleValue()
[all …]
H A Ddit_access_utils.h68 int numVals, char *domain);