Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright 1996, 1997, 1998 Hans Reiser, see reiserfs/README for licensing and copyright details |
| 3 | */ |
| 4 | |
| 5 | /* this file has an amazingly stupid |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 6 | name, yura please fix it to be |
| 7 | reiserfs.h, and merge all the rest |
| 8 | of our .h files that are in this |
| 9 | directory into it. */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 10 | |
| 11 | #ifndef _LINUX_REISER_FS_H |
| 12 | #define _LINUX_REISER_FS_H |
| 13 | |
| 14 | #include <linux/types.h> |
Jeff Garzik | e18fa70 | 2006-09-24 11:13:19 -0400 | [diff] [blame] | 15 | #include <linux/magic.h> |
| 16 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 17 | #ifdef __KERNEL__ |
| 18 | #include <linux/slab.h> |
| 19 | #include <linux/interrupt.h> |
| 20 | #include <linux/sched.h> |
| 21 | #include <linux/workqueue.h> |
| 22 | #include <asm/unaligned.h> |
| 23 | #include <linux/bitops.h> |
| 24 | #include <linux/proc_fs.h> |
| 25 | #include <linux/smp_lock.h> |
| 26 | #include <linux/buffer_head.h> |
| 27 | #include <linux/reiserfs_fs_i.h> |
| 28 | #include <linux/reiserfs_fs_sb.h> |
| 29 | #endif |
| 30 | |
Christoph Hellwig | be55caf | 2007-10-21 16:42:13 -0700 | [diff] [blame] | 31 | struct fid; |
| 32 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 33 | /* |
| 34 | * include/linux/reiser_fs.h |
| 35 | * |
| 36 | * Reiser File System constants and structures |
| 37 | * |
| 38 | */ |
| 39 | |
| 40 | /* in reading the #defines, it may help to understand that they employ |
| 41 | the following abbreviations: |
| 42 | |
| 43 | B = Buffer |
| 44 | I = Item header |
| 45 | H = Height within the tree (should be changed to LEV) |
| 46 | N = Number of the item in the node |
| 47 | STAT = stat data |
| 48 | DEH = Directory Entry Header |
| 49 | EC = Entry Count |
| 50 | E = Entry number |
| 51 | UL = Unsigned Long |
| 52 | BLKH = BLocK Header |
| 53 | UNFM = UNForMatted node |
| 54 | DC = Disk Child |
| 55 | P = Path |
| 56 | |
| 57 | These #defines are named by concatenating these abbreviations, |
| 58 | where first comes the arguments, and last comes the return value, |
| 59 | of the macro. |
| 60 | |
| 61 | */ |
| 62 | |
| 63 | #define USE_INODE_GENERATION_COUNTER |
| 64 | |
| 65 | #define REISERFS_PREALLOCATE |
| 66 | #define DISPLACE_NEW_PACKING_LOCALITIES |
| 67 | #define PREALLOCATION_SIZE 9 |
| 68 | |
| 69 | /* n must be power of 2 */ |
| 70 | #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u)) |
| 71 | |
| 72 | // to be ok for alpha and others we have to align structures to 8 byte |
| 73 | // boundary. |
| 74 | // FIXME: do not change 4 by anything else: there is code which relies on that |
| 75 | #define ROUND_UP(x) _ROUND_UP(x,8LL) |
| 76 | |
| 77 | /* debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug |
| 78 | ** messages. |
| 79 | */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 80 | #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 81 | |
Jeff Mahoney | 45b03d5 | 2009-03-30 14:02:21 -0400 | [diff] [blame] | 82 | void __reiserfs_warning(struct super_block *s, const char *id, |
| 83 | const char *func, const char *fmt, ...); |
| 84 | #define reiserfs_warning(s, id, fmt, args...) \ |
| 85 | __reiserfs_warning(s, id, __func__, fmt, ##args) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 86 | /* assertions handling */ |
| 87 | |
| 88 | /** always check a condition and panic if it's false. */ |
Al Viro | 2d954d0 | 2007-07-27 14:23:44 +0100 | [diff] [blame] | 89 | #define __RASSERT( cond, scond, format, args... ) \ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 90 | if( !( cond ) ) \ |
Al Viro | 2d954d0 | 2007-07-27 14:23:44 +0100 | [diff] [blame] | 91 | reiserfs_panic( NULL, "reiserfs[%i]: assertion " scond " failed at " \ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 92 | __FILE__ ":%i:%s: " format "\n", \ |
Harvey Harrison | d5c003b | 2008-10-15 22:01:24 -0700 | [diff] [blame] | 93 | in_interrupt() ? -1 : task_pid_nr(current), __LINE__ , __func__ , ##args ) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 94 | |
Al Viro | 2d954d0 | 2007-07-27 14:23:44 +0100 | [diff] [blame] | 95 | #define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args) |
| 96 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 97 | #if defined( CONFIG_REISERFS_CHECK ) |
Al Viro | 2d954d0 | 2007-07-27 14:23:44 +0100 | [diff] [blame] | 98 | #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 99 | #else |
| 100 | #define RFALSE( cond, format, args... ) do {;} while( 0 ) |
| 101 | #endif |
| 102 | |
| 103 | #define CONSTF __attribute_const__ |
| 104 | /* |
| 105 | * Disk Data Structures |
| 106 | */ |
| 107 | |
| 108 | /***************************************************************************/ |
| 109 | /* SUPER BLOCK */ |
| 110 | /***************************************************************************/ |
| 111 | |
| 112 | /* |
| 113 | * Structure of super block on disk, a version of which in RAM is often accessed as REISERFS_SB(s)->s_rs |
| 114 | * the version in RAM is part of a larger structure containing fields never written to disk. |
| 115 | */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 116 | #define UNSET_HASH 0 // read_super will guess about, what hash names |
| 117 | // in directories were sorted with |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 118 | #define TEA_HASH 1 |
| 119 | #define YURA_HASH 2 |
| 120 | #define R5_HASH 3 |
| 121 | #define DEFAULT_HASH R5_HASH |
| 122 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 123 | struct journal_params { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 124 | __le32 jp_journal_1st_block; /* where does journal start from on its |
| 125 | * device */ |
| 126 | __le32 jp_journal_dev; /* journal device st_rdev */ |
| 127 | __le32 jp_journal_size; /* size of the journal */ |
| 128 | __le32 jp_journal_trans_max; /* max number of blocks in a transaction. */ |
| 129 | __le32 jp_journal_magic; /* random value made on fs creation (this |
| 130 | * was sb_journal_block_count) */ |
| 131 | __le32 jp_journal_max_batch; /* max number of blocks to batch into a |
| 132 | * trans */ |
| 133 | __le32 jp_journal_max_commit_age; /* in seconds, how old can an async |
| 134 | * commit be */ |
| 135 | __le32 jp_journal_max_trans_age; /* in seconds, how old can a transaction |
| 136 | * be */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 137 | }; |
| 138 | |
| 139 | /* this is the super from 3.5.X, where X >= 10 */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 140 | struct reiserfs_super_block_v1 { |
| 141 | __le32 s_block_count; /* blocks count */ |
| 142 | __le32 s_free_blocks; /* free blocks count */ |
| 143 | __le32 s_root_block; /* root block number */ |
| 144 | struct journal_params s_journal; |
| 145 | __le16 s_blocksize; /* block size */ |
| 146 | __le16 s_oid_maxsize; /* max size of object id array, see |
| 147 | * get_objectid() commentary */ |
| 148 | __le16 s_oid_cursize; /* current size of object id array */ |
| 149 | __le16 s_umount_state; /* this is set to 1 when filesystem was |
| 150 | * umounted, to 2 - when not */ |
| 151 | char s_magic[10]; /* reiserfs magic string indicates that |
| 152 | * file system is reiserfs: |
| 153 | * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs" */ |
| 154 | __le16 s_fs_state; /* it is set to used by fsck to mark which |
| 155 | * phase of rebuilding is done */ |
| 156 | __le32 s_hash_function_code; /* indicate, what hash function is being use |
| 157 | * to sort names in a directory*/ |
| 158 | __le16 s_tree_height; /* height of disk tree */ |
| 159 | __le16 s_bmap_nr; /* amount of bitmap blocks needed to address |
| 160 | * each block of file system */ |
| 161 | __le16 s_version; /* this field is only reliable on filesystem |
| 162 | * with non-standard journal */ |
| 163 | __le16 s_reserved_for_journal; /* size in blocks of journal area on main |
| 164 | * device, we need to keep after |
| 165 | * making fs with non-standard journal */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 166 | } __attribute__ ((__packed__)); |
| 167 | |
| 168 | #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1)) |
| 169 | |
| 170 | /* this is the on disk super block */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 171 | struct reiserfs_super_block { |
| 172 | struct reiserfs_super_block_v1 s_v1; |
| 173 | __le32 s_inode_generation; |
| 174 | __le32 s_flags; /* Right now used only by inode-attributes, if enabled */ |
| 175 | unsigned char s_uuid[16]; /* filesystem unique identifier */ |
| 176 | unsigned char s_label[16]; /* filesystem volume label */ |
Jeff Mahoney | 702d21c | 2009-03-30 14:02:16 -0400 | [diff] [blame] | 177 | __le16 s_mnt_count; /* Count of mounts since last fsck */ |
| 178 | __le16 s_max_mnt_count; /* Maximum mounts before check */ |
| 179 | __le32 s_lastcheck; /* Timestamp of last fsck */ |
| 180 | __le32 s_check_interval; /* Interval between checks */ |
| 181 | char s_unused[76]; /* zero filled by mkreiserfs and |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 182 | * reiserfs_convert_objectid_map_v1() |
| 183 | * so any additions must be updated |
| 184 | * there as well. */ |
| 185 | } __attribute__ ((__packed__)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 186 | |
| 187 | #define SB_SIZE (sizeof(struct reiserfs_super_block)) |
| 188 | |
| 189 | #define REISERFS_VERSION_1 0 |
| 190 | #define REISERFS_VERSION_2 2 |
| 191 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 192 | // on-disk super block fields converted to cpu form |
| 193 | #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs) |
| 194 | #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1)) |
| 195 | #define SB_BLOCKSIZE(s) \ |
| 196 | le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize)) |
| 197 | #define SB_BLOCK_COUNT(s) \ |
| 198 | le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count)) |
| 199 | #define SB_FREE_BLOCKS(s) \ |
| 200 | le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks)) |
| 201 | #define SB_REISERFS_MAGIC(s) \ |
| 202 | (SB_V1_DISK_SUPER_BLOCK(s)->s_magic) |
| 203 | #define SB_ROOT_BLOCK(s) \ |
| 204 | le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block)) |
| 205 | #define SB_TREE_HEIGHT(s) \ |
| 206 | le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height)) |
| 207 | #define SB_REISERFS_STATE(s) \ |
| 208 | le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state)) |
| 209 | #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version)) |
| 210 | #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr)) |
| 211 | |
| 212 | #define PUT_SB_BLOCK_COUNT(s, val) \ |
| 213 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0) |
| 214 | #define PUT_SB_FREE_BLOCKS(s, val) \ |
| 215 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0) |
| 216 | #define PUT_SB_ROOT_BLOCK(s, val) \ |
| 217 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0) |
| 218 | #define PUT_SB_TREE_HEIGHT(s, val) \ |
| 219 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0) |
| 220 | #define PUT_SB_REISERFS_STATE(s, val) \ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 221 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 222 | #define PUT_SB_VERSION(s, val) \ |
| 223 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0) |
| 224 | #define PUT_SB_BMAP_NR(s, val) \ |
| 225 | do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0) |
| 226 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 227 | #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal) |
| 228 | #define SB_ONDISK_JOURNAL_SIZE(s) \ |
| 229 | le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size)) |
| 230 | #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \ |
| 231 | le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block)) |
| 232 | #define SB_ONDISK_JOURNAL_DEVICE(s) \ |
| 233 | le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev)) |
| 234 | #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \ |
Al Viro | b8cc936 | 2005-05-01 08:59:18 -0700 | [diff] [blame] | 235 | le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 236 | |
| 237 | #define is_block_in_log_or_reserved_area(s, block) \ |
| 238 | block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \ |
| 239 | && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \ |
| 240 | ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 241 | SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s))) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 242 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 243 | int is_reiserfs_3_5(struct reiserfs_super_block *rs); |
| 244 | int is_reiserfs_3_6(struct reiserfs_super_block *rs); |
| 245 | int is_reiserfs_jr(struct reiserfs_super_block *rs); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 246 | |
| 247 | /* ReiserFS leaves the first 64k unused, so that partition labels have |
| 248 | enough space. If someone wants to write a fancy bootloader that |
| 249 | needs more than 64k, let us know, and this will be increased in size. |
| 250 | This number must be larger than than the largest block size on any |
| 251 | platform, or code will break. -Hans */ |
| 252 | #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024) |
| 253 | #define REISERFS_FIRST_BLOCK unused_define |
| 254 | #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES |
| 255 | |
| 256 | /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */ |
| 257 | #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024) |
| 258 | |
| 259 | // reiserfs internal error code (used by search_by_key adn fix_nodes)) |
| 260 | #define CARRY_ON 0 |
| 261 | #define REPEAT_SEARCH -1 |
| 262 | #define IO_ERROR -2 |
| 263 | #define NO_DISK_SPACE -3 |
| 264 | #define NO_BALANCING_NEEDED (-4) |
| 265 | #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5) |
| 266 | #define QUOTA_EXCEEDED -6 |
| 267 | |
| 268 | typedef __u32 b_blocknr_t; |
Al Viro | 3e8962b | 2005-05-01 08:59:18 -0700 | [diff] [blame] | 269 | typedef __le32 unp_t; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 270 | |
| 271 | struct unfm_nodeinfo { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 272 | unp_t unfm_nodenum; |
| 273 | unsigned short unfm_freespace; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 274 | }; |
| 275 | |
| 276 | /* there are two formats of keys: 3.5 and 3.6 |
| 277 | */ |
| 278 | #define KEY_FORMAT_3_5 0 |
| 279 | #define KEY_FORMAT_3_6 1 |
| 280 | |
| 281 | /* there are two stat datas */ |
| 282 | #define STAT_DATA_V1 0 |
| 283 | #define STAT_DATA_V2 1 |
| 284 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 285 | static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode) |
| 286 | { |
| 287 | return container_of(inode, struct reiserfs_inode_info, vfs_inode); |
| 288 | } |
| 289 | |
| 290 | static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb) |
| 291 | { |
| 292 | return sb->s_fs_info; |
| 293 | } |
| 294 | |
Jeff Mahoney | cb680c1 | 2007-10-18 23:39:27 -0700 | [diff] [blame] | 295 | /* Don't trust REISERFS_SB(sb)->s_bmap_nr, it's a u16 |
| 296 | * which overflows on large file systems. */ |
Mike Frysinger | 13d8bcd26 | 2008-02-08 04:21:54 -0800 | [diff] [blame] | 297 | static inline __u32 reiserfs_bmap_count(struct super_block *sb) |
Jeff Mahoney | cb680c1 | 2007-10-18 23:39:27 -0700 | [diff] [blame] | 298 | { |
| 299 | return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1; |
| 300 | } |
| 301 | |
| 302 | static inline int bmap_would_wrap(unsigned bmap_nr) |
| 303 | { |
| 304 | return bmap_nr > ((1LL << 16) - 1); |
| 305 | } |
| 306 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 307 | /** this says about version of key of all items (but stat data) the |
| 308 | object consists of */ |
| 309 | #define get_inode_item_key_version( inode ) \ |
| 310 | ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5) |
| 311 | |
| 312 | #define set_inode_item_key_version( inode, version ) \ |
| 313 | ({ if((version)==KEY_FORMAT_3_6) \ |
| 314 | REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \ |
| 315 | else \ |
| 316 | REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; }) |
| 317 | |
| 318 | #define get_inode_sd_version(inode) \ |
| 319 | ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1) |
| 320 | |
| 321 | #define set_inode_sd_version(inode, version) \ |
| 322 | ({ if((version)==STAT_DATA_V2) \ |
| 323 | REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \ |
| 324 | else \ |
| 325 | REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; }) |
| 326 | |
| 327 | /* This is an aggressive tail suppression policy, I am hoping it |
| 328 | improves our benchmarks. The principle behind it is that percentage |
| 329 | space saving is what matters, not absolute space saving. This is |
| 330 | non-intuitive, but it helps to understand it if you consider that the |
| 331 | cost to access 4 blocks is not much more than the cost to access 1 |
| 332 | block, if you have to do a seek and rotate. A tail risks a |
| 333 | non-linear disk access that is significant as a percentage of total |
| 334 | time cost for a 4 block file and saves an amount of space that is |
| 335 | less significant as a percentage of space, or so goes the hypothesis. |
| 336 | -Hans */ |
| 337 | #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \ |
| 338 | (\ |
| 339 | (!(n_tail_size)) || \ |
| 340 | (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \ |
| 341 | ( (n_file_size) >= (n_block_size) * 4 ) || \ |
| 342 | ( ( (n_file_size) >= (n_block_size) * 3 ) && \ |
| 343 | ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \ |
| 344 | ( ( (n_file_size) >= (n_block_size) * 2 ) && \ |
| 345 | ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \ |
| 346 | ( ( (n_file_size) >= (n_block_size) ) && \ |
| 347 | ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \ |
| 348 | ) |
| 349 | |
| 350 | /* Another strategy for tails, this one means only create a tail if all the |
| 351 | file would fit into one DIRECT item. |
| 352 | Primary intention for this one is to increase performance by decreasing |
| 353 | seeking. |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 354 | */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 355 | #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \ |
| 356 | (\ |
| 357 | (!(n_tail_size)) || \ |
| 358 | (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \ |
| 359 | ) |
| 360 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 361 | /* |
| 362 | * values for s_umount_state field |
| 363 | */ |
| 364 | #define REISERFS_VALID_FS 1 |
| 365 | #define REISERFS_ERROR_FS 2 |
| 366 | |
| 367 | // |
| 368 | // there are 5 item types currently |
| 369 | // |
| 370 | #define TYPE_STAT_DATA 0 |
| 371 | #define TYPE_INDIRECT 1 |
| 372 | #define TYPE_DIRECT 2 |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 373 | #define TYPE_DIRENTRY 3 |
| 374 | #define TYPE_MAXTYPE 3 |
| 375 | #define TYPE_ANY 15 // FIXME: comment is required |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 376 | |
| 377 | /***************************************************************************/ |
| 378 | /* KEY & ITEM HEAD */ |
| 379 | /***************************************************************************/ |
| 380 | |
| 381 | // |
| 382 | // directories use this key as well as old files |
| 383 | // |
| 384 | struct offset_v1 { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 385 | __le32 k_offset; |
| 386 | __le32 k_uniqueness; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 387 | } __attribute__ ((__packed__)); |
| 388 | |
| 389 | struct offset_v2 { |
Al Viro | f8e08a8 | 2005-05-01 08:59:19 -0700 | [diff] [blame] | 390 | __le64 v; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 391 | } __attribute__ ((__packed__)); |
| 392 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 393 | static inline __u16 offset_v2_k_type(const struct offset_v2 *v2) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 394 | { |
Al Viro | f8e08a8 | 2005-05-01 08:59:19 -0700 | [diff] [blame] | 395 | __u8 type = le64_to_cpu(v2->v) >> 60; |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 396 | return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 397 | } |
| 398 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 399 | static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type) |
| 400 | { |
| 401 | v2->v = |
| 402 | (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60); |
| 403 | } |
| 404 | |
| 405 | static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2) |
| 406 | { |
| 407 | return le64_to_cpu(v2->v) & (~0ULL >> 4); |
| 408 | } |
| 409 | |
| 410 | static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset) |
| 411 | { |
| 412 | offset &= (~0ULL >> 4); |
| 413 | v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 414 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 415 | |
| 416 | /* Key of an item determines its location in the S+tree, and |
| 417 | is composed of 4 components */ |
| 418 | struct reiserfs_key { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 419 | __le32 k_dir_id; /* packing locality: by default parent |
| 420 | directory object id */ |
| 421 | __le32 k_objectid; /* object identifier */ |
| 422 | union { |
| 423 | struct offset_v1 k_offset_v1; |
| 424 | struct offset_v2 k_offset_v2; |
| 425 | } __attribute__ ((__packed__)) u; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 426 | } __attribute__ ((__packed__)); |
| 427 | |
Al Viro | 6a3a16f | 2005-05-01 08:59:17 -0700 | [diff] [blame] | 428 | struct in_core_key { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 429 | __u32 k_dir_id; /* packing locality: by default parent |
| 430 | directory object id */ |
| 431 | __u32 k_objectid; /* object identifier */ |
| 432 | __u64 k_offset; |
| 433 | __u8 k_type; |
Al Viro | 6b9f582 | 2005-05-01 08:59:19 -0700 | [diff] [blame] | 434 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 435 | |
| 436 | struct cpu_key { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 437 | struct in_core_key on_disk_key; |
| 438 | int version; |
| 439 | int key_length; /* 3 in all cases but direct2indirect and |
| 440 | indirect2direct conversion */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 441 | }; |
| 442 | |
| 443 | /* Our function for comparing keys can compare keys of different |
| 444 | lengths. It takes as a parameter the length of the keys it is to |
| 445 | compare. These defines are used in determining what is to be passed |
| 446 | to it as that parameter. */ |
| 447 | #define REISERFS_FULL_KEY_LEN 4 |
| 448 | #define REISERFS_SHORT_KEY_LEN 2 |
| 449 | |
| 450 | /* The result of the key compare */ |
| 451 | #define FIRST_GREATER 1 |
| 452 | #define SECOND_GREATER -1 |
| 453 | #define KEYS_IDENTICAL 0 |
| 454 | #define KEY_FOUND 1 |
| 455 | #define KEY_NOT_FOUND 0 |
| 456 | |
| 457 | #define KEY_SIZE (sizeof(struct reiserfs_key)) |
| 458 | #define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32)) |
| 459 | |
| 460 | /* return values for search_by_key and clones */ |
| 461 | #define ITEM_FOUND 1 |
| 462 | #define ITEM_NOT_FOUND 0 |
| 463 | #define ENTRY_FOUND 1 |
| 464 | #define ENTRY_NOT_FOUND 0 |
| 465 | #define DIRECTORY_NOT_FOUND -1 |
| 466 | #define REGULAR_FILE_FOUND -2 |
| 467 | #define DIRECTORY_FOUND -3 |
| 468 | #define BYTE_FOUND 1 |
| 469 | #define BYTE_NOT_FOUND 0 |
| 470 | #define FILE_NOT_FOUND -1 |
| 471 | |
| 472 | #define POSITION_FOUND 1 |
| 473 | #define POSITION_NOT_FOUND 0 |
| 474 | |
| 475 | // return values for reiserfs_find_entry and search_by_entry_key |
| 476 | #define NAME_FOUND 1 |
| 477 | #define NAME_NOT_FOUND 0 |
| 478 | #define GOTO_PREVIOUS_ITEM 2 |
| 479 | #define NAME_FOUND_INVISIBLE 3 |
| 480 | |
| 481 | /* Everything in the filesystem is stored as a set of items. The |
| 482 | item head contains the key of the item, its free space (for |
| 483 | indirect items) and specifies the location of the item itself |
| 484 | within the block. */ |
| 485 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 486 | struct item_head { |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 487 | /* Everything in the tree is found by searching for it based on |
| 488 | * its key.*/ |
| 489 | struct reiserfs_key ih_key; |
| 490 | union { |
| 491 | /* The free space in the last unformatted node of an |
| 492 | indirect item if this is an indirect item. This |
| 493 | equals 0xFFFF iff this is a direct item or stat data |
| 494 | item. Note that the key, not this field, is used to |
| 495 | determine the item type, and thus which field this |
| 496 | union contains. */ |
Al Viro | 3e8962b | 2005-05-01 08:59:18 -0700 | [diff] [blame] | 497 | __le16 ih_free_space_reserved; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 498 | /* Iff this is a directory item, this field equals the |
| 499 | number of directory entries in the directory item. */ |
Al Viro | 3e8962b | 2005-05-01 08:59:18 -0700 | [diff] [blame] | 500 | __le16 ih_entry_count; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 501 | } __attribute__ ((__packed__)) u; |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 502 | __le16 ih_item_len; /* total size of the item body */ |
| 503 | __le16 ih_item_location; /* an offset to the item body |
| 504 | * within the block */ |
| 505 | __le16 ih_version; /* 0 for all old items, 2 for new |
| 506 | ones. Highest bit is set by fsck |
| 507 | temporary, cleaned after all |
| 508 | done */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 509 | } __attribute__ ((__packed__)); |
| 510 | /* size of item header */ |
| 511 | #define IH_SIZE (sizeof(struct item_head)) |
| 512 | |
| 513 | #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved) |
| 514 | #define ih_version(ih) le16_to_cpu((ih)->ih_version) |
| 515 | #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count) |
| 516 | #define ih_location(ih) le16_to_cpu((ih)->ih_item_location) |
| 517 | #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len) |
| 518 | |
| 519 | #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0) |
| 520 | #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0) |
| 521 | #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0) |
| 522 | #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0) |
| 523 | #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0) |
| 524 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 525 | #define unreachable_item(ih) (ih_version(ih) & (1 << 15)) |
| 526 | |
| 527 | #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih)) |
| 528 | #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val))) |
| 529 | |
| 530 | /* these operate on indirect items, where you've got an array of ints |
| 531 | ** at a possibly unaligned location. These are a noop on ia32 |
| 532 | ** |
| 533 | ** p is the array of __u32, i is the index into the array, v is the value |
| 534 | ** to store there. |
| 535 | */ |
Harvey Harrison | 8b5ac31 | 2008-07-25 01:45:26 -0700 | [diff] [blame] | 536 | #define get_block_num(p, i) get_unaligned_le32((p) + (i)) |
| 537 | #define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i)) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 538 | |
| 539 | // |
| 540 | // in old version uniqueness field shows key type |
| 541 | // |
| 542 | #define V1_SD_UNIQUENESS 0 |
| 543 | #define V1_INDIRECT_UNIQUENESS 0xfffffffe |
| 544 | #define V1_DIRECT_UNIQUENESS 0xffffffff |
| 545 | #define V1_DIRENTRY_UNIQUENESS 500 |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 546 | #define V1_ANY_UNIQUENESS 555 // FIXME: comment is required |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 547 | |
| 548 | // |
| 549 | // here are conversion routines |
| 550 | // |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 551 | static inline int uniqueness2type(__u32 uniqueness) CONSTF; |
| 552 | static inline int uniqueness2type(__u32 uniqueness) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 553 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 554 | switch ((int)uniqueness) { |
| 555 | case V1_SD_UNIQUENESS: |
| 556 | return TYPE_STAT_DATA; |
| 557 | case V1_INDIRECT_UNIQUENESS: |
| 558 | return TYPE_INDIRECT; |
| 559 | case V1_DIRECT_UNIQUENESS: |
| 560 | return TYPE_DIRECT; |
| 561 | case V1_DIRENTRY_UNIQUENESS: |
| 562 | return TYPE_DIRENTRY; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 563 | case V1_ANY_UNIQUENESS: |
Jeff Mahoney | fd7cb03 | 2009-03-30 14:02:23 -0400 | [diff] [blame^] | 564 | default: |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 565 | return TYPE_ANY; |
| 566 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 567 | } |
| 568 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 569 | static inline __u32 type2uniqueness(int type) CONSTF; |
| 570 | static inline __u32 type2uniqueness(int type) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 571 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 572 | switch (type) { |
| 573 | case TYPE_STAT_DATA: |
| 574 | return V1_SD_UNIQUENESS; |
| 575 | case TYPE_INDIRECT: |
| 576 | return V1_INDIRECT_UNIQUENESS; |
| 577 | case TYPE_DIRECT: |
| 578 | return V1_DIRECT_UNIQUENESS; |
| 579 | case TYPE_DIRENTRY: |
| 580 | return V1_DIRENTRY_UNIQUENESS; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 581 | case TYPE_ANY: |
Jeff Mahoney | fd7cb03 | 2009-03-30 14:02:23 -0400 | [diff] [blame^] | 582 | default: |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 583 | return V1_ANY_UNIQUENESS; |
| 584 | } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 585 | } |
| 586 | |
| 587 | // |
| 588 | // key is pointer to on disk key which is stored in le, result is cpu, |
| 589 | // there is no way to get version of object from key, so, provide |
| 590 | // version to these defines |
| 591 | // |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 592 | static inline loff_t le_key_k_offset(int version, |
| 593 | const struct reiserfs_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 594 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 595 | return (version == KEY_FORMAT_3_5) ? |
| 596 | le32_to_cpu(key->u.k_offset_v1.k_offset) : |
| 597 | offset_v2_k_offset(&(key->u.k_offset_v2)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 598 | } |
| 599 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 600 | static inline loff_t le_ih_k_offset(const struct item_head *ih) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 601 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 602 | return le_key_k_offset(ih_version(ih), &(ih->ih_key)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 603 | } |
| 604 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 605 | static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 606 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 607 | return (version == KEY_FORMAT_3_5) ? |
| 608 | uniqueness2type(le32_to_cpu(key->u.k_offset_v1.k_uniqueness)) : |
| 609 | offset_v2_k_type(&(key->u.k_offset_v2)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 610 | } |
| 611 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 612 | static inline loff_t le_ih_k_type(const struct item_head *ih) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 613 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 614 | return le_key_k_type(ih_version(ih), &(ih->ih_key)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 615 | } |
| 616 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 617 | static inline void set_le_key_k_offset(int version, struct reiserfs_key *key, |
| 618 | loff_t offset) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 619 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 620 | (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_offset = cpu_to_le32(offset)) : /* jdm check */ |
| 621 | (void)(set_offset_v2_k_offset(&(key->u.k_offset_v2), offset)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 622 | } |
| 623 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 624 | static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 625 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 626 | set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 627 | } |
| 628 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 629 | static inline void set_le_key_k_type(int version, struct reiserfs_key *key, |
| 630 | int type) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 631 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 632 | (version == KEY_FORMAT_3_5) ? |
| 633 | (void)(key->u.k_offset_v1.k_uniqueness = |
| 634 | cpu_to_le32(type2uniqueness(type))) |
| 635 | : (void)(set_offset_v2_k_type(&(key->u.k_offset_v2), type)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 636 | } |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 637 | static inline void set_le_ih_k_type(struct item_head *ih, int type) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 638 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 639 | set_le_key_k_type(ih_version(ih), &(ih->ih_key), type); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 640 | } |
| 641 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 642 | #define is_direntry_le_key(version,key) (le_key_k_type (version, key) == TYPE_DIRENTRY) |
| 643 | #define is_direct_le_key(version,key) (le_key_k_type (version, key) == TYPE_DIRECT) |
| 644 | #define is_indirect_le_key(version,key) (le_key_k_type (version, key) == TYPE_INDIRECT) |
| 645 | #define is_statdata_le_key(version,key) (le_key_k_type (version, key) == TYPE_STAT_DATA) |
| 646 | |
| 647 | // |
| 648 | // item header has version. |
| 649 | // |
| 650 | #define is_direntry_le_ih(ih) is_direntry_le_key (ih_version (ih), &((ih)->ih_key)) |
| 651 | #define is_direct_le_ih(ih) is_direct_le_key (ih_version (ih), &((ih)->ih_key)) |
| 652 | #define is_indirect_le_ih(ih) is_indirect_le_key (ih_version(ih), &((ih)->ih_key)) |
| 653 | #define is_statdata_le_ih(ih) is_statdata_le_key (ih_version (ih), &((ih)->ih_key)) |
| 654 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 655 | // |
| 656 | // key is pointer to cpu key, result is cpu |
| 657 | // |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 658 | static inline loff_t cpu_key_k_offset(const struct cpu_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 659 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 660 | return key->on_disk_key.k_offset; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 661 | } |
| 662 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 663 | static inline loff_t cpu_key_k_type(const struct cpu_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 664 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 665 | return key->on_disk_key.k_type; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 666 | } |
| 667 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 668 | static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 669 | { |
Al Viro | 6b9f582 | 2005-05-01 08:59:19 -0700 | [diff] [blame] | 670 | key->on_disk_key.k_offset = offset; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 671 | } |
| 672 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 673 | static inline void set_cpu_key_k_type(struct cpu_key *key, int type) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 674 | { |
Al Viro | 6b9f582 | 2005-05-01 08:59:19 -0700 | [diff] [blame] | 675 | key->on_disk_key.k_type = type; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 676 | } |
| 677 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 678 | static inline void cpu_key_k_offset_dec(struct cpu_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 679 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 680 | key->on_disk_key.k_offset--; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 681 | } |
| 682 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 683 | #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY) |
| 684 | #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT) |
| 685 | #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT) |
| 686 | #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA) |
| 687 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 688 | /* are these used ? */ |
| 689 | #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key))) |
| 690 | #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key))) |
| 691 | #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key))) |
| 692 | #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key))) |
| 693 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 694 | #define I_K_KEY_IN_ITEM(p_s_ih, p_s_key, n_blocksize) \ |
| 695 | ( ! COMP_SHORT_KEYS(p_s_ih, p_s_key) && \ |
| 696 | I_OFF_BYTE_IN_ITEM(p_s_ih, k_offset (p_s_key), n_blocksize) ) |
| 697 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 698 | /* maximal length of item */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 699 | #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE) |
| 700 | #define MIN_ITEM_LEN 1 |
| 701 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 702 | /* object identifier for root dir */ |
| 703 | #define REISERFS_ROOT_OBJECTID 2 |
| 704 | #define REISERFS_ROOT_PARENT_OBJECTID 1 |
| 705 | extern struct reiserfs_key root_key; |
| 706 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 707 | /* |
| 708 | * Picture represents a leaf of the S+tree |
| 709 | * ______________________________________________________ |
| 710 | * | | Array of | | | |
| 711 | * |Block | Object-Item | F r e e | Objects- | |
| 712 | * | head | Headers | S p a c e | Items | |
| 713 | * |______|_______________|___________________|___________| |
| 714 | */ |
| 715 | |
| 716 | /* Header of a disk block. More precisely, header of a formatted leaf |
| 717 | or internal node, and not the header of an unformatted node. */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 718 | struct block_head { |
| 719 | __le16 blk_level; /* Level of a block in the tree. */ |
| 720 | __le16 blk_nr_item; /* Number of keys/items in a block. */ |
| 721 | __le16 blk_free_space; /* Block free space in bytes. */ |
| 722 | __le16 blk_reserved; |
| 723 | /* dump this in v4/planA */ |
| 724 | struct reiserfs_key blk_right_delim_key; /* kept only for compatibility */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 725 | }; |
| 726 | |
| 727 | #define BLKH_SIZE (sizeof(struct block_head)) |
| 728 | #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level)) |
| 729 | #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item)) |
| 730 | #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space)) |
| 731 | #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved)) |
| 732 | #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val)) |
| 733 | #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val)) |
| 734 | #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val)) |
| 735 | #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val)) |
| 736 | #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key) |
| 737 | #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val) |
| 738 | |
| 739 | /* |
| 740 | * values for blk_level field of the struct block_head |
| 741 | */ |
| 742 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 743 | #define FREE_LEVEL 0 /* when node gets removed from the tree its |
| 744 | blk_level is set to FREE_LEVEL. It is then |
| 745 | used to see whether the node is still in the |
| 746 | tree */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 747 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 748 | #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 749 | |
| 750 | /* Given the buffer head of a formatted node, resolve to the block head of that node. */ |
| 751 | #define B_BLK_HEAD(p_s_bh) ((struct block_head *)((p_s_bh)->b_data)) |
| 752 | /* Number of items that are in buffer. */ |
| 753 | #define B_NR_ITEMS(p_s_bh) (blkh_nr_item(B_BLK_HEAD(p_s_bh))) |
| 754 | #define B_LEVEL(p_s_bh) (blkh_level(B_BLK_HEAD(p_s_bh))) |
| 755 | #define B_FREE_SPACE(p_s_bh) (blkh_free_space(B_BLK_HEAD(p_s_bh))) |
| 756 | |
| 757 | #define PUT_B_NR_ITEMS(p_s_bh,val) do { set_blkh_nr_item(B_BLK_HEAD(p_s_bh),val); } while (0) |
| 758 | #define PUT_B_LEVEL(p_s_bh,val) do { set_blkh_level(B_BLK_HEAD(p_s_bh),val); } while (0) |
| 759 | #define PUT_B_FREE_SPACE(p_s_bh,val) do { set_blkh_free_space(B_BLK_HEAD(p_s_bh),val); } while (0) |
| 760 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 761 | /* Get right delimiting key. -- little endian */ |
Mariusz Kozlowski | 5296c7b | 2006-12-06 20:40:10 -0800 | [diff] [blame] | 762 | #define B_PRIGHT_DELIM_KEY(p_s_bh) (&(blk_right_delim_key(B_BLK_HEAD(p_s_bh)))) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 763 | |
| 764 | /* Does the buffer contain a disk leaf. */ |
| 765 | #define B_IS_ITEMS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) == DISK_LEAF_NODE_LEVEL) |
| 766 | |
| 767 | /* Does the buffer contain a disk internal node */ |
| 768 | #define B_IS_KEYS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) > DISK_LEAF_NODE_LEVEL \ |
| 769 | && B_LEVEL(p_s_bh) <= MAX_HEIGHT) |
| 770 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 771 | /***************************************************************************/ |
| 772 | /* STAT DATA */ |
| 773 | /***************************************************************************/ |
| 774 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 775 | // |
| 776 | // old stat data is 32 bytes long. We are going to distinguish new one by |
| 777 | // different size |
| 778 | // |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 779 | struct stat_data_v1 { |
| 780 | __le16 sd_mode; /* file type, permissions */ |
| 781 | __le16 sd_nlink; /* number of hard links */ |
| 782 | __le16 sd_uid; /* owner */ |
| 783 | __le16 sd_gid; /* group */ |
| 784 | __le32 sd_size; /* file size */ |
| 785 | __le32 sd_atime; /* time of last access */ |
| 786 | __le32 sd_mtime; /* time file was last modified */ |
| 787 | __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */ |
| 788 | union { |
| 789 | __le32 sd_rdev; |
| 790 | __le32 sd_blocks; /* number of blocks file uses */ |
| 791 | } __attribute__ ((__packed__)) u; |
| 792 | __le32 sd_first_direct_byte; /* first byte of file which is stored |
| 793 | in a direct item: except that if it |
| 794 | equals 1 it is a symlink and if it |
| 795 | equals ~(__u32)0 there is no |
| 796 | direct item. The existence of this |
| 797 | field really grates on me. Let's |
| 798 | replace it with a macro based on |
| 799 | sd_size and our tail suppression |
| 800 | policy. Someday. -Hans */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 801 | } __attribute__ ((__packed__)); |
| 802 | |
| 803 | #define SD_V1_SIZE (sizeof(struct stat_data_v1)) |
| 804 | #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5) |
| 805 | #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode)) |
| 806 | #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v)) |
| 807 | #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink)) |
| 808 | #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v)) |
| 809 | #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid)) |
| 810 | #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v)) |
| 811 | #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid)) |
| 812 | #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v)) |
| 813 | #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size)) |
| 814 | #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v)) |
| 815 | #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime)) |
| 816 | #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v)) |
| 817 | #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime)) |
| 818 | #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v)) |
| 819 | #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime)) |
| 820 | #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v)) |
| 821 | #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev)) |
| 822 | #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v)) |
| 823 | #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks)) |
| 824 | #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v)) |
| 825 | #define sd_v1_first_direct_byte(sdp) \ |
| 826 | (le32_to_cpu((sdp)->sd_first_direct_byte)) |
| 827 | #define set_sd_v1_first_direct_byte(sdp,v) \ |
| 828 | ((sdp)->sd_first_direct_byte = cpu_to_le32(v)) |
| 829 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 830 | /* inode flags stored in sd_attrs (nee sd_reserved) */ |
| 831 | |
| 832 | /* we want common flags to have the same values as in ext2, |
| 833 | so chattr(1) will work without problems */ |
David Howells | 3669567 | 2006-08-29 19:06:16 +0100 | [diff] [blame] | 834 | #define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL |
| 835 | #define REISERFS_APPEND_FL FS_APPEND_FL |
| 836 | #define REISERFS_SYNC_FL FS_SYNC_FL |
| 837 | #define REISERFS_NOATIME_FL FS_NOATIME_FL |
| 838 | #define REISERFS_NODUMP_FL FS_NODUMP_FL |
| 839 | #define REISERFS_SECRM_FL FS_SECRM_FL |
| 840 | #define REISERFS_UNRM_FL FS_UNRM_FL |
| 841 | #define REISERFS_COMPR_FL FS_COMPR_FL |
| 842 | #define REISERFS_NOTAIL_FL FS_NOTAIL_FL |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 843 | |
| 844 | /* persistent flags that file inherits from the parent directory */ |
| 845 | #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \ |
| 846 | REISERFS_SYNC_FL | \ |
| 847 | REISERFS_NOATIME_FL | \ |
| 848 | REISERFS_NODUMP_FL | \ |
| 849 | REISERFS_SECRM_FL | \ |
| 850 | REISERFS_COMPR_FL | \ |
| 851 | REISERFS_NOTAIL_FL ) |
| 852 | |
| 853 | /* Stat Data on disk (reiserfs version of UFS disk inode minus the |
| 854 | address blocks) */ |
| 855 | struct stat_data { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 856 | __le16 sd_mode; /* file type, permissions */ |
| 857 | __le16 sd_attrs; /* persistent inode flags */ |
| 858 | __le32 sd_nlink; /* number of hard links */ |
| 859 | __le64 sd_size; /* file size */ |
| 860 | __le32 sd_uid; /* owner */ |
| 861 | __le32 sd_gid; /* group */ |
| 862 | __le32 sd_atime; /* time of last access */ |
| 863 | __le32 sd_mtime; /* time file was last modified */ |
| 864 | __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */ |
| 865 | __le32 sd_blocks; |
| 866 | union { |
| 867 | __le32 sd_rdev; |
| 868 | __le32 sd_generation; |
| 869 | //__le32 sd_first_direct_byte; |
| 870 | /* first byte of file which is stored in a |
| 871 | direct item: except that if it equals 1 |
| 872 | it is a symlink and if it equals |
| 873 | ~(__u32)0 there is no direct item. The |
| 874 | existence of this field really grates |
| 875 | on me. Let's replace it with a macro |
| 876 | based on sd_size and our tail |
| 877 | suppression policy? */ |
| 878 | } __attribute__ ((__packed__)) u; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 879 | } __attribute__ ((__packed__)); |
| 880 | // |
| 881 | // this is 44 bytes long |
| 882 | // |
| 883 | #define SD_SIZE (sizeof(struct stat_data)) |
| 884 | #define SD_V2_SIZE SD_SIZE |
| 885 | #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6) |
| 886 | #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode)) |
| 887 | #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v)) |
| 888 | /* sd_reserved */ |
| 889 | /* set_sd_reserved */ |
| 890 | #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink)) |
| 891 | #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v)) |
| 892 | #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size)) |
| 893 | #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v)) |
| 894 | #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid)) |
| 895 | #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v)) |
| 896 | #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid)) |
| 897 | #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v)) |
| 898 | #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime)) |
| 899 | #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v)) |
| 900 | #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime)) |
| 901 | #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v)) |
| 902 | #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime)) |
| 903 | #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v)) |
| 904 | #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks)) |
| 905 | #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v)) |
| 906 | #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev)) |
| 907 | #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v)) |
| 908 | #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation)) |
| 909 | #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v)) |
| 910 | #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs)) |
| 911 | #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v)) |
| 912 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 913 | /***************************************************************************/ |
| 914 | /* DIRECTORY STRUCTURE */ |
| 915 | /***************************************************************************/ |
| 916 | /* |
| 917 | Picture represents the structure of directory items |
| 918 | ________________________________________________ |
| 919 | | Array of | | | | | | |
| 920 | | directory |N-1| N-2 | .... | 1st |0th| |
| 921 | | entry headers | | | | | | |
| 922 | |_______________|___|_____|________|_______|___| |
| 923 | <---- directory entries ------> |
| 924 | |
| 925 | First directory item has k_offset component 1. We store "." and ".." |
| 926 | in one item, always, we never split "." and ".." into differing |
| 927 | items. This makes, among other things, the code for removing |
| 928 | directories simpler. */ |
| 929 | #define SD_OFFSET 0 |
| 930 | #define SD_UNIQUENESS 0 |
| 931 | #define DOT_OFFSET 1 |
| 932 | #define DOT_DOT_OFFSET 2 |
| 933 | #define DIRENTRY_UNIQUENESS 500 |
| 934 | |
| 935 | /* */ |
| 936 | #define FIRST_ITEM_OFFSET 1 |
| 937 | |
| 938 | /* |
| 939 | Q: How to get key of object pointed to by entry from entry? |
| 940 | |
| 941 | A: Each directory entry has its header. This header has deh_dir_id and deh_objectid fields, those are key |
| 942 | of object, entry points to */ |
| 943 | |
| 944 | /* NOT IMPLEMENTED: |
| 945 | Directory will someday contain stat data of object */ |
| 946 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 947 | struct reiserfs_de_head { |
| 948 | __le32 deh_offset; /* third component of the directory entry key */ |
| 949 | __le32 deh_dir_id; /* objectid of the parent directory of the object, that is referenced |
| 950 | by directory entry */ |
| 951 | __le32 deh_objectid; /* objectid of the object, that is referenced by directory entry */ |
| 952 | __le16 deh_location; /* offset of name in the whole item */ |
| 953 | __le16 deh_state; /* whether 1) entry contains stat data (for future), and 2) whether |
| 954 | entry is hidden (unlinked) */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 955 | } __attribute__ ((__packed__)); |
| 956 | #define DEH_SIZE sizeof(struct reiserfs_de_head) |
| 957 | #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset)) |
| 958 | #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id)) |
| 959 | #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid)) |
| 960 | #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location)) |
| 961 | #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state)) |
| 962 | |
| 963 | #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v))) |
| 964 | #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v))) |
| 965 | #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v))) |
| 966 | #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v))) |
| 967 | #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v))) |
| 968 | |
| 969 | /* empty directory contains two entries "." and ".." and their headers */ |
| 970 | #define EMPTY_DIR_SIZE \ |
| 971 | (DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen (".."))) |
| 972 | |
| 973 | /* old format directories have this size when empty */ |
| 974 | #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3) |
| 975 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 976 | #define DEH_Statdata 0 /* not used now */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 977 | #define DEH_Visible 2 |
| 978 | |
| 979 | /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */ |
| 980 | #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__) |
| 981 | # define ADDR_UNALIGNED_BITS (3) |
| 982 | #endif |
| 983 | |
| 984 | /* These are only used to manipulate deh_state. |
| 985 | * Because of this, we'll use the ext2_ bit routines, |
| 986 | * since they are little endian */ |
| 987 | #ifdef ADDR_UNALIGNED_BITS |
| 988 | |
| 989 | # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1))) |
| 990 | # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3) |
| 991 | |
| 992 | # define set_bit_unaligned(nr, addr) ext2_set_bit((nr) + unaligned_offset(addr), aligned_address(addr)) |
| 993 | # define clear_bit_unaligned(nr, addr) ext2_clear_bit((nr) + unaligned_offset(addr), aligned_address(addr)) |
| 994 | # define test_bit_unaligned(nr, addr) ext2_test_bit((nr) + unaligned_offset(addr), aligned_address(addr)) |
| 995 | |
| 996 | #else |
| 997 | |
| 998 | # define set_bit_unaligned(nr, addr) ext2_set_bit(nr, addr) |
| 999 | # define clear_bit_unaligned(nr, addr) ext2_clear_bit(nr, addr) |
| 1000 | # define test_bit_unaligned(nr, addr) ext2_test_bit(nr, addr) |
| 1001 | |
| 1002 | #endif |
| 1003 | |
| 1004 | #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) |
| 1005 | #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) |
| 1006 | #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state)) |
| 1007 | #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state)) |
| 1008 | |
| 1009 | #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) |
| 1010 | #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state)) |
| 1011 | #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state)) |
| 1012 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1013 | extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid, |
| 1014 | __le32 par_dirid, __le32 par_objid); |
| 1015 | extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid, |
| 1016 | __le32 par_dirid, __le32 par_objid); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1017 | |
| 1018 | /* array of the entry headers */ |
| 1019 | /* get item body */ |
| 1020 | #define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) ) |
| 1021 | #define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih))) |
| 1022 | |
| 1023 | /* length of the directory entry in directory item. This define |
| 1024 | calculates length of i-th directory entry using directory entry |
| 1025 | locations from dir entry head. When it calculates length of 0-th |
| 1026 | directory entry, it uses length of whole item in place of entry |
| 1027 | location of the non-existent following entry in the calculation. |
| 1028 | See picture above.*/ |
| 1029 | /* |
| 1030 | #define I_DEH_N_ENTRY_LENGTH(ih,deh,i) \ |
| 1031 | ((i) ? (deh_location((deh)-1) - deh_location((deh))) : (ih_item_len((ih)) - deh_location((deh)))) |
| 1032 | */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1033 | static inline int entry_length(const struct buffer_head *bh, |
| 1034 | const struct item_head *ih, int pos_in_item) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1035 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1036 | struct reiserfs_de_head *deh; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1037 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1038 | deh = B_I_DEH(bh, ih) + pos_in_item; |
| 1039 | if (pos_in_item) |
| 1040 | return deh_location(deh - 1) - deh_location(deh); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1041 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1042 | return ih_item_len(ih) - deh_location(deh); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1043 | } |
| 1044 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1045 | /* number of entries in the directory item, depends on ENTRY_COUNT being at the start of directory dynamic data. */ |
| 1046 | #define I_ENTRY_COUNT(ih) (ih_entry_count((ih))) |
| 1047 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1048 | /* name by bh, ih and entry_num */ |
| 1049 | #define B_I_E_NAME(bh,ih,entry_num) ((char *)(bh->b_data + ih_location(ih) + deh_location(B_I_DEH(bh,ih)+(entry_num)))) |
| 1050 | |
| 1051 | // two entries per block (at least) |
| 1052 | #define REISERFS_MAX_NAME(block_size) 255 |
| 1053 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1054 | /* this structure is used for operations on directory entries. It is |
| 1055 | not a disk structure. */ |
| 1056 | /* When reiserfs_find_entry or search_by_entry_key find directory |
| 1057 | entry, they return filled reiserfs_dir_entry structure */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1058 | struct reiserfs_dir_entry { |
| 1059 | struct buffer_head *de_bh; |
| 1060 | int de_item_num; |
| 1061 | struct item_head *de_ih; |
| 1062 | int de_entry_num; |
| 1063 | struct reiserfs_de_head *de_deh; |
| 1064 | int de_entrylen; |
| 1065 | int de_namelen; |
| 1066 | char *de_name; |
Jeff Mahoney | 3af1efe | 2006-03-02 13:25:26 -0500 | [diff] [blame] | 1067 | unsigned long *de_gen_number_bit_string; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1068 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1069 | __u32 de_dir_id; |
| 1070 | __u32 de_objectid; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1071 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1072 | struct cpu_key de_entry_key; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1073 | }; |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1074 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1075 | /* these defines are useful when a particular member of a reiserfs_dir_entry is needed */ |
| 1076 | |
| 1077 | /* pointer to file name, stored in entry */ |
| 1078 | #define B_I_DEH_ENTRY_FILE_NAME(bh,ih,deh) (B_I_PITEM (bh, ih) + deh_location(deh)) |
| 1079 | |
| 1080 | /* length of name */ |
| 1081 | #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \ |
| 1082 | (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0)) |
| 1083 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1084 | /* hash value occupies bits from 7 up to 30 */ |
| 1085 | #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL) |
| 1086 | /* generation number occupies 7 bits starting from 0 up to 6 */ |
| 1087 | #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL) |
| 1088 | #define MAX_GENERATION_NUMBER 127 |
| 1089 | |
| 1090 | #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number)) |
| 1091 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1092 | /* |
| 1093 | * Picture represents an internal node of the reiserfs tree |
| 1094 | * ______________________________________________________ |
| 1095 | * | | Array of | Array of | Free | |
| 1096 | * |block | keys | pointers | space | |
| 1097 | * | head | N | N+1 | | |
| 1098 | * |______|_______________|___________________|___________| |
| 1099 | */ |
| 1100 | |
| 1101 | /***************************************************************************/ |
| 1102 | /* DISK CHILD */ |
| 1103 | /***************************************************************************/ |
| 1104 | /* Disk child pointer: The pointer from an internal node of the tree |
| 1105 | to a node that is on disk. */ |
| 1106 | struct disk_child { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1107 | __le32 dc_block_number; /* Disk child's block number. */ |
| 1108 | __le16 dc_size; /* Disk child's used space. */ |
| 1109 | __le16 dc_reserved; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1110 | }; |
| 1111 | |
| 1112 | #define DC_SIZE (sizeof(struct disk_child)) |
| 1113 | #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number)) |
| 1114 | #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size)) |
| 1115 | #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0) |
| 1116 | #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0) |
| 1117 | |
| 1118 | /* Get disk child by buffer header and position in the tree node. */ |
| 1119 | #define B_N_CHILD(p_s_bh,n_pos) ((struct disk_child *)\ |
| 1120 | ((p_s_bh)->b_data+BLKH_SIZE+B_NR_ITEMS(p_s_bh)*KEY_SIZE+DC_SIZE*(n_pos))) |
| 1121 | |
| 1122 | /* Get disk child number by buffer header and position in the tree node. */ |
| 1123 | #define B_N_CHILD_NUM(p_s_bh,n_pos) (dc_block_number(B_N_CHILD(p_s_bh,n_pos))) |
| 1124 | #define PUT_B_N_CHILD_NUM(p_s_bh,n_pos, val) (put_dc_block_number(B_N_CHILD(p_s_bh,n_pos), val )) |
| 1125 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1126 | /* maximal value of field child_size in structure disk_child */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1127 | /* child size is the combined size of all items and their headers */ |
| 1128 | #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE )) |
| 1129 | |
| 1130 | /* amount of used space in buffer (not including block head) */ |
| 1131 | #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur))) |
| 1132 | |
| 1133 | /* max and min number of keys in internal node */ |
| 1134 | #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) ) |
| 1135 | #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2) |
| 1136 | |
| 1137 | /***************************************************************************/ |
| 1138 | /* PATH STRUCTURES AND DEFINES */ |
| 1139 | /***************************************************************************/ |
| 1140 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1141 | /* Search_by_key fills up the path from the root to the leaf as it descends the tree looking for the |
| 1142 | key. It uses reiserfs_bread to try to find buffers in the cache given their block number. If it |
| 1143 | does not find them in the cache it reads them from disk. For each node search_by_key finds using |
| 1144 | reiserfs_bread it then uses bin_search to look through that node. bin_search will find the |
| 1145 | position of the block_number of the next node if it is looking through an internal node. If it |
| 1146 | is looking through a leaf node bin_search will find the position of the item which has key either |
| 1147 | equal to given key, or which is the maximal key less than the given key. */ |
| 1148 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1149 | struct path_element { |
| 1150 | struct buffer_head *pe_buffer; /* Pointer to the buffer at the path in the tree. */ |
| 1151 | int pe_position; /* Position in the tree node which is placed in the */ |
| 1152 | /* buffer above. */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1153 | }; |
| 1154 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1155 | #define MAX_HEIGHT 5 /* maximal height of a tree. don't change this without changing JOURNAL_PER_BALANCE_CNT */ |
| 1156 | #define EXTENDED_MAX_HEIGHT 7 /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */ |
| 1157 | #define FIRST_PATH_ELEMENT_OFFSET 2 /* Must be equal to at least 2. */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1158 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1159 | #define ILLEGAL_PATH_ELEMENT_OFFSET 1 /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */ |
| 1160 | #define MAX_FEB_SIZE 6 /* this MUST be MAX_HEIGHT + 1. See about FEB below */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1161 | |
| 1162 | /* We need to keep track of who the ancestors of nodes are. When we |
| 1163 | perform a search we record which nodes were visited while |
| 1164 | descending the tree looking for the node we searched for. This list |
| 1165 | of nodes is called the path. This information is used while |
| 1166 | performing balancing. Note that this path information may become |
| 1167 | invalid, and this means we must check it when using it to see if it |
| 1168 | is still valid. You'll need to read search_by_key and the comments |
| 1169 | in it, especially about decrement_counters_in_path(), to understand |
| 1170 | this structure. |
| 1171 | |
| 1172 | Paths make the code so much harder to work with and debug.... An |
| 1173 | enormous number of bugs are due to them, and trying to write or modify |
| 1174 | code that uses them just makes my head hurt. They are based on an |
| 1175 | excessive effort to avoid disturbing the precious VFS code.:-( The |
| 1176 | gods only know how we are going to SMP the code that uses them. |
| 1177 | znodes are the way! */ |
| 1178 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1179 | #define PATH_READA 0x1 /* do read ahead */ |
| 1180 | #define PATH_READA_BACK 0x2 /* read backwards */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1181 | |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1182 | struct treepath { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1183 | int path_length; /* Length of the array above. */ |
| 1184 | int reada; |
| 1185 | struct path_element path_elements[EXTENDED_MAX_HEIGHT]; /* Array of the path elements. */ |
| 1186 | int pos_in_item; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1187 | }; |
| 1188 | |
| 1189 | #define pos_in_item(path) ((path)->pos_in_item) |
| 1190 | |
| 1191 | #define INITIALIZE_PATH(var) \ |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1192 | struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,} |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1193 | |
| 1194 | /* Get path element by path and path position. */ |
| 1195 | #define PATH_OFFSET_PELEMENT(p_s_path,n_offset) ((p_s_path)->path_elements +(n_offset)) |
| 1196 | |
| 1197 | /* Get buffer header at the path by path and path position. */ |
| 1198 | #define PATH_OFFSET_PBUFFER(p_s_path,n_offset) (PATH_OFFSET_PELEMENT(p_s_path,n_offset)->pe_buffer) |
| 1199 | |
| 1200 | /* Get position in the element at the path by path and path position. */ |
| 1201 | #define PATH_OFFSET_POSITION(p_s_path,n_offset) (PATH_OFFSET_PELEMENT(p_s_path,n_offset)->pe_position) |
| 1202 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1203 | #define PATH_PLAST_BUFFER(p_s_path) (PATH_OFFSET_PBUFFER((p_s_path), (p_s_path)->path_length)) |
| 1204 | /* you know, to the person who didn't |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1205 | write this the macro name does not |
| 1206 | at first suggest what it does. |
| 1207 | Maybe POSITION_FROM_PATH_END? Or |
| 1208 | maybe we should just focus on |
| 1209 | dumping paths... -Hans */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1210 | #define PATH_LAST_POSITION(p_s_path) (PATH_OFFSET_POSITION((p_s_path), (p_s_path)->path_length)) |
| 1211 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1212 | #define PATH_PITEM_HEAD(p_s_path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(p_s_path),PATH_LAST_POSITION(p_s_path)) |
| 1213 | |
| 1214 | /* in do_balance leaf has h == 0 in contrast with path structure, |
| 1215 | where root has level == 0. That is why we need these defines */ |
| 1216 | #define PATH_H_PBUFFER(p_s_path, h) PATH_OFFSET_PBUFFER (p_s_path, p_s_path->path_length - (h)) /* tb->S[h] */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1217 | #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1) /* tb->F[h] or tb->S[0]->b_parent */ |
| 1218 | #define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h)) |
| 1219 | #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1) /* tb->S[h]->b_item_order */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1220 | |
| 1221 | #define PATH_H_PATH_OFFSET(p_s_path, n_h) ((p_s_path)->path_length - (n_h)) |
| 1222 | |
| 1223 | #define get_last_bh(path) PATH_PLAST_BUFFER(path) |
| 1224 | #define get_ih(path) PATH_PITEM_HEAD(path) |
| 1225 | #define get_item_pos(path) PATH_LAST_POSITION(path) |
| 1226 | #define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path))) |
| 1227 | #define item_moved(ih,path) comp_items(ih, path) |
| 1228 | #define path_changed(ih,path) comp_items (ih, path) |
| 1229 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1230 | /***************************************************************************/ |
| 1231 | /* MISC */ |
| 1232 | /***************************************************************************/ |
| 1233 | |
| 1234 | /* Size of pointer to the unformatted node. */ |
| 1235 | #define UNFM_P_SIZE (sizeof(unp_t)) |
| 1236 | #define UNFM_P_SHIFT 2 |
| 1237 | |
| 1238 | // in in-core inode key is stored on le form |
| 1239 | #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key)) |
| 1240 | |
| 1241 | #define MAX_UL_INT 0xffffffff |
| 1242 | #define MAX_INT 0x7ffffff |
| 1243 | #define MAX_US_INT 0xffff |
| 1244 | |
| 1245 | // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset |
| 1246 | #define U32_MAX (~(__u32)0) |
| 1247 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1248 | static inline loff_t max_reiserfs_offset(struct inode *inode) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1249 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1250 | if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5) |
| 1251 | return (loff_t) U32_MAX; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1252 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1253 | return (loff_t) ((~(__u64) 0) >> 4); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1254 | } |
| 1255 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1256 | /*#define MAX_KEY_UNIQUENESS MAX_UL_INT*/ |
| 1257 | #define MAX_KEY_OBJECTID MAX_UL_INT |
| 1258 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1259 | #define MAX_B_NUM MAX_UL_INT |
| 1260 | #define MAX_FC_NUM MAX_US_INT |
| 1261 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1262 | /* the purpose is to detect overflow of an unsigned short */ |
| 1263 | #define REISERFS_LINK_MAX (MAX_US_INT - 1000) |
| 1264 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1265 | /* The following defines are used in reiserfs_insert_item and reiserfs_append_item */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1266 | #define REISERFS_KERNEL_MEM 0 /* reiserfs kernel memory mode */ |
| 1267 | #define REISERFS_USER_MEM 1 /* reiserfs user memory mode */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1268 | |
| 1269 | #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter) |
| 1270 | #define get_generation(s) atomic_read (&fs_generation(s)) |
| 1271 | #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen) |
| 1272 | #define __fs_changed(gen,s) (gen != get_generation (s)) |
| 1273 | #define fs_changed(gen,s) ({cond_resched(); __fs_changed(gen, s);}) |
| 1274 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1275 | /***************************************************************************/ |
| 1276 | /* FIXATE NODES */ |
| 1277 | /***************************************************************************/ |
| 1278 | |
| 1279 | #define VI_TYPE_LEFT_MERGEABLE 1 |
| 1280 | #define VI_TYPE_RIGHT_MERGEABLE 2 |
| 1281 | |
| 1282 | /* To make any changes in the tree we always first find node, that |
| 1283 | contains item to be changed/deleted or place to insert a new |
| 1284 | item. We call this node S. To do balancing we need to decide what |
| 1285 | we will shift to left/right neighbor, or to a new node, where new |
| 1286 | item will be etc. To make this analysis simpler we build virtual |
| 1287 | node. Virtual node is an array of items, that will replace items of |
| 1288 | node S. (For instance if we are going to delete an item, virtual |
| 1289 | node does not contain it). Virtual node keeps information about |
| 1290 | item sizes and types, mergeability of first and last items, sizes |
| 1291 | of all entries in directory item. We use this array of items when |
| 1292 | calculating what we can shift to neighbors and how many nodes we |
| 1293 | have to have if we do not any shiftings, if we shift to left/right |
| 1294 | neighbor or to both. */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1295 | struct virtual_item { |
| 1296 | int vi_index; // index in the array of item operations |
| 1297 | unsigned short vi_type; // left/right mergeability |
| 1298 | unsigned short vi_item_len; /* length of item that it will have after balancing */ |
| 1299 | struct item_head *vi_ih; |
| 1300 | const char *vi_item; // body of item (old or new) |
| 1301 | const void *vi_new_data; // 0 always but paste mode |
| 1302 | void *vi_uarea; // item specific area |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1303 | }; |
| 1304 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1305 | struct virtual_node { |
| 1306 | char *vn_free_ptr; /* this is a pointer to the free space in the buffer */ |
| 1307 | unsigned short vn_nr_item; /* number of items in virtual node */ |
| 1308 | short vn_size; /* size of node , that node would have if it has unlimited size and no balancing is performed */ |
| 1309 | short vn_mode; /* mode of balancing (paste, insert, delete, cut) */ |
| 1310 | short vn_affected_item_num; |
| 1311 | short vn_pos_in_item; |
| 1312 | struct item_head *vn_ins_ih; /* item header of inserted item, 0 for other modes */ |
| 1313 | const void *vn_data; |
| 1314 | struct virtual_item *vn_vi; /* array of items (including a new one, excluding item to be deleted) */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1315 | }; |
| 1316 | |
| 1317 | /* used by directory items when creating virtual nodes */ |
| 1318 | struct direntry_uarea { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1319 | int flags; |
| 1320 | __u16 entry_count; |
| 1321 | __u16 entry_sizes[1]; |
| 1322 | } __attribute__ ((__packed__)); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1323 | |
| 1324 | /***************************************************************************/ |
| 1325 | /* TREE BALANCE */ |
| 1326 | /***************************************************************************/ |
| 1327 | |
| 1328 | /* This temporary structure is used in tree balance algorithms, and |
| 1329 | constructed as we go to the extent that its various parts are |
| 1330 | needed. It contains arrays of nodes that can potentially be |
| 1331 | involved in the balancing of node S, and parameters that define how |
| 1332 | each of the nodes must be balanced. Note that in these algorithms |
| 1333 | for balancing the worst case is to need to balance the current node |
| 1334 | S and the left and right neighbors and all of their parents plus |
| 1335 | create a new node. We implement S1 balancing for the leaf nodes |
| 1336 | and S0 balancing for the internal nodes (S1 and S0 are defined in |
| 1337 | our papers.)*/ |
| 1338 | |
| 1339 | #define MAX_FREE_BLOCK 7 /* size of the array of buffers to free at end of do_balance */ |
| 1340 | |
| 1341 | /* maximum number of FEB blocknrs on a single level */ |
| 1342 | #define MAX_AMOUNT_NEEDED 2 |
| 1343 | |
| 1344 | /* someday somebody will prefix every field in this struct with tb_ */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1345 | struct tree_balance { |
| 1346 | int tb_mode; |
| 1347 | int need_balance_dirty; |
| 1348 | struct super_block *tb_sb; |
| 1349 | struct reiserfs_transaction_handle *transaction_handle; |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1350 | struct treepath *tb_path; |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1351 | struct buffer_head *L[MAX_HEIGHT]; /* array of left neighbors of nodes in the path */ |
| 1352 | struct buffer_head *R[MAX_HEIGHT]; /* array of right neighbors of nodes in the path */ |
| 1353 | struct buffer_head *FL[MAX_HEIGHT]; /* array of fathers of the left neighbors */ |
| 1354 | struct buffer_head *FR[MAX_HEIGHT]; /* array of fathers of the right neighbors */ |
| 1355 | struct buffer_head *CFL[MAX_HEIGHT]; /* array of common parents of center node and its left neighbor */ |
| 1356 | struct buffer_head *CFR[MAX_HEIGHT]; /* array of common parents of center node and its right neighbor */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1357 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1358 | struct buffer_head *FEB[MAX_FEB_SIZE]; /* array of empty buffers. Number of buffers in array equals |
| 1359 | cur_blknum. */ |
| 1360 | struct buffer_head *used[MAX_FEB_SIZE]; |
| 1361 | struct buffer_head *thrown[MAX_FEB_SIZE]; |
| 1362 | int lnum[MAX_HEIGHT]; /* array of number of items which must be |
| 1363 | shifted to the left in order to balance the |
| 1364 | current node; for leaves includes item that |
| 1365 | will be partially shifted; for internal |
| 1366 | nodes, it is the number of child pointers |
| 1367 | rather than items. It includes the new item |
| 1368 | being created. The code sometimes subtracts |
| 1369 | one to get the number of wholly shifted |
| 1370 | items for other purposes. */ |
| 1371 | int rnum[MAX_HEIGHT]; /* substitute right for left in comment above */ |
| 1372 | int lkey[MAX_HEIGHT]; /* array indexed by height h mapping the key delimiting L[h] and |
| 1373 | S[h] to its item number within the node CFL[h] */ |
| 1374 | int rkey[MAX_HEIGHT]; /* substitute r for l in comment above */ |
| 1375 | int insert_size[MAX_HEIGHT]; /* the number of bytes by we are trying to add or remove from |
| 1376 | S[h]. A negative value means removing. */ |
| 1377 | int blknum[MAX_HEIGHT]; /* number of nodes that will replace node S[h] after |
| 1378 | balancing on the level h of the tree. If 0 then S is |
| 1379 | being deleted, if 1 then S is remaining and no new nodes |
| 1380 | are being created, if 2 or 3 then 1 or 2 new nodes is |
| 1381 | being created */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1382 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1383 | /* fields that are used only for balancing leaves of the tree */ |
| 1384 | int cur_blknum; /* number of empty blocks having been already allocated */ |
| 1385 | int s0num; /* number of items that fall into left most node when S[0] splits */ |
| 1386 | int s1num; /* number of items that fall into first new node when S[0] splits */ |
| 1387 | int s2num; /* number of items that fall into second new node when S[0] splits */ |
| 1388 | int lbytes; /* number of bytes which can flow to the left neighbor from the left */ |
| 1389 | /* most liquid item that cannot be shifted from S[0] entirely */ |
| 1390 | /* if -1 then nothing will be partially shifted */ |
| 1391 | int rbytes; /* number of bytes which will flow to the right neighbor from the right */ |
| 1392 | /* most liquid item that cannot be shifted from S[0] entirely */ |
| 1393 | /* if -1 then nothing will be partially shifted */ |
| 1394 | int s1bytes; /* number of bytes which flow to the first new node when S[0] splits */ |
| 1395 | /* note: if S[0] splits into 3 nodes, then items do not need to be cut */ |
| 1396 | int s2bytes; |
| 1397 | struct buffer_head *buf_to_free[MAX_FREE_BLOCK]; /* buffers which are to be freed after do_balance finishes by unfix_nodes */ |
| 1398 | char *vn_buf; /* kmalloced memory. Used to create |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1399 | virtual node and keep map of |
| 1400 | dirtied bitmap blocks */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1401 | int vn_buf_size; /* size of the vn_buf */ |
| 1402 | struct virtual_node *tb_vn; /* VN starts after bitmap of bitmap blocks */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1403 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1404 | int fs_gen; /* saved value of `reiserfs_generation' counter |
| 1405 | see FILESYSTEM_CHANGED() macro in reiserfs_fs.h */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1406 | #ifdef DISPLACE_NEW_PACKING_LOCALITIES |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1407 | struct in_core_key key; /* key pointer, to pass to block allocator or |
| 1408 | another low-level subsystem */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1409 | #endif |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1410 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1411 | |
| 1412 | /* These are modes of balancing */ |
| 1413 | |
| 1414 | /* When inserting an item. */ |
| 1415 | #define M_INSERT 'i' |
| 1416 | /* When inserting into (directories only) or appending onto an already |
| 1417 | existant item. */ |
| 1418 | #define M_PASTE 'p' |
| 1419 | /* When deleting an item. */ |
| 1420 | #define M_DELETE 'd' |
| 1421 | /* When truncating an item or removing an entry from a (directory) item. */ |
| 1422 | #define M_CUT 'c' |
| 1423 | |
| 1424 | /* used when balancing on leaf level skipped (in reiserfsck) */ |
| 1425 | #define M_INTERNAL 'n' |
| 1426 | |
| 1427 | /* When further balancing is not needed, then do_balance does not need |
| 1428 | to be called. */ |
| 1429 | #define M_SKIP_BALANCING 's' |
| 1430 | #define M_CONVERT 'v' |
| 1431 | |
| 1432 | /* modes of leaf_move_items */ |
| 1433 | #define LEAF_FROM_S_TO_L 0 |
| 1434 | #define LEAF_FROM_S_TO_R 1 |
| 1435 | #define LEAF_FROM_R_TO_L 2 |
| 1436 | #define LEAF_FROM_L_TO_R 3 |
| 1437 | #define LEAF_FROM_S_TO_SNEW 4 |
| 1438 | |
| 1439 | #define FIRST_TO_LAST 0 |
| 1440 | #define LAST_TO_FIRST 1 |
| 1441 | |
| 1442 | /* used in do_balance for passing parent of node information that has |
| 1443 | been gotten from tb struct */ |
| 1444 | struct buffer_info { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1445 | struct tree_balance *tb; |
| 1446 | struct buffer_head *bi_bh; |
| 1447 | struct buffer_head *bi_parent; |
| 1448 | int bi_position; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1449 | }; |
| 1450 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1451 | /* there are 4 types of items: stat data, directory item, indirect, direct. |
| 1452 | +-------------------+------------+--------------+------------+ |
| 1453 | | | k_offset | k_uniqueness | mergeable? | |
| 1454 | +-------------------+------------+--------------+------------+ |
| 1455 | | stat data | 0 | 0 | no | |
| 1456 | +-------------------+------------+--------------+------------+ |
| 1457 | | 1st directory item| DOT_OFFSET |DIRENTRY_UNIQUENESS| no | |
| 1458 | | non 1st directory | hash value | | yes | |
| 1459 | | item | | | | |
| 1460 | +-------------------+------------+--------------+------------+ |
| 1461 | | indirect item | offset + 1 |TYPE_INDIRECT | if this is not the first indirect item of the object |
| 1462 | +-------------------+------------+--------------+------------+ |
| 1463 | | direct item | offset + 1 |TYPE_DIRECT | if not this is not the first direct item of the object |
| 1464 | +-------------------+------------+--------------+------------+ |
| 1465 | */ |
| 1466 | |
| 1467 | struct item_operations { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1468 | int (*bytes_number) (struct item_head * ih, int block_size); |
| 1469 | void (*decrement_key) (struct cpu_key *); |
| 1470 | int (*is_left_mergeable) (struct reiserfs_key * ih, |
| 1471 | unsigned long bsize); |
| 1472 | void (*print_item) (struct item_head *, char *item); |
| 1473 | void (*check_item) (struct item_head *, char *item); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1474 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1475 | int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi, |
| 1476 | int is_affected, int insert_size); |
| 1477 | int (*check_left) (struct virtual_item * vi, int free, |
| 1478 | int start_skip, int end_skip); |
| 1479 | int (*check_right) (struct virtual_item * vi, int free); |
| 1480 | int (*part_size) (struct virtual_item * vi, int from, int to); |
| 1481 | int (*unit_num) (struct virtual_item * vi); |
| 1482 | void (*print_vi) (struct virtual_item * vi); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1483 | }; |
| 1484 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1485 | extern struct item_operations *item_ops[TYPE_ANY + 1]; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1486 | |
| 1487 | #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize) |
| 1488 | #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize) |
| 1489 | #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item) |
| 1490 | #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item) |
| 1491 | #define op_create_vi(vn,vi,is_affected,insert_size) item_ops[le_ih_k_type ((vi)->vi_ih)]->create_vi (vn,vi,is_affected,insert_size) |
| 1492 | #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip) |
| 1493 | #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free) |
| 1494 | #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to) |
| 1495 | #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi) |
| 1496 | #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi) |
| 1497 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1498 | #define COMP_SHORT_KEYS comp_short_keys |
| 1499 | |
| 1500 | /* number of blocks pointed to by the indirect item */ |
| 1501 | #define I_UNFM_NUM(p_s_ih) ( ih_item_len(p_s_ih) / UNFM_P_SIZE ) |
| 1502 | |
| 1503 | /* the used space within the unformatted node corresponding to pos within the item pointed to by ih */ |
| 1504 | #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size)) |
| 1505 | |
| 1506 | /* number of bytes contained by the direct item or the unformatted nodes the indirect item points to */ |
| 1507 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1508 | /* get the item header */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1509 | #define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) ) |
| 1510 | |
| 1511 | /* get key */ |
| 1512 | #define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) ) |
| 1513 | |
| 1514 | /* get the key */ |
| 1515 | #define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) ) |
| 1516 | |
| 1517 | /* get item body */ |
| 1518 | #define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num)))) |
| 1519 | |
| 1520 | /* get the stat data by the buffer header and the item order */ |
| 1521 | #define B_N_STAT_DATA(bh,nr) \ |
| 1522 | ( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) ) |
| 1523 | |
| 1524 | /* following defines use reiserfs buffer header and item header */ |
| 1525 | |
| 1526 | /* get stat-data */ |
| 1527 | #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) ) |
| 1528 | |
| 1529 | // this is 3976 for size==4096 |
| 1530 | #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE) |
| 1531 | |
| 1532 | /* indirect items consist of entries which contain blocknrs, pos |
| 1533 | indicates which entry, and B_I_POS_UNFM_POINTER resolves to the |
| 1534 | blocknr contained by the entry pos points to */ |
| 1535 | #define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos))) |
| 1536 | #define PUT_B_I_POS_UNFM_POINTER(bh,ih,pos, val) do {*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)) = cpu_to_le32(val); } while (0) |
| 1537 | |
| 1538 | struct reiserfs_iget_args { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1539 | __u32 objectid; |
| 1540 | __u32 dirid; |
| 1541 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1542 | |
| 1543 | /***************************************************************************/ |
| 1544 | /* FUNCTION DECLARATIONS */ |
| 1545 | /***************************************************************************/ |
| 1546 | |
| 1547 | /*#ifdef __KERNEL__*/ |
| 1548 | #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12) |
| 1549 | |
| 1550 | #define journal_trans_half(blocksize) \ |
| 1551 | ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32)) |
| 1552 | |
| 1553 | /* journal.c see journal.c for all the comments here */ |
| 1554 | |
| 1555 | /* first block written in a commit. */ |
| 1556 | struct reiserfs_journal_desc { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1557 | __le32 j_trans_id; /* id of commit */ |
| 1558 | __le32 j_len; /* length of commit. len +1 is the commit block */ |
| 1559 | __le32 j_mount_id; /* mount id of this trans */ |
| 1560 | __le32 j_realblock[1]; /* real locations for each block */ |
| 1561 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1562 | |
| 1563 | #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id) |
| 1564 | #define get_desc_trans_len(d) le32_to_cpu((d)->j_len) |
| 1565 | #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id) |
| 1566 | |
| 1567 | #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0) |
| 1568 | #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0) |
| 1569 | #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0) |
| 1570 | |
| 1571 | /* last block written in a commit */ |
| 1572 | struct reiserfs_journal_commit { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1573 | __le32 j_trans_id; /* must match j_trans_id from the desc block */ |
| 1574 | __le32 j_len; /* ditto */ |
| 1575 | __le32 j_realblock[1]; /* real locations for each block */ |
| 1576 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1577 | |
| 1578 | #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id) |
| 1579 | #define get_commit_trans_len(c) le32_to_cpu((c)->j_len) |
| 1580 | #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id) |
| 1581 | |
| 1582 | #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0) |
| 1583 | #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0) |
| 1584 | |
| 1585 | /* this header block gets written whenever a transaction is considered fully flushed, and is more recent than the |
| 1586 | ** last fully flushed transaction. fully flushed means all the log blocks and all the real blocks are on disk, |
| 1587 | ** and this transaction does not need to be replayed. |
| 1588 | */ |
| 1589 | struct reiserfs_journal_header { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1590 | __le32 j_last_flush_trans_id; /* id of last fully flushed transaction */ |
| 1591 | __le32 j_first_unflushed_offset; /* offset in the log of where to start replay after a crash */ |
| 1592 | __le32 j_mount_id; |
| 1593 | /* 12 */ struct journal_params jh_journal; |
| 1594 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1595 | |
| 1596 | /* biggest tunable defines are right here */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1597 | #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */ |
| 1598 | #define JOURNAL_TRANS_MAX_DEFAULT 1024 /* biggest possible single transaction, don't change for now (8/3/99) */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1599 | #define JOURNAL_TRANS_MIN_DEFAULT 256 |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1600 | #define JOURNAL_MAX_BATCH_DEFAULT 900 /* max blocks to batch into one transaction, don't make this any bigger than 900 */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1601 | #define JOURNAL_MIN_RATIO 2 |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1602 | #define JOURNAL_MAX_COMMIT_AGE 30 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1603 | #define JOURNAL_MAX_TRANS_AGE 30 |
| 1604 | #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9) |
| 1605 | #ifdef CONFIG_QUOTA |
Jan Kara | 556a2a4 | 2005-06-23 22:01:06 -0700 | [diff] [blame] | 1606 | /* We need to update data and inode (atime) */ |
| 1607 | #define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? 2 : 0) |
| 1608 | /* 1 balancing, 1 bitmap, 1 data per write + stat data update */ |
| 1609 | #define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \ |
| 1610 | (DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0) |
| 1611 | /* same as with INIT */ |
| 1612 | #define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \ |
| 1613 | (DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1614 | #else |
Jan Kara | 556a2a4 | 2005-06-23 22:01:06 -0700 | [diff] [blame] | 1615 | #define REISERFS_QUOTA_TRANS_BLOCKS(s) 0 |
| 1616 | #define REISERFS_QUOTA_INIT_BLOCKS(s) 0 |
| 1617 | #define REISERFS_QUOTA_DEL_BLOCKS(s) 0 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1618 | #endif |
| 1619 | |
| 1620 | /* both of these can be as low as 1, or as high as you want. The min is the |
| 1621 | ** number of 4k bitmap nodes preallocated on mount. New nodes are allocated |
| 1622 | ** as needed, and released when transactions are committed. On release, if |
| 1623 | ** the current number of nodes is > max, the node is freed, otherwise, |
| 1624 | ** it is put on a free list for faster use later. |
| 1625 | */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1626 | #define REISERFS_MIN_BITMAP_NODES 10 |
| 1627 | #define REISERFS_MAX_BITMAP_NODES 100 |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1628 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1629 | #define JBH_HASH_SHIFT 13 /* these are based on journal hash size of 8192 */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1630 | #define JBH_HASH_MASK 8191 |
| 1631 | |
| 1632 | #define _jhashfn(sb,block) \ |
| 1633 | (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \ |
| 1634 | (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12)))) |
| 1635 | #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK]) |
| 1636 | |
| 1637 | // We need these to make journal.c code more readable |
| 1638 | #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) |
| 1639 | #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) |
| 1640 | #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) |
| 1641 | |
| 1642 | enum reiserfs_bh_state_bits { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1643 | BH_JDirty = BH_PrivateStart, /* buffer is in current transaction */ |
| 1644 | BH_JDirty_wait, |
| 1645 | BH_JNew, /* disk block was taken off free list before |
| 1646 | * being in a finished transaction, or |
| 1647 | * written to disk. Can be reused immed. */ |
| 1648 | BH_JPrepared, |
| 1649 | BH_JRestore_dirty, |
| 1650 | BH_JTest, // debugging only will go away |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1651 | }; |
| 1652 | |
| 1653 | BUFFER_FNS(JDirty, journaled); |
| 1654 | TAS_BUFFER_FNS(JDirty, journaled); |
| 1655 | BUFFER_FNS(JDirty_wait, journal_dirty); |
| 1656 | TAS_BUFFER_FNS(JDirty_wait, journal_dirty); |
| 1657 | BUFFER_FNS(JNew, journal_new); |
| 1658 | TAS_BUFFER_FNS(JNew, journal_new); |
| 1659 | BUFFER_FNS(JPrepared, journal_prepared); |
| 1660 | TAS_BUFFER_FNS(JPrepared, journal_prepared); |
| 1661 | BUFFER_FNS(JRestore_dirty, journal_restore_dirty); |
| 1662 | TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty); |
| 1663 | BUFFER_FNS(JTest, journal_test); |
| 1664 | TAS_BUFFER_FNS(JTest, journal_test); |
| 1665 | |
| 1666 | /* |
| 1667 | ** transaction handle which is passed around for all journal calls |
| 1668 | */ |
| 1669 | struct reiserfs_transaction_handle { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1670 | struct super_block *t_super; /* super for this FS when journal_begin was |
| 1671 | called. saves calls to reiserfs_get_super |
| 1672 | also used by nested transactions to make |
| 1673 | sure they are nesting on the right FS |
| 1674 | _must_ be first in the handle |
| 1675 | */ |
| 1676 | int t_refcount; |
| 1677 | int t_blocks_logged; /* number of blocks this writer has logged */ |
| 1678 | int t_blocks_allocated; /* number of blocks this writer allocated */ |
Jeff Mahoney | 600ed41 | 2009-03-30 14:02:17 -0400 | [diff] [blame] | 1679 | unsigned int t_trans_id; /* sanity check, equals the current trans id */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1680 | void *t_handle_save; /* save existing current->journal_info */ |
| 1681 | unsigned displace_new_blocks:1; /* if new block allocation occurres, that block |
| 1682 | should be displaced from others */ |
| 1683 | struct list_head t_list; |
| 1684 | }; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1685 | |
| 1686 | /* used to keep track of ordered and tail writes, attached to the buffer |
| 1687 | * head through b_journal_head. |
| 1688 | */ |
| 1689 | struct reiserfs_jh { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1690 | struct reiserfs_journal_list *jl; |
| 1691 | struct buffer_head *bh; |
| 1692 | struct list_head list; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1693 | }; |
| 1694 | |
| 1695 | void reiserfs_free_jh(struct buffer_head *bh); |
| 1696 | int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh); |
| 1697 | int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1698 | int journal_mark_dirty(struct reiserfs_transaction_handle *, |
| 1699 | struct super_block *, struct buffer_head *bh); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1700 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1701 | static inline int reiserfs_file_data_log(struct inode *inode) |
| 1702 | { |
| 1703 | if (reiserfs_data_log(inode->i_sb) || |
| 1704 | (REISERFS_I(inode)->i_flags & i_data_log)) |
| 1705 | return 1; |
| 1706 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1707 | } |
| 1708 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1709 | static inline int reiserfs_transaction_running(struct super_block *s) |
| 1710 | { |
| 1711 | struct reiserfs_transaction_handle *th = current->journal_info; |
| 1712 | if (th && th->t_super == s) |
| 1713 | return 1; |
| 1714 | if (th && th->t_super == NULL) |
| 1715 | BUG(); |
| 1716 | return 0; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1717 | } |
| 1718 | |
Alexander Zarochentzev | 23f9e0f | 2006-03-25 03:06:57 -0800 | [diff] [blame] | 1719 | static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th) |
| 1720 | { |
| 1721 | return th->t_blocks_allocated - th->t_blocks_logged; |
| 1722 | } |
| 1723 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1724 | struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct |
| 1725 | super_block |
| 1726 | *, |
| 1727 | int count); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1728 | int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *); |
| 1729 | int reiserfs_commit_page(struct inode *inode, struct page *page, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1730 | unsigned from, unsigned to); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1731 | int reiserfs_flush_old_commits(struct super_block *); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1732 | int reiserfs_commit_for_inode(struct inode *); |
| 1733 | int reiserfs_inode_needs_commit(struct inode *); |
| 1734 | void reiserfs_update_inode_transaction(struct inode *); |
| 1735 | void reiserfs_wait_on_write_block(struct super_block *s); |
| 1736 | void reiserfs_block_writes(struct reiserfs_transaction_handle *th); |
| 1737 | void reiserfs_allow_writes(struct super_block *s); |
| 1738 | void reiserfs_check_lock_depth(struct super_block *s, char *caller); |
| 1739 | int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh, |
| 1740 | int wait); |
| 1741 | void reiserfs_restore_prepared_buffer(struct super_block *, |
| 1742 | struct buffer_head *bh); |
| 1743 | int journal_init(struct super_block *, const char *j_dev_name, int old_format, |
| 1744 | unsigned int); |
| 1745 | int journal_release(struct reiserfs_transaction_handle *, struct super_block *); |
| 1746 | int journal_release_error(struct reiserfs_transaction_handle *, |
| 1747 | struct super_block *); |
| 1748 | int journal_end(struct reiserfs_transaction_handle *, struct super_block *, |
| 1749 | unsigned long); |
| 1750 | int journal_end_sync(struct reiserfs_transaction_handle *, struct super_block *, |
| 1751 | unsigned long); |
| 1752 | int journal_mark_freed(struct reiserfs_transaction_handle *, |
| 1753 | struct super_block *, b_blocknr_t blocknr); |
| 1754 | int journal_transaction_should_end(struct reiserfs_transaction_handle *, int); |
Jeff Mahoney | 3ee1667 | 2007-10-18 23:39:25 -0700 | [diff] [blame] | 1755 | int reiserfs_in_journal(struct super_block *p_s_sb, unsigned int bmap_nr, |
| 1756 | int bit_nr, int searchall, b_blocknr_t *next); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1757 | int journal_begin(struct reiserfs_transaction_handle *, |
| 1758 | struct super_block *p_s_sb, unsigned long); |
| 1759 | int journal_join_abort(struct reiserfs_transaction_handle *, |
| 1760 | struct super_block *p_s_sb, unsigned long); |
| 1761 | void reiserfs_journal_abort(struct super_block *sb, int errno); |
| 1762 | void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...); |
| 1763 | int reiserfs_allocate_list_bitmaps(struct super_block *s, |
Jeff Mahoney | 3ee1667 | 2007-10-18 23:39:25 -0700 | [diff] [blame] | 1764 | struct reiserfs_list_bitmap *, unsigned int); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1765 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1766 | void add_save_link(struct reiserfs_transaction_handle *th, |
| 1767 | struct inode *inode, int truncate); |
| 1768 | int remove_save_link(struct inode *inode, int truncate); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1769 | |
| 1770 | /* objectid.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1771 | __u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th); |
| 1772 | void reiserfs_release_objectid(struct reiserfs_transaction_handle *th, |
| 1773 | __u32 objectid_to_release); |
| 1774 | int reiserfs_convert_objectid_map_v1(struct super_block *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1775 | |
| 1776 | /* stree.c */ |
| 1777 | int B_IS_IN_TREE(const struct buffer_head *); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1778 | extern void copy_item_head(struct item_head *p_v_to, |
| 1779 | const struct item_head *p_v_from); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1780 | |
| 1781 | // first key is in cpu form, second - le |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1782 | extern int comp_short_keys(const struct reiserfs_key *le_key, |
| 1783 | const struct cpu_key *cpu_key); |
| 1784 | extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1785 | |
| 1786 | // both are in le form |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1787 | extern int comp_le_keys(const struct reiserfs_key *, |
| 1788 | const struct reiserfs_key *); |
| 1789 | extern int comp_short_le_keys(const struct reiserfs_key *, |
| 1790 | const struct reiserfs_key *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1791 | |
| 1792 | // |
| 1793 | // get key version from on disk key - kludge |
| 1794 | // |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1795 | static inline int le_key_version(const struct reiserfs_key *key) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1796 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1797 | int type; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1798 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1799 | type = offset_v2_k_type(&(key->u.k_offset_v2)); |
| 1800 | if (type != TYPE_DIRECT && type != TYPE_INDIRECT |
| 1801 | && type != TYPE_DIRENTRY) |
| 1802 | return KEY_FORMAT_3_5; |
| 1803 | |
| 1804 | return KEY_FORMAT_3_6; |
| 1805 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1806 | } |
| 1807 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1808 | static inline void copy_key(struct reiserfs_key *to, |
| 1809 | const struct reiserfs_key *from) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1810 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1811 | memcpy(to, from, KEY_SIZE); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1812 | } |
| 1813 | |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1814 | int comp_items(const struct item_head *stored_ih, const struct treepath *p_s_path); |
| 1815 | const struct reiserfs_key *get_rkey(const struct treepath *p_s_chk_path, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1816 | const struct super_block *p_s_sb); |
| 1817 | int search_by_key(struct super_block *, const struct cpu_key *, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1818 | struct treepath *, int); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1819 | #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL) |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1820 | int search_for_position_by_key(struct super_block *p_s_sb, |
| 1821 | const struct cpu_key *p_s_cpu_key, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1822 | struct treepath *p_s_search_path); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1823 | extern void decrement_bcount(struct buffer_head *p_s_bh); |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1824 | void decrement_counters_in_path(struct treepath *p_s_search_path); |
| 1825 | void pathrelse(struct treepath *p_s_search_path); |
| 1826 | int reiserfs_check_path(struct treepath *p); |
| 1827 | void pathrelse_and_restore(struct super_block *s, struct treepath *p_s_search_path); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1828 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1829 | int reiserfs_insert_item(struct reiserfs_transaction_handle *th, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1830 | struct treepath *path, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1831 | const struct cpu_key *key, |
| 1832 | struct item_head *ih, |
| 1833 | struct inode *inode, const char *body); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1834 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1835 | int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1836 | struct treepath *path, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1837 | const struct cpu_key *key, |
| 1838 | struct inode *inode, |
| 1839 | const char *body, int paste_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1840 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1841 | int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1842 | struct treepath *path, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1843 | struct cpu_key *key, |
| 1844 | struct inode *inode, |
| 1845 | struct page *page, loff_t new_file_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1846 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1847 | int reiserfs_delete_item(struct reiserfs_transaction_handle *th, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1848 | struct treepath *path, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1849 | const struct cpu_key *key, |
| 1850 | struct inode *inode, struct buffer_head *p_s_un_bh); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1851 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1852 | void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th, |
| 1853 | struct inode *inode, struct reiserfs_key *key); |
| 1854 | int reiserfs_delete_object(struct reiserfs_transaction_handle *th, |
| 1855 | struct inode *p_s_inode); |
| 1856 | int reiserfs_do_truncate(struct reiserfs_transaction_handle *th, |
| 1857 | struct inode *p_s_inode, struct page *, |
| 1858 | int update_timestamps); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1859 | |
| 1860 | #define i_block_size(inode) ((inode)->i_sb->s_blocksize) |
| 1861 | #define file_size(inode) ((inode)->i_size) |
| 1862 | #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1)) |
| 1863 | |
| 1864 | #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\ |
| 1865 | !STORE_TAIL_IN_UNFM_S1(file_size (inode), tail_size(inode), inode->i_sb->s_blocksize):have_small_tails ((inode)->i_sb)?!STORE_TAIL_IN_UNFM_S2(file_size (inode), tail_size(inode), inode->i_sb->s_blocksize):0 ) |
| 1866 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1867 | void padd_item(char *item, int total_length, int length); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1868 | |
| 1869 | /* inode.c */ |
| 1870 | /* args for the create parameter of reiserfs_get_block */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1871 | #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */ |
| 1872 | #define GET_BLOCK_CREATE 1 /* add anything you need to find block */ |
| 1873 | #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */ |
| 1874 | #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */ |
Jes Sorensen | 1b1dcc1 | 2006-01-09 15:59:24 -0800 | [diff] [blame] | 1875 | #define GET_BLOCK_NO_IMUX 8 /* i_mutex is not held, don't preallocate */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1876 | #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1877 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1878 | void reiserfs_read_locked_inode(struct inode *inode, |
| 1879 | struct reiserfs_iget_args *args); |
| 1880 | int reiserfs_find_actor(struct inode *inode, void *p); |
| 1881 | int reiserfs_init_locked_inode(struct inode *inode, void *p); |
| 1882 | void reiserfs_delete_inode(struct inode *inode); |
| 1883 | int reiserfs_write_inode(struct inode *inode, int); |
| 1884 | int reiserfs_get_block(struct inode *inode, sector_t block, |
| 1885 | struct buffer_head *bh_result, int create); |
Christoph Hellwig | be55caf | 2007-10-21 16:42:13 -0700 | [diff] [blame] | 1886 | struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid, |
| 1887 | int fh_len, int fh_type); |
| 1888 | struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid, |
| 1889 | int fh_len, int fh_type); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1890 | int reiserfs_encode_fh(struct dentry *dentry, __u32 * data, int *lenp, |
| 1891 | int connectable); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1892 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1893 | int reiserfs_truncate_file(struct inode *, int update_timestamps); |
| 1894 | void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset, |
| 1895 | int type, int key_length); |
| 1896 | void make_le_item_head(struct item_head *ih, const struct cpu_key *key, |
| 1897 | int version, |
| 1898 | loff_t offset, int type, int length, int entry_count); |
| 1899 | struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1900 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1901 | int reiserfs_new_inode(struct reiserfs_transaction_handle *th, |
| 1902 | struct inode *dir, int mode, |
| 1903 | const char *symname, loff_t i_size, |
| 1904 | struct dentry *dentry, struct inode *inode); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1905 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1906 | void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th, |
| 1907 | struct inode *inode, loff_t size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1908 | |
| 1909 | static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1910 | struct inode *inode) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1911 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1912 | reiserfs_update_sd_size(th, inode, inode->i_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1913 | } |
| 1914 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1915 | void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode); |
| 1916 | void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1917 | int reiserfs_setattr(struct dentry *dentry, struct iattr *attr); |
| 1918 | |
| 1919 | /* namei.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1920 | void set_de_name_and_namelen(struct reiserfs_dir_entry *de); |
| 1921 | int search_by_entry_key(struct super_block *sb, const struct cpu_key *key, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1922 | struct treepath *path, struct reiserfs_dir_entry *de); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1923 | struct dentry *reiserfs_get_parent(struct dentry *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1924 | /* procfs.c */ |
| 1925 | |
| 1926 | #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO ) |
| 1927 | #define REISERFS_PROC_INFO |
| 1928 | #else |
| 1929 | #undef REISERFS_PROC_INFO |
| 1930 | #endif |
| 1931 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1932 | int reiserfs_proc_info_init(struct super_block *sb); |
| 1933 | int reiserfs_proc_info_done(struct super_block *sb); |
| 1934 | struct proc_dir_entry *reiserfs_proc_register_global(char *name, |
| 1935 | read_proc_t * func); |
| 1936 | void reiserfs_proc_unregister_global(const char *name); |
| 1937 | int reiserfs_proc_info_global_init(void); |
| 1938 | int reiserfs_proc_info_global_done(void); |
| 1939 | int reiserfs_global_version_in_proc(char *buffer, char **start, off_t offset, |
| 1940 | int count, int *eof, void *data); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1941 | |
| 1942 | #if defined( REISERFS_PROC_INFO ) |
| 1943 | |
| 1944 | #define PROC_EXP( e ) e |
| 1945 | |
| 1946 | #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data |
| 1947 | #define PROC_INFO_MAX( sb, field, value ) \ |
| 1948 | __PINFO( sb ).field = \ |
| 1949 | max( REISERFS_SB( sb ) -> s_proc_info_data.field, value ) |
| 1950 | #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) ) |
| 1951 | #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) ) |
| 1952 | #define PROC_INFO_BH_STAT( sb, bh, level ) \ |
| 1953 | PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \ |
| 1954 | PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \ |
| 1955 | PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) ) |
| 1956 | #else |
| 1957 | #define PROC_EXP( e ) |
| 1958 | #define VOID_V ( ( void ) 0 ) |
| 1959 | #define PROC_INFO_MAX( sb, field, value ) VOID_V |
| 1960 | #define PROC_INFO_INC( sb, field ) VOID_V |
| 1961 | #define PROC_INFO_ADD( sb, field, val ) VOID_V |
| 1962 | #define PROC_INFO_BH_STAT( p_s_sb, p_s_bh, n_node_level ) VOID_V |
| 1963 | #endif |
| 1964 | |
| 1965 | /* dir.c */ |
Arjan van de Ven | c5ef1c4 | 2007-02-12 00:55:40 -0800 | [diff] [blame] | 1966 | extern const struct inode_operations reiserfs_dir_inode_operations; |
| 1967 | extern const struct inode_operations reiserfs_symlink_inode_operations; |
| 1968 | extern const struct inode_operations reiserfs_special_inode_operations; |
Arjan van de Ven | 4b6f5d2 | 2006-03-28 01:56:42 -0800 | [diff] [blame] | 1969 | extern const struct file_operations reiserfs_dir_operations; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1970 | |
| 1971 | /* tail_conversion.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1972 | int direct2indirect(struct reiserfs_transaction_handle *, struct inode *, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1973 | struct treepath *, struct buffer_head *, loff_t); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1974 | int indirect2direct(struct reiserfs_transaction_handle *, struct inode *, |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 1975 | struct page *, struct treepath *, const struct cpu_key *, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1976 | loff_t, char *); |
| 1977 | void reiserfs_unmap_buffer(struct buffer_head *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1978 | |
| 1979 | /* file.c */ |
Arjan van de Ven | c5ef1c4 | 2007-02-12 00:55:40 -0800 | [diff] [blame] | 1980 | extern const struct inode_operations reiserfs_file_inode_operations; |
Arjan van de Ven | 4b6f5d2 | 2006-03-28 01:56:42 -0800 | [diff] [blame] | 1981 | extern const struct file_operations reiserfs_file_operations; |
Christoph Hellwig | f5e54d6 | 2006-06-28 04:26:44 -0700 | [diff] [blame] | 1982 | extern const struct address_space_operations reiserfs_address_space_operations; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1983 | |
| 1984 | /* fix_nodes.c */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1985 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1986 | int fix_nodes(int n_op_mode, struct tree_balance *p_s_tb, |
| 1987 | struct item_head *p_s_ins_ih, const void *); |
| 1988 | void unfix_nodes(struct tree_balance *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1989 | |
| 1990 | /* prints.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 1991 | void reiserfs_panic(struct super_block *s, const char *fmt, ...) |
| 1992 | __attribute__ ((noreturn)); |
| 1993 | void reiserfs_info(struct super_block *s, const char *fmt, ...); |
| 1994 | void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...); |
| 1995 | void print_indirect_item(struct buffer_head *bh, int item_num); |
| 1996 | void store_print_tb(struct tree_balance *tb); |
| 1997 | void print_cur_tb(char *mes); |
| 1998 | void print_de(struct reiserfs_dir_entry *de); |
| 1999 | void print_bi(struct buffer_info *bi, char *mes); |
| 2000 | #define PRINT_LEAF_ITEMS 1 /* print all items */ |
| 2001 | #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */ |
| 2002 | #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */ |
| 2003 | void print_block(struct buffer_head *bh, ...); |
| 2004 | void print_bmap(struct super_block *s, int silent); |
| 2005 | void print_bmap_block(int i, char *data, int size, int silent); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2006 | /*void print_super_block (struct super_block * s, char * mes);*/ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2007 | void print_objectid_map(struct super_block *s); |
| 2008 | void print_block_head(struct buffer_head *bh, char *mes); |
| 2009 | void check_leaf(struct buffer_head *bh); |
| 2010 | void check_internal(struct buffer_head *bh); |
| 2011 | void print_statistics(struct super_block *s); |
| 2012 | char *reiserfs_hashname(int code); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2013 | |
| 2014 | /* lbalance.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2015 | int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num, |
| 2016 | int mov_bytes, struct buffer_head *Snew); |
| 2017 | int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes); |
| 2018 | int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes); |
| 2019 | void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first, |
| 2020 | int del_num, int del_bytes); |
| 2021 | void leaf_insert_into_buf(struct buffer_info *bi, int before, |
| 2022 | struct item_head *inserted_item_ih, |
| 2023 | const char *inserted_item_body, int zeros_number); |
| 2024 | void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num, |
| 2025 | int pos_in_item, int paste_size, const char *body, |
| 2026 | int zeros_number); |
| 2027 | void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, |
| 2028 | int pos_in_item, int cut_size); |
Jeff Mahoney | eba0030 | 2009-03-30 14:02:18 -0400 | [diff] [blame] | 2029 | void leaf_paste_entries(struct buffer_info *bi, int item_num, int before, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2030 | int new_entry_count, struct reiserfs_de_head *new_dehs, |
| 2031 | const char *records, int paste_size); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2032 | /* ibalance.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2033 | int balance_internal(struct tree_balance *, int, int, struct item_head *, |
| 2034 | struct buffer_head **); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2035 | |
| 2036 | /* do_balance.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2037 | void do_balance_mark_leaf_dirty(struct tree_balance *tb, |
| 2038 | struct buffer_head *bh, int flag); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2039 | #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty |
| 2040 | #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty |
| 2041 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2042 | void do_balance(struct tree_balance *tb, struct item_head *ih, |
| 2043 | const char *body, int flag); |
| 2044 | void reiserfs_invalidate_buffer(struct tree_balance *tb, |
| 2045 | struct buffer_head *bh); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2046 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2047 | int get_left_neighbor_position(struct tree_balance *tb, int h); |
| 2048 | int get_right_neighbor_position(struct tree_balance *tb, int h); |
| 2049 | void replace_key(struct tree_balance *tb, struct buffer_head *, int, |
| 2050 | struct buffer_head *, int); |
| 2051 | void make_empty_node(struct buffer_info *); |
| 2052 | struct buffer_head *get_FEB(struct tree_balance *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2053 | |
| 2054 | /* bitmap.c */ |
| 2055 | |
| 2056 | /* structure contains hints for block allocator, and it is a container for |
| 2057 | * arguments, such as node, search path, transaction_handle, etc. */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2058 | struct __reiserfs_blocknr_hint { |
| 2059 | struct inode *inode; /* inode passed to allocator, if we allocate unf. nodes */ |
Jeff Mahoney | 3ee1667 | 2007-10-18 23:39:25 -0700 | [diff] [blame] | 2060 | sector_t block; /* file offset, in blocks */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2061 | struct in_core_key key; |
Josef "Jeff" Sipek | fec6d05 | 2006-12-08 02:36:32 -0800 | [diff] [blame] | 2062 | struct treepath *path; /* search path, used by allocator to deternine search_start by |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2063 | * various ways */ |
| 2064 | struct reiserfs_transaction_handle *th; /* transaction handle is needed to log super blocks and |
| 2065 | * bitmap blocks changes */ |
| 2066 | b_blocknr_t beg, end; |
| 2067 | b_blocknr_t search_start; /* a field used to transfer search start value (block number) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2068 | * between different block allocator procedures |
| 2069 | * (determine_search_start() and others) */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2070 | int prealloc_size; /* is set in determine_prealloc_size() function, used by underlayed |
| 2071 | * function that do actual allocation */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2072 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2073 | unsigned formatted_node:1; /* the allocator uses different polices for getting disk space for |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2074 | * formatted/unformatted blocks with/without preallocation */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2075 | unsigned preallocate:1; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2076 | }; |
| 2077 | |
| 2078 | typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t; |
| 2079 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2080 | int reiserfs_parse_alloc_options(struct super_block *, char *); |
| 2081 | void reiserfs_init_alloc_options(struct super_block *s); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2082 | |
| 2083 | /* |
| 2084 | * given a directory, this will tell you what packing locality |
| 2085 | * to use for a new object underneat it. The locality is returned |
| 2086 | * in disk byte order (le). |
| 2087 | */ |
Al Viro | 3e8962b | 2005-05-01 08:59:18 -0700 | [diff] [blame] | 2088 | __le32 reiserfs_choose_packing(struct inode *dir); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2089 | |
Jeff Mahoney | 6f01046 | 2006-09-30 23:28:43 -0700 | [diff] [blame] | 2090 | int reiserfs_init_bitmap_cache(struct super_block *sb); |
| 2091 | void reiserfs_free_bitmap_cache(struct super_block *sb); |
| 2092 | void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info); |
| 2093 | struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2094 | int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value); |
| 2095 | void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *, |
| 2096 | b_blocknr_t, int for_unformatted); |
| 2097 | int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int, |
| 2098 | int); |
Adrian Bunk | 9adeb1b | 2005-09-10 00:27:18 -0700 | [diff] [blame] | 2099 | static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb, |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2100 | b_blocknr_t * new_blocknrs, |
| 2101 | int amount_needed) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2102 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2103 | reiserfs_blocknr_hint_t hint = { |
| 2104 | .th = tb->transaction_handle, |
| 2105 | .path = tb->tb_path, |
| 2106 | .inode = NULL, |
| 2107 | .key = tb->key, |
| 2108 | .block = 0, |
| 2109 | .formatted_node = 1 |
| 2110 | }; |
| 2111 | return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed, |
| 2112 | 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2113 | } |
| 2114 | |
Adrian Bunk | 9adeb1b | 2005-09-10 00:27:18 -0700 | [diff] [blame] | 2115 | static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2116 | *th, struct inode *inode, |
| 2117 | b_blocknr_t * new_blocknrs, |
Jeff Mahoney | 3ee1667 | 2007-10-18 23:39:25 -0700 | [diff] [blame] | 2118 | struct treepath *path, |
| 2119 | sector_t block) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2120 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2121 | reiserfs_blocknr_hint_t hint = { |
| 2122 | .th = th, |
| 2123 | .path = path, |
| 2124 | .inode = inode, |
| 2125 | .block = block, |
| 2126 | .formatted_node = 0, |
| 2127 | .preallocate = 0 |
| 2128 | }; |
| 2129 | return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2130 | } |
| 2131 | |
| 2132 | #ifdef REISERFS_PREALLOCATE |
Adrian Bunk | 9adeb1b | 2005-09-10 00:27:18 -0700 | [diff] [blame] | 2133 | static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2134 | *th, struct inode *inode, |
| 2135 | b_blocknr_t * new_blocknrs, |
Jeff Mahoney | 3ee1667 | 2007-10-18 23:39:25 -0700 | [diff] [blame] | 2136 | struct treepath *path, |
| 2137 | sector_t block) |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2138 | { |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2139 | reiserfs_blocknr_hint_t hint = { |
| 2140 | .th = th, |
| 2141 | .path = path, |
| 2142 | .inode = inode, |
| 2143 | .block = block, |
| 2144 | .formatted_node = 0, |
| 2145 | .preallocate = 1 |
| 2146 | }; |
| 2147 | return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2148 | } |
| 2149 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2150 | void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th, |
| 2151 | struct inode *inode); |
| 2152 | void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2153 | #endif |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2154 | |
| 2155 | /* hashes.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2156 | __u32 keyed_hash(const signed char *msg, int len); |
| 2157 | __u32 yura_hash(const signed char *msg, int len); |
| 2158 | __u32 r5_hash(const signed char *msg, int len); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2159 | |
| 2160 | /* the ext2 bit routines adjust for big or little endian as |
| 2161 | ** appropriate for the arch, so in our laziness we use them rather |
| 2162 | ** than using the bit routines they call more directly. These |
| 2163 | ** routines must be used when changing on disk bitmaps. */ |
| 2164 | #define reiserfs_test_and_set_le_bit ext2_set_bit |
| 2165 | #define reiserfs_test_and_clear_le_bit ext2_clear_bit |
| 2166 | #define reiserfs_test_le_bit ext2_test_bit |
| 2167 | #define reiserfs_find_next_zero_le_bit ext2_find_next_zero_bit |
| 2168 | |
| 2169 | /* sometimes reiserfs_truncate may require to allocate few new blocks |
| 2170 | to perform indirect2direct conversion. People probably used to |
| 2171 | think, that truncate should work without problems on a filesystem |
| 2172 | without free disk space. They may complain that they can not |
| 2173 | truncate due to lack of free disk space. This spare space allows us |
| 2174 | to not worry about it. 500 is probably too much, but it should be |
| 2175 | absolutely safe */ |
| 2176 | #define SPARE_SPACE 500 |
| 2177 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2178 | /* prototypes from ioctl.c */ |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2179 | int reiserfs_ioctl(struct inode *inode, struct file *filp, |
| 2180 | unsigned int cmd, unsigned long arg); |
David Howells | 52b499c | 2006-08-29 19:06:18 +0100 | [diff] [blame] | 2181 | long reiserfs_compat_ioctl(struct file *filp, |
| 2182 | unsigned int cmd, unsigned long arg); |
Jan Kara | d5dee5c | 2008-04-28 02:16:23 -0700 | [diff] [blame] | 2183 | int reiserfs_unpack(struct inode *inode, struct file *filp); |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2184 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2185 | /* ioctl's command */ |
| 2186 | #define REISERFS_IOC_UNPACK _IOW(0xCD,1,long) |
| 2187 | /* define following flags to be the same as in ext2, so that chattr(1), |
| 2188 | lsattr(1) will work with us. */ |
David Howells | 3669567 | 2006-08-29 19:06:16 +0100 | [diff] [blame] | 2189 | #define REISERFS_IOC_GETFLAGS FS_IOC_GETFLAGS |
| 2190 | #define REISERFS_IOC_SETFLAGS FS_IOC_SETFLAGS |
| 2191 | #define REISERFS_IOC_GETVERSION FS_IOC_GETVERSION |
| 2192 | #define REISERFS_IOC_SETVERSION FS_IOC_SETVERSION |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2193 | |
David Howells | 52b499c | 2006-08-29 19:06:18 +0100 | [diff] [blame] | 2194 | /* the 32 bit compat definitions with int argument */ |
| 2195 | #define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int) |
| 2196 | #define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS |
| 2197 | #define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS |
| 2198 | #define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION |
| 2199 | #define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION |
| 2200 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2201 | /* Locking primitives */ |
| 2202 | /* Right now we are still falling back to (un)lock_kernel, but eventually that |
| 2203 | would evolve into real per-fs locks */ |
| 2204 | #define reiserfs_write_lock( sb ) lock_kernel() |
| 2205 | #define reiserfs_write_unlock( sb ) unlock_kernel() |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2206 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 2207 | /* xattr stuff */ |
| 2208 | #define REISERFS_XATTR_DIR_SEM(s) (REISERFS_SB(s)->xattr_dir_sem) |
| 2209 | |
Linus Torvalds | bd4c625 | 2005-07-12 20:21:28 -0700 | [diff] [blame] | 2210 | #endif /* _LINUX_REISER_FS_H */ |