Home
last modified time | relevance | path

Searched full:orders (Results 1 – 25 of 126) sorted by relevance

123456

/linux/tools/testing/selftests/mm/
H A Dthp_settings.c
H A Dvm_util.c219 * folio orders
225 * @orders: output folio order array
229 * all folios within the range and record their orders. All order-0 pages will
235 int pagemap_fd, int kpageflags_fd, int orders[], int nr_orders) in gather_folio_orders() argument
243 if (!orders) in gather_folio_orders()
265 orders[0]++; in gather_folio_orders()
300 orders[cur_order]++; in gather_folio_orders()
315 orders[cur_order]++; in gather_folio_orders()
377 int orders[MAX_NR_ORDERS], status; in check_large_folios() local
388 memset(orders, 0, sizeof(int) * MAX_NR_ORDERS); in check_large_folios()
[all …]
H A Duffd-wp-mremap.c36 unsigned long orders; in detect_thp_sizes()
44 orders = thp_supported_orders(); in detect_thp_sizes()
46 for (i = 0; orders && count < max; i++) {
47 if (!(orders & (1UL << i))) in mmap_aligned()
49 orders &= ~(1UL << i); in mmap_aligned()
25 unsigned long orders; detect_thp_sizes() local
H A Dsplit_huge_page_test.c108 int pagemap_fd, int kpageflags_fd, int orders[], int nr_orders) in check_after_split_folio_orders() argument
126 if (vaddr_orders[i] != orders[i]) { in check_after_split_folio_orders()
128 orders[i], vaddr_orders[i]); in check_after_split_folio_orders()
/linux/mm/
H A Dswap_state.c501 * @orders: allocation orders, must be non zero
515 unsigned long orders, struct vm_fault *vmf, in swap_cache_alloc_folio() argument
523 order = highest_order(orders); in swap_cache_alloc_folio()
525 /* orders must be non-zero, and must not exceed cluster size. */ in swap_cache_alloc_folio()
526 if (WARN_ON_ONCE(!orders || (1UL << order) > SWAPFILE_CLUSTER)) in swap_cache_alloc_folio()
538 order = next_order(&orders, order); in swap_cache_alloc_folio()
539 } while (orders); in swap_cache_alloc_folio()
671 * @orders: allocation orders
676 * This allocates a folio suitable for given @orders, or returns the
678 * if needed. @entry is rounded down if @orders allow large allocation.
[all …]
H A Dswap.h316 unsigned long orders, struct vm_fault *vmf,
334 struct folio *swapin_sync(swp_entry_t entry, gfp_t flag, unsigned long orders,
415 swp_entry_t entry, gfp_t flag, unsigned long orders, in swapin_sync() argument
H A Dhuge_memory.c185 unsigned long orders) in __thp_vma_allowable_orders() argument
192 /* Check the intersection of requested and supported orders. */ in __thp_vma_allowable_orders()
200 orders &= supported_orders; in __thp_vma_allowable_orders()
201 if (!orders) in __thp_vma_allowable_orders()
212 return in_pf ? orders : 0; in __thp_vma_allowable_orders()
224 * filtering out the unsuitable orders. in __thp_vma_allowable_orders()
230 int order = highest_order(orders); in __thp_vma_allowable_orders()
233 while (orders) { in __thp_vma_allowable_orders()
237 order = next_order(&orders, order); in __thp_vma_allowable_orders()
240 if (!orders) in __thp_vma_allowable_orders()
[all …]
H A Dmemory.c4774 unsigned long orders) in thp_swap_suitable_orders() argument
4778 order = highest_order(orders); in thp_swap_suitable_orders()
4785 while (orders) { in thp_swap_suitable_orders()
4789 order = next_order(&orders, order); in thp_swap_suitable_orders()
4792 return orders; in thp_swap_suitable_orders()
4798 unsigned long orders; in thp_swapin_suitable_orders() local
4822 * Get a list of all the (large) orders below PMD_ORDER that are enabled in thp_swapin_suitable_orders()
4825 orders = thp_vma_allowable_orders(vma, vma->vm_flags, TVA_PAGEFAULT, in thp_swapin_suitable_orders()
4827 orders = thp_vma_suitable_orders(vma, vmf->address, orders); in thp_swapin_suitable_orders()
4828 orders = thp_swap_suitable_orders(swp_offset(entry), in thp_swapin_suitable_orders()
[all …]
H A Dshmem.c1862 * Only allow inherit orders if the top-level value is 'force', which in shmem_allowable_huge_orders()
1882 unsigned long orders) in shmem_suitable_orders() argument
1890 orders = thp_vma_suitable_orders(vma, vmf->address, orders); in shmem_suitable_orders()
1891 if (!orders) in shmem_suitable_orders()
1896 order = highest_order(orders); in shmem_suitable_orders()
1897 while (orders) { in shmem_suitable_orders()
1911 order = next_order(&orders, order); in shmem_suitable_orders()
1914 return orders; in shmem_suitable_orders()
1919 unsigned long orders) in shmem_suitable_orders() argument
1941 struct mm_struct *fault_mm, unsigned long orders) in shmem_alloc_and_add_folio() argument
[all …]
/linux/tools/memory-model/Documentation/
H A Dglossary.txt29 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
H A Dcheatsheet.txt34 SELF: Orders self, as opposed to accesses before and/or after
35 SV: Orders later accesses to the same variable
H A Drecipes.txt236 The smp_store_release() macro orders any prior accesses against the
237 store, while the smp_load_acquire macro orders the load against any
277 smp_store_release(), but the rcu_dereference() macro orders the load only
314 The smp_wmb() macro orders prior stores against later stores, and the
315 smp_rmb() macro orders prior loads against later loads. Therefore, if
H A Dordering.txt11 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/arch/powerpc/mm/
H A Dmmu_context.c56 * 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/arch/arm64/boot/dts/renesas/
H A Dwhite-hawk-csi-dsi.dtsi24 line-orders = <MEDIA_BUS_CSI2_CPHY_LINE_ORDER_ABC
47 line-orders = <MEDIA_BUS_CSI2_CPHY_LINE_ORDER_ABC
/linux/Documentation/admin-guide/mm/
H A Dtranshuge.rst351 promotion to higher orders. The collapse will fail if any shared or
652 lower orders or small pages.
656 instead falls back to using huge pages with lower orders or
677 and instead falls back to using huge pages with lower orders or
682 falls back to using huge pages with lower orders or small pages
709 smaller orders. This can happen for a variety of reasons but a
740 max_ptes_swap threshold. For non-PMD orders this occurs if a mTHP range
745 max_ptes_shared threshold. For non-PMD orders this occurs if a mTHP range
/linux/Documentation/
H A Datomic_t.txt194 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/Documentation/userspace-api/media/v4l/
H A Dfield-order.rst81 If multiple field orders are possible the
82 driver must choose one of the possible field orders during
H A Dpixfmt-bayer.rst16 orders. See also `the Wikipedia article on Bayer filter
/linux/fs/netfs/
H A Drolling_buffer.c144 /* Get a batch of folios and note their orders. */ in rolling_buffer_bulk_load_from_ra()
156 fq->orders[slot] = order; in rolling_buffer_bulk_load_from_ra()
/linux/samples/bpf/
H A Dtc_l2_redirect_user.c59 /* bpf_tunnel_key.remote_ipv4 expects host byte orders */ in main()
/linux/arch/s390/include/uapi/asm/
H A Draw3270.h13 /* Buffer Control Orders */
/linux/include/linux/
H A Dihex.h4 * firmware loaded in strange orders rather than a single big blob, but
/linux/drivers/s390/block/
H A Ddasd_eckd.h56 /* Define Subsystem Function / Orders */
60 * Perform Subsystem Function / Orders
67 * Perform Subsystem Function / Sub-Orders
/linux/tools/testing/selftests/rcutorture/bin/
H A Dkvm-check-branches.sh

123456