Lines Matching +full:ip +full:- +full:block

1 /* SPDX-License-Identifier: GPL-2.0-only */
3  * Copyright (C) Sistina Software, Inc.  1997-2003 All rights reserved.
4  * Copyright (C) 2004-2008 Red Hat, Inc.  All rights reserved.
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.
37 struct gfs2_alloc *gfs2_alloc_get(struct gfs2_inode *ip);
40 int gfs2_inplace_reserve(struct gfs2_inode *ip,
42 void gfs2_inplace_release(struct gfs2_inode *ip);
44 int gfs2_alloc_blocks(struct gfs2_inode *ip, u64 *bn, unsigned int *n,
48 void gfs2_rs_delete(struct gfs2_inode *ip);
49 void __gfs2_free_blocks(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd,
51 void gfs2_free_meta(struct gfs2_inode *ip, struct gfs2_rgrpd *rgd,
53 void gfs2_free_di(struct gfs2_rgrpd *rgd, struct gfs2_inode *ip);
65 void gfs2_rlist_add(struct gfs2_inode *ip, struct gfs2_rgrp_list *rlist,
66 		    u64 block);
82 	return !RB_EMPTY_NODE(&rs->rs_node);  in gfs2_rs_active()
85 static inline int rgrp_contains_block(struct gfs2_rgrpd *rgd, u64 block)  in rgrp_contains_block()  argument
87 	u64 first = rgd->rd_data0;  in rgrp_contains_block()
88 	u64 last = first + rgd->rd_data;  in rgrp_contains_block()
89 	return first <= block && block < last;  in rgrp_contains_block()
92 void check_and_update_goal(struct gfs2_inode *ip);