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