openldap/servers/slapd/back-ldbm/attribute.c

153 lines
3.3 KiB
C
Raw Normal View History

2000-06-22 01:41:49 +08:00
/* attribute.c - ldbm backend acl attribute routine */
/* $OpenLDAP$ */
/*
* Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
#include "portable.h"
#include <stdio.h>
#include <ac/socket.h>
#include <ac/string.h>
#include "slap.h"
#include "back-ldbm.h"
#include "proto-back-ldbm.h"
/* return LDAP_SUCCESS IFF we can retrieve the attributes
2000-06-22 01:41:49 +08:00
* of entry with e_ndn
*/
int
ldbm_back_attribute(
Backend *be,
Connection *conn,
Operation *op,
Entry *target,
const char *e_ndn,
AttributeDescription *entry_at,
struct berval ***vals
2000-06-22 01:41:49 +08:00
)
{
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
Entry *e;
int i, j, rc;
2000-06-22 01:41:49 +08:00
Attribute *attr;
struct berval **v;
2000-06-22 01:41:49 +08:00
const char *entry_at_name = entry_at->ad_cname->bv_val;
Debug( LDAP_DEBUG_ARGS,
"=> ldbm_back_attribute: gr dn: \"%s\"\n",
e_ndn, 0, 0 );
Debug( LDAP_DEBUG_ARGS,
"=> ldbm_back_attribute: at: \"%s\"\n",
entry_at_name, 0, 0 );
Debug( LDAP_DEBUG_ARGS,
"=> ldbm_back_attribute: tr dn: \"%s\"\n",
target ? target->e_ndn : "", 0, 0 );
if (target != NULL && strcmp(target->e_ndn, e_ndn) == 0) {
/* we already have a LOCKED copy of the entry */
e = target;
Debug( LDAP_DEBUG_ARGS,
"=> ldbm_back_attribute: target is entry: \"%s\"\n",
e_ndn, 0, 0 );
} else {
/* can we find entry with reader lock */
if ((e = dn2entry_r(be, e_ndn, NULL )) == NULL) {
Debug( LDAP_DEBUG_ACL,
"=> ldbm_back_attribute: cannot find entry: \"%s\"\n",
e_ndn, 0, 0 );
return LDAP_NO_SUCH_OBJECT;
2000-06-22 01:41:49 +08:00
}
Debug( LDAP_DEBUG_ACL,
"=> ldbm_back_attribute: found entry: \"%s\"\n",
e_ndn, 0, 0 );
}
/* find attribute values */
2000-06-22 01:41:49 +08:00
if( is_entry_alias( e ) ) {
Debug( LDAP_DEBUG_ACL,
"<= ldbm_back_attribute: entry is an alias\n", 0, 0, 0 );
rc = LDAP_ALIAS_PROBLEM;
2000-06-22 01:41:49 +08:00
goto return_results;
}
if( is_entry_referral( e ) ) {
Debug( LDAP_DEBUG_ACL,
"<= ldbm_back_attribute: entry is an referral\n", 0, 0, 0 );
rc = LDAP_REFERRAL;
2000-06-22 01:41:49 +08:00
goto return_results;
}
if (conn != NULL && op != NULL
&& access_allowed(be, conn, op, e, slap_schema.si_ad_entry,
NULL, ACL_READ) == 0)
2000-06-22 01:41:49 +08:00
{
rc = LDAP_INSUFFICIENT_ACCESS;
2000-06-22 01:41:49 +08:00
goto return_results;
}
if ((attr = attr_find(e->e_attrs, entry_at)) == NULL) {
Debug( LDAP_DEBUG_ACL,
"<= ldbm_back_attribute: failed to find %s\n",
entry_at_name, 0, 0 );
rc = LDAP_NO_SUCH_ATTRIBUTE;
2000-06-22 01:41:49 +08:00
goto return_results;
}
if (conn != NULL && op != NULL
&& access_allowed(be, conn, op, e, entry_at, NULL, ACL_READ) == 0)
2000-06-22 01:41:49 +08:00
{
rc = LDAP_INSUFFICIENT_ACCESS;
2000-06-22 01:41:49 +08:00
goto return_results;
}
for ( i = 0; attr->a_vals[i] != NULL; i++ ) {
/* count them */
}
v = (struct berval **) ch_malloc( sizeof(struct berval *) * (i+1) );
for ( i=0, j=0; attr->a_vals[i] != NULL; i++ ) {
if( conn != NULL
&& op != NULL
&& access_allowed(be, conn, op, e, entry_at,
attr->a_vals[i], ACL_READ) == 0)
{
continue;
2000-06-22 01:41:49 +08:00
}
v[j] = ber_bvdup( attr->a_vals[i] );
if( v[j] != NULL ) j++;
}
if( j == 0 ) {
ch_free( v );
*vals = NULL;
rc = LDAP_INSUFFICIENT_ACCESS;
} else {
2000-06-22 01:41:49 +08:00
v[j] = NULL;
*vals = v;
rc = LDAP_SUCCESS;
2000-06-22 01:41:49 +08:00
}
return_results:
if( target != e ) {
/* free entry and reader lock */
cache_return_entry_r( &li->li_cache, e );
}
Debug( LDAP_DEBUG_TRACE,
"ldbm_back_attribute: rc=%d nvals=%d\n",
rc, j, 0 );
2000-06-22 01:41:49 +08:00
return(rc);
}