Searched full:allocation (Results 1 – 25 of 296) sorted by relevance
12345678910>>...12
4 Memory Allocation Guide7 Linux provides a variety of APIs for memory allocation. You can14 Most of the memory allocation APIs use GFP flags to express how that16 pages", the underlying memory allocation function.18 Diversity of the allocation APIs combined with the numerous GFP flags26 Of course there are cases when other allocation APIs and different GFP45 * If the allocation is performed from an atomic context, e.g interrupt48 ``GFP_NOWAIT`` allocation is likely to fail. Users of this flag need52 will be stressed unless allocation succeeds, you may use ``GFP_ATOMIC``.67 example may be a hardware allocation that maps data directly into[all …]
4 There are a number of memory-allocation subsystems in the kernel, each32 which NUMA node should be used for the allocation of the housekeeping87 how the allocation functions choose which specific piece of memory to107 - gen_pool_first_fit_align forces the allocation to have a specific110 - gen_pool_first_fit_order_align aligns the allocation to the order of the111 size. A 60-byte allocation will thus be 64-byte aligned, for example.117 If the indicated memory is not available the allocation fails.
4 ID Allocation18 only ID allocation, and as a result is much more memory-efficient.36 ID by passing a ``NULL`` pointer to the allocation function; initialise the67 idr_preload_end() after the allocation.
20 if bounce buffering is necessary. If so, the DMA layer manages the allocation,106 A single allocation from swiotlb is limited to IO_TLB_SIZE * IO_TLB_SEGSIZE119 of the bounce buffer that slightly reduces the maximum size of an allocation.128 parameter specifies the allocation of bounce buffer space must start at a174 trying an allocation, so contention may occur if swiotlb is relatively busy175 overall. But an allocation request does not fail unless all areas do not have186 Because a bounce buffer allocation can't cross a slot set boundary, eliminating190 change in the future, the initial pool allocation might need to be done with196 the amount of memory available for allocation as bounce buffers. If a bounce200 because the memory allocation may block, and as noted above, swiotlb requests[all …]
16 functions and macros for memory allocations. The allocation request19 when an allocation fails and those that don't.
98 optimize allocation (avoid coming up with large pages) instead of110 This tells the DMA-mapping subsystem to suppress allocation failure reports113 On some architectures allocation failures are reported with error messages120 where allocation failures are not a problem, and shouldn't bother the logs.
4 MEMORY ALLOCATION PROFILING23 When set to "never", memory allocation profiling overhead is minimized and it30 If compression fails, a warning is issued and memory allocation profiling gets57 Memory allocation profiling builds off of code tagging, which is a library for62 To add accounting for an allocation call, we replace it with a macro66 - calls the real allocation function71 do not properly belong to the outer allocation context and should be counted75 Thus, proper usage requires determining which function in an allocation call82 - switch its allocation call to the _noprof() version, e.g. kmalloc_noprof()98 - Hook your data structure's init function, like any other allocation function.
11 simple allocation framework for page fragments. This is used by the17 cache is needed. This provides a central point for the fragment allocation20 which can be expensive at allocation time. However due to the nature of23 to be disabled when executing the fragment allocation.26 allocation. The netdev_alloc_cache is used by callers making use of the41 avoid calling get_page per allocation.
12 be that the caller is willing to fail the allocation without incurring the14 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 detrimental46 with a slight change in the allocation routine, it is possible to reduce74 probably because all allocation requests are coming from intr context88 watermark[WMARK_HIGH]. When low_on_memory is set, page allocation requests will
34 PTE with pointer to its lock, or returns NULL if allocation failed;66 must be called on PTE table allocation / freeing.69 allocation: slab uses page->slab_cache for its pages.76 allocation and pagetable_pmd_dtor() on freeing.78 Allocation usually happens in pmd_alloc_one(), freeing in pmd_free() and79 pmd_free_tlb(), but make sure you cover all PMD table allocation / freeing
75 selected zone/node cannot satisfy the allocation request. This situation,87 By default, Linux will attempt to satisfy memory allocation requests from the90 for the node where the request originates. This is called "local allocation."95 Local allocation will tend to keep subsequent access to the allocated memory110 allocation behavior using Linux NUMA memory policy. [see127 Some kernel allocations do not want or cannot tolerate this allocation fallback132 A typical model for making such an allocation is to obtain the node id of the135 the node id returned. When such an allocation fails, the requesting subsystem138 itself on allocation failure. The kernel profiling subsystem is an example of
10 When allocation happens, information about allocation such as call stack15 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 done40 not affect to allocation performance, especially if the static keys jump155 -a Sort by memory allocation time.221 st stacktrace stack trace of the page allocation234 st stacktrace stack trace of the page allocation
83 Allocation chapter105 Thread stack allocation is initiated from clone(), fork(), vfork(),131 Testing VMAP allocation with guard pages147 high-order stack allocation, at least when the cache hits.
4 Page Allocation
4 Slab Allocation
5 The kmem tracing system captures events related to object and page allocation8 - Slab allocation of small objects of unknown type (kmalloc)9 - Slab allocation of small objects of known type10 - Page allocation17 1. Slab allocation of small objects of unknown type27 internal fragmented as a result of the allocation pattern. By correlating29 the allocation sites were.32 2. Slab allocation of small objects of known type45 3. Page allocation54 These four events deal with page allocation and freeing. mm_page_alloc is[all …]
15 use clustered allocation, so that each bit in the ext4 block allocation19 This means that each bit in the block allocation bitmap now addresses20 256 4k blocks. This shrinks the total size of the block allocation29 128MiB); however, the minimum allocation unit becomes a cluster, not a
38 use "local allocation" described below. However, during boot82 A VMA policy will govern the allocation of pages that back138 support allocation at fault time--a.k.a lazy allocation--so hugetlbfs140 Although hugetlbfs segments now support lazy allocation, their support197 closest to the node where the allocation takes place.200 This mode specifies that the allocation should be attempted202 allocation fails, the kernel will search other nodes, in order209 and the policy is interpreted as local allocation. "Local"210 allocation policy can be viewed as a Preferred policy that211 starts at the node containing the cpu where the allocation[all …]
75 allocation failures to be noticeable from userland. It allows paging145 given allocation.153 guaranteed, but it may be more likely in case the allocation is for a166 allocation failure and directly reclaim pages and compact200 allocation library) may want to know the size (in bytes) of a249 allocation failure to throttle the next allocation attempt::332 You can control hugepage allocation policy in tmpfs with mount option354 There's also sysfs knob to control hugepage allocation policy for internal369 control mTHP allocation:441 allocation was successful.[all …]
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 is18 similar to numa_miss and is incremented on the node where allocation succeeds53 preferred node. As a result, such allocation will not increase the numa_foreign
79 * improved file allocation (multi-block alloc)89 * inode allocation using large virtual block groups via flex_bg90 * delayed allocation174 main file system. Enabling this mode will disable delayed allocation194 delayed allocation even older data can be lost on power failure since275 Number of filesystem blocks that mballoc will try to use for allocation280 Defer block allocation until just before ext4 writes out the block(s)281 in question. This allows ext4 to better allocation decisions more285 Disable delayed allocation. Blocks are allocated when the data is324 and force that any delayed allocation blocks are allocated such that at[all …]
180 described as having a height of 1080, with the memory allocation for each buffer228 Allocation chapter233 buffer-allocation interface available at either kernel or userspace level, the234 client makes an arbitrary choice of allocation interface such as Vulkan, GBM, or237 Each allocation request must take, at a minimum: the pixel format, a list of239 this set of properties in different ways, such as allowing allocation in more244 allocation, any padding required, and further properties of the underlying250 After allocation, the client must query the allocator to determine the actual272 memory. For this reason, each import and allocation API must provide a separate314 In the latter case, the allocation is as discussed above, being provided with a[all …]
19 allocation tag for each 16-byte granule in the physical address space.23 the logical tag against the allocation tag and potentially raise an36 To access the allocation tags, a user process must enable the Tagged40 ``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 the44 supported and the allocation tags can be shared between processes.55 ``MADV_FREE`` may have the allocation tags cleared (set to 0) at any62 the logical and allocation tags occurs on access, there are three230 The allocation tags for user memory mapped with ``PROT_MTE`` are dumped303 * Set the allocation tag on the destination address.[all …]
41 The centralised memory allocation allows the driver to ensure that the42 maximum possible resource allocation can be made to the video subsystem45 The primary issue with memory allocation is that of moving the video
45 But userspace can ask for allocation from full address space by53 A high hint address would only affect the allocation in question, but not58 to allocation from 47-bit address space.