1 /* 2 * Copyright (c) 1980, 1990, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * Robert Elz at The University of Melbourne. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 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 * 4. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 #if 0 34 #ifndef lint 35 static const char copyright[] = 36 "@(#) Copyright (c) 1980, 1990, 1993\n\ 37 The Regents of the University of California. All rights reserved.\n"; 38 #endif /* not lint */ 39 40 #ifndef lint 41 static char sccsid[] = "@(#)quotacheck.c 8.3 (Berkeley) 1/29/94"; 42 #endif /* not lint */ 43 #endif 44 #include <sys/cdefs.h> 45 __FBSDID("$FreeBSD$"); 46 47 /* 48 * Fix up / report on disk quotas & usage 49 */ 50 #include <sys/param.h> 51 #include <sys/disklabel.h> 52 #include <sys/mount.h> 53 #include <sys/stat.h> 54 55 #include <ufs/ufs/dinode.h> 56 #include <ufs/ufs/quota.h> 57 #include <ufs/ffs/fs.h> 58 59 #include <err.h> 60 #include <errno.h> 61 #include <fcntl.h> 62 #include <fstab.h> 63 #include <grp.h> 64 #include <libutil.h> 65 #include <pwd.h> 66 #include <stdio.h> 67 #include <stdlib.h> 68 #include <string.h> 69 #include <unistd.h> 70 71 #include "quotacheck.h" 72 73 char *qfname = QUOTAFILENAME; 74 char *qfextension[] = INITQFNAMES; 75 char *quotagroup = QUOTAGROUP; 76 77 union { 78 struct fs sblk; 79 char dummy[MAXBSIZE]; 80 } sb_un; 81 #define sblock sb_un.sblk 82 union { 83 struct cg cgblk; 84 char dummy[MAXBSIZE]; 85 } cg_un; 86 #define cgblk cg_un.cgblk 87 long dev_bsize = 1; 88 ino_t maxino; 89 90 union dinode { 91 struct ufs1_dinode dp1; 92 struct ufs2_dinode dp2; 93 }; 94 #define DIP(dp, field) \ 95 ((sblock.fs_magic == FS_UFS1_MAGIC) ? \ 96 (dp)->dp1.field : (dp)->dp2.field) 97 98 #define HASUSR 1 99 #define HASGRP 2 100 101 struct fileusage { 102 struct fileusage *fu_next; 103 u_long fu_curinodes; 104 u_long fu_curblocks; 105 u_long fu_id; 106 char fu_name[1]; 107 /* actually bigger */ 108 }; 109 #define FUHASH 1024 /* must be power of two */ 110 struct fileusage *fuhead[MAXQUOTAS][FUHASH]; 111 112 int aflag; /* all file systems */ 113 int cflag; /* convert format to 32 or 64 bit size */ 114 int gflag; /* check group quotas */ 115 int uflag; /* check user quotas */ 116 int vflag; /* verbose */ 117 int fi; /* open disk file descriptor */ 118 119 struct fileusage * 120 addid(u_long, int, char *, const char *); 121 void bread(ufs2_daddr_t, char *, long); 122 void freeinodebuf(void); 123 union dinode * 124 getnextinode(ino_t); 125 int getquotagid(void); 126 struct fileusage * 127 lookup(u_long, int); 128 int oneof(char *, char*[], int); 129 void printchanges(const char *, int, struct dqblk *, struct fileusage *, 130 u_long); 131 void setinodebuf(ino_t); 132 int update(const char *, struct quotafile *, int); 133 void usage(void); 134 135 int 136 main(int argc, char *argv[]) 137 { 138 struct fstab *fs; 139 struct passwd *pw; 140 struct group *gr; 141 struct quotafile *qfu, *qfg; 142 int i, argnum, maxrun, errs, ch; 143 long done = 0; 144 char *name; 145 146 errs = maxrun = 0; 147 while ((ch = getopt(argc, argv, "ac:guvl:")) != -1) { 148 switch(ch) { 149 case 'a': 150 aflag++; 151 break; 152 case 'c': 153 if (cflag) 154 usage(); 155 cflag = atoi(optarg); 156 break; 157 case 'g': 158 gflag++; 159 break; 160 case 'u': 161 uflag++; 162 break; 163 case 'v': 164 vflag++; 165 break; 166 case 'l': 167 maxrun = atoi(optarg); 168 break; 169 default: 170 usage(); 171 } 172 } 173 argc -= optind; 174 argv += optind; 175 if ((argc == 0 && !aflag) || (argc > 0 && aflag)) 176 usage(); 177 if (cflag && cflag != 32 && cflag != 64) 178 usage(); 179 if (!gflag && !uflag) { 180 gflag++; 181 uflag++; 182 } 183 if (gflag) { 184 setgrent(); 185 while ((gr = getgrent()) != NULL) 186 (void) addid((u_long)gr->gr_gid, GRPQUOTA, gr->gr_name, 187 NULL); 188 endgrent(); 189 } 190 if (uflag) { 191 setpwent(); 192 while ((pw = getpwent()) != NULL) 193 (void) addid((u_long)pw->pw_uid, USRQUOTA, pw->pw_name, 194 NULL); 195 endpwent(); 196 } 197 /* 198 * The maxrun (-l) option is now deprecated. 199 */ 200 if (maxrun > 0) 201 warnx("the -l option is now deprecated"); 202 if (aflag) 203 exit(checkfstab(uflag, gflag)); 204 if (setfsent() == 0) 205 errx(1, "%s: can't open", FSTAB); 206 while ((fs = getfsent()) != NULL) { 207 if (((argnum = oneof(fs->fs_file, argv, argc)) >= 0 || 208 (argnum = oneof(fs->fs_spec, argv, argc)) >= 0) && 209 (name = blockcheck(fs->fs_spec))) { 210 done |= 1 << argnum; 211 qfu = NULL; 212 if (uflag) 213 qfu = quota_open(fs, USRQUOTA, O_CREAT|O_RDWR); 214 qfg = NULL; 215 if (gflag) 216 qfg = quota_open(fs, GRPQUOTA, O_CREAT|O_RDWR); 217 if (qfu == NULL && qfg == NULL) 218 continue; 219 errs += chkquota(name, qfu, qfg); 220 if (qfu) 221 quota_close(qfu); 222 if (qfg) 223 quota_close(qfg); 224 } 225 } 226 endfsent(); 227 for (i = 0; i < argc; i++) 228 if ((done & (1 << i)) == 0) 229 fprintf(stderr, "%s not found in %s\n", 230 argv[i], FSTAB); 231 exit(errs); 232 } 233 234 void 235 usage(void) 236 { 237 (void)fprintf(stderr, "%s\n%s\n", 238 "usage: quotacheck [-guv] [-c 32 | 64] [-l maxrun] -a", 239 " quotacheck [-guv] [-c 32 | 64] filesystem ..."); 240 exit(1); 241 } 242 243 /* 244 * Possible superblock locations ordered from most to least likely. 245 */ 246 static int sblock_try[] = SBLOCKSEARCH; 247 248 /* 249 * Scan the specified file system to check quota(s) present on it. 250 */ 251 int 252 chkquota(char *specname, struct quotafile *qfu, struct quotafile *qfg) 253 { 254 struct fileusage *fup; 255 union dinode *dp; 256 int cg, i, mode, errs = 0; 257 ino_t ino, inosused, userino = 0, groupino = 0; 258 dev_t dev, userdev = 0, groupdev = 0; 259 struct stat sb; 260 const char *mntpt; 261 char *cp; 262 263 if (qfu != NULL) 264 mntpt = quota_fsname(qfu); 265 else if (qfg != NULL) 266 mntpt = quota_fsname(qfg); 267 else 268 errx(1, "null quotafile information passed to chkquota()\n"); 269 if (cflag) { 270 if (vflag && qfu != NULL) 271 printf("%s: convert user quota to %d bits\n", 272 mntpt, cflag); 273 if (qfu != NULL && quota_convert(qfu, cflag) < 0) { 274 if (errno == EBADF) 275 errx(1, 276 "%s: cannot convert an active quota file", 277 mntpt); 278 err(1, "user quota conversion to size %d failed", 279 cflag); 280 } 281 if (vflag && qfg != NULL) 282 printf("%s: convert group quota to %d bits\n", 283 mntpt, cflag); 284 if (qfg != NULL && quota_convert(qfg, cflag) < 0) { 285 if (errno == EBADF) 286 errx(1, 287 "%s: cannot convert an active quota file", 288 mntpt); 289 err(1, "group quota conversion to size %d failed", 290 cflag); 291 } 292 } 293 if ((fi = open(specname, O_RDONLY, 0)) < 0) { 294 warn("%s", specname); 295 return (1); 296 } 297 if ((stat(mntpt, &sb)) < 0) { 298 warn("%s", mntpt); 299 return (1); 300 } 301 dev = sb.st_dev; 302 if (vflag) { 303 (void)printf("*** Checking "); 304 if (qfu) 305 (void)printf("user%s", qfg ? " and " : ""); 306 if (qfg) 307 (void)printf("group"); 308 (void)printf(" quotas for %s (%s)\n", specname, mntpt); 309 } 310 if (qfu) { 311 if (stat(quota_qfname(qfu), &sb) == 0) { 312 userino = sb.st_ino; 313 userdev = sb.st_dev; 314 } 315 } 316 if (qfg) { 317 if (stat(quota_qfname(qfg), &sb) == 0) { 318 groupino = sb.st_ino; 319 groupdev = sb.st_dev; 320 } 321 } 322 sync(); 323 dev_bsize = 1; 324 for (i = 0; sblock_try[i] != -1; i++) { 325 bread(sblock_try[i], (char *)&sblock, (long)SBLOCKSIZE); 326 if ((sblock.fs_magic == FS_UFS1_MAGIC || 327 (sblock.fs_magic == FS_UFS2_MAGIC && 328 sblock.fs_sblockloc == sblock_try[i])) && 329 sblock.fs_bsize <= MAXBSIZE && 330 sblock.fs_bsize >= sizeof(struct fs)) 331 break; 332 } 333 if (sblock_try[i] == -1) { 334 warn("Cannot find file system superblock"); 335 return (1); 336 } 337 dev_bsize = sblock.fs_fsize / fsbtodb(&sblock, 1); 338 maxino = sblock.fs_ncg * sblock.fs_ipg; 339 for (cg = 0; cg < sblock.fs_ncg; cg++) { 340 ino = cg * sblock.fs_ipg; 341 setinodebuf(ino); 342 bread(fsbtodb(&sblock, cgtod(&sblock, cg)), (char *)(&cgblk), 343 sblock.fs_cgsize); 344 if (sblock.fs_magic == FS_UFS2_MAGIC) 345 inosused = cgblk.cg_initediblk; 346 else 347 inosused = sblock.fs_ipg; 348 /* 349 * If we are using soft updates, then we can trust the 350 * cylinder group inode allocation maps to tell us which 351 * inodes are allocated. We will scan the used inode map 352 * to find the inodes that are really in use, and then 353 * read only those inodes in from disk. 354 */ 355 if (sblock.fs_flags & FS_DOSOFTDEP) { 356 if (!cg_chkmagic(&cgblk)) 357 errx(1, "CG %d: BAD MAGIC NUMBER\n", cg); 358 cp = &cg_inosused(&cgblk)[(inosused - 1) / CHAR_BIT]; 359 for ( ; inosused > 0; inosused -= CHAR_BIT, cp--) { 360 if (*cp == 0) 361 continue; 362 for (i = 1 << (CHAR_BIT - 1); i > 0; i >>= 1) { 363 if (*cp & i) 364 break; 365 inosused--; 366 } 367 break; 368 } 369 if (inosused <= 0) 370 continue; 371 } 372 for (i = 0; i < inosused; i++, ino++) { 373 if ((dp = getnextinode(ino)) == NULL || ino < ROOTINO || 374 (mode = DIP(dp, di_mode) & IFMT) == 0) 375 continue; 376 /* 377 * XXX: Do not account for UIDs or GIDs that appear 378 * to be negative to prevent generating 100GB+ 379 * quota files. 380 */ 381 if ((int)DIP(dp, di_uid) < 0 || 382 (int)DIP(dp, di_gid) < 0) { 383 if (vflag) { 384 if (aflag) 385 (void)printf("%s: ", mntpt); 386 (void)printf("out of range UID/GID (%u/%u) ino=%u\n", 387 DIP(dp, di_uid), DIP(dp,di_gid), 388 ino); 389 } 390 continue; 391 } 392 393 /* 394 * Do not account for file system snapshot files 395 * or the actual quota data files to be consistent 396 * with how they are handled inside the kernel. 397 */ 398 #ifdef SF_SNAPSHOT 399 if (DIP(dp, di_flags) & SF_SNAPSHOT) 400 continue; 401 #endif 402 if ((ino == userino && dev == userdev) || 403 (ino == groupino && dev == groupdev)) 404 continue; 405 if (qfg) { 406 fup = addid((u_long)DIP(dp, di_gid), GRPQUOTA, 407 (char *)0, mntpt); 408 fup->fu_curinodes++; 409 if (mode == IFREG || mode == IFDIR || 410 mode == IFLNK) 411 fup->fu_curblocks += DIP(dp, di_blocks); 412 } 413 if (qfu) { 414 fup = addid((u_long)DIP(dp, di_uid), USRQUOTA, 415 (char *)0, mntpt); 416 fup->fu_curinodes++; 417 if (mode == IFREG || mode == IFDIR || 418 mode == IFLNK) 419 fup->fu_curblocks += DIP(dp, di_blocks); 420 } 421 } 422 } 423 freeinodebuf(); 424 if (qfu) 425 errs += update(mntpt, qfu, USRQUOTA); 426 if (qfg) 427 errs += update(mntpt, qfg, GRPQUOTA); 428 close(fi); 429 (void)fflush(stdout); 430 return (errs); 431 } 432 433 /* 434 * Update a specified quota file. 435 */ 436 int 437 update(const char *fsname, struct quotafile *qf, int type) 438 { 439 struct fileusage *fup; 440 u_long id, lastid, highid = 0; 441 struct dqblk dqbuf; 442 struct stat sb; 443 static struct dqblk zerodqbuf; 444 static struct fileusage zerofileusage; 445 446 /* 447 * Scan the on-disk quota file and record any usage changes. 448 */ 449 lastid = quota_maxid(qf); 450 for (id = 0; id <= lastid; id++) { 451 if (quota_read(qf, &dqbuf, id) < 0) 452 dqbuf = zerodqbuf; 453 if ((fup = lookup(id, type)) == NULL) 454 fup = &zerofileusage; 455 if (fup->fu_curinodes || fup->fu_curblocks || 456 dqbuf.dqb_bsoftlimit || dqbuf.dqb_bhardlimit || 457 dqbuf.dqb_isoftlimit || dqbuf.dqb_ihardlimit) 458 highid = id; 459 if (dqbuf.dqb_curinodes == fup->fu_curinodes && 460 dqbuf.dqb_curblocks == fup->fu_curblocks) { 461 fup->fu_curinodes = 0; 462 fup->fu_curblocks = 0; 463 continue; 464 } 465 printchanges(fsname, type, &dqbuf, fup, id); 466 dqbuf.dqb_curinodes = fup->fu_curinodes; 467 dqbuf.dqb_curblocks = fup->fu_curblocks; 468 (void) quota_write_usage(qf, &dqbuf, id); 469 fup->fu_curinodes = 0; 470 fup->fu_curblocks = 0; 471 } 472 473 /* 474 * Walk the hash table looking for ids with non-zero usage 475 * that are not currently recorded in the quota file. E.g. 476 * ids that are past the end of the current file. 477 */ 478 for (id = 0; id < FUHASH; id++) { 479 for (fup = fuhead[type][id]; fup != NULL; fup = fup->fu_next) { 480 if (fup->fu_id <= lastid) 481 continue; 482 if (fup->fu_curinodes == 0 && fup->fu_curblocks == 0) 483 continue; 484 bzero(&dqbuf, sizeof(struct dqblk)); 485 if (fup->fu_id > highid) 486 highid = fup->fu_id; 487 printchanges(fsname, type, &dqbuf, fup, fup->fu_id); 488 dqbuf.dqb_curinodes = fup->fu_curinodes; 489 dqbuf.dqb_curblocks = fup->fu_curblocks; 490 (void) quota_write_usage(qf, &dqbuf, fup->fu_id); 491 fup->fu_curinodes = 0; 492 fup->fu_curblocks = 0; 493 } 494 } 495 /* 496 * If this is old format file, then size may be smaller, 497 * so ensure that we only truncate when it will make things 498 * smaller, and not if it will grow an old format file. 499 */ 500 if (highid < lastid && 501 stat(quota_qfname(qf), &sb) == 0 && 502 sb.st_size > (((off_t)highid + 2) * sizeof(struct dqblk))) 503 truncate(quota_qfname(qf), 504 (((off_t)highid + 2) * sizeof(struct dqblk))); 505 return (0); 506 } 507 508 /* 509 * Check to see if target appears in list of size cnt. 510 */ 511 int 512 oneof(char *target, char *list[], int cnt) 513 { 514 int i; 515 516 for (i = 0; i < cnt; i++) 517 if (strcmp(target, list[i]) == 0) 518 return (i); 519 return (-1); 520 } 521 522 /* 523 * Determine the group identifier for quota files. 524 */ 525 int 526 getquotagid(void) 527 { 528 struct group *gr; 529 530 if ((gr = getgrnam(quotagroup)) != NULL) 531 return (gr->gr_gid); 532 return (-1); 533 } 534 535 /* 536 * Routines to manage the file usage table. 537 * 538 * Lookup an id of a specific type. 539 */ 540 struct fileusage * 541 lookup(u_long id, int type) 542 { 543 struct fileusage *fup; 544 545 for (fup = fuhead[type][id & (FUHASH-1)]; fup != 0; fup = fup->fu_next) 546 if (fup->fu_id == id) 547 return (fup); 548 return (NULL); 549 } 550 551 /* 552 * Add a new file usage id if it does not already exist. 553 */ 554 struct fileusage * 555 addid(u_long id, int type, char *name, const char *fsname) 556 { 557 struct fileusage *fup, **fhp; 558 int len; 559 560 if ((fup = lookup(id, type)) != NULL) 561 return (fup); 562 if (name) 563 len = strlen(name); 564 else 565 len = 0; 566 if ((fup = calloc(1, sizeof(*fup) + len)) == NULL) 567 errx(1, "calloc failed"); 568 fhp = &fuhead[type][id & (FUHASH - 1)]; 569 fup->fu_next = *fhp; 570 *fhp = fup; 571 fup->fu_id = id; 572 if (name) 573 bcopy(name, fup->fu_name, len + 1); 574 else { 575 (void)sprintf(fup->fu_name, "%lu", id); 576 if (vflag) { 577 if (aflag && fsname != NULL) 578 (void)printf("%s: ", fsname); 579 printf("unknown %cid: %lu\n", 580 type == USRQUOTA ? 'u' : 'g', id); 581 } 582 } 583 return (fup); 584 } 585 586 /* 587 * Special purpose version of ginode used to optimize pass 588 * over all the inodes in numerical order. 589 */ 590 static ino_t nextino, lastinum, lastvalidinum; 591 static long readcnt, readpercg, fullcnt, inobufsize, partialcnt, partialsize; 592 static caddr_t inodebuf; 593 #define INOBUFSIZE 56*1024 /* size of buffer to read inodes */ 594 595 union dinode * 596 getnextinode(ino_t inumber) 597 { 598 long size; 599 ufs2_daddr_t dblk; 600 union dinode *dp; 601 static caddr_t nextinop; 602 603 if (inumber != nextino++ || inumber > lastvalidinum) 604 errx(1, "bad inode number %d to nextinode", inumber); 605 if (inumber >= lastinum) { 606 readcnt++; 607 dblk = fsbtodb(&sblock, ino_to_fsba(&sblock, lastinum)); 608 if (readcnt % readpercg == 0) { 609 size = partialsize; 610 lastinum += partialcnt; 611 } else { 612 size = inobufsize; 613 lastinum += fullcnt; 614 } 615 /* 616 * If bread returns an error, it will already have zeroed 617 * out the buffer, so we do not need to do so here. 618 */ 619 bread(dblk, inodebuf, size); 620 nextinop = inodebuf; 621 } 622 dp = (union dinode *)nextinop; 623 if (sblock.fs_magic == FS_UFS1_MAGIC) 624 nextinop += sizeof(struct ufs1_dinode); 625 else 626 nextinop += sizeof(struct ufs2_dinode); 627 return (dp); 628 } 629 630 /* 631 * Prepare to scan a set of inodes. 632 */ 633 void 634 setinodebuf(ino_t inum) 635 { 636 637 if (inum % sblock.fs_ipg != 0) 638 errx(1, "bad inode number %d to setinodebuf", inum); 639 lastvalidinum = inum + sblock.fs_ipg - 1; 640 nextino = inum; 641 lastinum = inum; 642 readcnt = 0; 643 if (inodebuf != NULL) 644 return; 645 inobufsize = blkroundup(&sblock, INOBUFSIZE); 646 fullcnt = inobufsize / ((sblock.fs_magic == FS_UFS1_MAGIC) ? 647 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)); 648 readpercg = sblock.fs_ipg / fullcnt; 649 partialcnt = sblock.fs_ipg % fullcnt; 650 partialsize = partialcnt * ((sblock.fs_magic == FS_UFS1_MAGIC) ? 651 sizeof(struct ufs1_dinode) : sizeof(struct ufs2_dinode)); 652 if (partialcnt != 0) { 653 readpercg++; 654 } else { 655 partialcnt = fullcnt; 656 partialsize = inobufsize; 657 } 658 if ((inodebuf = malloc((unsigned)inobufsize)) == NULL) 659 errx(1, "cannot allocate space for inode buffer"); 660 } 661 662 /* 663 * Free up data structures used to scan inodes. 664 */ 665 void 666 freeinodebuf(void) 667 { 668 669 if (inodebuf != NULL) 670 free(inodebuf); 671 inodebuf = NULL; 672 } 673 674 /* 675 * Read specified disk blocks. 676 */ 677 void 678 bread(ufs2_daddr_t bno, char *buf, long cnt) 679 { 680 681 if (lseek(fi, (off_t)bno * dev_bsize, SEEK_SET) < 0 || 682 read(fi, buf, cnt) != cnt) 683 errx(1, "bread failed on block %ld", (long)bno); 684 } 685 686 /* 687 * Display updated block and i-node counts. 688 */ 689 void 690 printchanges(const char *fsname, int type, struct dqblk *dp, 691 struct fileusage *fup, u_long id) 692 { 693 if (!vflag) 694 return; 695 if (aflag) 696 (void)printf("%s: ", fsname); 697 if (fup->fu_name[0] == '\0') 698 (void)printf("%-8lu fixed ", id); 699 else 700 (void)printf("%-8s fixed ", fup->fu_name); 701 switch (type) { 702 703 case GRPQUOTA: 704 (void)printf("(group):"); 705 break; 706 707 case USRQUOTA: 708 (void)printf("(user): "); 709 break; 710 711 default: 712 (void)printf("(unknown quota type %d)", type); 713 break; 714 } 715 if (dp->dqb_curinodes != fup->fu_curinodes) 716 (void)printf("\tinodes %lu -> %lu", (u_long)dp->dqb_curinodes, 717 (u_long)fup->fu_curinodes); 718 if (dp->dqb_curblocks != fup->fu_curblocks) 719 (void)printf("\tblocks %lu -> %lu", 720 (u_long)dp->dqb_curblocks, 721 (u_long)fup->fu_curblocks); 722 (void)printf("\n"); 723 } 724