2 * Copyright (c) 1994 Christopher G. Demetriou
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by Christopher G. Demetriou.
16 * 4. The name of the author may not be used to endorse or promote products
17 * derived from this software without specific prior written permission
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
20 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
22 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
23 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
24 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
28 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include <sys/cdefs.h>
32 __FBSDID("$FreeBSD$");
34 #include <sys/param.h>
35 #include <sys/types.h>
46 #include "pathnames.h"
48 static int uid_compare(const DBT *, const DBT *);
50 static DB *usracct_db;
52 /* Legacy format in AHZV1 units. */
54 uid_t ui_uid; /* user id; for consistency */
55 u_quad_t ui_calls; /* number of invocations */
56 u_quad_t ui_utime; /* user time */
57 u_quad_t ui_stime; /* system time */
58 u_quad_t ui_mem; /* memory use */
59 u_quad_t ui_io; /* number of disk i/o ops */
63 * Convert a v1 data record into the current version.
64 * Return 0 if OK, -1 on error, setting errno.
67 v1_to_v2(DBT *key, DBT *data)
69 struct userinfov1 uiv1;
70 static struct userinfo uiv2;
73 if (key->size != sizeof(u_long) || data->size != sizeof(uiv1)) {
79 key->size = sizeof(uid_t);
80 uid = (uid_t)*(u_long *)(key->data);
84 memcpy(&uiv1, data->data, data->size);
85 memset(&uiv2, 0, sizeof(uiv2));
86 uiv2.ui_uid = uiv1.ui_uid;
87 uiv2.ui_calls = uiv1.ui_calls;
88 uiv2.ui_utime = ((double)uiv1.ui_utime / AHZV1) * 1000000;
89 uiv2.ui_stime = ((double)uiv1.ui_stime / AHZV1) * 1000000;
90 uiv2.ui_mem = uiv1.ui_mem;
91 uiv2.ui_io = uiv1.ui_io;
92 data->size = sizeof(uiv2);
98 /* Copy usrdb_file to in-memory usracct_db. */
104 bzero(&bti, sizeof bti);
105 bti.compare = uid_compare;
107 return (db_copy_in(&usracct_db, usrdb_file, "user accounting",
114 db_destroy(usracct_db, "user accounting");
118 usracct_add(const struct cmdinfo *ci)
121 struct userinfo newui;
127 key.size = sizeof uid;
129 rv = DB_GET(usracct_db, &key, &data, 0);
131 warn("get key %u from user accounting stats", uid);
133 } else if (rv == 0) { /* it's there; copy whole thing */
134 /* add the old data to the new data */
135 bcopy(data.data, &newui, data.size);
136 if (newui.ui_uid != uid) {
137 warnx("key %u != expected record number %u",
139 warnx("inconsistent user accounting stats");
142 } else { /* it's not there; zero it and copy the key */
143 bzero(&newui, sizeof newui);
144 newui.ui_uid = ci->ci_uid;
147 newui.ui_calls += ci->ci_calls;
148 newui.ui_utime += ci->ci_utime;
149 newui.ui_stime += ci->ci_stime;
150 newui.ui_mem += ci->ci_mem;
151 newui.ui_io += ci->ci_io;
154 data.size = sizeof newui;
155 rv = DB_PUT(usracct_db, &key, &data, 0);
157 warn("add key %u to user accounting stats", uid);
159 } else if (rv != 0) {
160 warnx("DB_PUT returned 1");
167 /* Copy in-memory usracct_db to usrdb_file. */
173 bzero(&bti, sizeof bti);
174 bti.compare = uid_compare;
176 return (db_copy_out(usracct_db, usrdb_file, "user accounting",
184 struct userinfo uistore, *ui = &uistore;
188 rv = DB_SEQ(usracct_db, &key, &data, R_FIRST);
190 warn("retrieving user accounting stats");
193 memcpy(ui, data.data, sizeof(struct userinfo));
195 printf("%-*s %9ju ", MAXLOGNAME - 1,
196 user_from_uid(ui->ui_uid, 0), (uintmax_t)ui->ui_calls);
198 t = (ui->ui_utime + ui->ui_stime) / 1000000;
199 if (t < 0.000001) /* kill divide by zero */
202 printf("%12.2f%s ", t / 60.0, "cpu");
204 /* ui->ui_calls is always != 0 */
207 ui->ui_io / ui->ui_calls, "avio");
209 printf("%12.0f%s", ui->ui_io, "tio");
211 /* t is always >= 0.000001; see above. */
213 printf("%12.0f%s", ui->ui_mem / t, "k");
215 printf("%12.0f%s", ui->ui_mem, "k*sec");
219 rv = DB_SEQ(usracct_db, &key, &data, R_NEXT);
221 warn("retrieving user accounting stats");
226 uid_compare(const DBT *k1, const DBT *k2)
230 bcopy(k1->data, &d1, sizeof d1);
231 bcopy(k2->data, &d2, sizeof d2);