blob: 8efc4a5b8b9289f30d8d11c069021b6a606e592d [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Nathan Scott7b718762005-11-02 14:58:39 +11002 * Copyright (c) 2000,2005 Silicon Graphics, Inc.
3 * All Rights Reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07004 *
Nathan Scott7b718762005-11-02 14:58:39 +11005 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
Linus Torvalds1da177e2005-04-16 15:20:36 -07007 * published by the Free Software Foundation.
8 *
Nathan Scott7b718762005-11-02 14:58:39 +11009 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
Linus Torvalds1da177e2005-04-16 15:20:36 -070013 *
Nathan Scott7b718762005-11-02 14:58:39 +110014 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
Linus Torvalds1da177e2005-04-16 15:20:36 -070017 */
18#ifndef __XFS_IALLOC_BTREE_H__
19#define __XFS_IALLOC_BTREE_H__
20
21/*
22 * Inode map on-disk structures
23 */
24
25struct xfs_buf;
26struct xfs_btree_cur;
27struct xfs_btree_sblock;
28struct xfs_mount;
29
30/*
31 * There is a btree for the inode map per allocation group.
32 */
33#define XFS_IBT_MAGIC 0x49414254 /* 'IABT' */
34
35typedef __uint64_t xfs_inofree_t;
36#define XFS_INODES_PER_CHUNK (NBBY * sizeof(xfs_inofree_t))
37#define XFS_INODES_PER_CHUNK_LOG (XFS_NBBYLOG + 3)
38#define XFS_INOBT_ALL_FREE ((xfs_inofree_t)-1)
39
Linus Torvalds1da177e2005-04-16 15:20:36 -070040#define XFS_INOBT_MASKN(i,n) xfs_inobt_maskn(i,n)
Nathan Scotta844f452005-11-02 14:38:42 +110041static inline xfs_inofree_t xfs_inobt_maskn(int i, int n)
42{
43 return (((n) >= XFS_INODES_PER_CHUNK ? \
44 (xfs_inofree_t)0 : ((xfs_inofree_t)1 << (n))) - 1) << (i);
45}
Linus Torvalds1da177e2005-04-16 15:20:36 -070046
47/*
48 * Data record structure
49 */
Christoph Hellwig61a25842006-09-28 10:57:04 +100050typedef struct xfs_inobt_rec {
51 __be32 ir_startino; /* starting inode number */
52 __be32 ir_freecount; /* count of free inodes (set bits) */
53 __be64 ir_free; /* free inode mask */
54} xfs_inobt_rec_t;
55
56typedef struct xfs_inobt_rec_incore {
Linus Torvalds1da177e2005-04-16 15:20:36 -070057 xfs_agino_t ir_startino; /* starting inode number */
58 __int32_t ir_freecount; /* count of free inodes (set bits) */
59 xfs_inofree_t ir_free; /* free inode mask */
Christoph Hellwig61a25842006-09-28 10:57:04 +100060} xfs_inobt_rec_incore_t;
61
Linus Torvalds1da177e2005-04-16 15:20:36 -070062
63/*
64 * Key structure
65 */
Christoph Hellwig61a25842006-09-28 10:57:04 +100066typedef struct xfs_inobt_key {
67 __be32 ir_startino; /* starting inode number */
Linus Torvalds1da177e2005-04-16 15:20:36 -070068} xfs_inobt_key_t;
69
Christoph Hellwig16259e72005-11-02 15:11:25 +110070/* btree pointer type */
71typedef __be32 xfs_inobt_ptr_t;
72
73/* btree block header type */
Linus Torvalds1da177e2005-04-16 15:20:36 -070074typedef struct xfs_btree_sblock xfs_inobt_block_t;
75
Nathan Scotta844f452005-11-02 14:38:42 +110076#define XFS_BUF_TO_INOBT_BLOCK(bp) ((xfs_inobt_block_t *)XFS_BUF_PTR(bp))
Linus Torvalds1da177e2005-04-16 15:20:36 -070077
78/*
79 * Bit manipulations for ir_free.
80 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070081#define XFS_INOBT_MASK(i) ((xfs_inofree_t)1 << (i))
Nathan Scotta844f452005-11-02 14:38:42 +110082#define XFS_INOBT_IS_FREE(rp,i) \
83 (((rp)->ir_free & XFS_INOBT_MASK(i)) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -070084#define XFS_INOBT_SET_FREE(rp,i) ((rp)->ir_free |= XFS_INOBT_MASK(i))
Linus Torvalds1da177e2005-04-16 15:20:36 -070085#define XFS_INOBT_CLR_FREE(rp,i) ((rp)->ir_free &= ~XFS_INOBT_MASK(i))
Linus Torvalds1da177e2005-04-16 15:20:36 -070086
87/*
88 * Real block structures have a size equal to the disk block size.
89 */
Nathan Scotta844f452005-11-02 14:38:42 +110090#define XFS_INOBT_BLOCK_MAXRECS(lev,cur) ((cur)->bc_mp->m_inobt_mxr[lev != 0])
91#define XFS_INOBT_BLOCK_MINRECS(lev,cur) ((cur)->bc_mp->m_inobt_mnr[lev != 0])
Linus Torvalds1da177e2005-04-16 15:20:36 -070092#define XFS_INOBT_IS_LAST_REC(cur) \
Christoph Hellwig16259e72005-11-02 15:11:25 +110093 ((cur)->bc_ptrs[0] == be16_to_cpu(XFS_BUF_TO_INOBT_BLOCK((cur)->bc_bufs[0])->bb_numrecs))
Linus Torvalds1da177e2005-04-16 15:20:36 -070094
95/*
96 * Maximum number of inode btree levels.
97 */
Linus Torvalds1da177e2005-04-16 15:20:36 -070098#define XFS_IN_MAXLEVELS(mp) ((mp)->m_in_maxlevels)
Linus Torvalds1da177e2005-04-16 15:20:36 -070099
100/*
101 * block numbers in the AG.
102 */
Nathan Scotta844f452005-11-02 14:38:42 +1100103#define XFS_IBT_BLOCK(mp) ((xfs_agblock_t)(XFS_CNT_BLOCK(mp) + 1))
104#define XFS_PREALLOC_BLOCKS(mp) ((xfs_agblock_t)(XFS_IBT_BLOCK(mp) + 1))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700105
106/*
107 * Record, key, and pointer address macros for btree blocks.
108 */
Nathan Scotta844f452005-11-02 14:38:42 +1100109#define XFS_INOBT_REC_ADDR(bb,i,cur) \
Eric Sandeen2c36dde2007-02-10 18:37:33 +1100110 (XFS_BTREE_REC_ADDR(xfs_inobt, bb, i))
111
Nathan Scotta844f452005-11-02 14:38:42 +1100112#define XFS_INOBT_KEY_ADDR(bb,i,cur) \
Eric Sandeen2c36dde2007-02-10 18:37:33 +1100113 (XFS_BTREE_KEY_ADDR(xfs_inobt, bb, i))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700114
Nathan Scotta844f452005-11-02 14:38:42 +1100115#define XFS_INOBT_PTR_ADDR(bb,i,cur) \
Eric Sandeen2c36dde2007-02-10 18:37:33 +1100116 (XFS_BTREE_PTR_ADDR(xfs_inobt, bb, \
Nathan Scotta844f452005-11-02 14:38:42 +1100117 i, XFS_INOBT_BLOCK_MAXRECS(1, cur)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700118
119/*
120 * Decrement cursor by one record at the level.
121 * For nonzero levels the leaf-ward information is untouched.
122 */
Nathan Scotta844f452005-11-02 14:38:42 +1100123extern int xfs_inobt_decrement(struct xfs_btree_cur *cur, int level, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700124
125/*
126 * Delete the record pointed to by cur.
127 * The cursor refers to the place where the record was (could be inserted)
128 * when the operation returns.
129 */
Nathan Scotta844f452005-11-02 14:38:42 +1100130extern int xfs_inobt_delete(struct xfs_btree_cur *cur, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700131
132/*
133 * Get the data from the pointed-to record.
134 */
Nathan Scotta844f452005-11-02 14:38:42 +1100135extern int xfs_inobt_get_rec(struct xfs_btree_cur *cur, xfs_agino_t *ino,
136 __int32_t *fcnt, xfs_inofree_t *free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700137
138/*
139 * Increment cursor by one record at the level.
140 * For nonzero levels the leaf-ward information is untouched.
141 */
Nathan Scotta844f452005-11-02 14:38:42 +1100142extern int xfs_inobt_increment(struct xfs_btree_cur *cur, int level, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700143
144/*
145 * Insert the current record at the point referenced by cur.
146 * The cursor may be inconsistent on return if splits have been done.
147 */
Nathan Scotta844f452005-11-02 14:38:42 +1100148extern int xfs_inobt_insert(struct xfs_btree_cur *cur, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700149
150/*
151 * Lookup the record equal to ino in the btree given by cur.
152 */
Nathan Scotta844f452005-11-02 14:38:42 +1100153extern int xfs_inobt_lookup_eq(struct xfs_btree_cur *cur, xfs_agino_t ino,
154 __int32_t fcnt, xfs_inofree_t free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700155
156/*
157 * Lookup the first record greater than or equal to ino
158 * in the btree given by cur.
159 */
Nathan Scotta844f452005-11-02 14:38:42 +1100160extern int xfs_inobt_lookup_ge(struct xfs_btree_cur *cur, xfs_agino_t ino,
161 __int32_t fcnt, xfs_inofree_t free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700162
163/*
164 * Lookup the first record less than or equal to ino
165 * in the btree given by cur.
166 */
Nathan Scotta844f452005-11-02 14:38:42 +1100167extern int xfs_inobt_lookup_le(struct xfs_btree_cur *cur, xfs_agino_t ino,
168 __int32_t fcnt, xfs_inofree_t free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700169
170/*
171 * Update the record referred to by cur, to the value given
172 * by [ino, fcnt, free].
173 * This either works (return 0) or gets an EFSCORRUPTED error.
174 */
Nathan Scotta844f452005-11-02 14:38:42 +1100175extern int xfs_inobt_update(struct xfs_btree_cur *cur, xfs_agino_t ino,
176 __int32_t fcnt, xfs_inofree_t free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700177
178#endif /* __XFS_IALLOC_BTREE_H__ */