| /kernel/ |
| D | tracepoint.c | 181 int prio) in func_add() argument
197 if (pos < 0 && old[nr_probes].prio < prio) in func_add()
219 if (pos < 0 && old[nr_probes].prio < prio) in func_add()
303 old[i].prio = in func_remove()
304 old[i + 1].prio; in func_remove()
306 old[i].prio = -1; in func_remove()
345 struct tracepoint_func *func, int prio, in tracepoint_add_func() argument
359 old = func_add(&tp_funcs, func, prio); in tracepoint_add_func()
494 void *data, int prio) in tracepoint_probe_register_prio_may_exist() argument
502 tp_func.prio = prio; in tracepoint_probe_register_prio_may_exist()
[all …]
|
| D | auditsc.c | 234 if (!ctx->prio) { in audit_set_auditable()
235 ctx->prio = 1; in audit_set_auditable()
746 if (rule->prio <= ctx->prio) in audit_filter_rules()
752 ctx->prio = rule->prio; in audit_filter_rules()
929 context->prio = state == AUDIT_RECORD_CONTEXT ? ~0ULL : 0; in audit_alloc_context()
1726 context->prio = 0; in __audit_syscall_entry()
1798 context->prio = context->state == AUDIT_RECORD_CONTEXT ? ~0ULL : 0; in __audit_syscall_exit()
2275 if (!ctx->prio) { in auditsc_get_stamp()
2276 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 | 107 u64 prio; member
|
| D | cpu.c | 1196 if (current->prio < MAX_RT_PRIO) { in pause_reduce_prio()
1199 prev_prio = current->prio; in pause_reduce_prio()
|
| /kernel/sched/ |
| D | rt.c | 275 return rq->rt.highest_prio.curr > prev->prio; in need_pull_rt_task()
386 plist_node_init(&p->pushable_tasks, p->prio); in enqueue_pushable_task()
390 if (p->prio < rq->rt.highest_prio.next) in enqueue_pushable_task()
391 rq->rt.highest_prio.next = p->prio; in enqueue_pushable_task()
402 rq->rt.highest_prio.next = p->prio; in dequeue_pushable_task()
550 if (rt_rq->highest_prio.curr < curr->prio) in sched_rt_rq_enqueue()
585 return p->prio != p->normal_prio; in rt_se_boosted()
953 return rt_task_of(rt_se)->prio; in rt_se_prio()
1098 inc_rt_prio_smp(struct rt_rq *rt_rq, int prio, int prev_prio) in inc_rt_prio_smp() argument
1109 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()
151 int task_pri = convert_prio(p->prio); in cpupri_find_fitness()
|
| D | core.c | 887 int prio = p->static_prio - MAX_RT_PRIO; in set_load_weight() local
904 reweight_task(p, prio); in set_load_weight()
906 load->weight = scale_load(sched_prio_to_weight[prio]); in set_load_weight()
907 load->inv_weight = sched_prio_to_wmult[prio]; in set_load_weight()
1706 int prio; in __normal_prio() local
1709 prio = MAX_DL_PRIO - 1; in __normal_prio()
1711 prio = MAX_RT_PRIO - 1 - rt_prio; in __normal_prio()
1713 prio = NICE_TO_PRIO(nice); in __normal_prio()
1715 return prio; in __normal_prio()
1745 if (!rt_prio(p->prio)) in effective_prio()
[all …]
|
| D | deadline.c | 1438 int prio = dl_task_of(dl_se)->prio; in inc_dl_tasks() local
1441 WARN_ON(!dl_prio(prio)); in inc_dl_tasks()
1452 int prio = dl_task_of(dl_se)->prio; in dec_dl_tasks() local
1454 WARN_ON(!dl_prio(prio)); in dec_dl_tasks()
|
| D | debug.c | 519 p->prio); in print_task()
1019 P(prio); in proc_sched_show_task()
|
| D | sched.h | 1996 extern void reweight_task(struct task_struct *p, int prio);
|
| D | fair.c | 3132 void reweight_task(struct task_struct *p, int prio) in reweight_task() argument
3137 unsigned long weight = scale_load(sched_prio_to_weight[prio]); in reweight_task()
3140 load->inv_weight = sched_prio_to_wmult[prio]; in reweight_task()
11199 if (p->prio > oldprio) in prio_changed_fair()
|
| /kernel/locking/ |
| D | rtmutex.c | 231 &(struct rt_mutex_waiter){ .prio = (p)->prio, .deadline = (p)->dl.deadline }
237 if (left->prio < right->prio) in rt_mutex_waiter_less()
246 if (dl_prio(left->prio)) in rt_mutex_waiter_less()
256 if (left->prio != right->prio) in rt_mutex_waiter_equal()
265 if (dl_prio(left->prio)) in rt_mutex_waiter_equal()
681 waiter->prio = task->prio; in rt_mutex_adjust_prio_chain()
954 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 | 393 entry->prev_prio = prev->prio; in tracing_sched_switch_trace()
396 entry->next_prio = next->prio; in tracing_sched_switch_trace()
421 entry->prev_prio = curr->prio; in tracing_sched_wakeup_trace()
424 entry->next_prio = wakee->prio; in tracing_sched_wakeup_trace()
552 (!dl_task(p) && (p->prio >= wakeup_prio || p->prio >= current->prio))) in probe_wakeup()
565 (!dl_task(p) && p->prio >= wakeup_prio)) in probe_wakeup()
573 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 | 2365 int prio; in rcu_torture_can_boost() local
2370 prio = rcu_get_gp_kthreads_prio(); in rcu_torture_can_boost()
2371 if (!prio) in rcu_torture_can_boost()
2374 if (prio < 2) { in rcu_torture_can_boost()
|
| /kernel/futex/ |
| D | core.c | 2242 int prio; in __queue_me() local
2253 prio = min(current->normal_prio, MAX_RT_PRIO); in __queue_me()
2255 plist_node_init(&q->list, prio); in __queue_me()
|