git.sur5r.net Git - openldap/blob - servers/slapd/back-mdb/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-2014 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-mdb.h"
  23 #include "idl.h"
  24
  25 static int base_candidate(
  26         BackendDB       *be,
  27         Entry   *e,
  28         ID              *ids );
  29
  30 static int search_candidates(
  31         Operation *op,
  32         SlapReply *rs,
  33         Entry *e,
  34         MDB_txn *txn,
  35         MDB_cursor *mci,
  36         ID      *ids,
  37         ID2L    scopes,
  38         ID *stack );
  39
  40 static int parse_paged_cookie( Operation *op, SlapReply *rs );
  41
  42 static void send_paged_response(
  43         Operation *op,
  44         SlapReply *rs,
  45         ID  *lastid,
  46         int tentries );
  47
  48 /* Dereference aliases for a single alias entry. Return the final
  49  * dereferenced entry on success, NULL on any failure.
  50  */
  51 static Entry * deref_base (
  52         Operation *op,
  53         SlapReply *rs,
  54         Entry *e,
  55         Entry **matched,
  56         MDB_txn *txn,
  57         ID      *tmp,
  58         ID      *visited )
  59 {
  60         struct berval ndn;
  61
  62         rs->sr_err = LDAP_ALIAS_DEREF_PROBLEM;
  63         rs->sr_text = "maximum deref depth exceeded";
  64
  65         for (;;) {
  66                 /* Remember the last entry we looked at, so we can
  67                  * report broken links
  68                  */
  69                 *matched = e;
  70
  71                 if (MDB_IDL_N(tmp) >= op->o_bd->be_max_deref_depth) {
  72                         e = NULL;
  73                         break;
  74                 }
  75
  76                 /* If this is part of a subtree or onelevel search,
  77                  * have we seen this ID before? If so, quit.
  78                  */
  79                 if ( visited && mdb_idl_insert( visited, e->e_id ) ) {
  80                         e = NULL;
  81                         break;
  82                 }
  83
  84                 /* If we've seen this ID during this deref iteration,
  85                  * we've hit a loop.
  86                  */
  87                 if ( mdb_idl_insert( tmp, e->e_id ) ) {
  88                         rs->sr_err = LDAP_ALIAS_PROBLEM;
  89                         rs->sr_text = "circular alias";
  90                         e = NULL;
  91                         break;
  92                 }
  93
  94                 /* If there was a problem getting the aliasedObjectName,
  95                  * get_alias_dn will have set the error status.
  96                  */
  97                 if ( get_alias_dn(e, &ndn, &rs->sr_err, &rs->sr_text) ) {
  98                         e = NULL;
  99                         break;
 100                 }
 101
 102                 rs->sr_err = mdb_dn2entry( op, txn, NULL, &ndn, &e, NULL, 0 );
 103                 if (rs->sr_err) {
 104                         rs->sr_err = LDAP_ALIAS_PROBLEM;
 105                         rs->sr_text = "aliasedObject not found";
 106                         break;
 107                 }
 108
 109                 /* Free the previous entry, continue to work with the
 110                  * one we just retrieved.
 111                  */
 112                 mdb_entry_return( op, *matched );
 113
 114                 /* We found a regular entry. Return this to the caller.
 115                  */
 116                 if (!is_entry_alias(e)) {
 117                         rs->sr_err = LDAP_SUCCESS;
 118                         rs->sr_text = NULL;
 119                         break;
 120                 }
 121         }
 122         return e;
 123 }
 124
 125 /* Look for and dereference all aliases within the search scope.
 126  * Requires "stack" to be able to hold 6 levels of DB_SIZE IDLs.
 127  * Of course we're hardcoded to require a minimum of 8 UM_SIZE
 128  * IDLs so this is never a problem.
 129  */
 130 static int search_aliases(
 131         Operation *op,
 132         SlapReply *rs,
 133         ID e_id,
 134         MDB_txn *txn,
 135         MDB_cursor *mci,
 136         ID2L scopes,
 137         ID *stack )
 138 {
 139         ID *aliases, *curscop, *visited, *newsubs, *oldsubs, *tmp;
 140         ID cursora, ida, cursoro, ido;
 141         Entry *matched, *a;
 142         struct berval bv_alias = BER_BVC( "alias" );
 143         AttributeAssertion aa_alias = ATTRIBUTEASSERTION_INIT;
 144         Filter  af;
 145         int first = 1;
 146
 147         aliases = stack;        /* IDL of all aliases in the database */
 148         curscop = aliases + MDB_IDL_DB_SIZE;    /* Aliases in the current scope */
 149         visited = curscop + MDB_IDL_DB_SIZE;    /* IDs we've seen in this search */
 150         newsubs = visited + MDB_IDL_DB_SIZE;    /* New subtrees we've added */
 151         oldsubs = newsubs + MDB_IDL_DB_SIZE;    /* Subtrees added previously */
 152         tmp = oldsubs + MDB_IDL_DB_SIZE;        /* Scratch space for deref_base() */
 153
 154         af.f_choice = LDAP_FILTER_EQUALITY;
 155         af.f_ava = &aa_alias;
 156         af.f_av_desc = slap_schema.si_ad_objectClass;
 157         af.f_av_value = bv_alias;
 158         af.f_next = NULL;
 159
 160         /* Find all aliases in database */
 161         MDB_IDL_ZERO( aliases );
 162         rs->sr_err = mdb_filter_candidates( op, txn, &af, aliases,
 163                 curscop, visited );
 164         if (rs->sr_err != LDAP_SUCCESS || MDB_IDL_IS_ZERO( aliases )) {
 165                 return rs->sr_err;
 166         }
 167         oldsubs[0] = 1;
 168         oldsubs[1] = e_id;
 169
 170         MDB_IDL_ZERO( visited );
 171         MDB_IDL_ZERO( newsubs );
 172
 173         cursoro = 0;
 174         ido = mdb_idl_first( oldsubs, &cursoro );
 175
 176         for (;;) {
 177                 /* Set curscop to only the aliases in the current scope. Start with
 178                  * all the aliases, then get the intersection with the scope.
 179                  */
 180                 rs->sr_err = mdb_idscope( op, txn, e_id, aliases, curscop );
 181
 182                 /* Dereference all of the aliases in the current scope. */
 183                 cursora = 0;
 184                 for (ida = mdb_idl_first(curscop, &cursora); ida != NOID;
 185                         ida = mdb_idl_next(curscop, &cursora))
 186                 {
 187                         rs->sr_err = mdb_id2entry(op, mci, ida, &a);
 188                         if (rs->sr_err != LDAP_SUCCESS) {
 189                                 continue;
 190                         }
 191
 192                         /* This should only happen if the curscop IDL has maxed out and
 193                          * turned into a range that spans IDs indiscriminately
 194                          */
 195                         if (!is_entry_alias(a)) {
 196                                 mdb_entry_return(op, a);
 197                                 continue;
 198                         }
 199
 200                         /* Actually dereference the alias */
 201                         MDB_IDL_ZERO(tmp);
 202                         a = deref_base( op, rs, a, &matched, txn,
 203                                 tmp, visited );
 204                         if (a) {
 205                                 /* If the target was not already in our current scopes,
 206                                  * make note of it in the newsubs list.
 207                                  */
 208                                 ID2 mid;
 209                                 mid.mid = a->e_id;
 210                                 mid.mval.mv_data = NULL;
 211                                 if (mdb_id2l_insert(scopes, &mid) == 0) {
 212                                         mdb_idl_insert(newsubs, a->e_id);
 213                                 }
 214                                 mdb_entry_return( op, a );
 215
 216                         } else if (matched) {
 217                                 /* Alias could not be dereferenced, or it deref'd to
 218                                  * an ID we've already seen. Ignore it.
 219                                  */
 220                                 mdb_entry_return( op, matched );
 221                                 rs->sr_text = NULL;
 222                                 rs->sr_err = 0;
 223                         }
 224                 }
 225                 /* If this is a OneLevel search, we're done; oldsubs only had one
 226                  * ID in it. For a Subtree search, oldsubs may be a list of scope IDs.
 227                  */
 228                 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) break;
 229 nextido:
 230                 ido = mdb_idl_next( oldsubs, &cursoro );
 231
 232                 /* If we're done processing the old scopes, did we add any new
 233                  * scopes in this iteration? If so, go back and do those now.
 234                  */
 235                 if (ido == NOID) {
 236                         if (MDB_IDL_IS_ZERO(newsubs)) break;
 237                         MDB_IDL_CPY(oldsubs, newsubs);
 238                         MDB_IDL_ZERO(newsubs);
 239                         cursoro = 0;
 240                         ido = mdb_idl_first( oldsubs, &cursoro );
 241                 }
 242
 243                 /* Find the entry corresponding to the next scope. If it can't
 244                  * be found, ignore it and move on. This should never happen;
 245                  * we should never see the ID of an entry that doesn't exist.
 246                  */
 247                 {
 248                         MDB_val edata;
 249                         rs->sr_err = mdb_id2edata(op, mci, ido, &edata);
 250                         if ( rs->sr_err != MDB_SUCCESS ) {
 251                                 goto nextido;
 252                         }
 253                         e_id = ido;
 254                 }
 255         }
 256         return rs->sr_err;
 257 }
 258
 259 /* Get the next ID from the DB. Used if the candidate list is
 260  * a range and simple iteration hits missing entryIDs
 261  */
 262 static int
 263 mdb_get_nextid(MDB_cursor *mci, ID *cursor)
 264 {
 265         MDB_val key;
 266         ID id;
 267         int rc;
 268
 269         id = *cursor + 1;
 270         key.mv_data = &id;
 271         key.mv_size = sizeof(ID);
 272         rc = mdb_cursor_get( mci, &key, NULL, MDB_SET_RANGE );
 273         if ( rc )
 274                 return rc;
 275         memcpy( cursor, key.mv_data, sizeof(ID));
 276         return 0;
 277 }
 278
 279 static void scope_chunk_free( void *key, void *data )
 280 {
 281         ID2 *p1, *p2;
 282         for (p1 = data; p1; p1 = p2) {
 283                 p2 = p1[0].mval.mv_data;
 284                 ber_memfree_x(p1, NULL);
 285         }
 286 }
 287
 288 static ID2 *scope_chunk_get( Operation *op )
 289 {
 290         struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
 291         ID2 *ret = NULL;
 292
 293         ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
 294                         (void *)&ret, NULL );
 295         if ( !ret ) {
 296                 ret = ch_malloc( MDB_IDL_UM_SIZE * sizeof( ID2 ));
 297         } else {
 298                 void *r2 = ret[0].mval.mv_data;
 299                 ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
 300                         r2, scope_chunk_free, NULL, NULL );
 301         }
 302         return ret;
 303 }
 304
 305 static void scope_chunk_ret( Operation *op, ID2 *scopes )
 306 {
 307         struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
 308         void *ret = NULL;
 309
 310         ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)scope_chunk_get,
 311                         &ret, NULL );
 312         scopes[0].mval.mv_data = ret;
 313         ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)scope_chunk_get,
 314                         (void *)scopes, scope_chunk_free, NULL, NULL );
 315 }
 316
 317 static void *search_stack( Operation *op );
 318
 319 typedef struct ww_ctx {
 320         MDB_txn *txn;
 321         int flag;
 322 } ww_ctx;
 323
 324 static void
 325 mdb_writewait( Operation *op, slap_callback *sc )
 326 {
 327         ww_ctx *ww = sc->sc_private;
 328         if ( !ww->flag ) {
 329                 mdb_txn_reset( ww->txn );
 330                 ww->flag = 1;
 331         }
 332 }
 333
 334 int
 335 mdb_search( Operation *op, SlapReply *rs )
 336 {
 337         struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
 338         ID              id, cursor, nsubs, ncand, cscope;
 339         ID              lastid = NOID;
 340         ID              candidates[MDB_IDL_UM_SIZE];
 341         ID              iscopes[MDB_IDL_DB_SIZE];
 342         ID2             *scopes;
 343         void    *stack;
 344         Entry           *e = NULL, *base = NULL;
 345         Entry           *matched = NULL;
 346         AttributeName   *attrs;
 347         slap_mask_t     mask;
 348         time_t          stoptime;
 349         int             manageDSAit;
 350         int             tentries = 0;
 351         IdScopes        isc;
 352         MDB_cursor      *mci, *mcd;
 353         ww_ctx wwctx;
 354         slap_callback cb = { 0 };
 355
 356         mdb_op_info     opinfo = {{{0}}}, *moi = &opinfo;
 357         MDB_txn                 *ltid = NULL;
 358
 359         Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(mdb_search) "\n", 0, 0, 0);
 360         attrs = op->oq_search.rs_attrs;
 361
 362         manageDSAit = get_manageDSAit( op );
 363
 364         rs->sr_err = mdb_opinfo_get( op, mdb, 1, &moi );
 365         switch(rs->sr_err) {
 366         case 0:
 367                 break;
 368         default:
 369                 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
 370                 return rs->sr_err;
 371         }
 372
 373         ltid = moi->moi_txn;
 374
 375         rs->sr_err = mdb_cursor_open( ltid, mdb->mi_id2entry, &mci );
 376         if ( rs->sr_err ) {
 377                 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
 378                 return rs->sr_err;
 379         }
 380
 381         rs->sr_err = mdb_cursor_open( ltid, mdb->mi_dn2id, &mcd );
 382         if ( rs->sr_err ) {
 383                 mdb_cursor_close( mci );
 384                 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
 385                 return rs->sr_err;
 386         }
 387
 388         scopes = scope_chunk_get( op );
 389         stack = search_stack( op );
 390         isc.mt = ltid;
 391         isc.mc = mcd;
 392         isc.scopes = scopes;
 393         isc.oscope = op->ors_scope;
 394         isc.sctmp = stack;
 395
 396         if ( op->ors_deref & LDAP_DEREF_FINDING ) {
 397                 MDB_IDL_ZERO(candidates);
 398         }
 399 dn2entry_retry:
 400         /* get entry with reader lock */
 401         rs->sr_err = mdb_dn2entry( op, ltid, mcd, &op->o_req_ndn, &e, &nsubs, 1 );
 402
 403         switch(rs->sr_err) {
 404         case MDB_NOTFOUND:
 405                 matched = e;
 406                 e = NULL;
 407                 break;
 408         case 0:
 409                 break;
 410         case LDAP_BUSY:
 411                 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
 412                 goto done;
 413         default:
 414                 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
 415                 goto done;
 416         }
 417
 418         if ( op->ors_deref & LDAP_DEREF_FINDING ) {
 419                 if ( matched && is_entry_alias( matched )) {
 420                         struct berval stub;
 421
 422                         stub.bv_val = op->o_req_ndn.bv_val;
 423                         stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
 424                         e = deref_base( op, rs, matched, &matched, ltid,
 425                                 candidates, NULL );
 426                         if ( e ) {
 427                                 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
 428                                         op->o_tmpmemctx );
 429                                 mdb_entry_return(op, e);
 430                                 matched = NULL;
 431                                 goto dn2entry_retry;
 432                         }
 433                 } else if ( e && is_entry_alias( e )) {
 434                         e = deref_base( op, rs, e, &matched, ltid,
 435                                 candidates, NULL );
 436                 }
 437         }
 438
 439         if ( e == NULL ) {
 440                 struct berval matched_dn = BER_BVNULL;
 441
 442                 if ( matched != NULL ) {
 443                         BerVarray erefs = NULL;
 444
 445                         /* return referral only if "disclose"
 446                          * is granted on the object */
 447                         if ( ! access_allowed( op, matched,
 448                                                 slap_schema.si_ad_entry,
 449                                                 NULL, ACL_DISCLOSE, NULL ) )
 450                         {
 451                                 rs->sr_err = LDAP_NO_SUCH_OBJECT;
 452
 453                         } else {
 454                                 ber_dupbv( &matched_dn, &matched->e_name );
 455
 456                                 erefs = is_entry_referral( matched )
 457                                         ? get_entry_referrals( op, matched )
 458                                         : NULL;
 459                                 if ( rs->sr_err == MDB_NOTFOUND )
 460                                         rs->sr_err = LDAP_REFERRAL;
 461                                 rs->sr_matched = matched_dn.bv_val;
 462                         }
 463
 464                         mdb_entry_return(op, matched);
 465                         matched = NULL;
 466
 467                         if ( erefs ) {
 468                                 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
 469                                         &op->o_req_dn, op->oq_search.rs_scope );
 470                                 ber_bvarray_free( erefs );
 471                         }
 472
 473                 } else {
 474                         rs->sr_ref = referral_rewrite( default_referral,
 475                                 NULL, &op->o_req_dn, op->oq_search.rs_scope );
 476                         rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
 477                 }
 478
 479                 send_ldap_result( op, rs );
 480
 481                 if ( rs->sr_ref ) {
 482                         ber_bvarray_free( rs->sr_ref );
 483                         rs->sr_ref = NULL;
 484                 }
 485                 if ( !BER_BVISNULL( &matched_dn ) ) {
 486                         ber_memfree( matched_dn.bv_val );
 487                         rs->sr_matched = NULL;
 488                 }
 489                 goto done;
 490         }
 491
 492         /* NOTE: __NEW__ "search" access is required
 493          * on searchBase object */
 494         if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
 495                                 NULL, ACL_SEARCH, NULL, &mask ) )
 496         {
 497                 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
 498                         rs->sr_err = LDAP_NO_SUCH_OBJECT;
 499                 } else {
 500                         rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
 501                 }
 502
 503                 mdb_entry_return( op,e);
 504                 send_ldap_result( op, rs );
 505                 goto done;
 506         }
 507
 508         if ( !manageDSAit && is_entry_referral( e ) ) {
 509                 /* entry is a referral */
 510                 struct berval matched_dn = BER_BVNULL;
 511                 BerVarray erefs = NULL;
 512
 513                 ber_dupbv( &matched_dn, &e->e_name );
 514                 erefs = get_entry_referrals( op, e );
 515
 516                 rs->sr_err = LDAP_REFERRAL;
 517
 518                 mdb_entry_return( op, e );
 519                 e = NULL;
 520
 521                 if ( erefs ) {
 522                         rs->sr_ref = referral_rewrite( erefs, &matched_dn,
 523                                 &op->o_req_dn, op->oq_search.rs_scope );
 524                         ber_bvarray_free( erefs );
 525
 526                         if ( !rs->sr_ref ) {
 527                                 rs->sr_text = "bad_referral object";
 528                         }
 529                 }
 530
 531                 Debug( LDAP_DEBUG_TRACE,
 532                         LDAP_XSTRING(mdb_search) ": entry is referral\n",
 533                         0, 0, 0 );
 534
 535                 rs->sr_matched = matched_dn.bv_val;
 536                 send_ldap_result( op, rs );
 537
 538                 ber_bvarray_free( rs->sr_ref );
 539                 rs->sr_ref = NULL;
 540                 ber_memfree( matched_dn.bv_val );
 541                 rs->sr_matched = NULL;
 542                 goto done;
 543         }
 544
 545         if ( get_assert( op ) &&
 546                 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
 547         {
 548                 rs->sr_err = LDAP_ASSERTION_FAILED;
 549                 mdb_entry_return( op,e);
 550                 send_ldap_result( op, rs );
 551                 goto done;
 552         }
 553
 554         /* compute it anyway; root does not use it */
 555         stoptime = op->o_time + op->ors_tlimit;
 556
 557         base = e;
 558
 559         e = NULL;
 560
 561         /* select candidates */
 562         if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
 563                 rs->sr_err = base_candidate( op->o_bd, base, candidates );
 564                 scopes[0].mid = 0;
 565                 ncand = 1;
 566         } else {
 567                 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
 568                         size_t nkids;
 569                         MDB_val key, data;
 570                         key.mv_data = &base->e_id;
 571                         key.mv_size = sizeof( ID );
 572                         mdb_cursor_get( mcd, &key, &data, MDB_SET );
 573                         mdb_cursor_count( mcd, &nkids );
 574                         nsubs = nkids - 1;
 575                 } else if ( !base->e_id ) {
 576                         /* we don't maintain nsubs for entryID 0.
 577                          * just grab entry count from id2entry stat
 578                          */
 579                         MDB_stat ms;
 580                         mdb_stat( ltid, mdb->mi_id2entry, &ms );
 581                         nsubs = ms.ms_entries;
 582                 }
 583                 MDB_IDL_ZERO( candidates );
 584                 scopes[0].mid = 1;
 585                 scopes[1].mid = base->e_id;
 586                 scopes[1].mval.mv_data = NULL;
 587                 rs->sr_err = search_candidates( op, rs, base,
 588                         ltid, mci, candidates, scopes, stack );
 589                 ncand = MDB_IDL_N( candidates );
 590                 if ( !base->e_id || ncand == NOID ) {
 591                         /* grab entry count from id2entry stat
 592                          */
 593                         MDB_stat ms;
 594                         mdb_stat( ltid, mdb->mi_id2entry, &ms );
 595                         if ( !base->e_id )
 596                                 nsubs = ms.ms_entries;
 597                         if ( ncand == NOID )
 598                                 ncand = ms.ms_entries;
 599                 }
 600         }
 601
 602         /* start cursor at beginning of candidates.
 603          */
 604         cursor = 0;
 605
 606         if ( candidates[0] == 0 ) {
 607                 Debug( LDAP_DEBUG_TRACE,
 608                         LDAP_XSTRING(mdb_search) ": no candidates\n",
 609                         0, 0, 0 );
 610
 611                 goto nochange;
 612         }
 613
 614         /* if not root and candidates exceed to-be-checked entries, abort */
 615         if ( op->ors_limit      /* isroot == FALSE */ &&
 616                 op->ors_limit->lms_s_unchecked != -1 &&
 617                 ncand > (unsigned) op->ors_limit->lms_s_unchecked )
 618         {
 619                 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
 620                 send_ldap_result( op, rs );
 621                 rs->sr_err = LDAP_SUCCESS;
 622                 goto done;
 623         }
 624
 625         if ( op->ors_limit == NULL      /* isroot == TRUE */ ||
 626                 !op->ors_limit->lms_s_pr_hide )
 627         {
 628                 tentries = ncand;
 629         }
 630
 631         if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
 632                 PagedResultsState *ps = op->o_pagedresults_state;
 633                 /* deferred cookie parsing */
 634                 rs->sr_err = parse_paged_cookie( op, rs );
 635                 if ( rs->sr_err != LDAP_SUCCESS ) {
 636                         send_ldap_result( op, rs );
 637                         goto done;
 638                 }
 639
 640                 cursor = (ID) ps->ps_cookie;
 641                 if ( cursor && ps->ps_size == 0 ) {
 642                         rs->sr_err = LDAP_SUCCESS;
 643                         rs->sr_text = "search abandoned by pagedResult size=0";
 644                         send_ldap_result( op, rs );
 645                         goto done;
 646                 }
 647                 id = mdb_idl_first( candidates, &cursor );
 648                 if ( id == NOID ) {
 649                         Debug( LDAP_DEBUG_TRACE,
 650                                 LDAP_XSTRING(mdb_search)
 651                                 ": no paged results candidates\n",
 652                                 0, 0, 0 );
 653                         send_paged_response( op, rs, &lastid, 0 );
 654
 655                         rs->sr_err = LDAP_OTHER;
 656                         goto done;
 657                 }
 658                 if ( id == (ID)ps->ps_cookie )
 659                         id = mdb_idl_next( candidates, &cursor );
 660                 nsubs = ncand;  /* always bypass scope'd search */
 661                 goto loop_begin;
 662         }
 663         if ( nsubs < ncand ) {
 664                 int rc;
 665                 /* Do scope-based search */
 666
 667                 /* if any alias scopes were set, save them */
 668                 if (scopes[0].mid > 1) {
 669                         cursor = 1;
 670                         for (cscope = 1; cscope <= scopes[0].mid; cscope++) {
 671                                 /* Ignore the original base */
 672                                 if (scopes[cscope].mid == base->e_id)
 673                                         continue;
 674                                 iscopes[cursor++] = scopes[cscope].mid;
 675                         }
 676                         iscopes[0] = scopes[0].mid - 1;
 677                 } else {
 678                         iscopes[0] = 0;
 679                 }
 680
 681                 isc.id = base->e_id;
 682                 isc.numrdns = 0;
 683                 rc = mdb_dn2id_walk( op, &isc );
 684                 if ( rc )
 685                         id = NOID;
 686                 else
 687                         id = isc.id;
 688                 cscope = 0;
 689         } else {
 690                 id = mdb_idl_first( candidates, &cursor );
 691         }
 692
 693         wwctx.flag = 0;
 694         /* If we're running in our own read txn */
 695         if (  moi == &opinfo ) {
 696                 cb.sc_writewait = mdb_writewait;
 697                 cb.sc_private = &wwctx;
 698                 wwctx.txn = ltid;
 699                 cb.sc_next = op->o_callback;
 700                 op->o_callback = &cb;
 701         }
 702
 703         while (id != NOID)
 704         {
 705                 int scopeok;
 706                 MDB_val edata;
 707
 708 loop_begin:
 709
 710                 /* check for abandon */
 711                 if ( op->o_abandon ) {
 712                         rs->sr_err = SLAPD_ABANDON;
 713                         send_ldap_result( op, rs );
 714                         goto done;
 715                 }
 716
 717                 /* mostly needed by internal searches,
 718                  * e.g. related to syncrepl, for whom
 719                  * abandon does not get set... */
 720                 if ( slapd_shutdown ) {
 721                         rs->sr_err = LDAP_UNAVAILABLE;
 722                         send_ldap_disconnect( op, rs );
 723                         goto done;
 724                 }
 725
 726                 /* check time limit */
 727                 if ( op->ors_tlimit != SLAP_NO_LIMIT
 728                                 && slap_get_time() > stoptime )
 729                 {
 730                         rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
 731                         rs->sr_ref = rs->sr_v2ref;
 732                         send_ldap_result( op, rs );
 733                         rs->sr_err = LDAP_SUCCESS;
 734                         goto done;
 735                 }
 736
 737
 738                 if ( nsubs < ncand ) {
 739                         unsigned i;
 740                         /* Is this entry in the candidate list? */
 741                         scopeok = 0;
 742                         if (MDB_IDL_IS_RANGE( candidates )) {
 743                                 if ( id >= MDB_IDL_RANGE_FIRST( candidates ) &&
 744                                         id <= MDB_IDL_RANGE_LAST( candidates ))
 745                                         scopeok = 1;
 746                         } else {
 747                                 i = mdb_idl_search( candidates, id );
 748                                 if ( candidates[i] == id )
 749                                         scopeok = 1;
 750                         }
 751                         if ( scopeok )
 752                                 goto scopeok;
 753                         goto loop_continue;
 754                 }
 755
 756                 /* Does this candidate actually satisfy the search scope?
 757                  */
 758                 scopeok = 0;
 759                 isc.numrdns = 0;
 760                 switch( op->ors_scope ) {
 761                 case LDAP_SCOPE_BASE:
 762                         /* This is always true, yes? */
 763                         if ( id == base->e_id ) scopeok = 1;
 764                         break;
 765
 766 #ifdef LDAP_SCOPE_CHILDREN
 767                 case LDAP_SCOPE_CHILDREN:
 768                         if ( id == base->e_id ) break;
 769                         /* Fall-thru */
 770 #endif
 771                 case LDAP_SCOPE_SUBTREE:
 772                         if ( id == base->e_id ) {
 773                                 scopeok = 1;
 774                                 break;
 775                         }
 776                         /* Fall-thru */
 777                 case LDAP_SCOPE_ONELEVEL:
 778                         isc.id = id;
 779                         isc.nscope = 0;
 780                         rs->sr_err = mdb_idscopes( op, &isc );
 781                         if ( rs->sr_err == MDB_SUCCESS ) {
 782                                 if ( isc.nscope )
 783                                         scopeok = 1;
 784                         } else {
 785                                 if ( rs->sr_err == MDB_NOTFOUND )
 786                                         goto notfound;
 787                         }
 788                         break;
 789                 }
 790
 791                 /* Not in scope, ignore it */
 792                 if ( !scopeok )
 793                 {
 794                         Debug( LDAP_DEBUG_TRACE,
 795                                 LDAP_XSTRING(mdb_search)
 796                                 ": %ld scope not okay\n",
 797                                 (long) id, 0, 0 );
 798                         goto loop_continue;
 799                 }
 800
 801 scopeok:
 802                 if ( id == base->e_id ) {
 803                         e = base;
 804                 } else {
 805
 806                         /* get the entry */
 807                         rs->sr_err = mdb_id2edata( op, mci, id, &edata );
 808                         if ( rs->sr_err == MDB_NOTFOUND ) {
 809 notfound:
 810                                 if( nsubs < ncand )
 811                                         goto loop_continue;
 812
 813                                 if( !MDB_IDL_IS_RANGE(candidates) ) {
 814                                         /* only complain for non-range IDLs */
 815                                         Debug( LDAP_DEBUG_TRACE,
 816                                                 LDAP_XSTRING(mdb_search)
 817                                                 ": candidate %ld not found\n",
 818                                                 (long) id, 0, 0 );
 819                                 } else {
 820                                         /* get the next ID from the DB */
 821                                         rs->sr_err = mdb_get_nextid( mci, &cursor );
 822                                         if ( rs->sr_err == MDB_NOTFOUND ) {
 823                                                 break;
 824                                         }
 825                                         if ( rs->sr_err ) {
 826                                                 rs->sr_err = LDAP_OTHER;
 827                                                 rs->sr_text = "internal error in get_nextid";
 828                                                 send_ldap_result( op, rs );
 829                                                 goto done;
 830                                         }
 831                                         cursor--;
 832                                 }
 833
 834                                 goto loop_continue;
 835                         } else if ( rs->sr_err ) {
 836                                 rs->sr_err = LDAP_OTHER;
 837                                 rs->sr_text = "internal error in mdb_id2edata";
 838                                 send_ldap_result( op, rs );
 839                                 goto done;
 840                         }
 841
 842                         rs->sr_err = mdb_entry_decode( op, ltid, &edata, &e );
 843                         if ( rs->sr_err ) {
 844                                 rs->sr_err = LDAP_OTHER;
 845                                 rs->sr_text = "internal error in mdb_entry_decode";
 846                                 send_ldap_result( op, rs );
 847                                 goto done;
 848                         }
 849                         e->e_id = id;
 850                         e->e_name.bv_val = NULL;
 851                         e->e_nname.bv_val = NULL;
 852                 }
 853
 854                 if ( is_entry_subentry( e ) ) {
 855                         if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
 856                                 if(!get_subentries_visibility( op )) {
 857                                         /* only subentries are visible */
 858                                         goto loop_continue;
 859                                 }
 860
 861                         } else if ( get_subentries( op ) &&
 862                                 !get_subentries_visibility( op ))
 863                         {
 864                                 /* only subentries are visible */
 865                                 goto loop_continue;
 866                         }
 867
 868                 } else if ( get_subentries_visibility( op )) {
 869                         /* only subentries are visible */
 870                         goto loop_continue;
 871                 }
 872
 873                 /* aliases were already dereferenced in candidate list */
 874                 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
 875                         /* but if the search base is an alias, and we didn't
 876                          * deref it when finding, return it.
 877                          */
 878                         if ( is_entry_alias(e) &&
 879                                 ((op->ors_deref & LDAP_DEREF_FINDING) || e != base ))
 880                         {
 881                                 goto loop_continue;
 882                         }
 883                 }
 884
 885                 if ( !manageDSAit && is_entry_glue( e )) {
 886                         goto loop_continue;
 887                 }
 888
 889                 if (e != base) {
 890                         struct berval pdn, pndn;
 891                         char *d, *n;
 892                         int i;
 893
 894                         /* child of base, just append RDNs to base->e_name */
 895                         if ( nsubs < ncand || isc.scopes[isc.nscope].mid == base->e_id ) {
 896                                 pdn = base->e_name;
 897                                 pndn = base->e_nname;
 898                         } else {
 899                                 mdb_id2name( op, ltid, &isc.mc, scopes[isc.nscope].mid, &pdn, &pndn );
 900                         }
 901                         e->e_name.bv_len = pdn.bv_len;
 902                         e->e_nname.bv_len = pndn.bv_len;
 903                         for (i=0; i<isc.numrdns; i++) {
 904                                 e->e_name.bv_len += isc.rdns[i].bv_len + 1;
 905                                 e->e_nname.bv_len += isc.nrdns[i].bv_len + 1;
 906                         }
 907                         e->e_name.bv_val = op->o_tmpalloc(e->e_name.bv_len + 1, op->o_tmpmemctx);
 908                         e->e_nname.bv_val = op->o_tmpalloc(e->e_nname.bv_len + 1, op->o_tmpmemctx);
 909                         d = e->e_name.bv_val;
 910                         n = e->e_nname.bv_val;
 911                         if (nsubs < ncand) {
 912                                 /* RDNs are in top-down order */
 913                                 for (i=isc.numrdns-1; i>=0; i--) {
 914                                         memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
 915                                         d += isc.rdns[i].bv_len;
 916                                         *d++ = ',';
 917                                         memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
 918                                         n += isc.nrdns[i].bv_len;
 919                                         *n++ = ',';
 920                                 }
 921                         } else {
 922                                 /* RDNs are in bottom-up order */
 923                                 for (i=0; i<isc.numrdns; i++) {
 924                                         memcpy(d, isc.rdns[i].bv_val, isc.rdns[i].bv_len);
 925                                         d += isc.rdns[i].bv_len;
 926                                         *d++ = ',';
 927                                         memcpy(n, isc.nrdns[i].bv_val, isc.nrdns[i].bv_len);
 928                                         n += isc.nrdns[i].bv_len;
 929                                         *n++ = ',';
 930                                 }
 931                         }
 932
 933                         if (pdn.bv_len) {
 934                                 memcpy(d, pdn.bv_val, pdn.bv_len+1);
 935                                 memcpy(n, pndn.bv_val, pndn.bv_len+1);
 936                         } else {
 937                                 *--d = '\0';
 938                                 *--n = '\0';
 939                                 e->e_name.bv_len--;
 940                                 e->e_nname.bv_len--;
 941                         }
 942                         if (pndn.bv_val != base->e_nname.bv_val) {
 943                                 op->o_tmpfree(pndn.bv_val, op->o_tmpmemctx);
 944                                 op->o_tmpfree(pdn.bv_val, op->o_tmpmemctx);
 945                         }
 946                 }
 947
 948                 /*
 949                  * if it's a referral, add it to the list of referrals. only do
 950                  * this for non-base searches, and don't check the filter
 951                  * explicitly here since it's only a candidate anyway.
 952                  */
 953                 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
 954                         && is_entry_referral( e ) )
 955                 {
 956                         BerVarray erefs = get_entry_referrals( op, e );
 957                         rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
 958                                 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
 959                                         ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
 960
 961                         rs->sr_entry = e;
 962                         rs->sr_flags = 0;
 963
 964                         send_search_reference( op, rs );
 965                         if ( wwctx.flag ) {
 966                                 wwctx.flag = 0;
 967                                 mdb_txn_renew( ltid );
 968                                 mdb_cursor_renew( ltid, mci );
 969                                 mdb_cursor_renew( ltid, mcd );
 970                         }
 971
 972                         mdb_entry_return( op, e );
 973                         rs->sr_entry = NULL;
 974                         e = NULL;
 975
 976                         ber_bvarray_free( rs->sr_ref );
 977                         ber_bvarray_free( erefs );
 978                         rs->sr_ref = NULL;
 979
 980                         goto loop_continue;
 981                 }
 982
 983                 /* if it matches the filter and scope, send it */
 984                 rs->sr_err = test_filter( op, e, op->oq_search.rs_filter );
 985
 986                 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
 987                         /* check size limit */
 988                         if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
 989                                 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
 990                                         mdb_entry_return( op, e );
 991                                         e = NULL;
 992                                         send_paged_response( op, rs, &lastid, tentries );
 993                                         goto done;
 994                                 }
 995                                 lastid = id;
 996                         }
 997
 998                         if (e) {
 999                                 /* safe default */
1000                                 rs->sr_attrs = op->oq_search.rs_attrs;
1001                                 rs->sr_operational_attrs = NULL;
1002                                 rs->sr_ctrls = NULL;
1003                                 rs->sr_entry = e;
1004                                 RS_ASSERT( e->e_private != NULL );
1005                                 rs->sr_flags = 0;
1006                                 rs->sr_err = LDAP_SUCCESS;
1007                                 rs->sr_err = send_search_entry( op, rs );
1008                                 if ( wwctx.flag ) {
1009                                         wwctx.flag = 0;
1010                                         mdb_txn_renew( ltid );
1011                                         mdb_cursor_renew( ltid, mci );
1012                                         mdb_cursor_renew( ltid, mcd );
1013                                 }
1014                                 rs->sr_attrs = NULL;
1015                                 rs->sr_entry = NULL;
1016                                 if (e != base)
1017                                         mdb_entry_return( op, e );
1018                                 e = NULL;
1019
1020                                 switch ( rs->sr_err ) {
1021                                 case LDAP_SUCCESS:      /* entry sent ok */
1022                                         break;
1023                                 default:                /* entry not sent */
1024                                         break;
1025                                 case LDAP_BUSY:
1026                                         send_ldap_result( op, rs );
1027                                         goto done;
1028                                 case LDAP_UNAVAILABLE:
1029                                 case LDAP_SIZELIMIT_EXCEEDED:
1030                                         if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
1031                                                 rs->sr_ref = rs->sr_v2ref;
1032                                                 send_ldap_result( op, rs );
1033                                                 rs->sr_err = LDAP_SUCCESS;
1034
1035                                         } else {
1036                                                 rs->sr_err = LDAP_OTHER;
1037                                         }
1038                                         goto done;
1039                                 }
1040                         }
1041
1042                 } else {
1043                         Debug( LDAP_DEBUG_TRACE,
1044                                 LDAP_XSTRING(mdb_search)
1045                                 ": %ld does not match filter\n",
1046                                 (long) id, 0, 0 );
1047                 }
1048
1049 loop_continue:
1050                 if( e != NULL ) {
1051                         if ( e != base )
1052                                 mdb_entry_return( op, e );
1053                         RS_ASSERT( rs->sr_entry == NULL );
1054                         e = NULL;
1055                         rs->sr_entry = NULL;
1056                 }
1057
1058                 if ( nsubs < ncand ) {
1059                         int rc = mdb_dn2id_walk( op, &isc );
1060                         if (rc) {
1061                                 id = NOID;
1062                                 /* We got to the end of a subtree. If there are any
1063                                  * alias scopes left, search them too.
1064                                  */
1065                                 while (iscopes[0] && cscope < iscopes[0]) {
1066                                         cscope++;
1067                                         isc.id = iscopes[cscope];
1068                                         if ( base )
1069                                                 mdb_entry_return( op, base );
1070                                         rs->sr_err = mdb_id2entry(op, mci, isc.id, &base);
1071                                         if ( !rs->sr_err ) {
1072                                                 mdb_id2name( op, ltid, &isc.mc, isc.id, &base->e_name, &base->e_nname );
1073                                                 isc.numrdns = 0;
1074                                                 if (isc.oscope == LDAP_SCOPE_ONELEVEL)
1075                                                         isc.oscope = LDAP_SCOPE_BASE;
1076                                                 rc = mdb_dn2id_walk( op, &isc );
1077                                                 if ( !rc ) {
1078                                                         id = isc.id;
1079                                                         break;
1080                                                 }
1081                                         }
1082                                 }
1083                         } else
1084                                 id = isc.id;
1085                 } else {
1086                         id = mdb_idl_next( candidates, &cursor );
1087                 }
1088         }
1089
1090 nochange:
1091         rs->sr_ctrls = NULL;
1092         rs->sr_ref = rs->sr_v2ref;
1093         rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1094         rs->sr_rspoid = NULL;
1095         if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1096                 send_paged_response( op, rs, NULL, 0 );
1097         } else {
1098                 send_ldap_result( op, rs );
1099         }
1100
1101         rs->sr_err = LDAP_SUCCESS;
1102
1103 done:
1104         if ( cb.sc_private ) {
1105                 /* remove our writewait callback */
1106                 slap_callback **scp = &op->o_callback;
1107                 while ( *scp ) {
1108                         if ( *scp == &cb ) {
1109                                 *scp = cb.sc_next;
1110                                 cb.sc_private = NULL;
1111                                 break;
1112                         }
1113                 }
1114         }
1115         mdb_cursor_close( mcd );
1116         mdb_cursor_close( mci );
1117         if ( moi == &opinfo ) {
1118                 mdb_txn_reset( moi->moi_txn );
1119                 LDAP_SLIST_REMOVE( &op->o_extra, &moi->moi_oe, OpExtra, oe_next );
1120         } else {
1121                 moi->moi_ref--;
1122         }
1123         if( rs->sr_v2ref ) {
1124                 ber_bvarray_free( rs->sr_v2ref );
1125                 rs->sr_v2ref = NULL;
1126         }
1127         if (base)
1128                 mdb_entry_return( op,base);
1129         scope_chunk_ret( op, scopes );
1130
1131         return rs->sr_err;
1132 }
1133
1134
1135 static int base_candidate(
1136         BackendDB       *be,
1137         Entry   *e,
1138         ID              *ids )
1139 {
1140         Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1141                 e->e_nname.bv_val, (long) e->e_id, 0);
1142
1143         ids[0] = 1;
1144         ids[1] = e->e_id;
1145         return 0;
1146 }
1147
1148 /* Look for "objectClass Present" in this filter.
1149  * Also count depth of filter tree while we're at it.
1150  */
1151 static int oc_filter(
1152         Filter *f,
1153         int cur,
1154         int *max )
1155 {
1156         int rc = 0;
1157
1158         assert( f != NULL );
1159
1160         if( cur > *max ) *max = cur;
1161
1162         switch( f->f_choice ) {
1163         case LDAP_FILTER_PRESENT:
1164                 if (f->f_desc == slap_schema.si_ad_objectClass) {
1165                         rc = 1;
1166                 }
1167                 break;
1168
1169         case LDAP_FILTER_AND:
1170         case LDAP_FILTER_OR:
1171                 cur++;
1172                 for ( f=f->f_and; f; f=f->f_next ) {
1173                         (void) oc_filter(f, cur, max);
1174                 }
1175                 break;
1176
1177         default:
1178                 break;
1179         }
1180         return rc;
1181 }
1182
1183 static void search_stack_free( void *key, void *data )
1184 {
1185         ber_memfree_x(data, NULL);
1186 }
1187
1188 static void *search_stack( Operation *op )
1189 {
1190         struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1191         void *ret = NULL;
1192
1193         if ( op->o_threadctx ) {
1194                 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)search_stack,
1195                         &ret, NULL );
1196         } else {
1197                 ret = mdb->mi_search_stack;
1198         }
1199
1200         if ( !ret ) {
1201                 ret = ch_malloc( mdb->mi_search_stack_depth * MDB_IDL_UM_SIZE
1202                         * sizeof( ID ) );
1203                 if ( op->o_threadctx ) {
1204                         ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)search_stack,
1205                                 ret, search_stack_free, NULL, NULL );
1206                 } else {
1207                         mdb->mi_search_stack = ret;
1208                 }
1209         }
1210         return ret;
1211 }
1212
1213 static int search_candidates(
1214         Operation *op,
1215         SlapReply *rs,
1216         Entry *e,
1217         MDB_txn *txn,
1218         MDB_cursor *mci,
1219         ID      *ids,
1220         ID2L    scopes,
1221         ID *stack )
1222 {
1223         struct mdb_info *mdb = (struct mdb_info *) op->o_bd->be_private;
1224         int rc, depth = 1;
1225         Filter          *f, rf, xf, nf, sf;
1226         AttributeAssertion aa_ref = ATTRIBUTEASSERTION_INIT;
1227         AttributeAssertion aa_subentry = ATTRIBUTEASSERTION_INIT;
1228
1229         /*
1230          * This routine takes as input a filter (user-filter)
1231          * and rewrites it as follows:
1232          *      (&(scope=DN)[(objectClass=subentry)]
1233          *              (|[(objectClass=referral)](user-filter))
1234          */
1235
1236         Debug(LDAP_DEBUG_TRACE,
1237                 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1238                 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1239
1240         f = op->oq_search.rs_filter;
1241
1242         /* If the user's filter uses objectClass=*,
1243          * these clauses are redundant.
1244          */
1245         if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1246                 && !get_subentries_visibility(op)) {
1247                 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1248                         /* match referral objects */
1249                         struct berval bv_ref = BER_BVC( "referral" );
1250                         rf.f_choice = LDAP_FILTER_EQUALITY;
1251                         rf.f_ava = &aa_ref;
1252                         rf.f_av_desc = slap_schema.si_ad_objectClass;
1253                         rf.f_av_value = bv_ref;
1254                         rf.f_next = f;
1255                         xf.f_or = &rf;
1256                         xf.f_choice = LDAP_FILTER_OR;
1257                         xf.f_next = NULL;
1258                         f = &xf;
1259                         depth++;
1260                 }
1261         }
1262
1263         if( get_subentries_visibility( op ) ) {
1264                 struct berval bv_subentry = BER_BVC( "subentry" );
1265                 sf.f_choice = LDAP_FILTER_EQUALITY;
1266                 sf.f_ava = &aa_subentry;
1267                 sf.f_av_desc = slap_schema.si_ad_objectClass;
1268                 sf.f_av_value = bv_subentry;
1269                 sf.f_next = f;
1270                 nf.f_choice = LDAP_FILTER_AND;
1271                 nf.f_and = &sf;
1272                 nf.f_next = NULL;
1273                 f = &nf;
1274                 depth++;
1275         }
1276
1277         /* Allocate IDL stack, plus 1 more for former tmp */
1278         if ( depth+1 > mdb->mi_search_stack_depth ) {
1279                 stack = ch_malloc( (depth + 1) * MDB_IDL_UM_SIZE * sizeof( ID ) );
1280         }
1281
1282         if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1283                 rc = search_aliases( op, rs, e->e_id, txn, mci, scopes, stack );
1284         } else {
1285                 rc = LDAP_SUCCESS;
1286         }
1287
1288         if ( rc == LDAP_SUCCESS ) {
1289                 rc = mdb_filter_candidates( op, txn, f, ids,
1290                         stack, stack+MDB_IDL_UM_SIZE );
1291         }
1292
1293         if ( depth+1 > mdb->mi_search_stack_depth ) {
1294                 ch_free( stack );
1295         }
1296
1297         if( rc ) {
1298                 Debug(LDAP_DEBUG_TRACE,
1299                         "mdb_search_candidates: failed (rc=%d)\n",
1300                         rc, NULL, NULL );
1301
1302         } else {
1303                 Debug(LDAP_DEBUG_TRACE,
1304                         "mdb_search_candidates: id=%ld first=%ld last=%ld\n",
1305                         (long) ids[0],
1306                         (long) MDB_IDL_FIRST(ids),
1307                         (long) MDB_IDL_LAST(ids) );
1308         }
1309
1310         return rc;
1311 }
1312
1313 static int
1314 parse_paged_cookie( Operation *op, SlapReply *rs )
1315 {
1316         int             rc = LDAP_SUCCESS;
1317         PagedResultsState *ps = op->o_pagedresults_state;
1318
1319         /* this function must be invoked only if the pagedResults
1320          * control has been detected, parsed and partially checked
1321          * by the frontend */
1322         assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1323
1324         /* cookie decoding/checks deferred to backend... */
1325         if ( ps->ps_cookieval.bv_len ) {
1326                 PagedResultsCookie reqcookie;
1327                 if( ps->ps_cookieval.bv_len != sizeof( reqcookie ) ) {
1328                         /* bad cookie */
1329                         rs->sr_text = "paged results cookie is invalid";
1330                         rc = LDAP_PROTOCOL_ERROR;
1331                         goto done;
1332                 }
1333
1334                 AC_MEMCPY( &reqcookie, ps->ps_cookieval.bv_val, sizeof( reqcookie ));
1335
1336                 if ( reqcookie > ps->ps_cookie ) {
1337                         /* bad cookie */
1338                         rs->sr_text = "paged results cookie is invalid";
1339                         rc = LDAP_PROTOCOL_ERROR;
1340                         goto done;
1341
1342                 } else if ( reqcookie < ps->ps_cookie ) {
1343                         rs->sr_text = "paged results cookie is invalid or old";
1344                         rc = LDAP_UNWILLING_TO_PERFORM;
1345                         goto done;
1346                 }
1347
1348         } else {
1349                 /* we're going to use ps_cookie */
1350                 op->o_conn->c_pagedresults_state.ps_cookie = 0;
1351         }
1352
1353 done:;
1354
1355         return rc;
1356 }
1357
1358 static void
1359 send_paged_response(
1360         Operation       *op,
1361         SlapReply       *rs,
1362         ID              *lastid,
1363         int             tentries )
1364 {
1365         LDAPControl     *ctrls[2];
1366         BerElementBuffer berbuf;
1367         BerElement      *ber = (BerElement *)&berbuf;
1368         PagedResultsCookie respcookie;
1369         struct berval cookie;
1370
1371         Debug(LDAP_DEBUG_ARGS,
1372                 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1373                 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1374
1375         ctrls[1] = NULL;
1376
1377         ber_init2( ber, NULL, LBER_USE_DER );
1378
1379         if ( lastid ) {
1380                 respcookie = ( PagedResultsCookie )(*lastid);
1381                 cookie.bv_len = sizeof( respcookie );
1382                 cookie.bv_val = (char *)&respcookie;
1383
1384         } else {
1385                 respcookie = ( PagedResultsCookie )0;
1386                 BER_BVSTR( &cookie, "" );
1387         }
1388
1389         op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1390         op->o_conn->c_pagedresults_state.ps_count =
1391                 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1392                 rs->sr_nentries;
1393
1394         /* return size of 0 -- no estimate */
1395         ber_printf( ber, "{iO}", 0, &cookie );
1396
1397         ctrls[0] = op->o_tmpalloc( sizeof(LDAPControl), op->o_tmpmemctx );
1398         if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1399                 goto done;
1400         }
1401
1402         ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1403         ctrls[0]->ldctl_iscritical = 0;
1404
1405         slap_add_ctrls( op, rs, ctrls );
1406         rs->sr_err = LDAP_SUCCESS;
1407         send_ldap_result( op, rs );
1408
1409 done:
1410         (void) ber_free_buf( ber );
1411 }