2 * Copyright (C) 1991, 1994 Wolfgang Solfrank.
3 * Copyright (C) 1991, 1994 TooLs GmbH.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
14 * 3. All advertising materials mentioning features or use of this software
15 * must display the following acknowledgement:
16 * This product includes software developed by TooLs GmbH.
17 * 4. The name of TooLs GmbH may not be used to endorse or promote products
18 * derived from this software without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY TOOLS GMBH ``AS IS'' AND ANY EXPRESS OR
21 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 * IN NO EVENT SHALL TOOLS GMBH BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
26 * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
27 * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
28 * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
29 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 * $FreeBSD: src/usr.sbin/quot/quot.c,v 1.11.2.4 2002/03/15 18:12:41 mikeh Exp $
32 * $DragonFly: src/usr.sbin/quot/quot.c,v 1.4 2004/03/20 17:09:44 cpressey Exp $
35 #include <sys/param.h>
36 #include <sys/mount.h>
38 #include <vfs/ufs/fs.h>
39 #include <vfs/ufs/quota.h>
40 #include <vfs/ufs/inode.h>
53 /* some flags of what to do: */
57 static void (*func)(int, struct fs *, char *);
58 static long blocksize;
62 static struct dinode *get_inode(int, struct fs *, ino_t);
63 static int virtualblocks(struct fs *, struct dinode *);
64 static int isfree(struct dinode *);
65 static void inituser(void);
66 static void usrrehash(void);
67 static struct user *user(uid_t);
68 static int cmpusers(const void *, const void *);
69 static void uses(uid_t, daddr_t, time_t);
70 static void initfsizes(void);
71 static void dofsizes(int, struct fs *, char *);
72 static void douser(int, struct fs *, char *);
73 static void donames(int, struct fs *, char *);
74 static void usage(void);
75 static void quot(char *, char *);
78 * Original BSD quot doesn't round to number of frags/blocks,
79 * doesn't account for indirection blocks and gets it totally
80 * wrong if the size is a multiple of the blocksize.
81 * The new code always counts the number of 512 byte blocks
82 * instead of the number of kilobytes and converts them to
83 * kByte when done (on request).
85 * Due to the size of modern disks, we must cast intermediate
86 * values to 64 bits to prevent potential overflows.
91 #define SIZE(n) ((int)(((quad_t)(n) * 512 + blocksize - 1)/blocksize))
94 #define INOCNT(fs) ((fs)->fs_ipg)
95 #define INOSZ(fs) (sizeof(struct dinode) * INOCNT(fs))
97 static struct dinode *
98 get_inode(int fd, struct fs *super, ino_t ino)
100 static struct dinode *ip;
103 if (fd < 0) { /* flush cache */
111 if (!ip || ino < last || ino >= last + INOCNT(super)) {
113 && !(ip = (struct dinode *)malloc(INOSZ(super))))
114 errx(1, "allocate inodes");
115 last = (ino / INOCNT(super)) * INOCNT(super);
116 if (lseek(fd, (off_t)ino_to_fsba(super, last) << super->fs_fshift, 0) < (off_t)0
117 || read(fd,ip,INOSZ(super)) != (ssize_t)INOSZ(super))
118 err(1, "read inodes");
121 return ip + ino % INOCNT(super);
125 #define actualblocks(super,ip) ((ip)->di_blocks/2)
127 #define actualblocks(super,ip) ((ip)->di_blocks)
130 static int virtualblocks(struct fs *super, struct dinode *ip)
136 if (lblkno(super,sz) >= NDADDR) {
137 nblk = blkroundup(super,sz);
139 nblk += super->fs_bsize;
146 if (lblkno(super,sz) >= NDADDR) {
147 nblk = blkroundup(super,sz);
148 sz = lblkno(super,nblk);
149 sz = (sz - NDADDR + NINDIR(super) - 1) / NINDIR(super);
151 nblk += sz * super->fs_bsize;
152 /* sz - 1 rounded up */
153 sz = (sz - 1 + NINDIR(super) - 1) / NINDIR(super);
156 nblk = fragroundup(super,sz);
163 isfree(struct dinode *ip)
166 return (ip->di_mode&IFMT) == 0;
169 switch (ip->di_mode&IFMT) {
171 case IFLNK: /* should check FASTSYMLINK? */
201 (struct user *)calloc(nusers,sizeof(struct user))))
202 errx(1, "allocate users");
204 for (usr = users, i = nusers; --i >= 0; usr++) {
205 usr->space = usr->spc30 = usr->spc60 = usr->spc90 = 0;
215 struct user *usr, *usrn;
220 if (!(users = (struct user *)calloc(nusers,sizeof(struct user))))
221 errx(1, "allocate users");
222 for (usr = svusr, i = nusers >> 1; --i >= 0; usr++) {
223 for (usrn = users + (usr->uid&(nusers - 1)); usrn->name;
226 usrn = users + nusers;
240 for (usr = users + (uid&(nusers - 1)), i = nusers; --i >= 0;
245 if (!(pwd = getpwuid(uid))) {
246 if ((usr->name = (char *)malloc(7)))
247 sprintf(usr->name,"#%d",uid);
249 if ((usr->name = (char *)
250 malloc(strlen(pwd->pw_name) + 1)))
251 strcpy(usr->name,pwd->pw_name);
254 errx(1, "allocate users");
258 } else if (usr->uid == uid)
262 usr = users + nusers;
269 cmpusers(const void *v1, const void *v2)
271 const struct user *u1, *u2;
272 u1 = (const struct user *)v1;
273 u2 = (const struct user *)v2;
275 return u2->space - u1->space;
278 #define sortusers(users) (qsort((users),nusers,sizeof(struct user), \
282 uses(uid_t uid, daddr_t blks, time_t act)
294 if (today - act > 90L * 24L * 60L * 60L)
296 if (today - act > 60L * 24L * 60L * 60L)
298 if (today - act > 30L * 24L * 60L * 60L)
308 struct fsizes *fsz_next;
309 daddr_t fsz_first, fsz_last;
310 ino_t fsz_count[FSZCNT];
311 daddr_t fsz_sz[FSZCNT];
320 for (fp = fsizes; fp; fp = fp->fsz_next) {
321 for (i = FSZCNT; --i >= 0;) {
322 fp->fsz_count[i] = 0;
329 dofsizes(int fd, struct fs *super, char *name)
334 struct fsizes *fp, **fsp;
337 maxino = super->fs_ncg * super->fs_ipg - 1;
339 if (!(fsizes = (struct fsizes *)malloc(sizeof(struct fsizes))))
340 errx(1, "allocate fsize structure");
342 for (inode = 0; inode < maxino; inode++) {
344 if ((ip = get_inode(fd,super,inode))
346 && ((ip->di_mode&IFMT) == IFREG
347 || (ip->di_mode&IFMT) == IFDIR)
352 sz = estimate ? virtualblocks(super,ip) :
353 actualblocks(super,ip);
356 fsizes->fsz_count[FSZCNT-1]++;
357 fsizes->fsz_sz[FSZCNT-1] += sz;
359 fsizes->fsz_count[sz]++;
360 fsizes->fsz_sz[sz] += sz;
364 for (fsp = &fsizes; (fp = *fsp); fsp = &fp->fsz_next) {
365 if (ksz < fp->fsz_last)
368 if (!fp || ksz < fp->fsz_first) {
369 if (!(fp = (struct fsizes *)
370 malloc(sizeof(struct fsizes))))
371 errx(1, "allocate fsize structure");
374 fp->fsz_first = (ksz / FSZCNT) * FSZCNT;
375 fp->fsz_last = fp->fsz_first + FSZCNT;
376 for (i = FSZCNT; --i >= 0;) {
377 fp->fsz_count[i] = 0;
381 fp->fsz_count[ksz % FSZCNT]++;
382 fp->fsz_sz[ksz % FSZCNT] += sz;
389 for (fp = fsizes; fp; fp = fp->fsz_next) {
390 for (i = 0; i < FSZCNT; i++) {
391 if (fp->fsz_count[i])
392 printf("%d\t%d\t%d\n",fp->fsz_first + i,
394 SIZE(sz += fp->fsz_sz[i]));
400 douser(int fd, struct fs *super, char *name)
403 struct user *usr, *usrs;
407 maxino = super->fs_ncg * super->fs_ipg - 1;
408 for (inode = 0; inode < maxino; inode++) {
410 if ((ip = get_inode(fd,super,inode))
413 estimate ? virtualblocks(super,ip) :
414 actualblocks(super,ip),
420 if (!(usrs = (struct user *)malloc(nusers * sizeof(struct user))))
421 errx(1, "allocate users");
422 bcopy(users,usrs,nusers * sizeof(struct user));
424 for (usr = usrs, n = nusers; --n >= 0 && usr->count; usr++) {
425 printf("%5d",SIZE(usr->space));
427 printf("\t%5ld",usr->count);
428 printf("\t%-8s",usr->name);
430 printf("\t%5d\t%5d\t%5d",
440 donames(int fd, struct fs *super, char *name)
447 maxino = super->fs_ncg * super->fs_ipg - 1;
448 /* first skip the name of the filesystem */
449 while ((c = getchar()) != EOF && (c < '0' || c > '9'))
450 while ((c = getchar()) != EOF && c != '\n');
453 while (scanf("%u",&inode) == 1) {
454 if (inode > maxino) {
455 warnx("illegal inode %d",inode);
459 if ((ip = get_inode(fd,super,inode))
461 printf("%s\t",user(ip->di_uid)->name);
462 /* now skip whitespace */
463 while ((c = getchar()) == ' ' || c == '\t');
464 /* and print out the remainder of the input line */
465 while (c != EOF && c != '\n') {
476 while ((c = getchar()) != EOF && c != '\n');
487 fprintf(stderr,"usage: quot [-nfcvha] [filesystem ...]\n");
489 fprintf(stderr,"usage: quot [-acfhknv] [filesystem ...]\n");
494 static char superblock[SBSIZE];
497 quot(char *name, char *mp)
501 get_inode(-1, NULL, 0); /* flush cache */
504 if ((fd = open(name,0)) < 0
505 || lseek(fd,SBOFF,0) != SBOFF
506 || read(fd,superblock,SBSIZE) != SBSIZE) {
511 if (((struct fs *)superblock)->fs_magic != FS_MAGIC) {
512 warnx("%s: not a BSD filesystem",name);
520 (*func)(fd,(struct fs *)superblock,name);
525 main(int argc, char **argv)
530 char dev[MNAMELEN + 1];
536 header = getbsize(&headerlen,&blocksize);
538 while (--argc > 0 && **++argv == '-') {
570 cnt = getmntinfo(&mp,MNT_NOWAIT);
571 for (; --cnt >= 0; mp++) {
572 if (!strncmp(mp->f_fstypename, "ufs", MFSNAMELEN)) {
573 if ((nm = strrchr(mp->f_mntfromname,'/'))) {
574 sprintf(dev,"%s%s",_PATH_DEV,nm + 1);
577 nm = mp->f_mntfromname;
578 quot(nm,mp->f_mntonname);
582 while (--argc >= 0) {
583 if ((fs = getfsfile(*argv)) != NULL)
584 quot(fs->fs_spec, 0);