|
|
1.1 root 1: .\" Copyright (c) 1989 The Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" Redistribution and use in source and binary forms are permitted provided
5: .\" that: (1) source distributions retain this entire copyright notice and
6: .\" comment, and (2) distributions including binaries display the following
7: .\" acknowledgement: ``This product includes software developed by the
8: .\" University of California, Berkeley and its contributors'' in the
9: .\" documentation or other materials provided with the distribution and in
10: .\" all advertising materials mentioning features or use of this software.
11: .\" Neither the name of the University nor the names of its contributors may
12: .\" be used to endorse or promote products derived from this software without
13: .\" specific prior written permission.
14: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
15: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
16: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
17: .\"
18: .\" @(#)getloadavg.3 6.2 (Berkeley) 6/23/90
19: .\"
20: .TH GETLOADAVG 3 "June 23, 1990"
21: .UC 7
22: .SH NAME
23: getloadavg \- get system load averages
24: .SH SYNOPSIS
25: .nf
26: .B getloadavg(loadavg, nelem)
27: .B double loadavg[nelem];
28: .B int nelem;
29: .fi
30: .SH DESCRIPTION
31: .I Getloadavg
32: returns the number of processes in the system run queue
33: averaged over various periods of time. Up to
34: .I nelem
35: samples are retrieved and assigned to successive elements of
36: .I loadavg[].
37: The system imposes a maximum of 3 samples, representing averages
38: over the last 1, 5, and 15 minutes, respectively.
39: .SH "SEE ALSO"
40: uptime(1), nlist(3), kmem(4)
41: .SH DIAGNOSTICS
42: If the load average was unobtainable, \-1 is returned; otherwise,
43: the number of samples actually retrieved is returned.
44: .SH BUGS
45: Programs using this utility must have read permission on
46: .I /dev/kmem.
47: This restriction will eventually be lifted.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.