Searched refs:freelist (Results 1 – 4 of 4) sorted by relevance
73 static heap_node* freelist = NULL; variable86 freelist = (heap_node*)heap; in init_heap()87 freelist->next_node = offset_from_node(list_end); in init_heap()88 freelist->len = HEAP_SIZE / sizeof(heap_node); in init_heap()105 if (NULL == freelist) in fallback_malloc()109 for (p = freelist, prev = 0; p && p != list_end; in fallback_malloc()124 freelist = node_from_offset(p->next_node); in fallback_malloc()167 freelist = cp; in fallback_free()178 cp->next_node = offset_from_node(freelist); in fallback_free()179 freelist = cp; in fallback_free()[all …]
168 bfhead_t freelist[MAX_BGET_BINS]; member238 data->freelist[i].ql.flink = &data->freelist[i]; in set_thr_data()239 data->freelist[i].ql.blink = &data->freelist[i]; in set_thr_data()374 &thr->freelist[bin]); in __kmp_bget_insert_into_freelist()376 &thr->freelist[bin]); in __kmp_bget_insert_into_freelist()378 b->ql.flink = &thr->freelist[bin]; in __kmp_bget_insert_into_freelist()381 thr->freelist[bin].ql.blink = b; in __kmp_bget_insert_into_freelist()404 best = &thr->freelist[bin]; in bcheck()407 while (b != &thr->freelist[bin]) { in bcheck()467 best = &thr->freelist[bin]; in bget()[all …]
20 @freelist = external global i32 ; <i32*> [#uses=0]
54 once certain size criteria are reached. This is essentially a delayed freelist