/linux/drivers/acpi/acpica/ |
H A D | uttrack.c | 32 *allocation); 94 struct acpi_debug_mem_block *allocation; in acpi_ut_allocate_and_track() local 105 allocation = in acpi_ut_allocate_and_track() 107 if (!allocation) { in acpi_ut_allocate_and_track() 118 acpi_ut_track_allocation(allocation, size, ACPI_MEM_MALLOC, in acpi_ut_allocate_and_track() 121 acpi_os_free(allocation); in acpi_ut_allocate_and_track() 135 return ((void *)&allocation->user_space); in acpi_ut_allocate_and_track() 157 struct acpi_debug_mem_block *allocation; in acpi_ut_allocate_zeroed_and_track() local 168 allocation = in acpi_ut_allocate_zeroed_and_track() 171 if (!allocation) { in acpi_ut_allocate_zeroed_and_track() [all …]
|
H A D | utalloc.c | 33 void *allocation; in acpi_os_allocate_zeroed() local 37 allocation = acpi_os_allocate(size); in acpi_os_allocate_zeroed() 38 if (allocation) { in acpi_os_allocate_zeroed() 42 memset(allocation, 0, size); in acpi_os_allocate_zeroed() 45 return (allocation); in acpi_os_allocate_zeroed()
|
/linux/tools/testing/selftests/resctrl/ |
H A D | mba_test.c | 36 * For each allocation, run 5 times in order to get average values. 42 static unsigned int allocation = ALLOCATION_MIN; in mba_setup() local 54 if (allocation > ALLOCATION_MAX) in mba_setup() 57 sprintf(allocation_str, "%d", allocation); in mba_setup() 63 allocation += ALLOCATION_STEP; in mba_setup() 76 unsigned int allocation; in show_mba_info() 82 for (allocation = 0; allocation < ALLOCATION_MAX / ALLOCATION_STEP; in show_mba_info() 83 allocation++) { in show_mba_info() 89 for (runs = NUM_OF_RUNS * allocation; in show_mba_info() 75 int allocation, runs; show_mba_info() local [all...] |
/linux/mm/ |
H A D | dmapool.c | 57 unsigned int allocation; member 127 if ((dma - page->dma) < pool->allocation) in pool_find_page() 161 memset(page->vaddr, POOL_POISON_FREED, pool->allocation); in pool_init_page() 228 size_t allocation; in dma_pool_create() local 245 allocation = max_t(size_t, size, PAGE_SIZE); in dma_pool_create() 248 boundary = allocation; in dma_pool_create() 252 boundary = min(boundary, allocation); in dma_pool_create() 266 retval->allocation = allocation; in dma_pool_create() 306 while (offset + pool->size <= pool->allocation) { in pool_initialise_page() 342 page->vaddr = dma_alloc_coherent(pool->dev, pool->allocation, in pool_alloc_page() [all …]
|
/linux/Documentation/core-api/ |
H A D | memory-allocation.rst | 7 Linux provides a variety of APIs for memory allocation. You can 14 Most of the memory allocation APIs use GFP flags to express how that 16 pages", the underlying memory allocation function. 18 Diversity of the allocation APIs combined with the numerous GFP flags 26 Of course there are cases when other allocation APIs and different GFP 45 * If the allocation is performed from an atomic context, e.g interrupt 48 ``GFP_NOWAIT`` allocation is likely to fail. Users of this flag need 52 will be stressed unless allocation succeeds, you may use ``GFP_ATOMIC``. 67 example may be a hardware allocation that maps data directly into 94 * ``GFP_KERNEL & ~__GFP_RECLAIM`` - optimistic allocation without _any_ [all …]
|
H A D | genalloc.rst | 4 There are a number of memory-allocation subsystems in the kernel, each 32 which NUMA node should be used for the allocation of the housekeeping 87 how the allocation functions choose which specific piece of memory to 107 - gen_pool_first_fit_align forces the allocation to have a specific 110 - gen_pool_first_fit_order_align aligns the allocation to the order of the 111 size. A 60-byte allocation will thus be 64-byte aligned, for example. 117 If the indicated memory is not available the allocation fails.
|
/linux/Documentation/trace/ |
H A D | events-kmem.rst | 5 The kmem tracing system captures events related to object and page allocation 8 - Slab allocation of small objects of unknown type (kmalloc) 9 - Slab allocation of small objects of known type 10 - Page allocation 17 1. Slab allocation of small objects of unknown type 27 internal fragmented as a result of the allocation pattern. By correlating 29 the allocation sites were. 32 2. Slab allocation of small objects of known type 45 3. Page allocation 54 These four events deal with page allocation and freeing. mm_page_alloc is [all …]
|
/linux/include/linux/ |
H A D | dmapool.h | 22 size_t size, size_t align, size_t allocation); 34 size_t size, size_t align, size_t allocation); 39 struct device *dev, size_t size, size_t align, size_t allocation) in dma_pool_create() argument 47 struct device *dev, size_t size, size_t align, size_t allocation) in dmam_pool_create() argument
|
/linux/Documentation/mm/ |
H A D | page_frags.rst | 11 simple allocation framework for page fragments. This is used by the 17 cache is needed. This provides a central point for the fragment allocation 20 which can be expensive at allocation time. However due to the nature of 23 to be disabled when executing the fragment allocation. 26 allocation. The netdev_alloc_cache is used by callers making use of the 41 avoid calling get_page per allocation.
|
H A D | balance.rst | 12 be that the caller is willing to fail the allocation without incurring the 14 allocation requests that have order-0 fallback options. In such cases, 17 __GFP_IO allocation requests are made to prevent file system deadlocks. 19 In the absence of non sleepable allocation requests, it seems detrimental 46 with a slight change in the allocation routine, it is possible to reduce 74 probably because all allocation requests are coming from intr context 88 watermark[WMARK_HIGH]. When low_on_memory is set, page allocation requests will
|
H A D | page_owner.rst | 10 When allocation happens, information about allocation such as call stack 15 Although we already have tracepoint for tracing page allocation/free, 30 allocation and free operation. 38 the page allocator hotpath and if not enabled, then allocation is done 40 not affect to allocation performance, especially if the static keys jump 155 -a Sort by memory allocation time. 221 st stacktrace stack trace of the page allocation 234 st stacktrace stack trace of the page allocation
|
H A D | numa.rst | 75 selected zone/node cannot satisfy the allocation request. This situation, 87 By default, Linux will attempt to satisfy memory allocation requests from the 90 for the node where the request originates. This is called "local allocation." 95 Local allocation will tend to keep subsequent access to the allocated memory 110 allocation behavior using Linux NUMA memory policy. [see 127 Some kernel allocations do not want or cannot tolerate this allocation fallback 132 A typical model for making such an allocation is to obtain the node id of the 135 the node id returned. When such an allocation fails, the requesting subsystem 138 itself on allocation failure. The kernel profiling subsystem is an example of
|
/linux/Documentation/filesystems/ext4/ |
H A D | bigalloc.rst | 15 use clustered allocation, so that each bit in the ext4 block allocation 19 This means that each bit in the block allocation bitmap now addresses 20 256 4k blocks. This shrinks the total size of the block allocation 29 128MiB); however, the minimum allocation unit becomes a cluster, not a
|
/linux/Documentation/admin-guide/mm/ |
H A D | numa_memory_policy.rst | 38 use "local allocation" described below. However, during boot 82 A VMA policy will govern the allocation of pages that back 138 support allocation at fault time--a.k.a lazy allocation--so hugetlbfs 140 Although hugetlbfs segments now support lazy allocation, their support 197 closest to the node where the allocation takes place. 200 This mode specifies that the allocation should be attempted 202 allocation fails, the kernel will search other nodes, in order 209 and the policy is interpreted as local allocation. "Local" 210 allocation policy can be viewed as a Preferred policy that 211 starts at the node containing the cpu where the allocation [all …]
|
/linux/drivers/md/dm-vdo/ |
H A D | dump.c | 163 wait_on, data_vio, data_vio->allocation.pbn, data_vio->logical.lbn, in dump_vio_waiters() 169 data_vio, data_vio->allocation.pbn, data_vio->logical.lbn, in dump_vio_waiters() 239 data_vio->allocation.pbn, data_vio->logical.lbn, in dump_data_vio() 244 data_vio->allocation.pbn, data_vio->logical.lbn); in dump_data_vio()
|
/linux/tools/testing/memblock/ |
H A D | README | 17 allocation functionalities of memblock. The main data structure of the boot time 58 allocation functions. Tests for each group are defined in dedicated files, as it 82 Some allocation functions clear the memory in the process, so it is required for 85 points to a block of memory allocated via malloc. For each group of allocation 87 at the end of the test run. The structure of a test runner checking allocation 95 (...allocation checks...)
|
/linux/Documentation/admin-guide/ |
H A D | numastat.rst | 12 the preferred node and numa_miss on the node where allocation succeeded. 17 incremented on allocation from a node by CPU on the same node. other_node is 18 similar to numa_miss and is incremented on the node where allocation succeeds 53 preferred node. As a result, such allocation will not increase the numa_foreign
|
/linux/drivers/soundwire/ |
H A D | Makefile | 11 soundwire-generic-allocation-objs := generic_bandwidth_allocation.o 12 obj-$(CONFIG_SOUNDWIRE_GENERIC_ALLOCATION) += soundwire-generic-allocation.o
|
/linux/arch/powerpc/platforms/powernv/ |
H A D | Kconfig | 30 bool "Enable runtime allocation of RAM for tracing" 33 Enabling this option allows for runtime allocation of memory (RAM)
|
/linux/Documentation/arch/arm64/ |
H A D | memory-tagging-extension.rst | 19 allocation tag for each 16-byte granule in the physical address space. 23 the logical tag against the allocation tag and potentially raise an 36 To access the allocation tags, a user process must enable the Tagged 40 ``PROT_MTE`` - Pages allow access to the MTE allocation tags. 42 The allocation tag is set to 0 when such pages are first mapped in the 44 supported and the allocation tags can be shared between processes. 55 ``MADV_FREE`` may have the allocation tags cleared (set to 0) at any 62 the logical and allocation tags occurs on access, there are three 230 The allocation tags for user memory mapped with ``PROT_MTE`` are dumped 303 * Set the allocation tag on the destination address. [all …]
|
/linux/tools/testing/selftests/cgroup/ |
H A D | test_zswap.c | 467 void *allocation; in no_kmem_bypass_child() local 469 allocation = malloc(values->target_alloc_bytes); in no_kmem_bypass_child() 470 if (!allocation) { in no_kmem_bypass_child() 475 ((char *)allocation)[i] = 'a'; in no_kmem_bypass_child() 478 free(allocation); in no_kmem_bypass_child()
|
/linux/Documentation/translations/zh_CN/core-api/ |
H A D | memory-allocation.rst | 3 :Original: Documentation/core-api/memory-allocation.rst 13 .. _cn_core-api_memory-allocation:
|
/linux/scripts/coccinelle/null/ |
H A D | eno.cocci | 2 /// The various basic memory allocation functions don't return ERR_PTR 48 msg = "ERROR: allocation function on line %s returns NULL not ERR_PTR on failure" % (p1[0].line)
|
/linux/Documentation/arch/x86/x86_64/ |
H A D | 5level-paging.rst | 45 But userspace can ask for allocation from full address space by 53 A high hint address would only affect the allocation in question, but not 58 to allocation from 47-bit address space.
|
/linux/Documentation/userspace-api/ |
H A D | dma-buf-alloc-exchange.rst | 180 described as having a height of 1080, with the memory allocation for each buffer 233 buffer-allocation interface available at either kernel or userspace level, the 234 client makes an arbitrary choice of allocation interface such as Vulkan, GBM, or 237 Each allocation request must take, at a minimum: the pixel format, a list of 239 this set of properties in different ways, such as allowing allocation in more 244 allocation, any padding required, and further properties of the underlying 250 After allocation, the client must query the allocator to determine the actual 272 memory. For this reason, each import and allocation API must provide a separate 314 In the latter case, the allocation is as discussed above, being provided with a 343 - during allocation, a user may supply ``DRM_FORMAT_MOD_INVALID``, either as the [all …]
|