Lines Matching defs:node
38 node_free( tr_list* node )
40 if( node != NULL )
42 *node = TR_LIST_CLEAR;
43 node->next = recycled_nodes;
44 recycled_nodes = node;
58 tr_list *node = *list;
61 data_free_func( node->data );
62 node_free( node );
70 tr_list * node = node_alloc ( );
72 node->data = data;
73 node->next = *list;
75 ( *list )->prev = node;
76 *list = node;
83 tr_list * node = node_alloc( );
85 node->data = data;
87 *list = node;
94 l->next = node;
95 node->prev = l;
112 tr_list * node )
115 tr_list * prev = node ? node->prev : NULL;
116 tr_list * next = node ? node->next : NULL;
120 if( *list == node ) *list = next;
121 data = node ? node->data : NULL;
122 node_free( node );
171 /* find l, the node that we'll insert this data before */
186 tr_list * node = node_alloc( );
187 node->data = data;
188 node->prev = l->prev;
189 node->next = l;
190 node->prev->next = node;
191 node->next->prev = node;