fs/ocfs2/alloc.h

   1 /* -*- 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
  29 struct ocfs2_alloc_context;
  30 int ocfs2_insert_extent(struct ocfs2_super *osb,
  31                         struct ocfs2_journal_handle *handle,
  32                         struct inode *inode,
  33                         struct buffer_head *fe_bh,
  34                         u64 blkno,
  35                         u32 new_clusters,
  36                         struct ocfs2_alloc_context *meta_ac);
  37 int ocfs2_num_free_extents(struct ocfs2_super *osb,
  38                            struct inode *inode,
  39                            struct ocfs2_dinode *fe);
  40 /* how many new metadata chunks would an allocation need at maximum? */
  41 static inline int ocfs2_extend_meta_needed(struct ocfs2_dinode *fe)
  42 {
  43         /*
  44          * Rather than do all the work of determining how much we need
  45          * (involves a ton of reads and locks), just ask for the
  46          * maximal limit.  That's a tree depth shift.  So, one block for
  47          * level of the tree (current l_tree_depth), one block for the
  48          * new tree_depth==0 extent_block, and one block at the new
  49          * top-of-the tree.
  50          */
  51         return le16_to_cpu(fe->id2.i_list.l_tree_depth) + 2;
  52 }
  53
  54 int ocfs2_truncate_log_init(struct ocfs2_super *osb);
  55 void ocfs2_truncate_log_shutdown(struct ocfs2_super *osb);
  56 void ocfs2_schedule_truncate_log_flush(struct ocfs2_super *osb,
  57                                        int cancel);
  58 int ocfs2_flush_truncate_log(struct ocfs2_super *osb);
  59 int ocfs2_begin_truncate_log_recovery(struct ocfs2_super *osb,
  60                                       int slot_num,
  61                                       struct ocfs2_dinode **tl_copy);
  62 int ocfs2_complete_truncate_log_recovery(struct ocfs2_super *osb,
  63                                          struct ocfs2_dinode *tl_copy);
  64
  65 struct ocfs2_truncate_context {
  66         struct inode *tc_ext_alloc_inode;
  67         struct buffer_head *tc_ext_alloc_bh;
  68         int tc_ext_alloc_locked; /* is it cluster locked? */
  69         /* these get destroyed once it's passed to ocfs2_commit_truncate. */
  70         struct buffer_head *tc_last_eb_bh;
  71 };
  72
  73 int ocfs2_prepare_truncate(struct ocfs2_super *osb,
  74                            struct inode *inode,
  75                            struct buffer_head *fe_bh,
  76                            struct ocfs2_truncate_context **tc);
  77 int ocfs2_commit_truncate(struct ocfs2_super *osb,
  78                           struct inode *inode,
  79                           struct buffer_head *fe_bh,
  80                           struct ocfs2_truncate_context *tc);
  81
  82 #endif /* OCFS2_ALLOC_H */