2 * Copyright (c) 2011 François Tigeot <ftigeot@wolfpond.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in
13 * the documentation and/or other materials provided with the
15 * 3. Neither the name of The DragonFly Project nor the names of its
16 * contributors may be used to endorse or promote products derived
17 * from this software without specific, prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
23 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
25 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
27 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
28 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
29 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include <sys/mount.h>
35 #include <sys/vfs_quota.h>
42 #include <libprop/proplib.h>
47 #include <sys/types.h>
50 static bool flag_debug = 0;
51 static bool flag_humanize = 0;
53 static void usage(int);
54 static int get_dirsize(char *);
55 static int get_fslist(void);
60 fprintf(stderr, "usage: vquota [-Dh] check directory\n");
61 fprintf(stderr, " vquota [-Dh] lsfs\n");
62 fprintf(stderr, " vquota [-Dh] show mount_point\n");
67 * Inode numbers with more than one hard link often come in groups;
68 * use linear arrays of 1024 ones as the basic unit of allocation.
69 * We only need to check if the inodes have been previously processed,
70 * bit arrays are perfect for that purpose.
72 #define HL_CHUNK_BITS 10
73 #define HL_CHUNK_ENTRIES (1<<HL_CHUNK_BITS)
74 #define HL_CHUNK_MASK (HL_CHUNK_ENTRIES - 1)
75 #define BA_UINT64_BITS 6
76 #define BA_UINT64_ENTRIES (1<<BA_UINT64_BITS)
77 #define BA_UINT64_MASK (BA_UINT64_ENTRIES - 1)
80 RB_ENTRY(hl_node) rb_entry;
82 uint64_t hl_chunk[HL_CHUNK_ENTRIES/64];
85 RB_HEAD(hl_tree,hl_node) hl_root;
87 RB_PROTOTYPE(hl_tree, hl_node, rb_entry, rb_hl_node_cmp);
90 rb_hl_node_cmp(struct hl_node *a, struct hl_node *b);
92 RB_GENERATE(hl_tree, hl_node, rb_entry, rb_hl_node_cmp);
94 struct hl_node* hl_node_insert(ino_t);
98 rb_hl_node_cmp(struct hl_node *a, struct hl_node *b)
100 if (a->ino_left_bits < b->ino_left_bits)
102 else if (a->ino_left_bits > b->ino_left_bits)
107 struct hl_node* hl_node_insert(ino_t inode)
109 struct hl_node *hlp, *res;
111 hlp = malloc(sizeof(struct hl_node));
113 /* shouldn't happen */
114 printf("hl_node_insert(): malloc failed\n");
117 bzero(hlp, sizeof(struct hl_node));
119 hlp->ino_left_bits = (inode >> HL_CHUNK_BITS);
120 res = RB_INSERT(hl_tree, &hl_root, hlp);
122 if (res != NULL) /* shouldn't happen */
123 printf("hl_node_insert(): RB_INSERT didn't return NULL\n");
129 * hl_register: register an inode number in a rb-tree of bit arrays
131 * - true if the inode was already processed
135 hl_register(ino_t inode)
137 struct hl_node hl_find, *hlp;
138 uint64_t ino_right_bits, ba_index, ba_offset;
139 uint64_t bitmask, bitval;
142 /* calculate the different addresses of the wanted bit */
143 hl_find.ino_left_bits = (inode >> HL_CHUNK_BITS);
145 ino_right_bits = inode & HL_CHUNK_MASK;
146 ba_index = ino_right_bits >> BA_UINT64_BITS;
147 ba_offset = ino_right_bits & BA_UINT64_MASK;
149 /* no existing node? create and initialize it */
150 if ((hlp = RB_FIND(hl_tree, &hl_root, &hl_find)) == NULL) {
151 hlp = hl_node_insert(inode);
154 /* node was found, check the bit value */
155 bitmask = 1 << ba_offset;
156 bitval = hlp->hl_chunk[ba_index] & bitmask;
162 hlp->hl_chunk[ba_index] |= bitmask;
167 /* storage for collected uid numbers */
168 /* FIXME: same data structures used in kernel, should find a way to
169 * deduplicate this code */
172 rb_ac_unode_cmp(struct ac_unode*, struct ac_unode*);
174 rb_ac_gnode_cmp(struct ac_gnode*, struct ac_gnode*);
176 RB_HEAD(ac_utree,ac_unode) ac_uroot;
177 RB_HEAD(ac_gtree,ac_gnode) ac_groot;
178 RB_PROTOTYPE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
179 RB_PROTOTYPE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
180 RB_GENERATE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
181 RB_GENERATE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
184 rb_ac_unode_cmp(struct ac_unode *a, struct ac_unode *b)
186 if (a->left_bits < b->left_bits)
188 else if (a->left_bits > b->left_bits)
194 rb_ac_gnode_cmp(struct ac_gnode *a, struct ac_gnode *b)
196 if (a->left_bits < b->left_bits)
198 else if (a->left_bits > b->left_bits)
203 static struct ac_unode*
204 unode_insert(uid_t uid)
206 struct ac_unode *unp, *res;
208 unp = malloc(sizeof(struct ac_unode));
210 printf("unode_insert(): malloc failed\n");
213 bzero(unp, sizeof(struct ac_unode));
215 unp->left_bits = (uid >> ACCT_CHUNK_BITS);
216 res = RB_INSERT(ac_utree, &ac_uroot, unp);
218 if (res != NULL) /* shouldn't happen */
219 printf("unode_insert(): RB_INSERT didn't return NULL\n");
224 static struct ac_gnode*
225 gnode_insert(gid_t gid)
227 struct ac_gnode *gnp, *res;
229 gnp = malloc(sizeof(struct ac_gnode));
231 printf("gnode_insert(): malloc failed\n");
234 bzero(gnp, sizeof(struct ac_gnode));
236 gnp->left_bits = (gid >> ACCT_CHUNK_BITS);
237 res = RB_INSERT(ac_gtree, &ac_groot, gnp);
239 if (res != NULL) /* shouldn't happen */
240 printf("gnode_insert(): RB_INSERT didn't return NULL\n");
246 get_dirsize(char* dirname)
251 uint64_t global_size = 0;
260 struct ac_unode *unp, ufind;
261 struct ac_gnode *gnp, gfind;
266 /* TODO: check directory name sanity */
267 fts_args[0] = dirname;
270 if ((fts = fts_open(fts_args, FTS_PHYSICAL|FTS_XDEV, NULL)) == NULL)
271 err(1, "fts_open() failed");
273 while ((p = fts_read(fts)) != NULL) {
274 switch (p->fts_info) {
275 /* directories, ignore them */
280 /* read errors, warn, continue and flag */
284 warnx("%s: %s", p->fts_path, strerror(p->fts_errno));
288 file_inode = p->fts_statp->st_ino;
289 file_size = p->fts_statp->st_size;
290 file_uid = p->fts_statp->st_uid;
291 file_gid = p->fts_statp->st_gid;
293 /* files with more than one hard link: */
294 /* process them only once */
295 if (p->fts_statp->st_nlink > 1)
296 if (hl_register(file_inode) == false)
299 global_size += file_size;
300 ufind.left_bits = (file_uid >> ACCT_CHUNK_BITS);
301 gfind.left_bits = (file_gid >> ACCT_CHUNK_BITS);
302 if ((unp = RB_FIND(ac_utree, &ac_uroot, &ufind)) == NULL)
303 unp = unode_insert(file_uid);
304 if ((gnp = RB_FIND(ac_gtree, &ac_groot, &gfind)) == NULL)
305 gnp = gnode_insert(file_gid);
306 unp->uid_chunk[(file_uid & ACCT_CHUNK_MASK)] += file_size;
307 gnp->gid_chunk[(file_gid & ACCT_CHUNK_MASK)] += file_size;
313 humanize_number(hbuf, sizeof(hbuf), global_size, "",
314 HN_AUTOSCALE, HN_NOSPACE);
315 printf("total: %s\n", hbuf);
317 printf("total: %"PRIu64"\n", global_size);
319 RB_FOREACH(unp, ac_utree, &ac_uroot) {
320 for (i=0; i<ACCT_CHUNK_NIDS; i++) {
321 if (unp->uid_chunk[i] != 0) {
322 uid = (unp->left_bits << ACCT_CHUNK_BITS) + i;
324 humanize_number(hbuf, sizeof(hbuf),
325 unp->uid_chunk[i], "", HN_AUTOSCALE, HN_NOSPACE);
326 printf("uid %"PRIu32": %s\n", uid, hbuf);
328 printf("uid %"PRIu32": %"PRIu64"\n", uid, unp->uid_chunk[i]);
333 RB_FOREACH(gnp, ac_gtree, &ac_groot) {
334 for (i=0; i<ACCT_CHUNK_NIDS; i++) {
335 if (gnp->gid_chunk[i] != 0) {
336 gid = (gnp->left_bits << ACCT_CHUNK_BITS) + i;
338 humanize_number(hbuf, sizeof(hbuf),
339 gnp->gid_chunk[i], "", HN_AUTOSCALE, HN_NOSPACE);
340 printf("gid %"PRIu32": %s\n", gid, hbuf);
342 printf("gid %"PRIu32": %"PRIu64"\n", gid, gnp->gid_chunk[i]);
351 /* print a list of filesystems with accounting enabled */
355 struct statfs *mntbufp;
358 /* read mount table from kernel */
359 nloc = getmntinfo(&mntbufp, MNT_NOWAIT|MNT_LOCAL);
361 perror("getmntinfo");
365 /* iterate mounted filesystems */
366 for (i=0; i<nloc; i++) {
367 /* vfs accounting enabled on this one ? */
368 if (mntbufp[i].f_flags & MNT_ACCOUNTING)
369 printf("%s on %s\n", mntbufp[i].f_mntfromname,
370 mntbufp[i].f_mntonname);
377 send_command(const char *path, const char *cmd,
378 prop_dictionary_t args, prop_dictionary_t *res)
380 prop_dictionary_t dict;
381 struct plistref pref;
386 dict = prop_dictionary_create();
389 printf("send_command(): couldn't create dictionary\n");
393 rv = prop_dictionary_set_cstring(dict, "command", cmd);
395 printf("send_command(): couldn't initialize dictionary\n");
399 rv = prop_dictionary_set(dict, "arguments", args);
401 printf("prop_dictionary_set() failed\n");
405 error = prop_dictionary_send_syscall(dict, &pref);
407 printf("prop_dictionary_send_syscall() failed\n");
408 prop_object_release(dict);
413 printf("Message to kernel:\n%s\n",
414 prop_dictionary_externalize(dict));
416 error = vquotactl(path, &pref);
418 printf("send_command: vquotactl = %d\n", error);
422 error = prop_dictionary_recv_syscall(&pref, res);
424 printf("prop_dictionary_recv_syscall() failed\n");
428 printf("Message from kernel:\n%s\n",
429 prop_dictionary_externalize(*res));
434 /* show collected statistics on mount point */
438 prop_dictionary_t args, res;
439 prop_array_t reslist;
441 prop_object_iterator_t iter;
442 prop_dictionary_t item;
447 args = prop_dictionary_create();
448 res = prop_dictionary_create();
450 printf("couldn't create args dictionary\n");
452 rv = send_command(path, "get usage all", args, &res);
454 printf("show-mp(): failed to send message to kernel\n");
458 reslist = prop_dictionary_get(res, "get usage all");
459 if (reslist == NULL) {
460 printf("show_mp(): failed to get array of results");
465 iter = prop_array_iterator(reslist);
467 printf("show_mp(): failed to create iterator\n");
472 while ((item = prop_object_iterator_next(iter)) != NULL) {
473 rv = prop_dictionary_get_uint64(item, "space used", &space);
474 if (prop_dictionary_get_uint32(item, "uid", &id))
475 printf("uid %u:", id);
476 else if (prop_dictionary_get_uint32(item, "gid", &id))
477 printf("gid %u:", id);
479 printf("total space used");
481 humanize_number(hbuf, sizeof(hbuf), space, "", HN_AUTOSCALE, HN_NOSPACE);
482 printf(" %s\n", hbuf);
484 printf(" %" PRIu64 "\n", space);
487 prop_object_iterator_release(iter);
490 prop_object_release(args);
491 prop_object_release(res);
496 main(int argc, char **argv)
500 while ((ch = getopt(argc, argv, "Dh")) != -1) {
515 if (strcmp(argv[0], "check") == 0) {
518 return get_dirsize(argv[1]);
520 if (strcmp(argv[0], "lsfs") == 0) {
523 if (strcmp(argv[0], "show") == 0) {
526 return show_mp(argv[1]);