1999-05-26 10:35:20 +08:00
|
|
|
/* search.c - ldap backend search function */
|
1999-09-09 03:06:24 +08:00
|
|
|
/* $OpenLDAP$ */
|
2001-01-17 15:09:22 +08:00
|
|
|
/*
|
|
|
|
* Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
|
|
|
|
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
|
|
|
|
*/
|
|
|
|
/* This is an altered version */
|
1999-05-26 10:35:20 +08:00
|
|
|
/*
|
|
|
|
* Copyright 1999, Howard Chu, All rights reserved. <hyc@highlandsun.com>
|
|
|
|
*
|
|
|
|
* Permission is granted to anyone to use this software for any purpose
|
|
|
|
* on any computer system, and to alter it and redistribute it, subject
|
|
|
|
* to the following restrictions:
|
|
|
|
*
|
|
|
|
* 1. The author is not responsible for the consequences of use of this
|
|
|
|
* software, no matter how awful, even if they arise from flaws in it.
|
|
|
|
*
|
|
|
|
* 2. The origin of this software must not be misrepresented, either by
|
|
|
|
* explicit claim or by omission. Since few users ever read sources,
|
|
|
|
* credits should appear in the documentation.
|
|
|
|
*
|
|
|
|
* 3. Altered versions must be plainly marked as such, and must not be
|
|
|
|
* misrepresented as being the original software. Since few users
|
|
|
|
* ever read sources, credits should appear in the documentation.
|
|
|
|
*
|
|
|
|
* 4. This notice may not be removed or altered.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "portable.h"
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
#include <ac/socket.h>
|
|
|
|
#include <ac/string.h>
|
1999-05-26 18:45:51 +08:00
|
|
|
#include <ac/time.h>
|
1999-05-26 10:35:20 +08:00
|
|
|
|
|
|
|
#include "slap.h"
|
|
|
|
#include "back-ldap.h"
|
|
|
|
|
1999-09-02 16:05:17 +08:00
|
|
|
static void ldap_send_entry( Backend *be, Operation *op, struct ldapconn *lc,
|
|
|
|
LDAPMessage *e, char **attrs, int attrsonly );
|
|
|
|
|
1999-05-26 10:35:20 +08:00
|
|
|
int
|
|
|
|
ldap_back_search(
|
|
|
|
Backend *be,
|
|
|
|
Connection *conn,
|
|
|
|
Operation *op,
|
2000-05-22 11:55:03 +08:00
|
|
|
const char *base,
|
|
|
|
const char *nbase,
|
1999-05-26 10:35:20 +08:00
|
|
|
int scope,
|
|
|
|
int deref,
|
|
|
|
int size,
|
|
|
|
int time,
|
|
|
|
Filter *filter,
|
2000-05-22 11:55:03 +08:00
|
|
|
const char *filterstr,
|
1999-05-26 10:35:20 +08:00
|
|
|
char **attrs,
|
|
|
|
int attrsonly
|
|
|
|
)
|
|
|
|
{
|
|
|
|
struct ldapinfo *li = (struct ldapinfo *) be->be_private;
|
|
|
|
struct ldapconn *lc;
|
|
|
|
struct timeval tv;
|
|
|
|
LDAPMessage *res, *e;
|
|
|
|
int i, rc, msgid, sres = LDAP_SUCCESS;
|
|
|
|
char *match = NULL, *err = NULL;
|
|
|
|
|
|
|
|
lc = ldap_back_getconn(li, conn, op);
|
|
|
|
if (!lc)
|
|
|
|
return( -1 );
|
|
|
|
|
|
|
|
if (deref != -1)
|
|
|
|
ldap_set_option( lc->ld, LDAP_OPT_DEREF, (void *)&deref);
|
|
|
|
if (time != -1)
|
|
|
|
ldap_set_option( lc->ld, LDAP_OPT_TIMELIMIT, (void *)&time);
|
|
|
|
if (size != -1)
|
|
|
|
ldap_set_option( lc->ld, LDAP_OPT_SIZELIMIT, (void *)&size);
|
|
|
|
if (!lc->bound) {
|
|
|
|
ldap_back_dobind(lc, op);
|
|
|
|
if (!lc->bound)
|
|
|
|
return( -1 );
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((msgid = ldap_search(lc->ld, base, scope, filterstr, attrs,
|
|
|
|
attrsonly)) == -1)
|
|
|
|
fail: return( ldap_back_op_result(lc, op) );
|
|
|
|
|
|
|
|
/* We pull apart the ber result, stuff it into a slapd entry, and
|
|
|
|
* let send_search_entry stuff it back into ber format. Slow & ugly,
|
|
|
|
* but this is necessary for version matching, and for ACL processing.
|
|
|
|
*/
|
|
|
|
|
|
|
|
for (i=0, rc=0; rc != -1;
|
|
|
|
rc = ldap_result(lc->ld, LDAP_RES_ANY, 0, &tv, &res)) {
|
|
|
|
int ab;
|
|
|
|
|
|
|
|
/* check for abandon */
|
|
|
|
ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
|
|
|
|
ab = op->o_abandon;
|
|
|
|
ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
|
|
|
|
|
|
|
|
if (ab) {
|
|
|
|
ldap_abandon(lc->ld, msgid);
|
|
|
|
} else if (rc == 0) {
|
|
|
|
tv.tv_sec = 0;
|
|
|
|
tv.tv_usec = 100000;
|
|
|
|
ldap_pvt_thread_yield();
|
|
|
|
continue;
|
|
|
|
} else if (rc == LDAP_RES_SEARCH_ENTRY) {
|
|
|
|
e = ldap_first_entry(lc->ld,res);
|
|
|
|
ldap_send_entry(be, op, lc, e, attrs, attrsonly);
|
|
|
|
i++;
|
1999-09-02 20:08:43 +08:00
|
|
|
ldap_msgfree(res);
|
1999-05-26 10:35:20 +08:00
|
|
|
} else {
|
|
|
|
sres = ldap_result2error(lc->ld, res, 1);
|
2000-10-23 21:32:14 +08:00
|
|
|
sres = ldap_back_map_result(sres);
|
1999-05-26 10:35:20 +08:00
|
|
|
ldap_get_option(lc->ld, LDAP_OPT_ERROR_STRING, &err);
|
1999-06-06 04:27:43 +08:00
|
|
|
ldap_get_option(lc->ld, LDAP_OPT_MATCHED_DN, &match);
|
1999-05-26 10:35:20 +08:00
|
|
|
rc = 0;
|
|
|
|
}
|
|
|
|
if (ab)
|
|
|
|
return (0);
|
|
|
|
else if (rc == 0)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rc == -1)
|
|
|
|
goto fail;
|
|
|
|
|
1999-07-16 10:45:46 +08:00
|
|
|
send_search_result( conn, op, sres,
|
|
|
|
match, err, NULL, NULL, i );
|
1999-05-26 10:35:20 +08:00
|
|
|
if (match)
|
|
|
|
free(match);
|
|
|
|
if (err)
|
|
|
|
free(err);
|
|
|
|
return( 0 );
|
|
|
|
}
|
|
|
|
|
1999-09-02 16:05:17 +08:00
|
|
|
static void
|
1999-05-26 10:35:20 +08:00
|
|
|
ldap_send_entry(
|
|
|
|
Backend *be,
|
|
|
|
Operation *op,
|
|
|
|
struct ldapconn *lc,
|
|
|
|
LDAPMessage *e,
|
|
|
|
char **attrs,
|
|
|
|
int attrsonly
|
|
|
|
)
|
|
|
|
{
|
|
|
|
char *a;
|
|
|
|
Entry ent;
|
|
|
|
BerElement *ber = NULL;
|
1999-07-26 06:13:52 +08:00
|
|
|
Attribute *attr, **attrp;
|
1999-05-26 10:35:20 +08:00
|
|
|
struct berval *dummy = NULL;
|
2000-06-09 02:36:37 +08:00
|
|
|
const char *text;
|
1999-05-26 10:35:20 +08:00
|
|
|
|
|
|
|
ent.e_dn = ldap_get_dn(lc->ld, e);
|
1999-07-23 01:14:42 +08:00
|
|
|
ent.e_ndn = ch_strdup( ent.e_dn);
|
1999-09-24 09:46:37 +08:00
|
|
|
(void) dn_normalize( ent.e_ndn );
|
1999-05-26 10:35:20 +08:00
|
|
|
ent.e_id = 0;
|
|
|
|
ent.e_attrs = 0;
|
|
|
|
ent.e_private = 0;
|
1999-07-26 06:13:52 +08:00
|
|
|
attrp = &ent.e_attrs;
|
1999-05-26 10:35:20 +08:00
|
|
|
|
2000-06-06 13:21:14 +08:00
|
|
|
for ( a = ldap_first_attribute(lc->ld, e, &ber);
|
|
|
|
a != NULL;
|
|
|
|
a = ldap_next_attribute(lc->ld, e, ber))
|
|
|
|
{
|
1999-07-26 06:13:52 +08:00
|
|
|
attr = (Attribute *)ch_malloc( sizeof(Attribute) );
|
2000-06-06 13:21:14 +08:00
|
|
|
if (attr == NULL)
|
|
|
|
continue;
|
1999-05-26 10:35:20 +08:00
|
|
|
attr->a_next = 0;
|
2001-01-17 14:32:26 +08:00
|
|
|
attr->a_desc = NULL;
|
2000-06-05 07:02:19 +08:00
|
|
|
slap_str2ad(a, &attr->a_desc, &text);
|
1999-05-26 10:35:20 +08:00
|
|
|
attr->a_vals = ldap_get_values_len(lc->ld, e, a);
|
|
|
|
if (!attr->a_vals)
|
|
|
|
attr->a_vals = &dummy;
|
1999-07-26 06:13:52 +08:00
|
|
|
*attrp = attr;
|
|
|
|
attrp = &attr->a_next;
|
1999-05-26 10:35:20 +08:00
|
|
|
}
|
1999-07-24 11:39:23 +08:00
|
|
|
send_search_entry( be, lc->conn, op, &ent, attrs, attrsonly, NULL );
|
1999-05-26 10:35:20 +08:00
|
|
|
for (;ent.e_attrs;) {
|
|
|
|
attr=ent.e_attrs;
|
|
|
|
ent.e_attrs = attr->a_next;
|
2000-06-06 13:21:14 +08:00
|
|
|
ad_free(attr->a_desc, 1);
|
1999-05-26 10:35:20 +08:00
|
|
|
if (attr->a_vals != &dummy)
|
|
|
|
ber_bvecfree(attr->a_vals);
|
|
|
|
free(attr);
|
|
|
|
}
|
|
|
|
if (ber)
|
|
|
|
ber_free(ber,0);
|
|
|
|
}
|