1 /* search.c - ldap backend search function */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5 * Copyright 1999-2004 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,
41 struct berval *bdn, int flags );
42 #define LDAP_BUILD_ENTRY_PRIVATE 0x01
44 static struct berval dummy = BER_BVNULL;
51 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
56 struct berval match = BER_BVNULL;
57 char **mapped_attrs = NULL;
59 struct berval mfilter = BER_BVNULL;
62 #ifdef LDAP_BACK_PROXY_AUTHZ
63 LDAPControl **ctrls = NULL;
64 #endif /* LDAP_BACK_PROXY_AUTHZ */
66 lc = ldap_back_getconn(op, rs);
72 * FIXME: in case of values return filter, we might want
73 * to map attrs and maybe rewrite value
75 if ( !ldap_back_dobind( lc, op, rs ) ) {
79 /* should we check return values? */
80 if (op->ors_deref != -1)
81 ldap_set_option( lc->ld, LDAP_OPT_DEREF, (void *)&op->ors_deref);
82 if (op->ors_tlimit != SLAP_NO_LIMIT) {
83 tv.tv_sec = op->ors_tlimit;
90 * Rewrite the search base, if required
92 dc.rwmap = &li->rwmap;
96 dc.ctx = "searchBase";
101 if ( ldap_back_dn_massage( &dc, &op->o_req_ndn, &mbase ) ) {
102 send_ldap_result( op, rs );
106 rc = ldap_back_filter_map_rewrite( &dc, op->ors_filter,
107 &mfilter, BACKLDAP_MAP );
113 case LDAP_COMPARE_FALSE:
114 rs->sr_err = LDAP_SUCCESS;
120 rs->sr_err = LDAP_OTHER;
121 rs->sr_text = "Rewrite error";
127 rs->sr_err = ldap_back_map_attrs( &li->rwmap.rwm_at,
129 BACKLDAP_MAP, &mapped_attrs );
135 #ifdef LDAP_BACK_PROXY_AUTHZ
136 rc = ldap_back_proxy_authz_ctrl( lc, op, rs, &ctrls );
137 if ( rc != LDAP_SUCCESS ) {
141 #endif /* LDAP_BACK_PROXY_AUTHZ */
143 rs->sr_err = ldap_search_ext(lc->ld, mbase.bv_val,
144 op->ors_scope, mfilter.bv_val,
145 mapped_attrs, op->ors_attrsonly,
146 #ifdef LDAP_BACK_PROXY_AUTHZ
148 #else /* ! LDAP_BACK_PROXY_AUTHZ */
150 #endif /* ! LDAP_BACK_PROXY_AUTHZ */
152 tv.tv_sec ? &tv : NULL, op->ors_slimit,
155 if ( rs->sr_err != LDAP_SUCCESS ) {
157 rc = ldap_back_op_result(lc, op, rs, msgid, 0);
161 /* We pull apart the ber result, stuff it into a slapd entry, and
162 * let send_search_entry stuff it back into ber format. Slow & ugly,
163 * but this is necessary for version matching, and for ACL processing.
166 for ( rc=0; rc != -1; rc = ldap_result(lc->ld, msgid, 0, &tv, &res))
168 /* check for abandon */
170 ldap_abandon(lc->ld, msgid);
178 ldap_pvt_thread_yield();
180 } else if (rc == LDAP_RES_SEARCH_ENTRY) {
184 e = ldap_first_entry(lc->ld,res);
185 if ( ( rc = ldap_build_entry(op, e, &ent, &bdn,
186 LDAP_BUILD_ENTRY_PRIVATE)) == LDAP_SUCCESS ) {
188 rs->sr_attrs = op->ors_attrs;
190 abort = send_search_entry( op, rs );
191 while (ent.e_attrs) {
196 ent.e_attrs = a->a_next;
199 if (a->a_vals != &dummy)
200 ber_bvarray_free(a->a_vals);
202 ber_bvarray_free(a->a_nvals);
206 if ( ent.e_dn && ( ent.e_dn != bdn.bv_val ) )
213 ldap_abandon(lc->ld, msgid);
217 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
218 char **references = NULL;
221 rc = ldap_parse_reference( lc->ld, res,
222 &references, &rs->sr_ctrls, 1 );
224 if ( rc != LDAP_SUCCESS ) {
228 if ( references == NULL ) {
232 for ( cnt = 0; references[ cnt ]; cnt++ )
235 rs->sr_ref = ch_calloc( cnt + 1, sizeof( struct berval ) );
237 for ( cnt = 0; references[ cnt ]; cnt++ ) {
238 rs->sr_ref[ cnt ].bv_val = references[ cnt ];
239 rs->sr_ref[ cnt ].bv_len = strlen( references[ cnt ] );
242 /* ignore return value by now */
243 ( void )send_search_reference( op, rs );
247 ldap_value_free( references );
248 ch_free( rs->sr_ref );
252 if ( rs->sr_ctrls ) {
253 ldap_controls_free( rs->sr_ctrls );
258 rc = ldap_parse_result(lc->ld, res, &rs->sr_err,
259 &match.bv_val, (char **)&rs->sr_text,
261 if (rc != LDAP_SUCCESS ) rs->sr_err = rc;
262 rs->sr_err = slap_map_api2result( rs );
272 * Rewrite the matched portion of the search base, if required
274 if ( match.bv_val && *match.bv_val ) {
277 #ifdef ENABLE_REWRITE
278 dc.ctx = "matchedDN";
283 match.bv_len = strlen( match.bv_val );
284 ldap_back_dn_massage(&dc, &match, &mdn);
285 rs->sr_matched = mdn.bv_val;
287 if ( rs->sr_v2ref ) {
288 rs->sr_err = LDAP_REFERRAL;
292 send_ldap_result( op, rs );
294 #ifdef LDAP_BACK_PROXY_AUTHZ
295 if ( ctrls && ctrls != op->o_ctrls ) {
299 #endif /* LDAP_BACK_PROXY_AUTHZ */
301 if ( match.bv_val ) {
302 if ( rs->sr_matched != match.bv_val ) {
303 free( (char *)rs->sr_matched );
305 rs->sr_matched = NULL;
306 LDAP_FREE( match.bv_val );
309 if ( !dontfreetext ) {
310 LDAP_FREE( (char *)rs->sr_text );
314 if ( mapped_attrs ) {
315 ch_free( mapped_attrs );
317 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
318 ch_free( mfilter.bv_val );
320 if ( mbase.bv_val != op->o_req_ndn.bv_val ) {
321 free( mbase.bv_val );
336 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
337 struct berval a, mapped;
338 BerElement ber = *e->lm_ber;
339 Attribute *attr, **attrp;
343 int private = flags & LDAP_BUILD_ENTRY_PRIVATE;
346 /* safe assumptions ... */
348 ent->e_bv.bv_val = NULL;
350 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
351 return LDAP_DECODING_ERROR;
355 * Rewrite the dn of the result, if needed
357 dc.rwmap = &li->rwmap;
358 #ifdef ENABLE_REWRITE
359 dc.conn = op->o_conn;
361 dc.ctx = "searchResult";
366 if ( ldap_back_dn_massage( &dc, bdn, &ent->e_name ) ) {
371 * Note: this may fail if the target host(s) schema differs
372 * from the one known to the meta, and a DN with unknown
373 * attributes is returned.
375 * FIXME: should we log anything, or delegate to dnNormalize?
377 if ( dnNormalize( 0, NULL, NULL, &ent->e_name, &ent->e_nname,
378 op->o_tmpmemctx ) != LDAP_SUCCESS )
380 return LDAP_INVALID_DN_SYNTAX;
383 attrp = &ent->e_attrs;
385 #ifdef ENABLE_REWRITE
386 dc.ctx = "searchAttrDN";
388 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
390 slap_syntax_validate_func *validate =
391 attr->a_desc->ad_type->sat_syntax->ssyn_validate;
392 slap_syntax_transform_func *pretty =
393 attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
395 ldap_back_map( &li->rwmap.rwm_at, &a, &mapped, BACKLDAP_REMAP );
396 if ( BER_BVISNULL( &mapped ) || BER_BVISEMPTY( &mapped ) )
398 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
404 if ( slap_bv2ad( &mapped, &attr->a_desc, &text ) != LDAP_SUCCESS ) {
405 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text )
409 LDAP_LOG( BACK_LDAP, DETAIL1,
410 "slap_bv2undef_ad(%s): %s\n", mapped.bv_val, text, 0 );
411 #else /* !NEW_LOGGING */
412 Debug( LDAP_DEBUG_ANY,
413 "slap_bv2undef_ad(%s): %s\n", mapped.bv_val, text, 0 );
414 #endif /* !NEW_LOGGING */
420 /* no subschemaSubentry */
421 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
424 * We eat target's subschemaSubentry because
425 * a search for this value is likely not
426 * to resolve to the appropriate backend;
427 * later, the local subschemaSubentry is
430 ( void )ber_scanf( &ber, "x" /* [W] */ );
436 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
437 || attr->a_vals == NULL )
440 * Note: attr->a_vals can be null when using
441 * values result filter
444 attr->a_vals = &dummy;
446 attr->a_vals = ch_malloc( sizeof( struct berval ) );
447 BER_BVZERO( &attr->a_vals[0] );
452 for ( last = 0; !BER_BVISNULL( &attr->a_vals[last] ); last++ );
457 } else if ( attr->a_desc == slap_schema.si_ad_objectClass
458 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
460 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
461 ldap_back_map( &li->rwmap.rwm_oc, bv, &mapped,
463 if ( BER_BVISNULL( &mapped ) || BER_BVISEMPTY( &mapped ) ) {
464 LBER_FREE( bv->bv_val );
468 *bv = attr->a_vals[last];
469 BER_BVZERO( &attr->a_vals[last] );
472 } else if ( mapped.bv_val != bv->bv_val ) {
474 * FIXME: after LBER_FREEing
475 * the value is replaced by
478 LBER_FREE( bv->bv_val );
479 ber_dupbv( bv, &mapped );
484 * It is necessary to try to rewrite attributes with
485 * dn syntax because they might be used in ACLs as
486 * members of groups; since ACLs are applied to the
487 * rewritten stuff, no dn-based subject clause could
488 * be used at the ldap backend side (see
489 * http://www.OpenLDAP.org/faq/data/cache/452.html)
490 * The problem can be overcome by moving the dn-based
491 * ACLs to the target directory server, and letting
492 * everything pass thru the ldap backend.
494 } else if ( attr->a_desc->ad_type->sat_syntax ==
495 slap_schema.si_syn_distinguishedName )
497 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
500 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
501 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
503 if ( !validate && !pretty ) {
504 attr->a_nvals = NULL;
509 for ( i = 0; i < last; i++ ) {
514 rc = pretty( attr->a_desc->ad_type->sat_syntax,
515 &attr->a_vals[i], &pval, NULL );
517 rc = validate( attr->a_desc->ad_type->sat_syntax,
521 if ( rc != LDAP_SUCCESS ) {
522 attr->a_nvals = NULL;
528 LBER_FREE( attr->a_vals[i].bv_val );
529 attr->a_vals[i] = pval;
533 if ( last && attr->a_desc->ad_type->sat_equality &&
534 attr->a_desc->ad_type->sat_equality->smr_normalize )
536 attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
537 for ( i = 0; i < last; i++ ) {
541 * check that each value is valid per syntax
542 * and pretty if appropriate
544 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
545 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
546 attr->a_desc->ad_type->sat_syntax,
547 attr->a_desc->ad_type->sat_equality,
548 &attr->a_vals[i], &attr->a_nvals[i],
549 NULL /* op->o_tmpmemctx */ );
551 if ( rc != LDAP_SUCCESS ) {
552 BER_BVZERO( &attr->a_nvals[i] );
557 BER_BVZERO( &attr->a_nvals[i] );
560 attr->a_nvals = attr->a_vals;
563 attrp = &attr->a_next;
568 /* make sure it's free'able */
569 if ( !private && ent->e_name.bv_val == bdn->bv_val ) {
570 ber_dupbv( &ent->e_name, bdn );
575 /* return 0 IFF we can retrieve the entry with ndn
582 AttributeDescription *at,
587 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
590 struct berval mapped = BER_BVNULL, bdn, mdn;
591 LDAPMessage *result = NULL, *e = NULL;
598 /* Tell getconn this is a privileged op */
599 is_oc = op->o_do_not_cache;
600 op->o_do_not_cache = 1;
601 lc = ldap_back_getconn(op, &rs);
604 if ( !lc || !ldap_back_dobind(lc, op, &rs) ) {
605 op->o_do_not_cache = is_oc;
609 op->o_do_not_cache = is_oc;
613 * Rewrite the search base, if required
615 dc.rwmap = &li->rwmap;
616 #ifdef ENABLE_REWRITE
617 dc.conn = op->o_conn;
619 dc.ctx = "searchBase";
624 if ( ldap_back_dn_massage( &dc, ndn, &mdn ) ) {
629 ldap_back_map(&li->rwmap.rwm_at, &at->ad_cname, &mapped, BACKLDAP_MAP);
630 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
636 is_oc = (strcasecmp("objectclass", mapped.bv_val) == 0);
638 gattr[0] = "objectclass";
639 gattr[1] = mapped.bv_val;
642 gattr[0] = mapped.bv_val;
647 ldap_back_map(&li->rwmap.rwm_oc, &oc->soc_cname, &mapped,
649 filter = ch_malloc(sizeof("(objectclass=)") + mapped.bv_len);
650 ptr = lutil_strcopy(filter, "(objectclass=");
651 ptr = lutil_strcopy(ptr, mapped.bv_val);
656 if (ldap_search_ext_s(lc->ld, mdn.bv_val, LDAP_SCOPE_BASE, filter,
657 gattr, 0, NULL, NULL, LDAP_NO_LIMIT,
658 LDAP_NO_LIMIT, &result) != LDAP_SUCCESS)
663 if ((e = ldap_first_entry(lc->ld, result)) == NULL) {
667 *ent = ch_calloc(1,sizeof(Entry));
669 rc = ldap_build_entry(op, e, *ent, &bdn, 0);
671 if (rc != LDAP_SUCCESS) {
678 ldap_msgfree(result);
685 if ( mdn.bv_val != ndn->bv_val ) {
686 ch_free( mdn.bv_val );