| Both sides previous revisionPrevious revisionNext revision | Previous revision |
| proc:pagemap_file [2017/04/06 10:22] – peter | proc:pagemap_file [2020/07/15 09:30] (current) – external edit 127.0.0.1 |
|---|
| This file contains a 64-bit set of flags for each page, indexed by PFN. The flags are (from fs/proc/page.c, above kpageflags_read): | This file contains a 64-bit set of flags for each page, indexed by PFN. The flags are (from fs/proc/page.c, above kpageflags_read): |
| |
| ^No.^Name^Description^ | ^ No. ^ Name ^ Description ^ |
| |0|LOCKED|Page is being locked for exclusive access, e.g. by undergoing read/write IO.| | | 0 | LOCKED | Page is being locked for exclusive access, e.g. by undergoing read/write IO. | |
| |1|ERROR|IO error occurred.| | | 1 | ERROR | IO error occurred. | |
| |2|REFERENCED|Page has been referenced since last LRU list enqueue/requeue.| | | 2 | REFERENCED | Page has been referenced since last LRU list enqueue/requeue. | |
| |3|UPTODATE|Page has up-to-date data. i.e. for file backed page: (in-memory data revision >= on-disk one).| | | 3 | UPTODATE | Page has up-to-date data. i.e. for file backed page: (in-memory data revision >= on-disk one). | |
| |4|DIRTY|Page has been written to, hence contains new data. i.e. for file backed page: (in-memory data revision > on-disk one).| | | 4 | DIRTY | Page has been written to, hence contains new data. i.e. for file backed page: (in-memory data revision > on-disk one). | |
| |5|LRU|Page is in one of the LRU lists.| | | 5 | LRU | Page is in one of the LRU lists. | |
| |6|ACTIVE|Page is in the active LRU list.| | | 6 | ACTIVE | Page is in the active LRU list. | |
| |7|SLAB|Page is managed by the SLAB/SLOB/SLUB/SLQB kernel memory allocator. When compound page is used, SLUB/SLQB will only set this flag on the head page; SLOB will not flag it at all.| | | 7 | SLAB | Page is managed by the SLAB/SLOB/SLUB/SLQB kernel memory allocator. When compound page is used, SLUB/SLQB will only set this flag on the head page; SLOB will not flag it at all. | |
| |8|WRITEBACK|Page is being synced to disk.| | | 8 | WRITEBACK | Page is being synced to disk. | |
| |9|RECLAIM|Page will be reclaimed soon after its pageout IO completed.| | | 9 | RECLAIM | Page will be reclaimed soon after its pageout IO completed. | |
| |10|BUDDY|A free memory block managed by the buddy system allocator. The buddy system organizes free memory in blocks of various orders. An order N block has 2^N physically contiguous pages, with the BUDDY flag set for and _only_ for the first page.| | | 10 | BUDDY | A free memory block managed by the buddy system allocator. The buddy system organizes free memory in blocks of various orders. An order N block has 2 N physically contiguous pages, with the BUDDY flag set for and _only_ for the first page. | |
| |11|MMAP|A memory mapped page.| | | 11 | MMAP | A memory mapped page. | |
| |12|ANON|A memory mapped page that is not part of a file.| | | 12 | ANON | A memory mapped page that is not part of a file. | |
| |13|SWAPCACHE|Page is mapped to swap space, i.e. has an associated swap entry.| | | 13 | SWAPCACHE | Page is mapped to swap space, i.e. has an associated swap entry. | |
| |14|SWAPBACKED|Page is backed by swap/RAM.| | | 14 | SWAPBACKED | Page is backed by swap/RAM. | |
| |15|COMPOUND_HEAD|A compound page with order N consists of 2^N physically contiguous pages. A compound page with order 2 takes the form of "HTTT", where H donates its head page and T donates its tail page(s). The major consumers of compound pages are hugeTLB pages. See [[Kernel:Huge Table Pages|Huge Table Pages]], the SLUB etc. Memory allocators and various device drivers. However in this interface, only huge/giga pages are made visible to end users.| | | 15 | COMPOUND_HEAD | A compound page with order N consists of 2N physically contiguous pages. A compound page with order 2 takes the form of "HTTT", where H donates its head page and T donates its tail page(s). The major consumers of compound pages are hugeTLB pages. See [[Kernel:Huge Page Table|Huge Table Pages]], the SLUB etc. Memory allocators and various device drivers. However in this interface, only huge/giga pages are made visible to end users. | |
| |16|COMPOUND_TAIL|A compound page with order N consists of 2^N physically contiguous pages. A compound page with order 2 takes the form of "HTTT", where H donates its head page and T donates its tail page(s). The major consumers of compound pages are hugeTLB pages. See [[Kernel:Huge Table Pages|Huge Table Pages]], the SLUB etc. Memory allocators and various device drivers. However in this interface, only huge/giga pages are made visible to end users.| | | 16 | COMPOUND_TAIL | A compound page with order N consists of 2N physically contiguous pages. A compound page with order 2 takes the form of "HTTT", where H donates its head page and T donates its tail page(s). The major consumers of compound pages are hugeTLB pages. See [[Kernel:Huge Page Table|Huge Table Pages]], the SLUB etc. Memory allocators and various device drivers. However in this interface, only huge/giga pages are made visible to end users. | |
| |17|HUGE|This is an integral part of a [[Kernel:Huge Table Pages|HugeTLB]] page.| | | 17 | HUGE | This is an integral part of a [[Kernel:Huge Page Table|Huge Page Table]] page. | |
| |18|UNEVICTABLE|Page is in the unevictable (non-)LRU list. It is somehow pinned and not a candidate for LRU page reclaims, e.g. ramfs pages, shmctl(SHM_LOCK) and mlock() memory segments.| | | 18 | UNEVICTABLE | Page is in the unevictable (non-)LRU list. It is somehow pinned and not a candidate for LRU page reclaims, e.g. ramfs pages, shmctl(SHM_LOCK) and **mlock()** memory segments. | |
| |19|HWPOISON|Hardware detected memory corruption on this page: Don't touch the data!| | | 19 | HWPOISON | Hardware detected memory corruption on this page: Don't touch the data! | |
| |20|NOPAGE|No page frame exists at the requested address.| | | 20 | NOPAGE | No page frame exists at the requested address. | |
| |21|KSM|Identical memory pages dynamically shared between one or more processes.| | | 21 | KSM | Identical memory pages dynamically shared between one or more processes. | |
| |
| |
| The general procedure for using pagemap to find out about a process' memory usage goes like this: | The general procedure for using pagemap to find out about a process' memory usage goes like this: |
| |
| 1. Read /proc/pid/maps to determine which parts of the memory space are mapped to what. | - Read /proc/pid/maps to determine which parts of the memory space are mapped to what. |
| 2. Select the maps you are interested in -- all of them, or a particular library, or the stack or the heap, etc. | - Select the maps you are interested in -- all of them, or a particular library, or the stack or the heap, etc. |
| 3. Open /proc/pid/pagemap and seek to the pages you would like to examine. | - Open /proc/pid/pagemap and seek to the pages you would like to examine. |
| 4. Read a u64 for each page from pagemap. | - Read a u64 for each page from pagemap. |
| 5. Open /proc/kpagecount and/or /proc/kpageflags. For each PFN you just read, seek to that entry in the file, and read the data you want. | - Open /proc/kpagecount and/or /proc/kpageflags. For each PFN you just read, seek to that entry in the file, and read the data you want. |
| |
| For example, to find the "unique set size" (USS), which is the amount of memory that a process is using that is not shared with any other process, you can go through every map in the process, find the PFNs, look those up in kpagecount, and tally up the number of pages that are only referenced once. | For example, to find the "unique set size" (USS), which is the amount of memory that a process is using that is not shared with any other process, you can go through every map in the process, find the PFNs, look those up in kpagecount, and tally up the number of pages that are only referenced once. |
