/Linux-v6.6/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 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 …]
|
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-v6.6/drivers/gpu/drm/i915/ |
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-v6.6/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-v6.6/samples/bpf/ |
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-v6.6/net/mac80211/ |
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-v6.6/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-v6.6/arch/mips/kvm/ |
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-v6.6/Documentation/admin-guide/pm/ |
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-v6.6/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-v6.6/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-v6.6/drivers/net/ethernet/sfc/siena/ |
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-v6.6/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-v6.6/drivers/net/ethernet/sfc/ |
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-v6.6/tools/testing/selftests/bpf/prog_tests/ |
D | netfilter_link_attach.c | 12 __s32 priority; member 23 { .pf = NFPROTO_IPV4, .priority = INT_MIN, .name = "invalid-priority-min", }, 24 { .pf = NFPROTO_IPV4, .priority = INT_MAX, .name = "invalid-priority-max", }, 27 { .pf = NFPROTO_INET, .priority = 1, .name = "invalid-inet-not-supported", }, 29 { .pf = NFPROTO_IPV4, .priority = -10000, .expect_success = true, .name = "attach ipv4", }, 30 { .pf = NFPROTO_IPV6, .priority = 10001, .expect_success = true, .name = "attach ipv6", }, 57 X(opts, priority, i); in test_netfilter_link_attach() 68 ASSERT_ERR_PTR(link2, "attach program with same pf/hook/priority"); in test_netfilter_link_attach()
|
D | tc_bpf.c | 13 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_p, .priority = 1); \ 15 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_hp, .handle = 1, .priority = 1); \ 17 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_pf, .priority = 1, .prog_fd = __fd); \ 18 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_hpf, .handle = 1, .priority = 1, .prog_fd = __fd); \ 19 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_hpi, .handle = 1, .priority = 1, .prog_id = 42); \ 20 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_hpr, .handle = 1, .priority = 1, \ 22 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_hpfi, .handle = 1, .priority = 1, .prog_fd = __fd, \ 24 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts_prio_max, .handle = 1, .priority = UINT16_MAX + 1); 28 DECLARE_LIBBPF_OPTS(bpf_tc_opts, opts, .handle = 1, .priority = 1, .prog_fd = fd); in test_tc_bpf_basic() 42 !ASSERT_EQ(opts.priority, 1, "priority set") || in test_tc_bpf_basic() [all …]
|
/Linux-v6.6/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-v6.6/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-v6.6/arch/powerpc/include/asm/vdso/ |
D | processor.h | 7 /* Macros for adjusting thread priority (hardware multi-threading) */ 9 #define HMT_very_low() asm volatile("or 31, 31, 31 # very low priority") 10 #define HMT_low() asm volatile("or 1, 1, 1 # low priority") 11 #define HMT_medium_low() asm volatile("or 6, 6, 6 # medium low priority") 12 #define HMT_medium() asm volatile("or 2, 2, 2 # medium priority") 13 #define HMT_medium_high() asm volatile("or 5, 5, 5 # medium high priority") 14 #define HMT_high() asm volatile("or 3, 3, 3 # high priority") 27 /* Pre-POWER10 uses low ; medium priority nops */ \
|
/Linux-v6.6/block/ |
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. 198 * For RT threads, the default priority level is 4 because in blkcg_set_ioprio() 199 * task_nice is 0. By promoting non-RT io-priority to RT-class in blkcg_set_ioprio() 201 * RT-class but need a higher io-priority can use ioprio_set() in blkcg_set_ioprio() 210 * Except for IOPRIO_CLASS_NONE, higher I/O priority numbers in blkcg_set_ioprio() 211 * correspond to a lower priority. Hence, the max_t() below selects in blkcg_set_ioprio() [all …]
|
/Linux-v6.6/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-v6.6/lib/ |
D | parman.c | 2 * lib/parman.c - Manager for linear priority array areas 236 * with the same priority. Consider following example: 247 * In this example, there are 3 priority chunks. The order of the priorities 248 * matters, however the order of items within a single priority chunk does not 260 * The goal of parman is to maintain the priority ordering. The caller 297 * parman_prio_init - initializes a parman priority chunk 300 * @priority: desired priority of the chunk 304 * Before caller could add an item with certain priority, he has to 305 * initialize a priority chunk for it using this function. 308 unsigned long priority) in parman_prio_init() argument [all …]
|
/Linux-v6.6/Documentation/admin-guide/mm/ |
D | swap_numa.rst | 13 Swap device has priority and that decides the order of it to be used. To make 14 use of automatically binding, there is no need to manipulate priority settings 63 The current code uses a priority based list, swap_avail_list, to decide 65 priority, they are used round robin. This change here replaces the single 67 it sees its own priority based list of available swap devices. Swap 68 device's priority can be promoted on its matching node's swap_avail_list. 70 The current swap device's priority is set as: user can set a >=0 value, 71 or the system will pick one starting from -1 then downwards. The priority 74 the semantics for priority >=0 cases, the previous starting from -1 then 77 node, they will all be promoted to priority -1 on that node's plist and will
|
/Linux-v6.6/include/trace/events/ |
D | vmscan.h | 203 int priority), 206 priority), 217 __field(int, priority) 229 __entry->priority = priority; 232 … nid: %d objects to shrink %ld gfp_flags %s cache items %ld delta %lld total_scan %ld priority %d", 241 __entry->priority) 357 struct reclaim_stat *stat, int priority, int file), 359 TP_ARGS(nid, nr_scanned, nr_reclaimed, stat, priority, file), 373 __field(int, priority) 389 __entry->priority = priority; [all …]
|