^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) /* SPDX-License-Identifier: GPL-2.0 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) * Copyright 1996, 1997, 1998 Hans Reiser, see reiserfs/README for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) * licensing and copyright details
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7) #include <linux/reiserfs_fs.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) #include <linux/slab.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) #include <linux/interrupt.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11) #include <linux/sched.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) #include <linux/bug.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) #include <linux/workqueue.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) #include <asm/unaligned.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) #include <linux/bitops.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) #include <linux/proc_fs.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) #include <linux/buffer_head.h>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19) /* the 32 bit compat definitions with int argument */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) #define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) #define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) #define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23) #define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) #define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) struct reiserfs_journal_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28) /* bitmasks for i_flags field in reiserfs-specific part of inode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) typedef enum {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31) * this says what format of key do all items (but stat data) of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) * an object have. If this is set, that format is 3.6 otherwise - 3.5
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) i_item_key_version_mask = 0x0001,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) * If this is unset, object has 3.5 stat data, otherwise,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38) * it has 3.6 stat data with 64bit size, 32bit nlink etc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40) i_stat_data_version_mask = 0x0002,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) /* file might need tail packing on close */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43) i_pack_on_close_mask = 0x0004,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) /* don't pack tail of file */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) i_nopack_mask = 0x0008,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49) * If either of these are set, "safe link" was created for this
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) * file during truncate or unlink. Safe link is used to avoid
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) * leakage of disk space on crash with some files open, but unlinked.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) i_link_saved_unlink_mask = 0x0010,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) i_link_saved_truncate_mask = 0x0020,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) i_has_xattr_dir = 0x0040,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) i_data_log = 0x0080,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) } reiserfs_inode_flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) struct reiserfs_inode_info {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61) __u32 i_key[4]; /* key is still 4 32 bit integers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64) * transient inode flags that are never stored on disk. Bitmasks
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) * for this field are defined above.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) __u32 i_flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) /* offset of first byte stored in direct item. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) __u32 i_first_direct_byte;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) /* copy of persistent inode flags read from sd_attrs. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) __u32 i_attrs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) /* first unused block of a sequence of unused blocks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) int i_prealloc_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) int i_prealloc_count; /* length of that sequence */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) /* per-transaction list of inodes which have preallocated blocks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) struct list_head i_prealloc_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) * new_packing_locality is created; new blocks for the contents
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) * of this directory should be displaced
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86) unsigned new_packing_locality:1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) * we use these for fsync or O_SYNC to decide which transaction
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) * needs to be committed in order for this inode to be properly
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91) * flushed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) unsigned int i_trans_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) struct reiserfs_journal_list *i_jl;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) atomic_t openers;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97) struct mutex tailpack;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) #ifdef CONFIG_REISERFS_FS_XATTR
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) struct rw_semaphore i_xattr_sem;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) #ifdef CONFIG_QUOTA
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) struct dquot *i_dquot[MAXQUOTAS];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) struct inode vfs_inode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) typedef enum {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) reiserfs_attrs_cleared = 0x00000001,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) } reiserfs_super_block_flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) * struct reiserfs_super_block accessors/mutators since this is a disk
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114) * structure, it will always be in little endian format.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) #define sb_block_count(sbp) (le32_to_cpu((sbp)->s_v1.s_block_count))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) #define set_sb_block_count(sbp,v) ((sbp)->s_v1.s_block_count = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) #define sb_free_blocks(sbp) (le32_to_cpu((sbp)->s_v1.s_free_blocks))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) #define set_sb_free_blocks(sbp,v) ((sbp)->s_v1.s_free_blocks = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) #define sb_root_block(sbp) (le32_to_cpu((sbp)->s_v1.s_root_block))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) #define set_sb_root_block(sbp,v) ((sbp)->s_v1.s_root_block = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) #define sb_jp_journal_1st_block(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_1st_block))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) #define set_sb_jp_journal_1st_block(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) ((sbp)->s_v1.s_journal.jp_journal_1st_block = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) #define sb_jp_journal_dev(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_dev))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129) #define set_sb_jp_journal_dev(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) ((sbp)->s_v1.s_journal.jp_journal_dev = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) #define sb_jp_journal_size(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_size))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133) #define set_sb_jp_journal_size(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) ((sbp)->s_v1.s_journal.jp_journal_size = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) #define sb_jp_journal_trans_max(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_trans_max))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) #define set_sb_jp_journal_trans_max(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) ((sbp)->s_v1.s_journal.jp_journal_trans_max = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) #define sb_jp_journal_magic(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_magic))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) #define set_sb_jp_journal_magic(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) ((sbp)->s_v1.s_journal.jp_journal_magic = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) #define sb_jp_journal_max_batch(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_batch))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145) #define set_sb_jp_journal_max_batch(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) ((sbp)->s_v1.s_journal.jp_journal_max_batch = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147) #define sb_jp_jourmal_max_commit_age(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_commit_age))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) #define set_sb_jp_journal_max_commit_age(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) ((sbp)->s_v1.s_journal.jp_journal_max_commit_age = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) #define sb_blocksize(sbp) (le16_to_cpu((sbp)->s_v1.s_blocksize))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) #define set_sb_blocksize(sbp,v) ((sbp)->s_v1.s_blocksize = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154) #define sb_oid_maxsize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_maxsize))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) #define set_sb_oid_maxsize(sbp,v) ((sbp)->s_v1.s_oid_maxsize = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) #define sb_oid_cursize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_cursize))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157) #define set_sb_oid_cursize(sbp,v) ((sbp)->s_v1.s_oid_cursize = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) #define sb_umount_state(sbp) (le16_to_cpu((sbp)->s_v1.s_umount_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) #define set_sb_umount_state(sbp,v) ((sbp)->s_v1.s_umount_state = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) #define sb_fs_state(sbp) (le16_to_cpu((sbp)->s_v1.s_fs_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) #define set_sb_fs_state(sbp,v) ((sbp)->s_v1.s_fs_state = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) #define sb_hash_function_code(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) (le32_to_cpu((sbp)->s_v1.s_hash_function_code))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164) #define set_sb_hash_function_code(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) ((sbp)->s_v1.s_hash_function_code = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) #define sb_tree_height(sbp) (le16_to_cpu((sbp)->s_v1.s_tree_height))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) #define set_sb_tree_height(sbp,v) ((sbp)->s_v1.s_tree_height = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) #define sb_bmap_nr(sbp) (le16_to_cpu((sbp)->s_v1.s_bmap_nr))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169) #define set_sb_bmap_nr(sbp,v) ((sbp)->s_v1.s_bmap_nr = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) #define sb_version(sbp) (le16_to_cpu((sbp)->s_v1.s_version))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) #define set_sb_version(sbp,v) ((sbp)->s_v1.s_version = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173) #define sb_mnt_count(sbp) (le16_to_cpu((sbp)->s_mnt_count))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) #define set_sb_mnt_count(sbp, v) ((sbp)->s_mnt_count = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) #define sb_reserved_for_journal(sbp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177) (le16_to_cpu((sbp)->s_v1.s_reserved_for_journal))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) #define set_sb_reserved_for_journal(sbp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) ((sbp)->s_v1.s_reserved_for_journal = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181) /* LOGGING -- */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) * These all interelate for performance.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186) * If the journal block count is smaller than n transactions, you lose speed.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) * I don't know what n is yet, I'm guessing 8-16.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) * typical transaction size depends on the application, how often fsync is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190) * called, and how many metadata blocks you dirty in a 30 second period.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) * The more small files (<16k) you use, the larger your transactions will
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) * be.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) * If your journal fills faster than dirty buffers get flushed to disk, it
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) * must flush them before allowing the journal to wrap, which slows things
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196) * down. If you need high speed meta data updates, the journal should be
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) * big enough to prevent wrapping before dirty meta blocks get to disk.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) * If the batch max is smaller than the transaction max, you'll waste space
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) * at the end of the journal because journal_end sets the next transaction
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201) * to start at 0 if the next transaction has any chance of wrapping.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) * The large the batch max age, the better the speed, and the more meta
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) * data changes you'll lose after a crash.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) /* don't mess with these for a while */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) /* we have a node size define somewhere in reiserfs_fs.h. -Hans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) #define JOURNAL_BLOCK_SIZE 4096 /* BUG gotta get rid of this */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) #define JOURNAL_MAX_CNODE 1500 /* max cnodes to allocate. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211) #define JOURNAL_HASH_SIZE 8192
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) /* number of copies of the bitmaps to have floating. Must be >= 2 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) #define JOURNAL_NUM_BITMAPS 5
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) * One of these for every block in every transaction
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) * Each one is in two hash tables. First, a hash of the current transaction,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) * and after journal_end, a hash of all the in memory transactions.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220) * next and prev are used by the current transaction (journal_hash).
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) * hnext and hprev are used by journal_list_hash. If a block is in more
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) * than one transaction, the journal_list_hash links it in multiple times.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) * This allows flush_journal_list to remove just the cnode belonging to a
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) * given transaction.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226) struct reiserfs_journal_cnode {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) struct buffer_head *bh; /* real buffer head */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) struct super_block *sb; /* dev of real buffer head */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230) /* block number of real buffer head, == 0 when buffer on disk */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) __u32 blocknr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) unsigned long state;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) /* journal list this cnode lives in */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236) struct reiserfs_journal_list *jlist;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) struct reiserfs_journal_cnode *next; /* next in transaction list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239) struct reiserfs_journal_cnode *prev; /* prev in transaction list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) struct reiserfs_journal_cnode *hprev; /* prev in hash list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) struct reiserfs_journal_cnode *hnext; /* next in hash list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244) struct reiserfs_bitmap_node {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) int id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) char *data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247) struct list_head list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) struct reiserfs_list_bitmap {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251) struct reiserfs_journal_list *journal_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) struct reiserfs_bitmap_node **bitmaps;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) * one of these for each transaction. The most important part here is the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 257) * j_realblock. this list of cnodes is used to hash all the blocks in all
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 258) * the commits, to mark all the real buffer heads dirty once all the commits
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 259) * hit the disk, and to make sure every real block in a transaction is on
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 260) * disk before allowing the log area to be overwritten
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 261) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 262) struct reiserfs_journal_list {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 263) unsigned long j_start;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 264) unsigned long j_state;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 265) unsigned long j_len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 266) atomic_t j_nonzerolen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 267) atomic_t j_commit_left;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 268)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 269) /* all commits older than this on disk */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 270) atomic_t j_older_commits_done;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 271)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 272) struct mutex j_commit_mutex;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 273) unsigned int j_trans_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 274) time64_t j_timestamp; /* write-only but useful for crash dump analysis */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 275) struct reiserfs_list_bitmap *j_list_bitmap;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 276) struct buffer_head *j_commit_bh; /* commit buffer head */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 277) struct reiserfs_journal_cnode *j_realblock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 278) struct reiserfs_journal_cnode *j_freedlist; /* list of buffers that were freed during this trans. free each of these on flush */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 279) /* time ordered list of all active transactions */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 280) struct list_head j_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 281)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 282) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 283) * time ordered list of all transactions we haven't tried
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 284) * to flush yet
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 285) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 286) struct list_head j_working_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 287)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 288) /* list of tail conversion targets in need of flush before commit */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 289) struct list_head j_tail_bh_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 290)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 291) /* list of data=ordered buffers in need of flush before commit */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 292) struct list_head j_bh_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 293) int j_refcount;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 294) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 295)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 296) struct reiserfs_journal {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 297) struct buffer_head **j_ap_blocks; /* journal blocks on disk */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 298) /* newest journal block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 299) struct reiserfs_journal_cnode *j_last;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 300)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 301) /* oldest journal block. start here for traverse */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 302) struct reiserfs_journal_cnode *j_first;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 303)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 304) struct block_device *j_dev_bd;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 305) fmode_t j_dev_mode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 306)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 307) /* first block on s_dev of reserved area journal */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 308) int j_1st_reserved_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 309)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 310) unsigned long j_state;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 311) unsigned int j_trans_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 312) unsigned long j_mount_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 313)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 314) /* start of current waiting commit (index into j_ap_blocks) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 315) unsigned long j_start;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 316) unsigned long j_len; /* length of current waiting commit */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 317)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 318) /* number of buffers requested by journal_begin() */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 319) unsigned long j_len_alloc;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 320)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 321) atomic_t j_wcount; /* count of writers for current commit */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 322)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 323) /* batch count. allows turning X transactions into 1 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 324) unsigned long j_bcount;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 325)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 326) /* first unflushed transactions offset */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 327) unsigned long j_first_unflushed_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 328)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 329) /* last fully flushed journal timestamp */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 330) unsigned j_last_flush_trans_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 331)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 332) struct buffer_head *j_header_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 333)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 334) time64_t j_trans_start_time; /* time this transaction started */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 335) struct mutex j_mutex;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 336) struct mutex j_flush_mutex;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 337)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 338) /* wait for current transaction to finish before starting new one */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 339) wait_queue_head_t j_join_wait;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 340)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 341) atomic_t j_jlock; /* lock for j_join_wait */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 342) int j_list_bitmap_index; /* number of next list bitmap to use */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 343)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 344) /* no more journal begins allowed. MUST sleep on j_join_wait */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 345) int j_must_wait;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 346)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 347) /* next journal_end will flush all journal list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 348) int j_next_full_flush;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 349)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 350) /* next journal_end will flush all async commits */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 351) int j_next_async_flush;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 352)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 353) int j_cnode_used; /* number of cnodes on the used list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 354) int j_cnode_free; /* number of cnodes on the free list */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 355)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 356) /* max number of blocks in a transaction. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 357) unsigned int j_trans_max;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 358)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 359) /* max number of blocks to batch into a trans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 360) unsigned int j_max_batch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 361)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 362) /* in seconds, how old can an async commit be */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 363) unsigned int j_max_commit_age;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 364)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 365) /* in seconds, how old can a transaction be */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 366) unsigned int j_max_trans_age;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 367)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 368) /* the default for the max commit age */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 369) unsigned int j_default_max_commit_age;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 370)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 371) struct reiserfs_journal_cnode *j_cnode_free_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 372)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 373) /* orig pointer returned from vmalloc */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 374) struct reiserfs_journal_cnode *j_cnode_free_orig;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 375)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 376) struct reiserfs_journal_list *j_current_jl;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 377) int j_free_bitmap_nodes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 378) int j_used_bitmap_nodes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 379)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 380) int j_num_lists; /* total number of active transactions */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 381) int j_num_work_lists; /* number that need attention from kreiserfsd */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 382)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 383) /* debugging to make sure things are flushed in order */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 384) unsigned int j_last_flush_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 385)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 386) /* debugging to make sure things are committed in order */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 387) unsigned int j_last_commit_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 388)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 389) struct list_head j_bitmap_nodes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 390) struct list_head j_dirty_buffers;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 391) spinlock_t j_dirty_buffers_lock; /* protects j_dirty_buffers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 392)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 393) /* list of all active transactions */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 394) struct list_head j_journal_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 395)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 396) /* lists that haven't been touched by writeback attempts */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 397) struct list_head j_working_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 398)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 399) /* hash table for real buffer heads in current trans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 400) struct reiserfs_journal_cnode *j_hash_table[JOURNAL_HASH_SIZE];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 401)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 402) /* hash table for all the real buffer heads in all the transactions */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 403) struct reiserfs_journal_cnode *j_list_hash_table[JOURNAL_HASH_SIZE];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 404)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 405) /* array of bitmaps to record the deleted blocks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 406) struct reiserfs_list_bitmap j_list_bitmap[JOURNAL_NUM_BITMAPS];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 407)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 408) /* list of inodes which have preallocated blocks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 409) struct list_head j_prealloc_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 410) int j_persistent_trans;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 411) unsigned long j_max_trans_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 412) unsigned long j_max_batch_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 413)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 414) int j_errno;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 415)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 416) /* when flushing ordered buffers, throttle new ordered writers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 417) struct delayed_work j_work;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 418) struct super_block *j_work_sb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 419) atomic_t j_async_throttle;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 420) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 421)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 422) enum journal_state_bits {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 423) J_WRITERS_BLOCKED = 1, /* set when new writers not allowed */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 424) J_WRITERS_QUEUED, /* set when log is full due to too many writers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 425) J_ABORTED, /* set when log is aborted */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 426) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 427)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 428) /* ick. magic string to find desc blocks in the journal */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 429) #define JOURNAL_DESC_MAGIC "ReIsErLB"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 430)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 431) typedef __u32(*hashf_t) (const signed char *, int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 432)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 433) struct reiserfs_bitmap_info {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 434) __u32 free_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 435) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 436)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 437) struct proc_dir_entry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 438)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 439) #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 440) typedef unsigned long int stat_cnt_t;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 441) typedef struct reiserfs_proc_info_data {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 442) spinlock_t lock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 443) int exiting;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 444) int max_hash_collisions;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 445)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 446) stat_cnt_t breads;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 447) stat_cnt_t bread_miss;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 448) stat_cnt_t search_by_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 449) stat_cnt_t search_by_key_fs_changed;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 450) stat_cnt_t search_by_key_restarted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 451)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 452) stat_cnt_t insert_item_restarted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 453) stat_cnt_t paste_into_item_restarted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 454) stat_cnt_t cut_from_item_restarted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 455) stat_cnt_t delete_solid_item_restarted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 456) stat_cnt_t delete_item_restarted;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 457)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 458) stat_cnt_t leaked_oid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 459) stat_cnt_t leaves_removable;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 460)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 461) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 462) * balances per level.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 463) * Use explicit 5 as MAX_HEIGHT is not visible yet.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 464) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 465) stat_cnt_t balance_at[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 466) /* sbk == search_by_key */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 467) stat_cnt_t sbk_read_at[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 468) stat_cnt_t sbk_fs_changed[5];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 469) stat_cnt_t sbk_restarted[5];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 470) stat_cnt_t items_at[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 471) stat_cnt_t free_at[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 472) stat_cnt_t can_node_be_removed[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 473) long int lnum[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 474) long int rnum[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 475) long int lbytes[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 476) long int rbytes[5]; /* XXX */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 477) stat_cnt_t get_neighbors[5];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 478) stat_cnt_t get_neighbors_restart[5];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 479) stat_cnt_t need_l_neighbor[5];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 480) stat_cnt_t need_r_neighbor[5];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 481)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 482) stat_cnt_t free_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 483) struct __scan_bitmap_stats {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 484) stat_cnt_t call;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 485) stat_cnt_t wait;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 486) stat_cnt_t bmap;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 487) stat_cnt_t retry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 488) stat_cnt_t in_journal_hint;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 489) stat_cnt_t in_journal_nohint;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 490) stat_cnt_t stolen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 491) } scan_bitmap;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 492) struct __journal_stats {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 493) stat_cnt_t in_journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 494) stat_cnt_t in_journal_bitmap;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 495) stat_cnt_t in_journal_reusable;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 496) stat_cnt_t lock_journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 497) stat_cnt_t lock_journal_wait;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 498) stat_cnt_t journal_being;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 499) stat_cnt_t journal_relock_writers;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 500) stat_cnt_t journal_relock_wcount;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 501) stat_cnt_t mark_dirty;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 502) stat_cnt_t mark_dirty_already;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 503) stat_cnt_t mark_dirty_notjournal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 504) stat_cnt_t restore_prepared;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 505) stat_cnt_t prepare;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 506) stat_cnt_t prepare_retry;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 507) } journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 508) } reiserfs_proc_info_data_t;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 509) #else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 510) typedef struct reiserfs_proc_info_data {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 511) } reiserfs_proc_info_data_t;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 512) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 513)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 514) /* Number of quota types we support */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 515) #define REISERFS_MAXQUOTAS 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 516)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 517) /* reiserfs union of in-core super block data */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 518) struct reiserfs_sb_info {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 519) /* Buffer containing the super block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 520) struct buffer_head *s_sbh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 521)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 522) /* Pointer to the on-disk super block in the buffer */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 523) struct reiserfs_super_block *s_rs;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 524) struct reiserfs_bitmap_info *s_ap_bitmap;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 525)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 526) /* pointer to journal information */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 527) struct reiserfs_journal *s_journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 528)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 529) unsigned short s_mount_state; /* reiserfs state (valid, invalid) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 530)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 531) /* Serialize writers access, replace the old bkl */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 532) struct mutex lock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 533)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 534) /* Owner of the lock (can be recursive) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 535) struct task_struct *lock_owner;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 536)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 537) /* Depth of the lock, start from -1 like the bkl */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 538) int lock_depth;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 539)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 540) struct workqueue_struct *commit_wq;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 541)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 542) /* Comment? -Hans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 543) void (*end_io_handler) (struct buffer_head *, int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 544)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 545) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 546) * pointer to function which is used to sort names in directory.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 547) * Set on mount
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 548) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 549) hashf_t s_hash_function;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 550)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 551) /* reiserfs's mount options are set here */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 552) unsigned long s_mount_opt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 553)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 554) /* This is a structure that describes block allocator options */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 555) struct {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 556) /* Bitfield for enable/disable kind of options */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 557) unsigned long bits;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 558)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 559) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 560) * size started from which we consider file
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 561) * to be a large one (in blocks)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 562) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 563) unsigned long large_file_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 564)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 565) int border; /* percentage of disk, border takes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 566)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 567) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 568) * Minimal file size (in blocks) starting
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 569) * from which we do preallocations
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 570) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 571) int preallocmin;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 572)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 573) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 574) * Number of blocks we try to prealloc when file
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 575) * reaches preallocmin size (in blocks) or prealloc_list
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 576) is empty.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 577) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 578) int preallocsize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 579) } s_alloc_options;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 580)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 581) /* Comment? -Hans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 582) wait_queue_head_t s_wait;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 583) /* increased by one every time the tree gets re-balanced */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 584) atomic_t s_generation_counter;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 585)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 586) /* File system properties. Currently holds on-disk FS format */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 587) unsigned long s_properties;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 588)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 589) /* session statistics */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 590) int s_disk_reads;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 591) int s_disk_writes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 592) int s_fix_nodes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 593) int s_do_balance;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 594) int s_unneeded_left_neighbor;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 595) int s_good_search_by_key_reada;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 596) int s_bmaps;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 597) int s_bmaps_without_search;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 598) int s_direct2indirect;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 599) int s_indirect2direct;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 600)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 601) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 602) * set up when it's ok for reiserfs_read_inode2() to read from
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 603) * disk inode with nlink==0. Currently this is only used during
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 604) * finish_unfinished() processing at mount time
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 605) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 606) int s_is_unlinked_ok;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 607)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 608) reiserfs_proc_info_data_t s_proc_info_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 609) struct proc_dir_entry *procdir;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 610)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 611) /* amount of blocks reserved for further allocations */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 612) int reserved_blocks;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 613)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 614)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 615) /* this lock on now only used to protect reserved_blocks variable */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 616) spinlock_t bitmap_lock;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 617) struct dentry *priv_root; /* root of /.reiserfs_priv */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 618) struct dentry *xattr_root; /* root of /.reiserfs_priv/xattrs */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 619) int j_errno;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 620)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 621) int work_queued; /* non-zero delayed work is queued */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 622) struct delayed_work old_work; /* old transactions flush delayed work */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 623) spinlock_t old_work_lock; /* protects old_work and work_queued */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 624)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 625) #ifdef CONFIG_QUOTA
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 626) char *s_qf_names[REISERFS_MAXQUOTAS];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 627) int s_jquota_fmt;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 628) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 629) char *s_jdev; /* Stored jdev for mount option showing */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 630) #ifdef CONFIG_REISERFS_CHECK
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 631)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 632) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 633) * Detects whether more than one copy of tb exists per superblock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 634) * as a means of checking whether do_balance is executing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 635) * concurrently against another tree reader/writer on a same
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 636) * mount point.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 637) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 638) struct tree_balance *cur_tb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 639) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 640) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 641)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 642) /* Definitions of reiserfs on-disk properties: */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 643) #define REISERFS_3_5 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 644) #define REISERFS_3_6 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 645) #define REISERFS_OLD_FORMAT 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 646)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 647) /* Mount options */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 648) enum reiserfs_mount_options {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 649) /* large tails will be created in a session */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 650) REISERFS_LARGETAIL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 651) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 652) * small (for files less than block size) tails will
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 653) * be created in a session
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 654) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 655) REISERFS_SMALLTAIL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 656)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 657) /* replay journal and return 0. Use by fsck */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 658) REPLAYONLY,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 659)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 660) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 661) * -o conv: causes conversion of old format super block to the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 662) * new format. If not specified - old partition will be dealt
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 663) * with in a manner of 3.5.x
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 664) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 665) REISERFS_CONVERT,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 666)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 667) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 668) * -o hash={tea, rupasov, r5, detect} is meant for properly mounting
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 669) * reiserfs disks from 3.5.19 or earlier. 99% of the time, this
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 670) * option is not required. If the normal autodection code can't
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 671) * determine which hash to use (because both hashes had the same
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 672) * value for a file) use this option to force a specific hash.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 673) * It won't allow you to override the existing hash on the FS, so
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 674) * if you have a tea hash disk, and mount with -o hash=rupasov,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 675) * the mount will fail.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 676) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 677) FORCE_TEA_HASH, /* try to force tea hash on mount */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 678) FORCE_RUPASOV_HASH, /* try to force rupasov hash on mount */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 679) FORCE_R5_HASH, /* try to force rupasov hash on mount */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 680) FORCE_HASH_DETECT, /* try to detect hash function on mount */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 681)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 682) REISERFS_DATA_LOG,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 683) REISERFS_DATA_ORDERED,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 684) REISERFS_DATA_WRITEBACK,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 685)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 686) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 687) * used for testing experimental features, makes benchmarking new
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 688) * features with and without more convenient, should never be used by
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 689) * users in any code shipped to users (ideally)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 690) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 691)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 692) REISERFS_NO_BORDER,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 693) REISERFS_NO_UNHASHED_RELOCATION,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 694) REISERFS_HASHED_RELOCATION,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 695) REISERFS_ATTRS,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 696) REISERFS_XATTRS_USER,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 697) REISERFS_POSIXACL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 698) REISERFS_EXPOSE_PRIVROOT,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 699) REISERFS_BARRIER_NONE,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 700) REISERFS_BARRIER_FLUSH,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 701)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 702) /* Actions on error */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 703) REISERFS_ERROR_PANIC,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 704) REISERFS_ERROR_RO,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 705) REISERFS_ERROR_CONTINUE,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 706)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 707) REISERFS_USRQUOTA, /* User quota option specified */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 708) REISERFS_GRPQUOTA, /* Group quota option specified */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 709)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 710) REISERFS_TEST1,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 711) REISERFS_TEST2,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 712) REISERFS_TEST3,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 713) REISERFS_TEST4,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 714) REISERFS_UNSUPPORTED_OPT,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 715) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 716)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 717) #define reiserfs_r5_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_R5_HASH))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 718) #define reiserfs_rupasov_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_RUPASOV_HASH))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 719) #define reiserfs_tea_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_TEA_HASH))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 720) #define reiserfs_hash_detect(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_HASH_DETECT))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 721) #define reiserfs_no_border(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_BORDER))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 722) #define reiserfs_no_unhashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_UNHASHED_RELOCATION))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 723) #define reiserfs_hashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_HASHED_RELOCATION))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 724) #define reiserfs_test4(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_TEST4))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 725)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 726) #define have_large_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_LARGETAIL))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 727) #define have_small_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_SMALLTAIL))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 728) #define replay_only(s) (REISERFS_SB(s)->s_mount_opt & (1 << REPLAYONLY))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 729) #define reiserfs_attrs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ATTRS))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 730) #define old_format_only(s) (REISERFS_SB(s)->s_properties & (1 << REISERFS_3_5))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 731) #define convert_reiserfs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_CONVERT))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 732) #define reiserfs_data_log(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_LOG))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 733) #define reiserfs_data_ordered(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_ORDERED))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 734) #define reiserfs_data_writeback(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_WRITEBACK))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 735) #define reiserfs_xattrs_user(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_XATTRS_USER))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 736) #define reiserfs_posixacl(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_POSIXACL))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 737) #define reiserfs_expose_privroot(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_EXPOSE_PRIVROOT))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 738) #define reiserfs_xattrs_optional(s) (reiserfs_xattrs_user(s) || reiserfs_posixacl(s))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 739) #define reiserfs_barrier_none(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_NONE))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 740) #define reiserfs_barrier_flush(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_FLUSH))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 741)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 742) #define reiserfs_error_panic(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_PANIC))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 743) #define reiserfs_error_ro(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_RO))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 744)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 745) void reiserfs_file_buffer(struct buffer_head *bh, int list);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 746) extern struct file_system_type reiserfs_fs_type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 747) int reiserfs_resize(struct super_block *, unsigned long);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 748)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 749) #define CARRY_ON 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 750) #define SCHEDULE_OCCURRED 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 751)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 752) #define SB_BUFFER_WITH_SB(s) (REISERFS_SB(s)->s_sbh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 753) #define SB_JOURNAL(s) (REISERFS_SB(s)->s_journal)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 754) #define SB_JOURNAL_1st_RESERVED_BLOCK(s) (SB_JOURNAL(s)->j_1st_reserved_block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 755) #define SB_JOURNAL_LEN_FREE(s) (SB_JOURNAL(s)->j_journal_len_free)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 756) #define SB_AP_BITMAP(s) (REISERFS_SB(s)->s_ap_bitmap)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 757)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 758) #define SB_DISK_JOURNAL_HEAD(s) (SB_JOURNAL(s)->j_header_bh->)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 759)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 760) #define reiserfs_is_journal_aborted(journal) (unlikely (__reiserfs_is_journal_aborted (journal)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 761) static inline int __reiserfs_is_journal_aborted(struct reiserfs_journal
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 762) *journal)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 763) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 764) return test_bit(J_ABORTED, &journal->j_state);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 765) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 766)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 767) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 768) * Locking primitives. The write lock is a per superblock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 769) * special mutex that has properties close to the Big Kernel Lock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 770) * which was used in the previous locking scheme.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 771) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 772) void reiserfs_write_lock(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 773) void reiserfs_write_unlock(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 774) int __must_check reiserfs_write_unlock_nested(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 775) void reiserfs_write_lock_nested(struct super_block *s, int depth);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 776)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 777) #ifdef CONFIG_REISERFS_CHECK
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 778) void reiserfs_lock_check_recursive(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 779) #else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 780) static inline void reiserfs_lock_check_recursive(struct super_block *s) { }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 781) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 782)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 783) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 784) * Several mutexes depend on the write lock.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 785) * However sometimes we want to relax the write lock while we hold
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 786) * these mutexes, according to the release/reacquire on schedule()
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 787) * properties of the Bkl that were used.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 788) * Reiserfs performances and locking were based on this scheme.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 789) * Now that the write lock is a mutex and not the bkl anymore, doing so
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 790) * may result in a deadlock:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 791) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 792) * A acquire write_lock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 793) * A acquire j_commit_mutex
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 794) * A release write_lock and wait for something
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 795) * B acquire write_lock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 796) * B can't acquire j_commit_mutex and sleep
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 797) * A can't acquire write lock anymore
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 798) * deadlock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 799) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 800) * What we do here is avoiding such deadlock by playing the same game
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 801) * than the Bkl: if we can't acquire a mutex that depends on the write lock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 802) * we release the write lock, wait a bit and then retry.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 803) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 804) * The mutexes concerned by this hack are:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 805) * - The commit mutex of a journal list
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 806) * - The flush mutex
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 807) * - The journal lock
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 808) * - The inode mutex
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 809) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 810) static inline void reiserfs_mutex_lock_safe(struct mutex *m,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 811) struct super_block *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 812) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 813) int depth;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 814)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 815) depth = reiserfs_write_unlock_nested(s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 816) mutex_lock(m);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 817) reiserfs_write_lock_nested(s, depth);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 818) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 819)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 820) static inline void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 821) reiserfs_mutex_lock_nested_safe(struct mutex *m, unsigned int subclass,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 822) struct super_block *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 823) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 824) int depth;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 825)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 826) depth = reiserfs_write_unlock_nested(s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 827) mutex_lock_nested(m, subclass);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 828) reiserfs_write_lock_nested(s, depth);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 829) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 830)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 831) static inline void
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 832) reiserfs_down_read_safe(struct rw_semaphore *sem, struct super_block *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 833) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 834) int depth;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 835) depth = reiserfs_write_unlock_nested(s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 836) down_read(sem);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 837) reiserfs_write_lock_nested(s, depth);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 838) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 839)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 840) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 841) * When we schedule, we usually want to also release the write lock,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 842) * according to the previous bkl based locking scheme of reiserfs.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 843) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 844) static inline void reiserfs_cond_resched(struct super_block *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 845) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 846) if (need_resched()) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 847) int depth;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 848)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 849) depth = reiserfs_write_unlock_nested(s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 850) schedule();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 851) reiserfs_write_lock_nested(s, depth);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 852) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 853) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 854)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 855) struct fid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 856)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 857) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 858) * in reading the #defines, it may help to understand that they employ
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 859) * the following abbreviations:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 860) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 861) * B = Buffer
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 862) * I = Item header
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 863) * H = Height within the tree (should be changed to LEV)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 864) * N = Number of the item in the node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 865) * STAT = stat data
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 866) * DEH = Directory Entry Header
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 867) * EC = Entry Count
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 868) * E = Entry number
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 869) * UL = Unsigned Long
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 870) * BLKH = BLocK Header
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 871) * UNFM = UNForMatted node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 872) * DC = Disk Child
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 873) * P = Path
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 874) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 875) * These #defines are named by concatenating these abbreviations,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 876) * where first comes the arguments, and last comes the return value,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 877) * of the macro.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 878) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 879)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 880) #define USE_INODE_GENERATION_COUNTER
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 881)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 882) #define REISERFS_PREALLOCATE
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 883) #define DISPLACE_NEW_PACKING_LOCALITIES
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 884) #define PREALLOCATION_SIZE 9
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 885)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 886) /* n must be power of 2 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 887) #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 888)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 889) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 890) * to be ok for alpha and others we have to align structures to 8 byte
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 891) * boundary.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 892) * FIXME: do not change 4 by anything else: there is code which relies on that
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 893) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 894) #define ROUND_UP(x) _ROUND_UP(x,8LL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 895)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 896) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 897) * debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 898) * messages.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 899) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 900) #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 901)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 902) void __reiserfs_warning(struct super_block *s, const char *id,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 903) const char *func, const char *fmt, ...);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 904) #define reiserfs_warning(s, id, fmt, args...) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 905) __reiserfs_warning(s, id, __func__, fmt, ##args)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 906) /* assertions handling */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 907)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 908) /* always check a condition and panic if it's false. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 909) #define __RASSERT(cond, scond, format, args...) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 910) do { \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 911) if (!(cond)) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 912) reiserfs_panic(NULL, "assertion failure", "(" #cond ") at " \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 913) __FILE__ ":%i:%s: " format "\n", \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 914) __LINE__, __func__ , ##args); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 915) } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 916)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 917) #define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 918)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 919) #if defined( CONFIG_REISERFS_CHECK )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 920) #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 921) #else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 922) #define RFALSE( cond, format, args... ) do {;} while( 0 )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 923) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 924)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 925) #define CONSTF __attribute_const__
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 926) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 927) * Disk Data Structures
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 928) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 929)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 930) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 931) * SUPER BLOCK *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 932) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 933)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 934) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 935) * Structure of super block on disk, a version of which in RAM is often
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 936) * accessed as REISERFS_SB(s)->s_rs. The version in RAM is part of a larger
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 937) * structure containing fields never written to disk.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 938) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 939) #define UNSET_HASH 0 /* Detect hash on disk */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 940) #define TEA_HASH 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 941) #define YURA_HASH 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 942) #define R5_HASH 3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 943) #define DEFAULT_HASH R5_HASH
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 944)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 945) struct journal_params {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 946) /* where does journal start from on its * device */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 947) __le32 jp_journal_1st_block;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 948)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 949) /* journal device st_rdev */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 950) __le32 jp_journal_dev;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 951)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 952) /* size of the journal */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 953) __le32 jp_journal_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 954)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 955) /* max number of blocks in a transaction. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 956) __le32 jp_journal_trans_max;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 957)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 958) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 959) * random value made on fs creation
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 960) * (this was sb_journal_block_count)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 961) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 962) __le32 jp_journal_magic;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 963)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 964) /* max number of blocks to batch into a trans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 965) __le32 jp_journal_max_batch;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 966)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 967) /* in seconds, how old can an async commit be */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 968) __le32 jp_journal_max_commit_age;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 969)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 970) /* in seconds, how old can a transaction be */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 971) __le32 jp_journal_max_trans_age;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 972) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 973)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 974) /* this is the super from 3.5.X, where X >= 10 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 975) struct reiserfs_super_block_v1 {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 976) __le32 s_block_count; /* blocks count */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 977) __le32 s_free_blocks; /* free blocks count */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 978) __le32 s_root_block; /* root block number */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 979) struct journal_params s_journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 980) __le16 s_blocksize; /* block size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 981)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 982) /* max size of object id array, see get_objectid() commentary */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 983) __le16 s_oid_maxsize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 984) __le16 s_oid_cursize; /* current size of object id array */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 985)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 986) /* this is set to 1 when filesystem was umounted, to 2 - when not */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 987) __le16 s_umount_state;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 988)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 989) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 990) * reiserfs magic string indicates that file system is reiserfs:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 991) * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 992) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 993) char s_magic[10];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 994)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 995) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 996) * it is set to used by fsck to mark which
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 997) * phase of rebuilding is done
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 998) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 999) __le16 s_fs_state;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1000) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1001) * indicate, what hash function is being use
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1002) * to sort names in a directory
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1003) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1004) __le32 s_hash_function_code;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1005) __le16 s_tree_height; /* height of disk tree */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1006)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1007) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1008) * amount of bitmap blocks needed to address
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1009) * each block of file system
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1010) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1011) __le16 s_bmap_nr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1012)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1013) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1014) * this field is only reliable on filesystem with non-standard journal
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1015) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1016) __le16 s_version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1017)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1018) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1019) * size in blocks of journal area on main device, we need to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1020) * keep after making fs with non-standard journal
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1021) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1022) __le16 s_reserved_for_journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1023) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1024)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1025) #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1026)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1027) /* this is the on disk super block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1028) struct reiserfs_super_block {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1029) struct reiserfs_super_block_v1 s_v1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1030) __le32 s_inode_generation;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1031)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1032) /* Right now used only by inode-attributes, if enabled */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1033) __le32 s_flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1034)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1035) unsigned char s_uuid[16]; /* filesystem unique identifier */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1036) unsigned char s_label[16]; /* filesystem volume label */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1037) __le16 s_mnt_count; /* Count of mounts since last fsck */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1038) __le16 s_max_mnt_count; /* Maximum mounts before check */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1039) __le32 s_lastcheck; /* Timestamp of last fsck */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1040) __le32 s_check_interval; /* Interval between checks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1041)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1042) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1043) * zero filled by mkreiserfs and reiserfs_convert_objectid_map_v1()
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1044) * so any additions must be updated there as well. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1045) char s_unused[76];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1046) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1047)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1048) #define SB_SIZE (sizeof(struct reiserfs_super_block))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1049)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1050) #define REISERFS_VERSION_1 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1051) #define REISERFS_VERSION_2 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1052)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1053) /* on-disk super block fields converted to cpu form */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1054) #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1055) #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1056) #define SB_BLOCKSIZE(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1057) le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1058) #define SB_BLOCK_COUNT(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1059) le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1060) #define SB_FREE_BLOCKS(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1061) le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1062) #define SB_REISERFS_MAGIC(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1063) (SB_V1_DISK_SUPER_BLOCK(s)->s_magic)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1064) #define SB_ROOT_BLOCK(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1065) le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1066) #define SB_TREE_HEIGHT(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1067) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1068) #define SB_REISERFS_STATE(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1069) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1070) #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1071) #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1072)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1073) #define PUT_SB_BLOCK_COUNT(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1074) do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1075) #define PUT_SB_FREE_BLOCKS(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1076) do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1077) #define PUT_SB_ROOT_BLOCK(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1078) do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1079) #define PUT_SB_TREE_HEIGHT(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1080) do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1081) #define PUT_SB_REISERFS_STATE(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1082) do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1083) #define PUT_SB_VERSION(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1084) do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1085) #define PUT_SB_BMAP_NR(s, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1086) do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1087)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1088) #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1089) #define SB_ONDISK_JOURNAL_SIZE(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1090) le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1091) #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1092) le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1093) #define SB_ONDISK_JOURNAL_DEVICE(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1094) le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1095) #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1096) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1097)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1098) #define is_block_in_log_or_reserved_area(s, block) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1099) block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1100) && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1101) ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1102) SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1103)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1104) int is_reiserfs_3_5(struct reiserfs_super_block *rs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1105) int is_reiserfs_3_6(struct reiserfs_super_block *rs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1106) int is_reiserfs_jr(struct reiserfs_super_block *rs);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1107)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1108) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1109) * ReiserFS leaves the first 64k unused, so that partition labels have
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1110) * enough space. If someone wants to write a fancy bootloader that
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1111) * needs more than 64k, let us know, and this will be increased in size.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1112) * This number must be larger than the largest block size on any
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1113) * platform, or code will break. -Hans
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1114) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1115) #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1116) #define REISERFS_FIRST_BLOCK unused_define
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1117) #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1118)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1119) /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1120) #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1121)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1122) /* reiserfs internal error code (used by search_by_key and fix_nodes)) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1123) #define CARRY_ON 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1124) #define REPEAT_SEARCH -1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1125) #define IO_ERROR -2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1126) #define NO_DISK_SPACE -3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1127) #define NO_BALANCING_NEEDED (-4)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1128) #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1129) #define QUOTA_EXCEEDED -6
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1130)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1131) typedef __u32 b_blocknr_t;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1132) typedef __le32 unp_t;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1133)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1134) struct unfm_nodeinfo {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1135) unp_t unfm_nodenum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1136) unsigned short unfm_freespace;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1137) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1138)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1139) /* there are two formats of keys: 3.5 and 3.6 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1140) #define KEY_FORMAT_3_5 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1141) #define KEY_FORMAT_3_6 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1142)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1143) /* there are two stat datas */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1144) #define STAT_DATA_V1 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1145) #define STAT_DATA_V2 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1146)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1147) static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1148) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1149) return container_of(inode, struct reiserfs_inode_info, vfs_inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1150) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1152) static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1153) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1154) return sb->s_fs_info;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1155) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1156)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1157) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1158) * Don't trust REISERFS_SB(sb)->s_bmap_nr, it's a u16
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1159) * which overflows on large file systems.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1160) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1161) static inline __u32 reiserfs_bmap_count(struct super_block *sb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1162) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1163) return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1164) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1165)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1166) static inline int bmap_would_wrap(unsigned bmap_nr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1167) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1168) return bmap_nr > ((1LL << 16) - 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1169) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1170)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1171) extern const struct xattr_handler *reiserfs_xattr_handlers[];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1172)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1173) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1174) * this says about version of key of all items (but stat data) the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1175) * object consists of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1176) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1177) #define get_inode_item_key_version( inode ) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1178) ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1179)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1180) #define set_inode_item_key_version( inode, version ) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1181) ({ if((version)==KEY_FORMAT_3_6) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1182) REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1183) else \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1184) REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; })
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1185)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1186) #define get_inode_sd_version(inode) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1187) ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1188)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1189) #define set_inode_sd_version(inode, version) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1190) ({ if((version)==STAT_DATA_V2) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1191) REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1192) else \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1193) REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; })
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1194)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1195) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1196) * This is an aggressive tail suppression policy, I am hoping it
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1197) * improves our benchmarks. The principle behind it is that percentage
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1198) * space saving is what matters, not absolute space saving. This is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1199) * non-intuitive, but it helps to understand it if you consider that the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1200) * cost to access 4 blocks is not much more than the cost to access 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1201) * block, if you have to do a seek and rotate. A tail risks a
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1202) * non-linear disk access that is significant as a percentage of total
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1203) * time cost for a 4 block file and saves an amount of space that is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1204) * less significant as a percentage of space, or so goes the hypothesis.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1205) * -Hans
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1206) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1207) #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1208) (\
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1209) (!(n_tail_size)) || \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1210) (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1211) ( (n_file_size) >= (n_block_size) * 4 ) || \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1212) ( ( (n_file_size) >= (n_block_size) * 3 ) && \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1213) ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1214) ( ( (n_file_size) >= (n_block_size) * 2 ) && \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1215) ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1216) ( ( (n_file_size) >= (n_block_size) ) && \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1217) ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1218) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1219)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1220) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1221) * Another strategy for tails, this one means only create a tail if all the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1222) * file would fit into one DIRECT item.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1223) * Primary intention for this one is to increase performance by decreasing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1224) * seeking.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1225) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1226) #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1227) (\
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1228) (!(n_tail_size)) || \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1229) (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1230) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1231)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1232) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1233) * values for s_umount_state field
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1234) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1235) #define REISERFS_VALID_FS 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1236) #define REISERFS_ERROR_FS 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1237)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1238) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1239) * there are 5 item types currently
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1240) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1241) #define TYPE_STAT_DATA 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1242) #define TYPE_INDIRECT 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1243) #define TYPE_DIRECT 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1244) #define TYPE_DIRENTRY 3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1245) #define TYPE_MAXTYPE 3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1246) #define TYPE_ANY 15 /* FIXME: comment is required */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1247)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1248) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1249) * KEY & ITEM HEAD *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1250) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1251)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1252) /* * directories use this key as well as old files */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1253) struct offset_v1 {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1254) __le32 k_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1255) __le32 k_uniqueness;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1256) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1257)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1258) struct offset_v2 {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1259) __le64 v;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1260) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1261)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1262) static inline __u16 offset_v2_k_type(const struct offset_v2 *v2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1263) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1264) __u8 type = le64_to_cpu(v2->v) >> 60;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1265) return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1266) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1267)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1268) static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1269) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1270) v2->v =
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1271) (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1272) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1273)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1274) static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1275) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1276) return le64_to_cpu(v2->v) & (~0ULL >> 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1277) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1278)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1279) static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1280) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1281) offset &= (~0ULL >> 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1282) v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1283) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1284)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1285) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1286) * Key of an item determines its location in the S+tree, and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1287) * is composed of 4 components
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1288) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1289) struct reiserfs_key {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1290) /* packing locality: by default parent directory object id */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1291) __le32 k_dir_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1292)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1293) __le32 k_objectid; /* object identifier */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1294) union {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1295) struct offset_v1 k_offset_v1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1296) struct offset_v2 k_offset_v2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1297) } __attribute__ ((__packed__)) u;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1298) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1299)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1300) struct in_core_key {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1301) /* packing locality: by default parent directory object id */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1302) __u32 k_dir_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1303) __u32 k_objectid; /* object identifier */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1304) __u64 k_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1305) __u8 k_type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1306) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1307)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1308) struct cpu_key {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1309) struct in_core_key on_disk_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1310) int version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1311) /* 3 in all cases but direct2indirect and indirect2direct conversion */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1312) int key_length;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1313) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1314)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1315) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1316) * Our function for comparing keys can compare keys of different
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1317) * lengths. It takes as a parameter the length of the keys it is to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1318) * compare. These defines are used in determining what is to be passed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1319) * to it as that parameter.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1320) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1321) #define REISERFS_FULL_KEY_LEN 4
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1322) #define REISERFS_SHORT_KEY_LEN 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1323)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1324) /* The result of the key compare */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1325) #define FIRST_GREATER 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1326) #define SECOND_GREATER -1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1327) #define KEYS_IDENTICAL 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1328) #define KEY_FOUND 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1329) #define KEY_NOT_FOUND 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1330)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1331) #define KEY_SIZE (sizeof(struct reiserfs_key))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1332)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1333) /* return values for search_by_key and clones */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1334) #define ITEM_FOUND 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1335) #define ITEM_NOT_FOUND 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1336) #define ENTRY_FOUND 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1337) #define ENTRY_NOT_FOUND 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1338) #define DIRECTORY_NOT_FOUND -1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1339) #define REGULAR_FILE_FOUND -2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1340) #define DIRECTORY_FOUND -3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1341) #define BYTE_FOUND 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1342) #define BYTE_NOT_FOUND 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1343) #define FILE_NOT_FOUND -1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1344)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1345) #define POSITION_FOUND 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1346) #define POSITION_NOT_FOUND 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1347)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1348) /* return values for reiserfs_find_entry and search_by_entry_key */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1349) #define NAME_FOUND 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1350) #define NAME_NOT_FOUND 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1351) #define GOTO_PREVIOUS_ITEM 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1352) #define NAME_FOUND_INVISIBLE 3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1353)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1354) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1355) * Everything in the filesystem is stored as a set of items. The
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1356) * item head contains the key of the item, its free space (for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1357) * indirect items) and specifies the location of the item itself
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1358) * within the block.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1359) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1360)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1361) struct item_head {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1362) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1363) * Everything in the tree is found by searching for it based on
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1364) * its key.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1365) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1366) struct reiserfs_key ih_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1367) union {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1368) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1369) * The free space in the last unformatted node of an
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1370) * indirect item if this is an indirect item. This
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1371) * equals 0xFFFF iff this is a direct item or stat data
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1372) * item. Note that the key, not this field, is used to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1373) * determine the item type, and thus which field this
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1374) * union contains.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1375) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1376) __le16 ih_free_space_reserved;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1377)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1378) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1379) * Iff this is a directory item, this field equals the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1380) * number of directory entries in the directory item.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1381) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1382) __le16 ih_entry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1383) } __attribute__ ((__packed__)) u;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1384) __le16 ih_item_len; /* total size of the item body */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1385)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1386) /* an offset to the item body within the block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1387) __le16 ih_item_location;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1388)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1389) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1390) * 0 for all old items, 2 for new ones. Highest bit is set by fsck
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1391) * temporary, cleaned after all done
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1392) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1393) __le16 ih_version;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1394) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1395) /* size of item header */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1396) #define IH_SIZE (sizeof(struct item_head))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1398) #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1399) #define ih_version(ih) le16_to_cpu((ih)->ih_version)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1400) #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1401) #define ih_location(ih) le16_to_cpu((ih)->ih_item_location)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1402) #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1403)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1404) #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1405) #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1406) #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1407) #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1408) #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1409)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1410) #define unreachable_item(ih) (ih_version(ih) & (1 << 15))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1411)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1412) #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1413) #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1414)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1415) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1416) * these operate on indirect items, where you've got an array of ints
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1417) * at a possibly unaligned location. These are a noop on ia32
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1418) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1419) * p is the array of __u32, i is the index into the array, v is the value
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1420) * to store there.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1421) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1422) #define get_block_num(p, i) get_unaligned_le32((p) + (i))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1423) #define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1424)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1425) /* * in old version uniqueness field shows key type */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1426) #define V1_SD_UNIQUENESS 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1427) #define V1_INDIRECT_UNIQUENESS 0xfffffffe
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1428) #define V1_DIRECT_UNIQUENESS 0xffffffff
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1429) #define V1_DIRENTRY_UNIQUENESS 500
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1430) #define V1_ANY_UNIQUENESS 555 /* FIXME: comment is required */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1431)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1432) /* here are conversion routines */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1433) static inline int uniqueness2type(__u32 uniqueness) CONSTF;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1434) static inline int uniqueness2type(__u32 uniqueness)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1435) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1436) switch ((int)uniqueness) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1437) case V1_SD_UNIQUENESS:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1438) return TYPE_STAT_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1439) case V1_INDIRECT_UNIQUENESS:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1440) return TYPE_INDIRECT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1441) case V1_DIRECT_UNIQUENESS:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1442) return TYPE_DIRECT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1443) case V1_DIRENTRY_UNIQUENESS:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1444) return TYPE_DIRENTRY;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1445) case V1_ANY_UNIQUENESS:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1446) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1447) return TYPE_ANY;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1448) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1449) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1450)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1451) static inline __u32 type2uniqueness(int type) CONSTF;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1452) static inline __u32 type2uniqueness(int type)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1453) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1454) switch (type) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1455) case TYPE_STAT_DATA:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1456) return V1_SD_UNIQUENESS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1457) case TYPE_INDIRECT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1458) return V1_INDIRECT_UNIQUENESS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1459) case TYPE_DIRECT:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1460) return V1_DIRECT_UNIQUENESS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1461) case TYPE_DIRENTRY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1462) return V1_DIRENTRY_UNIQUENESS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1463) case TYPE_ANY:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1464) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1465) return V1_ANY_UNIQUENESS;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1466) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1467) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1468)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1469) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1470) * key is pointer to on disk key which is stored in le, result is cpu,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1471) * there is no way to get version of object from key, so, provide
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1472) * version to these defines
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1473) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1474) static inline loff_t le_key_k_offset(int version,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1475) const struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1476) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1477) return (version == KEY_FORMAT_3_5) ?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1478) le32_to_cpu(key->u.k_offset_v1.k_offset) :
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1479) offset_v2_k_offset(&(key->u.k_offset_v2));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1480) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1481)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1482) static inline loff_t le_ih_k_offset(const struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1483) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1484) return le_key_k_offset(ih_version(ih), &(ih->ih_key));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1485) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1486)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1487) static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1488) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1489) if (version == KEY_FORMAT_3_5) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1490) loff_t val = le32_to_cpu(key->u.k_offset_v1.k_uniqueness);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1491) return uniqueness2type(val);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1492) } else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1493) return offset_v2_k_type(&(key->u.k_offset_v2));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1494) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1495)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1496) static inline loff_t le_ih_k_type(const struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1497) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1498) return le_key_k_type(ih_version(ih), &(ih->ih_key));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1499) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1500)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1501) static inline void set_le_key_k_offset(int version, struct reiserfs_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1502) loff_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1503) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1504) if (version == KEY_FORMAT_3_5)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1505) key->u.k_offset_v1.k_offset = cpu_to_le32(offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1506) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1507) set_offset_v2_k_offset(&key->u.k_offset_v2, offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1508) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1509)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1510) static inline void add_le_key_k_offset(int version, struct reiserfs_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1511) loff_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1512) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1513) set_le_key_k_offset(version, key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1514) le_key_k_offset(version, key) + offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1515) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1516)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1517) static inline void add_le_ih_k_offset(struct item_head *ih, loff_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1518) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1519) add_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1520) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1521)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1522) static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1523) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1524) set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1525) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1526)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1527) static inline void set_le_key_k_type(int version, struct reiserfs_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1528) int type)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1529) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1530) if (version == KEY_FORMAT_3_5) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1531) type = type2uniqueness(type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1532) key->u.k_offset_v1.k_uniqueness = cpu_to_le32(type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1533) } else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1534) set_offset_v2_k_type(&key->u.k_offset_v2, type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1535) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1536)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1537) static inline void set_le_ih_k_type(struct item_head *ih, int type)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1538) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1539) set_le_key_k_type(ih_version(ih), &(ih->ih_key), type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1540) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1541)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1542) static inline int is_direntry_le_key(int version, struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1543) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1544) return le_key_k_type(version, key) == TYPE_DIRENTRY;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1545) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1546)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1547) static inline int is_direct_le_key(int version, struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1548) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1549) return le_key_k_type(version, key) == TYPE_DIRECT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1550) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1551)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1552) static inline int is_indirect_le_key(int version, struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1553) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1554) return le_key_k_type(version, key) == TYPE_INDIRECT;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1555) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1556)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1557) static inline int is_statdata_le_key(int version, struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1558) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1559) return le_key_k_type(version, key) == TYPE_STAT_DATA;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1560) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1561)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1562) /* item header has version. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1563) static inline int is_direntry_le_ih(struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1564) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1565) return is_direntry_le_key(ih_version(ih), &ih->ih_key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1566) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1567)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1568) static inline int is_direct_le_ih(struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1569) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1570) return is_direct_le_key(ih_version(ih), &ih->ih_key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1571) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1572)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1573) static inline int is_indirect_le_ih(struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1574) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1575) return is_indirect_le_key(ih_version(ih), &ih->ih_key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1576) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1577)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1578) static inline int is_statdata_le_ih(struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1579) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1580) return is_statdata_le_key(ih_version(ih), &ih->ih_key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1581) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1582)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1583) /* key is pointer to cpu key, result is cpu */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1584) static inline loff_t cpu_key_k_offset(const struct cpu_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1585) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1586) return key->on_disk_key.k_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1587) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1588)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1589) static inline loff_t cpu_key_k_type(const struct cpu_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1590) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1591) return key->on_disk_key.k_type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1592) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1593)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1594) static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1595) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1596) key->on_disk_key.k_offset = offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1597) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1598)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1599) static inline void set_cpu_key_k_type(struct cpu_key *key, int type)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1600) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1601) key->on_disk_key.k_type = type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1602) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1603)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1604) static inline void cpu_key_k_offset_dec(struct cpu_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1605) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1606) key->on_disk_key.k_offset--;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1607) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1608)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1609) #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1610) #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1611) #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1612) #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1613)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1614) /* are these used ? */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1615) #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1616) #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1617) #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1618) #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1619)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1620) #define I_K_KEY_IN_ITEM(ih, key, n_blocksize) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1621) (!COMP_SHORT_KEYS(ih, key) && \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1622) I_OFF_BYTE_IN_ITEM(ih, k_offset(key), n_blocksize))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1623)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1624) /* maximal length of item */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1625) #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1626) #define MIN_ITEM_LEN 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1627)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1628) /* object identifier for root dir */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1629) #define REISERFS_ROOT_OBJECTID 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1630) #define REISERFS_ROOT_PARENT_OBJECTID 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1631)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1632) extern struct reiserfs_key root_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1633)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1634) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1635) * Picture represents a leaf of the S+tree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1636) * ______________________________________________________
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1637) * | | Array of | | |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1638) * |Block | Object-Item | F r e e | Objects- |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1639) * | head | Headers | S p a c e | Items |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1640) * |______|_______________|___________________|___________|
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1641) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1642)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1643) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1644) * Header of a disk block. More precisely, header of a formatted leaf
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1645) * or internal node, and not the header of an unformatted node.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1646) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1647) struct block_head {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1648) __le16 blk_level; /* Level of a block in the tree. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1649) __le16 blk_nr_item; /* Number of keys/items in a block. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1650) __le16 blk_free_space; /* Block free space in bytes. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1651) __le16 blk_reserved;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1652) /* dump this in v4/planA */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1653)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1654) /* kept only for compatibility */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1655) struct reiserfs_key blk_right_delim_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1656) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1657)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1658) #define BLKH_SIZE (sizeof(struct block_head))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1659) #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1660) #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1661) #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1662) #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1663) #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1664) #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1665) #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1666) #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1667) #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1668) #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1669)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1670) /* values for blk_level field of the struct block_head */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1671)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1672) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1673) * When node gets removed from the tree its blk_level is set to FREE_LEVEL.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1674) * It is then used to see whether the node is still in the tree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1675) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1676) #define FREE_LEVEL 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1677)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1678) #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1679)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1680) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1681) * Given the buffer head of a formatted node, resolve to the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1682) * block head of that node.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1683) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1684) #define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1685) /* Number of items that are in buffer. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1686) #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1687) #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1688) #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1689)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1690) #define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1691) #define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1692) #define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1693)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1694) /* Get right delimiting key. -- little endian */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1695) #define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh))))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1696)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1697) /* Does the buffer contain a disk leaf. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1698) #define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1699)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1700) /* Does the buffer contain a disk internal node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1701) #define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1702) && B_LEVEL(bh) <= MAX_HEIGHT)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1703)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1704) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1705) * STAT DATA *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1706) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1707)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1708) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1709) * old stat data is 32 bytes long. We are going to distinguish new one by
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1710) * different size
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1711) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1712) struct stat_data_v1 {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1713) __le16 sd_mode; /* file type, permissions */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1714) __le16 sd_nlink; /* number of hard links */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1715) __le16 sd_uid; /* owner */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1716) __le16 sd_gid; /* group */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1717) __le32 sd_size; /* file size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1718) __le32 sd_atime; /* time of last access */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1719) __le32 sd_mtime; /* time file was last modified */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1720)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1721) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1722) * time inode (stat data) was last changed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1723) * (except changes to sd_atime and sd_mtime)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1724) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1725) __le32 sd_ctime;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1726) union {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1727) __le32 sd_rdev;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1728) __le32 sd_blocks; /* number of blocks file uses */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1729) } __attribute__ ((__packed__)) u;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1730)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1731) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1732) * first byte of file which is stored in a direct item: except that if
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1733) * it equals 1 it is a symlink and if it equals ~(__u32)0 there is no
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1734) * direct item. The existence of this field really grates on me.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1735) * Let's replace it with a macro based on sd_size and our tail
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1736) * suppression policy. Someday. -Hans
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1737) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1738) __le32 sd_first_direct_byte;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1739) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1740)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1741) #define SD_V1_SIZE (sizeof(struct stat_data_v1))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1742) #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1743) #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1744) #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1745) #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1746) #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1747) #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1748) #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1749) #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1750) #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1751) #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1752) #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1753) #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1754) #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1755) #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1756) #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1757) #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1758) #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1759) #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1760) #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1761) #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1762) #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1763) #define sd_v1_first_direct_byte(sdp) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1764) (le32_to_cpu((sdp)->sd_first_direct_byte))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1765) #define set_sd_v1_first_direct_byte(sdp,v) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1766) ((sdp)->sd_first_direct_byte = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1767)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1768) /* inode flags stored in sd_attrs (nee sd_reserved) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1769)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1770) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1771) * we want common flags to have the same values as in ext2,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1772) * so chattr(1) will work without problems
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1773) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1774) #define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1775) #define REISERFS_APPEND_FL FS_APPEND_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1776) #define REISERFS_SYNC_FL FS_SYNC_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1777) #define REISERFS_NOATIME_FL FS_NOATIME_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1778) #define REISERFS_NODUMP_FL FS_NODUMP_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1779) #define REISERFS_SECRM_FL FS_SECRM_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1780) #define REISERFS_UNRM_FL FS_UNRM_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1781) #define REISERFS_COMPR_FL FS_COMPR_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1782) #define REISERFS_NOTAIL_FL FS_NOTAIL_FL
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1783)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1784) /* persistent flags that file inherits from the parent directory */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1785) #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1786) REISERFS_SYNC_FL | \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1787) REISERFS_NOATIME_FL | \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1788) REISERFS_NODUMP_FL | \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1789) REISERFS_SECRM_FL | \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1790) REISERFS_COMPR_FL | \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1791) REISERFS_NOTAIL_FL )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1792)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1793) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1794) * Stat Data on disk (reiserfs version of UFS disk inode minus the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1795) * address blocks)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1796) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1797) struct stat_data {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1798) __le16 sd_mode; /* file type, permissions */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1799) __le16 sd_attrs; /* persistent inode flags */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1800) __le32 sd_nlink; /* number of hard links */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1801) __le64 sd_size; /* file size */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1802) __le32 sd_uid; /* owner */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1803) __le32 sd_gid; /* group */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1804) __le32 sd_atime; /* time of last access */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1805) __le32 sd_mtime; /* time file was last modified */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1806)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1807) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1808) * time inode (stat data) was last changed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1809) * (except changes to sd_atime and sd_mtime)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1810) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1811) __le32 sd_ctime;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1812) __le32 sd_blocks;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1813) union {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1814) __le32 sd_rdev;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1815) __le32 sd_generation;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1816) } __attribute__ ((__packed__)) u;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1817) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1818)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1819) /* this is 44 bytes long */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1820) #define SD_SIZE (sizeof(struct stat_data))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1821) #define SD_V2_SIZE SD_SIZE
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1822) #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1823) #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1824) #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1825) /* sd_reserved */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1826) /* set_sd_reserved */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1827) #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1828) #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1829) #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1830) #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1831) #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1832) #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1833) #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1834) #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1835) #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1836) #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1837) #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1838) #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1839) #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1840) #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1841) #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1842) #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1843) #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1844) #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1845) #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1846) #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1847) #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1848) #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1849)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1850) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1851) * DIRECTORY STRUCTURE *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1852) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1853) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1854) * Picture represents the structure of directory items
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1855) * ________________________________________________
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1856) * | Array of | | | | | |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1857) * | directory |N-1| N-2 | .... | 1st |0th|
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1858) * | entry headers | | | | | |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1859) * |_______________|___|_____|________|_______|___|
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1860) * <---- directory entries ------>
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1861) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1862) * First directory item has k_offset component 1. We store "." and ".."
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1863) * in one item, always, we never split "." and ".." into differing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1864) * items. This makes, among other things, the code for removing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1865) * directories simpler.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1866) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1867) #define SD_OFFSET 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1868) #define SD_UNIQUENESS 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1869) #define DOT_OFFSET 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1870) #define DOT_DOT_OFFSET 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1871) #define DIRENTRY_UNIQUENESS 500
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1872)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1873) #define FIRST_ITEM_OFFSET 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1874)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1875) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1876) * Q: How to get key of object pointed to by entry from entry?
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1877) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1878) * A: Each directory entry has its header. This header has deh_dir_id
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1879) * and deh_objectid fields, those are key of object, entry points to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1880) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1881)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1882) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1883) * NOT IMPLEMENTED:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1884) * Directory will someday contain stat data of object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1885) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1886)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1887) struct reiserfs_de_head {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1888) __le32 deh_offset; /* third component of the directory entry key */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1889)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1890) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1891) * objectid of the parent directory of the object, that is referenced
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1892) * by directory entry
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1893) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1894) __le32 deh_dir_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1895)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1896) /* objectid of the object, that is referenced by directory entry */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1897) __le32 deh_objectid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1898) __le16 deh_location; /* offset of name in the whole item */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1899)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1900) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1901) * whether 1) entry contains stat data (for future), and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1902) * 2) whether entry is hidden (unlinked)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1903) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1904) __le16 deh_state;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1905) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1906) #define DEH_SIZE sizeof(struct reiserfs_de_head)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1907) #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1908) #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1909) #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1910) #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1911) #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1912)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1913) #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1914) #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1915) #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1916) #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1917) #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1918)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1919) /* empty directory contains two entries "." and ".." and their headers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1920) #define EMPTY_DIR_SIZE \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1921) (DEH_SIZE * 2 + ROUND_UP (sizeof(".") - 1) + ROUND_UP (sizeof("..") - 1))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1922)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1923) /* old format directories have this size when empty */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1924) #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1925)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1926) #define DEH_Statdata 0 /* not used now */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1927) #define DEH_Visible 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1928)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1929) /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1930) #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1931) # define ADDR_UNALIGNED_BITS (3)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1932) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1933)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1934) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1935) * These are only used to manipulate deh_state.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1936) * Because of this, we'll use the ext2_ bit routines,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1937) * since they are little endian
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1938) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1939) #ifdef ADDR_UNALIGNED_BITS
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1940)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1941) # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1942) # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1943)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1944) # define set_bit_unaligned(nr, addr) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1945) __test_and_set_bit_le((nr) + unaligned_offset(addr), aligned_address(addr))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1946) # define clear_bit_unaligned(nr, addr) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1947) __test_and_clear_bit_le((nr) + unaligned_offset(addr), aligned_address(addr))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1948) # define test_bit_unaligned(nr, addr) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1949) test_bit_le((nr) + unaligned_offset(addr), aligned_address(addr))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1950)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1951) #else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1952)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1953) # define set_bit_unaligned(nr, addr) __test_and_set_bit_le(nr, addr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1954) # define clear_bit_unaligned(nr, addr) __test_and_clear_bit_le(nr, addr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1955) # define test_bit_unaligned(nr, addr) test_bit_le(nr, addr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1956)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1957) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1958)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1959) #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1960) #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1961) #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1962) #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1963)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1964) #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1965) #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1966) #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1967)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1968) extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1969) __le32 par_dirid, __le32 par_objid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1970) extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1971) __le32 par_dirid, __le32 par_objid);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1972)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1973) /* two entries per block (at least) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1974) #define REISERFS_MAX_NAME(block_size) 255
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1975)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1976) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1977) * this structure is used for operations on directory entries. It is
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1978) * not a disk structure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1979) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1980) * When reiserfs_find_entry or search_by_entry_key find directory
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1981) * entry, they return filled reiserfs_dir_entry structure
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1982) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1983) struct reiserfs_dir_entry {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1984) struct buffer_head *de_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1985) int de_item_num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1986) struct item_head *de_ih;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1987) int de_entry_num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1988) struct reiserfs_de_head *de_deh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1989) int de_entrylen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1990) int de_namelen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1991) char *de_name;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1992) unsigned long *de_gen_number_bit_string;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1993)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1994) __u32 de_dir_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1995) __u32 de_objectid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1996)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1997) struct cpu_key de_entry_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1998) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1999)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2000) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2001) * these defines are useful when a particular member of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2002) * a reiserfs_dir_entry is needed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2003) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2004)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2005) /* pointer to file name, stored in entry */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2006) #define B_I_DEH_ENTRY_FILE_NAME(bh, ih, deh) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2007) (ih_item_body(bh, ih) + deh_location(deh))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2008)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2009) /* length of name */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2010) #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2011) (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2012)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2013) /* hash value occupies bits from 7 up to 30 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2014) #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2015) /* generation number occupies 7 bits starting from 0 up to 6 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2016) #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2017) #define MAX_GENERATION_NUMBER 127
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2018)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2019) #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2020)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2021) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2022) * Picture represents an internal node of the reiserfs tree
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2023) * ______________________________________________________
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2024) * | | Array of | Array of | Free |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2025) * |block | keys | pointers | space |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2026) * | head | N | N+1 | |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2027) * |______|_______________|___________________|___________|
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2028) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2029)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2030) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2031) * DISK CHILD *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2032) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2033) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2034) * Disk child pointer:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2035) * The pointer from an internal node of the tree to a node that is on disk.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2036) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2037) struct disk_child {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2038) __le32 dc_block_number; /* Disk child's block number. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2039) __le16 dc_size; /* Disk child's used space. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2040) __le16 dc_reserved;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2041) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2042)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2043) #define DC_SIZE (sizeof(struct disk_child))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2044) #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2045) #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2046) #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2047) #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2048)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2049) /* Get disk child by buffer header and position in the tree node. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2050) #define B_N_CHILD(bh, n_pos) ((struct disk_child *)\
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2051) ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2052)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2053) /* Get disk child number by buffer header and position in the tree node. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2054) #define B_N_CHILD_NUM(bh, n_pos) (dc_block_number(B_N_CHILD(bh, n_pos)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2055) #define PUT_B_N_CHILD_NUM(bh, n_pos, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2056) (put_dc_block_number(B_N_CHILD(bh, n_pos), val))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2057)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2058) /* maximal value of field child_size in structure disk_child */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2059) /* child size is the combined size of all items and their headers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2060) #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2061)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2062) /* amount of used space in buffer (not including block head) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2063) #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2064)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2065) /* max and min number of keys in internal node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2066) #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2067) #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2068)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2069) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2070) * PATH STRUCTURES AND DEFINES *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2071) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2072)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2073) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2074) * search_by_key fills up the path from the root to the leaf as it descends
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2075) * the tree looking for the key. It uses reiserfs_bread to try to find
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2076) * buffers in the cache given their block number. If it does not find
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2077) * them in the cache it reads them from disk. For each node search_by_key
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2078) * finds using reiserfs_bread it then uses bin_search to look through that
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2079) * node. bin_search will find the position of the block_number of the next
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2080) * node if it is looking through an internal node. If it is looking through
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2081) * a leaf node bin_search will find the position of the item which has key
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2082) * either equal to given key, or which is the maximal key less than the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2083) * given key.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2084) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2085)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2086) struct path_element {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2087) /* Pointer to the buffer at the path in the tree. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2088) struct buffer_head *pe_buffer;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2089) /* Position in the tree node which is placed in the buffer above. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2090) int pe_position;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2091) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2092)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2093) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2094) * maximal height of a tree. don't change this without
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2095) * changing JOURNAL_PER_BALANCE_CNT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2096) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2097) #define MAX_HEIGHT 5
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2098)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2099) /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2100) #define EXTENDED_MAX_HEIGHT 7
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2101)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2102) /* Must be equal to at least 2. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2103) #define FIRST_PATH_ELEMENT_OFFSET 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2104)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2105) /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2106) #define ILLEGAL_PATH_ELEMENT_OFFSET 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2107)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2108) /* this MUST be MAX_HEIGHT + 1. See about FEB below */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2109) #define MAX_FEB_SIZE 6
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2110)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2111) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2112) * We need to keep track of who the ancestors of nodes are. When we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2113) * perform a search we record which nodes were visited while
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2114) * descending the tree looking for the node we searched for. This list
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2115) * of nodes is called the path. This information is used while
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2116) * performing balancing. Note that this path information may become
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2117) * invalid, and this means we must check it when using it to see if it
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2118) * is still valid. You'll need to read search_by_key and the comments
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2119) * in it, especially about decrement_counters_in_path(), to understand
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2120) * this structure.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2121) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2122) * Paths make the code so much harder to work with and debug.... An
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2123) * enormous number of bugs are due to them, and trying to write or modify
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2124) * code that uses them just makes my head hurt. They are based on an
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2125) * excessive effort to avoid disturbing the precious VFS code.:-( The
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2126) * gods only know how we are going to SMP the code that uses them.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2127) * znodes are the way!
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2128) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2130) #define PATH_READA 0x1 /* do read ahead */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2131) #define PATH_READA_BACK 0x2 /* read backwards */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2132)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2133) struct treepath {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2134) int path_length; /* Length of the array above. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2135) int reada;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2136) /* Array of the path elements. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2137) struct path_element path_elements[EXTENDED_MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2138) int pos_in_item;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2139) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2140)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2141) #define pos_in_item(path) ((path)->pos_in_item)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2142)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2143) #define INITIALIZE_PATH(var) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2144) struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2145)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2146) /* Get path element by path and path position. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2147) #define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2148)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2149) /* Get buffer header at the path by path and path position. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2150) #define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2152) /* Get position in the element at the path by path and path position. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2153) #define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2154)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2155) #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2156)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2157) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2158) * you know, to the person who didn't write this the macro name does not
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2159) * at first suggest what it does. Maybe POSITION_FROM_PATH_END? Or
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2160) * maybe we should just focus on dumping paths... -Hans
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2161) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2162) #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2163)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2164) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2165) * in do_balance leaf has h == 0 in contrast with path structure,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2166) * where root has level == 0. That is why we need these defines
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2167) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2168)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2169) /* tb->S[h] */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2170) #define PATH_H_PBUFFER(path, h) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2171) PATH_OFFSET_PBUFFER(path, path->path_length - (h))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2172)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2173) /* tb->F[h] or tb->S[0]->b_parent */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2174) #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER(path, (h) + 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2175)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2176) #define PATH_H_POSITION(path, h) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2177) PATH_OFFSET_POSITION(path, path->path_length - (h))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2178)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2179) /* tb->S[h]->b_item_order */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2180) #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2181)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2182) #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2183)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2184) static inline void *reiserfs_node_data(const struct buffer_head *bh)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2185) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2186) return bh->b_data + sizeof(struct block_head);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2187) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2188)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2189) /* get key from internal node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2190) static inline struct reiserfs_key *internal_key(struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2191) int item_num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2192) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2193) struct reiserfs_key *key = reiserfs_node_data(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2194)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2195) return &key[item_num];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2196) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2197)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2198) /* get the item header from leaf node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2199) static inline struct item_head *item_head(const struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2200) int item_num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2201) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2202) struct item_head *ih = reiserfs_node_data(bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2203)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2204) return &ih[item_num];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2205) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2206)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2207) /* get the key from leaf node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2208) static inline struct reiserfs_key *leaf_key(const struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2209) int item_num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2210) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2211) return &item_head(bh, item_num)->ih_key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2212) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2213)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2214) static inline void *ih_item_body(const struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2215) const struct item_head *ih)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2216) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2217) return bh->b_data + ih_location(ih);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2218) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2219)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2220) /* get item body from leaf node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2221) static inline void *item_body(const struct buffer_head *bh, int item_num)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2222) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2223) return ih_item_body(bh, item_head(bh, item_num));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2224) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2225)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2226) static inline struct item_head *tp_item_head(const struct treepath *path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2227) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2228) return item_head(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2229) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2230)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2231) static inline void *tp_item_body(const struct treepath *path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2232) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2233) return item_body(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2234) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2235)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2236) #define get_last_bh(path) PATH_PLAST_BUFFER(path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2237) #define get_item_pos(path) PATH_LAST_POSITION(path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2238) #define item_moved(ih,path) comp_items(ih, path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2239) #define path_changed(ih,path) comp_items (ih, path)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2240)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2241) /* array of the entry headers */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2242) /* get item body */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2243) #define B_I_DEH(bh, ih) ((struct reiserfs_de_head *)(ih_item_body(bh, ih)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2244)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2245) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2246) * length of the directory entry in directory item. This define
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2247) * calculates length of i-th directory entry using directory entry
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2248) * locations from dir entry head. When it calculates length of 0-th
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2249) * directory entry, it uses length of whole item in place of entry
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2250) * location of the non-existent following entry in the calculation.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2251) * See picture above.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2252) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2253) static inline int entry_length(const struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2254) const struct item_head *ih, int pos_in_item)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2255) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2256) struct reiserfs_de_head *deh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2257)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2258) deh = B_I_DEH(bh, ih) + pos_in_item;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2259) if (pos_in_item)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2260) return deh_location(deh - 1) - deh_location(deh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2261)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2262) return ih_item_len(ih) - deh_location(deh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2263) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2264)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2265) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2266) * MISC *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2267) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2268)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2269) /* Size of pointer to the unformatted node. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2270) #define UNFM_P_SIZE (sizeof(unp_t))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2271) #define UNFM_P_SHIFT 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2272)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2273) /* in in-core inode key is stored on le form */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2274) #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2275)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2276) #define MAX_UL_INT 0xffffffff
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2277) #define MAX_INT 0x7ffffff
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2278) #define MAX_US_INT 0xffff
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2279)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2280) // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2281) static inline loff_t max_reiserfs_offset(struct inode *inode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2282) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2283) if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2284) return (loff_t) U32_MAX;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2285)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2286) return (loff_t) ((~(__u64) 0) >> 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2287) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2288)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2289) #define MAX_KEY_OBJECTID MAX_UL_INT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2290)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2291) #define MAX_B_NUM MAX_UL_INT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2292) #define MAX_FC_NUM MAX_US_INT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2293)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2294) /* the purpose is to detect overflow of an unsigned short */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2295) #define REISERFS_LINK_MAX (MAX_US_INT - 1000)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2296)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2297) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2298) * The following defines are used in reiserfs_insert_item
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2299) * and reiserfs_append_item
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2300) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2301) #define REISERFS_KERNEL_MEM 0 /* kernel memory mode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2302) #define REISERFS_USER_MEM 1 /* user memory mode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2303)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2304) #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2305) #define get_generation(s) atomic_read (&fs_generation(s))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2306) #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2307) #define __fs_changed(gen,s) (gen != get_generation (s))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2308) #define fs_changed(gen,s) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2309) ({ \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2310) reiserfs_cond_resched(s); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2311) __fs_changed(gen, s); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2312) })
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2313)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2314) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2315) * FIXATE NODES *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2316) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2317)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2318) #define VI_TYPE_LEFT_MERGEABLE 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2319) #define VI_TYPE_RIGHT_MERGEABLE 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2320)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2321) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2322) * To make any changes in the tree we always first find node, that
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2323) * contains item to be changed/deleted or place to insert a new
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2324) * item. We call this node S. To do balancing we need to decide what
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2325) * we will shift to left/right neighbor, or to a new node, where new
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2326) * item will be etc. To make this analysis simpler we build virtual
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2327) * node. Virtual node is an array of items, that will replace items of
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2328) * node S. (For instance if we are going to delete an item, virtual
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2329) * node does not contain it). Virtual node keeps information about
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2330) * item sizes and types, mergeability of first and last items, sizes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2331) * of all entries in directory item. We use this array of items when
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2332) * calculating what we can shift to neighbors and how many nodes we
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2333) * have to have if we do not any shiftings, if we shift to left/right
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2334) * neighbor or to both.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2335) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2336) struct virtual_item {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2337) int vi_index; /* index in the array of item operations */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2338) unsigned short vi_type; /* left/right mergeability */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2339)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2340) /* length of item that it will have after balancing */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2341) unsigned short vi_item_len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2342)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2343) struct item_head *vi_ih;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2344) const char *vi_item; /* body of item (old or new) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2345) const void *vi_new_data; /* 0 always but paste mode */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2346) void *vi_uarea; /* item specific area */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2347) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2348)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2349) struct virtual_node {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2350) /* this is a pointer to the free space in the buffer */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2351) char *vn_free_ptr;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2352)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2353) unsigned short vn_nr_item; /* number of items in virtual node */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2354)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2355) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2356) * size of node , that node would have if it has
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2357) * unlimited size and no balancing is performed
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2358) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2359) short vn_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2360)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2361) /* mode of balancing (paste, insert, delete, cut) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2362) short vn_mode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2363)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2364) short vn_affected_item_num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2365) short vn_pos_in_item;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2366)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2367) /* item header of inserted item, 0 for other modes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2368) struct item_head *vn_ins_ih;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2369) const void *vn_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2370)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2371) /* array of items (including a new one, excluding item to be deleted) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2372) struct virtual_item *vn_vi;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2373) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2374)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2375) /* used by directory items when creating virtual nodes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2376) struct direntry_uarea {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2377) int flags;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2378) __u16 entry_count;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2379) __u16 entry_sizes[1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2380) } __attribute__ ((__packed__));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2381)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2382) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2383) * TREE BALANCE *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2384) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2385)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2386) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2387) * This temporary structure is used in tree balance algorithms, and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2388) * constructed as we go to the extent that its various parts are
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2389) * needed. It contains arrays of nodes that can potentially be
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2390) * involved in the balancing of node S, and parameters that define how
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2391) * each of the nodes must be balanced. Note that in these algorithms
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2392) * for balancing the worst case is to need to balance the current node
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2393) * S and the left and right neighbors and all of their parents plus
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2394) * create a new node. We implement S1 balancing for the leaf nodes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2395) * and S0 balancing for the internal nodes (S1 and S0 are defined in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2396) * our papers.)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2397) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2398)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2399) /* size of the array of buffers to free at end of do_balance */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2400) #define MAX_FREE_BLOCK 7
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2401)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2402) /* maximum number of FEB blocknrs on a single level */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2403) #define MAX_AMOUNT_NEEDED 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2404)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2405) /* someday somebody will prefix every field in this struct with tb_ */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2406) struct tree_balance {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2407) int tb_mode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2408) int need_balance_dirty;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2409) struct super_block *tb_sb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2410) struct reiserfs_transaction_handle *transaction_handle;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2411) struct treepath *tb_path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2412)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2413) /* array of left neighbors of nodes in the path */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2414) struct buffer_head *L[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2415)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2416) /* array of right neighbors of nodes in the path */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2417) struct buffer_head *R[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2418)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2419) /* array of fathers of the left neighbors */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2420) struct buffer_head *FL[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2421)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2422) /* array of fathers of the right neighbors */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2423) struct buffer_head *FR[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2424) /* array of common parents of center node and its left neighbor */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2425) struct buffer_head *CFL[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2426)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2427) /* array of common parents of center node and its right neighbor */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2428) struct buffer_head *CFR[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2429)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2430) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2431) * array of empty buffers. Number of buffers in array equals
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2432) * cur_blknum.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2433) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2434) struct buffer_head *FEB[MAX_FEB_SIZE];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2435) struct buffer_head *used[MAX_FEB_SIZE];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2436) struct buffer_head *thrown[MAX_FEB_SIZE];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2437)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2438) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2439) * array of number of items which must be shifted to the left in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2440) * order to balance the current node; for leaves includes item that
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2441) * will be partially shifted; for internal nodes, it is the number
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2442) * of child pointers rather than items. It includes the new item
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2443) * being created. The code sometimes subtracts one to get the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2444) * number of wholly shifted items for other purposes.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2445) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2446) int lnum[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2447)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2448) /* substitute right for left in comment above */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2449) int rnum[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2450)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2451) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2452) * array indexed by height h mapping the key delimiting L[h] and
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2453) * S[h] to its item number within the node CFL[h]
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2454) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2455) int lkey[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2456)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2457) /* substitute r for l in comment above */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2458) int rkey[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2459)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2460) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2461) * the number of bytes by we are trying to add or remove from
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2462) * S[h]. A negative value means removing.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2463) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2464) int insert_size[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2465)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2466) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2467) * number of nodes that will replace node S[h] after balancing
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2468) * on the level h of the tree. If 0 then S is being deleted,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2469) * if 1 then S is remaining and no new nodes are being created,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2470) * if 2 or 3 then 1 or 2 new nodes is being created
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2471) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2472) int blknum[MAX_HEIGHT];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2473)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2474) /* fields that are used only for balancing leaves of the tree */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2475)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2476) /* number of empty blocks having been already allocated */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2477) int cur_blknum;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2478)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2479) /* number of items that fall into left most node when S[0] splits */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2480) int s0num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2481)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2482) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2483) * number of bytes which can flow to the left neighbor from the left
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2484) * most liquid item that cannot be shifted from S[0] entirely
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2485) * if -1 then nothing will be partially shifted
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2486) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2487) int lbytes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2488)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2489) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2490) * number of bytes which will flow to the right neighbor from the right
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2491) * most liquid item that cannot be shifted from S[0] entirely
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2492) * if -1 then nothing will be partially shifted
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2493) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2494) int rbytes;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2495)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2496)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2497) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2498) * index into the array of item headers in
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2499) * S[0] of the affected item
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2500) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2501) int item_pos;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2502)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2503) /* new nodes allocated to hold what could not fit into S */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2504) struct buffer_head *S_new[2];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2505)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2506) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2507) * number of items that will be placed into nodes in S_new
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2508) * when S[0] splits
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2509) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2510) int snum[2];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2511)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2512) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2513) * number of bytes which flow to nodes in S_new when S[0] splits
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2514) * note: if S[0] splits into 3 nodes, then items do not need to be cut
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2515) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2516) int sbytes[2];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2517)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2518) int pos_in_item;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2519) int zeroes_num;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2520)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2521) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2522) * buffers which are to be freed after do_balance finishes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2523) * by unfix_nodes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2524) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2525) struct buffer_head *buf_to_free[MAX_FREE_BLOCK];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2526)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2527) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2528) * kmalloced memory. Used to create virtual node and keep
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2529) * map of dirtied bitmap blocks
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2530) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2531) char *vn_buf;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2532)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2533) int vn_buf_size; /* size of the vn_buf */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2534)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2535) /* VN starts after bitmap of bitmap blocks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2536) struct virtual_node *tb_vn;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2537)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2538) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2539) * saved value of `reiserfs_generation' counter see
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2540) * FILESYSTEM_CHANGED() macro in reiserfs_fs.h
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2541) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2542) int fs_gen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2543)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2544) #ifdef DISPLACE_NEW_PACKING_LOCALITIES
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2545) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2546) * key pointer, to pass to block allocator or
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2547) * another low-level subsystem
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2548) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2549) struct in_core_key key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2550) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2551) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2552)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2553) /* These are modes of balancing */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2554)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2555) /* When inserting an item. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2556) #define M_INSERT 'i'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2557) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2558) * When inserting into (directories only) or appending onto an already
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2559) * existent item.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2560) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2561) #define M_PASTE 'p'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2562) /* When deleting an item. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2563) #define M_DELETE 'd'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2564) /* When truncating an item or removing an entry from a (directory) item. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2565) #define M_CUT 'c'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2566)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2567) /* used when balancing on leaf level skipped (in reiserfsck) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2568) #define M_INTERNAL 'n'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2569)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2570) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2571) * When further balancing is not needed, then do_balance does not need
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2572) * to be called.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2573) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2574) #define M_SKIP_BALANCING 's'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2575) #define M_CONVERT 'v'
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2576)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2577) /* modes of leaf_move_items */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2578) #define LEAF_FROM_S_TO_L 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2579) #define LEAF_FROM_S_TO_R 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2580) #define LEAF_FROM_R_TO_L 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2581) #define LEAF_FROM_L_TO_R 3
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2582) #define LEAF_FROM_S_TO_SNEW 4
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2583)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2584) #define FIRST_TO_LAST 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2585) #define LAST_TO_FIRST 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2586)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2587) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2588) * used in do_balance for passing parent of node information that has
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2589) * been gotten from tb struct
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2590) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2591) struct buffer_info {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2592) struct tree_balance *tb;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2593) struct buffer_head *bi_bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2594) struct buffer_head *bi_parent;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2595) int bi_position;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2596) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2597)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2598) static inline struct super_block *sb_from_tb(struct tree_balance *tb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2599) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2600) return tb ? tb->tb_sb : NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2601) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2602)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2603) static inline struct super_block *sb_from_bi(struct buffer_info *bi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2604) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2605) return bi ? sb_from_tb(bi->tb) : NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2606) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2607)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2608) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2609) * there are 4 types of items: stat data, directory item, indirect, direct.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2610) * +-------------------+------------+--------------+------------+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2611) * | | k_offset | k_uniqueness | mergeable? |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2612) * +-------------------+------------+--------------+------------+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2613) * | stat data | 0 | 0 | no |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2614) * +-------------------+------------+--------------+------------+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2615) * | 1st directory item| DOT_OFFSET | DIRENTRY_ .. | no |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2616) * | non 1st directory | hash value | UNIQUENESS | yes |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2617) * | item | | | |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2618) * +-------------------+------------+--------------+------------+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2619) * | indirect item | offset + 1 |TYPE_INDIRECT | [1] |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2620) * +-------------------+------------+--------------+------------+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2621) * | direct item | offset + 1 |TYPE_DIRECT | [2] |
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2622) * +-------------------+------------+--------------+------------+
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2623) *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2624) * [1] if this is not the first indirect item of the object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2625) * [2] if this is not the first direct item of the object
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2626) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2627)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2628) struct item_operations {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2629) int (*bytes_number) (struct item_head * ih, int block_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2630) void (*decrement_key) (struct cpu_key *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2631) int (*is_left_mergeable) (struct reiserfs_key * ih,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2632) unsigned long bsize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2633) void (*print_item) (struct item_head *, char *item);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2634) void (*check_item) (struct item_head *, char *item);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2635)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2636) int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2637) int is_affected, int insert_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2638) int (*check_left) (struct virtual_item * vi, int free,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2639) int start_skip, int end_skip);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2640) int (*check_right) (struct virtual_item * vi, int free);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2641) int (*part_size) (struct virtual_item * vi, int from, int to);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2642) int (*unit_num) (struct virtual_item * vi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2643) void (*print_vi) (struct virtual_item * vi);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2644) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2645)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2646) extern struct item_operations *item_ops[TYPE_ANY + 1];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2647)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2648) #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2649) #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2650) #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2651) #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2652) #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)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2653) #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2654) #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2655) #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2656) #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2657) #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2658)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2659) #define COMP_SHORT_KEYS comp_short_keys
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2660)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2661) /* number of blocks pointed to by the indirect item */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2662) #define I_UNFM_NUM(ih) (ih_item_len(ih) / UNFM_P_SIZE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2663)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2664) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2665) * the used space within the unformatted node corresponding
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2666) * to pos within the item pointed to by ih
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2667) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2668) #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2669)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2670) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2671) * number of bytes contained by the direct item or the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2672) * unformatted nodes the indirect item points to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2673) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2674)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2675) /* following defines use reiserfs buffer header and item header */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2676)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2677) /* get stat-data */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2678) #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2679)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2680) /* this is 3976 for size==4096 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2681) #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2682)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2683) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2684) * indirect items consist of entries which contain blocknrs, pos
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2685) * indicates which entry, and B_I_POS_UNFM_POINTER resolves to the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2686) * blocknr contained by the entry pos points to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2687) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2688) #define B_I_POS_UNFM_POINTER(bh, ih, pos) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2689) le32_to_cpu(*(((unp_t *)ih_item_body(bh, ih)) + (pos)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2690) #define PUT_B_I_POS_UNFM_POINTER(bh, ih, pos, val) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2691) (*(((unp_t *)ih_item_body(bh, ih)) + (pos)) = cpu_to_le32(val))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2692)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2693) struct reiserfs_iget_args {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2694) __u32 objectid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2695) __u32 dirid;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2696) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2697)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2698) /***************************************************************************
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2699) * FUNCTION DECLARATIONS *
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2700) ***************************************************************************/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2701)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2702) #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2703)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2704) #define journal_trans_half(blocksize) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2705) ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2706)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2707) /* journal.c see journal.c for all the comments here */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2708)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2709) /* first block written in a commit. */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2710) struct reiserfs_journal_desc {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2711) __le32 j_trans_id; /* id of commit */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2712)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2713) /* length of commit. len +1 is the commit block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2714) __le32 j_len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2715)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2716) __le32 j_mount_id; /* mount id of this trans */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2717) __le32 j_realblock[1]; /* real locations for each block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2718) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2719)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2720) #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2721) #define get_desc_trans_len(d) le32_to_cpu((d)->j_len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2722) #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2723)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2724) #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2725) #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2726) #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2727)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2728) /* last block written in a commit */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2729) struct reiserfs_journal_commit {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2730) __le32 j_trans_id; /* must match j_trans_id from the desc block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2731) __le32 j_len; /* ditto */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2732) __le32 j_realblock[1]; /* real locations for each block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2733) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2734)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2735) #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2736) #define get_commit_trans_len(c) le32_to_cpu((c)->j_len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2737) #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2738)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2739) #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2740) #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2741)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2742) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2743) * this header block gets written whenever a transaction is considered
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2744) * fully flushed, and is more recent than the last fully flushed transaction.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2745) * fully flushed means all the log blocks and all the real blocks are on
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2746) * disk, and this transaction does not need to be replayed.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2747) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2748) struct reiserfs_journal_header {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2749) /* id of last fully flushed transaction */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2750) __le32 j_last_flush_trans_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2751)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2752) /* offset in the log of where to start replay after a crash */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2753) __le32 j_first_unflushed_offset;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2754)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2755) __le32 j_mount_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2756) /* 12 */ struct journal_params jh_journal;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2757) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2758)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2759) /* biggest tunable defines are right here */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2760) #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2761)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2762) /* biggest possible single transaction, don't change for now (8/3/99) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2763) #define JOURNAL_TRANS_MAX_DEFAULT 1024
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2764) #define JOURNAL_TRANS_MIN_DEFAULT 256
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2765)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2766) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2767) * max blocks to batch into one transaction,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2768) * don't make this any bigger than 900
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2769) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2770) #define JOURNAL_MAX_BATCH_DEFAULT 900
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2771) #define JOURNAL_MIN_RATIO 2
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2772) #define JOURNAL_MAX_COMMIT_AGE 30
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2773) #define JOURNAL_MAX_TRANS_AGE 30
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2774) #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2775) #define JOURNAL_BLOCKS_PER_OBJECT(sb) (JOURNAL_PER_BALANCE_CNT * 3 + \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2776) 2 * (REISERFS_QUOTA_INIT_BLOCKS(sb) + \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2777) REISERFS_QUOTA_TRANS_BLOCKS(sb)))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2778)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2779) #ifdef CONFIG_QUOTA
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2780) #define REISERFS_QUOTA_OPTS ((1 << REISERFS_USRQUOTA) | (1 << REISERFS_GRPQUOTA))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2781) /* We need to update data and inode (atime) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2782) #define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? 2 : 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2783) /* 1 balancing, 1 bitmap, 1 data per write + stat data update */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2784) #define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2785) (DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2786) /* same as with INIT */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2787) #define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2788) (DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2789) #else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2790) #define REISERFS_QUOTA_TRANS_BLOCKS(s) 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2791) #define REISERFS_QUOTA_INIT_BLOCKS(s) 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2792) #define REISERFS_QUOTA_DEL_BLOCKS(s) 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2793) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2794)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2795) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2796) * both of these can be as low as 1, or as high as you want. The min is the
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2797) * number of 4k bitmap nodes preallocated on mount. New nodes are allocated
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2798) * as needed, and released when transactions are committed. On release, if
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2799) * the current number of nodes is > max, the node is freed, otherwise,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2800) * it is put on a free list for faster use later.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2801) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2802) #define REISERFS_MIN_BITMAP_NODES 10
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2803) #define REISERFS_MAX_BITMAP_NODES 100
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2804)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2805) /* these are based on journal hash size of 8192 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2806) #define JBH_HASH_SHIFT 13
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2807) #define JBH_HASH_MASK 8191
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2808)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2809) #define _jhashfn(sb,block) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2810) (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2811) (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2812) #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2813)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2814) /* We need these to make journal.c code more readable */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2815) #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2816) #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2817) #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2818)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2819) enum reiserfs_bh_state_bits {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2820) BH_JDirty = BH_PrivateStart, /* buffer is in current transaction */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2821) BH_JDirty_wait,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2822) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2823) * disk block was taken off free list before being in a
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2824) * finished transaction, or written to disk. Can be reused immed.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2825) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2826) BH_JNew,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2827) BH_JPrepared,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2828) BH_JRestore_dirty,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2829) BH_JTest, /* debugging only will go away */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2830) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2831)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2832) BUFFER_FNS(JDirty, journaled);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2833) TAS_BUFFER_FNS(JDirty, journaled);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2834) BUFFER_FNS(JDirty_wait, journal_dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2835) TAS_BUFFER_FNS(JDirty_wait, journal_dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2836) BUFFER_FNS(JNew, journal_new);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2837) TAS_BUFFER_FNS(JNew, journal_new);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2838) BUFFER_FNS(JPrepared, journal_prepared);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2839) TAS_BUFFER_FNS(JPrepared, journal_prepared);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2840) BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2841) TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2842) BUFFER_FNS(JTest, journal_test);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2843) TAS_BUFFER_FNS(JTest, journal_test);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2844)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2845) /* transaction handle which is passed around for all journal calls */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2846) struct reiserfs_transaction_handle {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2847) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2848) * super for this FS when journal_begin was called. saves calls to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2849) * reiserfs_get_super also used by nested transactions to make
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2850) * sure they are nesting on the right FS _must_ be first
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2851) * in the handle
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2852) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2853) struct super_block *t_super;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2854)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2855) int t_refcount;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2856) int t_blocks_logged; /* number of blocks this writer has logged */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2857) int t_blocks_allocated; /* number of blocks this writer allocated */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2858)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2859) /* sanity check, equals the current trans id */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2860) unsigned int t_trans_id;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2861)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2862) void *t_handle_save; /* save existing current->journal_info */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2863)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2864) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2865) * if new block allocation occurres, that block
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2866) * should be displaced from others
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2867) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2868) unsigned displace_new_blocks:1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2869)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2870) struct list_head t_list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2871) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2872)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2873) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2874) * used to keep track of ordered and tail writes, attached to the buffer
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2875) * head through b_journal_head.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2876) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2877) struct reiserfs_jh {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2878) struct reiserfs_journal_list *jl;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2879) struct buffer_head *bh;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2880) struct list_head list;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2881) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2882)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2883) void reiserfs_free_jh(struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2884) int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2885) int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2886) int journal_mark_dirty(struct reiserfs_transaction_handle *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2887) struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2888)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2889) static inline int reiserfs_file_data_log(struct inode *inode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2890) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2891) if (reiserfs_data_log(inode->i_sb) ||
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2892) (REISERFS_I(inode)->i_flags & i_data_log))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2893) return 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2894) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2895) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2896)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2897) static inline int reiserfs_transaction_running(struct super_block *s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2898) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2899) struct reiserfs_transaction_handle *th = current->journal_info;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2900) if (th && th->t_super == s)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2901) return 1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2902) if (th && th->t_super == NULL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2903) BUG();
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2904) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2905) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2906)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2907) static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2908) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2909) return th->t_blocks_allocated - th->t_blocks_logged;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2910) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2911)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2912) struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2913) super_block
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2914) *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2915) int count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2916) int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2917) void reiserfs_vfs_truncate_file(struct inode *inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2918) int reiserfs_commit_page(struct inode *inode, struct page *page,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2919) unsigned from, unsigned to);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2920) void reiserfs_flush_old_commits(struct super_block *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2921) int reiserfs_commit_for_inode(struct inode *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2922) int reiserfs_inode_needs_commit(struct inode *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2923) void reiserfs_update_inode_transaction(struct inode *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2924) void reiserfs_wait_on_write_block(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2925) void reiserfs_block_writes(struct reiserfs_transaction_handle *th);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2926) void reiserfs_allow_writes(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2927) void reiserfs_check_lock_depth(struct super_block *s, char *caller);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2928) int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2929) int wait);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2930) void reiserfs_restore_prepared_buffer(struct super_block *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2931) struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2932) int journal_init(struct super_block *, const char *j_dev_name, int old_format,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2933) unsigned int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2934) int journal_release(struct reiserfs_transaction_handle *, struct super_block *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2935) int journal_release_error(struct reiserfs_transaction_handle *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2936) struct super_block *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2937) int journal_end(struct reiserfs_transaction_handle *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2938) int journal_end_sync(struct reiserfs_transaction_handle *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2939) int journal_mark_freed(struct reiserfs_transaction_handle *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2940) struct super_block *, b_blocknr_t blocknr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2941) int journal_transaction_should_end(struct reiserfs_transaction_handle *, int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2942) int reiserfs_in_journal(struct super_block *sb, unsigned int bmap_nr,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2943) int bit_nr, int searchall, b_blocknr_t *next);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2944) int journal_begin(struct reiserfs_transaction_handle *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2945) struct super_block *sb, unsigned long);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2946) int journal_join_abort(struct reiserfs_transaction_handle *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2947) struct super_block *sb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2948) void reiserfs_abort_journal(struct super_block *sb, int errno);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2949) void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2950) int reiserfs_allocate_list_bitmaps(struct super_block *s,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2951) struct reiserfs_list_bitmap *, unsigned int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2952)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2953) void reiserfs_schedule_old_flush(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2954) void reiserfs_cancel_old_flush(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2955) void add_save_link(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2956) struct inode *inode, int truncate);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2957) int remove_save_link(struct inode *inode, int truncate);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2958)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2959) /* objectid.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2960) __u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2961) void reiserfs_release_objectid(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2962) __u32 objectid_to_release);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2963) int reiserfs_convert_objectid_map_v1(struct super_block *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2964)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2965) /* stree.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2966) int B_IS_IN_TREE(const struct buffer_head *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2967) extern void copy_item_head(struct item_head *to,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2968) const struct item_head *from);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2969)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2970) /* first key is in cpu form, second - le */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2971) extern int comp_short_keys(const struct reiserfs_key *le_key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2972) const struct cpu_key *cpu_key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2973) extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2974)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2975) /* both are in le form */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2976) extern int comp_le_keys(const struct reiserfs_key *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2977) const struct reiserfs_key *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2978) extern int comp_short_le_keys(const struct reiserfs_key *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2979) const struct reiserfs_key *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2980)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2981) /* * get key version from on disk key - kludge */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2982) static inline int le_key_version(const struct reiserfs_key *key)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2983) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2984) int type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2985)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2986) type = offset_v2_k_type(&(key->u.k_offset_v2));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2987) if (type != TYPE_DIRECT && type != TYPE_INDIRECT
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2988) && type != TYPE_DIRENTRY)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2989) return KEY_FORMAT_3_5;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2990)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2991) return KEY_FORMAT_3_6;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2992)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2993) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2994)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2995) static inline void copy_key(struct reiserfs_key *to,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2996) const struct reiserfs_key *from)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2997) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2998) memcpy(to, from, KEY_SIZE);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2999) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3000)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3001) int comp_items(const struct item_head *stored_ih, const struct treepath *path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3002) const struct reiserfs_key *get_rkey(const struct treepath *chk_path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3003) const struct super_block *sb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3004) int search_by_key(struct super_block *, const struct cpu_key *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3005) struct treepath *, int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3006) #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3007) int search_for_position_by_key(struct super_block *sb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3008) const struct cpu_key *cpu_key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3009) struct treepath *search_path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3010) extern void decrement_bcount(struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3011) void decrement_counters_in_path(struct treepath *search_path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3012) void pathrelse(struct treepath *search_path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3013) int reiserfs_check_path(struct treepath *p);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3014) void pathrelse_and_restore(struct super_block *s, struct treepath *search_path);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3015)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3016) int reiserfs_insert_item(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3017) struct treepath *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3018) const struct cpu_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3019) struct item_head *ih,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3020) struct inode *inode, const char *body);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3021)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3022) int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3023) struct treepath *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3024) const struct cpu_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3025) struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3026) const char *body, int paste_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3027)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3028) int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3029) struct treepath *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3030) struct cpu_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3031) struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3032) struct page *page, loff_t new_file_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3033)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3034) int reiserfs_delete_item(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3035) struct treepath *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3036) const struct cpu_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3037) struct inode *inode, struct buffer_head *un_bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3038)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3039) void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3040) struct inode *inode, struct reiserfs_key *key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3041) int reiserfs_delete_object(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3042) struct inode *inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3043) int reiserfs_do_truncate(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3044) struct inode *inode, struct page *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3045) int update_timestamps);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3046)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3047) #define i_block_size(inode) ((inode)->i_sb->s_blocksize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3048) #define file_size(inode) ((inode)->i_size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3049) #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3050)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3051) #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3052) !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 )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3053)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3054) void padd_item(char *item, int total_length, int length);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3055)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3056) /* inode.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3057) /* args for the create parameter of reiserfs_get_block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3058) #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3059) #define GET_BLOCK_CREATE 1 /* add anything you need to find block */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3060) #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3061) #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3062) #define GET_BLOCK_NO_IMUX 8 /* i_mutex is not held, don't preallocate */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3063) #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3064)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3065) void reiserfs_read_locked_inode(struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3066) struct reiserfs_iget_args *args);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3067) int reiserfs_find_actor(struct inode *inode, void *p);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3068) int reiserfs_init_locked_inode(struct inode *inode, void *p);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3069) void reiserfs_evict_inode(struct inode *inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3070) int reiserfs_write_inode(struct inode *inode, struct writeback_control *wbc);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3071) int reiserfs_get_block(struct inode *inode, sector_t block,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3072) struct buffer_head *bh_result, int create);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3073) struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3074) int fh_len, int fh_type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3075) struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3076) int fh_len, int fh_type);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3077) int reiserfs_encode_fh(struct inode *inode, __u32 * data, int *lenp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3078) struct inode *parent);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3079)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3080) int reiserfs_truncate_file(struct inode *, int update_timestamps);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3081) void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3082) int type, int key_length);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3083) void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3084) int version,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3085) loff_t offset, int type, int length, int entry_count);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3086) struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3087)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3088) struct reiserfs_security_handle;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3089) int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3090) struct inode *dir, umode_t mode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3091) const char *symname, loff_t i_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3092) struct dentry *dentry, struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3093) struct reiserfs_security_handle *security);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3094)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3095) void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3096) struct inode *inode, loff_t size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3097)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3098) static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3099) struct inode *inode)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3100) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3101) reiserfs_update_sd_size(th, inode, inode->i_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3102) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3103)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3104) void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3105) int reiserfs_setattr(struct dentry *dentry, struct iattr *attr);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3106)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3107) int __reiserfs_write_begin(struct page *page, unsigned from, unsigned len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3108)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3109) /* namei.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3110) void set_de_name_and_namelen(struct reiserfs_dir_entry *de);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3111) int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3112) struct treepath *path, struct reiserfs_dir_entry *de);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3113) struct dentry *reiserfs_get_parent(struct dentry *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3114)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3115) #ifdef CONFIG_REISERFS_PROC_INFO
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3116) int reiserfs_proc_info_init(struct super_block *sb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3117) int reiserfs_proc_info_done(struct super_block *sb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3118) int reiserfs_proc_info_global_init(void);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3119) int reiserfs_proc_info_global_done(void);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3120)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3121) #define PROC_EXP( e ) e
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3122)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3123) #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3124) #define PROC_INFO_MAX( sb, field, value ) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3125) __PINFO( sb ).field = \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3126) max( REISERFS_SB( sb ) -> s_proc_info_data.field, value )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3127) #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3128) #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3129) #define PROC_INFO_BH_STAT( sb, bh, level ) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3130) PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3131) PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3132) PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3133) #else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3134) static inline int reiserfs_proc_info_init(struct super_block *sb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3135) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3136) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3137) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3138)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3139) static inline int reiserfs_proc_info_done(struct super_block *sb)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3140) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3141) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3142) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3143)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3144) static inline int reiserfs_proc_info_global_init(void)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3145) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3146) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3147) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3148)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3149) static inline int reiserfs_proc_info_global_done(void)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3150) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3151) return 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3152) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3153)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3154) #define PROC_EXP( e )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3155) #define VOID_V ( ( void ) 0 )
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3156) #define PROC_INFO_MAX( sb, field, value ) VOID_V
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3157) #define PROC_INFO_INC( sb, field ) VOID_V
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3158) #define PROC_INFO_ADD( sb, field, val ) VOID_V
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3159) #define PROC_INFO_BH_STAT(sb, bh, n_node_level) VOID_V
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3160) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3161)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3162) /* dir.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3163) extern const struct inode_operations reiserfs_dir_inode_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3164) extern const struct inode_operations reiserfs_symlink_inode_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3165) extern const struct inode_operations reiserfs_special_inode_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3166) extern const struct file_operations reiserfs_dir_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3167) int reiserfs_readdir_inode(struct inode *, struct dir_context *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3168)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3169) /* tail_conversion.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3170) int direct2indirect(struct reiserfs_transaction_handle *, struct inode *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3171) struct treepath *, struct buffer_head *, loff_t);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3172) int indirect2direct(struct reiserfs_transaction_handle *, struct inode *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3173) struct page *, struct treepath *, const struct cpu_key *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3174) loff_t, char *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3175) void reiserfs_unmap_buffer(struct buffer_head *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3176)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3177) /* file.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3178) extern const struct inode_operations reiserfs_file_inode_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3179) extern const struct file_operations reiserfs_file_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3180) extern const struct address_space_operations reiserfs_address_space_operations;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3181)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3182) /* fix_nodes.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3183)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3184) int fix_nodes(int n_op_mode, struct tree_balance *tb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3185) struct item_head *ins_ih, const void *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3186) void unfix_nodes(struct tree_balance *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3187)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3188) /* prints.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3189) void __reiserfs_panic(struct super_block *s, const char *id,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3190) const char *function, const char *fmt, ...)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3191) __attribute__ ((noreturn));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3192) #define reiserfs_panic(s, id, fmt, args...) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3193) __reiserfs_panic(s, id, __func__, fmt, ##args)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3194) void __reiserfs_error(struct super_block *s, const char *id,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3195) const char *function, const char *fmt, ...);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3196) #define reiserfs_error(s, id, fmt, args...) \
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3197) __reiserfs_error(s, id, __func__, fmt, ##args)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3198) void reiserfs_info(struct super_block *s, const char *fmt, ...);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3199) void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3200) void print_indirect_item(struct buffer_head *bh, int item_num);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3201) void store_print_tb(struct tree_balance *tb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3202) void print_cur_tb(char *mes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3203) void print_de(struct reiserfs_dir_entry *de);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3204) void print_bi(struct buffer_info *bi, char *mes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3205) #define PRINT_LEAF_ITEMS 1 /* print all items */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3206) #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3207) #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3208) void print_block(struct buffer_head *bh, ...);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3209) void print_bmap(struct super_block *s, int silent);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3210) void print_bmap_block(int i, char *data, int size, int silent);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3211) /*void print_super_block (struct super_block * s, char * mes);*/
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3212) void print_objectid_map(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3213) void print_block_head(struct buffer_head *bh, char *mes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3214) void check_leaf(struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3215) void check_internal(struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3216) void print_statistics(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3217) char *reiserfs_hashname(int code);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3218)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3219) /* lbalance.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3220) int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3221) int mov_bytes, struct buffer_head *Snew);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3222) int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3223) int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3224) void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3225) int del_num, int del_bytes);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3226) void leaf_insert_into_buf(struct buffer_info *bi, int before,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3227) struct item_head * const inserted_item_ih,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3228) const char * const inserted_item_body,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3229) int zeros_number);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3230) void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3231) int pos_in_item, int paste_size,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3232) const char * const body, int zeros_number);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3233) void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3234) int pos_in_item, int cut_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3235) void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3236) int new_entry_count, struct reiserfs_de_head *new_dehs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3237) const char *records, int paste_size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3238) /* ibalance.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3239) int balance_internal(struct tree_balance *, int, int, struct item_head *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3240) struct buffer_head **);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3241)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3242) /* do_balance.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3243) void do_balance_mark_leaf_dirty(struct tree_balance *tb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3244) struct buffer_head *bh, int flag);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3245) #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3246) #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3247)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3248) void do_balance(struct tree_balance *tb, struct item_head *ih,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3249) const char *body, int flag);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3250) void reiserfs_invalidate_buffer(struct tree_balance *tb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3251) struct buffer_head *bh);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3252)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3253) int get_left_neighbor_position(struct tree_balance *tb, int h);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3254) int get_right_neighbor_position(struct tree_balance *tb, int h);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3255) void replace_key(struct tree_balance *tb, struct buffer_head *, int,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3256) struct buffer_head *, int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3257) void make_empty_node(struct buffer_info *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3258) struct buffer_head *get_FEB(struct tree_balance *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3259)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3260) /* bitmap.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3261)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3262) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3263) * structure contains hints for block allocator, and it is a container for
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3264) * arguments, such as node, search path, transaction_handle, etc.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3265) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3266) struct __reiserfs_blocknr_hint {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3267) /* inode passed to allocator, if we allocate unf. nodes */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3268) struct inode *inode;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3269)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3270) sector_t block; /* file offset, in blocks */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3271) struct in_core_key key;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3272)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3273) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3274) * search path, used by allocator to deternine search_start by
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3275) * various ways
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3276) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3277) struct treepath *path;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3278)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3279) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3280) * transaction handle is needed to log super blocks
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3281) * and bitmap blocks changes
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3282) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3283) struct reiserfs_transaction_handle *th;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3284)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3285) b_blocknr_t beg, end;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3286)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3287) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3288) * a field used to transfer search start value (block number)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3289) * between different block allocator procedures
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3290) * (determine_search_start() and others)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3291) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3292) b_blocknr_t search_start;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3293)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3294) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3295) * is set in determine_prealloc_size() function,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3296) * used by underlayed function that do actual allocation
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3297) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3298) int prealloc_size;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3299)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3300) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3301) * the allocator uses different polices for getting disk
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3302) * space for formatted/unformatted blocks with/without preallocation
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3303) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3304) unsigned formatted_node:1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3305) unsigned preallocate:1;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3306) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3307)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3308) typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3309)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3310) int reiserfs_parse_alloc_options(struct super_block *, char *);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3311) void reiserfs_init_alloc_options(struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3312)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3313) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3314) * given a directory, this will tell you what packing locality
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3315) * to use for a new object underneat it. The locality is returned
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3316) * in disk byte order (le).
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3317) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3318) __le32 reiserfs_choose_packing(struct inode *dir);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3319)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3320) void show_alloc_options(struct seq_file *seq, struct super_block *s);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3321) int reiserfs_init_bitmap_cache(struct super_block *sb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3322) void reiserfs_free_bitmap_cache(struct super_block *sb);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3323) void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3324) struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3325) int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3326) void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3327) b_blocknr_t, int for_unformatted);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3328) int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3329) int);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3330) static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3331) b_blocknr_t * new_blocknrs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3332) int amount_needed)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3333) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3334) reiserfs_blocknr_hint_t hint = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3335) .th = tb->transaction_handle,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3336) .path = tb->tb_path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3337) .inode = NULL,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3338) .key = tb->key,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3339) .block = 0,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3340) .formatted_node = 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3341) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3342) return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3343) 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3344) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3345)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3346) static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3347) *th, struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3348) b_blocknr_t * new_blocknrs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3349) struct treepath *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3350) sector_t block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3351) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3352) reiserfs_blocknr_hint_t hint = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3353) .th = th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3354) .path = path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3355) .inode = inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3356) .block = block,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3357) .formatted_node = 0,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3358) .preallocate = 0
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3359) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3360) return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3361) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3362)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3363) #ifdef REISERFS_PREALLOCATE
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3364) static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3365) *th, struct inode *inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3366) b_blocknr_t * new_blocknrs,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3367) struct treepath *path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3368) sector_t block)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3369) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3370) reiserfs_blocknr_hint_t hint = {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3371) .th = th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3372) .path = path,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3373) .inode = inode,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3374) .block = block,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3375) .formatted_node = 0,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3376) .preallocate = 1
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3377) };
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3378) return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3379) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3380)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3381) void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3382) struct inode *inode);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3383) void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3384) #endif
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3385)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3386) /* hashes.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3387) __u32 keyed_hash(const signed char *msg, int len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3388) __u32 yura_hash(const signed char *msg, int len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3389) __u32 r5_hash(const signed char *msg, int len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3390)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3391) #define reiserfs_set_le_bit __set_bit_le
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3392) #define reiserfs_test_and_set_le_bit __test_and_set_bit_le
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3393) #define reiserfs_clear_le_bit __clear_bit_le
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3394) #define reiserfs_test_and_clear_le_bit __test_and_clear_bit_le
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3395) #define reiserfs_test_le_bit test_bit_le
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3396) #define reiserfs_find_next_zero_le_bit find_next_zero_bit_le
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3397)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3398) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3399) * sometimes reiserfs_truncate may require to allocate few new blocks
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3400) * to perform indirect2direct conversion. People probably used to
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3401) * think, that truncate should work without problems on a filesystem
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3402) * without free disk space. They may complain that they can not
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3403) * truncate due to lack of free disk space. This spare space allows us
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3404) * to not worry about it. 500 is probably too much, but it should be
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3405) * absolutely safe
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3406) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3407) #define SPARE_SPACE 500
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3408)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3409) /* prototypes from ioctl.c */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3410) long reiserfs_ioctl(struct file *filp, unsigned int cmd, unsigned long arg);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3411) long reiserfs_compat_ioctl(struct file *filp,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3412) unsigned int cmd, unsigned long arg);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3413) int reiserfs_unpack(struct inode *inode, struct file *filp);
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags