]> git.itanic.dy.fi Git - scan-pagemap/commit
projects / scan-pagemap / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 1a6dba6) | patch
analyzer: Sort processes based on both swapped and present size
authorTimo Kokkonen <kaapeli@itanic.dy.fi>
Wed, 14 Jul 2010 19:10:28 +0000 (22:10 +0300)
committerTimo Kokkonen <kaapeli@itanic.dy.fi>
Wed, 14 Jul 2010 19:17:11 +0000 (22:17 +0300)
commit7bc4add75e45f028c1e7d4a36868be9a3152822e
treefc23eb433958ce2e319c8bbd6122409a56057b2atree | snapshot
parent1a6dba6a97e9fd0002ba39d856f12748e5be2be0commit | diff
analyzer: Sort processes based on both swapped and present size

Sorting by only the present size will cause the logic to get in an
infinite loop, since the exit criteria for the print loop is that the
sum of the swapped and present size needs to be zero.

Signed-off-by: Timo Kokkonen <kaapeli@itanic.dy.fi>
analyze.c diff | blob | history
Measure shared memory between processes