Home
last modified time | relevance | path

Searched refs:cpupri (Results 1 - 12 of 12) sorted by relevance

/kernel/linux/linux-5.10/kernel/sched/
H A Dcpupri.c3 * kernel/sched/cpupri.c
27 /* Convert between a 140 based task->prio, and our 102 based cpupri */
30 int cpupri; in convert_prio() local
33 cpupri = CPUPRI_INVALID; in convert_prio()
35 cpupri = CPUPRI_IDLE; in convert_prio()
37 cpupri = CPUPRI_NORMAL; in convert_prio()
39 cpupri = MAX_RT_PRIO - prio + 1; in convert_prio()
41 return cpupri; in convert_prio()
44 static inline int __cpupri_find(struct cpupri *cp, struct task_struct *p, in __cpupri_find()
100 int cpupri_find(struct cpupri *c
[all...]
H A Dcpupri.h15 struct cpupri { struct
21 int cpupri_find(struct cpupri *cp, struct task_struct *p,
23 int cpupri_find_fitness(struct cpupri *cp, struct task_struct *p,
26 void cpupri_set(struct cpupri *cp, int cpu, int pri);
27 int cpupri_init(struct cpupri *cp);
28 void cpupri_cleanup(struct cpupri *cp);
H A DMakefile29 obj-$(CONFIG_SMP) += cpupri.o cpudeadline.o topology.o stop_task.o pelt.o
H A Drt.c1111 * Change rq's cpupri only if rt_rq is the top queue. in inc_rt_prio_smp()
1117 cpupri_set(&rq->rd->cpupri, rq->cpu, prio); in inc_rt_prio_smp()
1127 * Change rq's cpupri only if rt_rq is the top queue. in dec_rt_prio_smp()
1133 cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr); in dec_rt_prio_smp()
1547 !cpupri_find(&rq->rd->cpupri, rq->curr, NULL)) in check_preempt_equal_prio()
1555 cpupri_find(&rq->rd->cpupri, p, NULL)) in check_preempt_equal_prio()
1917 ret = cpupri_find_fitness(&task_rq(task)->rd->cpupri, in find_lowest_rq()
1922 ret = cpupri_find(&task_rq(task)->rd->cpupri, in find_lowest_rq()
2451 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in rq_online_rt()
2462 cpupri_set(&rq->rd->cpupri, r in rq_offline_rt()
[all...]
H A Dsched.h76 #include "cpupri.h"
923 struct cpupri cpupri; member
H A Dtopology.c442 cpupri_cleanup(&rd->cpupri); in free_rootdomain()
523 if (cpupri_init(&rd->cpupri) != 0) in init_rootdomain()
/kernel/linux/linux-6.6/kernel/sched/
H A Dcpupri.c3 * kernel/sched/cpupri.c
27 * p->rt_priority p->prio newpri cpupri
44 int cpupri; in convert_prio() local
48 cpupri = CPUPRI_INVALID; /* -1 */ in convert_prio()
52 cpupri = MAX_RT_PRIO-1 - prio; /* 1 ... 99 */ in convert_prio()
56 cpupri = CPUPRI_NORMAL; /* 0 */ in convert_prio()
60 cpupri = CPUPRI_HIGHER; /* 100 */ in convert_prio()
64 return cpupri; in convert_prio()
67 static inline int __cpupri_find(struct cpupri *cp, struct task_struct *p, in __cpupri_find()
124 int cpupri_find(struct cpupri *c
[all...]
H A Dcpupri.h15 struct cpupri { struct
21 int cpupri_find(struct cpupri *cp, struct task_struct *p,
23 int cpupri_find_fitness(struct cpupri *cp, struct task_struct *p,
26 void cpupri_set(struct cpupri *cp, int cpu, int pri);
27 int cpupri_init(struct cpupri *cp);
28 void cpupri_cleanup(struct cpupri *cp);
H A Drt.c1150 * Change rq's cpupri only if rt_rq is the top queue. in inc_rt_prio_smp()
1156 cpupri_set(&rq->rd->cpupri, rq->cpu, prio); in inc_rt_prio_smp()
1166 * Change rq's cpupri only if rt_rq is the top queue. in dec_rt_prio_smp()
1172 cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr); in dec_rt_prio_smp()
1700 !cpupri_find(&rq->rd->cpupri, rq->curr, NULL)) in check_preempt_equal_prio()
1708 cpupri_find(&rq->rd->cpupri, p, NULL)) in check_preempt_equal_prio()
2091 ret = cpupri_find_fitness(&task_rq(task)->rd->cpupri, in find_lowest_rq()
2096 ret = cpupri_find(&task_rq(task)->rd->cpupri, in find_lowest_rq()
2687 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in rq_online_rt()
2698 cpupri_set(&rq->rd->cpupri, r in rq_offline_rt()
[all...]
H A Dtopology.c477 cpupri_cleanup(&rd->cpupri); in free_rootdomain()
559 if (cpupri_init(&rd->cpupri) != 0) in init_rootdomain()
H A Ddeadline.c1462 cpupri_set(&rq->rd->cpupri, rq->cpu, CPUPRI_HIGHER); in inc_dl_deadline()
1480 cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr); in dec_dl_deadline()
H A Dsched.h96 #include "cpupri.h"
984 struct cpupri cpupri; member

Completed in 35 milliseconds