Home
last modified time | relevance | path

Searched refs:queue (Results 1 – 4 of 4) sorted by relevance

/kernel/
Dsched_rt.c642 struct list_head *queue = array->queue + rt_se_prio(rt_se); in __enqueue_rt_entity() local
653 list_add_tail(&rt_se->run_list, queue); in __enqueue_rt_entity()
665 if (list_empty(array->queue + rt_se_prio(rt_se))) in __dequeue_rt_entity()
743 struct list_head *queue = array->queue + rt_se_prio(rt_se); in requeue_rt_entity() local
746 list_move(&rt_se->run_list, queue); in requeue_rt_entity()
748 list_move_tail(&rt_se->run_list, queue); in requeue_rt_entity()
869 struct list_head *queue; in pick_next_rt_entity() local
875 queue = array->queue + idx; in pick_next_rt_entity()
876 next = list_entry(queue->next, struct sched_rt_entity, run_list); in pick_next_rt_entity()
945 list_for_each_entry(rt_se, array->queue + idx, run_list) { in pick_next_highest_task_rt()
Dcpuset.c2006 LIST_HEAD(queue); in scan_for_empty_cpusets()
2012 list_add_tail((struct list_head *)&root->stack_list, &queue); in scan_for_empty_cpusets()
2014 while (!list_empty(&queue)) { in scan_for_empty_cpusets()
2015 cp = list_first_entry(&queue, struct cpuset, stack_list); in scan_for_empty_cpusets()
2016 list_del(queue.next); in scan_for_empty_cpusets()
2019 list_add_tail(&child->stack_list, &queue); in scan_for_empty_cpusets()
Dsignal.c226 void flush_sigqueue(struct sigpending *queue) in flush_sigqueue() argument
230 sigemptyset(&queue->signal); in flush_sigqueue()
231 while (!list_empty(&queue->list)) { in flush_sigqueue()
232 q = list_entry(queue->list.next, struct sigqueue , list); in flush_sigqueue()
Dsched.c168 struct list_head queue[MAX_RT_PRIO]; member
8272 INIT_LIST_HEAD(array->queue + i); in init_rt_rq()