1 /* search.c - ldap backend search function */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2006 The OpenLDAP Foundation.
6 * Portions Copyright 1999-2003 Howard Chu.
7 * Portions Copyright 2000-2003 Pierangelo Masarati.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted only as authorized by the OpenLDAP
14 * A copy of this license is available in the file LICENSE in the
15 * top-level directory of the distribution or, alternatively, at
16 * <http://www.OpenLDAP.org/license.html>.
19 * This work was initially developed by the Howard Chu for inclusion
20 * in OpenLDAP Software and subsequently enhanced by Pierangelo
28 #include <ac/socket.h>
29 #include <ac/string.h>
33 #include "back-ldap.h"
34 #undef ldap_debug /* silence a warning in ldap-int.h */
35 #include "../../../libraries/libldap/ldap-int.h"
40 ldap_build_entry( Operation *op, LDAPMessage *e, Entry *ent,
44 * Quick'n'dirty rewrite of filter in case of error, to deal with
45 * <draft-zeilenga-ldap-t-f>.
48 ldap_back_munge_filter(
50 struct berval *filter )
52 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
57 Debug( LDAP_DEBUG_ARGS, "=> ldap_back_munge_filter \"%s\"\n",
58 filter->bv_val, 0, 0 );
60 for ( ptr = strstr( filter->bv_val, "(?=" );
62 ptr = strstr( ptr, "(?=" ) )
65 bv_true = BER_BVC( "(?=true)" ),
66 bv_false = BER_BVC( "(?=false)" ),
67 bv_undefined = BER_BVC( "(?=undefined)" ),
68 bv_t = BER_BVC( "(&)" ),
69 bv_f = BER_BVC( "(|)" ),
70 bv_T = BER_BVC( "(objectClass=*)" ),
71 bv_F = BER_BVC( "(!(objectClass=*))" );
72 struct berval *oldbv = NULL,
74 oldfilter = BER_BVNULL;
76 if ( strncmp( ptr, bv_true.bv_val, bv_true.bv_len ) == 0 ) {
78 if ( LDAP_BACK_T_F( li ) ) {
85 } else if ( strncmp( ptr, bv_false.bv_val, bv_false.bv_len ) == 0 )
88 if ( LDAP_BACK_T_F( li ) ) {
95 } else if ( strncmp( ptr, bv_undefined.bv_val, bv_undefined.bv_len ) == 0 )
97 oldbv = &bv_undefined;
106 if ( newbv->bv_len > oldbv->bv_len ) {
107 filter->bv_len += newbv->bv_len - oldbv->bv_len;
108 if ( filter->bv_val == op->ors_filterstr.bv_val ) {
109 filter->bv_val = op->o_tmpalloc( filter->bv_len + 1,
112 AC_MEMCPY( filter->bv_val, op->ors_filterstr.bv_val,
113 op->ors_filterstr.bv_len + 1 );
116 filter->bv_val = op->o_tmprealloc( filter->bv_val,
117 filter->bv_len + 1, op->o_tmpmemctx );
120 ptr = filter->bv_val + ( ptr - oldfilter.bv_val );
123 AC_MEMCPY( &ptr[ newbv->bv_len ],
124 &ptr[ oldbv->bv_len ],
125 oldfilter.bv_len - ( ptr - filter->bv_val ) - oldbv->bv_len + 1 );
126 AC_MEMCPY( ptr, newbv->bv_val, newbv->bv_len );
128 ptr += newbv->bv_len;
133 Debug( LDAP_DEBUG_ARGS, "<= ldap_back_munge_filter \"%s\" (%d)\n",
134 filter->bv_val, gotit, 0 );
144 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
146 ldapconn_t *lc = NULL;
148 time_t stoptime = (time_t)(-1);
153 struct berval match = BER_BVNULL,
159 int do_retry = 1, dont_retry = 0;
160 LDAPControl **ctrls = NULL;
161 /* FIXME: shouldn't this be null? */
162 const char *save_matched = rs->sr_matched;
164 if ( !ldap_back_dobind( &lc, op, rs, LDAP_BACK_SENDERR ) ) {
169 * FIXME: in case of values return filter, we might want
170 * to map attrs and maybe rewrite value
173 /* should we check return values? */
174 if ( op->ors_deref != -1 ) {
175 ldap_set_option( lc->lc_ld, LDAP_OPT_DEREF,
176 (void *)&op->ors_deref );
179 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
180 tv.tv_sec = op->ors_tlimit;
182 stoptime = op->o_time + op->ors_tlimit;
185 LDAP_BACK_TV_SET( &tv );
188 if ( op->ors_attrs ) {
189 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
190 /* just count attrs */ ;
192 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
193 if ( attrs == NULL ) {
194 rs->sr_err = LDAP_NO_MEMORY;
199 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
200 attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
206 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
207 li->li_version, &li->li_idassert, op, rs, &ctrls );
208 if ( rc != LDAP_SUCCESS ) {
212 /* deal with <draft-zeilenga-ldap-t-f> filters */
213 filter = op->ors_filterstr;
215 rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_dn.bv_val,
216 op->ors_scope, filter.bv_val,
217 attrs, op->ors_attrsonly, ctrls, NULL,
218 tv.tv_sec ? &tv : NULL,
219 op->ors_slimit, &msgid );
221 if ( rs->sr_err != LDAP_SUCCESS ) {
222 switch ( rs->sr_err ) {
223 case LDAP_SERVER_DOWN:
226 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
232 /* reset by ldap_back_retry ... */
233 rs->sr_err = slap_map_api2result( rs );
236 rc = ldap_back_op_result( lc, op, rs, msgid, 0, LDAP_BACK_DONTSEND );
241 case LDAP_FILTER_ERROR:
242 if ( ldap_back_munge_filter( op, &filter ) ) {
247 /* invalid filters return success with no data */
248 rs->sr_err = LDAP_SUCCESS;
253 rs->sr_err = slap_map_api2result( rs );
259 /* We pull apart the ber result, stuff it into a slapd entry, and
260 * let send_search_entry stuff it back into ber format. Slow & ugly,
261 * but this is necessary for version matching, and for ACL processing.
264 for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, LDAP_MSG_ONE, &tv, &res ) )
266 /* check for abandon */
267 if ( op->o_abandon ) {
271 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
277 LDAP_BACK_TV_SET( &tv );
278 ldap_pvt_thread_yield();
280 /* check time limit */
281 if ( op->ors_tlimit != SLAP_NO_LIMIT
282 && slap_get_time() > stoptime )
284 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
285 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
291 /* only touch when activity actually took place... */
292 if ( li->li_idle_timeout && lc ) {
293 lc->lc_time = op->o_time;
296 /* don't retry any more */
301 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
303 struct berval bdn = BER_BVNULL;
307 e = ldap_first_entry( lc->lc_ld, res );
308 rc = ldap_build_entry( op, e, &ent, &bdn );
309 if ( rc == LDAP_SUCCESS ) {
311 rs->sr_attrs = op->ors_attrs;
312 rs->sr_operational_attrs = NULL;
314 rs->sr_err = LDAP_SUCCESS;
315 rc = rs->sr_err = send_search_entry( op, rs );
316 if ( !BER_BVISNULL( &ent.e_name ) ) {
317 assert( ent.e_name.bv_val != bdn.bv_val );
318 op->o_tmpfree( ent.e_name.bv_val, op->o_tmpmemctx );
319 BER_BVZERO( &ent.e_name );
321 if ( !BER_BVISNULL( &ent.e_nname ) ) {
322 op->o_tmpfree( ent.e_nname.bv_val, op->o_tmpmemctx );
323 BER_BVZERO( &ent.e_nname );
328 if ( rc != LDAP_SUCCESS ) {
329 if ( rc == LDAP_UNAVAILABLE ) {
330 rc = rs->sr_err = LDAP_OTHER;
332 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
337 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
338 char **references = NULL;
341 rc = ldap_parse_reference( lc->lc_ld, res,
342 &references, &rs->sr_ctrls, 1 );
344 if ( rc != LDAP_SUCCESS ) {
348 /* FIXME: there MUST be at least one */
349 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
352 for ( cnt = 0; references[ cnt ]; cnt++ )
355 /* FIXME: there MUST be at least one */
356 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
359 for ( cnt = 0; references[ cnt ]; cnt++ ) {
360 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
362 BER_BVZERO( &rs->sr_ref[ cnt ] );
364 /* ignore return value by now */
365 ( void )send_search_reference( op, rs );
368 Debug( LDAP_DEBUG_ANY,
369 "%s ldap_back_search: "
370 "got SEARCH_REFERENCE "
371 "with no referrals\n",
372 op->o_log_prefix, 0, 0 );
377 ber_memvfree( (void **)references );
378 op->o_tmpfree( rs->sr_ref, op->o_tmpmemctx );
382 if ( rs->sr_ctrls ) {
383 ldap_controls_free( rs->sr_ctrls );
388 char **references = NULL, *err = NULL;
390 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
392 &references, &rs->sr_ctrls, 1 );
393 if ( rc != LDAP_SUCCESS ) {
396 rs->sr_err = slap_map_api2result( rs );
402 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
405 if ( rs->sr_err != LDAP_REFERRAL ) {
407 Debug( LDAP_DEBUG_ANY,
408 "%s ldap_back_search: "
409 "got referrals with %d\n",
412 rs->sr_err = LDAP_REFERRAL;
415 for ( cnt = 0; references[ cnt ]; cnt++ )
418 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
421 for ( cnt = 0; references[ cnt ]; cnt++ ) {
423 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
425 BER_BVZERO( &rs->sr_ref[ cnt ] );
428 if ( match.bv_val != NULL ) {
429 match.bv_len = strlen( match.bv_val );
434 ber_memvfree( (void **)references );
442 if ( rc == -1 && dont_retry == 0 ) {
445 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
449 rs->sr_err = LDAP_SERVER_DOWN;
450 rs->sr_err = slap_map_api2result( rs );
455 * Rewrite the matched portion of the search base, if required
457 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
458 struct berval pmatch;
460 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
461 rs->sr_matched = pmatch.bv_val;
462 LDAP_FREE( match.bv_val );
465 rs->sr_matched = match.bv_val;
469 if ( rs->sr_v2ref ) {
470 rs->sr_err = LDAP_REFERRAL;
474 if ( LDAP_BACK_QUARANTINE( li ) ) {
475 ldap_back_quarantine( op, rs );
479 /* let send_ldap_result play cleanup handlers (ITS#4645) */
480 if ( rc != SLAPD_ABANDON )
483 send_ldap_result( op, rs );
486 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
488 if ( rs->sr_ctrls ) {
489 ldap_controls_free( rs->sr_ctrls );
493 if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
494 if ( rs->sr_matched != match.bv_val ) {
495 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
498 LDAP_FREE( match.bv_val );
500 rs->sr_matched = save_matched;
504 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
509 LDAP_FREE( (char *)rs->sr_text );
515 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
524 ldap_back_release_conn( op, rs, lc );
538 BerElement ber = *e->lm_ber;
539 Attribute *attr, **attrp;
543 /* safe assumptions ... */
544 assert( ent != NULL );
545 BER_BVZERO( &ent->e_bv );
547 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
548 return LDAP_DECODING_ERROR;
552 * Note: this may fail if the target host(s) schema differs
553 * from the one known to the meta, and a DN with unknown
554 * attributes is returned.
556 * FIXME: should we log anything, or delegate to dnNormalize?
558 /* Note: if the distinguished values or the naming attributes
559 * change, should we massage them as well?
561 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
562 op->o_tmpmemctx ) != LDAP_SUCCESS )
564 return LDAP_INVALID_DN_SYNTAX;
567 attrp = &ent->e_attrs;
569 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
571 slap_syntax_validate_func *validate;
572 slap_syntax_transform_func *pretty;
574 attr = attr_alloc( NULL );
575 if ( attr == NULL ) {
578 if ( slap_bv2ad( &a, &attr->a_desc, &text )
581 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
582 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
584 Debug( LDAP_DEBUG_ANY,
585 "%s ldap_build_entry: "
586 "slap_bv2undef_ad(%s): %s\n",
587 op->o_log_prefix, a.bv_val, text );
593 /* no subschemaSubentry */
594 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
595 || attr->a_desc == slap_schema.si_ad_entryDN )
599 * We eat target's subschemaSubentry because
600 * a search for this value is likely not
601 * to resolve to the appropriate backend;
602 * later, the local subschemaSubentry is
605 * We also eat entryDN because the frontend
606 * will reattach it without checking if already
609 ( void )ber_scanf( &ber, "x" /* [W] */ );
615 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
616 || attr->a_vals == NULL )
619 * Note: attr->a_vals can be null when using
620 * values result filter
622 attr->a_vals = (struct berval *)&slap_dummy_bv;
626 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
627 /* just count vals */ ;
630 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
631 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
633 if ( !validate && !pretty ) {
634 attr->a_nvals = NULL;
639 for ( i = 0; i < last; i++ ) {
644 rc = pretty( attr->a_desc->ad_type->sat_syntax,
645 &attr->a_vals[i], &pval, NULL );
648 rc = validate( attr->a_desc->ad_type->sat_syntax,
652 if ( rc != LDAP_SUCCESS ) {
653 /* check if, by chance, it's an undefined objectClass */
654 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
655 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
657 ber_dupbv( &pval, &attr->a_vals[i] );
660 attr->a_nvals = NULL;
667 LBER_FREE( attr->a_vals[i].bv_val );
668 attr->a_vals[i] = pval;
672 if ( last && attr->a_desc->ad_type->sat_equality &&
673 attr->a_desc->ad_type->sat_equality->smr_normalize )
675 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
676 for ( i = 0; i < last; i++ ) {
680 * check that each value is valid per syntax
681 * and pretty if appropriate
683 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
684 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
685 attr->a_desc->ad_type->sat_syntax,
686 attr->a_desc->ad_type->sat_equality,
687 &attr->a_vals[i], &attr->a_nvals[i],
690 if ( rc != LDAP_SUCCESS ) {
691 BER_BVZERO( &attr->a_nvals[i] );
696 BER_BVZERO( &attr->a_nvals[i] );
699 attr->a_nvals = attr->a_vals;
702 attrp = &attr->a_next;
710 /* return 0 IFF we can retrieve the entry with ndn
717 AttributeDescription *at,
721 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
723 ldapconn_t *lc = NULL;
727 LDAPMessage *result = NULL,
729 char *attr[3], **attrp = NULL;
733 LDAPControl **ctrls = NULL;
737 /* Tell getconn this is a privileged op */
738 do_not_cache = op->o_do_not_cache;
739 op->o_do_not_cache = 1;
740 if ( !ldap_back_dobind( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
741 op->o_do_not_cache = do_not_cache;
744 op->o_do_not_cache = do_not_cache;
748 if ( oc && at != slap_schema.si_ad_objectClass ) {
749 attr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
750 attr[1] = at->ad_cname.bv_val;
754 attr[0] = at->ad_cname.bv_val;
762 filter = ch_malloc( STRLENOF( "(objectclass=)" )
763 + oc->soc_cname.bv_len + 1 );
764 ptr = lutil_strcopy( filter, "(objectclass=" );
765 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
772 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
773 li->li_version, &li->li_idassert, op, &rs, &ctrls );
774 if ( rc != LDAP_SUCCESS ) {
778 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
779 attrp, 0, ctrls, NULL,
780 NULL, LDAP_NO_LIMIT, &result );
781 if ( rc != LDAP_SUCCESS ) {
782 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
784 if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
785 /* if the identity changed, there might be need to re-authz */
786 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
793 e = ldap_first_entry( lc->lc_ld, result );
795 /* the entry exists, but it doesn't match the filter? */
799 *ent = entry_alloc();
800 if ( *ent == NULL ) {
805 rc = ldap_build_entry( op, e, *ent, &bdn );
807 if ( rc != LDAP_SUCCESS ) {
813 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
816 ldap_msgfree( result );
824 ldap_back_release_conn( op, &rs, lc );