library: refactor meminfo providing dynamic allocation

An earlier approach to meminfo chaining, referenced in
the patch shown below, represents the first baby steps
toward the goal of some generalized approach with PIDs
processing. However, statically allocating a chain for
each task or thread is totally impractical. And, while
a single chain could serve all PIDs, that would mean a
separate call to our library for each running process.

This commit is intended as the next evolutionary step,
dynamically allocating some 'result' chains to contain
as many or as few 'items' as a caller wishes. In other
words, holding only those 'items' of current interest.

This is the kind of service useful for both top and ps
programs if we finally get around to /proc/<PID> data.

Reference(s):
commit c3fd7473c5

Signed-off-by: Jim Warner <james.warner@comcast.net>
This commit is contained in:
Jim Warner
2015-07-11 00:00:00 -05:00
committed by Craig Small
parent cf6c2155dc
commit aab537bc13
3 changed files with 243 additions and 38 deletions

View File

@ -39,7 +39,9 @@ global:
procps_meminfo_ref;
procps_meminfo_unref;
procps_meminfo_get;
procps_meminfo_get_chain;
procps_meminfo_getchain;
procps_meminfo_chain_fill;
procps_meminfo_chain_alloc;
procps_slabinfo_new;
procps_slabinfo_read;
procps_slabinfo_ref;