repquota.c revision 1.23 1 1.1 cgd /*
2 1.4 mycroft * Copyright (c) 1980, 1990, 1993
3 1.4 mycroft * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Robert Elz at The University of Melbourne.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.20 agc * 3. Neither the name of the University nor the names of its contributors
17 1.1 cgd * may be used to endorse or promote products derived from this software
18 1.1 cgd * without specific prior written permission.
19 1.1 cgd *
20 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 1.1 cgd * SUCH DAMAGE.
31 1.1 cgd */
32 1.1 cgd
33 1.10 mrg #include <sys/cdefs.h>
34 1.1 cgd #ifndef lint
35 1.23 lukem __COPYRIGHT("@(#) Copyright (c) 1980, 1990, 1993\
36 1.23 lukem The Regents of the University of California. All rights reserved.");
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd #ifndef lint
40 1.10 mrg #if 0
41 1.10 mrg static char sccsid[] = "@(#)repquota.c 8.2 (Berkeley) 11/22/94";
42 1.10 mrg #else
43 1.23 lukem __RCSID("$NetBSD: repquota.c,v 1.23 2008/07/21 13:36:59 lukem Exp $");
44 1.10 mrg #endif
45 1.1 cgd #endif /* not lint */
46 1.1 cgd
47 1.1 cgd /*
48 1.1 cgd * Quota report
49 1.1 cgd */
50 1.1 cgd #include <sys/param.h>
51 1.1 cgd #include <sys/stat.h>
52 1.10 mrg #include <sys/queue.h>
53 1.3 cgd #include <ufs/ufs/quota.h>
54 1.11 lukem #include <errno.h>
55 1.1 cgd #include <fstab.h>
56 1.11 lukem #include <grp.h>
57 1.1 cgd #include <pwd.h>
58 1.1 cgd #include <stdio.h>
59 1.11 lukem #include <stdlib.h>
60 1.6 cgd #include <string.h>
61 1.11 lukem #include <unistd.h>
62 1.1 cgd
63 1.1 cgd char *qfname = QUOTAFILENAME;
64 1.1 cgd char *qfextension[] = INITQFNAMES;
65 1.1 cgd
66 1.1 cgd struct fileusage {
67 1.1 cgd struct fileusage *fu_next;
68 1.1 cgd struct dqblk fu_dqblk;
69 1.1 cgd u_long fu_id;
70 1.1 cgd char fu_name[1];
71 1.1 cgd /* actually bigger */
72 1.1 cgd };
73 1.1 cgd #define FUHASH 1024 /* must be power of two */
74 1.1 cgd struct fileusage *fuhead[MAXQUOTAS][FUHASH];
75 1.1 cgd u_long highid[MAXQUOTAS]; /* highest addid()'ed identifier per type */
76 1.1 cgd
77 1.1 cgd int vflag; /* verbose */
78 1.1 cgd int aflag; /* all file systems */
79 1.1 cgd
80 1.14 mycroft struct fileusage *addid __P((u_long, int, const char *));
81 1.11 lukem int hasquota __P((struct fstab *, int, char **));
82 1.11 lukem struct fileusage *lookup __P((u_long, int));
83 1.11 lukem int main __P((int, char **));
84 1.14 mycroft int oneof __P((const char *, char **, int));
85 1.11 lukem int repquota __P((struct fstab *, int, char *));
86 1.11 lukem char *timeprt __P((time_t));
87 1.11 lukem void usage __P((void));
88 1.11 lukem
89 1.11 lukem int
90 1.1 cgd main(argc, argv)
91 1.1 cgd int argc;
92 1.1 cgd char **argv;
93 1.1 cgd {
94 1.11 lukem struct fstab *fs;
95 1.11 lukem struct passwd *pw;
96 1.11 lukem struct group *gr;
97 1.1 cgd int gflag = 0, uflag = 0, errs = 0;
98 1.1 cgd long i, argnum, done = 0;
99 1.9 mark char *qfnp;
100 1.9 mark int ch;
101 1.1 cgd
102 1.9 mark while ((ch = getopt(argc, argv, "aguv")) != -1) {
103 1.1 cgd switch(ch) {
104 1.1 cgd case 'a':
105 1.1 cgd aflag++;
106 1.1 cgd break;
107 1.1 cgd case 'g':
108 1.1 cgd gflag++;
109 1.1 cgd break;
110 1.1 cgd case 'u':
111 1.1 cgd uflag++;
112 1.1 cgd break;
113 1.1 cgd case 'v':
114 1.1 cgd vflag++;
115 1.1 cgd break;
116 1.1 cgd default:
117 1.1 cgd usage();
118 1.1 cgd }
119 1.1 cgd }
120 1.1 cgd argc -= optind;
121 1.1 cgd argv += optind;
122 1.1 cgd if (argc == 0 && !aflag)
123 1.1 cgd usage();
124 1.1 cgd if (!gflag && !uflag) {
125 1.1 cgd if (aflag)
126 1.1 cgd gflag++;
127 1.1 cgd uflag++;
128 1.1 cgd }
129 1.1 cgd if (gflag) {
130 1.1 cgd setgrent();
131 1.1 cgd while ((gr = getgrent()) != 0)
132 1.1 cgd (void) addid((u_long)gr->gr_gid, GRPQUOTA, gr->gr_name);
133 1.1 cgd endgrent();
134 1.1 cgd }
135 1.1 cgd if (uflag) {
136 1.1 cgd setpwent();
137 1.1 cgd while ((pw = getpwent()) != 0)
138 1.1 cgd (void) addid((u_long)pw->pw_uid, USRQUOTA, pw->pw_name);
139 1.1 cgd endpwent();
140 1.1 cgd }
141 1.1 cgd setfsent();
142 1.1 cgd while ((fs = getfsent()) != NULL) {
143 1.8 jtc if (strcmp(fs->fs_vfstype, "ffs"))
144 1.1 cgd continue;
145 1.1 cgd if (aflag) {
146 1.1 cgd if (gflag && hasquota(fs, GRPQUOTA, &qfnp))
147 1.1 cgd errs += repquota(fs, GRPQUOTA, qfnp);
148 1.1 cgd if (uflag && hasquota(fs, USRQUOTA, &qfnp))
149 1.1 cgd errs += repquota(fs, USRQUOTA, qfnp);
150 1.1 cgd continue;
151 1.1 cgd }
152 1.1 cgd if ((argnum = oneof(fs->fs_file, argv, argc)) >= 0 ||
153 1.1 cgd (argnum = oneof(fs->fs_spec, argv, argc)) >= 0) {
154 1.1 cgd done |= 1 << argnum;
155 1.1 cgd if (gflag && hasquota(fs, GRPQUOTA, &qfnp))
156 1.1 cgd errs += repquota(fs, GRPQUOTA, qfnp);
157 1.1 cgd if (uflag && hasquota(fs, USRQUOTA, &qfnp))
158 1.1 cgd errs += repquota(fs, USRQUOTA, qfnp);
159 1.1 cgd }
160 1.1 cgd }
161 1.1 cgd endfsent();
162 1.1 cgd for (i = 0; i < argc; i++)
163 1.1 cgd if ((done & (1 << i)) == 0)
164 1.1 cgd fprintf(stderr, "%s not found in fstab\n", argv[i]);
165 1.1 cgd exit(errs);
166 1.1 cgd }
167 1.1 cgd
168 1.11 lukem void
169 1.1 cgd usage()
170 1.1 cgd {
171 1.21 jmmv fprintf(stderr, "usage:\n\t%s\n\t%s\n",
172 1.1 cgd "repquota [-v] [-g] [-u] -a",
173 1.1 cgd "repquota [-v] [-g] [-u] filesys ...");
174 1.1 cgd exit(1);
175 1.1 cgd }
176 1.1 cgd
177 1.11 lukem int
178 1.1 cgd repquota(fs, type, qfpathname)
179 1.11 lukem struct fstab *fs;
180 1.1 cgd int type;
181 1.1 cgd char *qfpathname;
182 1.1 cgd {
183 1.11 lukem struct fileusage *fup;
184 1.1 cgd FILE *qf;
185 1.1 cgd u_long id;
186 1.1 cgd struct dqblk dqbuf;
187 1.1 cgd static struct dqblk zerodqblk;
188 1.1 cgd static int warned = 0;
189 1.1 cgd static int multiple = 0;
190 1.1 cgd
191 1.1 cgd if (quotactl(fs->fs_file, QCMD(Q_SYNC, type), 0, 0) < 0 &&
192 1.1 cgd errno == EOPNOTSUPP && !warned && vflag) {
193 1.1 cgd warned++;
194 1.1 cgd fprintf(stdout,
195 1.1 cgd "*** Warning: Quotas are not compiled into this kernel\n");
196 1.1 cgd }
197 1.1 cgd if (multiple++)
198 1.1 cgd printf("\n");
199 1.1 cgd if (vflag)
200 1.1 cgd fprintf(stdout, "*** Report for %s quotas on %s (%s)\n",
201 1.1 cgd qfextension[type], fs->fs_file, fs->fs_spec);
202 1.1 cgd if ((qf = fopen(qfpathname, "r")) == NULL) {
203 1.1 cgd perror(qfpathname);
204 1.1 cgd return (1);
205 1.1 cgd }
206 1.1 cgd for (id = 0; ; id++) {
207 1.1 cgd fread(&dqbuf, sizeof(struct dqblk), 1, qf);
208 1.1 cgd if (feof(qf))
209 1.1 cgd break;
210 1.1 cgd if (dqbuf.dqb_curinodes == 0 && dqbuf.dqb_curblocks == 0)
211 1.1 cgd continue;
212 1.1 cgd if ((fup = lookup(id, type)) == 0)
213 1.1 cgd fup = addid(id, type, (char *)0);
214 1.1 cgd fup->fu_dqblk = dqbuf;
215 1.1 cgd }
216 1.1 cgd fclose(qf);
217 1.1 cgd printf(" Block limits File limits\n");
218 1.15 ad printf(type == USRQUOTA ? "User " : "Group");
219 1.19 bouyer printf(" used soft hard grace used soft hard grace\n");
220 1.1 cgd for (id = 0; id <= highid[type]; id++) {
221 1.1 cgd fup = lookup(id, type);
222 1.1 cgd if (fup == 0)
223 1.1 cgd continue;
224 1.1 cgd if (fup->fu_dqblk.dqb_curinodes == 0 &&
225 1.1 cgd fup->fu_dqblk.dqb_curblocks == 0)
226 1.1 cgd continue;
227 1.22 jdolecek if (strlen(fup->fu_name) > 9)
228 1.22 jdolecek printf("%s ", fup->fu_name);
229 1.22 jdolecek else
230 1.22 jdolecek printf("%-10s", fup->fu_name);
231 1.1 cgd printf("%c%c%8d%8d%8d%7s",
232 1.1 cgd fup->fu_dqblk.dqb_bsoftlimit &&
233 1.1 cgd fup->fu_dqblk.dqb_curblocks >=
234 1.1 cgd fup->fu_dqblk.dqb_bsoftlimit ? '+' : '-',
235 1.1 cgd fup->fu_dqblk.dqb_isoftlimit &&
236 1.1 cgd fup->fu_dqblk.dqb_curinodes >=
237 1.1 cgd fup->fu_dqblk.dqb_isoftlimit ? '+' : '-',
238 1.18 bouyer (int)(dbtob((u_quad_t)fup->fu_dqblk.dqb_curblocks) / 1024),
239 1.18 bouyer (int)(dbtob((u_quad_t)fup->fu_dqblk.dqb_bsoftlimit) / 1024),
240 1.18 bouyer (int)(dbtob((u_quad_t)fup->fu_dqblk.dqb_bhardlimit) / 1024),
241 1.1 cgd fup->fu_dqblk.dqb_bsoftlimit &&
242 1.1 cgd fup->fu_dqblk.dqb_curblocks >=
243 1.1 cgd fup->fu_dqblk.dqb_bsoftlimit ?
244 1.1 cgd timeprt(fup->fu_dqblk.dqb_btime) : "");
245 1.19 bouyer printf(" %8d%8d%8d%7s\n",
246 1.1 cgd fup->fu_dqblk.dqb_curinodes,
247 1.1 cgd fup->fu_dqblk.dqb_isoftlimit,
248 1.1 cgd fup->fu_dqblk.dqb_ihardlimit,
249 1.1 cgd fup->fu_dqblk.dqb_isoftlimit &&
250 1.1 cgd fup->fu_dqblk.dqb_curinodes >=
251 1.1 cgd fup->fu_dqblk.dqb_isoftlimit ?
252 1.1 cgd timeprt(fup->fu_dqblk.dqb_itime) : "");
253 1.1 cgd fup->fu_dqblk = zerodqblk;
254 1.1 cgd }
255 1.1 cgd return (0);
256 1.1 cgd }
257 1.1 cgd
258 1.1 cgd /*
259 1.1 cgd * Check to see if target appears in list of size cnt.
260 1.1 cgd */
261 1.11 lukem int
262 1.1 cgd oneof(target, list, cnt)
263 1.14 mycroft const char *target;
264 1.14 mycroft char *list[];
265 1.1 cgd int cnt;
266 1.1 cgd {
267 1.11 lukem int i;
268 1.1 cgd
269 1.1 cgd for (i = 0; i < cnt; i++)
270 1.1 cgd if (strcmp(target, list[i]) == 0)
271 1.1 cgd return (i);
272 1.1 cgd return (-1);
273 1.1 cgd }
274 1.1 cgd
275 1.1 cgd /*
276 1.1 cgd * Check to see if a particular quota is to be enabled.
277 1.1 cgd */
278 1.11 lukem int
279 1.1 cgd hasquota(fs, type, qfnamep)
280 1.11 lukem struct fstab *fs;
281 1.1 cgd int type;
282 1.1 cgd char **qfnamep;
283 1.1 cgd {
284 1.11 lukem char *opt;
285 1.13 fair char *cp = NULL;
286 1.1 cgd static char initname, usrname[100], grpname[100];
287 1.1 cgd static char buf[BUFSIZ];
288 1.1 cgd
289 1.1 cgd if (!initname) {
290 1.1 cgd sprintf(usrname, "%s%s", qfextension[USRQUOTA], qfname);
291 1.1 cgd sprintf(grpname, "%s%s", qfextension[GRPQUOTA], qfname);
292 1.1 cgd initname = 1;
293 1.1 cgd }
294 1.1 cgd strcpy(buf, fs->fs_mntops);
295 1.1 cgd for (opt = strtok(buf, ","); opt; opt = strtok(NULL, ",")) {
296 1.11 lukem if ((cp = strchr(opt, '=')) != NULL)
297 1.1 cgd *cp++ = '\0';
298 1.1 cgd if (type == USRQUOTA && strcmp(opt, usrname) == 0)
299 1.1 cgd break;
300 1.1 cgd if (type == GRPQUOTA && strcmp(opt, grpname) == 0)
301 1.1 cgd break;
302 1.1 cgd }
303 1.1 cgd if (!opt)
304 1.1 cgd return (0);
305 1.1 cgd if (cp) {
306 1.1 cgd *qfnamep = cp;
307 1.1 cgd return (1);
308 1.1 cgd }
309 1.1 cgd (void) sprintf(buf, "%s/%s.%s", fs->fs_file, qfname, qfextension[type]);
310 1.1 cgd *qfnamep = buf;
311 1.1 cgd return (1);
312 1.1 cgd }
313 1.1 cgd
314 1.1 cgd /*
315 1.1 cgd * Routines to manage the file usage table.
316 1.1 cgd *
317 1.1 cgd * Lookup an id of a specific type.
318 1.1 cgd */
319 1.1 cgd struct fileusage *
320 1.1 cgd lookup(id, type)
321 1.1 cgd u_long id;
322 1.1 cgd int type;
323 1.1 cgd {
324 1.11 lukem struct fileusage *fup;
325 1.1 cgd
326 1.1 cgd for (fup = fuhead[type][id & (FUHASH-1)]; fup != 0; fup = fup->fu_next)
327 1.1 cgd if (fup->fu_id == id)
328 1.1 cgd return (fup);
329 1.1 cgd return ((struct fileusage *)0);
330 1.1 cgd }
331 1.1 cgd
332 1.1 cgd /*
333 1.1 cgd * Add a new file usage id if it does not already exist.
334 1.1 cgd */
335 1.1 cgd struct fileusage *
336 1.1 cgd addid(id, type, name)
337 1.1 cgd u_long id;
338 1.1 cgd int type;
339 1.14 mycroft const char *name;
340 1.1 cgd {
341 1.1 cgd struct fileusage *fup, **fhp;
342 1.1 cgd int len;
343 1.1 cgd
344 1.11 lukem if ((fup = lookup(id, type)) != NULL)
345 1.1 cgd return (fup);
346 1.1 cgd if (name)
347 1.1 cgd len = strlen(name);
348 1.1 cgd else
349 1.1 cgd len = 10;
350 1.1 cgd if ((fup = (struct fileusage *)calloc(1, sizeof(*fup) + len)) == NULL) {
351 1.1 cgd fprintf(stderr, "out of memory for fileusage structures\n");
352 1.1 cgd exit(1);
353 1.1 cgd }
354 1.1 cgd fhp = &fuhead[type][id & (FUHASH - 1)];
355 1.1 cgd fup->fu_next = *fhp;
356 1.1 cgd *fhp = fup;
357 1.1 cgd fup->fu_id = id;
358 1.1 cgd if (id > highid[type])
359 1.1 cgd highid[type] = id;
360 1.1 cgd if (name) {
361 1.12 lukem memmove(fup->fu_name, name, len + 1);
362 1.1 cgd } else {
363 1.11 lukem sprintf(fup->fu_name, "%lu", (u_long)id);
364 1.1 cgd }
365 1.1 cgd return (fup);
366 1.1 cgd }
367 1.1 cgd
368 1.1 cgd /*
369 1.1 cgd * Calculate the grace period and return a printable string for it.
370 1.1 cgd */
371 1.1 cgd char *
372 1.1 cgd timeprt(seconds)
373 1.1 cgd time_t seconds;
374 1.1 cgd {
375 1.1 cgd time_t hours, minutes;
376 1.1 cgd static char buf[20];
377 1.1 cgd static time_t now;
378 1.1 cgd
379 1.1 cgd if (now == 0)
380 1.1 cgd time(&now);
381 1.1 cgd if (now > seconds)
382 1.1 cgd return ("none");
383 1.1 cgd seconds -= now;
384 1.1 cgd minutes = (seconds + 30) / 60;
385 1.1 cgd hours = (minutes + 30) / 60;
386 1.1 cgd if (hours >= 36) {
387 1.11 lukem sprintf(buf, "%lddays", (long)((hours + 12) / 24));
388 1.1 cgd return (buf);
389 1.1 cgd }
390 1.1 cgd if (minutes >= 60) {
391 1.11 lukem sprintf(buf, "%2ld:%ld", (long)(minutes / 60),
392 1.11 lukem (long)(minutes % 60));
393 1.1 cgd return (buf);
394 1.1 cgd }
395 1.11 lukem sprintf(buf, "%2ld", (long)minutes);
396 1.1 cgd return (buf);
397 1.1 cgd }
398