]> git.sur5r.net Git - openldap/blob - servers/slapd/back-bdb/search.c
ca4b755e2cb26cc30123d2b5d883c2acd3336cc2
[openldap] / servers / slapd / back-bdb / search.c
1 /* search.c - search operation */
2 /* $OpenLDAP$ */
3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4  *
5  * Copyright 2000-2004 The OpenLDAP Foundation.
6  * All rights reserved.
7  *
8  * Redistribution and use in source and binary forms, with or without
9  * modification, are permitted only as authorized by the OpenLDAP
10  * Public License.
11  *
12  * A copy of this license is available in the file LICENSE in the
13  * top-level directory of the distribution or, alternatively, at
14  * <http://www.OpenLDAP.org/license.html>.
15  */
16
17 #include "portable.h"
18
19 #include <stdio.h>
20 #include <ac/string.h>
21
22 #include "back-bdb.h"
23 #include "idl.h"
24 #include "external.h"
25
26 static int base_candidate(
27         BackendDB       *be,
28         Entry   *e,
29         ID              *ids );
30
31 static int search_candidates(
32         Operation *stackop,     /* op with the current threadctx/slab cache */
33         Operation *sop,         /* search op */
34         SlapReply *rs,
35         Entry *e,
36         u_int32_t locker,
37         ID      *ids,
38         ID      *scopes );
39
40 static void send_pagerequest_response( 
41         Operation *op,
42         SlapReply *rs,
43         ID  lastid,
44         int tentries );
45
46 /* Dereference aliases for a single alias entry. Return the final
47  * dereferenced entry on success, NULL on any failure.
48  */
49 static Entry * deref_base (
50         Operation *op,
51         SlapReply *rs,
52         Entry *e,
53         Entry **matched,
54         u_int32_t locker,
55         DB_LOCK *lock,
56         ID      *tmp,
57         ID      *visited )
58 {
59         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
60         struct berval ndn;
61         EntryInfo *ei;
62         DB_LOCK lockr;
63
64         rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
65         rs->sr_text = "maximum deref depth exceeded";
66
67         while (BDB_IDL_N(tmp) < op->o_bd->be_max_deref_depth) {
68
69                 /* Remember the last entry we looked at, so we can
70                  * report broken links
71                  */
72                 *matched = e;
73
74                 /* If this is part of a subtree or onelevel search,
75                  * have we seen this ID before? If so, quit.
76                  */
77                 if ( visited && bdb_idl_insert( visited, e->e_id ) ) {
78                         e = NULL;
79                         break;
80                 }
81
82                 /* If we've seen this ID during this deref iteration,
83                  * we've hit a loop.
84                  */
85                 if ( bdb_idl_insert( tmp, e->e_id ) ) {
86                         rs->sr_err = LDAP_ALIAS_PROBLEM;
87                         rs->sr_text = "circular alias";
88                         e = NULL;
89                         break;
90                 }
91
92                 /* If there was a problem getting the aliasedObjectName,
93                  * get_alias_dn will have set the error status.
94                  */
95                 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
96                         e = NULL;
97                         break;
98                 }
99
100                 rs->sr_err = bdb_dn2entry( op, NULL, &ndn, &ei,
101                         0, locker, &lockr );
102
103                 if ( ei ) e = ei->bei_e;
104                 else    e = NULL;
105
106                 if (!e) {
107                         rs->sr_err = LDAP_ALIAS_PROBLEM;
108                         rs->sr_text = "aliasedObject not found";
109                         break;
110                 }
111
112                 /* Free the previous entry, continue to work with the
113                  * one we just retrieved.
114                  */
115                 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
116                         *matched, lock);
117                 *lock = lockr;
118
119                 /* We found a regular entry. Return this to the caller. The
120                  * entry is still locked for Read.
121                  */
122                 if (!is_entry_alias(e)) {
123                         rs->sr_err = LDAP_SUCCESS;
124                         rs->sr_text = NULL;
125                         break;
126                 }
127         }
128         return e;
129 }
130
131 /* Look for and dereference all aliases within the search scope. Adds
132  * the dereferenced entries to the "ids" list. Requires "stack" to be
133  * able to hold 8 levels of DB_SIZE IDLs. Of course we're hardcoded to
134  * require a minimum of 8 UM_SIZE IDLs so this is never a problem.
135  */
136 static int search_aliases(
137         Operation *op,
138         SlapReply *rs,
139         Entry *e,
140         u_int32_t locker,
141         ID *ids,
142         ID *scopes,
143         ID *stack
144 )
145 {
146         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
147         ID *aliases, *curscop, *subscop, *visited, *newsubs, *oldsubs, *tmp;
148         ID cursora, ida, cursoro, ido, *subscop2;
149         Entry *matched, *a;
150         EntryInfo *ei;
151         struct berval bv_alias = { sizeof("alias")-1, "alias" };
152         AttributeAssertion aa_alias;
153         Filter  af;
154         DB_LOCK locka, lockr;
155         int first = 1;
156
157         aliases = stack;        /* IDL of all aliases in the database */
158         curscop = aliases + BDB_IDL_DB_SIZE;    /* Aliases in the current scope */
159         subscop = curscop + BDB_IDL_DB_SIZE;    /* The current scope */
160         visited = subscop + BDB_IDL_DB_SIZE;    /* IDs we've seen in this search */
161         newsubs = visited + BDB_IDL_DB_SIZE;    /* New subtrees we've added */
162         oldsubs = newsubs + BDB_IDL_DB_SIZE;    /* Subtrees added previously */
163         tmp = oldsubs + BDB_IDL_DB_SIZE;        /* Scratch space for deref_base() */
164
165         /* A copy of subscop, because subscop gets clobbered by
166          * the bdb_idl_union/intersection routines
167          */
168         subscop2 = tmp + BDB_IDL_DB_SIZE;
169
170         af.f_choice = LDAP_FILTER_EQUALITY;
171         af.f_ava = &aa_alias;
172         af.f_av_desc = slap_schema.si_ad_objectClass;
173         af.f_av_value = bv_alias;
174         af.f_next = NULL;
175
176         /* Find all aliases in database */
177         BDB_IDL_ZERO( aliases );
178         rs->sr_err = bdb_filter_candidates( op, &af, aliases,
179                 curscop, visited );
180         if (rs->sr_err != LDAP_SUCCESS) {
181                 return rs->sr_err;
182         }
183         oldsubs[0] = 1;
184         oldsubs[1] = e->e_id;
185
186         BDB_IDL_ZERO( ids );
187         BDB_IDL_ZERO( visited );
188         BDB_IDL_ZERO( newsubs );
189
190         cursoro = 0;
191         ido = bdb_idl_first( oldsubs, &cursoro );
192
193         for (;;) {
194                 /* Set curscop to only the aliases in the current scope. Start with
195                  * all the aliases, obtain the IDL for the current scope, and then
196                  * get the intersection of these two IDLs. Add the current scope
197                  * to the cumulative list of candidates.
198                  */
199                 BDB_IDL_CPY( curscop, aliases );
200                 rs->sr_err = bdb_dn2idl( op, e, subscop,
201                                         subscop2+BDB_IDL_DB_SIZE );
202                 if (first) {
203                         first = 0;
204                 } else {
205                         bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache, e, &locka);
206                 }
207                 BDB_IDL_CPY(subscop2, subscop);
208                 rs->sr_err = bdb_idl_intersection(curscop, subscop);
209                 bdb_idl_union( ids, subscop2 );
210
211                 /* Dereference all of the aliases in the current scope. */
212                 cursora = 0;
213                 for (ida = bdb_idl_first(curscop, &cursora); ida != NOID;
214                         ida = bdb_idl_next(curscop, &cursora))
215                 {
216                         ei = NULL;
217                         rs->sr_err = bdb_cache_find_id(op, NULL,
218                                 ida, &ei, 0, locker, &lockr );
219                         if (rs->sr_err != LDAP_SUCCESS) {
220                                 continue;
221                         }
222                         a = ei->bei_e;
223
224                         /* This should only happen if the curscop IDL has maxed out and
225                          * turned into a range that spans IDs indiscriminately
226                          */
227                         if (!is_entry_alias(a)) {
228                                 bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
229                                         a, &lockr);
230                                 continue;
231                         }
232
233                         /* Actually dereference the alias */
234                         BDB_IDL_ZERO(tmp);
235                         a = deref_base( op, rs, a, &matched, locker, &lockr,
236                                 tmp, visited );
237                         if (a) {
238                                 /* If the target was not already in our current candidates,
239                                  * make note of it in the newsubs list. Also
240                                  * set it in the scopes list so that bdb_search
241                                  * can check it.
242                                  */
243                                 if (bdb_idl_insert(ids, a->e_id) == 0) {
244                                         bdb_idl_insert(newsubs, a->e_id);
245                                         bdb_idl_insert(scopes, a->e_id);
246                                 }
247                                 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
248                                         a, &lockr);
249
250                         } else if (matched) {
251                                 /* Alias could not be dereferenced, or it deref'd to
252                                  * an ID we've already seen. Ignore it.
253                                  */
254                                 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache,
255                                         matched, &lockr );
256                                 rs->sr_text = NULL;
257                         }
258                 }
259                 /* If this is a OneLevel search, we're done; oldsubs only had one
260                  * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
261                  */
262                 if (op->ors_scope != LDAP_SCOPE_SUBTREE) break;
263 nextido:
264                 ido = bdb_idl_next( oldsubs, &cursoro );
265                 
266                 /* If we're done processing the old scopes, did we add any new
267                  * scopes in this iteration? If so, go back and do those now.
268                  */
269                 if (ido == NOID) {
270                         if (BDB_IDL_IS_ZERO(newsubs)) break;
271                         BDB_IDL_CPY(oldsubs, newsubs);
272                         BDB_IDL_ZERO(newsubs);
273                         cursoro = 0;
274                         ido = bdb_idl_first( oldsubs, &cursoro );
275                 }
276
277                 /* Find the entry corresponding to the next scope. If it can't
278                  * be found, ignore it and move on. This should never happen;
279                  * we should never see the ID of an entry that doesn't exist.
280                  * Set the name so that the scope's IDL can be retrieved.
281                  */
282                 ei = NULL;
283                 rs->sr_err = bdb_cache_find_id(op, NULL, ido, &ei,
284                         0, locker, &locka );
285                 if ( rs->sr_err != LDAP_SUCCESS ) goto nextido;
286                 e = ei->bei_e;
287         }
288         return rs->sr_err;
289 }
290
291 static
292 int is_sync_protocol( Operation *op )
293 {
294         if ( op->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST )
295                 return 1;
296         return 0;
297 }
298         
299 #define IS_BDB_REPLACE(type) (( type == LDAP_PSEARCH_BY_DELETE ) || \
300         ( type == LDAP_PSEARCH_BY_SCOPEOUT ))
301 #define IS_PSEARCH (op != sop)
302
303 static Operation *
304 bdb_drop_psearch( Operation *op, ber_int_t msgid )
305 {
306         Operation       *ps_list;
307         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
308
309         LDAP_LIST_FOREACH ( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
310                 if ( ps_list->o_connid == op->o_connid ) {
311                         if ( ps_list->o_msgid == msgid ) {
312                                 ps_list->o_abandon = 1;
313                                 LDAP_LIST_REMOVE( ps_list, o_ps_link );
314                                 ldap_pvt_thread_mutex_lock( &op->o_conn->c_mutex );
315                                 LDAP_STAILQ_REMOVE( &op->o_conn->c_ops, ps_list,
316                                         slap_op, o_next );
317                                 LDAP_STAILQ_NEXT( ps_list, o_next ) = NULL;
318                                 op->o_conn->c_n_ops_executing--;
319                                 op->o_conn->c_n_ops_completed++;
320                                 ldap_pvt_thread_mutex_unlock( &op->o_conn->c_mutex );
321                                 return ps_list;
322                         }
323                 }
324         }
325
326         return NULL;
327 }
328
329 int
330 bdb_abandon( Operation *op, SlapReply *rs )
331 {
332         Operation       *ps;
333
334         ps = bdb_drop_psearch( op, op->oq_abandon.rs_msgid );
335         if ( ps ) {
336                 if ( ps->o_tmpmemctx ) {
337                         sl_mem_destroy( NULL, ps->o_tmpmemctx );
338                 }
339                 slap_op_free ( ps );
340                 return LDAP_SUCCESS;
341         }
342         return LDAP_UNAVAILABLE;
343 }
344
345 int
346 bdb_cancel( Operation *op, SlapReply *rs )
347 {
348         Operation       *ps;
349
350         ps = bdb_drop_psearch( op, op->oq_cancel.rs_msgid );
351         if ( ps ) {
352                 rs->sr_err = LDAP_CANCELLED;
353                 send_ldap_result( ps, rs );
354                 if ( ps->o_tmpmemctx ) {
355                         sl_mem_destroy( NULL, ps->o_tmpmemctx );
356                 }
357                 slap_op_free ( ps );
358                 return LDAP_SUCCESS;
359         }
360         return LDAP_UNAVAILABLE;
361 }
362
363 int bdb_search( Operation *op, SlapReply *rs )
364 {
365         return bdb_do_search( op, rs, op, NULL, 0 );
366 }
367
368 /* For persistent searches, op is the currently executing operation,
369  * sop is the persistent search. For regular searches, sop = op.
370  */
371 int
372 bdb_do_search( Operation *op, SlapReply *rs, Operation *sop,
373         Entry *ps_e, int ps_type )
374 {
375         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
376         time_t          stoptime;
377         ID              id, cursor;
378         ID              candidates[BDB_IDL_UM_SIZE];
379         ID              scopes[BDB_IDL_DB_SIZE];
380         Entry           *e = NULL, base;
381         Entry   *matched = NULL;
382         EntryInfo       *ei;
383         struct berval   realbase = { 0, NULL };
384         int             manageDSAit;
385         int             tentries = 0;
386         ID              lastid = NOID;
387         AttributeName   *attrs;
388
389         Filter contextcsnand, contextcsnle, cookief, csnfnot,
390                 csnfeq, csnfand, csnfge;
391         AttributeAssertion aa_ge, aa_eq, aa_le;
392         int             entry_count = 0;
393         struct berval *search_context_csn = NULL;
394         DB_LOCK         ctxcsn_lock;
395         LDAPControl     *ctrls[SLAP_MAX_RESPONSE_CONTROLS];
396         int             num_ctrls = 0;
397         AttributeName   uuid_attr[2];
398         int             rc_sync = 0;
399         int             entry_sync_state = -1;
400         AttributeName   null_attr;
401         int             no_sync_state_change = 0;
402         struct slap_limits_set *limit = NULL;
403         int isroot = 0;
404
405         u_int32_t       locker = 0;
406         DB_LOCK         lock;
407
408         Operation       *ps_list;
409         int                     sync_send_present_mode = 1;
410         int                     match;
411         MatchingRule *mr;
412         const char *text;
413         int                     slog_found = 0;
414
415         BerVarray       syncUUID_set = NULL;
416         int                     syncUUID_set_cnt = 0;
417
418 #ifdef NEW_LOGGING
419         LDAP_LOG( OPERATION, ENTRY, "bdb_search\n", 0, 0, 0 );
420 #else
421         Debug( LDAP_DEBUG_TRACE, "=> bdb_search\n",
422                 0, 0, 0);
423 #endif
424         attrs = sop->oq_search.rs_attrs;
425
426         if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST ) {
427                 struct slap_session_entry *sent;
428                 if ( sop->o_sync_state.sid >= 0 ) {
429                         LDAP_LIST_FOREACH( sent, &bdb->bi_session_list, se_link ) {
430                                 if ( sent->se_id == sop->o_sync_state.sid ) {
431                                         sop->o_sync_slog_size = sent->se_size;
432                                         break;
433                                 }
434                         }
435                 }
436         }
437
438         /* psearch needs to be registered before refresh begins */
439         /* psearch and refresh transmission is serialized in send_ldap_ber() */
440         if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
441                 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
442                 LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
443                 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
444
445         } else if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH_AND_PERSIST
446                 && sop->o_sync_slog_size >= 0 )
447         {
448                 ldap_pvt_thread_rdwr_wlock( &bdb->bi_pslist_rwlock );
449                 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
450                         if ( ps_list->o_sync_slog_size >= 0 ) {
451                                 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
452                                         slog_found = 1;
453                                         break;
454                                 }
455                         }
456                 }
457
458                 if ( slog_found ) {
459                         if ( ps_list->o_sync_slog_omitcsn.bv_len != 0 ) {
460                                 mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
461                                 if ( sop->o_sync_state.ctxcsn &&
462                                         sop->o_sync_state.ctxcsn->bv_val != NULL )
463                                 {
464                                         value_match( &match, slap_schema.si_ad_entryCSN, mr,
465                                                 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
466                                                 sop->o_sync_state.ctxcsn,
467                                                 &ps_list->o_sync_slog_omitcsn,
468                                                 &text );
469                                 } else {
470                                         match = -1;
471                                 }
472                                 if ( match >= 0 ) {
473                                         sync_send_present_mode = 0;
474                                 }
475                         } else {
476                                 sync_send_present_mode = 0;
477                         }
478                 } else if ( sop->o_sync_slog_size >= 0 ) {
479                         LDAP_LIST_INSERT_HEAD( &bdb->bi_psearch_list, sop, o_ps_link );
480                 } else {
481                         sop->o_sync_state.sid = -1;
482                 }
483                 ldap_pvt_thread_rdwr_wunlock( &bdb->bi_pslist_rwlock );
484         }
485
486         null_attr.an_desc = NULL;
487         null_attr.an_oc = NULL;
488         null_attr.an_oc_exclude = 0;
489         null_attr.an_name.bv_len = 0;
490         null_attr.an_name.bv_val = NULL;
491
492         for( num_ctrls = 0; num_ctrls < SLAP_MAX_RESPONSE_CONTROLS; num_ctrls++ ) {
493                 ctrls[num_ctrls] = NULL;
494         }
495         num_ctrls = 0;
496
497         if ( IS_PSEARCH && IS_BDB_REPLACE(ps_type)) {
498                 attrs = uuid_attr;
499                 attrs[0].an_desc = NULL;
500                 attrs[0].an_oc = NULL;
501                 attrs[0].an_oc_exclude = 0;
502                 attrs[0].an_name.bv_len = 0;
503                 attrs[0].an_name.bv_val = NULL;
504         }
505
506         manageDSAit = get_manageDSAit( sop );
507
508         /* Sync control overrides manageDSAit */
509         if ( !IS_PSEARCH && sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
510                 if ( manageDSAit == SLAP_NO_CONTROL ) {
511                         manageDSAit = SLAP_CRITICAL_CONTROL;
512                 }
513         } else if ( IS_PSEARCH ) {
514                 if ( manageDSAit == SLAP_NO_CONTROL ) {
515                         manageDSAit = SLAP_CRITICAL_CONTROL;
516                 }
517         }
518
519         rs->sr_err = LOCK_ID( bdb->bi_dbenv, &locker );
520
521         switch(rs->sr_err) {
522         case 0:
523                 break;
524         default:
525                 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
526                 return rs->sr_err;
527         }
528
529         if ( sop->o_req_ndn.bv_len == 0 ) {
530                 /* DIT root special case */
531                 e = (Entry *) &slap_entry_root;
532                 rs->sr_err = LDAP_SUCCESS;
533         } else {
534 dn2entry_retry:
535                 /* get entry with reader lock */
536                 rs->sr_err = bdb_dn2entry( op, NULL, &sop->o_req_ndn, &ei,
537                         1, locker, &lock );
538         }
539
540         switch(rs->sr_err) {
541         case DB_NOTFOUND:
542                 matched = ei->bei_e;
543                 break;
544         case 0:
545                 e = ei->bei_e;
546                 break;
547         case LDAP_BUSY:
548                 send_ldap_error( sop, rs, LDAP_BUSY, "ldap server busy" );
549                 LOCK_ID_FREE (bdb->bi_dbenv, locker );
550                 return LDAP_BUSY;
551         case DB_LOCK_DEADLOCK:
552         case DB_LOCK_NOTGRANTED:
553                 goto dn2entry_retry;
554         default:
555                 send_ldap_error( sop, rs, LDAP_OTHER, "internal error" );
556                 LOCK_ID_FREE (bdb->bi_dbenv, locker );
557                 return rs->sr_err;
558         }
559
560         if ( e && (op->ors_deref & LDAP_DEREF_FINDING) && is_entry_alias(e) ) {
561                 BDB_IDL_ZERO(candidates);
562                 e = deref_base( op, rs, e, &matched, locker, &lock,
563                         candidates, NULL );
564         }
565
566         if ( e == NULL ) {
567                 struct berval matched_dn = { 0, NULL };
568
569                 if ( matched != NULL ) {
570                         BerVarray erefs;
571                         ber_dupbv( &matched_dn, &matched->e_name );
572
573                         erefs = is_entry_referral( matched )
574                                 ? get_entry_referrals( op, matched )
575                                 : NULL;
576
577                         bdb_cache_return_entry_r (bdb->bi_dbenv, &bdb->bi_cache,
578                                 matched, &lock);
579                         matched = NULL;
580
581                         if( erefs ) {
582                                 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
583                                         &sop->o_req_dn, sop->oq_search.rs_scope );
584                                 ber_bvarray_free( erefs );
585                         }
586
587                 } else {
588                         rs->sr_ref = referral_rewrite( default_referral,
589                                 NULL, &sop->o_req_dn, sop->oq_search.rs_scope );
590                 }
591
592                 rs->sr_err = LDAP_REFERRAL;
593                 rs->sr_matched = matched_dn.bv_val;
594                 send_ldap_result( sop, rs );
595
596                 LOCK_ID_FREE (bdb->bi_dbenv, locker );
597                 if ( rs->sr_ref ) {
598                         ber_bvarray_free( rs->sr_ref );
599                         rs->sr_ref = NULL;
600                 }
601                 if ( matched_dn.bv_val ) {
602                         ber_memfree( matched_dn.bv_val );
603                         rs->sr_matched = NULL;
604                 }
605                 return rs->sr_err;
606         }
607
608         if ( !manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
609                 /* entry is a referral, don't allow add */
610                 struct berval matched_dn;
611                 BerVarray erefs;
612                 
613                 ber_dupbv( &matched_dn, &e->e_name );
614                 erefs = get_entry_referrals( op, e );
615
616                 bdb_cache_return_entry_r( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
617                 e = NULL;
618
619                 if( erefs ) {
620                         rs->sr_ref = referral_rewrite( erefs, &matched_dn,
621                                 &sop->o_req_dn, sop->oq_search.rs_scope );
622                         ber_bvarray_free( erefs );
623                 }
624
625 #ifdef NEW_LOGGING
626                 LDAP_LOG ( OPERATION, RESULTS, 
627                         "bdb_search: entry is referral\n", 0, 0, 0 );
628 #else
629                 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
630                         0, 0, 0 );
631 #endif
632
633                 if (!rs->sr_ref) rs->sr_text = "bad_referral object";
634                 rs->sr_err = LDAP_REFERRAL;
635                 rs->sr_matched = matched_dn.bv_val;
636                 send_ldap_result( sop, rs );
637
638                 LOCK_ID_FREE (bdb->bi_dbenv, locker );
639                 ber_bvarray_free( rs->sr_ref );
640                 rs->sr_ref = NULL;
641                 ber_memfree( matched_dn.bv_val );
642                 rs->sr_matched = NULL;
643                 return 1;
644         }
645
646         if ( get_assert( op ) &&
647                 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
648         {
649                 rs->sr_err = LDAP_ASSERTION_FAILED;
650                 send_ldap_result( sop, rs );
651                 return 1;
652         }
653
654         /* if not root, get appropriate limits */
655         if ( be_isroot( op->o_bd, &sop->o_ndn ) ) {
656                 isroot = 1;
657         } else {
658                 ( void ) get_limits( op, &sop->o_ndn, &limit );
659         }
660
661         /* The time/size limits come first because they require very little
662          * effort, so there's no chance the candidates are selected and then 
663          * the request is not honored only because of time/size constraints
664          */
665
666         /* if no time limit requested, use soft limit (unless root!) */
667         if ( isroot ) {
668                 if ( sop->oq_search.rs_tlimit == 0 ) {
669                         sop->oq_search.rs_tlimit = -1;  /* allow root to set no limit */
670                 }
671
672                 if ( sop->oq_search.rs_slimit == 0 ) {
673                         sop->oq_search.rs_slimit = -1;
674                 }
675
676         } else {
677                 /* if no limit is required, use soft limit */
678                 if ( sop->oq_search.rs_tlimit <= 0 ) {
679                         sop->oq_search.rs_tlimit = limit->lms_t_soft;
680
681                 /* if requested limit higher than hard limit, abort */
682                 } else if ( sop->oq_search.rs_tlimit > limit->lms_t_hard ) {
683                         /* no hard limit means use soft instead */
684                         if ( limit->lms_t_hard == 0
685                                         && limit->lms_t_soft > -1
686                                         && sop->oq_search.rs_tlimit > limit->lms_t_soft ) {
687                                 sop->oq_search.rs_tlimit = limit->lms_t_soft;
688
689                         /* positive hard limit means abort */
690                         } else if ( limit->lms_t_hard > 0 ) {
691                                 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
692                                 send_ldap_result( sop, rs );
693                                 rs->sr_err = LDAP_SUCCESS;
694                                 goto done;
695                         }
696                 
697                         /* negative hard limit means no limit */
698                 }
699                 
700                 /* if no limit is required, use soft limit */
701                 if ( sop->oq_search.rs_slimit <= 0 ) {
702                         if ( get_pagedresults(sop) && limit->lms_s_pr != 0 ) {
703                                 sop->oq_search.rs_slimit = limit->lms_s_pr;
704                         } else {
705                                 sop->oq_search.rs_slimit = limit->lms_s_soft;
706                         }
707
708                 /* if requested limit higher than hard limit, abort */
709                 } else if ( sop->oq_search.rs_slimit > limit->lms_s_hard ) {
710                         /* no hard limit means use soft instead */
711                         if ( limit->lms_s_hard == 0
712                                         && limit->lms_s_soft > -1
713                                         && sop->oq_search.rs_slimit > limit->lms_s_soft ) {
714                                 sop->oq_search.rs_slimit = limit->lms_s_soft;
715
716                         /* positive hard limit means abort */
717                         } else if ( limit->lms_s_hard > 0 ) {
718                                 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
719                                 send_ldap_result( sop, rs );
720                                 rs->sr_err = LDAP_SUCCESS;      
721                                 goto done;
722                         }
723                         
724                         /* negative hard limit means no limit */
725                 }
726         }
727
728         /* compute it anyway; root does not use it */
729         stoptime = op->o_time + sop->oq_search.rs_tlimit;
730
731         /* need normalized dn below */
732         ber_dupbv( &realbase, &e->e_nname );
733
734         /* Copy info to base, must free entry before accessing the database
735          * in search_candidates, to avoid deadlocks.
736          */
737         base.e_private = e->e_private;
738         base.e_nname = realbase;
739         base.e_id = e->e_id;
740
741         if ( e != &slap_entry_root ) {
742                 bdb_cache_return_entry_r(bdb->bi_dbenv, &bdb->bi_cache, e, &lock);
743         }
744         e = NULL;
745
746         if ( !IS_PSEARCH ) {
747                 rs->sr_err = bdb_get_commit_csn( sop, rs, &search_context_csn,
748                         locker, &ctxcsn_lock );
749
750                 if ( rs->sr_err != LDAP_SUCCESS ) {
751                         send_ldap_error( sop, rs, rs->sr_err,
752                                 "error in csn management in search" );
753                         goto done;
754                 }
755
756                 if ( sop->o_sync_mode != SLAP_SYNC_NONE &&
757                         sop->o_sync_state.ctxcsn &&
758                         sop->o_sync_state.ctxcsn->bv_val &&
759                         ber_bvcmp( &sop->o_sync_state.ctxcsn[0], search_context_csn ) == 0 )
760                 {
761                         bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
762                         goto nochange;
763                 }
764         } else {
765                 search_context_csn = ber_dupbv( NULL, &op->o_sync_csn );        
766         }
767
768         /* select candidates */
769         if ( sop->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
770                 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
771
772         } else {
773                 BDB_IDL_ZERO( candidates );
774                 BDB_IDL_ZERO( scopes );
775                 rs->sr_err = search_candidates( op, sop, rs, &base,
776                         locker, candidates, scopes );
777         }
778
779         if ( !IS_PSEARCH && sop->o_sync_mode != SLAP_SYNC_NONE ) {
780                 bdb_cache_entry_db_unlock( bdb->bi_dbenv, &ctxcsn_lock );
781         }
782
783         /* start cursor at beginning of candidates.
784          */
785         cursor = 0;
786         if (IS_PSEARCH) {
787                 if ( !BDB_IDL_IS_RANGE( candidates ) ) {
788                         cursor = bdb_idl_search( candidates, ps_e->e_id );
789                         if ( candidates[cursor] != ps_e->e_id ) {
790                                 rs->sr_err = LDAP_SUCCESS;
791                                 goto done;
792                         }
793                 } else if ( ps_e->e_id < BDB_IDL_RANGE_FIRST( candidates ) ||
794                         ps_e->e_id > BDB_IDL_RANGE_LAST( candidates ))
795                 {
796                         rs->sr_err = LDAP_SUCCESS;
797                         goto done;
798                 }
799                 candidates[0] = 1;
800                 candidates[1] = ps_e->e_id;
801         }
802
803         if ( candidates[0] == 0 ) {
804 #ifdef NEW_LOGGING
805                 LDAP_LOG ( OPERATION, RESULTS,
806                         "bdb_search: no candidates\n", 0, 0, 0 );
807 #else
808                 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
809                         0, 0, 0 );
810 #endif
811
812                 goto nochange;
813         }
814
815         /* if not root and candidates exceed to-be-checked entries, abort */
816         if ( !isroot && limit->lms_s_unchecked != -1 ) {
817                 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
818                         rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
819                         send_ldap_result( sop, rs );
820                         rs->sr_err = LDAP_SUCCESS;
821                         goto done;
822                 }
823         }
824
825         if ( isroot || !limit->lms_s_pr_hide ) {
826                 tentries = BDB_IDL_N(candidates);
827         }
828
829         if ( get_pagedresults(sop) ) {
830                 if ( sop->o_pagedresults_state.ps_cookie == 0 ) {
831                         id = 0;
832                 } else {
833                         if ( sop->o_pagedresults_size == 0 ) {
834                                 rs->sr_err = LDAP_SUCCESS;
835                                 rs->sr_text = "search abandoned by pagedResult size=0";
836                                 send_ldap_result( sop, rs );
837                                 goto done;
838                         }
839                         for ( id = bdb_idl_first( candidates, &cursor );
840                                 id != NOID && id <= (ID)( sop->o_pagedresults_state.ps_cookie );
841                                 id = bdb_idl_next( candidates, &cursor ) ) /* empty */;
842                 }
843                 if ( cursor == NOID ) {
844 #ifdef NEW_LOGGING
845                         LDAP_LOG ( OPERATION, RESULTS, 
846                                 "bdb_search: no paged results candidates\n", 
847                         0, 0, 0 );
848 #else
849                         Debug( LDAP_DEBUG_TRACE, 
850                                 "bdb_search: no paged results candidates\n",
851                                 0, 0, 0 );
852 #endif
853                         send_pagerequest_response( sop, rs, lastid, 0 );
854
855                         rs->sr_err = LDAP_OTHER;
856                         goto done;
857                 }
858                 goto loop_begin;
859         }
860
861         if (( sop->o_sync_mode & SLAP_SYNC_REFRESH ) || IS_PSEARCH ) {
862                 int match;
863
864                 cookief.f_choice = LDAP_FILTER_AND;
865                 cookief.f_and = &csnfnot;
866                 cookief.f_next = NULL;
867
868                 csnfnot.f_choice = LDAP_FILTER_NOT;
869                 csnfnot.f_not = &csnfeq;
870                 csnfnot.f_next = &csnfand;
871
872                 csnfeq.f_choice = LDAP_FILTER_EQUALITY;
873                 csnfeq.f_ava = &aa_eq;
874                 csnfeq.f_av_desc = slap_schema.si_ad_entryCSN;
875                 if ( sop->o_sync_state.ctxcsn != NULL ) {
876                         csnfeq.f_av_value = *sop->o_sync_state.ctxcsn;
877                 } else {
878                         csnfeq.f_av_value = slap_empty_bv;
879                 }
880
881                 csnfand.f_choice = LDAP_FILTER_AND;
882                 csnfand.f_and = &csnfge;
883                 csnfand.f_next = NULL;
884
885                 csnfge.f_choice = LDAP_FILTER_GE;
886                 csnfge.f_ava = &aa_ge;
887                 csnfge.f_av_desc = slap_schema.si_ad_entryCSN;
888                 if ( sop->o_sync_state.ctxcsn != NULL ) {
889                         csnfge.f_av_value = *sop->o_sync_state.ctxcsn;
890                 } else {
891                         csnfge.f_av_value = slap_empty_bv;
892                 }
893
894                 if ( search_context_csn && !IS_PSEARCH ) {
895                         csnfge.f_next = &contextcsnand;
896
897                         contextcsnand.f_choice = LDAP_FILTER_AND;
898                         contextcsnand.f_and = &contextcsnle;
899                         contextcsnand.f_next = NULL;
900         
901                         contextcsnle.f_choice = LDAP_FILTER_LE;
902                         contextcsnle.f_ava = &aa_le;
903                         contextcsnle.f_av_desc = slap_schema.si_ad_entryCSN;
904                         contextcsnle.f_av_value = *search_context_csn;
905                         contextcsnle.f_next = sop->oq_search.rs_filter;
906
907                         mr = slap_schema.si_ad_entryCSN->ad_type->sat_ordering;
908                         if ( sop->o_sync_state.ctxcsn &&
909                                 sop->o_sync_state.ctxcsn->bv_val != NULL )
910                         {
911                                 value_match( &match, slap_schema.si_ad_entryCSN, mr,
912                                                 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
913                                                 &sop->o_sync_state.ctxcsn[0], search_context_csn,
914                                                 &text );
915                         } else {
916                                 match = -1;
917                         }
918                         no_sync_state_change = ( match >= 0 );
919                 } else {
920                         csnfge.f_next = sop->oq_search.rs_filter;
921                 }
922         }
923
924         for ( id = bdb_idl_first( candidates, &cursor );
925                 id != NOID && !no_sync_state_change;
926                 id = bdb_idl_next( candidates, &cursor ) )
927         {
928                 int             scopeok = 0;
929
930 loop_begin:
931                 /* check for abandon */
932                 if ( sop->o_abandon ) {
933                         if ( sop != op ) {
934                                 bdb_drop_psearch( sop, sop->o_msgid );
935                         }
936                         rs->sr_err = LDAP_SUCCESS;
937                         goto done;
938                 }
939
940                 if ( sop->o_cancel ) {
941                         assert( sop->o_cancel == SLAP_CANCEL_REQ );
942                         rs->sr_err = LDAP_CANCELLED;
943                         send_ldap_result( sop, rs );
944                         sop->o_cancel = SLAP_CANCEL_ACK;
945                         rs->sr_err = LDAP_SUCCESS;
946                         goto done;
947                 }
948
949                 /* check time limit */
950                 if ( sop->oq_search.rs_tlimit != -1 && slap_get_time() > stoptime ) {
951                         rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
952                         rs->sr_ref = rs->sr_v2ref;
953                         send_ldap_result( sop, rs );
954                         rs->sr_err = LDAP_SUCCESS;
955                         goto done;
956                 }
957
958                 if (!IS_PSEARCH) {
959 id2entry_retry:
960                         /* get the entry with reader lock */
961                         ei = NULL;
962                         rs->sr_err = bdb_cache_find_id( op, NULL,
963                                 id, &ei, 0, locker, &lock );
964
965                         if (rs->sr_err == LDAP_BUSY) {
966                                 rs->sr_text = "ldap server busy";
967                                 send_ldap_result( sop, rs );
968                                 goto done;
969
970                         } else if ( rs->sr_err == DB_LOCK_DEADLOCK
971                                 || rs->sr_err == DB_LOCK_NOTGRANTED )
972                         {
973                                 goto id2entry_retry;    
974                         }
975
976                         if ( ei && rs->sr_err == LDAP_SUCCESS ) {
977                                 e = ei->bei_e;
978                         } else {
979                                 e = NULL;
980                         }
981
982                         if ( e == NULL ) {
983                                 if( !BDB_IDL_IS_RANGE(candidates) ) {
984                                         /* only complain for non-range IDLs */
985 #ifdef NEW_LOGGING
986                                         LDAP_LOG ( OPERATION, RESULTS,
987                                                 "bdb_search: candidate %ld not found\n",
988                                                 (long) id, 0, 0);
989 #else
990                                         Debug( LDAP_DEBUG_TRACE,
991                                                 "bdb_search: candidate %ld not found\n",
992                                                 (long) id, 0, 0 );
993 #endif
994                                 }
995
996                                 goto loop_continue;
997                         }
998                 } else {
999                         e = ps_e;
1000                 }
1001
1002                 rs->sr_entry = e;
1003
1004 #ifdef BDB_SUBENTRIES
1005                 /* FIXME: send all but syncrepl */
1006 #if 0
1007                 if ( !is_sync_protocol( sop ) )
1008 #endif
1009                 {
1010                         if ( is_entry_subentry( e ) ) {
1011                                 if( sop->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
1012                                         if(!get_subentries_visibility( sop )) {
1013                                                 /* only subentries are visible */
1014                                                 goto loop_continue;
1015                                         }
1016
1017                                 } else if ( get_subentries( sop ) &&
1018                                         !get_subentries_visibility( sop ))
1019                                 {
1020                                         /* only subentries are visible */
1021                                         goto loop_continue;
1022                                 }
1023
1024                         } else if ( get_subentries_visibility( sop )) {
1025                                 /* only subentries are visible */
1026                                 goto loop_continue;
1027                         }
1028                 }
1029 #endif /* BDB_SUBENTRIES */
1030
1031                 /* Does this candidate actually satisfy the search scope?
1032                  *
1033                  * Note that we don't lock access to the bei_parent pointer.
1034                  * Since only leaf nodes can be deleted, the parent of any
1035                  * node will always be a valid node. Also since we have
1036                  * a Read lock on the data, it cannot be renamed out of the
1037                  * scope while we are looking at it, and unless we're using
1038                  * BDB_HIER, its parents cannot be moved either.
1039                  */
1040                 switch( sop->ors_scope ) {
1041                 case LDAP_SCOPE_BASE:
1042                         /* This is always true, yes? */
1043                         if ( id == base.e_id ) scopeok = 1;
1044                         break;
1045
1046                 case LDAP_SCOPE_ONELEVEL:
1047                         if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
1048                         break;
1049
1050                 case LDAP_SCOPE_SUBTREE: {
1051                         EntryInfo *tmp;
1052                         for (tmp = BEI(e); tmp->bei_parent;
1053                                  tmp = tmp->bei_parent ) {
1054                                 if ( tmp->bei_id == base.e_id ) {
1055                                         scopeok = 1;
1056                                         break;
1057                                 }
1058                         }
1059                         } break;
1060                 }
1061
1062 #ifdef BDB_ALIASES
1063                 /* aliases were already dereferenced in candidate list */
1064                 if ( sop->ors_deref & LDAP_DEREF_SEARCHING ) {
1065                         /* but if the search base is an alias, and we didn't
1066                          * deref it when finding, return it.
1067                          */
1068                         if ( is_entry_alias(e) &&
1069                                 ((sop->ors_deref & LDAP_DEREF_FINDING) ||
1070                                         !bvmatch(&e->e_nname, &op->o_req_ndn)))
1071                         {
1072                                 goto loop_continue;
1073                         }
1074
1075                         /* scopes is only non-empty for onelevel or subtree */
1076                         if ( !scopeok && BDB_IDL_N(scopes) ) {
1077                                 unsigned x;
1078                                 if ( sop->ors_scope == LDAP_SCOPE_ONELEVEL ) {
1079                                         x = bdb_idl_search( scopes,
1080                                                 e->e_id );
1081                                         if ( scopes[x] == e->e_id )
1082                                                 scopeok = 1;
1083                                 } else {
1084                                 /* subtree, walk up the tree */
1085                                         EntryInfo *tmp = BEI(e);
1086                                         for (;tmp->bei_parent; tmp=tmp->bei_parent) {
1087                                                 x = bdb_idl_search( scopes, tmp->bei_id );
1088                                                 if ( scopes[x] == tmp->bei_id ) {
1089                                                         scopeok = 1;
1090                                                         break;
1091                                                 }
1092                                         }
1093                                 }
1094                         }
1095                 }
1096 #endif
1097
1098                 /* Not in scope, ignore it */
1099                 if ( !scopeok ) {
1100 #ifdef NEW_LOGGING
1101                         LDAP_LOG ( OPERATION, RESULTS,
1102                                 "bdb_search: %ld scope not okay\n",
1103                                 (long) id, 0, 0);
1104 #else
1105                         Debug( LDAP_DEBUG_TRACE,
1106                                 "bdb_search: %ld scope not okay\n",
1107                                 (long) id, 0, 0 );
1108 #endif
1109                         goto loop_continue;
1110                 }
1111
1112                 /*
1113                  * if it's a referral, add it to the list of referrals. only do
1114                  * this for non-base searches, and don't check the filter
1115                  * explicitly here since it's only a candidate anyway.
1116                  */
1117                 if ( !manageDSAit && sop->oq_search.rs_scope != LDAP_SCOPE_BASE
1118                         && is_entry_referral( e ) )
1119                 {
1120                         BerVarray erefs = get_entry_referrals( sop, e );
1121                         rs->sr_ref = referral_rewrite( erefs,
1122                                 &e->e_name, NULL,
1123                                 sop->oq_search.rs_scope == LDAP_SCOPE_SUBTREE
1124                                         ? LDAP_SCOPE_SUBTREE
1125                                         : LDAP_SCOPE_BASE );
1126
1127                         send_search_reference( sop, rs );
1128
1129                         ber_bvarray_free( rs->sr_ref );
1130                         ber_bvarray_free( erefs );
1131                         rs->sr_ref = NULL;
1132
1133                         goto loop_continue;
1134                 }
1135
1136                 if ( !manageDSAit && is_entry_glue( e )) {
1137                         goto loop_continue;
1138                 }
1139
1140                 /* if it matches the filter and scope, send it */
1141                 if (IS_PSEARCH) {
1142                         if (ps_type != LDAP_PSEARCH_BY_SCOPEOUT) {
1143                                 rs->sr_err = test_filter( sop, rs->sr_entry, &cookief );
1144                         } else {
1145                                 rs->sr_err = LDAP_COMPARE_TRUE;
1146                         }
1147                 } else {
1148                         if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1149                                 rc_sync = test_filter( sop, rs->sr_entry, &cookief );
1150                                 rs->sr_err = test_filter( sop, rs->sr_entry, &contextcsnand );
1151                                 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1152                                         if ( rc_sync == LDAP_COMPARE_TRUE ) {
1153                                                 if ( no_sync_state_change ) {
1154 #ifdef NEW_LOGGING
1155                                                         LDAP_LOG ( OPERATION, RESULTS,
1156                                                                 "bdb_search: error in context csn management\n",
1157                                                                 0, 0, 0 );
1158 #else
1159                                                         Debug( LDAP_DEBUG_TRACE,
1160                                                                 "bdb_search: error in context csn management\n",
1161                                                                 0, 0, 0 );
1162 #endif
1163                                                 }
1164                                                 entry_sync_state = LDAP_SYNC_ADD;
1165                                         } else {
1166                                                 if ( no_sync_state_change ) {
1167                                                         goto loop_continue;
1168                                                 }
1169                                                 entry_sync_state = LDAP_SYNC_PRESENT;
1170                                         }
1171                                 }
1172                         } else {
1173                                 rs->sr_err = test_filter( sop,
1174                                         rs->sr_entry, sop->oq_search.rs_filter );
1175                         }
1176                 }
1177
1178                 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
1179                         /* check size limit */
1180             if ( --sop->oq_search.rs_slimit == -1 &&
1181                                 sop->o_sync_slog_size == -1 )
1182                         {
1183                                 if (!IS_PSEARCH) {
1184                                         bdb_cache_return_entry_r( bdb->bi_dbenv,
1185                                                 &bdb->bi_cache, e, &lock );
1186                                 }
1187                                 e = NULL;
1188                                 rs->sr_entry = NULL;
1189                                 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
1190                                 rs->sr_ref = rs->sr_v2ref;
1191                                 send_ldap_result( sop, rs );
1192                                 rs->sr_err = LDAP_SUCCESS;
1193                                 goto done;
1194                         }
1195
1196                         if ( get_pagedresults(sop) ) {
1197                                 if ( rs->sr_nentries >= sop->o_pagedresults_size ) {
1198                                         send_pagerequest_response( sop, rs,
1199                                                 lastid, tentries );
1200                                         goto done;
1201                                 }
1202                                 lastid = id;
1203                         }
1204
1205                         if (e) {
1206                                 /* safe default */
1207                                 int result = -1;
1208                                 
1209                                 if (IS_PSEARCH) {
1210                                         int premodify_found = 0;
1211                                         int entry_sync_state;
1212
1213                                         if ( ps_type == LDAP_PSEARCH_BY_ADD ||
1214                                                  ps_type == LDAP_PSEARCH_BY_DELETE ||
1215                                                  ps_type == LDAP_PSEARCH_BY_MODIFY ||
1216                                                  ps_type == LDAP_PSEARCH_BY_SCOPEOUT )
1217                                         {
1218                                                 if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1219                                                         struct psid_entry* psid_e;
1220                                                         LDAP_LIST_FOREACH( psid_e,
1221                                                                 &op->o_pm_list, ps_link)
1222                                                         {
1223                                                                 if( psid_e->ps_op == sop ) {
1224                                                                         premodify_found = 1;
1225                                                                         LDAP_LIST_REMOVE(psid_e, ps_link);
1226                                                                         break;
1227                                                                 }
1228                                                         }
1229                                                         if (psid_e != NULL) free (psid_e);
1230                                                 }
1231                                                 if ( ps_type == LDAP_PSEARCH_BY_ADD ) {
1232                                                         entry_sync_state = LDAP_SYNC_ADD;
1233                                                 } else if ( ps_type == LDAP_PSEARCH_BY_DELETE ) {
1234                                                         entry_sync_state = LDAP_SYNC_DELETE;
1235                                                 } else if ( ps_type == LDAP_PSEARCH_BY_MODIFY ) {
1236                                                         if ( premodify_found ) {
1237                                                                 entry_sync_state = LDAP_SYNC_MODIFY;
1238                                                         } else {
1239                                                                 entry_sync_state = LDAP_SYNC_ADD;
1240                                                         }
1241                                                 } else if ( ps_type == LDAP_PSEARCH_BY_SCOPEOUT ) {
1242                                                         entry_sync_state = LDAP_SYNC_DELETE;
1243                                                 } else {
1244                                                         rs->sr_err = LDAP_OTHER;
1245                                                         goto done;
1246                                                 }
1247                                                 if ( sop->o_sync_slog_size != -1 ) {
1248                                                         if ( entry_sync_state == LDAP_SYNC_DELETE ) {
1249                                                                 result = slap_add_session_log( op, sop, e );
1250                                                         } else {
1251                                                                 result = 1;
1252                                                         }
1253                                                 } else {
1254                                                         struct berval cookie;
1255                                                         slap_compose_sync_cookie( sop, &cookie,
1256                                                                                 search_context_csn,
1257                                                                                 sop->o_sync_state.sid,
1258                                                                                 sop->o_sync_state.rid );
1259                                                         rs->sr_err = slap_build_sync_state_ctrl( sop,
1260                                                                 rs, e, entry_sync_state, ctrls,
1261                                                                 num_ctrls++, 1, &cookie );
1262                                                         if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1263                                                         rs->sr_attrs = attrs;
1264                                                         rs->sr_ctrls = ctrls;
1265                                                         result = send_search_entry( sop, rs );
1266                                                         if ( cookie.bv_val )
1267                                                                 ch_free( cookie.bv_val );       
1268                                                         sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1269                                                                          sop->o_tmpmemctx );
1270                                                         sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1271                                                         ctrls[num_ctrls] = NULL;
1272                                                         rs->sr_ctrls = NULL;
1273                                                 }
1274                                         } else if ( ps_type == LDAP_PSEARCH_BY_PREMODIFY ) {
1275                                                 struct psid_entry* psid_e;
1276                                                 psid_e = (struct psid_entry *) ch_calloc (1,
1277                                                         sizeof(struct psid_entry));
1278                                                 psid_e->ps_op = sop;
1279                                                 LDAP_LIST_INSERT_HEAD( &op->o_pm_list,
1280                                                         psid_e, ps_link );
1281
1282                                         } else {
1283 #ifdef NEW_LOGGING
1284                                                 LDAP_LOG ( OPERATION, RESULTS,
1285                                                         "bdb_search: invalid ps_type (%d) \n",
1286                                                         ps_type, 0, 0);
1287 #else
1288                                                 Debug( LDAP_DEBUG_TRACE,
1289                                                         "bdb_search: invalid ps_type (%d) \n",
1290                                                         ps_type, 0, 0);
1291 #endif
1292                                         }
1293                                 } else {
1294                                         if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1295
1296                                                 if ( rc_sync == LDAP_COMPARE_TRUE ) { /* ADD */
1297                                                         rs->sr_err = slap_build_sync_state_ctrl( sop,
1298                                                                 rs, e, entry_sync_state, ctrls,
1299                                                                 num_ctrls++, 0, NULL );
1300                                                         if ( rs->sr_err != LDAP_SUCCESS ) goto done;
1301                                                         rs->sr_ctrls = ctrls;
1302                                                         rs->sr_attrs = sop->oq_search.rs_attrs;
1303                                                         result = send_search_entry( sop, rs );
1304                                                         sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val,
1305                                                                          sop->o_tmpmemctx );
1306                                                         sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1307                                                         ctrls[num_ctrls] = NULL;
1308                                                         rs->sr_ctrls = NULL;
1309                                                 } else { /* PRESENT */
1310                                                         if ( sync_send_present_mode ) {
1311                                                                 result = slap_build_syncUUID_set( sop,
1312                                                                                                         &syncUUID_set, e );
1313                                                                 if ( result <= 0 ) {
1314                                                                         result = -1;    
1315                                                                 } else {
1316                                                                         syncUUID_set_cnt++;
1317                                                                         if ( syncUUID_set_cnt == SLAP_SYNCUUID_SET_SIZE ) {
1318                                                                                 rs->sr_err = LDAP_SUCCESS;
1319                                                                                 rs->sr_rspoid = LDAP_SYNC_INFO;
1320                                                                                 rs->sr_ctrls = NULL;
1321                                                                                 result = slap_send_syncinfo( sop, rs,
1322                                                                                                 LDAP_TAG_SYNC_ID_SET,
1323                                                                                                 NULL, 0, syncUUID_set, 0 );
1324                                                                                 if ( result != LDAP_SUCCESS )
1325                                                                                         result = -1;
1326                                                                                 ber_bvarray_free_x( syncUUID_set,
1327                                                                                                                 sop->o_tmpmemctx );
1328                                                                                 syncUUID_set = NULL;
1329                                                                                 syncUUID_set_cnt = 0;
1330                                                                         }
1331                                                                 }
1332                                                         } else {
1333                                                                 result = 1;
1334                                                         }
1335                                                 }
1336                                         } else {
1337                                                 rs->sr_attrs = sop->oq_search.rs_attrs;
1338                                                 rs->sr_ctrls = NULL;
1339                                                 result = send_search_entry( sop, rs );
1340                                         }
1341                                 }
1342
1343                                 switch (result) {
1344                                 case 0:         /* entry sent ok */
1345                                         break;
1346                                 case 1:         /* entry not sent */
1347                                         break;
1348                                 case -1:        /* connection closed */
1349                                         if (!IS_PSEARCH)
1350                                         bdb_cache_return_entry_r(bdb->bi_dbenv,
1351                                                 &bdb->bi_cache, e, &lock);
1352                                         e = NULL;
1353                                         rs->sr_entry = NULL;
1354                                         rs->sr_err = LDAP_OTHER;
1355                                         goto done;
1356                                 }
1357                         }
1358                 } else {
1359 #ifdef NEW_LOGGING
1360                         LDAP_LOG ( OPERATION, RESULTS,
1361                                 "bdb_search: %ld does not match filter\n", (long) id, 0, 0);
1362 #else
1363                         Debug( LDAP_DEBUG_TRACE,
1364                                 "bdb_search: %ld does not match filter\n",
1365                                 (long) id, 0, 0 );
1366 #endif
1367                 }
1368
1369 loop_continue:
1370                 if( e != NULL ) {
1371                         /* free reader lock */
1372                         if (!IS_PSEARCH) {
1373                                 bdb_cache_return_entry_r( bdb->bi_dbenv,
1374                                         &bdb->bi_cache, e , &lock );
1375                                 if ( sop->o_nocaching ) {
1376                                         bdb_cache_delete_entry( bdb, ei, locker, &lock );
1377                                 }
1378                         }
1379                         e = NULL;
1380                         rs->sr_entry = NULL;
1381                 }
1382
1383                 ldap_pvt_thread_yield();
1384         }
1385
1386         if ( syncUUID_set_cnt > 0 ) {
1387                 rs->sr_err = LDAP_SUCCESS;
1388                 rs->sr_rspoid = LDAP_SYNC_INFO;
1389                 rs->sr_ctrls = NULL;
1390                 slap_send_syncinfo( sop, rs, LDAP_TAG_SYNC_ID_SET,
1391                                                         NULL, 0, syncUUID_set, 0 );
1392                 ber_bvarray_free_x( syncUUID_set, sop->o_tmpmemctx );
1393                 syncUUID_set_cnt = 0;
1394         }
1395
1396 nochange:
1397         if (!IS_PSEARCH) {
1398                 if ( sop->o_sync_mode & SLAP_SYNC_REFRESH ) {
1399                         if ( sop->o_sync_mode & SLAP_SYNC_PERSIST ) {
1400                                 struct berval cookie;
1401                                 slap_compose_sync_cookie( sop, &cookie,
1402                                                                                   search_context_csn,
1403                                                                                   sop->o_sync_state.sid,
1404                                                                                   sop->o_sync_state.rid );
1405
1406                                 if ( sync_send_present_mode ) {
1407                                         rs->sr_err = LDAP_SUCCESS;
1408                                         rs->sr_rspoid = LDAP_SYNC_INFO;
1409                                         rs->sr_ctrls = NULL;
1410                                         slap_send_syncinfo( sop, rs,
1411                                                 LDAP_TAG_SYNC_REFRESH_PRESENT, &cookie, 1, NULL, 0 );
1412                                 } else {
1413                                         if ( !no_sync_state_change ) {
1414                                                 int slog_found = 0;
1415                                                 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1416                                                 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list, o_ps_link ) {
1417                                                         if ( ps_list->o_sync_slog_size > 0 ) {
1418                                                                 if ( ps_list->o_sync_state.sid == sop->o_sync_state.sid ) {
1419                                                                         slog_found = 1;
1420                                                                         break;
1421                                                                 }
1422                                                         }
1423                                                 }
1424                 
1425                                                 if ( slog_found ) {
1426                                                         rs->sr_err = LDAP_SUCCESS;
1427                                                         rs->sr_rspoid = NULL;
1428                                                         rs->sr_ctrls = NULL;
1429                                                         slap_send_session_log( op, ps_list, rs );
1430                                                 }
1431                                                 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1432                                         }
1433                                         rs->sr_err = LDAP_SUCCESS;
1434                                         rs->sr_rspoid = LDAP_SYNC_INFO;
1435                                         rs->sr_ctrls = NULL;
1436                                         slap_send_syncinfo( sop, rs,
1437                                                 LDAP_TAG_SYNC_REFRESH_DELETE, &cookie, 1, NULL, 0 );
1438                                 }
1439
1440                                 if ( cookie.bv_val ) {
1441                                         ch_free( cookie.bv_val );
1442                                 }
1443                         } else {
1444                                 /* refreshOnly mode */
1445                                 struct berval cookie;
1446                                 slap_compose_sync_cookie( sop, &cookie,
1447                                                                                   search_context_csn,
1448                                                                                   sop->o_sync_state.sid,
1449                                                                                   sop->o_sync_state.rid );
1450
1451                                 if ( sync_send_present_mode ) {
1452                                         slap_build_sync_done_ctrl( sop, rs, ctrls,
1453                                                 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_PRESENTS );
1454                                 } else {
1455                                         if ( !no_sync_state_change ) {
1456                                                 int slog_found = 0;
1457                                                 ldap_pvt_thread_rdwr_rlock( &bdb->bi_pslist_rwlock );
1458                                                 LDAP_LIST_FOREACH( ps_list, &bdb->bi_psearch_list,
1459                                                                 o_ps_link ) {
1460                                                         if ( ps_list->o_sync_slog_size > 0 ) {
1461                                                                 if ( ps_list->o_sync_state.sid ==
1462                                                                                 sop->o_sync_state.sid ) {
1463                                                                         slog_found = 1;
1464                                                                         break;
1465                                                                 }
1466                                                         }
1467                                                 }
1468                 
1469                                                 if ( slog_found ) {
1470                                                         slap_send_session_log( op, ps_list, rs );
1471                                                 }
1472                                                 ldap_pvt_thread_rdwr_runlock( &bdb->bi_pslist_rwlock );
1473                                         }
1474                                         slap_build_sync_done_ctrl( sop, rs, ctrls,
1475                                                 num_ctrls++, 1, &cookie, LDAP_SYNC_REFRESH_DELETES );
1476                                 }
1477
1478                                 rs->sr_ctrls = ctrls;
1479                                 rs->sr_ref = rs->sr_v2ref;
1480                                 rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1481                                 rs->sr_rspoid = NULL;
1482                                 send_ldap_result( sop, rs );
1483                                 if ( ctrls[num_ctrls-1]->ldctl_value.bv_val != NULL ) {
1484                                         sl_free( ctrls[num_ctrls-1]->ldctl_value.bv_val, sop->o_tmpmemctx );
1485                                 }
1486                                 sl_free( ctrls[--num_ctrls], sop->o_tmpmemctx );
1487                                 ctrls[num_ctrls] = NULL;
1488                                 if ( cookie.bv_val )
1489                                         ch_free( cookie.bv_val );       
1490                         }
1491                 } else {
1492                         rs->sr_ctrls = NULL;
1493                         rs->sr_ref = rs->sr_v2ref;
1494                         rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1495                         rs->sr_rspoid = NULL;
1496                         send_ldap_result( sop, rs );
1497                 }
1498         }
1499
1500         rs->sr_err = LDAP_SUCCESS;
1501
1502 done:
1503         if( !IS_PSEARCH && e != NULL ) {
1504                 /* free reader lock */
1505                 bdb_cache_return_entry_r ( bdb->bi_dbenv, &bdb->bi_cache, e, &lock );
1506         }
1507
1508         LOCK_ID_FREE (bdb->bi_dbenv, locker );
1509
1510         ber_bvfree( search_context_csn );
1511
1512         if( rs->sr_v2ref ) {
1513                 ber_bvarray_free( rs->sr_v2ref );
1514                 rs->sr_v2ref = NULL;
1515         }
1516         if( realbase.bv_val ) ch_free( realbase.bv_val );
1517
1518         return rs->sr_err;
1519 }
1520
1521
1522 static int base_candidate(
1523         BackendDB       *be,
1524         Entry   *e,
1525         ID              *ids )
1526 {
1527 #ifdef NEW_LOGGING
1528         LDAP_LOG ( OPERATION, ENTRY,
1529                 "base_candidate: base: \"%s\" (0x%08lx)\n",
1530                 e->e_nname.bv_val, (long) e->e_id, 0);
1531 #else
1532         Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1533                 e->e_nname.bv_val, (long) e->e_id, 0);
1534 #endif
1535
1536         ids[0] = 1;
1537         ids[1] = e->e_id;
1538         return 0;
1539 }
1540
1541 /* Look for "objectClass Present" in this filter.
1542  * Also count depth of filter tree while we're at it.
1543  */
1544 static int oc_filter(
1545         Filter *f,
1546         int cur,
1547         int *max
1548 )
1549 {
1550         int rc = 0;
1551
1552         assert( f );
1553
1554         if( cur > *max ) *max = cur;
1555
1556         switch(f->f_choice) {
1557         case LDAP_FILTER_PRESENT:
1558                 if (f->f_desc == slap_schema.si_ad_objectClass) {
1559                         rc = 1;
1560                 }
1561                 break;
1562
1563         case LDAP_FILTER_AND:
1564         case LDAP_FILTER_OR:
1565                 cur++;
1566                 for (f=f->f_and; f; f=f->f_next) {
1567                         (void) oc_filter(f, cur, max);
1568                 }
1569                 break;
1570
1571         default:
1572                 break;
1573         }
1574         return rc;
1575 }
1576
1577 static void search_stack_free( void *key, void *data )
1578 {
1579         ber_memfree_x(data, NULL);
1580 }
1581
1582 static void *search_stack( Operation *op )
1583 {
1584         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1585         void *ret = NULL;
1586
1587         if ( op->o_threadctx ) {
1588                 ldap_pvt_thread_pool_getkey( op->o_threadctx, search_stack,
1589                         &ret, NULL );
1590         } else {
1591                 ret = bdb->bi_search_stack;
1592         }
1593
1594         if ( !ret ) {
1595                 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1596                         * sizeof( ID ) );
1597                 if ( op->o_threadctx ) {
1598                         ldap_pvt_thread_pool_setkey( op->o_threadctx, search_stack,
1599                                 ret, search_stack_free );
1600                 } else {
1601                         bdb->bi_search_stack = ret;
1602                 }
1603         }
1604         return ret;
1605 }
1606
1607 static int search_candidates(
1608         Operation *stackop,
1609         Operation *op,
1610         SlapReply *rs,
1611         Entry *e,
1612         u_int32_t locker,
1613         ID      *ids,
1614         ID      *scopes )
1615 {
1616         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1617         int rc, depth = 1;
1618         Filter          f, rf, xf, nf;
1619         ID              *stack;
1620         AttributeAssertion aa_ref;
1621 #ifdef BDB_SUBENTRIES
1622         Filter  sf;
1623         AttributeAssertion aa_subentry;
1624 #endif
1625
1626         /*
1627          * This routine takes as input a filter (user-filter)
1628          * and rewrites it as follows:
1629          *      (&(scope=DN)[(objectClass=subentry)]
1630          *              (|[(objectClass=referral)(objectClass=alias)](user-filter))
1631          */
1632
1633 #ifdef NEW_LOGGING
1634         LDAP_LOG ( OPERATION, ENTRY,
1635                 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n", 
1636                 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope);
1637 #else
1638         Debug(LDAP_DEBUG_TRACE,
1639                 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1640                 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1641 #endif
1642
1643         xf.f_or = op->oq_search.rs_filter;
1644         xf.f_choice = LDAP_FILTER_OR;
1645         xf.f_next = NULL;
1646
1647         /* If the user's filter uses objectClass=*,
1648          * these clauses are redundant.
1649          */
1650         if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1651                 && !get_subentries_visibility(op)
1652                 && !is_sync_protocol(op) )
1653         {
1654                 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1655                         /* match referral objects */
1656                         struct berval bv_ref = { sizeof("referral")-1, "referral" };
1657                         rf.f_choice = LDAP_FILTER_EQUALITY;
1658                         rf.f_ava = &aa_ref;
1659                         rf.f_av_desc = slap_schema.si_ad_objectClass;
1660                         rf.f_av_value = bv_ref;
1661                         rf.f_next = xf.f_or;
1662                         xf.f_or = &rf;
1663                         depth++;
1664                 }
1665         }
1666
1667         f.f_next = NULL;
1668         f.f_choice = LDAP_FILTER_AND;
1669         f.f_and = &nf;
1670         /* Dummy; we compute scope separately now */
1671         nf.f_choice = SLAPD_FILTER_COMPUTED;
1672         nf.f_result = LDAP_SUCCESS;
1673         nf.f_next = xf.f_or == op->oq_search.rs_filter
1674                 ? op->oq_search.rs_filter : &xf ;
1675         /* Filter depth increased again, adding dummy clause */
1676         depth++;
1677
1678 #ifdef BDB_SUBENTRIES
1679         if( get_subentries_visibility( op ) ) {
1680                 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
1681                 sf.f_choice = LDAP_FILTER_EQUALITY;
1682                 sf.f_ava = &aa_subentry;
1683                 sf.f_av_desc = slap_schema.si_ad_objectClass;
1684                 sf.f_av_value = bv_subentry;
1685                 sf.f_next = nf.f_next;
1686                 nf.f_next = &sf;
1687         }
1688 #endif
1689
1690         /* Allocate IDL stack, plus 1 more for former tmp */
1691         if ( depth+1 > bdb->bi_search_stack_depth ) {
1692                 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1693         } else {
1694                 stack = search_stack( stackop );
1695         }
1696
1697         if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1698                 rc = search_aliases( op, rs, e, locker, ids, scopes, stack );
1699         } else {
1700                 rc = bdb_dn2idl( op, e, ids, stack );
1701         }
1702
1703         if ( rc == LDAP_SUCCESS ) {
1704                 rc = bdb_filter_candidates( op, &f, ids,
1705                         stack, stack+BDB_IDL_UM_SIZE );
1706         }
1707
1708         if ( depth+1 > bdb->bi_search_stack_depth ) {
1709                 ch_free( stack );
1710         }
1711
1712         if( rc ) {
1713 #ifdef NEW_LOGGING
1714                 LDAP_LOG ( OPERATION, DETAIL1,
1715                         "bdb_search_candidates: failed (rc=%d)\n", rc, 0, 0  );
1716 #else
1717                 Debug(LDAP_DEBUG_TRACE,
1718                         "bdb_search_candidates: failed (rc=%d)\n",
1719                         rc, NULL, NULL );
1720 #endif
1721
1722         } else {
1723 #ifdef NEW_LOGGING
1724                 LDAP_LOG ( OPERATION, DETAIL1,
1725                         "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1726                         (long) ids[0], (long) BDB_IDL_FIRST(ids), 
1727                         (long) BDB_IDL_LAST(ids));
1728 #else
1729                 Debug(LDAP_DEBUG_TRACE,
1730                         "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1731                         (long) ids[0],
1732                         (long) BDB_IDL_FIRST(ids),
1733                         (long) BDB_IDL_LAST(ids) );
1734 #endif
1735         }
1736
1737         return rc;
1738 }
1739
1740 static void
1741 send_pagerequest_response( 
1742         Operation       *op,
1743         SlapReply       *rs,
1744         ID              lastid,
1745         int             tentries )
1746 {
1747         LDAPControl     ctrl, *ctrls[2];
1748         BerElementBuffer berbuf;
1749         BerElement      *ber = (BerElement *)&berbuf;
1750         struct berval   cookie = { 0, NULL };
1751         PagedResultsCookie respcookie;
1752
1753 #ifdef NEW_LOGGING
1754         LDAP_LOG ( OPERATION, ENTRY,
1755                 "send_pagerequest_response: lastid: (0x%08lx) "
1756                 "nentries: (0x%081x)\n", 
1757                 lastid, rs->sr_nentries, NULL );
1758 #else
1759         Debug(LDAP_DEBUG_ARGS, "send_pagerequest_response: lastid: (0x%08lx) "
1760                         "nentries: (0x%081x)\n", lastid, rs->sr_nentries, NULL );
1761 #endif
1762
1763         ctrl.ldctl_value.bv_val = NULL;
1764         ctrls[0] = &ctrl;
1765         ctrls[1] = NULL;
1766
1767         ber_init2( ber, NULL, LBER_USE_DER );
1768
1769         respcookie = ( PagedResultsCookie )lastid;
1770         op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1771         cookie.bv_len = sizeof( respcookie );
1772         cookie.bv_val = (char *)&respcookie;
1773
1774         /*
1775          * FIXME: we should consider sending an estimate of the entries
1776          * left, after appropriate security check is done
1777          */
1778         ber_printf( ber, "{iO}", tentries, &cookie ); 
1779
1780         if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1781                 goto done;
1782         }
1783
1784         ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1785         ctrls[0]->ldctl_iscritical = 0;
1786
1787         rs->sr_ctrls = ctrls;
1788         rs->sr_err = LDAP_SUCCESS;
1789         send_ldap_result( op, rs );
1790
1791 done:
1792         (void) ber_free_buf( ber );
1793 }