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
21 struct gfs2_rgrpd;
22 struct gfs2_sbd;
23 struct gfs2_holder;
24
25 void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd);
26
27 struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact);
28 struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp);
29 struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd);
30
31 void gfs2_clear_rgrpd(struct gfs2_sbd *sdp);
32 int gfs2_rindex_update(struct gfs2_sbd *sdp);
33 void gfs2_free_clones(struct gfs2_rgrpd *rgd);
34 int gfs2_rgrp_go_instantiate(struct gfs2_glock *gl);
35 void gfs2_rgrp_brelse(struct gfs2_rgrpd *rgd);
36
37 struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip);
38
39 #define GFS2_AF_ORLOV 1
40 int gfs2_inplace_reserve(struct gfs2_inode *ip,
41 struct gfs2_alloc_parms *ap);
42 void gfs2_inplace_release(struct gfs2_inode *ip);
43
44 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n,
45 bool dinode);
46
47 void gfs2_rs_deltree(struct gfs2_blkreserv *rs);
48 void gfs2_rs_delete(struct gfs2_inode *ip);
49 void __gfs2_free_blocks(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd,
50 u64 bstart, u32 blen, int meta);
51 void gfs2_free_meta(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd,
52 u64 bstart, u32 blen);
53 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip);
54 void gfs2_unlink_di(struct inode *inode);
55 int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr,
56 unsigned int type);
57
58 struct gfs2_rgrp_list {
59 unsigned int rl_rgrps;
60 unsigned int rl_space;
61 struct gfs2_rgrpd **rl_rgd;
62 struct gfs2_holder *rl_ghs;
63 };
64
65 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
66 u64 block);
67 void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist,
68 unsigned int state, u16 flags);
69 void gfs2_rlist_free(struct gfs2_rgrp_list *rlist);
70 u64 gfs2_ri_total(struct gfs2_sbd *sdp);
71 void gfs2_rgrp_dump(struct seq_file *seq, struct gfs2_rgrpd *rgd,
72 const char *fs_id_buf);
73 int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset,
74 struct buffer_head *bh,
75 const struct gfs2_bitmap *bi, unsigned minlen,
76 u64 *ptrimmed);
77 int gfs2_fitrim(struct file *filp, void __user *argp);
78
79 /* This is how to tell if a reservation is in the rgrp tree: */
gfs2_rs_active(const struct gfs2_blkreserv * rs)80 static inline bool gfs2_rs_active(const struct gfs2_blkreserv *rs)
81 {
82 return !RB_EMPTY_NODE(&rs->rs_node);
83 }
84
rgrp_contains_block(struct gfs2_rgrpd * rgd,u64 block)85 static 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
92 void check_and_update_goal(struct gfs2_inode *ip);
93
94 void rgrp_lock_local(struct gfs2_rgrpd *rgd);
95 void rgrp_unlock_local(struct gfs2_rgrpd *rgd);
96
97 #endif /* __RGRP_DOT_H__ */
98