Lines Matching defs:node
28 * Each doubly-linked list has a sentinel head and tail node. These nodes
74 * Link a node with itself
81 * Insert a node in the list after the current node
86 * Insert another list in the list after the current node
91 * Insert a node in the list before the current node
96 * Insert another list in the list before the current node
101 * Replace the current node with the given node.
279 * \param type Base type of the structure containing the node
280 * \param node Pointer to the \c exec_node
283 #define exec_node_data(type, node, field) \
284 ((type *) (((uintptr_t) node) - exec_list_offsetof(type, field, node)))
323 * Remove the first node from a list and return it
326 * The first node in the list or \c NULL if the list is empty.
366 * - Check to see if the head is the sentinel node by test whether its
434 struct exec_node *node;
436 for (node = list->head_sentinel.next; node->next != NULL; node = node->next) {
508 /* Link the first node of the source with the last node of the target list.
563 const struct exec_node *node;
574 for (node = list->head_sentinel.next; node->next != NULL; node = node->next) {
575 assert(node->next->prev == node);
576 assert(node->prev->next == node);
699 * This version is safe even if the current node is removed.
723 * This is safe against either current node being removed or replaced.
736 #define exec_node_data_forward(type, node, field) \
737 (!exec_node_is_tail_sentinel(node) ? exec_node_data(type, node, field) : NULL)
739 #define exec_node_data_backward(type, node, field) \
740 (!exec_node_is_head_sentinel(node) ? exec_node_data(type, node, field) : NULL)