39 ib_list_t* list =
static_cast<ib_list_t*
>(mem_alloc(
sizeof(ib_list_t)));
58 ib_list_t* list =
static_cast<ib_list_t *
>(
mem_heap_alloc(heap,
sizeof(ib_list_t)));
120 ib_list_node_t* prev_node,
125 ib_list_node_t* node =
static_cast<ib_list_node_t *
>(
mem_heap_alloc(heap,
sizeof(ib_list_node_t)));
139 }
else if (!prev_node) {
151 node->
prev = prev_node;
154 prev_node->
next = node;
173 ib_list_node_t* node)
UNIV_INLINE void * mem_heap_alloc(mem_heap_t *heap, ulint n)
UNIV_INTERN ib_list_t * ib_list_create_heap(mem_heap_t *heap)
UNIV_INLINE ib_list_node_t * ib_list_get_first(ib_list_t *list)
UNIV_INTERN void ib_list_remove(ib_list_t *list, ib_list_node_t *node)
UNIV_INTERN void ib_list_free(ib_list_t *list)
UNIV_INTERN ib_list_node_t * ib_list_add_first(ib_list_t *list, void *data, mem_heap_t *heap)
UNIV_INTERN ib_list_t * ib_list_create(void)
UNIV_INTERN ib_list_node_t * ib_list_add_last(ib_list_t *list, void *data, mem_heap_t *heap)
UNIV_INLINE ib_list_node_t * ib_list_get_last(ib_list_t *list)
UNIV_INTERN ib_list_node_t * ib_list_add_after(ib_list_t *list, ib_list_node_t *prev_node, void *data, mem_heap_t *heap)