fs/reiserfs/reiserfs.h

73 	/* first unused block of a sequence of unused blocks */
184  * If the journal block count is smaller than n transactions, you lose speed.
215  * One of these for every block in every transaction
219  * hnext and hprev are used by journal_list_hash.  If a block is in more
228 	/* block number of real buffer head, == 0 when buffer on disk */
257  * hit the disk, and to make sure every real block in a transaction is on
296 	/* newest journal block */
299 	/* oldest journal block.  start here for traverse */
304 	/* first block on s_dev of reserved area journal */
514 /* reiserfs union of in-core super block data */
516 	/* Buffer containing the super block */
519 	/* Pointer to the on-disk super block in the buffer */
551 	/* This is a structure that describes block allocator options */
649 	 * small (for files less than block size) tails will
658 	 * -o conv: causes conversion of old format super block to the
932  * Structure of super block on disk, a version of which in RAM is often
975 	__le32 s_root_block;	/* root block number    */
977 	__le16 s_blocksize;	/* block size */
1006 	 * each block of file system
1024 /* this is the on disk super block */
1050 /* on-disk super block fields converted to cpu form */
1095 #define is_block_in_log_or_reserved_area(s, block) \
1096          block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
1097          && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) +  \
1109  * This number must be larger than the largest block size on any
1198  * block, if you have to do a seek and rotate.  A tail risks a
1200  * time cost for a 4 block file and saves an amount of space that is
1355  * within the block.
1383 	/* an offset to the item body within the block */
1641  * Header of a disk block.  More precisely, header of a formatted leaf
1645 	__le16 blk_level;	/* Level of a block in the tree. */
1646 	__le16 blk_nr_item;	/* Number of keys/items in a block. */
1679  * block head of that node.
1970 /* two entries per block (at least) */
2022  * |block |    keys       |  pointers         | space     |
2035 	__le32 dc_block_number;	/* Disk child's block number. */
2059 /* amount of used space in buffer (not including block head) */
2073  * buffers in the cache given their block number.  If it does not find
2543 	 * key pointer, to pass to block allocator or
2706 /* first block written in a commit.  */
2710 	/* length of commit. len +1 is the commit block */
2714 	__le32 j_realblock[];	/* real locations for each block */
2725 /* last block written in a commit */
2727 	__le32 j_trans_id;	/* must match j_trans_id from the desc block */
2729 	__le32 j_realblock[];	/* real locations for each block */
2740  * this header block gets written whenever a transaction is considered
2806 #define _jhashfn(sb,block)	\
2808 	 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
2809 #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
2812 #define journal_find_get_block(s, block) __find_get_block(\
2813 		file_bdev(SB_JOURNAL(s)->j_bdev_file), block, s->s_blocksize)
2814 #define journal_getblk(s, block) __getblk(file_bdev(SB_JOURNAL(s)->j_bdev_file),\
2815 		block, s->s_blocksize)
2816 #define journal_bread(s, block) __bread(file_bdev(SB_JOURNAL(s)->j_bdev_file),\
2817 		block, s->s_blocksize)
2823 	 * disk block was taken off free list before being in a
2865 	 * if new block allocation occurres, that block
3059 #define GET_BLOCK_CREATE 1	 /* add anything you need to find block */
3071 int reiserfs_get_block(struct inode *inode, sector_t block,
3266  * structure contains hints for block allocator, and it is a container for
3273 	sector_t block;		/* file offset, in blocks */
3291 	 * a field used to transfer search start value (block number)
3292 	 * between different block allocator procedures
3328 int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
3342 		.block = 0,
3353 					    sector_t block)
3359 		.block = block,
3371 					     sector_t block)
3377 		.block = block,