398 lines
9.8 KiB
C
398 lines
9.8 KiB
C
/*
|
|
* 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. 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.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef lint
|
|
__COPYRIGHT("@(#) Copyright (c) 1980, 1990, 1993\
|
|
The Regents of the University of California. All rights reserved.");
|
|
#endif /* not lint */
|
|
|
|
#ifndef lint
|
|
#if 0
|
|
static char sccsid[] = "@(#)repquota.c 8.2 (Berkeley) 11/22/94";
|
|
#else
|
|
__RCSID("$NetBSD: repquota.c,v 1.25 2010/02/17 18:55:14 bouyer Exp $");
|
|
#endif
|
|
#endif /* not lint */
|
|
|
|
/*
|
|
* Quota report
|
|
*/
|
|
#include <sys/param.h>
|
|
#include <sys/stat.h>
|
|
#include <sys/queue.h>
|
|
#include <ufs/ufs/quota.h>
|
|
#include <errno.h>
|
|
#include <fstab.h>
|
|
#include <grp.h>
|
|
#include <pwd.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
const char *qfname = QUOTAFILENAME;
|
|
const char *qfextension[] = INITQFNAMES;
|
|
|
|
struct fileusage {
|
|
struct fileusage *fu_next;
|
|
struct dqblk fu_dqblk;
|
|
u_long fu_id;
|
|
char fu_name[1];
|
|
/* actually bigger */
|
|
};
|
|
#define FUHASH 1024 /* must be power of two */
|
|
struct fileusage *fuhead[MAXQUOTAS][FUHASH];
|
|
u_long highid[MAXQUOTAS]; /* highest addid()'ed identifier per type */
|
|
|
|
int vflag; /* verbose */
|
|
int aflag; /* all file systems */
|
|
|
|
struct fileusage *addid __P((u_long, int, const char *));
|
|
int hasquota __P((struct fstab *, int, char **));
|
|
struct fileusage *lookup __P((u_long, int));
|
|
int main __P((int, char **));
|
|
int oneof __P((const char *, char **, int));
|
|
int repquota __P((struct fstab *, int, char *));
|
|
const char *timeprt __P((time_t));
|
|
void usage __P((void));
|
|
|
|
int
|
|
main(argc, argv)
|
|
int argc;
|
|
char **argv;
|
|
{
|
|
struct fstab *fs;
|
|
struct passwd *pw;
|
|
struct group *gr;
|
|
int gflag = 0, uflag = 0, errs = 0;
|
|
long i, argnum, done = 0;
|
|
char *qfnp;
|
|
int ch;
|
|
|
|
while ((ch = getopt(argc, argv, "aguv")) != -1) {
|
|
switch(ch) {
|
|
case 'a':
|
|
aflag++;
|
|
break;
|
|
case 'g':
|
|
gflag++;
|
|
break;
|
|
case 'u':
|
|
uflag++;
|
|
break;
|
|
case 'v':
|
|
vflag++;
|
|
break;
|
|
default:
|
|
usage();
|
|
}
|
|
}
|
|
argc -= optind;
|
|
argv += optind;
|
|
if (argc == 0 && !aflag)
|
|
usage();
|
|
if (!gflag && !uflag) {
|
|
if (aflag)
|
|
gflag++;
|
|
uflag++;
|
|
}
|
|
if (gflag) {
|
|
setgrent();
|
|
while ((gr = getgrent()) != 0)
|
|
(void) addid((u_long)gr->gr_gid, GRPQUOTA, gr->gr_name);
|
|
endgrent();
|
|
}
|
|
if (uflag) {
|
|
setpwent();
|
|
while ((pw = getpwent()) != 0)
|
|
(void) addid((u_long)pw->pw_uid, USRQUOTA, pw->pw_name);
|
|
endpwent();
|
|
}
|
|
setfsent();
|
|
while ((fs = getfsent()) != NULL) {
|
|
if (strcmp(fs->fs_vfstype, "ffs"))
|
|
continue;
|
|
if (aflag) {
|
|
if (gflag && hasquota(fs, GRPQUOTA, &qfnp))
|
|
errs += repquota(fs, GRPQUOTA, qfnp);
|
|
if (uflag && hasquota(fs, USRQUOTA, &qfnp))
|
|
errs += repquota(fs, USRQUOTA, qfnp);
|
|
continue;
|
|
}
|
|
if ((argnum = oneof(fs->fs_file, argv, argc)) >= 0 ||
|
|
(argnum = oneof(fs->fs_spec, argv, argc)) >= 0) {
|
|
done |= 1 << argnum;
|
|
if (gflag && hasquota(fs, GRPQUOTA, &qfnp))
|
|
errs += repquota(fs, GRPQUOTA, qfnp);
|
|
if (uflag && hasquota(fs, USRQUOTA, &qfnp))
|
|
errs += repquota(fs, USRQUOTA, qfnp);
|
|
}
|
|
}
|
|
endfsent();
|
|
for (i = 0; i < argc; i++)
|
|
if ((done & (1 << i)) == 0)
|
|
fprintf(stderr, "%s not found in fstab\n", argv[i]);
|
|
exit(errs);
|
|
}
|
|
|
|
void
|
|
usage()
|
|
{
|
|
fprintf(stderr, "usage:\n\t%s\n\t%s\n",
|
|
"repquota [-v] [-g] [-u] -a",
|
|
"repquota [-v] [-g] [-u] filesys ...");
|
|
exit(1);
|
|
}
|
|
|
|
int
|
|
repquota(fs, type, qfpathname)
|
|
struct fstab *fs;
|
|
int type;
|
|
char *qfpathname;
|
|
{
|
|
struct fileusage *fup;
|
|
FILE *qf;
|
|
u_long id;
|
|
struct dqblk dqbuf;
|
|
static struct dqblk zerodqblk;
|
|
static int warned = 0;
|
|
static int multiple = 0;
|
|
|
|
if (quotactl(fs->fs_file, QCMD(Q_SYNC, type), 0, 0) < 0 &&
|
|
errno == EOPNOTSUPP && !warned && vflag) {
|
|
warned++;
|
|
fprintf(stdout,
|
|
"*** Warning: Quotas are not compiled into this kernel\n");
|
|
}
|
|
if (multiple++)
|
|
printf("\n");
|
|
if (vflag)
|
|
fprintf(stdout, "*** Report for %s quotas on %s (%s)\n",
|
|
qfextension[type], fs->fs_file, fs->fs_spec);
|
|
if ((qf = fopen(qfpathname, "r")) == NULL) {
|
|
perror(qfpathname);
|
|
return (1);
|
|
}
|
|
for (id = 0; ; id++) {
|
|
fread(&dqbuf, sizeof(struct dqblk), 1, qf);
|
|
if (feof(qf))
|
|
break;
|
|
if (dqbuf.dqb_curinodes == 0 && dqbuf.dqb_curblocks == 0)
|
|
continue;
|
|
if ((fup = lookup(id, type)) == 0)
|
|
fup = addid(id, type, (char *)0);
|
|
fup->fu_dqblk = dqbuf;
|
|
}
|
|
fclose(qf);
|
|
printf(" Block limits File limits\n");
|
|
printf(type == USRQUOTA ? "User " : "Group");
|
|
printf(" used soft hard grace used soft hard grace\n");
|
|
for (id = 0; id <= highid[type]; id++) {
|
|
fup = lookup(id, type);
|
|
if (fup == 0)
|
|
continue;
|
|
if (fup->fu_dqblk.dqb_curinodes == 0 &&
|
|
fup->fu_dqblk.dqb_curblocks == 0)
|
|
continue;
|
|
if (strlen(fup->fu_name) > 9)
|
|
printf("%s ", fup->fu_name);
|
|
else
|
|
printf("%-10s", fup->fu_name);
|
|
printf("%c%c%9d%9d%9d%7s",
|
|
fup->fu_dqblk.dqb_bsoftlimit &&
|
|
fup->fu_dqblk.dqb_curblocks >=
|
|
fup->fu_dqblk.dqb_bsoftlimit ? '+' : '-',
|
|
fup->fu_dqblk.dqb_isoftlimit &&
|
|
fup->fu_dqblk.dqb_curinodes >=
|
|
fup->fu_dqblk.dqb_isoftlimit ? '+' : '-',
|
|
(int)(dbtob((u_quad_t)fup->fu_dqblk.dqb_curblocks) / 1024),
|
|
(int)(dbtob((u_quad_t)fup->fu_dqblk.dqb_bsoftlimit) / 1024),
|
|
(int)(dbtob((u_quad_t)fup->fu_dqblk.dqb_bhardlimit) / 1024),
|
|
fup->fu_dqblk.dqb_bsoftlimit &&
|
|
fup->fu_dqblk.dqb_curblocks >=
|
|
fup->fu_dqblk.dqb_bsoftlimit ?
|
|
timeprt(fup->fu_dqblk.dqb_btime) : "");
|
|
printf(" %8d%8d%8d%7s\n",
|
|
fup->fu_dqblk.dqb_curinodes,
|
|
fup->fu_dqblk.dqb_isoftlimit,
|
|
fup->fu_dqblk.dqb_ihardlimit,
|
|
fup->fu_dqblk.dqb_isoftlimit &&
|
|
fup->fu_dqblk.dqb_curinodes >=
|
|
fup->fu_dqblk.dqb_isoftlimit ?
|
|
timeprt(fup->fu_dqblk.dqb_itime) : "");
|
|
fup->fu_dqblk = zerodqblk;
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
/*
|
|
* Check to see if target appears in list of size cnt.
|
|
*/
|
|
int
|
|
oneof(target, list, cnt)
|
|
const char *target;
|
|
char *list[];
|
|
int cnt;
|
|
{
|
|
int i;
|
|
|
|
for (i = 0; i < cnt; i++)
|
|
if (strcmp(target, list[i]) == 0)
|
|
return (i);
|
|
return (-1);
|
|
}
|
|
|
|
/*
|
|
* Check to see if a particular quota is to be enabled.
|
|
*/
|
|
int
|
|
hasquota(fs, type, qfnamep)
|
|
struct fstab *fs;
|
|
int type;
|
|
char **qfnamep;
|
|
{
|
|
char *opt;
|
|
char *cp = NULL;
|
|
static char initname, usrname[100], grpname[100];
|
|
static char buf[BUFSIZ];
|
|
|
|
if (!initname) {
|
|
sprintf(usrname, "%s%s", qfextension[USRQUOTA], qfname);
|
|
sprintf(grpname, "%s%s", qfextension[GRPQUOTA], qfname);
|
|
initname = 1;
|
|
}
|
|
strcpy(buf, fs->fs_mntops);
|
|
for (opt = strtok(buf, ","); opt; opt = strtok(NULL, ",")) {
|
|
if ((cp = strchr(opt, '=')) != NULL)
|
|
*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) sprintf(buf, "%s/%s.%s", fs->fs_file, qfname, qfextension[type]);
|
|
*qfnamep = buf;
|
|
return (1);
|
|
}
|
|
|
|
/*
|
|
* Routines to manage the file usage table.
|
|
*
|
|
* Lookup an id of a specific type.
|
|
*/
|
|
struct fileusage *
|
|
lookup(id, type)
|
|
u_long id;
|
|
int type;
|
|
{
|
|
struct fileusage *fup;
|
|
|
|
for (fup = fuhead[type][id & (FUHASH-1)]; fup != 0; fup = fup->fu_next)
|
|
if (fup->fu_id == id)
|
|
return (fup);
|
|
return ((struct fileusage *)0);
|
|
}
|
|
|
|
/*
|
|
* Add a new file usage id if it does not already exist.
|
|
*/
|
|
struct fileusage *
|
|
addid(id, type, name)
|
|
u_long id;
|
|
int type;
|
|
const char *name;
|
|
{
|
|
struct fileusage *fup, **fhp;
|
|
int len;
|
|
|
|
if ((fup = lookup(id, type)) != NULL)
|
|
return (fup);
|
|
if (name)
|
|
len = strlen(name);
|
|
else
|
|
len = 10;
|
|
if ((fup = (struct fileusage *)calloc(1, sizeof(*fup) + len)) == NULL) {
|
|
fprintf(stderr, "out of memory for fileusage structures\n");
|
|
exit(1);
|
|
}
|
|
fhp = &fuhead[type][id & (FUHASH - 1)];
|
|
fup->fu_next = *fhp;
|
|
*fhp = fup;
|
|
fup->fu_id = id;
|
|
if (id > highid[type])
|
|
highid[type] = id;
|
|
if (name) {
|
|
memmove(fup->fu_name, name, len + 1);
|
|
} else {
|
|
sprintf(fup->fu_name, "%lu", (u_long)id);
|
|
}
|
|
return (fup);
|
|
}
|
|
|
|
/*
|
|
* Calculate the grace period and return a printable string for it.
|
|
*/
|
|
const 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) {
|
|
sprintf(buf, "%lddays", (long)((hours + 12) / 24));
|
|
return (buf);
|
|
}
|
|
if (minutes >= 60) {
|
|
sprintf(buf, "%2ld:%ld", (long)(minutes / 60),
|
|
(long)(minutes % 60));
|
|
return (buf);
|
|
}
|
|
sprintf(buf, "%2ld", (long)minutes);
|
|
return (buf);
|
|
}
|