fs/ocfs2/suballoc.h

   1 /* -*- mode: c; c-basic-offset: 8; -*-
   2  * vim: noexpandtab sw=8 ts=8 sts=0:
   3  *
   4  * suballoc.h
   5  *
   6  * Defines sub allocator api
   7  *
   8  * Copyright (C) 2003, 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 _CHAINALLOC_H_
  27 #define _CHAINALLOC_H_
  28
  29 typedef int (group_search_t)(struct inode *,
  30                              struct buffer_head *,
  31                              u32,
  32                              u32,
  33                              u16 *,
  34                              u16 *);
  35
  36 struct ocfs2_alloc_context {
  37         struct inode *ac_inode;    /* which bitmap are we allocating from? */
  38         struct buffer_head *ac_bh; /* file entry bh */
  39         u32    ac_alloc_slot;   /* which slot are we allocating from? */
  40         u32    ac_bits_wanted;
  41         u32    ac_bits_given;
  42 #define OCFS2_AC_USE_LOCAL 1
  43 #define OCFS2_AC_USE_MAIN  2
  44 #define OCFS2_AC_USE_INODE 3
  45 #define OCFS2_AC_USE_META  4
  46         u32    ac_which;
  47
  48         /* these are used by the chain search */
  49         u16    ac_chain;
  50         int    ac_allow_chain_relink;
  51         group_search_t *ac_group_search;
  52
  53         u64    ac_last_group;
  54 };
  55
  56 void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac);
  57 static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
  58 {
  59         return ac->ac_bits_wanted - ac->ac_bits_given;
  60 }
  61
  62 /*
  63  * Please note that the caller must make sure that root_el is the root
  64  * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
  65  * the result may be wrong.
  66  */
  67 int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
  68                                struct ocfs2_extent_list *root_el,
  69                                struct ocfs2_alloc_context **ac);
  70 int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
  71                                       int blocks,
  72                                       struct ocfs2_alloc_context **ac);
  73 int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
  74                             struct ocfs2_alloc_context **ac);
  75 int ocfs2_reserve_clusters(struct ocfs2_super *osb,
  76                            u32 bits_wanted,
  77                            struct ocfs2_alloc_context **ac);
  78
  79 int ocfs2_claim_metadata(struct ocfs2_super *osb,
  80                          handle_t *handle,
  81                          struct ocfs2_alloc_context *ac,
  82                          u32 bits_wanted,
  83                          u16 *suballoc_bit_start,
  84                          u32 *num_bits,
  85                          u64 *blkno_start);
  86 int ocfs2_claim_new_inode(struct ocfs2_super *osb,
  87                           handle_t *handle,
  88                           struct ocfs2_alloc_context *ac,
  89                           u16 *suballoc_bit,
  90                           u64 *fe_blkno);
  91 int ocfs2_claim_clusters(struct ocfs2_super *osb,
  92                          handle_t *handle,
  93                          struct ocfs2_alloc_context *ac,
  94                          u32 min_clusters,
  95                          u32 *cluster_start,
  96                          u32 *num_clusters);
  97 /*
  98  * Use this variant of ocfs2_claim_clusters to specify a maxiumum
  99  * number of clusters smaller than the allocation reserved.
 100  */
 101 int __ocfs2_claim_clusters(struct ocfs2_super *osb,
 102                            handle_t *handle,
 103                            struct ocfs2_alloc_context *ac,
 104                            u32 min_clusters,
 105                            u32 max_clusters,
 106                            u32 *cluster_start,
 107                            u32 *num_clusters);
 108
 109 int ocfs2_free_suballoc_bits(handle_t *handle,
 110                              struct inode *alloc_inode,
 111                              struct buffer_head *alloc_bh,
 112                              unsigned int start_bit,
 113                              u64 bg_blkno,
 114                              unsigned int count);
 115 int ocfs2_free_dinode(handle_t *handle,
 116                       struct inode *inode_alloc_inode,
 117                       struct buffer_head *inode_alloc_bh,
 118                       struct ocfs2_dinode *di);
 119 int ocfs2_free_clusters(handle_t *handle,
 120                         struct inode *bitmap_inode,
 121                         struct buffer_head *bitmap_bh,
 122                         u64 start_blk,
 123                         unsigned int num_clusters);
 124
 125 static inline u64 ocfs2_which_suballoc_group(u64 block, unsigned int bit)
 126 {
 127         u64 group = block - (u64) bit;
 128
 129         return group;
 130 }
 131
 132 static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
 133                                           u64 bg_blkno)
 134 {
 135         /* This should work for all block group descriptors as only
 136          * the 1st group descriptor of the cluster bitmap is
 137          * different. */
 138
 139         if (bg_blkno == osb->first_cluster_group_blkno)
 140                 return 0;
 141
 142         /* the rest of the block groups are located at the beginning
 143          * of their 1st cluster, so a direct translation just
 144          * works. */
 145         return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
 146 }
 147
 148 static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
 149 {
 150         struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
 151         return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
 152 }
 153
 154 /* This is for local alloc ONLY. Others should use the task-specific
 155  * apis above. */
 156 int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
 157                                       struct ocfs2_alloc_context *ac);
 158 void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac);
 159
 160 /* given a cluster offset, calculate which block group it belongs to
 161  * and return that block offset. */
 162 u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster);
 163
 164 /* somewhat more expensive than our other checks, so use sparingly. */
 165 int ocfs2_check_group_descriptor(struct super_block *sb,
 166                                  struct ocfs2_dinode *di,
 167                                  struct ocfs2_group_desc *gd);
 168 int ocfs2_lock_allocators(struct inode *inode, struct buffer_head *root_bh,
 169                           struct ocfs2_extent_list *root_el,
 170                           u32 clusters_to_add, u32 extents_to_split,
 171                           struct ocfs2_alloc_context **data_ac,
 172                           struct ocfs2_alloc_context **meta_ac,
 173                           enum ocfs2_extent_tree_type type, void *private);
 174 #endif /* _CHAINALLOC_H_ */