| /kernel/sched/ |
| D | rt.c | 266 return rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()
377 plist_node_init(&p->pushable_tasks, p->prio); in enqueue_pushable_task()
381 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
382 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
393 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
541 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
576 return p->prio != p->normal_prio; in rt_se_boosted()
944 return rt_task_of(rt_se)->prio; in rt_se_prio()
1076 inc_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) in inc_rt_prio_smp() argument
1087 if (rq->online && prio < prev_prio) in inc_rt_prio_smp()
[all …]
|
| D | cpupri.c | 28 static int convert_prio(int prio) in convert_prio() argument
32 if (prio == CPUPRI_INVALID) in convert_prio()
34 else if (prio == MAX_PRIO) in convert_prio()
36 else if (prio >= MAX_RT_PRIO) in convert_prio()
39 cpupri = MAX_RT_PRIO - prio + 1; in convert_prio()
66 int task_pri = convert_prio(p->prio); in cpupri_find()
|
| D | core.c | 750 int prio = p->static_prio - MAX_RT_PRIO; in set_load_weight() local
768 reweight_task(p, prio); in set_load_weight()
770 load->weight = scale_load(sched_prio_to_weight[prio]); in set_load_weight()
771 load->inv_weight = sched_prio_to_wmult[prio]; in set_load_weight()
1355 int prio; in normal_prio() local
1358 prio = MAX_DL_PRIO-1; in normal_prio()
1360 prio = MAX_RT_PRIO-1 - p->rt_priority; in normal_prio()
1362 prio = __normal_prio(p); in normal_prio()
1363 return prio; in normal_prio()
1381 if (!rt_prio(p->prio)) in effective_prio()
[all …]
|
| D | deadline.c | 1377 int prio = dl_task_of(dl_se)->prio; in inc_dl_tasks() local
1380 WARN_ON(!dl_prio(prio)); in inc_dl_tasks()
1391 int prio = dl_task_of(dl_se)->prio; in dec_dl_tasks() local
1393 WARN_ON(!dl_prio(prio)); in dec_dl_tasks()
|
| D | debug.c | 445 p->prio); in print_task()
956 P(prio); in proc_sched_show_task()
|
| D | sched.h | 1879 extern void reweight_task(struct task_struct *p, int prio);
|
| D | fair.c | 2908 void reweight_task(struct task_struct *p, int prio) in reweight_task() argument
2913 unsigned long weight = scale_load(sched_prio_to_weight[prio]); in reweight_task()
2916 load->inv_weight = sched_prio_to_wmult[prio]; in reweight_task()
10154 if (p->prio > oldprio) in prio_changed_fair()
|
| /kernel/ |
| D | tracepoint.c | 130 int prio) in func_add() argument
145 if (pos < 0 && old[nr_probes].prio < prio) in func_add()
228 struct tracepoint_func *func, int prio) in tracepoint_add_func() argument
241 old = func_add(&tp_funcs, func, prio); in tracepoint_add_func()
306 void *data, int prio) in tracepoint_probe_register_prio() argument
314 tp_func.prio = prio; in tracepoint_probe_register_prio()
315 ret = tracepoint_add_func(tp, &tp_func, prio); in tracepoint_probe_register_prio()
|
| D | auditsc.c | 205 if (!ctx->prio) { in audit_set_auditable()
206 ctx->prio = 1; in audit_set_auditable()
717 if (rule->prio <= ctx->prio) in audit_filter_rules()
723 ctx->prio = rule->prio; in audit_filter_rules()
900 context->prio = state == AUDIT_RECORD_CONTEXT ? ~0ULL : 0; in audit_alloc_context()
1645 context->prio = 0; in __audit_syscall_entry()
1717 context->prio = context->state == AUDIT_RECORD_CONTEXT ? ~0ULL : 0; in __audit_syscall_exit()
2179 if (!ctx->prio) { in auditsc_get_stamp()
2180 ctx->prio = 1; in auditsc_get_stamp()
|
| D | auditfilter.c | 823 new->prio = old->prio; in audit_dupe_rule()
975 entry->rule.prio = ~0ULL; in audit_add_rule()
978 entry->rule.prio = ++prio_high; in audit_add_rule()
980 entry->rule.prio = --prio_low; in audit_add_rule()
|
| D | audit.h | 107 u64 prio; member
|
| D | futex.c | 2331 int prio; in __queue_me() local
2341 prio = min(current->normal_prio, MAX_RT_PRIO); in __queue_me()
2343 plist_node_init(&q->list, prio); in __queue_me()
|
| /kernel/locking/ |
| D | rtmutex.c | 232 &(struct rt_mutex_waiter){ .prio = (p)->prio, .deadline = (p)->dl.deadline }
238 if (left->prio < right->prio) in rt_mutex_waiter_less()
247 if (dl_prio(left->prio)) in rt_mutex_waiter_less()
257 if (left->prio != right->prio) in rt_mutex_waiter_equal()
266 if (dl_prio(left->prio)) in rt_mutex_waiter_equal()
682 waiter->prio = task->prio; in rt_mutex_adjust_prio_chain()
955 waiter->prio = task->prio; in task_blocks_on_rt_mutex()
|
| D | rtmutex_common.h | 37 int prio; member
|
| D | rtmutex-debug.c | 38 printk("%16s:%5d [%p, %3d]", p->comm, task_pid_nr(p), p, p->prio); in printk_task()
|
| /kernel/trace/ |
| D | trace_sched_wakeup.c | 391 entry->prev_prio = prev->prio; in tracing_sched_switch_trace()
394 entry->next_prio = next->prio; in tracing_sched_switch_trace()
419 entry->prev_prio = curr->prio; in tracing_sched_wakeup_trace()
422 entry->next_prio = wakee->prio; in tracing_sched_wakeup_trace()
550 (!dl_task(p) && (p->prio >= wakeup_prio || p->prio >= current->prio))) in probe_wakeup()
563 (!dl_task(p) && p->prio >= wakeup_prio)) in probe_wakeup()
571 wakeup_prio = p->prio; in probe_wakeup()
|
| /kernel/power/ |
| D | qos.c | 112 return plist_first(&c->list)->prio; in pm_qos_get_value()
115 return plist_last(&c->list)->prio; in pm_qos_get_value()
119 total_value += node->prio; in pm_qos_get_value()
184 if ((req->node).prio != c->default_value) { in pm_qos_debug_show()
190 (req->node).prio, state); in pm_qos_debug_show()
355 if (new_value != req->node.prio) in __pm_qos_update_request()
454 if (new_value != req->node.prio) in pm_qos_update_request_timeout()
800 if (req->pnode.prio == new_value) in freq_qos_update_request()
|
| /kernel/rcu/ |
| D | rcutorture.c | 2138 int prio; in rcu_torture_can_boost() local
2143 prio = rcu_get_gp_kthreads_prio(); in rcu_torture_can_boost()
2144 if (!prio) in rcu_torture_can_boost()
2147 if (prio < 2) { in rcu_torture_can_boost()
|