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;
148 time_t stoptime = (time_t)-1;
153 struct berval match = BER_BVNULL,
158 int do_retry = 1, dont_retry = 0;
159 LDAPControl **ctrls = NULL;
160 /* FIXME: shouldn't this be null? */
161 const char *save_matched = rs->sr_matched;
163 lc = ldap_back_getconn( op, rs, LDAP_BACK_SENDERR );
164 if ( !lc || !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 ) ) {
246 /* invalid filters return success with no data */
247 rs->sr_err = LDAP_SUCCESS;
252 rs->sr_err = slap_map_api2result( rs );
258 /* We pull apart the ber result, stuff it into a slapd entry, and
259 * let send_search_entry stuff it back into ber format. Slow & ugly,
260 * but this is necessary for version matching, and for ACL processing.
263 for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, LDAP_MSG_ONE, &tv, &res ) )
265 /* check for abandon */
266 if ( op->o_abandon ) {
270 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
276 LDAP_BACK_TV_SET( &tv );
277 ldap_pvt_thread_yield();
279 /* check time limit */
280 if ( op->ors_tlimit != SLAP_NO_LIMIT
281 && slap_get_time() > stoptime )
283 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
284 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
290 /* don't retry any more */
295 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
297 struct berval bdn = BER_BVNULL;
301 e = ldap_first_entry( lc->lc_ld, res );
302 rc = ldap_build_entry( op, e, &ent, &bdn );
303 if ( rc == LDAP_SUCCESS ) {
305 rs->sr_attrs = op->ors_attrs;
306 rs->sr_operational_attrs = NULL;
308 rs->sr_err = LDAP_SUCCESS;
309 rc = rs->sr_err = send_search_entry( op, rs );
310 if ( !BER_BVISNULL( &ent.e_name ) ) {
311 assert( ent.e_name.bv_val != bdn.bv_val );
312 op->o_tmpfree( ent.e_name.bv_val, op->o_tmpmemctx );
313 BER_BVZERO( &ent.e_name );
315 if ( !BER_BVISNULL( &ent.e_nname ) ) {
316 op->o_tmpfree( ent.e_nname.bv_val, op->o_tmpmemctx );
317 BER_BVZERO( &ent.e_nname );
322 if ( rc != LDAP_SUCCESS ) {
323 if ( rc == LDAP_UNAVAILABLE ) {
324 rc = rs->sr_err = LDAP_OTHER;
326 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
331 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
332 char **references = NULL;
335 rc = ldap_parse_reference( lc->lc_ld, res,
336 &references, &rs->sr_ctrls, 1 );
338 if ( rc != LDAP_SUCCESS ) {
342 /* FIXME: there MUST be at least one */
343 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
346 for ( cnt = 0; references[ cnt ]; cnt++ )
349 /* FIXME: there MUST be at least one */
350 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
353 for ( cnt = 0; references[ cnt ]; cnt++ ) {
354 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
356 BER_BVZERO( &rs->sr_ref[ cnt ] );
358 /* ignore return value by now */
359 ( void )send_search_reference( op, rs );
362 Debug( LDAP_DEBUG_ANY,
363 "%s ldap_back_search: "
364 "got SEARCH_REFERENCE "
365 "with no referrals\n",
366 op->o_log_prefix, 0, 0 );
371 ber_memvfree( (void **)references );
372 op->o_tmpfree( rs->sr_ref, op->o_tmpmemctx );
376 if ( rs->sr_ctrls ) {
377 ldap_controls_free( rs->sr_ctrls );
382 char **references = NULL, *err = NULL;
384 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
386 &references, &rs->sr_ctrls, 1 );
387 if ( rc != LDAP_SUCCESS ) {
390 rs->sr_err = slap_map_api2result( rs );
396 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
399 if ( rs->sr_err != LDAP_REFERRAL ) {
401 Debug( LDAP_DEBUG_ANY,
402 "%s ldap_back_search: "
403 "got referrals with %d\n",
406 rs->sr_err = LDAP_REFERRAL;
409 for ( cnt = 0; references[ cnt ]; cnt++ )
412 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
415 for ( cnt = 0; references[ cnt ]; cnt++ ) {
417 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
419 BER_BVZERO( &rs->sr_ref[ cnt ] );
422 if ( match.bv_val != NULL ) {
423 match.bv_len = strlen( match.bv_val );
428 ber_memvfree( (void **)references );
436 if ( rc == -1 && dont_retry == 0 ) {
439 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
443 rs->sr_err = LDAP_SERVER_DOWN;
444 rs->sr_err = slap_map_api2result( rs );
449 * Rewrite the matched portion of the search base, if required
451 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
452 struct berval pmatch;
454 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
455 rs->sr_matched = pmatch.bv_val;
456 LDAP_FREE( match.bv_val );
459 rs->sr_matched = match.bv_val;
463 if ( rs->sr_v2ref ) {
464 rs->sr_err = LDAP_REFERRAL;
468 if ( LDAP_BACK_QUARANTINE( li ) ) {
469 ldap_back_quarantine( op, rs );
473 /* let send_ldap_result play cleanup handlers (ITS#4645) */
474 if ( rc != SLAPD_ABANDON )
477 send_ldap_result( op, rs );
480 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
482 if ( rs->sr_ctrls ) {
483 ldap_controls_free( rs->sr_ctrls );
487 if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
488 if ( rs->sr_matched != match.bv_val ) {
489 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
492 LDAP_FREE( match.bv_val );
494 rs->sr_matched = save_matched;
497 if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
498 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
503 LDAP_FREE( (char *)rs->sr_text );
509 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
518 ldap_back_release_conn( op, rs, lc );
532 BerElement ber = *e->lm_ber;
533 Attribute *attr, **attrp;
537 /* safe assumptions ... */
538 assert( ent != NULL );
539 BER_BVZERO( &ent->e_bv );
541 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
542 return LDAP_DECODING_ERROR;
546 * Note: this may fail if the target host(s) schema differs
547 * from the one known to the meta, and a DN with unknown
548 * attributes is returned.
550 * FIXME: should we log anything, or delegate to dnNormalize?
552 /* Note: if the distinguished values or the naming attributes
553 * change, should we massage them as well?
555 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
556 op->o_tmpmemctx ) != LDAP_SUCCESS )
558 return LDAP_INVALID_DN_SYNTAX;
561 attrp = &ent->e_attrs;
563 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
565 slap_syntax_validate_func *validate;
566 slap_syntax_transform_func *pretty;
568 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
569 if ( attr == NULL ) {
575 if ( slap_bv2ad( &a, &attr->a_desc, &text )
578 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
579 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
581 Debug( LDAP_DEBUG_ANY,
582 "%s ldap_build_entry: "
583 "slap_bv2undef_ad(%s): %s\n",
584 op->o_log_prefix, a.bv_val, text );
590 /* no subschemaSubentry */
591 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
592 || attr->a_desc == slap_schema.si_ad_entryDN )
596 * We eat target's subschemaSubentry because
597 * a search for this value is likely not
598 * to resolve to the appropriate backend;
599 * later, the local subschemaSubentry is
602 * We also eat entryDN because the frontend
603 * will reattach it without checking if already
606 ( void )ber_scanf( &ber, "x" /* [W] */ );
612 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
613 || attr->a_vals == NULL )
616 * Note: attr->a_vals can be null when using
617 * values result filter
619 attr->a_vals = (struct berval *)&slap_dummy_bv;
623 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
624 /* just count vals */ ;
627 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
628 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
630 if ( !validate && !pretty ) {
631 attr->a_nvals = NULL;
636 for ( i = 0; i < last; i++ ) {
641 rc = pretty( attr->a_desc->ad_type->sat_syntax,
642 &attr->a_vals[i], &pval, NULL );
645 rc = validate( attr->a_desc->ad_type->sat_syntax,
649 if ( rc != LDAP_SUCCESS ) {
650 /* check if, by chance, it's an undefined objectClass */
651 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
652 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
654 ber_dupbv( &pval, &attr->a_vals[i] );
657 attr->a_nvals = NULL;
664 LBER_FREE( attr->a_vals[i].bv_val );
665 attr->a_vals[i] = pval;
669 if ( last && attr->a_desc->ad_type->sat_equality &&
670 attr->a_desc->ad_type->sat_equality->smr_normalize )
672 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
673 for ( i = 0; i < last; i++ ) {
677 * check that each value is valid per syntax
678 * and pretty if appropriate
680 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
681 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
682 attr->a_desc->ad_type->sat_syntax,
683 attr->a_desc->ad_type->sat_equality,
684 &attr->a_vals[i], &attr->a_nvals[i],
687 if ( rc != LDAP_SUCCESS ) {
688 BER_BVZERO( &attr->a_nvals[i] );
693 BER_BVZERO( &attr->a_nvals[i] );
696 attr->a_nvals = attr->a_vals;
699 attrp = &attr->a_next;
707 /* return 0 IFF we can retrieve the entry with ndn
714 AttributeDescription *at,
718 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
724 LDAPMessage *result = NULL,
726 char *attr[3], **attrp = NULL;
730 LDAPControl **ctrls = NULL;
734 /* Tell getconn this is a privileged op */
735 do_not_cache = op->o_do_not_cache;
736 op->o_do_not_cache = 1;
737 lc = ldap_back_getconn( op, &rs, LDAP_BACK_DONTSEND );
738 if ( !lc || !ldap_back_dobind( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
739 op->o_do_not_cache = do_not_cache;
742 op->o_do_not_cache = do_not_cache;
746 if ( oc && at != slap_schema.si_ad_objectClass ) {
747 attr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
748 attr[1] = at->ad_cname.bv_val;
752 attr[0] = at->ad_cname.bv_val;
760 filter = ch_malloc( STRLENOF( "(objectclass=)" )
761 + oc->soc_cname.bv_len + 1 );
762 ptr = lutil_strcopy( filter, "(objectclass=" );
763 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
769 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
770 li->li_version, &li->li_idassert, op, &rs, &ctrls );
771 if ( rc != LDAP_SUCCESS ) {
776 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
777 attrp, 0, ctrls, NULL,
778 NULL, LDAP_NO_LIMIT, &result );
779 if ( rc != LDAP_SUCCESS ) {
780 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
782 if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
789 e = ldap_first_entry( lc->lc_ld, result );
791 /* the entry exists, but it doesn't match the filter? */
795 *ent = ch_calloc( 1, sizeof( Entry ) );
796 if ( *ent == NULL ) {
801 rc = ldap_build_entry( op, e, *ent, &bdn );
803 if ( rc != LDAP_SUCCESS ) {
809 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
812 ldap_msgfree( result );
820 ldap_back_release_conn( op, &rs, lc );