1 | // SPDX-License-Identifier: GPL-2.0 |
2 | /* |
3 | * Implementation of the diskquota system for the LINUX operating system. QUOTA |
4 | * is implemented using the BSD system call interface as the means of |
5 | * communication with the user level. This file contains the generic routines |
6 | * called by the different filesystems on allocation of an inode or block. |
7 | * These routines take care of the administration needed to have a consistent |
8 | * diskquota tracking system. The ideas of both user and group quotas are based |
9 | * on the Melbourne quota system as used on BSD derived systems. The internal |
10 | * implementation is based on one of the several variants of the LINUX |
11 | * inode-subsystem with added complexity of the diskquota system. |
12 | * |
13 | * Author: Marco van Wieringen <mvw@planets.elm.net> |
14 | * |
15 | * Fixes: Dmitry Gorodchanin <pgmdsg@ibi.com>, 11 Feb 96 |
16 | * |
17 | * Revised list management to avoid races |
18 | * -- Bill Hawes, <whawes@star.net>, 9/98 |
19 | * |
20 | * Fixed races in dquot_transfer(), dqget() and dquot_alloc_...(). |
21 | * As the consequence the locking was moved from dquot_decr_...(), |
22 | * dquot_incr_...() to calling functions. |
23 | * invalidate_dquots() now writes modified dquots. |
24 | * Serialized quota_off() and quota_on() for mount point. |
25 | * Fixed a few bugs in grow_dquots(). |
26 | * Fixed deadlock in write_dquot() - we no longer account quotas on |
27 | * quota files |
28 | * remove_dquot_ref() moved to inode.c - it now traverses through inodes |
29 | * add_dquot_ref() restarts after blocking |
30 | * Added check for bogus uid and fixed check for group in quotactl. |
31 | * Jan Kara, <jack@suse.cz>, sponsored by SuSE CR, 10-11/99 |
32 | * |
33 | * Used struct list_head instead of own list struct |
34 | * Invalidation of referenced dquots is no longer possible |
35 | * Improved free_dquots list management |
36 | * Quota and i_blocks are now updated in one place to avoid races |
37 | * Warnings are now delayed so we won't block in critical section |
38 | * Write updated not to require dquot lock |
39 | * Jan Kara, <jack@suse.cz>, 9/2000 |
40 | * |
41 | * Added dynamic quota structure allocation |
42 | * Jan Kara <jack@suse.cz> 12/2000 |
43 | * |
44 | * Rewritten quota interface. Implemented new quota format and |
45 | * formats registering. |
46 | * Jan Kara, <jack@suse.cz>, 2001,2002 |
47 | * |
48 | * New SMP locking. |
49 | * Jan Kara, <jack@suse.cz>, 10/2002 |
50 | * |
51 | * Added journalled quota support, fix lock inversion problems |
52 | * Jan Kara, <jack@suse.cz>, 2003,2004 |
53 | * |
54 | * (C) Copyright 1994 - 1997 Marco van Wieringen |
55 | */ |
56 | |
57 | #include <linux/errno.h> |
58 | #include <linux/kernel.h> |
59 | #include <linux/fs.h> |
60 | #include <linux/mount.h> |
61 | #include <linux/mm.h> |
62 | #include <linux/time.h> |
63 | #include <linux/types.h> |
64 | #include <linux/string.h> |
65 | #include <linux/fcntl.h> |
66 | #include <linux/stat.h> |
67 | #include <linux/tty.h> |
68 | #include <linux/file.h> |
69 | #include <linux/slab.h> |
70 | #include <linux/sysctl.h> |
71 | #include <linux/init.h> |
72 | #include <linux/module.h> |
73 | #include <linux/proc_fs.h> |
74 | #include <linux/security.h> |
75 | #include <linux/sched.h> |
76 | #include <linux/cred.h> |
77 | #include <linux/kmod.h> |
78 | #include <linux/namei.h> |
79 | #include <linux/capability.h> |
80 | #include <linux/quotaops.h> |
81 | #include <linux/blkdev.h> |
82 | #include <linux/sched/mm.h> |
83 | #include "../internal.h" /* ugh */ |
84 | |
85 | #include <linux/uaccess.h> |
86 | |
87 | /* |
88 | * There are five quota SMP locks: |
89 | * * dq_list_lock protects all lists with quotas and quota formats. |
90 | * * dquot->dq_dqb_lock protects data from dq_dqb |
91 | * * inode->i_lock protects inode->i_blocks, i_bytes and also guards |
92 | * consistency of dquot->dq_dqb with inode->i_blocks, i_bytes so that |
93 | * dquot_transfer() can stabilize amount it transfers |
94 | * * dq_data_lock protects mem_dqinfo structures and modifications of dquot |
95 | * pointers in the inode |
96 | * * dq_state_lock protects modifications of quota state (on quotaon and |
97 | * quotaoff) and readers who care about latest values take it as well. |
98 | * |
99 | * The spinlock ordering is hence: |
100 | * dq_data_lock > dq_list_lock > i_lock > dquot->dq_dqb_lock, |
101 | * dq_list_lock > dq_state_lock |
102 | * |
103 | * Note that some things (eg. sb pointer, type, id) doesn't change during |
104 | * the life of the dquot structure and so needn't to be protected by a lock |
105 | * |
106 | * Operation accessing dquots via inode pointers are protected by dquot_srcu. |
107 | * Operation of reading pointer needs srcu_read_lock(&dquot_srcu), and |
108 | * synchronize_srcu(&dquot_srcu) is called after clearing pointers from |
109 | * inode and before dropping dquot references to avoid use of dquots after |
110 | * they are freed. dq_data_lock is used to serialize the pointer setting and |
111 | * clearing operations. |
112 | * Special care needs to be taken about S_NOQUOTA inode flag (marking that |
113 | * inode is a quota file). Functions adding pointers from inode to dquots have |
114 | * to check this flag under dq_data_lock and then (if S_NOQUOTA is not set) they |
115 | * have to do all pointer modifications before dropping dq_data_lock. This makes |
116 | * sure they cannot race with quotaon which first sets S_NOQUOTA flag and |
117 | * then drops all pointers to dquots from an inode. |
118 | * |
119 | * Each dquot has its dq_lock mutex. Dquot is locked when it is being read to |
120 | * memory (or space for it is being allocated) on the first dqget(), when it is |
121 | * being written out, and when it is being released on the last dqput(). The |
122 | * allocation and release operations are serialized by the dq_lock and by |
123 | * checking the use count in dquot_release(). |
124 | * |
125 | * Lock ordering (including related VFS locks) is the following: |
126 | * s_umount > i_mutex > journal_lock > dquot->dq_lock > dqio_sem |
127 | */ |
128 | |
129 | static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dq_list_lock); |
130 | static __cacheline_aligned_in_smp DEFINE_SPINLOCK(dq_state_lock); |
131 | __cacheline_aligned_in_smp DEFINE_SPINLOCK(dq_data_lock); |
132 | EXPORT_SYMBOL(dq_data_lock); |
133 | DEFINE_STATIC_SRCU(dquot_srcu); |
134 | |
135 | static DECLARE_WAIT_QUEUE_HEAD(dquot_ref_wq); |
136 | |
137 | void __quota_error(struct super_block *sb, const char *func, |
138 | const char *fmt, ...) |
139 | { |
140 | if (printk_ratelimit()) { |
141 | va_list args; |
142 | struct va_format vaf; |
143 | |
144 | va_start(args, fmt); |
145 | |
146 | vaf.fmt = fmt; |
147 | vaf.va = &args; |
148 | |
149 | printk(KERN_ERR "Quota error (device %s): %s: %pV\n" , |
150 | sb->s_id, func, &vaf); |
151 | |
152 | va_end(args); |
153 | } |
154 | } |
155 | EXPORT_SYMBOL(__quota_error); |
156 | |
157 | #if defined(CONFIG_QUOTA_DEBUG) || defined(CONFIG_PRINT_QUOTA_WARNING) |
158 | static char *quotatypes[] = INITQFNAMES; |
159 | #endif |
160 | static struct quota_format_type *quota_formats; /* List of registered formats */ |
161 | static struct quota_module_name module_names[] = INIT_QUOTA_MODULE_NAMES; |
162 | |
163 | /* SLAB cache for dquot structures */ |
164 | static struct kmem_cache *dquot_cachep; |
165 | |
166 | int register_quota_format(struct quota_format_type *fmt) |
167 | { |
168 | spin_lock(lock: &dq_list_lock); |
169 | fmt->qf_next = quota_formats; |
170 | quota_formats = fmt; |
171 | spin_unlock(lock: &dq_list_lock); |
172 | return 0; |
173 | } |
174 | EXPORT_SYMBOL(register_quota_format); |
175 | |
176 | void unregister_quota_format(struct quota_format_type *fmt) |
177 | { |
178 | struct quota_format_type **actqf; |
179 | |
180 | spin_lock(lock: &dq_list_lock); |
181 | for (actqf = "a_formats; *actqf && *actqf != fmt; |
182 | actqf = &(*actqf)->qf_next) |
183 | ; |
184 | if (*actqf) |
185 | *actqf = (*actqf)->qf_next; |
186 | spin_unlock(lock: &dq_list_lock); |
187 | } |
188 | EXPORT_SYMBOL(unregister_quota_format); |
189 | |
190 | static struct quota_format_type *find_quota_format(int id) |
191 | { |
192 | struct quota_format_type *actqf; |
193 | |
194 | spin_lock(lock: &dq_list_lock); |
195 | for (actqf = quota_formats; actqf && actqf->qf_fmt_id != id; |
196 | actqf = actqf->qf_next) |
197 | ; |
198 | if (!actqf || !try_module_get(module: actqf->qf_owner)) { |
199 | int qm; |
200 | |
201 | spin_unlock(lock: &dq_list_lock); |
202 | |
203 | for (qm = 0; module_names[qm].qm_fmt_id && |
204 | module_names[qm].qm_fmt_id != id; qm++) |
205 | ; |
206 | if (!module_names[qm].qm_fmt_id || |
207 | request_module(module_names[qm].qm_mod_name)) |
208 | return NULL; |
209 | |
210 | spin_lock(lock: &dq_list_lock); |
211 | for (actqf = quota_formats; actqf && actqf->qf_fmt_id != id; |
212 | actqf = actqf->qf_next) |
213 | ; |
214 | if (actqf && !try_module_get(module: actqf->qf_owner)) |
215 | actqf = NULL; |
216 | } |
217 | spin_unlock(lock: &dq_list_lock); |
218 | return actqf; |
219 | } |
220 | |
221 | static void put_quota_format(struct quota_format_type *fmt) |
222 | { |
223 | module_put(module: fmt->qf_owner); |
224 | } |
225 | |
226 | /* |
227 | * Dquot List Management: |
228 | * The quota code uses five lists for dquot management: the inuse_list, |
229 | * releasing_dquots, free_dquots, dqi_dirty_list, and dquot_hash[] array. |
230 | * A single dquot structure may be on some of those lists, depending on |
231 | * its current state. |
232 | * |
233 | * All dquots are placed to the end of inuse_list when first created, and this |
234 | * list is used for invalidate operation, which must look at every dquot. |
235 | * |
236 | * When the last reference of a dquot is dropped, the dquot is added to |
237 | * releasing_dquots. We'll then queue work item which will call |
238 | * synchronize_srcu() and after that perform the final cleanup of all the |
239 | * dquots on the list. Each cleaned up dquot is moved to free_dquots list. |
240 | * Both releasing_dquots and free_dquots use the dq_free list_head in the dquot |
241 | * struct. |
242 | * |
243 | * Unused and cleaned up dquots are in the free_dquots list and this list is |
244 | * searched whenever we need an available dquot. Dquots are removed from the |
245 | * list as soon as they are used again and dqstats.free_dquots gives the number |
246 | * of dquots on the list. When dquot is invalidated it's completely released |
247 | * from memory. |
248 | * |
249 | * Dirty dquots are added to the dqi_dirty_list of quota_info when mark |
250 | * dirtied, and this list is searched when writing dirty dquots back to |
251 | * quota file. Note that some filesystems do dirty dquot tracking on their |
252 | * own (e.g. in a journal) and thus don't use dqi_dirty_list. |
253 | * |
254 | * Dquots with a specific identity (device, type and id) are placed on |
255 | * one of the dquot_hash[] hash chains. The provides an efficient search |
256 | * mechanism to locate a specific dquot. |
257 | */ |
258 | |
259 | static LIST_HEAD(inuse_list); |
260 | static LIST_HEAD(free_dquots); |
261 | static LIST_HEAD(releasing_dquots); |
262 | static unsigned int dq_hash_bits, dq_hash_mask; |
263 | static struct hlist_head *dquot_hash; |
264 | |
265 | struct dqstats dqstats; |
266 | EXPORT_SYMBOL(dqstats); |
267 | |
268 | static qsize_t inode_get_rsv_space(struct inode *inode); |
269 | static qsize_t __inode_get_rsv_space(struct inode *inode); |
270 | static int __dquot_initialize(struct inode *inode, int type); |
271 | |
272 | static void quota_release_workfn(struct work_struct *work); |
273 | static DECLARE_DELAYED_WORK(quota_release_work, quota_release_workfn); |
274 | |
275 | static inline unsigned int |
276 | hashfn(const struct super_block *sb, struct kqid qid) |
277 | { |
278 | unsigned int id = from_kqid(to: &init_user_ns, qid); |
279 | int type = qid.type; |
280 | unsigned long tmp; |
281 | |
282 | tmp = (((unsigned long)sb>>L1_CACHE_SHIFT) ^ id) * (MAXQUOTAS - type); |
283 | return (tmp + (tmp >> dq_hash_bits)) & dq_hash_mask; |
284 | } |
285 | |
286 | /* |
287 | * Following list functions expect dq_list_lock to be held |
288 | */ |
289 | static inline void insert_dquot_hash(struct dquot *dquot) |
290 | { |
291 | struct hlist_head *head; |
292 | head = dquot_hash + hashfn(sb: dquot->dq_sb, qid: dquot->dq_id); |
293 | hlist_add_head(n: &dquot->dq_hash, h: head); |
294 | } |
295 | |
296 | static inline void remove_dquot_hash(struct dquot *dquot) |
297 | { |
298 | hlist_del_init(n: &dquot->dq_hash); |
299 | } |
300 | |
301 | static struct dquot *find_dquot(unsigned int hashent, struct super_block *sb, |
302 | struct kqid qid) |
303 | { |
304 | struct dquot *dquot; |
305 | |
306 | hlist_for_each_entry(dquot, dquot_hash+hashent, dq_hash) |
307 | if (dquot->dq_sb == sb && qid_eq(left: dquot->dq_id, right: qid)) |
308 | return dquot; |
309 | |
310 | return NULL; |
311 | } |
312 | |
313 | /* Add a dquot to the tail of the free list */ |
314 | static inline void put_dquot_last(struct dquot *dquot) |
315 | { |
316 | list_add_tail(new: &dquot->dq_free, head: &free_dquots); |
317 | dqstats_inc(type: DQST_FREE_DQUOTS); |
318 | } |
319 | |
320 | static inline void put_releasing_dquots(struct dquot *dquot) |
321 | { |
322 | list_add_tail(new: &dquot->dq_free, head: &releasing_dquots); |
323 | set_bit(DQ_RELEASING_B, addr: &dquot->dq_flags); |
324 | } |
325 | |
326 | static inline void remove_free_dquot(struct dquot *dquot) |
327 | { |
328 | if (list_empty(head: &dquot->dq_free)) |
329 | return; |
330 | list_del_init(entry: &dquot->dq_free); |
331 | if (!test_bit(DQ_RELEASING_B, &dquot->dq_flags)) |
332 | dqstats_dec(type: DQST_FREE_DQUOTS); |
333 | else |
334 | clear_bit(DQ_RELEASING_B, addr: &dquot->dq_flags); |
335 | } |
336 | |
337 | static inline void put_inuse(struct dquot *dquot) |
338 | { |
339 | /* We add to the back of inuse list so we don't have to restart |
340 | * when traversing this list and we block */ |
341 | list_add_tail(new: &dquot->dq_inuse, head: &inuse_list); |
342 | dqstats_inc(type: DQST_ALLOC_DQUOTS); |
343 | } |
344 | |
345 | static inline void remove_inuse(struct dquot *dquot) |
346 | { |
347 | dqstats_dec(type: DQST_ALLOC_DQUOTS); |
348 | list_del(entry: &dquot->dq_inuse); |
349 | } |
350 | /* |
351 | * End of list functions needing dq_list_lock |
352 | */ |
353 | |
354 | static void wait_on_dquot(struct dquot *dquot) |
355 | { |
356 | mutex_lock(&dquot->dq_lock); |
357 | mutex_unlock(lock: &dquot->dq_lock); |
358 | } |
359 | |
360 | static inline int dquot_active(struct dquot *dquot) |
361 | { |
362 | return test_bit(DQ_ACTIVE_B, &dquot->dq_flags); |
363 | } |
364 | |
365 | static inline int dquot_dirty(struct dquot *dquot) |
366 | { |
367 | return test_bit(DQ_MOD_B, &dquot->dq_flags); |
368 | } |
369 | |
370 | static inline int mark_dquot_dirty(struct dquot *dquot) |
371 | { |
372 | return dquot->dq_sb->dq_op->mark_dirty(dquot); |
373 | } |
374 | |
375 | /* Mark dquot dirty in atomic manner, and return it's old dirty flag state */ |
376 | int dquot_mark_dquot_dirty(struct dquot *dquot) |
377 | { |
378 | int ret = 1; |
379 | |
380 | if (!dquot_active(dquot)) |
381 | return 0; |
382 | |
383 | if (sb_dqopt(sb: dquot->dq_sb)->flags & DQUOT_NOLIST_DIRTY) |
384 | return test_and_set_bit(DQ_MOD_B, addr: &dquot->dq_flags); |
385 | |
386 | /* If quota is dirty already, we don't have to acquire dq_list_lock */ |
387 | if (dquot_dirty(dquot)) |
388 | return 1; |
389 | |
390 | spin_lock(lock: &dq_list_lock); |
391 | if (!test_and_set_bit(DQ_MOD_B, addr: &dquot->dq_flags)) { |
392 | list_add(new: &dquot->dq_dirty, head: &sb_dqopt(sb: dquot->dq_sb)-> |
393 | info[dquot->dq_id.type].dqi_dirty_list); |
394 | ret = 0; |
395 | } |
396 | spin_unlock(lock: &dq_list_lock); |
397 | return ret; |
398 | } |
399 | EXPORT_SYMBOL(dquot_mark_dquot_dirty); |
400 | |
401 | /* Dirtify all the dquots - this can block when journalling */ |
402 | static inline int mark_all_dquot_dirty(struct dquot * const *dquot) |
403 | { |
404 | int ret, err, cnt; |
405 | |
406 | ret = err = 0; |
407 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
408 | if (dquot[cnt]) |
409 | /* Even in case of error we have to continue */ |
410 | ret = mark_dquot_dirty(dquot: dquot[cnt]); |
411 | if (!err) |
412 | err = ret; |
413 | } |
414 | return err; |
415 | } |
416 | |
417 | static inline void dqput_all(struct dquot **dquot) |
418 | { |
419 | unsigned int cnt; |
420 | |
421 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
422 | dqput(dquot: dquot[cnt]); |
423 | } |
424 | |
425 | static inline int clear_dquot_dirty(struct dquot *dquot) |
426 | { |
427 | if (sb_dqopt(sb: dquot->dq_sb)->flags & DQUOT_NOLIST_DIRTY) |
428 | return test_and_clear_bit(DQ_MOD_B, addr: &dquot->dq_flags); |
429 | |
430 | spin_lock(lock: &dq_list_lock); |
431 | if (!test_and_clear_bit(DQ_MOD_B, addr: &dquot->dq_flags)) { |
432 | spin_unlock(lock: &dq_list_lock); |
433 | return 0; |
434 | } |
435 | list_del_init(entry: &dquot->dq_dirty); |
436 | spin_unlock(lock: &dq_list_lock); |
437 | return 1; |
438 | } |
439 | |
440 | void mark_info_dirty(struct super_block *sb, int type) |
441 | { |
442 | spin_lock(lock: &dq_data_lock); |
443 | sb_dqopt(sb)->info[type].dqi_flags |= DQF_INFO_DIRTY; |
444 | spin_unlock(lock: &dq_data_lock); |
445 | } |
446 | EXPORT_SYMBOL(mark_info_dirty); |
447 | |
448 | /* |
449 | * Read dquot from disk and alloc space for it |
450 | */ |
451 | |
452 | int dquot_acquire(struct dquot *dquot) |
453 | { |
454 | int ret = 0, ret2 = 0; |
455 | unsigned int memalloc; |
456 | struct quota_info *dqopt = sb_dqopt(sb: dquot->dq_sb); |
457 | |
458 | mutex_lock(&dquot->dq_lock); |
459 | memalloc = memalloc_nofs_save(); |
460 | if (!test_bit(DQ_READ_B, &dquot->dq_flags)) { |
461 | ret = dqopt->ops[dquot->dq_id.type]->read_dqblk(dquot); |
462 | if (ret < 0) |
463 | goto out_iolock; |
464 | } |
465 | /* Make sure flags update is visible after dquot has been filled */ |
466 | smp_mb__before_atomic(); |
467 | set_bit(DQ_READ_B, addr: &dquot->dq_flags); |
468 | /* Instantiate dquot if needed */ |
469 | if (!dquot_active(dquot) && !dquot->dq_off) { |
470 | ret = dqopt->ops[dquot->dq_id.type]->commit_dqblk(dquot); |
471 | /* Write the info if needed */ |
472 | if (info_dirty(info: &dqopt->info[dquot->dq_id.type])) { |
473 | ret2 = dqopt->ops[dquot->dq_id.type]->write_file_info( |
474 | dquot->dq_sb, dquot->dq_id.type); |
475 | } |
476 | if (ret < 0) |
477 | goto out_iolock; |
478 | if (ret2 < 0) { |
479 | ret = ret2; |
480 | goto out_iolock; |
481 | } |
482 | } |
483 | /* |
484 | * Make sure flags update is visible after on-disk struct has been |
485 | * allocated. Paired with smp_rmb() in dqget(). |
486 | */ |
487 | smp_mb__before_atomic(); |
488 | set_bit(DQ_ACTIVE_B, addr: &dquot->dq_flags); |
489 | out_iolock: |
490 | memalloc_nofs_restore(flags: memalloc); |
491 | mutex_unlock(lock: &dquot->dq_lock); |
492 | return ret; |
493 | } |
494 | EXPORT_SYMBOL(dquot_acquire); |
495 | |
496 | /* |
497 | * Write dquot to disk |
498 | */ |
499 | int dquot_commit(struct dquot *dquot) |
500 | { |
501 | int ret = 0; |
502 | unsigned int memalloc; |
503 | struct quota_info *dqopt = sb_dqopt(sb: dquot->dq_sb); |
504 | |
505 | mutex_lock(&dquot->dq_lock); |
506 | memalloc = memalloc_nofs_save(); |
507 | if (!clear_dquot_dirty(dquot)) |
508 | goto out_lock; |
509 | /* Inactive dquot can be only if there was error during read/init |
510 | * => we have better not writing it */ |
511 | if (dquot_active(dquot)) |
512 | ret = dqopt->ops[dquot->dq_id.type]->commit_dqblk(dquot); |
513 | else |
514 | ret = -EIO; |
515 | out_lock: |
516 | memalloc_nofs_restore(flags: memalloc); |
517 | mutex_unlock(lock: &dquot->dq_lock); |
518 | return ret; |
519 | } |
520 | EXPORT_SYMBOL(dquot_commit); |
521 | |
522 | /* |
523 | * Release dquot |
524 | */ |
525 | int dquot_release(struct dquot *dquot) |
526 | { |
527 | int ret = 0, ret2 = 0; |
528 | unsigned int memalloc; |
529 | struct quota_info *dqopt = sb_dqopt(sb: dquot->dq_sb); |
530 | |
531 | mutex_lock(&dquot->dq_lock); |
532 | memalloc = memalloc_nofs_save(); |
533 | /* Check whether we are not racing with some other dqget() */ |
534 | if (dquot_is_busy(dquot)) |
535 | goto out_dqlock; |
536 | if (dqopt->ops[dquot->dq_id.type]->release_dqblk) { |
537 | ret = dqopt->ops[dquot->dq_id.type]->release_dqblk(dquot); |
538 | /* Write the info */ |
539 | if (info_dirty(info: &dqopt->info[dquot->dq_id.type])) { |
540 | ret2 = dqopt->ops[dquot->dq_id.type]->write_file_info( |
541 | dquot->dq_sb, dquot->dq_id.type); |
542 | } |
543 | if (ret >= 0) |
544 | ret = ret2; |
545 | } |
546 | clear_bit(DQ_ACTIVE_B, addr: &dquot->dq_flags); |
547 | out_dqlock: |
548 | memalloc_nofs_restore(flags: memalloc); |
549 | mutex_unlock(lock: &dquot->dq_lock); |
550 | return ret; |
551 | } |
552 | EXPORT_SYMBOL(dquot_release); |
553 | |
554 | void dquot_destroy(struct dquot *dquot) |
555 | { |
556 | kmem_cache_free(s: dquot_cachep, objp: dquot); |
557 | } |
558 | EXPORT_SYMBOL(dquot_destroy); |
559 | |
560 | static inline void do_destroy_dquot(struct dquot *dquot) |
561 | { |
562 | dquot->dq_sb->dq_op->destroy_dquot(dquot); |
563 | } |
564 | |
565 | /* Invalidate all dquots on the list. Note that this function is called after |
566 | * quota is disabled and pointers from inodes removed so there cannot be new |
567 | * quota users. There can still be some users of quotas due to inodes being |
568 | * just deleted or pruned by prune_icache() (those are not attached to any |
569 | * list) or parallel quotactl call. We have to wait for such users. |
570 | */ |
571 | static void invalidate_dquots(struct super_block *sb, int type) |
572 | { |
573 | struct dquot *dquot, *tmp; |
574 | |
575 | restart: |
576 | flush_delayed_work(dwork: "a_release_work); |
577 | |
578 | spin_lock(lock: &dq_list_lock); |
579 | list_for_each_entry_safe(dquot, tmp, &inuse_list, dq_inuse) { |
580 | if (dquot->dq_sb != sb) |
581 | continue; |
582 | if (dquot->dq_id.type != type) |
583 | continue; |
584 | /* Wait for dquot users */ |
585 | if (atomic_read(v: &dquot->dq_count)) { |
586 | atomic_inc(v: &dquot->dq_count); |
587 | spin_unlock(lock: &dq_list_lock); |
588 | /* |
589 | * Once dqput() wakes us up, we know it's time to free |
590 | * the dquot. |
591 | * IMPORTANT: we rely on the fact that there is always |
592 | * at most one process waiting for dquot to free. |
593 | * Otherwise dq_count would be > 1 and we would never |
594 | * wake up. |
595 | */ |
596 | wait_event(dquot_ref_wq, |
597 | atomic_read(&dquot->dq_count) == 1); |
598 | dqput(dquot); |
599 | /* At this moment dquot() need not exist (it could be |
600 | * reclaimed by prune_dqcache(). Hence we must |
601 | * restart. */ |
602 | goto restart; |
603 | } |
604 | /* |
605 | * The last user already dropped its reference but dquot didn't |
606 | * get fully cleaned up yet. Restart the scan which flushes the |
607 | * work cleaning up released dquots. |
608 | */ |
609 | if (test_bit(DQ_RELEASING_B, &dquot->dq_flags)) { |
610 | spin_unlock(lock: &dq_list_lock); |
611 | goto restart; |
612 | } |
613 | /* |
614 | * Quota now has no users and it has been written on last |
615 | * dqput() |
616 | */ |
617 | remove_dquot_hash(dquot); |
618 | remove_free_dquot(dquot); |
619 | remove_inuse(dquot); |
620 | do_destroy_dquot(dquot); |
621 | } |
622 | spin_unlock(lock: &dq_list_lock); |
623 | } |
624 | |
625 | /* Call callback for every active dquot on given filesystem */ |
626 | int dquot_scan_active(struct super_block *sb, |
627 | int (*fn)(struct dquot *dquot, unsigned long priv), |
628 | unsigned long priv) |
629 | { |
630 | struct dquot *dquot, *old_dquot = NULL; |
631 | int ret = 0; |
632 | |
633 | WARN_ON_ONCE(!rwsem_is_locked(&sb->s_umount)); |
634 | |
635 | spin_lock(lock: &dq_list_lock); |
636 | list_for_each_entry(dquot, &inuse_list, dq_inuse) { |
637 | if (!dquot_active(dquot)) |
638 | continue; |
639 | if (dquot->dq_sb != sb) |
640 | continue; |
641 | /* Now we have active dquot so we can just increase use count */ |
642 | atomic_inc(v: &dquot->dq_count); |
643 | spin_unlock(lock: &dq_list_lock); |
644 | dqput(dquot: old_dquot); |
645 | old_dquot = dquot; |
646 | /* |
647 | * ->release_dquot() can be racing with us. Our reference |
648 | * protects us from new calls to it so just wait for any |
649 | * outstanding call and recheck the DQ_ACTIVE_B after that. |
650 | */ |
651 | wait_on_dquot(dquot); |
652 | if (dquot_active(dquot)) { |
653 | ret = fn(dquot, priv); |
654 | if (ret < 0) |
655 | goto out; |
656 | } |
657 | spin_lock(lock: &dq_list_lock); |
658 | /* We are safe to continue now because our dquot could not |
659 | * be moved out of the inuse list while we hold the reference */ |
660 | } |
661 | spin_unlock(lock: &dq_list_lock); |
662 | out: |
663 | dqput(dquot: old_dquot); |
664 | return ret; |
665 | } |
666 | EXPORT_SYMBOL(dquot_scan_active); |
667 | |
668 | static inline int dquot_write_dquot(struct dquot *dquot) |
669 | { |
670 | int ret = dquot->dq_sb->dq_op->write_dquot(dquot); |
671 | if (ret < 0) { |
672 | quota_error(dquot->dq_sb, "Can't write quota structure " |
673 | "(error %d). Quota may get out of sync!" , ret); |
674 | /* Clear dirty bit anyway to avoid infinite loop. */ |
675 | clear_dquot_dirty(dquot); |
676 | } |
677 | return ret; |
678 | } |
679 | |
680 | /* Write all dquot structures to quota files */ |
681 | int dquot_writeback_dquots(struct super_block *sb, int type) |
682 | { |
683 | struct list_head dirty; |
684 | struct dquot *dquot; |
685 | struct quota_info *dqopt = sb_dqopt(sb); |
686 | int cnt; |
687 | int err, ret = 0; |
688 | |
689 | WARN_ON_ONCE(!rwsem_is_locked(&sb->s_umount)); |
690 | |
691 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
692 | if (type != -1 && cnt != type) |
693 | continue; |
694 | if (!sb_has_quota_active(sb, type: cnt)) |
695 | continue; |
696 | spin_lock(lock: &dq_list_lock); |
697 | /* Move list away to avoid livelock. */ |
698 | list_replace_init(old: &dqopt->info[cnt].dqi_dirty_list, new: &dirty); |
699 | while (!list_empty(head: &dirty)) { |
700 | dquot = list_first_entry(&dirty, struct dquot, |
701 | dq_dirty); |
702 | |
703 | WARN_ON(!dquot_active(dquot)); |
704 | /* If the dquot is releasing we should not touch it */ |
705 | if (test_bit(DQ_RELEASING_B, &dquot->dq_flags)) { |
706 | spin_unlock(lock: &dq_list_lock); |
707 | flush_delayed_work(dwork: "a_release_work); |
708 | spin_lock(lock: &dq_list_lock); |
709 | continue; |
710 | } |
711 | |
712 | /* Now we have active dquot from which someone is |
713 | * holding reference so we can safely just increase |
714 | * use count */ |
715 | dqgrab(dquot); |
716 | spin_unlock(lock: &dq_list_lock); |
717 | err = dquot_write_dquot(dquot); |
718 | if (err && !ret) |
719 | ret = err; |
720 | dqput(dquot); |
721 | spin_lock(lock: &dq_list_lock); |
722 | } |
723 | spin_unlock(lock: &dq_list_lock); |
724 | } |
725 | |
726 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
727 | if ((cnt == type || type == -1) && sb_has_quota_active(sb, type: cnt) |
728 | && info_dirty(info: &dqopt->info[cnt])) |
729 | sb->dq_op->write_info(sb, cnt); |
730 | dqstats_inc(type: DQST_SYNCS); |
731 | |
732 | return ret; |
733 | } |
734 | EXPORT_SYMBOL(dquot_writeback_dquots); |
735 | |
736 | /* Write all dquot structures to disk and make them visible from userspace */ |
737 | int dquot_quota_sync(struct super_block *sb, int type) |
738 | { |
739 | struct quota_info *dqopt = sb_dqopt(sb); |
740 | int cnt; |
741 | int ret; |
742 | |
743 | ret = dquot_writeback_dquots(sb, type); |
744 | if (ret) |
745 | return ret; |
746 | if (dqopt->flags & DQUOT_QUOTA_SYS_FILE) |
747 | return 0; |
748 | |
749 | /* This is not very clever (and fast) but currently I don't know about |
750 | * any other simple way of getting quota data to disk and we must get |
751 | * them there for userspace to be visible... */ |
752 | if (sb->s_op->sync_fs) { |
753 | ret = sb->s_op->sync_fs(sb, 1); |
754 | if (ret) |
755 | return ret; |
756 | } |
757 | ret = sync_blockdev(bdev: sb->s_bdev); |
758 | if (ret) |
759 | return ret; |
760 | |
761 | /* |
762 | * Now when everything is written we can discard the pagecache so |
763 | * that userspace sees the changes. |
764 | */ |
765 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
766 | if (type != -1 && cnt != type) |
767 | continue; |
768 | if (!sb_has_quota_active(sb, type: cnt)) |
769 | continue; |
770 | inode_lock(inode: dqopt->files[cnt]); |
771 | truncate_inode_pages(&dqopt->files[cnt]->i_data, 0); |
772 | inode_unlock(inode: dqopt->files[cnt]); |
773 | } |
774 | |
775 | return 0; |
776 | } |
777 | EXPORT_SYMBOL(dquot_quota_sync); |
778 | |
779 | static unsigned long |
780 | dqcache_shrink_scan(struct shrinker *shrink, struct shrink_control *sc) |
781 | { |
782 | struct dquot *dquot; |
783 | unsigned long freed = 0; |
784 | |
785 | spin_lock(lock: &dq_list_lock); |
786 | while (!list_empty(head: &free_dquots) && sc->nr_to_scan) { |
787 | dquot = list_first_entry(&free_dquots, struct dquot, dq_free); |
788 | remove_dquot_hash(dquot); |
789 | remove_free_dquot(dquot); |
790 | remove_inuse(dquot); |
791 | do_destroy_dquot(dquot); |
792 | sc->nr_to_scan--; |
793 | freed++; |
794 | } |
795 | spin_unlock(lock: &dq_list_lock); |
796 | return freed; |
797 | } |
798 | |
799 | static unsigned long |
800 | dqcache_shrink_count(struct shrinker *shrink, struct shrink_control *sc) |
801 | { |
802 | return vfs_pressure_ratio( |
803 | val: percpu_counter_read_positive(fbc: &dqstats.counter[DQST_FREE_DQUOTS])); |
804 | } |
805 | |
806 | /* |
807 | * Safely release dquot and put reference to dquot. |
808 | */ |
809 | static void quota_release_workfn(struct work_struct *work) |
810 | { |
811 | struct dquot *dquot; |
812 | struct list_head rls_head; |
813 | |
814 | spin_lock(lock: &dq_list_lock); |
815 | /* Exchange the list head to avoid livelock. */ |
816 | list_replace_init(old: &releasing_dquots, new: &rls_head); |
817 | spin_unlock(lock: &dq_list_lock); |
818 | synchronize_srcu(ssp: &dquot_srcu); |
819 | |
820 | restart: |
821 | spin_lock(lock: &dq_list_lock); |
822 | while (!list_empty(head: &rls_head)) { |
823 | dquot = list_first_entry(&rls_head, struct dquot, dq_free); |
824 | WARN_ON_ONCE(atomic_read(&dquot->dq_count)); |
825 | /* |
826 | * Note that DQ_RELEASING_B protects us from racing with |
827 | * invalidate_dquots() calls so we are safe to work with the |
828 | * dquot even after we drop dq_list_lock. |
829 | */ |
830 | if (dquot_dirty(dquot)) { |
831 | spin_unlock(lock: &dq_list_lock); |
832 | /* Commit dquot before releasing */ |
833 | dquot_write_dquot(dquot); |
834 | goto restart; |
835 | } |
836 | if (dquot_active(dquot)) { |
837 | spin_unlock(lock: &dq_list_lock); |
838 | dquot->dq_sb->dq_op->release_dquot(dquot); |
839 | goto restart; |
840 | } |
841 | /* Dquot is inactive and clean, now move it to free list */ |
842 | remove_free_dquot(dquot); |
843 | put_dquot_last(dquot); |
844 | } |
845 | spin_unlock(lock: &dq_list_lock); |
846 | } |
847 | |
848 | /* |
849 | * Put reference to dquot |
850 | */ |
851 | void dqput(struct dquot *dquot) |
852 | { |
853 | if (!dquot) |
854 | return; |
855 | #ifdef CONFIG_QUOTA_DEBUG |
856 | if (!atomic_read(v: &dquot->dq_count)) { |
857 | quota_error(dquot->dq_sb, "trying to free free dquot of %s %d" , |
858 | quotatypes[dquot->dq_id.type], |
859 | from_kqid(&init_user_ns, dquot->dq_id)); |
860 | BUG(); |
861 | } |
862 | #endif |
863 | dqstats_inc(type: DQST_DROPS); |
864 | |
865 | spin_lock(lock: &dq_list_lock); |
866 | if (atomic_read(v: &dquot->dq_count) > 1) { |
867 | /* We have more than one user... nothing to do */ |
868 | atomic_dec(v: &dquot->dq_count); |
869 | /* Releasing dquot during quotaoff phase? */ |
870 | if (!sb_has_quota_active(sb: dquot->dq_sb, type: dquot->dq_id.type) && |
871 | atomic_read(v: &dquot->dq_count) == 1) |
872 | wake_up(&dquot_ref_wq); |
873 | spin_unlock(lock: &dq_list_lock); |
874 | return; |
875 | } |
876 | |
877 | /* Need to release dquot? */ |
878 | #ifdef CONFIG_QUOTA_DEBUG |
879 | /* sanity check */ |
880 | BUG_ON(!list_empty(&dquot->dq_free)); |
881 | #endif |
882 | put_releasing_dquots(dquot); |
883 | atomic_dec(v: &dquot->dq_count); |
884 | spin_unlock(lock: &dq_list_lock); |
885 | queue_delayed_work(wq: system_unbound_wq, dwork: "a_release_work, delay: 1); |
886 | } |
887 | EXPORT_SYMBOL(dqput); |
888 | |
889 | struct dquot *dquot_alloc(struct super_block *sb, int type) |
890 | { |
891 | return kmem_cache_zalloc(k: dquot_cachep, GFP_NOFS); |
892 | } |
893 | EXPORT_SYMBOL(dquot_alloc); |
894 | |
895 | static struct dquot *get_empty_dquot(struct super_block *sb, int type) |
896 | { |
897 | struct dquot *dquot; |
898 | |
899 | dquot = sb->dq_op->alloc_dquot(sb, type); |
900 | if(!dquot) |
901 | return NULL; |
902 | |
903 | mutex_init(&dquot->dq_lock); |
904 | INIT_LIST_HEAD(list: &dquot->dq_free); |
905 | INIT_LIST_HEAD(list: &dquot->dq_inuse); |
906 | INIT_HLIST_NODE(h: &dquot->dq_hash); |
907 | INIT_LIST_HEAD(list: &dquot->dq_dirty); |
908 | dquot->dq_sb = sb; |
909 | dquot->dq_id = make_kqid_invalid(type); |
910 | atomic_set(v: &dquot->dq_count, i: 1); |
911 | spin_lock_init(&dquot->dq_dqb_lock); |
912 | |
913 | return dquot; |
914 | } |
915 | |
916 | /* |
917 | * Get reference to dquot |
918 | * |
919 | * Locking is slightly tricky here. We are guarded from parallel quotaoff() |
920 | * destroying our dquot by: |
921 | * a) checking for quota flags under dq_list_lock and |
922 | * b) getting a reference to dquot before we release dq_list_lock |
923 | */ |
924 | struct dquot *dqget(struct super_block *sb, struct kqid qid) |
925 | { |
926 | unsigned int hashent = hashfn(sb, qid); |
927 | struct dquot *dquot, *empty = NULL; |
928 | |
929 | if (!qid_has_mapping(ns: sb->s_user_ns, qid)) |
930 | return ERR_PTR(error: -EINVAL); |
931 | |
932 | if (!sb_has_quota_active(sb, type: qid.type)) |
933 | return ERR_PTR(error: -ESRCH); |
934 | we_slept: |
935 | spin_lock(lock: &dq_list_lock); |
936 | spin_lock(lock: &dq_state_lock); |
937 | if (!sb_has_quota_active(sb, type: qid.type)) { |
938 | spin_unlock(lock: &dq_state_lock); |
939 | spin_unlock(lock: &dq_list_lock); |
940 | dquot = ERR_PTR(error: -ESRCH); |
941 | goto out; |
942 | } |
943 | spin_unlock(lock: &dq_state_lock); |
944 | |
945 | dquot = find_dquot(hashent, sb, qid); |
946 | if (!dquot) { |
947 | if (!empty) { |
948 | spin_unlock(lock: &dq_list_lock); |
949 | empty = get_empty_dquot(sb, type: qid.type); |
950 | if (!empty) |
951 | schedule(); /* Try to wait for a moment... */ |
952 | goto we_slept; |
953 | } |
954 | dquot = empty; |
955 | empty = NULL; |
956 | dquot->dq_id = qid; |
957 | /* all dquots go on the inuse_list */ |
958 | put_inuse(dquot); |
959 | /* hash it first so it can be found */ |
960 | insert_dquot_hash(dquot); |
961 | spin_unlock(lock: &dq_list_lock); |
962 | dqstats_inc(type: DQST_LOOKUPS); |
963 | } else { |
964 | if (!atomic_read(v: &dquot->dq_count)) |
965 | remove_free_dquot(dquot); |
966 | atomic_inc(v: &dquot->dq_count); |
967 | spin_unlock(lock: &dq_list_lock); |
968 | dqstats_inc(type: DQST_CACHE_HITS); |
969 | dqstats_inc(type: DQST_LOOKUPS); |
970 | } |
971 | /* Wait for dq_lock - after this we know that either dquot_release() is |
972 | * already finished or it will be canceled due to dq_count > 0 test */ |
973 | wait_on_dquot(dquot); |
974 | /* Read the dquot / allocate space in quota file */ |
975 | if (!dquot_active(dquot)) { |
976 | int err; |
977 | |
978 | err = sb->dq_op->acquire_dquot(dquot); |
979 | if (err < 0) { |
980 | dqput(dquot); |
981 | dquot = ERR_PTR(error: err); |
982 | goto out; |
983 | } |
984 | } |
985 | /* |
986 | * Make sure following reads see filled structure - paired with |
987 | * smp_mb__before_atomic() in dquot_acquire(). |
988 | */ |
989 | smp_rmb(); |
990 | #ifdef CONFIG_QUOTA_DEBUG |
991 | BUG_ON(!dquot->dq_sb); /* Has somebody invalidated entry under us? */ |
992 | #endif |
993 | out: |
994 | if (empty) |
995 | do_destroy_dquot(dquot: empty); |
996 | |
997 | return dquot; |
998 | } |
999 | EXPORT_SYMBOL(dqget); |
1000 | |
1001 | static inline struct dquot **i_dquot(struct inode *inode) |
1002 | { |
1003 | return inode->i_sb->s_op->get_dquots(inode); |
1004 | } |
1005 | |
1006 | static int dqinit_needed(struct inode *inode, int type) |
1007 | { |
1008 | struct dquot * const *dquots; |
1009 | int cnt; |
1010 | |
1011 | if (IS_NOQUOTA(inode)) |
1012 | return 0; |
1013 | |
1014 | dquots = i_dquot(inode); |
1015 | if (type != -1) |
1016 | return !dquots[type]; |
1017 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
1018 | if (!dquots[cnt]) |
1019 | return 1; |
1020 | return 0; |
1021 | } |
1022 | |
1023 | /* This routine is guarded by s_umount semaphore */ |
1024 | static int add_dquot_ref(struct super_block *sb, int type) |
1025 | { |
1026 | struct inode *inode, *old_inode = NULL; |
1027 | #ifdef CONFIG_QUOTA_DEBUG |
1028 | int reserved = 0; |
1029 | #endif |
1030 | int err = 0; |
1031 | |
1032 | spin_lock(lock: &sb->s_inode_list_lock); |
1033 | list_for_each_entry(inode, &sb->s_inodes, i_sb_list) { |
1034 | spin_lock(lock: &inode->i_lock); |
1035 | if ((inode->i_state & (I_FREEING|I_WILL_FREE|I_NEW)) || |
1036 | !atomic_read(v: &inode->i_writecount) || |
1037 | !dqinit_needed(inode, type)) { |
1038 | spin_unlock(lock: &inode->i_lock); |
1039 | continue; |
1040 | } |
1041 | __iget(inode); |
1042 | spin_unlock(lock: &inode->i_lock); |
1043 | spin_unlock(lock: &sb->s_inode_list_lock); |
1044 | |
1045 | #ifdef CONFIG_QUOTA_DEBUG |
1046 | if (unlikely(inode_get_rsv_space(inode) > 0)) |
1047 | reserved = 1; |
1048 | #endif |
1049 | iput(old_inode); |
1050 | err = __dquot_initialize(inode, type); |
1051 | if (err) { |
1052 | iput(inode); |
1053 | goto out; |
1054 | } |
1055 | |
1056 | /* |
1057 | * We hold a reference to 'inode' so it couldn't have been |
1058 | * removed from s_inodes list while we dropped the |
1059 | * s_inode_list_lock. We cannot iput the inode now as we can be |
1060 | * holding the last reference and we cannot iput it under |
1061 | * s_inode_list_lock. So we keep the reference and iput it |
1062 | * later. |
1063 | */ |
1064 | old_inode = inode; |
1065 | cond_resched(); |
1066 | spin_lock(lock: &sb->s_inode_list_lock); |
1067 | } |
1068 | spin_unlock(lock: &sb->s_inode_list_lock); |
1069 | iput(old_inode); |
1070 | out: |
1071 | #ifdef CONFIG_QUOTA_DEBUG |
1072 | if (reserved) { |
1073 | quota_error(sb, "Writes happened before quota was turned on " |
1074 | "thus quota information is probably inconsistent. " |
1075 | "Please run quotacheck(8)" ); |
1076 | } |
1077 | #endif |
1078 | return err; |
1079 | } |
1080 | |
1081 | static void remove_dquot_ref(struct super_block *sb, int type) |
1082 | { |
1083 | struct inode *inode; |
1084 | #ifdef CONFIG_QUOTA_DEBUG |
1085 | int reserved = 0; |
1086 | #endif |
1087 | |
1088 | spin_lock(lock: &sb->s_inode_list_lock); |
1089 | list_for_each_entry(inode, &sb->s_inodes, i_sb_list) { |
1090 | /* |
1091 | * We have to scan also I_NEW inodes because they can already |
1092 | * have quota pointer initialized. Luckily, we need to touch |
1093 | * only quota pointers and these have separate locking |
1094 | * (dq_data_lock). |
1095 | */ |
1096 | spin_lock(lock: &dq_data_lock); |
1097 | if (!IS_NOQUOTA(inode)) { |
1098 | struct dquot **dquots = i_dquot(inode); |
1099 | struct dquot *dquot = dquots[type]; |
1100 | |
1101 | #ifdef CONFIG_QUOTA_DEBUG |
1102 | if (unlikely(inode_get_rsv_space(inode) > 0)) |
1103 | reserved = 1; |
1104 | #endif |
1105 | dquots[type] = NULL; |
1106 | if (dquot) |
1107 | dqput(dquot); |
1108 | } |
1109 | spin_unlock(lock: &dq_data_lock); |
1110 | } |
1111 | spin_unlock(lock: &sb->s_inode_list_lock); |
1112 | #ifdef CONFIG_QUOTA_DEBUG |
1113 | if (reserved) { |
1114 | printk(KERN_WARNING "VFS (%s): Writes happened after quota" |
1115 | " was disabled thus quota information is probably " |
1116 | "inconsistent. Please run quotacheck(8).\n" , sb->s_id); |
1117 | } |
1118 | #endif |
1119 | } |
1120 | |
1121 | /* Gather all references from inodes and drop them */ |
1122 | static void drop_dquot_ref(struct super_block *sb, int type) |
1123 | { |
1124 | if (sb->dq_op) |
1125 | remove_dquot_ref(sb, type); |
1126 | } |
1127 | |
1128 | static inline |
1129 | void dquot_free_reserved_space(struct dquot *dquot, qsize_t number) |
1130 | { |
1131 | if (dquot->dq_dqb.dqb_rsvspace >= number) |
1132 | dquot->dq_dqb.dqb_rsvspace -= number; |
1133 | else { |
1134 | WARN_ON_ONCE(1); |
1135 | dquot->dq_dqb.dqb_rsvspace = 0; |
1136 | } |
1137 | if (dquot->dq_dqb.dqb_curspace + dquot->dq_dqb.dqb_rsvspace <= |
1138 | dquot->dq_dqb.dqb_bsoftlimit) |
1139 | dquot->dq_dqb.dqb_btime = (time64_t) 0; |
1140 | clear_bit(DQ_BLKS_B, addr: &dquot->dq_flags); |
1141 | } |
1142 | |
1143 | static void dquot_decr_inodes(struct dquot *dquot, qsize_t number) |
1144 | { |
1145 | if (sb_dqopt(sb: dquot->dq_sb)->flags & DQUOT_NEGATIVE_USAGE || |
1146 | dquot->dq_dqb.dqb_curinodes >= number) |
1147 | dquot->dq_dqb.dqb_curinodes -= number; |
1148 | else |
1149 | dquot->dq_dqb.dqb_curinodes = 0; |
1150 | if (dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit) |
1151 | dquot->dq_dqb.dqb_itime = (time64_t) 0; |
1152 | clear_bit(DQ_INODES_B, addr: &dquot->dq_flags); |
1153 | } |
1154 | |
1155 | static void dquot_decr_space(struct dquot *dquot, qsize_t number) |
1156 | { |
1157 | if (sb_dqopt(sb: dquot->dq_sb)->flags & DQUOT_NEGATIVE_USAGE || |
1158 | dquot->dq_dqb.dqb_curspace >= number) |
1159 | dquot->dq_dqb.dqb_curspace -= number; |
1160 | else |
1161 | dquot->dq_dqb.dqb_curspace = 0; |
1162 | if (dquot->dq_dqb.dqb_curspace + dquot->dq_dqb.dqb_rsvspace <= |
1163 | dquot->dq_dqb.dqb_bsoftlimit) |
1164 | dquot->dq_dqb.dqb_btime = (time64_t) 0; |
1165 | clear_bit(DQ_BLKS_B, addr: &dquot->dq_flags); |
1166 | } |
1167 | |
1168 | struct dquot_warn { |
1169 | struct super_block *w_sb; |
1170 | struct kqid w_dq_id; |
1171 | short w_type; |
1172 | }; |
1173 | |
1174 | static int warning_issued(struct dquot *dquot, const int warntype) |
1175 | { |
1176 | int flag = (warntype == QUOTA_NL_BHARDWARN || |
1177 | warntype == QUOTA_NL_BSOFTLONGWARN) ? DQ_BLKS_B : |
1178 | ((warntype == QUOTA_NL_IHARDWARN || |
1179 | warntype == QUOTA_NL_ISOFTLONGWARN) ? DQ_INODES_B : 0); |
1180 | |
1181 | if (!flag) |
1182 | return 0; |
1183 | return test_and_set_bit(nr: flag, addr: &dquot->dq_flags); |
1184 | } |
1185 | |
1186 | #ifdef CONFIG_PRINT_QUOTA_WARNING |
1187 | static int flag_print_warnings = 1; |
1188 | |
1189 | static int need_print_warning(struct dquot_warn *warn) |
1190 | { |
1191 | if (!flag_print_warnings) |
1192 | return 0; |
1193 | |
1194 | switch (warn->w_dq_id.type) { |
1195 | case USRQUOTA: |
1196 | return uid_eq(current_fsuid(), warn->w_dq_id.uid); |
1197 | case GRPQUOTA: |
1198 | return in_group_p(warn->w_dq_id.gid); |
1199 | case PRJQUOTA: |
1200 | return 1; |
1201 | } |
1202 | return 0; |
1203 | } |
1204 | |
1205 | /* Print warning to user which exceeded quota */ |
1206 | static void print_warning(struct dquot_warn *warn) |
1207 | { |
1208 | char *msg = NULL; |
1209 | struct tty_struct *tty; |
1210 | int warntype = warn->w_type; |
1211 | |
1212 | if (warntype == QUOTA_NL_IHARDBELOW || |
1213 | warntype == QUOTA_NL_ISOFTBELOW || |
1214 | warntype == QUOTA_NL_BHARDBELOW || |
1215 | warntype == QUOTA_NL_BSOFTBELOW || !need_print_warning(warn)) |
1216 | return; |
1217 | |
1218 | tty = get_current_tty(); |
1219 | if (!tty) |
1220 | return; |
1221 | tty_write_message(tty, warn->w_sb->s_id); |
1222 | if (warntype == QUOTA_NL_ISOFTWARN || warntype == QUOTA_NL_BSOFTWARN) |
1223 | tty_write_message(tty, ": warning, " ); |
1224 | else |
1225 | tty_write_message(tty, ": write failed, " ); |
1226 | tty_write_message(tty, quotatypes[warn->w_dq_id.type]); |
1227 | switch (warntype) { |
1228 | case QUOTA_NL_IHARDWARN: |
1229 | msg = " file limit reached.\r\n" ; |
1230 | break; |
1231 | case QUOTA_NL_ISOFTLONGWARN: |
1232 | msg = " file quota exceeded too long.\r\n" ; |
1233 | break; |
1234 | case QUOTA_NL_ISOFTWARN: |
1235 | msg = " file quota exceeded.\r\n" ; |
1236 | break; |
1237 | case QUOTA_NL_BHARDWARN: |
1238 | msg = " block limit reached.\r\n" ; |
1239 | break; |
1240 | case QUOTA_NL_BSOFTLONGWARN: |
1241 | msg = " block quota exceeded too long.\r\n" ; |
1242 | break; |
1243 | case QUOTA_NL_BSOFTWARN: |
1244 | msg = " block quota exceeded.\r\n" ; |
1245 | break; |
1246 | } |
1247 | tty_write_message(tty, msg); |
1248 | tty_kref_put(tty); |
1249 | } |
1250 | #endif |
1251 | |
1252 | static void prepare_warning(struct dquot_warn *warn, struct dquot *dquot, |
1253 | int warntype) |
1254 | { |
1255 | if (warning_issued(dquot, warntype)) |
1256 | return; |
1257 | warn->w_type = warntype; |
1258 | warn->w_sb = dquot->dq_sb; |
1259 | warn->w_dq_id = dquot->dq_id; |
1260 | } |
1261 | |
1262 | /* |
1263 | * Write warnings to the console and send warning messages over netlink. |
1264 | * |
1265 | * Note that this function can call into tty and networking code. |
1266 | */ |
1267 | static void flush_warnings(struct dquot_warn *warn) |
1268 | { |
1269 | int i; |
1270 | |
1271 | for (i = 0; i < MAXQUOTAS; i++) { |
1272 | if (warn[i].w_type == QUOTA_NL_NOWARN) |
1273 | continue; |
1274 | #ifdef CONFIG_PRINT_QUOTA_WARNING |
1275 | print_warning(&warn[i]); |
1276 | #endif |
1277 | quota_send_warning(qid: warn[i].w_dq_id, |
1278 | dev: warn[i].w_sb->s_dev, warntype: warn[i].w_type); |
1279 | } |
1280 | } |
1281 | |
1282 | static int ignore_hardlimit(struct dquot *dquot) |
1283 | { |
1284 | struct mem_dqinfo *info = &sb_dqopt(sb: dquot->dq_sb)->info[dquot->dq_id.type]; |
1285 | |
1286 | return capable(CAP_SYS_RESOURCE) && |
1287 | (info->dqi_format->qf_fmt_id != QFMT_VFS_OLD || |
1288 | !(info->dqi_flags & DQF_ROOT_SQUASH)); |
1289 | } |
1290 | |
1291 | static int dquot_add_inodes(struct dquot *dquot, qsize_t inodes, |
1292 | struct dquot_warn *warn) |
1293 | { |
1294 | qsize_t newinodes; |
1295 | int ret = 0; |
1296 | |
1297 | spin_lock(lock: &dquot->dq_dqb_lock); |
1298 | newinodes = dquot->dq_dqb.dqb_curinodes + inodes; |
1299 | if (!sb_has_quota_limits_enabled(sb: dquot->dq_sb, type: dquot->dq_id.type) || |
1300 | test_bit(DQ_FAKE_B, &dquot->dq_flags)) |
1301 | goto add; |
1302 | |
1303 | if (dquot->dq_dqb.dqb_ihardlimit && |
1304 | newinodes > dquot->dq_dqb.dqb_ihardlimit && |
1305 | !ignore_hardlimit(dquot)) { |
1306 | prepare_warning(warn, dquot, QUOTA_NL_IHARDWARN); |
1307 | ret = -EDQUOT; |
1308 | goto out; |
1309 | } |
1310 | |
1311 | if (dquot->dq_dqb.dqb_isoftlimit && |
1312 | newinodes > dquot->dq_dqb.dqb_isoftlimit && |
1313 | dquot->dq_dqb.dqb_itime && |
1314 | ktime_get_real_seconds() >= dquot->dq_dqb.dqb_itime && |
1315 | !ignore_hardlimit(dquot)) { |
1316 | prepare_warning(warn, dquot, QUOTA_NL_ISOFTLONGWARN); |
1317 | ret = -EDQUOT; |
1318 | goto out; |
1319 | } |
1320 | |
1321 | if (dquot->dq_dqb.dqb_isoftlimit && |
1322 | newinodes > dquot->dq_dqb.dqb_isoftlimit && |
1323 | dquot->dq_dqb.dqb_itime == 0) { |
1324 | prepare_warning(warn, dquot, QUOTA_NL_ISOFTWARN); |
1325 | dquot->dq_dqb.dqb_itime = ktime_get_real_seconds() + |
1326 | sb_dqopt(sb: dquot->dq_sb)->info[dquot->dq_id.type].dqi_igrace; |
1327 | } |
1328 | add: |
1329 | dquot->dq_dqb.dqb_curinodes = newinodes; |
1330 | |
1331 | out: |
1332 | spin_unlock(lock: &dquot->dq_dqb_lock); |
1333 | return ret; |
1334 | } |
1335 | |
1336 | static int dquot_add_space(struct dquot *dquot, qsize_t space, |
1337 | qsize_t rsv_space, unsigned int flags, |
1338 | struct dquot_warn *warn) |
1339 | { |
1340 | qsize_t tspace; |
1341 | struct super_block *sb = dquot->dq_sb; |
1342 | int ret = 0; |
1343 | |
1344 | spin_lock(lock: &dquot->dq_dqb_lock); |
1345 | if (!sb_has_quota_limits_enabled(sb, type: dquot->dq_id.type) || |
1346 | test_bit(DQ_FAKE_B, &dquot->dq_flags)) |
1347 | goto finish; |
1348 | |
1349 | tspace = dquot->dq_dqb.dqb_curspace + dquot->dq_dqb.dqb_rsvspace |
1350 | + space + rsv_space; |
1351 | |
1352 | if (dquot->dq_dqb.dqb_bhardlimit && |
1353 | tspace > dquot->dq_dqb.dqb_bhardlimit && |
1354 | !ignore_hardlimit(dquot)) { |
1355 | if (flags & DQUOT_SPACE_WARN) |
1356 | prepare_warning(warn, dquot, QUOTA_NL_BHARDWARN); |
1357 | ret = -EDQUOT; |
1358 | goto finish; |
1359 | } |
1360 | |
1361 | if (dquot->dq_dqb.dqb_bsoftlimit && |
1362 | tspace > dquot->dq_dqb.dqb_bsoftlimit && |
1363 | dquot->dq_dqb.dqb_btime && |
1364 | ktime_get_real_seconds() >= dquot->dq_dqb.dqb_btime && |
1365 | !ignore_hardlimit(dquot)) { |
1366 | if (flags & DQUOT_SPACE_WARN) |
1367 | prepare_warning(warn, dquot, QUOTA_NL_BSOFTLONGWARN); |
1368 | ret = -EDQUOT; |
1369 | goto finish; |
1370 | } |
1371 | |
1372 | if (dquot->dq_dqb.dqb_bsoftlimit && |
1373 | tspace > dquot->dq_dqb.dqb_bsoftlimit && |
1374 | dquot->dq_dqb.dqb_btime == 0) { |
1375 | if (flags & DQUOT_SPACE_WARN) { |
1376 | prepare_warning(warn, dquot, QUOTA_NL_BSOFTWARN); |
1377 | dquot->dq_dqb.dqb_btime = ktime_get_real_seconds() + |
1378 | sb_dqopt(sb)->info[dquot->dq_id.type].dqi_bgrace; |
1379 | } else { |
1380 | /* |
1381 | * We don't allow preallocation to exceed softlimit so exceeding will |
1382 | * be always printed |
1383 | */ |
1384 | ret = -EDQUOT; |
1385 | goto finish; |
1386 | } |
1387 | } |
1388 | finish: |
1389 | /* |
1390 | * We have to be careful and go through warning generation & grace time |
1391 | * setting even if DQUOT_SPACE_NOFAIL is set. That's why we check it |
1392 | * only here... |
1393 | */ |
1394 | if (flags & DQUOT_SPACE_NOFAIL) |
1395 | ret = 0; |
1396 | if (!ret) { |
1397 | dquot->dq_dqb.dqb_rsvspace += rsv_space; |
1398 | dquot->dq_dqb.dqb_curspace += space; |
1399 | } |
1400 | spin_unlock(lock: &dquot->dq_dqb_lock); |
1401 | return ret; |
1402 | } |
1403 | |
1404 | static int info_idq_free(struct dquot *dquot, qsize_t inodes) |
1405 | { |
1406 | qsize_t newinodes; |
1407 | |
1408 | if (test_bit(DQ_FAKE_B, &dquot->dq_flags) || |
1409 | dquot->dq_dqb.dqb_curinodes <= dquot->dq_dqb.dqb_isoftlimit || |
1410 | !sb_has_quota_limits_enabled(sb: dquot->dq_sb, type: dquot->dq_id.type)) |
1411 | return QUOTA_NL_NOWARN; |
1412 | |
1413 | newinodes = dquot->dq_dqb.dqb_curinodes - inodes; |
1414 | if (newinodes <= dquot->dq_dqb.dqb_isoftlimit) |
1415 | return QUOTA_NL_ISOFTBELOW; |
1416 | if (dquot->dq_dqb.dqb_curinodes >= dquot->dq_dqb.dqb_ihardlimit && |
1417 | newinodes < dquot->dq_dqb.dqb_ihardlimit) |
1418 | return QUOTA_NL_IHARDBELOW; |
1419 | return QUOTA_NL_NOWARN; |
1420 | } |
1421 | |
1422 | static int info_bdq_free(struct dquot *dquot, qsize_t space) |
1423 | { |
1424 | qsize_t tspace; |
1425 | |
1426 | tspace = dquot->dq_dqb.dqb_curspace + dquot->dq_dqb.dqb_rsvspace; |
1427 | |
1428 | if (test_bit(DQ_FAKE_B, &dquot->dq_flags) || |
1429 | tspace <= dquot->dq_dqb.dqb_bsoftlimit) |
1430 | return QUOTA_NL_NOWARN; |
1431 | |
1432 | if (tspace - space <= dquot->dq_dqb.dqb_bsoftlimit) |
1433 | return QUOTA_NL_BSOFTBELOW; |
1434 | if (tspace >= dquot->dq_dqb.dqb_bhardlimit && |
1435 | tspace - space < dquot->dq_dqb.dqb_bhardlimit) |
1436 | return QUOTA_NL_BHARDBELOW; |
1437 | return QUOTA_NL_NOWARN; |
1438 | } |
1439 | |
1440 | static int inode_quota_active(const struct inode *inode) |
1441 | { |
1442 | struct super_block *sb = inode->i_sb; |
1443 | |
1444 | if (IS_NOQUOTA(inode)) |
1445 | return 0; |
1446 | return sb_any_quota_loaded(sb) & ~sb_any_quota_suspended(sb); |
1447 | } |
1448 | |
1449 | /* |
1450 | * Initialize quota pointers in inode |
1451 | * |
1452 | * It is better to call this function outside of any transaction as it |
1453 | * might need a lot of space in journal for dquot structure allocation. |
1454 | */ |
1455 | static int __dquot_initialize(struct inode *inode, int type) |
1456 | { |
1457 | int cnt, init_needed = 0; |
1458 | struct dquot **dquots, *got[MAXQUOTAS] = {}; |
1459 | struct super_block *sb = inode->i_sb; |
1460 | qsize_t rsv; |
1461 | int ret = 0; |
1462 | |
1463 | if (!inode_quota_active(inode)) |
1464 | return 0; |
1465 | |
1466 | dquots = i_dquot(inode); |
1467 | |
1468 | /* First get references to structures we might need. */ |
1469 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1470 | struct kqid qid; |
1471 | kprojid_t projid; |
1472 | int rc; |
1473 | struct dquot *dquot; |
1474 | |
1475 | if (type != -1 && cnt != type) |
1476 | continue; |
1477 | /* |
1478 | * The i_dquot should have been initialized in most cases, |
1479 | * we check it without locking here to avoid unnecessary |
1480 | * dqget()/dqput() calls. |
1481 | */ |
1482 | if (dquots[cnt]) |
1483 | continue; |
1484 | |
1485 | if (!sb_has_quota_active(sb, type: cnt)) |
1486 | continue; |
1487 | |
1488 | init_needed = 1; |
1489 | |
1490 | switch (cnt) { |
1491 | case USRQUOTA: |
1492 | qid = make_kqid_uid(uid: inode->i_uid); |
1493 | break; |
1494 | case GRPQUOTA: |
1495 | qid = make_kqid_gid(gid: inode->i_gid); |
1496 | break; |
1497 | case PRJQUOTA: |
1498 | rc = inode->i_sb->dq_op->get_projid(inode, &projid); |
1499 | if (rc) |
1500 | continue; |
1501 | qid = make_kqid_projid(projid); |
1502 | break; |
1503 | } |
1504 | dquot = dqget(sb, qid); |
1505 | if (IS_ERR(ptr: dquot)) { |
1506 | /* We raced with somebody turning quotas off... */ |
1507 | if (PTR_ERR(ptr: dquot) != -ESRCH) { |
1508 | ret = PTR_ERR(ptr: dquot); |
1509 | goto out_put; |
1510 | } |
1511 | dquot = NULL; |
1512 | } |
1513 | got[cnt] = dquot; |
1514 | } |
1515 | |
1516 | /* All required i_dquot has been initialized */ |
1517 | if (!init_needed) |
1518 | return 0; |
1519 | |
1520 | spin_lock(lock: &dq_data_lock); |
1521 | if (IS_NOQUOTA(inode)) |
1522 | goto out_lock; |
1523 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1524 | if (type != -1 && cnt != type) |
1525 | continue; |
1526 | /* Avoid races with quotaoff() */ |
1527 | if (!sb_has_quota_active(sb, type: cnt)) |
1528 | continue; |
1529 | /* We could race with quotaon or dqget() could have failed */ |
1530 | if (!got[cnt]) |
1531 | continue; |
1532 | if (!dquots[cnt]) { |
1533 | dquots[cnt] = got[cnt]; |
1534 | got[cnt] = NULL; |
1535 | /* |
1536 | * Make quota reservation system happy if someone |
1537 | * did a write before quota was turned on |
1538 | */ |
1539 | rsv = inode_get_rsv_space(inode); |
1540 | if (unlikely(rsv)) { |
1541 | spin_lock(lock: &inode->i_lock); |
1542 | /* Get reservation again under proper lock */ |
1543 | rsv = __inode_get_rsv_space(inode); |
1544 | spin_lock(lock: &dquots[cnt]->dq_dqb_lock); |
1545 | dquots[cnt]->dq_dqb.dqb_rsvspace += rsv; |
1546 | spin_unlock(lock: &dquots[cnt]->dq_dqb_lock); |
1547 | spin_unlock(lock: &inode->i_lock); |
1548 | } |
1549 | } |
1550 | } |
1551 | out_lock: |
1552 | spin_unlock(lock: &dq_data_lock); |
1553 | out_put: |
1554 | /* Drop unused references */ |
1555 | dqput_all(dquot: got); |
1556 | |
1557 | return ret; |
1558 | } |
1559 | |
1560 | int dquot_initialize(struct inode *inode) |
1561 | { |
1562 | return __dquot_initialize(inode, type: -1); |
1563 | } |
1564 | EXPORT_SYMBOL(dquot_initialize); |
1565 | |
1566 | bool dquot_initialize_needed(struct inode *inode) |
1567 | { |
1568 | struct dquot **dquots; |
1569 | int i; |
1570 | |
1571 | if (!inode_quota_active(inode)) |
1572 | return false; |
1573 | |
1574 | dquots = i_dquot(inode); |
1575 | for (i = 0; i < MAXQUOTAS; i++) |
1576 | if (!dquots[i] && sb_has_quota_active(sb: inode->i_sb, type: i)) |
1577 | return true; |
1578 | return false; |
1579 | } |
1580 | EXPORT_SYMBOL(dquot_initialize_needed); |
1581 | |
1582 | /* |
1583 | * Release all quotas referenced by inode. |
1584 | * |
1585 | * This function only be called on inode free or converting |
1586 | * a file to quota file, no other users for the i_dquot in |
1587 | * both cases, so we needn't call synchronize_srcu() after |
1588 | * clearing i_dquot. |
1589 | */ |
1590 | static void __dquot_drop(struct inode *inode) |
1591 | { |
1592 | int cnt; |
1593 | struct dquot **dquots = i_dquot(inode); |
1594 | struct dquot *put[MAXQUOTAS]; |
1595 | |
1596 | spin_lock(lock: &dq_data_lock); |
1597 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1598 | put[cnt] = dquots[cnt]; |
1599 | dquots[cnt] = NULL; |
1600 | } |
1601 | spin_unlock(lock: &dq_data_lock); |
1602 | dqput_all(dquot: put); |
1603 | } |
1604 | |
1605 | void dquot_drop(struct inode *inode) |
1606 | { |
1607 | struct dquot * const *dquots; |
1608 | int cnt; |
1609 | |
1610 | if (IS_NOQUOTA(inode)) |
1611 | return; |
1612 | |
1613 | /* |
1614 | * Test before calling to rule out calls from proc and such |
1615 | * where we are not allowed to block. Note that this is |
1616 | * actually reliable test even without the lock - the caller |
1617 | * must assure that nobody can come after the DQUOT_DROP and |
1618 | * add quota pointers back anyway. |
1619 | */ |
1620 | dquots = i_dquot(inode); |
1621 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1622 | if (dquots[cnt]) |
1623 | break; |
1624 | } |
1625 | |
1626 | if (cnt < MAXQUOTAS) |
1627 | __dquot_drop(inode); |
1628 | } |
1629 | EXPORT_SYMBOL(dquot_drop); |
1630 | |
1631 | /* |
1632 | * inode_reserved_space is managed internally by quota, and protected by |
1633 | * i_lock similar to i_blocks+i_bytes. |
1634 | */ |
1635 | static qsize_t *inode_reserved_space(struct inode * inode) |
1636 | { |
1637 | /* Filesystem must explicitly define it's own method in order to use |
1638 | * quota reservation interface */ |
1639 | BUG_ON(!inode->i_sb->dq_op->get_reserved_space); |
1640 | return inode->i_sb->dq_op->get_reserved_space(inode); |
1641 | } |
1642 | |
1643 | static qsize_t __inode_get_rsv_space(struct inode *inode) |
1644 | { |
1645 | if (!inode->i_sb->dq_op->get_reserved_space) |
1646 | return 0; |
1647 | return *inode_reserved_space(inode); |
1648 | } |
1649 | |
1650 | static qsize_t inode_get_rsv_space(struct inode *inode) |
1651 | { |
1652 | qsize_t ret; |
1653 | |
1654 | if (!inode->i_sb->dq_op->get_reserved_space) |
1655 | return 0; |
1656 | spin_lock(lock: &inode->i_lock); |
1657 | ret = __inode_get_rsv_space(inode); |
1658 | spin_unlock(lock: &inode->i_lock); |
1659 | return ret; |
1660 | } |
1661 | |
1662 | /* |
1663 | * This functions updates i_blocks+i_bytes fields and quota information |
1664 | * (together with appropriate checks). |
1665 | * |
1666 | * NOTE: We absolutely rely on the fact that caller dirties the inode |
1667 | * (usually helpers in quotaops.h care about this) and holds a handle for |
1668 | * the current transaction so that dquot write and inode write go into the |
1669 | * same transaction. |
1670 | */ |
1671 | |
1672 | /* |
1673 | * This operation can block, but only after everything is updated |
1674 | */ |
1675 | int __dquot_alloc_space(struct inode *inode, qsize_t number, int flags) |
1676 | { |
1677 | int cnt, ret = 0, index; |
1678 | struct dquot_warn warn[MAXQUOTAS]; |
1679 | int reserve = flags & DQUOT_SPACE_RESERVE; |
1680 | struct dquot **dquots; |
1681 | |
1682 | if (!inode_quota_active(inode)) { |
1683 | if (reserve) { |
1684 | spin_lock(lock: &inode->i_lock); |
1685 | *inode_reserved_space(inode) += number; |
1686 | spin_unlock(lock: &inode->i_lock); |
1687 | } else { |
1688 | inode_add_bytes(inode, bytes: number); |
1689 | } |
1690 | goto out; |
1691 | } |
1692 | |
1693 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
1694 | warn[cnt].w_type = QUOTA_NL_NOWARN; |
1695 | |
1696 | dquots = i_dquot(inode); |
1697 | index = srcu_read_lock(ssp: &dquot_srcu); |
1698 | spin_lock(lock: &inode->i_lock); |
1699 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1700 | if (!dquots[cnt]) |
1701 | continue; |
1702 | if (reserve) { |
1703 | ret = dquot_add_space(dquot: dquots[cnt], space: 0, rsv_space: number, flags, |
1704 | warn: &warn[cnt]); |
1705 | } else { |
1706 | ret = dquot_add_space(dquot: dquots[cnt], space: number, rsv_space: 0, flags, |
1707 | warn: &warn[cnt]); |
1708 | } |
1709 | if (ret) { |
1710 | /* Back out changes we already did */ |
1711 | for (cnt--; cnt >= 0; cnt--) { |
1712 | if (!dquots[cnt]) |
1713 | continue; |
1714 | spin_lock(lock: &dquots[cnt]->dq_dqb_lock); |
1715 | if (reserve) |
1716 | dquot_free_reserved_space(dquot: dquots[cnt], |
1717 | number); |
1718 | else |
1719 | dquot_decr_space(dquot: dquots[cnt], number); |
1720 | spin_unlock(lock: &dquots[cnt]->dq_dqb_lock); |
1721 | } |
1722 | spin_unlock(lock: &inode->i_lock); |
1723 | goto out_flush_warn; |
1724 | } |
1725 | } |
1726 | if (reserve) |
1727 | *inode_reserved_space(inode) += number; |
1728 | else |
1729 | __inode_add_bytes(inode, bytes: number); |
1730 | spin_unlock(lock: &inode->i_lock); |
1731 | |
1732 | if (reserve) |
1733 | goto out_flush_warn; |
1734 | mark_all_dquot_dirty(dquot: dquots); |
1735 | out_flush_warn: |
1736 | srcu_read_unlock(ssp: &dquot_srcu, idx: index); |
1737 | flush_warnings(warn); |
1738 | out: |
1739 | return ret; |
1740 | } |
1741 | EXPORT_SYMBOL(__dquot_alloc_space); |
1742 | |
1743 | /* |
1744 | * This operation can block, but only after everything is updated |
1745 | */ |
1746 | int dquot_alloc_inode(struct inode *inode) |
1747 | { |
1748 | int cnt, ret = 0, index; |
1749 | struct dquot_warn warn[MAXQUOTAS]; |
1750 | struct dquot * const *dquots; |
1751 | |
1752 | if (!inode_quota_active(inode)) |
1753 | return 0; |
1754 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
1755 | warn[cnt].w_type = QUOTA_NL_NOWARN; |
1756 | |
1757 | dquots = i_dquot(inode); |
1758 | index = srcu_read_lock(ssp: &dquot_srcu); |
1759 | spin_lock(lock: &inode->i_lock); |
1760 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1761 | if (!dquots[cnt]) |
1762 | continue; |
1763 | ret = dquot_add_inodes(dquot: dquots[cnt], inodes: 1, warn: &warn[cnt]); |
1764 | if (ret) { |
1765 | for (cnt--; cnt >= 0; cnt--) { |
1766 | if (!dquots[cnt]) |
1767 | continue; |
1768 | /* Back out changes we already did */ |
1769 | spin_lock(lock: &dquots[cnt]->dq_dqb_lock); |
1770 | dquot_decr_inodes(dquot: dquots[cnt], number: 1); |
1771 | spin_unlock(lock: &dquots[cnt]->dq_dqb_lock); |
1772 | } |
1773 | goto warn_put_all; |
1774 | } |
1775 | } |
1776 | |
1777 | warn_put_all: |
1778 | spin_unlock(lock: &inode->i_lock); |
1779 | if (ret == 0) |
1780 | mark_all_dquot_dirty(dquot: dquots); |
1781 | srcu_read_unlock(ssp: &dquot_srcu, idx: index); |
1782 | flush_warnings(warn); |
1783 | return ret; |
1784 | } |
1785 | EXPORT_SYMBOL(dquot_alloc_inode); |
1786 | |
1787 | /* |
1788 | * Convert in-memory reserved quotas to real consumed quotas |
1789 | */ |
1790 | int dquot_claim_space_nodirty(struct inode *inode, qsize_t number) |
1791 | { |
1792 | struct dquot **dquots; |
1793 | int cnt, index; |
1794 | |
1795 | if (!inode_quota_active(inode)) { |
1796 | spin_lock(lock: &inode->i_lock); |
1797 | *inode_reserved_space(inode) -= number; |
1798 | __inode_add_bytes(inode, bytes: number); |
1799 | spin_unlock(lock: &inode->i_lock); |
1800 | return 0; |
1801 | } |
1802 | |
1803 | dquots = i_dquot(inode); |
1804 | index = srcu_read_lock(ssp: &dquot_srcu); |
1805 | spin_lock(lock: &inode->i_lock); |
1806 | /* Claim reserved quotas to allocated quotas */ |
1807 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1808 | if (dquots[cnt]) { |
1809 | struct dquot *dquot = dquots[cnt]; |
1810 | |
1811 | spin_lock(lock: &dquot->dq_dqb_lock); |
1812 | if (WARN_ON_ONCE(dquot->dq_dqb.dqb_rsvspace < number)) |
1813 | number = dquot->dq_dqb.dqb_rsvspace; |
1814 | dquot->dq_dqb.dqb_curspace += number; |
1815 | dquot->dq_dqb.dqb_rsvspace -= number; |
1816 | spin_unlock(lock: &dquot->dq_dqb_lock); |
1817 | } |
1818 | } |
1819 | /* Update inode bytes */ |
1820 | *inode_reserved_space(inode) -= number; |
1821 | __inode_add_bytes(inode, bytes: number); |
1822 | spin_unlock(lock: &inode->i_lock); |
1823 | mark_all_dquot_dirty(dquot: dquots); |
1824 | srcu_read_unlock(ssp: &dquot_srcu, idx: index); |
1825 | return 0; |
1826 | } |
1827 | EXPORT_SYMBOL(dquot_claim_space_nodirty); |
1828 | |
1829 | /* |
1830 | * Convert allocated space back to in-memory reserved quotas |
1831 | */ |
1832 | void dquot_reclaim_space_nodirty(struct inode *inode, qsize_t number) |
1833 | { |
1834 | struct dquot **dquots; |
1835 | int cnt, index; |
1836 | |
1837 | if (!inode_quota_active(inode)) { |
1838 | spin_lock(lock: &inode->i_lock); |
1839 | *inode_reserved_space(inode) += number; |
1840 | __inode_sub_bytes(inode, bytes: number); |
1841 | spin_unlock(lock: &inode->i_lock); |
1842 | return; |
1843 | } |
1844 | |
1845 | dquots = i_dquot(inode); |
1846 | index = srcu_read_lock(ssp: &dquot_srcu); |
1847 | spin_lock(lock: &inode->i_lock); |
1848 | /* Claim reserved quotas to allocated quotas */ |
1849 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1850 | if (dquots[cnt]) { |
1851 | struct dquot *dquot = dquots[cnt]; |
1852 | |
1853 | spin_lock(lock: &dquot->dq_dqb_lock); |
1854 | if (WARN_ON_ONCE(dquot->dq_dqb.dqb_curspace < number)) |
1855 | number = dquot->dq_dqb.dqb_curspace; |
1856 | dquot->dq_dqb.dqb_rsvspace += number; |
1857 | dquot->dq_dqb.dqb_curspace -= number; |
1858 | spin_unlock(lock: &dquot->dq_dqb_lock); |
1859 | } |
1860 | } |
1861 | /* Update inode bytes */ |
1862 | *inode_reserved_space(inode) += number; |
1863 | __inode_sub_bytes(inode, bytes: number); |
1864 | spin_unlock(lock: &inode->i_lock); |
1865 | mark_all_dquot_dirty(dquot: dquots); |
1866 | srcu_read_unlock(ssp: &dquot_srcu, idx: index); |
1867 | return; |
1868 | } |
1869 | EXPORT_SYMBOL(dquot_reclaim_space_nodirty); |
1870 | |
1871 | /* |
1872 | * This operation can block, but only after everything is updated |
1873 | */ |
1874 | void __dquot_free_space(struct inode *inode, qsize_t number, int flags) |
1875 | { |
1876 | unsigned int cnt; |
1877 | struct dquot_warn warn[MAXQUOTAS]; |
1878 | struct dquot **dquots; |
1879 | int reserve = flags & DQUOT_SPACE_RESERVE, index; |
1880 | |
1881 | if (!inode_quota_active(inode)) { |
1882 | if (reserve) { |
1883 | spin_lock(lock: &inode->i_lock); |
1884 | *inode_reserved_space(inode) -= number; |
1885 | spin_unlock(lock: &inode->i_lock); |
1886 | } else { |
1887 | inode_sub_bytes(inode, bytes: number); |
1888 | } |
1889 | return; |
1890 | } |
1891 | |
1892 | dquots = i_dquot(inode); |
1893 | index = srcu_read_lock(ssp: &dquot_srcu); |
1894 | spin_lock(lock: &inode->i_lock); |
1895 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1896 | int wtype; |
1897 | |
1898 | warn[cnt].w_type = QUOTA_NL_NOWARN; |
1899 | if (!dquots[cnt]) |
1900 | continue; |
1901 | spin_lock(lock: &dquots[cnt]->dq_dqb_lock); |
1902 | wtype = info_bdq_free(dquot: dquots[cnt], space: number); |
1903 | if (wtype != QUOTA_NL_NOWARN) |
1904 | prepare_warning(warn: &warn[cnt], dquot: dquots[cnt], warntype: wtype); |
1905 | if (reserve) |
1906 | dquot_free_reserved_space(dquot: dquots[cnt], number); |
1907 | else |
1908 | dquot_decr_space(dquot: dquots[cnt], number); |
1909 | spin_unlock(lock: &dquots[cnt]->dq_dqb_lock); |
1910 | } |
1911 | if (reserve) |
1912 | *inode_reserved_space(inode) -= number; |
1913 | else |
1914 | __inode_sub_bytes(inode, bytes: number); |
1915 | spin_unlock(lock: &inode->i_lock); |
1916 | |
1917 | if (reserve) |
1918 | goto out_unlock; |
1919 | mark_all_dquot_dirty(dquot: dquots); |
1920 | out_unlock: |
1921 | srcu_read_unlock(ssp: &dquot_srcu, idx: index); |
1922 | flush_warnings(warn); |
1923 | } |
1924 | EXPORT_SYMBOL(__dquot_free_space); |
1925 | |
1926 | /* |
1927 | * This operation can block, but only after everything is updated |
1928 | */ |
1929 | void dquot_free_inode(struct inode *inode) |
1930 | { |
1931 | unsigned int cnt; |
1932 | struct dquot_warn warn[MAXQUOTAS]; |
1933 | struct dquot * const *dquots; |
1934 | int index; |
1935 | |
1936 | if (!inode_quota_active(inode)) |
1937 | return; |
1938 | |
1939 | dquots = i_dquot(inode); |
1940 | index = srcu_read_lock(ssp: &dquot_srcu); |
1941 | spin_lock(lock: &inode->i_lock); |
1942 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1943 | int wtype; |
1944 | |
1945 | warn[cnt].w_type = QUOTA_NL_NOWARN; |
1946 | if (!dquots[cnt]) |
1947 | continue; |
1948 | spin_lock(lock: &dquots[cnt]->dq_dqb_lock); |
1949 | wtype = info_idq_free(dquot: dquots[cnt], inodes: 1); |
1950 | if (wtype != QUOTA_NL_NOWARN) |
1951 | prepare_warning(warn: &warn[cnt], dquot: dquots[cnt], warntype: wtype); |
1952 | dquot_decr_inodes(dquot: dquots[cnt], number: 1); |
1953 | spin_unlock(lock: &dquots[cnt]->dq_dqb_lock); |
1954 | } |
1955 | spin_unlock(lock: &inode->i_lock); |
1956 | mark_all_dquot_dirty(dquot: dquots); |
1957 | srcu_read_unlock(ssp: &dquot_srcu, idx: index); |
1958 | flush_warnings(warn); |
1959 | } |
1960 | EXPORT_SYMBOL(dquot_free_inode); |
1961 | |
1962 | /* |
1963 | * Transfer the number of inode and blocks from one diskquota to an other. |
1964 | * On success, dquot references in transfer_to are consumed and references |
1965 | * to original dquots that need to be released are placed there. On failure, |
1966 | * references are kept untouched. |
1967 | * |
1968 | * This operation can block, but only after everything is updated |
1969 | * A transaction must be started when entering this function. |
1970 | * |
1971 | * We are holding reference on transfer_from & transfer_to, no need to |
1972 | * protect them by srcu_read_lock(). |
1973 | */ |
1974 | int __dquot_transfer(struct inode *inode, struct dquot **transfer_to) |
1975 | { |
1976 | qsize_t cur_space; |
1977 | qsize_t rsv_space = 0; |
1978 | qsize_t inode_usage = 1; |
1979 | struct dquot *transfer_from[MAXQUOTAS] = {}; |
1980 | int cnt, ret = 0; |
1981 | char is_valid[MAXQUOTAS] = {}; |
1982 | struct dquot_warn warn_to[MAXQUOTAS]; |
1983 | struct dquot_warn warn_from_inodes[MAXQUOTAS]; |
1984 | struct dquot_warn warn_from_space[MAXQUOTAS]; |
1985 | |
1986 | if (IS_NOQUOTA(inode)) |
1987 | return 0; |
1988 | |
1989 | if (inode->i_sb->dq_op->get_inode_usage) { |
1990 | ret = inode->i_sb->dq_op->get_inode_usage(inode, &inode_usage); |
1991 | if (ret) |
1992 | return ret; |
1993 | } |
1994 | |
1995 | /* Initialize the arrays */ |
1996 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
1997 | warn_to[cnt].w_type = QUOTA_NL_NOWARN; |
1998 | warn_from_inodes[cnt].w_type = QUOTA_NL_NOWARN; |
1999 | warn_from_space[cnt].w_type = QUOTA_NL_NOWARN; |
2000 | } |
2001 | |
2002 | spin_lock(lock: &dq_data_lock); |
2003 | spin_lock(lock: &inode->i_lock); |
2004 | if (IS_NOQUOTA(inode)) { /* File without quota accounting? */ |
2005 | spin_unlock(lock: &inode->i_lock); |
2006 | spin_unlock(lock: &dq_data_lock); |
2007 | return 0; |
2008 | } |
2009 | cur_space = __inode_get_bytes(inode); |
2010 | rsv_space = __inode_get_rsv_space(inode); |
2011 | /* |
2012 | * Build the transfer_from list, check limits, and update usage in |
2013 | * the target structures. |
2014 | */ |
2015 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
2016 | /* |
2017 | * Skip changes for same uid or gid or for turned off quota-type. |
2018 | */ |
2019 | if (!transfer_to[cnt]) |
2020 | continue; |
2021 | /* Avoid races with quotaoff() */ |
2022 | if (!sb_has_quota_active(sb: inode->i_sb, type: cnt)) |
2023 | continue; |
2024 | is_valid[cnt] = 1; |
2025 | transfer_from[cnt] = i_dquot(inode)[cnt]; |
2026 | ret = dquot_add_inodes(dquot: transfer_to[cnt], inodes: inode_usage, |
2027 | warn: &warn_to[cnt]); |
2028 | if (ret) |
2029 | goto over_quota; |
2030 | ret = dquot_add_space(dquot: transfer_to[cnt], space: cur_space, rsv_space, |
2031 | DQUOT_SPACE_WARN, warn: &warn_to[cnt]); |
2032 | if (ret) { |
2033 | spin_lock(lock: &transfer_to[cnt]->dq_dqb_lock); |
2034 | dquot_decr_inodes(dquot: transfer_to[cnt], number: inode_usage); |
2035 | spin_unlock(lock: &transfer_to[cnt]->dq_dqb_lock); |
2036 | goto over_quota; |
2037 | } |
2038 | } |
2039 | |
2040 | /* Decrease usage for source structures and update quota pointers */ |
2041 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
2042 | if (!is_valid[cnt]) |
2043 | continue; |
2044 | /* Due to IO error we might not have transfer_from[] structure */ |
2045 | if (transfer_from[cnt]) { |
2046 | int wtype; |
2047 | |
2048 | spin_lock(lock: &transfer_from[cnt]->dq_dqb_lock); |
2049 | wtype = info_idq_free(dquot: transfer_from[cnt], inodes: inode_usage); |
2050 | if (wtype != QUOTA_NL_NOWARN) |
2051 | prepare_warning(warn: &warn_from_inodes[cnt], |
2052 | dquot: transfer_from[cnt], warntype: wtype); |
2053 | wtype = info_bdq_free(dquot: transfer_from[cnt], |
2054 | space: cur_space + rsv_space); |
2055 | if (wtype != QUOTA_NL_NOWARN) |
2056 | prepare_warning(warn: &warn_from_space[cnt], |
2057 | dquot: transfer_from[cnt], warntype: wtype); |
2058 | dquot_decr_inodes(dquot: transfer_from[cnt], number: inode_usage); |
2059 | dquot_decr_space(dquot: transfer_from[cnt], number: cur_space); |
2060 | dquot_free_reserved_space(dquot: transfer_from[cnt], |
2061 | number: rsv_space); |
2062 | spin_unlock(lock: &transfer_from[cnt]->dq_dqb_lock); |
2063 | } |
2064 | i_dquot(inode)[cnt] = transfer_to[cnt]; |
2065 | } |
2066 | spin_unlock(lock: &inode->i_lock); |
2067 | spin_unlock(lock: &dq_data_lock); |
2068 | |
2069 | mark_all_dquot_dirty(dquot: transfer_from); |
2070 | mark_all_dquot_dirty(dquot: transfer_to); |
2071 | flush_warnings(warn: warn_to); |
2072 | flush_warnings(warn: warn_from_inodes); |
2073 | flush_warnings(warn: warn_from_space); |
2074 | /* Pass back references to put */ |
2075 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
2076 | if (is_valid[cnt]) |
2077 | transfer_to[cnt] = transfer_from[cnt]; |
2078 | return 0; |
2079 | over_quota: |
2080 | /* Back out changes we already did */ |
2081 | for (cnt--; cnt >= 0; cnt--) { |
2082 | if (!is_valid[cnt]) |
2083 | continue; |
2084 | spin_lock(lock: &transfer_to[cnt]->dq_dqb_lock); |
2085 | dquot_decr_inodes(dquot: transfer_to[cnt], number: inode_usage); |
2086 | dquot_decr_space(dquot: transfer_to[cnt], number: cur_space); |
2087 | dquot_free_reserved_space(dquot: transfer_to[cnt], number: rsv_space); |
2088 | spin_unlock(lock: &transfer_to[cnt]->dq_dqb_lock); |
2089 | } |
2090 | spin_unlock(lock: &inode->i_lock); |
2091 | spin_unlock(lock: &dq_data_lock); |
2092 | flush_warnings(warn: warn_to); |
2093 | return ret; |
2094 | } |
2095 | EXPORT_SYMBOL(__dquot_transfer); |
2096 | |
2097 | /* Wrapper for transferring ownership of an inode for uid/gid only |
2098 | * Called from FSXXX_setattr() |
2099 | */ |
2100 | int dquot_transfer(struct mnt_idmap *idmap, struct inode *inode, |
2101 | struct iattr *iattr) |
2102 | { |
2103 | struct dquot *transfer_to[MAXQUOTAS] = {}; |
2104 | struct dquot *dquot; |
2105 | struct super_block *sb = inode->i_sb; |
2106 | int ret; |
2107 | |
2108 | if (!inode_quota_active(inode)) |
2109 | return 0; |
2110 | |
2111 | if (i_uid_needs_update(idmap, attr: iattr, inode)) { |
2112 | kuid_t kuid = from_vfsuid(idmap, fs_userns: i_user_ns(inode), |
2113 | vfsuid: iattr->ia_vfsuid); |
2114 | |
2115 | dquot = dqget(sb, make_kqid_uid(uid: kuid)); |
2116 | if (IS_ERR(ptr: dquot)) { |
2117 | if (PTR_ERR(ptr: dquot) != -ESRCH) { |
2118 | ret = PTR_ERR(ptr: dquot); |
2119 | goto out_put; |
2120 | } |
2121 | dquot = NULL; |
2122 | } |
2123 | transfer_to[USRQUOTA] = dquot; |
2124 | } |
2125 | if (i_gid_needs_update(idmap, attr: iattr, inode)) { |
2126 | kgid_t kgid = from_vfsgid(idmap, fs_userns: i_user_ns(inode), |
2127 | vfsgid: iattr->ia_vfsgid); |
2128 | |
2129 | dquot = dqget(sb, make_kqid_gid(gid: kgid)); |
2130 | if (IS_ERR(ptr: dquot)) { |
2131 | if (PTR_ERR(ptr: dquot) != -ESRCH) { |
2132 | ret = PTR_ERR(ptr: dquot); |
2133 | goto out_put; |
2134 | } |
2135 | dquot = NULL; |
2136 | } |
2137 | transfer_to[GRPQUOTA] = dquot; |
2138 | } |
2139 | ret = __dquot_transfer(inode, transfer_to); |
2140 | out_put: |
2141 | dqput_all(dquot: transfer_to); |
2142 | return ret; |
2143 | } |
2144 | EXPORT_SYMBOL(dquot_transfer); |
2145 | |
2146 | /* |
2147 | * Write info of quota file to disk |
2148 | */ |
2149 | int dquot_commit_info(struct super_block *sb, int type) |
2150 | { |
2151 | struct quota_info *dqopt = sb_dqopt(sb); |
2152 | |
2153 | return dqopt->ops[type]->write_file_info(sb, type); |
2154 | } |
2155 | EXPORT_SYMBOL(dquot_commit_info); |
2156 | |
2157 | int dquot_get_next_id(struct super_block *sb, struct kqid *qid) |
2158 | { |
2159 | struct quota_info *dqopt = sb_dqopt(sb); |
2160 | |
2161 | if (!sb_has_quota_active(sb, type: qid->type)) |
2162 | return -ESRCH; |
2163 | if (!dqopt->ops[qid->type]->get_next_id) |
2164 | return -ENOSYS; |
2165 | return dqopt->ops[qid->type]->get_next_id(sb, qid); |
2166 | } |
2167 | EXPORT_SYMBOL(dquot_get_next_id); |
2168 | |
2169 | /* |
2170 | * Definitions of diskquota operations. |
2171 | */ |
2172 | const struct dquot_operations dquot_operations = { |
2173 | .write_dquot = dquot_commit, |
2174 | .acquire_dquot = dquot_acquire, |
2175 | .release_dquot = dquot_release, |
2176 | .mark_dirty = dquot_mark_dquot_dirty, |
2177 | .write_info = dquot_commit_info, |
2178 | .alloc_dquot = dquot_alloc, |
2179 | .destroy_dquot = dquot_destroy, |
2180 | .get_next_id = dquot_get_next_id, |
2181 | }; |
2182 | EXPORT_SYMBOL(dquot_operations); |
2183 | |
2184 | /* |
2185 | * Generic helper for ->open on filesystems supporting disk quotas. |
2186 | */ |
2187 | int dquot_file_open(struct inode *inode, struct file *file) |
2188 | { |
2189 | int error; |
2190 | |
2191 | error = generic_file_open(inode, filp: file); |
2192 | if (!error && (file->f_mode & FMODE_WRITE)) |
2193 | error = dquot_initialize(inode); |
2194 | return error; |
2195 | } |
2196 | EXPORT_SYMBOL(dquot_file_open); |
2197 | |
2198 | static void vfs_cleanup_quota_inode(struct super_block *sb, int type) |
2199 | { |
2200 | struct quota_info *dqopt = sb_dqopt(sb); |
2201 | struct inode *inode = dqopt->files[type]; |
2202 | |
2203 | if (!inode) |
2204 | return; |
2205 | if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) { |
2206 | inode_lock(inode); |
2207 | inode->i_flags &= ~S_NOQUOTA; |
2208 | inode_unlock(inode); |
2209 | } |
2210 | dqopt->files[type] = NULL; |
2211 | iput(inode); |
2212 | } |
2213 | |
2214 | /* |
2215 | * Turn quota off on a device. type == -1 ==> quotaoff for all types (umount) |
2216 | */ |
2217 | int dquot_disable(struct super_block *sb, int type, unsigned int flags) |
2218 | { |
2219 | int cnt; |
2220 | struct quota_info *dqopt = sb_dqopt(sb); |
2221 | |
2222 | /* s_umount should be held in exclusive mode */ |
2223 | if (WARN_ON_ONCE(down_read_trylock(&sb->s_umount))) |
2224 | up_read(sem: &sb->s_umount); |
2225 | |
2226 | /* Cannot turn off usage accounting without turning off limits, or |
2227 | * suspend quotas and simultaneously turn quotas off. */ |
2228 | if ((flags & DQUOT_USAGE_ENABLED && !(flags & DQUOT_LIMITS_ENABLED)) |
2229 | || (flags & DQUOT_SUSPENDED && flags & (DQUOT_LIMITS_ENABLED | |
2230 | DQUOT_USAGE_ENABLED))) |
2231 | return -EINVAL; |
2232 | |
2233 | /* |
2234 | * Skip everything if there's nothing to do. We have to do this because |
2235 | * sometimes we are called when fill_super() failed and calling |
2236 | * sync_fs() in such cases does no good. |
2237 | */ |
2238 | if (!sb_any_quota_loaded(sb)) |
2239 | return 0; |
2240 | |
2241 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
2242 | if (type != -1 && cnt != type) |
2243 | continue; |
2244 | if (!sb_has_quota_loaded(sb, type: cnt)) |
2245 | continue; |
2246 | |
2247 | if (flags & DQUOT_SUSPENDED) { |
2248 | spin_lock(lock: &dq_state_lock); |
2249 | dqopt->flags |= |
2250 | dquot_state_flag(DQUOT_SUSPENDED, type: cnt); |
2251 | spin_unlock(lock: &dq_state_lock); |
2252 | } else { |
2253 | spin_lock(lock: &dq_state_lock); |
2254 | dqopt->flags &= ~dquot_state_flag(flags, type: cnt); |
2255 | /* Turning off suspended quotas? */ |
2256 | if (!sb_has_quota_loaded(sb, type: cnt) && |
2257 | sb_has_quota_suspended(sb, type: cnt)) { |
2258 | dqopt->flags &= ~dquot_state_flag( |
2259 | DQUOT_SUSPENDED, type: cnt); |
2260 | spin_unlock(lock: &dq_state_lock); |
2261 | vfs_cleanup_quota_inode(sb, type: cnt); |
2262 | continue; |
2263 | } |
2264 | spin_unlock(lock: &dq_state_lock); |
2265 | } |
2266 | |
2267 | /* We still have to keep quota loaded? */ |
2268 | if (sb_has_quota_loaded(sb, type: cnt) && !(flags & DQUOT_SUSPENDED)) |
2269 | continue; |
2270 | |
2271 | /* Note: these are blocking operations */ |
2272 | drop_dquot_ref(sb, type: cnt); |
2273 | invalidate_dquots(sb, type: cnt); |
2274 | /* |
2275 | * Now all dquots should be invalidated, all writes done so we |
2276 | * should be only users of the info. No locks needed. |
2277 | */ |
2278 | if (info_dirty(info: &dqopt->info[cnt])) |
2279 | sb->dq_op->write_info(sb, cnt); |
2280 | if (dqopt->ops[cnt]->free_file_info) |
2281 | dqopt->ops[cnt]->free_file_info(sb, cnt); |
2282 | put_quota_format(fmt: dqopt->info[cnt].dqi_format); |
2283 | dqopt->info[cnt].dqi_flags = 0; |
2284 | dqopt->info[cnt].dqi_igrace = 0; |
2285 | dqopt->info[cnt].dqi_bgrace = 0; |
2286 | dqopt->ops[cnt] = NULL; |
2287 | } |
2288 | |
2289 | /* Skip syncing and setting flags if quota files are hidden */ |
2290 | if (dqopt->flags & DQUOT_QUOTA_SYS_FILE) |
2291 | goto put_inodes; |
2292 | |
2293 | /* Sync the superblock so that buffers with quota data are written to |
2294 | * disk (and so userspace sees correct data afterwards). */ |
2295 | if (sb->s_op->sync_fs) |
2296 | sb->s_op->sync_fs(sb, 1); |
2297 | sync_blockdev(bdev: sb->s_bdev); |
2298 | /* Now the quota files are just ordinary files and we can set the |
2299 | * inode flags back. Moreover we discard the pagecache so that |
2300 | * userspace sees the writes we did bypassing the pagecache. We |
2301 | * must also discard the blockdev buffers so that we see the |
2302 | * changes done by userspace on the next quotaon() */ |
2303 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
2304 | if (!sb_has_quota_loaded(sb, type: cnt) && dqopt->files[cnt]) { |
2305 | inode_lock(inode: dqopt->files[cnt]); |
2306 | truncate_inode_pages(&dqopt->files[cnt]->i_data, 0); |
2307 | inode_unlock(inode: dqopt->files[cnt]); |
2308 | } |
2309 | if (sb->s_bdev) |
2310 | invalidate_bdev(bdev: sb->s_bdev); |
2311 | put_inodes: |
2312 | /* We are done when suspending quotas */ |
2313 | if (flags & DQUOT_SUSPENDED) |
2314 | return 0; |
2315 | |
2316 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) |
2317 | if (!sb_has_quota_loaded(sb, type: cnt)) |
2318 | vfs_cleanup_quota_inode(sb, type: cnt); |
2319 | return 0; |
2320 | } |
2321 | EXPORT_SYMBOL(dquot_disable); |
2322 | |
2323 | int dquot_quota_off(struct super_block *sb, int type) |
2324 | { |
2325 | return dquot_disable(sb, type, |
2326 | DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED); |
2327 | } |
2328 | EXPORT_SYMBOL(dquot_quota_off); |
2329 | |
2330 | /* |
2331 | * Turn quotas on on a device |
2332 | */ |
2333 | |
2334 | static int vfs_setup_quota_inode(struct inode *inode, int type) |
2335 | { |
2336 | struct super_block *sb = inode->i_sb; |
2337 | struct quota_info *dqopt = sb_dqopt(sb); |
2338 | |
2339 | if (is_bad_inode(inode)) |
2340 | return -EUCLEAN; |
2341 | if (!S_ISREG(inode->i_mode)) |
2342 | return -EACCES; |
2343 | if (IS_RDONLY(inode)) |
2344 | return -EROFS; |
2345 | if (sb_has_quota_loaded(sb, type)) |
2346 | return -EBUSY; |
2347 | |
2348 | /* |
2349 | * Quota files should never be encrypted. They should be thought of as |
2350 | * filesystem metadata, not user data. New-style internal quota files |
2351 | * cannot be encrypted by users anyway, but old-style external quota |
2352 | * files could potentially be incorrectly created in an encrypted |
2353 | * directory, hence this explicit check. Some reasons why encrypted |
2354 | * quota files don't work include: (1) some filesystems that support |
2355 | * encryption don't handle it in their quota_read and quota_write, and |
2356 | * (2) cleaning up encrypted quota files at unmount would need special |
2357 | * consideration, as quota files are cleaned up later than user files. |
2358 | */ |
2359 | if (IS_ENCRYPTED(inode)) |
2360 | return -EINVAL; |
2361 | |
2362 | dqopt->files[type] = igrab(inode); |
2363 | if (!dqopt->files[type]) |
2364 | return -EIO; |
2365 | if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) { |
2366 | /* We don't want quota and atime on quota files (deadlocks |
2367 | * possible) Also nobody should write to the file - we use |
2368 | * special IO operations which ignore the immutable bit. */ |
2369 | inode_lock(inode); |
2370 | inode->i_flags |= S_NOQUOTA; |
2371 | inode_unlock(inode); |
2372 | /* |
2373 | * When S_NOQUOTA is set, remove dquot references as no more |
2374 | * references can be added |
2375 | */ |
2376 | __dquot_drop(inode); |
2377 | } |
2378 | return 0; |
2379 | } |
2380 | |
2381 | int dquot_load_quota_sb(struct super_block *sb, int type, int format_id, |
2382 | unsigned int flags) |
2383 | { |
2384 | struct quota_format_type *fmt = find_quota_format(id: format_id); |
2385 | struct quota_info *dqopt = sb_dqopt(sb); |
2386 | int error; |
2387 | |
2388 | lockdep_assert_held_write(&sb->s_umount); |
2389 | |
2390 | /* Just unsuspend quotas? */ |
2391 | BUG_ON(flags & DQUOT_SUSPENDED); |
2392 | |
2393 | if (!fmt) |
2394 | return -ESRCH; |
2395 | if (!sb->dq_op || !sb->s_qcop || |
2396 | (type == PRJQUOTA && sb->dq_op->get_projid == NULL)) { |
2397 | error = -EINVAL; |
2398 | goto out_fmt; |
2399 | } |
2400 | /* Filesystems outside of init_user_ns not yet supported */ |
2401 | if (sb->s_user_ns != &init_user_ns) { |
2402 | error = -EINVAL; |
2403 | goto out_fmt; |
2404 | } |
2405 | /* Usage always has to be set... */ |
2406 | if (!(flags & DQUOT_USAGE_ENABLED)) { |
2407 | error = -EINVAL; |
2408 | goto out_fmt; |
2409 | } |
2410 | if (sb_has_quota_loaded(sb, type)) { |
2411 | error = -EBUSY; |
2412 | goto out_fmt; |
2413 | } |
2414 | |
2415 | if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) { |
2416 | /* As we bypass the pagecache we must now flush all the |
2417 | * dirty data and invalidate caches so that kernel sees |
2418 | * changes from userspace. It is not enough to just flush |
2419 | * the quota file since if blocksize < pagesize, invalidation |
2420 | * of the cache could fail because of other unrelated dirty |
2421 | * data */ |
2422 | sync_filesystem(sb); |
2423 | invalidate_bdev(bdev: sb->s_bdev); |
2424 | } |
2425 | |
2426 | error = -EINVAL; |
2427 | if (!fmt->qf_ops->check_quota_file(sb, type)) |
2428 | goto out_fmt; |
2429 | |
2430 | dqopt->ops[type] = fmt->qf_ops; |
2431 | dqopt->info[type].dqi_format = fmt; |
2432 | dqopt->info[type].dqi_fmt_id = format_id; |
2433 | INIT_LIST_HEAD(list: &dqopt->info[type].dqi_dirty_list); |
2434 | error = dqopt->ops[type]->read_file_info(sb, type); |
2435 | if (error < 0) |
2436 | goto out_fmt; |
2437 | if (dqopt->flags & DQUOT_QUOTA_SYS_FILE) { |
2438 | spin_lock(lock: &dq_data_lock); |
2439 | dqopt->info[type].dqi_flags |= DQF_SYS_FILE; |
2440 | spin_unlock(lock: &dq_data_lock); |
2441 | } |
2442 | spin_lock(lock: &dq_state_lock); |
2443 | dqopt->flags |= dquot_state_flag(flags, type); |
2444 | spin_unlock(lock: &dq_state_lock); |
2445 | |
2446 | error = add_dquot_ref(sb, type); |
2447 | if (error) |
2448 | dquot_disable(sb, type, |
2449 | DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED); |
2450 | |
2451 | return error; |
2452 | out_fmt: |
2453 | put_quota_format(fmt); |
2454 | |
2455 | return error; |
2456 | } |
2457 | EXPORT_SYMBOL(dquot_load_quota_sb); |
2458 | |
2459 | /* |
2460 | * More powerful function for turning on quotas on given quota inode allowing |
2461 | * setting of individual quota flags |
2462 | */ |
2463 | int dquot_load_quota_inode(struct inode *inode, int type, int format_id, |
2464 | unsigned int flags) |
2465 | { |
2466 | int err; |
2467 | |
2468 | err = vfs_setup_quota_inode(inode, type); |
2469 | if (err < 0) |
2470 | return err; |
2471 | err = dquot_load_quota_sb(inode->i_sb, type, format_id, flags); |
2472 | if (err < 0) |
2473 | vfs_cleanup_quota_inode(sb: inode->i_sb, type); |
2474 | return err; |
2475 | } |
2476 | EXPORT_SYMBOL(dquot_load_quota_inode); |
2477 | |
2478 | /* Reenable quotas on remount RW */ |
2479 | int dquot_resume(struct super_block *sb, int type) |
2480 | { |
2481 | struct quota_info *dqopt = sb_dqopt(sb); |
2482 | int ret = 0, cnt; |
2483 | unsigned int flags; |
2484 | |
2485 | /* s_umount should be held in exclusive mode */ |
2486 | if (WARN_ON_ONCE(down_read_trylock(&sb->s_umount))) |
2487 | up_read(sem: &sb->s_umount); |
2488 | |
2489 | for (cnt = 0; cnt < MAXQUOTAS; cnt++) { |
2490 | if (type != -1 && cnt != type) |
2491 | continue; |
2492 | if (!sb_has_quota_suspended(sb, type: cnt)) |
2493 | continue; |
2494 | |
2495 | spin_lock(lock: &dq_state_lock); |
2496 | flags = dqopt->flags & dquot_state_flag(DQUOT_USAGE_ENABLED | |
2497 | DQUOT_LIMITS_ENABLED, |
2498 | type: cnt); |
2499 | dqopt->flags &= ~dquot_state_flag(DQUOT_STATE_FLAGS, type: cnt); |
2500 | spin_unlock(lock: &dq_state_lock); |
2501 | |
2502 | flags = dquot_generic_flag(flags, type: cnt); |
2503 | ret = dquot_load_quota_sb(sb, cnt, dqopt->info[cnt].dqi_fmt_id, |
2504 | flags); |
2505 | if (ret < 0) |
2506 | vfs_cleanup_quota_inode(sb, type: cnt); |
2507 | } |
2508 | |
2509 | return ret; |
2510 | } |
2511 | EXPORT_SYMBOL(dquot_resume); |
2512 | |
2513 | int dquot_quota_on(struct super_block *sb, int type, int format_id, |
2514 | const struct path *path) |
2515 | { |
2516 | int error = security_quota_on(dentry: path->dentry); |
2517 | if (error) |
2518 | return error; |
2519 | /* Quota file not on the same filesystem? */ |
2520 | if (path->dentry->d_sb != sb) |
2521 | error = -EXDEV; |
2522 | else |
2523 | error = dquot_load_quota_inode(d_inode(dentry: path->dentry), type, |
2524 | format_id, DQUOT_USAGE_ENABLED | |
2525 | DQUOT_LIMITS_ENABLED); |
2526 | return error; |
2527 | } |
2528 | EXPORT_SYMBOL(dquot_quota_on); |
2529 | |
2530 | /* |
2531 | * This function is used when filesystem needs to initialize quotas |
2532 | * during mount time. |
2533 | */ |
2534 | int dquot_quota_on_mount(struct super_block *sb, char *qf_name, |
2535 | int format_id, int type) |
2536 | { |
2537 | struct dentry *dentry; |
2538 | int error; |
2539 | |
2540 | dentry = lookup_positive_unlocked(qf_name, sb->s_root, strlen(qf_name)); |
2541 | if (IS_ERR(ptr: dentry)) |
2542 | return PTR_ERR(ptr: dentry); |
2543 | |
2544 | error = security_quota_on(dentry); |
2545 | if (!error) |
2546 | error = dquot_load_quota_inode(d_inode(dentry), type, format_id, |
2547 | DQUOT_USAGE_ENABLED | DQUOT_LIMITS_ENABLED); |
2548 | |
2549 | dput(dentry); |
2550 | return error; |
2551 | } |
2552 | EXPORT_SYMBOL(dquot_quota_on_mount); |
2553 | |
2554 | static int dquot_quota_enable(struct super_block *sb, unsigned int flags) |
2555 | { |
2556 | int ret; |
2557 | int type; |
2558 | struct quota_info *dqopt = sb_dqopt(sb); |
2559 | |
2560 | if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) |
2561 | return -ENOSYS; |
2562 | /* Accounting cannot be turned on while fs is mounted */ |
2563 | flags &= ~(FS_QUOTA_UDQ_ACCT | FS_QUOTA_GDQ_ACCT | FS_QUOTA_PDQ_ACCT); |
2564 | if (!flags) |
2565 | return -EINVAL; |
2566 | for (type = 0; type < MAXQUOTAS; type++) { |
2567 | if (!(flags & qtype_enforce_flag(type))) |
2568 | continue; |
2569 | /* Can't enforce without accounting */ |
2570 | if (!sb_has_quota_usage_enabled(sb, type)) { |
2571 | ret = -EINVAL; |
2572 | goto out_err; |
2573 | } |
2574 | if (sb_has_quota_limits_enabled(sb, type)) { |
2575 | ret = -EBUSY; |
2576 | goto out_err; |
2577 | } |
2578 | spin_lock(lock: &dq_state_lock); |
2579 | dqopt->flags |= dquot_state_flag(DQUOT_LIMITS_ENABLED, type); |
2580 | spin_unlock(lock: &dq_state_lock); |
2581 | } |
2582 | return 0; |
2583 | out_err: |
2584 | /* Backout enforcement enablement we already did */ |
2585 | for (type--; type >= 0; type--) { |
2586 | if (flags & qtype_enforce_flag(type)) |
2587 | dquot_disable(sb, type, DQUOT_LIMITS_ENABLED); |
2588 | } |
2589 | /* Error code translation for better compatibility with XFS */ |
2590 | if (ret == -EBUSY) |
2591 | ret = -EEXIST; |
2592 | return ret; |
2593 | } |
2594 | |
2595 | static int dquot_quota_disable(struct super_block *sb, unsigned int flags) |
2596 | { |
2597 | int ret; |
2598 | int type; |
2599 | struct quota_info *dqopt = sb_dqopt(sb); |
2600 | |
2601 | if (!(dqopt->flags & DQUOT_QUOTA_SYS_FILE)) |
2602 | return -ENOSYS; |
2603 | /* |
2604 | * We don't support turning off accounting via quotactl. In principle |
2605 | * quota infrastructure can do this but filesystems don't expect |
2606 | * userspace to be able to do it. |
2607 | */ |
2608 | if (flags & |
2609 | (FS_QUOTA_UDQ_ACCT | FS_QUOTA_GDQ_ACCT | FS_QUOTA_PDQ_ACCT)) |
2610 | return -EOPNOTSUPP; |
2611 | |
2612 | /* Filter out limits not enabled */ |
2613 | for (type = 0; type < MAXQUOTAS; type++) |
2614 | if (!sb_has_quota_limits_enabled(sb, type)) |
2615 | flags &= ~qtype_enforce_flag(type); |
2616 | /* Nothing left? */ |
2617 | if (!flags) |
2618 | return -EEXIST; |
2619 | for (type = 0; type < MAXQUOTAS; type++) { |
2620 | if (flags & qtype_enforce_flag(type)) { |
2621 | ret = dquot_disable(sb, type, DQUOT_LIMITS_ENABLED); |
2622 | if (ret < 0) |
2623 | goto out_err; |
2624 | } |
2625 | } |
2626 | return 0; |
2627 | out_err: |
2628 | /* Backout enforcement disabling we already did */ |
2629 | for (type--; type >= 0; type--) { |
2630 | if (flags & qtype_enforce_flag(type)) { |
2631 | spin_lock(lock: &dq_state_lock); |
2632 | dqopt->flags |= |
2633 | dquot_state_flag(DQUOT_LIMITS_ENABLED, type); |
2634 | spin_unlock(lock: &dq_state_lock); |
2635 | } |
2636 | } |
2637 | return ret; |
2638 | } |
2639 | |
2640 | /* Generic routine for getting common part of quota structure */ |
2641 | static void do_get_dqblk(struct dquot *dquot, struct qc_dqblk *di) |
2642 | { |
2643 | struct mem_dqblk *dm = &dquot->dq_dqb; |
2644 | |
2645 | memset(di, 0, sizeof(*di)); |
2646 | spin_lock(lock: &dquot->dq_dqb_lock); |
2647 | di->d_spc_hardlimit = dm->dqb_bhardlimit; |
2648 | di->d_spc_softlimit = dm->dqb_bsoftlimit; |
2649 | di->d_ino_hardlimit = dm->dqb_ihardlimit; |
2650 | di->d_ino_softlimit = dm->dqb_isoftlimit; |
2651 | di->d_space = dm->dqb_curspace + dm->dqb_rsvspace; |
2652 | di->d_ino_count = dm->dqb_curinodes; |
2653 | di->d_spc_timer = dm->dqb_btime; |
2654 | di->d_ino_timer = dm->dqb_itime; |
2655 | spin_unlock(lock: &dquot->dq_dqb_lock); |
2656 | } |
2657 | |
2658 | int dquot_get_dqblk(struct super_block *sb, struct kqid qid, |
2659 | struct qc_dqblk *di) |
2660 | { |
2661 | struct dquot *dquot; |
2662 | |
2663 | dquot = dqget(sb, qid); |
2664 | if (IS_ERR(ptr: dquot)) |
2665 | return PTR_ERR(ptr: dquot); |
2666 | do_get_dqblk(dquot, di); |
2667 | dqput(dquot); |
2668 | |
2669 | return 0; |
2670 | } |
2671 | EXPORT_SYMBOL(dquot_get_dqblk); |
2672 | |
2673 | int dquot_get_next_dqblk(struct super_block *sb, struct kqid *qid, |
2674 | struct qc_dqblk *di) |
2675 | { |
2676 | struct dquot *dquot; |
2677 | int err; |
2678 | |
2679 | if (!sb->dq_op->get_next_id) |
2680 | return -ENOSYS; |
2681 | err = sb->dq_op->get_next_id(sb, qid); |
2682 | if (err < 0) |
2683 | return err; |
2684 | dquot = dqget(sb, *qid); |
2685 | if (IS_ERR(ptr: dquot)) |
2686 | return PTR_ERR(ptr: dquot); |
2687 | do_get_dqblk(dquot, di); |
2688 | dqput(dquot); |
2689 | |
2690 | return 0; |
2691 | } |
2692 | EXPORT_SYMBOL(dquot_get_next_dqblk); |
2693 | |
2694 | #define VFS_QC_MASK \ |
2695 | (QC_SPACE | QC_SPC_SOFT | QC_SPC_HARD | \ |
2696 | QC_INO_COUNT | QC_INO_SOFT | QC_INO_HARD | \ |
2697 | QC_SPC_TIMER | QC_INO_TIMER) |
2698 | |
2699 | /* Generic routine for setting common part of quota structure */ |
2700 | static int do_set_dqblk(struct dquot *dquot, struct qc_dqblk *di) |
2701 | { |
2702 | struct mem_dqblk *dm = &dquot->dq_dqb; |
2703 | int check_blim = 0, check_ilim = 0; |
2704 | struct mem_dqinfo *dqi = &sb_dqopt(sb: dquot->dq_sb)->info[dquot->dq_id.type]; |
2705 | |
2706 | if (di->d_fieldmask & ~VFS_QC_MASK) |
2707 | return -EINVAL; |
2708 | |
2709 | if (((di->d_fieldmask & QC_SPC_SOFT) && |
2710 | di->d_spc_softlimit > dqi->dqi_max_spc_limit) || |
2711 | ((di->d_fieldmask & QC_SPC_HARD) && |
2712 | di->d_spc_hardlimit > dqi->dqi_max_spc_limit) || |
2713 | ((di->d_fieldmask & QC_INO_SOFT) && |
2714 | (di->d_ino_softlimit > dqi->dqi_max_ino_limit)) || |
2715 | ((di->d_fieldmask & QC_INO_HARD) && |
2716 | (di->d_ino_hardlimit > dqi->dqi_max_ino_limit))) |
2717 | return -ERANGE; |
2718 | |
2719 | spin_lock(lock: &dquot->dq_dqb_lock); |
2720 | if (di->d_fieldmask & QC_SPACE) { |
2721 | dm->dqb_curspace = di->d_space - dm->dqb_rsvspace; |
2722 | check_blim = 1; |
2723 | set_bit(DQ_LASTSET_B + QIF_SPACE_B, addr: &dquot->dq_flags); |
2724 | } |
2725 | |
2726 | if (di->d_fieldmask & QC_SPC_SOFT) |
2727 | dm->dqb_bsoftlimit = di->d_spc_softlimit; |
2728 | if (di->d_fieldmask & QC_SPC_HARD) |
2729 | dm->dqb_bhardlimit = di->d_spc_hardlimit; |
2730 | if (di->d_fieldmask & (QC_SPC_SOFT | QC_SPC_HARD)) { |
2731 | check_blim = 1; |
2732 | set_bit(DQ_LASTSET_B + QIF_BLIMITS_B, addr: &dquot->dq_flags); |
2733 | } |
2734 | |
2735 | if (di->d_fieldmask & QC_INO_COUNT) { |
2736 | dm->dqb_curinodes = di->d_ino_count; |
2737 | check_ilim = 1; |
2738 | set_bit(DQ_LASTSET_B + QIF_INODES_B, addr: &dquot->dq_flags); |
2739 | } |
2740 | |
2741 | if (di->d_fieldmask & QC_INO_SOFT) |
2742 | dm->dqb_isoftlimit = di->d_ino_softlimit; |
2743 | if (di->d_fieldmask & QC_INO_HARD) |
2744 | dm->dqb_ihardlimit = di->d_ino_hardlimit; |
2745 | if (di->d_fieldmask & (QC_INO_SOFT | QC_INO_HARD)) { |
2746 | check_ilim = 1; |
2747 | set_bit(DQ_LASTSET_B + QIF_ILIMITS_B, addr: &dquot->dq_flags); |
2748 | } |
2749 | |
2750 | if (di->d_fieldmask & QC_SPC_TIMER) { |
2751 | dm->dqb_btime = di->d_spc_timer; |
2752 | check_blim = 1; |
2753 | set_bit(DQ_LASTSET_B + QIF_BTIME_B, addr: &dquot->dq_flags); |
2754 | } |
2755 | |
2756 | if (di->d_fieldmask & QC_INO_TIMER) { |
2757 | dm->dqb_itime = di->d_ino_timer; |
2758 | check_ilim = 1; |
2759 | set_bit(DQ_LASTSET_B + QIF_ITIME_B, addr: &dquot->dq_flags); |
2760 | } |
2761 | |
2762 | if (check_blim) { |
2763 | if (!dm->dqb_bsoftlimit || |
2764 | dm->dqb_curspace + dm->dqb_rsvspace <= dm->dqb_bsoftlimit) { |
2765 | dm->dqb_btime = 0; |
2766 | clear_bit(DQ_BLKS_B, addr: &dquot->dq_flags); |
2767 | } else if (!(di->d_fieldmask & QC_SPC_TIMER)) |
2768 | /* Set grace only if user hasn't provided his own... */ |
2769 | dm->dqb_btime = ktime_get_real_seconds() + dqi->dqi_bgrace; |
2770 | } |
2771 | if (check_ilim) { |
2772 | if (!dm->dqb_isoftlimit || |
2773 | dm->dqb_curinodes <= dm->dqb_isoftlimit) { |
2774 | dm->dqb_itime = 0; |
2775 | clear_bit(DQ_INODES_B, addr: &dquot->dq_flags); |
2776 | } else if (!(di->d_fieldmask & QC_INO_TIMER)) |
2777 | /* Set grace only if user hasn't provided his own... */ |
2778 | dm->dqb_itime = ktime_get_real_seconds() + dqi->dqi_igrace; |
2779 | } |
2780 | if (dm->dqb_bhardlimit || dm->dqb_bsoftlimit || dm->dqb_ihardlimit || |
2781 | dm->dqb_isoftlimit) |
2782 | clear_bit(DQ_FAKE_B, addr: &dquot->dq_flags); |
2783 | else |
2784 | set_bit(DQ_FAKE_B, addr: &dquot->dq_flags); |
2785 | spin_unlock(lock: &dquot->dq_dqb_lock); |
2786 | mark_dquot_dirty(dquot); |
2787 | |
2788 | return 0; |
2789 | } |
2790 | |
2791 | int dquot_set_dqblk(struct super_block *sb, struct kqid qid, |
2792 | struct qc_dqblk *di) |
2793 | { |
2794 | struct dquot *dquot; |
2795 | int rc; |
2796 | |
2797 | dquot = dqget(sb, qid); |
2798 | if (IS_ERR(ptr: dquot)) { |
2799 | rc = PTR_ERR(ptr: dquot); |
2800 | goto out; |
2801 | } |
2802 | rc = do_set_dqblk(dquot, di); |
2803 | dqput(dquot); |
2804 | out: |
2805 | return rc; |
2806 | } |
2807 | EXPORT_SYMBOL(dquot_set_dqblk); |
2808 | |
2809 | /* Generic routine for getting common part of quota file information */ |
2810 | int dquot_get_state(struct super_block *sb, struct qc_state *state) |
2811 | { |
2812 | struct mem_dqinfo *mi; |
2813 | struct qc_type_state *tstate; |
2814 | struct quota_info *dqopt = sb_dqopt(sb); |
2815 | int type; |
2816 | |
2817 | memset(state, 0, sizeof(*state)); |
2818 | for (type = 0; type < MAXQUOTAS; type++) { |
2819 | if (!sb_has_quota_active(sb, type)) |
2820 | continue; |
2821 | tstate = state->s_state + type; |
2822 | mi = sb_dqopt(sb)->info + type; |
2823 | tstate->flags = QCI_ACCT_ENABLED; |
2824 | spin_lock(lock: &dq_data_lock); |
2825 | if (mi->dqi_flags & DQF_SYS_FILE) |
2826 | tstate->flags |= QCI_SYSFILE; |
2827 | if (mi->dqi_flags & DQF_ROOT_SQUASH) |
2828 | tstate->flags |= QCI_ROOT_SQUASH; |
2829 | if (sb_has_quota_limits_enabled(sb, type)) |
2830 | tstate->flags |= QCI_LIMITS_ENFORCED; |
2831 | tstate->spc_timelimit = mi->dqi_bgrace; |
2832 | tstate->ino_timelimit = mi->dqi_igrace; |
2833 | if (dqopt->files[type]) { |
2834 | tstate->ino = dqopt->files[type]->i_ino; |
2835 | tstate->blocks = dqopt->files[type]->i_blocks; |
2836 | } |
2837 | tstate->nextents = 1; /* We don't know... */ |
2838 | spin_unlock(lock: &dq_data_lock); |
2839 | } |
2840 | return 0; |
2841 | } |
2842 | EXPORT_SYMBOL(dquot_get_state); |
2843 | |
2844 | /* Generic routine for setting common part of quota file information */ |
2845 | int dquot_set_dqinfo(struct super_block *sb, int type, struct qc_info *ii) |
2846 | { |
2847 | struct mem_dqinfo *mi; |
2848 | |
2849 | if ((ii->i_fieldmask & QC_WARNS_MASK) || |
2850 | (ii->i_fieldmask & QC_RT_SPC_TIMER)) |
2851 | return -EINVAL; |
2852 | if (!sb_has_quota_active(sb, type)) |
2853 | return -ESRCH; |
2854 | mi = sb_dqopt(sb)->info + type; |
2855 | if (ii->i_fieldmask & QC_FLAGS) { |
2856 | if ((ii->i_flags & QCI_ROOT_SQUASH && |
2857 | mi->dqi_format->qf_fmt_id != QFMT_VFS_OLD)) |
2858 | return -EINVAL; |
2859 | } |
2860 | spin_lock(lock: &dq_data_lock); |
2861 | if (ii->i_fieldmask & QC_SPC_TIMER) |
2862 | mi->dqi_bgrace = ii->i_spc_timelimit; |
2863 | if (ii->i_fieldmask & QC_INO_TIMER) |
2864 | mi->dqi_igrace = ii->i_ino_timelimit; |
2865 | if (ii->i_fieldmask & QC_FLAGS) { |
2866 | if (ii->i_flags & QCI_ROOT_SQUASH) |
2867 | mi->dqi_flags |= DQF_ROOT_SQUASH; |
2868 | else |
2869 | mi->dqi_flags &= ~DQF_ROOT_SQUASH; |
2870 | } |
2871 | spin_unlock(lock: &dq_data_lock); |
2872 | mark_info_dirty(sb, type); |
2873 | /* Force write to disk */ |
2874 | return sb->dq_op->write_info(sb, type); |
2875 | } |
2876 | EXPORT_SYMBOL(dquot_set_dqinfo); |
2877 | |
2878 | const struct quotactl_ops dquot_quotactl_sysfile_ops = { |
2879 | .quota_enable = dquot_quota_enable, |
2880 | .quota_disable = dquot_quota_disable, |
2881 | .quota_sync = dquot_quota_sync, |
2882 | .get_state = dquot_get_state, |
2883 | .set_info = dquot_set_dqinfo, |
2884 | .get_dqblk = dquot_get_dqblk, |
2885 | .get_nextdqblk = dquot_get_next_dqblk, |
2886 | .set_dqblk = dquot_set_dqblk |
2887 | }; |
2888 | EXPORT_SYMBOL(dquot_quotactl_sysfile_ops); |
2889 | |
2890 | static int do_proc_dqstats(struct ctl_table *table, int write, |
2891 | void *buffer, size_t *lenp, loff_t *ppos) |
2892 | { |
2893 | unsigned int type = (unsigned long *)table->data - dqstats.stat; |
2894 | s64 value = percpu_counter_sum(fbc: &dqstats.counter[type]); |
2895 | |
2896 | /* Filter negative values for non-monotonic counters */ |
2897 | if (value < 0 && (type == DQST_ALLOC_DQUOTS || |
2898 | type == DQST_FREE_DQUOTS)) |
2899 | value = 0; |
2900 | |
2901 | /* Update global table */ |
2902 | dqstats.stat[type] = value; |
2903 | return proc_doulongvec_minmax(table, write, buffer, lenp, ppos); |
2904 | } |
2905 | |
2906 | static struct ctl_table fs_dqstats_table[] = { |
2907 | { |
2908 | .procname = "lookups" , |
2909 | .data = &dqstats.stat[DQST_LOOKUPS], |
2910 | .maxlen = sizeof(unsigned long), |
2911 | .mode = 0444, |
2912 | .proc_handler = do_proc_dqstats, |
2913 | }, |
2914 | { |
2915 | .procname = "drops" , |
2916 | .data = &dqstats.stat[DQST_DROPS], |
2917 | .maxlen = sizeof(unsigned long), |
2918 | .mode = 0444, |
2919 | .proc_handler = do_proc_dqstats, |
2920 | }, |
2921 | { |
2922 | .procname = "reads" , |
2923 | .data = &dqstats.stat[DQST_READS], |
2924 | .maxlen = sizeof(unsigned long), |
2925 | .mode = 0444, |
2926 | .proc_handler = do_proc_dqstats, |
2927 | }, |
2928 | { |
2929 | .procname = "writes" , |
2930 | .data = &dqstats.stat[DQST_WRITES], |
2931 | .maxlen = sizeof(unsigned long), |
2932 | .mode = 0444, |
2933 | .proc_handler = do_proc_dqstats, |
2934 | }, |
2935 | { |
2936 | .procname = "cache_hits" , |
2937 | .data = &dqstats.stat[DQST_CACHE_HITS], |
2938 | .maxlen = sizeof(unsigned long), |
2939 | .mode = 0444, |
2940 | .proc_handler = do_proc_dqstats, |
2941 | }, |
2942 | { |
2943 | .procname = "allocated_dquots" , |
2944 | .data = &dqstats.stat[DQST_ALLOC_DQUOTS], |
2945 | .maxlen = sizeof(unsigned long), |
2946 | .mode = 0444, |
2947 | .proc_handler = do_proc_dqstats, |
2948 | }, |
2949 | { |
2950 | .procname = "free_dquots" , |
2951 | .data = &dqstats.stat[DQST_FREE_DQUOTS], |
2952 | .maxlen = sizeof(unsigned long), |
2953 | .mode = 0444, |
2954 | .proc_handler = do_proc_dqstats, |
2955 | }, |
2956 | { |
2957 | .procname = "syncs" , |
2958 | .data = &dqstats.stat[DQST_SYNCS], |
2959 | .maxlen = sizeof(unsigned long), |
2960 | .mode = 0444, |
2961 | .proc_handler = do_proc_dqstats, |
2962 | }, |
2963 | #ifdef CONFIG_PRINT_QUOTA_WARNING |
2964 | { |
2965 | .procname = "warnings" , |
2966 | .data = &flag_print_warnings, |
2967 | .maxlen = sizeof(int), |
2968 | .mode = 0644, |
2969 | .proc_handler = proc_dointvec, |
2970 | }, |
2971 | #endif |
2972 | { }, |
2973 | }; |
2974 | |
2975 | static int __init dquot_init(void) |
2976 | { |
2977 | int i, ret; |
2978 | unsigned long nr_hash, order; |
2979 | struct shrinker *dqcache_shrinker; |
2980 | |
2981 | printk(KERN_NOTICE "VFS: Disk quotas %s\n" , __DQUOT_VERSION__); |
2982 | |
2983 | register_sysctl_init("fs/quota" , fs_dqstats_table); |
2984 | |
2985 | dquot_cachep = kmem_cache_create(name: "dquot" , |
2986 | size: sizeof(struct dquot), align: sizeof(unsigned long) * 4, |
2987 | flags: (SLAB_HWCACHE_ALIGN|SLAB_RECLAIM_ACCOUNT| |
2988 | SLAB_MEM_SPREAD|SLAB_PANIC), |
2989 | NULL); |
2990 | |
2991 | order = 0; |
2992 | dquot_hash = (struct hlist_head *)__get_free_pages(GFP_KERNEL, order); |
2993 | if (!dquot_hash) |
2994 | panic(fmt: "Cannot create dquot hash table" ); |
2995 | |
2996 | for (i = 0; i < _DQST_DQSTAT_LAST; i++) { |
2997 | ret = percpu_counter_init(&dqstats.counter[i], 0, GFP_KERNEL); |
2998 | if (ret) |
2999 | panic(fmt: "Cannot create dquot stat counters" ); |
3000 | } |
3001 | |
3002 | /* Find power-of-two hlist_heads which can fit into allocation */ |
3003 | nr_hash = (1UL << order) * PAGE_SIZE / sizeof(struct hlist_head); |
3004 | dq_hash_bits = ilog2(nr_hash); |
3005 | |
3006 | nr_hash = 1UL << dq_hash_bits; |
3007 | dq_hash_mask = nr_hash - 1; |
3008 | for (i = 0; i < nr_hash; i++) |
3009 | INIT_HLIST_HEAD(dquot_hash + i); |
3010 | |
3011 | pr_info("VFS: Dquot-cache hash table entries: %ld (order %ld," |
3012 | " %ld bytes)\n" , nr_hash, order, (PAGE_SIZE << order)); |
3013 | |
3014 | dqcache_shrinker = shrinker_alloc(flags: 0, fmt: "dquota-cache" ); |
3015 | if (!dqcache_shrinker) |
3016 | panic(fmt: "Cannot allocate dquot shrinker" ); |
3017 | |
3018 | dqcache_shrinker->count_objects = dqcache_shrink_count; |
3019 | dqcache_shrinker->scan_objects = dqcache_shrink_scan; |
3020 | |
3021 | shrinker_register(shrinker: dqcache_shrinker); |
3022 | |
3023 | return 0; |
3024 | } |
3025 | fs_initcall(dquot_init); |
3026 | |