Lines Matching refs:node
32 static inline void list_node_init(rk_list_node *node) in list_node_init() argument
34 node->prev = node->next = node; in list_node_init()
37 static inline void list_node_init_with_key_and_size(rk_list_node *node, RK_U32 key, RK_S32 size) in list_node_init_with_key_and_size() argument
39 list_node_init(node); in list_node_init_with_key_and_size()
40 node->key = key; in list_node_init_with_key_and_size()
41 node->size = size; in list_node_init_with_key_and_size()
46 rk_list_node *node = (rk_list_node*)malloc(sizeof(rk_list_node) + size); in create_list() local
47 if (node) { in create_list()
48 void *dst = (void*)(node + 1); in create_list()
49 list_node_init_with_key_and_size(node, key, size); in create_list()
54 return node; in create_list()
80 rk_list_node *node = create_list(data, size, 0); in add_at_head() local
81 if (node) { in add_at_head()
82 rk_list_add(node, head); in add_at_head()
98 rk_list_node *node = create_list(data, size, 0); in add_at_tail() local
99 if (node) { in add_at_tail()
100 rk_list_add_tail(node, head); in add_at_tail()
111 static void release_list(rk_list_node*node, void *data, RK_S32 size) in release_list() argument
113 void *src = (void*)(node + 1); in release_list()
114 if (node->size == size) { in release_list()
118 size = (size < node->size) ? (size) : (node->size); in release_list()
121 free(node); in release_list()
130 static inline void rk_list_del_init(rk_list_node *node) in rk_list_del_init() argument
132 _rk_list_del(node->prev, node->next); in rk_list_del_init()
133 list_node_init(node); in rk_list_del_init()
136 static inline void _list_del_node_no_lock(rk_list_node *node, void *data, RK_S32 size) in _list_del_node_no_lock() argument
138 rk_list_del_init(node); in _list_del_node_no_lock()
139 release_list(node, data, size); in _list_del_node_no_lock()
216 rk_list_node* node = head->next; in flush() local
217 rk_list_del_init(node); in flush()
219 destroy((void*)(node + 1)); in flush()
221 free(node); in flush()