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 char **references = NULL;
163 /* FIXME: shouldn't this be null? */
164 const char *save_matched = rs->sr_matched;
166 if ( !ldap_back_dobind( &lc, op, rs, LDAP_BACK_SENDERR ) ) {
171 * FIXME: in case of values return filter, we might want
172 * to map attrs and maybe rewrite value
175 /* should we check return values? */
176 if ( op->ors_deref != -1 ) {
177 ldap_set_option( lc->lc_ld, LDAP_OPT_DEREF,
178 (void *)&op->ors_deref );
181 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
182 tv.tv_sec = op->ors_tlimit;
184 stoptime = op->o_time + op->ors_tlimit;
187 LDAP_BACK_TV_SET( &tv );
190 if ( op->ors_attrs ) {
191 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
192 /* just count attrs */ ;
194 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
195 if ( attrs == NULL ) {
196 rs->sr_err = LDAP_NO_MEMORY;
201 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
202 attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
208 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
209 li->li_version, &li->li_idassert, op, rs, &ctrls );
210 if ( rc != LDAP_SUCCESS ) {
214 /* deal with <draft-zeilenga-ldap-t-f> filters */
215 filter = op->ors_filterstr;
217 rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_dn.bv_val,
218 op->ors_scope, filter.bv_val,
219 attrs, op->ors_attrsonly, ctrls, NULL,
220 tv.tv_sec ? &tv : NULL,
221 op->ors_slimit, &msgid );
223 if ( rs->sr_err != LDAP_SUCCESS ) {
224 switch ( rs->sr_err ) {
225 case LDAP_SERVER_DOWN:
228 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
234 /* reset by ldap_back_retry ... */
235 rs->sr_err = slap_map_api2result( rs );
238 rc = ldap_back_op_result( lc, op, rs, msgid, 0, LDAP_BACK_DONTSEND );
243 case LDAP_FILTER_ERROR:
244 if ( ldap_back_munge_filter( op, &filter ) ) {
249 /* invalid filters return success with no data */
250 rs->sr_err = LDAP_SUCCESS;
255 rs->sr_err = slap_map_api2result( rs );
261 /* if needed, initialize timeout */
262 if ( li->li_timeout[ SLAP_OP_SEARCH ] ) {
263 if ( tv.tv_sec == 0 || tv.tv_sec > li->li_timeout[ SLAP_OP_SEARCH ] ) {
264 tv.tv_sec = li->li_timeout[ SLAP_OP_SEARCH ];
269 /* We pull apart the ber result, stuff it into a slapd entry, and
270 * let send_search_entry stuff it back into ber format. Slow & ugly,
271 * but this is necessary for version matching, and for ACL processing.
274 for ( rc = -2; rc != -1; rc = ldap_result( lc->lc_ld, msgid, LDAP_MSG_ONE, &tv, &res ) )
276 /* check for abandon */
277 if ( op->o_abandon || LDAP_BACK_CONN_ABANDON( lc ) ) {
281 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
286 if ( rc == 0 || rc == -2 ) {
287 ldap_pvt_thread_yield();
290 if ( li->li_timeout[ SLAP_OP_SEARCH ] ) {
292 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
293 rs->sr_text = "Operation timed out";
294 rc = rs->sr_err = op->o_protocol >= LDAP_VERSION3 ?
295 LDAP_ADMINLIMIT_EXCEEDED : LDAP_OTHER;
300 LDAP_BACK_TV_SET( &tv );
303 /* check time limit */
304 if ( op->ors_tlimit != SLAP_NO_LIMIT
305 && slap_get_time() > stoptime )
307 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
308 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
314 /* only touch when activity actually took place... */
315 if ( li->li_idle_timeout && lc ) {
316 lc->lc_time = op->o_time;
319 /* don't retry any more */
324 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
326 struct berval bdn = BER_BVNULL;
330 e = ldap_first_entry( lc->lc_ld, res );
331 rc = ldap_build_entry( op, e, &ent, &bdn );
332 if ( rc == LDAP_SUCCESS ) {
334 rs->sr_attrs = op->ors_attrs;
335 rs->sr_operational_attrs = NULL;
337 rs->sr_err = LDAP_SUCCESS;
338 rc = rs->sr_err = send_search_entry( op, rs );
340 if ( !BER_BVISNULL( &ent.e_name ) ) {
341 assert( ent.e_name.bv_val != bdn.bv_val );
342 op->o_tmpfree( ent.e_name.bv_val, op->o_tmpmemctx );
343 BER_BVZERO( &ent.e_name );
345 if ( !BER_BVISNULL( &ent.e_nname ) ) {
346 op->o_tmpfree( ent.e_nname.bv_val, op->o_tmpmemctx );
347 BER_BVZERO( &ent.e_nname );
352 if ( rc != LDAP_SUCCESS ) {
353 if ( rc == LDAP_UNAVAILABLE ) {
354 rc = rs->sr_err = LDAP_OTHER;
356 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
361 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
363 rc = ldap_parse_reference( lc->lc_ld, res,
364 &references, &rs->sr_ctrls, 1 );
366 if ( rc != LDAP_SUCCESS ) {
370 /* FIXME: there MUST be at least one */
371 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
374 for ( cnt = 0; references[ cnt ]; cnt++ )
377 /* FIXME: there MUST be at least one */
378 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
381 for ( cnt = 0; references[ cnt ]; cnt++ ) {
382 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
384 BER_BVZERO( &rs->sr_ref[ cnt ] );
386 /* ignore return value by now */
387 ( void )send_search_reference( op, rs );
390 Debug( LDAP_DEBUG_ANY,
391 "%s ldap_back_search: "
392 "got SEARCH_REFERENCE "
393 "with no referrals\n",
394 op->o_log_prefix, 0, 0 );
399 ber_memvfree( (void **)references );
400 op->o_tmpfree( rs->sr_ref, op->o_tmpmemctx );
405 if ( rs->sr_ctrls ) {
406 ldap_controls_free( rs->sr_ctrls );
413 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
415 &references, &rs->sr_ctrls, 1 );
416 if ( rc != LDAP_SUCCESS ) {
419 rs->sr_err = slap_map_api2result( rs );
425 /* RFC 4511: referrals can only appear
426 * if result code is LDAP_REFERRAL */
429 && references[ 0 ][ 0 ] )
431 if ( rs->sr_err != LDAP_REFERRAL ) {
432 Debug( LDAP_DEBUG_ANY,
433 "%s ldap_back_search: "
434 "got referrals with err=%d\n",
441 for ( cnt = 0; references[ cnt ]; cnt++ )
444 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
447 for ( cnt = 0; references[ cnt ]; cnt++ ) {
449 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
451 BER_BVZERO( &rs->sr_ref[ cnt ] );
454 } else if ( rs->sr_err == LDAP_REFERRAL ) {
455 Debug( LDAP_DEBUG_ANY,
456 "%s ldap_back_search: "
457 "got err=%d with null "
458 "or empty referrals\n",
462 rs->sr_err = LDAP_NO_SUCH_OBJECT;
465 if ( match.bv_val != NULL ) {
466 match.bv_len = strlen( match.bv_val );
473 /* if needed, restore timeout */
474 if ( li->li_timeout[ SLAP_OP_SEARCH ] ) {
475 if ( tv.tv_sec == 0 || tv.tv_sec > li->li_timeout[ SLAP_OP_SEARCH ] ) {
476 tv.tv_sec = li->li_timeout[ SLAP_OP_SEARCH ];
482 if ( rc == -1 && dont_retry == 0 ) {
485 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
489 rs->sr_err = LDAP_SERVER_DOWN;
490 rs->sr_err = slap_map_api2result( rs );
495 * Rewrite the matched portion of the search base, if required
497 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
498 struct berval pmatch;
500 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
501 rs->sr_matched = pmatch.bv_val;
502 LDAP_FREE( match.bv_val );
505 rs->sr_matched = match.bv_val;
509 if ( rs->sr_v2ref ) {
510 rs->sr_err = LDAP_REFERRAL;
514 if ( LDAP_BACK_QUARANTINE( li ) ) {
515 ldap_back_quarantine( op, rs );
519 /* let send_ldap_result play cleanup handlers (ITS#4645) */
520 if ( rc != SLAPD_ABANDON )
523 send_ldap_result( op, rs );
526 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
528 if ( rs->sr_ctrls ) {
529 ldap_controls_free( rs->sr_ctrls );
533 if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
534 if ( rs->sr_matched != match.bv_val ) {
535 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
538 LDAP_FREE( match.bv_val );
540 rs->sr_matched = save_matched;
544 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
549 LDAP_FREE( (char *)rs->sr_text );
555 op->o_tmpfree( rs->sr_ref, op->o_tmpmemctx );
560 ber_memvfree( (void **)references );
568 ldap_back_release_conn( li, lc );
582 BerElement ber = *e->lm_ber;
583 Attribute *attr, **attrp;
587 /* safe assumptions ... */
588 assert( ent != NULL );
589 BER_BVZERO( &ent->e_bv );
591 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
592 return LDAP_DECODING_ERROR;
596 * Note: this may fail if the target host(s) schema differs
597 * from the one known to the meta, and a DN with unknown
598 * attributes is returned.
600 * FIXME: should we log anything, or delegate to dnNormalize?
602 /* Note: if the distinguished values or the naming attributes
603 * change, should we massage them as well?
605 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
606 op->o_tmpmemctx ) != LDAP_SUCCESS )
608 return LDAP_INVALID_DN_SYNTAX;
611 attrp = &ent->e_attrs;
613 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
615 slap_syntax_validate_func *validate;
616 slap_syntax_transform_func *pretty;
618 attr = attr_alloc( NULL );
619 if ( attr == NULL ) {
622 if ( slap_bv2ad( &a, &attr->a_desc, &text )
625 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
626 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
628 Debug( LDAP_DEBUG_ANY,
629 "%s ldap_build_entry: "
630 "slap_bv2undef_ad(%s): %s\n",
631 op->o_log_prefix, a.bv_val, text );
637 /* no subschemaSubentry */
638 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
639 || attr->a_desc == slap_schema.si_ad_entryDN )
643 * We eat target's subschemaSubentry because
644 * a search for this value is likely not
645 * to resolve to the appropriate backend;
646 * later, the local subschemaSubentry is
649 * We also eat entryDN because the frontend
650 * will reattach it without checking if already
653 ( void )ber_scanf( &ber, "x" /* [W] */ );
659 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
660 || attr->a_vals == NULL )
663 * Note: attr->a_vals can be null when using
664 * values result filter
666 attr->a_vals = (struct berval *)&slap_dummy_bv;
670 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
671 /* just count vals */ ;
674 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
675 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
677 if ( !validate && !pretty ) {
678 attr->a_nvals = NULL;
683 for ( i = 0; i < last; i++ ) {
688 rc = pretty( attr->a_desc->ad_type->sat_syntax,
689 &attr->a_vals[i], &pval, NULL );
692 rc = validate( attr->a_desc->ad_type->sat_syntax,
696 if ( rc != LDAP_SUCCESS ) {
697 /* check if, by chance, it's an undefined objectClass */
698 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
699 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
701 ber_dupbv( &pval, &attr->a_vals[i] );
704 attr->a_nvals = NULL;
711 LBER_FREE( attr->a_vals[i].bv_val );
712 attr->a_vals[i] = pval;
716 if ( last && attr->a_desc->ad_type->sat_equality &&
717 attr->a_desc->ad_type->sat_equality->smr_normalize )
719 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
720 for ( i = 0; i < last; i++ ) {
724 * check that each value is valid per syntax
725 * and pretty if appropriate
727 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
728 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
729 attr->a_desc->ad_type->sat_syntax,
730 attr->a_desc->ad_type->sat_equality,
731 &attr->a_vals[i], &attr->a_nvals[i],
734 if ( rc != LDAP_SUCCESS ) {
735 BER_BVZERO( &attr->a_nvals[i] );
740 BER_BVZERO( &attr->a_nvals[i] );
743 attr->a_nvals = attr->a_vals;
746 attrp = &attr->a_next;
754 /* return 0 IFF we can retrieve the entry with ndn
761 AttributeDescription *at,
765 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
767 ldapconn_t *lc = NULL;
771 LDAPMessage *result = NULL,
773 char *attr[3], **attrp = NULL;
777 LDAPControl **ctrls = NULL;
781 /* Tell getconn this is a privileged op */
782 do_not_cache = op->o_do_not_cache;
783 op->o_do_not_cache = 1;
784 if ( !ldap_back_dobind( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
785 op->o_do_not_cache = do_not_cache;
788 op->o_do_not_cache = do_not_cache;
792 if ( oc && at != slap_schema.si_ad_objectClass ) {
793 attr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
794 attr[1] = at->ad_cname.bv_val;
798 attr[0] = at->ad_cname.bv_val;
806 filter = ch_malloc( STRLENOF( "(objectclass=)" )
807 + oc->soc_cname.bv_len + 1 );
808 ptr = lutil_strcopy( filter, "(objectclass=" );
809 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
816 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
817 li->li_version, &li->li_idassert, op, &rs, &ctrls );
818 if ( rc != LDAP_SUCCESS ) {
822 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
823 attrp, 0, ctrls, NULL,
824 NULL, LDAP_NO_LIMIT, &result );
825 if ( rc != LDAP_SUCCESS ) {
826 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
828 if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
829 /* if the identity changed, there might be need to re-authz */
830 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
837 e = ldap_first_entry( lc->lc_ld, result );
839 /* the entry exists, but it doesn't match the filter? */
843 *ent = entry_alloc();
844 if ( *ent == NULL ) {
849 rc = ldap_build_entry( op, e, *ent, &bdn );
851 if ( rc != LDAP_SUCCESS ) {
857 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
860 ldap_msgfree( result );
868 ldap_back_release_conn( li, lc );