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;
185 if ( op->ors_attrs ) {
186 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
187 /* just count attrs */ ;
189 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
190 if ( attrs == NULL ) {
191 rs->sr_err = LDAP_NO_MEMORY;
196 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
197 attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
203 rc = ldap_back_proxy_authz_ctrl( lc, op, rs, &ctrls );
204 if ( rc != LDAP_SUCCESS ) {
208 /* deal with <draft-zeilenga-ldap-t-f> filters */
209 filter = op->ors_filterstr;
211 rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_ndn.bv_val,
212 op->ors_scope, filter.bv_val,
213 attrs, op->ors_attrsonly, ctrls, NULL,
214 tv.tv_sec ? &tv : NULL,
215 op->ors_slimit, &msgid );
217 if ( rs->sr_err != LDAP_SUCCESS ) {
219 switch ( rs->sr_err ) {
220 case LDAP_SERVER_DOWN:
223 if ( ldap_back_retry( lc, op, rs, LDAP_BACK_DONTSEND ) ) {
227 rc = ldap_back_op_result( lc, op, rs, msgid, LDAP_BACK_DONTSEND );
228 ldap_back_freeconn( op, lc );
232 case LDAP_FILTER_ERROR:
233 if ( ldap_back_munge_filter( op, &filter ) ) {
237 /* invalid filters return success with no data */
238 rs->sr_err = LDAP_SUCCESS;
243 rs->sr_err = slap_map_api2result( rs );
249 /* We pull apart the ber result, stuff it into a slapd entry, and
250 * let send_search_entry stuff it back into ber format. Slow & ugly,
251 * but this is necessary for version matching, and for ACL processing.
254 for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, 0, &tv, &res ) )
256 /* check for abandon */
257 if ( op->o_abandon ) {
261 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
269 ldap_pvt_thread_yield();
271 /* check time limit */
272 if ( op->ors_tlimit != SLAP_NO_LIMIT
273 && slap_get_time() > stoptime )
275 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
276 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
280 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
282 struct berval bdn = BER_BVNULL;
287 e = ldap_first_entry( lc->lc_ld, res );
288 rc = ldap_build_entry( op, e, &ent, &bdn );
289 if ( rc == LDAP_SUCCESS ) {
291 rs->sr_attrs = op->ors_attrs;
292 rs->sr_operational_attrs = NULL;
294 abort = send_search_entry( op, rs );
295 if ( !BER_BVISNULL( &ent.e_name ) ) {
296 assert( ent.e_name.bv_val != bdn.bv_val );
297 free( ent.e_name.bv_val );
298 BER_BVZERO( &ent.e_name );
300 if ( !BER_BVISNULL( &ent.e_nname ) ) {
301 free( ent.e_nname.bv_val );
302 BER_BVZERO( &ent.e_nname );
308 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
312 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
313 char **references = NULL;
316 rc = ldap_parse_reference( lc->lc_ld, res,
317 &references, &rs->sr_ctrls, 1 );
319 if ( rc != LDAP_SUCCESS ) {
323 /* FIXME: there MUST be at least one */
324 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
327 for ( cnt = 0; references[ cnt ]; cnt++ )
330 /* FIXME: there MUST be at least one */
331 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
333 for ( cnt = 0; references[ cnt ]; cnt++ ) {
334 ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
336 BER_BVZERO( &rs->sr_ref[ cnt ] );
338 /* ignore return value by now */
339 ( void )send_search_reference( op, rs );
342 Debug( LDAP_DEBUG_ANY,
343 "%s ldap_back_search: "
344 "got SEARCH_REFERENCE "
345 "with no referrals\n",
346 op->o_log_prefix, 0, 0 );
351 ldap_value_free( references );
352 ch_free( rs->sr_ref );
356 if ( rs->sr_ctrls ) {
357 ldap_controls_free( rs->sr_ctrls );
362 char **references = NULL;
364 rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
365 &match.bv_val, (char **)&rs->sr_text,
366 &references, &rs->sr_ctrls, 1 );
368 if ( rc != LDAP_SUCCESS ) {
371 rs->sr_err = slap_map_api2result( rs );
373 if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
376 if ( rs->sr_err != LDAP_REFERRAL ) {
378 Debug( LDAP_DEBUG_ANY,
379 "%s ldap_back_search: "
380 "got referrals with %d\n",
383 rs->sr_err = LDAP_REFERRAL;
386 for ( cnt = 0; references[ cnt ]; cnt++ )
389 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
391 for ( cnt = 0; references[ cnt ]; cnt++ ) {
393 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
395 BER_BVZERO( &rs->sr_ref[ cnt ] );
398 if ( match.bv_val != NULL ) {
399 if ( match.bv_val[ 0 ] == '\0' ) {
400 LDAP_FREE( match.bv_val );
401 BER_BVZERO( &match );
403 match.bv_len = strlen( match.bv_val );
409 ldap_value_free( references );
420 if ( ldap_back_retry( lc, op, rs, LDAP_BACK_SENDERR ) ) {
424 rs->sr_err = LDAP_SERVER_DOWN;
429 * Rewrite the matched portion of the search base, if required
431 if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
432 struct berval pmatch;
434 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
435 rs->sr_matched = pmatch.bv_val;
438 rs->sr_matched = match.bv_val;
442 if ( rs->sr_v2ref ) {
443 rs->sr_err = LDAP_REFERRAL;
447 if ( rc != SLAPD_ABANDON ) {
448 send_ldap_result( op, rs );
451 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
453 if ( rs->sr_ctrls ) {
454 ldap_controls_free( rs->sr_ctrls );
458 if ( rs->sr_matched != NULL ) {
459 if ( rs->sr_matched != match.bv_val ) {
460 ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
463 LDAP_FREE( match.bv_val );
465 rs->sr_matched = NULL;
468 if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
469 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
474 LDAP_FREE( (char *)rs->sr_text );
480 ber_bvarray_free( rs->sr_ref );
489 ldap_back_release_conn( op, rs, lc );
503 BerElement ber = *e->lm_ber;
504 Attribute *attr, **attrp;
508 /* safe assumptions ... */
509 assert( ent != NULL );
510 BER_BVZERO( &ent->e_bv );
512 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
513 return LDAP_DECODING_ERROR;
517 * Note: this may fail if the target host(s) schema differs
518 * from the one known to the meta, and a DN with unknown
519 * attributes is returned.
521 * FIXME: should we log anything, or delegate to dnNormalize?
523 /* Note: if the distinguished values or the naming attributes
524 * change, should we massage them as well?
526 if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
527 op->o_tmpmemctx ) != LDAP_SUCCESS )
529 return LDAP_INVALID_DN_SYNTAX;
532 attrp = &ent->e_attrs;
534 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
536 slap_syntax_validate_func *validate;
537 slap_syntax_transform_func *pretty;
539 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
540 if ( attr == NULL ) {
546 if ( slap_bv2ad( &a, &attr->a_desc, &text )
549 if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
550 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
552 Debug( LDAP_DEBUG_ANY,
553 "%s ldap_build_entry: "
554 "slap_bv2undef_ad(%s): %s\n",
555 op->o_log_prefix, a.bv_val, text );
561 /* no subschemaSubentry */
562 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
563 || attr->a_desc == slap_schema.si_ad_entryDN )
567 * We eat target's subschemaSubentry because
568 * a search for this value is likely not
569 * to resolve to the appropriate backend;
570 * later, the local subschemaSubentry is
573 * We also eat entryDN because the frontend
574 * will reattach it without checking if already
577 ( void )ber_scanf( &ber, "x" /* [W] */ );
583 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
584 || attr->a_vals == NULL )
587 * Note: attr->a_vals can be null when using
588 * values result filter
590 attr->a_vals = (struct berval *)&slap_dummy_bv;
594 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
595 /* just count vals */ ;
598 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
599 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
601 if ( !validate && !pretty ) {
602 attr->a_nvals = NULL;
607 for ( i = 0; i < last; i++ ) {
612 rc = pretty( attr->a_desc->ad_type->sat_syntax,
613 &attr->a_vals[i], &pval, NULL );
616 rc = validate( attr->a_desc->ad_type->sat_syntax,
620 if ( rc != LDAP_SUCCESS ) {
621 /* check if, by chance, it's an undefined objectClass */
622 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
623 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
625 ber_dupbv( &pval, &attr->a_vals[i] );
628 attr->a_nvals = NULL;
635 LBER_FREE( attr->a_vals[i].bv_val );
636 attr->a_vals[i] = pval;
640 if ( last && attr->a_desc->ad_type->sat_equality &&
641 attr->a_desc->ad_type->sat_equality->smr_normalize )
643 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
644 for ( i = 0; i < last; i++ ) {
648 * check that each value is valid per syntax
649 * and pretty if appropriate
651 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
652 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
653 attr->a_desc->ad_type->sat_syntax,
654 attr->a_desc->ad_type->sat_equality,
655 &attr->a_vals[i], &attr->a_nvals[i],
658 if ( rc != LDAP_SUCCESS ) {
659 BER_BVZERO( &attr->a_nvals[i] );
664 BER_BVZERO( &attr->a_nvals[i] );
667 attr->a_nvals = attr->a_vals;
670 attrp = &attr->a_next;
678 /* return 0 IFF we can retrieve the entry with ndn
685 AttributeDescription *at,
694 LDAPMessage *result = NULL,
700 LDAPControl **ctrls = NULL;
702 /* Tell getconn this is a privileged op */
703 do_not_cache = op->o_do_not_cache;
704 op->o_do_not_cache = 1;
705 lc = ldap_back_getconn( op, &rs, LDAP_BACK_DONTSEND );
706 if ( !lc || !ldap_back_dobind( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
707 op->o_do_not_cache = do_not_cache;
710 op->o_do_not_cache = do_not_cache;
713 if ( oc && at != slap_schema.si_ad_objectClass ) {
714 gattr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
715 gattr[1] = at->ad_cname.bv_val;
719 gattr[0] = at->ad_cname.bv_val;
727 filter = ch_malloc( STRLENOF( "(objectclass=)" )
728 + oc->soc_cname.bv_len + 1 );
729 ptr = lutil_strcopy( filter, "(objectclass=" );
730 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
736 rc = ldap_back_proxy_authz_ctrl( lc, op, &rs, &ctrls );
737 if ( rc != LDAP_SUCCESS ) {
742 rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
743 at ? gattr : NULL, 0, ctrls, NULL,
744 LDAP_NO_LIMIT, LDAP_NO_LIMIT, &result );
745 if ( rc != LDAP_SUCCESS ) {
746 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
748 if ( ldap_back_retry( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
755 e = ldap_first_entry( lc->lc_ld, result );
760 *ent = ch_calloc( 1, sizeof( Entry ) );
762 rc = ldap_build_entry( op, e, *ent, &bdn );
764 if ( rc != LDAP_SUCCESS ) {
770 (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
773 ldap_msgfree( result );
781 ldap_back_release_conn( op, &rs, lc );