minix/lib/posix/getloadavg.c

63 lines
1.8 KiB
C
Raw Normal View History

2005-11-14 16:48:12 +01:00
#include <sys/types.h>
#include <minix/sysinfo.h>
2005-11-14 16:48:12 +01:00
#include <stdlib.h>
#include <unistd.h>
#include <lib.h>
/* Retrieve system load average information. */
int getloadavg(double *loadavg, int nelem)
{
struct loadinfo loadinfo;
int h, p, unfilled_ticks;
#define PERIODS 3
int minutes[3] = { 1, 5, 15 };
size_t loadsize;
ssize_t l;
2005-11-14 16:48:12 +01:00
if(nelem < 1) {
errno = ENOSPC;
return -1;
}
loadsize = sizeof(loadinfo);
if((l=getsysinfo_up(PM_PROC_NR, SIU_LOADINFO, loadsize, &loadinfo)) < 0)
return -1;
if(l != sizeof(loadinfo))
2005-11-14 16:48:12 +01:00
return -1;
if(nelem > PERIODS)
nelem = PERIODS;
/* How many ticks are missing from the newest-filled slot? */
#define TICKSPERSLOT (_LOAD_UNIT_SECS * sys_hz())
2005-11-14 16:48:12 +01:00
unfilled_ticks = TICKSPERSLOT - (loadinfo.last_clock % TICKSPERSLOT);
for(p = 0; p < nelem; p++) {
int h, offset, slots;
double l = 0.0;
int latest = loadinfo.proc_last_slot;
slots = minutes[p] * 60 / _LOAD_UNIT_SECS;
/* Add up the total number of process ticks for this number
* of minutes (minutes[p]). Start with the newest slot, which
* is latest, and count back for the number of slots that
* correspond to the right number of minutes. Take wraparound
* into account by calculating the index modulo _LOAD_HISTORY,
* which is the number of slots of history kept.
*/
for(h = 0; h < slots; h++) {
int slot;
slot = (latest - h + _LOAD_HISTORY) % _LOAD_HISTORY;
l += (double) loadinfo.proc_load_history[slot];
}
/* The load average over this number of minutes is the number of
* process-ticks divided by the number of ticks, not counting the
* number of ticks the last slot hasn't been around yet.
*/
loadavg[p] = l / (slots * TICKSPERSLOT - unfilled_ticks);
}
return nelem;
}