2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2005 The OpenLDAP Foundation.
5 * Portions Copyright 2001-2003 Pierangelo Masarati.
6 * Portions Copyright 1999-2003 Howard Chu.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted only as authorized by the OpenLDAP
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>.
18 * This work was initially developed by the Howard Chu for inclusion
19 * in OpenLDAP Software and subsequently enhanced by Pierangelo
27 #include <ac/socket.h>
28 #include <ac/string.h>
32 #include "../back-ldap/back-ldap.h"
33 #include "back-meta.h"
34 #undef ldap_debug /* silence a warning in ldap-int.h */
36 #include "../../../libraries/libldap/ldap-int.h"
47 meta_back_search_start(
51 metasingleconn_t *msc,
56 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
57 struct berval realbase = op->o_req_dn;
58 int realscope = op->ors_scope;
59 ber_len_t suffixlen = 0;
60 struct berval mbase = BER_BVNULL;
61 struct berval mfilter = BER_BVNULL;
62 char **mapped_attrs = NULL;
65 /* should we check return values? */
66 if ( op->ors_deref != -1 ) {
67 ldap_set_option( msc->msc_ld, LDAP_OPT_DEREF,
68 ( void * )&op->ors_deref);
70 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
71 ldap_set_option( msc->msc_ld, LDAP_OPT_TIMELIMIT,
72 ( void * )&op->ors_tlimit);
74 if ( op->ors_slimit != SLAP_NO_LIMIT ) {
75 ldap_set_option( msc->msc_ld, LDAP_OPT_SIZELIMIT,
76 ( void * )&op->ors_slimit);
79 dc->target = &mi->mi_targets[ candidate ];
82 * modifies the base according to the scope, if required
84 suffixlen = mi->mi_targets[ candidate ].mt_nsuffix.bv_len;
85 if ( suffixlen > op->o_req_ndn.bv_len ) {
86 switch ( op->ors_scope ) {
87 case LDAP_SCOPE_SUBTREE:
89 * make the target suffix the new base
90 * FIXME: this is very forgiving, because
91 * "illegal" searchBases may be turned
92 * into the suffix of the target; however,
93 * the requested searchBase already passed
94 * thru the candidate analyzer...
96 if ( dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix,
99 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
103 * this target is no longer candidate
109 #ifdef LDAP_SCOPE_SUBORDINATE
110 case LDAP_SCOPE_SUBORDINATE:
111 #endif /* LDAP_SCOPE_SUBORDINATE */
112 case LDAP_SCOPE_ONELEVEL:
114 struct berval rdn = mi->mi_targets[ candidate ].mt_nsuffix;
115 rdn.bv_len -= op->o_req_ndn.bv_len + STRLENOF( "," );
116 if ( dnIsOneLevelRDN( &rdn )
117 && dnIsSuffix( &mi->mi_targets[ candidate ].mt_nsuffix, &op->o_req_ndn ) )
120 * if there is exactly one level,
121 * make the target suffix the new
122 * base, and make scope "base"
124 realbase = mi->mi_targets[ candidate ].mt_nsuffix;
125 #ifdef LDAP_SCOPE_SUBORDINATE
126 if ( op->ors_scope == LDAP_SCOPE_SUBORDINATE ) {
127 realscope = LDAP_SCOPE_SUBTREE;
129 #endif /* LDAP_SCOPE_SUBORDINATE */
131 realscope = LDAP_SCOPE_BASE;
134 } /* else continue with the next case */
137 case LDAP_SCOPE_BASE:
139 * this target is no longer candidate
146 * Rewrite the search base, if required
148 dc->ctx = "searchBase";
149 switch ( ldap_back_dn_massage( dc, &realbase, &mbase ) ) {
153 case REWRITE_REGEXEC_UNWILLING:
154 rs->sr_err = LDAP_UNWILLING_TO_PERFORM;
155 rs->sr_text = "Operation not allowed";
156 send_ldap_result( op, rs );
159 case REWRITE_REGEXEC_ERR:
162 * this target is no longer candidate
170 rc = ldap_back_filter_map_rewrite( dc, op->ors_filter,
171 &mfilter, BACKLDAP_MAP );
176 case LDAP_COMPARE_FALSE:
179 * this target is no longer candidate
186 * Maps required attributes
188 rc = ldap_back_map_attrs( &mi->mi_targets[ candidate ].mt_rwmap.rwm_at,
189 op->ors_attrs, BACKLDAP_MAP, &mapped_attrs );
190 if ( rc != LDAP_SUCCESS ) {
192 * this target is no longer candidate
201 rc = ldap_search_ext( msc->msc_ld,
202 mbase.bv_val, realscope, mfilter.bv_val,
203 mapped_attrs, op->ors_attrsonly,
204 op->o_ctrls, NULL, NULL, op->ors_slimit,
205 &candidates[ candidate ].sr_msgid );
206 if ( rc == LDAP_SUCCESS ) {
210 candidates[ candidate ].sr_msgid = -1;
215 if ( mapped_attrs ) {
216 free( mapped_attrs );
218 if ( mfilter.bv_val != op->ors_filterstr.bv_val ) {
219 free( mfilter.bv_val );
221 if ( mbase.bv_val != realbase.bv_val ) {
222 free( mbase.bv_val );
229 meta_back_search( Operation *op, SlapReply *rs )
231 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
233 struct timeval tv = { 0, 0 };
235 LDAPMessage *res = NULL, *e;
236 int rc = 0, sres = LDAP_SUCCESS;
237 char *matched = NULL;
238 int i, last = 0, ncandidates = 0,
239 initial_candidates = 0, candidate_match = 0;
243 SlapReply *candidates = meta_back_candidates_get( op );
246 * controls are set in ldap_back_dobind()
248 * FIXME: in case of values return filter, we might want
249 * to map attrs and maybe rewrite value
251 mc = meta_back_getconn( op, rs, NULL, LDAP_BACK_SENDERR );
252 if ( !mc || !meta_back_dobind( op, rs, mc, LDAP_BACK_SENDERR ) ) {
256 dc.conn = op->o_conn;
262 for ( i = 0; i < mi->mi_ntargets; i++ ) {
263 metasingleconn_t *msc = &mc->mc_conns[ i ];
265 candidates[ i ].sr_msgid = -1;
267 if ( candidates[ i ].sr_tag != META_CANDIDATE ) {
270 candidates[ i ].sr_err = LDAP_SUCCESS;
271 candidates[ i ].sr_matched = NULL;
272 candidates[ i ].sr_text = NULL;
273 candidates[ i ].sr_ref = NULL;
274 candidates[ i ].sr_ctrls = NULL;
276 switch ( meta_back_search_start( op, rs, &dc, msc, i, candidates ) )
291 initial_candidates = ncandidates;
298 for ( i = 0; i < mi->mi_ntargets; i++ ) {
299 if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
307 Debug( LDAP_DEBUG_ANY, "%s meta_back_search: ncandidates=%d "
308 "cnd=\"%s\"\n", op->o_log_prefix, ncandidates, cnd );
312 if ( initial_candidates == 0 ) {
313 send_ldap_error( op, rs, LDAP_NO_SUCH_OBJECT, NULL );
314 /* FIXME: find a way to look up the best match */
316 rc = LDAP_NO_SUCH_OBJECT;
320 /* We pull apart the ber result, stuff it into a slapd entry, and
321 * let send_search_entry stuff it back into ber format. Slow & ugly,
322 * but this is necessary for version matching, and for ACL processing.
325 if ( op->ors_tlimit != SLAP_NO_LIMIT ) {
326 stoptime = op->o_time + op->ors_tlimit;
331 * In case there are no candidates, no cycle takes place...
333 * FIXME: we might use a queue, to better balance the load
334 * among the candidates
336 for ( rc = 0; ncandidates > 0; ) {
337 int gotit = 0, doabandon = 0;
339 for ( i = 0; i < mi->mi_ntargets; i++ ) {
340 metasingleconn_t *msc = &mc->mc_conns[ i ];
342 if ( candidates[ i ].sr_msgid == -1 ) {
346 /* check for abandon */
347 if ( op->o_abandon ) {
352 * FIXME: handle time limit as well?
353 * Note that target servers are likely
354 * to handle it, so at some time we'll
355 * get a LDAP_TIMELIMIT_EXCEEDED from
358 rc = ldap_result( msc->msc_ld, candidates[ i ].sr_msgid,
362 /* timeout exceeded */
364 /* FIXME: res should not need to be freed */
365 assert( res == NULL );
367 /* check time limit */
368 if ( op->ors_tlimit != SLAP_NO_LIMIT
369 && slap_get_time() > stoptime )
372 rc = rs->sr_err = LDAP_TIMELIMIT_EXCEEDED;
373 savepriv = op->o_private;
374 op->o_private = (void *)i;
375 send_ldap_result( op, rs );
376 op->o_private = savepriv;
382 } else if ( rc == -1 ) {
384 /* something REALLY bad happened! */
385 ( void )meta_clear_unused_candidates( op, -1 );
386 rs->sr_err = LDAP_OTHER;
387 savepriv = op->o_private;
388 op->o_private = (void *)i;
389 send_ldap_result( op, rs );
390 op->o_private = savepriv;
392 /* anything else needs be done? */
394 /* FIXME: res should not need to be freed */
395 assert( res == NULL );
399 } else if ( rc == LDAP_RES_SEARCH_ENTRY ) {
400 if ( --op->ors_slimit == -1 ) {
404 rs->sr_err = LDAP_SIZELIMIT_EXCEEDED;
405 savepriv = op->o_private;
406 op->o_private = (void *)i;
407 send_ldap_result( op, rs );
408 op->o_private = savepriv;
414 e = ldap_first_entry( msc->msc_ld, res );
415 savepriv = op->o_private;
416 op->o_private = (void *)i;
417 meta_send_entry( op, rs, mc, i, e );
418 op->o_private = savepriv;
427 * If scope is BASE, we need to jump out
428 * as soon as one entry is found; if
429 * the target pool is properly crafted,
430 * this should correspond to the sole
431 * entry that has the base DN
433 /* FIXME: this defeats the purpose of
434 * doing a search with scope == base and
435 * sizelimit = 1 to determine if a
436 * candidate is actually unique */
437 if ( op->ors_scope == LDAP_SCOPE_BASE
438 && rs->sr_nentries > 0 )
447 } else if ( rc == LDAP_RES_SEARCH_REFERENCE ) {
448 char **references = NULL;
453 rc = ldap_parse_reference( msc->msc_ld, res,
454 &references, &rs->sr_ctrls, 1 );
457 if ( rc != LDAP_SUCCESS ) {
461 if ( references == NULL ) {
465 #ifdef ENABLE_REWRITE
466 dc.ctx = "referralDN";
467 #else /* ! ENABLE_REWRITE */
470 #endif /* ! ENABLE_REWRITE */
472 /* FIXME: merge all and return at the end */
474 for ( cnt = 0; references[ cnt ]; cnt++ )
477 rs->sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
479 for ( cnt = 0; references[ cnt ]; cnt++ ) {
480 ber_str2bv( references[ cnt ], 0, 1, &rs->sr_ref[ cnt ] );
482 BER_BVZERO( &rs->sr_ref[ cnt ] );
484 ( void )ldap_back_referral_result_rewrite( &dc, rs->sr_ref );
486 if ( rs->sr_ref != NULL && !BER_BVISNULL( &rs->sr_ref[ 0 ] ) ) {
487 /* ignore return value by now */
488 savepriv = op->o_private;
489 op->o_private = (void *)i;
490 ( void )send_search_reference( op, rs );
491 op->o_private = savepriv;
493 ber_bvarray_free( rs->sr_ref );
499 ldap_value_free( references );
502 if ( rs->sr_ctrls ) {
503 ldap_controls_free( rs->sr_ctrls );
507 } else if ( rc == LDAP_RES_SEARCH_RESULT ) {
508 char buf[ SLAP_TEXT_BUFLEN ];
509 char **references = NULL;
511 if ( ldap_parse_result( msc->msc_ld,
513 &candidates[ i ].sr_err,
514 (char **)&candidates[ i ].sr_matched,
515 NULL /* (char **)&candidates[ i ].sr_text */ ,
517 &candidates[ i ].sr_ctrls, 1 ) )
520 ldap_get_option( msc->msc_ld,
521 LDAP_OPT_ERROR_NUMBER,
523 sres = slap_map_api2result( rs );
526 rs->sr_err = candidates[ i ].sr_err;
527 sres = slap_map_api2result( rs );
530 /* massage matchedDN if need be */
531 if ( candidates[ i ].sr_matched != NULL ) {
532 if ( candidates[ i ].sr_matched[ 0 ] == '\0' ) {
533 ldap_memfree( (char *)candidates[ i ].sr_matched );
534 candidates[ i ].sr_matched = NULL;
537 struct berval match, mmatch;
539 ber_str2bv( candidates[ i ].sr_matched,
542 dc.ctx = "matchedDN";
543 dc.target = &mi->mi_targets[ i ];
545 if ( !ldap_back_dn_massage( &dc, &match, &mmatch ) ) {
546 if ( mmatch.bv_val == match.bv_val ) {
547 candidates[ i ].sr_matched = ch_strdup( mmatch.bv_val );
550 candidates[ i ].sr_matched = mmatch.bv_val;
555 ldap_memfree( match.bv_val );
559 /* just get rid of the error message, if any */
560 if ( candidates[ i ].sr_text && candidates[ i ].sr_text[ 0 ] == '\0' )
562 ldap_memfree( (char *)candidates[ i ].sr_text );
563 candidates[ i ].sr_text = NULL;
566 /* add references to array */
571 for ( cnt = 0; references[ cnt ]; cnt++ )
574 sr_ref = ch_calloc( sizeof( struct berval ), cnt + 1 );
576 for ( cnt = 0; references[ cnt ]; cnt++ ) {
577 ber_str2bv( references[ cnt ], 0, 1, &sr_ref[ cnt ] );
579 BER_BVZERO( &sr_ref[ cnt ] );
581 ( void )ldap_back_referral_result_rewrite( &dc, sr_ref );
584 ldap_value_free( references );
586 if ( rs->sr_v2ref == NULL ) {
587 rs->sr_v2ref = sr_ref;
590 for ( cnt = 0; !BER_BVISNULL( &sr_ref[ cnt ] ); cnt++ ) {
591 ber_bvarray_add( &rs->sr_v2ref, &sr_ref[ cnt ] );
593 ber_memfree( sr_ref );
597 rs->sr_err = candidates[ i ].sr_err;
598 sres = slap_map_api2result( rs );
600 case LDAP_NO_SUCH_OBJECT:
601 /* is_ok is touched any time a valid
602 * (even intermediate) result is
603 * returned; as a consequence, if
604 * a candidate returns noSuchObject
605 * it is ignored and the candidate
606 * is simply demoted. */
618 snprintf( buf, sizeof( buf ),
619 "%s meta_back_search[%d] "
620 "match=\"%s\" err=%d\n",
622 candidates[ i ].sr_matched ? candidates[ i ].sr_matched : "",
623 candidates[ i ].sr_err );
624 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
630 * When no candidates are left,
631 * the outer cycle finishes
633 candidates[ i ].sr_msgid = -1;
642 /* check for abandon */
643 if ( op->o_abandon || doabandon ) {
644 for ( i = 0; i < mi->mi_ntargets; i++ ) {
645 metasingleconn_t *msc = &mc->mc_conns[ i ];
647 if ( candidates[ i ].sr_msgid != -1 ) {
648 ldap_abandon_ext( msc->msc_ld,
649 candidates[ i ].sr_msgid,
651 candidates[ i ].sr_msgid = -1;
655 if ( op->o_abandon ) {
663 tv.tv_usec = 100000; /* 0.1 s */
664 ldap_pvt_thread_yield();
674 * FIXME: need a better strategy to handle errors
676 rc = meta_back_op_result( mc, op, rs, META_TARGET_NONE );
681 * Rewrite the matched portion of the search base, if required
683 * FIXME: only the last one gets caught!
685 if ( candidate_match > 0 && rs->sr_nentries > 0 ) {
686 /* we use the first one */
687 for ( i = 0; i < mi->mi_ntargets; i++ ) {
688 if ( candidates[ i ].sr_tag == META_CANDIDATE
689 && candidates[ i ].sr_matched )
691 matched = (char *)candidates[ i ].sr_matched;
692 candidates[ i ].sr_matched = NULL;
704 for ( i = 0; i < mi->mi_ntargets; i++ ) {
705 if ( candidates[ i ].sr_tag == META_CANDIDATE ) {
713 snprintf( buf, sizeof( buf ), "%s meta_back_search: is_scope=%d is_ok=%d cnd=\"%s\"\n",
714 op->o_log_prefix, initial_candidates, is_ok, cnd );
716 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
721 * In case we returned at least one entry, we return LDAP_SUCCESS
722 * otherwise, the latter error code we got
724 * FIXME: we should handle error codes and return the more
725 * important/reasonable
728 if ( sres == LDAP_SUCCESS && rs->sr_v2ref ) {
729 sres = LDAP_REFERRAL;
732 rs->sr_matched = matched;
733 rs->sr_ref = ( sres == LDAP_REFERRAL ? rs->sr_v2ref : NULL );
734 savepriv = op->o_private;
735 op->o_private = (void *)mi->mi_ntargets;
736 send_ldap_result( op, rs );
737 op->o_private = savepriv;
738 rs->sr_matched = NULL;
746 if ( rs->sr_v2ref ) {
747 ber_bvarray_free( rs->sr_v2ref );
750 for ( i = 0; i < mi->mi_ntargets; i++ ) {
751 if ( candidates[ i ].sr_tag != META_CANDIDATE ) {
755 if ( candidates[ i ].sr_matched ) {
756 free( (char *)candidates[ i ].sr_matched );
757 candidates[ i ].sr_matched = NULL;
760 if ( candidates[ i ].sr_text ) {
761 ldap_memfree( (char *)candidates[ i ].sr_text );
762 candidates[ i ].sr_text = NULL;
765 if ( candidates[ i ].sr_ref ) {
766 ber_bvarray_free( candidates[ i ].sr_ref );
767 candidates[ i ].sr_ref = NULL;
770 if ( candidates[ i ].sr_ctrls ) {
771 ldap_controls_free( candidates[ i ].sr_ctrls );
772 candidates[ i ].sr_ctrls = NULL;
787 metainfo_t *mi = ( metainfo_t * )op->o_bd->be_private;
788 struct berval a, mapped;
790 BerElement ber = *e->lm_ber;
791 Attribute *attr, **attrp;
792 struct berval *bv, bdn;
796 if ( ber_scanf( &ber, "{m{", &bdn ) == LBER_ERROR ) {
797 return LDAP_DECODING_ERROR;
801 * Rewrite the dn of the result, if needed
803 dc.target = &mi->mi_targets[ target ];
804 dc.conn = op->o_conn;
806 dc.ctx = "searchResult";
808 rs->sr_err = ldap_back_dn_massage( &dc, &bdn, &ent.e_name );
809 if ( rs->sr_err != LDAP_SUCCESS) {
814 * Note: this may fail if the target host(s) schema differs
815 * from the one known to the meta, and a DN with unknown
816 * attributes is returned.
818 * FIXME: should we log anything, or delegate to dnNormalize?
820 if ( dnNormalize( 0, NULL, NULL, &ent.e_name, &ent.e_nname,
821 op->o_tmpmemctx ) != LDAP_SUCCESS )
823 return LDAP_INVALID_DN_SYNTAX;
829 if ( mi->mi_cache.ttl != META_DNCACHE_DISABLED ) {
830 ( void )meta_dncache_update_entry( &mi->mi_cache,
831 &ent.e_nname, target );
834 attrp = &ent.e_attrs;
836 dc.ctx = "searchAttrDN";
837 while ( ber_scanf( &ber, "{m", &a ) != LBER_ERROR ) {
840 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_at,
841 &a, &mapped, BACKLDAP_REMAP );
842 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0' ) {
845 attr = ( Attribute * )ch_malloc( sizeof( Attribute ) );
846 if ( attr == NULL ) {
852 if ( slap_bv2ad( &mapped, &attr->a_desc, &text )
854 if ( slap_bv2undef_ad( &mapped, &attr->a_desc, &text )
857 char buf[ SLAP_TEXT_BUFLEN ];
859 snprintf( buf, sizeof( buf ),
860 "%s meta_send_entry(\"%s\"): "
861 "slap_bv2undef_ad(%s): %s\n",
862 op->o_log_prefix, ent.e_name.bv_val,
863 mapped.bv_val, text );
865 Debug( LDAP_DEBUG_ANY, "%s", buf, 0, 0 );
871 /* no subschemaSubentry */
872 if ( attr->a_desc == slap_schema.si_ad_subschemaSubentry ) {
875 * We eat target's subschemaSubentry because
876 * a search for this value is likely not
877 * to resolve to the appropriate backend;
878 * later, the local subschemaSubentry is
881 ( void )ber_scanf( &ber, "x" /* [W] */ );
887 if ( ber_scanf( &ber, "[W]", &attr->a_vals ) == LBER_ERROR
888 || attr->a_vals == NULL )
890 attr->a_vals = (struct berval *)&slap_dummy_bv;
892 } else if ( attr->a_desc == slap_schema.si_ad_objectClass
893 || attr->a_desc == slap_schema.si_ad_structuralObjectClass )
895 for ( last = 0; !BER_BVISNULL( &attr->a_vals[ last ] ); ++last );
897 for ( bv = attr->a_vals; !BER_BVISNULL( bv ); bv++ ) {
898 ldap_back_map( &mi->mi_targets[ target ].mt_rwmap.rwm_oc,
899 bv, &mapped, BACKLDAP_REMAP );
900 if ( BER_BVISNULL( &mapped ) || mapped.bv_val[0] == '\0') {
906 *bv = attr->a_vals[ last ];
907 BER_BVZERO( &attr->a_vals[ last ] );
910 } else if ( mapped.bv_val != bv->bv_val ) {
912 ber_dupbv( bv, &mapped );
916 * It is necessary to try to rewrite attributes with
917 * dn syntax because they might be used in ACLs as
918 * members of groups; since ACLs are applied to the
919 * rewritten stuff, no dn-based subecj clause could
920 * be used at the ldap backend side (see
921 * http://www.OpenLDAP.org/faq/data/cache/452.html)
922 * The problem can be overcome by moving the dn-based
923 * ACLs to the target directory server, and letting
924 * everything pass thru the ldap backend.
926 } else if ( attr->a_desc->ad_type->sat_syntax ==
927 slap_schema.si_syn_distinguishedName )
929 ldap_dnattr_result_rewrite( &dc, attr->a_vals );
931 } else if ( attr->a_desc == slap_schema.si_ad_ref ) {
932 ldap_back_referral_result_rewrite( &dc, attr->a_vals );
935 if ( last && attr->a_desc->ad_type->sat_equality &&
936 attr->a_desc->ad_type->sat_equality->smr_normalize ) {
939 attr->a_nvals = ch_malloc( ( last + 1 ) * sizeof( struct berval ) );
940 for ( i = 0; i<last; i++ ) {
941 attr->a_desc->ad_type->sat_equality->smr_normalize(
942 SLAP_MR_VALUE_OF_ATTRIBUTE_SYNTAX,
943 attr->a_desc->ad_type->sat_syntax,
944 attr->a_desc->ad_type->sat_equality,
945 &attr->a_vals[i], &attr->a_nvals[i],
948 BER_BVZERO( &attr->a_nvals[i] );
951 attr->a_nvals = attr->a_vals;
955 attrp = &attr->a_next;
958 rs->sr_attrs = op->ors_attrs;
960 send_search_entry( op, rs );
964 if ( !BER_BVISNULL( &ent.e_name ) ) {
965 if ( ent.e_name.bv_val != bdn.bv_val ) {
966 free( ent.e_name.bv_val );
968 BER_BVZERO( &ent.e_name );
970 if ( !BER_BVISNULL( &ent.e_nname ) ) {
971 free( ent.e_nname.bv_val );
972 BER_BVZERO( &ent.e_nname );