blob: d3acf45225c2a4f917383adf6851cf44a5a5ce56 [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
29struct ocfs2_alloc_context;
30int ocfs2_insert_extent(struct ocfs2_super *osb,
Mark Fasheh1fabe142006-10-09 18:11:45 -070031 handle_t *handle,
Mark Fashehccd979b2005-12-15 14:31:24 -080032 struct inode *inode,
33 struct buffer_head *fe_bh,
Mark Fashehdcd05382007-01-16 11:32:23 -080034 u32 cpos,
35 u64 start_blk,
Mark Fashehccd979b2005-12-15 14:31:24 -080036 u32 new_clusters,
37 struct ocfs2_alloc_context *meta_ac);
Mark Fasheh328d5752007-06-18 10:48:04 -070038struct ocfs2_cached_dealloc_ctxt;
39int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *di_bh,
40 handle_t *handle, u32 cpos, u32 len, u32 phys,
41 struct ocfs2_alloc_context *meta_ac,
42 struct ocfs2_cached_dealloc_ctxt *dealloc);
Mark Fashehccd979b2005-12-15 14:31:24 -080043int ocfs2_num_free_extents(struct ocfs2_super *osb,
44 struct inode *inode,
45 struct ocfs2_dinode *fe);
46/* how many new metadata chunks would an allocation need at maximum? */
47static inline int ocfs2_extend_meta_needed(struct ocfs2_dinode *fe)
48{
49 /*
50 * Rather than do all the work of determining how much we need
51 * (involves a ton of reads and locks), just ask for the
52 * maximal limit. That's a tree depth shift. So, one block for
53 * level of the tree (current l_tree_depth), one block for the
54 * new tree_depth==0 extent_block, and one block at the new
55 * top-of-the tree.
56 */
57 return le16_to_cpu(fe->id2.i_list.l_tree_depth) + 2;
58}
59
60int ocfs2_truncate_log_init(struct ocfs2_super *osb);
61void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
62void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
63 int cancel);
64int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
65int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
66 int slot_num,
67 struct ocfs2_dinode **tl_copy);
68int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
69 struct ocfs2_dinode *tl_copy);
70
Mark Fasheh2b604352007-06-22 15:45:27 -070071/*
72 * Process local structure which describes the block unlinks done
73 * during an operation. This is populated via
74 * ocfs2_cache_block_dealloc().
75 *
76 * ocfs2_run_deallocs() should be called after the potentially
77 * de-allocating routines. No journal handles should be open, and most
78 * locks should have been dropped.
79 */
80struct ocfs2_cached_dealloc_ctxt {
81 struct ocfs2_per_slot_free_list *c_first_suballocator;
82};
83static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c)
84{
85 c->c_first_suballocator = NULL;
86}
87int ocfs2_run_deallocs(struct ocfs2_super *osb,
88 struct ocfs2_cached_dealloc_ctxt *ctxt);
89
Mark Fashehccd979b2005-12-15 14:31:24 -080090struct ocfs2_truncate_context {
Mark Fasheh59a5e412007-06-22 15:52:36 -070091 struct ocfs2_cached_dealloc_ctxt tc_dealloc;
Mark Fashehccd979b2005-12-15 14:31:24 -080092 int tc_ext_alloc_locked; /* is it cluster locked? */
93 /* these get destroyed once it's passed to ocfs2_commit_truncate. */
94 struct buffer_head *tc_last_eb_bh;
95};
96
Mark Fasheh60b11392007-02-16 11:46:50 -080097int ocfs2_zero_tail_for_truncate(struct inode *inode, handle_t *handle,
98 u64 new_i_size);
Mark Fashehccd979b2005-12-15 14:31:24 -080099int ocfs2_prepare_truncate(struct ocfs2_super *osb,
100 struct inode *inode,
101 struct buffer_head *fe_bh,
102 struct ocfs2_truncate_context **tc);
103int ocfs2_commit_truncate(struct ocfs2_super *osb,
104 struct inode *inode,
105 struct buffer_head *fe_bh,
106 struct ocfs2_truncate_context *tc);
107
Mark Fasheh363041a2007-01-17 12:31:35 -0800108int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el,
109 u32 cpos, struct buffer_head **leaf_bh);
Mark Fasheh328d5752007-06-18 10:48:04 -0700110int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster);
Mark Fasheh363041a2007-01-17 12:31:35 -0800111
Mark Fashehe48edee2007-03-07 16:46:57 -0800112/*
113 * Helper function to look at the # of clusters in an extent record.
114 */
115static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el,
116 struct ocfs2_extent_rec *rec)
117{
118 /*
119 * Cluster count in extent records is slightly different
120 * between interior nodes and leaf nodes. This is to support
121 * unwritten extents which need a flags field in leaf node
122 * records, thus shrinking the available space for a clusters
123 * field.
124 */
125 if (el->l_tree_depth)
126 return le32_to_cpu(rec->e_int_clusters);
127 else
128 return le16_to_cpu(rec->e_leaf_clusters);
129}
130
Mark Fashehccd979b2005-12-15 14:31:24 -0800131#endif /* OCFS2_ALLOC_H */