Searched refs:last_pool (Results 1 – 4 of 4) sorted by relevance
136 qstr_pool_t *pool = MP_STATE_VM(last_pool); in find_qstr()148 if (MP_STATE_VM(last_pool)->len >= MP_STATE_VM(last_pool)->alloc) { in qstr_add()149 size_t new_alloc = MP_STATE_VM(last_pool)->alloc * 2; in qstr_add()159 pool->prev = MP_STATE_VM(last_pool); in qstr_add()160 pool->total_prev_len = MP_STATE_VM(last_pool)->total_prev_len + MP_STATE_VM(last_pool)->len; in qstr_add()163 MP_STATE_VM(last_pool) = pool; in qstr_add()164 DEBUG_printf("QSTR: allocate new pool of size %d\n", MP_STATE_VM(last_pool)->alloc); in qstr_add()168 MP_STATE_VM(last_pool)->qstrs[MP_STATE_VM(last_pool)->len++] = q_ptr; in qstr_add()171 return MP_STATE_VM(last_pool)->total_prev_len + MP_STATE_VM(last_pool)->len - 1; in qstr_add()179 for (qstr_pool_t *pool = MP_STATE_VM(last_pool); pool != NULL; pool = pool->prev) { in qstr_find_strn()[all …]
58 #define QSTR_TOTAL() (MP_STATE_VM(last_pool)->total_prev_len + MP_STATE_VM(last_pool)->len)
118 qstr_pool_t *last_pool; member
909 … for (qstr_pool_t *pool = MP_STATE_VM(last_pool); c == 'h' && pool != NULL; pool = pool->prev) { in gc_dump_alloc_table()
Completed in 7 milliseconds