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

   1 /* $OpenLDAP$ */
   2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   3  *
   4  * Copyright 1999-2006 The OpenLDAP Foundation.
   5  * Portions Copyright 2001-2003 Pierangelo Masarati.
   6  * Portions Copyright 1999-2003 Howard Chu.
   7  * All rights reserved.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted only as authorized by the OpenLDAP
  11  * Public License.
  12  *
  13  * A copy of this license is available in the file LICENSE in the
  14  * top-level directory of the distribution or, alternatively, at
  15  * <http://www.OpenLDAP.org/license.html>.
  16  */
  17 /* ACKNOWLEDGEMENTS:
  18  * This work was initially developed by the Howard Chu for inclusion
  19  * in OpenLDAP Software and subsequently enhanced by Pierangelo
  20  * Masarati.
  21  */
  22
  23 #include "portable.h"
  24
  25 #include <stdio.h>
  26
  27 #include <ac/socket.h>
  28 #include <ac/string.h>
  29 #include <ac/time.h>
  30
  31 #include "slap.h"
  32 #include "../back-ldap/back-ldap.h"
  33 #include "back-meta.h"
  34 #undef ldap_debug       /* silence a warning in ldap-int.h */
  35 #include "ldap_log.h"
  36 #include "../../../libraries/libldap/ldap-int.h"
  37
  38 static int
  39 meta_send_entry(
  40         Operation       *op,
  41         SlapReply       *rs,
  42         metaconn_t      *mc,
  43         int             i,
  44         LDAPMessage     *e );
  45
  46 typedef enum meta_search_candidate_t {
  47         META_SEARCH_ERR = -1,
  48         META_SEARCH_NOT_CANDIDATE,
  49         META_SEARCH_CANDIDATE
  50 } meta_search_candidate_t;
  51
  52 static meta_search_candidate_t
  53 meta_back_search_start(
  54         Operation               *op,
  55         SlapReply               *rs,
  56         dncookie                *dc,
  57         metasingleconn_t        *msc,
  58         int                     candidate,
  59         SlapReply               *candidates
  60 )
  61 {
  62         metainfo_t      *mi = ( metainfo_t * )op->o_bd->be_private;
  63         struct berval   realbase = op->o_req_dn;
  64         int             realscope = op->ors_scope;
  65         ber_len_t       suffixlen = 0;
  66         struct berval   mbase = BER_BVNULL;
  67         struct berval   mfilter = BER_BVNULL;
  68         char            **mapped_attrs = NULL;
  69         int             rc;
  70         meta_search_candidate_t retcode;
  71         struct timeval  tv, *tvp = NULL;
  72
  73         /* should we check return values? */
  74         if ( op->ors_deref != -1 ) {
  75                 ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
  76                                 ( void * )&op->ors_deref );
  77         }
  78
  79         if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
  80                 tv.tv_sec = op->ors_tlimit > 0 ? op->ors_tlimit : 1;
  81                 tvp = &tv;
  82         }
  83
  84         dc->target = &mi->mi_targets[ candidate ];
  85
  86         /*
  87          * modifies the base according to the scope, if required
  88          */
  89         suffixlen = mi->mi_targets[ candidate ].mt_nsuffix.bv_len;
  90         if ( suffixlen > op->o_req_ndn.bv_len ) {
  91                 switch ( op->ors_scope ) {
  92                 case LDAP_SCOPE_SUBTREE:
  93                         /*
  94                          * make the target suffix the new base
  95                          * FIXME: this is very forgiving, because
  96                          * "illegal" searchBases may be turned
  97                          * into the suffix of the target; however,
  98                          * the requested searchBase already passed
  99                          * thru the candidate analyzer...
 100                          */
 101                         if ( dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix,
 102                                         &op->o_req_ndn ) )
 103                         {
 104                                 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
 105                                 if ( mi->mi_targets[ candidate ].mt_scope == LDAP_SCOPE_SUBORDINATE ) {
 106                                         realscope = LDAP_SCOPE_SUBORDINATE;
 107                                 }
 108
 109                         } else {
 110                                 /*
 111                                  * this target is no longer candidate
 112                                  */
 113                                 return META_SEARCH_NOT_CANDIDATE;
 114                         }
 115                         break;
 116
 117                 case LDAP_SCOPE_SUBORDINATE:
 118                 case LDAP_SCOPE_ONELEVEL:
 119                 {
 120                         struct berval   rdn = mi->mi_targets[ candidate ].mt_nsuffix;
 121                         rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
 122                         if ( dnIsOneLevelRDN( &rdn )
 123                                         && dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix, &op->o_req_ndn ) )
 124                         {
 125                                 /*
 126                                  * if there is exactly one level,
 127                                  * make the target suffix the new
 128                                  * base, and make scope "base"
 129                                  */
 130                                 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
 131                                 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
 132                                         if ( mi->mi_targets[ candidate ].mt_scope == LDAP_SCOPE_SUBORDINATE ) {
 133                                                 realscope = LDAP_SCOPE_SUBORDINATE;
 134                                         } else {
 135                                                 realscope = LDAP_SCOPE_SUBTREE;
 136                                         }
 137                                 } else {
 138                                         realscope = LDAP_SCOPE_BASE;
 139                                 }
 140                                 break;
 141                         } /* else continue with the next case */
 142                 }
 143
 144                 case LDAP_SCOPE_BASE:
 145                         /*
 146                          * this target is no longer candidate
 147                          */
 148                         return META_SEARCH_NOT_CANDIDATE;
 149                 }
 150         }
 151
 152         /*
 153          * Rewrite the search base, if required
 154          */
 155         dc->ctx = "searchBase";
 156         switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
 157         default:
 158                 break;
 159
 160         case REWRITE_REGEXEC_UNWILLING:
 161                 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
 162                 rs->sr_text = "Operation not allowed";
 163                 send_ldap_result( op, rs );
 164                 return META_SEARCH_ERR;
 165
 166         case REWRITE_REGEXEC_ERR:
 167
 168                 /*
 169                  * this target is no longer candidate
 170                  */
 171                 return META_SEARCH_NOT_CANDIDATE;
 172         }
 173
 174         /*
 175          * Maps filter
 176          */
 177         rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
 178                         &mfilter, BACKLDAP_MAP );
 179         switch ( rc ) {
 180         case LDAP_SUCCESS:
 181                 break;
 182
 183         case LDAP_COMPARE_FALSE:
 184         default:
 185                 /*
 186                  * this target is no longer candidate
 187                  */
 188                 retcode = META_SEARCH_NOT_CANDIDATE;
 189                 goto done;
 190         }
 191
 192         /*
 193          * Maps required attributes
 194          */
 195         rc = ldap_back_map_attrs( &mi->mi_targets[ candidate ].mt_rwmap.rwm_at,
 196                         op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
 197         if ( rc != LDAP_SUCCESS ) {
 198                 /*
 199                  * this target is no longer candidate
 200                  */
 201                 retcode = META_SEARCH_NOT_CANDIDATE;
 202                 goto done;
 203         }
 204
 205         /*
 206          * Starts the search
 207          */
 208         rc = ldap_search_ext( msc->msc_ld,
 209                         mbase.bv_val, realscope, mfilter.bv_val,
 210                         mapped_attrs, op->ors_attrsonly,
 211                         op->o_ctrls, NULL, tvp, op->ors_slimit,
 212                         &candidates[ candidate ].sr_msgid );
 213         if ( rc == LDAP_SUCCESS ) {
 214                 retcode = META_SEARCH_CANDIDATE;
 215
 216         } else {
 217                 candidates[ candidate ].sr_msgid = -1;
 218                 retcode = META_SEARCH_NOT_CANDIDATE;
 219         }
 220
 221 done:;
 222         if ( mapped_attrs ) {
 223                 free( mapped_attrs );
 224         }
 225         if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
 226                 free( mfilter.bv_val );
 227         }
 228         if ( mbase.bv_val != realbase.bv_val ) {
 229                 free( mbase.bv_val );
 230         }
 231
 232         return retcode;
 233 }
 234
 235 int
 236 meta_back_search( Operation *op, SlapReply *rs )
 237 {
 238         metainfo_t      *mi = ( metainfo_t * )op->o_bd->be_private;
 239         metaconn_t      *mc;
 240         struct timeval  tv = { 0, 0 };
 241         time_t          stoptime = (time_t)-1;
 242         LDAPMessage     *res = NULL, *e;
 243         int             rc = 0, sres = LDAP_SUCCESS;
 244         char            *matched = NULL;
 245         int             last = 0, ncandidates = 0,
 246                         initial_candidates = 0, candidate_match = 0;
 247         long            i;
 248         dncookie        dc;
 249         int             is_ok = 0;
 250         void            *savepriv;
 251         SlapReply       *candidates = meta_back_candidates_get( op );
 252
 253         /*
 254          * controls are set in ldap_back_dobind()
 255          *
 256          * FIXME: in case of values return filter, we might want
 257          * to map attrs and maybe rewrite value
 258          */
 259         mc = meta_back_getconn( op, rs, NULL, LDAP_BACK_SENDERR );
 260         if ( !mc || !meta_back_dobind( op, rs, mc, LDAP_BACK_SENDERR ) ) {
 261                 return rs->sr_err;
 262         }
 263
 264         dc.conn = op->o_conn;
 265         dc.rs = rs;
 266
 267         /*
 268          * Inits searches
 269          */
 270         for ( i = 0; i < mi->mi_ntargets; i++ ) {
 271                 metasingleconn_t        *msc = &mc->mc_conns[ i ];
 272
 273                 candidates[ i ].sr_msgid = -1;
 274                 candidates[ i ].sr_matched = NULL;
 275                 candidates[ i ].sr_text = NULL;
 276                 candidates[ i ].sr_ref = NULL;
 277                 candidates[ i ].sr_ctrls = NULL;
 278
 279                 if ( candidates[ i ].sr_tag != META_CANDIDATE
 280                         || candidates[ i ].sr_err != LDAP_SUCCESS )
 281                 {
 282                         continue;
 283                 }
 284
 285                 switch ( meta_back_search_start( op, rs, &dc, msc, i, candidates ) )
 286                 {
 287                 case META_SEARCH_NOT_CANDIDATE:
 288                         break;
 289
 290                 case META_SEARCH_CANDIDATE:
 291                         candidates[ i ].sr_type = REP_INTERMEDIATE;
 292                         ++ncandidates;
 293                         break;
 294
 295                 case META_SEARCH_ERR:
 296                         rc = -1;
 297                         goto finish;
 298                 }
 299         }
 300
 301         initial_candidates = ncandidates;
 302
 303 #if 0
 304         {
 305                 char    cnd[BUFSIZ];
 306                 int     i;
 307
 308                 for ( i = 0; i < mi->mi_ntargets; i++ ) {
 309                         if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
 310                                 cnd[ i ] = '*';
 311                         } else {
 312                                 cnd[ i ] = ' ';
 313                         }
 314                 }
 315                 cnd[ i ] = '\0';
 316
 317                 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: ncandidates=%d "
 318                         "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
 319         }
 320 #endif
 321
 322         if ( initial_candidates == 0 ) {
 323                 /* NOTE: here we are not sending any matchedDN;
 324                  * this is intended, because if the back-meta
 325                  * is serving this search request, but no valid
 326                  * candidate could be looked up, it means that
 327                  * there is a hole in the mapping of the targets
 328                  * and thus no knowledge of any remote superior
 329                  * is available */
 330                 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: "
 331                         "base=\"%s\" scope=%d: "
 332                         "no candidate could be selected\n",
 333                         op->o_log_prefix, op->o_req_dn.bv_val,
 334                         op->ors_scope );
 335
 336                 /* FIXME: we're sending the first error we encounter;
 337                  * maybe we should pick the worst... */
 338                 rc = LDAP_NO_SUCH_OBJECT;
 339                 for ( i = 0; i < mi->mi_ntargets; i++ ) {
 340                         if ( candidates[ i ].sr_tag == META_CANDIDATE
 341                                 && candidates[ i ].sr_err != LDAP_SUCCESS )
 342                         {
 343                                 rc = candidates[ i ].sr_err;
 344                                 break;
 345                         }
 346                 }
 347
 348                 send_ldap_error( op, rs, rc, NULL );
 349
 350                 goto finish;
 351         }
 352
 353         /* We pull apart the ber result, stuff it into a slapd entry, and
 354          * let send_search_entry stuff it back into ber format. Slow & ugly,
 355          * but this is necessary for version matching, and for ACL processing.
 356          */
 357
 358         if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
 359                 stoptime = op->o_time + op->ors_tlimit;
 360         }
 361
 362         /*
 363          * In case there are no candidates, no cycle takes place...
 364          *
 365          * FIXME: we might use a queue, to better balance the load
 366          * among the candidates
 367          */
 368         for ( rc = 0; ncandidates > 0; ) {
 369                 int     gotit = 0, doabandon = 0;
 370
 371                 for ( i = 0; i < mi->mi_ntargets; i++ ) {
 372                         metasingleconn_t        *msc = &mc->mc_conns[ i ];
 373
 374                         if ( candidates[ i ].sr_msgid == -1 ) {
 375                                 continue;
 376                         }
 377
 378                         /* check for abandon */
 379                         if ( op->o_abandon ) {
 380                                 break;
 381                         }
 382
 383                         /*
 384                          * FIXME: handle time limit as well?
 385                          * Note that target servers are likely
 386                          * to handle it, so at some time we'll
 387                          * get a LDAP_TIMELIMIT_EXCEEDED from
 388                          * one of them ...
 389                          */
 390 get_result:;
 391                         rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
 392                                         LDAP_MSG_ONE, &tv, &res );
 393
 394                         if ( rc == 0 ) {
 395                                 /* FIXME: res should not need to be freed */
 396                                 assert( res == NULL );
 397
 398                                 /* check time limit */
 399                                 if ( op->ors_tlimit != SLAP_NO_LIMIT
 400                                                 && slap_get_time() > stoptime )
 401                                 {
 402                                         doabandon = 1;
 403                                         rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
 404                                         savepriv = op->o_private;
 405                                         op->o_private = (void *)i;
 406                                         send_ldap_result( op, rs );
 407                                         op->o_private = savepriv;
 408                                         goto finish;
 409                                 }
 410
 411                                 continue;
 412
 413                         } else if ( rc == -1 ) {
 414 really_bad:;
 415                                 /* something REALLY bad happened! */
 416                                 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
 417                                         candidates[ i ].sr_type = REP_RESULT;
 418
 419                                         if ( meta_back_retry( op, rs, &mc, i, LDAP_BACK_DONTSEND ) ) {
 420                                                 switch ( meta_back_search_start( op, rs, &dc, msc, i, candidates ) )
 421                                                 {
 422                                                 case META_SEARCH_CANDIDATE:
 423                                                         goto get_result;
 424
 425                                                 default:
 426                                                         rc = rs->sr_err = LDAP_OTHER;
 427                                                         goto finish;
 428                                                 }
 429                                         }
 430
 431                                         savepriv = op->o_private;
 432                                         op->o_private = (void *)i;
 433                                         send_ldap_result( op, rs );
 434                                         op->o_private = savepriv;
 435                                         goto finish;
 436                                 }
 437
 438                                 /*
 439                                  * When no candidates are left,
 440                                  * the outer cycle finishes
 441                                  */
 442                                 candidates[ i ].sr_msgid = -1;
 443                                 --ncandidates;
 444                                 rs->sr_err = candidates[ i ].sr_err = LDAP_OTHER;
 445                                 rs->sr_text = "remote server unavailable";
 446
 447                         } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
 448                                 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
 449                                         /* don't retry any more... */
 450                                         candidates[ i ].sr_type = REP_RESULT;
 451                                 }
 452
 453                                 is_ok++;
 454
 455                                 e = ldap_first_entry( msc->msc_ld, res );
 456                                 savepriv = op->o_private;
 457                                 op->o_private = (void *)i;
 458                                 rs->sr_err = meta_send_entry( op, rs, mc, i, e );
 459                                 ldap_msgfree( res );
 460                                 res = NULL;
 461
 462                                 switch ( rs->sr_err ) {
 463                                 case LDAP_SIZELIMIT_EXCEEDED:
 464                                         savepriv = op->o_private;
 465                                         op->o_private = (void *)i;
 466                                         send_ldap_result( op, rs );
 467                                         op->o_private = savepriv;
 468                                         rs->sr_err = LDAP_SUCCESS;
 469                                         goto finish;
 470
 471                                 case LDAP_UNAVAILABLE:
 472                                         rs->sr_err = LDAP_OTHER;
 473                                         goto finish;
 474                                 }
 475                                 op->o_private = savepriv;
 476
 477                                 gotit = 1;
 478
 479 #if 0
 480                                 /*
 481                                  * If scope is BASE, we need to jump out
 482                                  * as soon as one entry is found; if
 483                                  * the target pool is properly crafted,
 484                                  * this should correspond to the sole
 485                                  * entry that has the base DN
 486                                  */
 487                                 /* FIXME: this defeats the purpose of
 488                                  * doing a search with scope == base and
 489                                  * sizelimit = 1 to determine if a
 490                                  * candidate is actually unique */
 491                                 if ( op->ors_scope == LDAP_SCOPE_BASE
 492                                                 && rs->sr_nentries > 0 )
 493                                 {
 494                                         doabandon = 1;
 495                                         ncandidates = 0;
 496                                         sres = LDAP_SUCCESS;
 497                                         break;
 498                                 }
 499 #endif
 500
 501                         } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
 502                                 char            **references = NULL;
 503                                 int             cnt;
 504
 505                                 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
 506                                         /* don't retry any more... */
 507                                         candidates[ i ].sr_type = REP_RESULT;
 508                                 }
 509
 510                                 is_ok++;
 511
 512                                 rc = ldap_parse_reference( msc->msc_ld, res,
 513                                                 &references, &rs->sr_ctrls, 1 );
 514                                 res = NULL;
 515
 516                                 if ( rc != LDAP_SUCCESS ) {
 517                                         continue;
 518                                 }
 519
 520                                 if ( references == NULL ) {
 521                                         continue;
 522                                 }
 523
 524 #ifdef ENABLE_REWRITE
 525                                 dc.ctx = "referralDN";
 526 #else /* ! ENABLE_REWRITE */
 527                                 dc.tofrom = 0;
 528                                 dc.normalized = 0;
 529 #endif /* ! ENABLE_REWRITE */
 530
 531                                 /* FIXME: merge all and return at the end */
 532
 533                                 for ( cnt = 0; references[ cnt ]; cnt++ )
 534                                         ;
 535
 536                                 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
 537
 538                                 for ( cnt = 0; references[ cnt ]; cnt++ ) {
 539                                         ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
 540                                 }
 541                                 BER_BVZERO( &rs->sr_ref[ cnt ] );
 542
 543                                 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
 544
 545                                 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
 546                                         /* ignore return value by now */
 547                                         savepriv = op->o_private;
 548                                         op->o_private = (void *)i;
 549                                         ( void )send_search_reference( op, rs );
 550                                         op->o_private = savepriv;
 551
 552                                         ber_bvarray_free( rs->sr_ref );
 553                                         rs->sr_ref = NULL;
 554                                 }
 555
 556                                 /* cleanup */
 557                                 if ( references ) {
 558                                         ber_memvfree( (void **)references );
 559                                 }
 560
 561                                 if ( rs->sr_ctrls ) {
 562                                         ldap_controls_free( rs->sr_ctrls );
 563                                         rs->sr_ctrls = NULL;
 564                                 }
 565
 566                         } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
 567                                 char            buf[ SLAP_TEXT_BUFLEN ];
 568                                 char            **references = NULL;
 569
 570                                 if ( candidates[ i ].sr_type == REP_INTERMEDIATE ) {
 571                                         /* don't retry any more... */
 572                                         candidates[ i ].sr_type = REP_RESULT;
 573                                 }
 574
 575                                 /* NOTE: ignores response controls
 576                                  * (and intermediate response controls
 577                                  * as well, except for those with search
 578                                  * references); this may not be correct,
 579                                  * but if they're not ignored then
 580                                  * back-meta would need to merge them
 581                                  * consistently (think of pagedResults...)
 582                                  */
 583                                 rs->sr_err = ldap_parse_result( msc->msc_ld,
 584                                                         res,
 585                                                         &candidates[ i ].sr_err,
 586                                                         (char **)&candidates[ i ].sr_matched,
 587                                                         NULL /* (char **)&candidates[ i ].sr_text */ ,
 588                                                         &references,
 589                                                         NULL /* &candidates[ i ].sr_ctrls (unused) */ ,
 590                                                         1 );
 591                                 res = NULL;
 592                                 if ( rs->sr_err != LDAP_SUCCESS ) {
 593                                         ldap_get_option( msc->msc_ld,
 594                                                         LDAP_OPT_ERROR_NUMBER,
 595                                                         &rs->sr_err );
 596                                         sres = slap_map_api2result( rs );
 597                                         candidates[ i ].sr_type = REP_RESULT;
 598                                         goto really_bad;
 599                                 }
 600
 601                                 /* massage matchedDN if need be */
 602                                 if ( candidates[ i ].sr_matched != NULL ) {
 603                                         struct berval   match, mmatch;
 604
 605                                         ber_str2bv( candidates[ i ].sr_matched,
 606                                                 0, 0, &match );
 607                                         candidates[ i ].sr_matched = NULL;
 608
 609                                         dc.ctx = "matchedDN";
 610                                         dc.target = &mi->mi_targets[ i ];
 611                                         if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
 612                                                 if ( mmatch.bv_val == match.bv_val ) {
 613                                                         candidates[ i ].sr_matched = ch_strdup( mmatch.bv_val );
 614
 615                                                 } else {
 616                                                         candidates[ i ].sr_matched = mmatch.bv_val;
 617                                                 }
 618
 619                                                 candidate_match++;
 620                                         }
 621                                         ldap_memfree( match.bv_val );
 622                                 }
 623
 624                                 /* add references to array */
 625                                 if ( references ) {
 626                                         BerVarray       sr_ref;
 627                                         int             cnt;
 628
 629                                         for ( cnt = 0; references[ cnt ]; cnt++ )
 630                                                 ;
 631
 632                                         sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
 633
 634                                         for ( cnt = 0; references[ cnt ]; cnt++ ) {
 635                                                 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
 636                                         }
 637                                         BER_BVZERO( &sr_ref[ cnt ] );
 638
 639                                         ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
 640
 641                                         /* cleanup */
 642                                         ber_memvfree( (void **)references );
 643
 644                                         if ( rs->sr_v2ref == NULL ) {
 645                                                 rs->sr_v2ref = sr_ref;
 646
 647                                         } else {
 648                                                 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
 649                                                         ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
 650                                                 }
 651                                                 ber_memfree( sr_ref );
 652                                         }
 653                                 }
 654
 655                                 rs->sr_err = candidates[ i ].sr_err;
 656                                 sres = slap_map_api2result( rs );
 657
 658                                 if ( LogTest( LDAP_DEBUG_TRACE | LDAP_DEBUG_ANY ) ) {
 659                                         snprintf( buf, sizeof( buf ),
 660                                                 "%s meta_back_search[%ld] "
 661                                                 "match=\"%s\" err=%ld",
 662                                                 op->o_log_prefix, i,
 663                                                 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
 664                                                 (long) candidates[ i ].sr_err );
 665                                         if ( candidates[ i ].sr_err == LDAP_SUCCESS ) {
 666                                                 Debug( LDAP_DEBUG_TRACE, "%s.\n", buf, 0, 0 );
 667
 668                                         } else {
 669                                                 Debug( LDAP_DEBUG_ANY, "%s (%s).\n",
 670                                                         buf, ldap_err2string( candidates[ i ].sr_err ), 0 );
 671                                         }
 672                                 }
 673
 674                                 switch ( sres ) {
 675                                 case LDAP_NO_SUCH_OBJECT:
 676                                         /* is_ok is touched any time a valid
 677                                          * (even intermediate) result is
 678                                          * returned; as a consequence, if
 679                                          * a candidate returns noSuchObject
 680                                          * it is ignored and the candidate
 681                                          * is simply demoted. */
 682                                         if ( is_ok ) {
 683                                                 sres = LDAP_SUCCESS;
 684                                         }
 685                                         break;
 686
 687                                 case LDAP_SUCCESS:
 688                                 case LDAP_REFERRAL:
 689                                         is_ok++;
 690                                         break;
 691
 692                                 case LDAP_SIZELIMIT_EXCEEDED:
 693                                         /* if a target returned sizelimitExceeded
 694                                          * and the entry count is equal to the
 695                                          * proxy's limit, the target would have
 696                                          * returned more, and the error must be
 697                                          * propagated to the client; otherwise,
 698                                          * the target enforced a limit lower
 699                                          * than what requested by the proxy;
 700                                          * ignore it */
 701                                         if ( rs->sr_nentries == op->ors_slimit ) {
 702                                                 savepriv = op->o_private;
 703                                                 op->o_private = (void *)i;
 704                                                 send_ldap_result( op, rs );
 705                                                 op->o_private = savepriv;
 706                                                 goto finish;
 707                                         }
 708                                         break;
 709
 710                                 default:
 711                                         if ( META_BACK_ONERR_STOP( mi ) ) {
 712                                                 savepriv = op->o_private;
 713                                                 op->o_private = (void *)i;
 714                                                 send_ldap_result( op, rs );
 715                                                 op->o_private = savepriv;
 716                                                 goto finish;
 717                                         }
 718                                         break;
 719                                 }
 720
 721                                 last = i;
 722                                 rc = 0;
 723
 724                                 /*
 725                                  * When no candidates are left,
 726                                  * the outer cycle finishes
 727                                  */
 728                                 candidates[ i ].sr_msgid = -1;
 729                                 --ncandidates;
 730
 731                         } else {
 732                                 assert( 0 );
 733                                 goto really_bad;
 734                         }
 735                 }
 736
 737                 /* check for abandon */
 738                 if ( op->o_abandon || doabandon ) {
 739                         for ( i = 0; i < mi->mi_ntargets; i++ ) {
 740                                 metasingleconn_t        *msc = &mc->mc_conns[ i ];
 741
 742                                 if ( candidates[ i ].sr_msgid != -1 ) {
 743                                         ldap_abandon_ext( msc->msc_ld,
 744                                                 candidates[ i ].sr_msgid,
 745                                                 NULL, NULL );
 746                                         candidates[ i ].sr_msgid = -1;
 747                                 }
 748                         }
 749
 750                         if ( op->o_abandon ) {
 751                                 rc = SLAPD_ABANDON;
 752                                 goto finish;
 753                         }
 754                 }
 755
 756                 if ( gotit == 0 ) {
 757                         LDAP_BACK_TV_SET( &tv );
 758                         ldap_pvt_thread_yield();
 759
 760                 } else {
 761                         tv.tv_sec = 0;
 762                         tv.tv_usec = 0;
 763                 }
 764         }
 765
 766         if ( rc == -1 ) {
 767                 /*
 768                  * FIXME: need a better strategy to handle errors
 769                  */
 770                 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE );
 771                 goto finish;
 772         }
 773
 774         /*
 775          * Rewrite the matched portion of the search base, if required
 776          *
 777          * FIXME: only the last one gets caught!
 778          */
 779         savepriv = op->o_private;
 780         op->o_private = (void *)(long)mi->mi_ntargets;
 781         if ( candidate_match > 0 ) {
 782                 struct berval   pmatched = BER_BVNULL;
 783
 784                 /* we use the first one */
 785                 for ( i = 0; i < mi->mi_ntargets; i++ ) {
 786                         if ( candidates[ i ].sr_tag == META_CANDIDATE
 787                                         && candidates[ i ].sr_matched != NULL )
 788                         {
 789                                 struct berval   bv, pbv;
 790                                 int             rc;
 791
 792                                 /* if we got success, and this target
 793                                  * returned noSuchObject, and its suffix
 794                                  * is a superior of the searchBase,
 795                                  * ignore the matchedDN */
 796                                 if ( sres == LDAP_SUCCESS
 797                                         && candidates[ i ].sr_err == LDAP_NO_SUCH_OBJECT
 798                                         && op->o_req_ndn.bv_len > mi->mi_targets[ i ].mt_nsuffix.bv_len )
 799                                 {
 800                                         free( (char *)candidates[ i ].sr_matched );
 801                                         candidates[ i ].sr_matched = NULL;
 802                                         continue;
 803                                 }
 804
 805                                 ber_str2bv( candidates[ i ].sr_matched, 0, 0, &bv );
 806                                 rc = dnPretty( NULL, &bv, &pbv, op->o_tmpmemctx );
 807
 808                                 if ( rc == LDAP_SUCCESS ) {
 809
 810                                         /* NOTE: if they all are superiors
 811                                          * of the baseDN, the shorter is also
 812                                          * superior of the longer... */
 813                                         if ( pbv.bv_len > pmatched.bv_len ) {
 814                                                 if ( !BER_BVISNULL( &pmatched ) ) {
 815                                                         op->o_tmpfree( pmatched.bv_val, op->o_tmpmemctx );
 816                                                 }
 817                                                 pmatched = pbv;
 818                                                 op->o_private = (void *)i;
 819
 820                                         } else {
 821                                                 op->o_tmpfree( pbv.bv_val, op->o_tmpmemctx );
 822                                         }
 823                                 }
 824
 825                                 if ( candidates[ i ].sr_matched != NULL ) {
 826                                         free( (char *)candidates[ i ].sr_matched );
 827                                         candidates[ i ].sr_matched = NULL;
 828                                 }
 829                         }
 830                 }
 831
 832                 if ( !BER_BVISNULL( &pmatched ) ) {
 833                         matched = pmatched.bv_val;
 834                 }
 835
 836         } else if ( sres == LDAP_NO_SUCH_OBJECT ) {
 837                 matched = op->o_bd->be_suffix[ 0 ].bv_val;
 838         }
 839
 840 #if 0
 841         {
 842                 char    buf[BUFSIZ];
 843                 char    cnd[BUFSIZ];
 844                 int     i;
 845
 846                 for ( i = 0; i < mi->mi_ntargets; i++ ) {
 847                         if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
 848                                 cnd[ i ] = '*';
 849                         } else {
 850                                 cnd[ i ] = ' ';
 851                         }
 852                 }
 853                 cnd[ i ] = '\0';
 854
 855                 snprintf( buf, sizeof( buf ), "%s meta_back_search: is_scope=%d is_ok=%d cnd=\"%s\"\n",
 856                         op->o_log_prefix, initial_candidates, is_ok, cnd );
 857
 858                 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
 859         }
 860 #endif
 861
 862         /*
 863          * In case we returned at least one entry, we return LDAP_SUCCESS
 864          * otherwise, the latter error code we got
 865          *
 866          * FIXME: we should handle error codes and return the more
 867          * important/reasonable
 868          */
 869
 870         if ( sres == LDAP_SUCCESS && rs->sr_v2ref ) {
 871                 sres = LDAP_REFERRAL;
 872         }
 873         rs->sr_err = sres;
 874         rs->sr_matched = matched;
 875         rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
 876         send_ldap_result( op, rs );
 877         op->o_private = savepriv;
 878         rs->sr_matched = NULL;
 879         rs->sr_ref = NULL;
 880
 881 finish:;
 882         if ( matched && matched != op->o_bd->be_suffix[ 0 ].bv_val ) {
 883                 op->o_tmpfree( matched, op->o_tmpmemctx );
 884         }
 885
 886         if ( rs->sr_v2ref ) {
 887                 ber_bvarray_free( rs->sr_v2ref );
 888         }
 889
 890         for ( i = 0; i < mi->mi_ntargets; i++ ) {
 891                 if ( candidates[ i ].sr_tag != META_CANDIDATE ) {
 892                         continue;
 893                 }
 894
 895                 if ( candidates[ i ].sr_matched ) {
 896                         free( (char *)candidates[ i ].sr_matched );
 897                         candidates[ i ].sr_matched = NULL;
 898                 }
 899
 900                 if ( candidates[ i ].sr_text ) {
 901                         ldap_memfree( (char *)candidates[ i ].sr_text );
 902                         candidates[ i ].sr_text = NULL;
 903                 }
 904
 905                 if ( candidates[ i ].sr_ref ) {
 906                         ber_bvarray_free( candidates[ i ].sr_ref );
 907                         candidates[ i ].sr_ref = NULL;
 908                 }
 909
 910                 if ( candidates[ i ].sr_ctrls ) {
 911                         ldap_controls_free( candidates[ i ].sr_ctrls );
 912                         candidates[ i ].sr_ctrls = NULL;
 913                 }
 914         }
 915
 916         if ( mc ) {
 917                 meta_back_release_conn( op, mc );
 918         }
 919
 920         return rs->sr_err;
 921 }
 922
 923 static int
 924 meta_send_entry(
 925         Operation       *op,
 926         SlapReply       *rs,
 927         metaconn_t      *mc,
 928         int             target,
 929         LDAPMessage     *e )
 930 {
 931         metainfo_t              *mi = ( metainfo_t * )op->o_bd->be_private;
 932         struct berval           a, mapped;
 933         Entry                   ent = { 0 };
 934         BerElement              ber = *e->lm_ber;
 935         Attribute               *attr, **attrp;
 936         struct berval           bdn,
 937                                 dn = BER_BVNULL;
 938         const char              *text;
 939         dncookie                dc;
 940         int                     rc;
 941
 942         if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
 943                 return LDAP_DECODING_ERROR;
 944         }
 945
 946         /*
 947          * Rewrite the dn of the result, if needed
 948          */
 949         dc.target = &mi->mi_targets[ target ];
 950         dc.conn = op->o_conn;
 951         dc.rs = rs;
 952         dc.ctx = "searchResult";
 953
 954         rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &dn );
 955         if ( rs->sr_err != LDAP_SUCCESS) {
 956                 return rs->sr_err;
 957         }
 958
 959         /*
 960          * Note: this may fail if the target host(s) schema differs
 961          * from the one known to the meta, and a DN with unknown
 962          * attributes is returned.
 963          *
 964          * FIXME: should we log anything, or delegate to dnNormalize?
 965          */
 966         rc = dnPrettyNormal( NULL, &dn, &ent.e_name, &ent.e_nname,
 967                 op->o_tmpmemctx );
 968         if ( dn.bv_val != bdn.bv_val ) {
 969                 free( dn.bv_val );
 970         }
 971         BER_BVZERO( &dn );
 972
 973         if ( rc != LDAP_SUCCESS ) {
 974                 return LDAP_INVALID_DN_SYNTAX;
 975         }
 976
 977         /*
 978          * cache dn
 979          */
 980         if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
 981                 ( void )meta_dncache_update_entry( &mi->mi_cache,
 982                                 &ent.e_nname, target );
 983         }
 984
 985         attrp = &ent.e_attrs;
 986
 987         dc.ctx = "searchAttrDN";
 988         while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
 989                 int                             last = 0;
 990                 slap_syntax_validate_func       *validate;
 991                 slap_syntax_transform_func      *pretty;
 992
 993                 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_at,
 994                                 &a, &mapped, BACKLDAP_REMAP );
 995                 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
 996                         ( void )ber_scanf( &ber, "x" /* [W] */ );
 997                         continue;
 998                 }
 999                 attr = ( Attribute * )ch_calloc( 1, sizeof( Attribute ) );
1000                 if ( attr == NULL ) {
1001                         continue;
1002                 }
1003                 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
1004                                 != LDAP_SUCCESS) {
1005                         if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text,
1006                                 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
1007                         {
1008                                 char    buf[ SLAP_TEXT_BUFLEN ];
1009
1010                                 snprintf( buf, sizeof( buf ),
1011                                         "%s meta_send_entry(\"%s\"): "
1012                                         "slap_bv2undef_ad(%s): %s\n",
1013                                         op->o_log_prefix, ent.e_name.bv_val,
1014                                         mapped.bv_val, text );
1015
1016                                 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
1017                                 ch_free( attr );
1018                                 continue;
1019                         }
1020                 }
1021
1022                 /* no subschemaSubentry */
1023                 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
1024                         || attr->a_desc == slap_schema.si_ad_entryDN )
1025                 {
1026
1027                         /*
1028                          * We eat target's subschemaSubentry because
1029                          * a search for this value is likely not
1030                          * to resolve to the appropriate backend;
1031                          * later, the local subschemaSubentry is
1032                          * added.
1033                          *
1034                          * We also eat entryDN because the frontend
1035                          * will reattach it without checking if already
1036                          * present...
1037                          */
1038                         ( void )ber_scanf( &ber, "x" /* [W] */ );
1039
1040                         ch_free(attr);
1041                         continue;
1042                 }
1043
1044                 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
1045                                 || attr->a_vals == NULL )
1046                 {
1047                         attr->a_vals = (struct berval *)&slap_dummy_bv;
1048
1049                 } else {
1050                         for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last )
1051                                 ;
1052                 }
1053
1054                 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
1055                 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
1056
1057                 if ( !validate && !pretty ) {
1058                         attr_free( attr );
1059                         goto next_attr;
1060                 }
1061
1062                 if ( attr->a_desc == slap_schema.si_ad_objectClass
1063                                 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
1064                 {
1065                         struct berval   *bv;
1066
1067                         for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
1068                                 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_oc,
1069                                                 bv, &mapped, BACKLDAP_REMAP );
1070                                 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
1071                                         free( bv->bv_val );
1072                                         BER_BVZERO( bv );
1073                                         if ( --last < 0 ) {
1074                                                 break;
1075                                         }
1076                                         *bv = attr->a_vals[ last ];
1077                                         BER_BVZERO( &attr->a_vals[ last ] );
1078                                         bv--;
1079
1080                                 } else if ( mapped.bv_val != bv->bv_val ) {
1081                                         free( bv->bv_val );
1082                                         ber_dupbv( bv, &mapped );
1083                                 }
1084                         }
1085                 /*
1086                  * It is necessary to try to rewrite attributes with
1087                  * dn syntax because they might be used in ACLs as
1088                  * members of groups; since ACLs are applied to the
1089                  * rewritten stuff, no dn-based subecj clause could
1090                  * be used at the ldap backend side (see
1091                  * http://www.OpenLDAP.org/faq/data/cache/452.html)
1092                  * The problem can be overcome by moving the dn-based
1093                  * ACLs to the target directory server, and letting
1094                  * everything pass thru the ldap backend.
1095                  */
1096                 } else {
1097                         int     i;
1098
1099                         if ( attr->a_desc->ad_type->sat_syntax ==
1100                                 slap_schema.si_syn_distinguishedName )
1101                         {
1102                                 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
1103
1104                         } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
1105                                 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
1106
1107                         }
1108
1109                         for ( i = 0; i < last; i++ ) {
1110                                 struct berval   pval;
1111                                 int             rc;
1112
1113                                 if ( pretty ) {
1114                                         rc = pretty( attr->a_desc->ad_type->sat_syntax,
1115                                                 &attr->a_vals[i], &pval, NULL );
1116
1117                                 } else {
1118                                         rc = validate( attr->a_desc->ad_type->sat_syntax,
1119                                                 &attr->a_vals[i] );
1120                                 }
1121
1122                                 if ( rc ) {
1123                                         LBER_FREE( attr->a_vals[i].bv_val );
1124                                         if ( --last == i ) {
1125                                                 BER_BVZERO( &attr->a_vals[ i ] );
1126                                                 break;
1127                                         }
1128                                         attr->a_vals[i] = attr->a_vals[last];
1129                                         BER_BVZERO( &attr->a_vals[last] );
1130                                         i--;
1131                                         continue;
1132                                 }
1133
1134                                 if ( pretty ) {
1135                                         LBER_FREE( attr->a_vals[i].bv_val );
1136                                         attr->a_vals[i] = pval;
1137                                 }
1138                         }
1139
1140                         if ( last == 0 && attr->a_vals != &slap_dummy_bv ) {
1141                                 attr_free( attr );
1142                                 goto next_attr;
1143                         }
1144                 }
1145
1146                 if ( last && attr->a_desc->ad_type->sat_equality &&
1147                         attr->a_desc->ad_type->sat_equality->smr_normalize )
1148                 {
1149                         int i;
1150
1151                         attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
1152                         for ( i = 0; i<last; i++ ) {
1153                                 attr->a_desc->ad_type->sat_equality->smr_normalize(
1154                                         SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
1155                                         attr->a_desc->ad_type->sat_syntax,
1156                                         attr->a_desc->ad_type->sat_equality,
1157                                         &attr->a_vals[i], &attr->a_nvals[i],
1158                                         NULL );
1159                         }
1160                         BER_BVZERO( &attr->a_nvals[i] );
1161
1162                 } else {
1163                         attr->a_nvals = attr->a_vals;
1164                 }
1165
1166                 *attrp = attr;
1167                 attrp = &attr->a_next;
1168 next_attr:;
1169         }
1170         rs->sr_entry = &ent;
1171         rs->sr_attrs = op->ors_attrs;
1172         rs->sr_flags = 0;
1173         rs->sr_err = LDAP_SUCCESS;
1174         rc = send_search_entry( op, rs );
1175         switch ( rc ) {
1176         case LDAP_UNAVAILABLE:
1177                 rc = LDAP_OTHER;
1178                 break;
1179         }
1180         rs->sr_entry = NULL;
1181         rs->sr_attrs = NULL;
1182
1183         if ( !BER_BVISNULL( &ent.e_name ) ) {
1184                 free( ent.e_name.bv_val );
1185                 BER_BVZERO( &ent.e_name );
1186         }
1187         if ( !BER_BVISNULL( &ent.e_nname ) ) {
1188                 free( ent.e_nname.bv_val );
1189                 BER_BVZERO( &ent.e_nname );
1190         }
1191         entry_clean( &ent );
1192
1193         return rc;
1194 }
1195