Lines Matching refs: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,
75 struct exec_node *next;
98 exec_node() : next(NULL), prev(NULL)
105 return next;
110 return next;
125 next->prev = prev;
126 prev->next = next;
127 next = NULL;
138 next = this;
147 after->next = this->next;
150 this->next->prev = after;
151 this->next = after;
158 before->next = this;
161 this->prev->next = before;
176 replacement->next = this->next;
178 this->prev->next = replacement;
179 this->next->prev = replacement;
187 return this->next == NULL;
229 void next()
246 exec_list_iterator(exec_node *n) : node(n), _next(n->next)
251 void next()
254 _next = node->next;
278 for (iter_type iter = (container) . iterator(); iter.has_next(); iter.next())
326 * \c next pointer is \c NULL.
356 n->next = head;
359 n->next->prev = n;
365 n->next = (exec_node *) &tail;
368 n->prev->next = n;
374 assert(n->prev->next == n);
376 n->prev->next = head;
412 target->tail_pred->next = (exec_node *) &target->tail;
429 this->tail_pred->next = source->head;
435 this->tail_pred->next = (exec_node *) &this->tail;
461 before->tail_pred->next = this;
464 this->prev->next = before->head;
475 for (exec_node * __node = (__list)->head, * __next = __node->next \
477 ; __node = __next, __next = __next->next)
481 ; (__node)->next != NULL \
482 ; (__node) = (__node)->next)
486 ; (__node)->next != NULL \
487 ; (__node) = (__node)->next)
492 (__node)->__field.next != NULL; \
493 (__node) = exec_node_data(__type, (__node)->__field.next, __field))
498 (__node)->__field.next != NULL; \
499 (__node) = exec_node_data(__type, (__node)->__field.next, __field))