blob: 473c8bcc62fbc097d44dfb7e7730bd59b5c9df78 [file] [log] [blame]
Mark Fashehccd979b2005-12-15 14:31:24 -08001/* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
3 *
4 * alloc.h
5 *
6 * Function prototypes
7 *
8 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
9 *
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
14 *
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
19 *
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
24 */
25
26#ifndef OCFS2_ALLOC_H
27#define OCFS2_ALLOC_H
28
Tao Mae7d4cb62008-08-18 17:38:44 +080029enum ocfs2_extent_tree_type {
30 OCFS2_DINODE_EXTENT = 0,
31};
32
Mark Fashehccd979b2005-12-15 14:31:24 -080033struct ocfs2_alloc_context;
34int ocfs2_insert_extent(struct ocfs2_super *osb,
Mark Fasheh1fabe142006-10-09 18:11:45 -070035 handle_t *handle,
Mark Fashehccd979b2005-12-15 14:31:24 -080036 struct inode *inode,
Tao Mae7d4cb62008-08-18 17:38:44 +080037 struct buffer_head *root_bh,
Mark Fashehdcd05382007-01-16 11:32:23 -080038 u32 cpos,
39 u64 start_blk,
Mark Fashehccd979b2005-12-15 14:31:24 -080040 u32 new_clusters,
Mark Fasheh2ae99a62007-03-09 16:43:28 -080041 u8 flags,
Tao Mae7d4cb62008-08-18 17:38:44 +080042 struct ocfs2_alloc_context *meta_ac,
43 enum ocfs2_extent_tree_type et_type);
Mark Fasheh328d5752007-06-18 10:48:04 -070044struct ocfs2_cached_dealloc_ctxt;
Tao Mae7d4cb62008-08-18 17:38:44 +080045int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *root_bh,
Mark Fasheh328d5752007-06-18 10:48:04 -070046 handle_t *handle, u32 cpos, u32 len, u32 phys,
47 struct ocfs2_alloc_context *meta_ac,
Tao Mae7d4cb62008-08-18 17:38:44 +080048 struct ocfs2_cached_dealloc_ctxt *dealloc,
49 enum ocfs2_extent_tree_type et_type);
50int ocfs2_remove_extent(struct inode *inode, struct buffer_head *root_bh,
Mark Fasheh063c4562007-07-03 13:34:11 -070051 u32 cpos, u32 len, handle_t *handle,
52 struct ocfs2_alloc_context *meta_ac,
Tao Mae7d4cb62008-08-18 17:38:44 +080053 struct ocfs2_cached_dealloc_ctxt *dealloc,
54 enum ocfs2_extent_tree_type et_type);
Mark Fashehccd979b2005-12-15 14:31:24 -080055int ocfs2_num_free_extents(struct ocfs2_super *osb,
56 struct inode *inode,
Tao Mae7d4cb62008-08-18 17:38:44 +080057 struct buffer_head *root_bh,
58 enum ocfs2_extent_tree_type et_type);
59
Tao Ma811f9332008-08-18 17:38:43 +080060/*
61 * how many new metadata chunks would an allocation need at maximum?
62 *
63 * Please note that the caller must make sure that root_el is the root
64 * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
65 * the result may be wrong.
66 */
67static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el)
Mark Fashehccd979b2005-12-15 14:31:24 -080068{
69 /*
70 * Rather than do all the work of determining how much we need
71 * (involves a ton of reads and locks), just ask for the
72 * maximal limit. That's a tree depth shift. So, one block for
73 * level of the tree (current l_tree_depth), one block for the
74 * new tree_depth==0 extent_block, and one block at the new
75 * top-of-the tree.
76 */
Tao Ma811f9332008-08-18 17:38:43 +080077 return le16_to_cpu(root_el->l_tree_depth) + 2;
Mark Fashehccd979b2005-12-15 14:31:24 -080078}
79
Mark Fasheh5b6a3a22007-09-13 16:33:54 -070080void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di);
Mark Fasheh1afc32b2007-09-07 14:46:51 -070081void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di);
82int ocfs2_convert_inline_data_to_extents(struct inode *inode,
83 struct buffer_head *di_bh);
84
Mark Fashehccd979b2005-12-15 14:31:24 -080085int ocfs2_truncate_log_init(struct ocfs2_super *osb);
86void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
87void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
88 int cancel);
89int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
90int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
91 int slot_num,
92 struct ocfs2_dinode **tl_copy);
93int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
94 struct ocfs2_dinode *tl_copy);
Mark Fasheh063c4562007-07-03 13:34:11 -070095int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb);
96int ocfs2_truncate_log_append(struct ocfs2_super *osb,
97 handle_t *handle,
98 u64 start_blk,
99 unsigned int num_clusters);
100int __ocfs2_flush_truncate_log(struct ocfs2_super *osb);
Mark Fashehccd979b2005-12-15 14:31:24 -0800101
Mark Fasheh2b604352007-06-22 15:45:27 -0700102/*
103 * Process local structure which describes the block unlinks done
104 * during an operation. This is populated via
105 * ocfs2_cache_block_dealloc().
106 *
107 * ocfs2_run_deallocs() should be called after the potentially
108 * de-allocating routines. No journal handles should be open, and most
109 * locks should have been dropped.
110 */
111struct ocfs2_cached_dealloc_ctxt {
112 struct ocfs2_per_slot_free_list *c_first_suballocator;
113};
114static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c)
115{
116 c->c_first_suballocator = NULL;
117}
118int ocfs2_run_deallocs(struct ocfs2_super *osb,
119 struct ocfs2_cached_dealloc_ctxt *ctxt);
120
Mark Fashehccd979b2005-12-15 14:31:24 -0800121struct ocfs2_truncate_context {
Mark Fasheh59a5e412007-06-22 15:52:36 -0700122 struct ocfs2_cached_dealloc_ctxt tc_dealloc;
Mark Fashehccd979b2005-12-15 14:31:24 -0800123 int tc_ext_alloc_locked; /* is it cluster locked? */
124 /* these get destroyed once it's passed to ocfs2_commit_truncate. */
125 struct buffer_head *tc_last_eb_bh;
126};
127
Mark Fasheh35edec12007-07-06 14:41:18 -0700128int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle,
129 u64 range_start, u64 range_end);
Mark Fashehccd979b2005-12-15 14:31:24 -0800130int ocfs2_prepare_truncate(struct ocfs2_super *osb,
131 struct inode *inode,
132 struct buffer_head *fe_bh,
133 struct ocfs2_truncate_context **tc);
134int ocfs2_commit_truncate(struct ocfs2_super *osb,
135 struct inode *inode,
136 struct buffer_head *fe_bh,
137 struct ocfs2_truncate_context *tc);
Mark Fasheh1afc32b2007-09-07 14:46:51 -0700138int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh,
139 unsigned int start, unsigned int end, int trunc);
Mark Fashehccd979b2005-12-15 14:31:24 -0800140
Mark Fasheh363041a2007-01-17 12:31:35 -0800141int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
142 u32 cpos, struct buffer_head **leaf_bh);
Mark Fasheh328d5752007-06-18 10:48:04 -0700143int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
Mark Fasheh363041a2007-01-17 12:31:35 -0800144
Mark Fashehe48edee2007-03-07 16:46:57 -0800145/*
146 * Helper function to look at the # of clusters in an extent record.
147 */
148static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
149 struct ocfs2_extent_rec *rec)
150{
151 /*
152 * Cluster count in extent records is slightly different
153 * between interior nodes and leaf nodes. This is to support
154 * unwritten extents which need a flags field in leaf node
155 * records, thus shrinking the available space for a clusters
156 * field.
157 */
158 if (el->l_tree_depth)
159 return le32_to_cpu(rec->e_int_clusters);
160 else
161 return le16_to_cpu(rec->e_leaf_clusters);
162}
163
Mark Fasheh00dc4172008-10-03 17:32:11 -0400164/*
165 * This is only valid for leaf nodes, which are the only ones that can
166 * have empty extents anyway.
167 */
168static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec)
169{
170 return !rec->e_leaf_clusters;
171}
172
Mark Fashehccd979b2005-12-15 14:31:24 -0800173#endif /* OCFS2_ALLOC_H */