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 struct ldapinfo *li = (struct ldapinfo *) 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->flags & LDAP_BACK_F_SUPPORT_T_F ) {
85 } else if ( strncmp( ptr, bv_false.bv_val, bv_false.bv_len ) == 0 )
88 if ( 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 );
151 struct berval match = BER_BVNULL,
157 LDAPControl **ctrls = NULL;
159 lc = ldap_back_getconn( op, rs, LDAP_BACK_SENDERR );
160 if ( !lc || !ldap_back_dobind( lc, op, rs, LDAP_BACK_SENDERR ) ) {
165 * FIXME: in case of values return filter, we might want
166 * to map attrs and maybe rewrite value
169 /* should we check return values? */
170 if ( op->ors_deref != -1 ) {
171 ldap_set_option( lc->lc_ld, LDAP_OPT_DEREF,
172 (void *)&op->ors_deref );
175 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
176 tv.tv_sec = op->ors_tlimit;
178 stoptime = op->o_time + op->ors_tlimit;
181 LDAP_BACK_TV_SET( &tv );
184 if ( op->ors_attrs ) {
185 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
186 /* just count attrs */ ;
188 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
189 if ( attrs == NULL ) {
190 rs->sr_err = LDAP_NO_MEMORY;
195 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
196 attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
202 rc = ldap_back_proxy_authz_ctrl( lc, op, rs, &ctrls );
203 if ( rc != LDAP_SUCCESS ) {
207 /* deal with <draft-zeilenga-ldap-t-f> filters */
208 filter = op->ors_filterstr;
210 rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_ndn.bv_val,
211 op->ors_scope, filter.bv_val,
212 attrs, op->ors_attrsonly, ctrls, NULL,
213 tv.tv_sec ? &tv : NULL,
214 op->ors_slimit, &msgid );
216 if ( rs->sr_err != LDAP_SUCCESS ) {
218 switch ( rs->sr_err ) {
219 case LDAP_SERVER_DOWN:
222 if ( ldap_back_retry( lc, op, rs, LDAP_BACK_DONTSEND ) ) {
226 rc = ldap_back_op_result( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
227 ldap_back_freeconn( op, lc );
231 case LDAP_FILTER_ERROR:
232 if ( ldap_back_munge_filter( op, &filter ) ) {
236 /* invalid filters return success with no data */
237 rs->sr_err = LDAP_SUCCESS;
242 rs->sr_err = slap_map_api2result( rs );
248 /* We pull apart the ber result, stuff it into a slapd entry, and
249 * let send_search_entry stuff it back into ber format. Slow & ugly,
250 * but this is necessary for version matching, and for ACL processing.
253 for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, 0, &tv, &res ) )
255 /* check for abandon */
256 if ( op->o_abandon ) {
260 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
266 LDAP_BACK_TV_SET( &tv );
267 ldap_pvt_thread_yield();
269 /* check time limit */
270 if ( op->ors_tlimit != SLAP_NO_LIMIT
271 && slap_get_time() > stoptime )
273 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
274 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
278 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
280 struct berval bdn = BER_BVNULL;
285 e = ldap_first_entry( lc->lc_ld, res );
286 rc = ldap_build_entry( op, e, &ent, &bdn );
287 if ( rc == LDAP_SUCCESS ) {
289 rs->sr_attrs = op->ors_attrs;
290 rs->sr_operational_attrs = NULL;
292 abort = send_search_entry( op, rs );
293 if ( !BER_BVISNULL( &ent.e_name ) ) {
294 assert( ent.e_name.bv_val != bdn.bv_val );
295 free( ent.e_name.bv_val );
296 BER_BVZERO( &ent.e_name );
298 if ( !BER_BVISNULL( &ent.e_nname ) ) {
299 free( ent.e_nname.bv_val );
300 BER_BVZERO( &ent.e_nname );
306 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
310 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
311 char **references = NULL;
314 rc = ldap_parse_reference( lc->lc_ld, res,
315 &references, &rs->sr_ctrls, 1 );
317 if ( rc != LDAP_SUCCESS ) {
321 /* FIXME: there MUST be at least one */
322 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
325 for ( cnt = 0; references[ cnt ]; cnt++ )
328 /* FIXME: there MUST be at least one */
329 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
331 for ( cnt = 0; references[ cnt ]; cnt++ ) {
332 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
334 BER_BVZERO( &rs->sr_ref[ cnt ] );
336 /* ignore return value by now */
337 ( void )send_search_reference( op, rs );
340 Debug( LDAP_DEBUG_ANY,
341 "%s ldap_back_search: "
342 "got SEARCH_REFERENCE "
343 "with no referrals\n",
344 op->o_log_prefix, 0, 0 );
349 ldap_value_free( references );
350 ch_free( rs->sr_ref );
354 if ( rs->sr_ctrls ) {
355 ldap_controls_free( rs->sr_ctrls );
360 char **references = NULL;
362 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
363 &match.bv_val, (char **)&rs->sr_text,
364 &references, &rs->sr_ctrls, 1 );
366 if ( rc != LDAP_SUCCESS ) {
369 rs->sr_err = slap_map_api2result( rs );
371 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
374 if ( rs->sr_err != LDAP_REFERRAL ) {
376 Debug( LDAP_DEBUG_ANY,
377 "%s ldap_back_search: "
378 "got referrals with %d\n",
381 rs->sr_err = LDAP_REFERRAL;
384 for ( cnt = 0; references[ cnt ]; cnt++ )
387 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
389 for ( cnt = 0; references[ cnt ]; cnt++ ) {
391 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
393 BER_BVZERO( &rs->sr_ref[ cnt ] );
396 if ( match.bv_val != NULL ) {
397 if ( match.bv_val[ 0 ] == '\0' ) {
398 LDAP_FREE( match.bv_val );
399 BER_BVZERO( &match );
401 match.bv_len = strlen( match.bv_val );
407 ldap_value_free( references );
418 if ( ldap_back_retry( lc, op, rs, LDAP_BACK_SENDERR ) ) {
422 rs->sr_err = LDAP_SERVER_DOWN;
427 * Rewrite the matched portion of the search base, if required
429 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
430 struct berval pmatch;
432 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
433 rs->sr_matched = pmatch.bv_val;
436 rs->sr_matched = match.bv_val;
440 if ( rs->sr_v2ref ) {
441 rs->sr_err = LDAP_REFERRAL;
445 if ( rc != SLAPD_ABANDON ) {
446 send_ldap_result( op, rs );
449 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
451 if ( rs->sr_ctrls ) {
452 ldap_controls_free( rs->sr_ctrls );
456 if ( rs->sr_matched != NULL ) {
457 if ( rs->sr_matched != match.bv_val ) {
458 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
461 LDAP_FREE( match.bv_val );
463 rs->sr_matched = NULL;
466 if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
467 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
472 LDAP_FREE( (char *)rs->sr_text );
478 ber_bvarray_free( rs->sr_ref );
487 ldap_back_release_conn( op, rs, lc );
501 BerElement ber = *e->lm_ber;
502 Attribute *attr, **attrp;
506 /* safe assumptions ... */
507 assert( ent != NULL );
508 BER_BVZERO( &ent->e_bv );
510 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
511 return LDAP_DECODING_ERROR;
515 * Note: this may fail if the target host(s) schema differs
516 * from the one known to the meta, and a DN with unknown
517 * attributes is returned.
519 * FIXME: should we log anything, or delegate to dnNormalize?
521 /* Note: if the distinguished values or the naming attributes
522 * change, should we massage them as well?
524 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
525 op->o_tmpmemctx ) != LDAP_SUCCESS )
527 return LDAP_INVALID_DN_SYNTAX;
530 attrp = &ent->e_attrs;
532 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
534 slap_syntax_validate_func *validate;
535 slap_syntax_transform_func *pretty;
537 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
538 if ( attr == NULL ) {
544 if ( slap_bv2ad( &a, &attr->a_desc, &text )
547 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
548 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
550 Debug( LDAP_DEBUG_ANY,
551 "%s ldap_build_entry: "
552 "slap_bv2undef_ad(%s): %s\n",
553 op->o_log_prefix, a.bv_val, text );
559 /* no subschemaSubentry */
560 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
561 || attr->a_desc == slap_schema.si_ad_entryDN )
565 * We eat target's subschemaSubentry because
566 * a search for this value is likely not
567 * to resolve to the appropriate backend;
568 * later, the local subschemaSubentry is
571 * We also eat entryDN because the frontend
572 * will reattach it without checking if already
575 ( void )ber_scanf( &ber, "x" /* [W] */ );
581 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
582 || attr->a_vals == NULL )
585 * Note: attr->a_vals can be null when using
586 * values result filter
588 attr->a_vals = (struct berval *)&slap_dummy_bv;
592 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
593 /* just count vals */ ;
596 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
597 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
599 if ( !validate && !pretty ) {
600 attr->a_nvals = NULL;
605 for ( i = 0; i < last; i++ ) {
610 rc = pretty( attr->a_desc->ad_type->sat_syntax,
611 &attr->a_vals[i], &pval, NULL );
614 rc = validate( attr->a_desc->ad_type->sat_syntax,
618 if ( rc != LDAP_SUCCESS ) {
619 /* check if, by chance, it's an undefined objectClass */
620 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
621 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
623 ber_dupbv( &pval, &attr->a_vals[i] );
626 attr->a_nvals = NULL;
633 LBER_FREE( attr->a_vals[i].bv_val );
634 attr->a_vals[i] = pval;
638 if ( last && attr->a_desc->ad_type->sat_equality &&
639 attr->a_desc->ad_type->sat_equality->smr_normalize )
641 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
642 for ( i = 0; i < last; i++ ) {
646 * check that each value is valid per syntax
647 * and pretty if appropriate
649 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
650 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
651 attr->a_desc->ad_type->sat_syntax,
652 attr->a_desc->ad_type->sat_equality,
653 &attr->a_vals[i], &attr->a_nvals[i],
656 if ( rc != LDAP_SUCCESS ) {
657 BER_BVZERO( &attr->a_nvals[i] );
662 BER_BVZERO( &attr->a_nvals[i] );
665 attr->a_nvals = attr->a_vals;
668 attrp = &attr->a_next;
676 /* return 0 IFF we can retrieve the entry with ndn
683 AttributeDescription *at,
692 LDAPMessage *result = NULL,
698 LDAPControl **ctrls = NULL;
700 /* Tell getconn this is a privileged op */
701 do_not_cache = op->o_do_not_cache;
702 op->o_do_not_cache = 1;
703 lc = ldap_back_getconn( op, &rs, LDAP_BACK_DONTSEND );
704 if ( !lc || !ldap_back_dobind( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
705 op->o_do_not_cache = do_not_cache;
708 op->o_do_not_cache = do_not_cache;
711 if ( oc && at != slap_schema.si_ad_objectClass ) {
712 gattr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
713 gattr[1] = at->ad_cname.bv_val;
717 gattr[0] = at->ad_cname.bv_val;
725 filter = ch_malloc( STRLENOF( "(objectclass=)" )
726 + oc->soc_cname.bv_len + 1 );
727 ptr = lutil_strcopy( filter, "(objectclass=" );
728 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
734 rc = ldap_back_proxy_authz_ctrl( lc, op, &rs, &ctrls );
735 if ( rc != LDAP_SUCCESS ) {
740 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
741 at ? gattr : NULL, 0, ctrls, NULL,
742 LDAP_NO_LIMIT, LDAP_NO_LIMIT, &result );
743 if ( rc != LDAP_SUCCESS ) {
744 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
746 if ( ldap_back_retry( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
753 e = ldap_first_entry( lc->lc_ld, result );
758 *ent = ch_calloc( 1, sizeof( Entry ) );
760 rc = ldap_build_entry( op, e, *ent, &bdn );
762 if ( rc != LDAP_SUCCESS ) {
768 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
771 ldap_msgfree( result );
779 ldap_back_release_conn( op, &rs, lc );