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-2009 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 int
 314 bdb_search( Operation *op, SlapReply *rs )
 315 {
 316         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
 317         ID              id, cursor;
 318         ID              lastid = NOID;
 319         ID              candidates[BDB_IDL_UM_SIZE];
 320         ID              scopes[BDB_IDL_DB_SIZE];
 321         Entry           *e = NULL, base, *e_root;
 322         Entry           *matched = NULL;
 323         EntryInfo       *ei;
 324         AttributeName   *attrs;
 325         struct berval   realbase = BER_BVNULL;
 326         slap_mask_t     mask;
 327         time_t          stoptime;
 328         int             manageDSAit;
 329         int             tentries = 0;
 330         unsigned        nentries = 0;
 331         int             idflag = 0;
 332
 333         DB_LOCK         lock;
 334         struct  bdb_op_info     *opinfo = NULL;
 335         DB_TXN                  *ltid = NULL;
 336         OpExtra *oex;
 337
 338         Debug( LDAP_DEBUG_TRACE, "=> " LDAP_XSTRING(bdb_search) "\n", 0, 0, 0);
 339         attrs = op->oq_search.rs_attrs;
 340
 341         LDAP_SLIST_FOREACH( oex, &op->o_extra, oe_next ) {
 342                 if ( oex->oe_key == bdb )
 343                         break;
 344         }
 345         opinfo = (struct bdb_op_info *) oex;
 346
 347         manageDSAit = get_manageDSAit( op );
 348
 349         if ( opinfo && opinfo->boi_txn ) {
 350                 ltid = opinfo->boi_txn;
 351         } else {
 352                 rs->sr_err = bdb_reader_get( op, bdb->bi_dbenv, &ltid );
 353
 354                 switch(rs->sr_err) {
 355                 case 0:
 356                         break;
 357                 default:
 358                         send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
 359                         return rs->sr_err;
 360                 }
 361         }
 362
 363         e_root = bdb->bi_cache.c_dntree.bei_e;
 364         if ( op->o_req_ndn.bv_len == 0 ) {
 365                 /* DIT root special case */
 366                 ei = e_root->e_private;
 367                 rs->sr_err = LDAP_SUCCESS;
 368         } else {
 369                 if ( op->ors_deref & LDAP_DEREF_FINDING ) {
 370                         BDB_IDL_ZERO(candidates);
 371                 }
 372 dn2entry_retry:
 373                 /* get entry with reader lock */
 374                 rs->sr_err = bdb_dn2entry( op, ltid, &op->o_req_ndn, &ei,
 375                         1, &lock );
 376         }
 377
 378         switch(rs->sr_err) {
 379         case DB_NOTFOUND:
 380                 matched = ei->bei_e;
 381                 break;
 382         case 0:
 383                 e = ei->bei_e;
 384                 break;
 385         case DB_LOCK_DEADLOCK:
 386                 if ( !opinfo ) {
 387                         ltid->flags &= ~TXN_DEADLOCK;
 388                         goto dn2entry_retry;
 389                 }
 390                 opinfo->boi_err = rs->sr_err;
 391                 /* FALLTHRU */
 392         case LDAP_BUSY:
 393                 send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
 394                 return LDAP_BUSY;
 395         case DB_LOCK_NOTGRANTED:
 396                 goto dn2entry_retry;
 397         default:
 398                 send_ldap_error( op, rs, LDAP_OTHER, "internal error" );
 399                 return rs->sr_err;
 400         }
 401
 402         if ( op->ors_deref & LDAP_DEREF_FINDING ) {
 403                 if ( matched && is_entry_alias( matched )) {
 404                         struct berval stub;
 405
 406                         stub.bv_val = op->o_req_ndn.bv_val;
 407                         stub.bv_len = op->o_req_ndn.bv_len - matched->e_nname.bv_len - 1;
 408                         e = deref_base( op, rs, matched, &matched, ltid, &lock,
 409                                 candidates, NULL );
 410                         if ( e ) {
 411                                 build_new_dn( &op->o_req_ndn, &e->e_nname, &stub,
 412                                         op->o_tmpmemctx );
 413                                 bdb_cache_return_entry_r (bdb, e, &lock);
 414                                 matched = NULL;
 415                                 goto dn2entry_retry;
 416                         }
 417                 } else if ( e && is_entry_alias( e )) {
 418                         e = deref_base( op, rs, e, &matched, ltid, &lock,
 419                                 candidates, NULL );
 420                 }
 421         }
 422
 423         if ( e == NULL ) {
 424                 struct berval matched_dn = BER_BVNULL;
 425
 426                 if ( matched != NULL ) {
 427                         BerVarray erefs = NULL;
 428
 429                         /* return referral only if "disclose"
 430                          * is granted on the object */
 431                         if ( ! access_allowed( op, matched,
 432                                                 slap_schema.si_ad_entry,
 433                                                 NULL, ACL_DISCLOSE, NULL ) )
 434                         {
 435                                 rs->sr_err = LDAP_NO_SUCH_OBJECT;
 436
 437                         } else {
 438                                 ber_dupbv( &matched_dn, &matched->e_name );
 439
 440                                 erefs = is_entry_referral( matched )
 441                                         ? get_entry_referrals( op, matched )
 442                                         : NULL;
 443                                 if ( rs->sr_err == DB_NOTFOUND )
 444                                         rs->sr_err = LDAP_REFERRAL;
 445                                 rs->sr_matched = matched_dn.bv_val;
 446                         }
 447
 448 #ifdef SLAP_ZONE_ALLOC
 449                         slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
 450 #endif
 451                         bdb_cache_return_entry_r (bdb, matched, &lock);
 452                         matched = NULL;
 453
 454                         if ( erefs ) {
 455                                 rs->sr_ref = referral_rewrite( erefs, &matched_dn,
 456                                         &op->o_req_dn, op->oq_search.rs_scope );
 457                                 ber_bvarray_free( erefs );
 458                         }
 459
 460                 } else {
 461 #ifdef SLAP_ZONE_ALLOC
 462                         slap_zn_runlock(bdb->bi_cache.c_zctx, matched);
 463 #endif
 464                         rs->sr_ref = referral_rewrite( default_referral,
 465                                 NULL, &op->o_req_dn, op->oq_search.rs_scope );
 466                         rs->sr_err = rs->sr_ref != NULL ? LDAP_REFERRAL : LDAP_NO_SUCH_OBJECT;
 467                 }
 468
 469                 send_ldap_result( op, rs );
 470
 471                 if ( rs->sr_ref ) {
 472                         ber_bvarray_free( rs->sr_ref );
 473                         rs->sr_ref = NULL;
 474                 }
 475                 if ( !BER_BVISNULL( &matched_dn ) ) {
 476                         ber_memfree( matched_dn.bv_val );
 477                         rs->sr_matched = NULL;
 478                 }
 479                 return rs->sr_err;
 480         }
 481
 482         /* NOTE: __NEW__ "search" access is required
 483          * on searchBase object */
 484         if ( ! access_allowed_mask( op, e, slap_schema.si_ad_entry,
 485                                 NULL, ACL_SEARCH, NULL, &mask ) )
 486         {
 487                 if ( !ACL_GRANT( mask, ACL_DISCLOSE ) ) {
 488                         rs->sr_err = LDAP_NO_SUCH_OBJECT;
 489                 } else {
 490                         rs->sr_err = LDAP_INSUFFICIENT_ACCESS;
 491                 }
 492
 493 #ifdef SLAP_ZONE_ALLOC
 494                 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 495 #endif
 496                 if ( e != e_root ) {
 497                         bdb_cache_return_entry_r(bdb, e, &lock);
 498                 }
 499                 send_ldap_result( op, rs );
 500                 return rs->sr_err;
 501         }
 502
 503         if ( !manageDSAit && e != e_root && is_entry_referral( e ) ) {
 504                 /* entry is a referral, don't allow add */
 505                 struct berval matched_dn = BER_BVNULL;
 506                 BerVarray erefs = NULL;
 507
 508                 ber_dupbv( &matched_dn, &e->e_name );
 509                 erefs = get_entry_referrals( op, e );
 510
 511                 rs->sr_err = LDAP_REFERRAL;
 512
 513 #ifdef SLAP_ZONE_ALLOC
 514                 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 515 #endif
 516                 bdb_cache_return_entry_r( bdb, e, &lock );
 517                 e = NULL;
 518
 519                 if ( erefs ) {
 520                         rs->sr_ref = referral_rewrite( erefs, &matched_dn,
 521                                 &op->o_req_dn, op->oq_search.rs_scope );
 522                         ber_bvarray_free( erefs );
 523
 524                         if ( !rs->sr_ref ) {
 525                                 rs->sr_text = "bad_referral object";
 526                         }
 527                 }
 528
 529                 Debug( LDAP_DEBUG_TRACE,
 530                         LDAP_XSTRING(bdb_search) ": entry is referral\n",
 531                         0, 0, 0 );
 532
 533                 rs->sr_matched = matched_dn.bv_val;
 534                 send_ldap_result( op, rs );
 535
 536                 ber_bvarray_free( rs->sr_ref );
 537                 rs->sr_ref = NULL;
 538                 ber_memfree( matched_dn.bv_val );
 539                 rs->sr_matched = NULL;
 540                 return 1;
 541         }
 542
 543         if ( get_assert( op ) &&
 544                 ( test_filter( op, e, get_assertion( op )) != LDAP_COMPARE_TRUE ))
 545         {
 546                 rs->sr_err = LDAP_ASSERTION_FAILED;
 547 #ifdef SLAP_ZONE_ALLOC
 548                 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 549 #endif
 550                 if ( e != e_root ) {
 551                         bdb_cache_return_entry_r(bdb, e, &lock);
 552                 }
 553                 send_ldap_result( op, rs );
 554                 return 1;
 555         }
 556
 557         /* compute it anyway; root does not use it */
 558         stoptime = op->o_time + op->ors_tlimit;
 559
 560         /* need normalized dn below */
 561         ber_dupbv( &realbase, &e->e_nname );
 562
 563         /* Copy info to base, must free entry before accessing the database
 564          * in search_candidates, to avoid deadlocks.
 565          */
 566         base.e_private = e->e_private;
 567         base.e_nname = realbase;
 568         base.e_id = e->e_id;
 569
 570 #ifdef SLAP_ZONE_ALLOC
 571         slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 572 #endif
 573         if ( e != e_root ) {
 574                 bdb_cache_return_entry_r(bdb, e, &lock);
 575         }
 576         e = NULL;
 577
 578         /* select candidates */
 579         if ( op->oq_search.rs_scope == LDAP_SCOPE_BASE ) {
 580                 rs->sr_err = base_candidate( op->o_bd, &base, candidates );
 581
 582         } else {
 583 cand_retry:
 584                 BDB_IDL_ZERO( candidates );
 585                 BDB_IDL_ZERO( scopes );
 586                 rs->sr_err = search_candidates( op, rs, &base,
 587                         ltid, candidates, scopes );
 588                 if ( rs->sr_err == DB_LOCK_DEADLOCK ) {
 589                         if ( !opinfo ) {
 590                                 ltid->flags &= ~TXN_DEADLOCK;
 591                                 goto cand_retry;
 592                         }
 593                         opinfo->boi_err = rs->sr_err;
 594                         send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
 595                         return LDAP_BUSY;
 596                 }
 597         }
 598
 599         /* start cursor at beginning of candidates.
 600          */
 601         cursor = 0;
 602
 603         if ( candidates[0] == 0 ) {
 604                 Debug( LDAP_DEBUG_TRACE,
 605                         LDAP_XSTRING(bdb_search) ": no candidates\n",
 606                         0, 0, 0 );
 607
 608                 goto nochange;
 609         }
 610
 611         /* if not root and candidates exceed to-be-checked entries, abort */
 612         if ( op->ors_limit      /* isroot == FALSE */ &&
 613                 op->ors_limit->lms_s_unchecked != -1 &&
 614                 BDB_IDL_N(candidates) > (unsigned) op->ors_limit->lms_s_unchecked )
 615         {
 616                 rs->sr_err = LDAP_ADMINLIMIT_EXCEEDED;
 617                 send_ldap_result( op, rs );
 618                 rs->sr_err = LDAP_SUCCESS;
 619                 goto done;
 620         }
 621
 622         if ( op->ors_limit == NULL      /* isroot == TRUE */ ||
 623                 !op->ors_limit->lms_s_pr_hide )
 624         {
 625                 tentries = BDB_IDL_N(candidates);
 626         }
 627
 628         if ( get_pagedresults( op ) > SLAP_CONTROL_IGNORED ) {
 629                 PagedResultsState *ps = op->o_pagedresults_state;
 630                 /* deferred cookie parsing */
 631                 rs->sr_err = parse_paged_cookie( op, rs );
 632                 if ( rs->sr_err != LDAP_SUCCESS ) {
 633                         send_ldap_result( op, rs );
 634                         goto done;
 635                 }
 636
 637                 cursor = (ID) ps->ps_cookie;
 638                 if ( cursor && ps->ps_size == 0 ) {
 639                         rs->sr_err = LDAP_SUCCESS;
 640                         rs->sr_text = "search abandoned by pagedResult size=0";
 641                         send_ldap_result( op, rs );
 642                         goto done;
 643                 }
 644                 id = bdb_idl_first( candidates, &cursor );
 645                 if ( id == NOID ) {
 646                         Debug( LDAP_DEBUG_TRACE,
 647                                 LDAP_XSTRING(bdb_search)
 648                                 ": no paged results candidates\n",
 649                                 0, 0, 0 );
 650                         send_paged_response( op, rs, &lastid, 0 );
 651
 652                         rs->sr_err = LDAP_OTHER;
 653                         goto done;
 654                 }
 655                 nentries = ps->ps_count;
 656                 if ( id == (ID)ps->ps_cookie )
 657                         id = bdb_idl_next( candidates, &cursor );
 658                 goto loop_begin;
 659         }
 660
 661         for ( id = bdb_idl_first( candidates, &cursor );
 662                   id != NOID ; id = bdb_idl_next( candidates, &cursor ) )
 663         {
 664                 int scopeok;
 665
 666 loop_begin:
 667
 668                 /* check for abandon */
 669                 if ( op->o_abandon ) {
 670                         rs->sr_err = SLAPD_ABANDON;
 671                         send_ldap_result( op, rs );
 672                         goto done;
 673                 }
 674
 675                 /* mostly needed by internal searches,
 676                  * e.g. related to syncrepl, for whom
 677                  * abandon does not get set... */
 678                 if ( slapd_shutdown ) {
 679                         rs->sr_err = LDAP_UNAVAILABLE;
 680                         send_ldap_disconnect( op, rs );
 681                         goto done;
 682                 }
 683
 684                 /* check time limit */
 685                 if ( op->ors_tlimit != SLAP_NO_LIMIT
 686                                 && slap_get_time() > stoptime )
 687                 {
 688                         rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
 689                         rs->sr_ref = rs->sr_v2ref;
 690                         send_ldap_result( op, rs );
 691                         rs->sr_err = LDAP_SUCCESS;
 692                         goto done;
 693                 }
 694
 695                 /* If we inspect more entries than will
 696                  * fit into the entry cache, stop caching
 697                  * any subsequent entries
 698                  */
 699                 nentries++;
 700                 if ( nentries > bdb->bi_cache.c_maxsize && !idflag ) {
 701                         idflag = ID_NOCACHE;
 702                 }
 703
 704 fetch_entry_retry:
 705                 /* get the entry with reader lock */
 706                 ei = NULL;
 707                 rs->sr_err = bdb_cache_find_id( op, ltid,
 708                         id, &ei, idflag, &lock );
 709
 710                 if (rs->sr_err == LDAP_BUSY) {
 711                         rs->sr_text = "ldap server busy";
 712                         send_ldap_result( op, rs );
 713                         goto done;
 714
 715                 } else if ( rs->sr_err == DB_LOCK_DEADLOCK ) {
 716                         if ( !opinfo ) {
 717                                 ltid->flags &= ~TXN_DEADLOCK;
 718                                 goto fetch_entry_retry;
 719                         }
 720                         opinfo->boi_err = rs->sr_err;
 721                         send_ldap_error( op, rs, LDAP_BUSY, "ldap server busy" );
 722                         goto done;
 723
 724                 } else if ( rs->sr_err == DB_LOCK_NOTGRANTED )
 725                 {
 726                         goto fetch_entry_retry;
 727                 } else if ( rs->sr_err == LDAP_OTHER ) {
 728                         rs->sr_text = "internal error";
 729                         send_ldap_result( op, rs );
 730                         goto done;
 731                 }
 732
 733                 if ( ei && rs->sr_err == LDAP_SUCCESS ) {
 734                         e = ei->bei_e;
 735                 } else {
 736                         e = NULL;
 737                 }
 738
 739                 if ( e == NULL ) {
 740                         if( !BDB_IDL_IS_RANGE(candidates) ) {
 741                                 /* only complain for non-range IDLs */
 742                                 Debug( LDAP_DEBUG_TRACE,
 743                                         LDAP_XSTRING(bdb_search)
 744                                         ": candidate %ld not found\n",
 745                                         (long) id, 0, 0 );
 746                         }
 747
 748                         goto loop_continue;
 749                 }
 750
 751                 rs->sr_entry = e;
 752
 753                 if ( is_entry_subentry( e ) ) {
 754                         if( op->oq_search.rs_scope != LDAP_SCOPE_BASE ) {
 755                                 if(!get_subentries_visibility( op )) {
 756                                         /* only subentries are visible */
 757                                         goto loop_continue;
 758                                 }
 759
 760                         } else if ( get_subentries( op ) &&
 761                                 !get_subentries_visibility( op ))
 762                         {
 763                                 /* only subentries are visible */
 764                                 goto loop_continue;
 765                         }
 766
 767                 } else if ( get_subentries_visibility( op )) {
 768                         /* only subentries are visible */
 769                         goto loop_continue;
 770                 }
 771
 772                 /* Does this candidate actually satisfy the search scope?
 773                  *
 774                  * Note that we don't lock access to the bei_parent pointer.
 775                  * Since only leaf nodes can be deleted, the parent of any
 776                  * node will always be a valid node. Also since we have
 777                  * a Read lock on the data, it cannot be renamed out of the
 778                  * scope while we are looking at it, and unless we're using
 779                  * BDB_HIER, its parents cannot be moved either.
 780                  */
 781                 scopeok = 0;
 782                 switch( op->ors_scope ) {
 783                 case LDAP_SCOPE_BASE:
 784                         /* This is always true, yes? */
 785                         if ( id == base.e_id ) scopeok = 1;
 786                         break;
 787
 788                 case LDAP_SCOPE_ONELEVEL:
 789                         if ( ei->bei_parent->bei_id == base.e_id ) scopeok = 1;
 790                         break;
 791
 792 #ifdef LDAP_SCOPE_CHILDREN
 793                 case LDAP_SCOPE_CHILDREN:
 794                         if ( id == base.e_id ) break;
 795                         /* Fall-thru */
 796 #endif
 797                 case LDAP_SCOPE_SUBTREE: {
 798                         EntryInfo *tmp;
 799                         for ( tmp = BEI(e); tmp; tmp = tmp->bei_parent ) {
 800                                 if ( tmp->bei_id == base.e_id ) {
 801                                         scopeok = 1;
 802                                         break;
 803                                 }
 804                         }
 805                         } break;
 806                 }
 807
 808                 /* aliases were already dereferenced in candidate list */
 809                 if ( op->ors_deref & LDAP_DEREF_SEARCHING ) {
 810                         /* but if the search base is an alias, and we didn't
 811                          * deref it when finding, return it.
 812                          */
 813                         if ( is_entry_alias(e) &&
 814                                 ((op->ors_deref & LDAP_DEREF_FINDING) ||
 815                                         !bvmatch(&e->e_nname, &op->o_req_ndn)))
 816                         {
 817                                 goto loop_continue;
 818                         }
 819
 820                         /* scopes is only non-empty for onelevel or subtree */
 821                         if ( !scopeok && BDB_IDL_N(scopes) ) {
 822                                 unsigned x;
 823                                 if ( op->ors_scope == LDAP_SCOPE_ONELEVEL ) {
 824                                         x = bdb_idl_search( scopes, e->e_id );
 825                                         if ( scopes[x] == e->e_id ) scopeok = 1;
 826                                 } else {
 827                                         /* subtree, walk up the tree */
 828                                         EntryInfo *tmp = BEI(e);
 829                                         for (;tmp->bei_parent; tmp=tmp->bei_parent) {
 830                                                 x = bdb_idl_search( scopes, tmp->bei_id );
 831                                                 if ( scopes[x] == tmp->bei_id ) {
 832                                                         scopeok = 1;
 833                                                         break;
 834                                                 }
 835                                         }
 836                                 }
 837                         }
 838                 }
 839
 840                 /* Not in scope, ignore it */
 841                 if ( !scopeok )
 842                 {
 843                         Debug( LDAP_DEBUG_TRACE,
 844                                 LDAP_XSTRING(bdb_search)
 845                                 ": %ld scope not okay\n",
 846                                 (long) id, 0, 0 );
 847                         goto loop_continue;
 848                 }
 849
 850                 /*
 851                  * if it's a referral, add it to the list of referrals. only do
 852                  * this for non-base searches, and don't check the filter
 853                  * explicitly here since it's only a candidate anyway.
 854                  */
 855                 if ( !manageDSAit && op->oq_search.rs_scope != LDAP_SCOPE_BASE
 856                         && is_entry_referral( e ) )
 857                 {
 858                         struct bdb_op_info bois;
 859                         struct bdb_lock_info blis;
 860                         BerVarray erefs = get_entry_referrals( op, e );
 861                         rs->sr_ref = referral_rewrite( erefs, &e->e_name, NULL,
 862                                 op->oq_search.rs_scope == LDAP_SCOPE_ONELEVEL
 863                                         ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE );
 864
 865                         /* Must set lockinfo so that entry_release will work */
 866                         if (!opinfo) {
 867                                 bois.boi_oe.oe_key = bdb;
 868                                 bois.boi_txn = NULL;
 869                                 bois.boi_err = 0;
 870                                 bois.boi_acl_cache = op->o_do_not_cache;
 871                                 bois.boi_flag = BOI_DONTFREE;
 872                                 bois.boi_locks = &blis;
 873                                 blis.bli_next = NULL;
 874                                 LDAP_SLIST_INSERT_HEAD( &op->o_extra, &bois.boi_oe,
 875                                         oe_next );
 876                         } else {
 877                                 blis.bli_next = opinfo->boi_locks;
 878                                 opinfo->boi_locks = &blis;
 879                         }
 880                         blis.bli_id = e->e_id;
 881                         blis.bli_lock = lock;
 882                         blis.bli_flag = BLI_DONTFREE;
 883
 884                         rs->sr_flags = REP_ENTRY_MUSTRELEASE;
 885
 886                         send_search_reference( op, rs );
 887
 888                         if ( blis.bli_flag ) {
 889 #ifdef SLAP_ZONE_ALLOC
 890                                 slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 891 #endif
 892                                 bdb_cache_return_entry_r(bdb, e, &lock);
 893                                 if ( opinfo ) {
 894                                         opinfo->boi_locks = blis.bli_next;
 895                                 } else {
 896                                         LDAP_SLIST_REMOVE( &op->o_extra, &bois.boi_oe,
 897                                                 OpExtra, oe_next );
 898                                 }
 899                         }
 900                         rs->sr_entry = NULL;
 901                         e = NULL;
 902
 903                         ber_bvarray_free( rs->sr_ref );
 904                         ber_bvarray_free( erefs );
 905                         rs->sr_ref = NULL;
 906
 907                         goto loop_continue;
 908                 }
 909
 910                 if ( !manageDSAit && is_entry_glue( e )) {
 911                         goto loop_continue;
 912                 }
 913
 914                 /* if it matches the filter and scope, send it */
 915                 rs->sr_err = test_filter( op, rs->sr_entry, op->oq_search.rs_filter );
 916
 917                 if ( rs->sr_err == LDAP_COMPARE_TRUE ) {
 918                         /* check size limit */
 919                         if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
 920                                 if ( rs->sr_nentries >= ((PagedResultsState *)op->o_pagedresults_state)->ps_size ) {
 921 #ifdef SLAP_ZONE_ALLOC
 922                                         slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 923 #endif
 924                                         bdb_cache_return_entry_r( bdb, e, &lock );
 925                                         e = NULL;
 926                                         send_paged_response( op, rs, &lastid, tentries );
 927                                         goto done;
 928                                 }
 929                                 lastid = id;
 930                         }
 931
 932                         if (e) {
 933                                 struct bdb_op_info bois;
 934                                 struct bdb_lock_info blis;
 935
 936                                 /* Must set lockinfo so that entry_release will work */
 937                                 if (!opinfo) {
 938                                         bois.boi_oe.oe_key = bdb;
 939                                         bois.boi_txn = NULL;
 940                                         bois.boi_err = 0;
 941                                         bois.boi_acl_cache = op->o_do_not_cache;
 942                                         bois.boi_flag = BOI_DONTFREE;
 943                                         bois.boi_locks = &blis;
 944                                         blis.bli_next = NULL;
 945                                         LDAP_SLIST_INSERT_HEAD( &op->o_extra, &bois.boi_oe,
 946                                                 oe_next );
 947                                 } else {
 948                                         blis.bli_next = opinfo->boi_locks;
 949                                         opinfo->boi_locks = &blis;
 950                                 }
 951                                 blis.bli_id = e->e_id;
 952                                 blis.bli_lock = lock;
 953                                 blis.bli_flag = BLI_DONTFREE;
 954
 955                                 /* safe default */
 956                                 rs->sr_attrs = op->oq_search.rs_attrs;
 957                                 rs->sr_operational_attrs = NULL;
 958                                 rs->sr_ctrls = NULL;
 959                                 rs->sr_flags = REP_ENTRY_MUSTRELEASE;
 960                                 rs->sr_err = LDAP_SUCCESS;
 961                                 rs->sr_err = send_search_entry( op, rs );
 962
 963                                 /* send_search_entry will usually free it.
 964                                  * an overlay might leave its own copy here;
 965                                  * bli_flag will be 0 if lock was already released.
 966                                  */
 967                                 if ( blis.bli_flag ) {
 968 #ifdef SLAP_ZONE_ALLOC
 969                                         slap_zn_runlock(bdb->bi_cache.c_zctx, e);
 970 #endif
 971                                         bdb_cache_return_entry_r(bdb, e, &lock);
 972                                         if ( opinfo ) {
 973                                                 opinfo->boi_locks = blis.bli_next;
 974                                         } else {
 975                                                 LDAP_SLIST_REMOVE( &op->o_extra, &bois.boi_oe,
 976                                                         OpExtra, oe_next );
 977                                         }
 978                                 }
 979                                 rs->sr_entry = NULL;
 980                                 e = NULL;
 981
 982                                 switch ( rs->sr_err ) {
 983                                 case LDAP_SUCCESS:      /* entry sent ok */
 984                                         break;
 985                                 default:                /* entry not sent */
 986                                         break;
 987                                 case LDAP_UNAVAILABLE:
 988                                 case LDAP_SIZELIMIT_EXCEEDED:
 989                                         if ( rs->sr_err == LDAP_SIZELIMIT_EXCEEDED ) {
 990                                                 rs->sr_ref = rs->sr_v2ref;
 991                                                 send_ldap_result( op, rs );
 992                                                 rs->sr_err = LDAP_SUCCESS;
 993
 994                                         } else {
 995                                                 rs->sr_err = LDAP_OTHER;
 996                                         }
 997                                         goto done;
 998                                 }
 999                         }
1000
1001                 } else {
1002                         Debug( LDAP_DEBUG_TRACE,
1003                                 LDAP_XSTRING(bdb_search)
1004                                 ": %ld does not match filter\n",
1005                                 (long) id, 0, 0 );
1006                 }
1007
1008 loop_continue:
1009                 if( e != NULL ) {
1010                         /* free reader lock */
1011 #ifdef SLAP_ZONE_ALLOC
1012                         slap_zn_runlock(bdb->bi_cache.c_zctx, e);
1013 #endif
1014                         bdb_cache_return_entry_r( bdb, e , &lock );
1015                         e = NULL;
1016                         rs->sr_entry = NULL;
1017                 }
1018         }
1019
1020 nochange:
1021         rs->sr_ctrls = NULL;
1022         rs->sr_ref = rs->sr_v2ref;
1023         rs->sr_err = (rs->sr_v2ref == NULL) ? LDAP_SUCCESS : LDAP_REFERRAL;
1024         rs->sr_rspoid = NULL;
1025         if ( get_pagedresults(op) > SLAP_CONTROL_IGNORED ) {
1026                 send_paged_response( op, rs, NULL, 0 );
1027         } else {
1028                 send_ldap_result( op, rs );
1029         }
1030
1031         rs->sr_err = LDAP_SUCCESS;
1032
1033 done:
1034         if( rs->sr_v2ref ) {
1035                 ber_bvarray_free( rs->sr_v2ref );
1036                 rs->sr_v2ref = NULL;
1037         }
1038         if( realbase.bv_val ) ch_free( realbase.bv_val );
1039
1040         return rs->sr_err;
1041 }
1042
1043
1044 static int base_candidate(
1045         BackendDB       *be,
1046         Entry   *e,
1047         ID              *ids )
1048 {
1049         Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
1050                 e->e_nname.bv_val, (long) e->e_id, 0);
1051
1052         ids[0] = 1;
1053         ids[1] = e->e_id;
1054         return 0;
1055 }
1056
1057 /* Look for "objectClass Present" in this filter.
1058  * Also count depth of filter tree while we're at it.
1059  */
1060 static int oc_filter(
1061         Filter *f,
1062         int cur,
1063         int *max )
1064 {
1065         int rc = 0;
1066
1067         assert( f != NULL );
1068
1069         if( cur > *max ) *max = cur;
1070
1071         switch( f->f_choice ) {
1072         case LDAP_FILTER_PRESENT:
1073                 if (f->f_desc == slap_schema.si_ad_objectClass) {
1074                         rc = 1;
1075                 }
1076                 break;
1077
1078         case LDAP_FILTER_AND:
1079         case LDAP_FILTER_OR:
1080                 cur++;
1081                 for ( f=f->f_and; f; f=f->f_next ) {
1082                         (void) oc_filter(f, cur, max);
1083                 }
1084                 break;
1085
1086         default:
1087                 break;
1088         }
1089         return rc;
1090 }
1091
1092 static void search_stack_free( void *key, void *data )
1093 {
1094         ber_memfree_x(data, NULL);
1095 }
1096
1097 static void *search_stack( Operation *op )
1098 {
1099         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1100         void *ret = NULL;
1101
1102         if ( op->o_threadctx ) {
1103                 ldap_pvt_thread_pool_getkey( op->o_threadctx, (void *)search_stack,
1104                         &ret, NULL );
1105         } else {
1106                 ret = bdb->bi_search_stack;
1107         }
1108
1109         if ( !ret ) {
1110                 ret = ch_malloc( bdb->bi_search_stack_depth * BDB_IDL_UM_SIZE
1111                         * sizeof( ID ) );
1112                 if ( op->o_threadctx ) {
1113                         ldap_pvt_thread_pool_setkey( op->o_threadctx, (void *)search_stack,
1114                                 ret, search_stack_free, NULL, NULL );
1115                 } else {
1116                         bdb->bi_search_stack = ret;
1117                 }
1118         }
1119         return ret;
1120 }
1121
1122 static int search_candidates(
1123         Operation *op,
1124         SlapReply *rs,
1125         Entry *e,
1126         DB_TXN *txn,
1127         ID      *ids,
1128         ID      *scopes )
1129 {
1130         struct bdb_info *bdb = (struct bdb_info *) op->o_bd->be_private;
1131         int rc, depth = 1;
1132         Filter          f, rf, xf, nf;
1133         ID              *stack;
1134         AttributeAssertion aa_ref = ATTRIBUTEASSERTION_INIT;
1135         Filter  sf;
1136         AttributeAssertion aa_subentry = ATTRIBUTEASSERTION_INIT;
1137
1138         /*
1139          * This routine takes as input a filter (user-filter)
1140          * and rewrites it as follows:
1141          *      (&(scope=DN)[(objectClass=subentry)]
1142          *              (|[(objectClass=referral)(objectClass=alias)](user-filter))
1143          */
1144
1145         Debug(LDAP_DEBUG_TRACE,
1146                 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
1147                 e->e_nname.bv_val, (long) e->e_id, op->oq_search.rs_scope );
1148
1149         xf.f_or = op->oq_search.rs_filter;
1150         xf.f_choice = LDAP_FILTER_OR;
1151         xf.f_next = NULL;
1152
1153         /* If the user's filter uses objectClass=*,
1154          * these clauses are redundant.
1155          */
1156         if (!oc_filter(op->oq_search.rs_filter, 1, &depth)
1157                 && !get_subentries_visibility(op)) {
1158                 if( !get_manageDSAit(op) && !get_domainScope(op) ) {
1159                         /* match referral objects */
1160                         struct berval bv_ref = BER_BVC( "referral" );
1161                         rf.f_choice = LDAP_FILTER_EQUALITY;
1162                         rf.f_ava = &aa_ref;
1163                         rf.f_av_desc = slap_schema.si_ad_objectClass;
1164                         rf.f_av_value = bv_ref;
1165                         rf.f_next = xf.f_or;
1166                         xf.f_or = &rf;
1167                         depth++;
1168                 }
1169         }
1170
1171         f.f_next = NULL;
1172         f.f_choice = LDAP_FILTER_AND;
1173         f.f_and = &nf;
1174         /* Dummy; we compute scope separately now */
1175         nf.f_choice = SLAPD_FILTER_COMPUTED;
1176         nf.f_result = LDAP_SUCCESS;
1177         nf.f_next = ( xf.f_or == op->oq_search.rs_filter )
1178                 ? op->oq_search.rs_filter : &xf ;
1179         /* Filter depth increased again, adding dummy clause */
1180         depth++;
1181
1182         if( get_subentries_visibility( op ) ) {
1183                 struct berval bv_subentry = BER_BVC( "subentry" );
1184                 sf.f_choice = LDAP_FILTER_EQUALITY;
1185                 sf.f_ava = &aa_subentry;
1186                 sf.f_av_desc = slap_schema.si_ad_objectClass;
1187                 sf.f_av_value = bv_subentry;
1188                 sf.f_next = nf.f_next;
1189                 nf.f_next = &sf;
1190         }
1191
1192         /* Allocate IDL stack, plus 1 more for former tmp */
1193         if ( depth+1 > bdb->bi_search_stack_depth ) {
1194                 stack = ch_malloc( (depth + 1) * BDB_IDL_UM_SIZE * sizeof( ID ) );
1195         } else {
1196                 stack = search_stack( op );
1197         }
1198
1199         if( op->ors_deref & LDAP_DEREF_SEARCHING ) {
1200                 rc = search_aliases( op, rs, e, txn, ids, scopes, stack );
1201         } else {
1202                 rc = bdb_dn2idl( op, txn, &e->e_nname, BEI(e), ids, stack );
1203         }
1204
1205         if ( rc == LDAP_SUCCESS ) {
1206                 rc = bdb_filter_candidates( op, txn, &f, ids,
1207                         stack, stack+BDB_IDL_UM_SIZE );
1208         }
1209
1210         if ( depth+1 > bdb->bi_search_stack_depth ) {
1211                 ch_free( stack );
1212         }
1213
1214         if( rc ) {
1215                 Debug(LDAP_DEBUG_TRACE,
1216                         "bdb_search_candidates: failed (rc=%d)\n",
1217                         rc, NULL, NULL );
1218
1219         } else {
1220                 Debug(LDAP_DEBUG_TRACE,
1221                         "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
1222                         (long) ids[0],
1223                         (long) BDB_IDL_FIRST(ids),
1224                         (long) BDB_IDL_LAST(ids) );
1225         }
1226
1227         return rc;
1228 }
1229
1230 static int
1231 parse_paged_cookie( Operation *op, SlapReply *rs )
1232 {
1233         int             rc = LDAP_SUCCESS;
1234         PagedResultsState *ps = op->o_pagedresults_state;
1235
1236         /* this function must be invoked only if the pagedResults
1237          * control has been detected, parsed and partially checked
1238          * by the frontend */
1239         assert( get_pagedresults( op ) > SLAP_CONTROL_IGNORED );
1240
1241         /* cookie decoding/checks deferred to backend... */
1242         if ( ps->ps_cookieval.bv_len ) {
1243                 PagedResultsCookie reqcookie;
1244                 if( ps->ps_cookieval.bv_len != sizeof( reqcookie ) ) {
1245                         /* bad cookie */
1246                         rs->sr_text = "paged results cookie is invalid";
1247                         rc = LDAP_PROTOCOL_ERROR;
1248                         goto done;
1249                 }
1250
1251                 AC_MEMCPY( &reqcookie, ps->ps_cookieval.bv_val, sizeof( reqcookie ));
1252
1253                 if ( reqcookie > ps->ps_cookie ) {
1254                         /* bad cookie */
1255                         rs->sr_text = "paged results cookie is invalid";
1256                         rc = LDAP_PROTOCOL_ERROR;
1257                         goto done;
1258
1259                 } else if ( reqcookie < ps->ps_cookie ) {
1260                         rs->sr_text = "paged results cookie is invalid or old";
1261                         rc = LDAP_UNWILLING_TO_PERFORM;
1262                         goto done;
1263                 }
1264
1265         }
1266
1267 done:;
1268
1269         return rc;
1270 }
1271
1272 static void
1273 send_paged_response(
1274         Operation       *op,
1275         SlapReply       *rs,
1276         ID              *lastid,
1277         int             tentries )
1278 {
1279         LDAPControl     *ctrls[2];
1280         BerElementBuffer berbuf;
1281         BerElement      *ber = (BerElement *)&berbuf;
1282         PagedResultsCookie respcookie;
1283         struct berval cookie;
1284
1285         Debug(LDAP_DEBUG_ARGS,
1286                 "send_paged_response: lastid=0x%08lx nentries=%d\n",
1287                 lastid ? *lastid : 0, rs->sr_nentries, NULL );
1288
1289         ctrls[1] = NULL;
1290
1291         ber_init2( ber, NULL, LBER_USE_DER );
1292
1293         if ( lastid ) {
1294                 respcookie = ( PagedResultsCookie )(*lastid);
1295                 cookie.bv_len = sizeof( respcookie );
1296                 cookie.bv_val = (char *)&respcookie;
1297
1298         } else {
1299                 respcookie = ( PagedResultsCookie )0;
1300                 BER_BVSTR( &cookie, "" );
1301         }
1302
1303         op->o_conn->c_pagedresults_state.ps_cookie = respcookie;
1304         op->o_conn->c_pagedresults_state.ps_count =
1305                 ((PagedResultsState *)op->o_pagedresults_state)->ps_count +
1306                 rs->sr_nentries;
1307
1308         /* return size of 0 -- no estimate */
1309         ber_printf( ber, "{iO}", 0, &cookie );
1310
1311         ctrls[0] = op->o_tmpalloc( sizeof(LDAPControl), op->o_tmpmemctx );
1312         if ( ber_flatten2( ber, &ctrls[0]->ldctl_value, 0 ) == -1 ) {
1313                 goto done;
1314         }
1315
1316         ctrls[0]->ldctl_oid = LDAP_CONTROL_PAGEDRESULTS;
1317         ctrls[0]->ldctl_iscritical = 0;
1318
1319         slap_add_ctrls( op, rs, ctrls );
1320         rs->sr_err = LDAP_SUCCESS;
1321         send_ldap_result( op, rs );
1322
1323 done:
1324         (void) ber_free_buf( ber );
1325 }
1326