Lines Matching refs:val
321 rv->attrName[i], rv->attrVal[i].val[j].value);
717 char *attr[2], *a, **val;
738 val = ldap_get_values(lc->ld, e, a);
739 if (val == 0) {
746 if (e == 0 || a == 0 || val == 0) {
756 for (i = 0; val[i] != 0; i++) {
757 if (strstr(val[i], *ctrl) != 0) {
770 ldap_value_free(val);
1640 struct berval **val;
1643 val = ldap_get_values_len(lc->ld, m, nm);
1644 nv = (val == 0) ? 0 :
1645 ldap_count_values_len(val);
1655 val[i]->bv_val,
1656 val[i]->bv_len,
1660 ldap_value_free_len(val);
1676 if (val != 0)
1677 ldap_value_free_len(val);
1969 rv->attrVal[i].val[j].length + 1);
1975 rv->attrVal[i].val[j].value,
1976 rv->attrVal[i].val[j].length);
1995 rv->attrVal[i].val[j].length);
2001 rv->attrVal[i].val[j].length;
2003 rv->attrVal[i].val[j].value,
2014 * Remove 'value' from 'val'. If value==0, remove the entire
2015 * __nis_single_value_t array from 'val'.
2018 removeSingleValue(__nis_value_t *val, void *value, int length) {
2021 if (val == 0)
2025 for (i = 0; i < val->numVals; i++) {
2026 sfree(val->val[i].value);
2028 sfree(val->val);
2029 val->val = 0;
2030 val->numVals = 0;
2034 for (i = 0; i < val->numVals; i++) {
2035 if (val->val[i].value == 0 || (val->val[i].length != length))
2037 if (memcmp(val->val[i].value, value, length) != 0)
2039 sfree(val->val[i].value);
2040 if (i != (val->numVals - 1)) {
2041 (void) memmove(&val->val[i], &val->val[i+1],
2042 (val->numVals - 1 - i) * sizeof (val->val[0]));
2044 val->numVals -= 1;
2141 rvldap->attrVal[ocrvldap].val[i].value,
2142 rvldap->attrVal[ocrvldap].val[i].length);