1 /* search.c - monitor backend search function */
3 * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 * Copyright 2001, Pierangelo Masarati, All rights reserved. <ando@sys-net.it>
9 * This work has beed deveolped for the OpenLDAP Foundation
10 * in the hope that it may be useful to the Open Source community,
11 * but WITHOUT ANY WARRANTY.
13 * Permission is granted to anyone to use this software for any purpose
14 * on any computer system, and to alter it and redistribute it, subject
15 * to the following restrictions:
17 * 1. The author and SysNet s.n.c. are not responsible for the consequences
18 * of use of this software, no matter how awful, even if they arise from
21 * 2. The origin of this software must not be misrepresented, either by
22 * explicit claim or by omission. Since few users ever read sources,
23 * credits should appear in the documentation.
25 * 3. Altered versions must be plainly marked as such, and must not be
26 * misrepresented as being the original software. Since few users
27 * ever read sources, credits should appear in the documentation.
28 * SysNet s.n.c. cannot be responsible for the consequences of the
31 * 4. This notice may not be removed or altered.
38 #include <ac/string.h>
39 #include <ac/socket.h>
42 #include "back-monitor.h"
43 #include "proto-back-monitor.h"
46 monitor_send_children(
58 struct monitorinfo *mi = (struct monitorinfo *) be->be_private;
59 Entry *e, *e_tmp, *e_ch;
60 struct monitorentrypriv *mp;
64 mp = ( struct monitorentrypriv * )e_parent->e_private;
68 if ( MONITOR_HAS_VOLATILE_CH( mp ) ) {
69 monitor_entry_create( mi, NULL, e_parent, &e_ch );
71 monitor_cache_release( mi, e_parent );
73 /* no volatile entries? */
75 /* no persistent entries? return */
80 /* volatile entries */
82 /* if no persistent, return only volatile */
85 monitor_cache_lock( e_ch );
87 /* else append persistent to volatile */
91 mp = ( struct monitorentrypriv * )e_tmp->e_private;
94 if ( e_tmp == NULL ) {
104 for ( nentries = *nentriesp; e != NULL; ) {
105 mp = ( struct monitorentrypriv * )e->e_private;
107 monitor_entry_update( mi, e );
109 rc = test_filter( be, conn, op, e, filter );
110 if ( rc == LDAP_COMPARE_TRUE ) {
111 send_search_entry( be, conn, op, e,
112 attrs, attrsonly, NULL );
116 if ( ( mp->mp_children || MONITOR_HAS_VOLATILE_CH( mp ) )
118 rc = monitor_send_children( be, conn, op, filter,
127 if ( e_tmp != NULL ) {
128 monitor_cache_lock( e_tmp );
130 monitor_cache_release( mi, e );
143 struct berval *nbase,
149 struct berval *filterstr,
150 AttributeName *attrs,
154 struct monitorinfo *mi = (struct monitorinfo *) be->be_private;
156 Entry *e, *matched = NULL;
160 LDAP_LOG( BACK_MON, ENTRY,
161 "monitor_back_search: enter\n", 0, 0, 0 );
163 Debug(LDAP_DEBUG_TRACE, "=> monitor_back_search\n%s%s%s", "", "", "");
167 /* get entry with reader lock */
168 monitor_cache_dn2entry( mi, nbase, &e, &matched );
170 send_ldap_result( conn, op, LDAP_NO_SUCH_OBJECT,
171 matched ? matched->e_dn : NULL,
174 monitor_cache_release( mi, matched );
182 case LDAP_SCOPE_BASE:
183 monitor_entry_update( mi, e );
184 rc = test_filter( be, conn, op, e, filter );
185 if ( rc == LDAP_COMPARE_TRUE ) {
186 send_search_entry( be, conn, op, e, attrs,
190 monitor_cache_release( mi, e );
193 case LDAP_SCOPE_ONELEVEL:
194 rc = monitor_send_children( be, conn, op, filter,
203 case LDAP_SCOPE_SUBTREE:
204 monitor_entry_update( mi, e );
205 rc = test_filter( be, conn, op, e, filter );
206 if ( rc == LDAP_COMPARE_TRUE ) {
207 send_search_entry( be, conn, op, e, attrs,
212 rc = monitor_send_children( be, conn, op, filter,
222 send_search_result( conn, op, LDAP_SUCCESS,
223 NULL, NULL, NULL, NULL, nentries );