Lines Matching refs:list
101 if (list_empty(&queue->timer_list.list))
125 if (list_empty(&queue->timer_list.list) || time_before(timeout, queue->timer_list.expires))
127 list_add(&task->u.tk_wait.timer_list, &queue->timer_list.list);
144 * Add a request to a queue list
151 list_for_each_entry(t, q, u.tk_wait.list) {
155 /* Cache the queue head in task->u.tk_wait.list */
156 task->u.tk_wait.list.next = q;
157 task->u.tk_wait.list.prev = NULL;
162 list_add_tail(&task->u.tk_wait.list, q);
166 * Remove request from a queue list
174 if (task->u.tk_wait.list.prev == NULL) {
183 q = t->u.tk_wait.list.next;
184 list_add_tail(&t->u.tk_wait.list, q);
187 list_del(&task->u.tk_wait.list);
213 list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]);
239 list_del(&task->u.tk_wait.list);
255 INIT_LIST_HEAD(&queue->timer_list.list);
378 * By always appending tasks to the list we ensure FIFO behavior.
613 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
623 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
636 task = list_first_entry(q, struct rpc_task, u.tk_wait.list);
655 return list_first_entry(&queue->tasks[0], struct rpc_task, u.tk_wait.list);
775 list_for_each_entry_safe(task, n, &queue->timer_list.list, u.tk_wait.timer_list) {
786 if (!list_empty(&queue->timer_list.list))