1f466c6fdSAl Viro /* 2098297b2SJeff Mahoney * Copyright 1996, 1997, 1998 Hans Reiser, see reiserfs/README for 3098297b2SJeff Mahoney * licensing and copyright details 4f466c6fdSAl Viro */ 5f466c6fdSAl Viro 6f466c6fdSAl Viro #include <linux/reiserfs_fs.h> 7f466c6fdSAl Viro 8f466c6fdSAl Viro #include <linux/slab.h> 9f466c6fdSAl Viro #include <linux/interrupt.h> 10f466c6fdSAl Viro #include <linux/sched.h> 11ed2d265dSLinus Torvalds #include <linux/bug.h> 12f466c6fdSAl Viro #include <linux/workqueue.h> 13f466c6fdSAl Viro #include <asm/unaligned.h> 14f466c6fdSAl Viro #include <linux/bitops.h> 15f466c6fdSAl Viro #include <linux/proc_fs.h> 16f466c6fdSAl Viro #include <linux/buffer_head.h> 17f466c6fdSAl Viro 18f466c6fdSAl Viro /* the 32 bit compat definitions with int argument */ 19f466c6fdSAl Viro #define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int) 20f466c6fdSAl Viro #define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS 21f466c6fdSAl Viro #define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS 22f466c6fdSAl Viro #define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION 23f466c6fdSAl Viro #define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION 24f466c6fdSAl Viro 25765fd6b2SAl Viro struct reiserfs_journal_list; 26765fd6b2SAl Viro 27098297b2SJeff Mahoney /* bitmasks for i_flags field in reiserfs-specific part of inode */ 28765fd6b2SAl Viro typedef enum { 29098297b2SJeff Mahoney /* 30098297b2SJeff Mahoney * this says what format of key do all items (but stat data) of 31098297b2SJeff Mahoney * an object have. If this is set, that format is 3.6 otherwise - 3.5 32098297b2SJeff Mahoney */ 33765fd6b2SAl Viro i_item_key_version_mask = 0x0001, 34098297b2SJeff Mahoney 35098297b2SJeff Mahoney /* 36098297b2SJeff Mahoney * If this is unset, object has 3.5 stat data, otherwise, 37098297b2SJeff Mahoney * it has 3.6 stat data with 64bit size, 32bit nlink etc. 38098297b2SJeff Mahoney */ 39765fd6b2SAl Viro i_stat_data_version_mask = 0x0002, 40098297b2SJeff Mahoney 41098297b2SJeff Mahoney /* file might need tail packing on close */ 42765fd6b2SAl Viro i_pack_on_close_mask = 0x0004, 43098297b2SJeff Mahoney 44098297b2SJeff Mahoney /* don't pack tail of file */ 45765fd6b2SAl Viro i_nopack_mask = 0x0008, 46098297b2SJeff Mahoney 47098297b2SJeff Mahoney /* 48098297b2SJeff Mahoney * If either of these are set, "safe link" was created for this 49098297b2SJeff Mahoney * file during truncate or unlink. Safe link is used to avoid 50098297b2SJeff Mahoney * leakage of disk space on crash with some files open, but unlinked. 51098297b2SJeff Mahoney */ 52765fd6b2SAl Viro i_link_saved_unlink_mask = 0x0010, 53765fd6b2SAl Viro i_link_saved_truncate_mask = 0x0020, 54098297b2SJeff Mahoney 55765fd6b2SAl Viro i_has_xattr_dir = 0x0040, 56765fd6b2SAl Viro i_data_log = 0x0080, 57765fd6b2SAl Viro } reiserfs_inode_flags; 58765fd6b2SAl Viro 59765fd6b2SAl Viro struct reiserfs_inode_info { 60765fd6b2SAl Viro __u32 i_key[4]; /* key is still 4 32 bit integers */ 61098297b2SJeff Mahoney 62098297b2SJeff Mahoney /* 63098297b2SJeff Mahoney * transient inode flags that are never stored on disk. Bitmasks 64098297b2SJeff Mahoney * for this field are defined above. 65098297b2SJeff Mahoney */ 66765fd6b2SAl Viro __u32 i_flags; 67765fd6b2SAl Viro 68098297b2SJeff Mahoney /* offset of first byte stored in direct item. */ 69098297b2SJeff Mahoney __u32 i_first_direct_byte; 70765fd6b2SAl Viro 71765fd6b2SAl Viro /* copy of persistent inode flags read from sd_attrs. */ 72765fd6b2SAl Viro __u32 i_attrs; 73765fd6b2SAl Viro 74098297b2SJeff Mahoney /* first unused block of a sequence of unused blocks */ 75098297b2SJeff Mahoney int i_prealloc_block; 76765fd6b2SAl Viro int i_prealloc_count; /* length of that sequence */ 77765fd6b2SAl Viro 78098297b2SJeff Mahoney /* per-transaction list of inodes which have preallocated blocks */ 79098297b2SJeff Mahoney struct list_head i_prealloc_list; 80765fd6b2SAl Viro 81098297b2SJeff Mahoney /* 82098297b2SJeff Mahoney * new_packing_locality is created; new blocks for the contents 83098297b2SJeff Mahoney * of this directory should be displaced 84098297b2SJeff Mahoney */ 85098297b2SJeff Mahoney unsigned new_packing_locality:1; 86098297b2SJeff Mahoney 87098297b2SJeff Mahoney /* 88098297b2SJeff Mahoney * we use these for fsync or O_SYNC to decide which transaction 89098297b2SJeff Mahoney * needs to be committed in order for this inode to be properly 90098297b2SJeff Mahoney * flushed 91098297b2SJeff Mahoney */ 92765fd6b2SAl Viro unsigned int i_trans_id; 93098297b2SJeff Mahoney 94765fd6b2SAl Viro struct reiserfs_journal_list *i_jl; 95765fd6b2SAl Viro atomic_t openers; 96765fd6b2SAl Viro struct mutex tailpack; 97765fd6b2SAl Viro #ifdef CONFIG_REISERFS_FS_XATTR 98765fd6b2SAl Viro struct rw_semaphore i_xattr_sem; 99765fd6b2SAl Viro #endif 100765fd6b2SAl Viro struct inode vfs_inode; 101765fd6b2SAl Viro }; 102765fd6b2SAl Viro 103765fd6b2SAl Viro typedef enum { 104765fd6b2SAl Viro reiserfs_attrs_cleared = 0x00000001, 105765fd6b2SAl Viro } reiserfs_super_block_flags; 106765fd6b2SAl Viro 107098297b2SJeff Mahoney /* 108098297b2SJeff Mahoney * struct reiserfs_super_block accessors/mutators since this is a disk 109098297b2SJeff Mahoney * structure, it will always be in little endian format. 110098297b2SJeff Mahoney */ 111765fd6b2SAl Viro #define sb_block_count(sbp) (le32_to_cpu((sbp)->s_v1.s_block_count)) 112765fd6b2SAl Viro #define set_sb_block_count(sbp,v) ((sbp)->s_v1.s_block_count = cpu_to_le32(v)) 113765fd6b2SAl Viro #define sb_free_blocks(sbp) (le32_to_cpu((sbp)->s_v1.s_free_blocks)) 114765fd6b2SAl Viro #define set_sb_free_blocks(sbp,v) ((sbp)->s_v1.s_free_blocks = cpu_to_le32(v)) 115765fd6b2SAl Viro #define sb_root_block(sbp) (le32_to_cpu((sbp)->s_v1.s_root_block)) 116765fd6b2SAl Viro #define set_sb_root_block(sbp,v) ((sbp)->s_v1.s_root_block = cpu_to_le32(v)) 117765fd6b2SAl Viro 118765fd6b2SAl Viro #define sb_jp_journal_1st_block(sbp) \ 119765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_1st_block)) 120765fd6b2SAl Viro #define set_sb_jp_journal_1st_block(sbp,v) \ 121765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_1st_block = cpu_to_le32(v)) 122765fd6b2SAl Viro #define sb_jp_journal_dev(sbp) \ 123765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_dev)) 124765fd6b2SAl Viro #define set_sb_jp_journal_dev(sbp,v) \ 125765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_dev = cpu_to_le32(v)) 126765fd6b2SAl Viro #define sb_jp_journal_size(sbp) \ 127765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_size)) 128765fd6b2SAl Viro #define set_sb_jp_journal_size(sbp,v) \ 129765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_size = cpu_to_le32(v)) 130765fd6b2SAl Viro #define sb_jp_journal_trans_max(sbp) \ 131765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_trans_max)) 132765fd6b2SAl Viro #define set_sb_jp_journal_trans_max(sbp,v) \ 133765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_trans_max = cpu_to_le32(v)) 134765fd6b2SAl Viro #define sb_jp_journal_magic(sbp) \ 135765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_magic)) 136765fd6b2SAl Viro #define set_sb_jp_journal_magic(sbp,v) \ 137765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_magic = cpu_to_le32(v)) 138765fd6b2SAl Viro #define sb_jp_journal_max_batch(sbp) \ 139765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_batch)) 140765fd6b2SAl Viro #define set_sb_jp_journal_max_batch(sbp,v) \ 141765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_max_batch = cpu_to_le32(v)) 142765fd6b2SAl Viro #define sb_jp_jourmal_max_commit_age(sbp) \ 143765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_commit_age)) 144765fd6b2SAl Viro #define set_sb_jp_journal_max_commit_age(sbp,v) \ 145765fd6b2SAl Viro ((sbp)->s_v1.s_journal.jp_journal_max_commit_age = cpu_to_le32(v)) 146765fd6b2SAl Viro 147765fd6b2SAl Viro #define sb_blocksize(sbp) (le16_to_cpu((sbp)->s_v1.s_blocksize)) 148765fd6b2SAl Viro #define set_sb_blocksize(sbp,v) ((sbp)->s_v1.s_blocksize = cpu_to_le16(v)) 149765fd6b2SAl Viro #define sb_oid_maxsize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_maxsize)) 150765fd6b2SAl Viro #define set_sb_oid_maxsize(sbp,v) ((sbp)->s_v1.s_oid_maxsize = cpu_to_le16(v)) 151765fd6b2SAl Viro #define sb_oid_cursize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_cursize)) 152765fd6b2SAl Viro #define set_sb_oid_cursize(sbp,v) ((sbp)->s_v1.s_oid_cursize = cpu_to_le16(v)) 153765fd6b2SAl Viro #define sb_umount_state(sbp) (le16_to_cpu((sbp)->s_v1.s_umount_state)) 154765fd6b2SAl Viro #define set_sb_umount_state(sbp,v) ((sbp)->s_v1.s_umount_state = cpu_to_le16(v)) 155765fd6b2SAl Viro #define sb_fs_state(sbp) (le16_to_cpu((sbp)->s_v1.s_fs_state)) 156765fd6b2SAl Viro #define set_sb_fs_state(sbp,v) ((sbp)->s_v1.s_fs_state = cpu_to_le16(v)) 157765fd6b2SAl Viro #define sb_hash_function_code(sbp) \ 158765fd6b2SAl Viro (le32_to_cpu((sbp)->s_v1.s_hash_function_code)) 159765fd6b2SAl Viro #define set_sb_hash_function_code(sbp,v) \ 160765fd6b2SAl Viro ((sbp)->s_v1.s_hash_function_code = cpu_to_le32(v)) 161765fd6b2SAl Viro #define sb_tree_height(sbp) (le16_to_cpu((sbp)->s_v1.s_tree_height)) 162765fd6b2SAl Viro #define set_sb_tree_height(sbp,v) ((sbp)->s_v1.s_tree_height = cpu_to_le16(v)) 163765fd6b2SAl Viro #define sb_bmap_nr(sbp) (le16_to_cpu((sbp)->s_v1.s_bmap_nr)) 164765fd6b2SAl Viro #define set_sb_bmap_nr(sbp,v) ((sbp)->s_v1.s_bmap_nr = cpu_to_le16(v)) 165765fd6b2SAl Viro #define sb_version(sbp) (le16_to_cpu((sbp)->s_v1.s_version)) 166765fd6b2SAl Viro #define set_sb_version(sbp,v) ((sbp)->s_v1.s_version = cpu_to_le16(v)) 167765fd6b2SAl Viro 168765fd6b2SAl Viro #define sb_mnt_count(sbp) (le16_to_cpu((sbp)->s_mnt_count)) 169765fd6b2SAl Viro #define set_sb_mnt_count(sbp, v) ((sbp)->s_mnt_count = cpu_to_le16(v)) 170765fd6b2SAl Viro 171765fd6b2SAl Viro #define sb_reserved_for_journal(sbp) \ 172765fd6b2SAl Viro (le16_to_cpu((sbp)->s_v1.s_reserved_for_journal)) 173765fd6b2SAl Viro #define set_sb_reserved_for_journal(sbp,v) \ 174765fd6b2SAl Viro ((sbp)->s_v1.s_reserved_for_journal = cpu_to_le16(v)) 175765fd6b2SAl Viro 176765fd6b2SAl Viro /* LOGGING -- */ 177765fd6b2SAl Viro 178098297b2SJeff Mahoney /* 179098297b2SJeff Mahoney * These all interelate for performance. 180098297b2SJeff Mahoney * 181098297b2SJeff Mahoney * If the journal block count is smaller than n transactions, you lose speed. 182098297b2SJeff Mahoney * I don't know what n is yet, I'm guessing 8-16. 183098297b2SJeff Mahoney * 184098297b2SJeff Mahoney * typical transaction size depends on the application, how often fsync is 185098297b2SJeff Mahoney * called, and how many metadata blocks you dirty in a 30 second period. 186098297b2SJeff Mahoney * The more small files (<16k) you use, the larger your transactions will 187098297b2SJeff Mahoney * be. 188098297b2SJeff Mahoney * 189098297b2SJeff Mahoney * If your journal fills faster than dirty buffers get flushed to disk, it 190098297b2SJeff Mahoney * must flush them before allowing the journal to wrap, which slows things 191098297b2SJeff Mahoney * down. If you need high speed meta data updates, the journal should be 192098297b2SJeff Mahoney * big enough to prevent wrapping before dirty meta blocks get to disk. 193098297b2SJeff Mahoney * 194098297b2SJeff Mahoney * If the batch max is smaller than the transaction max, you'll waste space 195098297b2SJeff Mahoney * at the end of the journal because journal_end sets the next transaction 196098297b2SJeff Mahoney * to start at 0 if the next transaction has any chance of wrapping. 197098297b2SJeff Mahoney * 198098297b2SJeff Mahoney * The large the batch max age, the better the speed, and the more meta 199098297b2SJeff Mahoney * data changes you'll lose after a crash. 200765fd6b2SAl Viro */ 201765fd6b2SAl Viro 202765fd6b2SAl Viro /* don't mess with these for a while */ 203765fd6b2SAl Viro /* we have a node size define somewhere in reiserfs_fs.h. -Hans */ 204765fd6b2SAl Viro #define JOURNAL_BLOCK_SIZE 4096 /* BUG gotta get rid of this */ 205765fd6b2SAl Viro #define JOURNAL_MAX_CNODE 1500 /* max cnodes to allocate. */ 206765fd6b2SAl Viro #define JOURNAL_HASH_SIZE 8192 207765fd6b2SAl Viro 208098297b2SJeff Mahoney /* number of copies of the bitmaps to have floating. Must be >= 2 */ 209098297b2SJeff Mahoney #define JOURNAL_NUM_BITMAPS 5 210098297b2SJeff Mahoney 211098297b2SJeff Mahoney /* 212098297b2SJeff Mahoney * One of these for every block in every transaction 213098297b2SJeff Mahoney * Each one is in two hash tables. First, a hash of the current transaction, 214098297b2SJeff Mahoney * and after journal_end, a hash of all the in memory transactions. 215098297b2SJeff Mahoney * next and prev are used by the current transaction (journal_hash). 216098297b2SJeff Mahoney * hnext and hprev are used by journal_list_hash. If a block is in more 217098297b2SJeff Mahoney * than one transaction, the journal_list_hash links it in multiple times. 218098297b2SJeff Mahoney * This allows flush_journal_list to remove just the cnode belonging to a 219098297b2SJeff Mahoney * given transaction. 220765fd6b2SAl Viro */ 221765fd6b2SAl Viro struct reiserfs_journal_cnode { 222765fd6b2SAl Viro struct buffer_head *bh; /* real buffer head */ 223765fd6b2SAl Viro struct super_block *sb; /* dev of real buffer head */ 224098297b2SJeff Mahoney 225098297b2SJeff Mahoney /* block number of real buffer head, == 0 when buffer on disk */ 226098297b2SJeff Mahoney __u32 blocknr; 227098297b2SJeff Mahoney 228765fd6b2SAl Viro unsigned long state; 229098297b2SJeff Mahoney 230098297b2SJeff Mahoney /* journal list this cnode lives in */ 231098297b2SJeff Mahoney struct reiserfs_journal_list *jlist; 232098297b2SJeff Mahoney 233765fd6b2SAl Viro struct reiserfs_journal_cnode *next; /* next in transaction list */ 234765fd6b2SAl Viro struct reiserfs_journal_cnode *prev; /* prev in transaction list */ 235765fd6b2SAl Viro struct reiserfs_journal_cnode *hprev; /* prev in hash list */ 236765fd6b2SAl Viro struct reiserfs_journal_cnode *hnext; /* next in hash list */ 237765fd6b2SAl Viro }; 238765fd6b2SAl Viro 239765fd6b2SAl Viro struct reiserfs_bitmap_node { 240765fd6b2SAl Viro int id; 241765fd6b2SAl Viro char *data; 242765fd6b2SAl Viro struct list_head list; 243765fd6b2SAl Viro }; 244765fd6b2SAl Viro 245765fd6b2SAl Viro struct reiserfs_list_bitmap { 246765fd6b2SAl Viro struct reiserfs_journal_list *journal_list; 247765fd6b2SAl Viro struct reiserfs_bitmap_node **bitmaps; 248765fd6b2SAl Viro }; 249765fd6b2SAl Viro 250765fd6b2SAl Viro /* 251098297b2SJeff Mahoney * one of these for each transaction. The most important part here is the 252098297b2SJeff Mahoney * j_realblock. this list of cnodes is used to hash all the blocks in all 253098297b2SJeff Mahoney * the commits, to mark all the real buffer heads dirty once all the commits 254098297b2SJeff Mahoney * hit the disk, and to make sure every real block in a transaction is on 255098297b2SJeff Mahoney * disk before allowing the log area to be overwritten 256098297b2SJeff Mahoney */ 257765fd6b2SAl Viro struct reiserfs_journal_list { 258765fd6b2SAl Viro unsigned long j_start; 259765fd6b2SAl Viro unsigned long j_state; 260765fd6b2SAl Viro unsigned long j_len; 261765fd6b2SAl Viro atomic_t j_nonzerolen; 262765fd6b2SAl Viro atomic_t j_commit_left; 263098297b2SJeff Mahoney 264098297b2SJeff Mahoney /* all commits older than this on disk */ 265098297b2SJeff Mahoney atomic_t j_older_commits_done; 266098297b2SJeff Mahoney 267765fd6b2SAl Viro struct mutex j_commit_mutex; 268765fd6b2SAl Viro unsigned int j_trans_id; 269765fd6b2SAl Viro time_t j_timestamp; 270765fd6b2SAl Viro struct reiserfs_list_bitmap *j_list_bitmap; 271765fd6b2SAl Viro struct buffer_head *j_commit_bh; /* commit buffer head */ 272765fd6b2SAl Viro struct reiserfs_journal_cnode *j_realblock; 273765fd6b2SAl Viro struct reiserfs_journal_cnode *j_freedlist; /* list of buffers that were freed during this trans. free each of these on flush */ 274765fd6b2SAl Viro /* time ordered list of all active transactions */ 275765fd6b2SAl Viro struct list_head j_list; 276765fd6b2SAl Viro 277098297b2SJeff Mahoney /* 278098297b2SJeff Mahoney * time ordered list of all transactions we haven't tried 279098297b2SJeff Mahoney * to flush yet 280098297b2SJeff Mahoney */ 281765fd6b2SAl Viro struct list_head j_working_list; 282765fd6b2SAl Viro 283765fd6b2SAl Viro /* list of tail conversion targets in need of flush before commit */ 284765fd6b2SAl Viro struct list_head j_tail_bh_list; 285098297b2SJeff Mahoney 286765fd6b2SAl Viro /* list of data=ordered buffers in need of flush before commit */ 287765fd6b2SAl Viro struct list_head j_bh_list; 288765fd6b2SAl Viro int j_refcount; 289765fd6b2SAl Viro }; 290765fd6b2SAl Viro 291765fd6b2SAl Viro struct reiserfs_journal { 292765fd6b2SAl Viro struct buffer_head **j_ap_blocks; /* journal blocks on disk */ 293098297b2SJeff Mahoney /* newest journal block */ 294098297b2SJeff Mahoney struct reiserfs_journal_cnode *j_last; 295098297b2SJeff Mahoney 296098297b2SJeff Mahoney /* oldest journal block. start here for traverse */ 297098297b2SJeff Mahoney struct reiserfs_journal_cnode *j_first; 298765fd6b2SAl Viro 299765fd6b2SAl Viro struct block_device *j_dev_bd; 300765fd6b2SAl Viro fmode_t j_dev_mode; 301098297b2SJeff Mahoney 302098297b2SJeff Mahoney /* first block on s_dev of reserved area journal */ 303098297b2SJeff Mahoney int j_1st_reserved_block; 304765fd6b2SAl Viro 305765fd6b2SAl Viro unsigned long j_state; 306765fd6b2SAl Viro unsigned int j_trans_id; 307765fd6b2SAl Viro unsigned long j_mount_id; 308098297b2SJeff Mahoney 309098297b2SJeff Mahoney /* start of current waiting commit (index into j_ap_blocks) */ 310098297b2SJeff Mahoney unsigned long j_start; 311765fd6b2SAl Viro unsigned long j_len; /* length of current waiting commit */ 312098297b2SJeff Mahoney 313098297b2SJeff Mahoney /* number of buffers requested by journal_begin() */ 314098297b2SJeff Mahoney unsigned long j_len_alloc; 315098297b2SJeff Mahoney 316765fd6b2SAl Viro atomic_t j_wcount; /* count of writers for current commit */ 317098297b2SJeff Mahoney 318098297b2SJeff Mahoney /* batch count. allows turning X transactions into 1 */ 319098297b2SJeff Mahoney unsigned long j_bcount; 320098297b2SJeff Mahoney 321098297b2SJeff Mahoney /* first unflushed transactions offset */ 322098297b2SJeff Mahoney unsigned long j_first_unflushed_offset; 323098297b2SJeff Mahoney 324098297b2SJeff Mahoney /* last fully flushed journal timestamp */ 325098297b2SJeff Mahoney unsigned j_last_flush_trans_id; 326098297b2SJeff Mahoney 327765fd6b2SAl Viro struct buffer_head *j_header_bh; 328765fd6b2SAl Viro 329765fd6b2SAl Viro time_t j_trans_start_time; /* time this transaction started */ 330765fd6b2SAl Viro struct mutex j_mutex; 331765fd6b2SAl Viro struct mutex j_flush_mutex; 332098297b2SJeff Mahoney 333098297b2SJeff Mahoney /* wait for current transaction to finish before starting new one */ 334098297b2SJeff Mahoney wait_queue_head_t j_join_wait; 335098297b2SJeff Mahoney 336765fd6b2SAl Viro atomic_t j_jlock; /* lock for j_join_wait */ 337765fd6b2SAl Viro int j_list_bitmap_index; /* number of next list bitmap to use */ 338098297b2SJeff Mahoney 339098297b2SJeff Mahoney /* no more journal begins allowed. MUST sleep on j_join_wait */ 340098297b2SJeff Mahoney int j_must_wait; 341098297b2SJeff Mahoney 342098297b2SJeff Mahoney /* next journal_end will flush all journal list */ 343098297b2SJeff Mahoney int j_next_full_flush; 344098297b2SJeff Mahoney 345098297b2SJeff Mahoney /* next journal_end will flush all async commits */ 346098297b2SJeff Mahoney int j_next_async_flush; 347765fd6b2SAl Viro 348765fd6b2SAl Viro int j_cnode_used; /* number of cnodes on the used list */ 349765fd6b2SAl Viro int j_cnode_free; /* number of cnodes on the free list */ 350765fd6b2SAl Viro 351098297b2SJeff Mahoney /* max number of blocks in a transaction. */ 352098297b2SJeff Mahoney unsigned int j_trans_max; 353098297b2SJeff Mahoney 354098297b2SJeff Mahoney /* max number of blocks to batch into a trans */ 355098297b2SJeff Mahoney unsigned int j_max_batch; 356098297b2SJeff Mahoney 357098297b2SJeff Mahoney /* in seconds, how old can an async commit be */ 358098297b2SJeff Mahoney unsigned int j_max_commit_age; 359098297b2SJeff Mahoney 360098297b2SJeff Mahoney /* in seconds, how old can a transaction be */ 361098297b2SJeff Mahoney unsigned int j_max_trans_age; 362098297b2SJeff Mahoney 363098297b2SJeff Mahoney /* the default for the max commit age */ 364098297b2SJeff Mahoney unsigned int j_default_max_commit_age; 365765fd6b2SAl Viro 366765fd6b2SAl Viro struct reiserfs_journal_cnode *j_cnode_free_list; 367098297b2SJeff Mahoney 368098297b2SJeff Mahoney /* orig pointer returned from vmalloc */ 369098297b2SJeff Mahoney struct reiserfs_journal_cnode *j_cnode_free_orig; 370765fd6b2SAl Viro 371765fd6b2SAl Viro struct reiserfs_journal_list *j_current_jl; 372765fd6b2SAl Viro int j_free_bitmap_nodes; 373765fd6b2SAl Viro int j_used_bitmap_nodes; 374765fd6b2SAl Viro 375765fd6b2SAl Viro int j_num_lists; /* total number of active transactions */ 376765fd6b2SAl Viro int j_num_work_lists; /* number that need attention from kreiserfsd */ 377765fd6b2SAl Viro 378765fd6b2SAl Viro /* debugging to make sure things are flushed in order */ 379765fd6b2SAl Viro unsigned int j_last_flush_id; 380765fd6b2SAl Viro 381765fd6b2SAl Viro /* debugging to make sure things are committed in order */ 382765fd6b2SAl Viro unsigned int j_last_commit_id; 383765fd6b2SAl Viro 384765fd6b2SAl Viro struct list_head j_bitmap_nodes; 385765fd6b2SAl Viro struct list_head j_dirty_buffers; 386765fd6b2SAl Viro spinlock_t j_dirty_buffers_lock; /* protects j_dirty_buffers */ 387765fd6b2SAl Viro 388765fd6b2SAl Viro /* list of all active transactions */ 389765fd6b2SAl Viro struct list_head j_journal_list; 390098297b2SJeff Mahoney 391765fd6b2SAl Viro /* lists that haven't been touched by writeback attempts */ 392765fd6b2SAl Viro struct list_head j_working_list; 393765fd6b2SAl Viro 394098297b2SJeff Mahoney /* hash table for real buffer heads in current trans */ 395098297b2SJeff Mahoney struct reiserfs_journal_cnode *j_hash_table[JOURNAL_HASH_SIZE]; 396098297b2SJeff Mahoney 397098297b2SJeff Mahoney /* hash table for all the real buffer heads in all the transactions */ 398098297b2SJeff Mahoney struct reiserfs_journal_cnode *j_list_hash_table[JOURNAL_HASH_SIZE]; 399098297b2SJeff Mahoney 400098297b2SJeff Mahoney /* array of bitmaps to record the deleted blocks */ 401098297b2SJeff Mahoney struct reiserfs_list_bitmap j_list_bitmap[JOURNAL_NUM_BITMAPS]; 402098297b2SJeff Mahoney 403098297b2SJeff Mahoney /* list of inodes which have preallocated blocks */ 404098297b2SJeff Mahoney struct list_head j_prealloc_list; 405765fd6b2SAl Viro int j_persistent_trans; 406765fd6b2SAl Viro unsigned long j_max_trans_size; 407765fd6b2SAl Viro unsigned long j_max_batch_size; 408765fd6b2SAl Viro 409765fd6b2SAl Viro int j_errno; 410765fd6b2SAl Viro 411765fd6b2SAl Viro /* when flushing ordered buffers, throttle new ordered writers */ 412765fd6b2SAl Viro struct delayed_work j_work; 413765fd6b2SAl Viro struct super_block *j_work_sb; 414765fd6b2SAl Viro atomic_t j_async_throttle; 415765fd6b2SAl Viro }; 416765fd6b2SAl Viro 417765fd6b2SAl Viro enum journal_state_bits { 418765fd6b2SAl Viro J_WRITERS_BLOCKED = 1, /* set when new writers not allowed */ 419765fd6b2SAl Viro J_WRITERS_QUEUED, /* set when log is full due to too many writers */ 420765fd6b2SAl Viro J_ABORTED, /* set when log is aborted */ 421765fd6b2SAl Viro }; 422765fd6b2SAl Viro 423098297b2SJeff Mahoney /* ick. magic string to find desc blocks in the journal */ 424098297b2SJeff Mahoney #define JOURNAL_DESC_MAGIC "ReIsErLB" 425765fd6b2SAl Viro 426765fd6b2SAl Viro typedef __u32(*hashf_t) (const signed char *, int); 427765fd6b2SAl Viro 428765fd6b2SAl Viro struct reiserfs_bitmap_info { 429765fd6b2SAl Viro __u32 free_count; 430765fd6b2SAl Viro }; 431765fd6b2SAl Viro 432765fd6b2SAl Viro struct proc_dir_entry; 433765fd6b2SAl Viro 434765fd6b2SAl Viro #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO ) 435765fd6b2SAl Viro typedef unsigned long int stat_cnt_t; 436765fd6b2SAl Viro typedef struct reiserfs_proc_info_data { 437765fd6b2SAl Viro spinlock_t lock; 438765fd6b2SAl Viro int exiting; 439765fd6b2SAl Viro int max_hash_collisions; 440765fd6b2SAl Viro 441765fd6b2SAl Viro stat_cnt_t breads; 442765fd6b2SAl Viro stat_cnt_t bread_miss; 443765fd6b2SAl Viro stat_cnt_t search_by_key; 444765fd6b2SAl Viro stat_cnt_t search_by_key_fs_changed; 445765fd6b2SAl Viro stat_cnt_t search_by_key_restarted; 446765fd6b2SAl Viro 447765fd6b2SAl Viro stat_cnt_t insert_item_restarted; 448765fd6b2SAl Viro stat_cnt_t paste_into_item_restarted; 449765fd6b2SAl Viro stat_cnt_t cut_from_item_restarted; 450765fd6b2SAl Viro stat_cnt_t delete_solid_item_restarted; 451765fd6b2SAl Viro stat_cnt_t delete_item_restarted; 452765fd6b2SAl Viro 453765fd6b2SAl Viro stat_cnt_t leaked_oid; 454765fd6b2SAl Viro stat_cnt_t leaves_removable; 455765fd6b2SAl Viro 456098297b2SJeff Mahoney /* 457098297b2SJeff Mahoney * balances per level. 458098297b2SJeff Mahoney * Use explicit 5 as MAX_HEIGHT is not visible yet. 459098297b2SJeff Mahoney */ 460765fd6b2SAl Viro stat_cnt_t balance_at[5]; /* XXX */ 461765fd6b2SAl Viro /* sbk == search_by_key */ 462765fd6b2SAl Viro stat_cnt_t sbk_read_at[5]; /* XXX */ 463765fd6b2SAl Viro stat_cnt_t sbk_fs_changed[5]; 464765fd6b2SAl Viro stat_cnt_t sbk_restarted[5]; 465765fd6b2SAl Viro stat_cnt_t items_at[5]; /* XXX */ 466765fd6b2SAl Viro stat_cnt_t free_at[5]; /* XXX */ 467765fd6b2SAl Viro stat_cnt_t can_node_be_removed[5]; /* XXX */ 468765fd6b2SAl Viro long int lnum[5]; /* XXX */ 469765fd6b2SAl Viro long int rnum[5]; /* XXX */ 470765fd6b2SAl Viro long int lbytes[5]; /* XXX */ 471765fd6b2SAl Viro long int rbytes[5]; /* XXX */ 472765fd6b2SAl Viro stat_cnt_t get_neighbors[5]; 473765fd6b2SAl Viro stat_cnt_t get_neighbors_restart[5]; 474765fd6b2SAl Viro stat_cnt_t need_l_neighbor[5]; 475765fd6b2SAl Viro stat_cnt_t need_r_neighbor[5]; 476765fd6b2SAl Viro 477765fd6b2SAl Viro stat_cnt_t free_block; 478765fd6b2SAl Viro struct __scan_bitmap_stats { 479765fd6b2SAl Viro stat_cnt_t call; 480765fd6b2SAl Viro stat_cnt_t wait; 481765fd6b2SAl Viro stat_cnt_t bmap; 482765fd6b2SAl Viro stat_cnt_t retry; 483765fd6b2SAl Viro stat_cnt_t in_journal_hint; 484765fd6b2SAl Viro stat_cnt_t in_journal_nohint; 485765fd6b2SAl Viro stat_cnt_t stolen; 486765fd6b2SAl Viro } scan_bitmap; 487765fd6b2SAl Viro struct __journal_stats { 488765fd6b2SAl Viro stat_cnt_t in_journal; 489765fd6b2SAl Viro stat_cnt_t in_journal_bitmap; 490765fd6b2SAl Viro stat_cnt_t in_journal_reusable; 491765fd6b2SAl Viro stat_cnt_t lock_journal; 492765fd6b2SAl Viro stat_cnt_t lock_journal_wait; 493765fd6b2SAl Viro stat_cnt_t journal_being; 494765fd6b2SAl Viro stat_cnt_t journal_relock_writers; 495765fd6b2SAl Viro stat_cnt_t journal_relock_wcount; 496765fd6b2SAl Viro stat_cnt_t mark_dirty; 497765fd6b2SAl Viro stat_cnt_t mark_dirty_already; 498765fd6b2SAl Viro stat_cnt_t mark_dirty_notjournal; 499765fd6b2SAl Viro stat_cnt_t restore_prepared; 500765fd6b2SAl Viro stat_cnt_t prepare; 501765fd6b2SAl Viro stat_cnt_t prepare_retry; 502765fd6b2SAl Viro } journal; 503765fd6b2SAl Viro } reiserfs_proc_info_data_t; 504765fd6b2SAl Viro #else 505765fd6b2SAl Viro typedef struct reiserfs_proc_info_data { 506765fd6b2SAl Viro } reiserfs_proc_info_data_t; 507765fd6b2SAl Viro #endif 508765fd6b2SAl Viro 509aca60617SJan Kara /* Number of quota types we support */ 510aca60617SJan Kara #define REISERFS_MAXQUOTAS 2 511aca60617SJan Kara 512765fd6b2SAl Viro /* reiserfs union of in-core super block data */ 513765fd6b2SAl Viro struct reiserfs_sb_info { 514098297b2SJeff Mahoney /* Buffer containing the super block */ 515098297b2SJeff Mahoney struct buffer_head *s_sbh; 516098297b2SJeff Mahoney 517098297b2SJeff Mahoney /* Pointer to the on-disk super block in the buffer */ 518098297b2SJeff Mahoney struct reiserfs_super_block *s_rs; 519765fd6b2SAl Viro struct reiserfs_bitmap_info *s_ap_bitmap; 520098297b2SJeff Mahoney 521098297b2SJeff Mahoney /* pointer to journal information */ 522098297b2SJeff Mahoney struct reiserfs_journal *s_journal; 523098297b2SJeff Mahoney 524765fd6b2SAl Viro unsigned short s_mount_state; /* reiserfs state (valid, invalid) */ 525765fd6b2SAl Viro 526765fd6b2SAl Viro /* Serialize writers access, replace the old bkl */ 527765fd6b2SAl Viro struct mutex lock; 528098297b2SJeff Mahoney 529765fd6b2SAl Viro /* Owner of the lock (can be recursive) */ 530765fd6b2SAl Viro struct task_struct *lock_owner; 531098297b2SJeff Mahoney 532765fd6b2SAl Viro /* Depth of the lock, start from -1 like the bkl */ 533765fd6b2SAl Viro int lock_depth; 534765fd6b2SAl Viro 535797d9016SJeff Mahoney struct workqueue_struct *commit_wq; 536797d9016SJeff Mahoney 537765fd6b2SAl Viro /* Comment? -Hans */ 538765fd6b2SAl Viro void (*end_io_handler) (struct buffer_head *, int); 539765fd6b2SAl Viro 540098297b2SJeff Mahoney /* 541098297b2SJeff Mahoney * pointer to function which is used to sort names in directory. 542098297b2SJeff Mahoney * Set on mount 543098297b2SJeff Mahoney */ 544098297b2SJeff Mahoney hashf_t s_hash_function; 545098297b2SJeff Mahoney 546098297b2SJeff Mahoney /* reiserfs's mount options are set here */ 547098297b2SJeff Mahoney unsigned long s_mount_opt; 548098297b2SJeff Mahoney 549098297b2SJeff Mahoney /* This is a structure that describes block allocator options */ 550098297b2SJeff Mahoney struct { 551098297b2SJeff Mahoney /* Bitfield for enable/disable kind of options */ 552098297b2SJeff Mahoney unsigned long bits; 553098297b2SJeff Mahoney 554098297b2SJeff Mahoney /* 555098297b2SJeff Mahoney * size started from which we consider file 556098297b2SJeff Mahoney * to be a large one (in blocks) 557098297b2SJeff Mahoney */ 558098297b2SJeff Mahoney unsigned long large_file_size; 559098297b2SJeff Mahoney 560765fd6b2SAl Viro int border; /* percentage of disk, border takes */ 561098297b2SJeff Mahoney 562098297b2SJeff Mahoney /* 563098297b2SJeff Mahoney * Minimal file size (in blocks) starting 564098297b2SJeff Mahoney * from which we do preallocations 565098297b2SJeff Mahoney */ 566098297b2SJeff Mahoney int preallocmin; 567098297b2SJeff Mahoney 568098297b2SJeff Mahoney /* 569098297b2SJeff Mahoney * Number of blocks we try to prealloc when file 570098297b2SJeff Mahoney * reaches preallocmin size (in blocks) or prealloc_list 571098297b2SJeff Mahoney is empty. 572098297b2SJeff Mahoney */ 573098297b2SJeff Mahoney int preallocsize; 574765fd6b2SAl Viro } s_alloc_options; 575765fd6b2SAl Viro 576765fd6b2SAl Viro /* Comment? -Hans */ 577765fd6b2SAl Viro wait_queue_head_t s_wait; 578098297b2SJeff Mahoney /* increased by one every time the tree gets re-balanced */ 579098297b2SJeff Mahoney atomic_t s_generation_counter; 580098297b2SJeff Mahoney 581098297b2SJeff Mahoney /* File system properties. Currently holds on-disk FS format */ 582098297b2SJeff Mahoney unsigned long s_properties; 583765fd6b2SAl Viro 584765fd6b2SAl Viro /* session statistics */ 585765fd6b2SAl Viro int s_disk_reads; 586765fd6b2SAl Viro int s_disk_writes; 587765fd6b2SAl Viro int s_fix_nodes; 588765fd6b2SAl Viro int s_do_balance; 589765fd6b2SAl Viro int s_unneeded_left_neighbor; 590765fd6b2SAl Viro int s_good_search_by_key_reada; 591765fd6b2SAl Viro int s_bmaps; 592765fd6b2SAl Viro int s_bmaps_without_search; 593765fd6b2SAl Viro int s_direct2indirect; 594765fd6b2SAl Viro int s_indirect2direct; 595098297b2SJeff Mahoney 596098297b2SJeff Mahoney /* 597098297b2SJeff Mahoney * set up when it's ok for reiserfs_read_inode2() to read from 598098297b2SJeff Mahoney * disk inode with nlink==0. Currently this is only used during 599098297b2SJeff Mahoney * finish_unfinished() processing at mount time 600098297b2SJeff Mahoney */ 601765fd6b2SAl Viro int s_is_unlinked_ok; 602098297b2SJeff Mahoney 603765fd6b2SAl Viro reiserfs_proc_info_data_t s_proc_info_data; 604765fd6b2SAl Viro struct proc_dir_entry *procdir; 605098297b2SJeff Mahoney 606098297b2SJeff Mahoney /* amount of blocks reserved for further allocations */ 607098297b2SJeff Mahoney int reserved_blocks; 608098297b2SJeff Mahoney 609098297b2SJeff Mahoney 610098297b2SJeff Mahoney /* this lock on now only used to protect reserved_blocks variable */ 611098297b2SJeff Mahoney spinlock_t bitmap_lock; 612765fd6b2SAl Viro struct dentry *priv_root; /* root of /.reiserfs_priv */ 613765fd6b2SAl Viro struct dentry *xattr_root; /* root of /.reiserfs_priv/xattrs */ 614765fd6b2SAl Viro int j_errno; 615033369d1SArtem Bityutskiy 616033369d1SArtem Bityutskiy int work_queued; /* non-zero delayed work is queued */ 617033369d1SArtem Bityutskiy struct delayed_work old_work; /* old transactions flush delayed work */ 618033369d1SArtem Bityutskiy spinlock_t old_work_lock; /* protects old_work and work_queued */ 619033369d1SArtem Bityutskiy 620765fd6b2SAl Viro #ifdef CONFIG_QUOTA 621aca60617SJan Kara char *s_qf_names[REISERFS_MAXQUOTAS]; 622765fd6b2SAl Viro int s_jquota_fmt; 623765fd6b2SAl Viro #endif 624765fd6b2SAl Viro char *s_jdev; /* Stored jdev for mount option showing */ 625765fd6b2SAl Viro #ifdef CONFIG_REISERFS_CHECK 626765fd6b2SAl Viro 627098297b2SJeff Mahoney /* 628098297b2SJeff Mahoney * Detects whether more than one copy of tb exists per superblock 629098297b2SJeff Mahoney * as a means of checking whether do_balance is executing 630098297b2SJeff Mahoney * concurrently against another tree reader/writer on a same 631098297b2SJeff Mahoney * mount point. 632765fd6b2SAl Viro */ 633098297b2SJeff Mahoney struct tree_balance *cur_tb; 634765fd6b2SAl Viro #endif 635765fd6b2SAl Viro }; 636765fd6b2SAl Viro 637765fd6b2SAl Viro /* Definitions of reiserfs on-disk properties: */ 638765fd6b2SAl Viro #define REISERFS_3_5 0 639765fd6b2SAl Viro #define REISERFS_3_6 1 640765fd6b2SAl Viro #define REISERFS_OLD_FORMAT 2 641765fd6b2SAl Viro 642765fd6b2SAl Viro /* Mount options */ 643098297b2SJeff Mahoney enum reiserfs_mount_options { 644098297b2SJeff Mahoney /* large tails will be created in a session */ 645098297b2SJeff Mahoney REISERFS_LARGETAIL, 646098297b2SJeff Mahoney /* 647098297b2SJeff Mahoney * small (for files less than block size) tails will 648098297b2SJeff Mahoney * be created in a session 649098297b2SJeff Mahoney */ 650098297b2SJeff Mahoney REISERFS_SMALLTAIL, 651765fd6b2SAl Viro 652098297b2SJeff Mahoney /* replay journal and return 0. Use by fsck */ 653098297b2SJeff Mahoney REPLAYONLY, 654098297b2SJeff Mahoney 655098297b2SJeff Mahoney /* 656098297b2SJeff Mahoney * -o conv: causes conversion of old format super block to the 657098297b2SJeff Mahoney * new format. If not specified - old partition will be dealt 658098297b2SJeff Mahoney * with in a manner of 3.5.x 659098297b2SJeff Mahoney */ 660098297b2SJeff Mahoney REISERFS_CONVERT, 661098297b2SJeff Mahoney 662098297b2SJeff Mahoney /* 663098297b2SJeff Mahoney * -o hash={tea, rupasov, r5, detect} is meant for properly mounting 664098297b2SJeff Mahoney * reiserfs disks from 3.5.19 or earlier. 99% of the time, this 665098297b2SJeff Mahoney * option is not required. If the normal autodection code can't 666098297b2SJeff Mahoney * determine which hash to use (because both hashes had the same 667098297b2SJeff Mahoney * value for a file) use this option to force a specific hash. 668098297b2SJeff Mahoney * It won't allow you to override the existing hash on the FS, so 669098297b2SJeff Mahoney * if you have a tea hash disk, and mount with -o hash=rupasov, 670098297b2SJeff Mahoney * the mount will fail. 671765fd6b2SAl Viro */ 672765fd6b2SAl Viro FORCE_TEA_HASH, /* try to force tea hash on mount */ 673765fd6b2SAl Viro FORCE_RUPASOV_HASH, /* try to force rupasov hash on mount */ 674765fd6b2SAl Viro FORCE_R5_HASH, /* try to force rupasov hash on mount */ 675765fd6b2SAl Viro FORCE_HASH_DETECT, /* try to detect hash function on mount */ 676765fd6b2SAl Viro 677765fd6b2SAl Viro REISERFS_DATA_LOG, 678765fd6b2SAl Viro REISERFS_DATA_ORDERED, 679765fd6b2SAl Viro REISERFS_DATA_WRITEBACK, 680765fd6b2SAl Viro 681098297b2SJeff Mahoney /* 682098297b2SJeff Mahoney * used for testing experimental features, makes benchmarking new 683098297b2SJeff Mahoney * features with and without more convenient, should never be used by 684098297b2SJeff Mahoney * users in any code shipped to users (ideally) 685098297b2SJeff Mahoney */ 686765fd6b2SAl Viro 687765fd6b2SAl Viro REISERFS_NO_BORDER, 688765fd6b2SAl Viro REISERFS_NO_UNHASHED_RELOCATION, 689765fd6b2SAl Viro REISERFS_HASHED_RELOCATION, 690765fd6b2SAl Viro REISERFS_ATTRS, 691765fd6b2SAl Viro REISERFS_XATTRS_USER, 692765fd6b2SAl Viro REISERFS_POSIXACL, 693765fd6b2SAl Viro REISERFS_EXPOSE_PRIVROOT, 694765fd6b2SAl Viro REISERFS_BARRIER_NONE, 695765fd6b2SAl Viro REISERFS_BARRIER_FLUSH, 696765fd6b2SAl Viro 697765fd6b2SAl Viro /* Actions on error */ 698765fd6b2SAl Viro REISERFS_ERROR_PANIC, 699765fd6b2SAl Viro REISERFS_ERROR_RO, 700765fd6b2SAl Viro REISERFS_ERROR_CONTINUE, 701765fd6b2SAl Viro 702765fd6b2SAl Viro REISERFS_USRQUOTA, /* User quota option specified */ 703765fd6b2SAl Viro REISERFS_GRPQUOTA, /* Group quota option specified */ 704765fd6b2SAl Viro 705765fd6b2SAl Viro REISERFS_TEST1, 706765fd6b2SAl Viro REISERFS_TEST2, 707765fd6b2SAl Viro REISERFS_TEST3, 708765fd6b2SAl Viro REISERFS_TEST4, 709765fd6b2SAl Viro REISERFS_UNSUPPORTED_OPT, 710765fd6b2SAl Viro }; 711765fd6b2SAl Viro 712765fd6b2SAl Viro #define reiserfs_r5_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_R5_HASH)) 713765fd6b2SAl Viro #define reiserfs_rupasov_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_RUPASOV_HASH)) 714765fd6b2SAl Viro #define reiserfs_tea_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_TEA_HASH)) 715765fd6b2SAl Viro #define reiserfs_hash_detect(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_HASH_DETECT)) 716765fd6b2SAl Viro #define reiserfs_no_border(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_BORDER)) 717765fd6b2SAl Viro #define reiserfs_no_unhashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_UNHASHED_RELOCATION)) 718765fd6b2SAl Viro #define reiserfs_hashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_HASHED_RELOCATION)) 719765fd6b2SAl Viro #define reiserfs_test4(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_TEST4)) 720765fd6b2SAl Viro 721765fd6b2SAl Viro #define have_large_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_LARGETAIL)) 722765fd6b2SAl Viro #define have_small_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_SMALLTAIL)) 723765fd6b2SAl Viro #define replay_only(s) (REISERFS_SB(s)->s_mount_opt & (1 << REPLAYONLY)) 724765fd6b2SAl Viro #define reiserfs_attrs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ATTRS)) 725765fd6b2SAl Viro #define old_format_only(s) (REISERFS_SB(s)->s_properties & (1 << REISERFS_3_5)) 726765fd6b2SAl Viro #define convert_reiserfs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_CONVERT)) 727765fd6b2SAl Viro #define reiserfs_data_log(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_LOG)) 728765fd6b2SAl Viro #define reiserfs_data_ordered(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_ORDERED)) 729765fd6b2SAl Viro #define reiserfs_data_writeback(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_WRITEBACK)) 730765fd6b2SAl Viro #define reiserfs_xattrs_user(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_XATTRS_USER)) 731765fd6b2SAl Viro #define reiserfs_posixacl(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_POSIXACL)) 732765fd6b2SAl Viro #define reiserfs_expose_privroot(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_EXPOSE_PRIVROOT)) 733765fd6b2SAl Viro #define reiserfs_xattrs_optional(s) (reiserfs_xattrs_user(s) || reiserfs_posixacl(s)) 734765fd6b2SAl Viro #define reiserfs_barrier_none(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_NONE)) 735765fd6b2SAl Viro #define reiserfs_barrier_flush(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_FLUSH)) 736765fd6b2SAl Viro 737765fd6b2SAl Viro #define reiserfs_error_panic(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_PANIC)) 738765fd6b2SAl Viro #define reiserfs_error_ro(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_RO)) 739765fd6b2SAl Viro 740765fd6b2SAl Viro void reiserfs_file_buffer(struct buffer_head *bh, int list); 741765fd6b2SAl Viro extern struct file_system_type reiserfs_fs_type; 742765fd6b2SAl Viro int reiserfs_resize(struct super_block *, unsigned long); 743765fd6b2SAl Viro 744765fd6b2SAl Viro #define CARRY_ON 0 745765fd6b2SAl Viro #define SCHEDULE_OCCURRED 1 746765fd6b2SAl Viro 747765fd6b2SAl Viro #define SB_BUFFER_WITH_SB(s) (REISERFS_SB(s)->s_sbh) 748765fd6b2SAl Viro #define SB_JOURNAL(s) (REISERFS_SB(s)->s_journal) 749765fd6b2SAl Viro #define SB_JOURNAL_1st_RESERVED_BLOCK(s) (SB_JOURNAL(s)->j_1st_reserved_block) 750765fd6b2SAl Viro #define SB_JOURNAL_LEN_FREE(s) (SB_JOURNAL(s)->j_journal_len_free) 751765fd6b2SAl Viro #define SB_AP_BITMAP(s) (REISERFS_SB(s)->s_ap_bitmap) 752765fd6b2SAl Viro 753765fd6b2SAl Viro #define SB_DISK_JOURNAL_HEAD(s) (SB_JOURNAL(s)->j_header_bh->) 754765fd6b2SAl Viro 755765fd6b2SAl Viro #define reiserfs_is_journal_aborted(journal) (unlikely (__reiserfs_is_journal_aborted (journal))) 756765fd6b2SAl Viro static inline int __reiserfs_is_journal_aborted(struct reiserfs_journal 757765fd6b2SAl Viro *journal) 758765fd6b2SAl Viro { 759765fd6b2SAl Viro return test_bit(J_ABORTED, &journal->j_state); 760765fd6b2SAl Viro } 761765fd6b2SAl Viro 762f466c6fdSAl Viro /* 763f466c6fdSAl Viro * Locking primitives. The write lock is a per superblock 764f466c6fdSAl Viro * special mutex that has properties close to the Big Kernel Lock 765f466c6fdSAl Viro * which was used in the previous locking scheme. 766f466c6fdSAl Viro */ 767f466c6fdSAl Viro void reiserfs_write_lock(struct super_block *s); 768f466c6fdSAl Viro void reiserfs_write_unlock(struct super_block *s); 769278f6679SJeff Mahoney int __must_check reiserfs_write_unlock_nested(struct super_block *s); 770278f6679SJeff Mahoney void reiserfs_write_lock_nested(struct super_block *s, int depth); 771f466c6fdSAl Viro 772f466c6fdSAl Viro #ifdef CONFIG_REISERFS_CHECK 773f466c6fdSAl Viro void reiserfs_lock_check_recursive(struct super_block *s); 774f466c6fdSAl Viro #else 775f466c6fdSAl Viro static inline void reiserfs_lock_check_recursive(struct super_block *s) { } 776f466c6fdSAl Viro #endif 777f466c6fdSAl Viro 778f466c6fdSAl Viro /* 779f466c6fdSAl Viro * Several mutexes depend on the write lock. 780f466c6fdSAl Viro * However sometimes we want to relax the write lock while we hold 781f466c6fdSAl Viro * these mutexes, according to the release/reacquire on schedule() 782f466c6fdSAl Viro * properties of the Bkl that were used. 783f466c6fdSAl Viro * Reiserfs performances and locking were based on this scheme. 784f466c6fdSAl Viro * Now that the write lock is a mutex and not the bkl anymore, doing so 785f466c6fdSAl Viro * may result in a deadlock: 786f466c6fdSAl Viro * 787f466c6fdSAl Viro * A acquire write_lock 788f466c6fdSAl Viro * A acquire j_commit_mutex 789f466c6fdSAl Viro * A release write_lock and wait for something 790f466c6fdSAl Viro * B acquire write_lock 791f466c6fdSAl Viro * B can't acquire j_commit_mutex and sleep 792f466c6fdSAl Viro * A can't acquire write lock anymore 793f466c6fdSAl Viro * deadlock 794f466c6fdSAl Viro * 795f466c6fdSAl Viro * What we do here is avoiding such deadlock by playing the same game 796f466c6fdSAl Viro * than the Bkl: if we can't acquire a mutex that depends on the write lock, 797f466c6fdSAl Viro * we release the write lock, wait a bit and then retry. 798f466c6fdSAl Viro * 799f466c6fdSAl Viro * The mutexes concerned by this hack are: 800f466c6fdSAl Viro * - The commit mutex of a journal list 801f466c6fdSAl Viro * - The flush mutex 802f466c6fdSAl Viro * - The journal lock 803f466c6fdSAl Viro * - The inode mutex 804f466c6fdSAl Viro */ 805f466c6fdSAl Viro static inline void reiserfs_mutex_lock_safe(struct mutex *m, 806f466c6fdSAl Viro struct super_block *s) 807f466c6fdSAl Viro { 808278f6679SJeff Mahoney int depth; 809278f6679SJeff Mahoney 810278f6679SJeff Mahoney depth = reiserfs_write_unlock_nested(s); 811f466c6fdSAl Viro mutex_lock(m); 812278f6679SJeff Mahoney reiserfs_write_lock_nested(s, depth); 813f466c6fdSAl Viro } 814f466c6fdSAl Viro 815f466c6fdSAl Viro static inline void 816f466c6fdSAl Viro reiserfs_mutex_lock_nested_safe(struct mutex *m, unsigned int subclass, 817f466c6fdSAl Viro struct super_block *s) 818f466c6fdSAl Viro { 819278f6679SJeff Mahoney int depth; 820278f6679SJeff Mahoney 821278f6679SJeff Mahoney depth = reiserfs_write_unlock_nested(s); 822f466c6fdSAl Viro mutex_lock_nested(m, subclass); 823278f6679SJeff Mahoney reiserfs_write_lock_nested(s, depth); 824f466c6fdSAl Viro } 825f466c6fdSAl Viro 826f466c6fdSAl Viro static inline void 827f466c6fdSAl Viro reiserfs_down_read_safe(struct rw_semaphore *sem, struct super_block *s) 828f466c6fdSAl Viro { 829278f6679SJeff Mahoney int depth; 830278f6679SJeff Mahoney depth = reiserfs_write_unlock_nested(s); 831f466c6fdSAl Viro down_read(sem); 832278f6679SJeff Mahoney reiserfs_write_lock_nested(s, depth); 833f466c6fdSAl Viro } 834f466c6fdSAl Viro 835f466c6fdSAl Viro /* 836f466c6fdSAl Viro * When we schedule, we usually want to also release the write lock, 837f466c6fdSAl Viro * according to the previous bkl based locking scheme of reiserfs. 838f466c6fdSAl Viro */ 839f466c6fdSAl Viro static inline void reiserfs_cond_resched(struct super_block *s) 840f466c6fdSAl Viro { 841f466c6fdSAl Viro if (need_resched()) { 842278f6679SJeff Mahoney int depth; 843278f6679SJeff Mahoney 844278f6679SJeff Mahoney depth = reiserfs_write_unlock_nested(s); 845f466c6fdSAl Viro schedule(); 846278f6679SJeff Mahoney reiserfs_write_lock_nested(s, depth); 847f466c6fdSAl Viro } 848f466c6fdSAl Viro } 849f466c6fdSAl Viro 850f466c6fdSAl Viro struct fid; 851f466c6fdSAl Viro 852098297b2SJeff Mahoney /* 853098297b2SJeff Mahoney * in reading the #defines, it may help to understand that they employ 854098297b2SJeff Mahoney * the following abbreviations: 855098297b2SJeff Mahoney * 856098297b2SJeff Mahoney * B = Buffer 857098297b2SJeff Mahoney * I = Item header 858098297b2SJeff Mahoney * H = Height within the tree (should be changed to LEV) 859098297b2SJeff Mahoney * N = Number of the item in the node 860098297b2SJeff Mahoney * STAT = stat data 861098297b2SJeff Mahoney * DEH = Directory Entry Header 862098297b2SJeff Mahoney * EC = Entry Count 863098297b2SJeff Mahoney * E = Entry number 864098297b2SJeff Mahoney * UL = Unsigned Long 865098297b2SJeff Mahoney * BLKH = BLocK Header 866098297b2SJeff Mahoney * UNFM = UNForMatted node 867098297b2SJeff Mahoney * DC = Disk Child 868098297b2SJeff Mahoney * P = Path 869098297b2SJeff Mahoney * 870098297b2SJeff Mahoney * These #defines are named by concatenating these abbreviations, 871098297b2SJeff Mahoney * where first comes the arguments, and last comes the return value, 872098297b2SJeff Mahoney * of the macro. 873f466c6fdSAl Viro */ 874f466c6fdSAl Viro 875f466c6fdSAl Viro #define USE_INODE_GENERATION_COUNTER 876f466c6fdSAl Viro 877f466c6fdSAl Viro #define REISERFS_PREALLOCATE 878f466c6fdSAl Viro #define DISPLACE_NEW_PACKING_LOCALITIES 879f466c6fdSAl Viro #define PREALLOCATION_SIZE 9 880f466c6fdSAl Viro 881f466c6fdSAl Viro /* n must be power of 2 */ 882f466c6fdSAl Viro #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u)) 883f466c6fdSAl Viro 884098297b2SJeff Mahoney /* 885098297b2SJeff Mahoney * to be ok for alpha and others we have to align structures to 8 byte 886098297b2SJeff Mahoney * boundary. 887098297b2SJeff Mahoney * FIXME: do not change 4 by anything else: there is code which relies on that 888098297b2SJeff Mahoney */ 889f466c6fdSAl Viro #define ROUND_UP(x) _ROUND_UP(x,8LL) 890f466c6fdSAl Viro 891098297b2SJeff Mahoney /* 892098297b2SJeff Mahoney * debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug 893098297b2SJeff Mahoney * messages. 894f466c6fdSAl Viro */ 895f466c6fdSAl Viro #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */ 896f466c6fdSAl Viro 897f466c6fdSAl Viro void __reiserfs_warning(struct super_block *s, const char *id, 898f466c6fdSAl Viro const char *func, const char *fmt, ...); 899f466c6fdSAl Viro #define reiserfs_warning(s, id, fmt, args...) \ 900f466c6fdSAl Viro __reiserfs_warning(s, id, __func__, fmt, ##args) 901f466c6fdSAl Viro /* assertions handling */ 902f466c6fdSAl Viro 903098297b2SJeff Mahoney /* always check a condition and panic if it's false. */ 904f466c6fdSAl Viro #define __RASSERT(cond, scond, format, args...) \ 905f466c6fdSAl Viro do { \ 906f466c6fdSAl Viro if (!(cond)) \ 907f466c6fdSAl Viro reiserfs_panic(NULL, "assertion failure", "(" #cond ") at " \ 908f466c6fdSAl Viro __FILE__ ":%i:%s: " format "\n", \ 909f466c6fdSAl Viro in_interrupt() ? -1 : task_pid_nr(current), \ 910f466c6fdSAl Viro __LINE__, __func__ , ##args); \ 911f466c6fdSAl Viro } while (0) 912f466c6fdSAl Viro 913f466c6fdSAl Viro #define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args) 914f466c6fdSAl Viro 915f466c6fdSAl Viro #if defined( CONFIG_REISERFS_CHECK ) 916f466c6fdSAl Viro #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args) 917f466c6fdSAl Viro #else 918f466c6fdSAl Viro #define RFALSE( cond, format, args... ) do {;} while( 0 ) 919f466c6fdSAl Viro #endif 920f466c6fdSAl Viro 921f466c6fdSAl Viro #define CONSTF __attribute_const__ 922f466c6fdSAl Viro /* 923f466c6fdSAl Viro * Disk Data Structures 924f466c6fdSAl Viro */ 925f466c6fdSAl Viro 926098297b2SJeff Mahoney /*************************************************************************** 927098297b2SJeff Mahoney * SUPER BLOCK * 928098297b2SJeff Mahoney ***************************************************************************/ 929f466c6fdSAl Viro 930f466c6fdSAl Viro /* 931098297b2SJeff Mahoney * Structure of super block on disk, a version of which in RAM is often 932098297b2SJeff Mahoney * accessed as REISERFS_SB(s)->s_rs. The version in RAM is part of a larger 933098297b2SJeff Mahoney * structure containing fields never written to disk. 934f466c6fdSAl Viro */ 935098297b2SJeff Mahoney #define UNSET_HASH 0 /* Detect hash on disk */ 936f466c6fdSAl Viro #define TEA_HASH 1 937f466c6fdSAl Viro #define YURA_HASH 2 938f466c6fdSAl Viro #define R5_HASH 3 939f466c6fdSAl Viro #define DEFAULT_HASH R5_HASH 940f466c6fdSAl Viro 941f466c6fdSAl Viro struct journal_params { 942098297b2SJeff Mahoney /* where does journal start from on its * device */ 943098297b2SJeff Mahoney __le32 jp_journal_1st_block; 944098297b2SJeff Mahoney 945098297b2SJeff Mahoney /* journal device st_rdev */ 946098297b2SJeff Mahoney __le32 jp_journal_dev; 947098297b2SJeff Mahoney 948098297b2SJeff Mahoney /* size of the journal */ 949098297b2SJeff Mahoney __le32 jp_journal_size; 950098297b2SJeff Mahoney 951098297b2SJeff Mahoney /* max number of blocks in a transaction. */ 952098297b2SJeff Mahoney __le32 jp_journal_trans_max; 953098297b2SJeff Mahoney 954098297b2SJeff Mahoney /* 955098297b2SJeff Mahoney * random value made on fs creation 956098297b2SJeff Mahoney * (this was sb_journal_block_count) 957098297b2SJeff Mahoney */ 958098297b2SJeff Mahoney __le32 jp_journal_magic; 959098297b2SJeff Mahoney 960098297b2SJeff Mahoney /* max number of blocks to batch into a trans */ 961098297b2SJeff Mahoney __le32 jp_journal_max_batch; 962098297b2SJeff Mahoney 963098297b2SJeff Mahoney /* in seconds, how old can an async commit be */ 964098297b2SJeff Mahoney __le32 jp_journal_max_commit_age; 965098297b2SJeff Mahoney 966098297b2SJeff Mahoney /* in seconds, how old can a transaction be */ 967098297b2SJeff Mahoney __le32 jp_journal_max_trans_age; 968f466c6fdSAl Viro }; 969f466c6fdSAl Viro 970f466c6fdSAl Viro /* this is the super from 3.5.X, where X >= 10 */ 971f466c6fdSAl Viro struct reiserfs_super_block_v1 { 972f466c6fdSAl Viro __le32 s_block_count; /* blocks count */ 973f466c6fdSAl Viro __le32 s_free_blocks; /* free blocks count */ 974f466c6fdSAl Viro __le32 s_root_block; /* root block number */ 975f466c6fdSAl Viro struct journal_params s_journal; 976f466c6fdSAl Viro __le16 s_blocksize; /* block size */ 977098297b2SJeff Mahoney 978098297b2SJeff Mahoney /* max size of object id array, see get_objectid() commentary */ 979098297b2SJeff Mahoney __le16 s_oid_maxsize; 980f466c6fdSAl Viro __le16 s_oid_cursize; /* current size of object id array */ 981098297b2SJeff Mahoney 982098297b2SJeff Mahoney /* this is set to 1 when filesystem was umounted, to 2 - when not */ 983098297b2SJeff Mahoney __le16 s_umount_state; 984098297b2SJeff Mahoney 985098297b2SJeff Mahoney /* 986098297b2SJeff Mahoney * reiserfs magic string indicates that file system is reiserfs: 987098297b2SJeff Mahoney * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs" 988098297b2SJeff Mahoney */ 989098297b2SJeff Mahoney char s_magic[10]; 990098297b2SJeff Mahoney 991098297b2SJeff Mahoney /* 992098297b2SJeff Mahoney * it is set to used by fsck to mark which 993098297b2SJeff Mahoney * phase of rebuilding is done 994098297b2SJeff Mahoney */ 995098297b2SJeff Mahoney __le16 s_fs_state; 996098297b2SJeff Mahoney /* 997098297b2SJeff Mahoney * indicate, what hash function is being use 998098297b2SJeff Mahoney * to sort names in a directory 999098297b2SJeff Mahoney */ 1000098297b2SJeff Mahoney __le32 s_hash_function_code; 1001f466c6fdSAl Viro __le16 s_tree_height; /* height of disk tree */ 1002098297b2SJeff Mahoney 1003098297b2SJeff Mahoney /* 1004098297b2SJeff Mahoney * amount of bitmap blocks needed to address 1005098297b2SJeff Mahoney * each block of file system 1006098297b2SJeff Mahoney */ 1007098297b2SJeff Mahoney __le16 s_bmap_nr; 1008098297b2SJeff Mahoney 1009098297b2SJeff Mahoney /* 1010098297b2SJeff Mahoney * this field is only reliable on filesystem with non-standard journal 1011098297b2SJeff Mahoney */ 1012098297b2SJeff Mahoney __le16 s_version; 1013098297b2SJeff Mahoney 1014098297b2SJeff Mahoney /* 1015098297b2SJeff Mahoney * size in blocks of journal area on main device, we need to 1016098297b2SJeff Mahoney * keep after making fs with non-standard journal 1017098297b2SJeff Mahoney */ 1018098297b2SJeff Mahoney __le16 s_reserved_for_journal; 1019f466c6fdSAl Viro } __attribute__ ((__packed__)); 1020f466c6fdSAl Viro 1021f466c6fdSAl Viro #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1)) 1022f466c6fdSAl Viro 1023f466c6fdSAl Viro /* this is the on disk super block */ 1024f466c6fdSAl Viro struct reiserfs_super_block { 1025f466c6fdSAl Viro struct reiserfs_super_block_v1 s_v1; 1026f466c6fdSAl Viro __le32 s_inode_generation; 1027098297b2SJeff Mahoney 1028098297b2SJeff Mahoney /* Right now used only by inode-attributes, if enabled */ 1029098297b2SJeff Mahoney __le32 s_flags; 1030098297b2SJeff Mahoney 1031f466c6fdSAl Viro unsigned char s_uuid[16]; /* filesystem unique identifier */ 1032f466c6fdSAl Viro unsigned char s_label[16]; /* filesystem volume label */ 1033f466c6fdSAl Viro __le16 s_mnt_count; /* Count of mounts since last fsck */ 1034f466c6fdSAl Viro __le16 s_max_mnt_count; /* Maximum mounts before check */ 1035f466c6fdSAl Viro __le32 s_lastcheck; /* Timestamp of last fsck */ 1036f466c6fdSAl Viro __le32 s_check_interval; /* Interval between checks */ 1037098297b2SJeff Mahoney 1038098297b2SJeff Mahoney /* 1039098297b2SJeff Mahoney * zero filled by mkreiserfs and reiserfs_convert_objectid_map_v1() 1040098297b2SJeff Mahoney * so any additions must be updated there as well. */ 1041098297b2SJeff Mahoney char s_unused[76]; 1042f466c6fdSAl Viro } __attribute__ ((__packed__)); 1043f466c6fdSAl Viro 1044f466c6fdSAl Viro #define SB_SIZE (sizeof(struct reiserfs_super_block)) 1045f466c6fdSAl Viro 1046f466c6fdSAl Viro #define REISERFS_VERSION_1 0 1047f466c6fdSAl Viro #define REISERFS_VERSION_2 2 1048f466c6fdSAl Viro 1049098297b2SJeff Mahoney /* on-disk super block fields converted to cpu form */ 1050f466c6fdSAl Viro #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs) 1051f466c6fdSAl Viro #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1)) 1052f466c6fdSAl Viro #define SB_BLOCKSIZE(s) \ 1053f466c6fdSAl Viro le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize)) 1054f466c6fdSAl Viro #define SB_BLOCK_COUNT(s) \ 1055f466c6fdSAl Viro le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count)) 1056f466c6fdSAl Viro #define SB_FREE_BLOCKS(s) \ 1057f466c6fdSAl Viro le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks)) 1058f466c6fdSAl Viro #define SB_REISERFS_MAGIC(s) \ 1059f466c6fdSAl Viro (SB_V1_DISK_SUPER_BLOCK(s)->s_magic) 1060f466c6fdSAl Viro #define SB_ROOT_BLOCK(s) \ 1061f466c6fdSAl Viro le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block)) 1062f466c6fdSAl Viro #define SB_TREE_HEIGHT(s) \ 1063f466c6fdSAl Viro le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height)) 1064f466c6fdSAl Viro #define SB_REISERFS_STATE(s) \ 1065f466c6fdSAl Viro le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state)) 1066f466c6fdSAl Viro #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version)) 1067f466c6fdSAl Viro #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr)) 1068f466c6fdSAl Viro 1069f466c6fdSAl Viro #define PUT_SB_BLOCK_COUNT(s, val) \ 1070f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0) 1071f466c6fdSAl Viro #define PUT_SB_FREE_BLOCKS(s, val) \ 1072f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0) 1073f466c6fdSAl Viro #define PUT_SB_ROOT_BLOCK(s, val) \ 1074f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0) 1075f466c6fdSAl Viro #define PUT_SB_TREE_HEIGHT(s, val) \ 1076f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0) 1077f466c6fdSAl Viro #define PUT_SB_REISERFS_STATE(s, val) \ 1078f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0) 1079f466c6fdSAl Viro #define PUT_SB_VERSION(s, val) \ 1080f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0) 1081f466c6fdSAl Viro #define PUT_SB_BMAP_NR(s, val) \ 1082f466c6fdSAl Viro do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0) 1083f466c6fdSAl Viro 1084f466c6fdSAl Viro #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal) 1085f466c6fdSAl Viro #define SB_ONDISK_JOURNAL_SIZE(s) \ 1086f466c6fdSAl Viro le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size)) 1087f466c6fdSAl Viro #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \ 1088f466c6fdSAl Viro le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block)) 1089f466c6fdSAl Viro #define SB_ONDISK_JOURNAL_DEVICE(s) \ 1090f466c6fdSAl Viro le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev)) 1091f466c6fdSAl Viro #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \ 1092f466c6fdSAl Viro le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal)) 1093f466c6fdSAl Viro 1094f466c6fdSAl Viro #define is_block_in_log_or_reserved_area(s, block) \ 1095f466c6fdSAl Viro block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \ 1096f466c6fdSAl Viro && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \ 1097f466c6fdSAl Viro ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \ 1098f466c6fdSAl Viro SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s))) 1099f466c6fdSAl Viro 1100f466c6fdSAl Viro int is_reiserfs_3_5(struct reiserfs_super_block *rs); 1101f466c6fdSAl Viro int is_reiserfs_3_6(struct reiserfs_super_block *rs); 1102f466c6fdSAl Viro int is_reiserfs_jr(struct reiserfs_super_block *rs); 1103f466c6fdSAl Viro 1104098297b2SJeff Mahoney /* 1105098297b2SJeff Mahoney * ReiserFS leaves the first 64k unused, so that partition labels have 1106098297b2SJeff Mahoney * enough space. If someone wants to write a fancy bootloader that 1107098297b2SJeff Mahoney * needs more than 64k, let us know, and this will be increased in size. 1108098297b2SJeff Mahoney * This number must be larger than than the largest block size on any 1109098297b2SJeff Mahoney * platform, or code will break. -Hans 1110098297b2SJeff Mahoney */ 1111f466c6fdSAl Viro #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024) 1112f466c6fdSAl Viro #define REISERFS_FIRST_BLOCK unused_define 1113f466c6fdSAl Viro #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES 1114f466c6fdSAl Viro 1115f466c6fdSAl Viro /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */ 1116f466c6fdSAl Viro #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024) 1117f466c6fdSAl Viro 1118f466c6fdSAl Viro /* reiserfs internal error code (used by search_by_key and fix_nodes)) */ 1119f466c6fdSAl Viro #define CARRY_ON 0 1120f466c6fdSAl Viro #define REPEAT_SEARCH -1 1121f466c6fdSAl Viro #define IO_ERROR -2 1122f466c6fdSAl Viro #define NO_DISK_SPACE -3 1123f466c6fdSAl Viro #define NO_BALANCING_NEEDED (-4) 1124f466c6fdSAl Viro #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5) 1125f466c6fdSAl Viro #define QUOTA_EXCEEDED -6 1126f466c6fdSAl Viro 1127f466c6fdSAl Viro typedef __u32 b_blocknr_t; 1128f466c6fdSAl Viro typedef __le32 unp_t; 1129f466c6fdSAl Viro 1130f466c6fdSAl Viro struct unfm_nodeinfo { 1131f466c6fdSAl Viro unp_t unfm_nodenum; 1132f466c6fdSAl Viro unsigned short unfm_freespace; 1133f466c6fdSAl Viro }; 1134f466c6fdSAl Viro 1135098297b2SJeff Mahoney /* there are two formats of keys: 3.5 and 3.6 */ 1136f466c6fdSAl Viro #define KEY_FORMAT_3_5 0 1137f466c6fdSAl Viro #define KEY_FORMAT_3_6 1 1138f466c6fdSAl Viro 1139f466c6fdSAl Viro /* there are two stat datas */ 1140f466c6fdSAl Viro #define STAT_DATA_V1 0 1141f466c6fdSAl Viro #define STAT_DATA_V2 1 1142f466c6fdSAl Viro 1143f466c6fdSAl Viro static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode) 1144f466c6fdSAl Viro { 1145f466c6fdSAl Viro return container_of(inode, struct reiserfs_inode_info, vfs_inode); 1146f466c6fdSAl Viro } 1147f466c6fdSAl Viro 1148f466c6fdSAl Viro static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb) 1149f466c6fdSAl Viro { 1150f466c6fdSAl Viro return sb->s_fs_info; 1151f466c6fdSAl Viro } 1152f466c6fdSAl Viro 1153098297b2SJeff Mahoney /* 1154098297b2SJeff Mahoney * Don't trust REISERFS_SB(sb)->s_bmap_nr, it's a u16 1155098297b2SJeff Mahoney * which overflows on large file systems. 1156098297b2SJeff Mahoney */ 1157f466c6fdSAl Viro static inline __u32 reiserfs_bmap_count(struct super_block *sb) 1158f466c6fdSAl Viro { 1159f466c6fdSAl Viro return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1; 1160f466c6fdSAl Viro } 1161f466c6fdSAl Viro 1162f466c6fdSAl Viro static inline int bmap_would_wrap(unsigned bmap_nr) 1163f466c6fdSAl Viro { 1164f466c6fdSAl Viro return bmap_nr > ((1LL << 16) - 1); 1165f466c6fdSAl Viro } 1166f466c6fdSAl Viro 1167098297b2SJeff Mahoney /* 1168098297b2SJeff Mahoney * this says about version of key of all items (but stat data) the 1169098297b2SJeff Mahoney * object consists of 1170098297b2SJeff Mahoney */ 1171f466c6fdSAl Viro #define get_inode_item_key_version( inode ) \ 1172f466c6fdSAl Viro ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5) 1173f466c6fdSAl Viro 1174f466c6fdSAl Viro #define set_inode_item_key_version( inode, version ) \ 1175f466c6fdSAl Viro ({ if((version)==KEY_FORMAT_3_6) \ 1176f466c6fdSAl Viro REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \ 1177f466c6fdSAl Viro else \ 1178f466c6fdSAl Viro REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; }) 1179f466c6fdSAl Viro 1180f466c6fdSAl Viro #define get_inode_sd_version(inode) \ 1181f466c6fdSAl Viro ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1) 1182f466c6fdSAl Viro 1183f466c6fdSAl Viro #define set_inode_sd_version(inode, version) \ 1184f466c6fdSAl Viro ({ if((version)==STAT_DATA_V2) \ 1185f466c6fdSAl Viro REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \ 1186f466c6fdSAl Viro else \ 1187f466c6fdSAl Viro REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; }) 1188f466c6fdSAl Viro 1189098297b2SJeff Mahoney /* 1190098297b2SJeff Mahoney * This is an aggressive tail suppression policy, I am hoping it 1191098297b2SJeff Mahoney * improves our benchmarks. The principle behind it is that percentage 1192098297b2SJeff Mahoney * space saving is what matters, not absolute space saving. This is 1193098297b2SJeff Mahoney * non-intuitive, but it helps to understand it if you consider that the 1194098297b2SJeff Mahoney * cost to access 4 blocks is not much more than the cost to access 1 1195098297b2SJeff Mahoney * block, if you have to do a seek and rotate. A tail risks a 1196098297b2SJeff Mahoney * non-linear disk access that is significant as a percentage of total 1197098297b2SJeff Mahoney * time cost for a 4 block file and saves an amount of space that is 1198098297b2SJeff Mahoney * less significant as a percentage of space, or so goes the hypothesis. 1199098297b2SJeff Mahoney * -Hans 1200098297b2SJeff Mahoney */ 1201f466c6fdSAl Viro #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \ 1202f466c6fdSAl Viro (\ 1203f466c6fdSAl Viro (!(n_tail_size)) || \ 1204f466c6fdSAl Viro (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \ 1205f466c6fdSAl Viro ( (n_file_size) >= (n_block_size) * 4 ) || \ 1206f466c6fdSAl Viro ( ( (n_file_size) >= (n_block_size) * 3 ) && \ 1207f466c6fdSAl Viro ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \ 1208f466c6fdSAl Viro ( ( (n_file_size) >= (n_block_size) * 2 ) && \ 1209f466c6fdSAl Viro ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \ 1210f466c6fdSAl Viro ( ( (n_file_size) >= (n_block_size) ) && \ 1211f466c6fdSAl Viro ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \ 1212f466c6fdSAl Viro ) 1213f466c6fdSAl Viro 1214098297b2SJeff Mahoney /* 1215098297b2SJeff Mahoney * Another strategy for tails, this one means only create a tail if all the 1216098297b2SJeff Mahoney * file would fit into one DIRECT item. 1217098297b2SJeff Mahoney * Primary intention for this one is to increase performance by decreasing 1218098297b2SJeff Mahoney * seeking. 1219f466c6fdSAl Viro */ 1220f466c6fdSAl Viro #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \ 1221f466c6fdSAl Viro (\ 1222f466c6fdSAl Viro (!(n_tail_size)) || \ 1223f466c6fdSAl Viro (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \ 1224f466c6fdSAl Viro ) 1225f466c6fdSAl Viro 1226f466c6fdSAl Viro /* 1227f466c6fdSAl Viro * values for s_umount_state field 1228f466c6fdSAl Viro */ 1229f466c6fdSAl Viro #define REISERFS_VALID_FS 1 1230f466c6fdSAl Viro #define REISERFS_ERROR_FS 2 1231f466c6fdSAl Viro 1232098297b2SJeff Mahoney /* 1233098297b2SJeff Mahoney * there are 5 item types currently 1234098297b2SJeff Mahoney */ 1235f466c6fdSAl Viro #define TYPE_STAT_DATA 0 1236f466c6fdSAl Viro #define TYPE_INDIRECT 1 1237f466c6fdSAl Viro #define TYPE_DIRECT 2 1238f466c6fdSAl Viro #define TYPE_DIRENTRY 3 1239f466c6fdSAl Viro #define TYPE_MAXTYPE 3 1240098297b2SJeff Mahoney #define TYPE_ANY 15 /* FIXME: comment is required */ 1241f466c6fdSAl Viro 1242098297b2SJeff Mahoney /*************************************************************************** 1243098297b2SJeff Mahoney * KEY & ITEM HEAD * 1244098297b2SJeff Mahoney ***************************************************************************/ 1245f466c6fdSAl Viro 1246098297b2SJeff Mahoney /* * directories use this key as well as old files */ 1247f466c6fdSAl Viro struct offset_v1 { 1248f466c6fdSAl Viro __le32 k_offset; 1249f466c6fdSAl Viro __le32 k_uniqueness; 1250f466c6fdSAl Viro } __attribute__ ((__packed__)); 1251f466c6fdSAl Viro 1252f466c6fdSAl Viro struct offset_v2 { 1253f466c6fdSAl Viro __le64 v; 1254f466c6fdSAl Viro } __attribute__ ((__packed__)); 1255f466c6fdSAl Viro 1256f466c6fdSAl Viro static inline __u16 offset_v2_k_type(const struct offset_v2 *v2) 1257f466c6fdSAl Viro { 1258f466c6fdSAl Viro __u8 type = le64_to_cpu(v2->v) >> 60; 1259f466c6fdSAl Viro return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY; 1260f466c6fdSAl Viro } 1261f466c6fdSAl Viro 1262f466c6fdSAl Viro static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type) 1263f466c6fdSAl Viro { 1264f466c6fdSAl Viro v2->v = 1265f466c6fdSAl Viro (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60); 1266f466c6fdSAl Viro } 1267f466c6fdSAl Viro 1268f466c6fdSAl Viro static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2) 1269f466c6fdSAl Viro { 1270f466c6fdSAl Viro return le64_to_cpu(v2->v) & (~0ULL >> 4); 1271f466c6fdSAl Viro } 1272f466c6fdSAl Viro 1273f466c6fdSAl Viro static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset) 1274f466c6fdSAl Viro { 1275f466c6fdSAl Viro offset &= (~0ULL >> 4); 1276f466c6fdSAl Viro v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset); 1277f466c6fdSAl Viro } 1278f466c6fdSAl Viro 1279098297b2SJeff Mahoney /* 1280098297b2SJeff Mahoney * Key of an item determines its location in the S+tree, and 1281098297b2SJeff Mahoney * is composed of 4 components 1282098297b2SJeff Mahoney */ 1283f466c6fdSAl Viro struct reiserfs_key { 1284098297b2SJeff Mahoney /* packing locality: by default parent directory object id */ 1285098297b2SJeff Mahoney __le32 k_dir_id; 1286098297b2SJeff Mahoney 1287f466c6fdSAl Viro __le32 k_objectid; /* object identifier */ 1288f466c6fdSAl Viro union { 1289f466c6fdSAl Viro struct offset_v1 k_offset_v1; 1290f466c6fdSAl Viro struct offset_v2 k_offset_v2; 1291f466c6fdSAl Viro } __attribute__ ((__packed__)) u; 1292f466c6fdSAl Viro } __attribute__ ((__packed__)); 1293f466c6fdSAl Viro 1294f466c6fdSAl Viro struct in_core_key { 1295098297b2SJeff Mahoney /* packing locality: by default parent directory object id */ 1296098297b2SJeff Mahoney __u32 k_dir_id; 1297f466c6fdSAl Viro __u32 k_objectid; /* object identifier */ 1298f466c6fdSAl Viro __u64 k_offset; 1299f466c6fdSAl Viro __u8 k_type; 1300f466c6fdSAl Viro }; 1301f466c6fdSAl Viro 1302f466c6fdSAl Viro struct cpu_key { 1303f466c6fdSAl Viro struct in_core_key on_disk_key; 1304f466c6fdSAl Viro int version; 1305098297b2SJeff Mahoney /* 3 in all cases but direct2indirect and indirect2direct conversion */ 1306098297b2SJeff Mahoney int key_length; 1307f466c6fdSAl Viro }; 1308f466c6fdSAl Viro 1309098297b2SJeff Mahoney /* 1310098297b2SJeff Mahoney * Our function for comparing keys can compare keys of different 1311098297b2SJeff Mahoney * lengths. It takes as a parameter the length of the keys it is to 1312098297b2SJeff Mahoney * compare. These defines are used in determining what is to be passed 1313098297b2SJeff Mahoney * to it as that parameter. 1314098297b2SJeff Mahoney */ 1315f466c6fdSAl Viro #define REISERFS_FULL_KEY_LEN 4 1316f466c6fdSAl Viro #define REISERFS_SHORT_KEY_LEN 2 1317f466c6fdSAl Viro 1318f466c6fdSAl Viro /* The result of the key compare */ 1319f466c6fdSAl Viro #define FIRST_GREATER 1 1320f466c6fdSAl Viro #define SECOND_GREATER -1 1321f466c6fdSAl Viro #define KEYS_IDENTICAL 0 1322f466c6fdSAl Viro #define KEY_FOUND 1 1323f466c6fdSAl Viro #define KEY_NOT_FOUND 0 1324f466c6fdSAl Viro 1325f466c6fdSAl Viro #define KEY_SIZE (sizeof(struct reiserfs_key)) 1326f466c6fdSAl Viro #define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32)) 1327f466c6fdSAl Viro 1328f466c6fdSAl Viro /* return values for search_by_key and clones */ 1329f466c6fdSAl Viro #define ITEM_FOUND 1 1330f466c6fdSAl Viro #define ITEM_NOT_FOUND 0 1331f466c6fdSAl Viro #define ENTRY_FOUND 1 1332f466c6fdSAl Viro #define ENTRY_NOT_FOUND 0 1333f466c6fdSAl Viro #define DIRECTORY_NOT_FOUND -1 1334f466c6fdSAl Viro #define REGULAR_FILE_FOUND -2 1335f466c6fdSAl Viro #define DIRECTORY_FOUND -3 1336f466c6fdSAl Viro #define BYTE_FOUND 1 1337f466c6fdSAl Viro #define BYTE_NOT_FOUND 0 1338f466c6fdSAl Viro #define FILE_NOT_FOUND -1 1339f466c6fdSAl Viro 1340f466c6fdSAl Viro #define POSITION_FOUND 1 1341f466c6fdSAl Viro #define POSITION_NOT_FOUND 0 1342f466c6fdSAl Viro 1343098297b2SJeff Mahoney /* return values for reiserfs_find_entry and search_by_entry_key */ 1344f466c6fdSAl Viro #define NAME_FOUND 1 1345f466c6fdSAl Viro #define NAME_NOT_FOUND 0 1346f466c6fdSAl Viro #define GOTO_PREVIOUS_ITEM 2 1347f466c6fdSAl Viro #define NAME_FOUND_INVISIBLE 3 1348f466c6fdSAl Viro 1349098297b2SJeff Mahoney /* 1350098297b2SJeff Mahoney * Everything in the filesystem is stored as a set of items. The 1351098297b2SJeff Mahoney * item head contains the key of the item, its free space (for 1352098297b2SJeff Mahoney * indirect items) and specifies the location of the item itself 1353098297b2SJeff Mahoney * within the block. 1354098297b2SJeff Mahoney */ 1355f466c6fdSAl Viro 1356f466c6fdSAl Viro struct item_head { 1357098297b2SJeff Mahoney /* 1358098297b2SJeff Mahoney * Everything in the tree is found by searching for it based on 1359098297b2SJeff Mahoney * its key. 1360098297b2SJeff Mahoney */ 1361f466c6fdSAl Viro struct reiserfs_key ih_key; 1362f466c6fdSAl Viro union { 1363098297b2SJeff Mahoney /* 1364098297b2SJeff Mahoney * The free space in the last unformatted node of an 1365098297b2SJeff Mahoney * indirect item if this is an indirect item. This 1366098297b2SJeff Mahoney * equals 0xFFFF iff this is a direct item or stat data 1367098297b2SJeff Mahoney * item. Note that the key, not this field, is used to 1368098297b2SJeff Mahoney * determine the item type, and thus which field this 1369098297b2SJeff Mahoney * union contains. 1370098297b2SJeff Mahoney */ 1371f466c6fdSAl Viro __le16 ih_free_space_reserved; 1372098297b2SJeff Mahoney 1373098297b2SJeff Mahoney /* 1374098297b2SJeff Mahoney * Iff this is a directory item, this field equals the 1375098297b2SJeff Mahoney * number of directory entries in the directory item. 1376098297b2SJeff Mahoney */ 1377f466c6fdSAl Viro __le16 ih_entry_count; 1378f466c6fdSAl Viro } __attribute__ ((__packed__)) u; 1379f466c6fdSAl Viro __le16 ih_item_len; /* total size of the item body */ 1380098297b2SJeff Mahoney 1381098297b2SJeff Mahoney /* an offset to the item body within the block */ 1382098297b2SJeff Mahoney __le16 ih_item_location; 1383098297b2SJeff Mahoney 1384098297b2SJeff Mahoney /* 1385098297b2SJeff Mahoney * 0 for all old items, 2 for new ones. Highest bit is set by fsck 1386098297b2SJeff Mahoney * temporary, cleaned after all done 1387098297b2SJeff Mahoney */ 1388098297b2SJeff Mahoney __le16 ih_version; 1389f466c6fdSAl Viro } __attribute__ ((__packed__)); 1390f466c6fdSAl Viro /* size of item header */ 1391f466c6fdSAl Viro #define IH_SIZE (sizeof(struct item_head)) 1392f466c6fdSAl Viro 1393f466c6fdSAl Viro #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved) 1394f466c6fdSAl Viro #define ih_version(ih) le16_to_cpu((ih)->ih_version) 1395f466c6fdSAl Viro #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count) 1396f466c6fdSAl Viro #define ih_location(ih) le16_to_cpu((ih)->ih_item_location) 1397f466c6fdSAl Viro #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len) 1398f466c6fdSAl Viro 1399f466c6fdSAl Viro #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0) 1400f466c6fdSAl Viro #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0) 1401f466c6fdSAl Viro #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0) 1402f466c6fdSAl Viro #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0) 1403f466c6fdSAl Viro #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0) 1404f466c6fdSAl Viro 1405f466c6fdSAl Viro #define unreachable_item(ih) (ih_version(ih) & (1 << 15)) 1406f466c6fdSAl Viro 1407f466c6fdSAl Viro #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih)) 1408f466c6fdSAl Viro #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val))) 1409f466c6fdSAl Viro 1410098297b2SJeff Mahoney /* 1411098297b2SJeff Mahoney * these operate on indirect items, where you've got an array of ints 1412098297b2SJeff Mahoney * at a possibly unaligned location. These are a noop on ia32 1413098297b2SJeff Mahoney * 1414098297b2SJeff Mahoney * p is the array of __u32, i is the index into the array, v is the value 1415098297b2SJeff Mahoney * to store there. 1416f466c6fdSAl Viro */ 1417f466c6fdSAl Viro #define get_block_num(p, i) get_unaligned_le32((p) + (i)) 1418f466c6fdSAl Viro #define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i)) 1419f466c6fdSAl Viro 1420098297b2SJeff Mahoney /* * in old version uniqueness field shows key type */ 1421f466c6fdSAl Viro #define V1_SD_UNIQUENESS 0 1422f466c6fdSAl Viro #define V1_INDIRECT_UNIQUENESS 0xfffffffe 1423f466c6fdSAl Viro #define V1_DIRECT_UNIQUENESS 0xffffffff 1424f466c6fdSAl Viro #define V1_DIRENTRY_UNIQUENESS 500 1425098297b2SJeff Mahoney #define V1_ANY_UNIQUENESS 555 /* FIXME: comment is required */ 1426f466c6fdSAl Viro 1427098297b2SJeff Mahoney /* here are conversion routines */ 1428f466c6fdSAl Viro static inline int uniqueness2type(__u32 uniqueness) CONSTF; 1429f466c6fdSAl Viro static inline int uniqueness2type(__u32 uniqueness) 1430f466c6fdSAl Viro { 1431f466c6fdSAl Viro switch ((int)uniqueness) { 1432f466c6fdSAl Viro case V1_SD_UNIQUENESS: 1433f466c6fdSAl Viro return TYPE_STAT_DATA; 1434f466c6fdSAl Viro case V1_INDIRECT_UNIQUENESS: 1435f466c6fdSAl Viro return TYPE_INDIRECT; 1436f466c6fdSAl Viro case V1_DIRECT_UNIQUENESS: 1437f466c6fdSAl Viro return TYPE_DIRECT; 1438f466c6fdSAl Viro case V1_DIRENTRY_UNIQUENESS: 1439f466c6fdSAl Viro return TYPE_DIRENTRY; 1440f466c6fdSAl Viro case V1_ANY_UNIQUENESS: 1441f466c6fdSAl Viro default: 1442f466c6fdSAl Viro return TYPE_ANY; 1443f466c6fdSAl Viro } 1444f466c6fdSAl Viro } 1445f466c6fdSAl Viro 1446f466c6fdSAl Viro static inline __u32 type2uniqueness(int type) CONSTF; 1447f466c6fdSAl Viro static inline __u32 type2uniqueness(int type) 1448f466c6fdSAl Viro { 1449f466c6fdSAl Viro switch (type) { 1450f466c6fdSAl Viro case TYPE_STAT_DATA: 1451f466c6fdSAl Viro return V1_SD_UNIQUENESS; 1452f466c6fdSAl Viro case TYPE_INDIRECT: 1453f466c6fdSAl Viro return V1_INDIRECT_UNIQUENESS; 1454f466c6fdSAl Viro case TYPE_DIRECT: 1455f466c6fdSAl Viro return V1_DIRECT_UNIQUENESS; 1456f466c6fdSAl Viro case TYPE_DIRENTRY: 1457f466c6fdSAl Viro return V1_DIRENTRY_UNIQUENESS; 1458f466c6fdSAl Viro case TYPE_ANY: 1459f466c6fdSAl Viro default: 1460f466c6fdSAl Viro return V1_ANY_UNIQUENESS; 1461f466c6fdSAl Viro } 1462f466c6fdSAl Viro } 1463f466c6fdSAl Viro 1464098297b2SJeff Mahoney /* 1465098297b2SJeff Mahoney * key is pointer to on disk key which is stored in le, result is cpu, 1466098297b2SJeff Mahoney * there is no way to get version of object from key, so, provide 1467098297b2SJeff Mahoney * version to these defines 1468098297b2SJeff Mahoney */ 1469f466c6fdSAl Viro static inline loff_t le_key_k_offset(int version, 1470f466c6fdSAl Viro const struct reiserfs_key *key) 1471f466c6fdSAl Viro { 1472f466c6fdSAl Viro return (version == KEY_FORMAT_3_5) ? 1473f466c6fdSAl Viro le32_to_cpu(key->u.k_offset_v1.k_offset) : 1474f466c6fdSAl Viro offset_v2_k_offset(&(key->u.k_offset_v2)); 1475f466c6fdSAl Viro } 1476f466c6fdSAl Viro 1477f466c6fdSAl Viro static inline loff_t le_ih_k_offset(const struct item_head *ih) 1478f466c6fdSAl Viro { 1479f466c6fdSAl Viro return le_key_k_offset(ih_version(ih), &(ih->ih_key)); 1480f466c6fdSAl Viro } 1481f466c6fdSAl Viro 1482f466c6fdSAl Viro static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key) 1483f466c6fdSAl Viro { 14844cf5f7adSJeff Mahoney if (version == KEY_FORMAT_3_5) { 14854cf5f7adSJeff Mahoney loff_t val = le32_to_cpu(key->u.k_offset_v1.k_uniqueness); 14864cf5f7adSJeff Mahoney return uniqueness2type(val); 14874cf5f7adSJeff Mahoney } else 14884cf5f7adSJeff Mahoney return offset_v2_k_type(&(key->u.k_offset_v2)); 1489f466c6fdSAl Viro } 1490f466c6fdSAl Viro 1491f466c6fdSAl Viro static inline loff_t le_ih_k_type(const struct item_head *ih) 1492f466c6fdSAl Viro { 1493f466c6fdSAl Viro return le_key_k_type(ih_version(ih), &(ih->ih_key)); 1494f466c6fdSAl Viro } 1495f466c6fdSAl Viro 1496f466c6fdSAl Viro static inline void set_le_key_k_offset(int version, struct reiserfs_key *key, 1497f466c6fdSAl Viro loff_t offset) 1498f466c6fdSAl Viro { 14994cf5f7adSJeff Mahoney if (version == KEY_FORMAT_3_5) 15004cf5f7adSJeff Mahoney key->u.k_offset_v1.k_offset = cpu_to_le32(offset); 15014cf5f7adSJeff Mahoney else 15024cf5f7adSJeff Mahoney set_offset_v2_k_offset(&key->u.k_offset_v2, offset); 15034cf5f7adSJeff Mahoney } 15044cf5f7adSJeff Mahoney 15054cf5f7adSJeff Mahoney static inline void add_le_key_k_offset(int version, struct reiserfs_key *key, 15064cf5f7adSJeff Mahoney loff_t offset) 15074cf5f7adSJeff Mahoney { 15084cf5f7adSJeff Mahoney set_le_key_k_offset(version, key, 15094cf5f7adSJeff Mahoney le_key_k_offset(version, key) + offset); 15104cf5f7adSJeff Mahoney } 15114cf5f7adSJeff Mahoney 15124cf5f7adSJeff Mahoney static inline void add_le_ih_k_offset(struct item_head *ih, loff_t offset) 15134cf5f7adSJeff Mahoney { 15144cf5f7adSJeff Mahoney add_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset); 1515f466c6fdSAl Viro } 1516f466c6fdSAl Viro 1517f466c6fdSAl Viro static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset) 1518f466c6fdSAl Viro { 1519f466c6fdSAl Viro set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset); 1520f466c6fdSAl Viro } 1521f466c6fdSAl Viro 1522f466c6fdSAl Viro static inline void set_le_key_k_type(int version, struct reiserfs_key *key, 1523f466c6fdSAl Viro int type) 1524f466c6fdSAl Viro { 15254cf5f7adSJeff Mahoney if (version == KEY_FORMAT_3_5) { 15264cf5f7adSJeff Mahoney type = type2uniqueness(type); 15274cf5f7adSJeff Mahoney key->u.k_offset_v1.k_uniqueness = cpu_to_le32(type); 15284cf5f7adSJeff Mahoney } else 15294cf5f7adSJeff Mahoney set_offset_v2_k_type(&key->u.k_offset_v2, type); 1530f466c6fdSAl Viro } 1531f466c6fdSAl Viro 1532f466c6fdSAl Viro static inline void set_le_ih_k_type(struct item_head *ih, int type) 1533f466c6fdSAl Viro { 1534f466c6fdSAl Viro set_le_key_k_type(ih_version(ih), &(ih->ih_key), type); 1535f466c6fdSAl Viro } 1536f466c6fdSAl Viro 1537f466c6fdSAl Viro static inline int is_direntry_le_key(int version, struct reiserfs_key *key) 1538f466c6fdSAl Viro { 1539f466c6fdSAl Viro return le_key_k_type(version, key) == TYPE_DIRENTRY; 1540f466c6fdSAl Viro } 1541f466c6fdSAl Viro 1542f466c6fdSAl Viro static inline int is_direct_le_key(int version, struct reiserfs_key *key) 1543f466c6fdSAl Viro { 1544f466c6fdSAl Viro return le_key_k_type(version, key) == TYPE_DIRECT; 1545f466c6fdSAl Viro } 1546f466c6fdSAl Viro 1547f466c6fdSAl Viro static inline int is_indirect_le_key(int version, struct reiserfs_key *key) 1548f466c6fdSAl Viro { 1549f466c6fdSAl Viro return le_key_k_type(version, key) == TYPE_INDIRECT; 1550f466c6fdSAl Viro } 1551f466c6fdSAl Viro 1552f466c6fdSAl Viro static inline int is_statdata_le_key(int version, struct reiserfs_key *key) 1553f466c6fdSAl Viro { 1554f466c6fdSAl Viro return le_key_k_type(version, key) == TYPE_STAT_DATA; 1555f466c6fdSAl Viro } 1556f466c6fdSAl Viro 1557098297b2SJeff Mahoney /* item header has version. */ 1558f466c6fdSAl Viro static inline int is_direntry_le_ih(struct item_head *ih) 1559f466c6fdSAl Viro { 1560f466c6fdSAl Viro return is_direntry_le_key(ih_version(ih), &ih->ih_key); 1561f466c6fdSAl Viro } 1562f466c6fdSAl Viro 1563f466c6fdSAl Viro static inline int is_direct_le_ih(struct item_head *ih) 1564f466c6fdSAl Viro { 1565f466c6fdSAl Viro return is_direct_le_key(ih_version(ih), &ih->ih_key); 1566f466c6fdSAl Viro } 1567f466c6fdSAl Viro 1568f466c6fdSAl Viro static inline int is_indirect_le_ih(struct item_head *ih) 1569f466c6fdSAl Viro { 1570f466c6fdSAl Viro return is_indirect_le_key(ih_version(ih), &ih->ih_key); 1571f466c6fdSAl Viro } 1572f466c6fdSAl Viro 1573f466c6fdSAl Viro static inline int is_statdata_le_ih(struct item_head *ih) 1574f466c6fdSAl Viro { 1575f466c6fdSAl Viro return is_statdata_le_key(ih_version(ih), &ih->ih_key); 1576f466c6fdSAl Viro } 1577f466c6fdSAl Viro 1578098297b2SJeff Mahoney /* key is pointer to cpu key, result is cpu */ 1579f466c6fdSAl Viro static inline loff_t cpu_key_k_offset(const struct cpu_key *key) 1580f466c6fdSAl Viro { 1581f466c6fdSAl Viro return key->on_disk_key.k_offset; 1582f466c6fdSAl Viro } 1583f466c6fdSAl Viro 1584f466c6fdSAl Viro static inline loff_t cpu_key_k_type(const struct cpu_key *key) 1585f466c6fdSAl Viro { 1586f466c6fdSAl Viro return key->on_disk_key.k_type; 1587f466c6fdSAl Viro } 1588f466c6fdSAl Viro 1589f466c6fdSAl Viro static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset) 1590f466c6fdSAl Viro { 1591f466c6fdSAl Viro key->on_disk_key.k_offset = offset; 1592f466c6fdSAl Viro } 1593f466c6fdSAl Viro 1594f466c6fdSAl Viro static inline void set_cpu_key_k_type(struct cpu_key *key, int type) 1595f466c6fdSAl Viro { 1596f466c6fdSAl Viro key->on_disk_key.k_type = type; 1597f466c6fdSAl Viro } 1598f466c6fdSAl Viro 1599f466c6fdSAl Viro static inline void cpu_key_k_offset_dec(struct cpu_key *key) 1600f466c6fdSAl Viro { 1601f466c6fdSAl Viro key->on_disk_key.k_offset--; 1602f466c6fdSAl Viro } 1603f466c6fdSAl Viro 1604f466c6fdSAl Viro #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY) 1605f466c6fdSAl Viro #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT) 1606f466c6fdSAl Viro #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT) 1607f466c6fdSAl Viro #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA) 1608f466c6fdSAl Viro 1609f466c6fdSAl Viro /* are these used ? */ 1610f466c6fdSAl Viro #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key))) 1611f466c6fdSAl Viro #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key))) 1612f466c6fdSAl Viro #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key))) 1613f466c6fdSAl Viro #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key))) 1614f466c6fdSAl Viro 1615f466c6fdSAl Viro #define I_K_KEY_IN_ITEM(ih, key, n_blocksize) \ 1616f466c6fdSAl Viro (!COMP_SHORT_KEYS(ih, key) && \ 1617f466c6fdSAl Viro I_OFF_BYTE_IN_ITEM(ih, k_offset(key), n_blocksize)) 1618f466c6fdSAl Viro 1619f466c6fdSAl Viro /* maximal length of item */ 1620f466c6fdSAl Viro #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE) 1621f466c6fdSAl Viro #define MIN_ITEM_LEN 1 1622f466c6fdSAl Viro 1623f466c6fdSAl Viro /* object identifier for root dir */ 1624f466c6fdSAl Viro #define REISERFS_ROOT_OBJECTID 2 1625f466c6fdSAl Viro #define REISERFS_ROOT_PARENT_OBJECTID 1 1626f466c6fdSAl Viro 1627f466c6fdSAl Viro extern struct reiserfs_key root_key; 1628f466c6fdSAl Viro 1629f466c6fdSAl Viro /* 1630f466c6fdSAl Viro * Picture represents a leaf of the S+tree 1631f466c6fdSAl Viro * ______________________________________________________ 1632f466c6fdSAl Viro * | | Array of | | | 1633f466c6fdSAl Viro * |Block | Object-Item | F r e e | Objects- | 1634f466c6fdSAl Viro * | head | Headers | S p a c e | Items | 1635f466c6fdSAl Viro * |______|_______________|___________________|___________| 1636f466c6fdSAl Viro */ 1637f466c6fdSAl Viro 1638098297b2SJeff Mahoney /* 1639098297b2SJeff Mahoney * Header of a disk block. More precisely, header of a formatted leaf 1640098297b2SJeff Mahoney * or internal node, and not the header of an unformatted node. 1641098297b2SJeff Mahoney */ 1642f466c6fdSAl Viro struct block_head { 1643f466c6fdSAl Viro __le16 blk_level; /* Level of a block in the tree. */ 1644f466c6fdSAl Viro __le16 blk_nr_item; /* Number of keys/items in a block. */ 1645f466c6fdSAl Viro __le16 blk_free_space; /* Block free space in bytes. */ 1646f466c6fdSAl Viro __le16 blk_reserved; 1647f466c6fdSAl Viro /* dump this in v4/planA */ 1648098297b2SJeff Mahoney 1649098297b2SJeff Mahoney /* kept only for compatibility */ 1650098297b2SJeff Mahoney struct reiserfs_key blk_right_delim_key; 1651f466c6fdSAl Viro }; 1652f466c6fdSAl Viro 1653f466c6fdSAl Viro #define BLKH_SIZE (sizeof(struct block_head)) 1654f466c6fdSAl Viro #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level)) 1655f466c6fdSAl Viro #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item)) 1656f466c6fdSAl Viro #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space)) 1657f466c6fdSAl Viro #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved)) 1658f466c6fdSAl Viro #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val)) 1659f466c6fdSAl Viro #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val)) 1660f466c6fdSAl Viro #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val)) 1661f466c6fdSAl Viro #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val)) 1662f466c6fdSAl Viro #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key) 1663f466c6fdSAl Viro #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val) 1664f466c6fdSAl Viro 1665098297b2SJeff Mahoney /* values for blk_level field of the struct block_head */ 1666f466c6fdSAl Viro 1667098297b2SJeff Mahoney /* 1668098297b2SJeff Mahoney * When node gets removed from the tree its blk_level is set to FREE_LEVEL. 1669098297b2SJeff Mahoney * It is then used to see whether the node is still in the tree 1670098297b2SJeff Mahoney */ 1671098297b2SJeff Mahoney #define FREE_LEVEL 0 1672f466c6fdSAl Viro 1673f466c6fdSAl Viro #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */ 1674f466c6fdSAl Viro 1675098297b2SJeff Mahoney /* 1676098297b2SJeff Mahoney * Given the buffer head of a formatted node, resolve to the 1677098297b2SJeff Mahoney * block head of that node. 1678098297b2SJeff Mahoney */ 1679f466c6fdSAl Viro #define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data)) 1680f466c6fdSAl Viro /* Number of items that are in buffer. */ 1681f466c6fdSAl Viro #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh))) 1682f466c6fdSAl Viro #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh))) 1683f466c6fdSAl Viro #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh))) 1684f466c6fdSAl Viro 1685f466c6fdSAl Viro #define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0) 1686f466c6fdSAl Viro #define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0) 1687f466c6fdSAl Viro #define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0) 1688f466c6fdSAl Viro 1689f466c6fdSAl Viro /* Get right delimiting key. -- little endian */ 1690f466c6fdSAl Viro #define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh)))) 1691f466c6fdSAl Viro 1692f466c6fdSAl Viro /* Does the buffer contain a disk leaf. */ 1693f466c6fdSAl Viro #define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL) 1694f466c6fdSAl Viro 1695f466c6fdSAl Viro /* Does the buffer contain a disk internal node */ 1696f466c6fdSAl Viro #define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \ 1697f466c6fdSAl Viro && B_LEVEL(bh) <= MAX_HEIGHT) 1698f466c6fdSAl Viro 1699098297b2SJeff Mahoney /*************************************************************************** 1700098297b2SJeff Mahoney * STAT DATA * 1701098297b2SJeff Mahoney ***************************************************************************/ 1702f466c6fdSAl Viro 1703098297b2SJeff Mahoney /* 1704098297b2SJeff Mahoney * old stat data is 32 bytes long. We are going to distinguish new one by 1705098297b2SJeff Mahoney * different size 1706098297b2SJeff Mahoney */ 1707f466c6fdSAl Viro struct stat_data_v1 { 1708f466c6fdSAl Viro __le16 sd_mode; /* file type, permissions */ 1709f466c6fdSAl Viro __le16 sd_nlink; /* number of hard links */ 1710f466c6fdSAl Viro __le16 sd_uid; /* owner */ 1711f466c6fdSAl Viro __le16 sd_gid; /* group */ 1712f466c6fdSAl Viro __le32 sd_size; /* file size */ 1713f466c6fdSAl Viro __le32 sd_atime; /* time of last access */ 1714f466c6fdSAl Viro __le32 sd_mtime; /* time file was last modified */ 1715098297b2SJeff Mahoney 1716098297b2SJeff Mahoney /* 1717098297b2SJeff Mahoney * time inode (stat data) was last changed 1718098297b2SJeff Mahoney * (except changes to sd_atime and sd_mtime) 1719098297b2SJeff Mahoney */ 1720098297b2SJeff Mahoney __le32 sd_ctime; 1721f466c6fdSAl Viro union { 1722f466c6fdSAl Viro __le32 sd_rdev; 1723f466c6fdSAl Viro __le32 sd_blocks; /* number of blocks file uses */ 1724f466c6fdSAl Viro } __attribute__ ((__packed__)) u; 1725098297b2SJeff Mahoney 1726098297b2SJeff Mahoney /* 1727098297b2SJeff Mahoney * first byte of file which is stored in a direct item: except that if 1728098297b2SJeff Mahoney * it equals 1 it is a symlink and if it equals ~(__u32)0 there is no 1729098297b2SJeff Mahoney * direct item. The existence of this field really grates on me. 1730098297b2SJeff Mahoney * Let's replace it with a macro based on sd_size and our tail 1731098297b2SJeff Mahoney * suppression policy. Someday. -Hans 1732098297b2SJeff Mahoney */ 1733098297b2SJeff Mahoney __le32 sd_first_direct_byte; 1734f466c6fdSAl Viro } __attribute__ ((__packed__)); 1735f466c6fdSAl Viro 1736f466c6fdSAl Viro #define SD_V1_SIZE (sizeof(struct stat_data_v1)) 1737f466c6fdSAl Viro #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5) 1738f466c6fdSAl Viro #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode)) 1739f466c6fdSAl Viro #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v)) 1740f466c6fdSAl Viro #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink)) 1741f466c6fdSAl Viro #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v)) 1742f466c6fdSAl Viro #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid)) 1743f466c6fdSAl Viro #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v)) 1744f466c6fdSAl Viro #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid)) 1745f466c6fdSAl Viro #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v)) 1746f466c6fdSAl Viro #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size)) 1747f466c6fdSAl Viro #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v)) 1748f466c6fdSAl Viro #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime)) 1749f466c6fdSAl Viro #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v)) 1750f466c6fdSAl Viro #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime)) 1751f466c6fdSAl Viro #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v)) 1752f466c6fdSAl Viro #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime)) 1753f466c6fdSAl Viro #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v)) 1754f466c6fdSAl Viro #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev)) 1755f466c6fdSAl Viro #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v)) 1756f466c6fdSAl Viro #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks)) 1757f466c6fdSAl Viro #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v)) 1758f466c6fdSAl Viro #define sd_v1_first_direct_byte(sdp) \ 1759f466c6fdSAl Viro (le32_to_cpu((sdp)->sd_first_direct_byte)) 1760f466c6fdSAl Viro #define set_sd_v1_first_direct_byte(sdp,v) \ 1761f466c6fdSAl Viro ((sdp)->sd_first_direct_byte = cpu_to_le32(v)) 1762f466c6fdSAl Viro 1763f466c6fdSAl Viro /* inode flags stored in sd_attrs (nee sd_reserved) */ 1764f466c6fdSAl Viro 1765098297b2SJeff Mahoney /* 1766098297b2SJeff Mahoney * we want common flags to have the same values as in ext2, 1767098297b2SJeff Mahoney * so chattr(1) will work without problems 1768098297b2SJeff Mahoney */ 1769f466c6fdSAl Viro #define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL 1770f466c6fdSAl Viro #define REISERFS_APPEND_FL FS_APPEND_FL 1771f466c6fdSAl Viro #define REISERFS_SYNC_FL FS_SYNC_FL 1772f466c6fdSAl Viro #define REISERFS_NOATIME_FL FS_NOATIME_FL 1773f466c6fdSAl Viro #define REISERFS_NODUMP_FL FS_NODUMP_FL 1774f466c6fdSAl Viro #define REISERFS_SECRM_FL FS_SECRM_FL 1775f466c6fdSAl Viro #define REISERFS_UNRM_FL FS_UNRM_FL 1776f466c6fdSAl Viro #define REISERFS_COMPR_FL FS_COMPR_FL 1777f466c6fdSAl Viro #define REISERFS_NOTAIL_FL FS_NOTAIL_FL 1778f466c6fdSAl Viro 1779f466c6fdSAl Viro /* persistent flags that file inherits from the parent directory */ 1780f466c6fdSAl Viro #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \ 1781f466c6fdSAl Viro REISERFS_SYNC_FL | \ 1782f466c6fdSAl Viro REISERFS_NOATIME_FL | \ 1783f466c6fdSAl Viro REISERFS_NODUMP_FL | \ 1784f466c6fdSAl Viro REISERFS_SECRM_FL | \ 1785f466c6fdSAl Viro REISERFS_COMPR_FL | \ 1786f466c6fdSAl Viro REISERFS_NOTAIL_FL ) 1787f466c6fdSAl Viro 1788098297b2SJeff Mahoney /* 1789098297b2SJeff Mahoney * Stat Data on disk (reiserfs version of UFS disk inode minus the 1790098297b2SJeff Mahoney * address blocks) 1791098297b2SJeff Mahoney */ 1792f466c6fdSAl Viro struct stat_data { 1793f466c6fdSAl Viro __le16 sd_mode; /* file type, permissions */ 1794f466c6fdSAl Viro __le16 sd_attrs; /* persistent inode flags */ 1795f466c6fdSAl Viro __le32 sd_nlink; /* number of hard links */ 1796f466c6fdSAl Viro __le64 sd_size; /* file size */ 1797f466c6fdSAl Viro __le32 sd_uid; /* owner */ 1798f466c6fdSAl Viro __le32 sd_gid; /* group */ 1799f466c6fdSAl Viro __le32 sd_atime; /* time of last access */ 1800f466c6fdSAl Viro __le32 sd_mtime; /* time file was last modified */ 1801098297b2SJeff Mahoney 1802098297b2SJeff Mahoney /* 1803098297b2SJeff Mahoney * time inode (stat data) was last changed 1804098297b2SJeff Mahoney * (except changes to sd_atime and sd_mtime) 1805098297b2SJeff Mahoney */ 1806098297b2SJeff Mahoney __le32 sd_ctime; 1807f466c6fdSAl Viro __le32 sd_blocks; 1808f466c6fdSAl Viro union { 1809f466c6fdSAl Viro __le32 sd_rdev; 1810f466c6fdSAl Viro __le32 sd_generation; 1811f466c6fdSAl Viro } __attribute__ ((__packed__)) u; 1812f466c6fdSAl Viro } __attribute__ ((__packed__)); 1813098297b2SJeff Mahoney 1814098297b2SJeff Mahoney /* this is 44 bytes long */ 1815f466c6fdSAl Viro #define SD_SIZE (sizeof(struct stat_data)) 1816f466c6fdSAl Viro #define SD_V2_SIZE SD_SIZE 1817f466c6fdSAl Viro #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6) 1818f466c6fdSAl Viro #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode)) 1819f466c6fdSAl Viro #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v)) 1820f466c6fdSAl Viro /* sd_reserved */ 1821f466c6fdSAl Viro /* set_sd_reserved */ 1822f466c6fdSAl Viro #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink)) 1823f466c6fdSAl Viro #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v)) 1824f466c6fdSAl Viro #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size)) 1825f466c6fdSAl Viro #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v)) 1826f466c6fdSAl Viro #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid)) 1827f466c6fdSAl Viro #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v)) 1828f466c6fdSAl Viro #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid)) 1829f466c6fdSAl Viro #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v)) 1830f466c6fdSAl Viro #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime)) 1831f466c6fdSAl Viro #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v)) 1832f466c6fdSAl Viro #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime)) 1833f466c6fdSAl Viro #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v)) 1834f466c6fdSAl Viro #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime)) 1835f466c6fdSAl Viro #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v)) 1836f466c6fdSAl Viro #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks)) 1837f466c6fdSAl Viro #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v)) 1838f466c6fdSAl Viro #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev)) 1839f466c6fdSAl Viro #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v)) 1840f466c6fdSAl Viro #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation)) 1841f466c6fdSAl Viro #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v)) 1842f466c6fdSAl Viro #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs)) 1843f466c6fdSAl Viro #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v)) 1844f466c6fdSAl Viro 1845098297b2SJeff Mahoney /*************************************************************************** 1846098297b2SJeff Mahoney * DIRECTORY STRUCTURE * 1847098297b2SJeff Mahoney ***************************************************************************/ 1848f466c6fdSAl Viro /* 1849098297b2SJeff Mahoney * Picture represents the structure of directory items 1850098297b2SJeff Mahoney * ________________________________________________ 1851098297b2SJeff Mahoney * | Array of | | | | | | 1852098297b2SJeff Mahoney * | directory |N-1| N-2 | .... | 1st |0th| 1853098297b2SJeff Mahoney * | entry headers | | | | | | 1854098297b2SJeff Mahoney * |_______________|___|_____|________|_______|___| 1855098297b2SJeff Mahoney * <---- directory entries ------> 1856098297b2SJeff Mahoney * 1857098297b2SJeff Mahoney * First directory item has k_offset component 1. We store "." and ".." 1858098297b2SJeff Mahoney * in one item, always, we never split "." and ".." into differing 1859098297b2SJeff Mahoney * items. This makes, among other things, the code for removing 1860098297b2SJeff Mahoney * directories simpler. 1861098297b2SJeff Mahoney */ 1862f466c6fdSAl Viro #define SD_OFFSET 0 1863f466c6fdSAl Viro #define SD_UNIQUENESS 0 1864f466c6fdSAl Viro #define DOT_OFFSET 1 1865f466c6fdSAl Viro #define DOT_DOT_OFFSET 2 1866f466c6fdSAl Viro #define DIRENTRY_UNIQUENESS 500 1867f466c6fdSAl Viro 1868f466c6fdSAl Viro #define FIRST_ITEM_OFFSET 1 1869f466c6fdSAl Viro 1870f466c6fdSAl Viro /* 1871098297b2SJeff Mahoney * Q: How to get key of object pointed to by entry from entry? 1872098297b2SJeff Mahoney * 1873098297b2SJeff Mahoney * A: Each directory entry has its header. This header has deh_dir_id 1874098297b2SJeff Mahoney * and deh_objectid fields, those are key of object, entry points to 1875098297b2SJeff Mahoney */ 1876f466c6fdSAl Viro 1877098297b2SJeff Mahoney /* 1878098297b2SJeff Mahoney * NOT IMPLEMENTED: 1879098297b2SJeff Mahoney * Directory will someday contain stat data of object 1880098297b2SJeff Mahoney */ 1881f466c6fdSAl Viro 1882f466c6fdSAl Viro struct reiserfs_de_head { 1883f466c6fdSAl Viro __le32 deh_offset; /* third component of the directory entry key */ 1884098297b2SJeff Mahoney 1885098297b2SJeff Mahoney /* 1886098297b2SJeff Mahoney * objectid of the parent directory of the object, that is referenced 1887098297b2SJeff Mahoney * by directory entry 1888098297b2SJeff Mahoney */ 1889098297b2SJeff Mahoney __le32 deh_dir_id; 1890098297b2SJeff Mahoney 1891098297b2SJeff Mahoney /* objectid of the object, that is referenced by directory entry */ 1892098297b2SJeff Mahoney __le32 deh_objectid; 1893f466c6fdSAl Viro __le16 deh_location; /* offset of name in the whole item */ 1894098297b2SJeff Mahoney 1895098297b2SJeff Mahoney /* 1896098297b2SJeff Mahoney * whether 1) entry contains stat data (for future), and 1897098297b2SJeff Mahoney * 2) whether entry is hidden (unlinked) 1898098297b2SJeff Mahoney */ 1899098297b2SJeff Mahoney __le16 deh_state; 1900f466c6fdSAl Viro } __attribute__ ((__packed__)); 1901f466c6fdSAl Viro #define DEH_SIZE sizeof(struct reiserfs_de_head) 1902f466c6fdSAl Viro #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset)) 1903f466c6fdSAl Viro #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id)) 1904f466c6fdSAl Viro #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid)) 1905f466c6fdSAl Viro #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location)) 1906f466c6fdSAl Viro #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state)) 1907f466c6fdSAl Viro 1908f466c6fdSAl Viro #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v))) 1909f466c6fdSAl Viro #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v))) 1910f466c6fdSAl Viro #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v))) 1911f466c6fdSAl Viro #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v))) 1912f466c6fdSAl Viro #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v))) 1913f466c6fdSAl Viro 1914f466c6fdSAl Viro /* empty directory contains two entries "." and ".." and their headers */ 1915f466c6fdSAl Viro #define EMPTY_DIR_SIZE \ 1916f466c6fdSAl Viro (DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen (".."))) 1917f466c6fdSAl Viro 1918f466c6fdSAl Viro /* old format directories have this size when empty */ 1919f466c6fdSAl Viro #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3) 1920f466c6fdSAl Viro 1921f466c6fdSAl Viro #define DEH_Statdata 0 /* not used now */ 1922f466c6fdSAl Viro #define DEH_Visible 2 1923f466c6fdSAl Viro 1924f466c6fdSAl Viro /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */ 1925f466c6fdSAl Viro #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__) 1926f466c6fdSAl Viro # define ADDR_UNALIGNED_BITS (3) 1927f466c6fdSAl Viro #endif 1928f466c6fdSAl Viro 1929098297b2SJeff Mahoney /* 1930098297b2SJeff Mahoney * These are only used to manipulate deh_state. 1931f466c6fdSAl Viro * Because of this, we'll use the ext2_ bit routines, 1932098297b2SJeff Mahoney * since they are little endian 1933098297b2SJeff Mahoney */ 1934f466c6fdSAl Viro #ifdef ADDR_UNALIGNED_BITS 1935f466c6fdSAl Viro 1936f466c6fdSAl Viro # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1))) 1937f466c6fdSAl Viro # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3) 1938f466c6fdSAl Viro 1939f466c6fdSAl Viro # define set_bit_unaligned(nr, addr) \ 1940f466c6fdSAl Viro __test_and_set_bit_le((nr) + unaligned_offset(addr), aligned_address(addr)) 1941f466c6fdSAl Viro # define clear_bit_unaligned(nr, addr) \ 1942f466c6fdSAl Viro __test_and_clear_bit_le((nr) + unaligned_offset(addr), aligned_address(addr)) 1943f466c6fdSAl Viro # define test_bit_unaligned(nr, addr) \ 1944f466c6fdSAl Viro test_bit_le((nr) + unaligned_offset(addr), aligned_address(addr)) 1945f466c6fdSAl Viro 1946f466c6fdSAl Viro #else 1947f466c6fdSAl Viro 1948f466c6fdSAl Viro # define set_bit_unaligned(nr, addr) __test_and_set_bit_le(nr, addr) 1949f466c6fdSAl Viro # define clear_bit_unaligned(nr, addr) __test_and_clear_bit_le(nr, addr) 1950f466c6fdSAl Viro # define test_bit_unaligned(nr, addr) test_bit_le(nr, addr) 1951f466c6fdSAl Viro 1952f466c6fdSAl Viro #endif 1953f466c6fdSAl Viro 1954f466c6fdSAl Viro #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) 1955f466c6fdSAl Viro #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) 1956f466c6fdSAl Viro #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state)) 1957f466c6fdSAl Viro #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state)) 1958f466c6fdSAl Viro 1959f466c6fdSAl Viro #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state)) 1960f466c6fdSAl Viro #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state)) 1961f466c6fdSAl Viro #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state)) 1962f466c6fdSAl Viro 1963f466c6fdSAl Viro extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid, 1964f466c6fdSAl Viro __le32 par_dirid, __le32 par_objid); 1965f466c6fdSAl Viro extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid, 1966f466c6fdSAl Viro __le32 par_dirid, __le32 par_objid); 1967f466c6fdSAl Viro 1968098297b2SJeff Mahoney /* two entries per block (at least) */ 1969f466c6fdSAl Viro #define REISERFS_MAX_NAME(block_size) 255 1970f466c6fdSAl Viro 1971098297b2SJeff Mahoney /* 1972098297b2SJeff Mahoney * this structure is used for operations on directory entries. It is 1973098297b2SJeff Mahoney * not a disk structure. 1974098297b2SJeff Mahoney * 1975098297b2SJeff Mahoney * When reiserfs_find_entry or search_by_entry_key find directory 1976098297b2SJeff Mahoney * entry, they return filled reiserfs_dir_entry structure 1977098297b2SJeff Mahoney */ 1978f466c6fdSAl Viro struct reiserfs_dir_entry { 1979f466c6fdSAl Viro struct buffer_head *de_bh; 1980f466c6fdSAl Viro int de_item_num; 1981f466c6fdSAl Viro struct item_head *de_ih; 1982f466c6fdSAl Viro int de_entry_num; 1983f466c6fdSAl Viro struct reiserfs_de_head *de_deh; 1984f466c6fdSAl Viro int de_entrylen; 1985f466c6fdSAl Viro int de_namelen; 1986f466c6fdSAl Viro char *de_name; 1987f466c6fdSAl Viro unsigned long *de_gen_number_bit_string; 1988f466c6fdSAl Viro 1989f466c6fdSAl Viro __u32 de_dir_id; 1990f466c6fdSAl Viro __u32 de_objectid; 1991f466c6fdSAl Viro 1992f466c6fdSAl Viro struct cpu_key de_entry_key; 1993f466c6fdSAl Viro }; 1994f466c6fdSAl Viro 1995098297b2SJeff Mahoney /* 1996098297b2SJeff Mahoney * these defines are useful when a particular member of 1997098297b2SJeff Mahoney * a reiserfs_dir_entry is needed 1998098297b2SJeff Mahoney */ 1999f466c6fdSAl Viro 2000f466c6fdSAl Viro /* pointer to file name, stored in entry */ 20014cf5f7adSJeff Mahoney #define B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh) \ 20024cf5f7adSJeff Mahoney (ih_item_body(bh, ih) + deh_location(deh)) 2003f466c6fdSAl Viro 2004f466c6fdSAl Viro /* length of name */ 2005f466c6fdSAl Viro #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \ 2006f466c6fdSAl Viro (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0)) 2007f466c6fdSAl Viro 2008f466c6fdSAl Viro /* hash value occupies bits from 7 up to 30 */ 2009f466c6fdSAl Viro #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL) 2010f466c6fdSAl Viro /* generation number occupies 7 bits starting from 0 up to 6 */ 2011f466c6fdSAl Viro #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL) 2012f466c6fdSAl Viro #define MAX_GENERATION_NUMBER 127 2013f466c6fdSAl Viro 2014f466c6fdSAl Viro #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number)) 2015f466c6fdSAl Viro 2016f466c6fdSAl Viro /* 2017f466c6fdSAl Viro * Picture represents an internal node of the reiserfs tree 2018f466c6fdSAl Viro * ______________________________________________________ 2019f466c6fdSAl Viro * | | Array of | Array of | Free | 2020f466c6fdSAl Viro * |block | keys | pointers | space | 2021f466c6fdSAl Viro * | head | N | N+1 | | 2022f466c6fdSAl Viro * |______|_______________|___________________|___________| 2023f466c6fdSAl Viro */ 2024f466c6fdSAl Viro 2025098297b2SJeff Mahoney /*************************************************************************** 2026098297b2SJeff Mahoney * DISK CHILD * 2027098297b2SJeff Mahoney ***************************************************************************/ 2028098297b2SJeff Mahoney /* 2029098297b2SJeff Mahoney * Disk child pointer: 2030098297b2SJeff Mahoney * The pointer from an internal node of the tree to a node that is on disk. 2031098297b2SJeff Mahoney */ 2032f466c6fdSAl Viro struct disk_child { 2033f466c6fdSAl Viro __le32 dc_block_number; /* Disk child's block number. */ 2034f466c6fdSAl Viro __le16 dc_size; /* Disk child's used space. */ 2035f466c6fdSAl Viro __le16 dc_reserved; 2036f466c6fdSAl Viro }; 2037f466c6fdSAl Viro 2038f466c6fdSAl Viro #define DC_SIZE (sizeof(struct disk_child)) 2039f466c6fdSAl Viro #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number)) 2040f466c6fdSAl Viro #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size)) 2041f466c6fdSAl Viro #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0) 2042f466c6fdSAl Viro #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0) 2043f466c6fdSAl Viro 2044f466c6fdSAl Viro /* Get disk child by buffer header and position in the tree node. */ 2045f466c6fdSAl Viro #define B_N_CHILD(bh, n_pos) ((struct disk_child *)\ 2046f466c6fdSAl Viro ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos))) 2047f466c6fdSAl Viro 2048f466c6fdSAl Viro /* Get disk child number by buffer header and position in the tree node. */ 2049f466c6fdSAl Viro #define B_N_CHILD_NUM(bh, n_pos) (dc_block_number(B_N_CHILD(bh, n_pos))) 2050f466c6fdSAl Viro #define PUT_B_N_CHILD_NUM(bh, n_pos, val) \ 2051f466c6fdSAl Viro (put_dc_block_number(B_N_CHILD(bh, n_pos), val)) 2052f466c6fdSAl Viro 2053f466c6fdSAl Viro /* maximal value of field child_size in structure disk_child */ 2054f466c6fdSAl Viro /* child size is the combined size of all items and their headers */ 2055f466c6fdSAl Viro #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE )) 2056f466c6fdSAl Viro 2057f466c6fdSAl Viro /* amount of used space in buffer (not including block head) */ 2058f466c6fdSAl Viro #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur))) 2059f466c6fdSAl Viro 2060f466c6fdSAl Viro /* max and min number of keys in internal node */ 2061f466c6fdSAl Viro #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) ) 2062f466c6fdSAl Viro #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2) 2063f466c6fdSAl Viro 2064098297b2SJeff Mahoney /*************************************************************************** 2065098297b2SJeff Mahoney * PATH STRUCTURES AND DEFINES * 2066098297b2SJeff Mahoney ***************************************************************************/ 2067f466c6fdSAl Viro 2068098297b2SJeff Mahoney /* 2069098297b2SJeff Mahoney * search_by_key fills up the path from the root to the leaf as it descends 2070098297b2SJeff Mahoney * the tree looking for the key. It uses reiserfs_bread to try to find 2071098297b2SJeff Mahoney * buffers in the cache given their block number. If it does not find 2072098297b2SJeff Mahoney * them in the cache it reads them from disk. For each node search_by_key 2073098297b2SJeff Mahoney * finds using reiserfs_bread it then uses bin_search to look through that 2074098297b2SJeff Mahoney * node. bin_search will find the position of the block_number of the next 2075098297b2SJeff Mahoney * node if it is looking through an internal node. If it is looking through 2076098297b2SJeff Mahoney * a leaf node bin_search will find the position of the item which has key 2077098297b2SJeff Mahoney * either equal to given key, or which is the maximal key less than the 2078098297b2SJeff Mahoney * given key. 2079098297b2SJeff Mahoney */ 2080f466c6fdSAl Viro 2081f466c6fdSAl Viro struct path_element { 2082098297b2SJeff Mahoney /* Pointer to the buffer at the path in the tree. */ 2083098297b2SJeff Mahoney struct buffer_head *pe_buffer; 2084098297b2SJeff Mahoney /* Position in the tree node which is placed in the buffer above. */ 2085098297b2SJeff Mahoney int pe_position; 2086f466c6fdSAl Viro }; 2087f466c6fdSAl Viro 2088098297b2SJeff Mahoney /* 2089098297b2SJeff Mahoney * maximal height of a tree. don't change this without 2090098297b2SJeff Mahoney * changing JOURNAL_PER_BALANCE_CNT 2091098297b2SJeff Mahoney */ 2092098297b2SJeff Mahoney #define MAX_HEIGHT 5 2093f466c6fdSAl Viro 2094098297b2SJeff Mahoney /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */ 2095098297b2SJeff Mahoney #define EXTENDED_MAX_HEIGHT 7 2096f466c6fdSAl Viro 2097098297b2SJeff Mahoney /* Must be equal to at least 2. */ 2098098297b2SJeff Mahoney #define FIRST_PATH_ELEMENT_OFFSET 2 2099f466c6fdSAl Viro 2100098297b2SJeff Mahoney /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */ 2101098297b2SJeff Mahoney #define ILLEGAL_PATH_ELEMENT_OFFSET 1 2102098297b2SJeff Mahoney 2103098297b2SJeff Mahoney /* this MUST be MAX_HEIGHT + 1. See about FEB below */ 2104098297b2SJeff Mahoney #define MAX_FEB_SIZE 6 2105098297b2SJeff Mahoney 2106098297b2SJeff Mahoney /* 2107098297b2SJeff Mahoney * We need to keep track of who the ancestors of nodes are. When we 2108098297b2SJeff Mahoney * perform a search we record which nodes were visited while 2109098297b2SJeff Mahoney * descending the tree looking for the node we searched for. This list 2110098297b2SJeff Mahoney * of nodes is called the path. This information is used while 2111098297b2SJeff Mahoney * performing balancing. Note that this path information may become 2112098297b2SJeff Mahoney * invalid, and this means we must check it when using it to see if it 2113098297b2SJeff Mahoney * is still valid. You'll need to read search_by_key and the comments 2114098297b2SJeff Mahoney * in it, especially about decrement_counters_in_path(), to understand 2115098297b2SJeff Mahoney * this structure. 2116098297b2SJeff Mahoney * 2117098297b2SJeff Mahoney * Paths make the code so much harder to work with and debug.... An 2118098297b2SJeff Mahoney * enormous number of bugs are due to them, and trying to write or modify 2119098297b2SJeff Mahoney * code that uses them just makes my head hurt. They are based on an 2120098297b2SJeff Mahoney * excessive effort to avoid disturbing the precious VFS code.:-( The 2121098297b2SJeff Mahoney * gods only know how we are going to SMP the code that uses them. 2122098297b2SJeff Mahoney * znodes are the way! 2123098297b2SJeff Mahoney */ 2124f466c6fdSAl Viro 2125f466c6fdSAl Viro #define PATH_READA 0x1 /* do read ahead */ 2126f466c6fdSAl Viro #define PATH_READA_BACK 0x2 /* read backwards */ 2127f466c6fdSAl Viro 2128f466c6fdSAl Viro struct treepath { 2129f466c6fdSAl Viro int path_length; /* Length of the array above. */ 2130f466c6fdSAl Viro int reada; 2131098297b2SJeff Mahoney /* Array of the path elements. */ 2132098297b2SJeff Mahoney struct path_element path_elements[EXTENDED_MAX_HEIGHT]; 2133f466c6fdSAl Viro int pos_in_item; 2134f466c6fdSAl Viro }; 2135f466c6fdSAl Viro 2136f466c6fdSAl Viro #define pos_in_item(path) ((path)->pos_in_item) 2137f466c6fdSAl Viro 2138f466c6fdSAl Viro #define INITIALIZE_PATH(var) \ 2139f466c6fdSAl Viro struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,} 2140f466c6fdSAl Viro 2141f466c6fdSAl Viro /* Get path element by path and path position. */ 2142f466c6fdSAl Viro #define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset)) 2143f466c6fdSAl Viro 2144f466c6fdSAl Viro /* Get buffer header at the path by path and path position. */ 2145f466c6fdSAl Viro #define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer) 2146f466c6fdSAl Viro 2147f466c6fdSAl Viro /* Get position in the element at the path by path and path position. */ 2148f466c6fdSAl Viro #define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position) 2149f466c6fdSAl Viro 2150f466c6fdSAl Viro #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length)) 2151098297b2SJeff Mahoney 2152098297b2SJeff Mahoney /* 2153098297b2SJeff Mahoney * you know, to the person who didn't write this the macro name does not 2154098297b2SJeff Mahoney * at first suggest what it does. Maybe POSITION_FROM_PATH_END? Or 2155098297b2SJeff Mahoney * maybe we should just focus on dumping paths... -Hans 2156098297b2SJeff Mahoney */ 2157f466c6fdSAl Viro #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length)) 2158f466c6fdSAl Viro 2159098297b2SJeff Mahoney /* 2160098297b2SJeff Mahoney * in do_balance leaf has h == 0 in contrast with path structure, 2161098297b2SJeff Mahoney * where root has level == 0. That is why we need these defines 2162098297b2SJeff Mahoney */ 2163098297b2SJeff Mahoney 2164098297b2SJeff Mahoney /* tb->S[h] */ 2165098297b2SJeff Mahoney #define PATH_H_PBUFFER(path, h) \ 2166098297b2SJeff Mahoney PATH_OFFSET_PBUFFER(path, path->path_length - (h)) 2167098297b2SJeff Mahoney 2168098297b2SJeff Mahoney /* tb->F[h] or tb->S[0]->b_parent */ 2169098297b2SJeff Mahoney #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER(path, (h) + 1) 2170098297b2SJeff Mahoney 2171098297b2SJeff Mahoney #define PATH_H_POSITION(path, h) \ 2172098297b2SJeff Mahoney PATH_OFFSET_POSITION(path, path->path_length - (h)) 2173098297b2SJeff Mahoney 2174098297b2SJeff Mahoney /* tb->S[h]->b_item_order */ 2175098297b2SJeff Mahoney #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1) 2176f466c6fdSAl Viro 2177f466c6fdSAl Viro #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h)) 2178f466c6fdSAl Viro 21794cf5f7adSJeff Mahoney static inline void *reiserfs_node_data(const struct buffer_head *bh) 21804cf5f7adSJeff Mahoney { 21814cf5f7adSJeff Mahoney return bh->b_data + sizeof(struct block_head); 21824cf5f7adSJeff Mahoney } 21834cf5f7adSJeff Mahoney 21844cf5f7adSJeff Mahoney /* get key from internal node */ 21854cf5f7adSJeff Mahoney static inline struct reiserfs_key *internal_key(struct buffer_head *bh, 21864cf5f7adSJeff Mahoney int item_num) 21874cf5f7adSJeff Mahoney { 21884cf5f7adSJeff Mahoney struct reiserfs_key *key = reiserfs_node_data(bh); 21894cf5f7adSJeff Mahoney 21904cf5f7adSJeff Mahoney return &key[item_num]; 21914cf5f7adSJeff Mahoney } 21924cf5f7adSJeff Mahoney 21934cf5f7adSJeff Mahoney /* get the item header from leaf node */ 21944cf5f7adSJeff Mahoney static inline struct item_head *item_head(const struct buffer_head *bh, 21954cf5f7adSJeff Mahoney int item_num) 21964cf5f7adSJeff Mahoney { 21974cf5f7adSJeff Mahoney struct item_head *ih = reiserfs_node_data(bh); 21984cf5f7adSJeff Mahoney 21994cf5f7adSJeff Mahoney return &ih[item_num]; 22004cf5f7adSJeff Mahoney } 22014cf5f7adSJeff Mahoney 22024cf5f7adSJeff Mahoney /* get the key from leaf node */ 22034cf5f7adSJeff Mahoney static inline struct reiserfs_key *leaf_key(const struct buffer_head *bh, 22044cf5f7adSJeff Mahoney int item_num) 22054cf5f7adSJeff Mahoney { 22064cf5f7adSJeff Mahoney return &item_head(bh, item_num)->ih_key; 22074cf5f7adSJeff Mahoney } 22084cf5f7adSJeff Mahoney 22094cf5f7adSJeff Mahoney static inline void *ih_item_body(const struct buffer_head *bh, 22104cf5f7adSJeff Mahoney const struct item_head *ih) 22114cf5f7adSJeff Mahoney { 22124cf5f7adSJeff Mahoney return bh->b_data + ih_location(ih); 22134cf5f7adSJeff Mahoney } 22144cf5f7adSJeff Mahoney 22154cf5f7adSJeff Mahoney /* get item body from leaf node */ 22164cf5f7adSJeff Mahoney static inline void *item_body(const struct buffer_head *bh, int item_num) 22174cf5f7adSJeff Mahoney { 22184cf5f7adSJeff Mahoney return ih_item_body(bh, item_head(bh, item_num)); 22194cf5f7adSJeff Mahoney } 22204cf5f7adSJeff Mahoney 22214cf5f7adSJeff Mahoney static inline struct item_head *tp_item_head(const struct treepath *path) 22224cf5f7adSJeff Mahoney { 22234cf5f7adSJeff Mahoney return item_head(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path)); 22244cf5f7adSJeff Mahoney } 22254cf5f7adSJeff Mahoney 22264cf5f7adSJeff Mahoney static inline void *tp_item_body(const struct treepath *path) 22274cf5f7adSJeff Mahoney { 22284cf5f7adSJeff Mahoney return item_body(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path)); 22294cf5f7adSJeff Mahoney } 22304cf5f7adSJeff Mahoney 2231f466c6fdSAl Viro #define get_last_bh(path) PATH_PLAST_BUFFER(path) 2232f466c6fdSAl Viro #define get_item_pos(path) PATH_LAST_POSITION(path) 2233f466c6fdSAl Viro #define item_moved(ih,path) comp_items(ih, path) 2234f466c6fdSAl Viro #define path_changed(ih,path) comp_items (ih, path) 2235f466c6fdSAl Viro 22364cf5f7adSJeff Mahoney /* array of the entry headers */ 22374cf5f7adSJeff Mahoney /* get item body */ 22384cf5f7adSJeff Mahoney #define B_I_DEH(bh, ih) ((struct reiserfs_de_head *)(ih_item_body(bh, ih))) 22394cf5f7adSJeff Mahoney 22404cf5f7adSJeff Mahoney /* 2241098297b2SJeff Mahoney * length of the directory entry in directory item. This define 2242098297b2SJeff Mahoney * calculates length of i-th directory entry using directory entry 2243098297b2SJeff Mahoney * locations from dir entry head. When it calculates length of 0-th 2244098297b2SJeff Mahoney * directory entry, it uses length of whole item in place of entry 2245098297b2SJeff Mahoney * location of the non-existent following entry in the calculation. 2246098297b2SJeff Mahoney * See picture above. 22474cf5f7adSJeff Mahoney */ 22484cf5f7adSJeff Mahoney static inline int entry_length(const struct buffer_head *bh, 22494cf5f7adSJeff Mahoney const struct item_head *ih, int pos_in_item) 22504cf5f7adSJeff Mahoney { 22514cf5f7adSJeff Mahoney struct reiserfs_de_head *deh; 22524cf5f7adSJeff Mahoney 22534cf5f7adSJeff Mahoney deh = B_I_DEH(bh, ih) + pos_in_item; 22544cf5f7adSJeff Mahoney if (pos_in_item) 22554cf5f7adSJeff Mahoney return deh_location(deh - 1) - deh_location(deh); 22564cf5f7adSJeff Mahoney 22574cf5f7adSJeff Mahoney return ih_item_len(ih) - deh_location(deh); 22584cf5f7adSJeff Mahoney } 22594cf5f7adSJeff Mahoney 2260098297b2SJeff Mahoney /*************************************************************************** 2261098297b2SJeff Mahoney * MISC * 2262098297b2SJeff Mahoney ***************************************************************************/ 2263f466c6fdSAl Viro 2264f466c6fdSAl Viro /* Size of pointer to the unformatted node. */ 2265f466c6fdSAl Viro #define UNFM_P_SIZE (sizeof(unp_t)) 2266f466c6fdSAl Viro #define UNFM_P_SHIFT 2 2267f466c6fdSAl Viro 2268098297b2SJeff Mahoney /* in in-core inode key is stored on le form */ 2269f466c6fdSAl Viro #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key)) 2270f466c6fdSAl Viro 2271f466c6fdSAl Viro #define MAX_UL_INT 0xffffffff 2272f466c6fdSAl Viro #define MAX_INT 0x7ffffff 2273f466c6fdSAl Viro #define MAX_US_INT 0xffff 2274f466c6fdSAl Viro 2275f466c6fdSAl Viro // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset 2276f466c6fdSAl Viro static inline loff_t max_reiserfs_offset(struct inode *inode) 2277f466c6fdSAl Viro { 2278f466c6fdSAl Viro if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5) 2279f466c6fdSAl Viro return (loff_t) U32_MAX; 2280f466c6fdSAl Viro 2281f466c6fdSAl Viro return (loff_t) ((~(__u64) 0) >> 4); 2282f466c6fdSAl Viro } 2283f466c6fdSAl Viro 2284f466c6fdSAl Viro #define MAX_KEY_OBJECTID MAX_UL_INT 2285f466c6fdSAl Viro 2286f466c6fdSAl Viro #define MAX_B_NUM MAX_UL_INT 2287f466c6fdSAl Viro #define MAX_FC_NUM MAX_US_INT 2288f466c6fdSAl Viro 2289f466c6fdSAl Viro /* the purpose is to detect overflow of an unsigned short */ 2290f466c6fdSAl Viro #define REISERFS_LINK_MAX (MAX_US_INT - 1000) 2291f466c6fdSAl Viro 2292098297b2SJeff Mahoney /* 2293098297b2SJeff Mahoney * The following defines are used in reiserfs_insert_item 2294098297b2SJeff Mahoney * and reiserfs_append_item 2295098297b2SJeff Mahoney */ 2296098297b2SJeff Mahoney #define REISERFS_KERNEL_MEM 0 /* kernel memory mode */ 2297098297b2SJeff Mahoney #define REISERFS_USER_MEM 1 /* user memory mode */ 2298f466c6fdSAl Viro 2299f466c6fdSAl Viro #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter) 2300f466c6fdSAl Viro #define get_generation(s) atomic_read (&fs_generation(s)) 2301f466c6fdSAl Viro #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen) 2302f466c6fdSAl Viro #define __fs_changed(gen,s) (gen != get_generation (s)) 2303f466c6fdSAl Viro #define fs_changed(gen,s) \ 2304f466c6fdSAl Viro ({ \ 2305f466c6fdSAl Viro reiserfs_cond_resched(s); \ 2306f466c6fdSAl Viro __fs_changed(gen, s); \ 2307f466c6fdSAl Viro }) 2308f466c6fdSAl Viro 2309098297b2SJeff Mahoney /*************************************************************************** 2310098297b2SJeff Mahoney * FIXATE NODES * 2311098297b2SJeff Mahoney ***************************************************************************/ 2312f466c6fdSAl Viro 2313f466c6fdSAl Viro #define VI_TYPE_LEFT_MERGEABLE 1 2314f466c6fdSAl Viro #define VI_TYPE_RIGHT_MERGEABLE 2 2315f466c6fdSAl Viro 2316098297b2SJeff Mahoney /* 2317098297b2SJeff Mahoney * To make any changes in the tree we always first find node, that 2318098297b2SJeff Mahoney * contains item to be changed/deleted or place to insert a new 2319098297b2SJeff Mahoney * item. We call this node S. To do balancing we need to decide what 2320098297b2SJeff Mahoney * we will shift to left/right neighbor, or to a new node, where new 2321098297b2SJeff Mahoney * item will be etc. To make this analysis simpler we build virtual 2322098297b2SJeff Mahoney * node. Virtual node is an array of items, that will replace items of 2323098297b2SJeff Mahoney * node S. (For instance if we are going to delete an item, virtual 2324098297b2SJeff Mahoney * node does not contain it). Virtual node keeps information about 2325098297b2SJeff Mahoney * item sizes and types, mergeability of first and last items, sizes 2326098297b2SJeff Mahoney * of all entries in directory item. We use this array of items when 2327098297b2SJeff Mahoney * calculating what we can shift to neighbors and how many nodes we 2328098297b2SJeff Mahoney * have to have if we do not any shiftings, if we shift to left/right 2329098297b2SJeff Mahoney * neighbor or to both. 2330098297b2SJeff Mahoney */ 2331f466c6fdSAl Viro struct virtual_item { 2332098297b2SJeff Mahoney int vi_index; /* index in the array of item operations */ 2333098297b2SJeff Mahoney unsigned short vi_type; /* left/right mergeability */ 2334098297b2SJeff Mahoney 2335098297b2SJeff Mahoney /* length of item that it will have after balancing */ 2336098297b2SJeff Mahoney unsigned short vi_item_len; 2337098297b2SJeff Mahoney 2338f466c6fdSAl Viro struct item_head *vi_ih; 2339098297b2SJeff Mahoney const char *vi_item; /* body of item (old or new) */ 2340098297b2SJeff Mahoney const void *vi_new_data; /* 0 always but paste mode */ 2341098297b2SJeff Mahoney void *vi_uarea; /* item specific area */ 2342f466c6fdSAl Viro }; 2343f466c6fdSAl Viro 2344f466c6fdSAl Viro struct virtual_node { 2345098297b2SJeff Mahoney /* this is a pointer to the free space in the buffer */ 2346098297b2SJeff Mahoney char *vn_free_ptr; 2347098297b2SJeff Mahoney 2348f466c6fdSAl Viro unsigned short vn_nr_item; /* number of items in virtual node */ 2349098297b2SJeff Mahoney 2350098297b2SJeff Mahoney /* 2351098297b2SJeff Mahoney * size of node , that node would have if it has 2352098297b2SJeff Mahoney * unlimited size and no balancing is performed 2353098297b2SJeff Mahoney */ 2354098297b2SJeff Mahoney short vn_size; 2355098297b2SJeff Mahoney 2356098297b2SJeff Mahoney /* mode of balancing (paste, insert, delete, cut) */ 2357098297b2SJeff Mahoney short vn_mode; 2358098297b2SJeff Mahoney 2359f466c6fdSAl Viro short vn_affected_item_num; 2360f466c6fdSAl Viro short vn_pos_in_item; 2361098297b2SJeff Mahoney 2362098297b2SJeff Mahoney /* item header of inserted item, 0 for other modes */ 2363098297b2SJeff Mahoney struct item_head *vn_ins_ih; 2364f466c6fdSAl Viro const void *vn_data; 2365098297b2SJeff Mahoney 2366098297b2SJeff Mahoney /* array of items (including a new one, excluding item to be deleted) */ 2367098297b2SJeff Mahoney struct virtual_item *vn_vi; 2368f466c6fdSAl Viro }; 2369f466c6fdSAl Viro 2370f466c6fdSAl Viro /* used by directory items when creating virtual nodes */ 2371f466c6fdSAl Viro struct direntry_uarea { 2372f466c6fdSAl Viro int flags; 2373f466c6fdSAl Viro __u16 entry_count; 2374f466c6fdSAl Viro __u16 entry_sizes[1]; 2375f466c6fdSAl Viro } __attribute__ ((__packed__)); 2376f466c6fdSAl Viro 2377098297b2SJeff Mahoney /*************************************************************************** 2378098297b2SJeff Mahoney * TREE BALANCE * 2379098297b2SJeff Mahoney ***************************************************************************/ 2380f466c6fdSAl Viro 2381098297b2SJeff Mahoney /* 2382098297b2SJeff Mahoney * This temporary structure is used in tree balance algorithms, and 2383098297b2SJeff Mahoney * constructed as we go to the extent that its various parts are 2384098297b2SJeff Mahoney * needed. It contains arrays of nodes that can potentially be 2385098297b2SJeff Mahoney * involved in the balancing of node S, and parameters that define how 2386098297b2SJeff Mahoney * each of the nodes must be balanced. Note that in these algorithms 2387098297b2SJeff Mahoney * for balancing the worst case is to need to balance the current node 2388098297b2SJeff Mahoney * S and the left and right neighbors and all of their parents plus 2389098297b2SJeff Mahoney * create a new node. We implement S1 balancing for the leaf nodes 2390098297b2SJeff Mahoney * and S0 balancing for the internal nodes (S1 and S0 are defined in 2391098297b2SJeff Mahoney * our papers.) 2392098297b2SJeff Mahoney */ 2393f466c6fdSAl Viro 2394098297b2SJeff Mahoney /* size of the array of buffers to free at end of do_balance */ 2395098297b2SJeff Mahoney #define MAX_FREE_BLOCK 7 2396f466c6fdSAl Viro 2397f466c6fdSAl Viro /* maximum number of FEB blocknrs on a single level */ 2398f466c6fdSAl Viro #define MAX_AMOUNT_NEEDED 2 2399f466c6fdSAl Viro 2400f466c6fdSAl Viro /* someday somebody will prefix every field in this struct with tb_ */ 2401f466c6fdSAl Viro struct tree_balance { 2402f466c6fdSAl Viro int tb_mode; 2403f466c6fdSAl Viro int need_balance_dirty; 2404f466c6fdSAl Viro struct super_block *tb_sb; 2405f466c6fdSAl Viro struct reiserfs_transaction_handle *transaction_handle; 2406f466c6fdSAl Viro struct treepath *tb_path; 2407f466c6fdSAl Viro 2408098297b2SJeff Mahoney /* array of left neighbors of nodes in the path */ 2409098297b2SJeff Mahoney struct buffer_head *L[MAX_HEIGHT]; 2410098297b2SJeff Mahoney 2411098297b2SJeff Mahoney /* array of right neighbors of nodes in the path */ 2412098297b2SJeff Mahoney struct buffer_head *R[MAX_HEIGHT]; 2413098297b2SJeff Mahoney 2414098297b2SJeff Mahoney /* array of fathers of the left neighbors */ 2415098297b2SJeff Mahoney struct buffer_head *FL[MAX_HEIGHT]; 2416098297b2SJeff Mahoney 2417098297b2SJeff Mahoney /* array of fathers of the right neighbors */ 2418098297b2SJeff Mahoney struct buffer_head *FR[MAX_HEIGHT]; 2419098297b2SJeff Mahoney /* array of common parents of center node and its left neighbor */ 2420098297b2SJeff Mahoney struct buffer_head *CFL[MAX_HEIGHT]; 2421098297b2SJeff Mahoney 2422098297b2SJeff Mahoney /* array of common parents of center node and its right neighbor */ 2423098297b2SJeff Mahoney struct buffer_head *CFR[MAX_HEIGHT]; 2424098297b2SJeff Mahoney 2425098297b2SJeff Mahoney /* 2426098297b2SJeff Mahoney * array of empty buffers. Number of buffers in array equals 2427098297b2SJeff Mahoney * cur_blknum. 2428098297b2SJeff Mahoney */ 2429098297b2SJeff Mahoney struct buffer_head *FEB[MAX_FEB_SIZE]; 2430f466c6fdSAl Viro struct buffer_head *used[MAX_FEB_SIZE]; 2431f466c6fdSAl Viro struct buffer_head *thrown[MAX_FEB_SIZE]; 2432098297b2SJeff Mahoney 2433098297b2SJeff Mahoney /* 2434098297b2SJeff Mahoney * array of number of items which must be shifted to the left in 2435098297b2SJeff Mahoney * order to balance the current node; for leaves includes item that 2436098297b2SJeff Mahoney * will be partially shifted; for internal nodes, it is the number 2437098297b2SJeff Mahoney * of child pointers rather than items. It includes the new item 2438098297b2SJeff Mahoney * being created. The code sometimes subtracts one to get the 2439098297b2SJeff Mahoney * number of wholly shifted items for other purposes. 2440098297b2SJeff Mahoney */ 2441098297b2SJeff Mahoney int lnum[MAX_HEIGHT]; 2442098297b2SJeff Mahoney 2443098297b2SJeff Mahoney /* substitute right for left in comment above */ 2444098297b2SJeff Mahoney int rnum[MAX_HEIGHT]; 2445098297b2SJeff Mahoney 2446098297b2SJeff Mahoney /* 2447098297b2SJeff Mahoney * array indexed by height h mapping the key delimiting L[h] and 2448098297b2SJeff Mahoney * S[h] to its item number within the node CFL[h] 2449098297b2SJeff Mahoney */ 2450098297b2SJeff Mahoney int lkey[MAX_HEIGHT]; 2451098297b2SJeff Mahoney 2452098297b2SJeff Mahoney /* substitute r for l in comment above */ 2453098297b2SJeff Mahoney int rkey[MAX_HEIGHT]; 2454098297b2SJeff Mahoney 2455098297b2SJeff Mahoney /* 2456098297b2SJeff Mahoney * the number of bytes by we are trying to add or remove from 2457098297b2SJeff Mahoney * S[h]. A negative value means removing. 2458098297b2SJeff Mahoney */ 2459098297b2SJeff Mahoney int insert_size[MAX_HEIGHT]; 2460098297b2SJeff Mahoney 2461098297b2SJeff Mahoney /* 2462098297b2SJeff Mahoney * number of nodes that will replace node S[h] after balancing 2463098297b2SJeff Mahoney * on the level h of the tree. If 0 then S is being deleted, 2464098297b2SJeff Mahoney * if 1 then S is remaining and no new nodes are being created, 2465098297b2SJeff Mahoney * if 2 or 3 then 1 or 2 new nodes is being created 2466098297b2SJeff Mahoney */ 2467098297b2SJeff Mahoney int blknum[MAX_HEIGHT]; 2468f466c6fdSAl Viro 2469f466c6fdSAl Viro /* fields that are used only for balancing leaves of the tree */ 2470f466c6fdSAl Viro 2471098297b2SJeff Mahoney /* number of empty blocks having been already allocated */ 2472098297b2SJeff Mahoney int cur_blknum; 2473098297b2SJeff Mahoney 2474098297b2SJeff Mahoney /* number of items that fall into left most node when S[0] splits */ 2475098297b2SJeff Mahoney int s0num; 2476098297b2SJeff Mahoney 2477098297b2SJeff Mahoney /* 2478098297b2SJeff Mahoney * number of bytes which can flow to the left neighbor from the left 2479098297b2SJeff Mahoney * most liquid item that cannot be shifted from S[0] entirely 2480098297b2SJeff Mahoney * if -1 then nothing will be partially shifted 2481098297b2SJeff Mahoney */ 2482098297b2SJeff Mahoney int lbytes; 2483098297b2SJeff Mahoney 2484098297b2SJeff Mahoney /* 2485098297b2SJeff Mahoney * number of bytes which will flow to the right neighbor from the right 2486098297b2SJeff Mahoney * most liquid item that cannot be shifted from S[0] entirely 2487098297b2SJeff Mahoney * if -1 then nothing will be partially shifted 2488098297b2SJeff Mahoney */ 2489098297b2SJeff Mahoney int rbytes; 2490098297b2SJeff Mahoney 2491b49fb112SJeff Mahoney 2492098297b2SJeff Mahoney /* 2493b49fb112SJeff Mahoney * index into the array of item headers in 2494b49fb112SJeff Mahoney * S[0] of the affected item 2495b49fb112SJeff Mahoney */ 2496b49fb112SJeff Mahoney int item_pos; 2497b49fb112SJeff Mahoney 2498b49fb112SJeff Mahoney /* new nodes allocated to hold what could not fit into S */ 2499b49fb112SJeff Mahoney struct buffer_head *S_new[2]; 2500b49fb112SJeff Mahoney 2501b49fb112SJeff Mahoney /* 2502b49fb112SJeff Mahoney * number of items that will be placed into nodes in S_new 2503b49fb112SJeff Mahoney * when S[0] splits 2504b49fb112SJeff Mahoney */ 2505b49fb112SJeff Mahoney int snum[2]; 2506b49fb112SJeff Mahoney 2507b49fb112SJeff Mahoney /* 2508b49fb112SJeff Mahoney * number of bytes which flow to nodes in S_new when S[0] splits 2509098297b2SJeff Mahoney * note: if S[0] splits into 3 nodes, then items do not need to be cut 2510098297b2SJeff Mahoney */ 2511b49fb112SJeff Mahoney int sbytes[2]; 2512b49fb112SJeff Mahoney 2513b49fb112SJeff Mahoney int pos_in_item; 2514b49fb112SJeff Mahoney int zeroes_num; 2515098297b2SJeff Mahoney 2516098297b2SJeff Mahoney /* 2517098297b2SJeff Mahoney * buffers which are to be freed after do_balance finishes 2518098297b2SJeff Mahoney * by unfix_nodes 2519098297b2SJeff Mahoney */ 2520098297b2SJeff Mahoney struct buffer_head *buf_to_free[MAX_FREE_BLOCK]; 2521098297b2SJeff Mahoney 2522098297b2SJeff Mahoney /* 2523098297b2SJeff Mahoney * kmalloced memory. Used to create virtual node and keep 2524098297b2SJeff Mahoney * map of dirtied bitmap blocks 2525098297b2SJeff Mahoney */ 2526098297b2SJeff Mahoney char *vn_buf; 2527098297b2SJeff Mahoney 2528098297b2SJeff Mahoney int vn_buf_size; /* size of the vn_buf */ 2529098297b2SJeff Mahoney 2530098297b2SJeff Mahoney /* VN starts after bitmap of bitmap blocks */ 2531098297b2SJeff Mahoney struct virtual_node *tb_vn; 2532098297b2SJeff Mahoney 2533098297b2SJeff Mahoney /* 2534098297b2SJeff Mahoney * saved value of `reiserfs_generation' counter see 2535098297b2SJeff Mahoney * FILESYSTEM_CHANGED() macro in reiserfs_fs.h 2536098297b2SJeff Mahoney */ 2537098297b2SJeff Mahoney int fs_gen; 2538098297b2SJeff Mahoney 2539f466c6fdSAl Viro #ifdef DISPLACE_NEW_PACKING_LOCALITIES 2540098297b2SJeff Mahoney /* 2541098297b2SJeff Mahoney * key pointer, to pass to block allocator or 2542098297b2SJeff Mahoney * another low-level subsystem 2543098297b2SJeff Mahoney */ 2544098297b2SJeff Mahoney struct in_core_key key; 2545f466c6fdSAl Viro #endif 2546f466c6fdSAl Viro }; 2547f466c6fdSAl Viro 2548f466c6fdSAl Viro /* These are modes of balancing */ 2549f466c6fdSAl Viro 2550f466c6fdSAl Viro /* When inserting an item. */ 2551f466c6fdSAl Viro #define M_INSERT 'i' 2552098297b2SJeff Mahoney /* 2553098297b2SJeff Mahoney * When inserting into (directories only) or appending onto an already 2554098297b2SJeff Mahoney * existent item. 2555098297b2SJeff Mahoney */ 2556f466c6fdSAl Viro #define M_PASTE 'p' 2557f466c6fdSAl Viro /* When deleting an item. */ 2558f466c6fdSAl Viro #define M_DELETE 'd' 2559f466c6fdSAl Viro /* When truncating an item or removing an entry from a (directory) item. */ 2560f466c6fdSAl Viro #define M_CUT 'c' 2561f466c6fdSAl Viro 2562f466c6fdSAl Viro /* used when balancing on leaf level skipped (in reiserfsck) */ 2563f466c6fdSAl Viro #define M_INTERNAL 'n' 2564f466c6fdSAl Viro 2565098297b2SJeff Mahoney /* 2566098297b2SJeff Mahoney * When further balancing is not needed, then do_balance does not need 2567098297b2SJeff Mahoney * to be called. 2568098297b2SJeff Mahoney */ 2569f466c6fdSAl Viro #define M_SKIP_BALANCING 's' 2570f466c6fdSAl Viro #define M_CONVERT 'v' 2571f466c6fdSAl Viro 2572f466c6fdSAl Viro /* modes of leaf_move_items */ 2573f466c6fdSAl Viro #define LEAF_FROM_S_TO_L 0 2574f466c6fdSAl Viro #define LEAF_FROM_S_TO_R 1 2575f466c6fdSAl Viro #define LEAF_FROM_R_TO_L 2 2576f466c6fdSAl Viro #define LEAF_FROM_L_TO_R 3 2577f466c6fdSAl Viro #define LEAF_FROM_S_TO_SNEW 4 2578f466c6fdSAl Viro 2579f466c6fdSAl Viro #define FIRST_TO_LAST 0 2580f466c6fdSAl Viro #define LAST_TO_FIRST 1 2581f466c6fdSAl Viro 2582098297b2SJeff Mahoney /* 2583098297b2SJeff Mahoney * used in do_balance for passing parent of node information that has 2584098297b2SJeff Mahoney * been gotten from tb struct 2585098297b2SJeff Mahoney */ 2586f466c6fdSAl Viro struct buffer_info { 2587f466c6fdSAl Viro struct tree_balance *tb; 2588f466c6fdSAl Viro struct buffer_head *bi_bh; 2589f466c6fdSAl Viro struct buffer_head *bi_parent; 2590f466c6fdSAl Viro int bi_position; 2591f466c6fdSAl Viro }; 2592f466c6fdSAl Viro 2593f466c6fdSAl Viro static inline struct super_block *sb_from_tb(struct tree_balance *tb) 2594f466c6fdSAl Viro { 2595f466c6fdSAl Viro return tb ? tb->tb_sb : NULL; 2596f466c6fdSAl Viro } 2597f466c6fdSAl Viro 2598f466c6fdSAl Viro static inline struct super_block *sb_from_bi(struct buffer_info *bi) 2599f466c6fdSAl Viro { 2600f466c6fdSAl Viro return bi ? sb_from_tb(bi->tb) : NULL; 2601f466c6fdSAl Viro } 2602f466c6fdSAl Viro 2603098297b2SJeff Mahoney /* 2604098297b2SJeff Mahoney * there are 4 types of items: stat data, directory item, indirect, direct. 2605098297b2SJeff Mahoney * +-------------------+------------+--------------+------------+ 2606098297b2SJeff Mahoney * | | k_offset | k_uniqueness | mergeable? | 2607098297b2SJeff Mahoney * +-------------------+------------+--------------+------------+ 2608098297b2SJeff Mahoney * | stat data | 0 | 0 | no | 2609098297b2SJeff Mahoney * +-------------------+------------+--------------+------------+ 2610098297b2SJeff Mahoney * | 1st directory item| DOT_OFFSET | DIRENTRY_ .. | no | 2611098297b2SJeff Mahoney * | non 1st directory | hash value | UNIQUENESS | yes | 2612098297b2SJeff Mahoney * | item | | | | 2613098297b2SJeff Mahoney * +-------------------+------------+--------------+------------+ 2614098297b2SJeff Mahoney * | indirect item | offset + 1 |TYPE_INDIRECT | [1] | 2615098297b2SJeff Mahoney * +-------------------+------------+--------------+------------+ 2616098297b2SJeff Mahoney * | direct item | offset + 1 |TYPE_DIRECT | [2] | 2617098297b2SJeff Mahoney * +-------------------+------------+--------------+------------+ 2618098297b2SJeff Mahoney * 2619098297b2SJeff Mahoney * [1] if this is not the first indirect item of the object 2620098297b2SJeff Mahoney * [2] if this is not the first direct item of the object 2621f466c6fdSAl Viro */ 2622f466c6fdSAl Viro 2623f466c6fdSAl Viro struct item_operations { 2624f466c6fdSAl Viro int (*bytes_number) (struct item_head * ih, int block_size); 2625f466c6fdSAl Viro void (*decrement_key) (struct cpu_key *); 2626f466c6fdSAl Viro int (*is_left_mergeable) (struct reiserfs_key * ih, 2627f466c6fdSAl Viro unsigned long bsize); 2628f466c6fdSAl Viro void (*print_item) (struct item_head *, char *item); 2629f466c6fdSAl Viro void (*check_item) (struct item_head *, char *item); 2630f466c6fdSAl Viro 2631f466c6fdSAl Viro int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi, 2632f466c6fdSAl Viro int is_affected, int insert_size); 2633f466c6fdSAl Viro int (*check_left) (struct virtual_item * vi, int free, 2634f466c6fdSAl Viro int start_skip, int end_skip); 2635f466c6fdSAl Viro int (*check_right) (struct virtual_item * vi, int free); 2636f466c6fdSAl Viro int (*part_size) (struct virtual_item * vi, int from, int to); 2637f466c6fdSAl Viro int (*unit_num) (struct virtual_item * vi); 2638f466c6fdSAl Viro void (*print_vi) (struct virtual_item * vi); 2639f466c6fdSAl Viro }; 2640f466c6fdSAl Viro 2641f466c6fdSAl Viro extern struct item_operations *item_ops[TYPE_ANY + 1]; 2642f466c6fdSAl Viro 2643f466c6fdSAl Viro #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize) 2644f466c6fdSAl Viro #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize) 2645f466c6fdSAl Viro #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item) 2646f466c6fdSAl Viro #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item) 2647f466c6fdSAl Viro #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) 2648f466c6fdSAl Viro #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip) 2649f466c6fdSAl Viro #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free) 2650f466c6fdSAl Viro #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to) 2651f466c6fdSAl Viro #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi) 2652f466c6fdSAl Viro #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi) 2653f466c6fdSAl Viro 2654f466c6fdSAl Viro #define COMP_SHORT_KEYS comp_short_keys 2655f466c6fdSAl Viro 2656f466c6fdSAl Viro /* number of blocks pointed to by the indirect item */ 2657f466c6fdSAl Viro #define I_UNFM_NUM(ih) (ih_item_len(ih) / UNFM_P_SIZE) 2658f466c6fdSAl Viro 2659098297b2SJeff Mahoney /* 2660098297b2SJeff Mahoney * the used space within the unformatted node corresponding 2661098297b2SJeff Mahoney * to pos within the item pointed to by ih 2662098297b2SJeff Mahoney */ 2663f466c6fdSAl Viro #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size)) 2664f466c6fdSAl Viro 2665098297b2SJeff Mahoney /* 2666098297b2SJeff Mahoney * number of bytes contained by the direct item or the 2667098297b2SJeff Mahoney * unformatted nodes the indirect item points to 2668098297b2SJeff Mahoney */ 2669f466c6fdSAl Viro 2670f466c6fdSAl Viro /* following defines use reiserfs buffer header and item header */ 2671f466c6fdSAl Viro 2672f466c6fdSAl Viro /* get stat-data */ 2673f466c6fdSAl Viro #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) ) 2674f466c6fdSAl Viro 2675098297b2SJeff Mahoney /* this is 3976 for size==4096 */ 2676f466c6fdSAl Viro #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE) 2677f466c6fdSAl Viro 2678098297b2SJeff Mahoney /* 2679098297b2SJeff Mahoney * indirect items consist of entries which contain blocknrs, pos 2680098297b2SJeff Mahoney * indicates which entry, and B_I_POS_UNFM_POINTER resolves to the 2681098297b2SJeff Mahoney * blocknr contained by the entry pos points to 2682098297b2SJeff Mahoney */ 26834cf5f7adSJeff Mahoney #define B_I_POS_UNFM_POINTER(bh, ih, pos) \ 26844cf5f7adSJeff Mahoney le32_to_cpu(*(((unp_t *)ih_item_body(bh, ih)) + (pos))) 26854cf5f7adSJeff Mahoney #define PUT_B_I_POS_UNFM_POINTER(bh, ih, pos, val) \ 26864cf5f7adSJeff Mahoney (*(((unp_t *)ih_item_body(bh, ih)) + (pos)) = cpu_to_le32(val)) 2687f466c6fdSAl Viro 2688f466c6fdSAl Viro struct reiserfs_iget_args { 2689f466c6fdSAl Viro __u32 objectid; 2690f466c6fdSAl Viro __u32 dirid; 2691f466c6fdSAl Viro }; 2692f466c6fdSAl Viro 2693098297b2SJeff Mahoney /*************************************************************************** 2694098297b2SJeff Mahoney * FUNCTION DECLARATIONS * 2695098297b2SJeff Mahoney ***************************************************************************/ 2696f466c6fdSAl Viro 2697f466c6fdSAl Viro #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12) 2698f466c6fdSAl Viro 2699f466c6fdSAl Viro #define journal_trans_half(blocksize) \ 2700f466c6fdSAl Viro ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32)) 2701f466c6fdSAl Viro 2702f466c6fdSAl Viro /* journal.c see journal.c for all the comments here */ 2703f466c6fdSAl Viro 2704f466c6fdSAl Viro /* first block written in a commit. */ 2705f466c6fdSAl Viro struct reiserfs_journal_desc { 2706f466c6fdSAl Viro __le32 j_trans_id; /* id of commit */ 2707098297b2SJeff Mahoney 2708098297b2SJeff Mahoney /* length of commit. len +1 is the commit block */ 2709098297b2SJeff Mahoney __le32 j_len; 2710098297b2SJeff Mahoney 2711f466c6fdSAl Viro __le32 j_mount_id; /* mount id of this trans */ 2712f466c6fdSAl Viro __le32 j_realblock[1]; /* real locations for each block */ 2713f466c6fdSAl Viro }; 2714f466c6fdSAl Viro 2715f466c6fdSAl Viro #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id) 2716f466c6fdSAl Viro #define get_desc_trans_len(d) le32_to_cpu((d)->j_len) 2717f466c6fdSAl Viro #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id) 2718f466c6fdSAl Viro 2719f466c6fdSAl Viro #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0) 2720f466c6fdSAl Viro #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0) 2721f466c6fdSAl Viro #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0) 2722f466c6fdSAl Viro 2723f466c6fdSAl Viro /* last block written in a commit */ 2724f466c6fdSAl Viro struct reiserfs_journal_commit { 2725f466c6fdSAl Viro __le32 j_trans_id; /* must match j_trans_id from the desc block */ 2726f466c6fdSAl Viro __le32 j_len; /* ditto */ 2727f466c6fdSAl Viro __le32 j_realblock[1]; /* real locations for each block */ 2728f466c6fdSAl Viro }; 2729f466c6fdSAl Viro 2730f466c6fdSAl Viro #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id) 2731f466c6fdSAl Viro #define get_commit_trans_len(c) le32_to_cpu((c)->j_len) 2732f466c6fdSAl Viro #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id) 2733f466c6fdSAl Viro 2734f466c6fdSAl Viro #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0) 2735f466c6fdSAl Viro #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0) 2736f466c6fdSAl Viro 2737098297b2SJeff Mahoney /* 2738098297b2SJeff Mahoney * this header block gets written whenever a transaction is considered 2739098297b2SJeff Mahoney * fully flushed, and is more recent than the last fully flushed transaction. 2740098297b2SJeff Mahoney * fully flushed means all the log blocks and all the real blocks are on 2741098297b2SJeff Mahoney * disk, and this transaction does not need to be replayed. 2742f466c6fdSAl Viro */ 2743f466c6fdSAl Viro struct reiserfs_journal_header { 2744098297b2SJeff Mahoney /* id of last fully flushed transaction */ 2745098297b2SJeff Mahoney __le32 j_last_flush_trans_id; 2746098297b2SJeff Mahoney 2747098297b2SJeff Mahoney /* offset in the log of where to start replay after a crash */ 2748098297b2SJeff Mahoney __le32 j_first_unflushed_offset; 2749098297b2SJeff Mahoney 2750f466c6fdSAl Viro __le32 j_mount_id; 2751f466c6fdSAl Viro /* 12 */ struct journal_params jh_journal; 2752f466c6fdSAl Viro }; 2753f466c6fdSAl Viro 2754f466c6fdSAl Viro /* biggest tunable defines are right here */ 2755f466c6fdSAl Viro #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */ 2756098297b2SJeff Mahoney 2757098297b2SJeff Mahoney /* biggest possible single transaction, don't change for now (8/3/99) */ 2758098297b2SJeff Mahoney #define JOURNAL_TRANS_MAX_DEFAULT 1024 2759f466c6fdSAl Viro #define JOURNAL_TRANS_MIN_DEFAULT 256 2760098297b2SJeff Mahoney 2761098297b2SJeff Mahoney /* 2762098297b2SJeff Mahoney * max blocks to batch into one transaction, 2763098297b2SJeff Mahoney * don't make this any bigger than 900 2764098297b2SJeff Mahoney */ 2765098297b2SJeff Mahoney #define JOURNAL_MAX_BATCH_DEFAULT 900 2766f466c6fdSAl Viro #define JOURNAL_MIN_RATIO 2 2767f466c6fdSAl Viro #define JOURNAL_MAX_COMMIT_AGE 30 2768f466c6fdSAl Viro #define JOURNAL_MAX_TRANS_AGE 30 2769f466c6fdSAl Viro #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9) 2770f466c6fdSAl Viro #define JOURNAL_BLOCKS_PER_OBJECT(sb) (JOURNAL_PER_BALANCE_CNT * 3 + \ 2771f466c6fdSAl Viro 2 * (REISERFS_QUOTA_INIT_BLOCKS(sb) + \ 2772f466c6fdSAl Viro REISERFS_QUOTA_TRANS_BLOCKS(sb))) 2773f466c6fdSAl Viro 2774f466c6fdSAl Viro #ifdef CONFIG_QUOTA 2775f466c6fdSAl Viro #define REISERFS_QUOTA_OPTS ((1 << REISERFS_USRQUOTA) | (1 << REISERFS_GRPQUOTA)) 2776f466c6fdSAl Viro /* We need to update data and inode (atime) */ 2777f466c6fdSAl Viro #define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? 2 : 0) 2778f466c6fdSAl Viro /* 1 balancing, 1 bitmap, 1 data per write + stat data update */ 2779f466c6fdSAl Viro #define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? \ 2780f466c6fdSAl Viro (DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0) 2781f466c6fdSAl Viro /* same as with INIT */ 2782f466c6fdSAl Viro #define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? \ 2783f466c6fdSAl Viro (DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0) 2784f466c6fdSAl Viro #else 2785f466c6fdSAl Viro #define REISERFS_QUOTA_TRANS_BLOCKS(s) 0 2786f466c6fdSAl Viro #define REISERFS_QUOTA_INIT_BLOCKS(s) 0 2787f466c6fdSAl Viro #define REISERFS_QUOTA_DEL_BLOCKS(s) 0 2788f466c6fdSAl Viro #endif 2789f466c6fdSAl Viro 2790098297b2SJeff Mahoney /* 2791098297b2SJeff Mahoney * both of these can be as low as 1, or as high as you want. The min is the 2792098297b2SJeff Mahoney * number of 4k bitmap nodes preallocated on mount. New nodes are allocated 2793098297b2SJeff Mahoney * as needed, and released when transactions are committed. On release, if 2794098297b2SJeff Mahoney * the current number of nodes is > max, the node is freed, otherwise, 2795098297b2SJeff Mahoney * it is put on a free list for faster use later. 2796f466c6fdSAl Viro */ 2797f466c6fdSAl Viro #define REISERFS_MIN_BITMAP_NODES 10 2798f466c6fdSAl Viro #define REISERFS_MAX_BITMAP_NODES 100 2799f466c6fdSAl Viro 2800098297b2SJeff Mahoney /* these are based on journal hash size of 8192 */ 2801098297b2SJeff Mahoney #define JBH_HASH_SHIFT 13 2802f466c6fdSAl Viro #define JBH_HASH_MASK 8191 2803f466c6fdSAl Viro 2804f466c6fdSAl Viro #define _jhashfn(sb,block) \ 2805f466c6fdSAl Viro (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \ 2806f466c6fdSAl Viro (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12)))) 2807f466c6fdSAl Viro #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK]) 2808f466c6fdSAl Viro 2809098297b2SJeff Mahoney /* We need these to make journal.c code more readable */ 2810f466c6fdSAl Viro #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) 2811f466c6fdSAl Viro #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) 2812f466c6fdSAl Viro #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize) 2813f466c6fdSAl Viro 2814f466c6fdSAl Viro enum reiserfs_bh_state_bits { 2815f466c6fdSAl Viro BH_JDirty = BH_PrivateStart, /* buffer is in current transaction */ 2816f466c6fdSAl Viro BH_JDirty_wait, 2817098297b2SJeff Mahoney /* 2818098297b2SJeff Mahoney * disk block was taken off free list before being in a 2819098297b2SJeff Mahoney * finished transaction, or written to disk. Can be reused immed. 2820098297b2SJeff Mahoney */ 2821098297b2SJeff Mahoney BH_JNew, 2822f466c6fdSAl Viro BH_JPrepared, 2823f466c6fdSAl Viro BH_JRestore_dirty, 2824098297b2SJeff Mahoney BH_JTest, /* debugging only will go away */ 2825f466c6fdSAl Viro }; 2826f466c6fdSAl Viro 2827f466c6fdSAl Viro BUFFER_FNS(JDirty, journaled); 2828f466c6fdSAl Viro TAS_BUFFER_FNS(JDirty, journaled); 2829f466c6fdSAl Viro BUFFER_FNS(JDirty_wait, journal_dirty); 2830f466c6fdSAl Viro TAS_BUFFER_FNS(JDirty_wait, journal_dirty); 2831f466c6fdSAl Viro BUFFER_FNS(JNew, journal_new); 2832f466c6fdSAl Viro TAS_BUFFER_FNS(JNew, journal_new); 2833f466c6fdSAl Viro BUFFER_FNS(JPrepared, journal_prepared); 2834f466c6fdSAl Viro TAS_BUFFER_FNS(JPrepared, journal_prepared); 2835f466c6fdSAl Viro BUFFER_FNS(JRestore_dirty, journal_restore_dirty); 2836f466c6fdSAl Viro TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty); 2837f466c6fdSAl Viro BUFFER_FNS(JTest, journal_test); 2838f466c6fdSAl Viro TAS_BUFFER_FNS(JTest, journal_test); 2839f466c6fdSAl Viro 2840098297b2SJeff Mahoney /* transaction handle which is passed around for all journal calls */ 2841f466c6fdSAl Viro struct reiserfs_transaction_handle { 2842098297b2SJeff Mahoney /* 2843098297b2SJeff Mahoney * super for this FS when journal_begin was called. saves calls to 2844098297b2SJeff Mahoney * reiserfs_get_super also used by nested transactions to make 2845098297b2SJeff Mahoney * sure they are nesting on the right FS _must_ be first 2846098297b2SJeff Mahoney * in the handle 2847f466c6fdSAl Viro */ 2848098297b2SJeff Mahoney struct super_block *t_super; 2849098297b2SJeff Mahoney 2850f466c6fdSAl Viro int t_refcount; 2851f466c6fdSAl Viro int t_blocks_logged; /* number of blocks this writer has logged */ 2852f466c6fdSAl Viro int t_blocks_allocated; /* number of blocks this writer allocated */ 2853098297b2SJeff Mahoney 2854098297b2SJeff Mahoney /* sanity check, equals the current trans id */ 2855098297b2SJeff Mahoney unsigned int t_trans_id; 2856098297b2SJeff Mahoney 2857f466c6fdSAl Viro void *t_handle_save; /* save existing current->journal_info */ 2858098297b2SJeff Mahoney 2859098297b2SJeff Mahoney /* 2860098297b2SJeff Mahoney * if new block allocation occurres, that block 2861098297b2SJeff Mahoney * should be displaced from others 2862098297b2SJeff Mahoney */ 2863098297b2SJeff Mahoney unsigned displace_new_blocks:1; 2864098297b2SJeff Mahoney 2865f466c6fdSAl Viro struct list_head t_list; 2866f466c6fdSAl Viro }; 2867f466c6fdSAl Viro 2868098297b2SJeff Mahoney /* 2869098297b2SJeff Mahoney * used to keep track of ordered and tail writes, attached to the buffer 2870f466c6fdSAl Viro * head through b_journal_head. 2871f466c6fdSAl Viro */ 2872f466c6fdSAl Viro struct reiserfs_jh { 2873f466c6fdSAl Viro struct reiserfs_journal_list *jl; 2874f466c6fdSAl Viro struct buffer_head *bh; 2875f466c6fdSAl Viro struct list_head list; 2876f466c6fdSAl Viro }; 2877f466c6fdSAl Viro 2878f466c6fdSAl Viro void reiserfs_free_jh(struct buffer_head *bh); 2879f466c6fdSAl Viro int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh); 2880f466c6fdSAl Viro int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh); 2881f466c6fdSAl Viro int journal_mark_dirty(struct reiserfs_transaction_handle *, 288209f1b80bSJeff Mahoney struct buffer_head *bh); 2883f466c6fdSAl Viro 2884f466c6fdSAl Viro static inline int reiserfs_file_data_log(struct inode *inode) 2885f466c6fdSAl Viro { 2886f466c6fdSAl Viro if (reiserfs_data_log(inode->i_sb) || 2887f466c6fdSAl Viro (REISERFS_I(inode)->i_flags & i_data_log)) 2888f466c6fdSAl Viro return 1; 2889f466c6fdSAl Viro return 0; 2890f466c6fdSAl Viro } 2891f466c6fdSAl Viro 2892f466c6fdSAl Viro static inline int reiserfs_transaction_running(struct super_block *s) 2893f466c6fdSAl Viro { 2894f466c6fdSAl Viro struct reiserfs_transaction_handle *th = current->journal_info; 2895f466c6fdSAl Viro if (th && th->t_super == s) 2896f466c6fdSAl Viro return 1; 2897f466c6fdSAl Viro if (th && th->t_super == NULL) 2898f466c6fdSAl Viro BUG(); 2899f466c6fdSAl Viro return 0; 2900f466c6fdSAl Viro } 2901f466c6fdSAl Viro 2902f466c6fdSAl Viro static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th) 2903f466c6fdSAl Viro { 2904f466c6fdSAl Viro return th->t_blocks_allocated - th->t_blocks_logged; 2905f466c6fdSAl Viro } 2906f466c6fdSAl Viro 2907f466c6fdSAl Viro struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct 2908f466c6fdSAl Viro super_block 2909f466c6fdSAl Viro *, 2910f466c6fdSAl Viro int count); 2911f466c6fdSAl Viro int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *); 2912cfac4b47SMarco Stornelli void reiserfs_vfs_truncate_file(struct inode *inode); 2913f466c6fdSAl Viro int reiserfs_commit_page(struct inode *inode, struct page *page, 2914f466c6fdSAl Viro unsigned from, unsigned to); 291525729b0eSArtem Bityutskiy void reiserfs_flush_old_commits(struct super_block *); 2916f466c6fdSAl Viro int reiserfs_commit_for_inode(struct inode *); 2917f466c6fdSAl Viro int reiserfs_inode_needs_commit(struct inode *); 2918f466c6fdSAl Viro void reiserfs_update_inode_transaction(struct inode *); 2919f466c6fdSAl Viro void reiserfs_wait_on_write_block(struct super_block *s); 2920f466c6fdSAl Viro void reiserfs_block_writes(struct reiserfs_transaction_handle *th); 2921f466c6fdSAl Viro void reiserfs_allow_writes(struct super_block *s); 2922f466c6fdSAl Viro void reiserfs_check_lock_depth(struct super_block *s, char *caller); 2923f466c6fdSAl Viro int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh, 2924f466c6fdSAl Viro int wait); 2925f466c6fdSAl Viro void reiserfs_restore_prepared_buffer(struct super_block *, 2926f466c6fdSAl Viro struct buffer_head *bh); 2927f466c6fdSAl Viro int journal_init(struct super_block *, const char *j_dev_name, int old_format, 2928f466c6fdSAl Viro unsigned int); 2929f466c6fdSAl Viro int journal_release(struct reiserfs_transaction_handle *, struct super_block *); 2930f466c6fdSAl Viro int journal_release_error(struct reiserfs_transaction_handle *, 2931f466c6fdSAl Viro struct super_block *); 293258d85426SJeff Mahoney int journal_end(struct reiserfs_transaction_handle *); 293358d85426SJeff Mahoney int journal_end_sync(struct reiserfs_transaction_handle *); 2934f466c6fdSAl Viro int journal_mark_freed(struct reiserfs_transaction_handle *, 2935f466c6fdSAl Viro struct super_block *, b_blocknr_t blocknr); 2936f466c6fdSAl Viro int journal_transaction_should_end(struct reiserfs_transaction_handle *, int); 2937f466c6fdSAl Viro int reiserfs_in_journal(struct super_block *sb, unsigned int bmap_nr, 2938f466c6fdSAl Viro int bit_nr, int searchall, b_blocknr_t *next); 2939f466c6fdSAl Viro int journal_begin(struct reiserfs_transaction_handle *, 2940f466c6fdSAl Viro struct super_block *sb, unsigned long); 2941f466c6fdSAl Viro int journal_join_abort(struct reiserfs_transaction_handle *, 2942b491dd17SJeff Mahoney struct super_block *sb); 2943f466c6fdSAl Viro void reiserfs_abort_journal(struct super_block *sb, int errno); 2944f466c6fdSAl Viro void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...); 2945f466c6fdSAl Viro int reiserfs_allocate_list_bitmaps(struct super_block *s, 2946f466c6fdSAl Viro struct reiserfs_list_bitmap *, unsigned int); 2947f466c6fdSAl Viro 2948033369d1SArtem Bityutskiy void reiserfs_schedule_old_flush(struct super_block *s); 2949f466c6fdSAl Viro void add_save_link(struct reiserfs_transaction_handle *th, 2950f466c6fdSAl Viro struct inode *inode, int truncate); 2951f466c6fdSAl Viro int remove_save_link(struct inode *inode, int truncate); 2952f466c6fdSAl Viro 2953f466c6fdSAl Viro /* objectid.c */ 2954f466c6fdSAl Viro __u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th); 2955f466c6fdSAl Viro void reiserfs_release_objectid(struct reiserfs_transaction_handle *th, 2956f466c6fdSAl Viro __u32 objectid_to_release); 2957f466c6fdSAl Viro int reiserfs_convert_objectid_map_v1(struct super_block *); 2958f466c6fdSAl Viro 2959f466c6fdSAl Viro /* stree.c */ 2960f466c6fdSAl Viro int B_IS_IN_TREE(const struct buffer_head *); 2961f466c6fdSAl Viro extern void copy_item_head(struct item_head *to, 2962f466c6fdSAl Viro const struct item_head *from); 2963f466c6fdSAl Viro 2964098297b2SJeff Mahoney /* first key is in cpu form, second - le */ 2965f466c6fdSAl Viro extern int comp_short_keys(const struct reiserfs_key *le_key, 2966f466c6fdSAl Viro const struct cpu_key *cpu_key); 2967f466c6fdSAl Viro extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from); 2968f466c6fdSAl Viro 2969098297b2SJeff Mahoney /* both are in le form */ 2970f466c6fdSAl Viro extern int comp_le_keys(const struct reiserfs_key *, 2971f466c6fdSAl Viro const struct reiserfs_key *); 2972f466c6fdSAl Viro extern int comp_short_le_keys(const struct reiserfs_key *, 2973f466c6fdSAl Viro const struct reiserfs_key *); 2974f466c6fdSAl Viro 2975098297b2SJeff Mahoney /* * get key version from on disk key - kludge */ 2976f466c6fdSAl Viro static inline int le_key_version(const struct reiserfs_key *key) 2977f466c6fdSAl Viro { 2978f466c6fdSAl Viro int type; 2979f466c6fdSAl Viro 2980f466c6fdSAl Viro type = offset_v2_k_type(&(key->u.k_offset_v2)); 2981f466c6fdSAl Viro if (type != TYPE_DIRECT && type != TYPE_INDIRECT 2982f466c6fdSAl Viro && type != TYPE_DIRENTRY) 2983f466c6fdSAl Viro return KEY_FORMAT_3_5; 2984f466c6fdSAl Viro 2985f466c6fdSAl Viro return KEY_FORMAT_3_6; 2986f466c6fdSAl Viro 2987f466c6fdSAl Viro } 2988f466c6fdSAl Viro 2989f466c6fdSAl Viro static inline void copy_key(struct reiserfs_key *to, 2990f466c6fdSAl Viro const struct reiserfs_key *from) 2991f466c6fdSAl Viro { 2992f466c6fdSAl Viro memcpy(to, from, KEY_SIZE); 2993f466c6fdSAl Viro } 2994f466c6fdSAl Viro 2995f466c6fdSAl Viro int comp_items(const struct item_head *stored_ih, const struct treepath *path); 2996f466c6fdSAl Viro const struct reiserfs_key *get_rkey(const struct treepath *chk_path, 2997f466c6fdSAl Viro const struct super_block *sb); 2998f466c6fdSAl Viro int search_by_key(struct super_block *, const struct cpu_key *, 2999f466c6fdSAl Viro struct treepath *, int); 3000f466c6fdSAl Viro #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL) 3001f466c6fdSAl Viro int search_for_position_by_key(struct super_block *sb, 3002f466c6fdSAl Viro const struct cpu_key *cpu_key, 3003f466c6fdSAl Viro struct treepath *search_path); 3004f466c6fdSAl Viro extern void decrement_bcount(struct buffer_head *bh); 3005f466c6fdSAl Viro void decrement_counters_in_path(struct treepath *search_path); 3006f466c6fdSAl Viro void pathrelse(struct treepath *search_path); 3007f466c6fdSAl Viro int reiserfs_check_path(struct treepath *p); 3008f466c6fdSAl Viro void pathrelse_and_restore(struct super_block *s, struct treepath *search_path); 3009f466c6fdSAl Viro 3010f466c6fdSAl Viro int reiserfs_insert_item(struct reiserfs_transaction_handle *th, 3011f466c6fdSAl Viro struct treepath *path, 3012f466c6fdSAl Viro const struct cpu_key *key, 3013f466c6fdSAl Viro struct item_head *ih, 3014f466c6fdSAl Viro struct inode *inode, const char *body); 3015f466c6fdSAl Viro 3016f466c6fdSAl Viro int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th, 3017f466c6fdSAl Viro struct treepath *path, 3018f466c6fdSAl Viro const struct cpu_key *key, 3019f466c6fdSAl Viro struct inode *inode, 3020f466c6fdSAl Viro const char *body, int paste_size); 3021f466c6fdSAl Viro 3022f466c6fdSAl Viro int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th, 3023f466c6fdSAl Viro struct treepath *path, 3024f466c6fdSAl Viro struct cpu_key *key, 3025f466c6fdSAl Viro struct inode *inode, 3026f466c6fdSAl Viro struct page *page, loff_t new_file_size); 3027f466c6fdSAl Viro 3028f466c6fdSAl Viro int reiserfs_delete_item(struct reiserfs_transaction_handle *th, 3029f466c6fdSAl Viro struct treepath *path, 3030f466c6fdSAl Viro const struct cpu_key *key, 3031f466c6fdSAl Viro struct inode *inode, struct buffer_head *un_bh); 3032f466c6fdSAl Viro 3033f466c6fdSAl Viro void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th, 3034f466c6fdSAl Viro struct inode *inode, struct reiserfs_key *key); 3035f466c6fdSAl Viro int reiserfs_delete_object(struct reiserfs_transaction_handle *th, 3036f466c6fdSAl Viro struct inode *inode); 3037f466c6fdSAl Viro int reiserfs_do_truncate(struct reiserfs_transaction_handle *th, 3038f466c6fdSAl Viro struct inode *inode, struct page *, 3039f466c6fdSAl Viro int update_timestamps); 3040f466c6fdSAl Viro 3041f466c6fdSAl Viro #define i_block_size(inode) ((inode)->i_sb->s_blocksize) 3042f466c6fdSAl Viro #define file_size(inode) ((inode)->i_size) 3043f466c6fdSAl Viro #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1)) 3044f466c6fdSAl Viro 3045f466c6fdSAl Viro #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\ 3046f466c6fdSAl Viro !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 ) 3047f466c6fdSAl Viro 3048f466c6fdSAl Viro void padd_item(char *item, int total_length, int length); 3049f466c6fdSAl Viro 3050f466c6fdSAl Viro /* inode.c */ 3051f466c6fdSAl Viro /* args for the create parameter of reiserfs_get_block */ 3052f466c6fdSAl Viro #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */ 3053f466c6fdSAl Viro #define GET_BLOCK_CREATE 1 /* add anything you need to find block */ 3054f466c6fdSAl Viro #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */ 3055f466c6fdSAl Viro #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */ 3056f466c6fdSAl Viro #define GET_BLOCK_NO_IMUX 8 /* i_mutex is not held, don't preallocate */ 3057f466c6fdSAl Viro #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */ 3058f466c6fdSAl Viro 3059f466c6fdSAl Viro void reiserfs_read_locked_inode(struct inode *inode, 3060f466c6fdSAl Viro struct reiserfs_iget_args *args); 3061f466c6fdSAl Viro int reiserfs_find_actor(struct inode *inode, void *p); 3062f466c6fdSAl Viro int reiserfs_init_locked_inode(struct inode *inode, void *p); 3063f466c6fdSAl Viro void reiserfs_evict_inode(struct inode *inode); 3064f466c6fdSAl Viro int reiserfs_write_inode(struct inode *inode, struct writeback_control *wbc); 3065f466c6fdSAl Viro int reiserfs_get_block(struct inode *inode, sector_t block, 3066f466c6fdSAl Viro struct buffer_head *bh_result, int create); 3067f466c6fdSAl Viro struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid, 3068f466c6fdSAl Viro int fh_len, int fh_type); 3069f466c6fdSAl Viro struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid, 3070f466c6fdSAl Viro int fh_len, int fh_type); 3071b0b0382bSAl Viro int reiserfs_encode_fh(struct inode *inode, __u32 * data, int *lenp, 3072b0b0382bSAl Viro struct inode *parent); 3073f466c6fdSAl Viro 3074f466c6fdSAl Viro int reiserfs_truncate_file(struct inode *, int update_timestamps); 3075f466c6fdSAl Viro void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset, 3076f466c6fdSAl Viro int type, int key_length); 3077f466c6fdSAl Viro void make_le_item_head(struct item_head *ih, const struct cpu_key *key, 3078f466c6fdSAl Viro int version, 3079f466c6fdSAl Viro loff_t offset, int type, int length, int entry_count); 3080f466c6fdSAl Viro struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key); 3081f466c6fdSAl Viro 3082f466c6fdSAl Viro struct reiserfs_security_handle; 3083f466c6fdSAl Viro int reiserfs_new_inode(struct reiserfs_transaction_handle *th, 3084f466c6fdSAl Viro struct inode *dir, umode_t mode, 3085f466c6fdSAl Viro const char *symname, loff_t i_size, 3086f466c6fdSAl Viro struct dentry *dentry, struct inode *inode, 3087f466c6fdSAl Viro struct reiserfs_security_handle *security); 3088f466c6fdSAl Viro 3089f466c6fdSAl Viro void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th, 3090f466c6fdSAl Viro struct inode *inode, loff_t size); 3091f466c6fdSAl Viro 3092f466c6fdSAl Viro static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th, 3093f466c6fdSAl Viro struct inode *inode) 3094f466c6fdSAl Viro { 3095f466c6fdSAl Viro reiserfs_update_sd_size(th, inode, inode->i_size); 3096f466c6fdSAl Viro } 3097f466c6fdSAl Viro 3098f466c6fdSAl Viro void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode); 3099f466c6fdSAl Viro void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs); 3100f466c6fdSAl Viro int reiserfs_setattr(struct dentry *dentry, struct iattr *attr); 3101f466c6fdSAl Viro 3102f466c6fdSAl Viro int __reiserfs_write_begin(struct page *page, unsigned from, unsigned len); 3103f466c6fdSAl Viro 3104f466c6fdSAl Viro /* namei.c */ 3105f466c6fdSAl Viro void set_de_name_and_namelen(struct reiserfs_dir_entry *de); 3106f466c6fdSAl Viro int search_by_entry_key(struct super_block *sb, const struct cpu_key *key, 3107f466c6fdSAl Viro struct treepath *path, struct reiserfs_dir_entry *de); 3108f466c6fdSAl Viro struct dentry *reiserfs_get_parent(struct dentry *); 3109f466c6fdSAl Viro 3110f466c6fdSAl Viro #ifdef CONFIG_REISERFS_PROC_INFO 3111f466c6fdSAl Viro int reiserfs_proc_info_init(struct super_block *sb); 3112f466c6fdSAl Viro int reiserfs_proc_info_done(struct super_block *sb); 3113f466c6fdSAl Viro int reiserfs_proc_info_global_init(void); 3114f466c6fdSAl Viro int reiserfs_proc_info_global_done(void); 3115f466c6fdSAl Viro 3116f466c6fdSAl Viro #define PROC_EXP( e ) e 3117f466c6fdSAl Viro 3118f466c6fdSAl Viro #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data 3119f466c6fdSAl Viro #define PROC_INFO_MAX( sb, field, value ) \ 3120f466c6fdSAl Viro __PINFO( sb ).field = \ 3121f466c6fdSAl Viro max( REISERFS_SB( sb ) -> s_proc_info_data.field, value ) 3122f466c6fdSAl Viro #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) ) 3123f466c6fdSAl Viro #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) ) 3124f466c6fdSAl Viro #define PROC_INFO_BH_STAT( sb, bh, level ) \ 3125f466c6fdSAl Viro PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \ 3126f466c6fdSAl Viro PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \ 3127f466c6fdSAl Viro PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) ) 3128f466c6fdSAl Viro #else 3129f466c6fdSAl Viro static inline int reiserfs_proc_info_init(struct super_block *sb) 3130f466c6fdSAl Viro { 3131f466c6fdSAl Viro return 0; 3132f466c6fdSAl Viro } 3133f466c6fdSAl Viro 3134f466c6fdSAl Viro static inline int reiserfs_proc_info_done(struct super_block *sb) 3135f466c6fdSAl Viro { 3136f466c6fdSAl Viro return 0; 3137f466c6fdSAl Viro } 3138f466c6fdSAl Viro 3139f466c6fdSAl Viro static inline int reiserfs_proc_info_global_init(void) 3140f466c6fdSAl Viro { 3141f466c6fdSAl Viro return 0; 3142f466c6fdSAl Viro } 3143f466c6fdSAl Viro 3144f466c6fdSAl Viro static inline int reiserfs_proc_info_global_done(void) 3145f466c6fdSAl Viro { 3146f466c6fdSAl Viro return 0; 3147f466c6fdSAl Viro } 3148f466c6fdSAl Viro 3149f466c6fdSAl Viro #define PROC_EXP( e ) 3150f466c6fdSAl Viro #define VOID_V ( ( void ) 0 ) 3151f466c6fdSAl Viro #define PROC_INFO_MAX( sb, field, value ) VOID_V 3152f466c6fdSAl Viro #define PROC_INFO_INC( sb, field ) VOID_V 3153f466c6fdSAl Viro #define PROC_INFO_ADD( sb, field, val ) VOID_V 3154f466c6fdSAl Viro #define PROC_INFO_BH_STAT(sb, bh, n_node_level) VOID_V 3155f466c6fdSAl Viro #endif 3156f466c6fdSAl Viro 3157f466c6fdSAl Viro /* dir.c */ 3158f466c6fdSAl Viro extern const struct inode_operations reiserfs_dir_inode_operations; 3159f466c6fdSAl Viro extern const struct inode_operations reiserfs_symlink_inode_operations; 3160f466c6fdSAl Viro extern const struct inode_operations reiserfs_special_inode_operations; 3161f466c6fdSAl Viro extern const struct file_operations reiserfs_dir_operations; 3162cd62cdaeSAl Viro int reiserfs_readdir_inode(struct inode *, struct dir_context *); 3163f466c6fdSAl Viro 3164f466c6fdSAl Viro /* tail_conversion.c */ 3165f466c6fdSAl Viro int direct2indirect(struct reiserfs_transaction_handle *, struct inode *, 3166f466c6fdSAl Viro struct treepath *, struct buffer_head *, loff_t); 3167f466c6fdSAl Viro int indirect2direct(struct reiserfs_transaction_handle *, struct inode *, 3168f466c6fdSAl Viro struct page *, struct treepath *, const struct cpu_key *, 3169f466c6fdSAl Viro loff_t, char *); 3170f466c6fdSAl Viro void reiserfs_unmap_buffer(struct buffer_head *); 3171f466c6fdSAl Viro 3172f466c6fdSAl Viro /* file.c */ 3173f466c6fdSAl Viro extern const struct inode_operations reiserfs_file_inode_operations; 3174f466c6fdSAl Viro extern const struct file_operations reiserfs_file_operations; 3175f466c6fdSAl Viro extern const struct address_space_operations reiserfs_address_space_operations; 3176f466c6fdSAl Viro 3177f466c6fdSAl Viro /* fix_nodes.c */ 3178f466c6fdSAl Viro 3179f466c6fdSAl Viro int fix_nodes(int n_op_mode, struct tree_balance *tb, 3180f466c6fdSAl Viro struct item_head *ins_ih, const void *); 3181f466c6fdSAl Viro void unfix_nodes(struct tree_balance *); 3182f466c6fdSAl Viro 3183f466c6fdSAl Viro /* prints.c */ 3184f466c6fdSAl Viro void __reiserfs_panic(struct super_block *s, const char *id, 3185f466c6fdSAl Viro const char *function, const char *fmt, ...) 3186f466c6fdSAl Viro __attribute__ ((noreturn)); 3187f466c6fdSAl Viro #define reiserfs_panic(s, id, fmt, args...) \ 3188f466c6fdSAl Viro __reiserfs_panic(s, id, __func__, fmt, ##args) 3189f466c6fdSAl Viro void __reiserfs_error(struct super_block *s, const char *id, 3190f466c6fdSAl Viro const char *function, const char *fmt, ...); 3191f466c6fdSAl Viro #define reiserfs_error(s, id, fmt, args...) \ 3192f466c6fdSAl Viro __reiserfs_error(s, id, __func__, fmt, ##args) 3193f466c6fdSAl Viro void reiserfs_info(struct super_block *s, const char *fmt, ...); 3194f466c6fdSAl Viro void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...); 3195f466c6fdSAl Viro void print_indirect_item(struct buffer_head *bh, int item_num); 3196f466c6fdSAl Viro void store_print_tb(struct tree_balance *tb); 3197f466c6fdSAl Viro void print_cur_tb(char *mes); 3198f466c6fdSAl Viro void print_de(struct reiserfs_dir_entry *de); 3199f466c6fdSAl Viro void print_bi(struct buffer_info *bi, char *mes); 3200f466c6fdSAl Viro #define PRINT_LEAF_ITEMS 1 /* print all items */ 3201f466c6fdSAl Viro #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */ 3202f466c6fdSAl Viro #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */ 3203f466c6fdSAl Viro void print_block(struct buffer_head *bh, ...); 3204f466c6fdSAl Viro void print_bmap(struct super_block *s, int silent); 3205f466c6fdSAl Viro void print_bmap_block(int i, char *data, int size, int silent); 3206f466c6fdSAl Viro /*void print_super_block (struct super_block * s, char * mes);*/ 3207f466c6fdSAl Viro void print_objectid_map(struct super_block *s); 3208f466c6fdSAl Viro void print_block_head(struct buffer_head *bh, char *mes); 3209f466c6fdSAl Viro void check_leaf(struct buffer_head *bh); 3210f466c6fdSAl Viro void check_internal(struct buffer_head *bh); 3211f466c6fdSAl Viro void print_statistics(struct super_block *s); 3212f466c6fdSAl Viro char *reiserfs_hashname(int code); 3213f466c6fdSAl Viro 3214f466c6fdSAl Viro /* lbalance.c */ 3215f466c6fdSAl Viro int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num, 3216f466c6fdSAl Viro int mov_bytes, struct buffer_head *Snew); 3217f466c6fdSAl Viro int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes); 3218f466c6fdSAl Viro int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes); 3219f466c6fdSAl Viro void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first, 3220f466c6fdSAl Viro int del_num, int del_bytes); 3221f466c6fdSAl Viro void leaf_insert_into_buf(struct buffer_info *bi, int before, 322227d0e5bcSJeff Mahoney struct item_head * const inserted_item_ih, 322327d0e5bcSJeff Mahoney const char * const inserted_item_body, 3224f466c6fdSAl Viro int zeros_number); 322527d0e5bcSJeff Mahoney void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num, 322627d0e5bcSJeff Mahoney int pos_in_item, int paste_size, 322727d0e5bcSJeff Mahoney const char * const body, int zeros_number); 3228f466c6fdSAl Viro void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num, 3229f466c6fdSAl Viro int pos_in_item, int cut_size); 3230f466c6fdSAl Viro void leaf_paste_entries(struct buffer_info *bi, int item_num, int before, 3231f466c6fdSAl Viro int new_entry_count, struct reiserfs_de_head *new_dehs, 3232f466c6fdSAl Viro const char *records, int paste_size); 3233f466c6fdSAl Viro /* ibalance.c */ 3234f466c6fdSAl Viro int balance_internal(struct tree_balance *, int, int, struct item_head *, 3235f466c6fdSAl Viro struct buffer_head **); 3236f466c6fdSAl Viro 3237f466c6fdSAl Viro /* do_balance.c */ 3238f466c6fdSAl Viro void do_balance_mark_leaf_dirty(struct tree_balance *tb, 3239f466c6fdSAl Viro struct buffer_head *bh, int flag); 3240f466c6fdSAl Viro #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty 3241f466c6fdSAl Viro #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty 3242f466c6fdSAl Viro 3243f466c6fdSAl Viro void do_balance(struct tree_balance *tb, struct item_head *ih, 3244f466c6fdSAl Viro const char *body, int flag); 3245f466c6fdSAl Viro void reiserfs_invalidate_buffer(struct tree_balance *tb, 3246f466c6fdSAl Viro struct buffer_head *bh); 3247f466c6fdSAl Viro 3248f466c6fdSAl Viro int get_left_neighbor_position(struct tree_balance *tb, int h); 3249f466c6fdSAl Viro int get_right_neighbor_position(struct tree_balance *tb, int h); 3250f466c6fdSAl Viro void replace_key(struct tree_balance *tb, struct buffer_head *, int, 3251f466c6fdSAl Viro struct buffer_head *, int); 3252f466c6fdSAl Viro void make_empty_node(struct buffer_info *); 3253f466c6fdSAl Viro struct buffer_head *get_FEB(struct tree_balance *); 3254f466c6fdSAl Viro 3255f466c6fdSAl Viro /* bitmap.c */ 3256f466c6fdSAl Viro 3257098297b2SJeff Mahoney /* 3258098297b2SJeff Mahoney * structure contains hints for block allocator, and it is a container for 3259098297b2SJeff Mahoney * arguments, such as node, search path, transaction_handle, etc. 3260098297b2SJeff Mahoney */ 3261f466c6fdSAl Viro struct __reiserfs_blocknr_hint { 3262098297b2SJeff Mahoney /* inode passed to allocator, if we allocate unf. nodes */ 3263098297b2SJeff Mahoney struct inode *inode; 3264098297b2SJeff Mahoney 3265f466c6fdSAl Viro sector_t block; /* file offset, in blocks */ 3266f466c6fdSAl Viro struct in_core_key key; 3267f466c6fdSAl Viro 3268098297b2SJeff Mahoney /* 3269098297b2SJeff Mahoney * search path, used by allocator to deternine search_start by 3270098297b2SJeff Mahoney * various ways 3271098297b2SJeff Mahoney */ 3272098297b2SJeff Mahoney struct treepath *path; 3273098297b2SJeff Mahoney 3274098297b2SJeff Mahoney /* 3275098297b2SJeff Mahoney * transaction handle is needed to log super blocks 3276098297b2SJeff Mahoney * and bitmap blocks changes 3277098297b2SJeff Mahoney */ 3278098297b2SJeff Mahoney struct reiserfs_transaction_handle *th; 3279098297b2SJeff Mahoney 3280098297b2SJeff Mahoney b_blocknr_t beg, end; 3281098297b2SJeff Mahoney 3282098297b2SJeff Mahoney /* 3283098297b2SJeff Mahoney * a field used to transfer search start value (block number) 3284098297b2SJeff Mahoney * between different block allocator procedures 3285098297b2SJeff Mahoney * (determine_search_start() and others) 3286098297b2SJeff Mahoney */ 3287098297b2SJeff Mahoney b_blocknr_t search_start; 3288098297b2SJeff Mahoney 3289098297b2SJeff Mahoney /* 3290098297b2SJeff Mahoney * is set in determine_prealloc_size() function, 3291098297b2SJeff Mahoney * used by underlayed function that do actual allocation 3292098297b2SJeff Mahoney */ 3293098297b2SJeff Mahoney int prealloc_size; 3294098297b2SJeff Mahoney 3295098297b2SJeff Mahoney /* 3296098297b2SJeff Mahoney * the allocator uses different polices for getting disk 3297098297b2SJeff Mahoney * space for formatted/unformatted blocks with/without preallocation 3298098297b2SJeff Mahoney */ 3299098297b2SJeff Mahoney unsigned formatted_node:1; 3300f466c6fdSAl Viro unsigned preallocate:1; 3301f466c6fdSAl Viro }; 3302f466c6fdSAl Viro 3303f466c6fdSAl Viro typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t; 3304f466c6fdSAl Viro 3305f466c6fdSAl Viro int reiserfs_parse_alloc_options(struct super_block *, char *); 3306f466c6fdSAl Viro void reiserfs_init_alloc_options(struct super_block *s); 3307f466c6fdSAl Viro 3308f466c6fdSAl Viro /* 3309f466c6fdSAl Viro * given a directory, this will tell you what packing locality 3310f466c6fdSAl Viro * to use for a new object underneat it. The locality is returned 3311f466c6fdSAl Viro * in disk byte order (le). 3312f466c6fdSAl Viro */ 3313f466c6fdSAl Viro __le32 reiserfs_choose_packing(struct inode *dir); 3314f466c6fdSAl Viro 3315ea0856cdSRashika Kheria void show_alloc_options(struct seq_file *seq, struct super_block *s); 3316f466c6fdSAl Viro int reiserfs_init_bitmap_cache(struct super_block *sb); 3317f466c6fdSAl Viro void reiserfs_free_bitmap_cache(struct super_block *sb); 3318f466c6fdSAl Viro void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info); 3319f466c6fdSAl Viro struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap); 3320f466c6fdSAl Viro int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value); 3321f466c6fdSAl Viro void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *, 3322f466c6fdSAl Viro b_blocknr_t, int for_unformatted); 3323f466c6fdSAl Viro int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int, 3324f466c6fdSAl Viro int); 3325f466c6fdSAl Viro static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb, 3326f466c6fdSAl Viro b_blocknr_t * new_blocknrs, 3327f466c6fdSAl Viro int amount_needed) 3328f466c6fdSAl Viro { 3329f466c6fdSAl Viro reiserfs_blocknr_hint_t hint = { 3330f466c6fdSAl Viro .th = tb->transaction_handle, 3331f466c6fdSAl Viro .path = tb->tb_path, 3332f466c6fdSAl Viro .inode = NULL, 3333f466c6fdSAl Viro .key = tb->key, 3334f466c6fdSAl Viro .block = 0, 3335f466c6fdSAl Viro .formatted_node = 1 3336f466c6fdSAl Viro }; 3337f466c6fdSAl Viro return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed, 3338f466c6fdSAl Viro 0); 3339f466c6fdSAl Viro } 3340f466c6fdSAl Viro 3341f466c6fdSAl Viro static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle 3342f466c6fdSAl Viro *th, struct inode *inode, 3343f466c6fdSAl Viro b_blocknr_t * new_blocknrs, 3344f466c6fdSAl Viro struct treepath *path, 3345f466c6fdSAl Viro sector_t block) 3346f466c6fdSAl Viro { 3347f466c6fdSAl Viro reiserfs_blocknr_hint_t hint = { 3348f466c6fdSAl Viro .th = th, 3349f466c6fdSAl Viro .path = path, 3350f466c6fdSAl Viro .inode = inode, 3351f466c6fdSAl Viro .block = block, 3352f466c6fdSAl Viro .formatted_node = 0, 3353f466c6fdSAl Viro .preallocate = 0 3354f466c6fdSAl Viro }; 3355f466c6fdSAl Viro return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0); 3356f466c6fdSAl Viro } 3357f466c6fdSAl Viro 3358f466c6fdSAl Viro #ifdef REISERFS_PREALLOCATE 3359f466c6fdSAl Viro static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle 3360f466c6fdSAl Viro *th, struct inode *inode, 3361f466c6fdSAl Viro b_blocknr_t * new_blocknrs, 3362f466c6fdSAl Viro struct treepath *path, 3363f466c6fdSAl Viro sector_t block) 3364f466c6fdSAl Viro { 3365f466c6fdSAl Viro reiserfs_blocknr_hint_t hint = { 3366f466c6fdSAl Viro .th = th, 3367f466c6fdSAl Viro .path = path, 3368f466c6fdSAl Viro .inode = inode, 3369f466c6fdSAl Viro .block = block, 3370f466c6fdSAl Viro .formatted_node = 0, 3371f466c6fdSAl Viro .preallocate = 1 3372f466c6fdSAl Viro }; 3373f466c6fdSAl Viro return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0); 3374f466c6fdSAl Viro } 3375f466c6fdSAl Viro 3376f466c6fdSAl Viro void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th, 3377f466c6fdSAl Viro struct inode *inode); 3378f466c6fdSAl Viro void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th); 3379f466c6fdSAl Viro #endif 3380f466c6fdSAl Viro 3381f466c6fdSAl Viro /* hashes.c */ 3382f466c6fdSAl Viro __u32 keyed_hash(const signed char *msg, int len); 3383f466c6fdSAl Viro __u32 yura_hash(const signed char *msg, int len); 3384f466c6fdSAl Viro __u32 r5_hash(const signed char *msg, int len); 3385f466c6fdSAl Viro 3386f466c6fdSAl Viro #define reiserfs_set_le_bit __set_bit_le 3387f466c6fdSAl Viro #define reiserfs_test_and_set_le_bit __test_and_set_bit_le 3388f466c6fdSAl Viro #define reiserfs_clear_le_bit __clear_bit_le 3389f466c6fdSAl Viro #define reiserfs_test_and_clear_le_bit __test_and_clear_bit_le 3390f466c6fdSAl Viro #define reiserfs_test_le_bit test_bit_le 3391f466c6fdSAl Viro #define reiserfs_find_next_zero_le_bit find_next_zero_bit_le 3392f466c6fdSAl Viro 3393098297b2SJeff Mahoney /* 3394098297b2SJeff Mahoney * sometimes reiserfs_truncate may require to allocate few new blocks 3395098297b2SJeff Mahoney * to perform indirect2direct conversion. People probably used to 3396098297b2SJeff Mahoney * think, that truncate should work without problems on a filesystem 3397098297b2SJeff Mahoney * without free disk space. They may complain that they can not 3398098297b2SJeff Mahoney * truncate due to lack of free disk space. This spare space allows us 3399098297b2SJeff Mahoney * to not worry about it. 500 is probably too much, but it should be 3400098297b2SJeff Mahoney * absolutely safe 3401098297b2SJeff Mahoney */ 3402f466c6fdSAl Viro #define SPARE_SPACE 500 3403f466c6fdSAl Viro 3404f466c6fdSAl Viro /* prototypes from ioctl.c */ 3405f466c6fdSAl Viro long reiserfs_ioctl(struct file *filp, unsigned int cmd, unsigned long arg); 3406f466c6fdSAl Viro long reiserfs_compat_ioctl(struct file *filp, 3407f466c6fdSAl Viro unsigned int cmd, unsigned long arg); 3408f466c6fdSAl Viro int reiserfs_unpack(struct inode *inode, struct file *filp); 3409