?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
FRV: Use generic show_interrupts()
[cris-mirror.git] / fs / gfs2 / quota.c
blobe23d9864c418d69c0abdce5d699a20904baa3779
1 /*
2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2007 Red Hat, Inc. All rights reserved.
4 *
5 * This copyrighted material is made available to anyone wishing to use,
6 * modify, copy, or redistribute it subject to the terms and conditions
7 * of the GNU General Public License version 2.
8 */
9
10 /*
11 * Quota change tags are associated with each transaction that allocates or
12 * deallocates space. Those changes are accumulated locally to each node (in a
13 * per-node file) and then are periodically synced to the quota file. This
14 * avoids the bottleneck of constantly touching the quota file, but introduces
15 * fuzziness in the current usage value of IDs that are being used on different
16 * nodes in the cluster simultaneously. So, it is possible for a user on
17 * multiple nodes to overrun their quota, but that overrun is controlable.
18 * Since quota tags are part of transactions, there is no need for a quota check
19 * program to be run on node crashes or anything like that.
20 *
21 * There are couple of knobs that let the administrator manage the quota
22 * fuzziness. "quota_quantum" sets the maximum time a quota change can be
23 * sitting on one node before being synced to the quota file. (The default is
24 * 60 seconds.) Another knob, "quota_scale" controls how quickly the frequency
25 * of quota file syncs increases as the user moves closer to their limit. The
26 * more frequent the syncs, the more accurate the quota enforcement, but that
27 * means that there is more contention between the nodes for the quota file.
28 * The default value is one. This sets the maximum theoretical quota overrun
29 * (with infinite node with infinite bandwidth) to twice the user's limit. (In
30 * practice, the maximum overrun you see should be much less.) A "quota_scale"
31 * number greater than one makes quota syncs more frequent and reduces the
32 * maximum overrun. Numbers less than one (but greater than zero) make quota
33 * syncs less frequent.
34 *
35 * GFS quotas also use per-ID Lock Value Blocks (LVBs) to cache the contents of
36 * the quota file, so it is not being constantly read.
37 */
38
39 #include <linux/sched.h>
40 #include <linux/slab.h>
41 #include <linux/spinlock.h>
42 #include <linux/completion.h>
43 #include <linux/buffer_head.h>
44 #include <linux/sort.h>
45 #include <linux/fs.h>
46 #include <linux/bio.h>
47 #include <linux/gfs2_ondisk.h>
48 #include <linux/kthread.h>
49 #include <linux/freezer.h>
50 #include <linux/quota.h>
51 #include <linux/dqblk_xfs.h>
52
53 #include "gfs2.h"
54 #include "incore.h"
55 #include "bmap.h"
56 #include "glock.h"
57 #include "glops.h"
58 #include "log.h"
59 #include "meta_io.h"
60 #include "quota.h"
61 #include "rgrp.h"
62 #include "super.h"
63 #include "trans.h"
64 #include "inode.h"
65 #include "util.h"
66
67 #define QUOTA_USER 1
68 #define QUOTA_GROUP 0
69
70 struct gfs2_quota_change_host {
71 u64 qc_change;
72 u32 qc_flags; /* GFS2_QCF_... */
73 u32 qc_id;
74 };
75
76 static LIST_HEAD(qd_lru_list);
77 static atomic_t qd_lru_count = ATOMIC_INIT(0);
78 static DEFINE_SPINLOCK(qd_lru_lock);
79
80 int gfs2_shrink_qd_memory(struct shrinker *shrink, int nr, gfp_t gfp_mask)
81 {
82 struct gfs2_quota_data *qd;
83 struct gfs2_sbd *sdp;
84
85 if (nr == 0)
86 goto out;
87
88 if (!(gfp_mask & __GFP_FS))
89 return -1;
90
91 spin_lock(&qd_lru_lock);
92 while (nr && !list_empty(&qd_lru_list)) {
93 qd = list_entry(qd_lru_list.next,
94 struct gfs2_quota_data, qd_reclaim);
95 sdp = qd->qd_gl->gl_sbd;
96
97 /* Free from the filesystem-specific list */
98 list_del(&qd->qd_list);
99
100 gfs2_assert_warn(sdp, !qd->qd_change);
101 gfs2_assert_warn(sdp, !qd->qd_slot_count);
102 gfs2_assert_warn(sdp, !qd->qd_bh_count);
103
104 gfs2_glock_put(qd->qd_gl);
105 atomic_dec(&sdp->sd_quota_count);
106
107 /* Delete it from the common reclaim list */
108 list_del_init(&qd->qd_reclaim);
109 atomic_dec(&qd_lru_count);
110 spin_unlock(&qd_lru_lock);
111 kmem_cache_free(gfs2_quotad_cachep, qd);
112 spin_lock(&qd_lru_lock);
113 nr--;
114 }
115 spin_unlock(&qd_lru_lock);
116
117 out:
118 return (atomic_read(&qd_lru_count) * sysctl_vfs_cache_pressure) / 100;
119 }
120
121 static u64 qd2offset(struct gfs2_quota_data *qd)
122 {
123 u64 offset;
124
125 offset = 2 * (u64)qd->qd_id + !test_bit(QDF_USER, &qd->qd_flags);
126 offset *= sizeof(struct gfs2_quota);
127
128 return offset;
129 }
130
131 static int qd_alloc(struct gfs2_sbd *sdp, int user, u32 id,
132 struct gfs2_quota_data **qdp)
133 {
134 struct gfs2_quota_data *qd;
135 int error;
136
137 qd = kmem_cache_zalloc(gfs2_quotad_cachep, GFP_NOFS);
138 if (!qd)
139 return -ENOMEM;
140
141 atomic_set(&qd->qd_count, 1);
142 qd->qd_id = id;
143 if (user)
144 set_bit(QDF_USER, &qd->qd_flags);
145 qd->qd_slot = -1;
146 INIT_LIST_HEAD(&qd->qd_reclaim);
147
148 error = gfs2_glock_get(sdp, 2 * (u64)id + !user,
149 &gfs2_quota_glops, CREATE, &qd->qd_gl);
150 if (error)
151 goto fail;
152
153 *qdp = qd;
154
155 return 0;
156
157 fail:
158 kmem_cache_free(gfs2_quotad_cachep, qd);
159 return error;
160 }
161
162 static int qd_get(struct gfs2_sbd *sdp, int user, u32 id,
163 struct gfs2_quota_data **qdp)
164 {
165 struct gfs2_quota_data *qd = NULL, *new_qd = NULL;
166 int error, found;
167
168 *qdp = NULL;
169
170 for (;;) {
171 found = 0;
172 spin_lock(&qd_lru_lock);
173 list_for_each_entry(qd, &sdp->sd_quota_list, qd_list) {
174 if (qd->qd_id == id &&
175 !test_bit(QDF_USER, &qd->qd_flags) == !user) {
176 if (!atomic_read(&qd->qd_count) &&
177 !list_empty(&qd->qd_reclaim)) {
178 /* Remove it from reclaim list */
179 list_del_init(&qd->qd_reclaim);
180 atomic_dec(&qd_lru_count);
181 }
182 atomic_inc(&qd->qd_count);
183 found = 1;
184 break;
185 }
186 }
187
188 if (!found)
189 qd = NULL;
190
191 if (!qd && new_qd) {
192 qd = new_qd;
193 list_add(&qd->qd_list, &sdp->sd_quota_list);
194 atomic_inc(&sdp->sd_quota_count);
195 new_qd = NULL;
196 }
197
198 spin_unlock(&qd_lru_lock);
199
200 if (qd) {
201 if (new_qd) {
202 gfs2_glock_put(new_qd->qd_gl);
203 kmem_cache_free(gfs2_quotad_cachep, new_qd);
204 }
205 *qdp = qd;
206 return 0;
207 }
208
209 error = qd_alloc(sdp, user, id, &new_qd);
210 if (error)
211 return error;
212 }
213 }
214
215 static void qd_hold(struct gfs2_quota_data *qd)
216 {
217 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
218 gfs2_assert(sdp, atomic_read(&qd->qd_count));
219 atomic_inc(&qd->qd_count);
220 }
221
222 static void qd_put(struct gfs2_quota_data *qd)
223 {
224 if (atomic_dec_and_lock(&qd->qd_count, &qd_lru_lock)) {
225 /* Add to the reclaim list */
226 list_add_tail(&qd->qd_reclaim, &qd_lru_list);
227 atomic_inc(&qd_lru_count);
228 spin_unlock(&qd_lru_lock);
229 }
230 }
231
232 static int slot_get(struct gfs2_quota_data *qd)
233 {
234 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
235 unsigned int c, o = 0, b;
236 unsigned char byte = 0;
237
238 spin_lock(&qd_lru_lock);
239
240 if (qd->qd_slot_count++) {
241 spin_unlock(&qd_lru_lock);
242 return 0;
243 }
244
245 for (c = 0; c < sdp->sd_quota_chunks; c++)
246 for (o = 0; o < PAGE_SIZE; o++) {
247 byte = sdp->sd_quota_bitmap[c][o];
248 if (byte != 0xFF)
249 goto found;
250 }
251
252 goto fail;
253
254 found:
255 for (b = 0; b < 8; b++)
256 if (!(byte & (1 << b)))
257 break;
258 qd->qd_slot = c * (8 * PAGE_SIZE) + o * 8 + b;
259
260 if (qd->qd_slot >= sdp->sd_quota_slots)
261 goto fail;
262
263 sdp->sd_quota_bitmap[c][o] |= 1 << b;
264
265 spin_unlock(&qd_lru_lock);
266
267 return 0;
268
269 fail:
270 qd->qd_slot_count--;
271 spin_unlock(&qd_lru_lock);
272 return -ENOSPC;
273 }
274
275 static void slot_hold(struct gfs2_quota_data *qd)
276 {
277 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
278
279 spin_lock(&qd_lru_lock);
280 gfs2_assert(sdp, qd->qd_slot_count);
281 qd->qd_slot_count++;
282 spin_unlock(&qd_lru_lock);
283 }
284
285 static void slot_put(struct gfs2_quota_data *qd)
286 {
287 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
288
289 spin_lock(&qd_lru_lock);
290 gfs2_assert(sdp, qd->qd_slot_count);
291 if (!--qd->qd_slot_count) {
292 gfs2_icbit_munge(sdp, sdp->sd_quota_bitmap, qd->qd_slot, 0);
293 qd->qd_slot = -1;
294 }
295 spin_unlock(&qd_lru_lock);
296 }
297
298 static int bh_get(struct gfs2_quota_data *qd)
299 {
300 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
301 struct gfs2_inode *ip = GFS2_I(sdp->sd_qc_inode);
302 unsigned int block, offset;
303 struct buffer_head *bh;
304 int error;
305 struct buffer_head bh_map = { .b_state = 0, .b_blocknr = 0 };
306
307 mutex_lock(&sdp->sd_quota_mutex);
308
309 if (qd->qd_bh_count++) {
310 mutex_unlock(&sdp->sd_quota_mutex);
311 return 0;
312 }
313
314 block = qd->qd_slot / sdp->sd_qc_per_block;
315 offset = qd->qd_slot % sdp->sd_qc_per_block;
316
317 bh_map.b_size = 1 << ip->i_inode.i_blkbits;
318 error = gfs2_block_map(&ip->i_inode, block, &bh_map, 0);
319 if (error)
320 goto fail;
321 error = gfs2_meta_read(ip->i_gl, bh_map.b_blocknr, DIO_WAIT, &bh);
322 if (error)
323 goto fail;
324 error = -EIO;
325 if (gfs2_metatype_check(sdp, bh, GFS2_METATYPE_QC))
326 goto fail_brelse;
327
328 qd->qd_bh = bh;
329 qd->qd_bh_qc = (struct gfs2_quota_change *)
330 (bh->b_data + sizeof(struct gfs2_meta_header) +
331 offset * sizeof(struct gfs2_quota_change));
332
333 mutex_unlock(&sdp->sd_quota_mutex);
334
335 return 0;
336
337 fail_brelse:
338 brelse(bh);
339 fail:
340 qd->qd_bh_count--;
341 mutex_unlock(&sdp->sd_quota_mutex);
342 return error;
343 }
344
345 static void bh_put(struct gfs2_quota_data *qd)
346 {
347 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
348
349 mutex_lock(&sdp->sd_quota_mutex);
350 gfs2_assert(sdp, qd->qd_bh_count);
351 if (!--qd->qd_bh_count) {
352 brelse(qd->qd_bh);
353 qd->qd_bh = NULL;
354 qd->qd_bh_qc = NULL;
355 }
356 mutex_unlock(&sdp->sd_quota_mutex);
357 }
358
359 static int qd_fish(struct gfs2_sbd *sdp, struct gfs2_quota_data **qdp)
360 {
361 struct gfs2_quota_data *qd = NULL;
362 int error;
363 int found = 0;
364
365 *qdp = NULL;
366
367 if (sdp->sd_vfs->s_flags & MS_RDONLY)
368 return 0;
369
370 spin_lock(&qd_lru_lock);
371
372 list_for_each_entry(qd, &sdp->sd_quota_list, qd_list) {
373 if (test_bit(QDF_LOCKED, &qd->qd_flags) ||
374 !test_bit(QDF_CHANGE, &qd->qd_flags) ||
375 qd->qd_sync_gen >= sdp->sd_quota_sync_gen)
376 continue;
377
378 list_move_tail(&qd->qd_list, &sdp->sd_quota_list);
379
380 set_bit(QDF_LOCKED, &qd->qd_flags);
381 gfs2_assert_warn(sdp, atomic_read(&qd->qd_count));
382 atomic_inc(&qd->qd_count);
383 qd->qd_change_sync = qd->qd_change;
384 gfs2_assert_warn(sdp, qd->qd_slot_count);
385 qd->qd_slot_count++;
386 found = 1;
387
388 break;
389 }
390
391 if (!found)
392 qd = NULL;
393
394 spin_unlock(&qd_lru_lock);
395
396 if (qd) {
397 gfs2_assert_warn(sdp, qd->qd_change_sync);
398 error = bh_get(qd);
399 if (error) {
400 clear_bit(QDF_LOCKED, &qd->qd_flags);
401 slot_put(qd);
402 qd_put(qd);
403 return error;
404 }
405 }
406
407 *qdp = qd;
408
409 return 0;
410 }
411
412 static int qd_trylock(struct gfs2_quota_data *qd)
413 {
414 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
415
416 if (sdp->sd_vfs->s_flags & MS_RDONLY)
417 return 0;
418
419 spin_lock(&qd_lru_lock);
420
421 if (test_bit(QDF_LOCKED, &qd->qd_flags) ||
422 !test_bit(QDF_CHANGE, &qd->qd_flags)) {
423 spin_unlock(&qd_lru_lock);
424 return 0;
425 }
426
427 list_move_tail(&qd->qd_list, &sdp->sd_quota_list);
428
429 set_bit(QDF_LOCKED, &qd->qd_flags);
430 gfs2_assert_warn(sdp, atomic_read(&qd->qd_count));
431 atomic_inc(&qd->qd_count);
432 qd->qd_change_sync = qd->qd_change;
433 gfs2_assert_warn(sdp, qd->qd_slot_count);
434 qd->qd_slot_count++;
435
436 spin_unlock(&qd_lru_lock);
437
438 gfs2_assert_warn(sdp, qd->qd_change_sync);
439 if (bh_get(qd)) {
440 clear_bit(QDF_LOCKED, &qd->qd_flags);
441 slot_put(qd);
442 qd_put(qd);
443 return 0;
444 }
445
446 return 1;
447 }
448
449 static void qd_unlock(struct gfs2_quota_data *qd)
450 {
451 gfs2_assert_warn(qd->qd_gl->gl_sbd,
452 test_bit(QDF_LOCKED, &qd->qd_flags));
453 clear_bit(QDF_LOCKED, &qd->qd_flags);
454 bh_put(qd);
455 slot_put(qd);
456 qd_put(qd);
457 }
458
459 static int qdsb_get(struct gfs2_sbd *sdp, int user, u32 id,
460 struct gfs2_quota_data **qdp)
461 {
462 int error;
463
464 error = qd_get(sdp, user, id, qdp);
465 if (error)
466 return error;
467
468 error = slot_get(*qdp);
469 if (error)
470 goto fail;
471
472 error = bh_get(*qdp);
473 if (error)
474 goto fail_slot;
475
476 return 0;
477
478 fail_slot:
479 slot_put(*qdp);
480 fail:
481 qd_put(*qdp);
482 return error;
483 }
484
485 static void qdsb_put(struct gfs2_quota_data *qd)
486 {
487 bh_put(qd);
488 slot_put(qd);
489 qd_put(qd);
490 }
491
492 int gfs2_quota_hold(struct gfs2_inode *ip, u32 uid, u32 gid)
493 {
494 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
495 struct gfs2_alloc *al = ip->i_alloc;
496 struct gfs2_quota_data **qd = al->al_qd;
497 int error;
498
499 if (gfs2_assert_warn(sdp, !al->al_qd_num) ||
500 gfs2_assert_warn(sdp, !test_bit(GIF_QD_LOCKED, &ip->i_flags)))
501 return -EIO;
502
503 if (sdp->sd_args.ar_quota == GFS2_QUOTA_OFF)
504 return 0;
505
506 error = qdsb_get(sdp, QUOTA_USER, ip->i_inode.i_uid, qd);
507 if (error)
508 goto out;
509 al->al_qd_num++;
510 qd++;
511
512 error = qdsb_get(sdp, QUOTA_GROUP, ip->i_inode.i_gid, qd);
513 if (error)
514 goto out;
515 al->al_qd_num++;
516 qd++;
517
518 if (uid != NO_QUOTA_CHANGE && uid != ip->i_inode.i_uid) {
519 error = qdsb_get(sdp, QUOTA_USER, uid, qd);
520 if (error)
521 goto out;
522 al->al_qd_num++;
523 qd++;
524 }
525
526 if (gid != NO_QUOTA_CHANGE && gid != ip->i_inode.i_gid) {
527 error = qdsb_get(sdp, QUOTA_GROUP, gid, qd);
528 if (error)
529 goto out;
530 al->al_qd_num++;
531 qd++;
532 }
533
534 out:
535 if (error)
536 gfs2_quota_unhold(ip);
537 return error;
538 }
539
540 void gfs2_quota_unhold(struct gfs2_inode *ip)
541 {
542 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
543 struct gfs2_alloc *al = ip->i_alloc;
544 unsigned int x;
545
546 gfs2_assert_warn(sdp, !test_bit(GIF_QD_LOCKED, &ip->i_flags));
547
548 for (x = 0; x < al->al_qd_num; x++) {
549 qdsb_put(al->al_qd[x]);
550 al->al_qd[x] = NULL;
551 }
552 al->al_qd_num = 0;
553 }
554
555 static int sort_qd(const void *a, const void *b)
556 {
557 const struct gfs2_quota_data *qd_a = *(const struct gfs2_quota_data **)a;
558 const struct gfs2_quota_data *qd_b = *(const struct gfs2_quota_data **)b;
559
560 if (!test_bit(QDF_USER, &qd_a->qd_flags) !=
561 !test_bit(QDF_USER, &qd_b->qd_flags)) {
562 if (test_bit(QDF_USER, &qd_a->qd_flags))
563 return -1;
564 else
565 return 1;
566 }
567 if (qd_a->qd_id < qd_b->qd_id)
568 return -1;
569 if (qd_a->qd_id > qd_b->qd_id)
570 return 1;
571
572 return 0;
573 }
574
575 static void do_qc(struct gfs2_quota_data *qd, s64 change)
576 {
577 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
578 struct gfs2_inode *ip = GFS2_I(sdp->sd_qc_inode);
579 struct gfs2_quota_change *qc = qd->qd_bh_qc;
580 s64 x;
581
582 mutex_lock(&sdp->sd_quota_mutex);
583 gfs2_trans_add_bh(ip->i_gl, qd->qd_bh, 1);
584
585 if (!test_bit(QDF_CHANGE, &qd->qd_flags)) {
586 qc->qc_change = 0;
587 qc->qc_flags = 0;
588 if (test_bit(QDF_USER, &qd->qd_flags))
589 qc->qc_flags = cpu_to_be32(GFS2_QCF_USER);
590 qc->qc_id = cpu_to_be32(qd->qd_id);
591 }
592
593 x = be64_to_cpu(qc->qc_change) + change;
594 qc->qc_change = cpu_to_be64(x);
595
596 spin_lock(&qd_lru_lock);
597 qd->qd_change = x;
598 spin_unlock(&qd_lru_lock);
599
600 if (!x) {
601 gfs2_assert_warn(sdp, test_bit(QDF_CHANGE, &qd->qd_flags));
602 clear_bit(QDF_CHANGE, &qd->qd_flags);
603 qc->qc_flags = 0;
604 qc->qc_id = 0;
605 slot_put(qd);
606 qd_put(qd);
607 } else if (!test_and_set_bit(QDF_CHANGE, &qd->qd_flags)) {
608 qd_hold(qd);
609 slot_hold(qd);
610 }
611
612 mutex_unlock(&sdp->sd_quota_mutex);
613 }
614
615 /**
616 * gfs2_adjust_quota - adjust record of current block usage
617 * @ip: The quota inode
618 * @loc: Offset of the entry in the quota file
619 * @change: The amount of usage change to record
620 * @qd: The quota data
621 * @fdq: The updated limits to record
622 *
623 * This function was mostly borrowed from gfs2_block_truncate_page which was
624 * in turn mostly borrowed from ext3
625 *
626 * Returns: 0 or -ve on error
627 */
628
629 static int gfs2_adjust_quota(struct gfs2_inode *ip, loff_t loc,
630 s64 change, struct gfs2_quota_data *qd,
631 struct fs_disk_quota *fdq)
632 {
633 struct inode *inode = &ip->i_inode;
634 struct gfs2_sbd *sdp = GFS2_SB(inode);
635 struct address_space *mapping = inode->i_mapping;
636 unsigned long index = loc >> PAGE_CACHE_SHIFT;
637 unsigned offset = loc & (PAGE_CACHE_SIZE - 1);
638 unsigned blocksize, iblock, pos;
639 struct buffer_head *bh, *dibh;
640 struct page *page;
641 void *kaddr, *ptr;
642 struct gfs2_quota q, *qp;
643 int err, nbytes;
644 u64 size;
645
646 if (gfs2_is_stuffed(ip))
647 gfs2_unstuff_dinode(ip, NULL);
648
649 memset(&q, 0, sizeof(struct gfs2_quota));
650 err = gfs2_internal_read(ip, NULL, (char *)&q, &loc, sizeof(q));
651 if (err < 0)
652 return err;
653
654 err = -EIO;
655 qp = &q;
656 qp->qu_value = be64_to_cpu(qp->qu_value);
657 qp->qu_value += change;
658 qp->qu_value = cpu_to_be64(qp->qu_value);
659 qd->qd_qb.qb_value = qp->qu_value;
660 if (fdq) {
661 if (fdq->d_fieldmask & FS_DQ_BSOFT) {
662 qp->qu_warn = cpu_to_be64(fdq->d_blk_softlimit >> sdp->sd_fsb2bb_shift);
663 qd->qd_qb.qb_warn = qp->qu_warn;
664 }
665 if (fdq->d_fieldmask & FS_DQ_BHARD) {
666 qp->qu_limit = cpu_to_be64(fdq->d_blk_hardlimit >> sdp->sd_fsb2bb_shift);
667 qd->qd_qb.qb_limit = qp->qu_limit;
668 }
669 if (fdq->d_fieldmask & FS_DQ_BCOUNT) {
670 qp->qu_value = cpu_to_be64(fdq->d_bcount >> sdp->sd_fsb2bb_shift);
671 qd->qd_qb.qb_value = qp->qu_value;
672 }
673 }
674
675 /* Write the quota into the quota file on disk */
676 ptr = qp;
677 nbytes = sizeof(struct gfs2_quota);
678 get_a_page:
679 page = grab_cache_page(mapping, index);
680 if (!page)
681 return -ENOMEM;
682
683 blocksize = inode->i_sb->s_blocksize;
684 iblock = index << (PAGE_CACHE_SHIFT - inode->i_sb->s_blocksize_bits);
685
686 if (!page_has_buffers(page))
687 create_empty_buffers(page, blocksize, 0);
688
689 bh = page_buffers(page);
690 pos = blocksize;
691 while (offset >= pos) {
692 bh = bh->b_this_page;
693 iblock++;
694 pos += blocksize;
695 }
696
697 if (!buffer_mapped(bh)) {
698 gfs2_block_map(inode, iblock, bh, 1);
699 if (!buffer_mapped(bh))
700 goto unlock_out;
701 /* If it's a newly allocated disk block for quota, zero it */
702 if (buffer_new(bh))
703 zero_user(page, pos - blocksize, bh->b_size);
704 }
705
706 if (PageUptodate(page))
707 set_buffer_uptodate(bh);
708
709 if (!buffer_uptodate(bh)) {
710 ll_rw_block(READ_META, 1, &bh);
711 wait_on_buffer(bh);
712 if (!buffer_uptodate(bh))
713 goto unlock_out;
714 }
715
716 gfs2_trans_add_bh(ip->i_gl, bh, 0);
717
718 kaddr = kmap_atomic(page, KM_USER0);
719 if (offset + sizeof(struct gfs2_quota) > PAGE_CACHE_SIZE)
720 nbytes = PAGE_CACHE_SIZE - offset;
721 memcpy(kaddr + offset, ptr, nbytes);
722 flush_dcache_page(page);
723 kunmap_atomic(kaddr, KM_USER0);
724 unlock_page(page);
725 page_cache_release(page);
726
727 /* If quota straddles page boundary, we need to update the rest of the
728 * quota at the beginning of the next page */
729 if ((offset + sizeof(struct gfs2_quota)) > PAGE_CACHE_SIZE) {
730 ptr = ptr + nbytes;
731 nbytes = sizeof(struct gfs2_quota) - nbytes;
732 offset = 0;
733 index++;
734 goto get_a_page;
735 }
736
737 /* Update the disk inode timestamp and size (if extended) */
738 err = gfs2_meta_inode_buffer(ip, &dibh);
739 if (err)
740 goto out;
741
742 size = loc + sizeof(struct gfs2_quota);
743 if (size > inode->i_size)
744 i_size_write(inode, size);
745 inode->i_mtime = inode->i_atime = CURRENT_TIME;
746 gfs2_trans_add_bh(ip->i_gl, dibh, 1);
747 gfs2_dinode_out(ip, dibh->b_data);
748 brelse(dibh);
749 mark_inode_dirty(inode);
750
751 out:
752 return err;
753 unlock_out:
754 unlock_page(page);
755 page_cache_release(page);
756 return err;
757 }
758
759 static int do_sync(unsigned int num_qd, struct gfs2_quota_data **qda)
760 {
761 struct gfs2_sbd *sdp = (*qda)->qd_gl->gl_sbd;
762 struct gfs2_inode *ip = GFS2_I(sdp->sd_quota_inode);
763 unsigned int data_blocks, ind_blocks;
764 struct gfs2_holder *ghs, i_gh;
765 unsigned int qx, x;
766 struct gfs2_quota_data *qd;
767 loff_t offset;
768 unsigned int nalloc = 0, blocks;
769 struct gfs2_alloc *al = NULL;
770 int error;
771
772 gfs2_write_calc_reserv(ip, sizeof(struct gfs2_quota),
773 &data_blocks, &ind_blocks);
774
775 ghs = kcalloc(num_qd, sizeof(struct gfs2_holder), GFP_NOFS);
776 if (!ghs)
777 return -ENOMEM;
778
779 sort(qda, num_qd, sizeof(struct gfs2_quota_data *), sort_qd, NULL);
780 mutex_lock_nested(&ip->i_inode.i_mutex, I_MUTEX_QUOTA);
781 for (qx = 0; qx < num_qd; qx++) {
782 error = gfs2_glock_nq_init(qda[qx]->qd_gl, LM_ST_EXCLUSIVE,
783 GL_NOCACHE, &ghs[qx]);
784 if (error)
785 goto out;
786 }
787
788 error = gfs2_glock_nq_init(ip->i_gl, LM_ST_EXCLUSIVE, 0, &i_gh);
789 if (error)
790 goto out;
791
792 for (x = 0; x < num_qd; x++) {
793 offset = qd2offset(qda[x]);
794 if (gfs2_write_alloc_required(ip, offset,
795 sizeof(struct gfs2_quota)))
796 nalloc++;
797 }
798
799 al = gfs2_alloc_get(ip);
800 if (!al) {
801 error = -ENOMEM;
802 goto out_gunlock;
803 }
804 /*
805 * 1 blk for unstuffing inode if stuffed. We add this extra
806 * block to the reservation unconditionally. If the inode
807 * doesn't need unstuffing, the block will be released to the
808 * rgrp since it won't be allocated during the transaction
809 */
810 al->al_requested = 1;
811 /* +3 in the end for unstuffing block, inode size update block
812 * and another block in case quota straddles page boundary and
813 * two blocks need to be updated instead of 1 */
814 blocks = num_qd * data_blocks + RES_DINODE + num_qd + 3;
815
816 if (nalloc)
817 al->al_requested += nalloc * (data_blocks + ind_blocks);
818 error = gfs2_inplace_reserve(ip);
819 if (error)
820 goto out_alloc;
821
822 if (nalloc)
823 blocks += gfs2_rg_blocks(al) + nalloc * ind_blocks + RES_STATFS;
824
825 error = gfs2_trans_begin(sdp, blocks, 0);
826 if (error)
827 goto out_ipres;
828
829 for (x = 0; x < num_qd; x++) {
830 qd = qda[x];
831 offset = qd2offset(qd);
832 error = gfs2_adjust_quota(ip, offset, qd->qd_change_sync, qd, NULL);
833 if (error)
834 goto out_end_trans;
835
836 do_qc(qd, -qd->qd_change_sync);
837 set_bit(QDF_REFRESH, &qd->qd_flags);
838 }
839
840 error = 0;
841
842 out_end_trans:
843 gfs2_trans_end(sdp);
844 out_ipres:
845 gfs2_inplace_release(ip);
846 out_alloc:
847 gfs2_alloc_put(ip);
848 out_gunlock:
849 gfs2_glock_dq_uninit(&i_gh);
850 out:
851 while (qx--)
852 gfs2_glock_dq_uninit(&ghs[qx]);
853 mutex_unlock(&ip->i_inode.i_mutex);
854 kfree(ghs);
855 gfs2_log_flush(ip->i_gl->gl_sbd, ip->i_gl);
856 return error;
857 }
858
859 static int update_qd(struct gfs2_sbd *sdp, struct gfs2_quota_data *qd)
860 {
861 struct gfs2_inode *ip = GFS2_I(sdp->sd_quota_inode);
862 struct gfs2_quota q;
863 struct gfs2_quota_lvb *qlvb;
864 loff_t pos;
865 int error;
866
867 memset(&q, 0, sizeof(struct gfs2_quota));
868 pos = qd2offset(qd);
869 error = gfs2_internal_read(ip, NULL, (char *)&q, &pos, sizeof(q));
870 if (error < 0)
871 return error;
872
873 qlvb = (struct gfs2_quota_lvb *)qd->qd_gl->gl_lvb;
874 qlvb->qb_magic = cpu_to_be32(GFS2_MAGIC);
875 qlvb->__pad = 0;
876 qlvb->qb_limit = q.qu_limit;
877 qlvb->qb_warn = q.qu_warn;
878 qlvb->qb_value = q.qu_value;
879 qd->qd_qb = *qlvb;
880
881 return 0;
882 }
883
884 static int do_glock(struct gfs2_quota_data *qd, int force_refresh,
885 struct gfs2_holder *q_gh)
886 {
887 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
888 struct gfs2_inode *ip = GFS2_I(sdp->sd_quota_inode);
889 struct gfs2_holder i_gh;
890 int error;
891
892 restart:
893 error = gfs2_glock_nq_init(qd->qd_gl, LM_ST_SHARED, 0, q_gh);
894 if (error)
895 return error;
896
897 qd->qd_qb = *(struct gfs2_quota_lvb *)qd->qd_gl->gl_lvb;
898
899 if (force_refresh || qd->qd_qb.qb_magic != cpu_to_be32(GFS2_MAGIC)) {
900 gfs2_glock_dq_uninit(q_gh);
901 error = gfs2_glock_nq_init(qd->qd_gl, LM_ST_EXCLUSIVE,
902 GL_NOCACHE, q_gh);
903 if (error)
904 return error;
905
906 error = gfs2_glock_nq_init(ip->i_gl, LM_ST_SHARED, 0, &i_gh);
907 if (error)
908 goto fail;
909
910 error = update_qd(sdp, qd);
911 if (error)
912 goto fail_gunlock;
913
914 gfs2_glock_dq_uninit(&i_gh);
915 gfs2_glock_dq_uninit(q_gh);
916 force_refresh = 0;
917 goto restart;
918 }
919
920 return 0;
921
922 fail_gunlock:
923 gfs2_glock_dq_uninit(&i_gh);
924 fail:
925 gfs2_glock_dq_uninit(q_gh);
926 return error;
927 }
928
929 int gfs2_quota_lock(struct gfs2_inode *ip, u32 uid, u32 gid)
930 {
931 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
932 struct gfs2_alloc *al = ip->i_alloc;
933 struct gfs2_quota_data *qd;
934 unsigned int x;
935 int error = 0;
936
937 gfs2_quota_hold(ip, uid, gid);
938
939 if (capable(CAP_SYS_RESOURCE) ||
940 sdp->sd_args.ar_quota != GFS2_QUOTA_ON)
941 return 0;
942
943 sort(al->al_qd, al->al_qd_num, sizeof(struct gfs2_quota_data *),
944 sort_qd, NULL);
945
946 for (x = 0; x < al->al_qd_num; x++) {
947 int force = NO_FORCE;
948 qd = al->al_qd[x];
949 if (test_and_clear_bit(QDF_REFRESH, &qd->qd_flags))
950 force = FORCE;
951 error = do_glock(qd, force, &al->al_qd_ghs[x]);
952 if (error)
953 break;
954 }
955
956 if (!error)
957 set_bit(GIF_QD_LOCKED, &ip->i_flags);
958 else {
959 while (x--)
960 gfs2_glock_dq_uninit(&al->al_qd_ghs[x]);
961 gfs2_quota_unhold(ip);
962 }
963
964 return error;
965 }
966
967 static int need_sync(struct gfs2_quota_data *qd)
968 {
969 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
970 struct gfs2_tune *gt = &sdp->sd_tune;
971 s64 value;
972 unsigned int num, den;
973 int do_sync = 1;
974
975 if (!qd->qd_qb.qb_limit)
976 return 0;
977
978 spin_lock(&qd_lru_lock);
979 value = qd->qd_change;
980 spin_unlock(&qd_lru_lock);
981
982 spin_lock(&gt->gt_spin);
983 num = gt->gt_quota_scale_num;
984 den = gt->gt_quota_scale_den;
985 spin_unlock(&gt->gt_spin);
986
987 if (value < 0)
988 do_sync = 0;
989 else if ((s64)be64_to_cpu(qd->qd_qb.qb_value) >=
990 (s64)be64_to_cpu(qd->qd_qb.qb_limit))
991 do_sync = 0;
992 else {
993 value *= gfs2_jindex_size(sdp) * num;
994 value = div_s64(value, den);
995 value += (s64)be64_to_cpu(qd->qd_qb.qb_value);
996 if (value < (s64)be64_to_cpu(qd->qd_qb.qb_limit))
997 do_sync = 0;
998 }
999
1000 return do_sync;
1001 }
1002
1003 void gfs2_quota_unlock(struct gfs2_inode *ip)
1004 {
1005 struct gfs2_alloc *al = ip->i_alloc;
1006 struct gfs2_quota_data *qda[4];
1007 unsigned int count = 0;
1008 unsigned int x;
1009
1010 if (!test_and_clear_bit(GIF_QD_LOCKED, &ip->i_flags))
1011 goto out;
1012
1013 for (x = 0; x < al->al_qd_num; x++) {
1014 struct gfs2_quota_data *qd;
1015 int sync;
1016
1017 qd = al->al_qd[x];
1018 sync = need_sync(qd);
1019
1020 gfs2_glock_dq_uninit(&al->al_qd_ghs[x]);
1021
1022 if (sync && qd_trylock(qd))
1023 qda[count++] = qd;
1024 }
1025
1026 if (count) {
1027 do_sync(count, qda);
1028 for (x = 0; x < count; x++)
1029 qd_unlock(qda[x]);
1030 }
1031
1032 out:
1033 gfs2_quota_unhold(ip);
1034 }
1035
1036 #define MAX_LINE 256
1037
1038 static int print_message(struct gfs2_quota_data *qd, char *type)
1039 {
1040 struct gfs2_sbd *sdp = qd->qd_gl->gl_sbd;
1041
1042 printk(KERN_INFO "GFS2: fsid=%s: quota %s for %s %u\n",
1043 sdp->sd_fsname, type,
1044 (test_bit(QDF_USER, &qd->qd_flags)) ? "user" : "group",
1045 qd->qd_id);
1046
1047 return 0;
1048 }
1049
1050 int gfs2_quota_check(struct gfs2_inode *ip, u32 uid, u32 gid)
1051 {
1052 struct gfs2_sbd *sdp = GFS2_SB(&ip->i_inode);
1053 struct gfs2_alloc *al = ip->i_alloc;
1054 struct gfs2_quota_data *qd;
1055 s64 value;
1056 unsigned int x;
1057 int error = 0;
1058
1059 if (!test_bit(GIF_QD_LOCKED, &ip->i_flags))
1060 return 0;
1061
1062 if (sdp->sd_args.ar_quota != GFS2_QUOTA_ON)
1063 return 0;
1064
1065 for (x = 0; x < al->al_qd_num; x++) {
1066 qd = al->al_qd[x];
1067
1068 if (!((qd->qd_id == uid && test_bit(QDF_USER, &qd->qd_flags)) ||
1069 (qd->qd_id == gid && !test_bit(QDF_USER, &qd->qd_flags))))
1070 continue;
1071
1072 value = (s64)be64_to_cpu(qd->qd_qb.qb_value);
1073 spin_lock(&qd_lru_lock);
1074 value += qd->qd_change;
1075 spin_unlock(&qd_lru_lock);
1076
1077 if (be64_to_cpu(qd->qd_qb.qb_limit) && (s64)be64_to_cpu(qd->qd_qb.qb_limit) < value) {
1078 print_message(qd, "exceeded");
1079 quota_send_warning(test_bit(QDF_USER, &qd->qd_flags) ?
1080 USRQUOTA : GRPQUOTA, qd->qd_id,
1081 sdp->sd_vfs->s_dev, QUOTA_NL_BHARDWARN);
1082
1083 error = -EDQUOT;
1084 break;
1085 } else if (be64_to_cpu(qd->qd_qb.qb_warn) &&
1086 (s64)be64_to_cpu(qd->qd_qb.qb_warn) < value &&
1087 time_after_eq(jiffies, qd->qd_last_warn +
1088 gfs2_tune_get(sdp,
1089 gt_quota_warn_period) * HZ)) {
1090 quota_send_warning(test_bit(QDF_USER, &qd->qd_flags) ?
1091 USRQUOTA : GRPQUOTA, qd->qd_id,
1092 sdp->sd_vfs->s_dev, QUOTA_NL_BSOFTWARN);
1093 error = print_message(qd, "warning");
1094 qd->qd_last_warn = jiffies;
1095 }
1096 }
1097
1098 return error;
1099 }
1100
1101 void gfs2_quota_change(struct gfs2_inode *ip, s64 change,
1102 u32 uid, u32 gid)
1103 {
1104 struct gfs2_alloc *al = ip->i_alloc;
1105 struct gfs2_quota_data *qd;
1106 unsigned int x;
1107
1108 if (gfs2_assert_warn(GFS2_SB(&ip->i_inode), change))
1109 return;
1110 if (ip->i_diskflags & GFS2_DIF_SYSTEM)
1111 return;
1112
1113 for (x = 0; x < al->al_qd_num; x++) {
1114 qd = al->al_qd[x];
1115
1116 if ((qd->qd_id == uid && test_bit(QDF_USER, &qd->qd_flags)) ||
1117 (qd->qd_id == gid && !test_bit(QDF_USER, &qd->qd_flags))) {
1118 do_qc(qd, change);
1119 }
1120 }
1121 }
1122
1123 int gfs2_quota_sync(struct super_block *sb, int type, int wait)
1124 {
1125 struct gfs2_sbd *sdp = sb->s_fs_info;
1126 struct gfs2_quota_data **qda;
1127 unsigned int max_qd = gfs2_tune_get(sdp, gt_quota_simul_sync);
1128 unsigned int num_qd;
1129 unsigned int x;
1130 int error = 0;
1131
1132 sdp->sd_quota_sync_gen++;
1133
1134 qda = kcalloc(max_qd, sizeof(struct gfs2_quota_data *), GFP_KERNEL);
1135 if (!qda)
1136 return -ENOMEM;
1137
1138 do {
1139 num_qd = 0;
1140
1141 for (;;) {
1142 error = qd_fish(sdp, qda + num_qd);
1143 if (error || !qda[num_qd])
1144 break;
1145 if (++num_qd == max_qd)
1146 break;
1147 }
1148
1149 if (num_qd) {
1150 if (!error)
1151 error = do_sync(num_qd, qda);
1152 if (!error)
1153 for (x = 0; x < num_qd; x++)
1154 qda[x]->qd_sync_gen =
1155 sdp->sd_quota_sync_gen;
1156
1157 for (x = 0; x < num_qd; x++)
1158 qd_unlock(qda[x]);
1159 }
1160 } while (!error && num_qd == max_qd);
1161
1162 kfree(qda);
1163
1164 return error;
1165 }
1166
1167 static int gfs2_quota_sync_timeo(struct super_block *sb, int type)
1168 {
1169 return gfs2_quota_sync(sb, type, 0);
1170 }
1171
1172 int gfs2_quota_refresh(struct gfs2_sbd *sdp, int user, u32 id)
1173 {
1174 struct gfs2_quota_data *qd;
1175 struct gfs2_holder q_gh;
1176 int error;
1177
1178 error = qd_get(sdp, user, id, &qd);
1179 if (error)
1180 return error;
1181
1182 error = do_glock(qd, FORCE, &q_gh);
1183 if (!error)
1184 gfs2_glock_dq_uninit(&q_gh);
1185
1186 qd_put(qd);
1187 return error;
1188 }
1189
1190 static void gfs2_quota_change_in(struct gfs2_quota_change_host *qc, const void *buf)
1191 {
1192 const struct gfs2_quota_change *str = buf;
1193
1194 qc->qc_change = be64_to_cpu(str->qc_change);
1195 qc->qc_flags = be32_to_cpu(str->qc_flags);
1196 qc->qc_id = be32_to_cpu(str->qc_id);
1197 }
1198
1199 int gfs2_quota_init(struct gfs2_sbd *sdp)
1200 {
1201 struct gfs2_inode *ip = GFS2_I(sdp->sd_qc_inode);
1202 u64 size = i_size_read(sdp->sd_qc_inode);
1203 unsigned int blocks = size >> sdp->sd_sb.sb_bsize_shift;
1204 unsigned int x, slot = 0;
1205 unsigned int found = 0;
1206 u64 dblock;
1207 u32 extlen = 0;
1208 int error;
1209
1210 if (gfs2_check_internal_file_size(sdp->sd_qc_inode, 1, 64 << 20))
1211 return -EIO;
1212
1213 sdp->sd_quota_slots = blocks * sdp->sd_qc_per_block;
1214 sdp->sd_quota_chunks = DIV_ROUND_UP(sdp->sd_quota_slots, 8 * PAGE_SIZE);
1215
1216 error = -ENOMEM;
1217
1218 sdp->sd_quota_bitmap = kcalloc(sdp->sd_quota_chunks,
1219 sizeof(unsigned char *), GFP_NOFS);
1220 if (!sdp->sd_quota_bitmap)
1221 return error;
1222
1223 for (x = 0; x < sdp->sd_quota_chunks; x++) {
1224 sdp->sd_quota_bitmap[x] = kzalloc(PAGE_SIZE, GFP_NOFS);
1225 if (!sdp->sd_quota_bitmap[x])
1226 goto fail;
1227 }
1228
1229 for (x = 0; x < blocks; x++) {
1230 struct buffer_head *bh;
1231 unsigned int y;
1232
1233 if (!extlen) {
1234 int new = 0;
1235 error = gfs2_extent_map(&ip->i_inode, x, &new, &dblock, &extlen);
1236 if (error)
1237 goto fail;
1238 }
1239 error = -EIO;
1240 bh = gfs2_meta_ra(ip->i_gl, dblock, extlen);
1241 if (!bh)
1242 goto fail;
1243 if (gfs2_metatype_check(sdp, bh, GFS2_METATYPE_QC)) {
1244 brelse(bh);
1245 goto fail;
1246 }
1247
1248 for (y = 0; y < sdp->sd_qc_per_block && slot < sdp->sd_quota_slots;
1249 y++, slot++) {
1250 struct gfs2_quota_change_host qc;
1251 struct gfs2_quota_data *qd;
1252
1253 gfs2_quota_change_in(&qc, bh->b_data +
1254 sizeof(struct gfs2_meta_header) +
1255 y * sizeof(struct gfs2_quota_change));
1256 if (!qc.qc_change)
1257 continue;
1258
1259 error = qd_alloc(sdp, (qc.qc_flags & GFS2_QCF_USER),
1260 qc.qc_id, &qd);
1261 if (error) {
1262 brelse(bh);
1263 goto fail;
1264 }
1265
1266 set_bit(QDF_CHANGE, &qd->qd_flags);
1267 qd->qd_change = qc.qc_change;
1268 qd->qd_slot = slot;
1269 qd->qd_slot_count = 1;
1270
1271 spin_lock(&qd_lru_lock);
1272 gfs2_icbit_munge(sdp, sdp->sd_quota_bitmap, slot, 1);
1273 list_add(&qd->qd_list, &sdp->sd_quota_list);
1274 atomic_inc(&sdp->sd_quota_count);
1275 spin_unlock(&qd_lru_lock);
1276
1277 found++;
1278 }
1279
1280 brelse(bh);
1281 dblock++;
1282 extlen--;
1283 }
1284
1285 if (found)
1286 fs_info(sdp, "found %u quota changes\n", found);
1287
1288 return 0;
1289
1290 fail:
1291 gfs2_quota_cleanup(sdp);
1292 return error;
1293 }
1294
1295 void gfs2_quota_cleanup(struct gfs2_sbd *sdp)
1296 {
1297 struct list_head *head = &sdp->sd_quota_list;
1298 struct gfs2_quota_data *qd;
1299 unsigned int x;
1300
1301 spin_lock(&qd_lru_lock);
1302 while (!list_empty(head)) {
1303 qd = list_entry(head->prev, struct gfs2_quota_data, qd_list);
1304
1305 if (atomic_read(&qd->qd_count) > 1 ||
1306 (atomic_read(&qd->qd_count) &&
1307 !test_bit(QDF_CHANGE, &qd->qd_flags))) {
1308 list_move(&qd->qd_list, head);
1309 spin_unlock(&qd_lru_lock);
1310 schedule();
1311 spin_lock(&qd_lru_lock);
1312 continue;
1313 }
1314
1315 list_del(&qd->qd_list);
1316 /* Also remove if this qd exists in the reclaim list */
1317 if (!list_empty(&qd->qd_reclaim)) {
1318 list_del_init(&qd->qd_reclaim);
1319 atomic_dec(&qd_lru_count);
1320 }
1321 atomic_dec(&sdp->sd_quota_count);
1322 spin_unlock(&qd_lru_lock);
1323
1324 if (!atomic_read(&qd->qd_count)) {
1325 gfs2_assert_warn(sdp, !qd->qd_change);
1326 gfs2_assert_warn(sdp, !qd->qd_slot_count);
1327 } else
1328 gfs2_assert_warn(sdp, qd->qd_slot_count == 1);
1329 gfs2_assert_warn(sdp, !qd->qd_bh_count);
1330
1331 gfs2_glock_put(qd->qd_gl);
1332 kmem_cache_free(gfs2_quotad_cachep, qd);
1333
1334 spin_lock(&qd_lru_lock);
1335 }
1336 spin_unlock(&qd_lru_lock);
1337
1338 gfs2_assert_warn(sdp, !atomic_read(&sdp->sd_quota_count));
1339
1340 if (sdp->sd_quota_bitmap) {
1341 for (x = 0; x < sdp->sd_quota_chunks; x++)
1342 kfree(sdp->sd_quota_bitmap[x]);
1343 kfree(sdp->sd_quota_bitmap);
1344 }
1345 }
1346
1347 static void quotad_error(struct gfs2_sbd *sdp, const char *msg, int error)
1348 {
1349 if (error == 0 || error == -EROFS)
1350 return;
1351 if (!test_bit(SDF_SHUTDOWN, &sdp->sd_flags))
1352 fs_err(sdp, "gfs2_quotad: %s error %d\n", msg, error);
1353 }
1354
1355 static void quotad_check_timeo(struct gfs2_sbd *sdp, const char *msg,
1356 int (*fxn)(struct super_block *sb, int type),
1357 unsigned long t, unsigned long *timeo,
1358 unsigned int *new_timeo)
1359 {
1360 if (t >= *timeo) {
1361 int error = fxn(sdp->sd_vfs, 0);
1362 quotad_error(sdp, msg, error);
1363 *timeo = gfs2_tune_get_i(&sdp->sd_tune, new_timeo) * HZ;
1364 } else {
1365 *timeo -= t;
1366 }
1367 }
1368
1369 static void quotad_check_trunc_list(struct gfs2_sbd *sdp)
1370 {
1371 struct gfs2_inode *ip;
1372
1373 while(1) {
1374 ip = NULL;
1375 spin_lock(&sdp->sd_trunc_lock);
1376 if (!list_empty(&sdp->sd_trunc_list)) {
1377 ip = list_entry(sdp->sd_trunc_list.next,
1378 struct gfs2_inode, i_trunc_list);
1379 list_del_init(&ip->i_trunc_list);
1380 }
1381 spin_unlock(&sdp->sd_trunc_lock);
1382 if (ip == NULL)
1383 return;
1384 gfs2_glock_finish_truncate(ip);
1385 }
1386 }
1387
1388 void gfs2_wake_up_statfs(struct gfs2_sbd *sdp) {
1389 if (!sdp->sd_statfs_force_sync) {
1390 sdp->sd_statfs_force_sync = 1;
1391 wake_up(&sdp->sd_quota_wait);
1392 }
1393 }
1394
1395
1396 /**
1397 * gfs2_quotad - Write cached quota changes into the quota file
1398 * @sdp: Pointer to GFS2 superblock
1399 *
1400 */
1401
1402 int gfs2_quotad(void *data)
1403 {
1404 struct gfs2_sbd *sdp = data;
1405 struct gfs2_tune *tune = &sdp->sd_tune;
1406 unsigned long statfs_timeo = 0;
1407 unsigned long quotad_timeo = 0;
1408 unsigned long t = 0;
1409 DEFINE_WAIT(wait);
1410 int empty;
1411
1412 while (!kthread_should_stop()) {
1413
1414 /* Update the master statfs file */
1415 if (sdp->sd_statfs_force_sync) {
1416 int error = gfs2_statfs_sync(sdp->sd_vfs, 0);
1417 quotad_error(sdp, "statfs", error);
1418 statfs_timeo = gfs2_tune_get(sdp, gt_statfs_quantum) * HZ;
1419 }
1420 else
1421 quotad_check_timeo(sdp, "statfs", gfs2_statfs_sync, t,
1422 &statfs_timeo,
1423 &tune->gt_statfs_quantum);
1424
1425 /* Update quota file */
1426 quotad_check_timeo(sdp, "sync", gfs2_quota_sync_timeo, t,
1427 &quotad_timeo, &tune->gt_quota_quantum);
1428
1429 /* Check for & recover partially truncated inodes */
1430 quotad_check_trunc_list(sdp);
1431
1432 if (freezing(current))
1433 refrigerator();
1434 t = min(quotad_timeo, statfs_timeo);
1435
1436 prepare_to_wait(&sdp->sd_quota_wait, &wait, TASK_INTERRUPTIBLE);
1437 spin_lock(&sdp->sd_trunc_lock);
1438 empty = list_empty(&sdp->sd_trunc_list);
1439 spin_unlock(&sdp->sd_trunc_lock);
1440 if (empty && !sdp->sd_statfs_force_sync)
1441 t -= schedule_timeout(t);
1442 else
1443 t = 0;
1444 finish_wait(&sdp->sd_quota_wait, &wait);
1445 }
1446
1447 return 0;
1448 }
1449
1450 static int gfs2_quota_get_xstate(struct super_block *sb,
1451 struct fs_quota_stat *fqs)
1452 {
1453 struct gfs2_sbd *sdp = sb->s_fs_info;
1454
1455 memset(fqs, 0, sizeof(struct fs_quota_stat));
1456 fqs->qs_version = FS_QSTAT_VERSION;
1457
1458 switch (sdp->sd_args.ar_quota) {
1459 case GFS2_QUOTA_ON:
1460 fqs->qs_flags |= (FS_QUOTA_UDQ_ENFD | FS_QUOTA_GDQ_ENFD);
1461 /*FALLTHRU*/
1462 case GFS2_QUOTA_ACCOUNT:
1463 fqs->qs_flags |= (FS_QUOTA_UDQ_ACCT | FS_QUOTA_GDQ_ACCT);
1464 break;
1465 case GFS2_QUOTA_OFF:
1466 break;
1467 }
1468
1469 if (sdp->sd_quota_inode) {
1470 fqs->qs_uquota.qfs_ino = GFS2_I(sdp->sd_quota_inode)->i_no_addr;
1471 fqs->qs_uquota.qfs_nblks = sdp->sd_quota_inode->i_blocks;
1472 }
1473 fqs->qs_uquota.qfs_nextents = 1; /* unsupported */
1474 fqs->qs_gquota = fqs->qs_uquota; /* its the same inode in both cases */
1475 fqs->qs_incoredqs = atomic_read(&qd_lru_count);
1476 return 0;
1477 }
1478
1479 static int gfs2_get_dqblk(struct super_block *sb, int type, qid_t id,
1480 struct fs_disk_quota *fdq)
1481 {
1482 struct gfs2_sbd *sdp = sb->s_fs_info;
1483 struct gfs2_quota_lvb *qlvb;
1484 struct gfs2_quota_data *qd;
1485 struct gfs2_holder q_gh;
1486 int error;
1487
1488 memset(fdq, 0, sizeof(struct fs_disk_quota));
1489
1490 if (sdp->sd_args.ar_quota == GFS2_QUOTA_OFF)
1491 return -ESRCH; /* Crazy XFS error code */
1492
1493 if (type == USRQUOTA)
1494 type = QUOTA_USER;
1495 else if (type == GRPQUOTA)
1496 type = QUOTA_GROUP;
1497 else
1498 return -EINVAL;
1499
1500 error = qd_get(sdp, type, id, &qd);
1501 if (error)
1502 return error;
1503 error = do_glock(qd, FORCE, &q_gh);
1504 if (error)
1505 goto out;
1506
1507 qlvb = (struct gfs2_quota_lvb *)qd->qd_gl->gl_lvb;
1508 fdq->d_version = FS_DQUOT_VERSION;
1509 fdq->d_flags = (type == QUOTA_USER) ? FS_USER_QUOTA : FS_GROUP_QUOTA;
1510 fdq->d_id = id;
1511 fdq->d_blk_hardlimit = be64_to_cpu(qlvb->qb_limit) << sdp->sd_fsb2bb_shift;
1512 fdq->d_blk_softlimit = be64_to_cpu(qlvb->qb_warn) << sdp->sd_fsb2bb_shift;
1513 fdq->d_bcount = be64_to_cpu(qlvb->qb_value) << sdp->sd_fsb2bb_shift;
1514
1515 gfs2_glock_dq_uninit(&q_gh);
1516 out:
1517 qd_put(qd);
1518 return error;
1519 }
1520
1521 /* GFS2 only supports a subset of the XFS fields */
1522 #define GFS2_FIELDMASK (FS_DQ_BSOFT|FS_DQ_BHARD|FS_DQ_BCOUNT)
1523
1524 static int gfs2_set_dqblk(struct super_block *sb, int type, qid_t id,
1525 struct fs_disk_quota *fdq)
1526 {
1527 struct gfs2_sbd *sdp = sb->s_fs_info;
1528 struct gfs2_inode *ip = GFS2_I(sdp->sd_quota_inode);
1529 struct gfs2_quota_data *qd;
1530 struct gfs2_holder q_gh, i_gh;
1531 unsigned int data_blocks, ind_blocks;
1532 unsigned int blocks = 0;
1533 int alloc_required;
1534 struct gfs2_alloc *al;
1535 loff_t offset;
1536 int error;
1537
1538 if (sdp->sd_args.ar_quota == GFS2_QUOTA_OFF)
1539 return -ESRCH; /* Crazy XFS error code */
1540
1541 switch(type) {
1542 case USRQUOTA:
1543 type = QUOTA_USER;
1544 if (fdq->d_flags != FS_USER_QUOTA)
1545 return -EINVAL;
1546 break;
1547 case GRPQUOTA:
1548 type = QUOTA_GROUP;
1549 if (fdq->d_flags != FS_GROUP_QUOTA)
1550 return -EINVAL;
1551 break;
1552 default:
1553 return -EINVAL;
1554 }
1555
1556 if (fdq->d_fieldmask & ~GFS2_FIELDMASK)
1557 return -EINVAL;
1558 if (fdq->d_id != id)
1559 return -EINVAL;
1560
1561 error = qd_get(sdp, type, id, &qd);
1562 if (error)
1563 return error;
1564
1565 mutex_lock(&ip->i_inode.i_mutex);
1566 error = gfs2_glock_nq_init(qd->qd_gl, LM_ST_EXCLUSIVE, 0, &q_gh);
1567 if (error)
1568 goto out_put;
1569 error = gfs2_glock_nq_init(ip->i_gl, LM_ST_EXCLUSIVE, 0, &i_gh);
1570 if (error)
1571 goto out_q;
1572
1573 /* Check for existing entry, if none then alloc new blocks */
1574 error = update_qd(sdp, qd);
1575 if (error)
1576 goto out_i;
1577
1578 /* If nothing has changed, this is a no-op */
1579 if ((fdq->d_fieldmask & FS_DQ_BSOFT) &&
1580 ((fdq->d_blk_softlimit >> sdp->sd_fsb2bb_shift) == be64_to_cpu(qd->qd_qb.qb_warn)))
1581 fdq->d_fieldmask ^= FS_DQ_BSOFT;
1582
1583 if ((fdq->d_fieldmask & FS_DQ_BHARD) &&
1584 ((fdq->d_blk_hardlimit >> sdp->sd_fsb2bb_shift) == be64_to_cpu(qd->qd_qb.qb_limit)))
1585 fdq->d_fieldmask ^= FS_DQ_BHARD;
1586
1587 if ((fdq->d_fieldmask & FS_DQ_BCOUNT) &&
1588 ((fdq->d_bcount >> sdp->sd_fsb2bb_shift) == be64_to_cpu(qd->qd_qb.qb_value)))
1589 fdq->d_fieldmask ^= FS_DQ_BCOUNT;
1590
1591 if (fdq->d_fieldmask == 0)
1592 goto out_i;
1593
1594 offset = qd2offset(qd);
1595 alloc_required = gfs2_write_alloc_required(ip, offset, sizeof(struct gfs2_quota));
1596 if (gfs2_is_stuffed(ip))
1597 alloc_required = 1;
1598 if (alloc_required) {
1599 al = gfs2_alloc_get(ip);
1600 if (al == NULL)
1601 goto out_i;
1602 gfs2_write_calc_reserv(ip, sizeof(struct gfs2_quota),
1603 &data_blocks, &ind_blocks);
1604 blocks = al->al_requested = 1 + data_blocks + ind_blocks;
1605 error = gfs2_inplace_reserve(ip);
1606 if (error)
1607 goto out_alloc;
1608 blocks += gfs2_rg_blocks(al);
1609 }
1610
1611 /* Some quotas span block boundaries and can update two blocks,
1612 adding an extra block to the transaction to handle such quotas */
1613 error = gfs2_trans_begin(sdp, blocks + RES_DINODE + 2, 0);
1614 if (error)
1615 goto out_release;
1616
1617 /* Apply changes */
1618 error = gfs2_adjust_quota(ip, offset, 0, qd, fdq);
1619
1620 gfs2_trans_end(sdp);
1621 out_release:
1622 if (alloc_required) {
1623 gfs2_inplace_release(ip);
1624 out_alloc:
1625 gfs2_alloc_put(ip);
1626 }
1627 out_i:
1628 gfs2_glock_dq_uninit(&i_gh);
1629 out_q:
1630 gfs2_glock_dq_uninit(&q_gh);
1631 out_put:
1632 mutex_unlock(&ip->i_inode.i_mutex);
1633 qd_put(qd);
1634 return error;
1635 }
1636
1637 const struct quotactl_ops gfs2_quotactl_ops = {
1638 .quota_sync = gfs2_quota_sync,
1639 .get_xstate = gfs2_quota_get_xstate,
1640 .get_dqblk = gfs2_get_dqblk,
1641 .set_dqblk = gfs2_set_dqblk,
1642 };
CRIS linux kernel tree