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.7 2007/12/27 02:25:41 swildner Exp $
35 #include <sys/param.h>
36 #include <sys/mount.h>
39 #include <vfs/ufs/dinode.h>
40 #include <vfs/ufs/inode.h>
41 #include <vfs/ufs/fs.h>
42 #include <vfs/ufs/quota.h>
56 /* some flags of what to do: */
60 static void (*func)(int, struct fs *, char *);
61 static long blocksize;
65 static struct ufs1_dinode *get_inode(int, struct fs *, ino_t);
66 static int virtualblocks(struct fs *, struct ufs1_dinode *);
67 static int isfree(struct ufs1_dinode *);
68 static void inituser(void);
69 static void usrrehash(void);
70 static struct user *user(uid_t);
71 static int cmpusers(const void *, const void *);
72 static void uses(uid_t, daddr_t, time_t);
73 static void initfsizes(void);
74 static void dofsizes(int, struct fs *, char *);
75 static void douser(int, struct fs *, char *);
76 static void donames(int, struct fs *, char *);
77 static void usage(void);
78 static void quot(char *, char *);
81 * Original BSD quot doesn't round to number of frags/blocks,
82 * doesn't account for indirection blocks and gets it totally
83 * wrong if the size is a multiple of the blocksize.
84 * The new code always counts the number of 512 byte blocks
85 * instead of the number of kilobytes and converts them to
86 * kByte when done (on request).
88 * Due to the size of modern disks, we must cast intermediate
89 * values to 64 bits to prevent potential overflows.
94 #define SIZE(n) ((int)(((quad_t)(n) * 512 + blocksize - 1)/blocksize))
97 #define INOCNT(fs) ((fs)->fs_ipg)
98 #define INOSZ(fs) (sizeof(struct ufs1_dinode) * INOCNT(fs))
100 static struct ufs1_dinode *
101 get_inode(int fd, struct fs *super, ino_t ino)
103 static struct ufs1_dinode *ip;
106 if (fd < 0) { /* flush cache */
114 if (!ip || ino < last || ino >= last + INOCNT(super)) {
116 && !(ip = (struct ufs1_dinode *)malloc(INOSZ(super))))
117 errx(1, "allocate inodes");
118 last = (ino / INOCNT(super)) * INOCNT(super);
119 if (lseek(fd, (off_t)ino_to_fsba(super, last) << super->fs_fshift, 0) < (off_t)0
120 || read(fd,ip,INOSZ(super)) != (ssize_t)INOSZ(super))
121 err(1, "read inodes");
124 return ip + ino % INOCNT(super);
128 #define actualblocks(super,ip) ((ip)->di_blocks/2)
130 #define actualblocks(super,ip) ((ip)->di_blocks)
134 virtualblocks(struct fs *super, struct ufs1_dinode *ip)
140 if (lblkno(super,sz) >= NDADDR) {
141 nblk = blkroundup(super,sz);
143 nblk += super->fs_bsize;
150 if (lblkno(super,sz) >= NDADDR) {
151 nblk = blkroundup(super,sz);
152 sz = lblkno(super,nblk);
153 sz = (sz - NDADDR + NINDIR(super) - 1) / NINDIR(super);
155 nblk += sz * super->fs_bsize;
156 /* sz - 1 rounded up */
157 sz = (sz - 1 + NINDIR(super) - 1) / NINDIR(super);
160 nblk = fragroundup(super,sz);
167 isfree(struct ufs1_dinode *ip)
170 return (ip->di_mode&IFMT) == 0;
173 switch (ip->di_mode&IFMT) {
175 case IFLNK: /* should check FASTSYMLINK? */
205 (struct user *)calloc(nusers,sizeof(struct user))))
206 errx(1, "allocate users");
208 for (usr = users, i = nusers; --i >= 0; usr++) {
209 usr->space = usr->spc30 = usr->spc60 = usr->spc90 = 0;
219 struct user *usr, *usrn;
224 if (!(users = (struct user *)calloc(nusers,sizeof(struct user))))
225 errx(1, "allocate users");
226 for (usr = svusr, i = nusers >> 1; --i >= 0; usr++) {
227 for (usrn = users + (usr->uid&(nusers - 1)); usrn->name;
230 usrn = users + nusers;
244 for (usr = users + (uid&(nusers - 1)), i = nusers; --i >= 0;
249 if (!(pwd = getpwuid(uid))) {
250 if ((usr->name = (char *)malloc(7)))
251 sprintf(usr->name,"#%d",uid);
253 if ((usr->name = (char *)
254 malloc(strlen(pwd->pw_name) + 1)))
255 strcpy(usr->name,pwd->pw_name);
258 errx(1, "allocate users");
262 } else if (usr->uid == uid)
266 usr = users + nusers;
273 cmpusers(const void *v1, const void *v2)
275 const struct user *u1, *u2;
276 u1 = (const struct user *)v1;
277 u2 = (const struct user *)v2;
279 return u2->space - u1->space;
282 #define sortusers(users) (qsort((users),nusers,sizeof(struct user), \
286 uses(uid_t uid, daddr_t blks, time_t act)
298 if (today - act > 90L * 24L * 60L * 60L)
300 if (today - act > 60L * 24L * 60L * 60L)
302 if (today - act > 30L * 24L * 60L * 60L)
312 struct fsizes *fsz_next;
313 daddr_t fsz_first, fsz_last;
314 ino_t fsz_count[FSZCNT];
315 daddr_t fsz_sz[FSZCNT];
324 for (fp = fsizes; fp; fp = fp->fsz_next) {
325 for (i = FSZCNT; --i >= 0;) {
326 fp->fsz_count[i] = 0;
333 dofsizes(int fd, struct fs *super, char *name)
336 struct ufs1_dinode *ip;
338 struct fsizes *fp, **fsp;
341 maxino = super->fs_ncg * super->fs_ipg - 1;
343 if (!(fsizes = (struct fsizes *)malloc(sizeof(struct fsizes))))
344 errx(1, "allocate fsize structure");
346 for (inode = 0; inode < maxino; inode++) {
348 if ((ip = get_inode(fd,super,inode))
350 && ((ip->di_mode&IFMT) == IFREG
351 || (ip->di_mode&IFMT) == IFDIR)
356 sz = estimate ? virtualblocks(super,ip) :
357 actualblocks(super,ip);
360 fsizes->fsz_count[FSZCNT-1]++;
361 fsizes->fsz_sz[FSZCNT-1] += sz;
363 fsizes->fsz_count[sz]++;
364 fsizes->fsz_sz[sz] += sz;
368 for (fsp = &fsizes; (fp = *fsp); fsp = &fp->fsz_next) {
369 if (ksz < fp->fsz_last)
372 if (!fp || ksz < fp->fsz_first) {
373 if (!(fp = (struct fsizes *)
374 malloc(sizeof(struct fsizes))))
375 errx(1, "allocate fsize structure");
378 fp->fsz_first = (ksz / FSZCNT) * FSZCNT;
379 fp->fsz_last = fp->fsz_first + FSZCNT;
380 for (i = FSZCNT; --i >= 0;) {
381 fp->fsz_count[i] = 0;
385 fp->fsz_count[ksz % FSZCNT]++;
386 fp->fsz_sz[ksz % FSZCNT] += sz;
393 for (fp = fsizes; fp; fp = fp->fsz_next) {
394 for (i = 0; i < FSZCNT; i++) {
395 if (fp->fsz_count[i])
396 printf("%d\t%ju\t%d\n",fp->fsz_first + i,
397 (uintmax_t)fp->fsz_count[i],
398 SIZE(sz += fp->fsz_sz[i]));
404 douser(int fd, struct fs *super, char *name)
407 struct user *usr, *usrs;
408 struct ufs1_dinode *ip;
411 maxino = super->fs_ncg * super->fs_ipg - 1;
412 for (inode = 0; inode < maxino; inode++) {
414 if ((ip = get_inode(fd,super,inode))
417 estimate ? virtualblocks(super,ip) :
418 actualblocks(super,ip),
424 if (!(usrs = (struct user *)malloc(nusers * sizeof(struct user))))
425 errx(1, "allocate users");
426 bcopy(users,usrs,nusers * sizeof(struct user));
428 for (usr = usrs, n = nusers; --n >= 0 && usr->count; usr++) {
429 printf("%5d",SIZE(usr->space));
431 printf("\t%5ld",usr->count);
432 printf("\t%-8s",usr->name);
434 printf("\t%5d\t%5d\t%5d",
444 donames(int fd, struct fs *super, char *name)
449 struct ufs1_dinode *ip;
451 maxino = super->fs_ncg * super->fs_ipg - 1;
452 /* first skip the name of the filesystem */
453 while ((c = getchar()) != EOF && (c < '0' || c > '9'))
454 while ((c = getchar()) != EOF && c != '\n');
457 while (scanf("%"SCNuMAX,&inode) == 1) {
458 if (inode > maxino) {
459 warnx("illegal inode %ju",(uintmax_t)inode);
463 if ((ip = get_inode(fd,super,inode))
465 printf("%s\t",user(ip->di_uid)->name);
466 /* now skip whitespace */
467 while ((c = getchar()) == ' ' || c == '\t');
468 /* and print out the remainder of the input line */
469 while (c != EOF && c != '\n') {
480 while ((c = getchar()) != EOF && c != '\n');
491 fprintf(stderr,"usage: quot [-nfcvha] [filesystem ...]\n");
493 fprintf(stderr,"usage: quot [-acfhknv] [filesystem ...]\n");
498 static char superblock[SBSIZE];
501 quot(char *name, char *mp)
505 get_inode(-1, NULL, 0); /* flush cache */
508 if ((fd = open(name,0)) < 0
509 || lseek(fd,SBOFF,0) != SBOFF
510 || read(fd,superblock,SBSIZE) != SBSIZE) {
515 if (((struct fs *)superblock)->fs_magic != FS_MAGIC) {
516 warnx("%s: not a BSD filesystem",name);
524 (*func)(fd,(struct fs *)superblock,name);
529 main(int argc, char **argv)
534 char dev[MNAMELEN + 1];
540 header = getbsize(&headerlen,&blocksize);
542 while (--argc > 0 && **++argv == '-') {
574 cnt = getmntinfo(&mp,MNT_NOWAIT);
575 for (; --cnt >= 0; mp++) {
576 if (!strncmp(mp->f_fstypename, "ufs", MFSNAMELEN)) {
577 if ((nm = strrchr(mp->f_mntfromname,'/'))) {
578 sprintf(dev,"%s%s",_PATH_DEV,nm + 1);
581 nm = mp->f_mntfromname;
582 quot(nm,mp->f_mntonname);
586 while (--argc >= 0) {
587 if ((fs = getfsfile(*argv)) != NULL)
588 quot(fs->fs_spec, 0);