| /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 …]
|
| /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 …]
|
| /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 …]
|
| /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 …]
|
| /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 …]
|
| /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 …]
|
| /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 …]
|
| /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 …]
|
| /linux-5.10/tools/power/cpupower/bench/ |
| D | system.c | 94 * sets the process priority parameter
96 * @param priority priority value
99 * @retval -1 when setting the priority failed
102 int set_process_priority(int priority) in set_process_priority() argument
106 dprintf("set scheduler priority to %i\n", priority); in set_process_priority()
108 param.sched_priority = priority; in set_process_priority()
112 fprintf(stderr, "warning: unable to set scheduler priority\n"); in set_process_priority()
146 * sets up the cpu affinity and scheduler priority
162 printf("high priority condition requested\n"); in prepare_system()
168 printf("low priority condition requested\n"); in prepare_system()
[all …]
|
| /linux-5.10/Documentation/virt/kvm/devices/ |
| D | xics.rst | 47 * Pending interrupt priority, 8 bits
48 Zero is the highest priority, 255 means no interrupt is pending.
50 * Pending IPI (inter-processor interrupt) priority, 8 bits
51 Zero is the highest priority, 255 means no IPI is pending.
56 * Current processor priority, 8 bits
57 Zero is the highest priority, meaning no interrupts can be
58 delivered, and 255 is the lowest priority.
71 * Priority, 8 bits
73 This is the priority specified for this interrupt source, where 0 is
74 the highest priority and 255 is the lowest. An interrupt with a
[all …]
|
| /linux-5.10/Documentation/admin-guide/cgroup-v1/ |
| D | net_prio.rst | 2 Network priority cgroup
5 The Network priority cgroup provides an interface to allow an administrator to
6 dynamically set the priority of network traffic generated by various
9 Nominally, an application would set the priority of its traffic via the
13 2) The priority of application traffic is often a site-specific administrative
17 the priority of egress traffic on a given interface. Network priority groups can
36 It contains a list of tuples in the form <ifname priority>. Contents of this
43 iscsi net_prio cgroup and egressing on interface eth0 to have the priority of
46 priority.
|
| /linux-5.10/drivers/net/ethernet/sfc/ |
| D | efx.h | 85 * existing filter with equal priority
94 * 1. If the existing filters have lower priority, or @replace_equal
95 * is set and they have equal priority, replace them.
97 * 2. If the existing filters have higher priority, return -%EPERM.
103 * all be inserted with the same priority and @replace_equal = %false.
115 * @priority: Priority of filter, as passed to @efx_filter_insert_filter
122 enum efx_filter_priority priority, in efx_filter_remove_id_safe() argument
125 return efx->type->filter_remove_safe(efx, priority, filter_id); in efx_filter_remove_id_safe()
131 * @priority: Priority of filter, as passed to @efx_filter_insert_filter
140 enum efx_filter_priority priority, in efx_filter_get_filter_safe() argument
[all …]
|
| /linux-5.10/drivers/gpu/drm/i915/ |
| D | i915_scheduler.c | 58 GEM_BUG_ON(p->priority > last_prio); in assert_priolists()
59 last_prio = p->priority; in assert_priolists()
83 /* buckets sorted from highest [in slot 0] to lowest priority */ in i915_sched_lookup_priolist()
90 /* most positive priority is scheduled first, equal priorities fifo */ in i915_sched_lookup_priolist()
96 if (prio > p->priority) { in i915_sched_lookup_priolist()
98 } else if (prio < p->priority) { in i915_sched_lookup_priolist()
110 /* Convert an allocation failure to a priority bump */ in i915_sched_lookup_priolist()
127 p->priority = prio; in i915_sched_lookup_priolist()
177 return rq->sched.attr.priority; in rq_prio()
184 * not allow low priority tasks to preempt other low priority in need_preempt()
[all …]
|
| /linux-5.10/drivers/net/ethernet/intel/ixgbe/ |
| D | ixgbe_dcb_82599.c | 15 * @prio_type: priority type indexed by traffic class
16 * @prio_tc: priority to tc assignments indexed by priority
45 /* Configure traffic class credits and priority */ in ixgbe_dcb_config_rx_arbiter_82599()
75 * @prio_type: priority type indexed by traffic class
94 /* Configure traffic class credits and priority */ in ixgbe_dcb_config_tx_desc_arbiter_82599()
126 * @prio_type: priority type indexed by traffic class
127 * @prio_tc: priority to tc assignments indexed by priority
156 /* Configure traffic class credits and priority */ in ixgbe_dcb_config_tx_data_arbiter_82599()
183 * ixgbe_dcb_config_pfc_82599 - Configure priority flow control
186 * @prio_tc: priority to tc assignments indexed by priority
[all …]
|
| /linux-5.10/include/linux/ |
| D | plist.h | 3 * Descending-priority-sorted double-linked list
18 * This is a priority-sorted list of nodes; each node has a
19 * priority from INT_MIN (highest) to INT_MAX (lowest).
21 * Addition is O(K), removal is O(1), change of priority of a node is
22 * O(K) and K is the number of RT priority levels used in the system.
27 * - The tier 1 list is the prio_list, different priority nodes.
45 * The nodes on the prio_list list are sorted by priority to simplify
49 * The nodes on the node_list are ordered by priority and can contain
50 * entries which have the same priority. Those entries are ordered
54 * for the priority of the node and insert it before the node_list
[all …]
|
| /linux-5.10/drivers/net/ethernet/sfc/falcon/ |
| D | efx.h | 87 * existing filter with equal priority
96 * 1. If the existing filters have lower priority, or @replace_equal
97 * is set and they have equal priority, replace them.
99 * 2. If the existing filters have higher priority, return -%EPERM.
105 * all be inserted with the same priority and @replace_equal = %false.
117 * @priority: Priority of filter, as passed to @ef4_filter_insert_filter
124 enum ef4_filter_priority priority, in ef4_filter_remove_id_safe() argument
127 return efx->type->filter_remove_safe(efx, priority, filter_id); in ef4_filter_remove_id_safe()
133 * @priority: Priority of filter, as passed to @ef4_filter_insert_filter
142 enum ef4_filter_priority priority, in ef4_filter_get_filter_safe() argument
[all …]
|
| /linux-5.10/include/linux/sched/ |
| D | prio.h | 10 * Priority of a process goes from 0..MAX_PRIO-1, valid RT
11 * priority is 0..MAX_RT_PRIO-1, and SCHED_NORMAL/SCHED_BATCH
12 * tasks are in the range MAX_RT_PRIO..MAX_PRIO-1. Priority
13 * values are inverted: lower p->prio value means higher priority.
16 * RT priority to be separate from the value exported to
18 * priority to a value higher than any user task. Note:
30 * to static priority [ MAX_RT_PRIO..MAX_PRIO-1 ],
37 * 'User priority' is the nice value converted to something we
|
| /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 struct reclaim_stat *stat, int priority, int file),
345 TP_ARGS(nid, nr_scanned, nr_reclaimed, stat, priority, file),
359 __field(int, priority)
375 __entry->priority = priority;
[all …]
|
| /linux-5.10/Documentation/vm/ |
| D | swap_numa.rst | 15 Swap device has priority and that decides the order of it to be used. To make
16 use of automatically binding, there is no need to manipulate priority settings
65 The current code uses a priority based list, swap_avail_list, to decide
67 priority, they are used round robin. This change here replaces the single
69 it sees its own priority based list of available swap devices. Swap
70 device's priority can be promoted on its matching node's swap_avail_list.
72 The current swap device's priority is set as: user can set a >=0 value,
73 or the system will pick one starting from -1 then downwards. The priority
76 the semantics for priority >=0 cases, the previous starting from -1 then
79 node, they will all be promoted to priority -1 on that node's plist and will
|
| /linux-5.10/drivers/gpu/drm/amd/amdgpu/ |
| D | amdgpu_sched.c | 56 WARN(1, "Invalid context priority %d\n", amdgpu_priority); in amdgpu_to_sched_priority()
65 enum drm_sched_priority priority) in amdgpu_sched_process_priority_override() argument
83 amdgpu_ctx_priority_override(ctx, priority); in amdgpu_sched_process_priority_override()
92 enum drm_sched_priority priority) in amdgpu_sched_context_priority_override() argument
115 amdgpu_ctx_priority_override(ctx, priority); in amdgpu_sched_context_priority_override()
127 enum drm_sched_priority priority; in amdgpu_sched_ioctl() local
141 r = amdgpu_to_sched_priority(args->in.priority, &priority); in amdgpu_sched_ioctl()
149 priority); in amdgpu_sched_ioctl()
155 priority); in amdgpu_sched_ioctl()
|
| D | amdgpu_ctx.c | 47 enum drm_sched_priority priority) in amdgpu_ctx_priority_permit() argument
49 if (priority < 0 || priority >= DRM_SCHED_PRIORITY_COUNT) in amdgpu_ctx_priority_permit()
53 if (priority <= DRM_SCHED_PRIORITY_NORMAL) in amdgpu_ctx_priority_permit()
100 enum drm_sched_priority priority; in amdgpu_ctx_init_entity() local
109 priority = (ctx->override_priority == DRM_SCHED_PRIORITY_UNSET) ? in amdgpu_ctx_init_entity()
111 hw_prio = amdgpu_ctx_prio_sched_to_hw(adev, priority, hw_ip); in amdgpu_ctx_init_entity()
127 r = drm_sched_entity_init(&entity->entity, priority, scheds, num_scheds, in amdgpu_ctx_init_entity()
142 enum drm_sched_priority priority, in amdgpu_ctx_init() argument
148 r = amdgpu_ctx_priority_permit(filp, priority); in amdgpu_ctx_init()
163 ctx->init_priority = priority; in amdgpu_ctx_init()
[all …]
|
| /linux-5.10/lib/ |
| D | parman.c | 2 * lib/parman.c - Manager for linear priority array areas
237 * with the same priority. Consider following example:
248 * In this example, there are 3 priority chunks. The order of the priorities
249 * matters, however the order of items within a single priority chunk does not
261 * The goal of parman is to maintain the priority ordering. The caller
298 * parman_prio_init - initializes a parman priority chunk
301 * @prority: desired priority of the chunk
305 * Before caller could add an item with certain priority, he has to
306 * initialize a priority chunk for it using this function.
309 unsigned long priority) in parman_prio_init() argument
[all …]
|
| /linux-5.10/drivers/gpu/drm/i915/gt/ |
| D | intel_engine_heartbeat.c | 56 rq->sched.attr.priority); in show_heartbeat()
62 .priority = I915_USER_PRIORITY(I915_PRIORITY_MIN), in heartbeat()
98 rq->sched.attr.priority < I915_PRIORITY_BARRIER) { in heartbeat()
100 * Gradually raise the priority of the heartbeat to in heartbeat()
101 * give high priority work [which presumably desires in heartbeat()
105 attr.priority = I915_PRIORITY_MASK; in heartbeat()
106 if (rq->sched.attr.priority >= attr.priority) in heartbeat()
107 attr.priority |= I915_USER_PRIORITY(I915_PRIORITY_HEARTBEAT); in heartbeat()
108 if (rq->sched.attr.priority >= attr.priority) in heartbeat()
109 attr.priority = I915_PRIORITY_BARRIER; in heartbeat()
[all …]
|
| /linux-5.10/kernel/sched/ |
| D | cpupri.c | 5 * CPU priority management
11 * This code tracks the priority of each CPU so that global migration
16 * going from the lowest priority to the highest. CPUs in the INVALID state
18 * a 2 dimensional bitmap (the first for priority class, the second for CPUs
68 * priority. in __cpupri_find()
88 * priority level and continue on. in __cpupri_find()
116 * priority configuration.
144 * If no CPU at the current priority can fit the task in cpupri_find_fitness()
157 * This rule favours honouring priority over fitting the task in the in cpupri_find_fitness()
159 * The idea is that if a higher priority task can run, then it should in cpupri_find_fitness()
[all …]
|