| /linux-6.8/include/linux/ |
| D | huge_mm.h | 71 * Mask of all large folio orders supported for anonymous THP; all orders up to
78 * Mask of all large folio orders supported for file THP.
83 * Mask of all large folio orders supported for THP.
129 static inline int highest_order(unsigned long orders) in highest_order() argument
131 return fls_long(orders) - 1; in highest_order()
134 static inline int next_order(unsigned long *orders, int prev) in next_order() argument
136 *orders &= ~BIT(prev); in next_order()
137 return highest_order(*orders); in next_order()
172 * Filter the bitfield of input orders to the ones suitable for use in the vma.
174 * All orders that pass the checks are returned as a bitfield.
[all …]
|
| D | refcount.h | 166 * and thereby orders future stores. See the comment on top.
202 * and thereby orders future stores. See the comment on top.
228 * and thereby orders future stores. See the comment on top.
|
| D | ihex.h | 4 * firmware loaded in strange orders rather than a single big blob, but
|
| D | compaction.h | 77 * as a bigger gap for higher orders than strictly necessary can also in compact_gap()
|
| /linux-6.8/tools/testing/selftests/mm/ |
| D | thp_settings.c | 202 unsigned long orders = thp_supported_orders(); in thp_read_settings() local
228 if (!((1 << i) & orders)) { in thp_read_settings()
242 unsigned long orders = thp_supported_orders(); in thp_write_settings() local
267 if (!((1 << i) & orders)) in thp_write_settings()
329 unsigned long orders = 0; in thp_supported_orders() local
345 orders |= 1UL << i; in thp_supported_orders()
348 return orders; in thp_supported_orders()
|
| /linux-6.8/drivers/gpu/drm/ttm/tests/ |
| D | ttm_pool_test.c | 251 pt = &pool->caching[caching].orders[order]; in ttm_pool_alloc_order_caching_match()
280 pt_pool = &pool->caching[pool_caching].orders[order]; in ttm_pool_alloc_caching_mismatch()
281 pt_tt = &pool->caching[tt_caching].orders[order]; in ttm_pool_alloc_caching_mismatch()
314 pt_pool = &pool->caching[caching].orders[order]; in ttm_pool_alloc_order_mismatch()
315 pt_tt = &pool->caching[caching].orders[0]; in ttm_pool_alloc_order_mismatch()
355 pt = &pool->caching[caching].orders[order]; in ttm_pool_free_dma_alloc()
386 pt = &pool->caching[caching].orders[order]; in ttm_pool_free_no_dma_alloc()
406 pt = &pool->caching[caching].orders[order]; in ttm_pool_fini_basic()
|
| /linux-6.8/drivers/dma-buf/heaps/ |
| D | system_heap.c | 49 * The selection of the orders used for allocation (1MB, 64K, 4K) is designed
54 static const unsigned int orders[] = {8, 4, 0}; variable
55 #define NUM_ORDERS ARRAY_SIZE(orders)
321 if (size < (PAGE_SIZE << orders[i])) in alloc_largest_available()
323 if (max_order < orders[i]) in alloc_largest_available()
326 page = alloc_pages(order_flags[i], orders[i]); in alloc_largest_available()
342 unsigned int max_order = orders[0]; in system_heap_allocate()
|
| /linux-6.8/tools/memory-model/Documentation/ |
| D | glossary.txt | 29 a special operation that includes a load and which orders that
117 Fully Ordered: An operation such as smp_mb() that orders all of
120 that orders all of its CPU's prior accesses, itself, and
167 a special operation that includes a store and which orders that
|
| D | cheatsheet.txt | 34 SELF: Orders self, as opposed to accesses before and/or after
35 SV: Orders later accesses to the same variable
|
| D | recipes.txt | 232 The smp_store_release() macro orders any prior accesses against the
233 store, while the smp_load_acquire macro orders the load against any
273 smp_store_release(), but the rcu_dereference() macro orders the load only
310 The smp_wmb() macro orders prior stores against later stores, and the
311 smp_rmb() macro orders prior loads against later loads. Therefore, if
|
| D | ordering.txt | 11 1. Barriers (also known as "fences"). A barrier orders some or
67 First, the smp_mb() full memory barrier orders all of the CPU's prior
115 synchronize_srcu() and so on. However, these primitives have orders
|
| /linux-6.8/arch/s390/kvm/ |
| D | sigp.c | 266 /* handle unknown orders in user space */ in __prepare_sigp_unknown()
280 * SIGP RESTART, SIGP STOP, and SIGP STOP AND STORE STATUS orders in handle_sigp_dst()
283 * interrupt, we need to return any new non-reset orders "busy". in handle_sigp_dst()
298 * their orders, while the guest cannot observe a in handle_sigp_dst()
299 * difference when issuing other orders from two in handle_sigp_dst()
|
| /linux-6.8/include/drm/ttm/ |
| D | ttm_pool.h | 61 * struct ttm_pool - Pool for all caching and orders
77 struct ttm_pool_type orders[NR_PAGE_ORDERS]; member
|
| /linux-6.8/arch/powerpc/mm/ |
| D | mmu_context.c | 56 * This full barrier orders the store to the cpumask above vs in switch_mm_irqs_off()
69 * radix which orders earlier stores to clear the PTEs before in switch_mm_irqs_off()
|
| /linux-6.8/Documentation/ |
| D | atomic_t.txt | 194 smp_mb__before_atomic() orders all earlier accesses against the RMW op
195 itself and all accesses following it, and smp_mb__after_atomic() orders all
226 a RELEASE because it orders preceding instructions against both the read
|
| /linux-6.8/mm/ |
| D | huge_memory.c | 85 unsigned long orders) in __thp_vma_allowable_orders() argument
87 /* Check the intersection of requested and supported orders. */ in __thp_vma_allowable_orders()
88 orders &= vma_is_anonymous(vma) ? in __thp_vma_allowable_orders()
90 if (!orders) in __thp_vma_allowable_orders()
112 return in_pf ? orders : 0; in __thp_vma_allowable_orders()
124 * filtering out the unsuitable orders. in __thp_vma_allowable_orders()
130 int order = highest_order(orders); in __thp_vma_allowable_orders()
133 while (orders) { in __thp_vma_allowable_orders()
137 order = next_order(&orders, order); in __thp_vma_allowable_orders()
140 if (!orders) in __thp_vma_allowable_orders()
[all …]
|
| /linux-6.8/Documentation/userspace-api/media/v4l/ |
| D | field-order.rst | 80 If multiple field orders are possible the
81 driver must choose one of the possible field orders during
|
| D | pixfmt-bayer.rst | 15 orders. See also `the Wikipedia article on Bayer filter
|
| /linux-6.8/samples/bpf/ |
| D | tc_l2_redirect_user.c | 59 /* bpf_tunnel_key.remote_ipv4 expects host byte orders */ in main()
|
| /linux-6.8/drivers/gpu/drm/ttm/ |
| D | ttm_pool.c | 292 return &pool->caching[caching].orders[order]; in ttm_pool_select_type()
572 ttm_pool_type_init(&pool->caching[i].orders[j], in ttm_pool_init()
605 ttm_pool_type_fini(&pool->caching[i].orders[j]); in ttm_pool_fini()
737 ttm_pool_debugfs_orders(pool->caching[i].orders, m); in ttm_pool_debugfs()
|
| /linux-6.8/drivers/s390/block/ |
| D | dasd_eckd.h | 56 /* Define Subsystem Function / Orders */
60 * Perform Subsystem Function / Orders
67 * Perform Subsystem Function / Sub-Orders
|
| /linux-6.8/drivers/android/ |
| D | binder_alloc_selftest.c | 208 /* Generate BUFFER_NUM factorial free orders. */
283 * then free them in all orders possible. Check that pages are
|
| /linux-6.8/arch/s390/include/uapi/asm/ |
| D | raw3270.h | 13 /* Buffer Control Orders */
|
| /linux-6.8/tools/testing/selftests/kvm/aarch64/ |
| D | vcpu_width_config.c | 73 * Each of those three cases, configure vCPUs in two different orders.
|
| /linux-6.8/fs/nfs_common/ |
| D | nfsacl.c | 122 /* Insert entries in canonical order: other orders seem in nfsacl_encode()
187 /* Insert entries in canonical order: other orders seem in nfs_stream_encode_acl()
|