1 /* search.c - ldap backend search function */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2005 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 ( li->li_flags & LDAP_BACK_F_SUPPORT_T_F ) {
85 } else if ( strncmp( ptr, bv_false.bv_val, bv_false.bv_len ) == 0 )
88 if ( li->li_flags & LDAP_BACK_F_SUPPORT_T_F ) {
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 );
146 time_t stoptime = (time_t)-1;
151 struct berval match = BER_BVNULL,
157 LDAPControl **ctrls = NULL;
158 /* FIXME: shouldn't this be null? */
159 const char *save_matched = rs->sr_matched;
161 lc = ldap_back_getconn( op, rs, LDAP_BACK_SENDERR );
162 if ( !lc || !ldap_back_dobind( lc, op, rs, LDAP_BACK_SENDERR ) ) {
167 * FIXME: in case of values return filter, we might want
168 * to map attrs and maybe rewrite value
171 /* should we check return values? */
172 if ( op->ors_deref != -1 ) {
173 ldap_set_option( lc->lc_ld, LDAP_OPT_DEREF,
174 (void *)&op->ors_deref );
177 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
178 tv.tv_sec = op->ors_tlimit;
180 stoptime = op->o_time + op->ors_tlimit;
183 LDAP_BACK_TV_SET( &tv );
186 if ( op->ors_attrs ) {
187 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
188 /* just count attrs */ ;
190 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
191 if ( attrs == NULL ) {
192 rs->sr_err = LDAP_NO_MEMORY;
197 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
198 attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
204 rc = ldap_back_proxy_authz_ctrl( lc, op, rs, &ctrls );
205 if ( rc != LDAP_SUCCESS ) {
209 /* deal with <draft-zeilenga-ldap-t-f> filters */
210 filter = op->ors_filterstr;
212 rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_ndn.bv_val,
213 op->ors_scope, filter.bv_val,
214 attrs, op->ors_attrsonly, ctrls, NULL,
215 tv.tv_sec ? &tv : NULL,
216 op->ors_slimit, &msgid );
218 if ( rs->sr_err != LDAP_SUCCESS ) {
220 switch ( rs->sr_err ) {
221 case LDAP_SERVER_DOWN:
224 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
229 /* reset by ldap_back_retry ... */
230 rs->sr_err = slap_map_api2result( rs );
233 rc = ldap_back_op_result( lc, op, rs, msgid, 0, LDAP_BACK_DONTSEND );
234 ldap_back_freeconn( op, lc, 0 );
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, 0, &tv, &res ) )
264 /* check for abandon */
265 if ( op->o_abandon ) {
269 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
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 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
283 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
287 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
289 struct berval bdn = BER_BVNULL;
294 e = ldap_first_entry( lc->lc_ld, res );
295 rc = ldap_build_entry( op, e, &ent, &bdn );
296 if ( rc == LDAP_SUCCESS ) {
298 rs->sr_attrs = op->ors_attrs;
299 rs->sr_operational_attrs = NULL;
301 abort = send_search_entry( op, rs );
302 if ( !BER_BVISNULL( &ent.e_name ) ) {
303 assert( ent.e_name.bv_val != bdn.bv_val );
304 free( ent.e_name.bv_val );
305 BER_BVZERO( &ent.e_name );
307 if ( !BER_BVISNULL( &ent.e_nname ) ) {
308 free( ent.e_nname.bv_val );
309 BER_BVZERO( &ent.e_nname );
315 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
319 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
320 char **references = NULL;
323 rc = ldap_parse_reference( lc->lc_ld, res,
324 &references, &rs->sr_ctrls, 1 );
326 if ( rc != LDAP_SUCCESS ) {
330 /* FIXME: there MUST be at least one */
331 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
334 for ( cnt = 0; references[ cnt ]; cnt++ )
337 /* FIXME: there MUST be at least one */
338 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
340 for ( cnt = 0; references[ cnt ]; cnt++ ) {
341 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
343 BER_BVZERO( &rs->sr_ref[ cnt ] );
345 /* ignore return value by now */
346 ( void )send_search_reference( op, rs );
349 Debug( LDAP_DEBUG_ANY,
350 "%s ldap_back_search: "
351 "got SEARCH_REFERENCE "
352 "with no referrals\n",
353 op->o_log_prefix, 0, 0 );
358 ber_memvfree( (void **)references );
359 ch_free( rs->sr_ref );
363 if ( rs->sr_ctrls ) {
364 ldap_controls_free( rs->sr_ctrls );
369 char **references = NULL;
371 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
372 &match.bv_val, (char **)&rs->sr_text,
373 &references, &rs->sr_ctrls, 1 );
375 if ( rc != LDAP_SUCCESS ) {
378 rs->sr_err = slap_map_api2result( rs );
380 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
383 if ( rs->sr_err != LDAP_REFERRAL ) {
385 Debug( LDAP_DEBUG_ANY,
386 "%s ldap_back_search: "
387 "got referrals with %d\n",
390 rs->sr_err = LDAP_REFERRAL;
393 for ( cnt = 0; references[ cnt ]; cnt++ )
396 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
398 for ( cnt = 0; references[ cnt ]; cnt++ ) {
400 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
402 BER_BVZERO( &rs->sr_ref[ cnt ] );
405 if ( match.bv_val != NULL ) {
406 if ( match.bv_val[ 0 ] == '\0' ) {
407 LDAP_FREE( match.bv_val );
408 BER_BVZERO( &match );
410 match.bv_len = strlen( match.bv_val );
416 ber_memvfree( (void **)references );
427 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_SENDERR ) ) {
431 rs->sr_err = LDAP_SERVER_DOWN;
432 rs->sr_err = slap_map_api2result( rs );
437 * Rewrite the matched portion of the search base, if required
439 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
440 struct berval pmatch;
442 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
443 rs->sr_matched = pmatch.bv_val;
444 LDAP_FREE( match.bv_val );
447 rs->sr_matched = match.bv_val;
451 if ( rs->sr_v2ref ) {
452 rs->sr_err = LDAP_REFERRAL;
456 if ( rc != SLAPD_ABANDON ) {
457 send_ldap_result( op, rs );
460 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
462 if ( rs->sr_ctrls ) {
463 ldap_controls_free( rs->sr_ctrls );
467 if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
468 if ( rs->sr_matched != match.bv_val ) {
469 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
472 LDAP_FREE( match.bv_val );
474 rs->sr_matched = save_matched;
477 if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
478 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
483 LDAP_FREE( (char *)rs->sr_text );
489 ber_bvarray_free( rs->sr_ref );
498 ldap_back_release_conn( op, rs, lc );
512 BerElement ber = *e->lm_ber;
513 Attribute *attr, **attrp;
517 /* safe assumptions ... */
518 assert( ent != NULL );
519 BER_BVZERO( &ent->e_bv );
521 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
522 return LDAP_DECODING_ERROR;
526 * Note: this may fail if the target host(s) schema differs
527 * from the one known to the meta, and a DN with unknown
528 * attributes is returned.
530 * FIXME: should we log anything, or delegate to dnNormalize?
532 /* Note: if the distinguished values or the naming attributes
533 * change, should we massage them as well?
535 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
536 op->o_tmpmemctx ) != LDAP_SUCCESS )
538 return LDAP_INVALID_DN_SYNTAX;
541 attrp = &ent->e_attrs;
543 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
545 slap_syntax_validate_func *validate;
546 slap_syntax_transform_func *pretty;
548 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
549 if ( attr == NULL ) {
555 if ( slap_bv2ad( &a, &attr->a_desc, &text )
558 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
559 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
561 Debug( LDAP_DEBUG_ANY,
562 "%s ldap_build_entry: "
563 "slap_bv2undef_ad(%s): %s\n",
564 op->o_log_prefix, a.bv_val, text );
570 /* no subschemaSubentry */
571 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
572 || attr->a_desc == slap_schema.si_ad_entryDN )
576 * We eat target's subschemaSubentry because
577 * a search for this value is likely not
578 * to resolve to the appropriate backend;
579 * later, the local subschemaSubentry is
582 * We also eat entryDN because the frontend
583 * will reattach it without checking if already
586 ( void )ber_scanf( &ber, "x" /* [W] */ );
592 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
593 || attr->a_vals == NULL )
596 * Note: attr->a_vals can be null when using
597 * values result filter
599 attr->a_vals = (struct berval *)&slap_dummy_bv;
603 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
604 /* just count vals */ ;
607 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
608 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
610 if ( !validate && !pretty ) {
611 attr->a_nvals = NULL;
616 for ( i = 0; i < last; i++ ) {
621 rc = pretty( attr->a_desc->ad_type->sat_syntax,
622 &attr->a_vals[i], &pval, NULL );
625 rc = validate( attr->a_desc->ad_type->sat_syntax,
629 if ( rc != LDAP_SUCCESS ) {
630 /* check if, by chance, it's an undefined objectClass */
631 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
632 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
634 ber_dupbv( &pval, &attr->a_vals[i] );
637 attr->a_nvals = NULL;
644 LBER_FREE( attr->a_vals[i].bv_val );
645 attr->a_vals[i] = pval;
649 if ( last && attr->a_desc->ad_type->sat_equality &&
650 attr->a_desc->ad_type->sat_equality->smr_normalize )
652 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
653 for ( i = 0; i < last; i++ ) {
657 * check that each value is valid per syntax
658 * and pretty if appropriate
660 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
661 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
662 attr->a_desc->ad_type->sat_syntax,
663 attr->a_desc->ad_type->sat_equality,
664 &attr->a_vals[i], &attr->a_nvals[i],
667 if ( rc != LDAP_SUCCESS ) {
668 BER_BVZERO( &attr->a_nvals[i] );
673 BER_BVZERO( &attr->a_nvals[i] );
676 attr->a_nvals = attr->a_vals;
679 attrp = &attr->a_next;
687 /* return 0 IFF we can retrieve the entry with ndn
694 AttributeDescription *at,
703 LDAPMessage *result = NULL,
709 LDAPControl **ctrls = NULL;
711 /* Tell getconn this is a privileged op */
712 do_not_cache = op->o_do_not_cache;
713 op->o_do_not_cache = 1;
714 lc = ldap_back_getconn( op, &rs, LDAP_BACK_DONTSEND );
715 if ( !lc || !ldap_back_dobind( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
716 op->o_do_not_cache = do_not_cache;
719 op->o_do_not_cache = do_not_cache;
722 if ( oc && at != slap_schema.si_ad_objectClass ) {
723 gattr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
724 gattr[1] = at->ad_cname.bv_val;
728 gattr[0] = at->ad_cname.bv_val;
736 filter = ch_malloc( STRLENOF( "(objectclass=)" )
737 + oc->soc_cname.bv_len + 1 );
738 ptr = lutil_strcopy( filter, "(objectclass=" );
739 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
745 rc = ldap_back_proxy_authz_ctrl( lc, op, &rs, &ctrls );
746 if ( rc != LDAP_SUCCESS ) {
751 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
752 at ? gattr : NULL, 0, ctrls, NULL,
753 LDAP_NO_LIMIT, LDAP_NO_LIMIT, &result );
754 if ( rc != LDAP_SUCCESS ) {
755 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
757 if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
764 e = ldap_first_entry( lc->lc_ld, result );
769 *ent = ch_calloc( 1, sizeof( Entry ) );
771 rc = ldap_build_entry( op, e, *ent, &bdn );
773 if ( rc != LDAP_SUCCESS ) {
779 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
782 ldap_msgfree( result );
790 ldap_back_release_conn( op, &rs, lc );