ut0list.h File Reference

#include "mem0mem.h"
#include "ut0list.ic"

Include dependency graph for ut0list.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	ib_list_t
struct	ib_list_node_t
struct	ib_list_helper_t

Functions
UNIV_INTERN ib_list_t *	ib_list_create (void)
UNIV_INTERN ib_list_t *	ib_list_create_heap (mem_heap_t *heap)
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_node_t *	ib_list_add_last (ib_list_t *list, void *data, mem_heap_t *heap)
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)
UNIV_INTERN void	ib_list_remove (ib_list_t *list, ib_list_node_t *node)
UNIV_INLINE ib_list_node_t *	ib_list_get_first (ib_list_t *list)
UNIV_INLINE ib_list_node_t *	ib_list_get_last (ib_list_t *list)
UNIV_INLINE ibool	ib_list_is_empty (const ib_list_t *list)

Detailed Description

A double-linked list

Created 4/26/2006 Osku Salerma

Definition in file ut0list.h.

Function Documentation

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
	)

Add the data after the indicated node.

Returns

new list node in: memory heap to use

Add the data after the indicated node.

Returns

new list node

Parameters

list	in: list
prev_node	in: node preceding new node (can be NULL)
data	in: data
heap	in: memory heap to use

Definition at line 121 of file ut0list.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

UNIV_INTERN ib_list_node_t* ib_list_add_first	(	ib_list_t *	list,
		void *	data,
		mem_heap_t *	heap
	)

Add the data to the start of the list.

Returns

new list node in: memory heap to use

Add the data to the start of the list.

Returns

new list node

Parameters

list	in: list
data	in: data
heap	in: memory heap to use

Definition at line 93 of file ut0list.cc.

Here is the call graph for this function:

UNIV_INTERN ib_list_node_t* ib_list_add_last	(	ib_list_t *	list,
		void *	data,
		mem_heap_t *	heap
	)

Add the data to the end of the list.

Returns

new list node in: memory heap to use

Add the data to the end of the list.

Returns

new list node

Parameters

list	in: list
data	in: data
heap	in: memory heap to use

Definition at line 107 of file ut0list.cc.

Here is the call graph for this function:

Here is the caller graph for this function:

UNIV_INTERN ib_list_t* ib_list_create

(

void

)

Create a new list using mem_alloc. Lists created with this function must be freed with ib_list_free.

Returns

list

Create a new list.

Returns

list

Definition at line 36 of file ut0list.cc.

Here is the caller graph for this function:

UNIV_INTERN ib_list_t* ib_list_create_heap

(

mem_heap_t *

heap

)

Create a new list using the given heap. ib_list_free MUST NOT BE CALLED for lists created with this function.

Returns

list in: memory heap to use

Create a new list using the given heap. ib_list_free MUST NOT BE CALLED for lists created with this function.

Returns

list

Parameters

heap	in: memory heap to use

Definition at line 56 of file ut0list.cc.

Here is the call graph for this function:

UNIV_INTERN void ib_list_free

(

ib_list_t *

list

)

Free a list. in: list

Free a list.

Parameters

list

in: list

Definition at line 75 of file ut0list.cc.

Here is the caller graph for this function:

UNIV_INLINE ib_list_node_t* ib_list_get_first

(

ib_list_t *

list

)

Get the first node in the list.

Returns

first node, or NULL in: list

Here is the caller graph for this function:

UNIV_INLINE ib_list_node_t* ib_list_get_last

(

ib_list_t *

list

)

Get the last node in the list.

Returns

last node, or NULL in: list

Here is the caller graph for this function:

UNIV_INTERN void ib_list_remove	(	ib_list_t *	list,
		ib_list_node_t *	node
	)

Remove the node from the list. in: node to remove

Remove the node from the list.

Parameters

list	in: list
node	in: node to remove

Definition at line 177 of file ut0list.cc.

Here is the caller graph for this function: