Lines Matching defs:node
28 * Each doubly-linked list has a sentinel head and tail node. These nodes
37 * Instead of tracking two separate \c node structures and a \c list structure
39 * that each sentinel node always has one \c NULL pointer, the \c NULL
44 * head sentinel node.
46 * sentinel node and the \c next pointer of the tail sentinel node. This
49 * tail sentinel node.
83 void *node;
85 node = ralloc_size(ctx, size);
86 assert(node != NULL);
88 return node;
93 static void operator delete(void *node)
95 ralloc_free(node);
132 * Link a node with itself
143 * Insert a node in the list after the current node
154 * Insert a node in the list before the current node
166 * Insert another list in the list before the current node
171 * Replace the current node with the given node.
217 * \param type Base type of the structure containing the node
218 * \param node Pointer to the \c exec_node
221 #define exec_node_data(type, node, field) \
222 ((type *) (((char *) node) - exec_list_offsetof(type, field, node)))
246 exec_list_iterator(exec_node *n) : node(n), _next(n->next)
253 node = _next;
254 _next = node->next;
259 node->remove();
264 return node;
273 exec_node *node;
292 void *node;
294 node = ralloc_size(ctx, size);
295 assert(node != NULL);
297 return node;
302 static void operator delete(void *node)
304 ralloc_free(node);
325 * - Check to see if the \c head is the sentinel node by test whether its
383 * Remove the first node from a list and return it
386 * The first node in the list or \c NULL if the list is empty.
427 /* Link the first node of the source with the last node of the target list.
472 * This version is safe even if the current node is removed.
