Lines Matching refs:tail_calls

835 		bc_vec_push(&p->tail_calls, &temp);  in bc_program_read()
2441 	assert(p->stack.len == p->tail_calls.len);  in bc_program_nquit()
2454 	for (i = 0; val && i < p->tail_calls.len; ++i)  in bc_program_nquit()
2457 		size_t calls = *((size_t*) bc_vec_item_rev(&p->tail_calls, i)) + 1;  in bc_program_nquit()
2478 		bc_vec_npop(&p->tail_calls, i);  in bc_program_nquit()
2490 	size_t i, amt, len = p->tail_calls.len;  in bc_program_execStackLen()
2496 		amt += *((size_t*) bc_vec_item(&p->tail_calls, i));  in bc_program_execStackLen()
2522 	assert(p->stack.len == p->tail_calls.len);  in bc_program_execStr()
2643 		size_t* call_ptr = bc_vec_top(&p->tail_calls);  in bc_program_execStr()
2653 	else bc_vec_push(&p->tail_calls, &ip.idx);  in bc_program_execStr()
2877 	if (BC_IS_DC) bc_vec_free(&p->tail_calls);  in bc_program_free()
2913 		bc_vec_init(&p->tail_calls, sizeof(size_t), BC_DTOR_NONE);  in bc_program_init()
2917 		bc_vec_push(&p->tail_calls, &i);  in bc_program_init()
3015 	if (BC_IS_DC) bc_vec_npop(&p->tail_calls, p->tail_calls.len - 1);  in bc_program_reset()
3595 				bc_vec_pop(&p->tail_calls);  in bc_program_exec()