Searched refs:delayed_free_list (Results 1 – 1 of 1) sorted by relevance
31 struct list_node delayed_free_list = LIST_INITIAL_VALUE(delayed_free_list); variable128 while ((node = list_remove_head(&delayed_free_list))) { in heap_free_delayed_list()145 if (unlikely(!list_is_empty(&delayed_free_list))) { in heap_trim()156 if (unlikely(!list_is_empty(&delayed_free_list))) { in malloc()170 if (unlikely(!list_is_empty(&delayed_free_list))) { in memalign()184 if (unlikely(!list_is_empty(&delayed_free_list))) { in calloc()198 if (unlikely(!list_is_empty(&delayed_free_list))) { in realloc()226 list_add_head(&delayed_free_list, node); in heap_delayed_free()237 list_for_every(&delayed_free_list, node) { in heap_dump()
Completed in 3 milliseconds