Home
last modified time | relevance | path

Searched refs:FAKE_NODE_MIN_SIZE (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/arch/x86/mm/
H A Dnuma_emulation.c113 FAKE_NODE_MIN_SIZE; in split_nodes_interleave()
142 end += FAKE_NODE_MIN_SIZE; in split_nodes_interleave()
149 end += FAKE_NODE_MIN_SIZE; in split_nodes_interleave()
157 * If there won't be at least FAKE_NODE_MIN_SIZE of in split_nodes_interleave()
162 mem_hole_size(end, dma32_end) < FAKE_NODE_MIN_SIZE) in split_nodes_interleave()
192 end += FAKE_NODE_MIN_SIZE; in find_end_of_node()
261 min_size = ALIGN(max(min_size, FAKE_NODE_MIN_SIZE), FAKE_NODE_MIN_SIZE); in split_nodes_size_interleave_uniform()
267 size = ALIGN_DOWN(size, FAKE_NODE_MIN_SIZE); in split_nodes_size_interleave_uniform()
293 * If there won't be at least FAKE_NODE_MIN_SIZE o in split_nodes_size_interleave_uniform()
[all...]
/kernel/linux/linux-6.6/arch/x86/mm/
H A Dnuma_emulation.c113 FAKE_NODE_MIN_SIZE; in split_nodes_interleave()
142 end += FAKE_NODE_MIN_SIZE; in split_nodes_interleave()
149 end += FAKE_NODE_MIN_SIZE; in split_nodes_interleave()
157 * If there won't be at least FAKE_NODE_MIN_SIZE of in split_nodes_interleave()
162 mem_hole_size(end, dma32_end) < FAKE_NODE_MIN_SIZE) in split_nodes_interleave()
192 end += FAKE_NODE_MIN_SIZE; in find_end_of_node()
261 min_size = ALIGN(max(min_size, FAKE_NODE_MIN_SIZE), FAKE_NODE_MIN_SIZE); in split_nodes_size_interleave_uniform()
267 size = ALIGN_DOWN(size, FAKE_NODE_MIN_SIZE); in split_nodes_size_interleave_uniform()
293 * If there won't be at least FAKE_NODE_MIN_SIZE o in split_nodes_size_interleave_uniform()
[all...]
/kernel/linux/linux-5.10/arch/x86/include/asm/
H A Dnuma.h74 #define FAKE_NODE_MIN_SIZE ((u64)32 << 20) macro
75 #define FAKE_NODE_MIN_HASH_MASK (~(FAKE_NODE_MIN_SIZE - 1UL))
/kernel/linux/linux-6.6/arch/x86/include/asm/
H A Dnuma.h74 #define FAKE_NODE_MIN_SIZE ((u64)32 << 20) macro
75 #define FAKE_NODE_MIN_HASH_MASK (~(FAKE_NODE_MIN_SIZE - 1UL))

Completed in 3 milliseconds