mirror of https://github.com/xzeldon/htop.git
123 lines
2.7 KiB
C
123 lines
2.7 KiB
C
#ifndef HEADER_ProcessList
|
|
#define HEADER_ProcessList
|
|
/*
|
|
htop - ProcessList.h
|
|
(C) 2004,2005 Hisham H. Muhammad
|
|
Released under the GNU GPLv2, see the COPYING file
|
|
in the source distribution for its full text.
|
|
*/
|
|
|
|
#include "config.h" // IWYU pragma: keep
|
|
|
|
#include <stdbool.h>
|
|
#include <sys/types.h>
|
|
|
|
#include "Hashtable.h"
|
|
#include "Object.h"
|
|
#include "Panel.h"
|
|
#include "Process.h"
|
|
#include "RichString.h"
|
|
#include "Settings.h"
|
|
#include "UsersTable.h"
|
|
#include "Vector.h"
|
|
|
|
#ifdef HAVE_LIBHWLOC
|
|
#include <hwloc.h>
|
|
#endif
|
|
|
|
|
|
#ifndef MAX_NAME
|
|
#define MAX_NAME 128
|
|
#endif
|
|
|
|
#ifndef MAX_READ
|
|
#define MAX_READ 2048
|
|
#endif
|
|
|
|
typedef unsigned long long int memory_t;
|
|
#define MEMORY_MAX ULLONG_MAX
|
|
|
|
typedef struct ProcessList_ {
|
|
const Settings* settings;
|
|
|
|
Vector* processes;
|
|
Vector* processes2;
|
|
Hashtable* processTable;
|
|
UsersTable* usersTable;
|
|
|
|
Hashtable* displayTreeSet;
|
|
Hashtable* draftingTreeSet;
|
|
|
|
Panel* panel;
|
|
int following;
|
|
uid_t userId;
|
|
const char* incFilter;
|
|
Hashtable* pidMatchList;
|
|
|
|
#ifdef HAVE_LIBHWLOC
|
|
hwloc_topology_t topology;
|
|
bool topologyOk;
|
|
#endif
|
|
|
|
int totalTasks;
|
|
int runningTasks;
|
|
int userlandThreads;
|
|
int kernelThreads;
|
|
|
|
memory_t totalMem;
|
|
memory_t usedMem;
|
|
memory_t buffersMem;
|
|
memory_t cachedMem;
|
|
memory_t sharedMem;
|
|
memory_t availableMem;
|
|
|
|
memory_t totalSwap;
|
|
memory_t usedSwap;
|
|
memory_t cachedSwap;
|
|
|
|
int cpuCount;
|
|
|
|
time_t scanTs;
|
|
} ProcessList;
|
|
|
|
ProcessList* ProcessList_new(UsersTable* usersTable, Hashtable* pidMatchList, uid_t userId);
|
|
void ProcessList_delete(ProcessList* pl);
|
|
void ProcessList_goThroughEntries(ProcessList* super, bool pauseProcessUpdate);
|
|
|
|
|
|
ProcessList* ProcessList_init(ProcessList* this, const ObjectClass* klass, UsersTable* usersTable, Hashtable* pidMatchList, uid_t userId);
|
|
|
|
void ProcessList_done(ProcessList* this);
|
|
|
|
void ProcessList_setPanel(ProcessList* this, Panel* panel);
|
|
|
|
void ProcessList_printHeader(const ProcessList* this, RichString* header);
|
|
|
|
void ProcessList_add(ProcessList* this, Process* p);
|
|
|
|
void ProcessList_remove(ProcessList* this, const Process* p);
|
|
|
|
Process* ProcessList_get(ProcessList* this, int idx);
|
|
|
|
int ProcessList_size(const ProcessList* this);
|
|
|
|
void ProcessList_sort(ProcessList* this);
|
|
|
|
ProcessField ProcessList_keyAt(const ProcessList* this, int at);
|
|
|
|
void ProcessList_expandTree(ProcessList* this);
|
|
|
|
void ProcessList_collapseAllBranches(ProcessList* this);
|
|
|
|
void ProcessList_rebuildPanel(ProcessList* this);
|
|
|
|
Process* ProcessList_getProcess(ProcessList* this, pid_t pid, bool* preExisting, Process_New constructor);
|
|
|
|
void ProcessList_scan(ProcessList* this, bool pauseProcessUpdate);
|
|
|
|
static inline Process* ProcessList_findProcess(ProcessList* this, pid_t pid) {
|
|
return (Process*) Hashtable_get(this->processTable, pid);
|
|
}
|
|
|
|
#endif
|