2 * Copyright (c) 1980, 1990, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
6 * Robert Elz at The University of Melbourne.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#) Copyright (c) 1980, 1990, 1993 The Regents of the University of California. All rights reserved.
37 * @(#)repquota.c 8.1 (Berkeley) 6/6/93
38 * $FreeBSD: src/usr.sbin/repquota/repquota.c,v 1.9.2.2 2002/03/15 22:18:25 mikeh Exp $
39 * $DragonFly: src/usr.sbin/repquota/repquota.c,v 1.2 2003/06/17 04:30:02 dillon Exp $
45 #include <sys/param.h>
47 #include <ufs/ufs/quota.h>
59 /* Let's be paranoid about block size */
62 ((off_t)(db) >> (10-DEV_BSHIFT))
65 ((off_t)(db) << (DEV_BSHIFT-10))
67 #define dbtokb(db) (db)
70 #define max(a,b) ((a) >= (b) ? (a) : (b))
72 const char *qfname = QUOTAFILENAME;
73 const char *qfextension[] = INITQFNAMES;
76 struct fileusage *fu_next;
77 struct dqblk fu_dqblk;
82 #define FUHASH 1024 /* must be power of two */
83 struct fileusage *fuhead[MAXQUOTAS][FUHASH];
84 struct fileusage *lookup(u_long, int);
85 struct fileusage *addid(u_long, int, char *);
86 u_long highid[MAXQUOTAS]; /* highest addid()'ed identifier per type */
88 int vflag; /* verbose */
89 int aflag; /* all file systems */
91 int hasquota __P((struct fstab *, int, char **));
92 int oneof __P((char *, char *[], int));
93 int repquota __P((struct fstab *, int, char *));
94 char *timeprt __P((time_t));
95 static void usage __P((void));
102 register struct fstab *fs;
103 register struct passwd *pw;
104 register struct group *gr;
105 int gflag = 0, uflag = 0, errs = 0;
106 long i, argnum, done = 0;
109 while ((ch = getopt(argc, argv, "aguv")) != -1) {
129 if (argc == 0 && !aflag)
131 if (!gflag && !uflag) {
138 while ((gr = getgrent()) != 0)
139 (void) addid((u_long)gr->gr_gid, GRPQUOTA, gr->gr_name);
144 while ((pw = getpwent()) != 0)
145 (void) addid((u_long)pw->pw_uid, USRQUOTA, pw->pw_name);
149 while ((fs = getfsent()) != NULL) {
150 if (strcmp(fs->fs_vfstype, "ufs"))
153 if (gflag && hasquota(fs, GRPQUOTA, &qfnp))
154 errs += repquota(fs, GRPQUOTA, qfnp);
155 if (uflag && hasquota(fs, USRQUOTA, &qfnp))
156 errs += repquota(fs, USRQUOTA, qfnp);
159 if ((argnum = oneof(fs->fs_file, argv, argc)) >= 0 ||
160 (argnum = oneof(fs->fs_spec, argv, argc)) >= 0) {
162 if (gflag && hasquota(fs, GRPQUOTA, &qfnp))
163 errs += repquota(fs, GRPQUOTA, qfnp);
164 if (uflag && hasquota(fs, USRQUOTA, &qfnp))
165 errs += repquota(fs, USRQUOTA, qfnp);
169 for (i = 0; i < argc; i++)
170 if ((done & (1 << i)) == 0)
171 warnx("%s not found in fstab", argv[i]);
178 fprintf(stderr, "%s\n%s\n",
179 "usage: repquota [-v] [-g] [-u] -a",
180 " repquota [-v] [-g] [-u] filesystem ...");
185 repquota(fs, type, qfpathname)
186 register struct fstab *fs;
190 register struct fileusage *fup;
194 static struct dqblk zerodqblk;
195 static int warned = 0;
196 static int multiple = 0;
198 if (quotactl(fs->fs_file, QCMD(Q_SYNC, type), 0, 0) < 0 &&
199 errno == EOPNOTSUPP && !warned && vflag) {
202 "*** Warning: Quotas are not compiled into this kernel\n");
207 fprintf(stdout, "*** Report for %s quotas on %s (%s)\n",
208 qfextension[type], fs->fs_file, fs->fs_spec);
209 if ((qf = fopen(qfpathname, "r")) == NULL) {
210 warn("%s", qfpathname);
213 for (id = 0; ; id++) {
214 fread(&dqbuf, sizeof(struct dqblk), 1, qf);
217 if (dqbuf.dqb_curinodes == 0 && dqbuf.dqb_curblocks == 0)
219 if ((fup = lookup(id, type)) == 0)
220 fup = addid(id, type, (char *)0);
221 fup->fu_dqblk = dqbuf;
224 printf("%*s Block limits File limits\n",
225 max(UT_NAMESIZE,10), " ");
226 printf("User%*s used soft hard grace used soft hard grace\n",
227 max(UT_NAMESIZE,10), " ");
228 for (id = 0; id <= highid[type]; id++) {
229 fup = lookup(id, type);
232 if (fup->fu_dqblk.dqb_curinodes == 0 &&
233 fup->fu_dqblk.dqb_curblocks == 0)
235 printf("%-*s", max(UT_NAMESIZE,10), fup->fu_name);
236 printf("%c%c %8lu %8lu %8lu %6s",
237 fup->fu_dqblk.dqb_bsoftlimit &&
238 fup->fu_dqblk.dqb_curblocks >=
239 fup->fu_dqblk.dqb_bsoftlimit ? '+' : '-',
240 fup->fu_dqblk.dqb_isoftlimit &&
241 fup->fu_dqblk.dqb_curinodes >=
242 fup->fu_dqblk.dqb_isoftlimit ? '+' : '-',
243 (u_long)(dbtokb(fup->fu_dqblk.dqb_curblocks)),
244 (u_long)(dbtokb(fup->fu_dqblk.dqb_bsoftlimit)),
245 (u_long)(dbtokb(fup->fu_dqblk.dqb_bhardlimit)),
246 fup->fu_dqblk.dqb_bsoftlimit &&
247 fup->fu_dqblk.dqb_curblocks >=
248 fup->fu_dqblk.dqb_bsoftlimit ?
249 timeprt(fup->fu_dqblk.dqb_btime) : "-");
250 printf(" %7lu %7lu %7lu %6s\n",
251 (u_long)fup->fu_dqblk.dqb_curinodes,
252 (u_long)fup->fu_dqblk.dqb_isoftlimit,
253 (u_long)fup->fu_dqblk.dqb_ihardlimit,
254 fup->fu_dqblk.dqb_isoftlimit &&
255 fup->fu_dqblk.dqb_curinodes >=
256 fup->fu_dqblk.dqb_isoftlimit ?
257 timeprt(fup->fu_dqblk.dqb_itime) : "-");
258 fup->fu_dqblk = zerodqblk;
264 * Check to see if target appears in list of size cnt.
267 oneof(target, list, cnt)
268 register char *target, *list[];
273 for (i = 0; i < cnt; i++)
274 if (strcmp(target, list[i]) == 0)
280 * Check to see if a particular quota is to be enabled.
283 hasquota(fs, type, qfnamep)
284 register struct fstab *fs;
290 static char initname, usrname[100], grpname[100];
291 static char buf[BUFSIZ];
294 sprintf(usrname, "%s%s", qfextension[USRQUOTA], qfname);
295 sprintf(grpname, "%s%s", qfextension[GRPQUOTA], qfname);
298 strcpy(buf, fs->fs_mntops);
299 for (opt = strtok(buf, ","); opt; opt = strtok(NULL, ",")) {
300 if ((cp = index(opt, '=')))
302 if (type == USRQUOTA && strcmp(opt, usrname) == 0)
304 if (type == GRPQUOTA && strcmp(opt, grpname) == 0)
313 (void) sprintf(buf, "%s/%s.%s", fs->fs_file, qfname, qfextension[type]);
319 * Routines to manage the file usage table.
321 * Lookup an id of a specific type.
328 register struct fileusage *fup;
330 for (fup = fuhead[type][id & (FUHASH-1)]; fup != 0; fup = fup->fu_next)
331 if (fup->fu_id == id)
333 return ((struct fileusage *)0);
337 * Add a new file usage id if it does not already exist.
340 addid(id, type, name)
345 struct fileusage *fup, **fhp;
348 if ((fup = lookup(id, type)))
354 if ((fup = (struct fileusage *)calloc(1, sizeof(*fup) + len)) == NULL)
355 errx(1, "out of memory for fileusage structures");
356 fhp = &fuhead[type][id & (FUHASH - 1)];
360 if (id > highid[type])
363 bcopy(name, fup->fu_name, len + 1);
365 sprintf(fup->fu_name, "%lu", id);
371 * Calculate the grace period and return a printable string for it.
377 time_t hours, minutes;
384 strlcpy(buf, "none", sizeof (buf));
388 minutes = (seconds + 30) / 60;
389 hours = (minutes + 30) / 60;
391 sprintf(buf, "%lddays", (long)(hours + 12) / 24);
395 sprintf(buf, "%2ld:%ld", (long)minutes / 60,
399 sprintf(buf, "%2ld", (long)minutes);