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
43 #define LDAP_BUILD_ENTRY_NORMALIZE 0x02
45 static struct berval dummy = { 0, NULL };
52 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
57 struct berval match = { 0, NULL };
58 char **mapped_attrs = NULL;
60 struct berval mfilter = { 0, NULL };
63 #ifdef LDAP_BACK_PROXY_AUTHZ
64 LDAPControl **ctrls = NULL;
65 #endif /* LDAP_BACK_PROXY_AUTHZ */
67 lc = ldap_back_getconn(op, rs);
73 * FIXME: in case of values return filter, we might want
74 * to map attrs and maybe rewrite value
76 if ( !ldap_back_dobind( lc, op, rs ) ) {
80 /* should we check return values? */
81 if (op->ors_deref != -1)
82 ldap_set_option( lc->ld, LDAP_OPT_DEREF, (void *)&op->ors_deref);
83 if (op->ors_tlimit != -1) {
84 tv.tv_sec = op->ors_tlimit;
91 * Rewrite the search base, if required
93 dc.rwmap = &li->rwmap;
97 dc.ctx = "searchBase";
102 if ( ldap_back_dn_massage( &dc, &op->o_req_ndn, &mbase ) ) {
103 send_ldap_result( op, rs );
107 rc = ldap_back_filter_map_rewrite( &dc, op->ors_filter,
108 &mfilter, BACKLDAP_MAP );
114 case LDAP_COMPARE_FALSE:
115 rs->sr_err = LDAP_SUCCESS;
121 rs->sr_err = LDAP_OTHER;
122 rs->sr_text = "Rewrite error";
128 rs->sr_err = ldap_back_map_attrs( &li->rwmap.rwm_at,
130 BACKLDAP_MAP, &mapped_attrs );
136 #ifdef LDAP_BACK_PROXY_AUTHZ
137 rc = ldap_back_proxy_authz_ctrl( lc, op, rs, &ctrls );
138 if ( rc != LDAP_SUCCESS ) {
142 #endif /* LDAP_BACK_PROXY_AUTHZ */
144 rs->sr_err = ldap_search_ext(lc->ld, mbase.bv_val,
145 op->ors_scope, mfilter.bv_val,
146 mapped_attrs, op->ors_attrsonly,
147 #ifdef LDAP_BACK_PROXY_AUTHZ
149 #else /* ! LDAP_BACK_PROXY_AUTHZ */
151 #endif /* ! LDAP_BACK_PROXY_AUTHZ */
153 tv.tv_sec ? &tv : NULL, op->ors_slimit,
156 if ( rs->sr_err != LDAP_SUCCESS ) {
158 rc = ldap_back_op_result(lc, op, rs, msgid, 0);
162 /* We pull apart the ber result, stuff it into a slapd entry, and
163 * let send_search_entry stuff it back into ber format. Slow & ugly,
164 * but this is necessary for version matching, and for ACL processing.
167 for ( rc=0; rc != -1; rc = ldap_result(lc->ld, msgid, 0, &tv, &res))
169 /* check for abandon */
171 ldap_abandon(lc->ld, msgid);
179 ldap_pvt_thread_yield();
181 } else if (rc == LDAP_RES_SEARCH_ENTRY) {
185 e = ldap_first_entry(lc->ld,res);
186 if ( ( rc = ldap_build_entry(op, e, &ent, &bdn,
187 LDAP_BUILD_ENTRY_PRIVATE)) == LDAP_SUCCESS ) {
189 rs->sr_attrs = op->ors_attrs;
191 abort = send_search_entry( op, rs );
192 while (ent.e_attrs) {
197 ent.e_attrs = a->a_next;
200 if (a->a_vals != &dummy)
201 ber_bvarray_free(a->a_vals);
203 ber_bvarray_free(a->a_nvals);
207 if ( ent.e_dn && ( ent.e_dn != bdn.bv_val ) )
214 ldap_abandon(lc->ld, msgid);
218 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
219 char **references = NULL;
222 rc = ldap_parse_reference( lc->ld, res,
223 &references, &rs->sr_ctrls, 1 );
225 if ( rc != LDAP_SUCCESS ) {
229 if ( references == NULL ) {
233 for ( cnt = 0; references[ cnt ]; cnt++ )
236 rs->sr_ref = ch_calloc( cnt + 1, sizeof( struct berval ) );
238 for ( cnt = 0; references[ cnt ]; cnt++ ) {
239 rs->sr_ref[ cnt ].bv_val = references[ cnt ];
240 rs->sr_ref[ cnt ].bv_len = strlen( references[ cnt ] );
243 /* ignore return value by now */
244 ( void )send_search_reference( op, rs );
248 ldap_value_free( references );
249 ch_free( rs->sr_ref );
253 if ( rs->sr_ctrls ) {
254 ldap_controls_free( rs->sr_ctrls );
259 rc = ldap_parse_result(lc->ld, res, &rs->sr_err,
260 &match.bv_val, (char **)&rs->sr_text,
262 if (rc != LDAP_SUCCESS ) rs->sr_err = rc;
263 rs->sr_err = slap_map_api2result( rs );
273 * Rewrite the matched portion of the search base, if required
275 if ( match.bv_val && *match.bv_val ) {
278 #ifdef ENABLE_REWRITE
279 dc.ctx = "matchedDN";
284 match.bv_len = strlen( match.bv_val );
285 ldap_back_dn_massage(&dc, &match, &mdn);
286 rs->sr_matched = mdn.bv_val;
288 if ( rs->sr_v2ref ) {
289 rs->sr_err = LDAP_REFERRAL;
293 send_ldap_result( op, rs );
295 #ifdef LDAP_BACK_PROXY_AUTHZ
296 if ( ctrls && ctrls != op->o_ctrls ) {
300 #endif /* LDAP_BACK_PROXY_AUTHZ */
302 if ( match.bv_val ) {
303 if ( rs->sr_matched != match.bv_val ) {
304 free( (char *)rs->sr_matched );
306 rs->sr_matched = NULL;
307 LDAP_FREE( match.bv_val );
310 if ( !dontfreetext ) {
311 LDAP_FREE( (char *)rs->sr_text );
315 if ( mapped_attrs ) {
316 ch_free( mapped_attrs );
318 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
319 ch_free( mfilter.bv_val );
321 if ( mbase.bv_val != op->o_req_ndn.bv_val ) {
322 free( mbase.bv_val );
337 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
338 struct berval a, mapped;
339 BerElement ber = *e->lm_ber;
340 Attribute *attr, **attrp;
344 int private = flags & LDAP_BUILD_ENTRY_PRIVATE;
345 int normalize = flags & LDAP_BUILD_ENTRY_NORMALIZE;
348 /* safe assumptions ... */
350 ent->e_bv.bv_val = NULL;
352 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
353 return LDAP_DECODING_ERROR;
357 * Rewrite the dn of the result, if needed
359 dc.rwmap = &li->rwmap;
360 #ifdef ENABLE_REWRITE
361 dc.conn = op->o_conn;
363 dc.ctx = "searchResult";
368 if ( ldap_back_dn_massage( &dc, bdn, &ent->e_name ) ) {
373 * Note: this may fail if the target host(s) schema differs
374 * from the one known to the meta, and a DN with unknown
375 * attributes is returned.
377 * FIXME: should we log anything, or delegate to dnNormalize?
379 if ( dnNormalize( 0, NULL, NULL, &ent->e_name, &ent->e_nname,
380 op->o_tmpmemctx ) != LDAP_SUCCESS )
382 return LDAP_INVALID_DN_SYNTAX;
385 attrp = &ent->e_attrs;
387 #ifdef ENABLE_REWRITE
388 dc.ctx = "searchAttrDN";
390 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
391 ldap_back_map(&li->rwmap.rwm_at, &a, &mapped, BACKLDAP_REMAP);
392 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0')
394 attr = (Attribute *)ch_malloc( sizeof(Attribute) );
400 if (slap_bv2ad(&mapped, &attr->a_desc, &text) != LDAP_SUCCESS) {
401 if (slap_bv2undef_ad(&mapped, &attr->a_desc, &text)
404 LDAP_LOG( BACK_LDAP, DETAIL1,
405 "slap_bv2undef_ad(%s): %s\n", mapped.bv_val, text, 0 );
406 #else /* !NEW_LOGGING */
407 Debug( LDAP_DEBUG_ANY,
408 "slap_bv2undef_ad(%s): "
409 "%s\n%s", mapped.bv_val, text, "" );
410 #endif /* !NEW_LOGGING */
416 /* no subschemaSubentry */
417 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
420 * We eat target's subschemaSubentry because
421 * a search for this value is likely not
422 * to resolve to the appropriate backend;
423 * later, the local subschemaSubentry is
426 ( void )ber_scanf( &ber, "x" /* [W] */ );
432 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
433 || attr->a_vals == NULL ) {
435 * Note: attr->a_vals can be null when using
436 * values result filter
439 attr->a_vals = &dummy;
441 attr->a_vals = ch_malloc(sizeof(struct berval));
442 attr->a_vals->bv_val = NULL;
443 attr->a_vals->bv_len = 0;
447 for ( last = 0; attr->a_vals[last].bv_val; last++ );
451 } else if ( attr->a_desc == slap_schema.si_ad_objectClass
452 || attr->a_desc == slap_schema.si_ad_structuralObjectClass ) {
453 for ( bv = attr->a_vals; bv->bv_val; bv++ ) {
454 ldap_back_map(&li->rwmap.rwm_oc, bv, &mapped,
456 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
457 LBER_FREE(bv->bv_val);
461 *bv = attr->a_vals[last];
462 attr->a_vals[last].bv_val = NULL;
465 } else if ( mapped.bv_val != bv->bv_val ) {
467 * FIXME: after LBER_FREEing
468 * the value is replaced by
471 LBER_FREE(bv->bv_val);
472 ber_dupbv( bv, &mapped );
477 * It is necessary to try to rewrite attributes with
478 * dn syntax because they might be used in ACLs as
479 * members of groups; since ACLs are applied to the
480 * rewritten stuff, no dn-based subject clause could
481 * be used at the ldap backend side (see
482 * http://www.OpenLDAP.org/faq/data/cache/452.html)
483 * The problem can be overcome by moving the dn-based
484 * ACLs to the target directory server, and letting
485 * everything pass thru the ldap backend.
487 } else if ( attr->a_desc->ad_type->sat_syntax ==
488 slap_schema.si_syn_distinguishedName ) {
489 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
492 if ( normalize && last && attr->a_desc->ad_type->sat_equality &&
493 attr->a_desc->ad_type->sat_equality->smr_normalize ) {
496 attr->a_nvals = ch_malloc((last+1)*sizeof(struct berval));
497 for (i=0; i<last; i++) {
498 attr->a_desc->ad_type->sat_equality->smr_normalize(
499 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
500 attr->a_desc->ad_type->sat_syntax,
501 attr->a_desc->ad_type->sat_equality,
502 &attr->a_vals[i], &attr->a_nvals[i],
503 NULL /* op->o_tmpmemctx */ );
505 attr->a_nvals[i].bv_val = NULL;
506 attr->a_nvals[i].bv_len = 0;
508 attr->a_nvals = attr->a_vals;
511 attrp = &attr->a_next;
514 /* make sure it's free'able */
515 if (!private && ent->e_name.bv_val == bdn->bv_val)
516 ber_dupbv( &ent->e_name, bdn );
520 /* return 0 IFF we can retrieve the entry with ndn
527 AttributeDescription *at,
532 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
535 struct berval mapped = { 0, NULL }, bdn, mdn;
536 LDAPMessage *result = NULL, *e = NULL;
543 /* Tell getconn this is a privileged op */
544 is_oc = op->o_do_not_cache;
545 op->o_do_not_cache = 1;
546 lc = ldap_back_getconn(op, &rs);
549 if ( !lc || !ldap_back_dobind(lc, op, &rs) ) {
550 op->o_do_not_cache = is_oc;
554 op->o_do_not_cache = is_oc;
558 * Rewrite the search base, if required
560 dc.rwmap = &li->rwmap;
561 #ifdef ENABLE_REWRITE
562 dc.conn = op->o_conn;
564 dc.ctx = "searchBase";
569 if ( ldap_back_dn_massage( &dc, ndn, &mdn ) ) {
574 ldap_back_map(&li->rwmap.rwm_at, &at->ad_cname, &mapped, BACKLDAP_MAP);
575 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
581 is_oc = (strcasecmp("objectclass", mapped.bv_val) == 0);
583 gattr[0] = "objectclass";
584 gattr[1] = mapped.bv_val;
587 gattr[0] = mapped.bv_val;
592 ldap_back_map(&li->rwmap.rwm_oc, &oc->soc_cname, &mapped,
594 filter = ch_malloc(sizeof("(objectclass=)") + mapped.bv_len);
595 ptr = lutil_strcopy(filter, "(objectclass=");
596 ptr = lutil_strcopy(ptr, mapped.bv_val);
601 if (ldap_search_ext_s(lc->ld, mdn.bv_val, LDAP_SCOPE_BASE, filter,
602 gattr, 0, NULL, NULL, LDAP_NO_LIMIT,
603 LDAP_NO_LIMIT, &result) != LDAP_SUCCESS)
608 if ((e = ldap_first_entry(lc->ld, result)) == NULL) {
612 *ent = ch_calloc(1,sizeof(Entry));
614 rc = ldap_build_entry(op, e, *ent, &bdn, LDAP_BUILD_ENTRY_NORMALIZE);
616 if (rc != LDAP_SUCCESS) {
623 ldap_msgfree(result);
630 if ( mdn.bv_val != ndn->bv_val ) {
631 ch_free( mdn.bv_val );