1 /* search.c - monitor backend search function */
3 * Copyright 1998-2000 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 * Copyright 2001 The OpenLDAP Foundation, All Rights Reserved.
8 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
10 * Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
12 * This work has beed deveolped for the OpenLDAP Foundation
13 * in the hope that it may be useful to the Open Source community,
14 * but WITHOUT ANY WARRANTY.
16 * Permission is granted to anyone to use this software for any purpose
17 * on any computer system, and to alter it and redistribute it, subject
18 * to the following restrictions:
20 * 1. The author and SysNet s.n.c. are not responsible for the consequences
21 * of use of this software, no matter how awful, even if they arise from
24 * 2. The origin of this software must not be misrepresented, either by
25 * explicit claim or by omission. Since few users ever read sources,
26 * credits should appear in the documentation.
28 * 3. Altered versions must be plainly marked as such, and must not be
29 * misrepresented as being the original software. Since few users
30 * ever read sources, credits should appear in the documentation.
31 * SysNet s.n.c. cannot be responsible for the consequences of the
34 * 4. This notice may not be removed or altered.
41 #include <ac/string.h>
42 #include <ac/socket.h>
45 #include "back-monitor.h"
46 #include "proto-back-monitor.h"
49 monitor_send_children(
61 struct monitorinfo *mi = (struct monitorinfo *) be->be_private;
62 Entry *e, *e_tmp, *e_ch;
63 struct monitorentrypriv *mp;
67 mp = ( struct monitorentrypriv * )e_parent->e_private;
71 if ( MONITOR_HAS_VOLATILE_CH( mp ) ) {
72 monitor_entry_create( mi, NULL, e_parent, &e_ch );
74 monitor_cache_release( mi, e_parent );
76 /* no volatile entries? */
78 /* no persistent entries? return */
83 /* volatile entries */
85 /* if no persistent, return only volatile */
88 monitor_cache_lock( e_ch );
90 /* else append persistent to volatile */
94 mp = ( struct monitorentrypriv * )e_tmp->e_private;
97 if ( e_tmp == NULL ) {
107 for ( nentries = *nentriesp; e != NULL; ) {
108 mp = ( struct monitorentrypriv * )e->e_private;
110 monitor_entry_update( mi, e );
112 rc = test_filter( be, conn, op, e, filter );
113 if ( rc == LDAP_COMPARE_TRUE ) {
114 send_search_entry( be, conn, op, e,
115 attrs, attrsonly, NULL );
119 if ( ( mp->mp_children || MONITOR_HAS_VOLATILE_CH( mp ) )
121 rc = monitor_send_children( be, conn, op, filter,
130 if ( e_tmp != NULL ) {
131 monitor_cache_lock( e_tmp );
133 monitor_cache_release( mi, e );
146 struct berval *nbase,
152 struct berval *filterstr,
153 AttributeName *attrs,
157 struct monitorinfo *mi = (struct monitorinfo *) be->be_private;
159 Entry *e, *matched = NULL;
163 LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
164 "monitor_back_search: enter\n" ));
166 Debug(LDAP_DEBUG_TRACE, "=> monitor_back_search\n%s%s%s", "", "", "");
170 /* get entry with reader lock */
171 monitor_cache_dn2entry( mi, nbase, &e, &matched );
173 send_ldap_result( conn, op, LDAP_NO_SUCH_OBJECT,
174 matched ? matched->e_dn : NULL,
177 monitor_cache_release( mi, matched );
185 case LDAP_SCOPE_BASE:
186 monitor_entry_update( mi, e );
187 rc = test_filter( be, conn, op, e, filter );
188 if ( rc == LDAP_COMPARE_TRUE ) {
189 send_search_entry( be, conn, op, e, attrs,
193 monitor_cache_release( mi, e );
196 case LDAP_SCOPE_ONELEVEL:
197 rc = monitor_send_children( be, conn, op, filter,
206 case LDAP_SCOPE_SUBTREE:
207 monitor_entry_update( mi, e );
208 rc = test_filter( be, conn, op, e, filter );
209 if ( rc == LDAP_COMPARE_TRUE ) {
210 send_search_entry( be, conn, op, e, attrs,
215 rc = monitor_send_children( be, conn, op, filter,
225 send_search_result( conn, op, LDAP_SUCCESS,
226 NULL, NULL, NULL, NULL, nentries );