edquota.c revision 1.45 1 1.45 dholland /* $NetBSD: edquota.c,v 1.45 2012/01/30 19:18:36 dholland Exp $ */
2 1.1 cgd /*
3 1.5 mycroft * Copyright (c) 1980, 1990, 1993
4 1.5 mycroft * The Regents of the University of California. All rights reserved.
5 1.1 cgd *
6 1.1 cgd * This code is derived from software contributed to Berkeley by
7 1.1 cgd * Robert Elz at The University of Melbourne.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.24 agc * 3. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.15 lukem #include <sys/cdefs.h>
35 1.1 cgd #ifndef lint
36 1.29 lukem __COPYRIGHT("@(#) Copyright (c) 1980, 1990, 1993\
37 1.29 lukem The Regents of the University of California. All rights reserved.");
38 1.1 cgd #endif /* not lint */
39 1.1 cgd
40 1.1 cgd #ifndef lint
41 1.15 lukem #if 0
42 1.15 lukem static char sccsid[] = "from: @(#)edquota.c 8.3 (Berkeley) 4/27/95";
43 1.15 lukem #else
44 1.45 dholland __RCSID("$NetBSD: edquota.c,v 1.45 2012/01/30 19:18:36 dholland Exp $");
45 1.15 lukem #endif
46 1.1 cgd #endif /* not lint */
47 1.1 cgd
48 1.1 cgd /*
49 1.1 cgd * Disk quota editor.
50 1.1 cgd */
51 1.1 cgd #include <sys/param.h>
52 1.1 cgd #include <sys/stat.h>
53 1.1 cgd #include <sys/file.h>
54 1.1 cgd #include <sys/wait.h>
55 1.12 mikel #include <sys/queue.h>
56 1.30 bouyer #include <sys/types.h>
57 1.30 bouyer #include <sys/statvfs.h>
58 1.30 bouyer
59 1.40 dholland #include <quota.h>
60 1.32 bouyer #include <quota/quotaprop.h>
61 1.32 bouyer #include <quota/quota.h>
62 1.30 bouyer #include <ufs/ufs/quota1.h>
63 1.30 bouyer
64 1.30 bouyer #include <assert.h>
65 1.15 lukem #include <err.h>
66 1.1 cgd #include <errno.h>
67 1.1 cgd #include <fstab.h>
68 1.1 cgd #include <pwd.h>
69 1.1 cgd #include <grp.h>
70 1.1 cgd #include <ctype.h>
71 1.15 lukem #include <signal.h>
72 1.37 dholland #include <stdbool.h>
73 1.1 cgd #include <stdio.h>
74 1.9 cgd #include <stdlib.h>
75 1.1 cgd #include <string.h>
76 1.5 mycroft #include <unistd.h>
77 1.30 bouyer
78 1.31 christos #include "printquota.h"
79 1.31 christos #include "quotautil.h"
80 1.30 bouyer
81 1.1 cgd #include "pathnames.h"
82 1.1 cgd
83 1.45 dholland #if 0
84 1.31 christos static const char *quotagroup = QUOTAGROUP;
85 1.45 dholland #endif
86 1.1 cgd
87 1.37 dholland #define MAX_TMPSTR (100+MAXPATHLEN)
88 1.37 dholland
89 1.37 dholland /* flags for quotause */
90 1.37 dholland #define FOUND 0x01
91 1.44 dholland #define XGRACE 0x02 /* extended grace periods (per-id) */
92 1.37 dholland #define DEFAULT 0x04
93 1.37 dholland
94 1.1 cgd struct quotause {
95 1.1 cgd struct quotause *next;
96 1.1 cgd long flags;
97 1.39 dholland struct quotaval qv[QUOTA_NLIMITS];
98 1.1 cgd char fsname[MAXPATHLEN + 1];
99 1.44 dholland char implementation[32];
100 1.30 bouyer char *qfname;
101 1.15 lukem };
102 1.13 mikel
103 1.37 dholland struct quotalist {
104 1.37 dholland struct quotause *head;
105 1.37 dholland struct quotause *tail;
106 1.37 dholland };
107 1.23 jonb
108 1.33 dholland static void usage(void) __dead;
109 1.30 bouyer
110 1.31 christos static int Hflag = 0;
111 1.1 cgd
112 1.32 bouyer /* more compact form of constants */
113 1.32 bouyer #define QL_BLK QUOTA_LIMIT_BLOCK
114 1.32 bouyer #define QL_FL QUOTA_LIMIT_FILE
115 1.32 bouyer
116 1.34 dholland ////////////////////////////////////////////////////////////
117 1.34 dholland // support code
118 1.1 cgd
119 1.1 cgd /*
120 1.35 dholland * This routine converts a name for a particular quota class to
121 1.1 cgd * an identifier. This routine must agree with the kernel routine
122 1.35 dholland * getinoquota as to the interpretation of quota classes.
123 1.1 cgd */
124 1.31 christos static int
125 1.41 dholland getidbyname(const char *name, int idtype)
126 1.1 cgd {
127 1.1 cgd struct passwd *pw;
128 1.1 cgd struct group *gr;
129 1.1 cgd
130 1.1 cgd if (alldigits(name))
131 1.31 christos return atoi(name);
132 1.41 dholland switch (idtype) {
133 1.41 dholland case QUOTA_IDTYPE_USER:
134 1.15 lukem if ((pw = getpwnam(name)) != NULL)
135 1.31 christos return pw->pw_uid;
136 1.15 lukem warnx("%s: no such user", name);
137 1.1 cgd break;
138 1.41 dholland case QUOTA_IDTYPE_GROUP:
139 1.15 lukem if ((gr = getgrnam(name)) != NULL)
140 1.31 christos return gr->gr_gid;
141 1.15 lukem warnx("%s: no such group", name);
142 1.1 cgd break;
143 1.1 cgd default:
144 1.41 dholland warnx("%d: unknown quota type", idtype);
145 1.1 cgd break;
146 1.1 cgd }
147 1.1 cgd sleep(1);
148 1.31 christos return -1;
149 1.1 cgd }
150 1.1 cgd
151 1.34 dholland ////////////////////////////////////////////////////////////
152 1.34 dholland // quotause operations
153 1.34 dholland
154 1.34 dholland /*
155 1.37 dholland * Create an empty quotause structure.
156 1.37 dholland */
157 1.37 dholland static struct quotause *
158 1.37 dholland quotause_create(void)
159 1.37 dholland {
160 1.37 dholland struct quotause *qup;
161 1.37 dholland
162 1.37 dholland qup = malloc(sizeof(*qup));
163 1.37 dholland if (qup == NULL) {
164 1.37 dholland err(1, "malloc");
165 1.37 dholland }
166 1.37 dholland
167 1.37 dholland qup->next = NULL;
168 1.37 dholland qup->flags = 0;
169 1.39 dholland memset(qup->qv, 0, sizeof(qup->qv));
170 1.37 dholland qup->fsname[0] = '\0';
171 1.37 dholland qup->qfname = NULL;
172 1.37 dholland
173 1.37 dholland return qup;
174 1.37 dholland }
175 1.37 dholland
176 1.37 dholland /*
177 1.34 dholland * Free a quotause structure.
178 1.34 dholland */
179 1.34 dholland static void
180 1.35 dholland quotause_destroy(struct quotause *qup)
181 1.34 dholland {
182 1.34 dholland free(qup->qfname);
183 1.34 dholland free(qup);
184 1.34 dholland }
185 1.34 dholland
186 1.37 dholland ////////////////////////////////////////////////////////////
187 1.37 dholland // quotalist operations
188 1.37 dholland
189 1.37 dholland /*
190 1.37 dholland * Create a quotause list.
191 1.37 dholland */
192 1.37 dholland static struct quotalist *
193 1.37 dholland quotalist_create(void)
194 1.37 dholland {
195 1.37 dholland struct quotalist *qlist;
196 1.37 dholland
197 1.37 dholland qlist = malloc(sizeof(*qlist));
198 1.37 dholland if (qlist == NULL) {
199 1.37 dholland err(1, "malloc");
200 1.37 dholland }
201 1.37 dholland
202 1.37 dholland qlist->head = NULL;
203 1.37 dholland qlist->tail = NULL;
204 1.37 dholland
205 1.37 dholland return qlist;
206 1.37 dholland }
207 1.37 dholland
208 1.1 cgd /*
209 1.34 dholland * Free a list of quotause structures.
210 1.1 cgd */
211 1.34 dholland static void
212 1.37 dholland quotalist_destroy(struct quotalist *qlist)
213 1.1 cgd {
214 1.34 dholland struct quotause *qup, *nextqup;
215 1.34 dholland
216 1.37 dholland for (qup = qlist->head; qup; qup = nextqup) {
217 1.34 dholland nextqup = qup->next;
218 1.35 dholland quotause_destroy(qup);
219 1.34 dholland }
220 1.37 dholland free(qlist);
221 1.37 dholland }
222 1.37 dholland
223 1.45 dholland #if 0
224 1.37 dholland static bool
225 1.37 dholland quotalist_empty(struct quotalist *qlist)
226 1.37 dholland {
227 1.37 dholland return qlist->head == NULL;
228 1.37 dholland }
229 1.45 dholland #endif
230 1.37 dholland
231 1.37 dholland static void
232 1.37 dholland quotalist_append(struct quotalist *qlist, struct quotause *qup)
233 1.37 dholland {
234 1.37 dholland /* should not already be on a list */
235 1.37 dholland assert(qup->next == NULL);
236 1.37 dholland
237 1.37 dholland if (qlist->head == NULL) {
238 1.37 dholland qlist->head = qup;
239 1.37 dholland } else {
240 1.37 dholland qlist->tail->next = qup;
241 1.37 dholland }
242 1.37 dholland qlist->tail = qup;
243 1.34 dholland }
244 1.30 bouyer
245 1.34 dholland ////////////////////////////////////////////////////////////
246 1.34 dholland // ffs quota v1
247 1.1 cgd
248 1.45 dholland #if 0
249 1.34 dholland static void
250 1.41 dholland putprivs1(uint32_t id, int idtype, struct quotause *qup)
251 1.34 dholland {
252 1.34 dholland struct dqblk dqblk;
253 1.34 dholland int fd;
254 1.1 cgd
255 1.42 dholland quotavals_to_dqblk(&qup->qv[QUOTA_LIMIT_BLOCK],
256 1.42 dholland &qup->qv[QUOTA_LIMIT_FILE],
257 1.42 dholland &dqblk);
258 1.34 dholland assert((qup->flags & DEFAULT) == 0);
259 1.30 bouyer
260 1.34 dholland if ((fd = open(qup->qfname, O_WRONLY)) < 0) {
261 1.34 dholland warnx("open `%s'", qup->qfname);
262 1.34 dholland } else {
263 1.34 dholland (void)lseek(fd,
264 1.34 dholland (off_t)(id * (long)sizeof (struct dqblk)),
265 1.34 dholland SEEK_SET);
266 1.34 dholland if (write(fd, &dqblk, sizeof (struct dqblk)) !=
267 1.34 dholland sizeof (struct dqblk))
268 1.34 dholland warnx("writing `%s'", qup->qfname);
269 1.34 dholland close(fd);
270 1.30 bouyer }
271 1.30 bouyer }
272 1.30 bouyer
273 1.31 christos static struct quotause *
274 1.41 dholland getprivs1(long id, int idtype, const char *filesys)
275 1.30 bouyer {
276 1.30 bouyer struct fstab *fs;
277 1.31 christos char qfpathname[MAXPATHLEN];
278 1.30 bouyer struct quotause *qup;
279 1.30 bouyer struct dqblk dqblk;
280 1.30 bouyer int fd;
281 1.30 bouyer
282 1.30 bouyer setfsent();
283 1.30 bouyer while ((fs = getfsent()) != NULL) {
284 1.30 bouyer if (strcmp(fs->fs_vfstype, "ffs"))
285 1.30 bouyer continue;
286 1.30 bouyer if (strcmp(fs->fs_spec, filesys) == 0 ||
287 1.30 bouyer strcmp(fs->fs_file, filesys) == 0)
288 1.30 bouyer break;
289 1.30 bouyer }
290 1.30 bouyer if (fs == NULL)
291 1.30 bouyer return NULL;
292 1.30 bouyer
293 1.32 bouyer if (!hasquota(qfpathname, sizeof(qfpathname), fs,
294 1.43 dholland quota_idtype_to_ufs(idtype)))
295 1.30 bouyer return NULL;
296 1.37 dholland
297 1.37 dholland qup = quotause_create();
298 1.30 bouyer strcpy(qup->fsname, fs->fs_file);
299 1.30 bouyer if ((fd = open(qfpathname, O_RDONLY)) < 0) {
300 1.30 bouyer fd = open(qfpathname, O_RDWR|O_CREAT, 0640);
301 1.30 bouyer if (fd < 0 && errno != ENOENT) {
302 1.30 bouyer warnx("open `%s'", qfpathname);
303 1.35 dholland quotause_destroy(qup);
304 1.30 bouyer return NULL;
305 1.30 bouyer }
306 1.30 bouyer warnx("Creating quota file %s", qfpathname);
307 1.30 bouyer sleep(3);
308 1.32 bouyer (void)fchown(fd, getuid(),
309 1.35 dholland getidbyname(quotagroup, QUOTA_CLASS_GROUP));
310 1.31 christos (void)fchmod(fd, 0640);
311 1.30 bouyer }
312 1.30 bouyer (void)lseek(fd, (off_t)(id * sizeof(struct dqblk)),
313 1.30 bouyer SEEK_SET);
314 1.30 bouyer switch (read(fd, &dqblk, sizeof(struct dqblk))) {
315 1.30 bouyer case 0: /* EOF */
316 1.30 bouyer /*
317 1.30 bouyer * Convert implicit 0 quota (EOF)
318 1.30 bouyer * into an explicit one (zero'ed dqblk)
319 1.30 bouyer */
320 1.31 christos memset(&dqblk, 0, sizeof(struct dqblk));
321 1.30 bouyer break;
322 1.30 bouyer
323 1.30 bouyer case sizeof(struct dqblk): /* OK */
324 1.30 bouyer break;
325 1.30 bouyer
326 1.30 bouyer default: /* ERROR */
327 1.30 bouyer warn("read error in `%s'", qfpathname);
328 1.30 bouyer close(fd);
329 1.35 dholland quotause_destroy(qup);
330 1.30 bouyer return NULL;
331 1.30 bouyer }
332 1.30 bouyer close(fd);
333 1.30 bouyer qup->qfname = qfpathname;
334 1.1 cgd endfsent();
335 1.42 dholland dqblk_to_quotavals(&dqblk,
336 1.42 dholland &qup->qv[QUOTA_LIMIT_BLOCK],
337 1.42 dholland &qup->qv[QUOTA_LIMIT_FILE]);
338 1.31 christos return qup;
339 1.1 cgd }
340 1.45 dholland #endif
341 1.1 cgd
342 1.34 dholland ////////////////////////////////////////////////////////////
343 1.34 dholland // ffs quota v2
344 1.34 dholland
345 1.44 dholland static int
346 1.44 dholland dogetprivs2(struct quotahandle *qh, int idtype, id_t id, int defaultq,
347 1.44 dholland int objtype, struct quotause *qup)
348 1.44 dholland {
349 1.44 dholland struct quotakey qk;
350 1.44 dholland
351 1.44 dholland qk.qk_idtype = idtype;
352 1.44 dholland qk.qk_id = defaultq ? QUOTA_DEFAULTID : id;
353 1.44 dholland qk.qk_objtype = objtype;
354 1.44 dholland if (quota_get(qh, &qk, &qup->qv[objtype])) {
355 1.44 dholland /* no entry, get default entry */
356 1.44 dholland qk.qk_id = QUOTA_DEFAULTID;
357 1.44 dholland if (quota_get(qh, &qk, &qup->qv[objtype])) {
358 1.44 dholland return -1;
359 1.44 dholland }
360 1.44 dholland }
361 1.44 dholland return 0;
362 1.44 dholland }
363 1.44 dholland
364 1.34 dholland static struct quotause *
365 1.41 dholland getprivs2(long id, int idtype, const char *filesys, int defaultq)
366 1.1 cgd {
367 1.15 lukem struct quotause *qup;
368 1.44 dholland struct quotahandle *qh;
369 1.44 dholland const char *impl;
370 1.44 dholland unsigned restrictions;
371 1.1 cgd
372 1.37 dholland qup = quotause_create();
373 1.34 dholland strcpy(qup->fsname, filesys);
374 1.34 dholland if (defaultq)
375 1.34 dholland qup->flags |= DEFAULT;
376 1.44 dholland
377 1.44 dholland qh = quota_open(filesys);
378 1.44 dholland if (qh == NULL) {
379 1.44 dholland quotause_destroy(qup);
380 1.44 dholland return NULL;
381 1.44 dholland }
382 1.44 dholland
383 1.44 dholland impl = quota_getimplname(qh);
384 1.44 dholland if (impl == NULL) {
385 1.44 dholland impl = "???";
386 1.44 dholland }
387 1.44 dholland strlcpy(qup->implementation, impl, sizeof(qup->implementation));
388 1.44 dholland
389 1.44 dholland restrictions = quota_getrestrictions(qh);
390 1.44 dholland if ((restrictions & QUOTA_RESTRICT_UNIFORMGRACE) == 0) {
391 1.44 dholland qup->flags |= XGRACE;
392 1.44 dholland }
393 1.44 dholland
394 1.44 dholland if (dogetprivs2(qh, idtype, id, defaultq, QUOTA_OBJTYPE_BLOCKS, qup)) {
395 1.44 dholland quota_close(qh);
396 1.44 dholland quotause_destroy(qup);
397 1.44 dholland return NULL;
398 1.44 dholland }
399 1.44 dholland
400 1.44 dholland if (dogetprivs2(qh, idtype, id, defaultq, QUOTA_OBJTYPE_FILES, qup)) {
401 1.44 dholland quota_close(qh);
402 1.44 dholland quotause_destroy(qup);
403 1.44 dholland return NULL;
404 1.30 bouyer }
405 1.44 dholland
406 1.44 dholland quota_close(qh);
407 1.44 dholland
408 1.34 dholland return qup;
409 1.30 bouyer }
410 1.30 bouyer
411 1.31 christos static void
412 1.41 dholland putprivs2(uint32_t id, int idtype, struct quotause *qup)
413 1.30 bouyer {
414 1.40 dholland struct quotahandle *qh;
415 1.40 dholland struct quotakey qk;
416 1.40 dholland char idname[32];
417 1.40 dholland
418 1.40 dholland if (qup->flags & DEFAULT) {
419 1.40 dholland snprintf(idname, sizeof(idname), "%s default",
420 1.41 dholland idtype == QUOTA_IDTYPE_USER ? "user" : "group");
421 1.40 dholland id = QUOTA_DEFAULTID;
422 1.40 dholland } else {
423 1.40 dholland snprintf(idname, sizeof(idname), "%s %u",
424 1.41 dholland idtype == QUOTA_IDTYPE_USER ? "uid" : "gid", id);
425 1.40 dholland }
426 1.40 dholland
427 1.40 dholland qh = quota_open(qup->fsname);
428 1.40 dholland if (qh == NULL) {
429 1.40 dholland err(1, "%s: quota_open", qup->fsname);
430 1.40 dholland }
431 1.40 dholland
432 1.41 dholland qk.qk_idtype = idtype;
433 1.40 dholland qk.qk_id = id;
434 1.40 dholland qk.qk_objtype = QUOTA_OBJTYPE_BLOCKS;
435 1.40 dholland if (quota_put(qh, &qk, &qup->qv[QL_BLK])) {
436 1.40 dholland err(1, "%s: quota_put (%s blocks)", qup->fsname, idname);
437 1.40 dholland }
438 1.30 bouyer
439 1.41 dholland qk.qk_idtype = idtype;
440 1.40 dholland qk.qk_id = id;
441 1.40 dholland qk.qk_objtype = QUOTA_OBJTYPE_FILES;
442 1.40 dholland if (quota_put(qh, &qk, &qup->qv[QL_FL])) {
443 1.40 dholland err(1, "%s: quota_put (%s files)", qup->fsname, idname);
444 1.30 bouyer }
445 1.40 dholland
446 1.40 dholland quota_close(qh);
447 1.30 bouyer }
448 1.30 bouyer
449 1.34 dholland ////////////////////////////////////////////////////////////
450 1.34 dholland // quota format switch
451 1.34 dholland
452 1.34 dholland /*
453 1.34 dholland * Collect the requested quota information.
454 1.34 dholland */
455 1.37 dholland static struct quotalist *
456 1.41 dholland getprivs(long id, int defaultq, int idtype, const char *filesys)
457 1.30 bouyer {
458 1.34 dholland struct statvfs *fst;
459 1.34 dholland int nfst, i;
460 1.37 dholland struct quotalist *qlist;
461 1.37 dholland struct quotause *qup;
462 1.37 dholland
463 1.37 dholland qlist = quotalist_create();
464 1.34 dholland
465 1.34 dholland nfst = getmntinfo(&fst, MNT_WAIT);
466 1.34 dholland if (nfst == 0)
467 1.34 dholland errx(1, "no filesystems mounted!");
468 1.30 bouyer
469 1.34 dholland for (i = 0; i < nfst; i++) {
470 1.34 dholland if ((fst[i].f_flag & ST_QUOTA) == 0)
471 1.34 dholland continue;
472 1.37 dholland if (filesys &&
473 1.37 dholland strcmp(fst[i].f_mntonname, filesys) != 0 &&
474 1.34 dholland strcmp(fst[i].f_mntfromname, filesys) != 0)
475 1.34 dholland continue;
476 1.41 dholland qup = getprivs2(id, idtype, fst[i].f_mntonname, defaultq);
477 1.37 dholland if (qup == NULL) {
478 1.37 dholland /*
479 1.37 dholland * XXX: returning NULL is totally wrong. On
480 1.37 dholland * serious error, abort; on minor error, warn
481 1.37 dholland * and continue.
482 1.37 dholland *
483 1.37 dholland * Note: we cannot warn unconditionally here
484 1.37 dholland * because this case apparently includes "no
485 1.37 dholland * quota entry on this volume" and that causes
486 1.37 dholland * the atf tests to fail. Bletch.
487 1.37 dholland */
488 1.37 dholland /*return NULL;*/
489 1.37 dholland /*warnx("getprivs2 failed");*/
490 1.37 dholland continue;
491 1.37 dholland }
492 1.37 dholland
493 1.37 dholland quotalist_append(qlist, qup);
494 1.34 dholland }
495 1.30 bouyer
496 1.45 dholland #if 0
497 1.37 dholland if (filesys && quotalist_empty(qlist)) {
498 1.34 dholland if (defaultq)
499 1.34 dholland errx(1, "no default quota for version 1");
500 1.34 dholland /* if we get there, filesys is not mounted. try the old way */
501 1.41 dholland qup = getprivs1(id, idtype, filesys);
502 1.37 dholland if (qup == NULL) {
503 1.37 dholland /* XXX. see above */
504 1.37 dholland /*return NULL;*/
505 1.37 dholland /*warnx("getprivs1 failed");*/
506 1.37 dholland return qlist;
507 1.37 dholland }
508 1.37 dholland quotalist_append(qlist, qup);
509 1.1 cgd }
510 1.45 dholland #endif
511 1.37 dholland return qlist;
512 1.1 cgd }
513 1.1 cgd
514 1.1 cgd /*
515 1.34 dholland * Store the requested quota information.
516 1.1 cgd */
517 1.37 dholland static void
518 1.41 dholland putprivs(uint32_t id, int idtype, struct quotalist *qlist)
519 1.1 cgd {
520 1.34 dholland struct quotause *qup;
521 1.1 cgd
522 1.37 dholland for (qup = qlist->head; qup; qup = qup->next) {
523 1.34 dholland if (qup->qfname == NULL)
524 1.41 dholland putprivs2(id, idtype, qup);
525 1.45 dholland #if 0
526 1.34 dholland else
527 1.41 dholland putprivs1(id, idtype, qup);
528 1.45 dholland #endif
529 1.1 cgd }
530 1.1 cgd }
531 1.1 cgd
532 1.34 dholland static void
533 1.41 dholland clearpriv(int argc, char **argv, const char *filesys, int idtype)
534 1.1 cgd {
535 1.34 dholland struct statvfs *fst;
536 1.34 dholland int nfst, i;
537 1.34 dholland int id;
538 1.40 dholland id_t *ids;
539 1.40 dholland unsigned nids, maxids, j;
540 1.40 dholland struct quotahandle *qh;
541 1.40 dholland struct quotakey qk;
542 1.40 dholland char idname[32];
543 1.40 dholland
544 1.40 dholland maxids = 4;
545 1.40 dholland nids = 0;
546 1.40 dholland ids = malloc(maxids * sizeof(ids[0]));
547 1.40 dholland if (ids == NULL) {
548 1.40 dholland err(1, "malloc");
549 1.34 dholland }
550 1.34 dholland
551 1.34 dholland for ( ; argc > 0; argc--, argv++) {
552 1.41 dholland if ((id = getidbyname(*argv, idtype)) == -1)
553 1.34 dholland continue;
554 1.34 dholland
555 1.40 dholland if (nids + 1 > maxids) {
556 1.40 dholland maxids *= 2;
557 1.40 dholland ids = realloc(ids, maxids * sizeof(ids[0]));
558 1.40 dholland if (ids == NULL) {
559 1.40 dholland err(1, "realloc");
560 1.40 dholland }
561 1.40 dholland }
562 1.40 dholland ids[nids++] = id;
563 1.40 dholland }
564 1.34 dholland
565 1.34 dholland /* now loop over quota-enabled filesystems */
566 1.34 dholland nfst = getmntinfo(&fst, MNT_WAIT);
567 1.34 dholland if (nfst == 0)
568 1.34 dholland errx(1, "no filesystems mounted!");
569 1.34 dholland
570 1.34 dholland for (i = 0; i < nfst; i++) {
571 1.34 dholland if ((fst[i].f_flag & ST_QUOTA) == 0)
572 1.34 dholland continue;
573 1.34 dholland if (filesys && strcmp(fst[i].f_mntonname, filesys) != 0 &&
574 1.34 dholland strcmp(fst[i].f_mntfromname, filesys) != 0)
575 1.34 dholland continue;
576 1.34 dholland
577 1.40 dholland qh = quota_open(fst[i].f_mntonname);
578 1.40 dholland if (qh == NULL) {
579 1.40 dholland err(1, "%s: quota_open", fst[i].f_mntonname);
580 1.40 dholland }
581 1.40 dholland
582 1.40 dholland for (j = 0; j < nids; j++) {
583 1.40 dholland snprintf(idname, sizeof(idname), "%s %u",
584 1.41 dholland idtype == QUOTA_IDTYPE_USER ?
585 1.40 dholland "uid" : "gid", ids[j]);
586 1.40 dholland
587 1.41 dholland qk.qk_idtype = idtype;
588 1.40 dholland qk.qk_id = ids[j];
589 1.40 dholland qk.qk_objtype = QUOTA_OBJTYPE_BLOCKS;
590 1.40 dholland if (quota_delete(qh, &qk)) {
591 1.40 dholland err(1, "%s: quota_delete (%s blocks)",
592 1.40 dholland fst[i].f_mntonname, idname);
593 1.40 dholland }
594 1.34 dholland
595 1.41 dholland qk.qk_idtype = idtype;
596 1.40 dholland qk.qk_id = ids[j];
597 1.40 dholland qk.qk_objtype = QUOTA_OBJTYPE_FILES;
598 1.40 dholland if (quota_delete(qh, &qk)) {
599 1.40 dholland if (errno == ENOENT) {
600 1.40 dholland /*
601 1.40 dholland * XXX ignore this case; due
602 1.40 dholland * to a weakness in the quota
603 1.40 dholland * proplib interface it can
604 1.40 dholland * appear spuriously.
605 1.40 dholland */
606 1.40 dholland } else {
607 1.40 dholland err(1, "%s: quota_delete (%s files)",
608 1.40 dholland fst[i].f_mntonname, idname);
609 1.40 dholland }
610 1.40 dholland }
611 1.34 dholland }
612 1.34 dholland
613 1.40 dholland quota_close(qh);
614 1.40 dholland }
615 1.34 dholland
616 1.40 dholland free(ids);
617 1.34 dholland }
618 1.34 dholland
619 1.34 dholland ////////////////////////////////////////////////////////////
620 1.34 dholland // editor
621 1.34 dholland
622 1.34 dholland /*
623 1.34 dholland * Take a list of privileges and get it edited.
624 1.34 dholland */
625 1.34 dholland static int
626 1.34 dholland editit(const char *ltmpfile)
627 1.34 dholland {
628 1.34 dholland pid_t pid;
629 1.34 dholland int lst;
630 1.34 dholland char p[MAX_TMPSTR];
631 1.34 dholland const char *ed;
632 1.34 dholland sigset_t s, os;
633 1.34 dholland
634 1.34 dholland sigemptyset(&s);
635 1.34 dholland sigaddset(&s, SIGINT);
636 1.34 dholland sigaddset(&s, SIGQUIT);
637 1.34 dholland sigaddset(&s, SIGHUP);
638 1.34 dholland if (sigprocmask(SIG_BLOCK, &s, &os) == -1)
639 1.34 dholland err(1, "sigprocmask");
640 1.34 dholland top:
641 1.34 dholland switch ((pid = fork())) {
642 1.34 dholland case -1:
643 1.34 dholland if (errno == EPROCLIM) {
644 1.34 dholland warnx("You have too many processes");
645 1.34 dholland return 0;
646 1.34 dholland }
647 1.34 dholland if (errno == EAGAIN) {
648 1.34 dholland sleep(1);
649 1.34 dholland goto top;
650 1.34 dholland }
651 1.34 dholland warn("fork");
652 1.34 dholland return 0;
653 1.34 dholland case 0:
654 1.34 dholland if (sigprocmask(SIG_SETMASK, &os, NULL) == -1)
655 1.34 dholland err(1, "sigprocmask");
656 1.34 dholland setgid(getgid());
657 1.34 dholland setuid(getuid());
658 1.34 dholland if ((ed = getenv("EDITOR")) == (char *)0)
659 1.34 dholland ed = _PATH_VI;
660 1.34 dholland if (strlen(ed) + strlen(ltmpfile) + 2 >= MAX_TMPSTR) {
661 1.34 dholland errx(1, "%s", "editor or filename too long");
662 1.34 dholland }
663 1.34 dholland snprintf(p, sizeof(p), "%s %s", ed, ltmpfile);
664 1.34 dholland execlp(_PATH_BSHELL, _PATH_BSHELL, "-c", p, NULL);
665 1.34 dholland err(1, "%s", ed);
666 1.34 dholland default:
667 1.34 dholland if (waitpid(pid, &lst, 0) == -1)
668 1.34 dholland err(1, "waitpid");
669 1.34 dholland if (sigprocmask(SIG_SETMASK, &os, NULL) == -1)
670 1.34 dholland err(1, "sigprocmask");
671 1.34 dholland if (!WIFEXITED(lst) || WEXITSTATUS(lst) != 0)
672 1.34 dholland return 0;
673 1.34 dholland return 1;
674 1.34 dholland }
675 1.34 dholland }
676 1.34 dholland
677 1.34 dholland /*
678 1.34 dholland * Convert a quotause list to an ASCII file.
679 1.34 dholland */
680 1.34 dholland static int
681 1.37 dholland writeprivs(struct quotalist *qlist, int outfd, const char *name,
682 1.41 dholland int idtype)
683 1.34 dholland {
684 1.34 dholland struct quotause *qup;
685 1.34 dholland FILE *fd;
686 1.34 dholland char b0[32], b1[32], b2[32], b3[32];
687 1.34 dholland
688 1.34 dholland (void)ftruncate(outfd, 0);
689 1.34 dholland (void)lseek(outfd, (off_t)0, SEEK_SET);
690 1.34 dholland if ((fd = fdopen(dup(outfd), "w")) == NULL)
691 1.38 dholland errx(1, "fdopen");
692 1.38 dholland if (name == NULL) {
693 1.34 dholland fprintf(fd, "Default %s quotas:\n",
694 1.41 dholland ufs_quota_class_names[idtype]);
695 1.34 dholland } else {
696 1.34 dholland fprintf(fd, "Quotas for %s %s:\n",
697 1.41 dholland ufs_quota_class_names[idtype], name);
698 1.30 bouyer }
699 1.37 dholland for (qup = qlist->head; qup; qup = qup->next) {
700 1.39 dholland struct quotaval *q = qup->qv;
701 1.44 dholland fprintf(fd, "%s (%s):\n",
702 1.44 dholland qup->fsname, qup->implementation);
703 1.44 dholland if ((qup->flags & DEFAULT) == 0 || (qup->flags & XGRACE) != 0) {
704 1.30 bouyer fprintf(fd, "\tblocks in use: %s, "
705 1.30 bouyer "limits (soft = %s, hard = %s",
706 1.39 dholland intprt(b1, 21, q[QL_BLK].qv_usage,
707 1.31 christos HN_NOSPACE | HN_B, Hflag),
708 1.39 dholland intprt(b2, 21, q[QL_BLK].qv_softlimit,
709 1.31 christos HN_NOSPACE | HN_B, Hflag),
710 1.39 dholland intprt(b3, 21, q[QL_BLK].qv_hardlimit,
711 1.31 christos HN_NOSPACE | HN_B, Hflag));
712 1.44 dholland if (qup->flags & XGRACE)
713 1.30 bouyer fprintf(fd, ", ");
714 1.30 bouyer } else
715 1.30 bouyer fprintf(fd, "\tblocks: (");
716 1.30 bouyer
717 1.44 dholland if (qup->flags & (XGRACE|DEFAULT)) {
718 1.30 bouyer fprintf(fd, "grace = %s",
719 1.39 dholland timepprt(b0, 21, q[QL_BLK].qv_grace, Hflag));
720 1.30 bouyer }
721 1.30 bouyer fprintf(fd, ")\n");
722 1.44 dholland if ((qup->flags & DEFAULT) == 0 || (qup->flags & XGRACE) != 0) {
723 1.30 bouyer fprintf(fd, "\tinodes in use: %s, "
724 1.30 bouyer "limits (soft = %s, hard = %s",
725 1.39 dholland intprt(b1, 21, q[QL_FL].qv_usage,
726 1.31 christos HN_NOSPACE, Hflag),
727 1.39 dholland intprt(b2, 21, q[QL_FL].qv_softlimit,
728 1.31 christos HN_NOSPACE, Hflag),
729 1.39 dholland intprt(b3, 21, q[QL_FL].qv_hardlimit,
730 1.31 christos HN_NOSPACE, Hflag));
731 1.44 dholland if (qup->flags & XGRACE)
732 1.30 bouyer fprintf(fd, ", ");
733 1.30 bouyer } else
734 1.30 bouyer fprintf(fd, "\tinodes: (");
735 1.30 bouyer
736 1.44 dholland if (qup->flags & (XGRACE|DEFAULT)) {
737 1.30 bouyer fprintf(fd, "grace = %s",
738 1.39 dholland timepprt(b0, 21, q[QL_FL].qv_grace, Hflag));
739 1.30 bouyer }
740 1.30 bouyer fprintf(fd, ")\n");
741 1.1 cgd }
742 1.1 cgd fclose(fd);
743 1.31 christos return 1;
744 1.1 cgd }
745 1.1 cgd
746 1.1 cgd /*
747 1.1 cgd * Merge changes to an ASCII file into a quotause list.
748 1.1 cgd */
749 1.31 christos static int
750 1.38 dholland readprivs(struct quotalist *qlist, int infd, int dflag)
751 1.1 cgd {
752 1.15 lukem struct quotause *qup;
753 1.1 cgd FILE *fd;
754 1.1 cgd int cnt;
755 1.30 bouyer char fsp[BUFSIZ];
756 1.30 bouyer static char line0[BUFSIZ], line1[BUFSIZ], line2[BUFSIZ];
757 1.30 bouyer static char scurb[BUFSIZ], scuri[BUFSIZ], ssoft[BUFSIZ], shard[BUFSIZ];
758 1.30 bouyer static char stime[BUFSIZ];
759 1.30 bouyer uint64_t softb, hardb, softi, hardi;
760 1.30 bouyer time_t graceb = -1, gracei = -1;
761 1.30 bouyer int version;
762 1.1 cgd
763 1.14 kleink (void)lseek(infd, (off_t)0, SEEK_SET);
764 1.1 cgd fd = fdopen(dup(infd), "r");
765 1.1 cgd if (fd == NULL) {
766 1.15 lukem warn("Can't re-read temp file");
767 1.31 christos return 0;
768 1.1 cgd }
769 1.1 cgd /*
770 1.1 cgd * Discard title line, then read pairs of lines to process.
771 1.1 cgd */
772 1.1 cgd (void) fgets(line1, sizeof (line1), fd);
773 1.30 bouyer while (fgets(line0, sizeof (line0), fd) != NULL &&
774 1.30 bouyer fgets(line1, sizeof (line2), fd) != NULL &&
775 1.1 cgd fgets(line2, sizeof (line2), fd) != NULL) {
776 1.30 bouyer if (sscanf(line0, "%s (version %d):\n", fsp, &version) != 2) {
777 1.30 bouyer warnx("%s: bad format", line0);
778 1.26 christos goto out;
779 1.1 cgd }
780 1.30 bouyer #define last_char(str) ((str)[strlen(str) - 1])
781 1.30 bouyer if (last_char(line1) != '\n') {
782 1.30 bouyer warnx("%s:%s: bad format", fsp, line1);
783 1.26 christos goto out;
784 1.1 cgd }
785 1.30 bouyer last_char(line1) = '\0';
786 1.30 bouyer if (last_char(line2) != '\n') {
787 1.30 bouyer warnx("%s:%s: bad format", fsp, line2);
788 1.26 christos goto out;
789 1.1 cgd }
790 1.30 bouyer last_char(line2) = '\0';
791 1.30 bouyer if (dflag && version == 1) {
792 1.30 bouyer if (sscanf(line1,
793 1.30 bouyer "\tblocks: (grace = %s\n", stime) != 1) {
794 1.30 bouyer warnx("%s:%s: bad format", fsp, line1);
795 1.30 bouyer goto out;
796 1.30 bouyer }
797 1.30 bouyer if (last_char(stime) != ')') {
798 1.30 bouyer warnx("%s:%s: bad format", fsp, line1);
799 1.30 bouyer goto out;
800 1.30 bouyer }
801 1.30 bouyer last_char(stime) = '\0';
802 1.30 bouyer if (timeprd(stime, &graceb) != 0) {
803 1.30 bouyer warnx("%s:%s: bad number", fsp, stime);
804 1.30 bouyer goto out;
805 1.30 bouyer }
806 1.30 bouyer if (sscanf(line2,
807 1.30 bouyer "\tinodes: (grace = %s\n", stime) != 1) {
808 1.30 bouyer warnx("%s:%s: bad format", fsp, line2);
809 1.30 bouyer goto out;
810 1.30 bouyer }
811 1.30 bouyer if (last_char(stime) != ')') {
812 1.30 bouyer warnx("%s:%s: bad format", fsp, line2);
813 1.30 bouyer goto out;
814 1.30 bouyer }
815 1.30 bouyer last_char(stime) = '\0';
816 1.30 bouyer if (timeprd(stime, &gracei) != 0) {
817 1.30 bouyer warnx("%s:%s: bad number", fsp, stime);
818 1.30 bouyer goto out;
819 1.30 bouyer }
820 1.30 bouyer } else {
821 1.30 bouyer cnt = sscanf(line1,
822 1.30 bouyer "\tblocks in use: %s limits (soft = %s hard = %s "
823 1.30 bouyer "grace = %s", scurb, ssoft, shard, stime);
824 1.30 bouyer if (cnt == 3) {
825 1.30 bouyer if (version != 1 ||
826 1.30 bouyer last_char(scurb) != ',' ||
827 1.30 bouyer last_char(ssoft) != ',' ||
828 1.30 bouyer last_char(shard) != ')') {
829 1.30 bouyer warnx("%s:%s: bad format %d",
830 1.30 bouyer fsp, line1, cnt);
831 1.30 bouyer goto out;
832 1.30 bouyer }
833 1.30 bouyer stime[0] = '\0';
834 1.30 bouyer } else if (cnt == 4) {
835 1.30 bouyer if (version < 2 ||
836 1.30 bouyer last_char(scurb) != ',' ||
837 1.30 bouyer last_char(ssoft) != ',' ||
838 1.30 bouyer last_char(shard) != ',' ||
839 1.30 bouyer last_char(stime) != ')') {
840 1.30 bouyer warnx("%s:%s: bad format %d",
841 1.30 bouyer fsp, line1, cnt);
842 1.30 bouyer goto out;
843 1.30 bouyer }
844 1.30 bouyer } else {
845 1.31 christos warnx("%s: %s: bad format cnt %d", fsp, line1,
846 1.31 christos cnt);
847 1.30 bouyer goto out;
848 1.30 bouyer }
849 1.30 bouyer /* drop last char which is ',' or ')' */
850 1.30 bouyer last_char(scurb) = '\0';
851 1.30 bouyer last_char(ssoft) = '\0';
852 1.30 bouyer last_char(shard) = '\0';
853 1.30 bouyer last_char(stime) = '\0';
854 1.30 bouyer
855 1.30 bouyer if (intrd(ssoft, &softb, HN_B) != 0) {
856 1.30 bouyer warnx("%s:%s: bad number", fsp, ssoft);
857 1.30 bouyer goto out;
858 1.30 bouyer }
859 1.30 bouyer if (intrd(shard, &hardb, HN_B) != 0) {
860 1.30 bouyer warnx("%s:%s: bad number", fsp, shard);
861 1.30 bouyer goto out;
862 1.30 bouyer }
863 1.30 bouyer if (cnt == 4) {
864 1.30 bouyer if (timeprd(stime, &graceb) != 0) {
865 1.30 bouyer warnx("%s:%s: bad number", fsp, stime);
866 1.30 bouyer goto out;
867 1.30 bouyer }
868 1.30 bouyer }
869 1.30 bouyer
870 1.30 bouyer cnt = sscanf(line2,
871 1.30 bouyer "\tinodes in use: %s limits (soft = %s hard = %s "
872 1.30 bouyer "grace = %s", scuri, ssoft, shard, stime);
873 1.30 bouyer if (cnt == 3) {
874 1.30 bouyer if (version != 1 ||
875 1.30 bouyer last_char(scuri) != ',' ||
876 1.30 bouyer last_char(ssoft) != ',' ||
877 1.30 bouyer last_char(shard) != ')') {
878 1.30 bouyer warnx("%s:%s: bad format %d",
879 1.30 bouyer fsp, line2, cnt);
880 1.30 bouyer goto out;
881 1.30 bouyer }
882 1.30 bouyer stime[0] = '\0';
883 1.30 bouyer } else if (cnt == 4) {
884 1.30 bouyer if (version < 2 ||
885 1.30 bouyer last_char(scuri) != ',' ||
886 1.30 bouyer last_char(ssoft) != ',' ||
887 1.30 bouyer last_char(shard) != ',' ||
888 1.30 bouyer last_char(stime) != ')') {
889 1.30 bouyer warnx("%s:%s: bad format %d",
890 1.30 bouyer fsp, line2, cnt);
891 1.30 bouyer goto out;
892 1.30 bouyer }
893 1.30 bouyer } else {
894 1.30 bouyer warnx("%s: %s: bad format", fsp, line2);
895 1.30 bouyer goto out;
896 1.30 bouyer }
897 1.30 bouyer /* drop last char which is ',' or ')' */
898 1.30 bouyer last_char(scuri) = '\0';
899 1.30 bouyer last_char(ssoft) = '\0';
900 1.30 bouyer last_char(shard) = '\0';
901 1.30 bouyer last_char(stime) = '\0';
902 1.30 bouyer if (intrd(ssoft, &softi, 0) != 0) {
903 1.30 bouyer warnx("%s:%s: bad number", fsp, ssoft);
904 1.30 bouyer goto out;
905 1.30 bouyer }
906 1.30 bouyer if (intrd(shard, &hardi, 0) != 0) {
907 1.30 bouyer warnx("%s:%s: bad number", fsp, shard);
908 1.30 bouyer goto out;
909 1.30 bouyer }
910 1.30 bouyer if (cnt == 4) {
911 1.30 bouyer if (timeprd(stime, &gracei) != 0) {
912 1.30 bouyer warnx("%s:%s: bad number", fsp, stime);
913 1.30 bouyer goto out;
914 1.30 bouyer }
915 1.30 bouyer }
916 1.1 cgd }
917 1.37 dholland for (qup = qlist->head; qup; qup = qup->next) {
918 1.39 dholland struct quotaval *q = qup->qv;
919 1.31 christos char b1[32], b2[32];
920 1.1 cgd if (strcmp(fsp, qup->fsname))
921 1.1 cgd continue;
922 1.30 bouyer if (version == 1 && dflag) {
923 1.39 dholland q[QL_BLK].qv_grace = graceb;
924 1.39 dholland q[QL_FL].qv_grace = gracei;
925 1.30 bouyer qup->flags |= FOUND;
926 1.30 bouyer continue;
927 1.30 bouyer }
928 1.30 bouyer
929 1.39 dholland if (strcmp(intprt(b1, 21, q[QL_BLK].qv_usage,
930 1.31 christos HN_NOSPACE | HN_B, Hflag),
931 1.30 bouyer scurb) != 0 ||
932 1.39 dholland strcmp(intprt(b2, 21, q[QL_FL].qv_usage,
933 1.31 christos HN_NOSPACE, Hflag),
934 1.30 bouyer scuri) != 0) {
935 1.30 bouyer warnx("%s: cannot change current allocation",
936 1.30 bouyer fsp);
937 1.30 bouyer break;
938 1.30 bouyer }
939 1.1 cgd /*
940 1.1 cgd * Cause time limit to be reset when the quota
941 1.1 cgd * is next used if previously had no soft limit
942 1.1 cgd * or were under it, but now have a soft limit
943 1.1 cgd * and are over it.
944 1.1 cgd */
945 1.39 dholland if (q[QL_BLK].qv_usage &&
946 1.39 dholland q[QL_BLK].qv_usage >= softb &&
947 1.39 dholland (q[QL_BLK].qv_softlimit == 0 ||
948 1.39 dholland q[QL_BLK].qv_usage < q[QL_BLK].qv_softlimit))
949 1.39 dholland q[QL_BLK].qv_expiretime = 0;
950 1.39 dholland if (q[QL_FL].qv_usage &&
951 1.39 dholland q[QL_FL].qv_usage >= softi &&
952 1.39 dholland (q[QL_FL].qv_softlimit == 0 ||
953 1.39 dholland q[QL_FL].qv_usage < q[QL_FL].qv_softlimit))
954 1.39 dholland q[QL_FL].qv_expiretime = 0;
955 1.39 dholland q[QL_BLK].qv_softlimit = softb;
956 1.39 dholland q[QL_BLK].qv_hardlimit = hardb;
957 1.30 bouyer if (version == 2)
958 1.39 dholland q[QL_BLK].qv_grace = graceb;
959 1.39 dholland q[QL_FL].qv_softlimit = softi;
960 1.39 dholland q[QL_FL].qv_hardlimit = hardi;
961 1.30 bouyer if (version == 2)
962 1.39 dholland q[QL_FL].qv_grace = gracei;
963 1.1 cgd qup->flags |= FOUND;
964 1.1 cgd }
965 1.1 cgd }
966 1.27 jnemeth out:
967 1.1 cgd fclose(fd);
968 1.1 cgd /*
969 1.1 cgd * Disable quotas for any filesystems that have not been found.
970 1.1 cgd */
971 1.37 dholland for (qup = qlist->head; qup; qup = qup->next) {
972 1.39 dholland struct quotaval *q = qup->qv;
973 1.1 cgd if (qup->flags & FOUND) {
974 1.1 cgd qup->flags &= ~FOUND;
975 1.1 cgd continue;
976 1.1 cgd }
977 1.39 dholland q[QL_BLK].qv_softlimit = UQUAD_MAX;
978 1.39 dholland q[QL_BLK].qv_hardlimit = UQUAD_MAX;
979 1.39 dholland q[QL_BLK].qv_grace = 0;
980 1.39 dholland q[QL_FL].qv_softlimit = UQUAD_MAX;
981 1.39 dholland q[QL_FL].qv_hardlimit = UQUAD_MAX;
982 1.39 dholland q[QL_FL].qv_grace = 0;
983 1.1 cgd }
984 1.31 christos return 1;
985 1.1 cgd }
986 1.1 cgd
987 1.34 dholland ////////////////////////////////////////////////////////////
988 1.38 dholland // actions
989 1.38 dholland
990 1.38 dholland static void
991 1.41 dholland replicate(const char *fs, int idtype, const char *protoname,
992 1.38 dholland char **names, int numnames)
993 1.38 dholland {
994 1.38 dholland long protoid, id;
995 1.38 dholland struct quotalist *protoprivs;
996 1.38 dholland struct quotause *qup;
997 1.38 dholland int i;
998 1.38 dholland
999 1.41 dholland if ((protoid = getidbyname(protoname, idtype)) == -1)
1000 1.38 dholland exit(1);
1001 1.41 dholland protoprivs = getprivs(protoid, 0, idtype, fs);
1002 1.38 dholland for (qup = protoprivs->head; qup; qup = qup->next) {
1003 1.39 dholland qup->qv[QL_BLK].qv_expiretime = 0;
1004 1.39 dholland qup->qv[QL_FL].qv_expiretime = 0;
1005 1.38 dholland }
1006 1.38 dholland for (i=0; i<numnames; i++) {
1007 1.41 dholland id = getidbyname(names[i], idtype);
1008 1.41 dholland if (id == -1)
1009 1.38 dholland continue;
1010 1.41 dholland putprivs(id, idtype, protoprivs);
1011 1.38 dholland }
1012 1.38 dholland /* XXX */
1013 1.38 dholland /* quotalist_destroy(protoprivs); */
1014 1.38 dholland }
1015 1.38 dholland
1016 1.38 dholland static void
1017 1.41 dholland assign(const char *fs, int idtype,
1018 1.38 dholland char *soft, char *hard, char *grace,
1019 1.38 dholland char **names, int numnames)
1020 1.38 dholland {
1021 1.38 dholland struct quotalist *curprivs;
1022 1.38 dholland struct quotause *lqup;
1023 1.38 dholland u_int64_t softb, hardb, softi, hardi;
1024 1.38 dholland time_t graceb, gracei;
1025 1.38 dholland char *str;
1026 1.38 dholland long id;
1027 1.38 dholland int dflag;
1028 1.38 dholland int i;
1029 1.38 dholland
1030 1.38 dholland if (soft) {
1031 1.38 dholland str = strsep(&soft, "/");
1032 1.38 dholland if (str[0] == '\0' || soft == NULL || soft[0] == '\0')
1033 1.38 dholland usage();
1034 1.38 dholland
1035 1.38 dholland if (intrd(str, &softb, HN_B) != 0)
1036 1.38 dholland errx(1, "%s: bad number", str);
1037 1.38 dholland if (intrd(soft, &softi, 0) != 0)
1038 1.38 dholland errx(1, "%s: bad number", soft);
1039 1.38 dholland }
1040 1.38 dholland if (hard) {
1041 1.38 dholland str = strsep(&hard, "/");
1042 1.38 dholland if (str[0] == '\0' || hard == NULL || hard[0] == '\0')
1043 1.38 dholland usage();
1044 1.38 dholland
1045 1.38 dholland if (intrd(str, &hardb, HN_B) != 0)
1046 1.38 dholland errx(1, "%s: bad number", str);
1047 1.38 dholland if (intrd(hard, &hardi, 0) != 0)
1048 1.38 dholland errx(1, "%s: bad number", hard);
1049 1.38 dholland }
1050 1.38 dholland if (grace) {
1051 1.38 dholland str = strsep(&grace, "/");
1052 1.38 dholland if (str[0] == '\0' || grace == NULL || grace[0] == '\0')
1053 1.38 dholland usage();
1054 1.38 dholland
1055 1.38 dholland if (timeprd(str, &graceb) != 0)
1056 1.38 dholland errx(1, "%s: bad number", str);
1057 1.38 dholland if (timeprd(grace, &gracei) != 0)
1058 1.38 dholland errx(1, "%s: bad number", grace);
1059 1.38 dholland }
1060 1.38 dholland for (i=0; i<numnames; i++) {
1061 1.38 dholland if (names[i] == NULL) {
1062 1.38 dholland id = 0;
1063 1.38 dholland dflag = 1;
1064 1.38 dholland } else {
1065 1.41 dholland id = getidbyname(names[i], idtype);
1066 1.38 dholland if (id == -1)
1067 1.38 dholland continue;
1068 1.38 dholland dflag = 0;
1069 1.38 dholland }
1070 1.38 dholland
1071 1.41 dholland curprivs = getprivs(id, dflag, idtype, fs);
1072 1.38 dholland for (lqup = curprivs->head; lqup; lqup = lqup->next) {
1073 1.39 dholland struct quotaval *q = lqup->qv;
1074 1.38 dholland if (soft) {
1075 1.38 dholland if (!dflag && softb &&
1076 1.39 dholland q[QL_BLK].qv_usage >= softb &&
1077 1.39 dholland (q[QL_BLK].qv_softlimit == 0 ||
1078 1.39 dholland q[QL_BLK].qv_usage <
1079 1.39 dholland q[QL_BLK].qv_softlimit))
1080 1.39 dholland q[QL_BLK].qv_expiretime = 0;
1081 1.38 dholland if (!dflag && softi &&
1082 1.39 dholland q[QL_FL].qv_usage >= softb &&
1083 1.39 dholland (q[QL_FL].qv_softlimit == 0 ||
1084 1.39 dholland q[QL_FL].qv_usage <
1085 1.39 dholland q[QL_FL].qv_softlimit))
1086 1.39 dholland q[QL_FL].qv_expiretime = 0;
1087 1.39 dholland q[QL_BLK].qv_softlimit = softb;
1088 1.39 dholland q[QL_FL].qv_softlimit = softi;
1089 1.38 dholland }
1090 1.38 dholland if (hard) {
1091 1.39 dholland q[QL_BLK].qv_hardlimit = hardb;
1092 1.39 dholland q[QL_FL].qv_hardlimit = hardi;
1093 1.38 dholland }
1094 1.38 dholland if (grace) {
1095 1.39 dholland q[QL_BLK].qv_grace = graceb;
1096 1.39 dholland q[QL_FL].qv_grace = gracei;
1097 1.38 dholland }
1098 1.38 dholland }
1099 1.41 dholland putprivs(id, idtype, curprivs);
1100 1.38 dholland quotalist_destroy(curprivs);
1101 1.38 dholland }
1102 1.38 dholland }
1103 1.38 dholland
1104 1.38 dholland static void
1105 1.41 dholland clear(const char *fs, int idtype, char **names, int numnames)
1106 1.38 dholland {
1107 1.41 dholland clearpriv(numnames, names, fs, idtype);
1108 1.38 dholland }
1109 1.38 dholland
1110 1.38 dholland static void
1111 1.41 dholland editone(const char *fs, int idtype, const char *name,
1112 1.38 dholland int tmpfd, const char *tmppath)
1113 1.38 dholland {
1114 1.38 dholland struct quotalist *curprivs;
1115 1.38 dholland long id;
1116 1.38 dholland int dflag;
1117 1.38 dholland
1118 1.38 dholland if (name == NULL) {
1119 1.38 dholland id = 0;
1120 1.38 dholland dflag = 1;
1121 1.38 dholland } else {
1122 1.41 dholland id = getidbyname(name, idtype);
1123 1.38 dholland if (id == -1)
1124 1.38 dholland return;
1125 1.38 dholland dflag = 0;
1126 1.38 dholland }
1127 1.41 dholland curprivs = getprivs(id, dflag, idtype, fs);
1128 1.38 dholland
1129 1.41 dholland if (writeprivs(curprivs, tmpfd, name, idtype) == 0)
1130 1.38 dholland goto fail;
1131 1.38 dholland
1132 1.38 dholland if (editit(tmppath) == 0)
1133 1.38 dholland goto fail;
1134 1.38 dholland
1135 1.38 dholland if (readprivs(curprivs, tmpfd, dflag) == 0)
1136 1.38 dholland goto fail;
1137 1.38 dholland
1138 1.41 dholland putprivs(id, idtype, curprivs);
1139 1.38 dholland fail:
1140 1.38 dholland quotalist_destroy(curprivs);
1141 1.38 dholland }
1142 1.38 dholland
1143 1.38 dholland static void
1144 1.41 dholland edit(const char *fs, int idtype, char **names, int numnames)
1145 1.38 dholland {
1146 1.38 dholland char tmppath[] = _PATH_TMPFILE;
1147 1.38 dholland int tmpfd, i;
1148 1.38 dholland
1149 1.38 dholland tmpfd = mkstemp(tmppath);
1150 1.38 dholland fchown(tmpfd, getuid(), getgid());
1151 1.38 dholland
1152 1.38 dholland for (i=0; i<numnames; i++) {
1153 1.41 dholland editone(fs, idtype, names[i], tmpfd, tmppath);
1154 1.38 dholland }
1155 1.38 dholland
1156 1.38 dholland close(tmpfd);
1157 1.38 dholland unlink(tmppath);
1158 1.38 dholland }
1159 1.38 dholland
1160 1.38 dholland ////////////////////////////////////////////////////////////
1161 1.34 dholland // main
1162 1.1 cgd
1163 1.31 christos static void
1164 1.34 dholland usage(void)
1165 1.1 cgd {
1166 1.34 dholland const char *p = getprogname();
1167 1.34 dholland fprintf(stderr,
1168 1.34 dholland "Usage: %s [-D] [-H] [-u] [-p <username>] [-f <filesystem>] "
1169 1.34 dholland "-d | <username> ...\n"
1170 1.34 dholland "\t%s [-D] [-H] -g [-p <groupname>] [-f <filesystem>] "
1171 1.34 dholland "-d | <groupname> ...\n"
1172 1.34 dholland "\t%s [-D] [-u] [-f <filesystem>] [-s b#/i#] [-h b#/i#] [-t t#/t#] "
1173 1.34 dholland "-d | <username> ...\n"
1174 1.34 dholland "\t%s [-D] -g [-f <filesystem>] [-s b#/i#] [-h b#/i#] [-t t#/t#] "
1175 1.34 dholland "-d | <groupname> ...\n"
1176 1.34 dholland "\t%s [-D] [-H] [-u] -c [-f <filesystem>] username ...\n"
1177 1.34 dholland "\t%s [-D] [-H] -g -c [-f <filesystem>] groupname ...\n",
1178 1.34 dholland p, p, p, p, p, p);
1179 1.34 dholland exit(1);
1180 1.1 cgd }
1181 1.1 cgd
1182 1.34 dholland int
1183 1.34 dholland main(int argc, char *argv[])
1184 1.30 bouyer {
1185 1.41 dholland int idtype;
1186 1.34 dholland char *protoname;
1187 1.34 dholland char *soft = NULL, *hard = NULL, *grace = NULL;
1188 1.34 dholland char *fs = NULL;
1189 1.34 dholland int ch;
1190 1.34 dholland int pflag = 0;
1191 1.34 dholland int cflag = 0;
1192 1.38 dholland int dflag = 0;
1193 1.30 bouyer
1194 1.34 dholland if (argc < 2)
1195 1.34 dholland usage();
1196 1.34 dholland if (getuid())
1197 1.34 dholland errx(1, "permission denied");
1198 1.34 dholland protoname = NULL;
1199 1.41 dholland idtype = QUOTA_IDTYPE_USER;
1200 1.44 dholland while ((ch = getopt(argc, argv, "Hcdugp:s:h:t:f:")) != -1) {
1201 1.34 dholland switch(ch) {
1202 1.34 dholland case 'H':
1203 1.34 dholland Hflag++;
1204 1.34 dholland break;
1205 1.34 dholland case 'c':
1206 1.34 dholland cflag++;
1207 1.34 dholland break;
1208 1.34 dholland case 'd':
1209 1.34 dholland dflag++;
1210 1.34 dholland break;
1211 1.34 dholland case 'p':
1212 1.34 dholland protoname = optarg;
1213 1.34 dholland pflag++;
1214 1.34 dholland break;
1215 1.34 dholland case 'g':
1216 1.41 dholland idtype = QUOTA_IDTYPE_GROUP;
1217 1.34 dholland break;
1218 1.34 dholland case 'u':
1219 1.41 dholland idtype = QUOTA_IDTYPE_USER;
1220 1.34 dholland break;
1221 1.34 dholland case 's':
1222 1.34 dholland soft = optarg;
1223 1.34 dholland break;
1224 1.34 dholland case 'h':
1225 1.34 dholland hard = optarg;
1226 1.34 dholland break;
1227 1.34 dholland case 't':
1228 1.34 dholland grace = optarg;
1229 1.34 dholland break;
1230 1.34 dholland case 'f':
1231 1.34 dholland fs = optarg;
1232 1.34 dholland break;
1233 1.34 dholland default:
1234 1.34 dholland usage();
1235 1.34 dholland }
1236 1.30 bouyer }
1237 1.34 dholland argc -= optind;
1238 1.34 dholland argv += optind;
1239 1.30 bouyer
1240 1.34 dholland if (pflag) {
1241 1.34 dholland if (soft || hard || grace || dflag || cflag)
1242 1.34 dholland usage();
1243 1.41 dholland replicate(fs, idtype, protoname, argv, argc);
1244 1.38 dholland } else if (soft || hard || grace) {
1245 1.34 dholland if (cflag)
1246 1.34 dholland usage();
1247 1.34 dholland if (dflag) {
1248 1.38 dholland /* use argv[argc], which is null, to mean 'default' */
1249 1.38 dholland argc++;
1250 1.30 bouyer }
1251 1.41 dholland assign(fs, idtype, soft, hard, grace, argv, argc);
1252 1.38 dholland } else if (cflag) {
1253 1.34 dholland if (dflag)
1254 1.34 dholland usage();
1255 1.41 dholland clear(fs, idtype, argv, argc);
1256 1.38 dholland } else {
1257 1.38 dholland if (dflag) {
1258 1.38 dholland /* use argv[argc], which is null, to mean 'default' */
1259 1.38 dholland argc++;
1260 1.38 dholland }
1261 1.41 dholland edit(fs, idtype, argv, argc);
1262 1.34 dholland }
1263 1.34 dholland return 0;
1264 1.30 bouyer }
1265