| /illumos-gate/usr/src/lib/libnisdb/ |
| H A D | ldap_ruleval.c | 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
1031 mergeRuleValueWithSameDN(__nis_rule_value_t *rv, int *numVals) argument
[all...] |
| H A D | ldap_structs.h | 62 int numVals; member in struct:__anon3621
|
| H A D | ldap_nisdbquery.c | 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'
225 createQuery(int num, char **index, __nis_table_mapping_t *t, __nis_rule_value_t **rvP, int *numVals) argument
[all...] |
| H A D | ldap_val.c | 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; ) {
2091 matchMappingItem(__nis_mapping_format_t *f, __nis_value_t *inVal, int *numVals, char *sepset, char **outstr) argument
[all...] |
| H A D | ldap_ldap.c | 82 if (eVal->type != vt_string || eVal->numVals <= 0) {
89 eVal->numVals == 1 &&
201 * val->numVals == -1 indicates deletion.
208 * index >= val->numVals
209 * Store val->val[val->numVals-1]
215 * Store val->val[index...val->numVals-1]
246 val == 0 || val->numVals < -1 || val->numVals == 0)
308 eVal->numVals <= 0) {
347 if (val->numVals >
[all...] |
| H A D | ldap_map.c | 201 int n, numVals, numMatches = 0; local
229 for (numVals = 0, n = 0; n < numMatches; n++) {
264 for (i = 0; i < numVals; i++)
302 numVals = nqt;
309 (numVals+nqt) * sizeof (q[0]));
312 (numVals+nqt) * sizeof (attr[0]));
317 (numVals+nqt) * sizeof (q[0]));
318 for (i = 0; i < numVals; i++)
328 freeObjAttr(attr, numVals);
335 (void) memcpy(&q[numVals], q
[all...] |
| H A D | ldap_nisdbquery.h | 51 __nis_rule_value_t **rvP, int *numVals);
|
| H A D | ldap_ruleval.h | 85 int *numVals);
|
| H A D | ldap_print.c | 42 for (i = 0; i < val->numVals; i++) {
59 for (i = 0; i < val->numVals; i++) {
113 for (j = 0; j < val->numVals; j++) {
322 if (rv->colVal[i].numVals == 1) {
335 for (j = 0; j < rv->colVal[i].numVals; j++) {
357 if (rv->attrVal[i].numVals == 1) {
372 for (j = 0; j < rv->attrVal[i].numVals; j++) {
|
| H A D | ldap_op.c | 317 for (j = 0; j < rv->attrVal[i].numVals; j++) {
1349 int stat, numEntries, numVals, tnv, done, lprEc; local
1401 freeRuleValue(rv, numVals);
1420 freeRuleValue(rv, numVals);
1438 freeRuleValue(rv, numVals);
1448 numVals = 0;
1474 freeRuleValue(rv, numVals);
1499 freeRuleValue(rv, numVals);
1540 freeRuleValue(rv, numVals);
1552 freeRuleValue(rv, numVals);
[all...] |
| H A D | ldap_val.h | 118 __nis_value_t *inVal, int *numVals,
|
| H A D | ldap_util.c | 725 for (i = 0; i < val->numVals; i++) {
768 for (i = 0; i < val->numVals; i++) {
|
| H A D | ldap_attr.c | 423 rv[irv].attrVal[iv].numVals >= 1 &&
|
| /illumos-gate/usr/src/lib/libnisdb/yptol/ |
| H A D | dit_access_utils.c | 89 val->numVals = 1;
130 int i, j, res, numVals, oldlen, count; local
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; local
368 &numVals, 0, 0);
383 * This code assumes that numVals will be less than or
388 for (i = 0, *statP = SUCCESS; i < numVals;
507 addSplitFieldValues(__nis_table_mapping_t *t, __nis_rule_value_t *rv, __nis_rule_value_t *trv, int numVals, char *domain) argument
[all...] |
| H A D | dit_access_utils.h | 68 int numVals, char *domain);
|