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