Lines Matching full:next
11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
79 struct exec_node *next;
102 exec_node() : next(NULL), prev(NULL)
109 return next;
114 return next;
129 next->prev = prev;
130 prev->next = next;
131 next = NULL;
142 next = this;
151 after->next = this->next;
154 this->next->prev = after;
155 this->next = after;
162 before->next = this;
165 this->prev->next = before;
180 replacement->next = this->next;
182 this->prev->next = replacement;
183 this->next->prev = replacement;
191 return this->next == NULL;
233 void next()
250 exec_list_iterator(exec_node *n) : node(n), _next(n->next)
255 void next()
258 _next = node->next;
282 for (iter_type iter = (container) . iterator(); iter.has_next(); iter.next())
330 * \c next pointer is \c NULL.
360 n->next = head;
363 n->next->prev = n;
369 n->next = (exec_node *) &tail;
372 n->prev->next = n;
378 assert(n->prev->next == n);
380 n->prev->next = head;
416 target->tail_pred->next = (exec_node *) &target->tail;
433 this->tail_pred->next = source->head;
439 this->tail_pred->next = (exec_node *) &this->tail;
465 before->tail_pred->next = this;
468 this->prev->next = before->head;
479 for (exec_node * __node = (__list)->head, * __next = __node->next \
481 ; __node = __next, __next = __next->next)
485 ; (__node)->next != NULL \
486 ; (__node) = (__node)->next)
490 ; (__node)->next != NULL \
491 ; (__node) = (__node)->next)
496 (__node)->__field.next != NULL; \
497 (__node) = exec_node_data(__type, (__node)->__field.next, __field))
502 (__node)->__field.next != NULL; \
503 (__node) = exec_node_data(__type, (__node)->__field.next, __field))
