| /kernel/liteos_a/testsuites/unittest/process/basic/process/smoke/ |
| D | process_test_043.cpp | 35 int priority; in Testcase() local
40 priority = getpriority(PRIO_PGRP, 0); in Testcase()
44 priority = getpriority(PRIO_PGRP, 0); in Testcase()
46 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
49 priority = getpriority(PRIO_USER, 0); in Testcase()
51 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
55 priority = getpriority(PRIO_USER + count, 0); in Testcase()
57 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
60 priority = setpriority(PRIO_USER + count, getpid(), currProcessPri); in Testcase()
62 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
[all …]
|
| /kernel/linux/linux-5.10/include/uapi/linux/ |
| D | dcbnl.h | 42 * @prio_tc: priority assignment table mapping 8021Qp to traffic class
52 * 0 strict priority
137 * by RPs at this priority level on this Port
169 /* priority to buffer mapping */
181 * struct cee_pg - CEE Priority-Group managed object
187 * @pg_bw: bandwidth percentage for each priority group
188 * @prio_pg: priority to PG mapping indexed by priority
226 * @priority: 3-bit unsigned integer indicating priority for IEEE
227 * 8-bit 802.1p user priority bitmap for CEE
246 __u8 priority; member
[all …]
|
| /kernel/liteos_a/kernel/base/sched/ |
| D | los_priority.c | 121 STATIC INLINE UINT32 TimeSliceCalculate(HPFRunqueue *rq, UINT16 basePrio, UINT16 priority) in TimeSliceCalculate() argument
127 readyTasks = queueList->readyTasks[priority]; in TimeSliceCalculate()
135 …NLINE VOID PriQueHeadInsert(HPFRunqueue *rq, UINT32 basePrio, LOS_DL_LIST *priQue, UINT32 priority) in PriQueHeadInsert() argument
143 * and at the same time would be deleted from priority queue or in PriQueHeadInsert()
152 if (LOS_ListEmpty(&priQueList[priority])) { in PriQueHeadInsert()
153 *bitmap |= PRIQUEUE_PRIOR0_BIT >> priority; in PriQueHeadInsert()
156 LOS_ListHeadInsert(&priQueList[priority], priQue); in PriQueHeadInsert()
157 queueList->readyTasks[priority]++; in PriQueHeadInsert()
160 …NLINE VOID PriQueTailInsert(HPFRunqueue *rq, UINT32 basePrio, LOS_DL_LIST *priQue, UINT32 priority) in PriQueTailInsert() argument
168 * and at the same time would be deleted from priority queue or in PriQueTailInsert()
[all …]
|
| /kernel/liteos_a/testsuites/kernel/sample/kernel_base/ipc/mux/full/ |
| D | It_los_mutex_026.c | 55 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskDFunc() local
56 ICUNIT_ASSERT_EQUAL_VOID(priority, 2, priority); // 2, here assert the result. in TaskDFunc()
77 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskCFunc() local
78 ICUNIT_ASSERT_EQUAL_VOID(priority, 3, priority); // 3, here assert the result. in TaskCFunc()
101 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskBFunc() local
102 ICUNIT_ASSERT_EQUAL_VOID(priority, 5, priority); // 5, here assert the result. in TaskBFunc()
121 task1.usTaskPrio = 5; // 5, set reasonable priority. in TaskAFunc()
139 task2.usTaskPrio = 3; // 3, set reasonable priority. in TaskAFunc()
156 task3.usTaskPrio = 2; // 2, set reasonable priority. in TaskAFunc()
173 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskAFunc() local
[all …]
|
| D | It_los_mutex_027.c | 55 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskD1Func() local
56 ICUNIT_ASSERT_EQUAL_VOID(priority, 2, priority); // 2, here assert the result. in TaskD1Func()
75 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskC1Func() local
76 ICUNIT_ASSERT_EQUAL_VOID(priority, 3, priority); // 3, here assert the result. in TaskC1Func()
95 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskB1Func() local
96 ICUNIT_ASSERT_EQUAL_VOID(priority, 5, priority); // 5, here assert the result. in TaskB1Func()
114 task1.usTaskPrio = 5; // 5, set reasonable priority. in TaskA1Func()
125 task2.usTaskPrio = 3; // 3, set reasonable priority. in TaskA1Func()
136 task3.usTaskPrio = 2; // 2, set reasonable priority. in TaskA1Func()
154 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskA1Func() local
[all …]
|
| D | It_los_mutex_029.c | 56 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskD3Func() local
57 ICUNIT_ASSERT_EQUAL_VOID(priority, 2, priority); // 2, here assert the result. in TaskD3Func()
75 task1.usTaskPrio = 2; // 2, set reasonable priority. in TaskC3Func()
98 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskC3Func() local
99 ICUNIT_ASSERT_EQUAL_VOID(priority, 3, priority); // 3, here assert the result. in TaskC3Func()
116 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskB3Func() local
117 ICUNIT_ASSERT_EQUAL_VOID(priority, 5, priority); // 5, here assert the result. in TaskB3Func()
133 task1.usTaskPrio = 5; // 5, set reasonable priority. in TaskA3Func()
144 task2.usTaskPrio = 3; // 3, set reasonable priority. in TaskA3Func()
165 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskA3Func() local
[all …]
|
| D | It_los_mutex_031.c | 55 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskD5Func() local
56 ICUNIT_ASSERT_EQUAL_VOID(priority, 2, priority); // 2, here assert the result. in TaskD5Func()
76 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskC5Func() local
77 ICUNIT_ASSERT_EQUAL_VOID(priority, 3, priority); // 3, here assert the result. in TaskC5Func()
98 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskB5Func() local
99 ICUNIT_ASSERT_EQUAL_VOID(priority, 5, priority); // 5, here assert the result. in TaskB5Func()
121 task1.usTaskPrio = 5; // 5, set reasonable priority. in TaskA5Func()
132 task2.usTaskPrio = 3; // 3, set reasonable priority. in TaskA5Func()
143 task3.usTaskPrio = 2; // 2, set reasonable priority. in TaskA5Func()
164 UINT16 priority = LOS_TaskPriGet(OsCurrTaskGet()->taskID); in TaskA5Func() local
[all …]
|
| /kernel/linux/linux-5.10/arch/mips/kvm/ |
| D | interrupt.c | 24 void kvm_mips_queue_irq(struct kvm_vcpu *vcpu, unsigned int priority) in kvm_mips_queue_irq() argument
26 set_bit(priority, &vcpu->arch.pending_exceptions); in kvm_mips_queue_irq()
29 void kvm_mips_dequeue_irq(struct kvm_vcpu *vcpu, unsigned int priority) in kvm_mips_dequeue_irq() argument
31 clear_bit(priority, &vcpu->arch.pending_exceptions); in kvm_mips_dequeue_irq()
77 /* Deliver the interrupt of the corresponding priority, if possible. */
78 int kvm_mips_irq_deliver_cb(struct kvm_vcpu *vcpu, unsigned int priority, in kvm_mips_irq_deliver_cb() argument
87 if (priority == MIPS_EXC_MAX) in kvm_mips_irq_deliver_cb()
90 ie = 1 << (kvm_priority_to_irq[priority] + 8); in kvm_mips_irq_deliver_cb()
125 clear_bit(priority, &vcpu->arch.pending_exceptions); in kvm_mips_irq_deliver_cb()
131 int kvm_mips_irq_clear_cb(struct kvm_vcpu *vcpu, unsigned int priority, in kvm_mips_irq_clear_cb() argument
[all …]
|
| /kernel/linux/linux-5.10/Documentation/locking/ |
| D | rt-mutex-design.rst | 16 The goal of this document is to help others understand the priority
21 Unbounded Priority Inversion
24 Priority inversion is when a lower priority process executes while a higher
25 priority process wants to run. This happens for several reasons, and
26 most of the time it can't be helped. Anytime a high priority process wants
27 to use a resource that a lower priority process has (a mutex for example),
28 the high priority process must wait until the lower priority process is done
29 with the resource. This is a priority inversion. What we want to prevent
30 is something called unbounded priority inversion. That is when the high
31 priority process is prevented from running by a lower priority process for
[all …]
|
| D | rt-mutex.rst | 5 RT-mutexes with priority inheritance are used to support PI-futexes,
6 which enable pthread_mutex_t priority inheritance attributes
16 RT-mutexes extend the semantics of simple mutexes by the priority
19 A low priority owner of a rt-mutex inherits the priority of a higher
20 priority waiter until the rt-mutex is released. If the temporarily
21 boosted owner blocks on a rt-mutex itself it propagates the priority
23 priority boosting is immediately removed once the rt_mutex has been
27 mutexes which protect shared resources. Priority inheritance is not a
30 an high priority thread, without losing determinism.
33 priority order. For same priorities FIFO order is chosen. For each
[all …]
|
| /kernel/liteos_m/testsuites/sample/kernel/mux/ |
| D | It_los_mutex_026.c | 53 // 3, Here, assert that priority is equal to 3. in TaskFuncC()
54 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 3, g_losTask.runTask->priority); in TaskFuncC()
78 // 5, Here, assert that priority is equal to 5. in TaskFuncB()
79 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncB()
98 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
116 // 3, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
141 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
142 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
152 // 25, Here, assert that priority is equal to 25. in Testcase()
153 ICUNIT_ASSERT_EQUAL(g_losTask.runTask->priority, 25, g_losTask.runTask->priority); in Testcase()
[all …]
|
| D | It_los_mutex_027.c | 52 // 3, Here, assert that priority is equal to 3. in TaskFuncC()
53 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 3, g_losTask.runTask->priority); in TaskFuncC()
73 // 5, Here, assert that priority is equal to 5. in TaskFuncB()
74 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncB()
91 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
101 // 3, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
118 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
119 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
135 // 10, Set the priority according to the task purpose,a smaller number means a higher priority. in Testcase()
144 // 25, Here, assert that priority is equal to 25. in Testcase()
[all …]
|
| D | It_los_mutex_033.c | 51 // 5, Here, assert that priority is equal to 5. in TaskFuncC()
52 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncC()
72 // 8, Here, assert that priority is equal to 8. in TaskFuncB()
73 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 8, g_losTask.runTask->priority); in TaskFuncB()
94 // 8, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
104 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
118 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
119 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
134 // 10, Set the priority according to the task purpose,a smaller number means a higher priority. in Testcase()
150 // 25, Here, assert that priority is equal to 25. in Testcase()
[all …]
|
| D | It_los_mutex_034.c | 53 // 5, Here, assert that priority is equal to 5. in TaskFuncC()
54 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncC()
74 // 8, Here, assert that priority is equal to 8. in TaskFuncB()
75 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 8, g_losTask.runTask->priority); in TaskFuncB()
92 // 8, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
102 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
116 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
117 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
132 // 10, Set the priority according to the task purpose,a smaller number means a higher priority. in Testcase()
147 // 25, Here, assert that priority is equal to 25. in Testcase()
[all …]
|
| D | It_los_mutex_031.c | 51 // 3, Here, assert that priority is equal to 3. in TaskFuncC()
52 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 3, g_losTask.runTask->priority); in TaskFuncC()
70 // 5, Here, assert that priority is equal to 5. in TaskFuncB()
71 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncB()
92 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
102 // 3, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
121 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
122 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
141 // 10, Set the priority according to the task purpose,a smaller number means a higher priority. in Testcase()
157 // 25, Here, assert that priority is equal to 25. in Testcase()
[all …]
|
| D | It_los_mutex_029.c | 52 // 2, Here, assert that priority is equal to 2. in TaskFuncD()
53 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 2, g_losTask.runTask->priority); in TaskFuncD()
73 // 5, Here, assert that priority is equal to 5. in TaskFuncC()
74 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncC()
90 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
106 // 2, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
124 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
125 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
139 // 10, Set the priority according to the task purpose,a smaller number means a higher priority. in Testcase()
153 // 25, Here, assert that priority is equal to 25. in Testcase()
[all …]
|
| D | It_los_mutex_030.c | 51 // 3, Here, assert that priority is equal to 3. in TaskFuncC()
52 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 3, g_losTask.runTask->priority); in TaskFuncC()
67 // 5, Here, assert that priority is equal to 5. in TaskFuncB()
68 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 5, g_losTask.runTask->priority); in TaskFuncB()
85 // 5, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
95 // 3, Set the priority according to the task purpose,a smaller number means a higher priority. in TaskFuncA()
118 // 10, Here, assert that priority is equal to 10. in TaskFuncA()
119 ICUNIT_ASSERT_EQUAL_VOID(g_losTask.runTask->priority, 10, g_losTask.runTask->priority); in TaskFuncA()
132 // 10, Set the priority according to the task purpose,a smaller number means a higher priority. in Testcase()
145 // 25, Here, assert that priority is equal to 25. in Testcase()
[all …]
|
| /kernel/uniproton/src/core/kernel/task/ |
| D | prt_amp_task_internal.h | 29 TskPrior priority; in OsGetReadyList() local
34 priority = tsk->priority; in OsGetReadyList()
36 readyList = &runQue->readyList[priority]; in OsGetReadyList()
44 *tskReadyListBitMap |= OS_SET_RDY_TSK_BIT_MAP(priority); in OsGetReadyList()
47 tskChildBitMap[priority >> OS_TSK_PRIO_BIT_MAP_POW] |= OS_SET_CHILD_BIT_MAP(priority); in OsGetReadyList()
73 TskPrior priority; in OsDequeueTaskAmp() local
78 priority = tsk->priority; in OsDequeueTaskAmp()
79 readyList = &runQue->readyList[priority]; in OsDequeueTaskAmp()
90 tskChildBitMap[priority >> OS_TSK_PRIO_BIT_MAP_POW] &= OS_CLR_CHILD_BIT_MAP(priority); in OsDequeueTaskAmp()
93 if (tskChildBitMap[priority >> OS_TSK_PRIO_BIT_MAP_POW] == 0) { in OsDequeueTaskAmp()
[all …]
|
| /kernel/linux/linux-5.10/samples/bpf/ |
| D | test_cgrp2_sock.sh | 96 check_sock "dev , mark 0, priority 0" "No programs attached"
97 check_sock6 "dev , mark 0, priority 0" "No programs attached"
105 check_sock "dev cgrp2_sock, mark 0, priority 0" "Device set"
106 check_sock6 "dev cgrp2_sock, mark 0, priority 0" "Device set"
114 check_sock "dev , mark 666, priority 0" "Mark set"
115 check_sock6 "dev , mark 666, priority 0" "Mark set"
117 # verify priority is set
121 cleanup_and_exit 1 "Failed to install program to set priority"
123 check_sock "dev , mark 0, priority 123" "Priority set"
124 check_sock6 "dev , mark 0, priority 123" "Priority set"
[all …]
|
| /kernel/linux/linux-5.10/Documentation/userspace-api/media/v4l/ |
| D | vidioc-g-priority.rst | 13 VIDIOC_G_PRIORITY - VIDIOC_S_PRIORITY - Query or request the access priority associated with a file…
38 To query the current access priority applications call the
40 variable where the driver stores the current priority.
42 To request an access priority applications store the desired priority in
60 - Lowest priority, usually applications running in background, for
63 read from a device at this priority.
69 - Medium priority, usually applications started and interactively
72 controls. This is the default priority unless an application
76 - Highest priority. Only one file descriptor can have this priority,
88 The requested priority value is invalid.
[all …]
|
| /kernel/linux/linux-5.10/net/mac80211/ |
| D | wme.c | 35 switch (skb->priority) { in wme_downgrade_ac()
38 skb->priority = 5; /* VO -> VI */ in wme_downgrade_ac()
42 skb->priority = 3; /* VI -> BE */ in wme_downgrade_ac()
46 skb->priority = 2; /* BE -> BK */ in wme_downgrade_ac()
89 while (sdata->wmm_acm & BIT(skb->priority)) { in ieee80211_downgrade_queue()
90 int ac = ieee802_1d_to_ac[skb->priority]; in ieee80211_downgrade_queue()
93 skb->priority == ifmgd->tx_tspec[ac].up) in ieee80211_downgrade_queue()
108 if (sta && sta->reserved_tid == skb->priority) in ieee80211_downgrade_queue()
109 skb->priority = ieee80211_fix_reserved_tid(skb->priority); in ieee80211_downgrade_queue()
112 return ieee802_1d_to_ac[skb->priority]; in ieee80211_downgrade_queue()
[all …]
|
| /kernel/liteos_a/testsuites/unittest/libc/posix/pthread/full/ |
| D | It_posix_pthread_193.cpp | 50 INT32 priority = 31; in Testcase() local
62 priority = sched_get_priority_max(g_pthreadSchedPolicy); in Testcase()
63 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
67 priority = sched_get_priority_max(g_pthreadSchedPolicy); in Testcase()
68 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
72 priority = sched_get_priority_max(g_pthreadSchedPolicy); in Testcase()
73 ICUNIT_ASSERT_EQUAL(priority, -1, priority); in Testcase()
76 priority = 31; in Testcase()
77 param.sched_priority = priority + 1; in Testcase()
|
| /kernel/linux/linux-5.10/include/trace/events/ |
| D | vmscan.h | 189 int priority),
192 priority),
203 __field(int, priority)
215 __entry->priority = priority;
218 … nid: %d objects to shrink %ld gfp_flags %s cache items %ld delta %lld total_scan %ld priority %d",
227 __entry->priority)
343 unsigned long nr_deactivated, int priority),
345 TP_ARGS(nid, nr_taken, nr_deactivated, priority),
351 __field(int, priority)
358 __entry->priority = priority;
[all …]
|
| /kernel/linux/linux-5.10/Documentation/admin-guide/pm/ |
| D | intel-speed-select.rst | 302 allows users to define per core priority. This defines a mechanism to distribute
309 service and hence an associated priority. The granularity is at core level not
316 and use a priority type. There is a default per platform priority type, which
325 Clos Enable: Specify priority type with [--priority|-p]
328 There are two types of priority types:
332 Priority for ordered throttling is defined based on the index of the assigned
333 CLOS group. Where CLOS0 gets highest priority (throttled last).
335 Priority order is:
340 When proportional priority is used, there is an additional parameter called
342 proportional priority is to provide each core with the requested min., then
[all …]
|
| /kernel/linux/linux-5.10/Documentation/devicetree/bindings/interrupt-controller/ |
| D | ti,c64x+megamod-pic.txt | 7 C64X+ core. Priority 0 and 1 are used for reset and NMI respectively.
8 Priority 2 and 3 are reserved. Priority 4-15 are used for interrupt
18 Single cell specifying the core interrupt priority level (4-15) where
19 4 is highest priority and 15 is lowest priority.
37 One for each core interrupt priority level. In addition to the combined
50 The cells contain the core priority interrupt to which the
56 priority interrupts. The first cell corresponds to
57 core priority 4 and the last cell corresponds to
58 core priority 15. The value of each cell is the
70 be the core priority level, not the megamodule interrupt number.
[all …]
|