Lines Matching defs:block
75 /* first unused block of a sequence of unused blocks */
186 * If the journal block count is smaller than n transactions, you lose speed.
217 * One of these for every block in every transaction
221 * hnext and hprev are used by journal_list_hash. If a block is in more
230 /* block number of real buffer head, == 0 when buffer on disk */
259 * hit the disk, and to make sure every real block in a transaction is on
298 /* newest journal block */
301 /* oldest journal block. start here for traverse */
307 /* first block on s_dev of reserved area journal */
517 /* reiserfs union of in-core super block data */
519 /* Buffer containing the super block */
522 /* Pointer to the on-disk super block in the buffer */
554 /* This is a structure that describes block allocator options */
652 * small (for files less than block size) tails will
661 * -o conv: causes conversion of old format super block to the
935 * Structure of super block on disk, a version of which in RAM is often
978 __le32 s_root_block; /* root block number */
980 __le16 s_blocksize; /* block size */
1009 * each block of file system
1027 /* this is the on disk super block */
1053 /* on-disk super block fields converted to cpu form */
1098 #define is_block_in_log_or_reserved_area(s, block) \
1099 block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
1100 && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
1112 * This number must be larger than the largest block size on any
1201 * block, if you have to do a seek and rotate. A tail risks a
1203 * time cost for a 4 block file and saves an amount of space that is
1358 * within the block.
1386 /* an offset to the item body within the block */
1644 * Header of a disk block. More precisely, header of a formatted leaf
1648 __le16 blk_level; /* Level of a block in the tree. */
1649 __le16 blk_nr_item; /* Number of keys/items in a block. */
1682 * block head of that node.
1973 /* two entries per block (at least) */
2025 * |block | keys | pointers | space |
2038 __le32 dc_block_number; /* Disk child's block number. */
2062 /* amount of used space in buffer (not including block head) */
2076 * buffers in the cache given their block number. If it does not find
2546 * key pointer, to pass to block allocator or
2709 /* first block written in a commit. */
2713 /* length of commit. len +1 is the commit block */
2717 __le32 j_realblock[1]; /* real locations for each block */
2728 /* last block written in a commit */
2730 __le32 j_trans_id; /* must match j_trans_id from the desc block */
2732 __le32 j_realblock[1]; /* real locations for each block */
2743 * this header block gets written whenever a transaction is considered
2809 #define _jhashfn(sb,block) \
2811 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
2812 #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
2815 #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
2816 #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
2817 #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, 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,
3263 * structure contains hints for block allocator, and it is a container for
3270 sector_t block; /* file offset, in blocks */
3288 * a field used to transfer search start value (block number)
3289 * between different block allocator procedures
3325 int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
3339 .block = 0,
3350 sector_t block)
3356 .block = block,
3368 sector_t block)
3374 .block = block,