DUK_INTERNAL void duk_heap_force_strtab_resize(duk_heap *heap) {
/* Force a resize so that DELETED entries are eliminated.
* Another option would be duk__recheck_strtab_size_probe();
* but since that happens on every intern anyway, this whole
* check can now be disabled.
*/
#if defined(DUK_USE_STRTAB_CHAIN)
DUK_UNREF(heap);
#elif defined(DUK_USE_STRTAB_PROBE)
duk__resize_strtab_probe(heap);
#endif
}
DUK_INTERNAL void duk_heap_force_strtab_resize(duk_heap *heap) {
duk_small_uint_t prev_mark_and_sweep_base_flags;
/* Force a resize so that DELETED entries are eliminated.
* Another option would be duk__recheck_strtab_size_probe();
* but since that happens on every intern anyway, this whole
* check can now be disabled.
*/
DUK_ASSERT((heap->mark_and_sweep_base_flags & DUK_MS_FLAG_NO_STRINGTABLE_RESIZE) == 0);
prev_mark_and_sweep_base_flags = heap->mark_and_sweep_base_flags;
DUK__PREVENT_MS_SIDE_EFFECTS(heap);
#if defined(DUK_USE_STRTAB_CHAIN)
DUK_UNREF(heap);
#elif defined(DUK_USE_STRTAB_PROBE)
(void) duk__resize_strtab_probe(heap);
#endif
heap->mark_and_sweep_base_flags = prev_mark_and_sweep_base_flags;
}
DUK_LOCAL duk_bool_t duk__recheck_strtab_size_probe(duk_heap *heap, duk_uint32_t new_used) {
duk_uint32_t new_free;
duk_uint32_t tmp1;
duk_uint32_t tmp2;
DUK_ASSERT(new_used <= heap->st_size); /* grow by at most one */
new_free = heap->st_size - new_used; /* unsigned intentionally */
/* new_free / size <= 1 / DIV <=> new_free <= size / DIV */
/* new_used / size <= 1 / DIV <=> new_used <= size / DIV */
tmp1 = heap->st_size / DUK_STRTAB_MIN_FREE_DIVISOR;
tmp2 = heap->st_size / DUK_STRTAB_MIN_USED_DIVISOR;
if (new_free <= tmp1 || new_used <= tmp2) {
/* load factor too low or high, count actually used entries and resize */
return duk__resize_strtab_probe(heap);
} else {
return 0; /* OK */
}
}
