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, 31f56654c4STao Ma OCFS2_XATTR_VALUE_EXTENT, 32e7d4cb6bSTao Ma }; 33e7d4cb6bSTao Ma 34ccd979bdSMark Fasheh struct ocfs2_alloc_context; 35f56654c4STao Ma int ocfs2_dinode_insert_extent(struct ocfs2_super *osb, 36f56654c4STao Ma handle_t *handle, 37f56654c4STao Ma struct inode *inode, 38f56654c4STao Ma struct buffer_head *root_bh, 39f56654c4STao Ma u32 cpos, 40f56654c4STao Ma u64 start_blk, 41f56654c4STao Ma u32 new_clusters, 42f56654c4STao Ma u8 flags, 43f56654c4STao Ma struct ocfs2_alloc_context *meta_ac); 44f56654c4STao Ma int ocfs2_xattr_value_insert_extent(struct ocfs2_super *osb, 451fabe148SMark Fasheh handle_t *handle, 46ccd979bdSMark Fasheh struct inode *inode, 47e7d4cb6bSTao Ma struct buffer_head *root_bh, 48dcd0538fSMark Fasheh u32 cpos, 49dcd0538fSMark Fasheh u64 start_blk, 50ccd979bdSMark Fasheh u32 new_clusters, 512ae99a60SMark Fasheh u8 flags, 52e7d4cb6bSTao Ma struct ocfs2_alloc_context *meta_ac, 53f56654c4STao Ma void *private); 540eb8d47eSTao Ma enum ocfs2_alloc_restarted { 550eb8d47eSTao Ma RESTART_NONE = 0, 560eb8d47eSTao Ma RESTART_TRANS, 570eb8d47eSTao Ma RESTART_META 580eb8d47eSTao Ma }; 590eb8d47eSTao Ma int ocfs2_add_clusters_in_btree(struct ocfs2_super *osb, 600eb8d47eSTao Ma struct inode *inode, 610eb8d47eSTao Ma u32 *logical_offset, 620eb8d47eSTao Ma u32 clusters_to_add, 630eb8d47eSTao Ma int mark_unwritten, 640eb8d47eSTao Ma struct buffer_head *root_bh, 650eb8d47eSTao Ma struct ocfs2_extent_list *root_el, 660eb8d47eSTao Ma handle_t *handle, 670eb8d47eSTao Ma struct ocfs2_alloc_context *data_ac, 680eb8d47eSTao Ma struct ocfs2_alloc_context *meta_ac, 690eb8d47eSTao Ma enum ocfs2_alloc_restarted *reason_ret, 70f56654c4STao Ma enum ocfs2_extent_tree_type type, 71f56654c4STao Ma void *private); 72328d5752SMark Fasheh struct ocfs2_cached_dealloc_ctxt; 73e7d4cb6bSTao Ma int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *root_bh, 74328d5752SMark Fasheh handle_t *handle, u32 cpos, u32 len, u32 phys, 75328d5752SMark Fasheh struct ocfs2_alloc_context *meta_ac, 76e7d4cb6bSTao Ma struct ocfs2_cached_dealloc_ctxt *dealloc, 77f56654c4STao Ma enum ocfs2_extent_tree_type et_type, 78f56654c4STao Ma void *private); 79e7d4cb6bSTao Ma int ocfs2_remove_extent(struct inode *inode, struct buffer_head *root_bh, 80063c4561SMark Fasheh u32 cpos, u32 len, handle_t *handle, 81063c4561SMark Fasheh struct ocfs2_alloc_context *meta_ac, 82e7d4cb6bSTao Ma struct ocfs2_cached_dealloc_ctxt *dealloc, 83f56654c4STao Ma enum ocfs2_extent_tree_type et_type, 84f56654c4STao Ma void *private); 85ccd979bdSMark Fasheh int ocfs2_num_free_extents(struct ocfs2_super *osb, 86ccd979bdSMark Fasheh struct inode *inode, 87e7d4cb6bSTao Ma struct buffer_head *root_bh, 88f56654c4STao Ma enum ocfs2_extent_tree_type et_type, 89f56654c4STao Ma void *private); 90e7d4cb6bSTao Ma 91811f933dSTao Ma /* 92811f933dSTao Ma * how many new metadata chunks would an allocation need at maximum? 93811f933dSTao Ma * 94811f933dSTao Ma * Please note that the caller must make sure that root_el is the root 95811f933dSTao Ma * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise 96811f933dSTao Ma * the result may be wrong. 97811f933dSTao Ma */ 98811f933dSTao Ma static inline int ocfs2_extend_meta_needed(struct ocfs2_extent_list *root_el) 99ccd979bdSMark Fasheh { 100ccd979bdSMark Fasheh /* 101ccd979bdSMark Fasheh * Rather than do all the work of determining how much we need 102ccd979bdSMark Fasheh * (involves a ton of reads and locks), just ask for the 103ccd979bdSMark Fasheh * maximal limit. That's a tree depth shift. So, one block for 104ccd979bdSMark Fasheh * level of the tree (current l_tree_depth), one block for the 105ccd979bdSMark Fasheh * new tree_depth==0 extent_block, and one block at the new 106ccd979bdSMark Fasheh * top-of-the tree. 107ccd979bdSMark Fasheh */ 108811f933dSTao Ma return le16_to_cpu(root_el->l_tree_depth) + 2; 109ccd979bdSMark Fasheh } 110ccd979bdSMark Fasheh 1115b6a3a2bSMark Fasheh void ocfs2_dinode_new_extent_list(struct inode *inode, struct ocfs2_dinode *di); 1121afc32b9SMark Fasheh void ocfs2_set_inode_data_inline(struct inode *inode, struct ocfs2_dinode *di); 1131afc32b9SMark Fasheh int ocfs2_convert_inline_data_to_extents(struct inode *inode, 1141afc32b9SMark Fasheh struct buffer_head *di_bh); 1151afc32b9SMark Fasheh 116ccd979bdSMark Fasheh int ocfs2_truncate_log_init(struct ocfs2_super *osb); 117ccd979bdSMark Fasheh void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb); 118ccd979bdSMark Fasheh void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb, 119ccd979bdSMark Fasheh int cancel); 120ccd979bdSMark Fasheh int ocfs2_flush_truncate_log(struct ocfs2_super *osb); 121ccd979bdSMark Fasheh int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb, 122ccd979bdSMark Fasheh int slot_num, 123ccd979bdSMark Fasheh struct ocfs2_dinode **tl_copy); 124ccd979bdSMark Fasheh int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb, 125ccd979bdSMark Fasheh struct ocfs2_dinode *tl_copy); 126063c4561SMark Fasheh int ocfs2_truncate_log_needs_flush(struct ocfs2_super *osb); 127063c4561SMark Fasheh int ocfs2_truncate_log_append(struct ocfs2_super *osb, 128063c4561SMark Fasheh handle_t *handle, 129063c4561SMark Fasheh u64 start_blk, 130063c4561SMark Fasheh unsigned int num_clusters); 131063c4561SMark Fasheh int __ocfs2_flush_truncate_log(struct ocfs2_super *osb); 132ccd979bdSMark Fasheh 1332b604351SMark Fasheh /* 1342b604351SMark Fasheh * Process local structure which describes the block unlinks done 1352b604351SMark Fasheh * during an operation. This is populated via 1362b604351SMark Fasheh * ocfs2_cache_block_dealloc(). 1372b604351SMark Fasheh * 1382b604351SMark Fasheh * ocfs2_run_deallocs() should be called after the potentially 1392b604351SMark Fasheh * de-allocating routines. No journal handles should be open, and most 1402b604351SMark Fasheh * locks should have been dropped. 1412b604351SMark Fasheh */ 1422b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt { 1432b604351SMark Fasheh struct ocfs2_per_slot_free_list *c_first_suballocator; 1442b604351SMark Fasheh }; 1452b604351SMark Fasheh static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c) 1462b604351SMark Fasheh { 1472b604351SMark Fasheh c->c_first_suballocator = NULL; 1482b604351SMark Fasheh } 1492b604351SMark Fasheh int ocfs2_run_deallocs(struct ocfs2_super *osb, 1502b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt *ctxt); 1512b604351SMark Fasheh 152ccd979bdSMark Fasheh struct ocfs2_truncate_context { 15359a5e416SMark Fasheh struct ocfs2_cached_dealloc_ctxt tc_dealloc; 154ccd979bdSMark Fasheh int tc_ext_alloc_locked; /* is it cluster locked? */ 155ccd979bdSMark Fasheh /* these get destroyed once it's passed to ocfs2_commit_truncate. */ 156ccd979bdSMark Fasheh struct buffer_head *tc_last_eb_bh; 157ccd979bdSMark Fasheh }; 158ccd979bdSMark Fasheh 15935edec1dSMark Fasheh int ocfs2_zero_range_for_truncate(struct inode *inode, handle_t *handle, 16035edec1dSMark Fasheh u64 range_start, u64 range_end); 161ccd979bdSMark Fasheh int ocfs2_prepare_truncate(struct ocfs2_super *osb, 162ccd979bdSMark Fasheh struct inode *inode, 163ccd979bdSMark Fasheh struct buffer_head *fe_bh, 164ccd979bdSMark Fasheh struct ocfs2_truncate_context **tc); 165ccd979bdSMark Fasheh int ocfs2_commit_truncate(struct ocfs2_super *osb, 166ccd979bdSMark Fasheh struct inode *inode, 167ccd979bdSMark Fasheh struct buffer_head *fe_bh, 168ccd979bdSMark Fasheh struct ocfs2_truncate_context *tc); 1691afc32b9SMark Fasheh int ocfs2_truncate_inline(struct inode *inode, struct buffer_head *di_bh, 1701afc32b9SMark Fasheh unsigned int start, unsigned int end, int trunc); 171ccd979bdSMark Fasheh 172363041a5SMark Fasheh int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el, 173363041a5SMark Fasheh u32 cpos, struct buffer_head **leaf_bh); 174328d5752SMark Fasheh int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster); 175363041a5SMark Fasheh 176e48edee2SMark Fasheh /* 177e48edee2SMark Fasheh * Helper function to look at the # of clusters in an extent record. 178e48edee2SMark Fasheh */ 179e48edee2SMark Fasheh static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el, 180e48edee2SMark Fasheh struct ocfs2_extent_rec *rec) 181e48edee2SMark Fasheh { 182e48edee2SMark Fasheh /* 183e48edee2SMark Fasheh * Cluster count in extent records is slightly different 184e48edee2SMark Fasheh * between interior nodes and leaf nodes. This is to support 185e48edee2SMark Fasheh * unwritten extents which need a flags field in leaf node 186e48edee2SMark Fasheh * records, thus shrinking the available space for a clusters 187e48edee2SMark Fasheh * field. 188e48edee2SMark Fasheh */ 189e48edee2SMark Fasheh if (el->l_tree_depth) 190e48edee2SMark Fasheh return le32_to_cpu(rec->e_int_clusters); 191e48edee2SMark Fasheh else 192e48edee2SMark Fasheh return le16_to_cpu(rec->e_leaf_clusters); 193e48edee2SMark Fasheh } 194e48edee2SMark Fasheh 19500dc417fSMark Fasheh /* 19600dc417fSMark Fasheh * This is only valid for leaf nodes, which are the only ones that can 19700dc417fSMark Fasheh * have empty extents anyway. 19800dc417fSMark Fasheh */ 19900dc417fSMark Fasheh static inline int ocfs2_is_empty_extent(struct ocfs2_extent_rec *rec) 20000dc417fSMark Fasheh { 20100dc417fSMark Fasheh return !rec->e_leaf_clusters; 20200dc417fSMark Fasheh } 20300dc417fSMark Fasheh 204ccd979bdSMark Fasheh #endif /* OCFS2_ALLOC_H */ 205