1 /* search.c - ldap backend search function */
4 * Copyright 1998-2003 The OpenLDAP Foundation, All Rights Reserved.
5 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 /* This is an altered version */
9 * Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
11 * Permission is granted to anyone to use this software for any purpose
12 * on any computer system, and to alter it and redistribute it, subject
13 * to the following restrictions:
15 * 1. The author is not responsible for the consequences of use of this
16 * software, no matter how awful, even if they arise from flaws in it.
18 * 2. The origin of this software must not be misrepresented, either by
19 * explicit claim or by omission. Since few users ever read sources,
20 * credits should appear in the documentation.
22 * 3. Altered versions must be plainly marked as such, and must not be
23 * misrepresented as being the original software. Since few users
24 * ever read sources, credits should appear in the documentation.
26 * 4. This notice may not be removed or altered.
30 * Copyright 2000, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
32 * This software is being modified by Pierangelo Masarati.
33 * The previously reported conditions apply to the modified code as well.
34 * Changes in the original code are highlighted where required.
35 * Credits for the original code go to the author, Howard Chu.
42 #include <ac/socket.h>
43 #include <ac/string.h>
47 #include "back-ldap.h"
48 #undef ldap_debug /* silence a warning in ldap-int.h */
49 #include "../../../libraries/libldap/ldap-int.h"
54 ldap_build_entry( Operation *op, LDAPMessage *e, Entry *ent,
55 struct berval *bdn, int flags );
56 #define LDAP_BUILD_ENTRY_PRIVATE 0x01
57 #define LDAP_BUILD_ENTRY_NORMALIZE 0x02
59 static struct berval dummy = { 0, NULL };
66 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
72 char **mapped_attrs = NULL;
74 struct berval mfilter = { 0, NULL };
75 struct slap_limits_set *limit = NULL;
79 lc = ldap_back_getconn(op, rs);
85 * FIXME: in case of values return filter, we might want
86 * to map attrs and maybe rewrite value
88 if ( !ldap_back_dobind( lc, op, rs ) ) {
92 /* if not root, get appropriate limits */
93 if ( be_isroot( op->o_bd, &op->o_ndn ) ) {
96 ( void ) get_limits( op->o_bd, &op->o_ndn, &limit );
99 /* if no time limit requested, rely on remote server limits */
100 /* if requested limit higher than hard limit, abort */
101 if ( !isroot && op->oq_search.rs_tlimit > limit->lms_t_hard ) {
102 /* no hard limit means use soft instead */
103 if ( limit->lms_t_hard == 0
104 && limit->lms_t_soft > -1
105 && op->oq_search.rs_tlimit > limit->lms_t_soft ) {
106 op->oq_search.rs_tlimit = limit->lms_t_soft;
108 /* positive hard limit means abort */
109 } else if ( limit->lms_t_hard > 0 ) {
110 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
115 /* negative hard limit means no limit */
118 /* if no size limit requested, rely on remote server limits */
119 /* if requested limit higher than hard limit, abort */
120 if ( !isroot && op->oq_search.rs_slimit > limit->lms_s_hard ) {
121 /* no hard limit means use soft instead */
122 if ( limit->lms_s_hard == 0
123 && limit->lms_s_soft > -1
124 && op->oq_search.rs_slimit > limit->lms_s_soft ) {
125 op->oq_search.rs_slimit = limit->lms_s_soft;
127 /* positive hard limit means abort */
128 } else if ( limit->lms_s_hard > 0 ) {
129 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
134 /* negative hard limit means no limit */
137 /* should we check return values? */
138 if (op->oq_search.rs_deref != -1)
139 ldap_set_option( lc->ld, LDAP_OPT_DEREF, (void *)&op->oq_search.rs_deref);
140 if (op->oq_search.rs_tlimit != -1) {
141 tv.tv_sec = op->oq_search.rs_tlimit;
148 * Rewrite the search base, if required
150 #ifdef ENABLE_REWRITE
152 dc.conn = op->o_conn;
154 dc.ctx = "searchBase";
160 if ( ldap_back_dn_massage( &dc, &op->o_req_dn, &mbase ) ) {
161 send_ldap_result( op, rs );
165 #ifdef ENABLE_REWRITE
166 rc = ldap_back_filter_map_rewrite_( li->rwinfo, op->o_conn,
167 &li->at_map, &li->oc_map, op->oq_search.rs_filter, &mfilter,
169 #else /* ! ENABLE_REWRITE */
170 rc = ldap_back_filter_map_rewrite_( &li->at_map, &li->oc_map,
171 op->oq_search.rs_filter, &mfilter, BACKLDAP_MAP );
172 #endif /* ! ENABLE_REWRITE */
175 rs->sr_err = LDAP_OTHER;
176 rs->sr_text = "Rewrite error";
181 rs->sr_err = ldap_back_map_attrs( &li->at_map, op->oq_search.rs_attrs,
182 BACKLDAP_MAP, &mapped_attrs );
189 if ( mapped_attrs == NULL && op->oq_search.rs_attrs) {
192 /* this can happen only if ch_calloc() fails
193 * in ldap_back_map_attrs() */
194 for (count=0; op->oq_search.rs_attrs[count].an_name.bv_val; count++);
195 mapped_attrs = ch_malloc( (count+1) * sizeof(char *));
196 for (count=0; op->oq_search.rs_attrs[count].an_name.bv_val; count++) {
197 mapped_attrs[count] = op->oq_search.rs_attrs[count].an_name.bv_val;
199 mapped_attrs[count] = NULL;
203 rs->sr_err = ldap_search_ext(lc->ld, mbase.bv_val,
204 op->oq_search.rs_scope, mfilter.bv_val,
205 mapped_attrs, op->oq_search.rs_attrsonly,
207 tv.tv_sec ? &tv : NULL, op->oq_search.rs_slimit,
209 if ( rs->sr_err != LDAP_SUCCESS ) {
211 rc = ldap_back_op_result(lc, op, rs, msgid, 0);
215 /* We pull apart the ber result, stuff it into a slapd entry, and
216 * let send_search_entry stuff it back into ber format. Slow & ugly,
217 * but this is necessary for version matching, and for ACL processing.
220 for ( rc=0; rc != -1; rc = ldap_result(lc->ld, msgid, 0, &tv, &res))
222 /* check for abandon */
224 ldap_abandon(lc->ld, msgid);
232 ldap_pvt_thread_yield();
234 } else if (rc == LDAP_RES_SEARCH_ENTRY) {
237 e = ldap_first_entry(lc->ld,res);
238 if ( ldap_build_entry(op, e, &ent, &bdn,
239 LDAP_BUILD_ENTRY_PRIVATE) == LDAP_SUCCESS ) {
241 rs->sr_attrs = op->oq_search.rs_attrs;
242 send_search_entry( op, rs );
243 while (ent.e_attrs) {
248 ent.e_attrs = a->a_next;
251 if (a->a_vals != &dummy)
252 ber_bvarray_free(a->a_vals);
254 ber_bvarray_free(a->a_nvals);
258 if ( ent.e_dn && ( ent.e_dn != bdn.bv_val ) )
265 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
266 char **references = NULL;
269 rc = ldap_parse_reference( lc->ld, res,
270 &references, &rs->sr_ctrls, 1 );
272 if ( rc != LDAP_SUCCESS ) {
276 if ( references == NULL ) {
280 for ( cnt = 0; references[ cnt ]; cnt++ )
283 rs->sr_ref = ch_calloc( cnt + 1, sizeof( struct berval ) );
285 for ( cnt = 0; references[ cnt ]; cnt++ ) {
286 rs->sr_ref[ cnt ].bv_val = references[ cnt ];
287 rs->sr_ref[ cnt ].bv_len = strlen( references[ cnt ] );
290 /* ignore return value by now */
291 ( void )send_search_reference( op, rs );
295 ldap_value_free( references );
296 ch_free( rs->sr_ref );
300 if ( rs->sr_ctrls ) {
301 ldap_controls_free( rs->sr_ctrls );
306 rc = ldap_parse_result(lc->ld, res, &rs->sr_err, &match,
307 (char **)&rs->sr_text, NULL, NULL, 1);
308 if (rc != LDAP_SUCCESS ) rs->sr_err = rc;
309 rs->sr_err = ldap_back_map_result(rs);
319 * Rewrite the matched portion of the search base, if required
321 if ( match && *match ) {
322 struct berval dn, mdn;
324 #ifdef ENABLE_REWRITE
325 dc.ctx = "matchedDn";
330 ber_str2bv(match, 0, 0, &dn);
331 ldap_back_dn_massage(&dc, &dn, &mdn);
332 rs->sr_matched = mdn.bv_val;
334 if ( rs->sr_v2ref ) {
335 rs->sr_err = LDAP_REFERRAL;
339 send_ldap_result( op, rs );
342 if ( rs->sr_matched != match ) {
343 free( (char *)rs->sr_matched );
345 rs->sr_matched = NULL;
349 LDAP_FREE( (char *)rs->sr_text );
352 if ( mapped_attrs ) {
353 ch_free( mapped_attrs );
355 if ( mfilter.bv_val != op->oq_search.rs_filterstr.bv_val ) {
356 ch_free( mfilter.bv_val );
358 if ( mbase.bv_val != op->o_req_dn.bv_val ) {
359 free( mbase.bv_val );
374 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
375 struct berval a, mapped;
376 BerElement ber = *e->lm_ber;
377 Attribute *attr, **attrp;
381 int private = flags & LDAP_BUILD_ENTRY_PRIVATE;
382 int normalize = flags & LDAP_BUILD_ENTRY_NORMALIZE;
385 /* safe assumptions ... */
387 ent->e_bv.bv_val = NULL;
389 if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
390 return LDAP_DECODING_ERROR;
394 * Rewrite the dn of the result, if needed
396 #ifdef ENABLE_REWRITE
398 dc.conn = op->o_conn;
400 dc.ctx = "searchResult";
406 if ( ldap_back_dn_massage( &dc, bdn, &ent->e_name ) ) {
411 * Note: this may fail if the target host(s) schema differs
412 * from the one known to the meta, and a DN with unknown
413 * attributes is returned.
415 * FIXME: should we log anything, or delegate to dnNormalize2?
417 if ( dnNormalize2( NULL, &ent->e_name, &ent->e_nname ) != LDAP_SUCCESS ) {
418 return LDAP_INVALID_DN_SYNTAX;
424 attrp = &ent->e_attrs;
426 #ifdef ENABLE_REWRITE
427 dc.ctx = "searchAttrDN";
429 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
430 ldap_back_map(&li->at_map, &a, &mapped, BACKLDAP_REMAP);
431 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0')
433 attr = (Attribute *)ch_malloc( sizeof(Attribute) );
439 if (slap_bv2ad(&mapped, &attr->a_desc, &text) != LDAP_SUCCESS) {
440 if (slap_bv2undef_ad(&mapped, &attr->a_desc, &text)
443 LDAP_LOG( BACK_LDAP, DETAIL1,
444 "slap_bv2undef_ad(%s): %s\n", mapped.bv_val, text, 0 );
445 #else /* !NEW_LOGGING */
446 Debug( LDAP_DEBUG_ANY,
447 "slap_bv2undef_ad(%s): "
448 "%s\n%s", mapped.bv_val, text, "" );
449 #endif /* !NEW_LOGGING */
455 /* no subschemaSubentry */
456 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
459 * We eat target's subschemaSubentry because
460 * a search for this value is likely not
461 * to resolve to the appropriate backend;
462 * later, the local subschemaSubentry is
465 ( void )ber_scanf( &ber, "x" /* [W] */ );
471 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
472 || attr->a_vals == NULL ) {
474 * Note: attr->a_vals can be null when using
475 * values result filter
478 attr->a_vals = &dummy;
480 attr->a_vals = ch_malloc(sizeof(struct berval));
481 attr->a_vals->bv_val = NULL;
482 attr->a_vals->bv_len = 0;
486 for ( last = 0; attr->a_vals[last].bv_val; last++ );
490 } else if ( attr->a_desc == slap_schema.si_ad_objectClass
491 || attr->a_desc == slap_schema.si_ad_structuralObjectClass ) {
492 for ( bv = attr->a_vals; bv->bv_val; bv++ ) {
493 ldap_back_map(&li->oc_map, bv, &mapped,
495 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
496 LBER_FREE(bv->bv_val);
500 *bv = attr->a_vals[last];
501 attr->a_vals[last].bv_val = NULL;
504 } else if ( mapped.bv_val != bv->bv_val ) {
506 * FIXME: after LBER_FREEing
507 * the value is replaced by
510 LBER_FREE(bv->bv_val);
511 ber_dupbv( bv, &mapped );
516 * It is necessary to try to rewrite attributes with
517 * dn syntax because they might be used in ACLs as
518 * members of groups; since ACLs are applied to the
519 * rewritten stuff, no dn-based subject clause could
520 * be used at the ldap backend side (see
521 * http://www.OpenLDAP.org/faq/data/cache/452.html)
522 * The problem can be overcome by moving the dn-based
523 * ACLs to the target directory server, and letting
524 * everything pass thru the ldap backend.
526 } else if ( attr->a_desc->ad_type->sat_syntax ==
527 slap_schema.si_syn_distinguishedName ) {
531 * FIXME: should use ldap_dnattr_rewrite(),
532 * but need a different free() callback ...
535 for ( last = 0; attr->a_vals[last].bv_val; last++ );
537 for ( i = 0; attr->a_vals[i].bv_val; i++ ) {
538 struct berval newval = { 0, NULL };
540 bv = &attr->a_vals[i];
541 switch ( ldap_back_dn_massage( &dc, bv, &newval ) ) {
542 case LDAP_UNWILLING_TO_PERFORM:
543 LBER_FREE( bv->bv_val );
545 *bv = attr->a_vals[last];
547 attr->a_vals[last].bv_val = NULL;
552 if ( newval.bv_val && bv->bv_val != newval.bv_val ) {
553 LBER_FREE( bv->bv_val );
563 if ( normalize && last && attr->a_desc->ad_type->sat_equality &&
564 attr->a_desc->ad_type->sat_equality->smr_normalize ) {
567 attr->a_nvals = ch_malloc((last+1)*sizeof(struct berval));
568 for (i=0; i<last; i++) {
569 attr->a_desc->ad_type->sat_equality->smr_normalize(
570 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
571 attr->a_desc->ad_type->sat_syntax,
572 attr->a_desc->ad_type->sat_equality,
573 &attr->a_vals[i], &attr->a_nvals[i] );
575 attr->a_nvals[i].bv_val = NULL;
576 attr->a_nvals[i].bv_len = 0;
578 attr->a_nvals = attr->a_vals;
581 attrp = &attr->a_next;
583 /* make sure it's free'able */
584 if (!private && ent->e_name.bv_val == bdn->bv_val)
585 ber_dupbv( &ent->e_name, bdn );
589 /* return 0 IFF we can retrieve the entry with ndn
596 AttributeDescription *at,
601 struct ldapinfo *li = (struct ldapinfo *) op->o_bd->be_private;
604 struct berval mapped = { 0, NULL }, bdn, mdn;
605 LDAPMessage *result = NULL, *e = NULL;
612 /* Tell getconn this is a privileged op */
613 is_oc = op->o_do_not_cache;
614 op->o_do_not_cache = 1;
615 lc = ldap_back_getconn(op, &rs);
618 if ( !lc || !ldap_back_dobind(lc, op, &rs) ) {
619 op->o_do_not_cache = is_oc;
623 op->o_do_not_cache = is_oc;
627 * Rewrite the search base, if required
629 #ifdef ENABLE_REWRITE
631 dc.conn = op->o_conn;
633 dc.ctx = "searchBase";
639 if ( ldap_back_dn_massage( &dc, ndn, &mdn ) ) {
643 ldap_back_map(&li->at_map, &at->ad_cname, &mapped, BACKLDAP_MAP);
644 if (mapped.bv_val == NULL || mapped.bv_val[0] == '\0') {
649 is_oc = (strcasecmp("objectclass", mapped.bv_val) == 0);
651 gattr[0] = "objectclass";
652 gattr[1] = mapped.bv_val;
655 gattr[0] = mapped.bv_val;
660 ldap_back_map(&li->oc_map, &oc->soc_cname, &mapped,
662 filter = ch_malloc(sizeof("(objectclass=)") + mapped.bv_len);
663 ptr = lutil_strcopy(filter, "(objectclass=");
664 ptr = lutil_strcopy(ptr, mapped.bv_val);
669 if (ldap_search_ext_s(lc->ld, mdn.bv_val, LDAP_SCOPE_BASE, filter,
670 gattr, 0, NULL, NULL, LDAP_NO_LIMIT,
671 LDAP_NO_LIMIT, &result) != LDAP_SUCCESS)
676 if ((e = ldap_first_entry(lc->ld, result)) == NULL) {
680 *ent = ch_calloc(1,sizeof(Entry));
682 rc = ldap_build_entry(op, e, *ent, &bdn, LDAP_BUILD_ENTRY_NORMALIZE);
684 if (rc != LDAP_SUCCESS) {
691 ldap_msgfree(result);
698 if ( mdn.bv_val != ndn->bv_val ) {
699 ch_free( mdn.bv_val );