| /linux-6.6.21/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()
|
| D | ttm_device_test.c | 179 pt = pool->caching[i].orders[j]; in ttm_device_init_pools()
|
| /linux-6.6.21/drivers/dma-buf/heaps/ |
| D | system_heap.c | 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.6.21/include/drm/ttm/ |
| D | ttm_pool.h | 77 struct ttm_pool_type orders[MAX_ORDER + 1]; member
|
| /linux-6.6.21/drivers/gpu/drm/ttm/ |
| D | ttm_pool.c | 291 return &pool->caching[caching].orders[order]; in ttm_pool_select_type()
569 ttm_pool_type_init(&pool->caching[i].orders[j], in ttm_pool_init()
590 ttm_pool_type_fini(&pool->caching[i].orders[j]); in ttm_pool_fini()
722 ttm_pool_debugfs_orders(pool->caching[i].orders, m); in ttm_pool_debugfs()
|
| /linux-6.6.21/Documentation/userspace-api/media/v4l/ |
| D | pixfmt-bayer.rst | 15 orders. See also `the Wikipedia article on Bayer filter
|
| D | field-order.rst | 80 If multiple field orders are possible the
81 driver must choose one of the possible field orders during
|
| /linux-6.6.21/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 | 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.6.21/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.6.21/arch/arm/boot/dts/marvell/ |
| D | armada-385-synology-ds116.dts | 53 * and takes single-character orders :
|
| /linux-6.6.21/tools/virtio/virtio-trace/ |
| D | README | 9 - controlled by start/stop orders from a Host
|
| /linux-6.6.21/tools/memory-model/ |
| D | lock.cat | 8 * Generate coherence orders and handle lock operations
|
| D | linux-kernel.cat | 158 (* rb orders instructions just as pb does *)
|
| /linux-6.6.21/Documentation/core-api/ |
| D | genalloc.rst | 49 that state, so one of the first orders of business is usually to add memory
|
| D | memory-allocation.rst | 129 This might be really dangerous especially for larger orders.
|
| /linux-6.6.21/Documentation/devicetree/bindings/ |
| D | example-schema.yaml | 197 # Expressing 2 properties in both orders means all of the set of properties
|
| /linux-6.6.21/Documentation/admin-guide/mm/ |
| D | pagemap.rst | 99 The buddy system organizes free memory in blocks of various orders.
|
| /linux-6.6.21/Documentation/virt/kvm/ |
| D | locking.rst | 10 The acquisition orders for mutexes are as follows:
|
| /linux-6.6.21/drivers/usb/misc/ |
| D | Kconfig | 26 Note however that some operations are three orders of magnitude
|
| /linux-6.6.21/Documentation/mm/ |
| D | slub.rst | 57 caused higher minimum slab orders
|
| /linux-6.6.21/Documentation/process/ |
| D | management-style.rst | 19 companies. If you sign purchase orders or you have any clue about the
|
| /linux-6.6.21/Documentation/admin-guide/sysctl/ |
| D | vm.rst | 668 "Node order" orders the zonelists by node, then by zone within each node.
671 "Zone Order" orders the zonelists by zone type, then by node within each
|
| /linux-6.6.21/Documentation/networking/devlink/ |
| D | devlink-trap.rst | 611 packet rates that are several orders of magnitude higher compared to those that
|