suballoc.h 6.89 KB
Newer Older
1
/* SPDX-License-Identifier: GPL-2.0-or-later */
2 3 4 5 6 7 8 9 10 11 12 13 14
/* -*- mode: c; c-basic-offset: 8; -*-
 * vim: noexpandtab sw=8 ts=8 sts=0:
 *
 * suballoc.h
 *
 * Defines sub allocator api
 *
 * Copyright (C) 2003, 2004 Oracle.  All rights reserved.
 */

#ifndef _CHAINALLOC_H_
#define _CHAINALLOC_H_

15
struct ocfs2_suballoc_result;
16 17
typedef int (group_search_t)(struct inode *,
			     struct buffer_head *,
18 19 20
			     u32,			/* bits_wanted */
			     u32,			/* min_bits */
			     u64,			/* max_block */
21 22
			     struct ocfs2_suballoc_result *);
							/* found bits */
23 24 25 26

struct ocfs2_alloc_context {
	struct inode *ac_inode;    /* which bitmap are we allocating from? */
	struct buffer_head *ac_bh; /* file entry bh */
27
	u32    ac_alloc_slot;   /* which slot are we allocating from? */
28 29 30 31 32 33 34 35 36 37
	u32    ac_bits_wanted;
	u32    ac_bits_given;
#define OCFS2_AC_USE_LOCAL 1
#define OCFS2_AC_USE_MAIN  2
#define OCFS2_AC_USE_INODE 3
#define OCFS2_AC_USE_META  4
	u32    ac_which;

	/* these are used by the chain search */
	u16    ac_chain;
38
	int    ac_disable_chain_relink;
39
	group_search_t *ac_group_search;
Mark Fasheh's avatar
Mark Fasheh committed
40 41

	u64    ac_last_group;
42 43
	u64    ac_max_block;  /* Highest block number to allocate. 0 is
				 is the same as ~0 - unlimited */
Mark Fasheh's avatar
Mark Fasheh committed
44

45 46 47
	int    ac_find_loc_only;  /* hack for reflink operation ordering */
	struct ocfs2_suballoc_result *ac_find_loc_priv; /* */

Mark Fasheh's avatar
Mark Fasheh committed
48
	struct ocfs2_alloc_reservation	*ac_resv;
49 50
};

51
void ocfs2_init_steal_slots(struct ocfs2_super *osb);
52 53 54 55 56 57
void ocfs2_free_alloc_context(struct ocfs2_alloc_context *ac);
static inline int ocfs2_alloc_context_bits_left(struct ocfs2_alloc_context *ac)
{
	return ac->ac_bits_wanted - ac->ac_bits_given;
}

58 59 60 61 62
/*
 * Please note that the caller must make sure that root_el is the root
 * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
 * the result may be wrong.
 */
63
int ocfs2_reserve_new_metadata(struct ocfs2_super *osb,
64
			       struct ocfs2_extent_list *root_el,
65
			       struct ocfs2_alloc_context **ac);
66 67 68
int ocfs2_reserve_new_metadata_blocks(struct ocfs2_super *osb,
				      int blocks,
				      struct ocfs2_alloc_context **ac);
69 70 71 72 73 74
int ocfs2_reserve_new_inode(struct ocfs2_super *osb,
			    struct ocfs2_alloc_context **ac);
int ocfs2_reserve_clusters(struct ocfs2_super *osb,
			   u32 bits_wanted,
			   struct ocfs2_alloc_context **ac);

75 76 77 78 79
int ocfs2_alloc_dinode_update_counts(struct inode *inode,
			 handle_t *handle,
			 struct buffer_head *di_bh,
			 u32 num_bits,
			 u16 chain);
80 81 82 83
void ocfs2_rollback_alloc_dinode_counts(struct inode *inode,
			 struct buffer_head *di_bh,
			 u32 num_bits,
			 u16 chain);
84 85 86 87 88 89 90
int ocfs2_block_group_set_bits(handle_t *handle,
			 struct inode *alloc_inode,
			 struct ocfs2_group_desc *bg,
			 struct buffer_head *group_bh,
			 unsigned int bit_off,
			 unsigned int num_bits);

91
int ocfs2_claim_metadata(handle_t *handle,
92 93
			 struct ocfs2_alloc_context *ac,
			 u32 bits_wanted,
94
			 u64 *suballoc_loc,
95 96 97
			 u16 *suballoc_bit_start,
			 u32 *num_bits,
			 u64 *blkno_start);
98
int ocfs2_claim_new_inode(handle_t *handle,
99 100
			  struct inode *dir,
			  struct buffer_head *parent_fe_bh,
101
			  struct ocfs2_alloc_context *ac,
102
			  u64 *suballoc_loc,
103 104
			  u16 *suballoc_bit,
			  u64 *fe_blkno);
105
int ocfs2_claim_clusters(handle_t *handle,
106 107 108 109
			 struct ocfs2_alloc_context *ac,
			 u32 min_clusters,
			 u32 *cluster_start,
			 u32 *num_clusters);
110 111 112 113
/*
 * Use this variant of ocfs2_claim_clusters to specify a maxiumum
 * number of clusters smaller than the allocation reserved.
 */
114
int __ocfs2_claim_clusters(handle_t *handle,
115 116 117 118 119
			   struct ocfs2_alloc_context *ac,
			   u32 min_clusters,
			   u32 max_clusters,
			   u32 *cluster_start,
			   u32 *num_clusters);
120

121 122 123 124 125 126
int ocfs2_free_suballoc_bits(handle_t *handle,
			     struct inode *alloc_inode,
			     struct buffer_head *alloc_bh,
			     unsigned int start_bit,
			     u64 bg_blkno,
			     unsigned int count);
127
int ocfs2_free_dinode(handle_t *handle,
128 129 130
		      struct inode *inode_alloc_inode,
		      struct buffer_head *inode_alloc_bh,
		      struct ocfs2_dinode *di);
131
int ocfs2_free_clusters(handle_t *handle,
132 133 134 135
			struct inode *bitmap_inode,
			struct buffer_head *bitmap_bh,
			u64 start_blk,
			unsigned int num_clusters);
136 137 138 139 140
int ocfs2_release_clusters(handle_t *handle,
			   struct inode *bitmap_inode,
			   struct buffer_head *bitmap_bh,
			   u64 start_blk,
			   unsigned int num_clusters);
141

142 143 144 145 146 147 148
static inline u64 ocfs2_which_suballoc_group(u64 block, unsigned int bit)
{
	u64 group = block - (u64) bit;

	return group;
}

149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174
static inline u32 ocfs2_cluster_from_desc(struct ocfs2_super *osb,
					  u64 bg_blkno)
{
	/* This should work for all block group descriptors as only
	 * the 1st group descriptor of the cluster bitmap is
	 * different. */

	if (bg_blkno == osb->first_cluster_group_blkno)
		return 0;

	/* the rest of the block groups are located at the beginning
	 * of their 1st cluster, so a direct translation just
	 * works. */
	return ocfs2_blocks_to_clusters(osb->sb, bg_blkno);
}

static inline int ocfs2_is_cluster_bitmap(struct inode *inode)
{
	struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
	return osb->bitmap_blkno == OCFS2_I(inode)->ip_blkno;
}

/* This is for local alloc ONLY. Others should use the task-specific
 * apis above. */
int ocfs2_reserve_cluster_bitmap_bits(struct ocfs2_super *osb,
				      struct ocfs2_alloc_context *ac);
175
void ocfs2_free_ac_resource(struct ocfs2_alloc_context *ac);
176

177 178 179 180
/* given a cluster offset, calculate which block group it belongs to
 * and return that block offset. */
u64 ocfs2_which_cluster_group(struct inode *inode, u32 cluster);

181
/*
182
 * By default, ocfs2_read_group_descriptor() calls ocfs2_error() when it
183
 * finds a problem.  A caller that wants to check a group descriptor
184 185 186
 * without going readonly should read the block with ocfs2_read_block[s]()
 * and then checking it with this function.  This is only resize, really.
 * Everyone else should be using ocfs2_read_group_descriptor().
187
 */
188 189 190
int ocfs2_check_group_descriptor(struct super_block *sb,
				 struct ocfs2_dinode *di,
				 struct buffer_head *bh);
191 192 193 194 195 196 197
/*
 * Read a group descriptor block into *bh.  If *bh is NULL, a bh will be
 * allocated.  This is a cached read.  The descriptor will be validated with
 * ocfs2_validate_group_descriptor().
 */
int ocfs2_read_group_descriptor(struct inode *inode, struct ocfs2_dinode *di,
				u64 gd_blkno, struct buffer_head **bh);
198

199
int ocfs2_lock_allocators(struct inode *inode, struct ocfs2_extent_tree *et,
200 201
			  u32 clusters_to_add, u32 extents_to_split,
			  struct ocfs2_alloc_context **data_ac,
202
			  struct ocfs2_alloc_context **meta_ac);
203 204

int ocfs2_test_inode_bit(struct ocfs2_super *osb, u64 blkno, int *res);
205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222



/*
 * The following two interfaces are for ocfs2_create_inode_in_orphan().
 */
int ocfs2_find_new_inode_loc(struct inode *dir,
			     struct buffer_head *parent_fe_bh,
			     struct ocfs2_alloc_context *ac,
			     u64 *fe_blkno);

int ocfs2_claim_new_inode_at_loc(handle_t *handle,
				 struct inode *dir,
				 struct ocfs2_alloc_context *ac,
				 u64 *suballoc_loc,
				 u16 *suballoc_bit,
				 u64 di_blkno);

223
#endif /* _CHAINALLOC_H_ */