Skip to contentSkip to conversation

/proc/<pid>/pmaps - memory maps in granularity of pages

RFC PATCH Matt Mackall 3 participants 4 messages Aug 14, 2007 – Sep 5, 2007 2 messages not in the archive

lore
Share & tools
lore

A message that is not in the archive (sent off-list or not yet received): [email protected]

#1 lore raw
Quoted 50 lines · Fengguang Wu

Hello,

Matt Mackall brings us many memory-footprint-optimization opportunities with his pagemap/kpagemap patches. However I wonder if the binary interface can be improved.

This seq_file based implementation iterates in the unit of vmas. So super large vmas can be a problem. The next step is to to do address based iteration. That should not be hard.

Andrew, please stop me early if it is at all a wrong interface :)

Thank you,
Fengguang
===

Show a process's memory maps page-by-page in /proc/<pid>/pmaps. It helps to analyze application's memory footprint in a comprehensive way.

Pages share the same states are grouped into a page range. For each page range, the following fields are exported:
- first page index
- number of pages in the range
- well known page/pte flags
- number of mmap users

Only page flags not expected to disappear in the near future are exported:

Y:young R:referenced A:active U:uptodate P:ptedirty D:dirty W:writeback

Here is a sample output:

# cat /proc/$$/pmaps
08048000-080c9000 r-xp 08048000 00:00 0
32840   129     Y_A_P__ 1
080c9000-080f6000 rwxp 080c9000 00:00 0                                  [heap]
32969   45      Y_A_P__ 1
f7dba000-f7dc3000 r-xp 00000000 03:00 176633                             /lib/libnss_files-2.3.6.so
0       1       Y_AU___ 1
1       1       YR_U___ 1
5       1       YR_U___ 1
8       1       Y_AU___ 1
f7dc3000-f7dc5000 rwxp 00008000 03:00 176633                             /lib/libnss_files-2.3.6.so
8       2       Y_A_P__ 1
f7dc5000-f7dcd000 r-xp 00000000 03:00 176635                             /lib/libnss_nis-2.3.6.so
0       1       Y_AU___ 1
1       1       YR_U___ 1
4       1       YR_U___ 1
7       1       Y_AU___ 1
f7dcd000-f7dcf000 rwxp 00007000 03:00 176635                             /lib/libnss_nis-2.3.6.so
Quoted 8 lines
7       2       Y_A_P__ 1
f7dcf000-f7de1000 r-xp 00000000 03:00 176630                             /lib/libnsl-2.3.6.so
0       1       Y_AU___ 1
1       3       YR_U___ 1
16      1       YR_U___ 1
f7de1000-f7de3000 rwxp 00011000 03:00 176630                             /lib/libnsl-2.3.6.so
17      2       Y_A_P__ 1
[...]

That's a _lot_ of data to generate and parse. I doubt we can watch a larger app in realtime with this interface. And it doesn't give us physical page numbers either.

Signature · 1 line
Mathematics is the supreme nostalgia of our time.
#2 lore raw
Quoted 60 lines · Matt Mackall
Quoted 50 lines · Fengguang Wu

Hello,

Matt Mackall brings us many memory-footprint-optimization opportunities with his pagemap/kpagemap patches. However I wonder if the binary interface can be improved.

This seq_file based implementation iterates in the unit of vmas. So super large vmas can be a problem. The next step is to to do address based iteration. That should not be hard.

Andrew, please stop me early if it is at all a wrong interface :)

Thank you,
Fengguang
===

Show a process's memory maps page-by-page in /proc/<pid>/pmaps. It helps to analyze application's memory footprint in a comprehensive way.

Pages share the same states are grouped into a page range. For each page range, the following fields are exported:
- first page index
- number of pages in the range
- well known page/pte flags
- number of mmap users

Only page flags not expected to disappear in the near future are exported:

Y:young R:referenced A:active U:uptodate P:ptedirty D:dirty W:writeback

Here is a sample output:

# cat /proc/$$/pmaps
08048000-080c9000 r-xp 08048000 00:00 0
32840   129     Y_A_P__ 1
080c9000-080f6000 rwxp 080c9000 00:00 0                                  [heap]
32969   45      Y_A_P__ 1
f7dba000-f7dc3000 r-xp 00000000 03:00 176633                             /lib/libnss_files-2.3.6.so
0       1       Y_AU___ 1
1       1       YR_U___ 1
5       1       YR_U___ 1
8       1       Y_AU___ 1
f7dc3000-f7dc5000 rwxp 00008000 03:00 176633                             /lib/libnss_files-2.3.6.so
8       2       Y_A_P__ 1
f7dc5000-f7dcd000 r-xp 00000000 03:00 176635                             /lib/libnss_nis-2.3.6.so
0       1       Y_AU___ 1
1       1       YR_U___ 1
4       1       YR_U___ 1
7       1       Y_AU___ 1
f7dcd000-f7dcf000 rwxp 00007000 03:00 176635                             /lib/libnss_nis-2.3.6.so
Quoted 8 lines
7       2       Y_A_P__ 1
f7dcf000-f7de1000 r-xp 00000000 03:00 176630                             /lib/libnsl-2.3.6.so
0       1       Y_AU___ 1
1       3       YR_U___ 1
16      1       YR_U___ 1
f7de1000-f7de3000 rwxp 00011000 03:00 176630                             /lib/libnsl-2.3.6.so
17      2       Y_A_P__ 1
[...]
Quoted 1 line

That's a _lot_ of data to generate and parse. I doubt we can watch a

Yes, but won't be too bad because it works in a sparse way.

1) It will only generate output for resident pages, that normally is much smaller than the mapped size. Take my shell for example, the (size:rss) ratio is (7:1)!

wfg ~% cat /proc/$$/smaps |grep Size|sum
sum 50552.000
avg 777.723

wfg ~% cat /proc/$$/smaps |grep Rss|sum
sum 7604.000
avg 116.985

2) The page range trick suppresses more output. Look at these lines:

Quoted 4 lines
Quoted 4 lines

08048000-080c9000 r-xp 08048000 00:00 0
32840 129 Y_A_P__ 1
080c9000-080f6000 rwxp 080c9000 00:00 0 [heap]
32969 45 Y_A_P__ 1

It's interesting to see that the seq_file interface demands some more programming efforts, and provides this flexibility as well.

3) A 64bit number can be encoded in hex in 8 bytes, no more than its binary presentation. And often the text string will be much shorter because of the common small values.

4) String formatting is cheap. Much cheaper than pte/struct page walkings, and context switches. Not to mention its user friendliness.

Quoted 2 lines

larger app in realtime with this interface. And it doesn't give us physical page numbers either.

This could be a problem. Binary interface is discouraging, which is good and bad. The good thing about it is that we can safely export the raw PFN/page flag numbers without upsetting upset normal users. In this way a possible useful kernel debugging interface can be shipped everywhere.

If kpagemap is a reasonable kernel debug interface, I do not see the reason why kpagemap and pmaps cannot coexist :)

A message that is not in the archive (sent off-list or not yet received): [email protected]

#4 lore raw
Quoted 1 line · Fengguang Wu

3) A 64bit number can be encoded in hex in 8 bytes, no more than its

~~ sorry, I'm a fool!

Quoted 2 lines

binary presentation. And often the text string will be much shorter because of the common small values.

#5 lore raw
In reply to Matt Mackall
Quoted 6 lines · Matt Mackall
Quoted 5 lines · Fengguang Wu

Here is a sample output:

# cat /proc/$$/pmaps
080c9000-080f6000 rwxp 080c9000 00:00 0                                  [heap]
32969   45      Y_A_P__ 1

...

Quoted 11 lines
Quoted 3 lines

f7de1000-f7de3000 rwxp 00011000 03:00 176630 /lib/libnsl-2.3.6.so
17 2 Y_A_P__ 1
[...]

That's a _lot_ of data to generate and parse. I doubt we can watch a larger app in realtime with this interface. And it doesn't give us physical page numbers either.

Quoted 2 lines

080c9000-080f6000 rwxp 080c9000 00:00 0 [heap]
32969 45 Y_A_P__ 1

    ^^^^^   ^^
Quoted 1 line
Quoted 1 line

f7dba000-f7dc3000 r-xp 00000000 03:00 176633 /lib/libnss_files-2.3.6.so

                                    ^^ ^^ ^^^^^^

Since it's a new /proc file, we are not bound by compatibility.

Export *all* numbers in hex, and ensure that they are always even-chars wide ("fff" bad, "0fff" good). This way you can do binary<->string conversions (both in kernel and in userspace) 8 bits per CPU cycle, or even faster. --
vda