Lines Matching +defs:val +defs:index
44 __nis_value_t *val;
53 val = getMappingElement(e, mit_any, rv, NULL);
58 return (val);
64 __nis_value_t *val, *eVal = 0;
90 eVal->val[0].length > 0 &&
91 eVal->val[0].value != 0)
92 ename = eVal->val[0].value;
101 filter = eVal->val[0].value;
178 for (i = 0, val = 0; i < nrv; i++) {
182 eVal = concatenateValues(val,
184 freeValue(val, 1);
189 val = eVal;
196 return (val);
200 * Store 'val' at the LDAP location indicated by 'item'. As usual,
201 * val->numVals == -1 indicates deletion.
203 * The 'index' and 'numIndexes' parameters are used as follows:
205 * index < 0 || index >= numIndexes
208 * index >= val->numVals
209 * Store val->val[val->numVals-1]
211 * item->repeat == 0 || index < numIndexes
212 * Store val->val[index]
214 * Else (repeat != 0 && index == numIndexes-1)
215 * Store val->val[index...val->numVals-1]
233 storeLDAP(__nis_mapping_item_t *item, int index, int numIndexes,
234 __nis_value_t *val, __nis_object_dn_t *defDN,
245 index < 0 || index >= numIndexes ||
246 val == 0 || val->numVals < -1 || val->numVals == 0)
314 ls.filter = eVal->val[0].value;
347 if (val->numVals > 0) {
362 * What's the start index in val->val[], and how many elements
365 if (index < val->numVals)
366 six = index;
368 six = val->numVals - 1;
369 if (item->repeat && index == (numIndexes - 1))
370 nix = 1 + (six - (val->numVals - 1));
375 rv->attrVal[0].val = am(myself,
376 nix * sizeof (rv->attrVal[0].val[0]));
377 if (rv->attrName[0] == 0 || rv->attrVal[0].val == 0) {
386 rv->attrVal[0].val[ix-six].value =
387 am(myself, val->val[ix].length);
388 if (rv->attrVal[0].val[ix-six].value == 0 &&
389 val->val[ix].value != 0) {
395 rv->attrVal[0].val[ix-six].length =
396 val->val[ix].length;
397 if (rv->attrVal[0].val[ix-six].length > 0) {
398 (void) memcpy(rv->attrVal[0].val[ix-six].value,
399 val->val[ix].value,
400 rv->attrVal[0].val[ix-six].length);
403 rv->attrVal[0].type = val->type;
406 * We already rejected val->numvals < -1 and val->numVals == 0