| /linux/tools/testing/selftests/mm/ |
| H A D | thp_settings.c | 174 unsigned long orders = thp_supported_orders(); 201 if (!((1 << i) & orders)) { in thp_read_settings() 226 unsigned long orders = thp_supported_orders(); in thp_read_settings() 252 if (!((1 << i) & orders)) in thp_write_settings() 323 unsigned long orders = 0; in thp_pop_settings() 340 orders |= 1UL << i; in thp_set_read_ahead_path() 343 return orders; in thp_set_read_ahead_path() 203 unsigned long orders = thp_supported_orders(); thp_read_settings() local 255 unsigned long orders = thp_supported_orders(); thp_write_settings() local 352 unsigned long orders = 0; __thp_supported_orders() local
|
| H A D | split_huge_page_test.c | 126 * folio orders 132 * @orders: output folio order array 136 * all folios within the range and record their orders. All order-0 pages will 139 * NOTE: the function is used to check folio orders after a split is performed, 146 int pagemap_fd, int kpageflags_fd, int orders[], int nr_orders) in gather_after_split_folio_orders() 154 if (!orders) in gather_after_split_folio_orders() 176 orders[0]++; in gather_after_split_folio_orders() 211 orders[cur_order]++; in gather_after_split_folio_orders() 226 orders[cur_order]++; in gather_after_split_folio_orders() 231 int pagemap_fd, int kpageflags_fd, int orders[], in in check_after_split_folio_orders() 145 gather_after_split_folio_orders(char * vaddr_start,size_t len,int pagemap_fd,int kpageflags_fd,int orders[],int nr_orders) gather_after_split_folio_orders() argument 230 check_after_split_folio_orders(char * vaddr_start,size_t len,int pagemap_fd,int kpageflags_fd,int orders[],int nr_orders) check_after_split_folio_orders() argument [all...] |
| H A D | uffd-wp-mremap.c | 25 unsigned long orders; in detect_thp_sizes() local 33 orders = thp_supported_orders(); in detect_thp_sizes() 35 for (i = 0; orders && count < max; i++) { in detect_thp_sizes() 36 if (!(orders & (1UL << i))) in detect_thp_sizes() 38 orders &= ~(1UL << i); in detect_thp_sizes()
|
| H A D | cow.c | 47 unsigned long orders; in detect_thp_sizes() local 55 orders = 1UL << sz2ord(pmdsize, pagesize); in detect_thp_sizes() 56 orders |= thp_supported_orders(); in detect_thp_sizes() 58 for (i = 0; orders && count < max; i++) { in detect_thp_sizes() 59 if (!(orders & (1UL << i))) in detect_thp_sizes() 61 orders &= ~(1UL << i); in detect_thp_sizes()
|
| /linux/tools/memory-model/Documentation/ |
| H A 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
|
| H A D | cheatsheet.txt | 34 SELF: Orders self, as opposed to accesses before and/or after 35 SV: Orders later accesses to the same variable
|
| H A D | recipes.txt | 236 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 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/arch/s390/kvm/ |
| H A 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/arch/powerpc/mm/ |
| H A 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/arch/arm64/boot/dts/renesas/ |
| H A D | white-hawk-csi-dsi.dtsi | 24 line-orders = <MEDIA_BUS_CSI2_CPHY_LINE_ORDER_ABC 47 line-orders = <MEDIA_BUS_CSI2_CPHY_LINE_ORDER_ABC
|
| /linux/Documentation/ |
| H A 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/Documentation/userspace-api/media/v4l/ |
| H A D | field-order.rst | 81 If multiple field orders are possible the 82 driver must choose one of the possible field orders during
|
| H A D | pixfmt-bayer.rst | 16 orders. See also `the Wikipedia article on Bayer filter
|
| /linux/mm/ |
| H A D | huge_memory.c | 114 unsigned long orders) in __thp_vma_allowable_orders() argument 121 /* Check the intersection of requested and supported orders. */ in __thp_vma_allowable_orders() 129 orders &= supported_orders; in __thp_vma_allowable_orders() 130 if (!orders) in __thp_vma_allowable_orders() 141 return in_pf ? orders : 0; in __thp_vma_allowable_orders() 153 * filtering out the unsuitable orders. in __thp_vma_allowable_orders() 159 int order = highest_order(orders); in __thp_vma_allowable_orders() 162 while (orders) { in __thp_vma_allowable_orders() 166 order = next_order(&orders, order); in __thp_vma_allowable_orders() 169 if (!orders) in __thp_vma_allowable_orders() [all …]
|
| H A D | memory.c | 4669 unsigned long orders) in thp_swap_suitable_orders() argument 4673 order = highest_order(orders); in thp_swap_suitable_orders() 4680 while (orders) { in thp_swap_suitable_orders() 4684 order = next_order(&orders, order); in thp_swap_suitable_orders() 4687 return orders; in thp_swap_suitable_orders() 4693 unsigned long orders; in alloc_swap_folio() local 4719 * Get a list of all the (large) orders below PMD_ORDER that are enabled in alloc_swap_folio() 4722 orders = thp_vma_allowable_orders(vma, vma->vm_flags, TVA_PAGEFAULT, in alloc_swap_folio() 4724 orders = thp_vma_suitable_orders(vma, vmf->address, orders); in alloc_swap_folio() 4725 orders = thp_swap_suitable_orders(swp_offset(entry), in alloc_swap_folio() [all …]
|
| /linux/Documentation/admin-guide/mm/ |
| H A D | transhuge.rst | 635 lower orders or small pages. 639 instead falls back to using huge pages with lower orders or 652 and instead falls back to using huge pages with lower orders or 657 falls back to using huge pages with lower orders or small pages 684 smaller orders. This can happen for a variety of reasons but a
|
| /linux/samples/bpf/ |
| H A D | tc_l2_redirect_user.c | 59 /* bpf_tunnel_key.remote_ipv4 expects host byte orders */ in main()
|
| /linux/drivers/s390/block/ |
| H A D | dasd_eckd.h | 56 /* Define Subsystem Function / Orders */ 60 * Perform Subsystem Function / Orders 67 * Perform Subsystem Function / Sub-Orders
|
| /linux/arch/s390/include/uapi/asm/ |
| H A D | raw3270.h | 13 /* Buffer Control Orders */
|
| /linux/include/linux/ |
| H A D | ihex.h | 4 * firmware loaded in strange orders rather than a single big blob, but
|
| H A D | compaction.h | 77 * as a bigger gap for higher orders than strictly necessary can also in compact_gap()
|
| /linux/drivers/gpu/drm/ttm/ |
| H A D | ttm_pool.c | 165 * Do not add latency to the allocation path for allocations orders in ttm_pool_alloc_page() 412 return &pool->caching[caching].orders[order]; in ttm_pool_select_type() 1152 if (pt != &pool->caching[i].orders[j]) in ttm_pool_init() 1190 if (pt != &pool->caching[i].orders[j]) in ttm_pool_fini() 1328 ttm_pool_debugfs_orders(pool->caching[i].orders, m); in ttm_pool_debugfs()
|
| /linux/tools/testing/selftests/rcutorture/bin/ |
| H A D | kvm-check-branches.sh | |
| /linux/tools/virtio/virtio-trace/ |
| H A D | README | 9 - controlled by start/stop orders from a Host
|