Loading...
1/* SPDX-License-Identifier: GPL-2.0-only */
2/*
3 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
4 * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved.
5 */
6
7#ifndef __RGRP_DOT_H__
8#define __RGRP_DOT_H__
9
10#include <linux/slab.h>
11#include <linux/uaccess.h>
12
13/* Since each block in the file system is represented by two bits in the
14 * bitmap, one 64-bit word in the bitmap will represent 32 blocks.
15 * By reserving 32 blocks at a time, we can optimize / shortcut how we search
16 * through the bitmaps by looking a word at a time.
17 */
18#define RGRP_RSRV_MINBLKS 32
19#define RGRP_RSRV_ADDBLKS 64
20
21struct gfs2_rgrpd;
22struct gfs2_sbd;
23struct gfs2_holder;
24
25extern void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd);
26
27extern struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact);
28extern struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp);
29extern struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd);
30
31extern void gfs2_clear_rgrpd(struct gfs2_sbd *sdp);
32extern int gfs2_rindex_update(struct gfs2_sbd *sdp);
33extern void gfs2_free_clones(struct gfs2_rgrpd *rgd);
34extern int gfs2_rgrp_go_lock(struct gfs2_holder *gh);
35extern void gfs2_rgrp_brelse(struct gfs2_rgrpd *rgd);
36extern void gfs2_rgrp_go_unlock(struct gfs2_holder *gh);
37
38extern struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip);
39
40#define GFS2_AF_ORLOV 1
41extern int gfs2_inplace_reserve(struct gfs2_inode *ip,
42 struct gfs2_alloc_parms *ap);
43extern void gfs2_inplace_release(struct gfs2_inode *ip);
44
45extern int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n,
46 bool dinode, u64 *generation);
47
48extern int gfs2_rsqa_alloc(struct gfs2_inode *ip);
49extern void gfs2_rs_deltree(struct gfs2_blkreserv *rs);
50extern void gfs2_rsqa_delete(struct gfs2_inode *ip, atomic_t *wcount);
51extern void __gfs2_free_blocks(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd,
52 u64 bstart, u32 blen, int meta);
53extern void gfs2_free_meta(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd,
54 u64 bstart, u32 blen);
55extern void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip);
56extern void gfs2_unlink_di(struct inode *inode);
57extern int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr,
58 unsigned int type);
59
60struct gfs2_rgrp_list {
61 unsigned int rl_rgrps;
62 unsigned int rl_space;
63 struct gfs2_rgrpd **rl_rgd;
64 struct gfs2_holder *rl_ghs;
65};
66
67extern void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
68 u64 block);
69extern void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist);
70extern void gfs2_rlist_free(struct gfs2_rgrp_list *rlist);
71extern u64 gfs2_ri_total(struct gfs2_sbd *sdp);
72extern void gfs2_rgrp_dump(struct seq_file *seq, struct gfs2_glock *gl,
73 const char *fs_id_buf);
74extern int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
75 struct buffer_head *bh,
76 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed);
77extern int gfs2_fitrim(struct file *filp, void __user *argp);
78
79/* This is how to tell if a reservation is in the rgrp tree: */
80static inline bool gfs2_rs_active(const struct gfs2_blkreserv *rs)
81{
82 return rs && !RB_EMPTY_NODE(&rs->rs_node);
83}
84
85static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)
86{
87 u64 first = rgd->rd_data0;
88 u64 last = first + rgd->rd_data;
89 return first <= block && block < last;
90}
91
92extern void check_and_update_goal(struct gfs2_inode *ip);
93#endif /* __RGRP_DOT_H__ */
1/*
2 * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
3 * Copyright (C) 2004-2008 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#ifndef __RGRP_DOT_H__
11#define __RGRP_DOT_H__
12
13#include <linux/slab.h>
14#include <linux/uaccess.h>
15
16/* Since each block in the file system is represented by two bits in the
17 * bitmap, one 64-bit word in the bitmap will represent 32 blocks.
18 * By reserving 32 blocks at a time, we can optimize / shortcut how we search
19 * through the bitmaps by looking a word at a time.
20 */
21#define RGRP_RSRV_MINBYTES 8
22#define RGRP_RSRV_MINBLKS ((u32)(RGRP_RSRV_MINBYTES * GFS2_NBBY))
23#define RGRP_RSRV_ADDBLKS 64
24
25struct gfs2_rgrpd;
26struct gfs2_sbd;
27struct gfs2_holder;
28
29extern void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd);
30
31extern struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact);
32extern struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp);
33extern struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd);
34
35extern void gfs2_clear_rgrpd(struct gfs2_sbd *sdp);
36extern int gfs2_rindex_update(struct gfs2_sbd *sdp);
37extern void gfs2_free_clones(struct gfs2_rgrpd *rgd);
38extern int gfs2_rgrp_go_lock(struct gfs2_holder *gh);
39extern void gfs2_rgrp_brelse(struct gfs2_rgrpd *rgd);
40extern void gfs2_rgrp_go_unlock(struct gfs2_holder *gh);
41
42extern struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip);
43
44#define GFS2_AF_ORLOV 1
45extern int gfs2_inplace_reserve(struct gfs2_inode *ip,
46 struct gfs2_alloc_parms *ap);
47extern void gfs2_inplace_release(struct gfs2_inode *ip);
48
49extern int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n,
50 bool dinode, u64 *generation);
51
52extern int gfs2_rsqa_alloc(struct gfs2_inode *ip);
53extern void gfs2_rs_deltree(struct gfs2_blkreserv *rs);
54extern void gfs2_rsqa_delete(struct gfs2_inode *ip, atomic_t *wcount);
55extern void __gfs2_free_blocks(struct gfs2_inode *ip, u64 bstart, u32 blen, int meta);
56extern void gfs2_free_meta(struct gfs2_inode *ip, u64 bstart, u32 blen);
57extern void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip);
58extern void gfs2_unlink_di(struct inode *inode);
59extern int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr,
60 unsigned int type);
61
62struct gfs2_rgrp_list {
63 unsigned int rl_rgrps;
64 unsigned int rl_space;
65 struct gfs2_rgrpd **rl_rgd;
66 struct gfs2_holder *rl_ghs;
67};
68
69extern void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
70 u64 block);
71extern void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, unsigned int state);
72extern void gfs2_rlist_free(struct gfs2_rgrp_list *rlist);
73extern u64 gfs2_ri_total(struct gfs2_sbd *sdp);
74extern void gfs2_rgrp_dump(struct seq_file *seq, const struct gfs2_glock *gl);
75extern int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
76 struct buffer_head *bh,
77 const struct gfs2_bitmap *bi, unsigned minlen, u64 *ptrimmed);
78extern int gfs2_fitrim(struct file *filp, void __user *argp);
79
80/* This is how to tell if a reservation is in the rgrp tree: */
81static inline bool gfs2_rs_active(const struct gfs2_blkreserv *rs)
82{
83 return rs && !RB_EMPTY_NODE(&rs->rs_node);
84}
85
86extern void check_and_update_goal(struct gfs2_inode *ip);
87#endif /* __RGRP_DOT_H__ */