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 = NULL;
  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
 241                                                 if( realBase != NULL) {
 242                                                         free( realBase );
 243                                                 }
 244                                                 return( 0 );
 245                                         }
 246
 247                                         /*
 248                                          * check and apply aliasing where the dereferencing applies to
 249                                          * the subordinates of the base
 250                                          */
 251                                         switch ( deref ) {
 252                                         case LDAP_DEREF_SEARCHING:
 253                                         case LDAP_DEREF_ALWAYS:
 254                                                 {
 255                                                         Entry *newe = derefAlias_r( be, conn, op, e );
 256                                                         cache_return_entry_r( &li->li_cache, e );
 257                                                         e = newe;
 258                                                 }
 259                                                 break;
 260                                         }
 261
 262                                         switch ( send_search_entry( be, conn, op, e,
 263                                                 attrs, attrsonly ) ) {
 264                                         case 0:         /* entry sent ok */
 265                                                 nentries++;
 266                                                 break;
 267                                         case 1:         /* entry not sent */
 268                                                 break;
 269                                         case -1:        /* connection closed */
 270                                                 cache_return_entry_r( &li->li_cache, e );
 271                                                 idl_free( candidates );
 272                                                 free( rbuf );
 273
 274                                                 if( realBase != NULL) {
 275                                                         free( realBase );
 276                                                 }
 277                                                 return( 0 );
 278                                         }
 279                                 }
 280                         }
 281                 }
 282
 283                 if( e != NULL ) {
 284                         /* free reader lock */
 285                         cache_return_entry_r( &li->li_cache, e );
 286                 }
 287
 288                 pthread_yield();
 289         }
 290         idl_free( candidates );
 291         if ( nrefs > 0 ) {
 292                 send_ldap_search_result( conn, op, LDAP_PARTIAL_RESULTS, NULL,
 293                     rbuf, nentries );
 294         } else {
 295                 send_ldap_search_result( conn, op, LDAP_SUCCESS, NULL, NULL,
 296                     nentries );
 297         }
 298         free( rbuf );
 299
 300         if( realBase != NULL) {
 301                 free( realBase );
 302         }
 303
 304         return( 0 );
 305 }
 306
 307 static IDList *
 308 base_candidates(
 309     Backend     *be,
 310     Connection  *conn,
 311     Operation   *op,
 312     char        *base,
 313     Filter      *filter,
 314     char        **attrs,
 315     int         attrsonly,
 316     char        **matched,
 317     int         *err
 318 )
 319 {
 320         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 321         int             rc;
 322         ID              id;
 323         IDList          *idl;
 324         Entry           *e;
 325
 326         Debug(LDAP_DEBUG_TRACE, "base_candidates: base: \"%s\"\n", base, 0, 0);
 327
 328         *err = LDAP_SUCCESS;
 329
 330         /* get entry with reader lock */
 331         if ( (e = dn2entry_r( be, base, matched )) == NULL ) {
 332                 *err = LDAP_NO_SUCH_OBJECT;
 333                 return( NULL );
 334         }
 335
 336         /* check for deleted */
 337
 338         idl = idl_alloc( 1 );
 339         idl_insert( &idl, e->e_id, 1 );
 340
 341
 342         /* free reader lock */
 343         cache_return_entry_r( &li->li_cache, e );
 344
 345         return( idl );
 346 }
 347
 348 static IDList *
 349 onelevel_candidates(
 350     Backend     *be,
 351     Connection  *conn,
 352     Operation   *op,
 353     char        *base,
 354     Filter      *filter,
 355     char        **attrs,
 356     int         attrsonly,
 357     char        **matched,
 358     int         *err
 359 )
 360 {
 361         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 362         Entry           *e;
 363         Filter          *f;
 364         char            buf[20];
 365         IDList          *candidates;
 366
 367         Debug(LDAP_DEBUG_TRACE, "onelevel_candidates: base: \"%s\"\n", base, 0, 0);
 368
 369         *err = LDAP_SUCCESS;
 370         e = NULL;
 371         /* get the base object with reader lock */
 372         if ( base != NULL && *base != '\0' &&
 373                 (e = dn2entry_r( be, base, matched )) == NULL )
 374         {
 375                 *err = LDAP_NO_SUCH_OBJECT;
 376                 return( NULL );
 377         }
 378
 379         /*
 380          * modify the filter to be something like this:
 381          *
 382          *      parent=baseobject & originalfilter
 383          */
 384
 385         f = (Filter *) ch_malloc( sizeof(Filter) );
 386         f->f_next = NULL;
 387         f->f_choice = LDAP_FILTER_AND;
 388         f->f_and = (Filter *) ch_malloc( sizeof(Filter) );
 389         f->f_and->f_choice = LDAP_FILTER_EQUALITY;
 390         f->f_and->f_ava.ava_type = ch_strdup( "id2children" );
 391         sprintf( buf, "%ld", e != NULL ? e->e_id : 0 );
 392         f->f_and->f_ava.ava_value.bv_val = ch_strdup( buf );
 393         f->f_and->f_ava.ava_value.bv_len = strlen( buf );
 394         f->f_and->f_next = filter;
 395
 396         /* from here, it's just like subtree_candidates */
 397         candidates = subtree_candidates( be, conn, op, base, f, attrs,
 398             attrsonly, matched, e, err, 0 );
 399
 400         /* free up just the filter stuff we allocated above */
 401         f->f_and->f_next = NULL;
 402         filter_free( f );
 403
 404         /* free entry and reader lock */
 405         cache_return_entry_r( &li->li_cache, e );
 406         return( candidates );
 407 }
 408
 409 static IDList *
 410 subtree_candidates(
 411     Backend     *be,
 412     Connection  *conn,
 413     Operation   *op,
 414     char        *base,
 415     Filter      *filter,
 416     char        **attrs,
 417     int         attrsonly,
 418     char        **matched,
 419     Entry       *e,
 420     int         *err,
 421     int         lookupbase
 422 )
 423 {
 424         struct ldbminfo *li = (struct ldbminfo *) be->be_private;
 425         Filter          *f, **filterarg_ptr;
 426         IDList          *candidates;
 427
 428         Debug(LDAP_DEBUG_TRACE, "subtree_candidates: base: \"%s\" %s\n",
 429                 base ? base : "NULL", lookupbase ? "lookupbase" : "", 0);
 430
 431         /*
 432          * get the base object - unless we already have it (from one-level).
 433          * also, unless this is a one-level search or a subtree search
 434          * starting at the very top of our subtree, we need to modify the
 435          * filter to be something like this:
 436          *
 437          *      dn=*baseobjectdn & (originalfilter | ref=*)
 438          *
 439          * the "objectclass=referral" part is used to select referrals to return
 440          */
 441
 442         *err = LDAP_SUCCESS;
 443         f = NULL;
 444         if ( lookupbase ) {
 445                 if ( base != NULL && *base != '\0' &&
 446                         (e = dn2entry_r( be, base, matched )) == NULL )
 447                 {
 448                         *err = LDAP_NO_SUCH_OBJECT;
 449                         return( NULL );
 450                 }
 451
 452                 if (e) {
 453                         cache_return_entry_r( &li->li_cache, e );
 454                 }
 455
 456                 f = (Filter *) ch_malloc( sizeof(Filter) );
 457                 f->f_next = NULL;
 458                 f->f_choice = LDAP_FILTER_OR;
 459                 f->f_or = (Filter *) ch_malloc( sizeof(Filter) );
 460                 f->f_or->f_choice = LDAP_FILTER_EQUALITY;
 461                 f->f_or->f_avtype = ch_strdup( "objectclass" );
 462                 /* Patch to use normalized uppercase */
 463                 f->f_or->f_avvalue.bv_val = ch_strdup( "REFERRAL" );
 464                 f->f_or->f_avvalue.bv_len = strlen( "REFERRAL" );
 465                 filterarg_ptr = &f->f_or->f_next;
 466                 *filterarg_ptr = filter;
 467                 filter = f;
 468
 469                 if ( ! be_issuffix( be, base ) ) {
 470                         f = (Filter *) ch_malloc( sizeof(Filter) );
 471                         f->f_next = NULL;
 472                         f->f_choice = LDAP_FILTER_AND;
 473                         f->f_and = (Filter *) ch_malloc( sizeof(Filter) );
 474                         f->f_and->f_choice = LDAP_FILTER_SUBSTRINGS;
 475                         f->f_and->f_sub_type = ch_strdup( "dn" );
 476                         f->f_and->f_sub_initial = NULL;
 477                         f->f_and->f_sub_any = NULL;
 478                         f->f_and->f_sub_final = ch_strdup( base );
 479                         value_normalize( f->f_and->f_sub_final, SYNTAX_CIS );
 480                         f->f_and->f_next = filter;
 481                         filter = f;
 482                 }
 483         }
 484
 485         candidates = filter_candidates( be, filter );
 486
 487         /* free up just the parts we allocated above */
 488         if ( f != NULL ) {
 489                 *filterarg_ptr = NULL;
 490                 filter_free( f );
 491         }
 492
 493         return( candidates );
 494 }