R类 00524:/ 00525:*Adding/removing a task to/ from a priority array 00526: 100527: static void enqueue_task_rt(struct rq'rq, struct task_ struct"p,int wakeup 00528:{ 00529: struct sched rt entity * rt se =&p->rt 00530: 进而查看: if ( wakeup) 1) enqueue_rt entity 00532: rt se->timeout =0 2) enqueue rt entity 00533: 每个cpu有一个队列 00534: enqueue_rt_entity(rt se 3)sched rt entity 00535: 4)struct rq 5)struct rt_ rq 6) struct rt_ prio array 00150: *This is the priority-queue data structure of the rt scheduling class 00151:*/ 00152: struct rt_ prio- array t 00153: DECLARE BITMAP(bitmap, MAX_RT_PRIO+1); /* include 1 bit for delimiter"/ struct list_head queue[ MAX_RT_PRIOT 0015 优先级队列 式系统实验室 ED SYSTEM 001562021/2/6 Linux操作系统分析 37/65 Rt类 进而查看： 1）enqueue_rt_entity 2）__enqueue_rt_entity 每个cpu有一个队列 3）sched_rt_entity 4）struct rq 5）struct rt_rq 6） struct rt_prio_array 优先级队列