2001-05-12 08:51:28 +08:00
|
|
|
/*
|
2003-01-04 04:20:47 +08:00
|
|
|
* Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
|
2001-05-12 08:51:28 +08:00
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*
|
|
|
|
* Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
|
|
|
|
*
|
|
|
|
* This work has been developed to fulfill the requirements
|
|
|
|
* of SysNet s.n.c. <http:www.sys-net.it> and it has been donated
|
|
|
|
* to the OpenLDAP Foundation in the hope that it may be useful
|
|
|
|
* to the Open Source community, but WITHOUT ANY WARRANTY.
|
|
|
|
*
|
|
|
|
* 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 and SysNet s.n.c. are 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.
|
|
|
|
* SysNet s.n.c. cannot be responsible for the consequences of the
|
|
|
|
* alterations.
|
|
|
|
*
|
|
|
|
* 4. This notice may not be removed or altered.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* This software is based on the backend back-ldap, implemented
|
|
|
|
* by Howard Chu <hyc@highlandsun.com>, and modified by Mark Valence
|
|
|
|
* <kurash@sassafras.com>, Pierangelo Masarati <ando@sys-net.it> and other
|
|
|
|
* contributors. The contribution of the original software to the present
|
|
|
|
* implementation is acknowledged in this copyright statement.
|
|
|
|
*
|
|
|
|
* A special acknowledgement goes to Howard for the overall architecture
|
|
|
|
* (and for borrowing large pieces of code), and to Mark, who implemented
|
|
|
|
* from scratch the attribute/objectclass mapping.
|
|
|
|
*
|
|
|
|
* The original copyright statement follows.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "portable.h"
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#include <ac/socket.h>
|
|
|
|
#include <ac/string.h>
|
|
|
|
#include <ac/time.h>
|
|
|
|
|
|
|
|
#include "slap.h"
|
|
|
|
#include "../back-ldap/back-ldap.h"
|
|
|
|
#include "back-meta.h"
|
|
|
|
#include "ldap_pvt.h"
|
2002-04-08 17:43:22 +08:00
|
|
|
#undef ldap_debug /* silence a warning in ldap-int.h */
|
2002-07-12 04:33:24 +08:00
|
|
|
#include "ldap_log.h"
|
2002-01-04 00:29:38 +08:00
|
|
|
#include "../../../libraries/libldap/ldap-int.h"
|
2001-05-12 08:51:28 +08:00
|
|
|
|
2002-08-14 01:00:33 +08:00
|
|
|
static int
|
2001-05-12 08:51:28 +08:00
|
|
|
meta_send_entry(
|
|
|
|
Operation *op,
|
2003-04-04 05:35:54 +08:00
|
|
|
SlapReply *rs,
|
2001-05-12 08:51:28 +08:00
|
|
|
struct metaconn *lc,
|
|
|
|
int i,
|
2003-04-04 05:35:54 +08:00
|
|
|
LDAPMessage *e
|
2001-05-12 08:51:28 +08:00
|
|
|
);
|
|
|
|
|
|
|
|
static int
|
|
|
|
is_one_level_rdn(
|
2001-12-27 20:17:54 +08:00
|
|
|
const char *rdn,
|
|
|
|
int from
|
2001-05-12 08:51:28 +08:00
|
|
|
);
|
|
|
|
|
|
|
|
int
|
2003-04-04 05:35:54 +08:00
|
|
|
meta_back_search( Operation *op, SlapReply *rs )
|
2001-05-12 08:51:28 +08:00
|
|
|
{
|
2003-04-04 05:35:54 +08:00
|
|
|
struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
|
2001-05-12 08:51:28 +08:00
|
|
|
struct metaconn *lc;
|
2002-08-10 01:15:10 +08:00
|
|
|
struct metasingleconn *lsc;
|
2002-08-10 22:13:46 +08:00
|
|
|
struct timeval tv = { 0, 0 };
|
2001-05-12 08:51:28 +08:00
|
|
|
LDAPMessage *res, *e;
|
|
|
|
int count, rc = 0, *msgid, sres = LDAP_NO_SUCH_OBJECT;
|
|
|
|
char *match = NULL, *err = NULL;
|
2002-01-04 23:26:45 +08:00
|
|
|
char *mbase = NULL, *mmatch = NULL;
|
2002-01-04 00:29:38 +08:00
|
|
|
struct berval mfilter;
|
2002-08-31 18:35:23 +08:00
|
|
|
BerVarray v2refs = NULL;
|
2001-05-12 08:51:28 +08:00
|
|
|
|
2003-02-11 05:37:30 +08:00
|
|
|
int i, last = 0, candidates = 0;
|
2001-08-04 01:15:14 +08:00
|
|
|
struct slap_limits_set *limit = NULL;
|
2001-08-04 19:10:08 +08:00
|
|
|
int isroot = 0;
|
2001-05-12 08:51:28 +08:00
|
|
|
|
2003-03-07 03:44:41 +08:00
|
|
|
#ifdef LDAP_CACHING
|
|
|
|
cache_manager* cm = li->cm;
|
|
|
|
|
|
|
|
if (cm->caching) {
|
2003-04-04 05:35:54 +08:00
|
|
|
return meta_back_cache_search(op->o_bd, op->o_conn, op,
|
|
|
|
&op->o_req_dn, &op->o_req_ndn,
|
|
|
|
op->oq_search.rs_scope,
|
|
|
|
op->oq_search.rs_deref,
|
|
|
|
op->oq_search.rs_slimit,
|
|
|
|
op->oq_search.rs_tlimit,
|
|
|
|
op->oq_search.rs_filter,
|
|
|
|
&op->oq_search.rs_filterstr,
|
|
|
|
op->oq_search.rs_attrs,
|
|
|
|
op->oq_search.rs_attrsonly);
|
2003-03-07 03:44:41 +08:00
|
|
|
}
|
|
|
|
#endif /* LDAP_CACHING */
|
|
|
|
|
2002-08-31 18:35:23 +08:00
|
|
|
/*
|
|
|
|
* controls are set in ldap_back_dobind()
|
|
|
|
*
|
|
|
|
* FIXME: in case of values return filter, we might want
|
|
|
|
* to map attrs and maybe rewrite value
|
|
|
|
*/
|
2003-04-04 05:35:54 +08:00
|
|
|
lc = meta_back_getconn( li, op, rs, META_OP_ALLOW_MULTIPLE,
|
|
|
|
&op->o_req_ndn, NULL );
|
|
|
|
if ( !lc ) {
|
|
|
|
send_ldap_result( op, rs );
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( !meta_back_dobind( lc, op ) ) {
|
|
|
|
rs->sr_err = LDAP_OTHER;
|
|
|
|
send_ldap_result( op, rs );
|
2001-05-12 08:51:28 +08:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Array of message id of each target
|
|
|
|
*/
|
|
|
|
msgid = ch_calloc( sizeof( int ), li->ntargets );
|
|
|
|
if ( msgid == NULL ) {
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = LDAP_OTHER;
|
|
|
|
send_ldap_result( op, rs );
|
2001-05-12 08:51:28 +08:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2001-08-04 19:10:08 +08:00
|
|
|
/* if not root, get appropriate limits */
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( be_isroot( op->o_bd, &op->o_ndn ) ) {
|
2001-08-04 19:10:08 +08:00
|
|
|
isroot = 1;
|
|
|
|
} else {
|
2003-04-04 05:35:54 +08:00
|
|
|
( void ) get_limits( op->o_bd, &op->o_ndn, &limit );
|
2001-08-04 19:10:08 +08:00
|
|
|
}
|
2001-08-04 01:15:14 +08:00
|
|
|
|
2001-08-04 19:10:08 +08:00
|
|
|
/* if no time limit requested, rely on remote server limits */
|
2001-08-04 01:15:14 +08:00
|
|
|
/* if requested limit higher than hard limit, abort */
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( !isroot && op->oq_search.rs_tlimit > limit->lms_t_hard ) {
|
2001-08-04 01:15:14 +08:00
|
|
|
/* no hard limit means use soft instead */
|
2002-11-21 20:58:59 +08:00
|
|
|
if ( limit->lms_t_hard == 0
|
|
|
|
&& limit->lms_t_soft > -1
|
2003-04-04 05:35:54 +08:00
|
|
|
&& op->oq_search.rs_tlimit > limit->lms_t_soft ) {
|
|
|
|
op->oq_search.rs_tlimit = limit->lms_t_soft;
|
2001-08-04 01:15:14 +08:00
|
|
|
|
|
|
|
/* positive hard limit means abort */
|
|
|
|
} else if ( limit->lms_t_hard > 0 ) {
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
|
|
|
|
send_ldap_result( op, rs );
|
2001-08-04 01:15:14 +08:00
|
|
|
rc = 0;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* negative hard limit means no limit */
|
|
|
|
}
|
|
|
|
|
2001-08-04 19:10:08 +08:00
|
|
|
/* if no size limit requested, rely on remote server limits */
|
2001-08-04 01:15:14 +08:00
|
|
|
/* if requested limit higher than hard limit, abort */
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( !isroot && op->oq_search.rs_slimit > limit->lms_s_hard ) {
|
2001-08-04 01:15:14 +08:00
|
|
|
/* no hard limit means use soft instead */
|
2002-11-21 20:58:59 +08:00
|
|
|
if ( limit->lms_s_hard == 0
|
|
|
|
&& limit->lms_s_soft > -1
|
2003-04-04 05:35:54 +08:00
|
|
|
&& op->oq_search.rs_slimit > limit->lms_s_soft ) {
|
|
|
|
op->oq_search.rs_slimit = limit->lms_s_soft;
|
2001-08-04 01:15:14 +08:00
|
|
|
|
|
|
|
/* positive hard limit means abort */
|
|
|
|
} else if ( limit->lms_s_hard > 0 ) {
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
|
|
|
|
send_ldap_result( op, rs );
|
2001-08-04 01:15:14 +08:00
|
|
|
rc = 0;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* negative hard limit means no limit */
|
|
|
|
}
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
/*
|
|
|
|
* Inits searches
|
|
|
|
*/
|
2002-08-10 01:15:10 +08:00
|
|
|
for ( i = 0, lsc = lc->conns; !META_LAST(lsc); ++i, ++lsc ) {
|
2003-04-04 05:35:54 +08:00
|
|
|
char *realbase = ( char * )op->o_req_dn.bv_val;
|
|
|
|
int realscope = op->oq_search.rs_scope;
|
2002-04-11 16:46:34 +08:00
|
|
|
ber_len_t suffixlen;
|
2003-03-01 19:08:53 +08:00
|
|
|
char **mapped_attrs;
|
2003-02-11 05:37:30 +08:00
|
|
|
|
2002-08-10 01:15:10 +08:00
|
|
|
if ( lsc->candidate != META_CANDIDATE ) {
|
2003-01-24 06:07:33 +08:00
|
|
|
msgid[ i ] = -1;
|
2001-05-12 08:51:28 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2002-08-31 18:35:23 +08:00
|
|
|
/* should we check return values? */
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( op->oq_search.rs_deref != -1 ) {
|
2002-08-10 01:15:10 +08:00
|
|
|
ldap_set_option( lsc->ld, LDAP_OPT_DEREF,
|
2003-04-04 05:35:54 +08:00
|
|
|
( void * )&op->oq_search.rs_deref);
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( op->oq_search.rs_tlimit != -1 ) {
|
2002-08-10 01:15:10 +08:00
|
|
|
ldap_set_option( lsc->ld, LDAP_OPT_TIMELIMIT,
|
2003-04-04 05:35:54 +08:00
|
|
|
( void * )&op->oq_search.rs_tlimit);
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( op->oq_search.rs_slimit != -1 ) {
|
2002-08-10 01:15:10 +08:00
|
|
|
ldap_set_option( lsc->ld, LDAP_OPT_SIZELIMIT,
|
2003-04-04 05:35:54 +08:00
|
|
|
( void * )&op->oq_search.rs_slimit);
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* modifies the base according to the scope, if required
|
|
|
|
*/
|
2001-12-29 12:48:00 +08:00
|
|
|
suffixlen = li->targets[ i ]->suffix.bv_len;
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( suffixlen > op->o_req_ndn.bv_len ) {
|
|
|
|
switch ( op->oq_search.rs_scope ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
case LDAP_SCOPE_SUBTREE:
|
|
|
|
/*
|
|
|
|
* make the target suffix the new base
|
2001-10-02 06:12:23 +08:00
|
|
|
* FIXME: this is very forgiving, because
|
|
|
|
* illegal bases may be turned into
|
|
|
|
* the suffix of the target.
|
2001-05-12 08:51:28 +08:00
|
|
|
*/
|
2001-12-29 12:48:00 +08:00
|
|
|
if ( dnIsSuffix( &li->targets[ i ]->suffix,
|
2003-04-04 05:35:54 +08:00
|
|
|
&op->o_req_ndn ) ) {
|
2001-12-29 12:48:00 +08:00
|
|
|
realbase = li->targets[ i ]->suffix.bv_val;
|
2001-10-02 06:12:23 +08:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* this target is no longer candidate
|
|
|
|
*/
|
2003-01-24 06:07:33 +08:00
|
|
|
msgid[ i ] = -1;
|
2003-02-11 05:37:30 +08:00
|
|
|
goto new_candidate;
|
2001-10-02 06:12:23 +08:00
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case LDAP_SCOPE_ONELEVEL:
|
2001-12-29 12:48:00 +08:00
|
|
|
if ( is_one_level_rdn( li->targets[ i ]->suffix.bv_val,
|
2003-04-04 05:35:54 +08:00
|
|
|
suffixlen - op->o_req_ndn.bv_len - 1 )
|
|
|
|
&& dnIsSuffix( &li->targets[ i ]->suffix, &op->o_req_ndn ) ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
/*
|
|
|
|
* if there is exactly one level,
|
|
|
|
* make the target suffix the new
|
|
|
|
* base, and make scope "base"
|
|
|
|
*/
|
2001-12-29 12:48:00 +08:00
|
|
|
realbase = li->targets[ i ]->suffix.bv_val;
|
2001-05-12 08:51:28 +08:00
|
|
|
realscope = LDAP_SCOPE_BASE;
|
|
|
|
break;
|
|
|
|
} /* else continue with the next case */
|
|
|
|
|
|
|
|
case LDAP_SCOPE_BASE:
|
|
|
|
/*
|
|
|
|
* this target is no longer candidate
|
|
|
|
*/
|
2003-01-24 06:07:33 +08:00
|
|
|
msgid[ i ] = -1;
|
2003-02-11 05:37:30 +08:00
|
|
|
goto new_candidate;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewrite the search base, if required
|
|
|
|
*/
|
|
|
|
switch ( rewrite_session( li->targets[ i ]->rwinfo,
|
|
|
|
"searchBase",
|
2003-04-04 05:35:54 +08:00
|
|
|
realbase, op->o_conn, &mbase ) ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
if ( mbase == NULL ) {
|
|
|
|
mbase = realbase;
|
|
|
|
}
|
2001-05-14 07:44:22 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, DETAIL1,
|
2003-02-11 05:37:30 +08:00
|
|
|
"[rw] searchBase [%d]: \"%s\" -> \"%s\"\n",
|
2003-04-04 05:35:54 +08:00
|
|
|
i, op->o_req_dn.bv_val, mbase );
|
2001-05-14 07:44:22 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
2003-02-11 05:37:30 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS,
|
|
|
|
"rw> searchBase [%d]: \"%s\" -> \"%s\"\n",
|
2003-04-04 05:35:54 +08:00
|
|
|
i, op->o_req_dn.bv_val, mbase );
|
2001-05-14 07:44:22 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
|
|
|
|
rs->sr_text = "Operation not allowed";
|
|
|
|
send_ldap_result( op, rs );
|
2001-05-14 07:44:22 +08:00
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = LDAP_OTHER;
|
|
|
|
rs->sr_text = "rewrite error";
|
|
|
|
send_ldap_result( op, rs );
|
2001-05-12 08:51:28 +08:00
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
|
|
|
}
|
2003-03-01 19:08:53 +08:00
|
|
|
|
|
|
|
#if 0
|
2001-05-12 08:51:28 +08:00
|
|
|
/*
|
|
|
|
* Rewrite the search filter, if required
|
|
|
|
*/
|
|
|
|
switch ( rewrite_session( li->targets[ i ]->rwinfo,
|
|
|
|
"searchFilter",
|
2002-01-04 00:29:38 +08:00
|
|
|
filterstr->bv_val, conn, &mfilter.bv_val ) ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
case REWRITE_REGEXEC_OK:
|
2002-01-04 00:29:38 +08:00
|
|
|
if ( mfilter.bv_val != NULL && mfilter.bv_val[ 0 ] != '\0') {
|
|
|
|
mfilter.bv_len = strlen( mfilter.bv_val );
|
|
|
|
} else {
|
|
|
|
if ( mfilter.bv_val != NULL ) {
|
|
|
|
free( mfilter.bv_val );
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2002-01-04 00:29:38 +08:00
|
|
|
mfilter = *filterstr;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2001-05-14 07:44:22 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, DETAIL1,
|
2003-02-11 05:37:30 +08:00
|
|
|
"[rw] searchFilter [%d]: \"%s\" -> \"%s\"\n",
|
|
|
|
i, filterstr->bv_val, mfilter.bv_val );
|
2001-05-14 07:44:22 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS,
|
2003-02-11 05:37:30 +08:00
|
|
|
"rw> searchFilter [%d]: \"%s\" -> \"%s\"\n",
|
|
|
|
i, filterstr->bv_val, mfilter.bv_val );
|
2001-05-14 07:44:22 +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,
|
2002-11-11 02:16:43 +08:00
|
|
|
NULL, "Operation not allowed",
|
|
|
|
NULL, NULL );
|
2001-10-02 00:16:51 +08:00
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
2002-08-01 06:49:02 +08:00
|
|
|
send_ldap_result( conn, op, LDAP_OTHER,
|
2002-11-11 02:16:43 +08:00
|
|
|
NULL, "Rewrite error", NULL, NULL );
|
2001-05-12 08:51:28 +08:00
|
|
|
rc = -1;
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Maps attributes in filter
|
|
|
|
*/
|
|
|
|
mapped_filter = ldap_back_map_filter( &li->targets[ i ]->at_map,
|
2003-01-28 00:39:56 +08:00
|
|
|
&li->targets[ i ]->oc_map, &mfilter,
|
|
|
|
BACKLDAP_MAP );
|
2001-05-12 08:51:28 +08:00
|
|
|
if ( mapped_filter == NULL ) {
|
2002-01-04 00:29:38 +08:00
|
|
|
mapped_filter = ( char * )mfilter.bv_val;
|
2002-01-04 23:26:45 +08:00
|
|
|
} else {
|
2002-07-22 22:24:32 +08:00
|
|
|
if ( mfilter.bv_val != filterstr->bv_val ) {
|
|
|
|
free( mfilter.bv_val );
|
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2002-01-04 23:26:45 +08:00
|
|
|
mfilter.bv_val = NULL;
|
|
|
|
mfilter.bv_len = 0;
|
2003-03-01 19:08:53 +08:00
|
|
|
#endif
|
2001-05-12 08:51:28 +08:00
|
|
|
|
2003-04-04 05:35:54 +08:00
|
|
|
rc = ldap_back_filter_map_rewrite_( li->targets[ i ]->rwinfo,
|
|
|
|
op->o_conn,
|
|
|
|
&li->targets[ i ]->at_map,
|
|
|
|
&li->targets[ i ]->oc_map,
|
|
|
|
op->oq_search.rs_filter,
|
|
|
|
&mfilter, BACKLDAP_MAP );
|
2003-03-01 19:08:53 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
/*
|
|
|
|
* Maps required attributes
|
|
|
|
*/
|
|
|
|
mapped_attrs = ldap_back_map_attrs( &li->targets[ i ]->at_map,
|
2003-04-04 05:35:54 +08:00
|
|
|
op->oq_search.rs_attrs, BACKLDAP_MAP );
|
|
|
|
if ( mapped_attrs == NULL && op->oq_search.rs_attrs) {
|
|
|
|
for ( count = 0; op->oq_search.rs_attrs[ count ].an_name.bv_val; count++ );
|
2001-12-27 20:17:54 +08:00
|
|
|
mapped_attrs = ch_malloc( ( count + 1 ) * sizeof(char *));
|
2003-04-04 05:35:54 +08:00
|
|
|
for ( count = 0; op->oq_search.rs_attrs[ count ].an_name.bv_val; count++ ) {
|
|
|
|
mapped_attrs[ count ] = op->oq_search.rs_attrs[ count ].an_name.bv_val;
|
2001-12-27 20:17:54 +08:00
|
|
|
}
|
|
|
|
mapped_attrs[ count ] = NULL;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Starts the search
|
|
|
|
*/
|
2002-08-10 01:15:10 +08:00
|
|
|
msgid[ i ] = ldap_search( lsc->ld, mbase, realscope,
|
2003-04-04 05:35:54 +08:00
|
|
|
mfilter.bv_val, mapped_attrs,
|
|
|
|
op->oq_search.rs_attrsonly );
|
2001-12-27 20:17:54 +08:00
|
|
|
if ( mapped_attrs ) {
|
|
|
|
free( mapped_attrs );
|
2001-05-12 08:51:28 +08:00
|
|
|
mapped_attrs = NULL;
|
|
|
|
}
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( mfilter.bv_val != op->oq_search.rs_filterstr.bv_val ) {
|
2003-03-01 19:08:53 +08:00
|
|
|
free( mfilter.bv_val );
|
|
|
|
mfilter.bv_val = NULL;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
if ( mbase != realbase ) {
|
|
|
|
free( mbase );
|
|
|
|
mbase = NULL;
|
|
|
|
}
|
|
|
|
|
2003-01-24 06:07:33 +08:00
|
|
|
if ( msgid[ i ] == -1 ) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
++candidates;
|
2003-02-11 05:37:30 +08:00
|
|
|
|
|
|
|
new_candidate:;
|
2001-05-12 08:51:28 +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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* In case there are no candidates, no cycle takes place...
|
2002-08-31 18:35:23 +08:00
|
|
|
*
|
|
|
|
* FIXME: we might use a queue, to balance the load
|
|
|
|
* among the candidates
|
2001-05-12 08:51:28 +08:00
|
|
|
*/
|
2003-04-04 05:35:54 +08:00
|
|
|
for ( rc = 0; candidates > 0; ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
int ab, gotit = 0;
|
|
|
|
|
|
|
|
/* check for abandon */
|
|
|
|
ab = op->o_abandon;
|
|
|
|
|
2002-08-10 01:15:10 +08:00
|
|
|
for ( i = 0, lsc = lc->conns; !META_LAST(lsc); lsc++, i++ ) {
|
2003-01-24 06:07:33 +08:00
|
|
|
if ( msgid[ i ] == -1 ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( ab ) {
|
2002-08-10 01:15:10 +08:00
|
|
|
ldap_abandon( lsc->ld, msgid[ i ] );
|
2001-05-12 08:51:28 +08:00
|
|
|
rc = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( op->oq_search.rs_slimit > 0
|
|
|
|
&& rs->sr_nentries == op->oq_search.rs_slimit ) {
|
|
|
|
rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
|
|
|
|
rs->sr_v2ref = v2refs;
|
|
|
|
send_ldap_result( op, rs );
|
2001-08-04 01:15:14 +08:00
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
2002-08-31 18:35:23 +08:00
|
|
|
/*
|
|
|
|
* FIXME: handle time limit as well?
|
|
|
|
* Note that target servers are likely
|
|
|
|
* to handle it, so at some time we'll
|
|
|
|
* get a LDAP_TIMELIMIT_EXCEEDED from
|
|
|
|
* one of them ...
|
|
|
|
*/
|
2002-08-10 01:15:10 +08:00
|
|
|
rc = ldap_result( lsc->ld, msgid[ i ],
|
2001-05-12 08:51:28 +08:00
|
|
|
0, &tv, &res );
|
|
|
|
|
|
|
|
if ( rc == 0 ) {
|
|
|
|
continue;
|
2002-08-31 18:35:23 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
} else if ( rc == -1 ) {
|
|
|
|
/* something REALLY bad happened! */
|
|
|
|
( void )meta_clear_unused_candidates( li,
|
|
|
|
lc, -1, 0 );
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = LDAP_OTHER;
|
|
|
|
rs->sr_v2ref = v2refs;
|
|
|
|
send_ldap_result( op, rs );
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
/* anything else needs be done? */
|
|
|
|
goto finish;
|
2002-08-31 18:35:23 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
} else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
|
2002-08-10 01:15:10 +08:00
|
|
|
e = ldap_first_entry( lsc->ld, res );
|
2003-04-04 05:35:54 +08:00
|
|
|
meta_send_entry( op, rs, lc, i, e );
|
2003-02-11 05:37:30 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If scope is BASE, we need to jump out
|
|
|
|
* as soon as one entry is found; if
|
|
|
|
* the target pool is properly crafted,
|
|
|
|
* this should correspond to the sole
|
|
|
|
* entry that has the base DN
|
|
|
|
*/
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE
|
|
|
|
&& rs->sr_nentries > 0 ) {
|
2003-02-11 05:37:30 +08:00
|
|
|
candidates = 0;
|
|
|
|
sres = LDAP_SUCCESS;
|
|
|
|
break;
|
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
ldap_msgfree( res );
|
|
|
|
gotit = 1;
|
2002-08-31 18:35:23 +08:00
|
|
|
|
|
|
|
} else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
|
|
|
|
char **references = NULL;
|
|
|
|
int cnt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* FIXME: should we collect references
|
|
|
|
* and send them alltogether at the end?
|
|
|
|
*/
|
|
|
|
|
|
|
|
rc = ldap_parse_reference( lsc->ld, res,
|
2003-04-04 05:35:54 +08:00
|
|
|
&references, &rs->sr_ctrls, 1 );
|
2002-08-31 18:35:23 +08:00
|
|
|
|
|
|
|
if ( rc != LDAP_SUCCESS ) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( references == NULL ) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
for ( cnt = 0; references[ cnt ]; cnt++ )
|
|
|
|
/* NO OP */ ;
|
|
|
|
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_ref = ch_calloc( cnt + 1, sizeof( struct berval ) );
|
2002-08-31 18:35:23 +08:00
|
|
|
|
|
|
|
for ( cnt = 0; references[ cnt ]; cnt++ ) {
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_ref[ cnt ].bv_val = references[ cnt ];
|
|
|
|
rs->sr_ref[ cnt ].bv_len = strlen( references[ cnt ] );
|
2002-08-31 18:35:23 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* ignore return value by now */
|
2003-04-04 05:35:54 +08:00
|
|
|
( void )send_search_reference( op, rs );
|
2002-08-31 18:35:23 +08:00
|
|
|
|
|
|
|
/* cleanup */
|
|
|
|
if ( references ) {
|
|
|
|
ldap_value_free( references );
|
2003-04-04 05:35:54 +08:00
|
|
|
ch_free( rs->sr_ref );
|
|
|
|
rs->sr_ref = NULL;
|
2002-08-31 18:35:23 +08:00
|
|
|
}
|
|
|
|
|
2003-04-04 05:35:54 +08:00
|
|
|
if ( rs->sr_ctrls ) {
|
|
|
|
ldap_controls_free( rs->sr_ctrls );
|
|
|
|
rs->sr_ctrls = NULL;
|
2002-08-31 18:35:23 +08:00
|
|
|
}
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
} else {
|
2002-08-10 01:15:10 +08:00
|
|
|
sres = ldap_result2error( lsc->ld,
|
2001-05-12 08:51:28 +08:00
|
|
|
res, 1 );
|
|
|
|
sres = ldap_back_map_result( sres );
|
|
|
|
if ( err != NULL ) {
|
|
|
|
free( err );
|
|
|
|
}
|
2002-08-10 01:15:10 +08:00
|
|
|
ldap_get_option( lsc->ld,
|
2001-05-12 08:51:28 +08:00
|
|
|
LDAP_OPT_ERROR_STRING, &err );
|
|
|
|
if ( match != NULL ) {
|
|
|
|
free( match );
|
|
|
|
}
|
2002-08-10 01:15:10 +08:00
|
|
|
ldap_get_option( lsc->ld,
|
2001-05-12 08:51:28 +08:00
|
|
|
LDAP_OPT_MATCHED_DN, &match );
|
|
|
|
|
2001-05-14 07:44:22 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, ERR,
|
2002-08-10 22:13:46 +08:00
|
|
|
"meta_back_search [%d] "
|
|
|
|
"match=\"%s\" err=\"%s\"\n",
|
2002-07-12 04:33:24 +08:00
|
|
|
i, match, err );
|
2001-05-14 07:44:22 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
|
|
|
Debug( LDAP_DEBUG_ANY,
|
2002-08-10 22:13:46 +08:00
|
|
|
"=>meta_back_search [%d] "
|
|
|
|
"match=\"%s\" err=\"%s\"\n",
|
2001-05-12 08:51:28 +08:00
|
|
|
i, match, err );
|
2001-05-14 07:44:22 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
last = i;
|
|
|
|
rc = 0;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* When no candidates are left,
|
|
|
|
* the outer cycle finishes
|
|
|
|
*/
|
2003-01-24 06:07:33 +08:00
|
|
|
msgid[ i ] = -1;
|
2001-05-12 08:51:28 +08:00
|
|
|
--candidates;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( ab ) {
|
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( gotit == 0 ) {
|
|
|
|
tv.tv_sec = 0;
|
|
|
|
tv.tv_usec = 100000;
|
|
|
|
ldap_pvt_thread_yield();
|
|
|
|
} else {
|
|
|
|
tv.tv_sec = 0;
|
|
|
|
tv.tv_usec = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( rc == -1 ) {
|
|
|
|
/*
|
|
|
|
* FIXME: need a strategy to handle errors
|
|
|
|
*/
|
2003-04-04 05:35:54 +08:00
|
|
|
rc = meta_back_op_result( lc, op, rs );
|
2001-05-12 08:51:28 +08:00
|
|
|
goto finish;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewrite the matched portion of the search base, if required
|
|
|
|
*
|
|
|
|
* FIXME: only the last one gets caught!
|
|
|
|
*/
|
|
|
|
if ( match != NULL ) {
|
|
|
|
switch ( rewrite_session( li->targets[ last ]->rwinfo,
|
2003-04-04 05:35:54 +08:00
|
|
|
"matchedDn", match, op->o_conn,
|
|
|
|
&mmatch ) ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
if ( mmatch == NULL ) {
|
|
|
|
mmatch = ( char * )match;
|
|
|
|
}
|
2001-05-14 07:44:22 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, DETAIL1,
|
2003-02-11 05:37:30 +08:00
|
|
|
"[rw] matchedDn: \"%s\" -> \"%s\"\n",
|
|
|
|
match, mmatch, 0 );
|
2001-05-14 07:44:22 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
2003-02-11 05:37:30 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS,
|
|
|
|
"rw> matchedDn: \"%s\" -> \"%s\"\n",
|
|
|
|
match, mmatch, 0 );
|
2001-05-14 07:44:22 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
2002-11-11 02:16:43 +08:00
|
|
|
/* FIXME: no error, but no matched ... */
|
|
|
|
mmatch = NULL;
|
|
|
|
break;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-08-31 18:35:23 +08:00
|
|
|
/*
|
|
|
|
* In case we returned at least one entry, we return LDAP_SUCCESS
|
|
|
|
* otherwise, the latter error code we got
|
|
|
|
*
|
|
|
|
* FIXME: we should handle error codes and return the more
|
|
|
|
* important/reasonable
|
|
|
|
*/
|
|
|
|
if ( sres == LDAP_SUCCESS && v2refs ) {
|
|
|
|
sres = LDAP_REFERRAL;
|
|
|
|
}
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_err = sres;
|
|
|
|
rs->sr_matched = mmatch;
|
|
|
|
rs->sr_v2ref = v2refs;
|
|
|
|
send_ldap_result( op, rs );
|
|
|
|
rs->sr_matched = NULL;
|
|
|
|
rs->sr_v2ref = NULL;
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
|
2001-06-03 16:55:17 +08:00
|
|
|
finish:;
|
2001-05-12 08:51:28 +08:00
|
|
|
if ( match ) {
|
|
|
|
if ( mmatch != match ) {
|
|
|
|
free( mmatch );
|
|
|
|
}
|
|
|
|
free(match);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( err ) {
|
|
|
|
free( err );
|
|
|
|
}
|
|
|
|
|
|
|
|
if ( msgid ) {
|
2002-08-10 22:13:46 +08:00
|
|
|
ch_free( msgid );
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2002-08-10 22:13:46 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
2002-08-14 01:00:33 +08:00
|
|
|
static int
|
2001-05-12 08:51:28 +08:00
|
|
|
meta_send_entry(
|
2001-12-27 20:17:54 +08:00
|
|
|
Operation *op,
|
2003-04-04 05:35:54 +08:00
|
|
|
SlapReply *rs,
|
2001-05-12 08:51:28 +08:00
|
|
|
struct metaconn *lc,
|
2001-12-27 20:17:54 +08:00
|
|
|
int target,
|
2003-04-04 05:35:54 +08:00
|
|
|
LDAPMessage *e
|
2001-05-12 08:51:28 +08:00
|
|
|
)
|
|
|
|
{
|
2003-04-04 05:35:54 +08:00
|
|
|
struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
|
2002-01-04 00:29:38 +08:00
|
|
|
struct berval a, mapped;
|
2001-12-27 20:17:54 +08:00
|
|
|
Entry ent;
|
2002-01-04 00:29:38 +08:00
|
|
|
BerElement ber = *e->lm_ber;
|
2001-12-27 20:17:54 +08:00
|
|
|
Attribute *attr, **attrp;
|
2002-01-04 00:29:38 +08:00
|
|
|
struct berval dummy = { 0, NULL };
|
|
|
|
struct berval *bv, bdn;
|
2001-12-27 20:17:54 +08:00
|
|
|
const char *text;
|
2001-05-12 08:51:28 +08:00
|
|
|
|
2002-01-06 14:11:01 +08:00
|
|
|
if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
|
2002-08-14 01:00:33 +08:00
|
|
|
return LDAP_DECODING_ERROR;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Rewrite the dn of the result, if needed
|
|
|
|
*/
|
|
|
|
switch ( rewrite_session( li->targets[ target ]->rwinfo,
|
2003-04-04 05:35:54 +08:00
|
|
|
"searchResult", bdn.bv_val, lc->conn,
|
|
|
|
&ent.e_name.bv_val ) ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
case REWRITE_REGEXEC_OK:
|
2002-01-04 00:29:38 +08:00
|
|
|
if ( ent.e_name.bv_val == NULL ) {
|
|
|
|
ent.e_name = bdn;
|
2001-12-27 20:17:54 +08:00
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
} else {
|
2001-05-14 07:44:22 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, DETAIL1,
|
|
|
|
"[rw] searchResult[%d]: \"%s\" -> \"%s\"\n",
|
|
|
|
target, bdn.bv_val, ent.e_name.bv_val );
|
2001-05-14 07:44:22 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
2001-05-12 08:51:28 +08:00
|
|
|
Debug( LDAP_DEBUG_ARGS, "rw> searchResult[%d]: \"%s\""
|
2003-04-04 05:35:54 +08:00
|
|
|
" -> \"%s\"\n", target, bdn.bv_val,
|
|
|
|
ent.e_name.bv_val );
|
2001-05-14 07:44:22 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2002-01-04 00:29:38 +08:00
|
|
|
ent.e_name.bv_len = strlen( ent.e_name.bv_val );
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_UNWILLING:
|
2002-11-11 02:16:43 +08:00
|
|
|
return LDAP_UNWILLING_TO_PERFORM;
|
|
|
|
|
|
|
|
case REWRITE_REGEXEC_ERR:
|
2002-08-14 01:00:33 +08:00
|
|
|
return LDAP_OTHER;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
|
2002-08-10 22:13:46 +08:00
|
|
|
/*
|
|
|
|
* Note: this may fail if the target host(s) schema differs
|
|
|
|
* from the one known to the meta, and a DN with unknown
|
|
|
|
* attributes is returned.
|
|
|
|
*
|
|
|
|
* FIXME: should we log anything, or delegate to dnNormalize2?
|
|
|
|
*/
|
|
|
|
if ( dnNormalize2( NULL, &ent.e_name, &ent.e_nname ) != LDAP_SUCCESS ) {
|
2002-08-14 01:00:33 +08:00
|
|
|
return LDAP_INVALID_DN_SYNTAX;
|
2002-08-10 22:13:46 +08:00
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* cache dn
|
|
|
|
*/
|
|
|
|
if ( li->cache.ttl != META_DNCACHE_DISABLED ) {
|
|
|
|
( void )meta_dncache_update_entry( &li->cache,
|
2002-01-04 00:29:38 +08:00
|
|
|
&ent.e_nname,
|
2001-05-12 08:51:28 +08:00
|
|
|
target );
|
|
|
|
}
|
|
|
|
|
|
|
|
ent.e_id = 0;
|
|
|
|
ent.e_attrs = 0;
|
|
|
|
ent.e_private = 0;
|
|
|
|
attrp = &ent.e_attrs;
|
|
|
|
|
2002-01-06 14:11:01 +08:00
|
|
|
while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
|
2002-01-04 00:29:38 +08:00
|
|
|
ldap_back_map( &li->targets[ target ]->at_map,
|
2003-01-28 00:39:56 +08:00
|
|
|
&a, &mapped, BACKLDAP_REMAP );
|
2003-01-28 00:07:10 +08:00
|
|
|
if ( mapped.bv_val == NULL || mapped.bv_val[0] == '\0' ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
attr = ( Attribute * )ch_malloc( sizeof( Attribute ) );
|
|
|
|
if ( attr == NULL ) {
|
|
|
|
continue;
|
|
|
|
}
|
2002-01-14 07:23:23 +08:00
|
|
|
attr->a_flags = 0;
|
2001-05-12 08:51:28 +08:00
|
|
|
attr->a_next = 0;
|
|
|
|
attr->a_desc = NULL;
|
2002-01-04 00:29:38 +08:00
|
|
|
if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
|
2001-05-12 08:51:28 +08:00
|
|
|
!= LDAP_SUCCESS) {
|
2002-01-04 00:29:38 +08:00
|
|
|
if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text )
|
2001-10-04 02:17:08 +08:00
|
|
|
!= LDAP_SUCCESS) {
|
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, DETAIL1,
|
|
|
|
"slap_bv2undef_ad(%s): %s\n", mapped.bv_val, text, 0 );
|
2001-10-04 02:17:08 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
|
|
|
Debug( LDAP_DEBUG_ANY,
|
2002-01-04 00:29:38 +08:00
|
|
|
"slap_bv2undef_ad(%s): "
|
|
|
|
"%s\n%s", mapped.bv_val, text, "" );
|
2001-10-04 02:17:08 +08:00
|
|
|
#endif /* !NEW_LOGGING */
|
2002-01-04 00:29:38 +08:00
|
|
|
ch_free( attr );
|
2001-10-04 02:17:08 +08:00
|
|
|
continue;
|
|
|
|
}
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
2002-01-04 00:29:38 +08:00
|
|
|
|
2002-01-05 03:23:10 +08:00
|
|
|
/* no subschemaSubentry */
|
|
|
|
if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
|
|
|
|
ch_free(attr);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2002-07-22 22:24:32 +08:00
|
|
|
if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
|
|
|
|
|| attr->a_vals == NULL ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
attr->a_vals = &dummy;
|
2002-07-22 22:24:32 +08:00
|
|
|
|
2002-01-05 03:23:10 +08:00
|
|
|
} else if ( attr->a_desc == slap_schema.si_ad_objectClass
|
|
|
|
|| attr->a_desc == slap_schema.si_ad_structuralObjectClass ) {
|
2003-03-01 19:08:53 +08:00
|
|
|
int last;
|
|
|
|
|
2002-01-04 00:29:38 +08:00
|
|
|
for ( last = 0; attr->a_vals[ last ].bv_val; ++last );
|
2003-03-01 19:08:53 +08:00
|
|
|
|
|
|
|
for ( bv = attr->a_vals; bv->bv_val; bv++ ) {
|
2002-01-04 00:29:38 +08:00
|
|
|
ldap_back_map( &li->targets[ target]->oc_map,
|
2003-01-28 00:39:56 +08:00
|
|
|
bv, &mapped, BACKLDAP_REMAP );
|
2003-01-28 00:07:10 +08:00
|
|
|
if ( mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
|
2002-01-04 23:26:45 +08:00
|
|
|
free( bv->bv_val );
|
|
|
|
bv->bv_val = NULL;
|
2001-05-12 08:51:28 +08:00
|
|
|
if ( --last < 0 ) {
|
|
|
|
break;
|
|
|
|
}
|
2002-01-04 23:26:45 +08:00
|
|
|
*bv = attr->a_vals[ last ];
|
2002-01-04 00:29:38 +08:00
|
|
|
attr->a_vals[ last ].bv_val = NULL;
|
2003-03-01 19:08:53 +08:00
|
|
|
bv--;
|
2002-01-04 23:26:45 +08:00
|
|
|
|
2002-01-04 00:29:38 +08:00
|
|
|
} else if ( mapped.bv_val != bv->bv_val ) {
|
2002-01-06 14:11:01 +08:00
|
|
|
free( bv->bv_val );
|
2002-01-04 00:29:38 +08:00
|
|
|
ber_dupbv( bv, &mapped );
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* 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 ) {
|
2003-03-01 19:08:53 +08:00
|
|
|
int last;
|
|
|
|
|
|
|
|
for ( last = 0; attr->a_vals[ last ].bv_val; ++last );
|
|
|
|
|
|
|
|
for ( bv = attr->a_vals; bv->bv_val; bv++ ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
char *newval;
|
|
|
|
|
|
|
|
switch ( rewrite_session( li->targets[ target ]->rwinfo,
|
2001-05-14 07:44:22 +08:00
|
|
|
"searchResult",
|
|
|
|
bv->bv_val,
|
2001-05-12 08:51:28 +08:00
|
|
|
lc->conn, &newval )) {
|
|
|
|
case REWRITE_REGEXEC_OK:
|
|
|
|
/* left as is */
|
|
|
|
if ( newval == NULL ) {
|
|
|
|
break;
|
|
|
|
}
|
2001-05-14 07:44:22 +08:00
|
|
|
#ifdef NEW_LOGGING
|
2002-07-12 04:33:24 +08:00
|
|
|
LDAP_LOG( BACK_META, DETAIL1,
|
|
|
|
"[rw] searchResult on attr=%s: \"%s\" -> \"%s\"\n",
|
|
|
|
attr->a_desc->ad_type->sat_cname.bv_val,
|
|
|
|
bv->bv_val, newval );
|
2001-05-14 07:44:22 +08:00
|
|
|
#else /* !NEW_LOGGING */
|
|
|
|
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-14 07:44:22 +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:
|
2003-03-01 19:08:53 +08:00
|
|
|
LBER_FREE(bv->bv_val);
|
|
|
|
bv->bv_val = NULL;
|
|
|
|
if (--last < 0)
|
|
|
|
goto next_attr;
|
|
|
|
*bv = attr->a_vals[last];
|
|
|
|
attr->a_vals[last].bv_val = NULL;
|
|
|
|
bv--;
|
|
|
|
break;
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
case REWRITE_REGEXEC_ERR:
|
|
|
|
/*
|
|
|
|
* FIXME: better give up,
|
|
|
|
* skip the attribute
|
|
|
|
* or leave it untouched?
|
|
|
|
*/
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2003-03-01 19:08:53 +08:00
|
|
|
next_attr:;
|
|
|
|
|
2001-05-12 08:51:28 +08:00
|
|
|
*attrp = attr;
|
|
|
|
attrp = &attr->a_next;
|
|
|
|
}
|
2003-04-04 05:35:54 +08:00
|
|
|
rs->sr_entry = &ent;
|
|
|
|
rs->sr_attrs = op->oq_search.rs_attrs;
|
|
|
|
send_search_entry( op, rs );
|
|
|
|
rs->sr_entry = NULL;
|
|
|
|
rs->sr_attrs = NULL;
|
2001-05-12 08:51:28 +08:00
|
|
|
while ( ent.e_attrs ) {
|
|
|
|
attr = ent.e_attrs;
|
|
|
|
ent.e_attrs = attr->a_next;
|
|
|
|
if ( attr->a_vals != &dummy ) {
|
2002-01-14 09:43:17 +08:00
|
|
|
ber_bvarray_free( attr->a_vals );
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
free( attr );
|
|
|
|
}
|
|
|
|
|
2002-01-06 14:11:01 +08:00
|
|
|
if ( ent.e_dn && ent.e_dn != bdn.bv_val ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
free( ent.e_dn );
|
|
|
|
}
|
|
|
|
if ( ent.e_ndn ) {
|
|
|
|
free( ent.e_ndn );
|
|
|
|
}
|
2002-08-14 01:00:33 +08:00
|
|
|
|
|
|
|
return LDAP_SUCCESS;
|
2001-05-12 08:51:28 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
is_one_level_rdn(
|
2001-12-27 20:17:54 +08:00
|
|
|
const char *rdn,
|
|
|
|
int from
|
2001-05-12 08:51:28 +08:00
|
|
|
)
|
|
|
|
{
|
2001-12-27 20:17:54 +08:00
|
|
|
for ( ; from--; ) {
|
2002-01-22 16:30:32 +08:00
|
|
|
if ( DN_SEPARATOR( rdn[ from ] ) ) {
|
2001-05-12 08:51:28 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|