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 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471
|
/*
SPDX-FileCopyrightText: 2007 John Tapsell <tapsell@kde.org>
SPDX-License-Identifier: LGPL-2.0-or-later
*/
#include "processes.h"
#include "memoryinfo_p.h"
#include "processes_local_p.h"
#include <QByteArray>
#include <QElapsedTimer>
#include <QMutableSetIterator>
#include <QSet>
#include <QVariantMap>
// for sysconf
#include <unistd.h>
/* if porting to an OS without signal.h please #define SIGTERM to something */
#include <signal.h>
namespace KSysGuard
{
class Q_DECL_HIDDEN Processes::Private
{
public:
Private(Processes *q_ptr)
{
mFakeProcess.setParent(&mFakeProcess);
mAbstractProcesses = nullptr;
mProcesses.insert(-1, &mFakeProcess);
mElapsedTimeMilliSeconds = 0;
mUpdateFlags = {};
mLastError = Error::NoError;
q = q_ptr;
}
~Private();
void markProcessesAsEnded(long pid);
QSet<long> mToBeProcessed;
QSet<long> mEndedProcesses; ///< Processes that have finished
QHash<long, Process *> mProcesses; ///< This must include mFakeProcess at pid -1
QList<Process *> mListProcesses; ///< A list of the processes. Does not include mFakeProcesses
Process mFakeProcess; ///< A fake process with pid -1 just so that even init points to a parent
ProcessesLocal *mAbstractProcesses; ///< The OS specific code to get the process information
QElapsedTimer mLastUpdated; ///< This is the time we last updated. Used to calculate cpu usage.
long mElapsedTimeMilliSeconds; ///< The number of milliseconds (1000ths of a second) that passed since the last update
Processes::UpdateFlags mUpdateFlags;
Processes *q;
Error mLastError;
};
Processes::Private::~Private()
{
Q_FOREACH (Process *process, mProcesses) {
if (process != &mFakeProcess) {
delete process;
}
}
mProcesses.clear();
mListProcesses.clear();
delete mAbstractProcesses;
mAbstractProcesses = nullptr;
}
Processes::Processes(QObject *parent)
: QObject(parent)
, d(new Private(this))
{
qRegisterMetaType<KSysGuard::Process::Updates>();
d->mAbstractProcesses = new ProcessesLocal();
connect(d->mAbstractProcesses, &ProcessesLocal::processesUpdated, this, &Processes::processesUpdated);
connect(d->mAbstractProcesses, &ProcessesLocal::processUpdated, this, &Processes::processUpdated);
}
Processes::~Processes()
{
delete d;
}
Processes::Error Processes::lastError() const
{
return d->mLastError;
}
Process *Processes::getProcess(long pid) const
{
return d->mProcesses.value(pid);
}
const QList<Process *> &Processes::getAllProcesses() const
{
return d->mListProcesses;
}
int Processes::processCount() const
{
return d->mListProcesses.count();
}
bool Processes::updateProcess(Process *ps, long ppid)
{
Process *parent = d->mProcesses.value(ppid, &d->mFakeProcess);
Q_ASSERT(parent); // even init has a non-null parent - the mFakeProcess
if (ps->parent() != parent) {
Q_EMIT beginMoveProcess(ps, parent /*new parent*/);
// Processes has been reparented
Process *p = ps;
do {
p = p->parent();
p->numChildren() -= (ps->numChildren() + 1);
} while (p->pid() != -1);
Q_ASSERT(ps != parent);
ps->parent()->children().removeAll(ps);
ps->setParent(parent); // the parent has changed
parent->children().append(ps);
p = ps;
do {
p = p->parent();
p->numChildren() += (ps->numChildren() + 1);
} while (p->pid() != -1);
Q_EMIT endMoveProcess();
Q_ASSERT(ps != parent);
ps->setParent(parent);
}
ps->setParentPid(ppid);
bool success = updateProcessInfo(ps);
Q_EMIT processChanged(ps, false);
return success;
}
bool Processes::updateProcessInfo(Process *ps)
{
// Now we can actually get the process info
qlonglong oldUserTime = ps->userTime();
qlonglong oldSysTime = ps->sysTime();
qlonglong oldIoCharactersRead = 0;
qlonglong oldIoCharactersWritten = 0;
qlonglong oldIoReadSyscalls = 0;
qlonglong oldIoWriteSyscalls = 0;
qlonglong oldIoCharactersActuallyRead = 0;
qlonglong oldIoCharactersActuallyWritten = 0;
if (d->mUpdateFlags.testFlag(Processes::IOStatistics)) {
oldIoCharactersRead = ps->ioCharactersRead();
oldIoCharactersWritten = ps->ioCharactersWritten();
oldIoReadSyscalls = ps->ioReadSyscalls();
oldIoWriteSyscalls = ps->ioWriteSyscalls();
oldIoCharactersActuallyRead = ps->ioCharactersActuallyRead();
oldIoCharactersActuallyWritten = ps->ioCharactersActuallyWritten();
}
ps->setChanges(Process::Nothing);
bool success = d->mAbstractProcesses->updateProcessInfo(ps->pid(), ps);
// Now we have the process info. Calculate the cpu usage and total cpu usage for itself and all its parents
if (d->mElapsedTimeMilliSeconds != 0) { // Update the user usage and sys usage
#ifndef Q_OS_NETBSD
/* The elapsed time is the d->mElapsedTimeMilliSeconds
* (which is of the order 2 seconds or so) plus a small
* correction where we get the amount of time elapsed since
* we start processing. This is because the processing itself
* can take a non-trivial amount of time. */
int elapsedTime = ps->elapsedTimeMilliSeconds();
ps->setElapsedTimeMilliSeconds(d->mLastUpdated.elapsed());
elapsedTime = ps->elapsedTimeMilliSeconds() - elapsedTime + d->mElapsedTimeMilliSeconds;
if (elapsedTime > 0) {
ps->setUserUsage((int)(((ps->userTime() - oldUserTime) * 1000.0) / elapsedTime));
ps->setSysUsage((int)(((ps->sysTime() - oldSysTime) * 1000.0) / elapsedTime));
}
#endif
static auto calculateRate = [](qlonglong current, qlonglong previous, int elapsedTime) {
if (elapsedTime <= 0 || previous <= 0) {
return 0.0;
}
return (current - previous) * 1000.0 / elapsedTime;
};
if (d->mUpdateFlags.testFlag(Processes::IOStatistics)) {
ps->setIoCharactersReadRate(calculateRate(ps->ioCharactersRead(), oldIoCharactersRead, elapsedTime));
ps->setIoCharactersWrittenRate(calculateRate(ps->ioCharactersWritten(), oldIoCharactersWritten, elapsedTime));
ps->setIoReadSyscallsRate(calculateRate(ps->ioReadSyscalls(), oldIoReadSyscalls, elapsedTime));
ps->setIoWriteSyscallsRate(calculateRate(ps->ioWriteSyscalls(), oldIoWriteSyscalls, elapsedTime));
ps->setIoCharactersActuallyReadRate(calculateRate(ps->ioCharactersActuallyRead(), oldIoCharactersActuallyRead, elapsedTime));
ps->setIoCharactersActuallyWrittenRate(calculateRate(ps->ioCharactersActuallyWritten(), oldIoCharactersActuallyWritten, elapsedTime));
} else {
ps->setIoCharactersReadRate(0);
ps->setIoCharactersWrittenRate(0);
ps->setIoReadSyscallsRate(0);
ps->setIoWriteSyscallsRate(0);
ps->setIoCharactersActuallyReadRate(0);
ps->setIoCharactersActuallyWrittenRate(0);
}
}
if (d->mElapsedTimeMilliSeconds != 0) {
ps->setTotalUserUsage(ps->userUsage());
ps->setTotalSysUsage(ps->sysUsage());
if (ps->userUsage() != 0 || ps->sysUsage() != 0) {
Process *p = ps->parent();
while (p->pid() != -1) {
p->totalUserUsage() += ps->userUsage();
p->totalSysUsage() += ps->sysUsage();
Q_EMIT processChanged(p, true);
p = p->parent();
}
}
}
return success;
}
bool Processes::addProcess(long pid, long ppid)
{
Process *parent = d->mProcesses.value(ppid);
if (!parent) {
// Under race conditions, the parent could have already quit
// In this case, attach to top leaf
parent = &d->mFakeProcess;
Q_ASSERT(parent); // even init has a non-null parent - the mFakeProcess
}
// it's a new process - we need to set it up
Process *ps = new Process(pid, ppid, parent);
Q_EMIT beginAddProcess(ps);
d->mProcesses.insert(pid, ps);
ps->setIndex(d->mListProcesses.count());
d->mListProcesses.append(ps);
ps->parent()->children().append(ps);
Process *p = ps;
do {
Q_ASSERT(p);
p = p->parent();
p->numChildren()++;
} while (p->pid() != -1);
ps->setParentPid(ppid);
// Now we can actually get the process info
bool success = updateProcessInfo(ps);
Q_EMIT endAddProcess();
return success;
}
bool Processes::updateOrAddProcess(long pid)
{
long ppid = d->mAbstractProcesses->getParentPid(pid);
if (ppid == pid) {
// Shouldn't ever happen
ppid = -1;
}
if (d->mToBeProcessed.contains(ppid)) {
// Make sure that we update the parent before we update this one. Just makes things a bit easier.
d->mToBeProcessed.remove(ppid);
updateOrAddProcess(ppid);
}
Process *ps = d->mProcesses.value(pid);
if (!ps) {
return addProcess(pid, ppid);
} else {
return updateProcess(ps, ppid);
}
}
void Processes::updateAllProcesses(long updateDurationMS, Processes::UpdateFlags updateFlags)
{
d->mUpdateFlags = updateFlags;
if (d->mLastUpdated.elapsed() >= updateDurationMS || !d->mLastUpdated.isValid()) {
d->mElapsedTimeMilliSeconds = d->mLastUpdated.restart();
d->mAbstractProcesses->updateAllProcesses(d->mUpdateFlags); // For a local machine, this will directly call Processes::processesUpdated()
}
}
void Processes::processesUpdated()
{
// First really delete any processes that ended last time
long pid;
{
QSetIterator<long> i(d->mEndedProcesses);
while (i.hasNext()) {
pid = i.next();
deleteProcess(pid);
}
}
d->mToBeProcessed = d->mAbstractProcesses->getAllPids();
QSet<long> endedProcesses;
for (Process *p : d->mListProcesses) {
if (!d->mToBeProcessed.contains(p->pid())) {
endedProcesses += p->pid();
}
}
{
QMutableSetIterator<long> i(d->mToBeProcessed);
while (i.hasNext()) {
pid = i.next();
i.remove();
updateOrAddProcess(pid); // This adds the process or changes an existing one
i.toFront(); // we can remove entries from this set elsewhere, so our iterator might be invalid. Reset it back to the start of the set
}
}
{
QSetIterator<long> i(endedProcesses);
while (i.hasNext()) {
// We saw these pids last time, but not this time. That means we have to mark them for deletion now
pid = i.next();
d->markProcessesAsEnded(pid);
}
d->mEndedProcesses = endedProcesses;
}
Q_EMIT updated();
}
void Processes::processUpdated(long pid, const Process::Updates &changes)
{
auto process = d->mProcesses.value(pid);
if (!process) {
return;
}
for (auto entry : changes) {
switch (entry.first) {
case Process::MemoryPrecise:
process->memoryInfo()->setPrecise(entry.second.value<MemoryFields>());
process->addChange(Process::Memory);
break;
default:
break;
}
}
Q_EMIT processChanged(process, false);
}
void Processes::Private::markProcessesAsEnded(long pid)
{
Q_ASSERT(pid >= 0);
Process *process = mProcesses.value(pid);
if (!process) {
return;
}
process->setStatus(Process::Ended);
Q_EMIT q->processChanged(process, false);
}
void Processes::deleteProcess(long pid)
{
Q_ASSERT(pid >= 0);
Process *process = d->mProcesses.value(pid);
if (!process) {
return;
}
Q_FOREACH (Process *it, process->children()) {
deleteProcess(it->pid());
}
Q_EMIT beginRemoveProcess(process);
d->mProcesses.remove(pid);
d->mListProcesses.removeAll(process);
process->parent()->children().removeAll(process);
Process *p = process;
do {
Q_ASSERT(p);
p = p->parent();
p->numChildren()--;
} while (p->pid() != -1);
#ifndef QT_NO_DEBUG
int i = 0;
#endif
Q_FOREACH (Process *it, d->mListProcesses) {
if (it->index() > process->index()) {
it->setIndex(it->index() - 1);
}
#ifndef QT_NO_DEBUG
Q_ASSERT(it->index() == i++);
#endif
}
delete process;
Q_EMIT endRemoveProcess();
}
bool Processes::killProcess(long pid)
{
return sendSignal(pid, SIGTERM);
}
bool Processes::sendSignal(long pid, int sig)
{
auto error = d->mAbstractProcesses->sendSignal(pid, sig);
if (error != NoError) {
d->mLastError = error;
return false;
}
return true;
}
bool Processes::setNiceness(long pid, int priority)
{
auto error = d->mAbstractProcesses->setNiceness(pid, priority);
if (error != NoError) {
d->mLastError = error;
return false;
}
return true;
}
bool Processes::setScheduler(long pid, KSysGuard::Process::Scheduler priorityClass, int priority)
{
auto error = d->mAbstractProcesses->setScheduler(pid, priorityClass, priority);
if (error != NoError) {
d->mLastError = error;
return false;
}
return true;
}
bool Processes::setIoNiceness(long pid, KSysGuard::Process::IoPriorityClass priorityClass, int priority)
{
auto error = d->mAbstractProcesses->setIoNiceness(pid, priorityClass, priority);
if (error != NoError) {
d->mLastError = error;
return false;
}
return true;
}
bool Processes::supportsIoNiceness()
{
return d->mAbstractProcesses->supportsIoNiceness();
}
long long Processes::totalPhysicalMemory()
{
return d->mAbstractProcesses->totalPhysicalMemory();
}
long long Processes::totalSwapMemory()
{
return d->mAbstractProcesses->totalSwapMemory();
}
long Processes::numberProcessorCores()
{
return d->mAbstractProcesses->numberProcessorCores();
}
}
|