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

   1 /* search.c - ldap backend search function */
   2 /* $OpenLDAP$ */
   3 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
   4  *
   5  * Copyright 1999-2006 The OpenLDAP Foundation.
   6  * Portions Copyright 1999-2003 Howard Chu.
   7  * Portions Copyright 2000-2003 Pierangelo Masarati.
   8  * All rights reserved.
   9  *
  10  * Redistribution and use in source and binary forms, with or without
  11  * modification, are permitted only as authorized by the OpenLDAP
  12  * Public License.
  13  *
  14  * A copy of this license is available in the file LICENSE in the
  15  * top-level directory of the distribution or, alternatively, at
  16  * <http://www.OpenLDAP.org/license.html>.
  17  */
  18 /* ACKNOWLEDGEMENTS:
  19  * This work was initially developed by the Howard Chu for inclusion
  20  * in OpenLDAP Software and subsequently enhanced by Pierangelo
  21  * Masarati.
  22  */
  23
  24 #include "portable.h"
  25
  26 #include <stdio.h>
  27
  28 #include <ac/socket.h>
  29 #include <ac/string.h>
  30 #include <ac/time.h>
  31
  32 #include "slap.h"
  33 #include "back-ldap.h"
  34 #undef ldap_debug       /* silence a warning in ldap-int.h */
  35 #include "../../../libraries/libldap/ldap-int.h"
  36
  37 #include "lutil.h"
  38
  39 static int
  40 ldap_build_entry( Operation *op, LDAPMessage *e, Entry *ent,
  41          struct berval *bdn );
  42
  43 /*
  44  * Quick'n'dirty rewrite of filter in case of error, to deal with
  45  * <draft-zeilenga-ldap-t-f>.
  46  */
  47 static int
  48 ldap_back_munge_filter(
  49         Operation       *op,
  50         struct berval   *filter )
  51 {
  52         ldapinfo_t      *li = (ldapinfo_t *) op->o_bd->be_private;
  53
  54         char            *ptr;
  55         int             gotit = 0;
  56
  57         Debug( LDAP_DEBUG_ARGS, "=> ldap_back_munge_filter \"%s\"\n",
  58                         filter->bv_val, 0, 0 );
  59
  60         for ( ptr = strstr( filter->bv_val, "(?=" );
  61                         ptr;
  62                         ptr = strstr( ptr, "(?=" ) )
  63         {
  64                 static struct berval
  65                         bv_true = BER_BVC( "(?=true)" ),
  66                         bv_false = BER_BVC( "(?=false)" ),
  67                         bv_undefined = BER_BVC( "(?=undefined)" ),
  68                         bv_t = BER_BVC( "(&)" ),
  69                         bv_f = BER_BVC( "(|)" ),
  70                         bv_T = BER_BVC( "(objectClass=*)" ),
  71                         bv_F = BER_BVC( "(!(objectClass=*))" );
  72                 struct berval   *oldbv = NULL,
  73                                 *newbv = NULL,
  74                                 oldfilter = BER_BVNULL;
  75
  76                 if ( strncmp( ptr, bv_true.bv_val, bv_true.bv_len ) == 0 ) {
  77                         oldbv = &bv_true;
  78                         if ( li->li_flags & LDAP_BACK_F_SUPPORT_T_F ) {
  79                                 newbv = &bv_t;
  80
  81                         } else {
  82                                 newbv = &bv_T;
  83                         }
  84
  85                 } else if ( strncmp( ptr, bv_false.bv_val, bv_false.bv_len ) == 0 )
  86                 {
  87                         oldbv = &bv_false;
  88                         if ( li->li_flags & LDAP_BACK_F_SUPPORT_T_F ) {
  89                                 newbv = &bv_f;
  90
  91                         } else {
  92                                 newbv = &bv_F;
  93                         }
  94
  95                 } else if ( strncmp( ptr, bv_undefined.bv_val, bv_undefined.bv_len ) == 0 )
  96                 {
  97                         oldbv = &bv_undefined;
  98                         newbv = &bv_F;
  99
 100                 } else {
 101                         gotit = 0;
 102                         goto done;
 103                 }
 104
 105                 oldfilter = *filter;
 106                 if ( newbv->bv_len > oldbv->bv_len ) {
 107                         filter->bv_len += newbv->bv_len - oldbv->bv_len;
 108                         if ( filter->bv_val == op->ors_filterstr.bv_val ) {
 109                                 filter->bv_val = op->o_tmpalloc( filter->bv_len + 1,
 110                                                 op->o_tmpmemctx );
 111
 112                                 AC_MEMCPY( filter->bv_val, op->ors_filterstr.bv_val,
 113                                                 op->ors_filterstr.bv_len + 1 );
 114
 115                         } else {
 116                                 filter->bv_val = op->o_tmprealloc( filter->bv_val,
 117                                                 filter->bv_len + 1, op->o_tmpmemctx );
 118                         }
 119
 120                         ptr = filter->bv_val + ( ptr - oldfilter.bv_val );
 121                 }
 122
 123                 AC_MEMCPY( &ptr[ newbv->bv_len ],
 124                                 &ptr[ oldbv->bv_len ],
 125                                 oldfilter.bv_len - ( ptr - filter->bv_val ) - oldbv->bv_len + 1 );
 126                 AC_MEMCPY( ptr, newbv->bv_val, newbv->bv_len );
 127
 128                 ptr += newbv->bv_len;
 129                 gotit = 1;
 130         }
 131
 132 done:;
 133         Debug( LDAP_DEBUG_ARGS, "<= ldap_back_munge_filter \"%s\" (%d)\n",
 134                         filter->bv_val, gotit, 0 );
 135
 136         return gotit;
 137 }
 138
 139 int
 140 ldap_back_search(
 141                 Operation       *op,
 142                 SlapReply       *rs )
 143 {
 144         ldapconn_t      *lc;
 145         struct timeval  tv;
 146         time_t          stoptime = (time_t)-1;
 147         LDAPMessage     *res,
 148                         *e;
 149         int             rc = 0,
 150                         msgid;
 151         struct berval   match = BER_BVNULL,
 152                         filter = BER_BVNULL;
 153         int             i;
 154         char            **attrs = NULL;
 155         int             freetext = 0;
 156         int             do_retry = 1, dont_retry = 0;
 157         LDAPControl     **ctrls = NULL;
 158         /* FIXME: shouldn't this be null? */
 159         const char      *save_matched = rs->sr_matched;
 160
 161         lc = ldap_back_getconn( op, rs, LDAP_BACK_SENDERR );
 162         if ( !lc || !ldap_back_dobind( lc, op, rs, LDAP_BACK_SENDERR ) ) {
 163                 return rs->sr_err;
 164         }
 165
 166         /*
 167          * FIXME: in case of values return filter, we might want
 168          * to map attrs and maybe rewrite value
 169          */
 170
 171         /* should we check return values? */
 172         if ( op->ors_deref != -1 ) {
 173                 ldap_set_option( lc->lc_ld, LDAP_OPT_DEREF,
 174                                 (void *)&op->ors_deref );
 175         }
 176
 177         if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
 178                 tv.tv_sec = op->ors_tlimit;
 179                 tv.tv_usec = 0;
 180                 stoptime = op->o_time + op->ors_tlimit;
 181
 182         } else {
 183                 LDAP_BACK_TV_SET( &tv );
 184         }
 185
 186         if ( op->ors_attrs ) {
 187                 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ )
 188                         /* just count attrs */ ;
 189
 190                 attrs = ch_malloc( ( i + 1 )*sizeof( char * ) );
 191                 if ( attrs == NULL ) {
 192                         rs->sr_err = LDAP_NO_MEMORY;
 193                         rc = -1;
 194                         goto finish;
 195                 }
 196
 197                 for ( i = 0; !BER_BVISNULL( &op->ors_attrs[i].an_name ); i++ ) {
 198                         attrs[ i ] = op->ors_attrs[i].an_name.bv_val;
 199                 }
 200                 attrs[ i ] = NULL;
 201         }
 202
 203         ctrls = op->o_ctrls;
 204         rc = ldap_back_proxy_authz_ctrl( lc, op, rs, &ctrls );
 205         if ( rc != LDAP_SUCCESS ) {
 206                 goto finish;
 207         }
 208
 209         /* deal with <draft-zeilenga-ldap-t-f> filters */
 210         filter = op->ors_filterstr;
 211 retry:
 212         rs->sr_err = ldap_search_ext( lc->lc_ld, op->o_req_ndn.bv_val,
 213                         op->ors_scope, filter.bv_val,
 214                         attrs, op->ors_attrsonly, ctrls, NULL,
 215                         tv.tv_sec ? &tv : NULL,
 216                         op->ors_slimit, &msgid );
 217
 218         if ( rs->sr_err != LDAP_SUCCESS ) {
 219                 switch ( rs->sr_err ) {
 220                 case LDAP_SERVER_DOWN:
 221                         if ( do_retry ) {
 222                                 do_retry = 0;
 223                                 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
 224                                         goto retry;
 225                                 }
 226                         }
 227                         if ( lc == NULL ) {
 228                                 /* reset by ldap_back_retry ... */
 229                                 rs->sr_err = slap_map_api2result( rs );
 230
 231                         } else {
 232                                 rc = ldap_back_op_result( lc, op, rs, msgid, 0, LDAP_BACK_DONTSEND );
 233                                 ldap_back_freeconn( op, lc, 0 );
 234                                 lc = NULL;
 235                         }
 236
 237                         goto finish;
 238
 239                 case LDAP_FILTER_ERROR:
 240                         if ( ldap_back_munge_filter( op, &filter ) ) {
 241                                 goto retry;
 242                         }
 243
 244                         /* invalid filters return success with no data */
 245                         rs->sr_err = LDAP_SUCCESS;
 246                         rs->sr_text = NULL;
 247                         goto finish;
 248
 249                 default:
 250                         rs->sr_err = slap_map_api2result( rs );
 251                         rs->sr_text = NULL;
 252                         goto finish;
 253                 }
 254         }
 255
 256         /* We pull apart the ber result, stuff it into a slapd entry, and
 257          * let send_search_entry stuff it back into ber format. Slow & ugly,
 258          * but this is necessary for version matching, and for ACL processing.
 259          */
 260
 261         for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, LDAP_MSG_ONE, &tv, &res ) )
 262         {
 263                 /* check for abandon */
 264                 if ( op->o_abandon ) {
 265                         if ( rc > 0 ) {
 266                                 ldap_msgfree( res );
 267                         }
 268                         ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
 269                         rc = SLAPD_ABANDON;
 270                         goto finish;
 271                 }
 272
 273                 if ( rc == 0 ) {
 274                         LDAP_BACK_TV_SET( &tv );
 275                         ldap_pvt_thread_yield();
 276
 277                         /* check time limit */
 278                         if ( op->ors_tlimit != SLAP_NO_LIMIT
 279                                         && slap_get_time() > stoptime )
 280                         {
 281                                 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
 282                                 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
 283                                 goto finish;
 284                         }
 285                         continue;
 286
 287                 } else {
 288                         /* don't retry any more */
 289                         dont_retry = 1;
 290                 }
 291
 292
 293                 if ( rc == LDAP_RES_SEARCH_ENTRY ) {
 294                         Entry           ent = { 0 };
 295                         struct berval   bdn = BER_BVNULL;
 296
 297                         do_retry = 0;
 298
 299                         e = ldap_first_entry( lc->lc_ld, res );
 300                         rc = ldap_build_entry( op, e, &ent, &bdn );
 301                         if ( rc == LDAP_SUCCESS ) {
 302                                 rs->sr_entry = &ent;
 303                                 rs->sr_attrs = op->ors_attrs;
 304                                 rs->sr_operational_attrs = NULL;
 305                                 rs->sr_flags = 0;
 306                                 rc = rs->sr_err = send_search_entry( op, rs );
 307                                 if ( !BER_BVISNULL( &ent.e_name ) ) {
 308                                         assert( ent.e_name.bv_val != bdn.bv_val );
 309                                         op->o_tmpfree( ent.e_name.bv_val, op->o_tmpmemctx );
 310                                         BER_BVZERO( &ent.e_name );
 311                                 }
 312                                 if ( !BER_BVISNULL( &ent.e_nname ) ) {
 313                                         op->o_tmpfree( ent.e_nname.bv_val, op->o_tmpmemctx );
 314                                         BER_BVZERO( &ent.e_nname );
 315                                 }
 316                                 entry_clean( &ent );
 317                         }
 318                         ldap_msgfree( res );
 319                         if ( rc != LDAP_SUCCESS ) {
 320                                 if ( rc == LDAP_UNAVAILABLE ) {
 321                                         rc = rs->sr_err = LDAP_OTHER;
 322                                 } else {
 323                                         ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
 324                                 }
 325                                 goto finish;
 326                         }
 327
 328                 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
 329                         char            **references = NULL;
 330
 331                         do_retry = 0;
 332                         rc = ldap_parse_reference( lc->lc_ld, res,
 333                                         &references, &rs->sr_ctrls, 1 );
 334
 335                         if ( rc != LDAP_SUCCESS ) {
 336                                 continue;
 337                         }
 338
 339                         /* FIXME: there MUST be at least one */
 340                         if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
 341                                 int             cnt;
 342
 343                                 for ( cnt = 0; references[ cnt ]; cnt++ )
 344                                         /* NO OP */ ;
 345
 346                                 /* FIXME: there MUST be at least one */
 347                                 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
 348
 349                                 for ( cnt = 0; references[ cnt ]; cnt++ ) {
 350                                         ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
 351                                 }
 352                                 BER_BVZERO( &rs->sr_ref[ cnt ] );
 353
 354                                 /* ignore return value by now */
 355                                 ( void )send_search_reference( op, rs );
 356
 357                         } else {
 358                                 Debug( LDAP_DEBUG_ANY,
 359                                         "%s ldap_back_search: "
 360                                         "got SEARCH_REFERENCE "
 361                                         "with no referrals\n",
 362                                         op->o_log_prefix, 0, 0 );
 363                         }
 364
 365                         /* cleanup */
 366                         if ( references ) {
 367                                 ber_memvfree( (void **)references );
 368                                 ch_free( rs->sr_ref );
 369                                 rs->sr_ref = NULL;
 370                         }
 371
 372                         if ( rs->sr_ctrls ) {
 373                                 ldap_controls_free( rs->sr_ctrls );
 374                                 rs->sr_ctrls = NULL;
 375                         }
 376
 377                 } else {
 378                         char            **references = NULL;
 379
 380                         rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
 381                                         &match.bv_val, (char **)&rs->sr_text,
 382                                         &references, &rs->sr_ctrls, 1 );
 383                         freetext = 1;
 384                         if ( rc != LDAP_SUCCESS ) {
 385                                 rs->sr_err = rc;
 386                         }
 387                         rs->sr_err = slap_map_api2result( rs );
 388
 389                         if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
 390                                 int     cnt;
 391
 392                                 if ( rs->sr_err != LDAP_REFERRAL ) {
 393                                         /* FIXME: error */
 394                                         Debug( LDAP_DEBUG_ANY,
 395                                                 "%s ldap_back_search: "
 396                                                 "got referrals with %d\n",
 397                                                 op->o_log_prefix,
 398                                                 rs->sr_err, 0 );
 399                                         rs->sr_err = LDAP_REFERRAL;
 400                                 }
 401
 402                                 for ( cnt = 0; references[ cnt ]; cnt++ )
 403                                         /* NO OP */ ;
 404
 405                                 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
 406
 407                                 for ( cnt = 0; references[ cnt ]; cnt++ ) {
 408                                         /* duplicating ...*/
 409                                         ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
 410                                 }
 411                                 BER_BVZERO( &rs->sr_ref[ cnt ] );
 412                         }
 413
 414                         if ( match.bv_val != NULL ) {
 415                                 {
 416                                         match.bv_len = strlen( match.bv_val );
 417                                 }
 418                         }
 419
 420                         /* cleanup */
 421                         if ( references ) {
 422                                 ber_memvfree( (void **)references );
 423                         }
 424
 425                         rc = 0;
 426                         break;
 427                 }
 428         }
 429
 430         if ( rc == -1 && dont_retry == 0 ) {
 431                 if ( do_retry ) {
 432                         do_retry = 0;
 433                         if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
 434                                 goto retry;
 435                         }
 436                 }
 437                 rs->sr_err = LDAP_SERVER_DOWN;
 438                 rs->sr_err = slap_map_api2result( rs );
 439                 goto finish;
 440         }
 441
 442         /*
 443          * Rewrite the matched portion of the search base, if required
 444          */
 445         if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
 446                 struct berval   pmatch;
 447
 448                 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
 449                         rs->sr_matched = pmatch.bv_val;
 450                         LDAP_FREE( match.bv_val );
 451
 452                 } else {
 453                         rs->sr_matched = match.bv_val;
 454                 }
 455         }
 456
 457         if ( rs->sr_v2ref ) {
 458                 rs->sr_err = LDAP_REFERRAL;
 459         }
 460
 461 finish:;
 462         if ( rc != SLAPD_ABANDON ) {
 463                 send_ldap_result( op, rs );
 464         }
 465
 466         (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
 467
 468         if ( rs->sr_ctrls ) {
 469                 ldap_controls_free( rs->sr_ctrls );
 470                 rs->sr_ctrls = NULL;
 471         }
 472
 473         if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
 474                 if ( rs->sr_matched != match.bv_val ) {
 475                         ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
 476
 477                 } else {
 478                         LDAP_FREE( match.bv_val );
 479                 }
 480                 rs->sr_matched = save_matched;
 481         }
 482
 483         if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
 484                 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
 485         }
 486
 487         if ( rs->sr_text ) {
 488                 if ( freetext ) {
 489                         LDAP_FREE( (char *)rs->sr_text );
 490                 }
 491                 rs->sr_text = NULL;
 492         }
 493
 494         if ( rs->sr_ref ) {
 495                 ber_bvarray_free( rs->sr_ref );
 496                 rs->sr_ref = NULL;
 497         }
 498
 499         if ( attrs ) {
 500                 ch_free( attrs );
 501         }
 502
 503         if ( lc != NULL ) {
 504                 ldap_back_release_conn( op, rs, lc );
 505         }
 506
 507         return rs->sr_err;
 508 }
 509
 510 static int
 511 ldap_build_entry(
 512                 Operation       *op,
 513                 LDAPMessage     *e,
 514                 Entry           *ent,
 515                 struct berval   *bdn )
 516 {
 517         struct berval   a;
 518         BerElement      ber = *e->lm_ber;
 519         Attribute       *attr, **attrp;
 520         const char      *text;
 521         int             last;
 522
 523         /* safe assumptions ... */
 524         assert( ent != NULL );
 525         BER_BVZERO( &ent->e_bv );
 526
 527         if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
 528                 return LDAP_DECODING_ERROR;
 529         }
 530
 531         /*
 532          * Note: this may fail if the target host(s) schema differs
 533          * from the one known to the meta, and a DN with unknown
 534          * attributes is returned.
 535          *
 536          * FIXME: should we log anything, or delegate to dnNormalize?
 537          */
 538         /* Note: if the distinguished values or the naming attributes
 539          * change, should we massage them as well?
 540          */
 541         if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
 542                 op->o_tmpmemctx ) != LDAP_SUCCESS )
 543         {
 544                 return LDAP_INVALID_DN_SYNTAX;
 545         }
 546
 547         attrp = &ent->e_attrs;
 548
 549         while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
 550                 int                             i;
 551                 slap_syntax_validate_func       *validate;
 552                 slap_syntax_transform_func      *pretty;
 553
 554                 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
 555                 if ( attr == NULL ) {
 556                         continue;
 557                 }
 558                 attr->a_flags = 0;
 559                 attr->a_next = 0;
 560                 attr->a_desc = NULL;
 561                 if ( slap_bv2ad( &a, &attr->a_desc, &text )
 562                                 != LDAP_SUCCESS )
 563                 {
 564                         if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
 565                                 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
 566                         {
 567                                 Debug( LDAP_DEBUG_ANY,
 568                                         "%s ldap_build_entry: "
 569                                         "slap_bv2undef_ad(%s): %s\n",
 570                                         op->o_log_prefix, a.bv_val, text );
 571                                 ch_free( attr );
 572                                 continue;
 573                         }
 574                 }
 575
 576                 /* no subschemaSubentry */
 577                 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
 578                         || attr->a_desc == slap_schema.si_ad_entryDN )
 579                 {
 580
 581                         /*
 582                          * We eat target's subschemaSubentry because
 583                          * a search for this value is likely not
 584                          * to resolve to the appropriate backend;
 585                          * later, the local subschemaSubentry is
 586                          * added.
 587                          *
 588                          * We also eat entryDN because the frontend
 589                          * will reattach it without checking if already
 590                          * present...
 591                          */
 592                         ( void )ber_scanf( &ber, "x" /* [W] */ );
 593
 594                         ch_free( attr );
 595                         continue;
 596                 }
 597
 598                 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
 599                                 || attr->a_vals == NULL )
 600                 {
 601                         /*
 602                          * Note: attr->a_vals can be null when using
 603                          * values result filter
 604                          */
 605                         attr->a_vals = (struct berval *)&slap_dummy_bv;
 606                         last = 0;
 607
 608                 } else {
 609                         for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
 610                                 /* just count vals */ ;
 611                 }
 612
 613                 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
 614                 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
 615
 616                 if ( !validate && !pretty ) {
 617                         attr->a_nvals = NULL;
 618                         attr_free( attr );
 619                         goto next_attr;
 620                 }
 621
 622                 for ( i = 0; i < last; i++ ) {
 623                         struct berval   pval;
 624                         int             rc;
 625
 626                         if ( pretty ) {
 627                                 rc = pretty( attr->a_desc->ad_type->sat_syntax,
 628                                         &attr->a_vals[i], &pval, NULL );
 629
 630                         } else {
 631                                 rc = validate( attr->a_desc->ad_type->sat_syntax,
 632                                         &attr->a_vals[i] );
 633                         }
 634
 635                         if ( rc != LDAP_SUCCESS ) {
 636                                 /* check if, by chance, it's an undefined objectClass */
 637                                 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
 638                                                 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
 639                                 {
 640                                         ber_dupbv( &pval, &attr->a_vals[i] );
 641
 642                                 } else {
 643                                         attr->a_nvals = NULL;
 644                                         attr_free( attr );
 645                                         goto next_attr;
 646                                 }
 647                         }
 648
 649                         if ( pretty ) {
 650                                 LBER_FREE( attr->a_vals[i].bv_val );
 651                                 attr->a_vals[i] = pval;
 652                         }
 653                 }
 654
 655                 if ( last && attr->a_desc->ad_type->sat_equality &&
 656                                 attr->a_desc->ad_type->sat_equality->smr_normalize )
 657                 {
 658                         attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
 659                         for ( i = 0; i < last; i++ ) {
 660                                 int             rc;
 661
 662                                 /*
 663                                  * check that each value is valid per syntax
 664                                  * and pretty if appropriate
 665                                  */
 666                                 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
 667                                         SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
 668                                         attr->a_desc->ad_type->sat_syntax,
 669                                         attr->a_desc->ad_type->sat_equality,
 670                                         &attr->a_vals[i], &attr->a_nvals[i],
 671                                         NULL );
 672
 673                                 if ( rc != LDAP_SUCCESS ) {
 674                                         BER_BVZERO( &attr->a_nvals[i] );
 675                                         ch_free( attr );
 676                                         goto next_attr;
 677                                 }
 678                         }
 679                         BER_BVZERO( &attr->a_nvals[i] );
 680
 681                 } else {
 682                         attr->a_nvals = attr->a_vals;
 683                 }
 684                 *attrp = attr;
 685                 attrp = &attr->a_next;
 686
 687 next_attr:;
 688         }
 689
 690         return LDAP_SUCCESS;
 691 }
 692
 693 /* return 0 IFF we can retrieve the entry with ndn
 694  */
 695 int
 696 ldap_back_entry_get(
 697                 Operation               *op,
 698                 struct berval           *ndn,
 699                 ObjectClass             *oc,
 700                 AttributeDescription    *at,
 701                 int                     rw,
 702                 Entry                   **ent
 703 )
 704 {
 705         ldapconn_t      *lc;
 706         int             rc = 1,
 707                         do_not_cache;
 708         struct berval   bdn;
 709         LDAPMessage     *result = NULL,
 710                         *e = NULL;
 711         char            *attr[3], **attrp = NULL;
 712         char            *filter = NULL;
 713         SlapReply       rs;
 714         int             do_retry = 1;
 715         LDAPControl     **ctrls = NULL;
 716
 717         *ent = NULL;
 718
 719         /* Tell getconn this is a privileged op */
 720         do_not_cache = op->o_do_not_cache;
 721         op->o_do_not_cache = 1;
 722         lc = ldap_back_getconn( op, &rs, LDAP_BACK_DONTSEND );
 723         if ( !lc || !ldap_back_dobind( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
 724                 op->o_do_not_cache = do_not_cache;
 725                 return rs.sr_err;
 726         }
 727         op->o_do_not_cache = do_not_cache;
 728
 729         if ( at ) {
 730                 attrp = attr;
 731                 if ( oc && at != slap_schema.si_ad_objectClass ) {
 732                         attr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
 733                         attr[1] = at->ad_cname.bv_val;
 734                         attr[2] = NULL;
 735
 736                 } else {
 737                         attr[0] = at->ad_cname.bv_val;
 738                         attr[1] = NULL;
 739                 }
 740         }
 741
 742         if ( oc ) {
 743                 char    *ptr;
 744
 745                 filter = ch_malloc( STRLENOF( "(objectclass=)" )
 746                                 + oc->soc_cname.bv_len + 1 );
 747                 ptr = lutil_strcopy( filter, "(objectclass=" );
 748                 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
 749                 *ptr++ = ')';
 750                 *ptr++ = '\0';
 751         }
 752
 753         ctrls = op->o_ctrls;
 754         rc = ldap_back_proxy_authz_ctrl( lc, op, &rs, &ctrls );
 755         if ( rc != LDAP_SUCCESS ) {
 756                 goto cleanup;
 757         }
 758
 759 retry:
 760         rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
 761                                 attrp, 0, ctrls, NULL,
 762                                 NULL, LDAP_NO_LIMIT, &result );
 763         if ( rc != LDAP_SUCCESS ) {
 764                 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
 765                         do_retry = 0;
 766                         if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
 767                                 goto retry;
 768                         }
 769                 }
 770                 goto cleanup;
 771         }
 772
 773         e = ldap_first_entry( lc->lc_ld, result );
 774         if ( e == NULL ) {
 775                 /* the entry exists, but it doesn't match the filter? */
 776                 goto cleanup;
 777         }
 778
 779         *ent = ch_calloc( 1, sizeof( Entry ) );
 780         if ( *ent == NULL ) {
 781                 rc = LDAP_NO_MEMORY;
 782                 goto cleanup;
 783         }
 784
 785         rc = ldap_build_entry( op, e, *ent, &bdn );
 786
 787         if ( rc != LDAP_SUCCESS ) {
 788                 ch_free( *ent );
 789                 *ent = NULL;
 790         }
 791
 792 cleanup:
 793         (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
 794
 795         if ( result ) {
 796                 ldap_msgfree( result );
 797         }
 798
 799         if ( filter ) {
 800                 ch_free( filter );
 801         }
 802
 803         if ( lc != NULL ) {
 804                 ldap_back_release_conn( op, &rs, lc );
 805         }
 806
 807         return rc;
 808 }
 809