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 29ccd979bdSMark Fasheh struct ocfs2_alloc_context; 30ccd979bdSMark Fasheh int ocfs2_insert_extent(struct ocfs2_super *osb, 311fabe148SMark Fasheh handle_t *handle, 32ccd979bdSMark Fasheh struct inode *inode, 33ccd979bdSMark Fasheh struct buffer_head *fe_bh, 34dcd0538fSMark Fasheh u32 cpos, 35dcd0538fSMark Fasheh u64 start_blk, 36ccd979bdSMark Fasheh u32 new_clusters, 37ccd979bdSMark Fasheh struct ocfs2_alloc_context *meta_ac); 38328d5752SMark Fasheh struct ocfs2_cached_dealloc_ctxt; 39328d5752SMark Fasheh int ocfs2_mark_extent_written(struct inode *inode, struct buffer_head *di_bh, 40328d5752SMark Fasheh handle_t *handle, u32 cpos, u32 len, u32 phys, 41328d5752SMark Fasheh struct ocfs2_alloc_context *meta_ac, 42328d5752SMark Fasheh struct ocfs2_cached_dealloc_ctxt *dealloc); 43ccd979bdSMark Fasheh int ocfs2_num_free_extents(struct ocfs2_super *osb, 44ccd979bdSMark Fasheh struct inode *inode, 45ccd979bdSMark Fasheh struct ocfs2_dinode *fe); 46ccd979bdSMark Fasheh /* how many new metadata chunks would an allocation need at maximum? */ 47ccd979bdSMark Fasheh static inline int ocfs2_extend_meta_needed(struct ocfs2_dinode *fe) 48ccd979bdSMark Fasheh { 49ccd979bdSMark Fasheh /* 50ccd979bdSMark Fasheh * Rather than do all the work of determining how much we need 51ccd979bdSMark Fasheh * (involves a ton of reads and locks), just ask for the 52ccd979bdSMark Fasheh * maximal limit. That's a tree depth shift. So, one block for 53ccd979bdSMark Fasheh * level of the tree (current l_tree_depth), one block for the 54ccd979bdSMark Fasheh * new tree_depth==0 extent_block, and one block at the new 55ccd979bdSMark Fasheh * top-of-the tree. 56ccd979bdSMark Fasheh */ 57ccd979bdSMark Fasheh return le16_to_cpu(fe->id2.i_list.l_tree_depth) + 2; 58ccd979bdSMark Fasheh } 59ccd979bdSMark Fasheh 60ccd979bdSMark Fasheh int ocfs2_truncate_log_init(struct ocfs2_super *osb); 61ccd979bdSMark Fasheh void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb); 62ccd979bdSMark Fasheh void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb, 63ccd979bdSMark Fasheh int cancel); 64ccd979bdSMark Fasheh int ocfs2_flush_truncate_log(struct ocfs2_super *osb); 65ccd979bdSMark Fasheh int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb, 66ccd979bdSMark Fasheh int slot_num, 67ccd979bdSMark Fasheh struct ocfs2_dinode **tl_copy); 68ccd979bdSMark Fasheh int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb, 69ccd979bdSMark Fasheh struct ocfs2_dinode *tl_copy); 70ccd979bdSMark Fasheh 712b604351SMark Fasheh /* 722b604351SMark Fasheh * Process local structure which describes the block unlinks done 732b604351SMark Fasheh * during an operation. This is populated via 742b604351SMark Fasheh * ocfs2_cache_block_dealloc(). 752b604351SMark Fasheh * 762b604351SMark Fasheh * ocfs2_run_deallocs() should be called after the potentially 772b604351SMark Fasheh * de-allocating routines. No journal handles should be open, and most 782b604351SMark Fasheh * locks should have been dropped. 792b604351SMark Fasheh */ 802b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt { 812b604351SMark Fasheh struct ocfs2_per_slot_free_list *c_first_suballocator; 822b604351SMark Fasheh }; 832b604351SMark Fasheh static inline void ocfs2_init_dealloc_ctxt(struct ocfs2_cached_dealloc_ctxt *c) 842b604351SMark Fasheh { 852b604351SMark Fasheh c->c_first_suballocator = NULL; 862b604351SMark Fasheh } 872b604351SMark Fasheh int ocfs2_run_deallocs(struct ocfs2_super *osb, 882b604351SMark Fasheh struct ocfs2_cached_dealloc_ctxt *ctxt); 892b604351SMark Fasheh 90ccd979bdSMark Fasheh struct ocfs2_truncate_context { 9159a5e416SMark Fasheh struct ocfs2_cached_dealloc_ctxt tc_dealloc; 92ccd979bdSMark Fasheh int tc_ext_alloc_locked; /* is it cluster locked? */ 93ccd979bdSMark Fasheh /* these get destroyed once it's passed to ocfs2_commit_truncate. */ 94ccd979bdSMark Fasheh struct buffer_head *tc_last_eb_bh; 95ccd979bdSMark Fasheh }; 96ccd979bdSMark Fasheh 9760b11392SMark Fasheh int ocfs2_zero_tail_for_truncate(struct inode *inode, handle_t *handle, 9860b11392SMark Fasheh u64 new_i_size); 99ccd979bdSMark Fasheh int ocfs2_prepare_truncate(struct ocfs2_super *osb, 100ccd979bdSMark Fasheh struct inode *inode, 101ccd979bdSMark Fasheh struct buffer_head *fe_bh, 102ccd979bdSMark Fasheh struct ocfs2_truncate_context **tc); 103ccd979bdSMark Fasheh int ocfs2_commit_truncate(struct ocfs2_super *osb, 104ccd979bdSMark Fasheh struct inode *inode, 105ccd979bdSMark Fasheh struct buffer_head *fe_bh, 106ccd979bdSMark Fasheh struct ocfs2_truncate_context *tc); 107ccd979bdSMark Fasheh 108363041a5SMark Fasheh int ocfs2_find_leaf(struct inode *inode, struct ocfs2_extent_list *root_el, 109363041a5SMark Fasheh u32 cpos, struct buffer_head **leaf_bh); 110328d5752SMark Fasheh int ocfs2_search_extent_list(struct ocfs2_extent_list *el, u32 v_cluster); 111363041a5SMark Fasheh 112e48edee2SMark Fasheh /* 113e48edee2SMark Fasheh * Helper function to look at the # of clusters in an extent record. 114e48edee2SMark Fasheh */ 115e48edee2SMark Fasheh static inline unsigned int ocfs2_rec_clusters(struct ocfs2_extent_list *el, 116e48edee2SMark Fasheh struct ocfs2_extent_rec *rec) 117e48edee2SMark Fasheh { 118e48edee2SMark Fasheh /* 119e48edee2SMark Fasheh * Cluster count in extent records is slightly different 120e48edee2SMark Fasheh * between interior nodes and leaf nodes. This is to support 121e48edee2SMark Fasheh * unwritten extents which need a flags field in leaf node 122e48edee2SMark Fasheh * records, thus shrinking the available space for a clusters 123e48edee2SMark Fasheh * field. 124e48edee2SMark Fasheh */ 125e48edee2SMark Fasheh if (el->l_tree_depth) 126e48edee2SMark Fasheh return le32_to_cpu(rec->e_int_clusters); 127e48edee2SMark Fasheh else 128e48edee2SMark Fasheh return le16_to_cpu(rec->e_leaf_clusters); 129e48edee2SMark Fasheh } 130e48edee2SMark Fasheh 131ccd979bdSMark Fasheh #endif /* OCFS2_ALLOC_H */ 132