| /kernel/sched/ |
| D | rt.c | 281 return rq->online && rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()
392 plist_node_init(&p->pushable_tasks, p->prio); in enqueue_pushable_task()
396 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
397 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
408 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
557 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
592 return p->prio != p->normal_prio; in rt_se_boosted()
961 return rt_task_of(rt_se)->prio; in rt_se_prio()
1106 inc_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) in inc_rt_prio_smp() argument
1117 if (rq->online && prio < prev_prio) in inc_rt_prio_smp()
[all …]
|
| D | cpupri.c | 43 static int convert_prio(int prio) in convert_prio() argument
47 switch (prio) { in convert_prio()
53 cpupri = MAX_RT_PRIO-1 - prio; /* 1 ... 99 */ in convert_prio()
175 int task_pri = convert_prio(p->prio); in cpupri_find_fitness()
|
| D | core.c | 112 if (rt_prio(p->prio)) /* includes deadline */ in __task_prio()
113 return p->prio; /* [-1, 99] */ in __task_prio()
1234 int prio = p->static_prio - MAX_RT_PRIO; in set_load_weight() local
1251 reweight_task(p, prio); in set_load_weight()
1253 load->weight = scale_load(sched_prio_to_weight[prio]); in set_load_weight()
1254 load->inv_weight = sched_prio_to_wmult[prio]; in set_load_weight()
2064 int prio; in __normal_prio() local
2067 prio = MAX_DL_PRIO - 1; in __normal_prio()
2069 prio = MAX_RT_PRIO - 1 - rt_prio; in __normal_prio()
2071 prio = NICE_TO_PRIO(nice); in __normal_prio()
[all …]
|
| D | deadline.c | 1444 int prio = dl_task_of(dl_se)->prio; in inc_dl_tasks() local
1447 WARN_ON(!dl_prio(prio)); in inc_dl_tasks()
1458 int prio = dl_task_of(dl_se)->prio; in dec_dl_tasks() local
1460 WARN_ON(!dl_prio(prio)); in dec_dl_tasks()
|
| D | debug.c | 538 p->prio); in print_task()
1032 P(prio); in proc_sched_show_task()
|
| D | fair.c | 3119 void reweight_task(struct task_struct *p, int prio) in reweight_task() argument
3124 unsigned long weight = scale_load(sched_prio_to_weight[prio]); in reweight_task()
3127 load->inv_weight = sched_prio_to_wmult[prio]; in reweight_task()
11519 if (p->prio > oldprio) in prio_changed_fair()
|
| D | sched.h | 2372 extern void reweight_task(struct task_struct *p, int prio);
|
| /kernel/ |
| D | tracepoint.c | 181 int prio) in func_add() argument
214 if (pos < 0 && old[iter_probes].prio < prio) in func_add()
324 struct tracepoint_func *func, int prio, in tracepoint_add_func() argument
338 old = func_add(&tp_funcs, func, prio); in tracepoint_add_func()
473 void *data, int prio) in tracepoint_probe_register_prio_may_exist() argument
481 tp_func.prio = prio; in tracepoint_probe_register_prio_may_exist()
482 ret = tracepoint_add_func(tp, &tp_func, prio, false); in tracepoint_probe_register_prio_may_exist()
502 void *data, int prio) in tracepoint_probe_register_prio() argument
510 tp_func.prio = prio; in tracepoint_probe_register_prio()
511 ret = tracepoint_add_func(tp, &tp_func, prio, true); in tracepoint_probe_register_prio()
|
| D | auditsc.c | 233 if (!ctx->prio) { in audit_set_auditable()
234 ctx->prio = 1; in audit_set_auditable()
750 if (rule->prio <= ctx->prio) in audit_filter_rules()
756 ctx->prio = rule->prio; in audit_filter_rules()
932 context->prio = state == AUDIT_STATE_RECORD ? ~0ULL : 0; in audit_alloc_context()
1735 context->prio = 0; in __audit_syscall_entry()
1806 context->prio = context->state == AUDIT_STATE_RECORD ? ~0ULL : 0; in __audit_syscall_exit()
2272 if (!ctx->prio) { in auditsc_get_stamp()
2273 ctx->prio = 1; in auditsc_get_stamp()
|
| D | auditfilter.c | 830 new->prio = old->prio; in audit_dupe_rule()
982 entry->rule.prio = ~0ULL; in audit_add_rule()
985 entry->rule.prio = ++prio_high; in audit_add_rule()
987 entry->rule.prio = --prio_low; in audit_add_rule()
|
| D | audit.h | 110 u64 prio; member
|
| /kernel/locking/ |
| D | rtmutex.c | 327 int prio = task->prio; in __waiter_prio() local
334 if (!rt_prio(prio)) in __waiter_prio()
337 return prio; in __waiter_prio()
343 waiter->prio = __waiter_prio(task); in waiter_update_prio()
351 &(struct rt_mutex_waiter){ .prio = __waiter_prio(p), .deadline = (p)->dl.deadline }
356 if (left->prio < right->prio) in rt_mutex_waiter_less()
365 if (dl_prio(left->prio)) in rt_mutex_waiter_less()
374 if (left->prio != right->prio) in rt_mutex_waiter_equal()
383 if (dl_prio(left->prio)) in rt_mutex_waiter_equal()
397 trace_android_vh_rt_mutex_steal(waiter->prio, top_waiter->prio, &ret); in rt_mutex_steal()
[all …]
|
| D | ww_mutex.h | 237 int a_prio = a->task->prio; in __ww_ctx_less()
238 int b_prio = b->task->prio; in __ww_ctx_less()
|
| D | rtmutex_common.h | 39 int prio; member
|
| /kernel/trace/ |
| D | trace_sched_wakeup.c | 390 entry->prev_prio = prev->prio; in tracing_sched_switch_trace()
393 entry->next_prio = next->prio; in tracing_sched_switch_trace()
418 entry->prev_prio = curr->prio; in tracing_sched_wakeup_trace()
421 entry->next_prio = wakee->prio; in tracing_sched_wakeup_trace()
548 (!dl_task(p) && (p->prio >= wakeup_prio || p->prio >= current->prio))) in probe_wakeup()
562 (!dl_task(p) && p->prio >= wakeup_prio)) in probe_wakeup()
570 wakeup_prio = p->prio; in probe_wakeup()
|
| /kernel/power/ |
| D | qos.c | 68 return plist_first(&c->list)->prio; in pm_qos_get_value()
71 return plist_last(&c->list)->prio; in pm_qos_get_value()
305 if (new_value == req->node.prio) in cpu_latency_qos_update_request()
578 if (req->pnode.prio == new_value) in freq_qos_update_request()
|
| /kernel/rcu/ |
| D | rcutorture.c | 2688 int prio; in rcu_torture_can_boost() local
2695 prio = rcu_get_gp_kthreads_prio(); in rcu_torture_can_boost()
2696 if (!prio) in rcu_torture_can_boost()
2699 if (prio < 2) { in rcu_torture_can_boost()
|
| /kernel/futex/ |
| D | core.c | 2492 int prio; in __queue_me() local
2503 prio = min(current->normal_prio, MAX_RT_PRIO); in __queue_me()
2505 plist_node_init(&q->list, prio); in __queue_me()
|