1999-05-26 10:35:20 +08:00
|
|
|
/* search.c - ldap backend search function */
|
1999-09-09 03:06:24 +08:00
|
|
|
/* $OpenLDAP$ */
|
2001-01-17 15:09:22 +08:00
|
|
|
/*
|
|
|
|
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
|
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*/
|
|
|
|
/* This is an altered version */
|
1999-05-26 10:35:20 +08:00
|
|
|
/*
|
|
|
|
* Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
|
|
|
|
*
|
|
|
|
* Permission is granted to anyone to use this software for any purpose
|
|
|
|
* on any computer system, and to alter it and redistribute it, subject
|
|
|
|
* to the following restrictions:
|
|
|
|
*
|
|
|
|
* 1. The author is not responsible for the consequences of use of this
|
|
|
|
* software, no matter how awful, even if they arise from flaws in it.
|
|
|
|
*
|
|
|
|
* 2. The origin of this software must not be misrepresented, either by
|
|
|
|
* explicit claim or by omission. Since few users ever read sources,
|
|
|
|
* credits should appear in the documentation.
|
|
|
|
*
|
|
|
|
* 3. Altered versions must be plainly marked as such, and must not be
|
|
|
|
* misrepresented as being the original software. Since few users
|
|
|
|
* ever read sources, credits should appear in the documentation.
|
|
|
|
*
|
|
|
|
* 4. This notice may not be removed or altered.
|
2001-01-20 05:27:20 +08:00
|
|
|
*
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Copyright 2000, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
|
|
|
|
*
|
|
|
|
* This software is being modified by Pierangelo Masarati.
|
|
|
|
* The previously reported conditions apply to the modified code as well.
|
|
|
|
* Changes in the original code are highlighted where required.
|
|
|
|
* Credits for the original code go to the author, Howard Chu.
|
1999-05-26 10:35:20 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "portable.h"
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#include <ac/socket.h>
|
|
|
|
#include <ac/string.h>
|
1999-05-26 18:45:51 +08:00
|
|
|
#include <ac/time.h>
|
1999-05-26 10:35:20 +08:00
|
|
|
|
|
|
|
#include "slap.h"
|
|
|
|
#include "back-ldap.h"
|
|
|
|
|
1999-09-02 16:05:17 +08:00
|
|
|
static void ldap_send_entry( Backend *be, Operation *op, struct ldapconn *lc,
|
2001-12-26 16:17:44 +08:00
|
|
|
LDAPMessage *e, struct berval **attrs, int attrsonly );
|
1999-09-02 16:05:17 +08:00
|
|
|
|
1999-05-26 10:35:20 +08:00
|
|
|
int
|
|
|
|
ldap_back_search(
|
|
|
|
Backend *be,
|
|
|
|
Connection *conn,
|
|
|
|
Operation *op,
|
2000-05-22 11:55:03 +08:00
|
|
|
const char *base,
|
|
|
|
const char *nbase,
|
1999-05-26 10:35:20 +08:00
|
|
|
int scope,
|
|
|
|
int deref,
|
2001-08-04 19:10:35 +08:00
|
|
|
int slimit,
|
|
|
|
int tlimit,
|
1999-05-26 10:35:20 +08:00
|
|
|
Filter *filter,
|
2000-05-22 11:55:03 +08:00
|
|
|
const char *filterstr,
|
2001-12-26 16:17:44 +08:00
|
|
|
struct berval **attrs,
|
1999-05-26 10:35:20 +08:00
|
|
|
int attrsonly
|
|
|
|
)
|
|
|
|
{
|
|
|
|
struct ldapinfo *li = (struct ldapinfo *) be->be_private;
|
|
|
|
struct ldapconn *lc;
|
|
|
|
struct timeval tv;
|
|
|
|
LDAPMessage *res, *e;
|
2001-05-12 08:51:28 +08:00
|
|
|
int count, rc = 0, msgid, sres = LDAP_SUCCESS;
|
1999-05-26 10:35:20 +08:00
|
|
|
char *match = NULL, *err = NULL;
|
2001-05-12 08:51:28 +08:00
|
|
|
char *mbase = NULL, *mapped_filter = NULL, **mapped_attrs = NULL;
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
char *mfilter = NULL, *mmatch = NULL;
|
|
|
|
#endif /* ENABLE_REWRITE */
|
2001-08-04 19:10:35 +08:00
|
|
|
struct slap_limits_set *limit = NULL;
|
|
|
|
int isroot = 0;
|
2001-01-20 05:27:20 +08:00
|
|
|
|
1999-05-26 10:35:20 +08:00
|
|
|
lc = ldap_back_getconn(li, conn, op);
|
2001-01-20 05:27:20 +08:00
|
|
|
if ( !lc ) {
|
1999-05-26 10:35:20 +08:00
|
|
|
return( -1 );
|
2001-01-20 05:27:20 +08:00
|
|
|
}
|
1999-05-26 10:35:20 +08:00
|
|
|
|
2001-08-04 19:10:35 +08:00
|
|
|
/* if not root, get appropriate limits */
|
2001-12-26 03:48:26 +08:00
|
|
|
if ( be_isroot( be, &op->o_ndn ) ) {
|
2001-08-04 19:10:35 +08:00
|
|
|
isroot = 1;
|
|
|
|
} else {
|
2001-12-24 23:11:01 +08:00
|
|
|
( void ) get_limits( be, op->o_ndn.bv_val, &limit );
|
2001-08-04 19:10:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* if no time limit requested, rely on remote server limits */
|
|
|
|
/* if requested limit higher than hard limit, abort */
|
|
|
|
if ( !isroot && tlimit > limit->lms_t_hard ) {
|
|
|
|
/* no hard limit means use soft instead */
|
|
|
|
if ( limit->lms_t_hard == 0 ) {
|
|
|
|
tlimit = limit->lms_t_soft;
|
|
|
|
|
|
|
|
/* positive hard limit means abort */
|
|
|
|
} else if ( limit->lms_t_hard > 0 ) {
|
|
|
|
send_search_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
|
|
|
|
NULL, NULL, NULL, NULL, 0 );
|
|
|
|
rc = 0;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* negative hard limit means no limit */
|
|
|
|
}
|
|
|
|
|
|
|
|
/* if no size limit requested, rely on remote server limits */
|
|
|
|
/* if requested limit higher than hard limit, abort */
|
|
|
|
if ( !isroot && slimit > limit->lms_s_hard ) {
|
|
|
|
/* no hard limit means use soft instead */
|
|
|
|
if ( limit->lms_s_hard == 0 ) {
|
|
|
|
slimit = limit->lms_s_soft;
|
|
|
|
|
|
|
|
/* positive hard limit means abort */
|
|
|
|
} else if ( limit->lms_s_hard > 0 ) {
|
|
|
|
send_search_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
|
|
|
|
NULL, NULL, NULL, NULL, 0 );
|
|
|
|
rc = 0;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* negative hard limit means no limit */
|
|
|
|
}
|
|
|
|
|
1999-05-26 10:35:20 +08:00
|
|
|
if (deref != -1)
|
|
|
|
ldap_set_option( lc->ld, LDAP_OPT_DEREF, (void *)&deref);
|
2001-08-04 19:10:35 +08:00
|
|
|
if (tlimit != -1)
|
|
|
|
ldap_set_option( lc->ld, LDAP_OPT_TIMELIMIT, (void *)&tlimit);
|
|
|
|
if (slimit != -1)
|
|
|
|
ldap_set_option( lc->ld, LDAP_OPT_SIZELIMIT, (void *)&slimit);
|
2001-01-20 05:27:20 +08:00
|
|
|
|
|
|
|
if ( !ldap_back_dobind( lc, op ) ) {
|
|
|
|
return( -1 );
|
|
|
|
}
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
/*
|
|
|
|
* Rewrite the search base, if required
|
|
|
|
*/
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
switch ( rewrite_session( li->rwinfo, "searchBase",
|
|
|
|
base, conn, &mbase ) ) {
|
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
if ( mbase == NULL ) {
|
|
|
|
mbase = ( char * )base;
|
|
|
|
}
|
2001-05-17 06:55:44 +08:00
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
|
|
|
|
"[rw] searchBase: \"%s\" -> \"%s\"\n%",
|
|
|
|
base, mbase ));
|
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS, "rw> searchBase: \"%s\" -> \"%s\"\n%s",
|
|
|
|
base, mbase, "" );
|
2001-05-17 06:55:44 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
|
|
|
send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
|
|
|
|
NULL, "Unwilling to perform", NULL, NULL );
|
2001-05-17 06:55:44 +08:00
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
2001-05-17 06:55:44 +08:00
|
|
|
send_ldap_result( conn, op, LDAP_OPERATIONS_ERROR,
|
|
|
|
NULL, "Operations error", NULL, NULL );
|
2001-05-12 08:51:28 +08:00
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
1999-05-26 10:35:20 +08:00
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewrite the search filter, if required
|
|
|
|
*/
|
|
|
|
switch ( rewrite_session( li->rwinfo, "searchFilter",
|
|
|
|
filterstr, conn, &mfilter ) ) {
|
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
if ( mfilter == NULL || mfilter[0] == '\0') {
|
|
|
|
if ( mfilter != NULL ) {
|
|
|
|
free( mfilter );
|
|
|
|
}
|
|
|
|
mfilter = ( char * )filterstr;
|
|
|
|
}
|
2001-05-17 06:55:44 +08:00
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
|
|
|
|
"[rw] searchFilter: \"%s\" -> \"%s\"\n",
|
|
|
|
filterstr, mfilter ));
|
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS,
|
|
|
|
"rw> searchFilter: \"%s\" -> \"%s\"\n%s",
|
|
|
|
filterstr, mfilter, "" );
|
2001-05-17 06:55:44 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
|
|
|
send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
|
|
|
|
NULL, "Unwilling to perform", NULL, NULL );
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
#else /* !ENABLE_REWRITE */
|
|
|
|
mbase = ldap_back_dn_massage( li, ch_strdup( base ), 0 );
|
|
|
|
#endif /* !ENABLE_REWRITE */
|
1999-05-26 10:35:20 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
mapped_filter = ldap_back_map_filter(&li->at_map, &li->oc_map,
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
(char *)mfilter,
|
|
|
|
#else /* !ENABLE_REWRITE */
|
|
|
|
(char *)filterstr,
|
|
|
|
#endif /* !ENABLE_REWRITE */
|
|
|
|
0);
|
2001-02-20 03:14:12 +08:00
|
|
|
if ( mapped_filter == NULL ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
mapped_filter = (char *)mfilter;
|
|
|
|
#else /* !ENABLE_REWRITE */
|
2001-02-20 03:14:12 +08:00
|
|
|
mapped_filter = (char *)filterstr;
|
2001-05-12 08:51:28 +08:00
|
|
|
#endif /* !ENABLE_REWRITE */
|
2001-02-20 03:14:12 +08:00
|
|
|
}
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
mapped_attrs = ldap_back_map_attrs(&li->at_map, attrs, 0);
|
2001-12-26 17:19:57 +08:00
|
|
|
if ( mapped_attrs == NULL && attrs) {
|
|
|
|
for (count=0; attrs[count]; count++);
|
|
|
|
mapped_attrs = ch_malloc( (count+1) * sizeof(char *));
|
|
|
|
for (count=0; attrs[count]; count++) {
|
|
|
|
mapped_attrs[count] = attrs[count]->bv_val;
|
|
|
|
}
|
|
|
|
mapped_attrs[count] = NULL;
|
2001-02-20 03:14:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if ((msgid = ldap_search(lc->ld, mbase, scope, mapped_filter, mapped_attrs,
|
1999-05-26 10:35:20 +08:00
|
|
|
attrsonly)) == -1)
|
2001-02-20 03:14:12 +08:00
|
|
|
{
|
2001-06-03 16:53:13 +08:00
|
|
|
fail:;
|
2001-05-12 08:51:28 +08:00
|
|
|
rc = ldap_back_op_result(lc, op);
|
|
|
|
goto finish;
|
2001-02-20 03:14:12 +08:00
|
|
|
}
|
1999-05-26 10:35:20 +08:00
|
|
|
|
|
|
|
/* We pull apart the ber result, stuff it into a slapd entry, and
|
|
|
|
* let send_search_entry stuff it back into ber format. Slow & ugly,
|
|
|
|
* but this is necessary for version matching, and for ACL processing.
|
|
|
|
*/
|
|
|
|
|
2001-02-20 03:14:12 +08:00
|
|
|
for ( count=0, rc=0;
|
|
|
|
rc != -1;
|
|
|
|
rc = ldap_result(lc->ld, LDAP_RES_ANY, 0, &tv, &res))
|
|
|
|
{
|
1999-05-26 10:35:20 +08:00
|
|
|
int ab;
|
|
|
|
|
|
|
|
/* check for abandon */
|
|
|
|
ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
|
|
|
|
ab = op->o_abandon;
|
|
|
|
ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
|
|
|
|
|
|
|
|
if (ab) {
|
|
|
|
ldap_abandon(lc->ld, msgid);
|
2001-05-12 08:51:28 +08:00
|
|
|
rc = 0;
|
2001-02-20 03:14:12 +08:00
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
if (rc == 0) {
|
1999-05-26 10:35:20 +08:00
|
|
|
tv.tv_sec = 0;
|
|
|
|
tv.tv_usec = 100000;
|
|
|
|
ldap_pvt_thread_yield();
|
|
|
|
} else if (rc == LDAP_RES_SEARCH_ENTRY) {
|
|
|
|
e = ldap_first_entry(lc->ld,res);
|
2001-02-21 00:08:14 +08:00
|
|
|
ldap_send_entry(be, op, lc, e, attrs, attrsonly);
|
2001-02-20 03:14:12 +08:00
|
|
|
count++;
|
1999-09-02 20:08:43 +08:00
|
|
|
ldap_msgfree(res);
|
1999-05-26 10:35:20 +08:00
|
|
|
} else {
|
|
|
|
sres = ldap_result2error(lc->ld, res, 1);
|
2000-10-23 21:32:14 +08:00
|
|
|
sres = ldap_back_map_result(sres);
|
1999-05-26 10:35:20 +08:00
|
|
|
ldap_get_option(lc->ld, LDAP_OPT_ERROR_STRING, &err);
|
1999-06-06 04:27:43 +08:00
|
|
|
ldap_get_option(lc->ld, LDAP_OPT_MATCHED_DN, &match);
|
1999-05-26 10:35:20 +08:00
|
|
|
rc = 0;
|
|
|
|
break;
|
2001-02-20 03:14:12 +08:00
|
|
|
}
|
1999-05-26 10:35:20 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (rc == -1)
|
|
|
|
goto fail;
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
/*
|
|
|
|
* Rewrite the matched portion of the search base, if required
|
|
|
|
*/
|
|
|
|
if ( match != NULL ) {
|
|
|
|
switch ( rewrite_session( li->rwinfo, "matchedDn",
|
|
|
|
match, conn, &mmatch ) ) {
|
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
if ( mmatch == NULL ) {
|
|
|
|
mmatch = ( char * )match;
|
|
|
|
}
|
2001-05-17 06:55:44 +08:00
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
|
|
|
|
"[rw] matchedDn:"
|
|
|
|
" \"%s\" -> \"%s\"\n",
|
|
|
|
match, mmatch ));
|
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS, "rw> matchedDn:"
|
2001-05-17 06:55:44 +08:00
|
|
|
" \"%s\" -> \"%s\"\n%s",
|
|
|
|
match, mmatch, "" );
|
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
|
|
|
send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
|
|
|
|
NULL, "Unwilling to perform",
|
|
|
|
NULL, NULL );
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
send_search_result( conn, op, sres,
|
|
|
|
mmatch, err, NULL, NULL, count );
|
|
|
|
|
|
|
|
#else /* !ENABLE_REWRITE */
|
1999-07-16 10:45:46 +08:00
|
|
|
send_search_result( conn, op, sres,
|
2001-02-20 03:14:12 +08:00
|
|
|
match, err, NULL, NULL, count );
|
2001-05-12 08:51:28 +08:00
|
|
|
#endif /* !ENABLE_REWRITE */
|
2001-02-20 03:14:12 +08:00
|
|
|
|
2001-06-03 16:53:13 +08:00
|
|
|
finish:;
|
2001-05-12 08:51:28 +08:00
|
|
|
if ( match ) {
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
if ( mmatch != match ) {
|
|
|
|
free( mmatch );
|
|
|
|
}
|
|
|
|
#endif /* ENABLE_REWRITE */
|
1999-05-26 10:35:20 +08:00
|
|
|
free(match);
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
if ( err ) {
|
|
|
|
free( err );
|
|
|
|
}
|
2001-12-26 17:19:57 +08:00
|
|
|
if ( mapped_attrs ) {
|
|
|
|
free( mapped_attrs );
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
if ( mapped_filter != mfilter ) {
|
|
|
|
free( mapped_filter );
|
|
|
|
}
|
|
|
|
if ( mfilter != filterstr ) {
|
|
|
|
free( mfilter );
|
|
|
|
}
|
|
|
|
#else /* !ENABLE_REWRITE */
|
|
|
|
if ( mapped_filter != filterstr ) {
|
|
|
|
free( mapped_filter );
|
|
|
|
}
|
|
|
|
#endif /* !ENABLE_REWRITE */
|
|
|
|
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
if ( mbase != base ) {
|
|
|
|
#endif /* ENABLE_REWRITE */
|
|
|
|
free( mbase );
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
}
|
|
|
|
#endif /* ENABLE_REWRITE */
|
|
|
|
|
|
|
|
return rc;
|
1999-05-26 10:35:20 +08:00
|
|
|
}
|
|
|
|
|
1999-09-02 16:05:17 +08:00
|
|
|
static void
|
1999-05-26 10:35:20 +08:00
|
|
|
ldap_send_entry(
|
|
|
|
Backend *be,
|
|
|
|
Operation *op,
|
|
|
|
struct ldapconn *lc,
|
|
|
|
LDAPMessage *e,
|
2001-12-26 16:17:44 +08:00
|
|
|
struct berval **attrs,
|
1999-05-26 10:35:20 +08:00
|
|
|
int attrsonly
|
|
|
|
)
|
|
|
|
{
|
2001-01-20 05:27:20 +08:00
|
|
|
struct ldapinfo *li = (struct ldapinfo *) be->be_private;
|
2001-02-20 03:14:12 +08:00
|
|
|
char *a, *mapped;
|
1999-05-26 10:35:20 +08:00
|
|
|
Entry ent;
|
|
|
|
BerElement *ber = NULL;
|
1999-07-26 06:13:52 +08:00
|
|
|
Attribute *attr, **attrp;
|
1999-05-26 10:35:20 +08:00
|
|
|
struct berval *dummy = NULL;
|
2001-02-20 03:14:12 +08:00
|
|
|
struct berval *bv;
|
2000-06-09 02:36:37 +08:00
|
|
|
const char *text;
|
1999-05-26 10:35:20 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
char *dn;
|
|
|
|
|
|
|
|
dn = ldap_get_dn(lc->ld, e);
|
|
|
|
if ( dn == NULL ) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewrite the dn of the result, if needed
|
|
|
|
*/
|
|
|
|
switch ( rewrite_session( li->rwinfo, "searchResult",
|
|
|
|
dn, lc->conn, &ent.e_dn ) ) {
|
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
if ( ent.e_dn == NULL ) {
|
|
|
|
ent.e_dn = dn;
|
|
|
|
} else {
|
2001-05-17 06:55:44 +08:00
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
|
|
|
|
"[rw] searchResult: \"%s\""
|
|
|
|
" -> \"%s\"\n", dn, ent.e_dn ));
|
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS, "rw> searchResult: \"%s\""
|
|
|
|
" -> \"%s\"\n%s", dn, ent.e_dn, "" );
|
2001-05-17 06:55:44 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
free( dn );
|
|
|
|
dn = NULL;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
|
|
|
free( dn );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#else /* !ENABLE_REWRITE */
|
2001-01-20 05:27:20 +08:00
|
|
|
ent.e_dn = ldap_back_dn_restore( li, ldap_get_dn(lc->ld, e), 0 );
|
2001-05-12 08:51:28 +08:00
|
|
|
#endif /* !ENABLE_REWRITE */
|
|
|
|
|
2001-01-20 05:27:20 +08:00
|
|
|
ent.e_ndn = ch_strdup( ent.e_dn );
|
1999-09-24 09:46:37 +08:00
|
|
|
(void) dn_normalize( ent.e_ndn );
|
1999-05-26 10:35:20 +08:00
|
|
|
ent.e_id = 0;
|
|
|
|
ent.e_attrs = 0;
|
|
|
|
ent.e_private = 0;
|
1999-07-26 06:13:52 +08:00
|
|
|
attrp = &ent.e_attrs;
|
1999-05-26 10:35:20 +08:00
|
|
|
|
2000-06-06 13:21:14 +08:00
|
|
|
for ( a = ldap_first_attribute(lc->ld, e, &ber);
|
|
|
|
a != NULL;
|
|
|
|
a = ldap_next_attribute(lc->ld, e, ber))
|
|
|
|
{
|
2001-02-20 03:14:12 +08:00
|
|
|
mapped = ldap_back_map(&li->at_map, a, 1);
|
|
|
|
if (mapped == NULL)
|
|
|
|
continue;
|
1999-07-26 06:13:52 +08:00
|
|
|
attr = (Attribute *)ch_malloc( sizeof(Attribute) );
|
2000-06-06 13:21:14 +08:00
|
|
|
if (attr == NULL)
|
|
|
|
continue;
|
1999-05-26 10:35:20 +08:00
|
|
|
attr->a_next = 0;
|
2001-01-17 14:32:26 +08:00
|
|
|
attr->a_desc = NULL;
|
2001-02-20 03:14:12 +08:00
|
|
|
if (slap_str2ad(mapped, &attr->a_desc, &text) != LDAP_SUCCESS) {
|
2001-10-04 02:17:08 +08:00
|
|
|
if (slap_str2undef_ad(mapped, &attr->a_desc, &text)
|
|
|
|
!= LDAP_SUCCESS) {
|
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
|
|
|
|
"slap_str2undef_ad(%s): "
|
|
|
|
"%s\n", mapped, text ));
|
|
|
|
#else /* !NEW_LOGGING */
|
|
|
|
Debug( LDAP_DEBUG_ANY,
|
|
|
|
"slap_str2undef_ad(%s): "
|
|
|
|
"%s\n%s", mapped, text, "" );
|
|
|
|
#endif /* !NEW_LOGGING */
|
|
|
|
|
|
|
|
ch_free(attr);
|
|
|
|
continue;
|
|
|
|
}
|
2001-02-20 03:14:12 +08:00
|
|
|
}
|
1999-05-26 10:35:20 +08:00
|
|
|
attr->a_vals = ldap_get_values_len(lc->ld, e, a);
|
2001-02-20 03:14:12 +08:00
|
|
|
if (!attr->a_vals) {
|
1999-05-26 10:35:20 +08:00
|
|
|
attr->a_vals = &dummy;
|
2001-02-20 03:14:12 +08:00
|
|
|
} else if ( strcasecmp( mapped, "objectclass" ) == 0 ) {
|
|
|
|
int i, last;
|
|
|
|
for ( last = 0; attr->a_vals[last]; last++ ) ;
|
2001-05-12 08:51:28 +08:00
|
|
|
for ( i = 0; ( bv = attr->a_vals[i] ); i++ ) {
|
2001-02-20 03:14:12 +08:00
|
|
|
mapped = ldap_back_map(&li->oc_map, bv->bv_val, 1);
|
|
|
|
if (mapped == NULL) {
|
|
|
|
ber_bvfree(attr->a_vals[i]);
|
|
|
|
attr->a_vals[i] = NULL;
|
|
|
|
if (--last < 0)
|
|
|
|
break;
|
|
|
|
attr->a_vals[i] = attr->a_vals[last];
|
|
|
|
attr->a_vals[last] = NULL;
|
|
|
|
i--;
|
|
|
|
} else if ( mapped != bv->bv_val ) {
|
|
|
|
ch_free(bv->bv_val);
|
|
|
|
bv->bv_val = ch_strdup( mapped );
|
|
|
|
bv->bv_len = strlen( mapped );
|
|
|
|
}
|
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
#ifdef ENABLE_REWRITE
|
|
|
|
/*
|
|
|
|
* It is necessary to try to rewrite attributes with
|
|
|
|
* dn syntax because they might be used in ACLs as
|
|
|
|
* members of groups; since ACLs are applied to the
|
|
|
|
* rewritten stuff, no dn-based subecj clause could
|
|
|
|
* be used at the ldap backend side (see
|
|
|
|
* http://www.OpenLDAP.org/faq/data/cache/452.html)
|
|
|
|
* The problem can be overcome by moving the dn-based
|
|
|
|
* ACLs to the target directory server, and letting
|
|
|
|
* everything pass thru the ldap backend.
|
|
|
|
*/
|
|
|
|
} else if ( strcmp( attr->a_desc->ad_type->sat_syntax->ssyn_oid,
|
|
|
|
SLAPD_DN_SYNTAX ) == 0 ) {
|
|
|
|
int i;
|
|
|
|
for ( i = 0; ( bv = attr->a_vals[ i ] ); i++ ) {
|
|
|
|
char *newval;
|
|
|
|
|
|
|
|
switch ( rewrite_session( li->rwinfo,
|
|
|
|
"searchResult",
|
|
|
|
bv->bv_val,
|
|
|
|
lc->conn, &newval )) {
|
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
/* left as is */
|
|
|
|
if ( newval == NULL ) {
|
|
|
|
break;
|
|
|
|
}
|
2001-05-17 06:55:44 +08:00
|
|
|
#ifdef NEW_LOGGING
|
|
|
|
LDAP_LOG(( "backend",
|
|
|
|
LDAP_LEVEL_DETAIL1,
|
|
|
|
"[rw] searchResult on"
|
|
|
|
" attr=%s:"
|
|
|
|
" \"%s\" -> \"%s\"\n",
|
2001-11-16 15:45:37 +08:00
|
|
|
attr->a_desc->ad_type->sat_cname.bv_val,
|
2001-05-17 06:55:44 +08:00
|
|
|
bv->bv_val, newval ));
|
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS,
|
|
|
|
"rw> searchResult on attr=%s: \"%s\" -> \"%s\"\n",
|
2001-11-16 15:45:37 +08:00
|
|
|
attr->a_desc->ad_type->sat_cname.bv_val,
|
2001-05-12 08:51:28 +08:00
|
|
|
bv->bv_val, newval );
|
2001-05-17 06:55:44 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
free( bv->bv_val );
|
|
|
|
bv->bv_val = newval;
|
|
|
|
bv->bv_len = strlen( newval );
|
|
|
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
|
|
|
/*
|
|
|
|
* FIXME: better give up,
|
|
|
|
* skip the attribute
|
|
|
|
* or leave it untouched?
|
|
|
|
*/
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* ENABLE_REWRITE */
|
2001-02-20 03:14:12 +08:00
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
|
1999-07-26 06:13:52 +08:00
|
|
|
*attrp = attr;
|
|
|
|
attrp = &attr->a_next;
|
1999-05-26 10:35:20 +08:00
|
|
|
}
|
1999-07-24 11:39:23 +08:00
|
|
|
send_search_entry( be, lc->conn, op, &ent, attrs, attrsonly, NULL );
|
2001-02-20 03:14:12 +08:00
|
|
|
while (ent.e_attrs) {
|
|
|
|
attr = ent.e_attrs;
|
1999-05-26 10:35:20 +08:00
|
|
|
ent.e_attrs = attr->a_next;
|
|
|
|
if (attr->a_vals != &dummy)
|
|
|
|
ber_bvecfree(attr->a_vals);
|
|
|
|
free(attr);
|
|
|
|
}
|
|
|
|
if (ber)
|
|
|
|
ber_free(ber,0);
|
2001-01-20 05:27:20 +08:00
|
|
|
|
|
|
|
if ( ent.e_dn )
|
|
|
|
free( ent.e_dn );
|
|
|
|
if ( ent.e_ndn )
|
|
|
|
free( ent.e_ndn );
|
1999-05-26 10:35:20 +08:00
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
|