void caml_reallocate_minor_heap(asize_t size)
{
Assert(caml_domain_state->young_ptr == caml_domain_state->young_end);
/* free old minor heap.
instead of unmapping the heap, we decommit it, so there's
no race whereby other code could attempt to reuse the memory. */
caml_mem_decommit((void*)domain_self->minor_heap_area,
domain_self->minor_heap_area_end - domain_self->minor_heap_area);
size = caml_norm_minor_heap_size(size);
caml_mem_commit((void*)domain_self->minor_heap_area, size);
#ifdef DEBUG
{
uintnat* p = (uintnat*)domain_self->minor_heap_area;
for (; p < (uintnat*)(domain_self->minor_heap_area + size); p++)
*p = Debug_uninit_align;
}
#endif
caml_minor_heap_size = size;
caml_domain_state->young_start = (char*)domain_self->minor_heap_area;
caml_domain_state->young_end = (char*)(domain_self->minor_heap_area + size);
caml_domain_state->young_ptr = caml_domain_state->young_end;
}
CAMLprim value caml_gc_set(value v)
{
uintnat newpf;
uintnat newminwsz;
#ifndef NATIVE_CODE
caml_change_max_stack_size (Long_field (v, 5));
#endif
newpf = norm_pfree (Long_field (v, 2));
if (newpf != caml_percent_free){
caml_percent_free = newpf;
caml_gc_message (0x20, "New space overhead: %"
ARCH_INTNAT_PRINTF_FORMAT "u%%\n", caml_percent_free);
}
/* Minor heap size comes last because it will trigger a minor collection
(thus invalidating [v]) and it can raise [Out_of_memory]. */
newminwsz = caml_norm_minor_heap_size (Long_field (v, 0));
if (newminwsz != Caml_state->minor_heap_wsz){
caml_gc_message (0x20, "New minor heap size: %"
ARCH_SIZET_PRINTF_FORMAT "uk words\n", newminwsz / 1024);
caml_set_minor_heap_size (newminwsz);
}
return Val_unit;
}
CAMLprim value caml_gc_set(value v)
{
return Val_unit;
#if 0
uintnat newpf, newpm;
asize_t newheapincr;
asize_t newminwsz;
uintnat oldpolicy;
CAML_INSTR_SETUP (tmr, "");
caml_params->verb_gc = Long_field (v, 3);
#ifndef NATIVE_CODE
caml_change_max_stack_size (Long_field (v, 5));
#endif
newpf = norm_pfree (Long_field (v, 2));
if (newpf != caml_percent_free){
caml_percent_free = newpf;
caml_gc_message (0x20, "New space overhead: %"
ARCH_INTNAT_PRINTF_FORMAT "u%%\n", caml_percent_free);
}
newpm = norm_pmax (Long_field (v, 4));
if (newpm != caml_percent_max){
caml_percent_max = newpm;
caml_gc_message (0x20, "New max overhead: %"
ARCH_INTNAT_PRINTF_FORMAT "u%%\n", caml_percent_max);
}
newheapincr = Long_field (v, 1);
if (newheapincr != caml_major_heap_increment){
caml_major_heap_increment = newheapincr;
if (newheapincr > 1000){
caml_gc_message (0x20, "New heap increment size: %"
ARCH_INTNAT_PRINTF_FORMAT "uk words\n",
caml_major_heap_increment/1024);
}else{
caml_gc_message (0x20, "New heap increment size: %"
ARCH_INTNAT_PRINTF_FORMAT "u%%\n",
caml_major_heap_increment);
}
}
oldpolicy = caml_allocation_policy;
caml_set_allocation_policy (Long_field (v, 6));
if (oldpolicy != caml_allocation_policy){
caml_gc_message (0x20, "New allocation policy: %"
ARCH_INTNAT_PRINTF_FORMAT "u\n", caml_allocation_policy);
}
/* This field was added in 4.03.0. */
if (Wosize_val (v) >= 8){
int old_window = caml_major_window;
caml_set_major_window (norm_window (Long_val (Field (v, 7))));
if (old_window != caml_major_window){
caml_gc_message (0x20, "New smoothing window size: %d\n",
caml_major_window);
}
}
/* Minor heap size comes last because it will trigger a minor collection
(thus invalidating [v]) and it can raise [Out_of_memory]. */
newminsize = caml_norm_minor_heap_size (Long_field (v, 0));
if (newminsize != Caml_state->minor_heap_size){
caml_gc_message (0x20, "New minor heap size: %luk bytes\n",
newminsize/1024);
caml_set_minor_heap_size (newminsize);
}
CAML_INSTR_TIME (tmr, "explicit/gc_set");
return Val_unit;
#endif
}
