1 /* search.c - ldap backend search function */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2007 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 /* if needed, initialize timeout */
260 if ( li->li_timeout[ SLAP_OP_SEARCH ] ) {
261 if ( tv.tv_sec == 0 || tv.tv_sec > li->li_timeout[ SLAP_OP_SEARCH ] ) {
262 tv.tv_sec = li->li_timeout[ SLAP_OP_SEARCH ];
267 /* We pull apart the ber result, stuff it into a slapd entry, and
268 * let send_search_entry stuff it back into ber format. Slow & ugly,
269 * but this is necessary for version matching, and for ACL processing.
272 for ( rc = -2; rc != -1; rc = ldap_result( lc->lc_ld, msgid, LDAP_MSG_ONE, &tv, &res ) )
274 /* check for abandon */
275 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( lc ) ) {
279 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
284 if ( rc == 0 || rc == -2 ) {
285 ldap_pvt_thread_yield();
288 if ( li->li_timeout[ SLAP_OP_SEARCH ] ) {
290 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
291 rs->sr_text = "Operation timed out";
292 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
293 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
298 LDAP_BACK_TV_SET( &tv );
301 /* check time limit */
302 if ( op->ors_tlimit != SLAP_NO_LIMIT
303 && slap_get_time() > stoptime )
305 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
306 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
312 /* only touch when activity actually took place... */
313 if ( li->li_idle_timeout && lc ) {
314 lc->lc_time = op->o_time;
317 /* don't retry any more */
322 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
324 struct berval bdn = BER_BVNULL;
328 e = ldap_first_entry( lc->lc_ld, res );
329 rc = ldap_build_entry( op, e, &ent, &bdn );
330 if ( rc == LDAP_SUCCESS ) {
332 rs->sr_attrs = op->ors_attrs;
333 rs->sr_operational_attrs = NULL;
335 rs->sr_err = LDAP_SUCCESS;
336 rc = rs->sr_err = send_search_entry( op, rs );
337 if ( !BER_BVISNULL( &ent.e_name ) ) {
338 assert( ent.e_name.bv_val != bdn.bv_val );
339 op->o_tmpfree( ent.e_name.bv_val, op->o_tmpmemctx );
340 BER_BVZERO( &ent.e_name );
342 if ( !BER_BVISNULL( &ent.e_nname ) ) {
343 op->o_tmpfree( ent.e_nname.bv_val, op->o_tmpmemctx );
344 BER_BVZERO( &ent.e_nname );
349 if ( rc != LDAP_SUCCESS ) {
350 if ( rc == LDAP_UNAVAILABLE ) {
351 rc = rs->sr_err = LDAP_OTHER;
353 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
358 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
359 char **references = NULL;
362 rc = ldap_parse_reference( lc->lc_ld, res,
363 &references, &rs->sr_ctrls, 1 );
365 if ( rc != LDAP_SUCCESS ) {
369 /* FIXME: there MUST be at least one */
370 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
373 for ( cnt = 0; references[ cnt ]; cnt++ )
376 /* FIXME: there MUST be at least one */
377 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
380 for ( cnt = 0; references[ cnt ]; cnt++ ) {
381 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
383 BER_BVZERO( &rs->sr_ref[ cnt ] );
385 /* ignore return value by now */
386 ( void )send_search_reference( op, rs );
389 Debug( LDAP_DEBUG_ANY,
390 "%s ldap_back_search: "
391 "got SEARCH_REFERENCE "
392 "with no referrals\n",
393 op->o_log_prefix, 0, 0 );
398 ber_memvfree( (void **)references );
399 op->o_tmpfree( rs->sr_ref, op->o_tmpmemctx );
403 if ( rs->sr_ctrls ) {
404 ldap_controls_free( rs->sr_ctrls );
409 char **references = NULL, *err = NULL;
411 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
413 &references, &rs->sr_ctrls, 1 );
414 if ( rc != LDAP_SUCCESS ) {
417 rs->sr_err = slap_map_api2result( rs );
423 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
426 if ( rs->sr_err != LDAP_REFERRAL ) {
428 Debug( LDAP_DEBUG_ANY,
429 "%s ldap_back_search: "
430 "got referrals with %d\n",
433 rs->sr_err = LDAP_REFERRAL;
436 for ( cnt = 0; references[ cnt ]; cnt++ )
439 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
442 for ( cnt = 0; references[ cnt ]; cnt++ ) {
444 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
446 BER_BVZERO( &rs->sr_ref[ cnt ] );
449 if ( match.bv_val != NULL ) {
450 #ifndef LDAP_NULL_IS_NULL
451 if ( match.bv_val[ 0 ] == '\0' ) {
452 LDAP_FREE( match.bv_val );
453 BER_BVZERO( &match );
455 #endif /* LDAP_NULL_IS_NULL */
457 match.bv_len = strlen( match.bv_val );
460 #ifndef LDAP_NULL_IS_NULL
461 if ( rs->sr_text != NULL && rs->sr_text[ 0 ] == '\0' ) {
462 LDAP_FREE( (char *)rs->sr_text );
465 #endif /* LDAP_NULL_IS_NULL */
469 ber_memvfree( (void **)references );
476 /* if needed, restore timeout */
477 if ( li->li_timeout[ SLAP_OP_SEARCH ] ) {
478 if ( tv.tv_sec == 0 || tv.tv_sec > li->li_timeout[ SLAP_OP_SEARCH ] ) {
479 tv.tv_sec = li->li_timeout[ SLAP_OP_SEARCH ];
485 if ( rc == -1 && dont_retry == 0 ) {
488 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
492 rs->sr_err = LDAP_SERVER_DOWN;
493 rs->sr_err = slap_map_api2result( rs );
498 * Rewrite the matched portion of the search base, if required
500 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
501 struct berval pmatch;
503 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
504 rs->sr_matched = pmatch.bv_val;
505 LDAP_FREE( match.bv_val );
508 rs->sr_matched = match.bv_val;
512 if ( rs->sr_v2ref ) {
513 rs->sr_err = LDAP_REFERRAL;
517 if ( LDAP_BACK_QUARANTINE( li ) ) {
518 ldap_back_quarantine( op, rs );
522 /* let send_ldap_result play cleanup handlers (ITS#4645) */
523 if ( rc != SLAPD_ABANDON )
526 send_ldap_result( op, rs );
529 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
531 if ( rs->sr_ctrls ) {
532 ldap_controls_free( rs->sr_ctrls );
536 if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
537 if ( rs->sr_matched != match.bv_val ) {
538 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
541 LDAP_FREE( match.bv_val );
543 rs->sr_matched = save_matched;
547 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
552 LDAP_FREE( (char *)rs->sr_text );
558 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
567 ldap_back_release_conn( li, lc );
581 BerElement ber = *e->lm_ber;
582 Attribute *attr, **attrp;
586 /* safe assumptions ... */
587 assert( ent != NULL );
588 BER_BVZERO( &ent->e_bv );
590 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
591 return LDAP_DECODING_ERROR;
595 * Note: this may fail if the target host(s) schema differs
596 * from the one known to the meta, and a DN with unknown
597 * attributes is returned.
599 * FIXME: should we log anything, or delegate to dnNormalize?
601 /* Note: if the distinguished values or the naming attributes
602 * change, should we massage them as well?
604 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
605 op->o_tmpmemctx ) != LDAP_SUCCESS )
607 return LDAP_INVALID_DN_SYNTAX;
610 attrp = &ent->e_attrs;
612 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
614 slap_syntax_validate_func *validate;
615 slap_syntax_transform_func *pretty;
617 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
618 if ( attr == NULL ) {
624 if ( slap_bv2ad( &a, &attr->a_desc, &text )
627 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
628 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
630 Debug( LDAP_DEBUG_ANY,
631 "%s ldap_build_entry: "
632 "slap_bv2undef_ad(%s): %s\n",
633 op->o_log_prefix, a.bv_val, text );
639 /* no subschemaSubentry */
640 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
641 || attr->a_desc == slap_schema.si_ad_entryDN )
645 * We eat target's subschemaSubentry because
646 * a search for this value is likely not
647 * to resolve to the appropriate backend;
648 * later, the local subschemaSubentry is
651 * We also eat entryDN because the frontend
652 * will reattach it without checking if already
655 ( void )ber_scanf( &ber, "x" /* [W] */ );
661 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
662 || attr->a_vals == NULL )
665 * Note: attr->a_vals can be null when using
666 * values result filter
668 attr->a_vals = (struct berval *)&slap_dummy_bv;
672 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
673 /* just count vals */ ;
676 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
677 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
679 if ( !validate && !pretty ) {
680 attr->a_nvals = NULL;
685 for ( i = 0; i < last; i++ ) {
690 rc = pretty( attr->a_desc->ad_type->sat_syntax,
691 &attr->a_vals[i], &pval, NULL );
694 rc = validate( attr->a_desc->ad_type->sat_syntax,
698 if ( rc != LDAP_SUCCESS ) {
699 /* check if, by chance, it's an undefined objectClass */
700 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
701 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
703 ber_dupbv( &pval, &attr->a_vals[i] );
706 attr->a_nvals = NULL;
713 LBER_FREE( attr->a_vals[i].bv_val );
714 attr->a_vals[i] = pval;
718 if ( last && attr->a_desc->ad_type->sat_equality &&
719 attr->a_desc->ad_type->sat_equality->smr_normalize )
721 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
722 for ( i = 0; i < last; i++ ) {
726 * check that each value is valid per syntax
727 * and pretty if appropriate
729 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
730 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
731 attr->a_desc->ad_type->sat_syntax,
732 attr->a_desc->ad_type->sat_equality,
733 &attr->a_vals[i], &attr->a_nvals[i],
736 if ( rc != LDAP_SUCCESS ) {
737 BER_BVZERO( &attr->a_nvals[i] );
742 BER_BVZERO( &attr->a_nvals[i] );
745 attr->a_nvals = attr->a_vals;
748 attrp = &attr->a_next;
756 /* return 0 IFF we can retrieve the entry with ndn
763 AttributeDescription *at,
767 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
769 ldapconn_t *lc = NULL;
773 LDAPMessage *result = NULL,
775 char *attr[3], **attrp = NULL;
779 LDAPControl **ctrls = NULL;
783 /* Tell getconn this is a privileged op */
784 do_not_cache = op->o_do_not_cache;
785 op->o_do_not_cache = 1;
786 if ( !ldap_back_dobind( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
787 op->o_do_not_cache = do_not_cache;
790 op->o_do_not_cache = do_not_cache;
794 if ( oc && at != slap_schema.si_ad_objectClass ) {
795 attr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
796 attr[1] = at->ad_cname.bv_val;
800 attr[0] = at->ad_cname.bv_val;
808 filter = ch_malloc( STRLENOF( "(objectclass=)" )
809 + oc->soc_cname.bv_len + 1 );
810 ptr = lutil_strcopy( filter, "(objectclass=" );
811 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
818 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
819 li->li_version, &li->li_idassert, op, &rs, &ctrls );
820 if ( rc != LDAP_SUCCESS ) {
824 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
825 attrp, 0, ctrls, NULL,
826 NULL, LDAP_NO_LIMIT, &result );
827 if ( rc != LDAP_SUCCESS ) {
828 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
830 if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
831 /* if the identity changed, there might be need to re-authz */
832 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
839 e = ldap_first_entry( lc->lc_ld, result );
841 /* the entry exists, but it doesn't match the filter? */
845 *ent = ch_calloc( 1, sizeof( Entry ) );
846 if ( *ent == NULL ) {
851 rc = ldap_build_entry( op, e, *ent, &bdn );
853 if ( rc != LDAP_SUCCESS ) {
859 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
862 ldap_msgfree( result );
870 ldap_back_release_conn( li, lc );