blob: bf8e9aff272e3765e3ebbdfe39d0962ae68e594e [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)
84#define XFS_INOBT_IS_FREE_DISK(rp,i) \
Christoph Hellwig61a25842006-09-28 10:57:04 +100085 ((be64_to_cpu((rp)->ir_free) & XFS_INOBT_MASK(i)) != 0)
Linus Torvalds1da177e2005-04-16 15:20:36 -070086#define XFS_INOBT_SET_FREE(rp,i) ((rp)->ir_free |= XFS_INOBT_MASK(i))
Linus Torvalds1da177e2005-04-16 15:20:36 -070087#define XFS_INOBT_CLR_FREE(rp,i) ((rp)->ir_free &= ~XFS_INOBT_MASK(i))
Linus Torvalds1da177e2005-04-16 15:20:36 -070088
89/*
90 * Real block structures have a size equal to the disk block size.
91 */
Nathan Scotta844f452005-11-02 14:38:42 +110092#define XFS_INOBT_BLOCK_MAXRECS(lev,cur) ((cur)->bc_mp->m_inobt_mxr[lev != 0])
93#define XFS_INOBT_BLOCK_MINRECS(lev,cur) ((cur)->bc_mp->m_inobt_mnr[lev != 0])
Linus Torvalds1da177e2005-04-16 15:20:36 -070094#define XFS_INOBT_IS_LAST_REC(cur) \
Christoph Hellwig16259e72005-11-02 15:11:25 +110095 ((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 -070096
97/*
98 * Maximum number of inode btree levels.
99 */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700100#define XFS_IN_MAXLEVELS(mp) ((mp)->m_in_maxlevels)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700101
102/*
103 * block numbers in the AG.
104 */
Nathan Scotta844f452005-11-02 14:38:42 +1100105#define XFS_IBT_BLOCK(mp) ((xfs_agblock_t)(XFS_CNT_BLOCK(mp) + 1))
106#define XFS_PREALLOC_BLOCKS(mp) ((xfs_agblock_t)(XFS_IBT_BLOCK(mp) + 1))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700107
108/*
109 * Record, key, and pointer address macros for btree blocks.
110 */
Nathan Scotta844f452005-11-02 14:38:42 +1100111#define XFS_INOBT_REC_ADDR(bb,i,cur) \
Eric Sandeen2c36dde2007-02-10 18:37:33 +1100112 (XFS_BTREE_REC_ADDR(xfs_inobt, bb, i))
113
Nathan Scotta844f452005-11-02 14:38:42 +1100114#define XFS_INOBT_KEY_ADDR(bb,i,cur) \
Eric Sandeen2c36dde2007-02-10 18:37:33 +1100115 (XFS_BTREE_KEY_ADDR(xfs_inobt, bb, i))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700116
Nathan Scotta844f452005-11-02 14:38:42 +1100117#define XFS_INOBT_PTR_ADDR(bb,i,cur) \
Eric Sandeen2c36dde2007-02-10 18:37:33 +1100118 (XFS_BTREE_PTR_ADDR(xfs_inobt, bb, \
Nathan Scotta844f452005-11-02 14:38:42 +1100119 i, XFS_INOBT_BLOCK_MAXRECS(1, cur)))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700120
121/*
122 * Decrement cursor by one record at the level.
123 * For nonzero levels the leaf-ward information is untouched.
124 */
Nathan Scotta844f452005-11-02 14:38:42 +1100125extern int xfs_inobt_decrement(struct xfs_btree_cur *cur, int level, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700126
127/*
128 * Delete the record pointed to by cur.
129 * The cursor refers to the place where the record was (could be inserted)
130 * when the operation returns.
131 */
Nathan Scotta844f452005-11-02 14:38:42 +1100132extern int xfs_inobt_delete(struct xfs_btree_cur *cur, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700133
134/*
135 * Get the data from the pointed-to record.
136 */
Nathan Scotta844f452005-11-02 14:38:42 +1100137extern int xfs_inobt_get_rec(struct xfs_btree_cur *cur, xfs_agino_t *ino,
138 __int32_t *fcnt, xfs_inofree_t *free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700139
140/*
141 * Increment cursor by one record at the level.
142 * For nonzero levels the leaf-ward information is untouched.
143 */
Nathan Scotta844f452005-11-02 14:38:42 +1100144extern int xfs_inobt_increment(struct xfs_btree_cur *cur, int level, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700145
146/*
147 * Insert the current record at the point referenced by cur.
148 * The cursor may be inconsistent on return if splits have been done.
149 */
Nathan Scotta844f452005-11-02 14:38:42 +1100150extern int xfs_inobt_insert(struct xfs_btree_cur *cur, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700151
152/*
153 * Lookup the record equal to ino in the btree given by cur.
154 */
Nathan Scotta844f452005-11-02 14:38:42 +1100155extern int xfs_inobt_lookup_eq(struct xfs_btree_cur *cur, xfs_agino_t ino,
156 __int32_t fcnt, xfs_inofree_t free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700157
158/*
159 * Lookup the first record greater than or equal to ino
160 * in the btree given by cur.
161 */
Nathan Scotta844f452005-11-02 14:38:42 +1100162extern int xfs_inobt_lookup_ge(struct xfs_btree_cur *cur, xfs_agino_t ino,
163 __int32_t fcnt, xfs_inofree_t free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700164
165/*
166 * Lookup the first record less than or equal to ino
167 * in the btree given by cur.
168 */
Nathan Scotta844f452005-11-02 14:38:42 +1100169extern int xfs_inobt_lookup_le(struct xfs_btree_cur *cur, xfs_agino_t ino,
170 __int32_t fcnt, xfs_inofree_t free, int *stat);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700171
172/*
173 * Update the record referred to by cur, to the value given
174 * by [ino, fcnt, free].
175 * This either works (return 0) or gets an EFSCORRUPTED error.
176 */
Nathan Scotta844f452005-11-02 14:38:42 +1100177extern int xfs_inobt_update(struct xfs_btree_cur *cur, xfs_agino_t ino,
178 __int32_t fcnt, xfs_inofree_t free);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700179
180#endif /* __XFS_IALLOC_BTREE_H__ */