blob: 5805a03d100ba842df00b8abd3b1238f91321e13 [file] [log] [blame]
Thomas Gleixner328970d2019-05-24 12:04:05 +02001/* SPDX-License-Identifier: GPL-2.0-or-later */
Masahiro Yamadafa60ce22021-05-06 18:06:44 -07002/*
Mark Fashehccd979b2005-12-15 14:31:24 -08003 * suballoc.h
4 *
5 * Defines sub allocator api
6 *
7 * Copyright (C) 2003, 2004 Oracle. All rights reserved.
Mark Fashehccd979b2005-12-15 14:31:24 -08008 */
9
10#ifndef _CHAINALLOC_H_
11#define _CHAINALLOC_H_
12
Joel Becker7d1fe092010-04-13 14:30:19 +080013struct ocfs2_suballoc_result;
Mark Fashehccd979b2005-12-15 14:31:24 -080014typedef int (group_search_t)(struct inode *,
15 struct buffer_head *,
Joel Becker1187c962008-09-03 20:03:39 -070016 u32, /* bits_wanted */
17 u32, /* min_bits */
18 u64, /* max_block */
Joel Becker7d1fe092010-04-13 14:30:19 +080019 struct ocfs2_suballoc_result *);
20 /* found bits */
Mark Fashehccd979b2005-12-15 14:31:24 -080021
22struct ocfs2_alloc_context {
23 struct inode *ac_inode; /* which bitmap are we allocating from? */
24 struct buffer_head *ac_bh; /* file entry bh */
Tao Maa4a48912008-03-03 17:12:30 +080025 u32 ac_alloc_slot; /* which slot are we allocating from? */
Mark Fashehccd979b2005-12-15 14:31:24 -080026 u32 ac_bits_wanted;
27 u32 ac_bits_given;
28#define OCFS2_AC_USE_LOCAL 1
29#define OCFS2_AC_USE_MAIN 2
30#define OCFS2_AC_USE_INODE 3
31#define OCFS2_AC_USE_META 4
32 u32 ac_which;
Mark Fashehccd979b2005-12-15 14:31:24 -080033
34 /* these are used by the chain search */
35 u16 ac_chain;
Xiaowei.Hu309a85b2013-02-27 17:02:49 -080036 int ac_disable_chain_relink;
Mark Fashehccd979b2005-12-15 14:31:24 -080037 group_search_t *ac_group_search;
Mark Fasheh883d4ca2006-06-05 16:41:00 -040038
39 u64 ac_last_group;
Joel Becker1187c962008-09-03 20:03:39 -070040 u64 ac_max_block; /* Highest block number to allocate. 0 is
Randy Dunlap7eba77d2020-08-06 23:17:59 -070041 the same as ~0 - unlimited */
Mark Fashehd02f00c2009-12-07 13:10:48 -080042
Mark Fashehe49e2762010-08-13 15:15:17 -070043 int ac_find_loc_only; /* hack for reflink operation ordering */
44 struct ocfs2_suballoc_result *ac_find_loc_priv; /* */
45
Mark Fashehd02f00c2009-12-07 13:10:48 -080046 struct ocfs2_alloc_reservation *ac_resv;
Mark Fashehccd979b2005-12-15 14:31:24 -080047};
48
Tiger Yangb89c5422010-01-25 14:11:06 +080049void ocfs2_init_steal_slots(struct ocfs2_super *osb);
Mark Fashehccd979b2005-12-15 14:31:24 -080050void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac);
51static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
52{
53 return ac->ac_bits_wanted - ac->ac_bits_given;
54}
55
Tao Ma811f9332008-08-18 17:38:43 +080056/*
57 * Please note that the caller must make sure that root_el is the root
58 * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
59 * the result may be wrong.
60 */
Mark Fashehccd979b2005-12-15 14:31:24 -080061int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
Tao Ma811f9332008-08-18 17:38:43 +080062 struct ocfs2_extent_list *root_el,
Mark Fashehccd979b2005-12-15 14:31:24 -080063 struct ocfs2_alloc_context **ac);
Tiger Yangcf1d6c72008-08-18 17:11:00 +080064int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
65 int blocks,
66 struct ocfs2_alloc_context **ac);
Mark Fashehccd979b2005-12-15 14:31:24 -080067int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
Mark Fashehccd979b2005-12-15 14:31:24 -080068 struct ocfs2_alloc_context **ac);
69int ocfs2_reserve_clusters(struct ocfs2_super *osb,
Mark Fashehccd979b2005-12-15 14:31:24 -080070 u32 bits_wanted,
71 struct ocfs2_alloc_context **ac);
72
Younger Liu0a2fcd892014-01-21 15:48:33 -080073int ocfs2_alloc_dinode_update_counts(struct inode *inode,
74 handle_t *handle,
75 struct buffer_head *di_bh,
76 u32 num_bits,
77 u16 chain);
Younger Liudb66c712014-04-03 14:47:10 -070078void ocfs2_rollback_alloc_dinode_counts(struct inode *inode,
79 struct buffer_head *di_bh,
80 u32 num_bits,
81 u16 chain);
Younger Liu0a2fcd892014-01-21 15:48:33 -080082int ocfs2_block_group_set_bits(handle_t *handle,
83 struct inode *alloc_inode,
84 struct ocfs2_group_desc *bg,
85 struct buffer_head *group_bh,
86 unsigned int bit_off,
87 unsigned int num_bits);
88
Joel Becker1ed9b772010-05-06 13:59:06 +080089int ocfs2_claim_metadata(handle_t *handle,
Mark Fashehccd979b2005-12-15 14:31:24 -080090 struct ocfs2_alloc_context *ac,
91 u32 bits_wanted,
Joel Becker2b6cb572010-03-26 10:09:15 +080092 u64 *suballoc_loc,
Mark Fashehccd979b2005-12-15 14:31:24 -080093 u16 *suballoc_bit_start,
94 u32 *num_bits,
95 u64 *blkno_start);
Joel Becker1ed9b772010-05-06 13:59:06 +080096int ocfs2_claim_new_inode(handle_t *handle,
Tao Ma13821152009-02-25 00:53:23 +080097 struct inode *dir,
98 struct buffer_head *parent_fe_bh,
Mark Fashehccd979b2005-12-15 14:31:24 -080099 struct ocfs2_alloc_context *ac,
Joel Becker2b6cb572010-03-26 10:09:15 +0800100 u64 *suballoc_loc,
Mark Fashehccd979b2005-12-15 14:31:24 -0800101 u16 *suballoc_bit,
102 u64 *fe_blkno);
Joel Becker1ed9b772010-05-06 13:59:06 +0800103int ocfs2_claim_clusters(handle_t *handle,
Mark Fashehccd979b2005-12-15 14:31:24 -0800104 struct ocfs2_alloc_context *ac,
105 u32 min_clusters,
106 u32 *cluster_start,
107 u32 *num_clusters);
Mark Fasheh415cb802007-09-16 20:10:16 -0700108/*
109 * Use this variant of ocfs2_claim_clusters to specify a maxiumum
110 * number of clusters smaller than the allocation reserved.
111 */
Joel Becker1ed9b772010-05-06 13:59:06 +0800112int __ocfs2_claim_clusters(handle_t *handle,
Mark Fasheh415cb802007-09-16 20:10:16 -0700113 struct ocfs2_alloc_context *ac,
114 u32 min_clusters,
115 u32 max_clusters,
116 u32 *cluster_start,
117 u32 *num_clusters);
Mark Fashehccd979b2005-12-15 14:31:24 -0800118
Mark Fasheh2b604352007-06-22 15:45:27 -0700119int ocfs2_free_suballoc_bits(handle_t *handle,
120 struct inode *alloc_inode,
121 struct buffer_head *alloc_bh,
122 unsigned int start_bit,
123 u64 bg_blkno,
124 unsigned int count);
Mark Fasheh1fabe142006-10-09 18:11:45 -0700125int ocfs2_free_dinode(handle_t *handle,
Mark Fashehccd979b2005-12-15 14:31:24 -0800126 struct inode *inode_alloc_inode,
127 struct buffer_head *inode_alloc_bh,
128 struct ocfs2_dinode *di);
Mark Fasheh1fabe142006-10-09 18:11:45 -0700129int ocfs2_free_clusters(handle_t *handle,
Mark Fashehccd979b2005-12-15 14:31:24 -0800130 struct inode *bitmap_inode,
131 struct buffer_head *bitmap_bh,
132 u64 start_blk,
133 unsigned int num_clusters);
Mark Fashehb4414ee2010-03-11 18:31:09 -0800134int ocfs2_release_clusters(handle_t *handle,
135 struct inode *bitmap_inode,
136 struct buffer_head *bitmap_bh,
137 u64 start_blk,
138 unsigned int num_clusters);
Mark Fashehccd979b2005-12-15 14:31:24 -0800139
Mark Fasheh2b604352007-06-22 15:45:27 -0700140static inline u64 ocfs2_which_suballoc_group(u64 block, unsigned int bit)
141{
142 u64 group = block - (u64) bit;
143
144 return group;
145}
146
Mark Fashehccd979b2005-12-15 14:31:24 -0800147static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
148 u64 bg_blkno)
149{
150 /* This should work for all block group descriptors as only
151 * the 1st group descriptor of the cluster bitmap is
152 * different. */
153
154 if (bg_blkno == osb->first_cluster_group_blkno)
155 return 0;
156
157 /* the rest of the block groups are located at the beginning
158 * of their 1st cluster, so a direct translation just
159 * works. */
160 return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
161}
162
163static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
164{
165 struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
166 return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
167}
168
169/* This is for local alloc ONLY. Others should use the task-specific
170 * apis above. */
171int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
172 struct ocfs2_alloc_context *ac);
Mark Fasheh9c7af402008-07-28 18:02:53 -0700173void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac);
Mark Fashehccd979b2005-12-15 14:31:24 -0800174
Tao Mad6590722007-12-18 15:47:03 +0800175/* given a cluster offset, calculate which block group it belongs to
176 * and return that block offset. */
177u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster);
178
Joel Becker57e3e792008-11-13 14:49:13 -0800179/*
Joel Becker970e4932008-11-13 14:49:19 -0800180 * By default, ocfs2_read_group_descriptor() calls ocfs2_error() when it
Joel Becker57e3e792008-11-13 14:49:13 -0800181 * finds a problem. A caller that wants to check a group descriptor
Joel Becker970e4932008-11-13 14:49:19 -0800182 * without going readonly should read the block with ocfs2_read_block[s]()
183 * and then checking it with this function. This is only resize, really.
184 * Everyone else should be using ocfs2_read_group_descriptor().
Joel Becker57e3e792008-11-13 14:49:13 -0800185 */
Joel Becker970e4932008-11-13 14:49:19 -0800186int ocfs2_check_group_descriptor(struct super_block *sb,
187 struct ocfs2_dinode *di,
188 struct buffer_head *bh);
Joel Becker68f64d42008-11-13 14:49:14 -0800189/*
190 * Read a group descriptor block into *bh. If *bh is NULL, a bh will be
191 * allocated. This is a cached read. The descriptor will be validated with
192 * ocfs2_validate_group_descriptor().
193 */
194int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
195 u64 gd_blkno, struct buffer_head **bh);
Joel Becker57e3e792008-11-13 14:49:13 -0800196
Joel Beckerf99b9b72008-08-20 19:36:33 -0700197int ocfs2_lock_allocators(struct inode *inode, struct ocfs2_extent_tree *et,
Tao Mae7d4cb62008-08-18 17:38:44 +0800198 u32 clusters_to_add, u32 extents_to_split,
199 struct ocfs2_alloc_context **data_ac,
Joel Beckerf99b9b72008-08-20 19:36:33 -0700200 struct ocfs2_alloc_context **meta_ac);
wengang wang6ca497a2009-03-06 21:29:10 +0800201
202int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res);
Mark Fashehe49e2762010-08-13 15:15:17 -0700203
204
205
206/*
207 * The following two interfaces are for ocfs2_create_inode_in_orphan().
208 */
209int ocfs2_find_new_inode_loc(struct inode *dir,
210 struct buffer_head *parent_fe_bh,
211 struct ocfs2_alloc_context *ac,
212 u64 *fe_blkno);
213
214int ocfs2_claim_new_inode_at_loc(handle_t *handle,
215 struct inode *dir,
216 struct ocfs2_alloc_context *ac,
217 u64 *suballoc_loc,
218 u16 *suballoc_bit,
219 u64 di_blkno);
220
Mark Fashehccd979b2005-12-15 14:31:24 -0800221#endif /* _CHAINALLOC_H_ */