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,
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 if ( !ldap_back_dobind( &lc, op, rs, LDAP_BACK_SENDERR ) ) {
168 * FIXME: in case of values return filter, we might want
169 * to map attrs and maybe rewrite value
172 /* should we check return values? */
173 if ( op->ors_deref != -1 ) {
174 ldap_set_option( lc->lc_ld, LDAP_OPT_DEREF,
175 (void *)&op->ors_deref );
178 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
179 tv.tv_sec = op->ors_tlimit;
181 stoptime = op->o_time + op->ors_tlimit;
184 LDAP_BACK_TV_SET( &tv );
187 if ( op->ors_attrs ) {
188 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
189 /* just count attrs */ ;
191 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
192 if ( attrs == NULL ) {
193 rs->sr_err = LDAP_NO_MEMORY;
198 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
199 attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
205 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
206 li->li_version, &li->li_idassert, op, rs, &ctrls );
207 if ( rc != LDAP_SUCCESS ) {
211 /* deal with <draft-zeilenga-ldap-t-f> filters */
212 filter = op->ors_filterstr;
214 rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_dn.bv_val,
215 op->ors_scope, filter.bv_val,
216 attrs, op->ors_attrsonly, ctrls, NULL,
217 tv.tv_sec ? &tv : NULL,
218 op->ors_slimit, &msgid );
220 if ( rs->sr_err != LDAP_SUCCESS ) {
221 switch ( rs->sr_err ) {
222 case LDAP_SERVER_DOWN:
225 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
231 /* reset by ldap_back_retry ... */
232 rs->sr_err = slap_map_api2result( rs );
235 rc = ldap_back_op_result( lc, op, rs, msgid, 0, LDAP_BACK_DONTSEND );
240 case LDAP_FILTER_ERROR:
241 if ( ldap_back_munge_filter( op, &filter ) ) {
245 /* invalid filters return success with no data */
246 rs->sr_err = LDAP_SUCCESS;
251 rs->sr_err = slap_map_api2result( rs );
257 /* We pull apart the ber result, stuff it into a slapd entry, and
258 * let send_search_entry stuff it back into ber format. Slow & ugly,
259 * but this is necessary for version matching, and for ACL processing.
262 for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, LDAP_MSG_ONE, &tv, &res ) )
264 /* check for abandon */
265 if ( op->o_abandon ) {
269 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
275 LDAP_BACK_TV_SET( &tv );
276 ldap_pvt_thread_yield();
278 /* check time limit */
279 if ( op->ors_tlimit != SLAP_NO_LIMIT
280 && slap_get_time() > stoptime )
282 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
283 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
289 /* only touch when activity actually took place... */
290 if ( li->li_idle_timeout && lc ) {
291 lc->lc_time = op->o_time;
294 /* don't retry any more */
299 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
301 struct berval bdn = BER_BVNULL;
305 e = ldap_first_entry( lc->lc_ld, res );
306 rc = ldap_build_entry( op, e, &ent, &bdn );
307 if ( rc == LDAP_SUCCESS ) {
309 rs->sr_attrs = op->ors_attrs;
310 rs->sr_operational_attrs = NULL;
312 rs->sr_err = LDAP_SUCCESS;
313 rc = rs->sr_err = send_search_entry( op, rs );
314 if ( !BER_BVISNULL( &ent.e_name ) ) {
315 assert( ent.e_name.bv_val != bdn.bv_val );
316 op->o_tmpfree( ent.e_name.bv_val, op->o_tmpmemctx );
317 BER_BVZERO( &ent.e_name );
319 if ( !BER_BVISNULL( &ent.e_nname ) ) {
320 op->o_tmpfree( ent.e_nname.bv_val, op->o_tmpmemctx );
321 BER_BVZERO( &ent.e_nname );
326 if ( rc != LDAP_SUCCESS ) {
327 if ( rc == LDAP_UNAVAILABLE ) {
328 rc = rs->sr_err = LDAP_OTHER;
330 (void)ldap_back_cancel( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
335 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
336 char **references = NULL;
339 rc = ldap_parse_reference( lc->lc_ld, res,
340 &references, &rs->sr_ctrls, 1 );
342 if ( rc != LDAP_SUCCESS ) {
346 /* FIXME: there MUST be at least one */
347 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
350 for ( cnt = 0; references[ cnt ]; cnt++ )
353 /* FIXME: there MUST be at least one */
354 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
357 for ( cnt = 0; references[ cnt ]; cnt++ ) {
358 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
360 BER_BVZERO( &rs->sr_ref[ cnt ] );
362 /* ignore return value by now */
363 ( void )send_search_reference( op, rs );
366 Debug( LDAP_DEBUG_ANY,
367 "%s ldap_back_search: "
368 "got SEARCH_REFERENCE "
369 "with no referrals\n",
370 op->o_log_prefix, 0, 0 );
375 ber_memvfree( (void **)references );
376 op->o_tmpfree( rs->sr_ref, op->o_tmpmemctx );
380 if ( rs->sr_ctrls ) {
381 ldap_controls_free( rs->sr_ctrls );
386 char **references = NULL, *err = NULL;
388 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
390 &references, &rs->sr_ctrls, 1 );
391 if ( rc != LDAP_SUCCESS ) {
394 rs->sr_err = slap_map_api2result( rs );
400 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
403 if ( rs->sr_err != LDAP_REFERRAL ) {
405 Debug( LDAP_DEBUG_ANY,
406 "%s ldap_back_search: "
407 "got referrals with %d\n",
410 rs->sr_err = LDAP_REFERRAL;
413 for ( cnt = 0; references[ cnt ]; cnt++ )
416 rs->sr_ref = op->o_tmpalloc( ( cnt + 1 ) * sizeof( struct berval ),
419 for ( cnt = 0; references[ cnt ]; cnt++ ) {
421 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
423 BER_BVZERO( &rs->sr_ref[ cnt ] );
426 if ( match.bv_val != NULL ) {
427 match.bv_len = strlen( match.bv_val );
432 ber_memvfree( (void **)references );
440 if ( rc == -1 && dont_retry == 0 ) {
443 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
447 rs->sr_err = LDAP_SERVER_DOWN;
448 rs->sr_err = slap_map_api2result( rs );
453 * Rewrite the matched portion of the search base, if required
455 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
456 struct berval pmatch;
458 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
459 rs->sr_matched = pmatch.bv_val;
460 LDAP_FREE( match.bv_val );
463 rs->sr_matched = match.bv_val;
467 if ( rs->sr_v2ref ) {
468 rs->sr_err = LDAP_REFERRAL;
472 if ( LDAP_BACK_QUARANTINE( li ) ) {
473 ldap_back_quarantine( op, rs );
477 /* let send_ldap_result play cleanup handlers (ITS#4645) */
478 if ( rc != SLAPD_ABANDON )
481 send_ldap_result( op, rs );
484 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
486 if ( rs->sr_ctrls ) {
487 ldap_controls_free( rs->sr_ctrls );
491 if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
492 if ( rs->sr_matched != match.bv_val ) {
493 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
496 LDAP_FREE( match.bv_val );
498 rs->sr_matched = save_matched;
501 if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
502 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
507 LDAP_FREE( (char *)rs->sr_text );
513 ber_bvarray_free_x( rs->sr_ref, op->o_tmpmemctx );
522 ldap_back_release_conn( op, rs, lc );
536 BerElement ber = *e->lm_ber;
537 Attribute *attr, **attrp;
541 /* safe assumptions ... */
542 assert( ent != NULL );
543 BER_BVZERO( &ent->e_bv );
545 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
546 return LDAP_DECODING_ERROR;
550 * Note: this may fail if the target host(s) schema differs
551 * from the one known to the meta, and a DN with unknown
552 * attributes is returned.
554 * FIXME: should we log anything, or delegate to dnNormalize?
556 /* Note: if the distinguished values or the naming attributes
557 * change, should we massage them as well?
559 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
560 op->o_tmpmemctx ) != LDAP_SUCCESS )
562 return LDAP_INVALID_DN_SYNTAX;
565 attrp = &ent->e_attrs;
567 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
569 slap_syntax_validate_func *validate;
570 slap_syntax_transform_func *pretty;
572 attr = attr_alloc( NULL );
573 if ( attr == NULL ) {
576 if ( slap_bv2ad( &a, &attr->a_desc, &text )
579 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
580 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
582 Debug( LDAP_DEBUG_ANY,
583 "%s ldap_build_entry: "
584 "slap_bv2undef_ad(%s): %s\n",
585 op->o_log_prefix, a.bv_val, text );
591 /* no subschemaSubentry */
592 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
593 || attr->a_desc == slap_schema.si_ad_entryDN )
597 * We eat target's subschemaSubentry because
598 * a search for this value is likely not
599 * to resolve to the appropriate backend;
600 * later, the local subschemaSubentry is
603 * We also eat entryDN because the frontend
604 * will reattach it without checking if already
607 ( void )ber_scanf( &ber, "x" /* [W] */ );
613 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
614 || attr->a_vals == NULL )
617 * Note: attr->a_vals can be null when using
618 * values result filter
620 attr->a_vals = (struct berval *)&slap_dummy_bv;
624 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
625 /* just count vals */ ;
628 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
629 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
631 if ( !validate && !pretty ) {
632 attr->a_nvals = NULL;
637 for ( i = 0; i < last; i++ ) {
642 rc = pretty( attr->a_desc->ad_type->sat_syntax,
643 &attr->a_vals[i], &pval, NULL );
646 rc = validate( attr->a_desc->ad_type->sat_syntax,
650 if ( rc != LDAP_SUCCESS ) {
651 /* check if, by chance, it's an undefined objectClass */
652 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
653 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
655 ber_dupbv( &pval, &attr->a_vals[i] );
658 attr->a_nvals = NULL;
665 LBER_FREE( attr->a_vals[i].bv_val );
666 attr->a_vals[i] = pval;
670 if ( last && attr->a_desc->ad_type->sat_equality &&
671 attr->a_desc->ad_type->sat_equality->smr_normalize )
673 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
674 for ( i = 0; i < last; i++ ) {
678 * check that each value is valid per syntax
679 * and pretty if appropriate
681 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
682 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
683 attr->a_desc->ad_type->sat_syntax,
684 attr->a_desc->ad_type->sat_equality,
685 &attr->a_vals[i], &attr->a_nvals[i],
688 if ( rc != LDAP_SUCCESS ) {
689 BER_BVZERO( &attr->a_nvals[i] );
694 BER_BVZERO( &attr->a_nvals[i] );
697 attr->a_nvals = attr->a_vals;
700 attrp = &attr->a_next;
708 /* return 0 IFF we can retrieve the entry with ndn
715 AttributeDescription *at,
719 ldapinfo_t *li = (ldapinfo_t *) op->o_bd->be_private;
721 ldapconn_t *lc = NULL;
725 LDAPMessage *result = NULL,
727 char *attr[3], **attrp = NULL;
731 LDAPControl **ctrls = NULL;
735 /* Tell getconn this is a privileged op */
736 do_not_cache = op->o_do_not_cache;
737 op->o_do_not_cache = 1;
738 if ( !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 );
770 rc = ldap_back_proxy_authz_ctrl( &lc->lc_bound_ndn,
771 li->li_version, &li->li_idassert, op, &rs, &ctrls );
772 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 ) ) {
783 /* if the identity changed, there might be need to re-authz */
784 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
791 e = ldap_first_entry( lc->lc_ld, result );
793 /* the entry exists, but it doesn't match the filter? */
797 *ent = entry_alloc();
798 if ( *ent == NULL ) {
803 rc = ldap_build_entry( op, e, *ent, &bdn );
805 if ( rc != LDAP_SUCCESS ) {
811 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
814 ldap_msgfree( result );
822 ldap_back_release_conn( op, &rs, lc );