/* From the table's beginning search the first free slot, and set it to pfc's slot_index */
void pfc_reset_slot_index(Chunk_Header *chunk)
{
POINTER_SIZE_INT *table = chunk->table;
unsigned int index_word_num = (chunk->slot_num + SLOT_NUM_PER_WORD_IN_TABLE - 1) / SLOT_NUM_PER_WORD_IN_TABLE;
for(unsigned int i=0; i<index_word_num; ++i){
if(table[i] != cur_alloc_mask){
pfc_set_slot_index(chunk, i, cur_alloc_color);
return;
}
}
}
static void collector_sweep_normal_chunk_con(Conclctor *sweeper, Wspace *wspace, Chunk_Header *chunk)
{
unsigned int slot_num = chunk->slot_num;
unsigned int live_num = 0;
unsigned int first_free_word_index = MAX_SLOT_INDEX;
POINTER_SIZE_INT *table = chunk->table;
unsigned int index_word_num = (slot_num + SLOT_NUM_PER_WORD_IN_TABLE - 1) / SLOT_NUM_PER_WORD_IN_TABLE;
for(unsigned int i=0; i<index_word_num; ++i){
table[i] &= cur_alloc_mask;
unsigned int live_num_in_word = (table[i] == cur_alloc_mask) ? SLOT_NUM_PER_WORD_IN_TABLE : word_set_bit_num(table[i]);
live_num += live_num_in_word;
/* for concurrent sweeping, sweeping and allocation are performed concurrently. so we can not just count the current live obj*/
if((first_free_word_index == MAX_SLOT_INDEX) && (live_num_in_word < SLOT_NUM_PER_WORD_IN_TABLE)){
first_free_word_index = i;
pfc_set_slot_index((Chunk_Header*)chunk, first_free_word_index, cur_alloc_color);
}
}
assert(live_num <= slot_num);
sweeper->live_obj_size += live_num * chunk->slot_size;
sweeper->live_obj_num += live_num;
if(!live_num){ /* all objects in this chunk are dead */
collector_add_free_chunk(sweeper, (Free_Chunk*)chunk);
} else {
chunk->alloc_num = live_num;
if(!chunk_is_reusable(chunk)){ /* most objects in this chunk are swept, add chunk to pfc list*/
wspace_reg_unreusable_normal_chunk(wspace, chunk);
} else { /* most objects in this chunk are swept, add chunk to pfc list*/
wspace_put_pfc_backup(wspace, chunk);
}
}
}