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-2005 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;
 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 fail:;
 220                 switch ( rs->sr_err ) {
 221                 case LDAP_SERVER_DOWN:
 222                         if ( do_retry ) {
 223                                 do_retry = 0;
 224                                 if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_DONTSEND ) ) {
 225                                         goto retry;
 226                                 }
 227                         }
 228                         if ( lc == NULL ) {
 229                                 /* reset by ldap_back_retry ... */
 230                                 rs->sr_err = slap_map_api2result( rs );
 231
 232                         } else {
 233                                 rc = ldap_back_op_result( lc, op, rs, msgid, 0, LDAP_BACK_DONTSEND );
 234                                 ldap_back_freeconn( op, lc, 0 );
 235                                 lc = NULL;
 236                         }
 237
 238                         goto finish;
 239
 240                 case LDAP_FILTER_ERROR:
 241                         if ( ldap_back_munge_filter( op, &filter ) ) {
 242                                 goto retry;
 243                         }
 244
 245                         /* invalid filters return success with no data */
 246                         rs->sr_err = LDAP_SUCCESS;
 247                         rs->sr_text = NULL;
 248                         goto finish;
 249
 250                 default:
 251                         rs->sr_err = slap_map_api2result( rs );
 252                         rs->sr_text = NULL;
 253                         goto finish;
 254                 }
 255         }
 256
 257         /* We pull apart the ber result, stuff it into a slapd entry, and
 258          * let send_search_entry stuff it back into ber format. Slow & ugly,
 259          * but this is necessary for version matching, and for ACL processing.
 260          */
 261
 262         for ( rc = 0; rc != -1; rc = ldap_result( lc->lc_ld, msgid, 0, &tv, &res ) )
 263         {
 264                 /* check for abandon */
 265                 if ( op->o_abandon ) {
 266                         if ( rc > 0 ) {
 267                                 ldap_msgfree( res );
 268                         }
 269                         ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
 270                         rc = SLAPD_ABANDON;
 271                         goto finish;
 272                 }
 273
 274                 if ( rc == 0 ) {
 275                         LDAP_BACK_TV_SET( &tv );
 276                         ldap_pvt_thread_yield();
 277
 278                         /* check time limit */
 279                         if ( op->ors_tlimit != SLAP_NO_LIMIT
 280                                         && slap_get_time() > stoptime )
 281                         {
 282                                 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
 283                                 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
 284                                 goto finish;
 285                         }
 286
 287                 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
 288                         Entry           ent = { 0 };
 289                         struct berval   bdn = BER_BVNULL;
 290                         int             abort = 0;
 291
 292                         do_retry = 0;
 293
 294                         e = ldap_first_entry( lc->lc_ld, res );
 295                         rc = ldap_build_entry( op, e, &ent, &bdn );
 296                         if ( rc == LDAP_SUCCESS ) {
 297                                 rs->sr_entry = &ent;
 298                                 rs->sr_attrs = op->ors_attrs;
 299                                 rs->sr_operational_attrs = NULL;
 300                                 rs->sr_flags = 0;
 301                                 abort = send_search_entry( op, rs );
 302                                 if ( !BER_BVISNULL( &ent.e_name ) ) {
 303                                         assert( ent.e_name.bv_val != bdn.bv_val );
 304                                         free( ent.e_name.bv_val );
 305                                         BER_BVZERO( &ent.e_name );
 306                                 }
 307                                 if ( !BER_BVISNULL( &ent.e_nname ) ) {
 308                                         free( ent.e_nname.bv_val );
 309                                         BER_BVZERO( &ent.e_nname );
 310                                 }
 311                                 entry_clean( &ent );
 312                         }
 313                         ldap_msgfree( res );
 314                         if ( abort ) {
 315                                 ldap_abandon_ext( lc->lc_ld, msgid, NULL, NULL );
 316                                 goto finish;
 317                         }
 318
 319                 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
 320                         char            **references = NULL;
 321
 322                         do_retry = 0;
 323                         rc = ldap_parse_reference( lc->lc_ld, res,
 324                                         &references, &rs->sr_ctrls, 1 );
 325
 326                         if ( rc != LDAP_SUCCESS ) {
 327                                 continue;
 328                         }
 329
 330                         /* FIXME: there MUST be at least one */
 331                         if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
 332                                 int             cnt;
 333
 334                                 for ( cnt = 0; references[ cnt ]; cnt++ )
 335                                         /* NO OP */ ;
 336
 337                                 /* FIXME: there MUST be at least one */
 338                                 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
 339
 340                                 for ( cnt = 0; references[ cnt ]; cnt++ ) {
 341                                         ber_str2bv( references[ cnt ], 0, 0, &rs->sr_ref[ cnt ] );
 342                                 }
 343                                 BER_BVZERO( &rs->sr_ref[ cnt ] );
 344
 345                                 /* ignore return value by now */
 346                                 ( void )send_search_reference( op, rs );
 347
 348                         } else {
 349                                 Debug( LDAP_DEBUG_ANY,
 350                                         "%s ldap_back_search: "
 351                                         "got SEARCH_REFERENCE "
 352                                         "with no referrals\n",
 353                                         op->o_log_prefix, 0, 0 );
 354                         }
 355
 356                         /* cleanup */
 357                         if ( references ) {
 358                                 ber_memvfree( (void **)references );
 359                                 ch_free( rs->sr_ref );
 360                                 rs->sr_ref = NULL;
 361                         }
 362
 363                         if ( rs->sr_ctrls ) {
 364                                 ldap_controls_free( rs->sr_ctrls );
 365                                 rs->sr_ctrls = NULL;
 366                         }
 367
 368                 } else {
 369                         char            **references = NULL;
 370
 371                         rc = ldap_parse_result( lc->lc_ld, res, &rs->sr_err,
 372                                         &match.bv_val, (char **)&rs->sr_text,
 373                                         &references, &rs->sr_ctrls, 1 );
 374                         freetext = 1;
 375                         if ( rc != LDAP_SUCCESS ) {
 376                                 rs->sr_err = rc;
 377                         }
 378                         rs->sr_err = slap_map_api2result( rs );
 379
 380                         if ( references && references[ 0 ] && references[ 0 ][ 0 ] ) {
 381                                 int     cnt;
 382
 383                                 if ( rs->sr_err != LDAP_REFERRAL ) {
 384                                         /* FIXME: error */
 385                                         Debug( LDAP_DEBUG_ANY,
 386                                                 "%s ldap_back_search: "
 387                                                 "got referrals with %d\n",
 388                                                 op->o_log_prefix,
 389                                                 rs->sr_err, 0 );
 390                                         rs->sr_err = LDAP_REFERRAL;
 391                                 }
 392
 393                                 for ( cnt = 0; references[ cnt ]; cnt++ )
 394                                         /* NO OP */ ;
 395
 396                                 rs->sr_ref = ch_malloc( ( cnt + 1 ) * sizeof( struct berval ) );
 397
 398                                 for ( cnt = 0; references[ cnt ]; cnt++ ) {
 399                                         /* duplicating ...*/
 400                                         ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
 401                                 }
 402                                 BER_BVZERO( &rs->sr_ref[ cnt ] );
 403                         }
 404
 405                         if ( match.bv_val != NULL ) {
 406                                 if ( match.bv_val[ 0 ] == '\0' ) {
 407                                         LDAP_FREE( match.bv_val );
 408                                         BER_BVZERO( &match );
 409                                 } else {
 410                                         match.bv_len = strlen( match.bv_val );
 411                                 }
 412                         }
 413
 414                         /* cleanup */
 415                         if ( references ) {
 416                                 ber_memvfree( (void **)references );
 417                         }
 418
 419                         rc = 0;
 420                         break;
 421                 }
 422         }
 423
 424         if ( rc == -1 ) {
 425                 if ( do_retry ) {
 426                         do_retry = 0;
 427                         if ( ldap_back_retry( &lc, op, rs, LDAP_BACK_SENDERR ) ) {
 428                                 goto retry;
 429                         }
 430                 }
 431                 rs->sr_err = LDAP_SERVER_DOWN;
 432                 rs->sr_err = slap_map_api2result( rs );
 433                 goto finish;
 434         }
 435
 436         /*
 437          * Rewrite the matched portion of the search base, if required
 438          */
 439         if ( !BER_BVISNULL( &match ) && !BER_BVISEMPTY( &match ) ) {
 440                 struct berval   pmatch;
 441
 442                 if ( dnPretty( NULL, &match, &pmatch, op->o_tmpmemctx ) == LDAP_SUCCESS ) {
 443                         rs->sr_matched = pmatch.bv_val;
 444                         LDAP_FREE( match.bv_val );
 445
 446                 } else {
 447                         rs->sr_matched = match.bv_val;
 448                 }
 449         }
 450
 451         if ( rs->sr_v2ref ) {
 452                 rs->sr_err = LDAP_REFERRAL;
 453         }
 454
 455 finish:;
 456         if ( rc != SLAPD_ABANDON ) {
 457                 send_ldap_result( op, rs );
 458         }
 459
 460         (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
 461
 462         if ( rs->sr_ctrls ) {
 463                 ldap_controls_free( rs->sr_ctrls );
 464                 rs->sr_ctrls = NULL;
 465         }
 466
 467         if ( rs->sr_matched != NULL && rs->sr_matched != save_matched ) {
 468                 if ( rs->sr_matched != match.bv_val ) {
 469                         ber_memfree_x( (char *)rs->sr_matched, op->o_tmpmemctx );
 470
 471                 } else {
 472                         LDAP_FREE( match.bv_val );
 473                 }
 474                 rs->sr_matched = save_matched;
 475         }
 476
 477         if ( !BER_BVISNULL( &filter ) && filter.bv_val != op->ors_filterstr.bv_val ) {
 478                 op->o_tmpfree( filter.bv_val, op->o_tmpmemctx );
 479         }
 480
 481         if ( rs->sr_text ) {
 482                 if ( freetext ) {
 483                         LDAP_FREE( (char *)rs->sr_text );
 484                 }
 485                 rs->sr_text = NULL;
 486         }
 487
 488         if ( rs->sr_ref ) {
 489                 ber_bvarray_free( rs->sr_ref );
 490                 rs->sr_ref = NULL;
 491         }
 492
 493         if ( attrs ) {
 494                 ch_free( attrs );
 495         }
 496
 497         if ( lc != NULL ) {
 498                 ldap_back_release_conn( op, rs, lc );
 499         }
 500
 501         return rs->sr_err;
 502 }
 503
 504 static int
 505 ldap_build_entry(
 506                 Operation       *op,
 507                 LDAPMessage     *e,
 508                 Entry           *ent,
 509                 struct berval   *bdn )
 510 {
 511         struct berval   a;
 512         BerElement      ber = *e->lm_ber;
 513         Attribute       *attr, **attrp;
 514         const char      *text;
 515         int             last;
 516
 517         /* safe assumptions ... */
 518         assert( ent != NULL );
 519         BER_BVZERO( &ent->e_bv );
 520
 521         if ( ber_scanf( &ber, "{m{", bdn ) == LBER_ERROR ) {
 522                 return LDAP_DECODING_ERROR;
 523         }
 524
 525         /*
 526          * Note: this may fail if the target host(s) schema differs
 527          * from the one known to the meta, and a DN with unknown
 528          * attributes is returned.
 529          *
 530          * FIXME: should we log anything, or delegate to dnNormalize?
 531          */
 532         /* Note: if the distinguished values or the naming attributes
 533          * change, should we massage them as well?
 534          */
 535         if ( dnPrettyNormal( NULL, bdn, &ent->e_name, &ent->e_nname,
 536                 op->o_tmpmemctx ) != LDAP_SUCCESS )
 537         {
 538                 return LDAP_INVALID_DN_SYNTAX;
 539         }
 540
 541         attrp = &ent->e_attrs;
 542
 543         while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
 544                 int                             i;
 545                 slap_syntax_validate_func       *validate;
 546                 slap_syntax_transform_func      *pretty;
 547
 548                 attr = (Attribute *)ch_malloc( sizeof( Attribute ) );
 549                 if ( attr == NULL ) {
 550                         continue;
 551                 }
 552                 attr->a_flags = 0;
 553                 attr->a_next = 0;
 554                 attr->a_desc = NULL;
 555                 if ( slap_bv2ad( &a, &attr->a_desc, &text )
 556                                 != LDAP_SUCCESS )
 557                 {
 558                         if ( slap_bv2undef_ad( &a, &attr->a_desc, &text,
 559                                 SLAP_AD_PROXIED ) != LDAP_SUCCESS )
 560                         {
 561                                 Debug( LDAP_DEBUG_ANY,
 562                                         "%s ldap_build_entry: "
 563                                         "slap_bv2undef_ad(%s): %s\n",
 564                                         op->o_log_prefix, a.bv_val, text );
 565                                 ch_free( attr );
 566                                 continue;
 567                         }
 568                 }
 569
 570                 /* no subschemaSubentry */
 571                 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry
 572                         || attr->a_desc == slap_schema.si_ad_entryDN )
 573                 {
 574
 575                         /*
 576                          * We eat target's subschemaSubentry because
 577                          * a search for this value is likely not
 578                          * to resolve to the appropriate backend;
 579                          * later, the local subschemaSubentry is
 580                          * added.
 581                          *
 582                          * We also eat entryDN because the frontend
 583                          * will reattach it without checking if already
 584                          * present...
 585                          */
 586                         ( void )ber_scanf( &ber, "x" /* [W] */ );
 587
 588                         ch_free( attr );
 589                         continue;
 590                 }
 591
 592                 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
 593                                 || attr->a_vals == NULL )
 594                 {
 595                         /*
 596                          * Note: attr->a_vals can be null when using
 597                          * values result filter
 598                          */
 599                         attr->a_vals = (struct berval *)&slap_dummy_bv;
 600                         last = 0;
 601
 602                 } else {
 603                         for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); last++ )
 604                                 /* just count vals */ ;
 605                 }
 606
 607                 validate = attr->a_desc->ad_type->sat_syntax->ssyn_validate;
 608                 pretty = attr->a_desc->ad_type->sat_syntax->ssyn_pretty;
 609
 610                 if ( !validate && !pretty ) {
 611                         attr->a_nvals = NULL;
 612                         attr_free( attr );
 613                         goto next_attr;
 614                 }
 615
 616                 for ( i = 0; i < last; i++ ) {
 617                         struct berval   pval;
 618                         int             rc;
 619
 620                         if ( pretty ) {
 621                                 rc = pretty( attr->a_desc->ad_type->sat_syntax,
 622                                         &attr->a_vals[i], &pval, NULL );
 623
 624                         } else {
 625                                 rc = validate( attr->a_desc->ad_type->sat_syntax,
 626                                         &attr->a_vals[i] );
 627                         }
 628
 629                         if ( rc != LDAP_SUCCESS ) {
 630                                 /* check if, by chance, it's an undefined objectClass */
 631                                 if ( attr->a_desc == slap_schema.si_ad_objectClass &&
 632                                                 oc_bvfind_undef( &attr->a_vals[i] ) != NULL )
 633                                 {
 634                                         ber_dupbv( &pval, &attr->a_vals[i] );
 635
 636                                 } else {
 637                                         attr->a_nvals = NULL;
 638                                         attr_free( attr );
 639                                         goto next_attr;
 640                                 }
 641                         }
 642
 643                         if ( pretty ) {
 644                                 LBER_FREE( attr->a_vals[i].bv_val );
 645                                 attr->a_vals[i] = pval;
 646                         }
 647                 }
 648
 649                 if ( last && attr->a_desc->ad_type->sat_equality &&
 650                                 attr->a_desc->ad_type->sat_equality->smr_normalize )
 651                 {
 652                         attr->a_nvals = ch_malloc( ( last + 1 )*sizeof( struct berval ) );
 653                         for ( i = 0; i < last; i++ ) {
 654                                 int             rc;
 655
 656                                 /*
 657                                  * check that each value is valid per syntax
 658                                  * and pretty if appropriate
 659                                  */
 660                                 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
 661                                         SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
 662                                         attr->a_desc->ad_type->sat_syntax,
 663                                         attr->a_desc->ad_type->sat_equality,
 664                                         &attr->a_vals[i], &attr->a_nvals[i],
 665                                         NULL );
 666
 667                                 if ( rc != LDAP_SUCCESS ) {
 668                                         BER_BVZERO( &attr->a_nvals[i] );
 669                                         ch_free( attr );
 670                                         goto next_attr;
 671                                 }
 672                         }
 673                         BER_BVZERO( &attr->a_nvals[i] );
 674
 675                 } else {
 676                         attr->a_nvals = attr->a_vals;
 677                 }
 678                 *attrp = attr;
 679                 attrp = &attr->a_next;
 680
 681 next_attr:;
 682         }
 683
 684         return LDAP_SUCCESS;
 685 }
 686
 687 /* return 0 IFF we can retrieve the entry with ndn
 688  */
 689 int
 690 ldap_back_entry_get(
 691                 Operation               *op,
 692                 struct berval           *ndn,
 693                 ObjectClass             *oc,
 694                 AttributeDescription    *at,
 695                 int                     rw,
 696                 Entry                   **ent
 697 )
 698 {
 699         ldapconn_t      *lc;
 700         int             rc = 1,
 701                         do_not_cache;
 702         struct berval   bdn;
 703         LDAPMessage     *result = NULL,
 704                         *e = NULL;
 705         char            *gattr[3];
 706         char            *filter = NULL;
 707         SlapReply       rs;
 708         int             do_retry = 1;
 709         LDAPControl     **ctrls = NULL;
 710
 711         /* Tell getconn this is a privileged op */
 712         do_not_cache = op->o_do_not_cache;
 713         op->o_do_not_cache = 1;
 714         lc = ldap_back_getconn( op, &rs, LDAP_BACK_DONTSEND );
 715         if ( !lc || !ldap_back_dobind( lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
 716                 op->o_do_not_cache = do_not_cache;
 717                 return rs.sr_err;
 718         }
 719         op->o_do_not_cache = do_not_cache;
 720
 721         if ( at ) {
 722                 if ( oc && at != slap_schema.si_ad_objectClass ) {
 723                         gattr[0] = slap_schema.si_ad_objectClass->ad_cname.bv_val;
 724                         gattr[1] = at->ad_cname.bv_val;
 725                         gattr[2] = NULL;
 726
 727                 } else {
 728                         gattr[0] = at->ad_cname.bv_val;
 729                         gattr[1] = NULL;
 730                 }
 731         }
 732
 733         if ( oc ) {
 734                 char    *ptr;
 735
 736                 filter = ch_malloc( STRLENOF( "(objectclass=)" )
 737                                 + oc->soc_cname.bv_len + 1 );
 738                 ptr = lutil_strcopy( filter, "(objectclass=" );
 739                 ptr = lutil_strcopy( ptr, oc->soc_cname.bv_val );
 740                 *ptr++ = ')';
 741                 *ptr++ = '\0';
 742         }
 743
 744         ctrls = op->o_ctrls;
 745         rc = ldap_back_proxy_authz_ctrl( lc, op, &rs, &ctrls );
 746         if ( rc != LDAP_SUCCESS ) {
 747                 goto cleanup;
 748         }
 749
 750 retry:
 751         rc = ldap_search_ext_s( lc->lc_ld, ndn->bv_val, LDAP_SCOPE_BASE, filter,
 752                                 at ? gattr : NULL, 0, ctrls, NULL,
 753                                 LDAP_NO_LIMIT, LDAP_NO_LIMIT, &result );
 754         if ( rc != LDAP_SUCCESS ) {
 755                 if ( rc == LDAP_SERVER_DOWN && do_retry ) {
 756                         do_retry = 0;
 757                         if ( ldap_back_retry( &lc, op, &rs, LDAP_BACK_DONTSEND ) ) {
 758                                 goto retry;
 759                         }
 760                 }
 761                 goto cleanup;
 762         }
 763
 764         e = ldap_first_entry( lc->lc_ld, result );
 765         if ( e == NULL ) {
 766                 goto cleanup;
 767         }
 768
 769         *ent = ch_calloc( 1, sizeof( Entry ) );
 770
 771         rc = ldap_build_entry( op, e, *ent, &bdn );
 772
 773         if ( rc != LDAP_SUCCESS ) {
 774                 ch_free( *ent );
 775                 *ent = NULL;
 776         }
 777
 778 cleanup:
 779         (void)ldap_back_proxy_authz_ctrl_free( op, &ctrls );
 780
 781         if ( result ) {
 782                 ldap_msgfree( result );
 783         }
 784
 785         if ( filter ) {
 786                 ch_free( filter );
 787         }
 788
 789         if ( lc != NULL ) {
 790                 ldap_back_release_conn( op, &rs, lc );
 791         }
 792
 793         return rc;
 794 }
 795