2 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
3 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
5 * Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
7 * This work has been developed to fulfill the requirements
8 * of SysNet s.n.c. <http:www.sys-net.it> and it has been donated
9 * to the OpenLDAP Foundation in the hope that it may be useful
10 * to the Open Source community, but WITHOUT ANY WARRANTY.
12 * Permission is granted to anyone to use this software for any purpose
13 * on any computer system, and to alter it and redistribute it, subject
14 * to the following restrictions:
16 * 1. The author and SysNet s.n.c. are not responsible for the consequences
17 * of use of this software, no matter how awful, even if they arise from
20 * 2. The origin of this software must not be misrepresented, either by
21 * explicit claim or by omission. Since few users ever read sources,
22 * credits should appear in the documentation.
24 * 3. Altered versions must be plainly marked as such, and must not be
25 * misrepresented as being the original software. Since few users
26 * ever read sources, credits should appear in the documentation.
27 * SysNet s.n.c. cannot be responsible for the consequences of the
30 * 4. This notice may not be removed or altered.
33 * This software is based on the backend back-ldap, implemented
34 * by Howard Chu <hyc@highlandsun.com>, and modified by Mark Valence
35 * <kurash@sassafras.com>, Pierangelo Masarati <ando@sys-net.it> and other
36 * contributors. The contribution of the original software to the present
37 * implementation is acknowledged in this copyright statement.
39 * A special acknowledgement goes to Howard for the overall architecture
40 * (and for borrowing large pieces of code), and to Mark, who implemented
41 * from scratch the attribute/objectclass mapping.
43 * The original copyright statement follows.
45 * Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
47 * Permission is granted to anyone to use this software for any purpose
48 * on any computer system, and to alter it and redistribute it, subject
49 * to the following restrictions:
51 * 1. The author is not responsible for the consequences of use of this
52 * software, no matter how awful, even if they arise from flaws in it.
54 * 2. The origin of this software must not be misrepresented, either by
55 * explicit claim or by omission. Since few users ever read sources,
56 * credits should appear in the documentation.
58 * 3. Altered versions must be plainly marked as such, and must not be
59 * misrepresented as being the original software. Since few users
60 * ever read sources, credits should appear in the
63 * 4. This notice may not be removed or altered.
71 #include <ac/socket.h>
72 #include <ac/string.h>
76 #include "../back-ldap/back-ldap.h"
77 #include "back-meta.h"
79 #undef ldap_debug /* silence a warning in ldap-int.h */
81 #include "../../../libraries/libldap/ldap-int.h"
106 struct berval *nbase,
112 struct berval *filterstr,
113 AttributeName *attrs,
117 struct metainfo *li = ( struct metainfo * )be->be_private;
119 struct metasingleconn *lsc;
120 struct timeval tv = { 0, 0 };
121 LDAPMessage *res, *e;
122 int count, rc = 0, *msgid, sres = LDAP_NO_SUCH_OBJECT;
123 char *match = NULL, *err = NULL;
124 char *mbase = NULL, *mmatch = NULL;
125 struct berval mfilter;
126 BerVarray v2refs = NULL;
128 int i, last = 0, candidates = 0, op_type;
129 struct slap_limits_set *limit = NULL;
132 if ( scope == LDAP_SCOPE_BASE ) {
133 op_type = META_OP_REQUIRE_SINGLE;
135 op_type = META_OP_ALLOW_MULTIPLE;
139 * controls are set in ldap_back_dobind()
141 * FIXME: in case of values return filter, we might want
142 * to map attrs and maybe rewrite value
144 lc = meta_back_getconn( li, conn, op, op_type, nbase, NULL );
145 if ( !lc || !meta_back_dobind( lc, op ) ) {
150 * Array of message id of each target
152 msgid = ch_calloc( sizeof( int ), li->ntargets );
153 if ( msgid == NULL ) {
154 send_ldap_result( conn, op, LDAP_OTHER,
155 NULL, NULL, NULL, NULL );
159 /* if not root, get appropriate limits */
160 if ( be_isroot( be, &op->o_ndn ) ) {
163 ( void ) get_limits( be, &op->o_ndn, &limit );
166 /* if no time limit requested, rely on remote server limits */
167 /* if requested limit higher than hard limit, abort */
168 if ( !isroot && tlimit > limit->lms_t_hard ) {
169 /* no hard limit means use soft instead */
170 if ( limit->lms_t_hard == 0 && tlimit > limit->lms_t_soft ) {
171 tlimit = limit->lms_t_soft;
173 /* positive hard limit means abort */
174 } else if ( limit->lms_t_hard > 0 ) {
175 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
176 NULL, NULL, NULL, NULL );
181 /* negative hard limit means no limit */
184 /* if no size limit requested, rely on remote server limits */
185 /* if requested limit higher than hard limit, abort */
186 if ( !isroot && slimit > limit->lms_s_hard ) {
187 /* no hard limit means use soft instead */
188 if ( limit->lms_s_hard == 0 && slimit > limit->lms_s_soft ) {
189 slimit = limit->lms_s_soft;
191 /* positive hard limit means abort */
192 } else if ( limit->lms_s_hard > 0 ) {
193 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
194 NULL, NULL, NULL, NULL );
199 /* negative hard limit means no limit */
205 for ( i = 0, lsc = lc->conns; !META_LAST(lsc); ++i, ++lsc ) {
206 char *realbase = ( char * )base->bv_val;
207 int realscope = scope;
209 char *mapped_filter, **mapped_attrs;
211 if ( lsc->candidate != META_CANDIDATE ) {
215 /* should we check return values? */
217 ldap_set_option( lsc->ld, LDAP_OPT_DEREF,
220 if ( tlimit != -1 ) {
221 ldap_set_option( lsc->ld, LDAP_OPT_TIMELIMIT,
224 if ( slimit != -1 ) {
225 ldap_set_option( lsc->ld, LDAP_OPT_SIZELIMIT,
230 * modifies the base according to the scope, if required
232 suffixlen = li->targets[ i ]->suffix.bv_len;
233 if ( suffixlen > nbase->bv_len ) {
235 case LDAP_SCOPE_SUBTREE:
237 * make the target suffix the new base
238 * FIXME: this is very forgiving, because
239 * illegal bases may be turned into
240 * the suffix of the target.
242 if ( dnIsSuffix( &li->targets[ i ]->suffix,
244 realbase = li->targets[ i ]->suffix.bv_val;
247 * this target is no longer candidate
249 lsc->candidate = META_NOT_CANDIDATE;
254 case LDAP_SCOPE_ONELEVEL:
255 if ( is_one_level_rdn( li->targets[ i ]->suffix.bv_val,
256 suffixlen - nbase->bv_len - 1 )
257 && dnIsSuffix( &li->targets[ i ]->suffix, nbase ) ) {
259 * if there is exactly one level,
260 * make the target suffix the new
261 * base, and make scope "base"
263 realbase = li->targets[ i ]->suffix.bv_val;
264 realscope = LDAP_SCOPE_BASE;
266 } /* else continue with the next case */
268 case LDAP_SCOPE_BASE:
270 * this target is no longer candidate
272 lsc->candidate = META_NOT_CANDIDATE;
279 * Rewrite the search base, if required
281 switch ( rewrite_session( li->targets[ i ]->rwinfo,
283 realbase, conn, &mbase ) ) {
284 case REWRITE_REGEXEC_OK:
285 if ( mbase == NULL ) {
289 LDAP_LOG( BACK_META, DETAIL1,
290 "[rw] searchBase: \"%s\" -> \"%s\"\n", base->bv_val, mbase, 0 );
291 #else /* !NEW_LOGGING */
292 Debug( LDAP_DEBUG_ARGS, "rw> searchBase: \"%s\" -> \"%s\"\n%s",
293 base->bv_val, mbase, "" );
294 #endif /* !NEW_LOGGING */
297 case REWRITE_REGEXEC_UNWILLING:
298 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
299 NULL, NULL, NULL, NULL );
303 case REWRITE_REGEXEC_ERR:
304 send_ldap_result( conn, op, LDAP_OTHER,
305 NULL, NULL, NULL, NULL );
311 * Rewrite the search filter, if required
313 switch ( rewrite_session( li->targets[ i ]->rwinfo,
315 filterstr->bv_val, conn, &mfilter.bv_val ) ) {
316 case REWRITE_REGEXEC_OK:
317 if ( mfilter.bv_val != NULL && mfilter.bv_val[ 0 ] != '\0') {
318 mfilter.bv_len = strlen( mfilter.bv_val );
320 if ( mfilter.bv_val != NULL ) {
321 free( mfilter.bv_val );
323 mfilter = *filterstr;
326 LDAP_LOG( BACK_META, DETAIL1,
327 "[rw] searchFilter: \"%s\" -> \"%s\"\n",
328 filterstr->bv_val, mfilter.bv_val, 0 );
329 #else /* !NEW_LOGGING */
330 Debug( LDAP_DEBUG_ARGS,
331 "rw> searchFilter: \"%s\" -> \"%s\"\n%s",
332 filterstr->bv_val, mfilter.bv_val, "" );
333 #endif /* !NEW_LOGGING */
336 case REWRITE_REGEXEC_UNWILLING:
337 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
338 NULL, NULL, NULL, NULL );
342 case REWRITE_REGEXEC_ERR:
343 send_ldap_result( conn, op, LDAP_OTHER,
344 NULL, NULL, NULL, NULL );
350 * Maps attributes in filter
352 mapped_filter = ldap_back_map_filter( &li->targets[ i ]->at_map,
353 &li->targets[ i ]->oc_map, &mfilter, 0 );
354 if ( mapped_filter == NULL ) {
355 mapped_filter = ( char * )mfilter.bv_val;
357 if ( mfilter.bv_val != filterstr->bv_val ) {
358 free( mfilter.bv_val );
361 mfilter.bv_val = NULL;
365 * Maps required attributes
367 mapped_attrs = ldap_back_map_attrs( &li->targets[ i ]->at_map,
369 if ( mapped_attrs == NULL && attrs) {
370 for ( count=0; attrs[ count ].an_name.bv_val; count++ );
371 mapped_attrs = ch_malloc( ( count + 1 ) * sizeof(char *));
372 for ( count=0; attrs[ count ].an_name.bv_val; count++ ) {
373 mapped_attrs[ count ] = attrs[ count ].an_name.bv_val;
375 mapped_attrs[ count ] = NULL;
381 msgid[ i ] = ldap_search( lsc->ld, mbase, realscope,
382 mapped_filter, mapped_attrs, attrsonly );
383 if ( msgid[ i ] == -1 ) {
384 lsc->candidate = META_NOT_CANDIDATE;
388 if ( mapped_attrs ) {
389 free( mapped_attrs );
392 if ( mapped_filter != filterstr->bv_val ) {
393 free( mapped_filter );
394 mapped_filter = NULL;
396 if ( mbase != realbase ) {
404 /* We pull apart the ber result, stuff it into a slapd entry, and
405 * let send_search_entry stuff it back into ber format. Slow & ugly,
406 * but this is necessary for version matching, and for ACL processing.
411 * In case there are no candidates, no cycle takes place...
413 * FIXME: we might use a queue, to balance the load
414 * among the candidates
416 for ( count = 0, rc = 0; candidates > 0; ) {
419 /* check for abandon */
422 for ( i = 0, lsc = lc->conns; !META_LAST(lsc); lsc++, i++ ) {
423 if ( lsc->candidate != META_CANDIDATE ) {
428 ldap_abandon( lsc->ld, msgid[ i ] );
433 if ( slimit > 0 && count == slimit ) {
434 send_search_result( conn, op,
435 LDAP_SIZELIMIT_EXCEEDED,
436 NULL, NULL, v2refs, NULL,
442 * FIXME: handle time limit as well?
443 * Note that target servers are likely
444 * to handle it, so at some time we'll
445 * get a LDAP_TIMELIMIT_EXCEEDED from
448 rc = ldap_result( lsc->ld, msgid[ i ],
454 } else if ( rc == -1 ) {
455 /* something REALLY bad happened! */
456 ( void )meta_clear_unused_candidates( li,
458 send_search_result( conn, op, LDAP_OTHER,
459 NULL, NULL, v2refs, NULL,
462 /* anything else needs be done? */
465 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
466 e = ldap_first_entry( lsc->ld, res );
467 if ( meta_send_entry( be, op, lc, i, e, attrs,
468 attrsonly ) == LDAP_SUCCESS ) {
474 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
475 char **references = NULL;
476 LDAPControl **ctrls = NULL;
481 * FIXME: should we collect references
482 * and send them alltogether at the end?
485 rc = ldap_parse_reference( lsc->ld, res,
486 &references, &ctrls, 1 );
488 if ( rc != LDAP_SUCCESS ) {
492 if ( references == NULL ) {
496 for ( cnt = 0; references[ cnt ]; cnt++ )
499 refs = ch_calloc( cnt + 1, sizeof( struct berval ) );
501 for ( cnt = 0; references[ cnt ]; cnt++ ) {
502 refs[ cnt ].bv_val = references[ cnt ];
503 refs[ cnt ].bv_len = strlen( references[ cnt ] );
506 /* ignore return value by now */
507 ( void )send_search_reference( be, conn, op,
508 NULL, refs, ctrls, &v2refs );
512 ldap_value_free( references );
517 ldap_controls_free( ctrls );
521 sres = ldap_result2error( lsc->ld,
523 sres = ldap_back_map_result( sres );
527 ldap_get_option( lsc->ld,
528 LDAP_OPT_ERROR_STRING, &err );
529 if ( match != NULL ) {
532 ldap_get_option( lsc->ld,
533 LDAP_OPT_MATCHED_DN, &match );
536 LDAP_LOG( BACK_META, ERR,
537 "meta_back_search [%d] "
538 "match=\"%s\" err=\"%s\"\n",
540 #else /* !NEW_LOGGING */
541 Debug( LDAP_DEBUG_ANY,
542 "=>meta_back_search [%d] "
543 "match=\"%s\" err=\"%s\"\n",
545 #endif /* !NEW_LOGGING */
551 * When no candidates are left,
552 * the outer cycle finishes
554 lsc->candidate = META_NOT_CANDIDATE;
566 ldap_pvt_thread_yield();
575 * FIXME: need a strategy to handle errors
577 rc = meta_back_op_result( lc, op );
582 * Rewrite the matched portion of the search base, if required
584 * FIXME: only the last one gets caught!
586 if ( match != NULL ) {
587 switch ( rewrite_session( li->targets[ last ]->rwinfo,
588 "matchedDn", match, conn, &mmatch ) ) {
589 case REWRITE_REGEXEC_OK:
590 if ( mmatch == NULL ) {
591 mmatch = ( char * )match;
594 LDAP_LOG( BACK_META, DETAIL1,
595 "[rw] matchedDn: \"%s\" -> \"%s\"\n", match, mmatch, 0 );
596 #else /* !NEW_LOGGING */
597 Debug( LDAP_DEBUG_ARGS, "rw> matchedDn:"
598 " \"%s\" -> \"%s\"\n%s",
600 #endif /* !NEW_LOGGING */
603 case REWRITE_REGEXEC_UNWILLING:
604 send_ldap_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
605 NULL, NULL, NULL, NULL );
609 case REWRITE_REGEXEC_ERR:
610 send_ldap_result( conn, op, LDAP_OTHER,
611 NULL, NULL, NULL, NULL );
618 * In case we returned at least one entry, we return LDAP_SUCCESS
619 * otherwise, the latter error code we got
621 * FIXME: we should handle error codes and return the more
622 * important/reasonable
624 if ( sres == LDAP_SUCCESS && v2refs ) {
625 sres = LDAP_REFERRAL;
627 send_search_result( conn, op, sres, mmatch, err, v2refs, NULL, count );
631 if ( mmatch != match ) {
655 AttributeName *attrs,
659 struct metainfo *li = ( struct metainfo * )be->be_private;
660 struct berval a, mapped;
662 BerElement ber = *e->lm_ber;
663 Attribute *attr, **attrp;
664 struct berval dummy = { 0, NULL };
665 struct berval *bv, bdn;
668 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
669 return LDAP_DECODING_ERROR;
673 * Rewrite the dn of the result, if needed
675 switch ( rewrite_session( li->targets[ target ]->rwinfo,
676 "searchResult", bdn.bv_val, lc->conn, &ent.e_name.bv_val ) ) {
677 case REWRITE_REGEXEC_OK:
678 if ( ent.e_name.bv_val == NULL ) {
683 LDAP_LOG( BACK_META, DETAIL1,
684 "[rw] searchResult[%d]: \"%s\" -> \"%s\"\n",
685 target, bdn.bv_val, ent.e_name.bv_val );
686 #else /* !NEW_LOGGING */
687 Debug( LDAP_DEBUG_ARGS, "rw> searchResult[%d]: \"%s\""
688 " -> \"%s\"\n", target, bdn.bv_val, ent.e_name.bv_val );
689 #endif /* !NEW_LOGGING */
690 ent.e_name.bv_len = strlen( ent.e_name.bv_val );
694 case REWRITE_REGEXEC_ERR:
695 case REWRITE_REGEXEC_UNWILLING:
700 * Note: this may fail if the target host(s) schema differs
701 * from the one known to the meta, and a DN with unknown
702 * attributes is returned.
704 * FIXME: should we log anything, or delegate to dnNormalize2?
706 if ( dnNormalize2( NULL, &ent.e_name, &ent.e_nname ) != LDAP_SUCCESS ) {
707 return LDAP_INVALID_DN_SYNTAX;
713 if ( li->cache.ttl != META_DNCACHE_DISABLED ) {
714 ( void )meta_dncache_update_entry( &li->cache,
722 attrp = &ent.e_attrs;
724 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
725 ldap_back_map( &li->targets[ target ]->at_map,
727 if ( mapped.bv_val == NULL ) {
730 attr = ( Attribute * )ch_malloc( sizeof( Attribute ) );
731 if ( attr == NULL ) {
737 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
739 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text )
742 LDAP_LOG( BACK_META, DETAIL1,
743 "slap_bv2undef_ad(%s): %s\n", mapped.bv_val, text, 0 );
744 #else /* !NEW_LOGGING */
745 Debug( LDAP_DEBUG_ANY,
746 "slap_bv2undef_ad(%s): "
747 "%s\n%s", mapped.bv_val, text, "" );
748 #endif /* !NEW_LOGGING */
754 /* no subschemaSubentry */
755 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
760 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
761 || attr->a_vals == NULL ) {
762 attr->a_vals = &dummy;
764 } else if ( attr->a_desc == slap_schema.si_ad_objectClass
765 || attr->a_desc == slap_schema.si_ad_structuralObjectClass ) {
767 for ( last = 0; attr->a_vals[ last ].bv_val; ++last );
768 for ( i = 0, bv = attr->a_vals; bv->bv_val; bv++, i++ ) {
769 ldap_back_map( &li->targets[ target]->oc_map,
771 if ( mapped.bv_val == NULL ) {
777 *bv = attr->a_vals[ last ];
778 attr->a_vals[ last ].bv_val = NULL;
781 } else if ( mapped.bv_val != bv->bv_val ) {
783 ber_dupbv( bv, &mapped );
787 * It is necessary to try to rewrite attributes with
788 * dn syntax because they might be used in ACLs as
789 * members of groups; since ACLs are applied to the
790 * rewritten stuff, no dn-based subecj clause could
791 * be used at the ldap backend side (see
792 * http://www.OpenLDAP.org/faq/data/cache/452.html)
793 * The problem can be overcome by moving the dn-based
794 * ACLs to the target directory server, and letting
795 * everything pass thru the ldap backend.
797 } else if ( strcmp( attr->a_desc->ad_type->sat_syntax->ssyn_oid,
798 SLAPD_DN_SYNTAX ) == 0 ) {
800 for ( i = 0, bv = attr->a_vals; bv->bv_val; bv++, i++ ) {
803 switch ( rewrite_session( li->targets[ target ]->rwinfo,
806 lc->conn, &newval )) {
807 case REWRITE_REGEXEC_OK:
809 if ( newval == NULL ) {
813 LDAP_LOG( BACK_META, DETAIL1,
814 "[rw] searchResult on attr=%s: \"%s\" -> \"%s\"\n",
815 attr->a_desc->ad_type->sat_cname.bv_val,
816 bv->bv_val, newval );
817 #else /* !NEW_LOGGING */
818 Debug( LDAP_DEBUG_ARGS,
819 "rw> searchResult on attr=%s:"
820 " \"%s\" -> \"%s\"\n",
821 attr->a_desc->ad_type->sat_cname.bv_val,
822 bv->bv_val, newval );
823 #endif /* !NEW_LOGGING */
826 bv->bv_len = strlen( newval );
830 case REWRITE_REGEXEC_UNWILLING:
832 case REWRITE_REGEXEC_ERR:
834 * FIXME: better give up,
836 * or leave it untouched?
843 attrp = &attr->a_next;
845 send_search_entry( be, lc->conn, op, &ent, attrs, attrsonly, NULL );
846 while ( ent.e_attrs ) {
848 ent.e_attrs = attr->a_next;
849 if ( attr->a_vals != &dummy ) {
850 ber_bvarray_free( attr->a_vals );
855 if ( ent.e_dn && ent.e_dn != bdn.bv_val ) {
872 if ( DN_SEPARATOR( rdn[ from ] ) ) {