i386/ioapic_abi: Disable interrupt load balance by default
[dragonfly.git] / sys / kern / vfs_quota.c
CommitLineData
e788edda
FT
1/*
2 * Copyright (c) 2011 Fran├žois Tigeot <ftigeot@wolpond.org>
3 * All rights reserved.
95bf5f78 4 *
e788edda
FT
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
95bf5f78 8 *
e788edda
FT
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
14 * distribution.
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.
95bf5f78 18 *
e788edda
FT
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
30 * SUCH DAMAGE.
31 */
32
33#include <sys/sysctl.h>
34#include <sys/mount.h>
35#include <sys/systm.h>
36#include <sys/nlookup.h>
37#include <sys/vnode.h>
38#include <sys/stat.h>
39#include <sys/vfs_quota.h>
95bf5f78
FT
40#include <sys/spinlock.h>
41#include <sys/spinlock2.h>
42
43/* in-memory accounting, red-black tree based */
44
45/* FIXME: code duplication caused by uid_t / gid_t differences */
46RB_PROTOTYPE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
47RB_PROTOTYPE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
48
49static int
50rb_ac_unode_cmp(struct ac_unode *a, struct ac_unode *b);
51static int
52rb_ac_gnode_cmp(struct ac_gnode *a, struct ac_gnode *b);
53
54RB_GENERATE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
55RB_GENERATE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
56
57struct ac_unode* unode_insert(struct mount*, uid_t);
58struct ac_gnode* gnode_insert(struct mount*, gid_t);
59
60static int
61rb_ac_unode_cmp(struct ac_unode *a, struct ac_unode *b)
62{
63 if (a->left_bits < b->left_bits)
64 return(-1);
65 else if (a->left_bits > b->left_bits)
66 return(1);
67 return(0);
68}
69
70static int
71rb_ac_gnode_cmp(struct ac_gnode *a, struct ac_gnode *b)
72{
73 if (a->left_bits < b->left_bits)
74 return(-1);
75 else if (a->left_bits > b->left_bits)
76 return(1);
77 return(0);
78}
79
80struct ac_unode*
81unode_insert(struct mount *mp, uid_t uid)
82{
83 struct ac_unode *unp, *res;
84
85 unp = kmalloc(sizeof(struct ac_unode),
86 M_MOUNT, M_ZERO|M_WAITOK);
87
88 unp->left_bits = (uid >> ACCT_CHUNK_BITS);
89 res = RB_INSERT(ac_utree, &mp->mnt_acct.ac_uroot, unp);
90 KASSERT(res == NULL, ("unode_insert(): RB_INSERT didn't return NULL\n"));
91
92 return unp;
93}
94
95struct ac_gnode*
96gnode_insert(struct mount *mp, gid_t gid)
97{
98 struct ac_gnode *gnp, *res;
99
100 gnp = kmalloc(sizeof(struct ac_gnode),
101 M_MOUNT, M_ZERO|M_WAITOK);
102
103 gnp->left_bits = (gid >> ACCT_CHUNK_BITS);
104 res = RB_INSERT(ac_gtree, &mp->mnt_acct.ac_groot, gnp);
105 KASSERT(res == NULL, ("gnode_insert(): RB_INSERT didn't return NULL\n"));
106
107 return gnp;
108}
e788edda
FT
109
110/* initializes global accounting data */
111void
112vq_init(struct mount *mp) {
95bf5f78
FT
113
114 /* initialize the rb trees */
115 RB_INIT(&mp->mnt_acct.ac_uroot);
116 RB_INIT(&mp->mnt_acct.ac_groot);
117 spin_init(&mp->mnt_acct.ac_spin);
118
119 mp->mnt_acct.ac_bytes = 0;
120
121 /* and enable data collection */
122 mp->mnt_op->vfs_account = vfs_stdaccount;
123 kprintf("vfs accounting enabled for %s\n",
124 mp->mnt_stat.f_mntonname);
e788edda
FT
125}
126
127
128void
129vq_done(struct mount *mp) {
95bf5f78
FT
130 /* TODO: remove the rb trees here */
131}
132
133void
134vfs_stdaccount(struct mount *mp, uid_t uid, gid_t gid, int64_t delta)
135{
136 struct ac_unode ufind, *unp;
137 struct ac_gnode gfind, *gnp;
138
139 /* find or create address of chunk */
140 ufind.left_bits = (uid >> ACCT_CHUNK_BITS);
141 gfind.left_bits = (gid >> ACCT_CHUNK_BITS);
142
143 spin_lock(&mp->mnt_acct.ac_spin);
144
145 mp->mnt_acct.ac_bytes += delta;
146
147 if ((unp = RB_FIND(ac_utree, &mp->mnt_acct.ac_uroot, &ufind)) == NULL)
148 unp = unode_insert(mp, uid);
149 if ((gnp = RB_FIND(ac_gtree, &mp->mnt_acct.ac_groot, &gfind)) == NULL)
150 gnp = gnode_insert(mp, gid);
151
152 /* update existing chunk */
153 unp->uid_chunk[(uid & ACCT_CHUNK_MASK)] += delta;
154 gnp->gid_chunk[(gid & ACCT_CHUNK_MASK)] += delta;
155
156 spin_unlock(&mp->mnt_acct.ac_spin);
e788edda 157}