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

   1 /* search.c - ldbm backend search function */
   2 /* $OpenLDAP$ */
   3 /*
   4  * Copyright 1998-2000 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
  12 #include <ac/string.h>
  13 #include <ac/socket.h>
  14
  15 #include "slap.h"
  16 #include "back-ldbm.h"
  17 #include "proto-back-ldbm.h"
  18
  19 static ID_BLOCK *base_candidate(
  20         Backend *be, Entry *e );
  21
  22 static ID_BLOCK *search_candidates(
  23         Backend *be, Entry *e, Filter *filter,
  24         int scope, int deref, int manageDSAit );
  25
  26
  27 int
  28 ldbm_back_search(
  29     Backend     *be,
  30     Connection  *conn,
  31     Operation   *op,
  32     const char  *base,
  33     const char  *nbase,
  34     int         scope,
  35     int         deref,
  36     int         slimit,
  37     int         tlimit,
  38     Filter      *filter,
  39     const char  *filterstr,
  40     struct berval       **attrs,
  41     int         attrsonly )
  42 {
  43         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
  44         int             rc, err;
  45         const char *text = NULL;
  46         time_t          stoptime;
  47         ID_BLOCK                *candidates;
  48         ID              id, cursor;
  49         Entry           *e;
  50         struct berval **v2refs = NULL;
  51         Entry   *matched = NULL;
  52         char    *realbase = NULL;
  53         int             nentries = 0;
  54         int             manageDSAit = get_manageDSAit( op );
  55         int             cscope = LDAP_SCOPE_DEFAULT;
  56
  57         struct slap_limits_set *limit = NULL;
  58         int isroot = 0;
  59
  60 #ifdef NEW_LOGGING
  61         LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
  62                    "ldbm_back_search: enter\n" ));
  63 #else
  64         Debug(LDAP_DEBUG_TRACE, "=> ldbm_back_search\n", 0, 0, 0);
  65 #endif
  66
  67
  68         if ( *nbase == '\0' ) {
  69                 /* DIT root special case */
  70                 e = (Entry *) &slap_entry_root;
  71
  72                 /* need normalized dn below */
  73                 realbase = ch_strdup( e->e_ndn );
  74
  75                 candidates = search_candidates( be, e, filter,
  76                     scope, deref, manageDSAit );
  77
  78                 goto searchit;
  79
  80         } else if ( deref & LDAP_DEREF_FINDING ) {
  81                 /* deref dn and get entry with reader lock */
  82                 e = deref_dn_r( be, nbase, &err, &matched, &text );
  83
  84                 if( err == LDAP_NO_SUCH_OBJECT ) err = LDAP_REFERRAL;
  85
  86         } else {
  87                 /* get entry with reader lock */
  88                 e = dn2entry_r( be, nbase, &matched );
  89                 err = e != NULL ? LDAP_SUCCESS : LDAP_REFERRAL;
  90                 text = NULL;
  91         }
  92
  93         if ( e == NULL ) {
  94                 char *matched_dn = NULL;
  95                 struct berval **refs = NULL;
  96
  97                 if ( matched != NULL ) {
  98                         struct berval **erefs;
  99                         matched_dn = ch_strdup( matched->e_dn );
 100
 101                         erefs = is_entry_referral( matched )
 102                                 ? get_entry_referrals( be, conn, op, matched,
 103                                         base, scope )
 104                                 : NULL;
 105
 106                         cache_return_entry_r( &li->li_cache, matched );
 107
 108                         if( erefs ) {
 109                                 refs = referral_rewrite( erefs, matched_dn,
 110                                         base, scope );
 111
 112                                 ber_bvecfree( erefs );
 113                         }
 114
 115                 } else {
 116                         refs = referral_rewrite( default_referral,
 117                                 NULL, base, scope );
 118                 }
 119
 120                 send_ldap_result( conn, op, err,
 121                         matched_dn, text, refs, NULL );
 122
 123                 ber_bvecfree( refs );
 124                 free( matched_dn );
 125                 return 1;
 126         }
 127
 128         if (!manageDSAit && is_entry_referral( e ) ) {
 129                 /* entry is a referral, don't allow add */
 130                 char *matched_dn = ch_strdup( e->e_dn );
 131                 struct berval **erefs = get_entry_referrals( be,
 132                         conn, op, e, base, scope );
 133                 struct berval **refs = NULL;
 134
 135                 cache_return_entry_r( &li->li_cache, e );
 136
 137 #ifdef NEW_LOGGING
 138                 LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
 139                         "ldbm_search: entry (%s) is a referral.\n",
 140                         e->e_dn ));
 141 #else
 142                 Debug( LDAP_DEBUG_TRACE,
 143                         "ldbm_search: entry is referral\n",
 144                         0, 0, 0 );
 145 #endif
 146
 147                 if( erefs ) {
 148                         refs = referral_rewrite( erefs, matched_dn,
 149                                 base, scope );
 150
 151                         ber_bvecfree( erefs );
 152                 }
 153
 154                 if( refs ) {
 155                         send_ldap_result( conn, op, LDAP_REFERRAL,
 156                                 matched_dn, NULL, refs, NULL );
 157                         ber_bvecfree( refs );
 158
 159                 } else {
 160                         send_ldap_result( conn, op, LDAP_OTHER, matched_dn,
 161                                 "bad referral object", NULL, NULL );
 162                 }
 163
 164                 free( matched_dn );
 165                 return 1;
 166         }
 167
 168         if ( is_entry_alias( e ) ) {
 169                 /* don't deref */
 170                 deref = LDAP_DEREF_NEVER;
 171         }
 172
 173         if ( scope == LDAP_SCOPE_BASE ) {
 174                 cscope = LDAP_SCOPE_BASE;
 175                 candidates = base_candidate( be, e );
 176
 177         } else {
 178                 cscope = ( scope != LDAP_SCOPE_SUBTREE )
 179                         ? LDAP_SCOPE_BASE : LDAP_SCOPE_SUBTREE;
 180                 candidates = search_candidates( be, e, filter,
 181                     scope, deref, manageDSAit );
 182         }
 183
 184         /* need normalized dn below */
 185         realbase = ch_strdup( e->e_ndn );
 186
 187         cache_return_entry_r( &li->li_cache, e );
 188
 189 searchit:
 190         if ( candidates == NULL ) {
 191                 /* no candidates */
 192 #ifdef NEW_LOGGING
 193                 LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
 194                         "ldbm_search: no candidates\n" ));
 195 #else
 196                 Debug( LDAP_DEBUG_TRACE, "ldbm_search: no candidates\n",
 197                         0, 0, 0 );
 198 #endif
 199
 200                 send_search_result( conn, op,
 201                         LDAP_SUCCESS,
 202                         NULL, NULL, NULL, NULL, 0 );
 203
 204                 rc = 1;
 205                 goto done;
 206         }
 207
 208         /* if not root, get appropriate limits */
 209         if ( be_isroot( be, &op->o_ndn ) ) {
 210                 isroot = 1;
 211         } else {
 212                 ( void ) get_limits( be, op->o_ndn.bv_val, &limit );
 213         }
 214
 215         /* if candidates exceed to-be-checked entries, abort */
 216         if ( !isroot && limit->lms_s_unchecked != -1 ) {
 217                 if ( ID_BLOCK_NIDS( candidates ) > (unsigned) limit->lms_s_unchecked ) {
 218                         send_search_result( conn, op, LDAP_UNWILLING_TO_PERFORM,
 219                                         NULL, NULL, NULL, NULL, 0 );
 220                         rc = 0;
 221                         goto done;
 222                 }
 223         }
 224
 225         /* if root an no specific limit is required, allow unlimited search */
 226         if ( isroot ) {
 227                 if ( tlimit == 0 ) {
 228                         tlimit = -1;
 229                 }
 230
 231                 if ( slimit == 0 ) {
 232                         slimit = -1;
 233                 }
 234
 235         } else {
 236                 /* if no limit is required, use soft limit */
 237                 if ( tlimit <= 0 ) {
 238                         tlimit = limit->lms_t_soft;
 239
 240                 /* if requested limit higher than hard limit, abort */
 241                 } else if ( tlimit > limit->lms_t_hard ) {
 242                         /* no hard limit means use soft instead */
 243                         if ( limit->lms_t_hard == 0 ) {
 244                                 tlimit = limit->lms_t_soft;
 245
 246                         /* positive hard limit means abort */
 247                         } else if ( limit->lms_t_hard > 0 ) {
 248                                 send_search_result( conn, op,
 249                                                 LDAP_UNWILLING_TO_PERFORM,
 250                                                 NULL, NULL, NULL, NULL, 0 );
 251                                 rc = 0;
 252                                 goto done;
 253                         }
 254
 255                         /* negative hard limit means no limit */
 256                 }
 257
 258                 /* if no limit is required, use soft limit */
 259                 if ( slimit <= 0 ) {
 260                         slimit = limit->lms_s_soft;
 261
 262                 /* if requested limit higher than hard limit, abort */
 263                 } else if ( slimit > limit->lms_s_hard ) {
 264                         /* no hard limit means use soft instead */
 265                         if ( limit->lms_s_hard == 0 ) {
 266                                 slimit = limit->lms_s_soft;
 267
 268                         /* positive hard limit means abort */
 269                         } else if ( limit->lms_s_hard > 0 ) {
 270                                 send_search_result( conn, op,
 271                                                 LDAP_UNWILLING_TO_PERFORM,
 272                                                 NULL, NULL, NULL, NULL, 0 );
 273                                 rc = 0;
 274                                 goto done;
 275                         }
 276
 277                         /* negative hard limit means no limit */
 278                 }
 279         }
 280
 281         /* compute it anyway; root does not use it */
 282         stoptime = op->o_time + tlimit;
 283
 284         for ( id = idl_firstid( candidates, &cursor ); id != NOID;
 285             id = idl_nextid( candidates, &cursor ) )
 286         {
 287                 int scopeok = 0;
 288
 289                 /* check for abandon */
 290                 ldap_pvt_thread_mutex_lock( &op->o_abandonmutex );
 291
 292                 if ( op->o_abandon ) {
 293                         ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
 294                         rc = 0;
 295                         goto done;
 296                 }
 297
 298                 ldap_pvt_thread_mutex_unlock( &op->o_abandonmutex );
 299
 300                 /* check time limit */
 301                 if ( tlimit != -1 && slap_get_time() > stoptime ) {
 302                         send_search_result( conn, op, LDAP_TIMELIMIT_EXCEEDED,
 303                                 NULL, NULL, v2refs, NULL, nentries );
 304                         rc = 0;
 305                         goto done;
 306                 }
 307
 308                 /* get the entry with reader lock */
 309                 e = id2entry_r( be, id );
 310
 311                 if ( e == NULL ) {
 312 #ifdef NEW_LOGGING
 313                         LDAP_LOG(( "backend", LDAP_LEVEL_INFO,
 314                                 "ldbm_search: candidate %ld not found.\n", id ));
 315 #else
 316                         Debug( LDAP_DEBUG_TRACE,
 317                                 "ldbm_search: candidate %ld not found\n",
 318                                 id, 0, 0 );
 319 #endif
 320
 321                         goto loop_continue;
 322                 }
 323
 324                 if ( deref & LDAP_DEREF_SEARCHING && is_entry_alias( e ) ) {
 325                         Entry *matched;
 326                         int err;
 327                         const char *text;
 328
 329                         e = deref_entry_r( be, e, &err, &matched, &text );
 330
 331                         if( e == NULL ) {
 332                                 e = matched;
 333                                 goto loop_continue;
 334                         }
 335
 336                         if( e->e_id == id ) {
 337                                 /* circular loop */
 338                                 goto loop_continue;
 339                         }
 340
 341                         /* need to skip alias which deref into scope */
 342                         if( scope & LDAP_SCOPE_ONELEVEL ) {
 343                                 char *pdn = dn_parent( NULL, e->e_ndn );
 344                                 if ( pdn != NULL ) {
 345                                         if( strcmp( pdn, realbase ) ) {
 346                                                 free( pdn );
 347                                                 goto loop_continue;
 348                                         }
 349                                 }
 350
 351                         } else if ( dn_issuffix( e->e_ndn, realbase ) ) {
 352                                 /* alias is within scope */
 353 #ifdef NEW_LOGGING
 354                                 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
 355                                         "ldbm_search: alias \"%s\" in subtree\n", e->e_dn ));
 356 #else
 357                                 Debug( LDAP_DEBUG_TRACE,
 358                                         "ldbm_search: alias \"%s\" in subtree\n",
 359                                         e->e_dn, 0, 0 );
 360 #endif
 361
 362                                 goto loop_continue;
 363                         }
 364
 365                         scopeok = 1;
 366                 }
 367
 368                 /*
 369                  * if it's a referral, add it to the list of referrals. only do
 370                  * this for non-base searches, and don't check the filter
 371                  * explicitly here since it's only a candidate anyway.
 372                  */
 373                 if ( !manageDSAit && scope != LDAP_SCOPE_BASE &&
 374                         is_entry_referral( e ) )
 375                 {
 376                         char    *dn;
 377
 378                         /* check scope */
 379                         if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
 380                                 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
 381                                         scopeok = (dn == realbase)
 382                                                 ? 1
 383                                                 : (strcmp( dn, realbase ) ? 0 : 1 );
 384                                 } else {
 385                                         scopeok = (realbase == NULL || *realbase == '\0');
 386                                 }
 387
 388                         } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
 389                                 dn = ch_strdup( e->e_ndn );
 390                                 scopeok = dn_issuffix( dn, realbase );
 391                                 free( dn );
 392
 393                         } else {
 394                                 scopeok = 1;
 395                         }
 396
 397                         if( scopeok ) {
 398                                 struct berval **erefs = get_entry_referrals(
 399                                         be, conn, op, e, NULL, cscope );
 400                                 struct berval **refs = referral_rewrite( erefs, e->e_dn, NULL,
 401                                         scope == LDAP_SCOPE_SUBTREE
 402                                                 ? LDAP_SCOPE_SUBTREE
 403                                                 : LDAP_SCOPE_BASE );
 404
 405                                 send_search_reference( be, conn, op,
 406                                         e, refs, NULL, &v2refs );
 407
 408                                 ber_bvecfree( refs );
 409
 410                         } else {
 411 #ifdef NEW_LOGGING
 412                                 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL2,
 413                                         "ldbm_search: candidate referral %ld scope not okay\n",
 414                                         id ));
 415 #else
 416                                 Debug( LDAP_DEBUG_TRACE,
 417                                         "ldbm_search: candidate referral %ld scope not okay\n",
 418                                         id, 0, 0 );
 419 #endif
 420                         }
 421
 422                         goto loop_continue;
 423                 }
 424
 425                 /* if it matches the filter and scope, send it */
 426                 if ( test_filter( be, conn, op, e, filter ) == LDAP_COMPARE_TRUE ) {
 427                         char    *dn;
 428
 429                         /* check scope */
 430                         if ( !scopeok && scope == LDAP_SCOPE_ONELEVEL ) {
 431                                 if ( (dn = dn_parent( be, e->e_ndn )) != NULL ) {
 432                                         scopeok = (dn == realbase)
 433                                                 ? 1
 434                                                 : (strcmp( dn, realbase ) ? 0 : 1 );
 435                                 } else {
 436                                         scopeok = (realbase == NULL || *realbase == '\0');
 437                                 }
 438
 439                         } else if ( !scopeok && scope == LDAP_SCOPE_SUBTREE ) {
 440                                 dn = ch_strdup( e->e_ndn );
 441                                 scopeok = dn_issuffix( dn, realbase );
 442                                 free( dn );
 443
 444                         } else {
 445                                 scopeok = 1;
 446                         }
 447
 448                         if ( scopeok ) {
 449                                 /* check size limit */
 450                                 if ( --slimit == -1 ) {
 451                                         cache_return_entry_r( &li->li_cache, e );
 452                                         send_search_result( conn, op,
 453                                                 LDAP_SIZELIMIT_EXCEEDED, NULL, NULL,
 454                                                 v2refs, NULL, nentries );
 455                                         rc = 0;
 456                                         goto done;
 457                                 }
 458
 459                                 if (e) {
 460                                         int result = send_search_entry(be, conn, op,
 461                                                 e, attrs, attrsonly, NULL);
 462
 463                                         switch (result) {
 464                                         case 0:         /* entry sent ok */
 465                                                 nentries++;
 466                                                 break;
 467                                         case 1:         /* entry not sent */
 468                                                 break;
 469                                         case -1:        /* connection closed */
 470                                                 cache_return_entry_r( &li->li_cache, e );
 471                                                 rc = 0;
 472                                                 goto done;
 473                                         }
 474                                 }
 475                         } else {
 476 #ifdef NEW_LOGGING
 477                                 LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL2,
 478                                         "ldbm_search: candidate entry %ld scope not okay\n", id ));
 479 #else
 480                                 Debug( LDAP_DEBUG_TRACE,
 481                                         "ldbm_search: candidate entry %ld scope not okay\n",
 482                                         id, 0, 0 );
 483 #endif
 484                         }
 485
 486                 } else {
 487 #ifdef NEW_LOGGING
 488                         LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL2,
 489                                 "ldbm_search: candidate entry %ld does not match filter\n", id ));
 490 #else
 491                         Debug( LDAP_DEBUG_TRACE,
 492                                 "ldbm_search: candidate entry %ld does not match filter\n",
 493                                 id, 0, 0 );
 494 #endif
 495                 }
 496
 497 loop_continue:
 498                 if( e != NULL ) {
 499                         /* free reader lock */
 500                         cache_return_entry_r( &li->li_cache, e );
 501                 }
 502
 503                 ldap_pvt_thread_yield();
 504         }
 505
 506         send_search_result( conn, op,
 507                 v2refs == NULL ? LDAP_SUCCESS : LDAP_REFERRAL,
 508                 NULL, NULL, v2refs, NULL, nentries );
 509
 510         rc = 0;
 511
 512 done:
 513         if( candidates != NULL )
 514                 idl_free( candidates );
 515
 516         ber_bvecfree( v2refs );
 517         if( realbase ) free( realbase );
 518
 519         return rc;
 520 }
 521
 522 static ID_BLOCK *
 523 base_candidate(
 524     Backend     *be,
 525         Entry   *e )
 526 {
 527         ID_BLOCK                *idl;
 528
 529 #ifdef NEW_LOGGING
 530         LDAP_LOG(( "backend", LDAP_LEVEL_ENTRY,
 531                    "base_candidate: base (%s)\n", e->e_dn ));
 532 #else
 533         Debug(LDAP_DEBUG_TRACE, "base_candidates: base: \"%s\"\n",
 534                 e->e_dn, 0, 0);
 535 #endif
 536
 537
 538         idl = idl_alloc( 1 );
 539         idl_insert( &idl, e->e_id, 1 );
 540
 541         return( idl );
 542 }
 543
 544 static ID_BLOCK *
 545 search_candidates(
 546     Backend     *be,
 547     Entry       *e,
 548     Filter      *filter,
 549     int         scope,
 550         int             deref,
 551         int             manageDSAit )
 552 {
 553         ID_BLOCK                *candidates;
 554         Filter          f, fand, rf, af, xf;
 555     AttributeAssertion aa_ref, aa_alias;
 556         static struct berval bv_ref = { sizeof("REFERRAL")-1, "REFERRAL" };
 557         static struct berval bv_alias = { sizeof("ALIAS")-1, "ALIAS" };
 558
 559 #ifdef NEW_LOGGING
 560         LDAP_LOG(( "backend", LDAP_LEVEL_DETAIL1,
 561                    "search_candidates: base (%s) scope %d deref %d\n",
 562                    e->e_ndn, scope, deref ));
 563 #else
 564         Debug(LDAP_DEBUG_TRACE,
 565                 "search_candidates: base=\"%s\" s=%d d=%d\n",
 566                 e->e_ndn, scope, deref );
 567 #endif
 568
 569
 570         xf.f_or = filter;
 571         xf.f_choice = LDAP_FILTER_OR;
 572         xf.f_next = NULL;
 573
 574         if( !manageDSAit ) {
 575                 /* match referrals */
 576                 rf.f_choice = LDAP_FILTER_EQUALITY;
 577                 rf.f_ava = &aa_ref;
 578                 rf.f_av_desc = slap_schema.si_ad_objectClass;
 579                 rf.f_av_value = &bv_ref;
 580                 rf.f_next = xf.f_or;
 581                 xf.f_or = &rf;
 582         }
 583
 584         if( deref & LDAP_DEREF_SEARCHING ) {
 585                 /* match aliases */
 586                 af.f_choice = LDAP_FILTER_EQUALITY;
 587                 af.f_ava = &aa_alias;
 588                 af.f_av_desc = slap_schema.si_ad_objectClass;
 589                 af.f_av_value = &bv_alias;
 590                 af.f_next = xf.f_or;
 591                 xf.f_or = &af;
 592         }
 593
 594         f.f_next = NULL;
 595         f.f_choice = LDAP_FILTER_AND;
 596         f.f_and = &fand;
 597         fand.f_choice = scope == LDAP_SCOPE_SUBTREE
 598                 ? SLAPD_FILTER_DN_SUBTREE
 599                 : SLAPD_FILTER_DN_ONE;
 600         fand.f_dn = e->e_ndn;
 601         fand.f_next = xf.f_or == filter ? filter : &xf ;
 602
 603         candidates = filter_candidates( be, &f );
 604
 605         return( candidates );
 606 }