6aa36717c4
In addition to that text shown below the line which is
common to several commit messages, this patch contains
several minor changes with lessor impact upon the API:
. A 'read' was added to function procps_slabnode_count
(but only when necessary, i.e. info->nodes_used == 0).
. The #include header files are ordered alphabetically
now, with all those <sys/??> types separately grouped.
------------------------------------------------------
. The former 'chains' have now become 'stacks' without
the 'next' pointer in each result struct. The pointers
initially seemed to offer some flexibility with memory
allocations and benefits for the library access logic.
However, user access was always via displacement and a
a statically allocated chain was cumbersome to define.
. An enumerator ending in '_noop' will no longer serve
as a fencepost delimiter. Rather, it has become a much
more important and flexible user oriented tool. Adding
one or more such 'items' in any items list passed into
the library becomes the means of extending the 'stack'
to also include user (not just library) data. Any such
data is guaranteed to never be altered by the library.
. Anticipating PID support, where many different types
must be represented in a result structure, we'll adopt
a common naming standard. And, while not every results
structure currently needs to reflect disparate types a
union will be employed so the same dot qualifier ('.')
can be used consistently when accessing all such data.
Signed-off-by: Jim Warner <james.warner@comcast.net>
135 lines
4.0 KiB
C
135 lines
4.0 KiB
C
/*
|
|
* slab.h - slab related functions for libproc
|
|
*
|
|
* Copyright (C) 1998-2005 Albert Cahalan
|
|
* Copyright (C) 2015 Craig Small <csmall@enc.com.au>
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#ifndef _PROC_SLAB_H
|
|
#define _PROC_SLAB_H
|
|
|
|
__BEGIN_DECLS
|
|
|
|
enum slabs_item {
|
|
PROCPS_SLABS_OBJS, // u_int
|
|
PROCPS_SLABS_AOBJS, // u_int
|
|
PROCPS_SLABS_PAGES, // u_int
|
|
PROCPS_SLABS_SLABS, // u_int
|
|
PROCPS_SLABS_ASLABS, // u_int
|
|
PROCPS_SLABS_CACHES, // u_int
|
|
PROCPS_SLABS_ACACHES, // u_int
|
|
PROCPS_SLABS_SIZE_AVG, // u_int
|
|
PROCPS_SLABS_SIZE_MIN, // u_int
|
|
PROCPS_SLABS_SIZE_MAX, // u_int
|
|
PROCPS_SLABS_SIZE_TOTAL, // ul_int
|
|
PROCPS_SLABS_SIZE_ACTIVE, // ul_int
|
|
PROCPS_SLABS_noop, // n/a
|
|
PROCPS_SLABS_stack_end // n/a
|
|
};
|
|
|
|
enum slabnode_item {
|
|
PROCPS_SLABNODE_SIZE, // ul_int
|
|
PROCPS_SLABNODE_OBJS, // u_int
|
|
PROCPS_SLABNODE_AOBJS, // u_int
|
|
PROCPS_SLABNODE_OBJ_SIZE, // u_int
|
|
PROCPS_SLABNODE_OBJS_PER_SLAB, // u_int
|
|
PROCPS_SLABNODE_PAGES_PER_SLAB, // u_int
|
|
PROCPS_SLABNODE_SLABS, // u_int
|
|
PROCPS_SLABNODE_ASLABS, // u_int
|
|
PROCPS_SLABNODE_USE, // u_int
|
|
PROCPS_SLABNODE_NAME, // str
|
|
PROCPS_SLABNODE_noop, // n/a
|
|
PROCPS_SLABNODE_stack_end // n/a
|
|
};
|
|
|
|
struct procps_slabinfo;
|
|
|
|
struct slabnode_stack {
|
|
struct slab_result *head;
|
|
};
|
|
|
|
struct slab_result {
|
|
int item;
|
|
union {
|
|
unsigned int u_int;
|
|
unsigned long ul_int;
|
|
char *str;
|
|
} result;
|
|
};
|
|
|
|
int procps_slabinfo_new (struct procps_slabinfo **info);
|
|
int procps_slabinfo_read (struct procps_slabinfo *info);
|
|
|
|
int procps_slabinfo_ref (struct procps_slabinfo *info);
|
|
int procps_slabinfo_unref (struct procps_slabinfo **info);
|
|
|
|
unsigned long procps_slabs_get (
|
|
struct procps_slabinfo *info,
|
|
enum slabs_item item);
|
|
|
|
int procps_slabs_getstack (
|
|
struct procps_slabinfo *info,
|
|
struct slab_result *these);
|
|
|
|
int procps_slabnode_count (struct procps_slabinfo *info);
|
|
|
|
const char *procps_slabnode_getname (
|
|
struct procps_slabinfo *info,
|
|
int nodeid);
|
|
|
|
unsigned long procps_slabnode_get (
|
|
struct procps_slabinfo *info,
|
|
enum slabnode_item item,
|
|
int nodeid);
|
|
|
|
int procps_slabnode_getstack (
|
|
struct procps_slabinfo *info,
|
|
struct slab_result *these,
|
|
int nodeid);
|
|
|
|
int procps_slabnode_stack_fill (
|
|
struct procps_slabinfo *info,
|
|
struct slabnode_stack *stack,
|
|
int nodeid);
|
|
|
|
int procps_slabnode_stacks_fill (
|
|
struct procps_slabinfo *info,
|
|
struct slabnode_stack **stacks,
|
|
int maxstacks);
|
|
|
|
struct slabnode_stack *procps_slabnode_stack_alloc (
|
|
struct procps_slabinfo *info,
|
|
int maxitems,
|
|
enum slabnode_item *items);
|
|
|
|
struct slabnode_stack **procps_slabnode_stacks_alloc (
|
|
struct procps_slabinfo *info,
|
|
int maxstacks,
|
|
int stack_extra,
|
|
int maxitems,
|
|
enum slabnode_item *items);
|
|
|
|
struct slabnode_stack **procps_slabnode_stacks_sort (
|
|
struct procps_slabinfo *info,
|
|
struct slabnode_stack **stacks,
|
|
int numstacked,
|
|
enum slabnode_item sort);
|
|
|
|
__END_DECLS
|
|
|
|
#endif /* _PROC_SLAB_H */
|