Linux操作系统学习笔记（九）内存管理之分页

╰半橙微兮° 2023-02-24 03:59 34阅读 0赞

## 一. 前言 ##

上文分析了内存再用户态的结构体`mm_struct`及各个区域映射的`vm_area_struct`以及32位和64位的内核态结构体，本文将基于这些结构来分析Linux的内存管理系统。内存管理系统包括虚拟内存和物理内存的分页以及虚拟内存和物理内存的映射。本文将介绍分页机制，而映射则在下文中说明。本文首先简单介绍`SMP`和`NUMA`系统，然后对物理内存的节点、区域、页结构进行分析，在此基础上剖析伙伴系统和`Slub Allocator`的实现原理，最后介绍页面交换。

## 二. 内存模型 ##

在计算机的发展历程中，内存模型经历了平坦内存模型、SMP和NUMA三种架构。

*  [平坦内存模型(Flat Memory Model)][Flat Memory Model]，又称线性内存模型，在这种模式下，采取连续的物理地址和页，所以非常容易根据地址获取页号，反之亦然。此种布局非常简单，而且是线性增长，利于使用。但是随着内存需求的增大、进程数的变多、为了安全考虑，这种模型渐渐地无法满足要求。
 *  [对称多处理 SMP(Symmetric MultiProcessing)][SMP_Symmetric MultiProcessing]，是一种多处理器的电脑硬件架构，在对称多处理架构下，每个处理器的地位都是平等的，对资源的使用权限相同。现代多数的多处理器系统都采用对称多处理架构。在这个系统中，拥有超过一个以上的处理器，这些处理器都连接到同一个共享的主存上，并由单一操作系统来控制。在对称多处理系统上，在操作系统的支持下，无论进程是处于用户空间，或是内核态，都可以分配到任何一个处理器上运行。因此，进程可以在不同的处理器间移动，达到负载平衡，使系统的效率提升。
 *  [非均衡访存模型 NUMA(Non-Uniform Memory Access)][NUMA_Non-Uniform Memory Access]。在这种模式下，内存不是一整块。每个 CPU 都有自己的本地内存，CPU 访问本地内存不用过总线，因而速度要快很多，每个 CPU 和内存在一起，称为一个 NUMA 节点。但是，在本地内存不足的情况下，每个 CPU 都可以去另外的 NUMA 节点申请内存，这个时候访问延时就会比较长。

## 三. 节点、区域和页 ##

### 3.1 节点 ###

这里主要分析NUMA模型。我们将内存分为多个节点对应多个CPU，每个节点再被分成一个一个的区域，每个区域有多个页面。由于页需要全局唯一定位，页还是需要有全局唯一的页号的。但是由于物理内存不是连起来的了，因此页号也就不再连续了。于是内存模型就变成了非连续内存模型。NUMA节点对应的结构为`pglist_data`，主要包括

*  节点ID `node_id`
 *  节点区域相关：`node_zones`，`node_zonelists`，`nr_zones`
 *  节点的页数组：`node_mam_map`
 *  节点的起始页号：`node_start_pfn`
 *  节点中包含不连续的物理内存地址页数：`node_spanned_pages`
 *  可用的物理页面数目：`node_present_pates`
 *  页面回收、交换相关：`kswapd_wait`，`kswapd`，`kswapd_order`，`kswapd_failures`，`kswapd_classzone_idx`

/* * On NUMA machines, each NUMA node would have a pg_data_t to describe * it's memory layout. On UMA machines there is a single pglist_data which * describes the whole memory. * * Memory statistics and page replacement data structures are maintained on a * per-zone basis. */
    typedef struct pglist_data { 
    	struct zone node_zones[MAX_NR_ZONES];
    	struct zonelist node_zonelists[MAX_ZONELISTS];
    	int nr_zones;
    	struct page *node_mem_map;    
    	unsigned long node_start_pfn;
    	unsigned long node_present_pages; /* total number of physical pages */
    	unsigned long node_spanned_pages; /* total size of physical page range, including holes */
    	int node_id;
    	wait_queue_head_t kswapd_wait;
    	wait_queue_head_t pfmemalloc_wait;
    	struct task_struct *kswapd;	/* Protected by mem_hotplug_begin/end() */
    	int kswapd_order;
    	enum zone_type kswapd_classzone_idx;
    	int kswapd_failures;		/* Number of 'reclaimed == 0' runs */
    ......
    } pg_data_t;

### 3.2 区域 ###

每个节点可分成一个个的区域，`node_zones`存储了这些区域，`node_zonelist`以链表形式存储备用节点和它的内存区域的情况，`nr_zones`表示区域总数。区域的类型有如下几种，在上节中已简单提过，这里详细说明。

*  ZONE\_DMA 是指可用于作 DMA（Direct Memory Access，直接内存存取）的内存。DMA 是这样一种机制：要把外设的数据读入内存或把内存的数据传送到外设，原来都要通过 CPU 控制完成，但是这会占用 CPU，影响 CPU 处理其他事情，所以有了 DMA 模式。CPU 只需向 DMA 控制器下达指令，让 DMA 控制器来处理数据的传送，数据传送完毕再把信息反馈给 CPU，这样就可以解放 CPU。对于 64 位系统，有两个 DMA 区域。除了上面说的 ZONE\_DMA，还有 ZONE\_DMA32。
 *  ZONE\_NORMAL 是直接映射区，即内核态前896M空间
 *  ZONE\_HIGHMEM 是高端内存区，对于 32 位系统来说超过 896M 的地方，对于 64 位没必要有的一段区域。
 *  ZONE\_MOVABLE 是可移动区域，通过将物理内存划分为可移动分配区域和不可移动分配区域来避免内存碎片。

enum zone_type { 
    #ifdef CONFIG_ZONE_DMA
        ZONE_DMA,
    #endif
    #ifdef CONFIG_ZONE_DMA32
        ZONE_DMA32,
    #endif
        ZONE_NORMAL,
    #ifdef CONFIG_HIGHMEM
        ZONE_HIGHMEM,
    #endif
        ZONE_MOVABLE,
        __MAX_NR_ZONES
    };

区域的实现数据结构为`zone`，主要包括

*  区域初始页`zone_start_pfn`
 *  区域总共跨多少页 `spanned_pages`
 *  区域在物理内存中真实存在的页数`present_pages`
 *  区域被伙伴系统管理的所有页数`managed_pages`
 *  冷热页区分`per_cpu_pagest`：如果一个页被加载到 CPU 高速缓存里面，这就是一个热页（Hot Page），CPU 读起来速度会快很多，如果没有就是冷页（Cold Page）。由于每个 CPU 都有自己的高速缓存，因而 `per_cpu_pageset` 也是每个 CPU 一个。

struct zone { 
    ......
    	struct pglist_data	*zone_pgdat;
    	struct per_cpu_pageset __percpu *pageset;
    ......
    	/* zone_start_pfn == zone_start_paddr >> PAGE_SHIFT */
    	unsigned long		zone_start_pfn;
    	/* * spanned_pages is the total pages spanned by the zone, including * holes, which is calculated as: * spanned_pages = zone_end_pfn - zone_start_pfn; * * present_pages is physical pages existing within the zone, which * is calculated as: * present_pages = spanned_pages - absent_pages(pages in holes); * * managed_pages is present pages managed by the buddy system, which * is calculated as (reserved_pages includes pages allocated by the * bootmem allocator): * managed_pages = present_pages - reserved_pages; * * So present_pages may be used by memory hotplug or memory power * management logic to figure out unmanaged pages by checking * (present_pages - managed_pages). And managed_pages should be used * by page allocator and vm scanner to calculate all kinds of watermarks * and thresholds. * * Locking rules: * * zone_start_pfn and spanned_pages are protected by span_seqlock. * It is a seqlock because it has to be read outside of zone->lock, * and it is done in the main allocator path. But, it is written * quite infrequently. * * The span_seq lock is declared along with zone->lock because it is * frequently read in proximity to zone->lock. It's good to * give them a chance of being in the same cacheline. * * Write access to present_pages at runtime should be protected by * mem_hotplug_begin/end(). Any reader who can't tolerant drift of * present_pages should get_online_mems() to get a stable value. */
    	atomic_long_t		managed_pages;
    	unsigned long		spanned_pages;
    	unsigned long		present_pages;
    	const char		*name;
    ......
    	int initialized;
    	/* Write-intensive fields used from the page allocator */
    	ZONE_PADDING(_pad1_)
    	/* free areas of different sizes */
    	struct free_area	free_area[MAX_ORDER];
    	/* zone flags, see below */
    	unsigned long		flags;
    	/* Primarily protects free_area */
    	spinlock_t		lock;
    	/* Write-intensive fields used by compaction and vmstats. */
    	ZONE_PADDING(_pad2_)
    	/* * When free pages are below this point, additional steps are taken * when reading the number of free pages to avoid per-cpu counter * drift allowing watermarks to be breached */
    	unsigned long percpu_drift_mark;
    ......
    	bool			contiguous;
    	ZONE_PADDING(_pad3_)
    	/* Zone statistics */
    	atomic_long_t		vm_stat[NR_VM_ZONE_STAT_ITEMS];
    	atomic_long_t		vm_numa_stat[NR_VM_NUMA_STAT_ITEMS];
    } ____cacheline_internodealigned_in_smp;

### 3.3 页 ###

每个区域有很多个页，现在让我们将目光投向页的结构`page`。页中使用了大量的联合，其原因在于页有着多种不同的使用方式。

*  整页使用方式。在前面介绍过，该种情况也存在两种页，一种是直接映射虚拟地址空间的匿名页（Anonymous Page），另一种则是用于关联文件、然后再和虚拟地址空间建立映射的页，称之为[内存映射文件（Memory-mapped File）][Memory-mapped File]。对于该种模式，会使用联合里的以下变量
    
     *  `struct address_space *mapping` ：用于内存映射，如果是匿名页，最低位为 1；如果是映射文件，最低位为 0
     *  `pgoff_t index` ：映射区的偏移量
     *  `atomic_t _mapcount`：指向该页的页表数
     *  `struct list_head lru` ：表示这一页应该在一个链表上，例如这个页面被换出，就在换出页的链表中；
     *  `compound` 相关的变量用于复合页（Compound Page），就是将物理上连续的两个或多个页看成一个独立的大页。
 *  小块内存使用方式。在很多情况下，我们只需要使用少量内存，因此采用了[**slab allocator**技术][slab allocator]用于分配小块内存`slab`。它的基本原理是从内存管理模块申请一整块页，然后划分成多个小块的存储池，用复杂的队列来维护这些小块的状态（状态包括：被分配了 / 被放回池子 / 应该被回收）。也正是因为 `slab allocator` 对于队列的维护过于复杂，后来就有了一种不使用队列的分配器 `slub allocator`，但是里面还是用了很多 带有`slab`的API ，因为它保留了 `slab` 的用户接口，可以看成 slab allocator 的另一种实现。该种模式会使用联合里的以下变量
    
     *  `s_mem` ：正在使用的 slab 的第一个对象
     *  `freelist` ：池子中的空闲对象
     *  `rcu_head` ：需要释放的列表
 *  小块内存分配器slob，非常简单，常用于小型嵌入式系统

struct page { 
    	unsigned long flags;		/* Atomic flags, some possibly updated asynchronously */
    	/* * Five words (20/40 bytes) are available in this union. * WARNING: bit 0 of the first word is used for PageTail(). That * means the other users of this union MUST NOT use the bit to * avoid collision and false-positive PageTail(). */
    	union { 
    		struct { 	/* Page cache and anonymous pages */
    			/** * @lru: Pageout list, eg. active_list protected by * pgdat->lru_lock. Sometimes used as a generic list * by the page owner. */
    			struct list_head lru;
    			/* See page-flags.h for PAGE_MAPPING_FLAGS */
    			struct address_space *mapping;
    			pgoff_t index;		/* Our offset within mapping. */
    			/** * @private: Mapping-private opaque data. * Usually used for buffer_heads if PagePrivate. * Used for swp_entry_t if PageSwapCache. * Indicates order in the buddy system if PageBuddy. */
    			unsigned long private;
    		};
    		struct { 	/* page_pool used by netstack */
    			/** * @dma_addr: might require a 64-bit value even on * 32-bit architectures. */
    			dma_addr_t dma_addr;
    		};
    		struct { 	/* slab, slob and slub */
    			union { 
    				struct list_head slab_list;	/* uses lru */
    				struct { 	/* Partial pages */
    					struct page *next;
    ......
    				};
    			};
    			struct kmem_cache *slab_cache; /* not slob */
    			/* Double-word boundary */
    			void *freelist;		/* first free object */
    			union { 
    				void *s_mem;	/* slab: first object */
    				unsigned long counters;		/* SLUB */
    				struct { 			/* SLUB */
    					unsigned inuse:16;
    					unsigned objects:15;
    					unsigned frozen:1;
    				};
    			};
    		};
    ......
    		struct { 	/* ZONE_DEVICE pages */
    			/** @pgmap: Points to the hosting device page map. */
    			struct dev_pagemap *pgmap;
    			unsigned long hmm_data;
    			unsigned long _zd_pad_1;	/* uses mapping */
    		};
    		/** @rcu_head: You can use this to free a page by RCU. */
    		struct rcu_head rcu_head;
    	};
    ......
    } _struct_page_alignment;

## 四. 用户态页的分配 ##

在上节中我们介绍了页按大小分配大致有伙伴系统和小块内存分配的slub分配。本节就这两种展开讨论。

### 4.1 伙伴系统 ###

对于要分配比较大的内存，例如到分配页级别的，可以使用[伙伴系统（Buddy System）][Buddy System]。伙伴分配机制可以归纳如下。

*  采取多个链表将空闲页组织起来，每个链表中的节点包含的页块数目不同，即第`i`个链表中的每个节点拥有`2^i`个页。
 *  当向内核请求分配 `(2^(i-1)，2^i]`数目的页块时，按照 `2^i` 页块请求处理，并将其分裂。
 *  如果对应的页块链表中没有空闲页块，那我们就在更大的页块链表中去找，并对其进行分裂。如请求128个页，如果128页块链表无空闲则请求256链表，并将其分裂为两个128链表。

源码实现于`alloc_pages`中，传参的定义如注释中所示，`order`表示分配2的`order`次方个页，`gfp_mask`表示分配区域，主要有

*  GFP\_USER：用于一个用户进程希望通过内存映射的方式访问某些硬件的缓存，例如显卡缓存
 *  GFP\_KERNEL：用于内核中分配页，主要分配 ZONE\_NORMAL 区域，也即直接映射区
 *  GFP\_HIGHMEM：用于分配高端内存区域
 *  GFP\_FS：用于文件映射区
 *  GFP\_ATOMIC：表示该页内容不会进入休眠

这里涉及到了一种加快内存速度的技术：[交叉存取技术（interleaved memory）][interleaved memory]。该存储方式会将存储体分为多个模块，每个模块类似于负载均衡逐个写入，这样当前字节被刷新时，可以不影响下一个字节的访问。交叉存储主要补偿DRAM等存储器相对较慢的读写速度。读或写每一个内存块，都需要等待内存块给出ready信号，才能读写下一字节。交叉存储将连续信息分散到各个块中，读写时可以同时等待多个内存块给出ready信号，从而提高了读写的速度。

static inline struct page *
    alloc_pages(gfp_t gfp_mask, unsigned int order)
    { 
    	return alloc_pages_current(gfp_mask, order);
    }
    
    /** * alloc_pages_current - Allocate pages. * * @gfp: * %GFP_USER user allocation, * %GFP_KERNEL kernel allocation, * %GFP_HIGHMEM highmem allocation, * %GFP_FS don't call back into a file system. * %GFP_ATOMIC don't sleep. * @order: Power of two of allocation size in pages. 0 is a single page. * * Allocate a page from the kernel page pool. When not in * interrupt context and apply the current process NUMA policy. * Returns NULL when no page can be allocated. */
    struct page *alloc_pages_current(gfp_t gfp, unsigned order)
    { 
    	struct mempolicy *pol = &default_policy;
    	struct page *page;
    	if (!in_interrupt() && !(gfp & __GFP_THISNODE))
    		pol = get_task_policy(current);
    	/* * No reference counting needed for current->mempolicy * nor system default_policy */
    	if (pol->mode == MPOL_INTERLEAVE)
    		page = alloc_page_interleave(gfp, order, interleave_nodes(pol));
    	else
    		page = __alloc_pages_nodemask(gfp, order,
    				policy_node(gfp, pol, numa_node_id()),
    				policy_nodemask(gfp, pol));
    	return page;
    }
    EXPORT_SYMBOL(alloc_pages_current);

交叉存取的`alloc_page_interleave()`函数实际上通过调用`__alloc_page()`最终也会调用`__alloc_pages_nodemask()`函数来实现分配。`__alloc_pages_nodemask()`是伙伴系统的核心方法，它会调用 `get_page_from_freelist()`在一个循环中轮询区域，先看当前节点的 zone，如果找不到空闲页则再看备用节点的 zone，直到找到为止。

/* * This is the 'heart' of the zoned buddy allocator. */
    struct page *
    __alloc_pages_nodemask(gfp_t gfp_mask, unsigned int order, int preferred_nid,
    							nodemask_t *nodemask)
    { 
    	struct page *page;
    	unsigned int alloc_flags = ALLOC_WMARK_LOW;
    	gfp_t alloc_mask; /* The gfp_t that was actually used for allocation */
    	struct alloc_context ac = {  };
    ......
    	gfp_mask &= gfp_allowed_mask;
    	alloc_mask = gfp_mask;
    	if (!prepare_alloc_pages(gfp_mask, order, preferred_nid, nodemask, &ac, &alloc_mask, &alloc_flags))
    		return NULL;
    	finalise_ac(gfp_mask, &ac);
    	/* * Forbid the first pass from falling back to types that fragment * memory until all local zones are considered. */
    	alloc_flags |= alloc_flags_nofragment(ac.preferred_zoneref->zone, gfp_mask);
    	/* First allocation attempt */
    	page = get_page_from_freelist(alloc_mask, order, alloc_flags, &ac);
    ......
    }
    EXPORT_SYMBOL(__alloc_pages_nodemask);

`get_page_from_freelist()`函数如下所示，主要调用`rmqueue()`找寻合适大小的队列，并取出页面。通过`rmqueue()->__rmqueue()->__rmqueue_smallest()`最终来到`__rmqueue_smallest()函数`

/* * get_page_from_freelist goes through the zonelist trying to allocate * a page. */
    static struct page *
    get_page_from_freelist(gfp_t gfp_mask, unsigned int order, int alloc_flags,
    						const struct alloc_context *ac)
    { 	
    ......
    	for_next_zone_zonelist_nodemask(zone, z, ac->zonelist, ac->high_zoneidx,
    								ac->nodemask) { 
    ......
    		page = rmqueue(ac->preferred_zoneref->zone, zone, order,
    				gfp_mask, alloc_flags, ac->migratetype);
    		if (page) { 
    			prep_new_page(page, order, gfp_mask, alloc_flags);
    			/* * If this is a high-order atomic allocation then check * if the pageblock should be reserved for the future */
    			if (unlikely(order && (alloc_flags & ALLOC_HARDER)))
    				reserve_highatomic_pageblock(page, zone, order);
    			return page;
    		} 
    ......
    }

在`__rmqueue_smallest()`中，实现了伙伴系统的找寻逻辑。从当前的`order`开始循环，如果`page`为空则`order++`，否则从当前链表`lru`中删除该页块，通过`expand()`函数将该区域剩余页块分配到其他对应的`order`链表中，最后返回该页块。

/* * Go through the free lists for the given migratetype and remove * the smallest available page from the freelists */
    static __always_inline
    struct page *__rmqueue_smallest(struct zone *zone, unsigned int order,
    						int migratetype)
    { 
    	unsigned int current_order;
    	struct free_area *area;
    	struct page *page;
    	/* Find a page of the appropriate size in the preferred list */
    	for (current_order = order; current_order < MAX_ORDER; ++current_order) { 
    		area = &(zone->free_area[current_order]);
    		page = list_first_entry_or_null(&area->free_list[migratetype],
    							struct page, lru);
    		if (!page)
    			continue;
    		list_del(&page->lru);
    		rmv_page_order(page);
    		area->nr_free--;
    		expand(zone, page, order, current_order, area, migratetype);
    		set_pcppage_migratetype(page, migratetype);
    		return page;
    	}
    	return NULL;
    }

`expand()`函数中将页块区域前移，`size`右移即除2，然后使用`list_add`加入链表之中

/* * The order of subdivision here is critical for the IO subsystem. * Please do not alter this order without good reasons and regression * testing. Specifically, as large blocks of memory are subdivided, * the order in which smaller blocks are delivered depends on the order * they're subdivided in this function. This is the primary factor * influencing the order in which pages are delivered to the IO * subsystem according to empirical testing, and this is also justified * by considering the behavior of a buddy system containing a single * large block of memory acted on by a series of small allocations. * This behavior is a critical factor in sglist merging's success. * * -- nyc */
    static inline void expand(struct zone *zone, struct page *page,
    	int low, int high, struct free_area *area,
    	int migratetype)
    { 
    	unsigned long size = 1 << high;
    	while (high > low) { 
    		area--;
    		high--;
    		size >>= 1;
    		VM_BUG_ON_PAGE(bad_range(zone, &page[size]), &page[size]);
    		/* * Mark as guard pages (or page), that will allow to * merge back to allocator when buddy will be freed. * Corresponding page table entries will not be touched, * pages will stay not present in virtual address space */
    		if (set_page_guard(zone, &page[size], high, migratetype))
    			continue;
    		list_add(&page[size].lru, &area->free_list[migratetype]);
    		area->nr_free++;
    		set_page_order(&page[size], high);
    	}
    }

最后以一张结构图作为总结

![img][]

### 4.2 `slub allocator` ###

任务`task_struct`在派生时，会调用`alloc_task_struct_node()`分配`task_struct`对象，其底层调用`kmem_ cache_alloc_node()`函数在`task_struct`的缓存区域`kmem_cache *task_struct_cachep`分配内存。在系统初始化的时候，`task_struct_cachep` 会被 `kmem_cache_create()` 函数创建。这个函数专门用于分配 `task_struct` 对象的缓存。这个缓存区的名字就叫 `task_struct`。

缓存区中每一块的大小正好等于 `task_struct` 的大小，也即 `arch_task_struct_size`。有了这个缓存区，每次创建 `task_struct` 的时候，先调用 `kmem_cache_alloc_node()`函数在缓存里面看看有没有直接可用的。当一个进程结束，`task_struct` 也不用直接被销毁，而是调用`kmem_cache_free()`放回到缓存中。这样，新进程创建的时候，我们就可以直接用现成的缓存中的 `task_struct` 了，从而加快了申请、释放速度。

static struct kmem_cache *task_struct_cachep;
    
    task_struct_cachep = kmem_cache_create("task_struct",
          arch_task_struct_size, align,
          SLAB_PANIC|SLAB_NOTRACK|SLAB_ACCOUNT, NULL);
    
    static inline struct task_struct *alloc_task_struct_node(int node)
    { 
        return kmem_cache_alloc_node(task_struct_cachep, GFP_KERNEL, node);
    }
    
    static inline void free_task_struct(struct task_struct *tsk)
    { 
        kmem_cache_free(task_struct_cachep, tsk);
    }

下面分析一下缓冲区`kmem_cache`结构体。

*  `kmem_cached_cpu`和`kmem_cached_node`：每个NUMA节点都对应一个，分别是缓存分配的`fast path`和`slow path`。每次分配的时候，要先从 `kmem_cache_cpu` 进行分配。如果 `kmem_cache_cpu` 里面没有空闲的块，那就到 `kmem_cache_node` 中进行分配；如果还是没有空闲的块，才去伙伴系统分配新的页。
 *  `size`，`object_size`和`offset`：通过链表`list_head`，所有的小内存块会联系起来存放在缓冲区，用于`task_struct`、`mm_struct`、`fs_struct`等申请小内存块，`object_size`表示某内存块的大小，`size`表示该内存块加上指针的总大小，`offset`表示下一个空闲内存块的指针的偏移量。

/* * Slab cache management. */
    struct kmem_cache { 
    	struct kmem_cache_cpu __percpu *cpu_slab;
    	/* Used for retrieving partial slabs, etc. */
    	slab_flags_t flags;
    	unsigned long min_partial;
    	unsigned int size;	/* The size of an object including metadata */
    	unsigned int object_size;/* The size of an object without metadata */
    	unsigned int offset;	/* Free pointer offset */
    #ifdef CONFIG_SLUB_CPU_PARTIAL
    	/* Number of per cpu partial objects to keep around */
    	unsigned int cpu_partial;
    #endif
    	struct kmem_cache_order_objects oo;
    	/* Allocation and freeing of slabs */
    	struct kmem_cache_order_objects max;
    	struct kmem_cache_order_objects min;
    	gfp_t allocflags;	/* gfp flags to use on each alloc */
    	int refcount;		/* Refcount for slab cache destroy */
    	void (*ctor)(void *);
    	unsigned int inuse;		/* Offset to metadata */
    	unsigned int align;		/* Alignment */
    	unsigned int red_left_pad;	/* Left redzone padding size */
    	const char *name;	/* Name (only for display!) */
    	struct list_head list;	/* List of slab caches */
    ......
    	unsigned int useroffset;	/* Usercopy region offset */
    	unsigned int usersize;		/* Usercopy region size */
    	struct kmem_cache_node *node[MAX_NUMNODES];
    };

首先来看看快分配方式`kmem_cached_cpu`，该结构体中`page`指向内存页块的第一页，`freelist`指向下一个可用的内存页块，`partial`表示部分被分配部分为空的页，该项为备用项，仅当`page`满了才会在`partial`中寻找，而`partial`本身指向的是`kmem_cached_node`中的`partial`链表。

struct kmem_cache_cpu { 
    	void **freelist;	/* Pointer to next available object */
    	unsigned long tid;	/* Globally unique transaction id */
    	struct page *page;	/* The slab from which we are allocating */
    #ifdef CONFIG_SLUB_CPU_PARTIAL
    	struct page *partial;	/* Partially allocated frozen slabs */
    #endif
    #ifdef CONFIG_SLUB_STATS
    	unsigned stat[NR_SLUB_STAT_ITEMS];
    #endif
    };

`kmem_cached_node`结构体中也有类似的成员变量，但是相较之下会有更多详细信息，如`slab`链表总长度、空闲内存块的数量等等。

/* * The slab lists for all objects. */
    struct kmem_cache_node { 
    	spinlock_t list_lock;
    #ifdef CONFIG_SLAB
    	struct list_head slabs_partial;	/* partial list first, better asm code */
    	struct list_head slabs_full;
    	struct list_head slabs_free;
    	unsigned long total_slabs;	/* length of all slab lists */
    	unsigned long free_slabs;	/* length of free slab list only */
    	unsigned long free_objects;
    	unsigned int free_limit;
    	unsigned int colour_next;	/* Per-node cache coloring */
    	struct array_cache *shared;	/* shared per node */
    	struct alien_cache **alien;	/* on other nodes */
    	unsigned long next_reap;	/* updated without locking */
    	int free_touched;		/* updated without locking */
    #endif
    #ifdef CONFIG_SLUB
    	unsigned long nr_partial;
    	struct list_head partial;
    ......
    #endif
    };

下面回到缓冲区的分配函数`kmem_cache_alloc_node()`和释放函数`kmem_cache_free`。分配函数`kmem_cache_alloc_node()`实际调用`slab_alloc_node()`。从这里可以看出快通道和慢通道的处理逻辑。

*  快通道：尝试取出`kmem_cache_cpu cpu_slab`的`freelist`，如果有空闲则返回，否则进入慢通道
 *  慢通道：调用`__slab_alloc()`分配新的内存块

/* * Inlined fastpath so that allocation functions (kmalloc, kmem_cache_alloc) * have the fastpath folded into their functions. So no function call * overhead for requests that can be satisfied on the fastpath. * * The fastpath works by first checking if the lockless freelist can be used. * If not then __slab_alloc is called for slow processing. * * Otherwise we can simply pick the next object from the lockless free list. */
    static __always_inline void *slab_alloc_node(struct kmem_cache *s,
    		gfp_t gfpflags, int node, unsigned long addr)
    { 
    	void *object;
    	struct kmem_cache_cpu *c;
    	struct page *page;
    	unsigned long tid;
    	s = slab_pre_alloc_hook(s, gfpflags);
    	if (!s)
    		return NULL;
    redo:
    	/* * Must read kmem_cache cpu data via this cpu ptr. Preemption is * enabled. We may switch back and forth between cpus while * reading from one cpu area. That does not matter as long * as we end up on the original cpu again when doing the cmpxchg. * * We should guarantee that tid and kmem_cache are retrieved on * the same cpu. It could be different if CONFIG_PREEMPT so we need * to check if it is matched or not. */
    	do { 
    		tid = this_cpu_read(s->cpu_slab->tid);
    		c = raw_cpu_ptr(s->cpu_slab);
    	} while (IS_ENABLED(CONFIG_PREEMPT) &&
    		 unlikely(tid != READ_ONCE(c->tid)));
    	/* * Irqless object alloc/free algorithm used here depends on sequence * of fetching cpu_slab's data. tid should be fetched before anything * on c to guarantee that object and page associated with previous tid * won't be used with current tid. If we fetch tid first, object and * page could be one associated with next tid and our alloc/free * request will be failed. In this case, we will retry. So, no problem. */
    	barrier();
    	/* * The transaction ids are globally unique per cpu and per operation on * a per cpu queue. Thus they can be guarantee that the cmpxchg_double * occurs on the right processor and that there was no operation on the * linked list in between. */
    	object = c->freelist;
    	page = c->page;
    	if (unlikely(!object || !node_match(page, node))) { 
    		object = __slab_alloc(s, gfpflags, node, addr, c);
    		stat(s, ALLOC_SLOWPATH);
    	}
    ......
    	return object;
    }

`__slab_alloc()`主要逻辑如下

*  在此尝试`kmem_cache_cpu`中的`freelist`是否可用，因为当前进程可能被中断，等回到该进程继续执行时可能已经有了空闲内存块可以直接使用了，因此先检查一下
 *  跳转到`new_slab`标签，检查`kmem_cache_cpu`中的`paritial`，如果`partial`不为空则将`kmem_cache_cpu`中的`page`替换为`partial`，跳转至`redo`标签再次尝试分配
 *  依然失败，则调用`new_slab_objects()`分配新内存块

/* * Slow path. The lockless freelist is empty or we need to perform * debugging duties. * * Processing is still very fast if new objects have been freed to the * regular freelist. In that case we simply take over the regular freelist * as the lockless freelist and zap the regular freelist. * * If that is not working then we fall back to the partial lists. We take the * first element of the freelist as the object to allocate now and move the * rest of the freelist to the lockless freelist. * * And if we were unable to get a new slab from the partial slab lists then * we need to allocate a new slab. This is the slowest path since it involves * a call to the page allocator and the setup of a new slab. * * Version of __slab_alloc to use when we know that interrupts are * already disabled (which is the case for bulk allocation). */
    static void *___slab_alloc(struct kmem_cache *s, gfp_t gfpflags, int node,
    			  unsigned long addr, struct kmem_cache_cpu *c)
    { 
    	void *freelist;
    	struct page *page;
    	page = c->page;
    	if (!page)
    		goto new_slab;
    redo:
    	if (unlikely(!node_match(page, node))) { 
    		int searchnode = node;
    		if (node != NUMA_NO_NODE && !node_present_pages(node))
    			searchnode = node_to_mem_node(node);
    		if (unlikely(!node_match(page, searchnode))) { 
    			stat(s, ALLOC_NODE_MISMATCH);
    			deactivate_slab(s, page, c->freelist, c);
    			goto new_slab;
    		}
    	}
    	/* * By rights, we should be searching for a slab page that was * PFMEMALLOC but right now, we are losing the pfmemalloc * information when the page leaves the per-cpu allocator */
    	if (unlikely(!pfmemalloc_match(page, gfpflags))) { 
    		deactivate_slab(s, page, c->freelist, c);
    		goto new_slab;
    	}
    	/* must check again c->freelist in case of cpu migration or IRQ */
    	freelist = c->freelist;
    	if (freelist)
    		goto load_freelist;
    	freelist = get_freelist(s, page);
    	if (!freelist) { 
    		c->page = NULL;
    		stat(s, DEACTIVATE_BYPASS);
    		goto new_slab;
    	}
    	stat(s, ALLOC_REFILL);
    load_freelist:
    	/* * freelist is pointing to the list of objects to be used. * page is pointing to the page from which the objects are obtained. * That page must be frozen for per cpu allocations to work. */
    	VM_BUG_ON(!c->page->frozen);
    	c->freelist = get_freepointer(s, freelist);
    	c->tid = next_tid(c->tid);
    	return freelist;
    new_slab:
    	if (slub_percpu_partial(c)) { 
    		page = c->page = slub_percpu_partial(c);
    		slub_set_percpu_partial(c, page);
    		stat(s, CPU_PARTIAL_ALLOC);
    		goto redo;
    	}
    	freelist = new_slab_objects(s, gfpflags, node, &c);
    	if (unlikely(!freelist)) { 
    		slab_out_of_memory(s, gfpflags, node);
    		return NULL;
    	}
    	page = c->page;
    	if (likely(!kmem_cache_debug(s) && pfmemalloc_match(page, gfpflags)))
    		goto load_freelist;
    	/* Only entered in the debug case */
    	if (kmem_cache_debug(s) &&
    			!alloc_debug_processing(s, page, freelist, addr))
    		goto new_slab;	/* Slab failed checks. Next slab needed */
    	deactivate_slab(s, page, get_freepointer(s, freelist), c);
    	return freelist;
    }

`new_slab_objects()`函数逻辑如下

*  调用`get_partial()`函数，根据`node`找到对应的`kmem_cache_node`然后调用`get_partial_node()`分配内存块。实际分配通过`acquire_slab()`函数完成，该函数会分配完成返回内存块指针并保存在`freelist`中，从 `kmem_cache_node` 的 `partial` 链表中拿下一大块内存来，并且将 `freelist`，也就是第一块空闲的缓存块赋值给 `t`。并且当第一轮循环的时候，将 `kmem_cache_cpu` 的 `page` 指向取下来的这一大块内存，返回的 `object` 就是这块内存里面的第一个缓存块 `t`。如果 `kmem_cache_cpu` 也有一个 `partial`，就会进行第二轮，再次取下一大块内存来，这次调用 `put_cpu_partial()`，放到 `kmem_cache_cpu` 的 `partial` 里面。如果 `kmem_cache_node` 里面也没有空闲的内存，这就说明原来分配的页里面都放满了，执行下一步。
 *  调用`new_slab()`函数，向伙伴系统请求`2^order`个`page`，将请求的`page`构建成一个`slab`。分配的时候，要按 `kmem_cache_order_objects` 里面的 `order` 来。如果第一次分配不成功，说明内存已经很紧张了，那就换成 min 版本的 `kmem_cache_order_objects`。其调用链为`new_slab()->allocate_slab()->alloc_slab_page()->__alloc_pages_node()->__alloc_pages()->__alloc_pages_nodemask()`，从这里回到了伙伴系统，可见上文对该函数的分析。

static inline void *new_slab_objects(struct kmem_cache *s, gfp_t flags,
    			int node, struct kmem_cache_cpu **pc)
    { 
    	void *freelist;
    	struct kmem_cache_cpu *c = *pc;
    	struct page *page;
    	WARN_ON_ONCE(s->ctor && (flags & __GFP_ZERO));
    	freelist = get_partial(s, flags, node, c);
    	if (freelist)
    		return freelist;
    	page = new_slab(s, flags, node);
    	if (page) { 
    		c = raw_cpu_ptr(s->cpu_slab);
    		if (c->page)
    			flush_slab(s, c);
    		/* * No other reference to the page yet so we can * muck around with it freely without cmpxchg */
    		freelist = page->freelist;
    		page->freelist = NULL;
    		stat(s, ALLOC_SLAB);
    		c->page = page;
    		*pc = c;
    	}
    	return freelist;
    }

至此，页的分配就介绍完了。简单概括就是伙伴系统将多个连续页面整合为页块以供大规模使用，`slub allocator`将从伙伴系统申请的大块切成小块，放在缓存，并分配给其他系统。物理内存分页之后，通过`page_address()->lowmem_page_address()->page_to_virt()`调用链转化为虚拟地址以使用。

## 五. 内核页表 ##

内核态的页表在系统初始化的时候就需要创建，而非可以等到用的时候再创建页并映射。在 `arch/x86/include/asm/pgtable_64.h`有如下定义

extern p4d_t level4_kernel_pgt[512];
    extern p4d_t level4_ident_pgt[512];
    extern pud_t level3_kernel_pgt[512];
    extern pud_t level3_ident_pgt[512];
    extern pmd_t level2_kernel_pgt[512];
    extern pmd_t level2_fixmap_pgt[512];
    extern pmd_t level2_ident_pgt[512];
    extern pte_t level1_fixmap_pgt[512 * FIXMAP_PMD_NUM];
    extern pgd_t init_top_pgt[];
    #define swapper_pg_dir init_top_pgt

其中`swapper_pg_dir` 指向内核最顶级的目录 `pgd`，同时出现的还有几个页表目录，其中 `XXX_ident_pgt` 对应的是直接映射区，`XXX_kernel_pgt` 对应的是内核代码区，`XXX_fixmap_pgt` 对应的是固定映射区。

初始化的位置位于`arch\x86\kernel\head_64.S`，以全局变量的方式保存。这里`quad` 表示声明了一项的内容，`org`表示跳到了某个位置。

`init_top_pgt`是内核页的顶级目录，首先将其指向`level3_ident_pgt`，即直接映射区页表的三级目录。前文中有说过直接映射区物理内存和虚拟内存通过减去偏移量实现，即`__START_KERNEL_map`，虚拟地址空间的内核代码段的起始地址。通过这种方式，我们得到了其对应的物理地址。接着我们通过`PGD_PAGE_OFFSET`偏移量和`PGD_START_KERNEL`偏移量进行两次跳转，其中`PGD_PAGE_OFFSET`对应`__PAGE_OFFSET_BASE`，即虚拟地址空间里面内核的起始地址。第二项则指向`__START_KERNEL_map`，即虚拟地址空间里面内核代码段的起始地址。其他代码也是同理，最终形成如下表所示的整个页表项的初始化工作。

__INITDATA
    
    NEXT_PAGE(init_top_pgt)
      .quad   level3_ident_pgt - __START_KERNEL_map + _KERNPG_TABLE
      .org    init_top_pgt + PGD_PAGE_OFFSET*8, 0
      .quad   level3_ident_pgt - __START_KERNEL_map + _KERNPG_TABLE
      .org    init_top_pgt + PGD_START_KERNEL*8, 0
      /* (2^48-(2*1024*1024*1024))/(2^39) = 511 */
      .quad   level3_kernel_pgt - __START_KERNEL_map + _PAGE_TABLE
    
    NEXT_PAGE(level3_ident_pgt)
      .quad  level2_ident_pgt - __START_KERNEL_map + _KERNPG_TABLE
      .fill  511, 8, 0
    NEXT_PAGE(level2_ident_pgt)
      /* Since I easily can, map the first 1G.
       * Don't set NX because code runs from these pages.
       */
      PMDS(0, __PAGE_KERNEL_IDENT_LARGE_EXEC, PTRS_PER_PMD)
    
    NEXT_PAGE(level3_kernel_pgt)
      .fill  L3_START_KERNEL,8,0
      /* (2^48-(2*1024*1024*1024)-((2^39)*511))/(2^30) = 510 */
      .quad  level2_kernel_pgt - __START_KERNEL_map + _KERNPG_TABLE
      .quad  level2_fixmap_pgt - __START_KERNEL_map + _PAGE_TABLE
    
    NEXT_PAGE(level2_kernel_pgt)
      /*
       * 512 MB kernel mapping. We spend a full page on this pagetable
       * anyway.
       *
       * The kernel code+data+bss must not be bigger than that.
       *
       * (NOTE: at +512MB starts the module area, see MODULES_VADDR.
       *  If you want to increase this then increase MODULES_VADDR
       *  too.)
       */
      PMDS(0, __PAGE_KERNEL_LARGE_EXEC,
        KERNEL_IMAGE_SIZE/PMD_SIZE)
    
    NEXT_PAGE(level2_fixmap_pgt)
      .fill  506,8,0
      .quad  level1_fixmap_pgt - __START_KERNEL_map + _PAGE_TABLE
      /* 8MB reserved for vsyscalls + a 2MB hole = 4 + 1 entries */
      .fill  5,8,0
    
    NEXT_PAGE(level1_fixmap_pgt)
      .fill  51
      
    PGD_PAGE_OFFSET = pgd_index(__PAGE_OFFSET_BASE)
    PGD_START_KERNEL = pgd_index(__START_KERNEL_map)
    L3_START_KERNEL = pud_index(__START_KERNEL_map)

![img][img 1]

内核页表定义完了，一开始这里面的页表能够覆盖的内存范围比较小。例如内核代码区 512M，直接映射区 1G。这个时候，其实只要能够映射基本的内核代码和数据结构就可以了。可以看出里面还空着很多项，可以用于将来映射巨大的内核虚拟地址空间，等用到的时候再进行映射。如果是用户态进程页表，会有 `mm_struct` 指向进程顶级目录 `pgd`，对于内核来讲，也定义了一个 `mm_struct`，指向 `swapper_pg_dir`。

struct mm_struct init_mm = { 
        .mm_rb    = RB_ROOT,
        .pgd    = swapper_pg_dir,
        .mm_users  = ATOMIC_INIT(2),
        .mm_count  = ATOMIC_INIT(1),
        .mmap_sem  = __RWSEM_INITIALIZER(init_mm.mmap_sem),
        .page_table_lock =  __SPIN_LOCK_UNLOCKED(init_mm.page_table_lock),
        .mmlist    = LIST_HEAD_INIT(init_mm.mmlist),
        .user_ns  = &init_user_ns,
        INIT_MM_CONTEXT(init_mm)
    };

内核页表的初始化工作会在系统启动时，`start_kernel()`通过调用`setup_arch()`完成。`load_cr3(swapper_pg_dir)` 说明内核页表要开始起作用了，并且刷新了 `TLB`，初始化 `init_mm` 的成员变量，最重要的就是 `init_mem_mapping()`，通过调用链`init_mem_mapping()->init_memory_mapping()->kernel_physical_mapping_init()`最终通过 `__va` 将物理地址转换为虚拟地址，然后再创建虚拟地址和物理地址的映射页表。`__va`和`__pa`本身可以直接完成物理地址和虚拟地址的转换，但是CPU在保护模式下访问虚拟地址需要通过CR3寄存器，因此必须完成该映射页表的创建工作。

void __init setup_arch(char **cmdline_p)
    { 
        /* * copy kernel address range established so far and switch * to the proper swapper page table */
        clone_pgd_range(swapper_pg_dir     + KERNEL_PGD_BOUNDARY,
            initial_page_table + KERNEL_PGD_BOUNDARY,
            KERNEL_PGD_PTRS);
    
        load_cr3(swapper_pg_dir);
        __flush_tlb_all();
    ......
        init_mm.start_code = (unsigned long) _text;
        init_mm.end_code = (unsigned long) _etext;
        init_mm.end_data = (unsigned long) _edata;
        init_mm.brk = _brk_end;
    ......
        init_mem_mapping();
    ......
    }

## 六. 页面交换 ##

由于虚拟内存是远大于物理内存的，在物理内存中加载所有的虚拟内存页显然是异想天开，因此我们必须要有页面的交换。和CPU调度相似，页的交换也包括主动的交换和被动的交换。

*  被动页面回收：当分配内存的时候发现物理内存不够用了，则尝试回收。如申请页面会调用`get_page_from_freelist()`，该函数会通过调用链`get_page_from_freelist()->node_reclaim()->__node_reclaim()->shrink_node()`尝试是否可以对当前的内存节点执行换出操作，从而腾出空
 *  主动页面管理：在内核中，内核线程`kswapd`即负责该部分的功能。下面详细展开分析一下该部分功能。

如下所示为`kswapd()`源码，核心调用链为`balance_pgdat()->kswapd_shrink_node()->shrink_node()`，所以被动回收和主动管理最后殊途同归，回到了同样的函数`shrink_node()`。

/* * The background pageout daemon, started as a kernel thread * from the init process. * * This basically trickles out pages so that we have _some_ * free memory available even if there is no other activity * that frees anything up. This is needed for things like routing * etc, where we otherwise might have all activity going on in * asynchronous contexts that cannot page things out. * * If there are applications that are active memory-allocators * (most normal use), this basically shouldn't matter. */
    static int kswapd(void *p)
    { 
    	unsigned int alloc_order, reclaim_order;
    	unsigned int classzone_idx = MAX_NR_ZONES - 1;
    	pg_data_t *pgdat = (pg_data_t*)p;
    	struct task_struct *tsk = current;
    ......
    	for ( ; ; ) { 
    ......
    kswapd_try_sleep:
    		kswapd_try_to_sleep(pgdat, alloc_order, reclaim_order,
    					classzone_idx);
    ......
    		/* * Reclaim begins at the requested order but if a high-order * reclaim fails then kswapd falls back to reclaiming for * order-0. If that happens, kswapd will consider sleeping * for the order it finished reclaiming at (reclaim_order) * but kcompactd is woken to compact for the original * request (alloc_order). */
    		trace_mm_vmscan_kswapd_wake(pgdat->node_id, classzone_idx,
    						alloc_order);
    		reclaim_order = balance_pgdat(pgdat, alloc_order, classzone_idx);
    ......
        }
    	return 0;
    }

`shrink_node()`实际调用`shrink_node_memcg()`。这里面有个 `LRU` 列表，所有的页面都被挂在 `LRU` 列表中。`LRU` 也就是最近最少使用。这个列表里面会按照活跃程度进行排序，这样就容易把不怎么用的内存页拿出来做处理。内存页总共分两类，一类是匿名页，和虚拟地址空间进行关联；一类是内存映射，不但和虚拟地址空间关联，还和文件管理关联。它们每一类都有两个列表，一个是 `active`，一个是 `inactive`。顾名思义，`active` 就是比较活跃的，`inactive` 就是不怎么活跃的。这两个里面的页会变化，过一段时间，活跃的可能变为不活跃，不活跃的可能变为活跃。如果要换出内存，那就是从不活跃的列表中找出最不活跃的，换出到硬盘上。

`shrink_list()` 会先缩减活跃页面列表，再压缩不活跃的页面列表。对于不活跃列表的缩减，`shrink_inactive_list()` 就需要对页面进行回收；对于匿名页来讲，需要分配 `swap()`，将内存页写入文件系统；对于内存映射关联了文件的，我们需要将在内存中对于文件的修改写回到文件中。

/* * This is a basic per-node page freer. Used by both kswapd and direct reclaim. */
    static void shrink_node_memcg(struct pglist_data *pgdat, struct mem_cgroup *memcg,
    			      struct scan_control *sc, unsigned long *lru_pages)
    { 
    	struct lruvec *lruvec = mem_cgroup_lruvec(pgdat, memcg);
    	unsigned long nr[NR_LRU_LISTS];
    	unsigned long targets[NR_LRU_LISTS];
    	unsigned long nr_to_scan;
    	enum lru_list lru;
    ......
    	while (nr[LRU_INACTIVE_ANON] || nr[LRU_ACTIVE_FILE] ||
    					nr[LRU_INACTIVE_FILE]) { 
    		unsigned long nr_anon, nr_file, percentage;
    		unsigned long nr_scanned;
    		for_each_evictable_lru(lru) { 
    			if (nr[lru]) { 
    				nr_to_scan = min(nr[lru], SWAP_CLUSTER_MAX);
    				nr[lru] -= nr_to_scan;
    				nr_reclaimed += shrink_list(lru, nr_to_scan,
    							    lruvec, memcg, sc);
    			}
    		}
    ......
    }
        
    enum lru_list { 
      LRU_INACTIVE_ANON = LRU_BASE,
      LRU_ACTIVE_ANON = LRU_BASE + LRU_ACTIVE,
      LRU_INACTIVE_FILE = LRU_BASE + LRU_FILE,
      LRU_ACTIVE_FILE = LRU_BASE + LRU_FILE + LRU_ACTIVE,
      LRU_UNEVICTABLE,
      NR_LRU_LISTS
    };
    
    #define for_each_evictable_lru(lru) for (lru = 0; lru <= LRU_ACTIVE_FILE; lru++)
    
    static unsigned long shrink_list(enum lru_list lru, unsigned long nr_to_scan,
    				 struct lruvec *lruvec, struct mem_cgroup *memcg,
    				 struct scan_control *sc)
    { 
    	if (is_active_lru(lru)) { 
    		if (inactive_list_is_low(lruvec, is_file_lru(lru),
    					 memcg, sc, true))
    			shrink_active_list(nr_to_scan, lruvec, sc, lru);
    		return 0;
    	}
    	return shrink_inactive_list(nr_to_scan, lruvec, sc, lru);
    }

## 六. 总结 ##

内存管理可谓非常复杂，本文较为详尽的介绍了内存管理中分页和页的分配相关内容，下文将继续介绍物理内存和虚拟内存的映射。

## 源码资料 ##

\[1\] [pg\_list\_data][pg_list_data]

\[2\] [page][]

\[3\] [buddy system][]

\[4\] [slub allocator][]

\[5\] [kmem\_cache\_alloc\_node][kmem_cache_alloc_node]

\[6\] [kswapd][]

## 参考资料 ##

\[1\] wiki

\[2\] [elixir.bootlin.com/linux][elixir.bootlin.com_linux]

\[3\] [woboq][]

\[4\] Linux-insides

\[5\] 深入理解Linux内核

\[6\] Linux内核设计的艺术

\[7\] 极客时间 趣谈Linux操作系统

[Flat Memory Model]: https://en.wikipedia.org/wiki/Flat_memory_model
[SMP_Symmetric MultiProcessing]: https://en.wikipedia.org/wiki/Symmetric_multiprocessing
[NUMA_Non-Uniform Memory Access]: https://en.wikipedia.org/wiki/Non-uniform_memory_access
[Memory-mapped File]: https://en.wikipedia.org/wiki/Memory-mapped_file
[slab allocator]: https://en.wikipedia.org/wiki/Slab_allocation
[Buddy System]: https://en.wikipedia.org/wiki/Buddy_memory_allocation
[interleaved memory]: https://en.wikipedia.org/wiki/Interleaved_memory
[img]: /images/20230209/fab6d5313db94162b70aeec38455542d.png
[img 1]: /images/20230209/3fc5543e144c4563868ae7455f0f6c20.png
[pg_list_data]: https://code.woboq.org/linux/linux/include/linux/mmzone.h.html#pglist_data
[page]: https://code.woboq.org/linux/linux/include/linux/mm_types.h.html#page
[buddy system]: https://code.woboq.org/linux/linux/mm/page_alloc.c.html#get_page_from_freelist
[slub allocator]: https://code.woboq.org/linux/linux/include/linux/slub_def.h.html#kmem_cache
[kmem_cache_alloc_node]: https://code.woboq.org/linux/linux/mm/slub.c.html#kmem_cache_alloc_node
[kswapd]: https://code.woboq.org/linux/linux/mm/vmscan.c.html#3825
[elixir.bootlin.com_linux]: https://elixir.bootlin.com/linux/v5.7-rc1/source
[woboq]: https://code.woboq.org/