xref: /openbmc/linux/fs/ocfs2/alloc.h (revision e7d4cb6b)
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 enum ocfs2_extent_tree_type {
30e7d4cb6bSTao Ma 	OCFS2_DINODE_EXTENT = 0,
31e7d4cb6bSTao Ma };
32e7d4cb6bSTao Ma 
33ccd979bdSMark Fasheh struct ocfs2_alloc_context;
34ccd979bdSMark Fasheh int ocfs2_insert_extent(struct ocfs2_super *osb,
351fabe148SMark Fasheh 			handle_t *handle,
36ccd979bdSMark Fasheh 			struct inode *inode,
37e7d4cb6bSTao Ma 			struct buffer_head *root_bh,
38dcd0538fSMark Fasheh 			u32 cpos,
39dcd0538fSMark Fasheh 			u64 start_blk,
40ccd979bdSMark Fasheh 			u32 new_clusters,
412ae99a60SMark Fasheh 			u8 flags,
42e7d4cb6bSTao Ma 			struct ocfs2_alloc_context *meta_ac,
43e7d4cb6bSTao Ma 			enum ocfs2_extent_tree_type et_type);
44328d5752SMark Fasheh struct ocfs2_cached_dealloc_ctxt;
45e7d4cb6bSTao Ma int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *root_bh,
46328d5752SMark Fasheh 			      handle_t *handle, u32 cpos, u32 len, u32 phys,
47328d5752SMark Fasheh 			      struct ocfs2_alloc_context *meta_ac,
48e7d4cb6bSTao Ma 			      struct ocfs2_cached_dealloc_ctxt *dealloc,
49e7d4cb6bSTao Ma 			      enum ocfs2_extent_tree_type et_type);
50e7d4cb6bSTao Ma int ocfs2_remove_extent(struct inode *inode, struct buffer_head *root_bh,
51063c4561SMark Fasheh 			u32 cpos, u32 len, handle_t *handle,
52063c4561SMark Fasheh 			struct ocfs2_alloc_context *meta_ac,
53e7d4cb6bSTao Ma 			struct ocfs2_cached_dealloc_ctxt *dealloc,
54e7d4cb6bSTao Ma 			enum ocfs2_extent_tree_type et_type);
55ccd979bdSMark Fasheh int ocfs2_num_free_extents(struct ocfs2_super *osb,
56ccd979bdSMark Fasheh 			   struct inode *inode,
57e7d4cb6bSTao Ma 			   struct buffer_head *root_bh,
58e7d4cb6bSTao Ma 			   enum ocfs2_extent_tree_type et_type);
59e7d4cb6bSTao Ma 
60811f933dSTao Ma /*
61811f933dSTao Ma  * how many new metadata chunks would an allocation need at maximum?
62811f933dSTao Ma  *
63811f933dSTao Ma  * Please note that the caller must make sure that root_el is the root
64811f933dSTao Ma  * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
65811f933dSTao Ma  * the result may be wrong.
66811f933dSTao Ma  */
67811f933dSTao Ma static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el)
68ccd979bdSMark Fasheh {
69ccd979bdSMark Fasheh 	/*
70ccd979bdSMark Fasheh 	 * Rather than do all the work of determining how much we need
71ccd979bdSMark Fasheh 	 * (involves a ton of reads and locks), just ask for the
72ccd979bdSMark Fasheh 	 * maximal limit.  That's a tree depth shift.  So, one block for
73ccd979bdSMark Fasheh 	 * level of the tree (current l_tree_depth), one block for the
74ccd979bdSMark Fasheh 	 * new tree_depth==0 extent_block, and one block at the new
75ccd979bdSMark Fasheh 	 * top-of-the tree.
76ccd979bdSMark Fasheh 	 */
77811f933dSTao Ma 	return le16_to_cpu(root_el->l_tree_depth) + 2;
78ccd979bdSMark Fasheh }
79ccd979bdSMark Fasheh 
805b6a3a2bSMark Fasheh void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di);
811afc32b9SMark Fasheh void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di);
821afc32b9SMark Fasheh int ocfs2_convert_inline_data_to_extents(struct inode *inode,
831afc32b9SMark Fasheh 					 struct buffer_head *di_bh);
841afc32b9SMark Fasheh 
85ccd979bdSMark Fasheh int ocfs2_truncate_log_init(struct ocfs2_super *osb);
86ccd979bdSMark Fasheh void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
87ccd979bdSMark Fasheh void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
88ccd979bdSMark Fasheh 				       int cancel);
89ccd979bdSMark Fasheh int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
90ccd979bdSMark Fasheh int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
91ccd979bdSMark Fasheh 				      int slot_num,
92ccd979bdSMark Fasheh 				      struct ocfs2_dinode **tl_copy);
93ccd979bdSMark Fasheh int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
94ccd979bdSMark Fasheh 					 struct ocfs2_dinode *tl_copy);
95063c4561SMark Fasheh int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb);
96063c4561SMark Fasheh int ocfs2_truncate_log_append(struct ocfs2_super *osb,
97063c4561SMark Fasheh 			      handle_t *handle,
98063c4561SMark Fasheh 			      u64 start_blk,
99063c4561SMark Fasheh 			      unsigned int num_clusters);
100063c4561SMark Fasheh int __ocfs2_flush_truncate_log(struct ocfs2_super *osb);
101ccd979bdSMark Fasheh 
1022b604351SMark Fasheh /*
1032b604351SMark Fasheh  * Process local structure which describes the block unlinks done
1042b604351SMark Fasheh  * during an operation. This is populated via
1052b604351SMark Fasheh  * ocfs2_cache_block_dealloc().
1062b604351SMark Fasheh  *
1072b604351SMark Fasheh  * ocfs2_run_deallocs() should be called after the potentially
1082b604351SMark Fasheh  * de-allocating routines. No journal handles should be open, and most
1092b604351SMark Fasheh  * locks should have been dropped.
1102b604351SMark Fasheh  */
1112b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt {
1122b604351SMark Fasheh 	struct ocfs2_per_slot_free_list		*c_first_suballocator;
1132b604351SMark Fasheh };
1142b604351SMark Fasheh static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c)
1152b604351SMark Fasheh {
1162b604351SMark Fasheh 	c->c_first_suballocator = NULL;
1172b604351SMark Fasheh }
1182b604351SMark Fasheh int ocfs2_run_deallocs(struct ocfs2_super *osb,
1192b604351SMark Fasheh 		       struct ocfs2_cached_dealloc_ctxt *ctxt);
1202b604351SMark Fasheh 
121ccd979bdSMark Fasheh struct ocfs2_truncate_context {
12259a5e416SMark Fasheh 	struct ocfs2_cached_dealloc_ctxt tc_dealloc;
123ccd979bdSMark Fasheh 	int tc_ext_alloc_locked; /* is it cluster locked? */
124ccd979bdSMark Fasheh 	/* these get destroyed once it's passed to ocfs2_commit_truncate. */
125ccd979bdSMark Fasheh 	struct buffer_head *tc_last_eb_bh;
126ccd979bdSMark Fasheh };
127ccd979bdSMark Fasheh 
12835edec1dSMark Fasheh int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
12935edec1dSMark Fasheh 				  u64 range_start, u64 range_end);
130ccd979bdSMark Fasheh int ocfs2_prepare_truncate(struct ocfs2_super *osb,
131ccd979bdSMark Fasheh 			   struct inode *inode,
132ccd979bdSMark Fasheh 			   struct buffer_head *fe_bh,
133ccd979bdSMark Fasheh 			   struct ocfs2_truncate_context **tc);
134ccd979bdSMark Fasheh int ocfs2_commit_truncate(struct ocfs2_super *osb,
135ccd979bdSMark Fasheh 			  struct inode *inode,
136ccd979bdSMark Fasheh 			  struct buffer_head *fe_bh,
137ccd979bdSMark Fasheh 			  struct ocfs2_truncate_context *tc);
1381afc32b9SMark Fasheh int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
1391afc32b9SMark Fasheh 			  unsigned int start, unsigned int end, int trunc);
140ccd979bdSMark Fasheh 
141363041a5SMark Fasheh int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
142363041a5SMark Fasheh 		    u32 cpos, struct buffer_head **leaf_bh);
143328d5752SMark Fasheh int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
144363041a5SMark Fasheh 
145e48edee2SMark Fasheh /*
146e48edee2SMark Fasheh  * Helper function to look at the # of clusters in an extent record.
147e48edee2SMark Fasheh  */
148e48edee2SMark Fasheh static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
149e48edee2SMark Fasheh 					      struct ocfs2_extent_rec *rec)
150e48edee2SMark Fasheh {
151e48edee2SMark Fasheh 	/*
152e48edee2SMark Fasheh 	 * Cluster count in extent records is slightly different
153e48edee2SMark Fasheh 	 * between interior nodes and leaf nodes. This is to support
154e48edee2SMark Fasheh 	 * unwritten extents which need a flags field in leaf node
155e48edee2SMark Fasheh 	 * records, thus shrinking the available space for a clusters
156e48edee2SMark Fasheh 	 * field.
157e48edee2SMark Fasheh 	 */
158e48edee2SMark Fasheh 	if (el->l_tree_depth)
159e48edee2SMark Fasheh 		return le32_to_cpu(rec->e_int_clusters);
160e48edee2SMark Fasheh 	else
161e48edee2SMark Fasheh 		return le16_to_cpu(rec->e_leaf_clusters);
162e48edee2SMark Fasheh }
163e48edee2SMark Fasheh 
16400dc417fSMark Fasheh /*
16500dc417fSMark Fasheh  * This is only valid for leaf nodes, which are the only ones that can
16600dc417fSMark Fasheh  * have empty extents anyway.
16700dc417fSMark Fasheh  */
16800dc417fSMark Fasheh static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec)
16900dc417fSMark Fasheh {
17000dc417fSMark Fasheh 	return !rec->e_leaf_clusters;
17100dc417fSMark Fasheh }
17200dc417fSMark Fasheh 
173ccd979bdSMark Fasheh #endif /* OCFS2_ALLOC_H */
174