Lines Matching refs:val

40 	__nis_value_t		*val;
49 val = getMappingElement(e, mit_any, rv, NULL);
54 return (val);
60 __nis_value_t *val, *eVal = 0;
86 eVal->val[0].length > 0 &&
87 eVal->val[0].value != 0)
88 ename = eVal->val[0].value;
97 filter = eVal->val[0].value;
174 for (i = 0, val = 0; i < nrv; i++) {
178 eVal = concatenateValues(val,
180 freeValue(val, 1);
185 val = eVal;
192 return (val);
196 * Store 'val' at the LDAP location indicated by 'item'. As usual,
197 * val->numVals == -1 indicates deletion.
204 * index >= val->numVals
205 * Store val->val[val->numVals-1]
208 * Store val->val[index]
211 * Store val->val[index...val->numVals-1]
230 __nis_value_t *val, __nis_object_dn_t *defDN,
242 val == 0 || val->numVals < -1 || val->numVals == 0)
308 ls.filter = eVal->val[0].value;
341 if (val->numVals > 0) {
356 * What's the start index in val->val[], and how many elements
359 if (index < val->numVals)
362 six = val->numVals - 1;
364 nix = 1 + (six - (val->numVals - 1));
369 rv->attrVal[0].val = am(myself,
370 nix * sizeof (rv->attrVal[0].val[0]));
371 if (rv->attrName[0] == 0 || rv->attrVal[0].val == 0) {
380 rv->attrVal[0].val[ix-six].value =
381 am(myself, val->val[ix].length);
382 if (rv->attrVal[0].val[ix-six].value == 0 &&
383 val->val[ix].value != 0) {
389 rv->attrVal[0].val[ix-six].length =
390 val->val[ix].length;
391 if (rv->attrVal[0].val[ix-six].length > 0) {
392 (void) memcpy(rv->attrVal[0].val[ix-six].value,
393 val->val[ix].value,
394 rv->attrVal[0].val[ix-six].length);
397 rv->attrVal[0].type = val->type;
400 * We already rejected val->numvals < -1 and val->numVals == 0