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 448d6220d6SJoel Becker * the ocfs2_init_*_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 /* 628d6220d6SJoel Becker * ocfs2_init_*_extent_tree() will fill an ocfs2_extent_tree from the 638d6220d6SJoel Becker * specified object buffer. 64f99b9b7cSJoel Becker */ 658d6220d6SJoel Becker void ocfs2_init_dinode_extent_tree(struct ocfs2_extent_tree *et, 66f56654c4STao Ma struct inode *inode, 67f99b9b7cSJoel Becker struct buffer_head *bh); 688d6220d6SJoel Becker void ocfs2_init_xattr_tree_extent_tree(struct ocfs2_extent_tree *et, 69ccd979bdSMark Fasheh struct inode *inode, 70f99b9b7cSJoel Becker struct buffer_head *bh); 718d6220d6SJoel Becker void ocfs2_init_xattr_value_extent_tree(struct ocfs2_extent_tree *et, 72f99b9b7cSJoel Becker struct inode *inode, 73f99b9b7cSJoel Becker struct buffer_head *bh, 741a09f556SJoel Becker struct ocfs2_xattr_value_root *xv); 75f99b9b7cSJoel Becker 76f99b9b7cSJoel Becker struct ocfs2_alloc_context; 77f99b9b7cSJoel Becker int ocfs2_insert_extent(struct ocfs2_super *osb, 78ba492615STao Ma handle_t *handle, 79ba492615STao Ma struct inode *inode, 80f99b9b7cSJoel Becker struct ocfs2_extent_tree *et, 81ba492615STao Ma u32 cpos, 82ba492615STao Ma u64 start_blk, 83ba492615STao Ma u32 new_clusters, 84ba492615STao Ma u8 flags, 85ba492615STao Ma struct ocfs2_alloc_context *meta_ac); 86f99b9b7cSJoel Becker 870eb8d47eSTao Ma enum ocfs2_alloc_restarted { 880eb8d47eSTao Ma RESTART_NONE = 0, 890eb8d47eSTao Ma RESTART_TRANS, 900eb8d47eSTao Ma RESTART_META 910eb8d47eSTao Ma }; 920eb8d47eSTao Ma int ocfs2_add_clusters_in_btree(struct ocfs2_super *osb, 930eb8d47eSTao Ma struct inode *inode, 940eb8d47eSTao Ma u32 *logical_offset, 950eb8d47eSTao Ma u32 clusters_to_add, 960eb8d47eSTao Ma int mark_unwritten, 97f99b9b7cSJoel Becker struct ocfs2_extent_tree *et, 980eb8d47eSTao Ma handle_t *handle, 990eb8d47eSTao Ma struct ocfs2_alloc_context *data_ac, 1000eb8d47eSTao Ma struct ocfs2_alloc_context *meta_ac, 101f99b9b7cSJoel Becker enum ocfs2_alloc_restarted *reason_ret); 102328d5752SMark Fasheh struct ocfs2_cached_dealloc_ctxt; 103f99b9b7cSJoel Becker int ocfs2_mark_extent_written(struct inode *inode, 104f99b9b7cSJoel Becker struct ocfs2_extent_tree *et, 105328d5752SMark Fasheh handle_t *handle, u32 cpos, u32 len, u32 phys, 106328d5752SMark Fasheh struct ocfs2_alloc_context *meta_ac, 107f99b9b7cSJoel Becker struct ocfs2_cached_dealloc_ctxt *dealloc); 108f99b9b7cSJoel Becker int ocfs2_remove_extent(struct inode *inode, 109f99b9b7cSJoel Becker struct ocfs2_extent_tree *et, 110063c4561SMark Fasheh u32 cpos, u32 len, handle_t *handle, 111063c4561SMark Fasheh struct ocfs2_alloc_context *meta_ac, 112f99b9b7cSJoel Becker struct ocfs2_cached_dealloc_ctxt *dealloc); 113ccd979bdSMark Fasheh int ocfs2_num_free_extents(struct ocfs2_super *osb, 114ccd979bdSMark Fasheh struct inode *inode, 115f99b9b7cSJoel Becker struct ocfs2_extent_tree *et); 116e7d4cb6bSTao Ma 117811f933dSTao Ma /* 118811f933dSTao Ma * how many new metadata chunks would an allocation need at maximum? 119811f933dSTao Ma * 120811f933dSTao Ma * Please note that the caller must make sure that root_el is the root 121811f933dSTao Ma * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise 122811f933dSTao Ma * the result may be wrong. 123811f933dSTao Ma */ 124811f933dSTao Ma static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el) 125ccd979bdSMark Fasheh { 126ccd979bdSMark Fasheh /* 127ccd979bdSMark Fasheh * Rather than do all the work of determining how much we need 128ccd979bdSMark Fasheh * (involves a ton of reads and locks), just ask for the 129ccd979bdSMark Fasheh * maximal limit. That's a tree depth shift. So, one block for 130ccd979bdSMark Fasheh * level of the tree (current l_tree_depth), one block for the 131ccd979bdSMark Fasheh * new tree_depth==0 extent_block, and one block at the new 132ccd979bdSMark Fasheh * top-of-the tree. 133ccd979bdSMark Fasheh */ 134811f933dSTao Ma return le16_to_cpu(root_el->l_tree_depth) + 2; 135ccd979bdSMark Fasheh } 136ccd979bdSMark Fasheh 1375b6a3a2bSMark Fasheh void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di); 1381afc32b9SMark Fasheh void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di); 1391afc32b9SMark Fasheh int ocfs2_convert_inline_data_to_extents(struct inode *inode, 1401afc32b9SMark Fasheh struct buffer_head *di_bh); 1411afc32b9SMark Fasheh 142ccd979bdSMark Fasheh int ocfs2_truncate_log_init(struct ocfs2_super *osb); 143ccd979bdSMark Fasheh void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb); 144ccd979bdSMark Fasheh void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb, 145ccd979bdSMark Fasheh int cancel); 146ccd979bdSMark Fasheh int ocfs2_flush_truncate_log(struct ocfs2_super *osb); 147ccd979bdSMark Fasheh int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb, 148ccd979bdSMark Fasheh int slot_num, 149ccd979bdSMark Fasheh struct ocfs2_dinode **tl_copy); 150ccd979bdSMark Fasheh int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb, 151ccd979bdSMark Fasheh struct ocfs2_dinode *tl_copy); 152063c4561SMark Fasheh int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb); 153063c4561SMark Fasheh int ocfs2_truncate_log_append(struct ocfs2_super *osb, 154063c4561SMark Fasheh handle_t *handle, 155063c4561SMark Fasheh u64 start_blk, 156063c4561SMark Fasheh unsigned int num_clusters); 157063c4561SMark Fasheh int __ocfs2_flush_truncate_log(struct ocfs2_super *osb); 158ccd979bdSMark Fasheh 1592b604351SMark Fasheh /* 1602b604351SMark Fasheh * Process local structure which describes the block unlinks done 1612b604351SMark Fasheh * during an operation. This is populated via 1622b604351SMark Fasheh * ocfs2_cache_block_dealloc(). 1632b604351SMark Fasheh * 1642b604351SMark Fasheh * ocfs2_run_deallocs() should be called after the potentially 1652b604351SMark Fasheh * de-allocating routines. No journal handles should be open, and most 1662b604351SMark Fasheh * locks should have been dropped. 1672b604351SMark Fasheh */ 1682b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt { 1692b604351SMark Fasheh struct ocfs2_per_slot_free_list *c_first_suballocator; 1702891d290STao Ma struct ocfs2_cached_block_free *c_global_allocator; 1712b604351SMark Fasheh }; 1722b604351SMark Fasheh static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c) 1732b604351SMark Fasheh { 1742b604351SMark Fasheh c->c_first_suballocator = NULL; 1752891d290STao Ma c->c_global_allocator = NULL; 1762b604351SMark Fasheh } 1772891d290STao Ma int ocfs2_cache_cluster_dealloc(struct ocfs2_cached_dealloc_ctxt *ctxt, 1782891d290STao Ma u64 blkno, unsigned int bit); 1792b604351SMark Fasheh int ocfs2_run_deallocs(struct ocfs2_super *osb, 1802b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt *ctxt); 1812b604351SMark Fasheh 182ccd979bdSMark Fasheh struct ocfs2_truncate_context { 18359a5e416SMark Fasheh struct ocfs2_cached_dealloc_ctxt tc_dealloc; 184ccd979bdSMark Fasheh int tc_ext_alloc_locked; /* is it cluster locked? */ 185ccd979bdSMark Fasheh /* these get destroyed once it's passed to ocfs2_commit_truncate. */ 186ccd979bdSMark Fasheh struct buffer_head *tc_last_eb_bh; 187ccd979bdSMark Fasheh }; 188ccd979bdSMark Fasheh 18935edec1dSMark Fasheh int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle, 19035edec1dSMark Fasheh u64 range_start, u64 range_end); 191ccd979bdSMark Fasheh int ocfs2_prepare_truncate(struct ocfs2_super *osb, 192ccd979bdSMark Fasheh struct inode *inode, 193ccd979bdSMark Fasheh struct buffer_head *fe_bh, 194ccd979bdSMark Fasheh struct ocfs2_truncate_context **tc); 195ccd979bdSMark Fasheh int ocfs2_commit_truncate(struct ocfs2_super *osb, 196ccd979bdSMark Fasheh struct inode *inode, 197ccd979bdSMark Fasheh struct buffer_head *fe_bh, 198ccd979bdSMark Fasheh struct ocfs2_truncate_context *tc); 1991afc32b9SMark Fasheh int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh, 2001afc32b9SMark Fasheh unsigned int start, unsigned int end, int trunc); 201ccd979bdSMark Fasheh 202363041a5SMark Fasheh int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el, 203363041a5SMark Fasheh u32 cpos, struct buffer_head **leaf_bh); 204328d5752SMark Fasheh int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster); 205363041a5SMark Fasheh 206e48edee2SMark Fasheh /* 207e48edee2SMark Fasheh * Helper function to look at the # of clusters in an extent record. 208e48edee2SMark Fasheh */ 209e48edee2SMark Fasheh static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el, 210e48edee2SMark Fasheh struct ocfs2_extent_rec *rec) 211e48edee2SMark Fasheh { 212e48edee2SMark Fasheh /* 213e48edee2SMark Fasheh * Cluster count in extent records is slightly different 214e48edee2SMark Fasheh * between interior nodes and leaf nodes. This is to support 215e48edee2SMark Fasheh * unwritten extents which need a flags field in leaf node 216e48edee2SMark Fasheh * records, thus shrinking the available space for a clusters 217e48edee2SMark Fasheh * field. 218e48edee2SMark Fasheh */ 219e48edee2SMark Fasheh if (el->l_tree_depth) 220e48edee2SMark Fasheh return le32_to_cpu(rec->e_int_clusters); 221e48edee2SMark Fasheh else 222e48edee2SMark Fasheh return le16_to_cpu(rec->e_leaf_clusters); 223e48edee2SMark Fasheh } 224e48edee2SMark Fasheh 22500dc417fSMark Fasheh /* 22600dc417fSMark Fasheh * This is only valid for leaf nodes, which are the only ones that can 22700dc417fSMark Fasheh * have empty extents anyway. 22800dc417fSMark Fasheh */ 22900dc417fSMark Fasheh static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec) 23000dc417fSMark Fasheh { 23100dc417fSMark Fasheh return !rec->e_leaf_clusters; 23200dc417fSMark Fasheh } 23300dc417fSMark Fasheh 234ccd979bdSMark Fasheh #endif /* OCFS2_ALLOC_H */ 235