/* * Copyright (c) 2002-2007 Apple Inc. All rights reserved. * * @APPLE_LICENSE_HEADER_START@ * * This file contains Original Code and/or Modifications of Original Code * as defined in and that are subject to the Apple Public Source License * Version 2.0 (the 'License'). You may not use this file except in * compliance with the License. Please obtain a copy of the License at * http://www.opensource.apple.com/apsl/ and read it before using this * file. * * The Original Code and all software distributed under the License are * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. * Please see the License for the specific language governing rights and * limitations under the License. * * @APPLE_LICENSE_HEADER_END@ */ /* * Copyright (c) 1980, 1990, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * Robert Elz at The University of Melbourne. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /* * Disk quota reporting program. */ #include #include #ifdef __APPLE__ #include #endif /* __APPLE */ #include #include #include #include #include #include #include #include #include #include #include #include #include char *qfname = QUOTAFILENAME; char *qfextension[] = INITQFNAMES; #ifdef __APPLE__ u_int32_t quotamagic[MAXQUOTAS] = INITQMAGICS; #endif /* __APPLE__ */ struct quotause { struct quotause *next; long flags; struct dqblk dqblk; char fsname[MAXPATHLEN + 1]; } *getprivs(); #define FOUND 0x01 int qflag; int vflag; int alldigits __P((char *)); int hasquota __P((struct statfs *, int, char **)); void heading __P((int, u_long, char *, char *)); void showgid __P((u_long)); void showuid __P((u_long)); void showgrpname __P((char *)); void showquotas __P((int, u_long, char *)); void showusrname __P((char *)); void usage __P((void)); #ifdef __APPLE__ int qflookup(int, u_long, int, struct dqblk *); #endif /* __APPLE__ */ int main(argc, argv) char *argv[]; { int ngroups; gid_t gidset[NGROUPS]; int i, gflag = 0, uflag = 0; char ch; #if 0 if (quotactl("/", 0, 0, (caddr_t)0) < 0 && errno == ENOTSUP) { fprintf(stderr, "There are no quotas on this system\n"); exit(0); } #endif while ((ch = getopt(argc, argv, "ugvq")) != EOF) { switch(ch) { case 'g': gflag++; break; case 'u': uflag++; break; case 'v': vflag++; break; case 'q': qflag++; break; default: usage(); } } argc -= optind; argv += optind; if (!uflag && !gflag) uflag++; if (argc == 0) { if (uflag) showuid(getuid()); if (gflag) { ngroups = getgroups(NGROUPS, gidset); if (ngroups < 0) { perror("quota: getgroups"); exit(1); } for (i = 1; i < ngroups; i++) showgid(gidset[i]); } exit(0); } if (uflag && gflag) usage(); if (uflag) { for (; argc > 0; argc--, argv++) { if (alldigits(*argv)) showuid(atoi(*argv)); else showusrname(*argv); } exit(0); } if (gflag) { for (; argc > 0; argc--, argv++) { if (alldigits(*argv)) showgid(atoi(*argv)); else showgrpname(*argv); } exit(0); } exit(0); } void usage() { fprintf(stderr, "%s\n%s\n%s\n", "Usage: quota [-guqv]", "\tquota [-qv] -u username ...", "\tquota [-qv] -g groupname ..."); exit(1); } /* * Print out quotas for a specified user identifier. */ void showuid(uid) u_long uid; { struct passwd *pwd = getpwuid(uid); u_long myuid; char *name; if (pwd == NULL) name = "(no account)"; else name = pwd->pw_name; myuid = getuid(); if (uid != myuid && myuid != 0) { printf("quota: %s (uid %ld): permission denied\n", name, uid); return; } showquotas(USRQUOTA, uid, name); } /* * Print out quotas for a specifed user name. */ void showusrname(name) char *name; { struct passwd *pwd = getpwnam(name); u_long myuid; if (pwd == NULL) { fprintf(stderr, "quota: %s: unknown user\n", name); return; } myuid = getuid(); if (pwd->pw_uid != myuid && myuid != 0) { fprintf(stderr, "quota: %s (uid %d): permission denied\n", name, pwd->pw_uid); return; } showquotas(USRQUOTA, pwd->pw_uid, name); } /* * Print out quotas for a specified group identifier. */ void showgid(gid) u_long gid; { struct group *grp = getgrgid(gid); int ngroups; gid_t gidset[NGROUPS]; register int i; char *name; if (grp == NULL) name = "(no entry)"; else name = grp->gr_name; ngroups = getgroups(NGROUPS, gidset); if (ngroups < 0) { perror("quota: getgroups"); return; } for (i = 1; i < ngroups; i++) if (gid == gidset[i]) break; if (i >= ngroups && getuid() != 0) { fprintf(stderr, "quota: %s (gid %ld): permission denied\n", name, gid); return; } showquotas(GRPQUOTA, gid, name); } /* * Print out quotas for a specifed group name. */ void showgrpname(name) char *name; { struct group *grp = getgrnam(name); int ngroups; gid_t gidset[NGROUPS]; register int i; if (grp == NULL) { fprintf(stderr, "quota: %s: unknown group\n", name); return; } ngroups = getgroups(NGROUPS, gidset); if (ngroups < 0) { perror("quota: getgroups"); return; } for (i = 1; i < ngroups; i++) if (grp->gr_gid == gidset[i]) break; if (i >= ngroups && getuid() != 0) { fprintf(stderr, "quota: %s (gid %d): permission denied\n", name, grp->gr_gid); return; } showquotas(GRPQUOTA, grp->gr_gid, name); } void showquotas(type, id, name) int type; u_long id; char *name; { register struct quotause *qup; struct quotause *quplist, *getprivs(); char *msgi, *msgb, *timeprt(); int lines = 0; static time_t now; if (now == 0) time(&now); quplist = getprivs(id, type); for (qup = quplist; qup; qup = qup->next) { if (!vflag && qup->dqblk.dqb_isoftlimit == 0 && qup->dqblk.dqb_ihardlimit == 0 && qup->dqblk.dqb_bsoftlimit == 0 && qup->dqblk.dqb_bhardlimit == 0) continue; msgi = (char *)0; if (qup->dqblk.dqb_ihardlimit && qup->dqblk.dqb_curinodes >= qup->dqblk.dqb_ihardlimit) { msgi = "File limit reached on"; } else if (qup->dqblk.dqb_isoftlimit && qup->dqblk.dqb_curinodes >= qup->dqblk.dqb_isoftlimit) { if (qup->dqblk.dqb_itime > now) { msgi = "In file grace period on"; } else { msgi = "Over file quota on"; } } msgb = (char *)0; #ifdef __APPLE__ if (qup->dqblk.dqb_bhardlimit && qup->dqblk.dqb_curbytes >= qup->dqblk.dqb_bhardlimit) { msgb = "Block limit reached on"; } else if (qup->dqblk.dqb_bsoftlimit && qup->dqblk.dqb_curbytes >= qup->dqblk.dqb_bsoftlimit) { if (qup->dqblk.dqb_btime > now) { msgb = "In block grace period on"; } else { msgb = "Over block quota on"; } } #else if (qup->dqblk.dqb_bhardlimit && qup->dqblk.dqb_curblocks >= qup->dqblk.dqb_bhardlimit) { msgb = "Block limit reached on"; } else if (qup->dqblk.dqb_bsoftlimit && qup->dqblk.dqb_curblocks >= qup->dqblk.dqb_bsoftlimit) { if (qup->dqblk.dqb_btime > now) { msgb = "In block grace period on"; } else { msgb = "Over block quota on"; } } #endif /* __APPLE__ */ if (qflag) { if ((msgi != (char *)0 || msgb != (char *)0) && lines++ == 0) heading(type, id, name, ""); if (msgi != (char *)0) printf("\t%s %s\n", msgi, qup->fsname); if (msgb != (char *)0) printf("\t%s %s\n", msgb, qup->fsname); continue; } #ifdef __APPLE__ if (vflag || qup->dqblk.dqb_curbytes || qup->dqblk.dqb_curinodes) { if (lines++ == 0) heading(type, id, name, ""); printf("%15s %12qd%c %12qd %12qd %8s" , qup->fsname , qup->dqblk.dqb_curbytes / 1024 , (msgb == (char *)0) ? ' ' : '*' , qup->dqblk.dqb_bsoftlimit / 1024 , qup->dqblk.dqb_bhardlimit / 1024 , (msgb == (char *)0) ? "" : timeprt(qup->dqblk.dqb_btime)); #else if (vflag || qup->dqblk.dqb_curblocks || qup->dqblk.dqb_curinodes) { if (lines++ == 0) heading(type, id, name, ""); printf("%15s%8d%c%7d%8d%8s" , qup->fsname , dbtob(qup->dqblk.dqb_curblocks) / 1024 , (msgb == (char *)0) ? ' ' : '*' , dbtob(qup->dqblk.dqb_bsoftlimit) / 1024 , dbtob(qup->dqblk.dqb_bhardlimit) / 1024 , (msgb == (char *)0) ? "" : timeprt(qup->dqblk.dqb_btime)); #endif /* __APPLE__ */ printf("%8d%c%7d%8d%8s\n" , qup->dqblk.dqb_curinodes , (msgi == (char *)0) ? ' ' : '*' , qup->dqblk.dqb_isoftlimit , qup->dqblk.dqb_ihardlimit , (msgi == (char *)0) ? "" : timeprt(qup->dqblk.dqb_itime) ); continue; } } if (!qflag && lines == 0) heading(type, id, name, "none"); } void heading(type, id, name, tag) int type; u_long id; char *name, *tag; { printf("Disk quotas for %s %s (%cid %ld): %s\n", qfextension[type], name, *qfextension[type], id, tag); if (!qflag && tag[0] == '\0') { #ifdef __APPLE__ printf("%15s %12s %12s %12s %8s%8s %7s%8s%8s\n" , "Filesystem" , "1K blocks" #else printf("%15s%8s %7s%8s%8s%8s %7s%8s%8s\n" , "Filesystem" , "blocks" #endif /* __APPLE __*/ , "quota" , "limit" , "grace" , "files" , "quota" , "limit" , "grace" ); } } /* * Calculate the grace period and return a printable string for it. */ char * timeprt(seconds) time_t seconds; { time_t hours, minutes; static char buf[20]; static time_t now; if (now == 0) time(&now); if (now > seconds) return ("none"); seconds -= now; minutes = (seconds + 30) / 60; hours = (minutes + 30) / 60; if (hours >= 36) { snprintf(buf, sizeof(buf), "%ddays", (int)((hours + 12) / 24)); return (buf); } if (minutes >= 60) { snprintf(buf, sizeof(buf), "%2d:%d", (int)(minutes / 60), (int)(minutes % 60)); return (buf); } snprintf(buf, sizeof(buf), "%2d", (int)minutes); return (buf); } typedef struct { int alloced; int nels; char **strings; } mount_list_t; static void * init_list(int max) { mount_list_t *retval = NULL; retval = malloc(sizeof(*retval)); if (retval) { retval->strings = malloc(sizeof(char*) * max); if (retval->strings) { retval->alloced = max; } else { retval->alloced = 0; } retval->nels = 0; } return retval; } static void free_list(void *list) { mount_list_t *tmp = list; int i; if (tmp == NULL) return; for (i = 0; i < tmp->nels; i++) { free(tmp->strings[i]); } free(tmp); return; } static int hasseen(void *tmp, const char *mp) { int retval = 0; mount_list_t *list = tmp; int i; if (tmp == NULL || mp == NULL) goto done; /* * This could also be a binary search, but then we'd have to sort * after each addition. We may want to change the behaviour based * on the number of elements in the array. */ for (i = 0; i < list->nels; i++) { if (strcmp(list->strings[i], mp) == 0) { retval = 1; goto done; } } if (list->nels <= list->alloced) { char **a = realloc(list->strings, (list->alloced + 10) * sizeof(char*)); if (a) { list->alloced = list->alloced + 10; list->strings = a; } else { goto done; } } list->strings[list->nels++] = strdup(mp); done: return retval; } /* * Collect the requested quota information. */ #ifdef __APPLE__ struct quotause * getprivs(id, quotatype) register long id; int quotatype; { struct statfs *fst; register struct quotause *qup, *quptail; struct quotause *quphead; struct dqblk dqb; char *qfpathname; int qcmd, fd; int nfst, i; int error; void *cache; quptail = quphead = (struct quotause *)0; qcmd = QCMD(Q_GETQUOTA, quotatype); nfst = getmntinfo(&fst, MNT_WAIT); if (nfst==0) { fprintf(stderr, "quota: no mounted filesystems\n"); exit(1); } cache = init_list(nfst); for (i=0; idqblk, sizeof(dqb)); } else { if ((fd = open(qfpathname, O_RDONLY)) < 0) { perror(qfpathname); free(qup); continue; } if ((error = qflookup(fd, id, quotatype, &qup->dqblk))) { perror(qfpathname); close(fd); free(qup); continue; } close(fd); } strlcpy(qup->fsname, fst[i].f_mntonname, sizeof(qup->fsname)); if (quphead == NULL) quphead = qup; else quptail->next = qup; quptail = qup; qup->next = 0; } free_list(cache); return (quphead); } #else struct quotause * getprivs(id, quotatype) register long id; int quotatype; { register struct fstab *fs; register struct quotause *qup, *quptail; struct quotause *quphead; char *qfpathname; int qcmd, fd; setfsent(); quphead = (struct quotause *)0; qcmd = QCMD(Q_GETQUOTA, quotatype); while (fs = getfsent()) { if (strcmp(fs->fs_vfstype, "ufs")) continue; if (!hasquota(fs, quotatype, &qfpathname)) continue; if ((qup = (struct quotause *)malloc(sizeof *qup)) == NULL) { fprintf(stderr, "quota: out of memory\n"); exit(2); } if (quotactl(fs->fs_file, qcmd, id, &qup->dqblk) != 0) { if ((fd = open(qfpathname, O_RDONLY)) < 0) { perror(qfpathname); free(qup); continue; } lseek(fd, (off_t)(id * sizeof(struct dqblk)), L_SET); switch (read(fd, &qup->dqblk, sizeof(struct dqblk))) { case 0: /* EOF */ /* * Convert implicit 0 quota (EOF) * into an explicit one (zero'ed dqblk) */ bzero((caddr_t)&qup->dqblk, sizeof(struct dqblk)); break; case sizeof(struct dqblk): /* OK */ break; default: /* ERROR */ fprintf(stderr, "quota: read error"); perror(qfpathname); close(fd); free(qup); continue; } close(fd); } strlcpy(qup->fsname, fs->fs_file, sizeof(qup->fsname)); if (quphead == NULL) quphead = qup; else quptail->next = qup; quptail = qup; qup->next = 0; } endfsent(); return (quphead); } #endif /* __APPLE__ */ #ifdef __APPLE__ /* * Lookup an entry in the quota file. */ int qflookup(fd, id, type, dqbp) int fd; u_long id; int type; struct dqblk *dqbp; { struct dqfilehdr dqhdr; int i, skip, last, m; u_long mask; bzero(dqbp, sizeof(struct dqblk)); if (id == 0) return (0); lseek(fd, 0, L_SET); if (read(fd, &dqhdr, sizeof(struct dqfilehdr)) != sizeof(struct dqfilehdr)) { fprintf(stderr, "quota: read error\n"); return (errno); } /* Sanity check the quota file header. */ if ((OSSwapBigToHostInt32(dqhdr.dqh_magic) != quotamagic[type]) || (OSSwapBigToHostInt32(dqhdr.dqh_version) > QF_VERSION) || (!powerof2(OSSwapBigToHostInt32(dqhdr.dqh_maxentries)))) { fprintf(stderr, "quota: invalid quota file header\n"); return (EINVAL); } m = OSSwapBigToHostInt32(dqhdr.dqh_maxentries); mask = m - 1; i = dqhash1(id, dqhashshift(m), mask); skip = dqhash2(id, mask); for (last = (i + (m-1) * skip) & mask; i != last; i = (i + skip) & mask) { lseek(fd, dqoffset(i), L_SET); if (read(fd, dqbp, sizeof(struct dqblk)) < sizeof(struct dqblk)) { fprintf(stderr, "quota: read error at index %d\n", i); return (errno); } /* * Stop when an empty entry is found * or we encounter a matching id. */ if (dqbp->dqb_id == 0 || OSSwapBigToHostInt32(dqbp->dqb_id) == id) break; } /* Put data in host native byte order. */ dqbp->dqb_bhardlimit = OSSwapBigToHostInt64(dqbp->dqb_bhardlimit); dqbp->dqb_bsoftlimit = OSSwapBigToHostInt64(dqbp->dqb_bsoftlimit); dqbp->dqb_curbytes = OSSwapBigToHostInt64(dqbp->dqb_curbytes); dqbp->dqb_ihardlimit = OSSwapBigToHostInt32(dqbp->dqb_ihardlimit); dqbp->dqb_isoftlimit = OSSwapBigToHostInt32(dqbp->dqb_isoftlimit); dqbp->dqb_curinodes = OSSwapBigToHostInt32(dqbp->dqb_curinodes); dqbp->dqb_btime = OSSwapBigToHostInt32(dqbp->dqb_btime); dqbp->dqb_itime = OSSwapBigToHostInt32(dqbp->dqb_itime); dqbp->dqb_id = OSSwapBigToHostInt32(dqbp->dqb_id); return (0); } #endif /* __APPLE__ */ /* * Check to see if a particular quota is to be enabled. */ #ifdef __APPLE__ int hasquota(fst, type, qfnamep) register struct statfs *fst; int type; char **qfnamep; { struct stat sb; static char initname, usrname[100], grpname[100]; static char buf[BUFSIZ]; if (!initname) { snprintf(usrname, sizeof(usrname), "%s%s", qfextension[USRQUOTA], qfname); snprintf(grpname, sizeof(grpname), "%s%s", qfextension[GRPQUOTA], qfname); initname = 1; } /* We only support the default path to the on disk quota files. */ (void)snprintf(buf, sizeof(buf), "%s/%s.%s", fst->f_mntonname, QUOTAOPSNAME, qfextension[type] ); if (stat(buf, &sb) != 0) { /* There appears to be no mount option file */ return(0); } (void) snprintf(buf, sizeof(buf), "%s/%s.%s", fst->f_mntonname, qfname, qfextension[type]); *qfnamep = buf; return (1); } #else hasquota(fs, type, qfnamep) register struct fstab *fs; int type; char **qfnamep; { register char *opt; char *cp, *index(), *strtok(); static char initname, usrname[100], grpname[100]; static char buf[BUFSIZ]; if (!initname) { snprintf(usrname, sizeof(usrname), "%s%s", qfextension[USRQUOTA], qfname); snprintf(grpname, sizeof(grpname), "%s%s", qfextension[GRPQUOTA], qfname); initname = 1; } strlcpy(buf, fs->fs_mntops, sizeof(buf)); for (opt = strtok(buf, ","); opt; opt = strtok(NULL, ",")) { if (cp = index(opt, '=')) *cp++ = '\0'; if (type == USRQUOTA && strcmp(opt, usrname) == 0) break; if (type == GRPQUOTA && strcmp(opt, grpname) == 0) break; } if (!opt) return (0); if (cp) { *qfnamep = cp; return (1); } (void) snprintf(buf, sizeof(buf), "%s/%s.%s", fs->fs_file, qfname, qfextension[type]); *qfnamep = buf; return (1); } #endif /* __APPLE__ */ int alldigits(s) register char *s; { register int c; c = *s++; do { if (!isdigit(c)) return (0); } while ((c = *s++)); return (1); }