Lines Matching refs:list
86 if (list_empty(&queue->timer_list.list))
110 if (list_empty(&queue->timer_list.list) || time_before(timeout, queue->timer_list.expires))
112 list_add(&task->u.tk_wait.timer_list, &queue->timer_list.list);
129 * Add a request to a queue list
136 list_for_each_entry(t, q, u.tk_wait.list) {
140 /* Cache the queue head in task->u.tk_wait.list */
141 task->u.tk_wait.list.next = q;
142 task->u.tk_wait.list.prev = NULL;
147 list_add_tail(&task->u.tk_wait.list, q);
151 * Remove request from a queue list
159 if (task->u.tk_wait.list.prev == NULL) {
168 q = t->u.tk_wait.list.next;
169 list_add_tail(&t->u.tk_wait.list, q);
172 list_del(&task->u.tk_wait.list);
198 list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]);
224 list_del(&task->u.tk_wait.list);
240 INIT_LIST_HEAD(&queue->timer_list.list);
357 * By always appending tasks to the list we ensure FIFO behavior.
592 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
602 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
615 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
634 return list_first_entry(&queue->tasks[0], struct rpc_task, u.tk_wait.list);
754 list_for_each_entry_safe(task, n, &queue->timer_list.list, u.tk_wait.timer_list) {
765 if (!list_empty(&queue->timer_list.list))