Lines Matching refs:list
20 #include <linux/list.h>
138 /* List header used to link this structure to the eventpoll ready list */
152 * removed from the "struct file" items list; together with
163 /* List header used to link this item to the "struct file" items list */
203 * This is a single linked list that chains all the "struct epitem" that
416 * ID onto the ready list.
485 * issue a wake_up() on its poll wake list. Epoll (efd1) has installed a
489 * the waiters on its poll wait list (efd2). So it calls ep_poll_safewake()
619 * Steal the ready list, and re-init the original one to the
620 * empty list. Also, set ep->ovflist to NULL so that events
642 * We re-insert them inside the main ready-list here.
647 * We need to check if the item is already in the list.
734 /* Remove the current item from the list of epoll hooks */
856 * the ready list.
866 * Item has been dropped into the ready list by the poll
950 * touching the epitems list before eventpoll_release_file() can access
1073 * Adds a new entry to the tail of the list in a lockless way, i.e.
1077 * existing list until all changes are completed, in other words
1083 * Also an element can be locklessly added to the list only in one
1085 * concurrent access will corrupt the list.
1087 * Return: %false if element has been already added to the list, %true
1098 * added to the list from another CPU: the winner observes
1157 * ep_scan_ready_list(), which stops all list modifications and guarantees
1208 /* In the usual case, add event to ready list. */
1214 * Wake up ( if active ) both the eventpoll wait list and the ->poll()
1215 * wait list.
1378 * reverse_path_check - The tfile_check_list is list of epitem_head, which have
1510 /* Add the current item to the list of active epoll hook for this file */
1573 /* We have to drop the new item inside our item list to keep track of it */
1579 /* If the file is already "ready" we drop it inside the ready list */
1652 * list, push it inside.
1698 * We can loop without lock because we are passed a task private list.
1750 * the ready list, so that the next call to
1849 * to the ready list under the lock (e.g., in IRQ callbacks). For cases
1850 * with a non-zero timeout, this thread will check the ready list under
2172 * checking for loops we also determine the list of files reachable