1 /* search.c - monitor backend search function */
3 * Copyright 1998-2003 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(
61 struct monitorinfo *mi =
62 (struct monitorinfo *) op->o_bd->be_private;
63 Entry *e, *e_tmp, *e_ch;
64 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 ( ; e != NULL; ) {
108 mp = ( struct monitorentrypriv * )e->e_private;
110 monitor_entry_update( mi, e );
112 rc = test_filter( op, e, op->oq_search.rs_filter );
113 if ( rc == LDAP_COMPARE_TRUE ) {
115 send_search_entry( op, rs );
118 if ( ( mp->mp_children || MONITOR_HAS_VOLATILE_CH( mp ) )
120 rc = monitor_send_children( op, rs, e, sub );
127 if ( e_tmp != NULL ) {
128 monitor_cache_lock( e_tmp );
130 monitor_cache_release( mi, e );
138 monitor_back_search( Operation *op, SlapReply *rs )
140 struct monitorinfo *mi
141 = (struct monitorinfo *) op->o_bd->be_private;
142 int rc = LDAP_SUCCESS;
143 Entry *e, *matched = NULL;
146 LDAP_LOG( BACK_MON, ENTRY,
147 "monitor_back_search: enter\n", 0, 0, 0 );
149 Debug(LDAP_DEBUG_TRACE, "=> monitor_back_search\n%s%s%s", "", "", "");
153 /* get entry with reader lock */
154 monitor_cache_dn2entry( mi, &op->o_req_ndn, &e, &matched );
156 rs->sr_err = LDAP_NO_SUCH_OBJECT;
158 rs->sr_matched = ch_strdup( matched->e_dn );
159 monitor_cache_release( mi, matched );
162 send_ldap_result( op, rs );
163 rs->sr_matched = NULL;
168 switch ( op->oq_search.rs_scope ) {
169 case LDAP_SCOPE_BASE:
170 monitor_entry_update( mi, e );
171 rc = test_filter( op, e, op->oq_search.rs_filter );
172 if ( rc == LDAP_COMPARE_TRUE ) {
174 send_search_entry( op, rs );
178 monitor_cache_release( mi, e );
181 case LDAP_SCOPE_ONELEVEL:
182 rc = monitor_send_children( op, rs, e, 0 );
189 case LDAP_SCOPE_SUBTREE:
190 monitor_entry_update( mi, e );
191 rc = test_filter( op, e, op->oq_search.rs_filter );
192 if ( rc == LDAP_COMPARE_TRUE ) {
194 send_search_entry( op, rs );
198 rc = monitor_send_children( op, rs, e, 1 );
207 send_ldap_result( op, rs );
209 return( rc == LDAP_SUCCESS ? 0 : 1 );