const char *text;
DB *db;
struct berval *keys;
- void *mark;
assert( mask );
return LDAP_OTHER;
}
-#if 0 /* No longer needed, our frees are in order so nothing accumulates */
- mark = sl_mark(op->o_tmpmemctx);
-#endif
-
if( IS_SLAP_INDEX( mask, SLAP_INDEX_PRESENT ) ) {
rc = bdb_key_change( op->o_bd, db, txn, &presence_key, id, opid );
if( rc ) {
}
done:
-#if 0
- sl_release( mark, op->o_tmpmemctx );
-#endif
return rc;
}
{
int rc, i;
const char *text;
- DBCache *db;
+ DBCache *db;
AttributeDescription *ad = NULL;
struct berval *keys;
- void *mark;
assert( mask );
return LDAP_OTHER;
}
- mark = sl_mark( op->o_tmpmemctx );
-
if( IS_SLAP_INDEX( mask, SLAP_INDEX_PRESENT ) ) {
key_change( op->o_bd, db, atname, id, opid );
}
ldbm_cache_close( op->o_bd, db );
- sl_release( mark, op->o_tmpmemctx );
-
return LDAP_SUCCESS;
}
LDAP_SLAPD_F (void *) sl_mem_create LDAP_P(( ber_len_t size, void *ctx ));
LDAP_SLAPD_F (void) sl_mem_detach LDAP_P(( void *ctx, void *memctx ));
LDAP_SLAPD_F (void) sl_mem_destroy LDAP_P(( void *key, void *data ));
-LDAP_SLAPD_F (void *) sl_mark LDAP_P(( void *ctx ));
-LDAP_SLAPD_F (void) sl_release LDAP_P(( void *, void *ctx ));
LDAP_SLAPD_F (void *) sl_context LDAP_P(( void *ptr ));
/*
}
}
-void
-sl_release( void *ptr, void *ctx )
-{
- struct slab_heap *sh = ctx;
-
- if ( sh && ptr >= sh->h_base && ptr <= sh->h_end ) {
- sh->h_last = ptr;
- }
-}
-
-void *
-sl_mark( void *ctx )
-{
- struct slab_heap *sh = ctx;
- void *ret = NULL;
-
- if (sh) ret = sh->h_last;
-
- return ret;
-}
-
void *
sl_context( void *ptr )
{