2015-09-18 04:46:48 +00:00
|
|
|
#ifndef HEADER_OpenBSDProcessList
|
|
|
|
#define HEADER_OpenBSDProcessList
|
|
|
|
/*
|
|
|
|
htop - OpenBSDProcessList.h
|
|
|
|
(C) 2014 Hisham H. Muhammad
|
|
|
|
(C) 2015 Michael McConville
|
|
|
|
Released under the GNU GPL, see the COPYING file
|
|
|
|
in the source distribution for its full text.
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
|
|
#include <kvm.h>
|
|
|
|
|
|
|
|
typedef struct CPUData_ {
|
|
|
|
unsigned long long int totalTime;
|
2018-12-16 08:25:54 +00:00
|
|
|
unsigned long long int userTime;
|
|
|
|
unsigned long long int niceTime;
|
|
|
|
unsigned long long int sysTime;
|
|
|
|
unsigned long long int sysAllTime;
|
|
|
|
unsigned long long int spinTime;
|
|
|
|
unsigned long long int intrTime;
|
|
|
|
unsigned long long int idleTime;
|
|
|
|
|
2015-09-18 04:46:48 +00:00
|
|
|
unsigned long long int totalPeriod;
|
2018-12-16 08:25:54 +00:00
|
|
|
unsigned long long int userPeriod;
|
|
|
|
unsigned long long int nicePeriod;
|
|
|
|
unsigned long long int sysPeriod;
|
|
|
|
unsigned long long int sysAllPeriod;
|
|
|
|
unsigned long long int spinPeriod;
|
|
|
|
unsigned long long int intrPeriod;
|
|
|
|
unsigned long long int idlePeriod;
|
2015-09-18 04:46:48 +00:00
|
|
|
} CPUData;
|
|
|
|
|
|
|
|
typedef struct OpenBSDProcessList_ {
|
|
|
|
ProcessList super;
|
|
|
|
kvm_t* kd;
|
|
|
|
|
|
|
|
CPUData* cpus;
|
|
|
|
|
|
|
|
} OpenBSDProcessList;
|
|
|
|
|
|
|
|
|
2016-03-06 04:23:29 +00:00
|
|
|
/*
|
|
|
|
* avoid relying on or conflicting with MIN() and MAX() in sys/param.h
|
|
|
|
*/
|
|
|
|
#ifndef MINIMUM
|
|
|
|
#define MINIMUM(x, y) ((x) > (y) ? (y) : (x))
|
Introduce CLAMP macro. Unify all MIN(MAX(a,b),c) uses.
With the CLAMP macro replacing the combination of MIN and MAX, we will
have at least two advantages:
1. It's more obvious semantically.
2. There are no more mixes of confusing uses like MIN(MAX(a,b),c) and
MAX(MIN(a,b),c) and MIN(a,MAX(b,c)) appearing everywhere. We unify
the 'clamping' with a single macro.
Note that the behavior of this CLAMP macro is different from
the combination `MAX(low,MIN(x,high))`.
* This CLAMP macro expands to two comparisons instead of three from
MAX and MIN combination. In theory, this makes the code slightly
smaller, in case that (low) or (high) or both are computed at
runtime, so that compilers cannot optimize them. (The third
comparison will matter if (low)>(high); see below.)
* CLAMP has a side effect, that if (low)>(high) it will produce weird
results. Unlike MIN & MAX which will force either (low) or (high) to
win. No assertion of ((low)<=(high)) is done in this macro, for now.
This CLAMP macro is implemented like described in glib
<http://developer.gnome.org/glib/stable/glib-Standard-Macros.html>
and does not handle weird uses like CLAMP(a++, low++, high--) .
2016-01-15 12:26:01 +00:00
|
|
|
#endif
|
|
|
|
|
2016-03-06 04:23:29 +00:00
|
|
|
#ifndef MAXIMUM
|
|
|
|
#define MAXIMUM(x, y) ((x) > (y) ? (x) : (y))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef CLAMP
|
|
|
|
#define CLAMP(x, low, high) (((x) > (high)) ? (high) : MAXIMUM(x, low))
|
|
|
|
#endif
|
2015-09-18 04:46:48 +00:00
|
|
|
|
|
|
|
ProcessList* ProcessList_new(UsersTable* usersTable, Hashtable* pidWhiteList, uid_t userId);
|
|
|
|
|
|
|
|
void ProcessList_delete(ProcessList* this);
|
|
|
|
|
|
|
|
char *OpenBSDProcessList_readProcessName(kvm_t* kd, struct kinfo_proc* kproc, int* basenameEnd);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Taken from OpenBSD's ps(1).
|
|
|
|
*/
|
|
|
|
void ProcessList_goThroughEntries(ProcessList* this);
|
|
|
|
|
2018-12-16 08:25:54 +00:00
|
|
|
|
2015-09-18 04:46:48 +00:00
|
|
|
#endif
|