Lines Matching defs:next
152 struct epitem *next;
441 /* record NAPI ID for use in next busy poll */
723 nepi = epi->next, epi->next = EP_UNACTIVE_PTR) {
989 struct epitem *epi, *next;
1005 list_for_each_entry_safe(epi, next, &file->f_ep_links, fllink) {
1141 * This is simple 'new->next = head' operation, but cmpxchg()
1144 * new->next == new.
1146 if (cmpxchg(&new->next, new, head) != new)
1150 * Initially ->next of a new element must be updated with the head
1152 * exchanged. XCHG guarantees memory ordering, thus ->next should be
1154 * swapped before prev->next is updated.
1160 * It is safe to modify prev->next and new->prev, because a new element
1161 * is added only to the tail and new->next is updated before XCHG.
1164 prev->next = new;
1181 if (epi->next != EP_UNACTIVE_PTR)
1185 if (cmpxchg(&epi->next, EP_UNACTIVE_PTR, NULL) != EP_UNACTIVE_PTR)
1189 epi->next = xchg(&ep->ovflist, epi);
1229 * until the next EPOLL_CTL_MOD will be issued.
1523 epi->next = EP_UNACTIVE_PTR;
1770 * the ready list, so that the next call to
1899 * each new wakeup will hit the next waiter, giving it the