getloadavg.c revision 1.1.1.1 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1989 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
35 1.1 cgd static char sccsid[] = "@(#)getloadavg.c 6.2 (Berkeley) 6/29/90";
36 1.1 cgd #endif /* LIBC_SCCS and not lint */
37 1.1 cgd
38 1.1 cgd #include <sys/param.h>
39 1.1 cgd #include <sys/types.h>
40 1.1 cgd #include <sys/file.h>
41 1.1 cgd #include <nlist.h>
42 1.1 cgd
43 1.1 cgd static struct nlist nl[] = {
44 1.1 cgd { "_averunnable" },
45 1.1 cgd #define X_AVERUNNABLE 0
46 1.1 cgd { "_fscale" },
47 1.1 cgd #define X_FSCALE 1
48 1.1 cgd { "" },
49 1.1 cgd };
50 1.1 cgd
51 1.1 cgd /*
52 1.1 cgd * getloadavg() -- Get system load averages.
53 1.1 cgd *
54 1.1 cgd * Put `nelem' samples into `loadavg' array.
55 1.1 cgd * Return number of samples retrieved, or -1 on error.
56 1.1 cgd */
57 1.1 cgd getloadavg(loadavg, nelem)
58 1.1 cgd double loadavg[];
59 1.1 cgd int nelem;
60 1.1 cgd {
61 1.1 cgd static int need_nlist = 1;
62 1.1 cgd fixpt_t averunnable[3];
63 1.1 cgd int fscale, kmemfd, i;
64 1.1 cgd int alreadyopen;
65 1.1 cgd
66 1.1 cgd if ((alreadyopen = kvm_openfiles(NULL, NULL, NULL)) == -1)
67 1.1 cgd return (-1);
68 1.1 cgd /*
69 1.1 cgd * cache nlist
70 1.1 cgd */
71 1.1 cgd if (need_nlist) {
72 1.1 cgd if (kvm_nlist(nl) != 0)
73 1.1 cgd goto bad;
74 1.1 cgd need_nlist = 0;
75 1.1 cgd }
76 1.1 cgd if (kvm_read((off_t)nl[X_AVERUNNABLE].n_value, (char *)averunnable,
77 1.1 cgd sizeof(averunnable)) != sizeof(averunnable))
78 1.1 cgd goto bad;
79 1.1 cgd if (kvm_read( (off_t)nl[X_FSCALE].n_value, (char *)&fscale,
80 1.1 cgd sizeof(fscale)) != sizeof(fscale))
81 1.1 cgd goto bad;
82 1.1 cgd nelem = MIN(nelem, sizeof(averunnable) / sizeof(averunnable[0]));
83 1.1 cgd for (i = 0; i < nelem; i++)
84 1.1 cgd loadavg[i] = (double) averunnable[i] / fscale;
85 1.1 cgd if (!alreadyopen)
86 1.1 cgd kvm_close();
87 1.1 cgd return (nelem);
88 1.1 cgd
89 1.1 cgd bad:
90 1.1 cgd if (!alreadyopen)
91 1.1 cgd kvm_close();
92 1.1 cgd return (-1);
93 1.1 cgd }
94