summaryrefslogtreecommitdiffstats
path: root/Process.c
diff options
context:
space:
mode:
authorNathan Scott <nathans@redhat.com>2023-08-31 11:56:43 +1000
committerNathan Scott <nathans@redhat.com>2023-08-31 14:13:16 +1000
commitb74673fe37fd379fc350789e696470556776d815 (patch)
treecbe4f036962c439f9c07a9c96302f5908f6410b0 /Process.c
parent214166a049c2a6ac454dbb37b85b04c039a6a17a (diff)
Rename ProcessList to ProcessTable throughout
Following up with some discusson from a few months back, where it was proposed that ProcessTable is a better name. This data structure is definitely not a list ... if it was one-dimensional it'd be a set, but in practice it has much more in common with a two-dimensional table. The Process table is a familiar operating system concept for many people too so it resonates a little in that way as well.
Diffstat (limited to 'Process.c')
-rw-r--r--Process.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/Process.c b/Process.c
index 6c4fb7ad..805e9242 100644
--- a/Process.c
+++ b/Process.c
@@ -25,7 +25,7 @@ in the source distribution for its full text.
#include "CRT.h"
#include "Macros.h"
#include "Platform.h"
-#include "ProcessList.h"
+#include "ProcessTable.h"
#include "DynamicColumn.h"
#include "RichString.h"
#include "Scheduling.h"
@@ -826,9 +826,9 @@ static bool Process_matchesFilter(const Process* this, const Table* table) {
if (incFilter && !String_contains_i(Process_getCommand(this), incFilter, true))
return true;
- const ProcessList* pl = (const ProcessList*) host->activeTable;
- assert(Object_isA((const Object*) pl, (const ObjectClass*) &ProcessList_class));
- if (pl->pidMatchList && !Hashtable_get(pl->pidMatchList, Process_getThreadGroup(this)))
+ const ProcessTable* pt = (const ProcessTable*) host->activeTable;
+ assert(Object_isA((const Object*) pt, (const ObjectClass*) &ProcessTable_class));
+ if (pt->pidMatchList && !Hashtable_get(pt->pidMatchList, Process_getThreadGroup(this)))
return true;
return false;

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