一张图理解O(1)算法

最新推荐文章于 2024-03-23 14:31:20 发布

李子

最新推荐文章于 2024-03-23 14:31:20 发布

阅读量1.2k

点赞数

分类专栏： sched 文章标签： linux kernel algorithm bitmap scheduler

sched 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Linux O(1) scheduler algorithm

struct prio_array array = rq->active;
if (!array->nr_active) {
rq->active = rq->expired;
rq->expired = array;
}

struct task_struct *prev, *next;
struct list_head *queue;
struct prio_array array;
int idx;

prev = current;
array = rq->active;
idx = sched_find_first_bit(array->bitmap);
queue = array->queue + idx;
next = list_entry(queue->next, struct task_struct, run_list);