summaryrefslogtreecommitdiffstats
path: root/ProcessList.h
blob: 9710a0a545eacdd5fe4ea53bff1537215619b003 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#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 <limits.h>
#include <stdbool.h>
#include <stdint.h>
#include <sys/time.h>
#include <sys/types.h>

#include "Hashtable.h"
#include "Machine.h"
#include "Object.h"
#include "Panel.h"
#include "Process.h"
#include "RichString.h"
#include "Table.h"


typedef struct ProcessList_ {
   Table super;

   Hashtable* pidMatchList;

   unsigned int totalTasks;
   unsigned int runningTasks;
   unsigned int userlandThreads;
   unsigned int kernelThreads;
} ProcessList;

/* Implemented by platforms */
ProcessList* ProcessList_new(Machine* host, Hashtable* pidMatchList);
void ProcessList_delete(Object* cast);
void ProcessList_goThroughEntries(ProcessList* this);

void ProcessList_init(ProcessList* this, const ObjectClass* klass, Machine* host, Hashtable* pidMatchList);

void ProcessList_done(ProcessList* this);

extern const TableClass ProcessList_class;

static inline void ProcessList_add(ProcessList* this, Process* process) {
   Table_add(&this->super, &process->super);
}

Process* ProcessList_getProcess(ProcessList* this, pid_t pid, bool* preExisting, Process_New constructor);

static inline Process* ProcessList_findProcess(ProcessList* this, pid_t pid) {
   return (Process*) Table_findRow(&this->super, pid);
}

#endif

© 2014-2024 Faster IT GmbH | imprint | privacy policy