| /linux/drivers/md/dm-vdo/ |
| H A D | priority-table.c | 6 #include "priority-table.h"
16 /* We use a single 64-bit search vector, so the maximum priority is 63 */
20 * All the entries with the same priority are queued in a circular list in a bucket for that
21 * priority. The table is essentially an array of buckets.
25 * The head of a queue of table entries, all having the same priority
28 /* The priority of all the entries in this bucket */
29 unsigned int priority; member
33 * A priority table is an array of buckets, indexed by priority. New entries are added to the end
34 * of the queue in the appropriate bucket. The dequeue operation finds the highest-priority
39 /* The maximum priority of entries that may be stored in this table */
[all …]
|
| H A D | logger.c | 47 * emit_log_message_to_kernel() - Emit a log message to the kernel at the specified priority.
49 * @priority: The priority at which to log the message
52 static void emit_log_message_to_kernel(int priority, const char *fmt, ...) in emit_log_message_to_kernel() argument
57 if (priority > vdo_get_log_level()) in emit_log_message_to_kernel()
64 switch (priority) { in emit_log_message_to_kernel()
104 * @priority: the priority at which to log the message
110 static void emit_log_message(int priority, const char *module, const char *prefix, in emit_log_message() argument
122 emit_log_message_to_kernel(priority, "%s[%s]: %s%pV%pV\n", module, type, in emit_log_message()
130 emit_log_message_to_kernel(priority, "%s%u:%s: %s%pV%pV\n", module, in emit_log_message()
142 emit_log_message_to_kernel(priority, "%s: %s%pV%pV\n", current->comm, in emit_log_message()
[all …]
|
| H A D | priority-table.h | 12 * A priority_table is a simple implementation of a priority queue for entries with priorities that
13 * are small non-negative integer values. It implements the obvious priority queue operations of
14 * enqueuing an entry and dequeuing an entry with the maximum priority. It also supports removing
15 * an arbitrary entry. The priority of an entry already in the table can be changed by removing it
16 * and re-enqueuing it with a different priority. All operations have O(1) complexity.
23 * The table is implemented as an array of queues (circular lists) indexed by priority, along with
25 * height priority queue", but given the resemblance to a hash table, "priority table" seems both
36 void vdo_priority_table_enqueue(struct priority_table *table, unsigned int priority,
|
| /linux/include/uapi/linux/ |
| H A 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
229 * @priority: 3-bit unsigned integer indicating priority for IEEE
230 * 8-bit 802.1p user priority bitmap for CEE
249 __u8 priority; member
[all …]
|
| H A D | ioprio.h | 21 * These are the io priority classes as implemented by the BFQ and mq-deadline
23 * ATA disks supporting NCQ IO priority, RT class IOs will be processed using
24 * high priority NCQ commands. BE is the best-effort scheduling class, the
39 * The RT and BE priority classes both support up to 8 priority levels that
40 * can be specified using the lower 3-bits of the priority data.
60 * Fallback BE class priority level.
66 * The 10 bits between the priority class and the priority level are used to
67 * optionally define I/O hints for any combination of I/O priority class and
70 * without affecting the I/O scheduling ordering defined by the I/O priority
108 * Return an I/O priority value based on a class, a level and a hint.
|
| /linux/drivers/net/dsa/microchip/ |
| H A D | ksz_dcb.c | 54 /* ksz_supported_apptrust[] - Supported apptrust selectors and Priority Order
55 * of Internal Priority Map (IPM) sources.
58 * the index within the array indicates the priority of the selector - lower
59 * indices correspond to higher priority. This fixed priority scheme is due to
60 * the hardware's design, which does not support configurable priority among
61 * different priority sources.
63 * The priority sources, including Tail Tag, ACL, VLAN PCP and DSCP are ordered
65 * non-configurable precedence where certain types of priority information
68 * 1. Tail Tag - Highest priority, overrides ACL, VLAN PCP, and DSCP priorities.
70 * 3. VLAN PCP - Overrides DSCP priority.
[all …]
|
| /linux/drivers/gpu/drm/i915/ |
| H A D | i915_scheduler_types.h | 21 * @priority: execution and service priority
26 * @priority will be executed before those with a lower @priority
29 * The &drm_i915_private.kernel_context is assigned the lowest priority.
31 int priority; member
51 * dynamic priority changes.
57 * is put to the back of its priority queue, then reshuffling its dependents).
97 * A schedule engine represents a submission queue with different priority
112 * @lock: protects requests in priority lists, requests, hold and
133 * @default_priolist: priority list for I915_PRIORITY_NORMAL
138 * @queue_priority_hint: Highest pending priority.
[all …]
|
| /linux/arch/loongarch/kvm/ |
| H A D | interrupt.c | 26 static int kvm_irq_deliver(struct kvm_vcpu *vcpu, unsigned int priority) in kvm_irq_deliver() argument
30 clear_bit(priority, &vcpu->arch.irq_pending); in kvm_irq_deliver()
31 if (priority < EXCCODE_INT_NUM) in kvm_irq_deliver()
32 irq = priority_to_irq[priority]; in kvm_irq_deliver()
34 switch (priority) { in kvm_irq_deliver()
53 static int kvm_irq_clear(struct kvm_vcpu *vcpu, unsigned int priority) in kvm_irq_clear() argument
57 clear_bit(priority, &vcpu->arch.irq_clear); in kvm_irq_clear()
58 if (priority < EXCCODE_INT_NUM) in kvm_irq_clear()
59 irq = priority_to_irq[priority]; in kvm_irq_clear()
61 switch (priority) { in kvm_irq_clear()
[all …]
|
| /linux/Documentation/locking/ |
| H A 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 …]
|
| H A 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/drivers/firewire/ |
| H A D | packet-serdes-test.c | 18 unsigned int priority, unsigned int src_id) in serialize_async_header_common() argument
24 async_header_set_priority(header, priority); in serialize_async_header_common()
31 unsigned int priority, unsigned int src_id, u64 offset) in serialize_async_header_request() argument
33 serialize_async_header_common(header, dst_id, tlabel, retry, tcode, priority, src_id); in serialize_async_header_request()
40 unsigned int priority, unsigned int src_id, in serialize_async_header_quadlet_request() argument
43 serialize_async_header_request(header, dst_id, tlabel, retry, tcode, priority, src_id, in serialize_async_header_quadlet_request()
50 unsigned int priority, unsigned int src_id, in serialize_async_header_block_request() argument
54 serialize_async_header_request(header, dst_id, tlabel, retry, tcode, priority, src_id, in serialize_async_header_block_request()
63 unsigned int priority, unsigned int src_id, in serialize_async_header_response() argument
66 serialize_async_header_common(header, dst_id, tlabel, retry, tcode, priority, src_id); in serialize_async_header_response()
[all …]
|
| /linux/samples/bpf/ |
| H A D | test_cgrp2_sock.sh | 98 check_sock "dev , mark 0, priority 0" "No programs attached"
99 check_sock6 "dev , mark 0, priority 0" "No programs attached"
107 check_sock "dev cgrp2_sock, mark 0, priority 0" "Device set"
108 check_sock6 "dev cgrp2_sock, mark 0, priority 0" "Device set"
116 check_sock "dev , mark 666, priority 0" "Mark set"
117 check_sock6 "dev , mark 666, priority 0" "Mark set"
119 # verify priority is set
123 cleanup_and_exit 1 "Failed to install program to set priority"
125 check_sock "dev , mark 0, priority 123" "Priority set"
126 check_sock6 "dev , mark 0, priority 123" "Priority set"
[all …]
|
| /linux/tools/testing/selftests/drivers/net/microchip/ |
| H A D | ksz9477_qos.sh | 139 # Based on the apptrust order, set the expected Internal Priority values
171 # which are considered as high priority and most likely not assigned
173 # On the ingress path, packets seem to get high priority status
175 # the high priority status is assigned based on the DSCP or PCP global
177 # The thresholds for the high priority status are not documented, but
178 # it seems that the switch considers packets as high priority on the
179 # ingress path if detected Internal Priority is greater than 0. On the
180 # egress path, the switch considers packets as high priority if
181 # detected Internal Priority is greater than 1.
275 echo "Not expected amount of high priority packets received on ${swp1}"
[all …]
|
| /linux/net/mac80211/ |
| H A D | wme.c | 36 switch (skb->priority) { in wme_downgrade_ac()
39 skb->priority = 5; /* VO -> VI */ in wme_downgrade_ac()
43 skb->priority = 3; /* VI -> BE */ in wme_downgrade_ac()
47 skb->priority = 2; /* BE -> BK */ in wme_downgrade_ac()
90 while (sdata->wmm_acm & BIT(skb->priority)) { in ieee80211_downgrade_queue()
91 int ac = ieee802_1d_to_ac[skb->priority]; in ieee80211_downgrade_queue()
94 skb->priority == ifmgd->tx_tspec[ac].up) in ieee80211_downgrade_queue()
109 if (sta && sta->reserved_tid == skb->priority) in ieee80211_downgrade_queue()
110 skb->priority = ieee80211_fix_reserved_tid(skb->priority); in ieee80211_downgrade_queue()
113 return ieee802_1d_to_ac[skb->priority]; in ieee80211_downgrade_queue()
[all …]
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A 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/arch/mips/kvm/ |
| H A D | interrupt.c | 28 unsigned int priority; in kvm_mips_deliver_interrupts() local
33 priority = __ffs(*pending_clr); in kvm_mips_deliver_interrupts()
34 while (priority <= MIPS_EXC_MAX) { in kvm_mips_deliver_interrupts()
35 kvm_mips_callbacks->irq_clear(vcpu, priority, cause); in kvm_mips_deliver_interrupts()
37 priority = find_next_bit(pending_clr, in kvm_mips_deliver_interrupts()
39 priority + 1); in kvm_mips_deliver_interrupts()
42 priority = __ffs(*pending); in kvm_mips_deliver_interrupts()
43 while (priority <= MIPS_EXC_MAX) { in kvm_mips_deliver_interrupts()
44 kvm_mips_callbacks->irq_deliver(vcpu, priority, cause); in kvm_mips_deliver_interrupts()
46 priority = find_next_bit(pending, in kvm_mips_deliver_interrupts()
[all …]
|
| /linux/Documentation/admin-guide/pm/ |
| H A D | intel-speed-select.rst | 324 allows users to define per core priority. This defines a mechanism to distribute
331 service and hence an associated priority. The granularity is at core level not
338 and use a priority type. There is a default per platform priority type, which
347 Clos Enable: Specify priority type with [--priority|-p]
350 There are two types of priority types:
354 Priority for ordered throttling is defined based on the index of the assigned
355 CLOS group. Where CLOS0 gets highest priority (throttled last).
357 Priority order is:
362 When proportional priority is used, there is an additional parameter called
364 proportional priority is to provide each core with the requested min., then
[all …]
|
| /linux/drivers/net/ethernet/sfc/siena/ |
| H A D | efx.h | 67 * existing filter with equal priority
76 * 1. If the existing filters have lower priority, or @replace_equal
77 * is set and they have equal priority, replace them.
79 * 2. If the existing filters have higher priority, return -%EPERM.
85 * all be inserted with the same priority and @replace_equal = %false.
97 * @priority: Priority of filter, as passed to @efx_filter_insert_filter
104 enum efx_filter_priority priority, in efx_filter_remove_id_safe() argument
107 return efx->type->filter_remove_safe(efx, priority, filter_id); in efx_filter_remove_id_safe()
113 * @priority: Priority of filter, as passed to @efx_filter_insert_filter
122 enum efx_filter_priority priority, in efx_filter_get_filter_safe() argument
[all …]
|
| /linux/tools/power/cpupower/bench/ |
| H A 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/Documentation/virt/kvm/devices/ |
| H A 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/block/ |
| H A D | blk-ioprio.c | 3 * Block rq-qos policy for assigning an I/O priority class to requests.
5 * Using an rq-qos policy for assigning I/O priority class has two advantages
24 * enum prio_policy - I/O priority class policy.
25 * @POLICY_NO_CHANGE: (default) do not modify the I/O priority class.
29 * @POLICY_ALL_TO_IDLE: change the I/O priority class into IOPRIO_CLASS_IDLE.
153 * For RT threads, the default priority level is 4 because in blkcg_set_ioprio()
154 * task_nice is 0. By promoting non-RT io-priority to RT-class in blkcg_set_ioprio()
156 * RT-class but need a higher io-priority can use ioprio_set() in blkcg_set_ioprio()
165 * Except for IOPRIO_CLASS_NONE, higher I/O priority numbers in blkcg_set_ioprio()
166 * correspond to a lower priority. Hence, the max_t() below selects in blkcg_set_ioprio()
[all …]
|
| /linux/Documentation/admin-guide/cgroup-v1/ |
| H A 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/drivers/net/ethernet/sfc/ |
| H A D | efx.h | 83 * existing filter with equal priority
92 * 1. If the existing filters have lower priority, or @replace_equal
93 * is set and they have equal priority, replace them.
95 * 2. If the existing filters have higher priority, return -%EPERM.
101 * all be inserted with the same priority and @replace_equal = %false.
113 * @priority: Priority of filter, as passed to @efx_filter_insert_filter
120 enum efx_filter_priority priority, in efx_filter_remove_id_safe() argument
123 return efx->type->filter_remove_safe(efx, priority, filter_id); in efx_filter_remove_id_safe()
129 * @priority: Priority of filter, as passed to @efx_filter_insert_filter
138 enum efx_filter_priority priority, in efx_filter_get_filter_safe() argument
[all …]
|
| /linux/drivers/net/ethernet/intel/ixgbe/ |
| H A 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/include/linux/ |
| H A 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 …]
|