1 /* search.c - ldap backend search function */
4 * Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
6 * Permission is granted to anyone to use this software for any purpose
7 * on any computer system, and to alter it and redistribute it, subject
8 * to the following restrictions:
10 * 1. The author is not responsible for the consequences of use of this
11 * software, no matter how awful, even if they arise from flaws in it.
13 * 2. The origin of this software must not be misrepresented, either by
14 * explicit claim or by omission. Since few users ever read sources,
15 * credits should appear in the documentation.
17 * 3. Altered versions must be plainly marked as such, and must not be
18 * misrepresented as being the original software. Since few users
19 * ever read sources, credits should appear in the documentation.
21 * 4. This notice may not be removed or altered.
28 #include <ac/socket.h>
29 #include <ac/string.h>
32 #include "back-ldap.h"
50 struct ldapinfo *li = (struct ldapinfo *) be->be_private;
54 int i, rc, msgid, sres = LDAP_SUCCESS;
55 char *match = NULL, *err = NULL;
57 lc = ldap_back_getconn(li, conn, op);
62 ldap_set_option( lc->ld, LDAP_OPT_DEREF, (void *)&deref);
64 ldap_set_option( lc->ld, LDAP_OPT_TIMELIMIT, (void *)&time);
66 ldap_set_option( lc->ld, LDAP_OPT_SIZELIMIT, (void *)&size);
68 ldap_back_dobind(lc, op);
73 if ((msgid = ldap_search(lc->ld, base, scope, filterstr, attrs,
75 fail: return( ldap_back_op_result(lc, op) );
77 /* We pull apart the ber result, stuff it into a slapd entry, and
78 * let send_search_entry stuff it back into ber format. Slow & ugly,
79 * but this is necessary for version matching, and for ACL processing.
82 for (i=0, rc=0; rc != -1;
83 rc = ldap_result(lc->ld, LDAP_RES_ANY, 0, &tv, &res)) {
86 /* check for abandon */
87 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
89 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
92 ldap_abandon(lc->ld, msgid);
96 ldap_pvt_thread_yield();
98 } else if (rc == LDAP_RES_SEARCH_ENTRY) {
99 e = ldap_first_entry(lc->ld,res);
100 ldap_send_entry(be, op, lc, e, attrs, attrsonly);
103 sres = ldap_result2error(lc->ld, res, 1);
104 ldap_get_option(lc->ld, LDAP_OPT_ERROR_STRING, &err);
105 ldap_get_option(lc->ld, LDAP_OPT_MATCH_STRING, &match);
118 send_ldap_search_result( conn, op, sres, match, err, i );
137 BerElement *ber = NULL;
139 struct berval *dummy = NULL;
141 ent.e_dn = ldap_get_dn(lc->ld, e);
142 ent.e_ndn = dn_normalize_case( ch_strdup( ent.e_dn));
146 attr = (Attribute *)4;
147 attr = (Attribute *)((long)&ent.e_attrs - ((long)&attr->a_next-4));
149 for (a = ldap_first_attribute(lc->ld, e, &ber); a;
150 a = ldap_next_attribute(lc->ld, e, ber)) {
151 attr->a_next = (Attribute *)ch_malloc( sizeof(Attribute) );
154 attr->a_type = ch_strdup(a);
155 attr->a_syntax = attr_syntax(a);
156 attr->a_vals = ldap_get_values_len(lc->ld, e, a);
158 attr->a_vals = &dummy;
160 send_search_entry( be, lc->conn, op, &ent, attrs, attrsonly );
161 for (;ent.e_attrs;) {
163 ent.e_attrs = attr->a_next;
165 if (attr->a_vals != &dummy)
166 ber_bvecfree(attr->a_vals);