git.sur5r.net Git - openldap/blob - servers/slapd/back-bdb/search.c

   1 /* search.c - search operation */
   2 /* $OpenLDAP$ */
   3 /*
   4  * Copyright 1998-2002 The OpenLDAP Foundation, All Rights Reserved.
   5  * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
   6  */
   7
   8 #include "portable.h"
   9
  10 #include <stdio.h>
  11 #include <ac/string.h>
  12
  13 #include "back-bdb.h"
  14 #include "idl.h"
  15 #include "external.h"
  16
  17 static int base_candidate(
  18         BackendDB       *be,
  19         Entry   *e,
  20         ID              *ids );
  21 static int search_candidates(
  22         BackendDB *be,
  23         Operation *op,
  24         Entry *e,
  25         Filter *filter,
  26         int scope,
  27         int deref,
  28         ID      *ids );
  29
  30 int
  31 bdb_search(
  32         BackendDB       *be,
  33         Connection      *conn,
  34         Operation       *op,
  35         struct berval   *base,
  36         struct berval   *nbase,
  37         int             scope,
  38         int             deref,
  39         int             slimit,
  40         int             tlimit,
  41         Filter  *filter,
  42         struct berval   *filterstr,
  43         AttributeName   *attrs,
  44         int             attrsonly )
  45 {
  46         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
  47         int              abandon;
  48         int             rc;
  49         const char *text = NULL;
  50         time_t          stoptime;
  51         ID              id, cursor;
  52         ID              candidates[BDB_IDL_UM_SIZE];
  53         Entry           *e = NULL;
  54         BerVarray v2refs = NULL;
  55         Entry   *matched = NULL;
  56         struct berval   realbase = { 0, NULL };
  57         int             nentries = 0;
  58         int             manageDSAit;
  59
  60         struct slap_limits_set *limit = NULL;
  61         int isroot = 0;
  62
  63         Debug( LDAP_DEBUG_TRACE, "=> bdb_back_search\n",
  64                 0, 0, 0);
  65
  66         manageDSAit = get_manageDSAit( op );
  67
  68         if ( nbase->bv_len == 0 ) {
  69                 /* DIT root special case */
  70                 e = (Entry *) &slap_entry_root;
  71                 rc = 0;
  72         } else
  73 #ifdef BDB_ALIASES
  74         /* get entry with reader lock */
  75         if ( deref & LDAP_DEREF_FINDING ) {
  76                 e = deref_dn_r( be, nbase-, &err, &matched, &text );
  77
  78         } else
  79 #endif
  80         {
  81                 rc = bdb_dn2entry_r( be, NULL, nbase, &e, &matched, 0 );
  82         }
  83
  84         switch(rc) {
  85         case DB_NOTFOUND:
  86         case 0:
  87                 break;
  88         default:
  89                 if (e != NULL) {
  90                         bdb_cache_return_entry_w(&bdb->bi_cache, e);
  91                 }
  92                 if (matched != NULL) {
  93                         bdb_cache_return_entry_r(&bdb->bi_cache, matched);
  94                 }
  95                 send_ldap_result( conn, op, rc=LDAP_OTHER,
  96                         NULL, "internal error", NULL, NULL );
  97                 return rc;
  98         }
  99
 100         if ( e == NULL ) {
 101                 struct berval matched_dn = { 0, NULL };
 102                 BerVarray refs = NULL;
 103
 104                 if ( matched != NULL ) {
 105                         BerVarray erefs;
 106
 107                         ber_dupbv( &matched_dn, &matched->e_name );
 108
 109                         erefs = is_entry_referral( matched )
 110                                 ? get_entry_referrals( be, conn, op, matched )
 111                                 : NULL;
 112
 113                         bdb_cache_return_entry_r (&bdb->bi_cache, matched);
 114                         matched = NULL;
 115
 116                         if( erefs ) {
 117                                 refs = referral_rewrite( erefs, &matched_dn,
 118                                         base, scope );
 119                                 ber_bvarray_free( erefs );
 120                         }
 121
 122                 } else {
 123                         refs = referral_rewrite( default_referral,
 124                                 NULL, base, scope );
 125                 }
 126
 127                 send_ldap_result( conn, op,     rc=LDAP_REFERRAL ,
 128                         matched_dn.bv_val, text, refs, NULL );
 129
 130                 if ( refs ) ber_bvarray_free( refs );
 131                 if ( matched_dn.bv_val ) ber_memfree( matched_dn.bv_val );
 132                 return rc;
 133         }
 134
 135         if (!manageDSAit && e != &slap_entry_root && is_entry_referral( e ) ) {
 136                 /* entry is a referral, don't allow add */
 137                 struct berval matched_dn;
 138                 BerVarray erefs, refs;
 139
 140                 ber_dupbv( &matched_dn, &e->e_name );
 141                 erefs = get_entry_referrals( be, conn, op, e );
 142                 refs = NULL;
 143
 144                 bdb_cache_return_entry_r( &bdb->bi_cache, e );
 145                 e = NULL;
 146
 147                 if( erefs ) {
 148                         refs = referral_rewrite( erefs, &matched_dn,
 149                                 base, scope );
 150                         ber_bvarray_free( erefs );
 151                 }
 152
 153                 Debug( LDAP_DEBUG_TRACE, "bdb_search: entry is referral\n",
 154                         0, 0, 0 );
 155
 156                 send_ldap_result( conn, op, LDAP_REFERRAL,
 157                         matched_dn.bv_val,
 158                         refs ? NULL : "bad referral object",
 159                         refs, NULL );
 160
 161                 ber_bvarray_free( refs );
 162                 ber_memfree( matched_dn.bv_val );
 163                 return 1;
 164         }
 165
 166         /* if not root, get appropriate limits */
 167         if ( be_isroot( be, &op->o_ndn ) ) {
 168                 isroot = 1;
 169         } else {
 170                 ( void ) get_limits( be, &op->o_ndn, &limit );
 171         }
 172
 173         /* The time/size limits come first because they require very little
 174          * effort, so there's no chance the candidates are selected and then
 175          * the request is not honored only because of time/size constraints */
 176
 177         /* if no time limit requested, use soft limit (unless root!) */
 178         if ( isroot ) {
 179                 if ( tlimit == 0 ) {
 180                         tlimit = -1;    /* allow root to set no limit */
 181                 }
 182
 183                 if ( slimit == 0 ) {
 184                         slimit = -1;
 185                 }
 186
 187         } else {
 188                 /* if no limit is required, use soft limit */
 189                 if ( tlimit <= 0 ) {
 190                         tlimit = limit->lms_t_soft;
 191
 192                 /* if requested limit higher than hard limit, abort */
 193                 } else if ( tlimit > limit->lms_t_hard ) {
 194                         /* no hard limit means use soft instead */
 195                         if ( limit->lms_t_hard == 0 ) {
 196                                 tlimit = limit->lms_t_soft;
 197
 198                         /* positive hard limit means abort */
 199                         } else if ( limit->lms_t_hard > 0 ) {
 200                                 send_search_result( conn, op,
 201                                                 LDAP_UNWILLING_TO_PERFORM,
 202                                                 NULL, NULL, NULL, NULL, 0 );
 203                                 rc = 0;
 204                                 goto done;
 205                         }
 206
 207                         /* negative hard limit means no limit */
 208                 }
 209
 210                 /* if no limit is required, use soft limit */
 211                 if ( slimit <= 0 ) {
 212                         slimit = limit->lms_s_soft;
 213
 214                 /* if requested limit higher than hard limit, abort */
 215                 } else if ( slimit > limit->lms_s_hard ) {
 216                         /* no hard limit means use soft instead */
 217                         if ( limit->lms_s_hard == 0 ) {
 218                                 slimit = limit->lms_s_soft;
 219
 220                         /* positive hard limit means abort */
 221                         } else if ( limit->lms_s_hard > 0 ) {
 222                                 send_search_result( conn, op,
 223                                                 LDAP_UNWILLING_TO_PERFORM,
 224                                                 NULL, NULL, NULL, NULL, 0 );
 225                                 rc = 0;
 226                                 goto done;
 227                         }
 228
 229                         /* negative hard limit means no limit */
 230                 }
 231         }
 232
 233         /* compute it anyway; root does not use it */
 234         stoptime = op->o_time + tlimit;
 235
 236         /* select candidates */
 237         if ( scope == LDAP_SCOPE_BASE ) {
 238                 rc = base_candidate( be, e, candidates );
 239
 240         } else {
 241                 BDB_IDL_ALL( bdb, candidates );
 242                 rc = search_candidates( be, op, e, filter,
 243                         scope, deref, candidates );
 244         }
 245
 246         /* need normalized dn below */
 247         ber_dupbv( &realbase, &e->e_nname );
 248
 249         /* start cursor at base entry's id
 250          * FIXME: hack to make "" base work
 251          * FIXME: moddn needs to assign new ID for this to work
 252          */
 253         cursor = e->e_id == NOID ? 1 : e->e_id;
 254
 255         if ( e != &slap_entry_root ) {
 256                 bdb_cache_return_entry_r(&bdb->bi_cache, e);
 257         }
 258         e = NULL;
 259
 260         if ( candidates[0] == 0 ) {
 261                 Debug( LDAP_DEBUG_TRACE, "bdb_search: no candidates\n",
 262                         0, 0, 0 );
 263
 264                 send_search_result( conn, op,
 265                         LDAP_SUCCESS,
 266                         NULL, NULL, NULL, NULL, 0 );
 267
 268                 rc = 1;
 269                 goto done;
 270         }
 271
 272         /* if not root and candidates exceed to-be-checked entries, abort */
 273         if ( !isroot && limit->lms_s_unchecked != -1 ) {
 274                 if ( BDB_IDL_N(candidates) > (unsigned) limit->lms_s_unchecked ) {
 275                         send_search_result( conn, op,
 276                                         LDAP_UNWILLING_TO_PERFORM,
 277                                         NULL, NULL, NULL, NULL, 0 );
 278                         rc = 1;
 279                         goto done;
 280                 }
 281         }
 282
 283         for ( id = bdb_idl_first( candidates, &cursor );
 284                 id != NOID;
 285                 id = bdb_idl_next( candidates, &cursor ) )
 286         {
 287                 int             scopeok = 0;
 288
 289                 /* check for abandon */
 290                 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
 291                 abandon = op->o_abandon;
 292                 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
 293
 294                 if ( abandon ) {
 295                         rc = 0;
 296                         goto done;
 297                 }
 298
 299                 /* check time limit */
 300                 if ( tlimit != -1 && slap_get_time() > stoptime ) {
 301                         send_search_result( conn, op, rc = LDAP_TIMELIMIT_EXCEEDED,
 302                                 NULL, NULL, v2refs, NULL, nentries );
 303                         goto done;
 304                 }
 305
 306                 /* get the entry with reader lock */
 307                 rc = bdb_id2entry_r( be, NULL, id, &e );
 308
 309                 if ( e == NULL ) {
 310                         if( !BDB_IDL_IS_RANGE(candidates) ) {
 311                                 /* only complain for non-range IDLs */
 312                                 Debug( LDAP_DEBUG_TRACE,
 313                                         "bdb_search: candidate %ld not found\n",
 314                                         (long) id, 0, 0 );
 315                         }
 316
 317                         goto loop_continue;
 318                 }
 319
 320 #ifdef BDB_SUBENTRIES
 321                 if ( is_entry_subentry( e ) ) {
 322                         if( scope != LDAP_SCOPE_BASE ) {
 323                                 if(!get_subentries_visibility( op )) {
 324                                         /* only subentries are visible */
 325                                         goto loop_continue;
 326                                 }
 327
 328                         } else if ( get_subentries( op ) &&
 329                                 !get_subentries_visibility( op ))
 330                         {
 331                                 /* only subentries are visible */
 332                                 goto loop_continue;
 333                         }
 334
 335                 } else if ( get_subentries_visibility( op )) {
 336                         /* only subentries are visible */
 337                         goto loop_continue;
 338                 }
 339 #endif
 340
 341 #ifdef BDB_ALIASES
 342                 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
 343                         Entry *matched;
 344                         int err;
 345                         const char *text;
 346
 347                         e = deref_entry_r( be, e, &err, &matched, &text );
 348
 349                         if( e == NULL ) {
 350                                 e = matched;
 351                                 goto loop_continue;
 352                         }
 353
 354                         if( e->e_id == id ) {
 355                                 /* circular loop */
 356                                 goto loop_continue;
 357                         }
 358
 359                         /* need to skip alias which deref into scope */
 360                         if( scope & LDAP_SCOPE_ONELEVEL ) {
 361                                 struct berval   pdn;
 362
 363                                 dnParent( &e->e_nname, &pdn ):
 364                                 if ( ber_bvcmp( pdn, &realbase ) ) {
 365                                         goto loop_continue;
 366                                 }
 367
 368                         } else if ( dnIsSuffix( &e->e_nname, &realbase ) ) {
 369                                 /* alias is within scope */
 370                                 Debug( LDAP_DEBUG_TRACE,
 371                                         "bdb_search: \"%s\" in subtree\n",
 372                                         e->e_dn, 0, 0 );
 373                                 goto loop_continue;
 374                         }
 375
 376                         scopeok = 1;
 377                 }
 378 #endif
 379
 380                 /*
 381                  * if it's a referral, add it to the list of referrals. only do
 382                  * this for non-base searches, and don't check the filter
 383                  * explicitly here since it's only a candidate anyway.
 384                  */
 385                 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
 386                         is_entry_referral( e ) )
 387                 {
 388                         BerVarray erefs = get_entry_referrals(
 389                                 be, conn, op, e );
 390                         BerVarray refs = referral_rewrite( erefs,
 391                                 &e->e_name, NULL,
 392                                 scope == LDAP_SCOPE_SUBTREE
 393                                         ? LDAP_SCOPE_SUBTREE
 394                                         : LDAP_SCOPE_BASE );
 395
 396                         send_search_reference( be, conn, op,
 397                                 e, refs, NULL, &v2refs );
 398
 399                         ber_bvarray_free( refs );
 400
 401                         goto loop_continue;
 402                 }
 403
 404                 /* if it matches the filter and scope, send it */
 405                 rc = test_filter( be, conn, op, e, filter );
 406                 if ( rc == LDAP_COMPARE_TRUE ) {
 407                         struct berval   dn;
 408
 409                         /* check scope */
 410                         if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
 411                                 if ( be_issuffix( be, &e->e_nname ) ) {
 412                                         scopeok = (realbase.bv_len == 0);
 413                                 } else {
 414                                         dnParent( &e->e_nname, &dn );
 415                                         scopeok = dn_match( &dn, &realbase );
 416                                 }
 417
 418                         } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
 419                                 scopeok = dnIsSuffix( &e->e_nname, &realbase );
 420
 421                         } else {
 422                                 scopeok = 1;
 423                         }
 424
 425                         if ( scopeok ) {
 426                                 /* check size limit */
 427                                 if ( --slimit == -1 ) {
 428                                         bdb_cache_return_entry_r (&bdb->bi_cache, e);
 429                                         e = NULL;
 430                                         send_search_result( conn, op,
 431                                                 rc = LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
 432                                                 v2refs, NULL, nentries );
 433                                         goto done;
 434                                 }
 435
 436                                 if (e) {
 437                                         int result;
 438
 439                                         if( op->o_noop ) {
 440                                                 result = 0;
 441                                         } else {
 442                                                 result = send_search_entry( be, conn, op,
 443                                                         e, attrs, attrsonly, NULL);
 444                                         }
 445
 446                                         switch (result) {
 447                                         case 0:         /* entry sent ok */
 448                                                 nentries++;
 449                                                 break;
 450                                         case 1:         /* entry not sent */
 451                                                 break;
 452                                         case -1:        /* connection closed */
 453                                                 bdb_cache_return_entry_r(&bdb->bi_cache, e);
 454                                                 e = NULL;
 455                                                 rc = LDAP_OTHER;
 456                                                 goto done;
 457                                         }
 458                                 }
 459                         } else {
 460                                 Debug( LDAP_DEBUG_TRACE,
 461                                         "bdb_search: %ld scope not okay\n",
 462                                         (long) id, 0, 0 );
 463                         }
 464                 } else {
 465                         Debug( LDAP_DEBUG_TRACE,
 466                                 "bdb_search: %ld does match filter\n",
 467                                 (long) id, 0, 0 );
 468                 }
 469
 470 loop_continue:
 471                 if( e != NULL ) {
 472                         /* free reader lock */
 473                         bdb_cache_return_entry_r ( &bdb->bi_cache, e );
 474                         e = NULL;
 475                 }
 476
 477                 ldap_pvt_thread_yield();
 478         }
 479         send_search_result( conn, op,
 480                 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
 481                 NULL, NULL, v2refs, NULL, nentries );
 482
 483         rc = 0;
 484
 485 done:
 486         if( e != NULL ) {
 487                 /* free reader lock */
 488                 bdb_cache_return_entry_r ( &bdb->bi_cache, e );
 489         }
 490
 491         if( v2refs ) ber_bvarray_free( v2refs );
 492         if( realbase.bv_val ) ch_free( realbase.bv_val );
 493
 494         return rc;
 495 }
 496
 497
 498 static int base_candidate(
 499         BackendDB       *be,
 500         Entry   *e,
 501         ID              *ids )
 502 {
 503         Debug(LDAP_DEBUG_ARGS, "base_candidates: base: \"%s\" (0x%08lx)\n",
 504                 e->e_dn, (long) e->e_id, 0);
 505
 506         ids[0] = 1;
 507         ids[1] = e->e_id;
 508         return 0;
 509 }
 510
 511 /* Is "objectClass=xx" mentioned anywhere in this filter? Presence
 512  * doesn't count, we're looking for explicit values.
 513  */
 514 static int oc_filter(
 515         Filter *f
 516 )
 517 {
 518         int rc = 0;
 519
 520         switch(f->f_choice) {
 521         case LDAP_FILTER_EQUALITY:
 522         case LDAP_FILTER_APPROX:
 523                 if (f->f_av_desc == slap_schema.si_ad_objectClass)
 524                         rc = 1;
 525                 break;
 526
 527         case LDAP_FILTER_SUBSTRINGS:
 528                 if (f->f_sub_desc == slap_schema.si_ad_objectClass)
 529                         rc = 1;
 530                 break;
 531
 532         case LDAP_FILTER_AND:
 533         case LDAP_FILTER_OR:
 534                 for (f=f->f_and; f; f=f->f_next)
 535                         if ((rc = oc_filter(f)))
 536                                 break;
 537                 break;
 538         default:
 539                 break;
 540         }
 541         return rc;
 542 }
 543
 544 static int search_candidates(
 545         BackendDB *be,
 546         Operation *op,
 547         Entry *e,
 548         Filter *filter,
 549         int scope,
 550         int deref,
 551         ID      *ids )
 552 {
 553         int rc;
 554         Filter          f, scopef, rf, xf;
 555         ID              tmp[BDB_IDL_UM_SIZE];
 556         AttributeAssertion aa_ref;
 557 #ifdef BDB_SUBENTRIES
 558         Filter  sf;
 559         AttributeAssertion aa_subentry;
 560 #endif
 561 #ifdef BDB_ALIASES
 562         Filter  af;
 563         AttributeAssertion aa_alias;
 564 #endif
 565         struct bdb_info *bdb = (struct bdb_info *) be->be_private;
 566
 567         /*
 568          * This routine takes as input a filter (user-filter)
 569          * and rewrites it as follows:
 570          *      (&(scope=DN)[(objectClass=subentry)]
 571          *              (|[(objectClass=referral)(objectClass=alias)](user-filter))
 572          */
 573
 574         Debug(LDAP_DEBUG_TRACE,
 575                 "search_candidates: base=\"%s\" (0x%08lx) scope=%d\n",
 576                 e->e_dn, (long) e->e_id, scope );
 577
 578         xf.f_or = filter;
 579         xf.f_choice = LDAP_FILTER_OR;
 580         xf.f_next = NULL;
 581
 582         /* If the user's filter doesn't mention objectClass, or if
 583          * it just uses objectClass=*, these clauses are redundant.
 584          */
 585         if (oc_filter(filter) && !get_subentries_visibility(op) ) {
 586                 if( !get_manageDSAit(op) ) { /* match referrals */
 587                         struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
 588                         rf.f_choice = LDAP_FILTER_EQUALITY;
 589                         rf.f_ava = &aa_ref;
 590                         rf.f_av_desc = slap_schema.si_ad_objectClass;
 591                         rf.f_av_value = bv_ref;
 592                         rf.f_next = xf.f_or;
 593                         xf.f_or = &rf;
 594                 }
 595
 596 #ifdef BDB_ALIASES
 597                 if( deref & LDAP_DEREF_SEARCHING ) { /* match aliases */
 598                         struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
 599                         af.f_choice = LDAP_FILTER_EQUALITY;
 600                         af.f_ava = &aa_alias;
 601                         af.f_av_desc = slap_schema.si_ad_objectClass;
 602                         af.f_av_value = bv_alias;
 603                         af.f_next = xf.f_or;
 604                         xf.f_or = &af;
 605                 }
 606 #endif
 607         }
 608
 609         f.f_next = NULL;
 610         f.f_choice = LDAP_FILTER_AND;
 611         f.f_and = &scopef;
 612         scopef.f_choice = scope == LDAP_SCOPE_SUBTREE
 613                 ? SLAPD_FILTER_DN_SUBTREE
 614                 : SLAPD_FILTER_DN_ONE;
 615         scopef.f_dn = &e->e_nname;
 616         scopef.f_next = xf.f_or == filter ? filter : &xf ;
 617
 618 #ifdef BDB_SUBENTRIES
 619         if( get_subentries_visibility( op ) ) {
 620                 struct berval bv_subentry = { sizeof("SUBENTRY")-1, "SUBENTRY" };
 621                 sf.f_choice = LDAP_FILTER_EQUALITY;
 622                 sf.f_ava = &aa_subentry;
 623                 sf.f_av_desc = slap_schema.si_ad_objectClass;
 624                 sf.f_av_value = bv_subentry;
 625                 sf.f_next = scopef.f_next;
 626                 scopef.f_next = &sf;
 627         }
 628 #endif
 629
 630         rc = bdb_filter_candidates( be, &f, ids, tmp );
 631
 632         if( rc ) {
 633                 Debug(LDAP_DEBUG_TRACE,
 634                         "bdb_search_candidates: failed (rc=%d)\n",
 635                         rc, NULL, NULL );
 636
 637         } else {
 638                 Debug(LDAP_DEBUG_TRACE,
 639                         "bdb_search_candidates: id=%ld first=%ld last=%ld\n",
 640                         (long) ids[0],
 641                         (long) BDB_IDL_FIRST(ids),
 642                         (long) BDB_IDL_LAST(ids) );
 643         }
 644
 645         return rc;
 646 }