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

   1 /* search.c - ldbm backend search function */
   2
   3 #include "portable.h"
   4
   5 #include <stdio.h>
   6
   7 #include <ac/string.h>
   8 #include <ac/socket.h>
   9
  10 #include "slap.h"
  11 #include "back-ldbm.h"
  12 #include "proto-back-ldbm.h"
  13
  14 static IDList   *base_candidates(Backend *be, Connection *conn, Operation *op, char *base, Filter *filter, char **attrs, int attrsonly, char **matched, int *err);
  15 static IDList   *onelevel_candidates(Backend *be, Connection *conn, Operation *op, char *base, Filter *filter, char **attrs, int attrsonly, char **matched, int *err);
  16 static IDList   *subtree_candidates(Backend *be, Connection *conn, Operation *op, char *base, Filter *filter, char **attrs, int attrsonly, char **matched, Entry *e, int *err, int lookupbase);
  17
  18 #define GRABSIZE        BUFSIZ
  19
  20 #define MAKE_SPACE( n ) { \
  21         if ( rcur + n > rbuf + rmaxsize ) { \
  22                 int     offset = rcur - rbuf; \
  23                 rbuf =  ch_realloc( rbuf, rmaxsize + GRABSIZE ); \
  24                 rmaxsize += GRABSIZE; \
  25                 rcur = rbuf + offset; \
  26         } \
  27 }
  28
  29 int
  30 ldbm_back_search(
  31     Backend     *be,
  32     Connection  *conn,
  33     Operation   *op,
  34     char        *base,
  35     int         scope,
  36     int         deref,
  37     int         slimit,
  38     int         tlimit,
  39     Filter      *filter,
  40     char        *filterstr,
  41     char        **attrs,
  42     int         attrsonly
  43 )
  44 {
  45         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
  46         int             err;
  47         time_t          stoptime;
  48         IDList          *candidates;
  49         ID              id;
  50         Entry           *e;
  51         Attribute       *ref;
  52         char            *matched;
  53         int             rmaxsize, nrefs;
  54         char            *rbuf, *rcur, *r;
  55         int             nentries = 0;
  56         char            *realBase;
  57
  58         Debug(LDAP_DEBUG_ARGS, "=> ldbm_back_search\n", 0, 0, 0);
  59
  60         if ( tlimit == 0 && be_isroot( be, op->o_dn ) ) {
  61                 tlimit = -1;    /* allow root to set no limit */
  62         } else {
  63                 tlimit = (tlimit > be->be_timelimit || tlimit < 1) ?
  64                     be->be_timelimit : tlimit;
  65                 stoptime = op->o_time + tlimit;
  66         }
  67         if ( slimit == 0 && be_isroot( be, op->o_dn ) ) {
  68                 slimit = -1;    /* allow root to set no limit */
  69         } else {
  70                 slimit = (slimit > be->be_sizelimit || slimit < 1) ?
  71                     be->be_sizelimit : slimit;
  72         }
  73
  74         /*
  75          * check and apply aliasing where the dereferencing applies to
  76          * the subordinates of the base
  77          */
  78
  79         switch ( deref ) {
  80         case LDAP_DEREF_FINDING:
  81         case LDAP_DEREF_ALWAYS:
  82                 realBase = derefDN ( be, conn, op, base );
  83                 break;
  84         default:
  85                 realBase = ch_strdup(base);
  86         }
  87
  88         (void) dn_normalize (realBase);
  89
  90         Debug( LDAP_DEBUG_TRACE, "using base %s\n",
  91                 realBase, 0, 0 );
  92
  93         switch ( scope ) {
  94         case LDAP_SCOPE_BASE:
  95                 candidates = base_candidates( be, conn, op, realBase, filter,
  96                     attrs, attrsonly, &matched, &err );
  97                 break;
  98
  99         case LDAP_SCOPE_ONELEVEL:
 100                 candidates = onelevel_candidates( be, conn, op, realBase, filter,
 101                     attrs, attrsonly, &matched, &err );
 102                 break;
 103
 104         case LDAP_SCOPE_SUBTREE:
 105                 candidates = subtree_candidates( be, conn, op, realBase, filter,
 106                     attrs, attrsonly, &matched, NULL, &err, 1 );
 107                 break;
 108
 109         default:
 110                 send_ldap_result( conn, op, LDAP_PROTOCOL_ERROR, "",
 111                     "Bad scope" );
 112                 if( realBase != NULL) {
 113                         free( realBase );
 114                 }
 115                 return( -1 );
 116         }
 117
 118         /* null candidates means we could not find the base object */
 119         if ( candidates == NULL ) {
 120                 send_ldap_result( conn, op, err, matched, "" );
 121                 if ( matched != NULL ) {
 122                         free( matched );
 123                 }
 124                 if( realBase != NULL) {
 125                         free( realBase );
 126                 }
 127                 return( -1 );
 128         }
 129
 130         if ( matched != NULL ) {
 131                 free( matched );
 132         }
 133
 134         rmaxsize = 0;
 135         nrefs = 0;
 136         rbuf = rcur = NULL;
 137         MAKE_SPACE( sizeof("Referral:") + 1 );
 138         strcpy( rbuf, "Referral:" );
 139         rcur = strchr( rbuf, '\0' );
 140         for ( id = idl_firstid( candidates ); id != NOID;
 141             id = idl_nextid( candidates, id ) ) {
 142                 /* check for abandon */
 143                 pthread_mutex_lock( &op->o_abandonmutex );
 144                 if ( op->o_abandon ) {
 145                         pthread_mutex_unlock( &op->o_abandonmutex );
 146                         idl_free( candidates );
 147                         free( rbuf );
 148                         if( realBase != NULL) {
 149                                 free( realBase );
 150                         }
 151                         return( 0 );
 152                 }
 153                 pthread_mutex_unlock( &op->o_abandonmutex );
 154
 155                 /* check time limit */
 156                 pthread_mutex_lock( &currenttime_mutex );
 157                 time( &currenttime );
 158                 if ( tlimit != -1 && currenttime > stoptime ) {
 159                         pthread_mutex_unlock( &currenttime_mutex );
 160                         send_ldap_search_result( conn, op,
 161                             LDAP_TIMELIMIT_EXCEEDED, NULL, nrefs > 0 ? rbuf :
 162                             NULL, nentries );
 163                         idl_free( candidates );
 164                         free( rbuf );
 165                         if( realBase != NULL) {
 166                                 free( realBase );
 167                         }
 168                         return( 0 );
 169                 }
 170                 pthread_mutex_unlock( &currenttime_mutex );
 171
 172                 /* get the entry with reader lock */
 173                 if ( (e = id2entry_r( be, id )) == NULL ) {
 174                         Debug( LDAP_DEBUG_ARGS, "candidate %lu not found\n",
 175                                id, 0, 0 );
 176                         continue;
 177                 }
 178
 179                 /*
 180                  * if it's a referral, add it to the list of referrals. only do
 181                  * this for subtree searches, and don't check the filter explicitly
 182                  * here since it's only a candidate anyway.
 183                  */
 184                 if ( e->e_dn != NULL &&
 185                         strncasecmp( e->e_dn, "ref=", 4 ) == 0 &&
 186                         (ref = attr_find( e->e_attrs, "ref" )) != NULL &&
 187                         scope == LDAP_SCOPE_SUBTREE )
 188                 {
 189                         int     i, len;
 190
 191                         if ( ref->a_vals == NULL ) {
 192                                 Debug( LDAP_DEBUG_ANY, "null ref in (%s)\n",
 193                                         e->e_dn, 0, 0 );
 194                         } else {
 195                                 for ( i = 0; ref->a_vals[i] != NULL; i++ ) {
 196                                         /* referral + newline + null */
 197                                         MAKE_SPACE( ref->a_vals[i]->bv_len + 2 );
 198                                         *rcur++ = '\n';
 199                                         strncpy( rcur, ref->a_vals[i]->bv_val,
 200                                                 ref->a_vals[i]->bv_len );
 201                                         rcur = rcur + ref->a_vals[i]->bv_len;
 202                                         *rcur = '\0';
 203                                         nrefs++;
 204                                 }
 205                         }
 206
 207                 /* otherwise it's an entry - see if it matches the filter */
 208                 } else {
 209                         /* if it matches the filter and scope, send it */
 210                         if ( test_filter( be, conn, op, e, filter ) == 0 ) {
 211                                 int             scopeok;
 212                                 char    *dn;
 213
 214                                 /* check scope */
 215                                 scopeok = 1;
 216                                 if ( scope == LDAP_SCOPE_ONELEVEL ) {
 217                                         if ( (dn = dn_parent( be, e->e_dn )) != NULL ) {
 218                                                 (void) dn_normalize( dn );
 219                                                 scopeok = (dn == realBase) ? 1 : (! strcasecmp( dn, realBase ));
 220                                         } else {
 221                                                 scopeok = (realBase == NULL || *realBase == '\0');
 222                                         }
 223                                         free( dn );
 224                                 } else if ( scope == LDAP_SCOPE_SUBTREE ) {
 225                                         dn = ch_strdup( e->e_dn );
 226                                         (void) dn_normalize( dn );
 227                                         scopeok = dn_issuffix( dn, realBase );
 228                                         free( dn );
 229                                 }
 230
 231                                 if ( scopeok ) {
 232                                         /* check size limit */
 233                                         if ( --slimit == -1 ) {
 234                                                 cache_return_entry_r( &li->li_cache, e );
 235                                                 send_ldap_search_result( conn, op,
 236                                                         LDAP_SIZELIMIT_EXCEEDED, NULL,
 237                                                         nrefs > 0 ? rbuf : NULL, nentries );
 238                                                 idl_free( candidates );
 239                                                 free( rbuf );
 240                                                 return( 0 );
 241                                         }
 242
 243                                         /*
 244                                          * check and apply aliasing where the dereferencing applies to
 245                                          * the subordinates of the base
 246                                          */
 247                                         switch ( deref ) {
 248                                         case LDAP_DEREF_SEARCHING:
 249                                         case LDAP_DEREF_ALWAYS:
 250                                                 {
 251                                                         Entry *newe = derefAlias_r( be, conn, op, e );
 252                                                         cache_return_entry_r( &li->li_cache, e );
 253                                                         e = newe;
 254                                                 }
 255                                                 break;
 256                                         }
 257
 258                                         switch ( send_search_entry( be, conn, op, e,
 259                                                 attrs, attrsonly ) ) {
 260                                         case 0:         /* entry sent ok */
 261                                                 nentries++;
 262                                                 break;
 263                                         case 1:         /* entry not sent */
 264                                                 break;
 265                                         case -1:        /* connection closed */
 266                                                 cache_return_entry_r( &li->li_cache, e );
 267                                                 idl_free( candidates );
 268                                                 free( rbuf );
 269                                                 return( 0 );
 270                                         }
 271                                 }
 272                         }
 273                 }
 274
 275                 if( e != NULL ) {
 276                         /* free reader lock */
 277                         cache_return_entry_r( &li->li_cache, e );
 278                 }
 279
 280                 pthread_yield();
 281         }
 282         idl_free( candidates );
 283         if ( nrefs > 0 ) {
 284                 send_ldap_search_result( conn, op, LDAP_PARTIAL_RESULTS, NULL,
 285                     rbuf, nentries );
 286         } else {
 287                 send_ldap_search_result( conn, op, LDAP_SUCCESS, NULL, NULL,
 288                     nentries );
 289         }
 290         free( rbuf );
 291
 292         if( realBase != NULL) {
 293                 free( realBase );
 294         }
 295
 296         return( 0 );
 297 }
 298
 299 static IDList *
 300 base_candidates(
 301     Backend     *be,
 302     Connection  *conn,
 303     Operation   *op,
 304     char        *base,
 305     Filter      *filter,
 306     char        **attrs,
 307     int         attrsonly,
 308     char        **matched,
 309     int         *err
 310 )
 311 {
 312         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 313         int             rc;
 314         ID              id;
 315         IDList          *idl;
 316         Entry           *e;
 317
 318         Debug(LDAP_DEBUG_TRACE, "base_candidates: base: %s\n", base, 0, 0);
 319
 320         *err = LDAP_SUCCESS;
 321
 322         /* get entry with reader lock */
 323         if ( (e = dn2entry_r( be, base, matched )) == NULL ) {
 324                 *err = LDAP_NO_SUCH_OBJECT;
 325                 return( NULL );
 326         }
 327
 328         /* check for deleted */
 329
 330         idl = idl_alloc( 1 );
 331         idl_insert( &idl, e->e_id, 1 );
 332
 333
 334         /* free reader lock */
 335         cache_return_entry_r( &li->li_cache, e );
 336
 337         return( idl );
 338 }
 339
 340 static IDList *
 341 onelevel_candidates(
 342     Backend     *be,
 343     Connection  *conn,
 344     Operation   *op,
 345     char        *base,
 346     Filter      *filter,
 347     char        **attrs,
 348     int         attrsonly,
 349     char        **matched,
 350     int         *err
 351 )
 352 {
 353         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 354         Entry           *e;
 355         Filter          *f;
 356         char            buf[20];
 357         IDList          *candidates;
 358
 359         Debug(LDAP_DEBUG_TRACE, "onelevel_candidates: base: %s\n", base, 0, 0);
 360
 361         *err = LDAP_SUCCESS;
 362         e = NULL;
 363         /* get the base object with reader lock */
 364         if ( base != NULL && *base != '\0' &&
 365                 (e = dn2entry_r( be, base, matched )) == NULL )
 366         {
 367                 *err = LDAP_NO_SUCH_OBJECT;
 368                 return( NULL );
 369         }
 370
 371         /*
 372          * modify the filter to be something like this:
 373          *
 374          *      parent=baseobject & originalfilter
 375          */
 376
 377         f = (Filter *) ch_malloc( sizeof(Filter) );
 378         f->f_next = NULL;
 379         f->f_choice = LDAP_FILTER_AND;
 380         f->f_and = (Filter *) ch_malloc( sizeof(Filter) );
 381         f->f_and->f_choice = LDAP_FILTER_EQUALITY;
 382         f->f_and->f_ava.ava_type = ch_strdup( "id2children" );
 383         sprintf( buf, "%ld", e != NULL ? e->e_id : 0 );
 384         f->f_and->f_ava.ava_value.bv_val = ch_strdup( buf );
 385         f->f_and->f_ava.ava_value.bv_len = strlen( buf );
 386         f->f_and->f_next = filter;
 387
 388         /* from here, it's just like subtree_candidates */
 389         candidates = subtree_candidates( be, conn, op, base, f, attrs,
 390             attrsonly, matched, e, err, 0 );
 391
 392         /* free up just the filter stuff we allocated above */
 393         f->f_and->f_next = NULL;
 394         filter_free( f );
 395
 396         /* free entry and reader lock */
 397         cache_return_entry_r( &li->li_cache, e );
 398         return( candidates );
 399 }
 400
 401 static IDList *
 402 subtree_candidates(
 403     Backend     *be,
 404     Connection  *conn,
 405     Operation   *op,
 406     char        *base,
 407     Filter      *filter,
 408     char        **attrs,
 409     int         attrsonly,
 410     char        **matched,
 411     Entry       *e,
 412     int         *err,
 413     int         lookupbase
 414 )
 415 {
 416         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 417         Filter          *f;
 418         IDList          *candidates;
 419
 420         Debug(LDAP_DEBUG_TRACE, "subtree_candidates: base: %s\n",
 421                 base ? base : "NULL", 0, 0);
 422
 423         /*
 424          * get the base object - unless we already have it (from one-level).
 425          * also, unless this is a one-level search or a subtree search
 426          * starting at the very top of our subtree, we need to modify the
 427          * filter to be something like this:
 428          *
 429          *      dn=*baseobjectdn & (originalfilter | ref=*)
 430          *
 431          * the "objectclass=referral" part is used to select referrals to return
 432          */
 433
 434         *err = LDAP_SUCCESS;
 435         f = NULL;
 436         if ( lookupbase ) {
 437                 if ( base != NULL && *base != '\0' &&
 438                         (e = dn2entry_r( be, base, matched )) == NULL )
 439                 {
 440                         *err = LDAP_NO_SUCH_OBJECT;
 441                         return( NULL );
 442                 }
 443
 444                 if (e) {
 445                         cache_return_entry_r( &li->li_cache, e );
 446                 }
 447
 448                 f = (Filter *) ch_malloc( sizeof(Filter) );
 449                 f->f_next = NULL;
 450                 f->f_choice = LDAP_FILTER_OR;
 451                 f->f_or = (Filter *) ch_malloc( sizeof(Filter) );
 452                 f->f_or->f_choice = LDAP_FILTER_EQUALITY;
 453                 f->f_or->f_avtype = ch_strdup( "objectclass" );
 454                 /* Patch to use normalized uppercase */
 455                 f->f_or->f_avvalue.bv_val = ch_strdup( "REFERRAL" );
 456                 f->f_or->f_avvalue.bv_len = strlen( "REFERRAL" );
 457                 f->f_or->f_next = filter;
 458                 filter = f;
 459
 460                 if ( ! be_issuffix( be, base ) ) {
 461                         f = (Filter *) ch_malloc( sizeof(Filter) );
 462                         f->f_next = NULL;
 463                         f->f_choice = LDAP_FILTER_AND;
 464                         f->f_and = (Filter *) ch_malloc( sizeof(Filter) );
 465                         f->f_and->f_choice = LDAP_FILTER_SUBSTRINGS;
 466                         f->f_and->f_sub_type = ch_strdup( "dn" );
 467                         f->f_and->f_sub_initial = NULL;
 468                         f->f_and->f_sub_any = NULL;
 469                         f->f_and->f_sub_final = ch_strdup( base );
 470                         value_normalize( f->f_and->f_sub_final, SYNTAX_CIS );
 471                         f->f_and->f_next = filter;
 472                         filter = f;
 473                 }
 474         }
 475
 476         candidates = filter_candidates( be, filter );
 477
 478         /* free up just the parts we allocated above */
 479         if ( f != NULL ) {
 480                 f->f_and->f_next = NULL;
 481                 filter_free( f );
 482         }
 483
 484         return( candidates );
 485 }