c4d097c709
Many of our item enumerator identifiers are very long, especially in that <VMSTAT> module. Additionally, they all contain the exact same universal 'PROCPS_' prefix. The origins for this are likely found in the desire to avoid name clashes with other potential include files. But with procps-ng newlib, we've probably gone way too far. Did 'PROCPS_PIDS_TICS_SYSTEM' actually offer more protection against clash than 'PIDS_TICS_SYSTEM' does? I don't think so. Besides, no matter how big that name becomes, one can never guarantee they'll never be some clash. And, conversely, extremely short names will not always create conflict. Of course, in either case when some clash occurs, one can always #undef that problem. Thus, this commit will eliminate that 'PROCPS_' prefix making all of those enum identifiers a little shorter. And, we'll still be well above some ridiculously short (criminally short) names found in some common headers: - - - - - - - - - - <term.h> - 'tab', 'TTY', etc - - - - - - - - - - - - - - - - <search.h> - 'ENTER', ENTRY', 'FIND', etc ------------------------------------------------------ Finally, with this as a last of the wholesale changes, we will have established the naming conventions below: . only functions will begin with that 'procps_' prefix . exposed structures begin with the module/header name . item enumerators begin like structs, but capitalized . other enumerators work exactly like item enumerators . macros and constants begin just like the enumerators ------------------------------------------------------ Signed-off-by: Jim Warner <james.warner@comcast.net>
134 lines
3.9 KiB
C
134 lines
3.9 KiB
C
/*
|
|
* libprocps - Library to read proc filesystem
|
|
*
|
|
* Copyright (C) 1998-2005 Albert Cahalan
|
|
* Copyright (C) 2015 Craig Small <csmall@enc.com.au>
|
|
* Copyright (C) 2016 Jim Warnerl <james.warner@comcast.net>
|
|
*
|
|
* 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
|
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__BEGIN_DECLS
|
|
|
|
enum slabinfo_item {
|
|
SLABINFO_noop, // ( never altered )
|
|
SLABINFO_extra, // ( reset to zero )
|
|
|
|
SLABS_OBJS, // u_int
|
|
SLABS_AOBJS, // u_int
|
|
SLABS_PAGES, // u_int
|
|
SLABS_SLABS, // u_int
|
|
SLABS_ASLABS, // u_int
|
|
SLABS_CACHES, // u_int
|
|
SLABS_ACACHES, // u_int
|
|
SLABS_SIZE_AVG, // u_int
|
|
SLABS_SIZE_MIN, // u_int
|
|
SLABS_SIZE_MAX, // u_int
|
|
SLABS_SIZE_ACTIVE, // ul_int
|
|
SLABS_SIZE_TOTAL, // ul_int
|
|
|
|
SLABS_DELTA_OBJS, // s_int
|
|
SLABS_DELTA_AOBJS, // s_int
|
|
SLABS_DELTA_PAGES, // s_int
|
|
SLABS_DELTA_SLABS, // s_int
|
|
SLABS_DELTA_ASLABS, // s_int
|
|
SLABS_DELTA_CACHES, // s_int
|
|
SLABS_DELTA_ACACHES, // s_int
|
|
SLABS_DELTA_SIZE_AVG, // s_int
|
|
SLABS_DELTA_SIZE_MIN, // s_int
|
|
SLABS_DELTA_SIZE_MAX, // s_int
|
|
SLABS_DELTA_SIZE_ACTIVE, // s_int
|
|
SLABS_DELTA_SIZE_TOTAL, // s_int
|
|
|
|
SLABNODE_NAME, // str
|
|
SLABNODE_OBJS, // u_int
|
|
SLABNODE_AOBJS, // u_int
|
|
SLABNODE_OBJ_SIZE, // u_int
|
|
SLABNODE_OBJS_PER_SLAB, // u_int
|
|
SLABNODE_PAGES_PER_SLAB, // u_int
|
|
SLABNODE_SLABS, // u_int
|
|
SLABNODE_ASLABS, // u_int
|
|
SLABNODE_USE, // u_int
|
|
SLABNODE_SIZE // ul_int
|
|
};
|
|
|
|
enum slabinfo_sort_order {
|
|
SLABINFO_SORT_ASCEND = +1,
|
|
SLABINFO_SORT_DESCEND = -1
|
|
};
|
|
|
|
|
|
struct slabinfo_result {
|
|
enum slabinfo_item item;
|
|
union {
|
|
signed int s_int;
|
|
unsigned int u_int;
|
|
unsigned long ul_int;
|
|
char *str;
|
|
} result;
|
|
};
|
|
|
|
struct slabinfo_stack {
|
|
struct slabinfo_result *head;
|
|
};
|
|
|
|
struct slabinfo_reap {
|
|
int total;
|
|
struct slabinfo_stack **stacks;
|
|
};
|
|
|
|
|
|
#define SLABINFO_GET( info, actual_enum, type ) \
|
|
procps_slabinfo_get( info, actual_enum ) -> result . type
|
|
|
|
#define SLABINFO_VAL( relative_enum, type, stack ) \
|
|
stack -> head [ relative_enum ] . result . type
|
|
|
|
|
|
struct slabinfo_info;
|
|
|
|
int procps_slabinfo_new (struct slabinfo_info **info);
|
|
int procps_slabinfo_ref (struct slabinfo_info *info);
|
|
int procps_slabinfo_unref (struct slabinfo_info **info);
|
|
|
|
struct slabinfo_result *procps_slabinfo_get (
|
|
struct slabinfo_info *info,
|
|
enum slabinfo_item item);
|
|
|
|
struct slabinfo_reap *procps_slabinfo_reap (
|
|
struct slabinfo_info *info,
|
|
enum slabinfo_item *items,
|
|
int numitems);
|
|
|
|
struct slabinfo_stack *procps_slabinfo_select (
|
|
struct slabinfo_info *info,
|
|
enum slabinfo_item *items,
|
|
int numitems);
|
|
|
|
struct slabinfo_stack **procps_slabinfo_sort (
|
|
struct slabinfo_info *info,
|
|
struct slabinfo_stack *stacks[],
|
|
int numstacked,
|
|
enum slabinfo_item sortitem,
|
|
enum slabinfo_sort_order order);
|
|
|
|
__END_DECLS
|
|
#endif /* _PROC_SLAB_H */
|