Boot Time Memory Management
Talkat Open Source Summit Europe + Embedded Linux Conference Europe 2019 · on Monday, 2019-10-28· at 14:25· Forum 2·
summary
Explains how Linux uses memblock as the early allocator, its APIs (memblock_reserve, memblock_free, memblock_alloc_try_nid and virtual-returning wrappers), and practical constraints: memblock arrays start at 188 entries and double on resize, causing potential overwrite risks unless disable array resizing is set; memblock lives in BSS so it is callable from assembly and replaces bootmem which is removed in 4.20; default is top-down allocation but bottom-up can be forced.
AI-written summary · about
chapters (13)
- 0:00Intro
- 0:51Physical Pager Locator
- 3:33Memory Management
- 12:23Member Log
- 15:24Member Locke
- 17:08ManWalkAleck
- 18:45Convenience wrappers
- 20:28Memory allocation
- 23:25Basic functions
- 26:53Main block state
- 28:38Reserved memory regions
- 30:18End of boot process
- 30:53References
related talks
38mDeferred Memblocks Init for Boot Time Reduction
51mIntroduction to Memory Management in Linux
24mConsolidating representations of the physical memory
39mMM101: Introduction to Linux Memory Management
48mPersistent Memory Usage within Linux Environment
26mLet's demystify memory
01h 36mLinux Memory Management and Containers
41mLies Programmers Believe about Memory
