struct berval *res );
static int dnlist_subordinate(
- BVarray dnlist,
+ BerVarray dnlist,
struct berval *dn );
Entry *deref_internal_r(
Entry *entry;
Entry *sup;
unsigned depth;
- BVarray dnlist;
+ BerVarray dnlist;
assert( ( alias != NULL && dn_in == NULL )
|| ( alias == NULL && dn_in != NULL ) );
}
dnlist = NULL;
- bvarray_add( &dnlist, &dn );
+ ber_bvarray_add( &dnlist, &dn );
for( depth=0 ; ; depth++ ) {
if( entry != NULL ) {
cache_return_entry_r(&li->li_cache, entry );
entry = newe;
ber_dupbv( &dn, &entry->e_nname );
- bvarray_add( &dnlist, &dn );
+ ber_bvarray_add( &dnlist, &dn );
continue;
}
cache_return_entry_r(&li->li_cache, sup );
entry = newe;
ber_dupbv( &dn, &entry->e_nname );
- bvarray_add( &dnlist, &dn );
+ ber_bvarray_add( &dnlist, &dn );
continue;
}
}
free( dn.bv_val );
- bvarray_free( dnlist );
+ ber_bvarray_free( dnlist );
return entry;
}
}
static int dnlist_subordinate(
- BVarray dnlist,
+ BerVarray dnlist,
struct berval *dn )
{
assert( dnlist );