xref: /openbmc/linux/fs/ocfs2/alloc.h (revision f99b9b7c)
1ccd979bdSMark Fasheh /* -*- mode: c; c-basic-offset: 8; -*-
2ccd979bdSMark Fasheh  * vim: noexpandtab sw=8 ts=8 sts=0:
3ccd979bdSMark Fasheh  *
4ccd979bdSMark Fasheh  * alloc.h
5ccd979bdSMark Fasheh  *
6ccd979bdSMark Fasheh  * Function prototypes
7ccd979bdSMark Fasheh  *
8ccd979bdSMark Fasheh  * Copyright (C) 2002, 2004 Oracle.  All rights reserved.
9ccd979bdSMark Fasheh  *
10ccd979bdSMark Fasheh  * This program is free software; you can redistribute it and/or
11ccd979bdSMark Fasheh  * modify it under the terms of the GNU General Public
12ccd979bdSMark Fasheh  * License as published by the Free Software Foundation; either
13ccd979bdSMark Fasheh  * version 2 of the License, or (at your option) any later version.
14ccd979bdSMark Fasheh  *
15ccd979bdSMark Fasheh  * This program is distributed in the hope that it will be useful,
16ccd979bdSMark Fasheh  * but WITHOUT ANY WARRANTY; without even the implied warranty of
17ccd979bdSMark Fasheh  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
18ccd979bdSMark Fasheh  * General Public License for more details.
19ccd979bdSMark Fasheh  *
20ccd979bdSMark Fasheh  * You should have received a copy of the GNU General Public
21ccd979bdSMark Fasheh  * License along with this program; if not, write to the
22ccd979bdSMark Fasheh  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23ccd979bdSMark Fasheh  * Boston, MA 021110-1307, USA.
24ccd979bdSMark Fasheh  */
25ccd979bdSMark Fasheh 
26ccd979bdSMark Fasheh #ifndef OCFS2_ALLOC_H
27ccd979bdSMark Fasheh #define OCFS2_ALLOC_H
28ccd979bdSMark Fasheh 
29e7d4cb6bSTao Ma 
30ca12b7c4STao Ma /*
31ca12b7c4STao Ma  * For xattr tree leaf, we limit the leaf byte size to be 64K.
32ca12b7c4STao Ma  */
33ca12b7c4STao Ma #define OCFS2_MAX_XATTR_TREE_LEAF_SIZE 65536
34ca12b7c4STao Ma 
35f99b9b7cSJoel Becker /*
36f99b9b7cSJoel Becker  * ocfs2_extent_tree and ocfs2_extent_tree_operations are used to abstract
37f99b9b7cSJoel Becker  * the b-tree operations in ocfs2. Now all the b-tree operations are not
38f99b9b7cSJoel Becker  * limited to ocfs2_dinode only. Any data which need to allocate clusters
39f99b9b7cSJoel Becker  * to store can use b-tree. And it only needs to implement its ocfs2_extent_tree
40f99b9b7cSJoel Becker  * and operation.
41f99b9b7cSJoel Becker  *
42f99b9b7cSJoel Becker  * ocfs2_extent_tree becomes the first-class object for extent tree
43f99b9b7cSJoel Becker  * manipulation.  Callers of the alloc.c code need to fill it via one of
44f99b9b7cSJoel Becker  * the ocfs2_get_*_extent_tree() operations below.
45f99b9b7cSJoel Becker  *
46f99b9b7cSJoel Becker  * ocfs2_extent_tree contains info for the root of the b-tree, it must have a
47f99b9b7cSJoel Becker  * root ocfs2_extent_list and a root_bh so that they can be used in the b-tree
48f99b9b7cSJoel Becker  * functions.
49f99b9b7cSJoel Becker  * ocfs2_extent_tree_operations abstract the normal operations we do for
50f99b9b7cSJoel Becker  * the root of extent b-tree.
51f99b9b7cSJoel Becker  */
52f99b9b7cSJoel Becker struct ocfs2_extent_tree_operations;
53f99b9b7cSJoel Becker struct ocfs2_extent_tree {
54f99b9b7cSJoel Becker 	struct ocfs2_extent_tree_operations	*et_ops;
55f99b9b7cSJoel Becker 	struct buffer_head			*et_root_bh;
56f99b9b7cSJoel Becker 	struct ocfs2_extent_list		*et_root_el;
57f99b9b7cSJoel Becker 	void					*et_object;
58f99b9b7cSJoel Becker 	unsigned int				et_max_leaf_clusters;
59f99b9b7cSJoel Becker };
60f99b9b7cSJoel Becker 
61f99b9b7cSJoel Becker /*
62f99b9b7cSJoel Becker  * ocfs2_*_get_extent_tree() will fill an ocfs2_extent_tree from the
63f99b9b7cSJoel Becker  * specified object buffer.  The bh is referenced until
64f99b9b7cSJoel Becker  * ocfs2_put_extent_tree().
65f99b9b7cSJoel Becker  */
66f99b9b7cSJoel Becker void ocfs2_get_dinode_extent_tree(struct ocfs2_extent_tree *et,
67f56654c4STao Ma 				  struct inode *inode,
68f99b9b7cSJoel Becker 				  struct buffer_head *bh);
69f99b9b7cSJoel Becker void ocfs2_get_xattr_tree_extent_tree(struct ocfs2_extent_tree *et,
70ccd979bdSMark Fasheh 				      struct inode *inode,
71f99b9b7cSJoel Becker 				      struct buffer_head *bh);
72f99b9b7cSJoel Becker void ocfs2_get_xattr_value_extent_tree(struct ocfs2_extent_tree *et,
73f99b9b7cSJoel Becker 				       struct inode *inode,
74f99b9b7cSJoel Becker 				       struct buffer_head *bh,
751a09f556SJoel Becker 				       struct ocfs2_xattr_value_root *xv);
76f99b9b7cSJoel Becker void ocfs2_put_extent_tree(struct ocfs2_extent_tree *et);
77f99b9b7cSJoel Becker 
78f99b9b7cSJoel Becker struct ocfs2_alloc_context;
79f99b9b7cSJoel Becker int ocfs2_insert_extent(struct ocfs2_super *osb,
80ba492615STao Ma 			handle_t *handle,
81ba492615STao Ma 			struct inode *inode,
82f99b9b7cSJoel Becker 			struct ocfs2_extent_tree *et,
83ba492615STao Ma 			u32 cpos,
84ba492615STao Ma 			u64 start_blk,
85ba492615STao Ma 			u32 new_clusters,
86ba492615STao Ma 			u8 flags,
87ba492615STao Ma 			struct ocfs2_alloc_context *meta_ac);
88f99b9b7cSJoel Becker 
890eb8d47eSTao Ma enum ocfs2_alloc_restarted {
900eb8d47eSTao Ma 	RESTART_NONE = 0,
910eb8d47eSTao Ma 	RESTART_TRANS,
920eb8d47eSTao Ma 	RESTART_META
930eb8d47eSTao Ma };
940eb8d47eSTao Ma int ocfs2_add_clusters_in_btree(struct ocfs2_super *osb,
950eb8d47eSTao Ma 				struct inode *inode,
960eb8d47eSTao Ma 				u32 *logical_offset,
970eb8d47eSTao Ma 				u32 clusters_to_add,
980eb8d47eSTao Ma 				int mark_unwritten,
99f99b9b7cSJoel Becker 				struct ocfs2_extent_tree *et,
1000eb8d47eSTao Ma 				handle_t *handle,
1010eb8d47eSTao Ma 				struct ocfs2_alloc_context *data_ac,
1020eb8d47eSTao Ma 				struct ocfs2_alloc_context *meta_ac,
103f99b9b7cSJoel Becker 				enum ocfs2_alloc_restarted *reason_ret);
104328d5752SMark Fasheh struct ocfs2_cached_dealloc_ctxt;
105f99b9b7cSJoel Becker int ocfs2_mark_extent_written(struct inode *inode,
106f99b9b7cSJoel Becker 			      struct ocfs2_extent_tree *et,
107328d5752SMark Fasheh 			      handle_t *handle, u32 cpos, u32 len, u32 phys,
108328d5752SMark Fasheh 			      struct ocfs2_alloc_context *meta_ac,
109f99b9b7cSJoel Becker 			      struct ocfs2_cached_dealloc_ctxt *dealloc);
110f99b9b7cSJoel Becker int ocfs2_remove_extent(struct inode *inode,
111f99b9b7cSJoel Becker 			struct ocfs2_extent_tree *et,
112063c4561SMark Fasheh 			u32 cpos, u32 len, handle_t *handle,
113063c4561SMark Fasheh 			struct ocfs2_alloc_context *meta_ac,
114f99b9b7cSJoel Becker 			struct ocfs2_cached_dealloc_ctxt *dealloc);
115ccd979bdSMark Fasheh int ocfs2_num_free_extents(struct ocfs2_super *osb,
116ccd979bdSMark Fasheh 			   struct inode *inode,
117f99b9b7cSJoel Becker 			   struct ocfs2_extent_tree *et);
118e7d4cb6bSTao Ma 
119811f933dSTao Ma /*
120811f933dSTao Ma  * how many new metadata chunks would an allocation need at maximum?
121811f933dSTao Ma  *
122811f933dSTao Ma  * Please note that the caller must make sure that root_el is the root
123811f933dSTao Ma  * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
124811f933dSTao Ma  * the result may be wrong.
125811f933dSTao Ma  */
126811f933dSTao Ma static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el)
127ccd979bdSMark Fasheh {
128ccd979bdSMark Fasheh 	/*
129ccd979bdSMark Fasheh 	 * Rather than do all the work of determining how much we need
130ccd979bdSMark Fasheh 	 * (involves a ton of reads and locks), just ask for the
131ccd979bdSMark Fasheh 	 * maximal limit.  That's a tree depth shift.  So, one block for
132ccd979bdSMark Fasheh 	 * level of the tree (current l_tree_depth), one block for the
133ccd979bdSMark Fasheh 	 * new tree_depth==0 extent_block, and one block at the new
134ccd979bdSMark Fasheh 	 * top-of-the tree.
135ccd979bdSMark Fasheh 	 */
136811f933dSTao Ma 	return le16_to_cpu(root_el->l_tree_depth) + 2;
137ccd979bdSMark Fasheh }
138ccd979bdSMark Fasheh 
1395b6a3a2bSMark Fasheh void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di);
1401afc32b9SMark Fasheh void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di);
1411afc32b9SMark Fasheh int ocfs2_convert_inline_data_to_extents(struct inode *inode,
1421afc32b9SMark Fasheh 					 struct buffer_head *di_bh);
1431afc32b9SMark Fasheh 
144ccd979bdSMark Fasheh int ocfs2_truncate_log_init(struct ocfs2_super *osb);
145ccd979bdSMark Fasheh void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
146ccd979bdSMark Fasheh void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
147ccd979bdSMark Fasheh 				       int cancel);
148ccd979bdSMark Fasheh int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
149ccd979bdSMark Fasheh int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
150ccd979bdSMark Fasheh 				      int slot_num,
151ccd979bdSMark Fasheh 				      struct ocfs2_dinode **tl_copy);
152ccd979bdSMark Fasheh int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
153ccd979bdSMark Fasheh 					 struct ocfs2_dinode *tl_copy);
154063c4561SMark Fasheh int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb);
155063c4561SMark Fasheh int ocfs2_truncate_log_append(struct ocfs2_super *osb,
156063c4561SMark Fasheh 			      handle_t *handle,
157063c4561SMark Fasheh 			      u64 start_blk,
158063c4561SMark Fasheh 			      unsigned int num_clusters);
159063c4561SMark Fasheh int __ocfs2_flush_truncate_log(struct ocfs2_super *osb);
160ccd979bdSMark Fasheh 
1612b604351SMark Fasheh /*
1622b604351SMark Fasheh  * Process local structure which describes the block unlinks done
1632b604351SMark Fasheh  * during an operation. This is populated via
1642b604351SMark Fasheh  * ocfs2_cache_block_dealloc().
1652b604351SMark Fasheh  *
1662b604351SMark Fasheh  * ocfs2_run_deallocs() should be called after the potentially
1672b604351SMark Fasheh  * de-allocating routines. No journal handles should be open, and most
1682b604351SMark Fasheh  * locks should have been dropped.
1692b604351SMark Fasheh  */
1702b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt {
1712b604351SMark Fasheh 	struct ocfs2_per_slot_free_list		*c_first_suballocator;
1722b604351SMark Fasheh };
1732b604351SMark Fasheh static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c)
1742b604351SMark Fasheh {
1752b604351SMark Fasheh 	c->c_first_suballocator = NULL;
1762b604351SMark Fasheh }
1772b604351SMark Fasheh int ocfs2_run_deallocs(struct ocfs2_super *osb,
1782b604351SMark Fasheh 		       struct ocfs2_cached_dealloc_ctxt *ctxt);
1792b604351SMark Fasheh 
180ccd979bdSMark Fasheh struct ocfs2_truncate_context {
18159a5e416SMark Fasheh 	struct ocfs2_cached_dealloc_ctxt tc_dealloc;
182ccd979bdSMark Fasheh 	int tc_ext_alloc_locked; /* is it cluster locked? */
183ccd979bdSMark Fasheh 	/* these get destroyed once it's passed to ocfs2_commit_truncate. */
184ccd979bdSMark Fasheh 	struct buffer_head *tc_last_eb_bh;
185ccd979bdSMark Fasheh };
186ccd979bdSMark Fasheh 
18735edec1dSMark Fasheh int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
18835edec1dSMark Fasheh 				  u64 range_start, u64 range_end);
189ccd979bdSMark Fasheh int ocfs2_prepare_truncate(struct ocfs2_super *osb,
190ccd979bdSMark Fasheh 			   struct inode *inode,
191ccd979bdSMark Fasheh 			   struct buffer_head *fe_bh,
192ccd979bdSMark Fasheh 			   struct ocfs2_truncate_context **tc);
193ccd979bdSMark Fasheh int ocfs2_commit_truncate(struct ocfs2_super *osb,
194ccd979bdSMark Fasheh 			  struct inode *inode,
195ccd979bdSMark Fasheh 			  struct buffer_head *fe_bh,
196ccd979bdSMark Fasheh 			  struct ocfs2_truncate_context *tc);
1971afc32b9SMark Fasheh int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
1981afc32b9SMark Fasheh 			  unsigned int start, unsigned int end, int trunc);
199ccd979bdSMark Fasheh 
200363041a5SMark Fasheh int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
201363041a5SMark Fasheh 		    u32 cpos, struct buffer_head **leaf_bh);
202328d5752SMark Fasheh int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
203363041a5SMark Fasheh 
204e48edee2SMark Fasheh /*
205e48edee2SMark Fasheh  * Helper function to look at the # of clusters in an extent record.
206e48edee2SMark Fasheh  */
207e48edee2SMark Fasheh static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
208e48edee2SMark Fasheh 					      struct ocfs2_extent_rec *rec)
209e48edee2SMark Fasheh {
210e48edee2SMark Fasheh 	/*
211e48edee2SMark Fasheh 	 * Cluster count in extent records is slightly different
212e48edee2SMark Fasheh 	 * between interior nodes and leaf nodes. This is to support
213e48edee2SMark Fasheh 	 * unwritten extents which need a flags field in leaf node
214e48edee2SMark Fasheh 	 * records, thus shrinking the available space for a clusters
215e48edee2SMark Fasheh 	 * field.
216e48edee2SMark Fasheh 	 */
217e48edee2SMark Fasheh 	if (el->l_tree_depth)
218e48edee2SMark Fasheh 		return le32_to_cpu(rec->e_int_clusters);
219e48edee2SMark Fasheh 	else
220e48edee2SMark Fasheh 		return le16_to_cpu(rec->e_leaf_clusters);
221e48edee2SMark Fasheh }
222e48edee2SMark Fasheh 
22300dc417fSMark Fasheh /*
22400dc417fSMark Fasheh  * This is only valid for leaf nodes, which are the only ones that can
22500dc417fSMark Fasheh  * have empty extents anyway.
22600dc417fSMark Fasheh  */
22700dc417fSMark Fasheh static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec)
22800dc417fSMark Fasheh {
22900dc417fSMark Fasheh 	return !rec->e_leaf_clusters;
23000dc417fSMark Fasheh }
23100dc417fSMark Fasheh 
232ccd979bdSMark Fasheh #endif /* OCFS2_ALLOC_H */
233