| /* SPDX-License-Identifier: GPL-2.0-only */ | |
| /* | |
| * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved. | |
| * Copyright (C) 2004-2008 Red Hat, Inc. All rights reserved. | |
| */ | |
| #ifndef __RGRP_DOT_H__ | |
| #define __RGRP_DOT_H__ | |
| #include <linux/slab.h> | |
| #include <linux/uaccess.h> | |
| /* Since each block in the file system is represented by two bits in the | |
| * bitmap, one 64-bit word in the bitmap will represent 32 blocks. | |
| * By reserving 32 blocks at a time, we can optimize / shortcut how we search | |
| * through the bitmaps by looking a word at a time. | |
| */ | |
| #define RGRP_RSRV_MINBLKS 32 | |
| #define RGRP_RSRV_ADDBLKS 64 | |
| struct gfs2_rgrpd; | |
| struct gfs2_sbd; | |
| struct gfs2_holder; | |
| void gfs2_rgrp_verify(struct gfs2_rgrpd *rgd); | |
| struct gfs2_rgrpd *gfs2_blk2rgrpd(struct gfs2_sbd *sdp, u64 blk, bool exact); | |
| struct gfs2_rgrpd *gfs2_rgrpd_get_first(struct gfs2_sbd *sdp); | |
| struct gfs2_rgrpd *gfs2_rgrpd_get_next(struct gfs2_rgrpd *rgd); | |
| void gfs2_clear_rgrpd(struct gfs2_sbd *sdp); | |
| int gfs2_rindex_update(struct gfs2_sbd *sdp); | |
| void gfs2_free_clones(struct gfs2_rgrpd *rgd); | |
| int gfs2_rgrp_go_instantiate(struct gfs2_glock *gl); | |
| void gfs2_rgrp_brelse(struct gfs2_rgrpd *rgd); | |
| struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip); | |
| #define GFS2_AF_ORLOV 1 | |
| int gfs2_inplace_reserve(struct gfs2_inode *ip, | |
| struct gfs2_alloc_parms *ap); | |
| void gfs2_inplace_release(struct gfs2_inode *ip); | |
| int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n, | |
| bool dinode); | |
| void gfs2_rs_deltree(struct gfs2_blkreserv *rs); | |
| void gfs2_rs_delete(struct gfs2_inode *ip); | |
| void __gfs2_free_blocks(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd, | |
| u64 bstart, u32 blen, int meta); | |
| void gfs2_free_meta(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd, | |
| u64 bstart, u32 blen); | |
| void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip); | |
| void gfs2_unlink_di(struct inode *inode); | |
| int gfs2_check_blk_type(struct gfs2_sbd *sdp, u64 no_addr, | |
| unsigned int type); | |
| struct gfs2_rgrp_list { | |
| unsigned int rl_rgrps; | |
| unsigned int rl_space; | |
| struct gfs2_rgrpd **rl_rgd; | |
| struct gfs2_holder *rl_ghs; | |
| }; | |
| void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist, | |
| u64 block); | |
| void gfs2_rlist_alloc(struct gfs2_rgrp_list *rlist, | |
| unsigned int state, u16 flags); | |
| void gfs2_rlist_free(struct gfs2_rgrp_list *rlist); | |
| u64 gfs2_ri_total(struct gfs2_sbd *sdp); | |
| void gfs2_rgrp_dump(struct seq_file *seq, struct gfs2_rgrpd *rgd, | |
| const char *fs_id_buf); | |
| int gfs2_rgrp_send_discards(struct gfs2_sbd *sdp, u64 offset, | |
| struct buffer_head *bh, | |
| const struct gfs2_bitmap *bi, unsigned minlen, | |
| u64 *ptrimmed); | |
| int gfs2_fitrim(struct file *filp, void __user *argp); | |
| /* This is how to tell if a reservation is in the rgrp tree: */ | |
| static inline bool gfs2_rs_active(const struct gfs2_blkreserv *rs) | |
| { | |
| return !RB_EMPTY_NODE(&rs->rs_node); | |
| } | |
| static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block) | |
| { | |
| u64 first = rgd->rd_data0; | |
| u64 last = first + rgd->rd_data; | |
| return first <= block && block < last; | |
| } | |
| void check_and_update_goal(struct gfs2_inode *ip); | |
| void rgrp_lock_local(struct gfs2_rgrpd *rgd); | |
| void rgrp_unlock_local(struct gfs2_rgrpd *rgd); | |
| #endif /* __RGRP_DOT_H__ */ |