|
|
1.1 root 1: /*
2: * Copyright (c) 1982, 1986 Regents of the University of California.
3: * 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: * 3. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: *
1.1.1.2 ! root 36: * from: @(#)quota.h 7.9 (Berkeley) 2/22/91
! 37: * quota.h,v 1.3 1993/05/20 03:53:30 cgd Exp
1.1 root 38: */
39:
1.1.1.2 ! root 40: #ifndef _UFS_QUOTA_H_
! 41: #define _UFS_QUOTA_H_
1.1 root 42:
43: /*
44: * Definitions for disk quotas imposed on the average user
45: * (big brother finally hits UNIX).
46: *
47: * The following constants define the amount of time given a user
48: * before the soft limits are treated as hard limits (usually resulting
49: * in an allocation failure). The timer is started when the user crosses
50: * their soft limit, it is reset when they go below their soft limit.
51: */
52: #define MAX_IQ_TIME (7*24*60*60) /* 1 week */
53: #define MAX_DQ_TIME (7*24*60*60) /* 1 week */
54:
55: /*
56: * The following constants define the usage of the quota file array
57: * in the ufsmount structure and dquot array in the inode structure.
58: * The semantics of the elements of these arrays are defined in the
59: * routine getinoquota; the remainder of the quota code treats them
60: * generically and need not be inspected when changing the size of
61: * the array.
62: */
63: #define MAXQUOTAS 2
64: #define USRQUOTA 0 /* element used for user quotas */
65: #define GRPQUOTA 1 /* element used for group quotas */
66:
67: /*
68: * Definitions for the default names of the quotas files.
69: */
70: #define INITQFNAMES { \
71: "user", /* USRQUOTA */ \
72: "group", /* GRPQUOTA */ \
73: "undefined", \
74: };
75: #define QUOTAFILENAME "quota"
76: #define QUOTAGROUP "operator"
77:
78: /*
79: * Command definitions for the 'quotactl' system call.
80: * The commands are broken into a main command defined below
81: * and a subcommand that is used to convey the type of
82: * quota that is being manipulated (see above).
83: */
84: #define SUBCMDMASK 0x00ff
85: #define SUBCMDSHIFT 8
86: #define QCMD(cmd, type) (((cmd) << SUBCMDSHIFT) | ((type) & SUBCMDMASK))
87:
88: #define Q_QUOTAON 0x0100 /* enable quotas */
89: #define Q_QUOTAOFF 0x0200 /* disable quotas */
90: #define Q_GETQUOTA 0x0300 /* get limits and usage */
91: #define Q_SETQUOTA 0x0400 /* set limits and usage */
92: #define Q_SETUSE 0x0500 /* set usage */
93: #define Q_SYNC 0x0600 /* sync disk copy of a filesystems quotas */
94:
95: /*
96: * The following structure defines the format of the disk quota file
97: * (as it appears on disk) - the file is an array of these structures
98: * indexed by user or group number. The setquota system call establishes
99: * the vnode for each quota file (a pointer is retained in the ufsmount
100: * structure).
101: */
102: struct dqblk {
103: u_long dqb_bhardlimit; /* absolute limit on disk blks alloc */
104: u_long dqb_bsoftlimit; /* preferred limit on disk blks */
105: u_long dqb_curblocks; /* current block count */
106: u_long dqb_ihardlimit; /* maximum # allocated inodes + 1 */
107: u_long dqb_isoftlimit; /* preferred inode limit */
108: u_long dqb_curinodes; /* current # allocated inodes */
109: time_t dqb_btime; /* time limit for excessive disk use */
110: time_t dqb_itime; /* time limit for excessive files */
111: };
112:
113: #ifdef KERNEL
114: /*
115: * The following structure records disk usage for a user or group on a
116: * filesystem. There is one allocated for each quota that exists on any
117: * filesystem for the current user or group. A cache is kept of recently
118: * used entries.
119: */
120: struct dquot {
121: struct dquot *dq_forw, *dq_back;/* MUST be first entry */
122: struct dquot *dq_freef, **dq_freeb; /* free list */
123: short dq_flags; /* flags, see below */
124: short dq_cnt; /* count of active references */
125: short dq_spare; /* unused spare padding */
126: short dq_type; /* quota type of this dquot */
127: u_long dq_id; /* identifier this applies to */
128: struct ufsmount *dq_ump; /* filesystem that this is taken from */
129: struct dqblk dq_dqb; /* actual usage & quotas */
130: };
131: /*
132: * Flag values.
133: */
134: #define DQ_LOCK 0x01 /* this quota locked (no MODS) */
135: #define DQ_WANT 0x02 /* wakeup on unlock */
136: #define DQ_MOD 0x04 /* this quota modified since read */
137: #define DQ_FAKE 0x08 /* no limits here, just usage */
138: #define DQ_BLKS 0x10 /* has been warned about blk limit */
139: #define DQ_INODS 0x20 /* has been warned about inode limit */
140: /*
141: * Shorthand notation.
142: */
143: #define dq_bhardlimit dq_dqb.dqb_bhardlimit
144: #define dq_bsoftlimit dq_dqb.dqb_bsoftlimit
145: #define dq_curblocks dq_dqb.dqb_curblocks
146: #define dq_ihardlimit dq_dqb.dqb_ihardlimit
147: #define dq_isoftlimit dq_dqb.dqb_isoftlimit
148: #define dq_curinodes dq_dqb.dqb_curinodes
149: #define dq_btime dq_dqb.dqb_btime
150: #define dq_itime dq_dqb.dqb_itime
151:
152: /*
153: * If the system has never checked for a quota for this file,
154: * then it is set to NODQUOT. Once a write attempt is made
155: * the inode pointer is set to reference a dquot structure.
156: */
157: #define NODQUOT ((struct dquot *) 0)
158:
159: /*
160: * Flags to chkdq() and chkiq()
161: */
162: #define FORCE 0x01 /* force usage changes independent of limits */
163: #define CHOWN 0x02 /* (advisory) change initiated by chown */
164:
165: /*
166: * Macros to avoid subroutine calls to trivial functions.
167: */
168: #ifndef DIAGNOSTIC
169: #define DQREF(dq) (dq)->dq_cnt++
170: #else
171: #define DQREF(dq) dqref(dq)
172: #endif /* DIAGNOSTIC */
173:
174: #else
175:
176: #include <sys/cdefs.h>
177:
178: __BEGIN_DECLS
179: int quotactl __P((const char *, int, int, void *));
180: __END_DECLS
181:
182: #endif /* KERNEL */
1.1.1.2 ! root 183:
! 184: #endif /* !_UFS_QUOTA_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.