2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2004 The OpenLDAP Foundation.
5 * Portions Copyright 2001-2003 Pierangelo Masarati.
6 * Portions Copyright 1999-2003 Howard Chu.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
13 * A copy of this license is available in the file LICENSE in the
14 * top-level directory of the distribution or, alternatively, at
15 * <http://www.OpenLDAP.org/license.html>.
18 * This work was initially developed by the Howard Chu for inclusion
19 * in OpenLDAP Software and subsequently enhanced by Pierangelo
27 #include <ac/socket.h>
28 #include <ac/string.h>
32 #include "../back-ldap/back-ldap.h"
33 #include "back-meta.h"
34 #undef ldap_debug /* silence a warning in ldap-int.h */
36 #include "../../../libraries/libldap/ldap-int.h"
48 meta_back_search( Operation *op, SlapReply *rs )
50 struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
52 struct metasingleconn *lsc;
53 struct timeval tv = { 0, 0 };
54 LDAPMessage *res = NULL, *e;
55 int rc = 0, *msgid, sres = LDAP_SUCCESS;
57 struct berval match = BER_BVNULL, mmatch = BER_BVNULL;
58 BerVarray v2refs = NULL;
60 int i, last = 0, candidates = 0, initial_candidates = 0,
68 * controls are set in ldap_back_dobind()
70 * FIXME: in case of values return filter, we might want
71 * to map attrs and maybe rewrite value
73 lc = meta_back_getconn( op, rs, META_OP_ALLOW_MULTIPLE,
74 &op->o_req_ndn, NULL );
76 send_ldap_result( op, rs );
80 if ( !meta_back_dobind( lc, op ) ) {
81 rs->sr_err = LDAP_OTHER;
82 send_ldap_result( op, rs );
87 * Array of message id of each target
89 msgid = ch_calloc( sizeof( int ), li->ntargets );
90 if ( msgid == NULL ) {
91 rs->sr_err = LDAP_OTHER;
92 send_ldap_result( op, rs );
102 for ( i = 0, lsc = lc->conns; !META_LAST(lsc); ++i, ++lsc ) {
103 struct berval realbase = op->o_req_dn;
104 int realscope = op->ors_scope;
105 ber_len_t suffixlen = 0;
106 struct berval mbase = BER_BVNULL;
107 struct berval mfilter = BER_BVNULL;
108 char **mapped_attrs = NULL;
110 if ( lsc->candidate != META_CANDIDATE ) {
115 /* should we check return values? */
116 if ( op->ors_deref != -1 ) {
117 ldap_set_option( lsc->ld, LDAP_OPT_DEREF,
118 ( void * )&op->ors_deref);
120 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
121 ldap_set_option( lsc->ld, LDAP_OPT_TIMELIMIT,
122 ( void * )&op->ors_tlimit);
124 if ( op->ors_slimit != SLAP_NO_LIMIT ) {
125 ldap_set_option( lsc->ld, LDAP_OPT_SIZELIMIT,
126 ( void * )&op->ors_slimit);
129 dc.rwmap = &li->targets[ i ]->rwmap;
132 * modifies the base according to the scope, if required
134 suffixlen = li->targets[ i ]->suffix.bv_len;
135 if ( suffixlen > op->o_req_ndn.bv_len ) {
136 switch ( op->ors_scope ) {
137 case LDAP_SCOPE_SUBTREE:
139 * make the target suffix the new base
140 * FIXME: this is very forgiving, because
141 * illegal bases may be turned into
142 * the suffix of the target.
144 if ( dnIsSuffix( &li->targets[ i ]->suffix,
146 realbase = li->targets[ i ]->suffix;
151 * this target is no longer candidate
158 case LDAP_SCOPE_ONELEVEL:
160 struct berval rdn = li->targets[ i ]->suffix;
161 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
162 if ( dnIsOneLevelRDN( &rdn )
163 && dnIsSuffix( &li->targets[ i ]->suffix, &op->o_req_ndn ) )
166 * if there is exactly one level,
167 * make the target suffix the new
168 * base, and make scope "base"
170 realbase = li->targets[ i ]->suffix;
171 realscope = LDAP_SCOPE_BASE;
174 } /* else continue with the next case */
177 case LDAP_SCOPE_BASE:
179 * this target is no longer candidate
190 * Rewrite the search base, if required
192 dc.ctx = "searchBase";
193 switch ( ldap_back_dn_massage( &dc, &realbase, &mbase ) ) {
197 case REWRITE_REGEXEC_UNWILLING:
198 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
199 rs->sr_text = "Operation not allowed";
200 send_ldap_result( op, rs );
204 case REWRITE_REGEXEC_ERR:
206 rs->sr_err = LDAP_OTHER;
207 rs->sr_text = "Rewrite error";
208 send_ldap_result( op, rs );
214 * this target is no longer candidate
223 rc = ldap_back_filter_map_rewrite( &dc,
225 &mfilter, BACKLDAP_MAP );
231 case LDAP_COMPARE_FALSE:
236 * this target is no longer candidate
243 * Maps required attributes
245 rc = ldap_back_map_attrs( &li->targets[ i ]->rwmap.rwm_at,
246 op->ors_attrs, BACKLDAP_MAP,
248 if ( rc != LDAP_SUCCESS ) {
250 * this target is no longer candidate
259 msgid[ i ] = ldap_search( lsc->ld, mbase.bv_val, realscope,
260 mfilter.bv_val, mapped_attrs,
262 if ( mapped_attrs ) {
263 free( mapped_attrs );
266 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
267 free( mfilter.bv_val );
268 mfilter.bv_val = NULL;
270 if ( mbase.bv_val != realbase.bv_val ) {
271 free( mbase.bv_val );
275 if ( msgid[ i ] == -1 ) {
284 initial_candidates = candidates;
286 /* We pull apart the ber result, stuff it into a slapd entry, and
287 * let send_search_entry stuff it back into ber format. Slow & ugly,
288 * but this is necessary for version matching, and for ACL processing.
293 * In case there are no candidates, no cycle takes place...
295 * FIXME: we might use a queue, to balance the load
296 * among the candidates
298 for ( rc = 0; candidates > 0; ) {
301 /* check for abandon */
304 for ( i = 0, lsc = lc->conns; !META_LAST(lsc); lsc++, i++ ) {
305 if ( msgid[ i ] == -1 ) {
310 ldap_abandon( lsc->ld, msgid[ i ] );
315 if ( op->ors_slimit > 0
316 && rs->sr_nentries == op->ors_slimit ) {
317 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
318 rs->sr_v2ref = v2refs;
319 send_ldap_result( op, rs );
324 * FIXME: handle time limit as well?
325 * Note that target servers are likely
326 * to handle it, so at some time we'll
327 * get a LDAP_TIMELIMIT_EXCEEDED from
330 rc = ldap_result( lsc->ld, msgid[ i ],
334 /* timeout exceeded */
336 /* FIXME: res should not need to be freed */
337 assert( res == NULL );
341 } else if ( rc == -1 ) {
342 /* something REALLY bad happened! */
343 ( void )meta_clear_unused_candidates( li,
345 rs->sr_err = LDAP_OTHER;
346 rs->sr_v2ref = v2refs;
347 send_ldap_result( op, rs );
349 /* anything else needs be done? */
351 /* FIXME: res should not need to be freed */
352 assert( res == NULL );
356 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
357 e = ldap_first_entry( lsc->ld, res );
358 meta_send_entry( op, rs, lc, i, e );
364 * If scope is BASE, we need to jump out
365 * as soon as one entry is found; if
366 * the target pool is properly crafted,
367 * this should correspond to the sole
368 * entry that has the base DN
370 if ( op->ors_scope == LDAP_SCOPE_BASE
371 && rs->sr_nentries > 0 ) {
379 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
380 char **references = NULL;
384 * FIXME: should we collect references
385 * and send them alltogether at the end?
388 rc = ldap_parse_reference( lsc->ld, res,
389 &references, &rs->sr_ctrls, 1 );
392 if ( rc != LDAP_SUCCESS ) {
396 if ( references == NULL ) {
400 for ( cnt = 0; references[ cnt ]; cnt++ )
403 rs->sr_ref = ch_calloc( cnt + 1, sizeof( struct berval ) );
405 for ( cnt = 0; references[ cnt ]; cnt++ ) {
406 rs->sr_ref[ cnt ].bv_val = references[ cnt ];
407 rs->sr_ref[ cnt ].bv_len = strlen( references[ cnt ] );
410 /* ignore return value by now */
411 ( void )send_search_reference( op, rs );
415 ldap_value_free( references );
416 ch_free( rs->sr_ref );
420 if ( rs->sr_ctrls ) {
421 ldap_controls_free( rs->sr_ctrls );
426 rs->sr_err = ldap_result2error( lsc->ld,
430 sres = slap_map_api2result( rs );
434 ldap_get_option( lsc->ld,
435 LDAP_OPT_ERROR_STRING, &err );
436 if ( match.bv_val != NULL ) {
437 free( match.bv_val );
439 ldap_get_option( lsc->ld,
440 LDAP_OPT_MATCHED_DN, &match.bv_val );
442 Debug( LDAP_DEBUG_ANY,
443 "=>meta_back_search [%d] "
444 "match=\"%s\" err=\"%s\"\n",
445 i, match.bv_val, err );
451 * When no candidates are left,
452 * the outer cycle finishes
466 ldap_pvt_thread_yield();
475 * FIXME: need a strategy to handle errors
477 rc = meta_back_op_result( lc, op, rs );
482 * Rewrite the matched portion of the search base, if required
484 * FIXME: only the last one gets caught!
486 if ( candidate_match == initial_candidates
487 && match.bv_val != NULL && *match.bv_val ) {
488 dc.ctx = "matchedDN";
489 dc.rwmap = &li->targets[ last ]->rwmap;
491 if ( ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
492 mmatch.bv_val = NULL;
497 * In case we returned at least one entry, we return LDAP_SUCCESS
498 * otherwise, the latter error code we got
500 * FIXME: we should handle error codes and return the more
501 * important/reasonable
503 if ( is_scope == 0 ) {
504 sres = LDAP_NO_SUCH_OBJECT;
507 if ( sres == LDAP_SUCCESS && v2refs ) {
508 sres = LDAP_REFERRAL;
511 rs->sr_matched = mmatch.bv_val;
512 rs->sr_v2ref = v2refs;
513 send_ldap_result( op, rs );
514 rs->sr_matched = NULL;
519 if ( match.bv_val ) {
520 if ( mmatch.bv_val != match.bv_val ) {
521 free( mmatch.bv_val );
523 free( match.bv_val );
546 struct metainfo *li = ( struct metainfo * )op->o_bd->be_private;
547 struct berval a, mapped;
549 BerElement ber = *e->lm_ber;
550 Attribute *attr, **attrp;
551 struct berval *bv, bdn;
555 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
556 return LDAP_DECODING_ERROR;
560 * Rewrite the dn of the result, if needed
562 dc.rwmap = &li->targets[ target ]->rwmap;
563 dc.conn = op->o_conn;
565 dc.ctx = "searchResult";
567 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &ent.e_name );
568 if ( rs->sr_err != LDAP_SUCCESS) {
573 * Note: this may fail if the target host(s) schema differs
574 * from the one known to the meta, and a DN with unknown
575 * attributes is returned.
577 * FIXME: should we log anything, or delegate to dnNormalize?
579 if ( dnNormalize( 0, NULL, NULL, &ent.e_name, &ent.e_nname,
580 &op->o_tmpmemctx ) != LDAP_SUCCESS )
582 return LDAP_INVALID_DN_SYNTAX;
588 if ( li->cache.ttl != META_DNCACHE_DISABLED ) {
589 ( void )meta_dncache_update_entry( &li->cache,
590 &ent.e_nname, target );
593 attrp = &ent.e_attrs;
595 dc.ctx = "searchAttrDN";
596 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
599 ldap_back_map( &li->targets[ target ]->rwmap.rwm_at,
600 &a, &mapped, BACKLDAP_REMAP );
601 if ( mapped.bv_val == NULL || mapped.bv_val[0] == '\0' ) {
604 attr = ( Attribute * )ch_malloc( sizeof( Attribute ) );
605 if ( attr == NULL ) {
611 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
613 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text )
615 Debug( LDAP_DEBUG_ANY,
616 "slap_bv2undef_ad(%s): "
617 "%s\n%s", mapped.bv_val, text, "" );
623 /* no subschemaSubentry */
624 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
627 * We eat target's subschemaSubentry because
628 * a search for this value is likely not
629 * to resolve to the appropriate backend;
630 * later, the local subschemaSubentry is
633 ( void )ber_scanf( &ber, "x" /* [W] */ );
639 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
640 || attr->a_vals == NULL ) {
641 attr->a_vals = &slap_dummy_bv;
643 } else if ( attr->a_desc == slap_schema.si_ad_objectClass
644 || attr->a_desc == slap_schema.si_ad_structuralObjectClass ) {
646 for ( last = 0; attr->a_vals[ last ].bv_val; ++last );
648 for ( bv = attr->a_vals; bv->bv_val; bv++ ) {
649 ldap_back_map( &li->targets[ target ]->rwmap.rwm_oc,
650 bv, &mapped, BACKLDAP_REMAP );
651 if ( mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
657 *bv = attr->a_vals[ last ];
658 attr->a_vals[ last ].bv_val = NULL;
661 } else if ( mapped.bv_val != bv->bv_val ) {
663 ber_dupbv( bv, &mapped );
667 * It is necessary to try to rewrite attributes with
668 * dn syntax because they might be used in ACLs as
669 * members of groups; since ACLs are applied to the
670 * rewritten stuff, no dn-based subecj clause could
671 * be used at the ldap backend side (see
672 * http://www.OpenLDAP.org/faq/data/cache/452.html)
673 * The problem can be overcome by moving the dn-based
674 * ACLs to the target directory server, and letting
675 * everything pass thru the ldap backend.
677 } else if ( attr->a_desc->ad_type->sat_syntax ==
678 slap_schema.si_syn_distinguishedName ) {
679 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
682 if ( last && attr->a_desc->ad_type->sat_equality &&
683 attr->a_desc->ad_type->sat_equality->smr_normalize ) {
686 attr->a_nvals = ch_malloc((last + 1)*sizeof(struct berval));
687 for ( i = 0; i<last; i++ ) {
688 attr->a_desc->ad_type->sat_equality->smr_normalize(
689 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
690 attr->a_desc->ad_type->sat_syntax,
691 attr->a_desc->ad_type->sat_equality,
692 &attr->a_vals[i], &attr->a_nvals[i],
695 attr->a_nvals[i].bv_val = NULL;
696 attr->a_nvals[i].bv_len = 0;
698 attr->a_nvals = attr->a_vals;
702 attrp = &attr->a_next;
705 rs->sr_attrs = op->ors_attrs;
707 send_search_entry( op, rs );
710 while ( ent.e_attrs ) {
712 ent.e_attrs = attr->a_next;
713 if ( attr->a_vals != &slap_dummy_bv ) {
714 ber_bvarray_free( attr->a_vals );
719 if ( ent.e_dn && ent.e_dn != bdn.bv_val ) {