Lines Matching defs:next
109 struct eppoll_entry *next;
145 struct epitem *next;
270 struct epitems_head *next;
287 if (!head->next) {
288 head->next = tfile_check_list;
302 head->next = NULL;
455 /* record NAPI ID for use in next busy poll */
573 *p = pwq->next;
645 nepi = epi->next, epi->next = EP_UNACTIVE_PTR) {
743 if (head->first == &epi->fllink && !epi->fllink.next) {
748 if (!smp_load_acquire(&v->next))
787 struct rb_node *rbp, *next;
815 for (rbp = rb_first_cached(&ep->rbr); rbp; rbp = next) {
816 next = rb_next(rbp);
1096 * This is simple 'new->next = head' operation, but cmpxchg()
1099 * new->next == new.
1101 if (!try_cmpxchg(&new->next, &new, head))
1105 * Initially ->next of a new element must be updated with the head
1107 * exchanged. XCHG guarantees memory ordering, thus ->next should be
1109 * swapped before prev->next is updated.
1115 * It is safe to modify prev->next and new->prev, because a new element
1116 * is added only to the tail and new->next is updated before XCHG.
1119 prev->next = new;
1136 if (epi->next != EP_UNACTIVE_PTR)
1140 if (cmpxchg(&epi->next, EP_UNACTIVE_PTR, NULL) != EP_UNACTIVE_PTR)
1144 epi->next = xchg(&ep->ovflist, epi);
1184 * until the next EPOLL_CTL_MOD will be issued.
1295 pwq->next = epi->pwqlist;
1391 for (p = tfile_check_list; p != EP_UNACTIVE_PTR; p = p->next) {
1506 epi->next = EP_UNACTIVE_PTR;
1750 * the ready list, so that the next call to
1883 * each new wakeup will hit the next waiter, giving it the
2021 tfile_check_list = head->next;