Searched refs:tasks (Results 1 – 3 of 3) sorted by relevance
103 struct list_head *q = &queue->tasks[queue->priority]; in rpc_rotate_queue_owner()149 q = &queue->tasks[queue_priority]; in __rpc_add_wait_queue_priority()178 list_add(&task->u.tk_wait.list, &queue->tasks[0]); in __rpc_add_wait_queue()180 list_add_tail(&task->u.tk_wait.list, &queue->tasks[0]); in __rpc_add_wait_queue()225 for (i = 0; i < ARRAY_SIZE(queue->tasks); i++) in __rpc_init_priority_wait_queue()226 INIT_LIST_HEAD(&queue->tasks[i]); in __rpc_init_priority_wait_queue()469 q = &queue->tasks[queue->priority]; in __rpc_find_next_queued_priority()487 if (q == &queue->tasks[0]) in __rpc_find_next_queued_priority()488 q = &queue->tasks[queue->maxpriority]; in __rpc_find_next_queued_priority()495 } while (q != &queue->tasks[queue->priority]); in __rpc_find_next_queued_priority()[all …]
58 static hashbin_t *tasks = NULL; variable71 tasks = hashbin_new(HB_LOCK); in irda_device_init()72 if (tasks == NULL) { in irda_device_init()95 hashbin_delete(tasks, (FREE_FUNC) __irda_task_delete); in irda_device_cleanup()176 hashbin_remove(tasks, (long) task, NULL); in irda_task_delete()
40 to tasks depending on whether the task is a compat task or not. To