2 * Copyright 1996, 1997, 1998 Hans Reiser, see reiserfs/README for licensing and copyright details
6 #define __PACKED __PACKED
11 /* this file has an amazingly stupid
12 name, yura please fix it to be
13 reiserfs.h, and merge all the rest
14 of our .h files that are in this
18 #ifndef _LINUX_REISER_FS_H
19 #define _LINUX_REISER_FS_H
21 #include <linux/types.h>
23 #include <linux/slab.h>
24 #include <linux/interrupt.h>
25 #include <linux/sched.h>
26 #include <linux/workqueue.h>
27 #include <asm/unaligned.h>
28 #include <linux/bitops.h>
29 #include <linux/proc_fs.h>
30 #include <linux/smp_lock.h>
31 #include <linux/buffer_head.h>
32 #include <linux/reiserfs_fs_i.h>
33 #include <linux/reiserfs_fs_sb.h>
37 * include/linux/reiser_fs.h
39 * Reiser File System constants and structures
43 /* in reading the #defines, it may help to understand that they employ
44 the following abbreviations:
48 H = Height within the tree (should be changed to LEV)
49 N = Number of the item in the node
51 DEH = Directory Entry Header
56 UNFM = UNForMatted node
60 These #defines are named by concatenating these abbreviations,
61 where first comes the arguments, and last comes the return value,
66 #define USE_INODE_GENERATION_COUNTER
68 #define REISERFS_PREALLOCATE
69 #define DISPLACE_NEW_PACKING_LOCALITIES
70 #define PREALLOCATION_SIZE 9
72 /* n must be power of 2 */
73 #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u))
75 // to be ok for alpha and others we have to align structures to 8 byte
77 // FIXME: do not change 4 by anything else: there is code which relies on that
78 #define ROUND_UP(x) _ROUND_UP(x,8LL)
80 /* debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug
83 #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */
85 void reiserfs_warning (struct super_block
*s
, const char * fmt
, ...);
86 /* assertions handling */
89 #define CONSTF __attribute_const__
95 * Disk Data Structures
98 /***************************************************************************/
100 /***************************************************************************/
103 * Structure of super block on disk, a version of which in RAM is often accessed as REISERFS_SB(s)->s_rs
104 * the version in RAM is part of a larger structure containing fields never written to disk.
106 #define UNSET_HASH 0 // read_super will guess about, what hash names
107 // in directories were sorted with
111 #define DEFAULT_HASH R5_HASH
114 struct journal_params
{
115 __u32 jp_journal_1st_block
; /* where does journal start from on its
117 __u32 jp_journal_dev
; /* journal device st_rdev */
118 __u32 jp_journal_size
; /* size of the journal */
119 __u32 jp_journal_trans_max
; /* max number of blocks in a transaction. */
120 __u32 jp_journal_magic
; /* random value made on fs creation (this
121 * was sb_journal_block_count) */
122 __u32 jp_journal_max_batch
; /* max number of blocks to batch into a
124 __u32 jp_journal_max_commit_age
; /* in seconds, how old can an async
126 __u32 jp_journal_max_trans_age
; /* in seconds, how old can a transaction
130 /* this is the super from 3.5.X, where X >= 10 */
132 #pragma pack(push, 1)
135 struct reiserfs_super_block_v1
137 __u32 s_block_count
; /* blocks count */
138 __u32 s_free_blocks
; /* free blocks count */
139 __u32 s_root_block
; /* root block number */
140 struct journal_params s_journal
;
141 __u16 s_blocksize
; /* block size */
142 __u16 s_oid_maxsize
; /* max size of object id array, see
143 * get_objectid() commentary */
144 __u16 s_oid_cursize
; /* current size of object id array */
145 __u16 s_umount_state
; /* this is set to 1 when filesystem was
146 * umounted, to 2 - when not */
147 char s_magic
[10]; /* reiserfs magic string indicates that
148 * file system is reiserfs:
149 * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs" */
150 __u16 s_fs_state
; /* it is set to used by fsck to mark which
151 * phase of rebuilding is done */
152 __u32 s_hash_function_code
; /* indicate, what hash function is being use
153 * to sort names in a directory*/
154 __u16 s_tree_height
; /* height of disk tree */
155 __u16 s_bmap_nr
; /* amount of bitmap blocks needed to address
156 * each block of file system */
157 __u16 s_version
; /* this field is only reliable on filesystem
158 * with non-standard journal */
159 __u16 s_reserved_for_journal
; /* size in blocks of journal area on main
160 * device, we need to keep after
161 * making fs with non-standard journal */
168 #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1))
170 /* this is the on disk super block */
172 #pragma pack(push, 1)
175 struct reiserfs_super_block
177 struct reiserfs_super_block_v1 s_v1
;
178 __u32 s_inode_generation
;
179 __u32 s_flags
; /* Right now used only by inode-attributes, if enabled */
180 unsigned char s_uuid
[16]; /* filesystem unique identifier */
181 unsigned char s_label
[16]; /* filesystem volume label */
182 char s_unused
[88] ; /* zero filled by mkreiserfs and
183 * reiserfs_convert_objectid_map_v1()
184 * so any additions must be updated
192 #define SB_SIZE (sizeof(struct reiserfs_super_block))
194 #define REISERFS_VERSION_1 0
195 #define REISERFS_VERSION_2 2
198 // on-disk super block fields converted to cpu form
199 #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs)
200 #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1))
201 #define SB_BLOCKSIZE(s) \
202 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize))
203 #define SB_BLOCK_COUNT(s) \
204 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count))
205 #define SB_FREE_BLOCKS(s) \
206 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks))
207 #define SB_REISERFS_MAGIC(s) \
208 (SB_V1_DISK_SUPER_BLOCK(s)->s_magic)
209 #define SB_ROOT_BLOCK(s) \
210 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block))
211 #define SB_TREE_HEIGHT(s) \
212 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height))
213 #define SB_REISERFS_STATE(s) \
214 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state))
215 #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version))
216 #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr))
218 #define PUT_SB_BLOCK_COUNT(s, val) \
219 do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0)
220 #define PUT_SB_FREE_BLOCKS(s, val) \
221 do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0)
222 #define PUT_SB_ROOT_BLOCK(s, val) \
223 do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0)
224 #define PUT_SB_TREE_HEIGHT(s, val) \
225 do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0)
226 #define PUT_SB_REISERFS_STATE(s, val) \
227 do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0)
228 #define PUT_SB_VERSION(s, val) \
229 do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0)
230 #define PUT_SB_BMAP_NR(s, val) \
231 do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0)
234 #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal)
235 #define SB_ONDISK_JOURNAL_SIZE(s) \
236 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size))
237 #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \
238 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block))
239 #define SB_ONDISK_JOURNAL_DEVICE(s) \
240 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev))
241 #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \
242 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal))
244 #define is_block_in_log_or_reserved_area(s, block) \
245 block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
246 && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
247 ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \
248 SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s)))
253 #define REISERFS_SUPER_MAGIC 0x52654973
254 /* used by file system utilities that
255 look at the superblock, etc. */
256 #define REISERFS_SUPER_MAGIC_STRING "ReIsErFs"
257 #define REISER2FS_SUPER_MAGIC_STRING "ReIsEr2Fs"
258 #define REISER2FS_JR_SUPER_MAGIC_STRING "ReIsEr3Fs"
260 int is_reiserfs_3_5 (struct reiserfs_super_block
* rs
);
261 int is_reiserfs_3_6 (struct reiserfs_super_block
* rs
);
262 int is_reiserfs_jr (struct reiserfs_super_block
* rs
);
264 /* ReiserFS leaves the first 64k unused, so that partition labels have
265 enough space. If someone wants to write a fancy bootloader that
266 needs more than 64k, let us know, and this will be increased in size.
267 This number must be larger than than the largest block size on any
268 platform, or code will break. -Hans */
269 #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024)
270 #define REISERFS_FIRST_BLOCK unused_define
271 #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES
273 /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */
274 #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024)
276 // reiserfs internal error code (used by search_by_key adn fix_nodes))
278 #define REPEAT_SEARCH -1
280 #define NO_DISK_SPACE -3
281 #define NO_BALANCING_NEEDED (-4)
282 #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5)
283 #define QUOTA_EXCEEDED -6
285 typedef __u32 b_blocknr_t
;
288 struct unfm_nodeinfo
{
290 unsigned short unfm_freespace
;
293 /* there are two formats of keys: 3.5 and 3.6
295 #define KEY_FORMAT_3_5 0
296 #define KEY_FORMAT_3_6 1
298 /* there are two stat datas */
299 #define STAT_DATA_V1 0
300 #define STAT_DATA_V2 1
302 /** this says about version of key of all items (but stat data) the
303 object consists of */
304 #define get_inode_item_key_version( inode ) \
305 ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5)
307 #define set_inode_item_key_version( inode, version ) \
308 ({ if((version)==KEY_FORMAT_3_6) \
309 REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \
311 REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; })
313 #define get_inode_sd_version(inode) \
314 ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1)
316 #define set_inode_sd_version(inode, version) \
317 ({ if((version)==STAT_DATA_V2) \
318 REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \
320 REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; })
322 /* This is an aggressive tail suppression policy, I am hoping it
323 improves our benchmarks. The principle behind it is that percentage
324 space saving is what matters, not absolute space saving. This is
325 non-intuitive, but it helps to understand it if you consider that the
326 cost to access 4 blocks is not much more than the cost to access 1
327 block, if you have to do a seek and rotate. A tail risks a
328 non-linear disk access that is significant as a percentage of total
329 time cost for a 4 block file and saves an amount of space that is
330 less significant as a percentage of space, or so goes the hypothesis.
332 #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \
334 (!(n_tail_size)) || \
335 (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \
336 ( (n_file_size) >= (n_block_size) * 4 ) || \
337 ( ( (n_file_size) >= (n_block_size) * 3 ) && \
338 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \
339 ( ( (n_file_size) >= (n_block_size) * 2 ) && \
340 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \
341 ( ( (n_file_size) >= (n_block_size) ) && \
342 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \
345 /* Another strategy for tails, this one means only create a tail if all the
346 file would fit into one DIRECT item.
347 Primary intention for this one is to increase performance by decreasing
350 #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \
352 (!(n_tail_size)) || \
353 (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \
359 * values for s_umount_state field
361 #define REISERFS_VALID_FS 1
362 #define REISERFS_ERROR_FS 2
365 // there are 5 item types currently
367 #define TYPE_STAT_DATA 0
368 #define TYPE_INDIRECT 1
369 #define TYPE_DIRECT 2
370 #define TYPE_DIRENTRY 3
371 #define TYPE_MAXTYPE 3
372 #define TYPE_ANY 15 // FIXME: comment is required
374 /***************************************************************************/
375 /* KEY & ITEM HEAD */
376 /***************************************************************************/
379 // directories use this key as well as old files
382 #pragma pack(push, 1)
396 #pragma pack(push, 1)
400 #ifdef __LITTLE_ENDIAN
401 /* little endian version */
405 /* big endian version */
416 #ifndef __LITTLE_ENDIAN
419 #pragma pack(push, 1)
423 struct offset_v2 offset_v2
;
425 } __PACKED offset_v2_esafe_overlay
;
433 # define offset_v2_k_type(v2) ((v2)->k_type)
434 # define set_offset_v2_k_type(v2,val) (offset_v2_k_type(v2) = (val))
435 # define offset_v2_k_offset(v2) ((v2)->k_offset)
436 # define set_offset_v2_k_offset(v2,val) (offset_v2_k_offset(v2) = (val))
441 #pragma pack(push, 1)
444 /* Key of an item determines its location in the S+tree, and
445 is composed of 4 components */
446 struct reiserfs_key
{
447 __u32 k_dir_id
; /* packing locality: by default parent
448 directory object id */
449 __u32 k_objectid
; /* object identifier */
451 struct offset_v1 k_offset_v1
;
452 struct offset_v2 k_offset_v2
;
461 struct reiserfs_key on_disk_key
;
463 int key_length
; /* 3 in all cases but direct2indirect and
464 indirect2direct conversion */
467 /* Our function for comparing keys can compare keys of different
468 lengths. It takes as a parameter the length of the keys it is to
469 compare. These defines are used in determining what is to be passed
470 to it as that parameter. */
471 #define REISERFS_FULL_KEY_LEN 4
472 #define REISERFS_SHORT_KEY_LEN 2
474 /* The result of the key compare */
475 #define FIRST_GREATER 1
476 #define SECOND_GREATER -1
477 #define KEYS_IDENTICAL 0
479 #define KEY_NOT_FOUND 0
481 #define KEY_SIZE (sizeof(struct reiserfs_key))
482 #define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32))
484 /* return values for search_by_key and clones */
486 #define ITEM_NOT_FOUND 0
487 #define ENTRY_FOUND 1
488 #define ENTRY_NOT_FOUND 0
489 #define DIRECTORY_NOT_FOUND -1
490 #define REGULAR_FILE_FOUND -2
491 #define DIRECTORY_FOUND -3
493 #define BYTE_NOT_FOUND 0
494 #define FILE_NOT_FOUND -1
496 #define POSITION_FOUND 1
497 #define POSITION_NOT_FOUND 0
499 // return values for reiserfs_find_entry and search_by_entry_key
501 #define NAME_NOT_FOUND 0
502 #define GOTO_PREVIOUS_ITEM 2
503 #define NAME_FOUND_INVISIBLE 3
507 #pragma pack(push, 1)
510 /* Everything in the filesystem is stored as a set of items. The
511 item head contains the key of the item, its free space (for
512 indirect items) and specifies the location of the item itself
516 /* Everything in the tree is found by searching for it based on
518 struct reiserfs_key ih_key
;
520 /* The free space in the last unformatted node of an
521 indirect item if this is an indirect item. This
522 equals 0xFFFF iff this is a direct item or stat data
523 item. Note that the key, not this field, is used to
524 determine the item type, and thus which field this
526 __u16 ih_free_space_reserved
;
527 /* Iff this is a directory item, this field equals the
528 number of directory entries in the directory item. */
529 __u16 ih_entry_count
;
531 __u16 ih_item_len
; /* total size of the item body */
532 __u16 ih_item_location
; /* an offset to the item body
533 * within the block */
534 __u16 ih_version
; /* 0 for all old items, 2 for new
535 ones. Highest bit is set by fsck
536 temporary, cleaned after all
544 /* size of item header */
545 #define IH_SIZE (sizeof(struct item_head))
547 #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved)
548 #define ih_version(ih) le16_to_cpu((ih)->ih_version)
549 #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count)
550 #define ih_location(ih) le16_to_cpu((ih)->ih_item_location)
551 #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len)
553 #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0)
554 #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0)
555 #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0)
556 #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0)
557 #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0)
560 #define unreachable_item(ih) (ih_version(ih) & (1 << 15))
562 #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih))
563 #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val)))
565 /* these operate on indirect items, where you've got an array of ints
566 ** at a possibly unaligned location. These are a noop on ia32
568 ** p is the array of __u32, i is the index into the array, v is the value
571 #define get_block_num(p, i) le32_to_cpu(get_unaligned((p) + (i)))
572 #define put_block_num(p, i, v) put_unaligned(cpu_to_le32(v), (p) + (i))
575 // in old version uniqueness field shows key type
577 #define V1_SD_UNIQUENESS 0
578 #define V1_INDIRECT_UNIQUENESS 0xfffffffe
579 #define V1_DIRECT_UNIQUENESS 0xffffffff
580 #define V1_DIRENTRY_UNIQUENESS 500
581 #define V1_ANY_UNIQUENESS 555 // FIXME: comment is required
584 // here are conversion routines
586 static inline int uniqueness2type (__u32 uniqueness
) CONSTF
;
587 static inline int uniqueness2type (__u32 uniqueness
)
589 switch ((int)uniqueness
) {
590 case V1_SD_UNIQUENESS
: return TYPE_STAT_DATA
;
591 case V1_INDIRECT_UNIQUENESS
: return TYPE_INDIRECT
;
592 case V1_DIRECT_UNIQUENESS
: return TYPE_DIRECT
;
593 case V1_DIRENTRY_UNIQUENESS
: return TYPE_DIRENTRY
;
595 reiserfs_warning (NULL
, "vs-500: unknown uniqueness %d",
597 case V1_ANY_UNIQUENESS
:
602 static inline __u32
type2uniqueness (int type
) CONSTF
;
603 static inline __u32
type2uniqueness (int type
)
606 case TYPE_STAT_DATA
: return V1_SD_UNIQUENESS
;
607 case TYPE_INDIRECT
: return V1_INDIRECT_UNIQUENESS
;
608 case TYPE_DIRECT
: return V1_DIRECT_UNIQUENESS
;
609 case TYPE_DIRENTRY
: return V1_DIRENTRY_UNIQUENESS
;
611 reiserfs_warning (NULL
, "vs-501: unknown type %d", type
);
613 return V1_ANY_UNIQUENESS
;
617 #define is_direntry_le_key(version,key) (le_key_k_type (version, key) == TYPE_DIRENTRY)
618 #define is_direct_le_key(version,key) (le_key_k_type (version, key) == TYPE_DIRECT)
619 #define is_indirect_le_key(version,key) (le_key_k_type (version, key) == TYPE_INDIRECT)
620 #define is_statdata_le_key(version,key) (le_key_k_type (version, key) == TYPE_STAT_DATA)
623 // item header has version.
625 #define is_direntry_le_ih(ih) is_direntry_le_key (ih_version (ih), &((ih)->ih_key))
626 #define is_direct_le_ih(ih) is_direct_le_key (ih_version (ih), &((ih)->ih_key))
627 #define is_indirect_le_ih(ih) is_indirect_le_key (ih_version(ih), &((ih)->ih_key))
628 #define is_statdata_le_ih(ih) is_statdata_le_key (ih_version (ih), &((ih)->ih_key))
630 #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY)
631 #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT)
632 #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT)
633 #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA)
636 /* are these used ? */
637 #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key)))
638 #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key)))
639 #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key)))
640 #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key)))
646 #define I_K_KEY_IN_ITEM(p_s_ih, p_s_key, n_blocksize) \
647 ( ! COMP_SHORT_KEYS(p_s_ih, p_s_key) && \
648 I_OFF_BYTE_IN_ITEM(p_s_ih, k_offset (p_s_key), n_blocksize) )
650 /* maximal length of item */
651 #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
652 #define MIN_ITEM_LEN 1
655 /* object identifier for root dir */
656 #define REISERFS_ROOT_OBJECTID 2
657 #define REISERFS_ROOT_PARENT_OBJECTID 1
658 extern struct reiserfs_key root_key
;
664 * Picture represents a leaf of the S+tree
665 * ______________________________________________________
667 * |Block | Object-Item | F r e e | Objects- |
668 * | head | Headers | S p a c e | Items |
669 * |______|_______________|___________________|___________|
672 /* Header of a disk block. More precisely, header of a formatted leaf
673 or internal node, and not the header of an unformatted node. */
675 __u16 blk_level
; /* Level of a block in the tree. */
676 __u16 blk_nr_item
; /* Number of keys/items in a block. */
677 __u16 blk_free_space
; /* Block free space in bytes. */
679 /* dump this in v4/planA */
680 struct reiserfs_key blk_right_delim_key
; /* kept only for compatibility */
683 #define BLKH_SIZE (sizeof(struct block_head))
684 #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level))
685 #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item))
686 #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space))
687 #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved))
688 #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val))
689 #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val))
690 #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val))
691 #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val))
692 #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key)
693 #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val)
696 * values for blk_level field of the struct block_head
699 #define FREE_LEVEL 0 /* when node gets removed from the tree its
700 blk_level is set to FREE_LEVEL. It is then
701 used to see whether the node is still in the
704 #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level.*/
706 /* Given the buffer head of a formatted node, resolve to the block head of that node. */
707 #define B_BLK_HEAD(p_s_bh) ((struct block_head *)((p_s_bh)->b_data))
708 /* Number of items that are in buffer. */
709 #define B_NR_ITEMS(p_s_bh) (blkh_nr_item(B_BLK_HEAD(p_s_bh)))
710 #define B_LEVEL(p_s_bh) (blkh_level(B_BLK_HEAD(p_s_bh)))
711 #define B_FREE_SPACE(p_s_bh) (blkh_free_space(B_BLK_HEAD(p_s_bh)))
713 #define PUT_B_NR_ITEMS(p_s_bh,val) do { set_blkh_nr_item(B_BLK_HEAD(p_s_bh),val); } while (0)
714 #define PUT_B_LEVEL(p_s_bh,val) do { set_blkh_level(B_BLK_HEAD(p_s_bh),val); } while (0)
715 #define PUT_B_FREE_SPACE(p_s_bh,val) do { set_blkh_free_space(B_BLK_HEAD(p_s_bh),val); } while (0)
718 /* Get right delimiting key. -- little endian */
719 #define B_PRIGHT_DELIM_KEY(p_s_bh) (&(blk_right_delim_key(B_BLK_HEAD(p_s_bh))
721 /* Does the buffer contain a disk leaf. */
722 #define B_IS_ITEMS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) == DISK_LEAF_NODE_LEVEL)
724 /* Does the buffer contain a disk internal node */
725 #define B_IS_KEYS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) > DISK_LEAF_NODE_LEVEL \
726 && B_LEVEL(p_s_bh) <= MAX_HEIGHT)
731 /***************************************************************************/
733 /***************************************************************************/
737 #pragma pack(push, 1)
741 // old stat data is 32 bytes long. We are going to distinguish new one by
746 __u16 sd_mode
; /* file type, permissions */
747 __u16 sd_nlink
; /* number of hard links */
748 __u16 sd_uid
; /* owner */
749 __u16 sd_gid
; /* group */
750 __u32 sd_size
; /* file size */
751 __u32 sd_atime
; /* time of last access */
752 __u32 sd_mtime
; /* time file was last modified */
753 __u32 sd_ctime
; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */
756 __u32 sd_blocks
; /* number of blocks file uses */
758 __u32 sd_first_direct_byte
; /* first byte of file which is stored
759 in a direct item: except that if it
760 equals 1 it is a symlink and if it
761 equals ~(__u32)0 there is no
762 direct item. The existence of this
763 field really grates on me. Let's
764 replace it with a macro based on
765 sd_size and our tail suppression
766 policy. Someday. -Hans */
773 #define SD_V1_SIZE (sizeof(struct stat_data_v1))
774 #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5)
775 #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
776 #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
777 #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink))
778 #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v))
779 #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid))
780 #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v))
781 #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid))
782 #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v))
783 #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size))
784 #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v))
785 #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
786 #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
787 #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
788 #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
789 #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
790 #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
791 #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
792 #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
793 #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks))
794 #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v))
795 #define sd_v1_first_direct_byte(sdp) \
796 (le32_to_cpu((sdp)->sd_first_direct_byte))
797 #define set_sd_v1_first_direct_byte(sdp,v) \
798 ((sdp)->sd_first_direct_byte = cpu_to_le32(v))
800 #include <linux/ext2_fs.h>
802 /* inode flags stored in sd_attrs (nee sd_reserved) */
804 /* we want common flags to have the same values as in ext2,
805 so chattr(1) will work without problems */
806 #define REISERFS_IMMUTABLE_FL EXT2_IMMUTABLE_FL
807 #define REISERFS_APPEND_FL EXT2_APPEND_FL
808 #define REISERFS_SYNC_FL EXT2_SYNC_FL
809 #define REISERFS_NOATIME_FL EXT2_NOATIME_FL
810 #define REISERFS_NODUMP_FL EXT2_NODUMP_FL
811 #define REISERFS_SECRM_FL EXT2_SECRM_FL
812 #define REISERFS_UNRM_FL EXT2_UNRM_FL
813 #define REISERFS_COMPR_FL EXT2_COMPR_FL
814 #define REISERFS_NOTAIL_FL EXT2_NOTAIL_FL
816 /* persistent flags that file inherits from the parent directory */
817 #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \
819 REISERFS_NOATIME_FL | \
820 REISERFS_NODUMP_FL | \
821 REISERFS_SECRM_FL | \
822 REISERFS_COMPR_FL | \
827 #pragma pack(push, 1)
830 /* Stat Data on disk (reiserfs version of UFS disk inode minus the
833 __u16 sd_mode
; /* file type, permissions */
834 __u16 sd_attrs
; /* persistent inode flags */
835 __u32 sd_nlink
; /* number of hard links */
836 __u64 sd_size
; /* file size */
837 __u32 sd_uid
; /* owner */
838 __u32 sd_gid
; /* group */
839 __u32 sd_atime
; /* time of last access */
840 __u32 sd_mtime
; /* time file was last modified */
841 __u32 sd_ctime
; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */
846 //__u32 sd_first_direct_byte;
847 /* first byte of file which is stored in a
848 direct item: except that if it equals 1
849 it is a symlink and if it equals
850 ~(__u32)0 there is no direct item. The
851 existence of this field really grates
852 on me. Let's replace it with a macro
853 based on sd_size and our tail
854 suppression policy? */
863 // this is 44 bytes long
865 #define SD_SIZE (sizeof(struct stat_data))
866 #define SD_V2_SIZE SD_SIZE
867 #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6)
868 #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
869 #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
871 /* set_sd_reserved */
872 #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink))
873 #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v))
874 #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size))
875 #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v))
876 #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid))
877 #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v))
878 #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid))
879 #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v))
880 #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
881 #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
882 #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
883 #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
884 #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
885 #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
886 #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks))
887 #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v))
888 #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
889 #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
890 #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation))
891 #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v))
892 #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs))
893 #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v))
896 /***************************************************************************/
897 /* DIRECTORY STRUCTURE */
898 /***************************************************************************/
900 Picture represents the structure of directory items
901 ________________________________________________
902 | Array of | | | | | |
903 | directory |N-1| N-2 | .... | 1st |0th|
904 | entry headers | | | | | |
905 |_______________|___|_____|________|_______|___|
906 <---- directory entries ------>
908 First directory item has k_offset component 1. We store "." and ".."
909 in one item, always, we never split "." and ".." into differing
910 items. This makes, among other things, the code for removing
911 directories simpler. */
913 #define SD_UNIQUENESS 0
915 #define DOT_DOT_OFFSET 2
916 #define DIRENTRY_UNIQUENESS 500
919 #define FIRST_ITEM_OFFSET 1
922 Q: How to get key of object pointed to by entry from entry?
924 A: Each directory entry has its header. This header has deh_dir_id and deh_objectid fields, those are key
925 of object, entry points to */
928 Directory will someday contain stat data of object */
933 #pragma pack(push, 1)
936 struct reiserfs_de_head
938 __u32 deh_offset
; /* third component of the directory entry key */
939 __u32 deh_dir_id
; /* objectid of the parent directory of the object, that is referenced
940 by directory entry */
941 __u32 deh_objectid
; /* objectid of the object, that is referenced by directory entry */
942 __u16 deh_location
; /* offset of name in the whole item */
943 __u16 deh_state
; /* whether 1) entry contains stat data (for future), and 2) whether
944 entry is hidden (unlinked) */
951 #define DEH_SIZE sizeof(struct reiserfs_de_head)
952 #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset))
953 #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id))
954 #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid))
955 #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location))
956 #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state))
958 #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v)))
959 #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v)))
960 #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v)))
961 #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v)))
962 #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v)))
964 /* empty directory contains two entries "." and ".." and their headers */
965 #define EMPTY_DIR_SIZE \
966 (DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen ("..")))
968 /* old format directories have this size when empty */
969 #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3)
971 #define DEH_Statdata 0 /* not used now */
972 #define DEH_Visible 2
974 /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */
975 #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__)
976 # define ADDR_UNALIGNED_BITS (3)
979 /* These are only used to manipulate deh_state.
980 * Because of this, we'll use the ext2_ bit routines,
981 * since they are little endian */
982 #ifdef ADDR_UNALIGNED_BITS
984 # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1)))
985 # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3)
987 # define set_bit_unaligned(nr, addr) ext2_set_bit((nr) + unaligned_offset(addr), aligned_address(addr))
988 # define clear_bit_unaligned(nr, addr) ext2_clear_bit((nr) + unaligned_offset(addr), aligned_address(addr))
989 # define test_bit_unaligned(nr, addr) ext2_test_bit((nr) + unaligned_offset(addr), aligned_address(addr))
993 # define set_bit_unaligned(nr, addr) ext2_set_bit(nr, addr)
994 # define clear_bit_unaligned(nr, addr) ext2_clear_bit(nr, addr)
995 # define test_bit_unaligned(nr, addr) ext2_test_bit(nr, addr)
999 #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1000 #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1001 #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1002 #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1004 #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1005 #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1006 #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1008 extern void make_empty_dir_item_v1 (char * body
, __u32 dirid
, __u32 objid
,
1009 __u32 par_dirid
, __u32 par_objid
);
1010 extern void make_empty_dir_item (char * body
, __u32 dirid
, __u32 objid
,
1011 __u32 par_dirid
, __u32 par_objid
);
1013 /* array of the entry headers */
1015 #define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) )
1016 #define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih)))
1018 /* length of the directory entry in directory item. This define
1019 calculates length of i-th directory entry using directory entry
1020 locations from dir entry head. When it calculates length of 0-th
1021 directory entry, it uses length of whole item in place of entry
1022 location of the non-existent following entry in the calculation.
1023 See picture above.*/
1025 #define I_DEH_N_ENTRY_LENGTH(ih,deh,i) \
1026 ((i) ? (deh_location((deh)-1) - deh_location((deh))) : (ih_item_len((ih)) - deh_location((deh))))
1028 static inline int entry_length (const struct buffer_head
* bh
,
1029 const struct item_head
* ih
, int pos_in_item
)
1031 struct reiserfs_de_head
* deh
;
1033 deh
= B_I_DEH (bh
, ih
) + pos_in_item
;
1035 return deh_location(deh
-1) - deh_location(deh
);
1037 return ih_item_len(ih
) - deh_location(deh
);
1042 /* number of entries in the directory item, depends on ENTRY_COUNT being at the start of directory dynamic data. */
1043 #define I_ENTRY_COUNT(ih) (ih_entry_count((ih)))
1046 /* name by bh, ih and entry_num */
1047 #define B_I_E_NAME(bh,ih,entry_num) ((char *)(bh->b_data + ih_location(ih) + deh_location(B_I_DEH(bh,ih)+(entry_num))))
1049 // two entries per block (at least)
1050 #define REISERFS_MAX_NAME(block_size) 255
1053 /* this structure is used for operations on directory entries. It is
1054 not a disk structure. */
1055 /* When reiserfs_find_entry or search_by_entry_key find directory
1056 entry, they return filled reiserfs_dir_entry structure */
1057 struct reiserfs_dir_entry
1059 struct buffer_head
* de_bh
;
1061 struct item_head
* de_ih
;
1063 struct reiserfs_de_head
* de_deh
;
1067 char * de_gen_number_bit_string
;
1072 struct cpu_key de_entry_key
;
1075 /* these defines are useful when a particular member of a reiserfs_dir_entry is needed */
1077 /* pointer to file name, stored in entry */
1078 #define B_I_DEH_ENTRY_FILE_NAME(bh,ih,deh) (B_I_PITEM (bh, ih) + deh_location(deh))
1080 /* length of name */
1081 #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \
1082 (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0))
1086 /* hash value occupies bits from 7 up to 30 */
1087 #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL)
1088 /* generation number occupies 7 bits starting from 0 up to 6 */
1089 #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL)
1090 #define MAX_GENERATION_NUMBER 127
1092 #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number))
1096 * Picture represents an internal node of the reiserfs tree
1097 * ______________________________________________________
1098 * | | Array of | Array of | Free |
1099 * |block | keys | pointers | space |
1100 * | head | N | N+1 | |
1101 * |______|_______________|___________________|___________|
1104 /***************************************************************************/
1106 /***************************************************************************/
1107 /* Disk child pointer: The pointer from an internal node of the tree
1108 to a node that is on disk. */
1110 __u32 dc_block_number
; /* Disk child's block number. */
1111 __u16 dc_size
; /* Disk child's used space. */
1115 #define DC_SIZE (sizeof(struct disk_child))
1116 #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number))
1117 #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size))
1118 #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0)
1119 #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0)
1121 /* Get disk child by buffer header and position in the tree node. */
1122 #define B_N_CHILD(p_s_bh,n_pos) ((struct disk_child *)\
1123 ((p_s_bh)->b_data+BLKH_SIZE+B_NR_ITEMS(p_s_bh)*KEY_SIZE+DC_SIZE*(n_pos)))
1125 /* Get disk child number by buffer header and position in the tree node. */
1126 #define B_N_CHILD_NUM(p_s_bh,n_pos) (dc_block_number(B_N_CHILD(p_s_bh,n_pos)))
1127 #define PUT_B_N_CHILD_NUM(p_s_bh,n_pos, val) (put_dc_block_number(B_N_CHILD(p_s_bh,n_pos), val ))
1129 /* maximal value of field child_size in structure disk_child */
1130 /* child size is the combined size of all items and their headers */
1131 #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
1133 /* amount of used space in buffer (not including block head) */
1134 #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
1136 /* max and min number of keys in internal node */
1137 #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
1138 #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2)
1140 /***************************************************************************/
1141 /* PATH STRUCTURES AND DEFINES */
1142 /***************************************************************************/
1145 /* Search_by_key fills up the path from the root to the leaf as it descends the tree looking for the
1146 key. It uses reiserfs_bread to try to find buffers in the cache given their block number. If it
1147 does not find them in the cache it reads them from disk. For each node search_by_key finds using
1148 reiserfs_bread it then uses bin_search to look through that node. bin_search will find the
1149 position of the block_number of the next node if it is looking through an internal node. If it
1150 is looking through a leaf node bin_search will find the position of the item which has key either
1151 equal to given key, or which is the maximal key less than the given key. */
1153 struct path_element
{
1154 struct buffer_head
* pe_buffer
; /* Pointer to the buffer at the path in the tree. */
1155 int pe_position
; /* Position in the tree node which is placed in the */
1159 #define MAX_HEIGHT 5 /* maximal height of a tree. don't change this without changing JOURNAL_PER_BALANCE_CNT */
1160 #define EXTENDED_MAX_HEIGHT 7 /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */
1161 #define FIRST_PATH_ELEMENT_OFFSET 2 /* Must be equal to at least 2. */
1163 #define ILLEGAL_PATH_ELEMENT_OFFSET 1 /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */
1164 #define MAX_FEB_SIZE 6 /* this MUST be MAX_HEIGHT + 1. See about FEB below */
1168 /* We need to keep track of who the ancestors of nodes are. When we
1169 perform a search we record which nodes were visited while
1170 descending the tree looking for the node we searched for. This list
1171 of nodes is called the path. This information is used while
1172 performing balancing. Note that this path information may become
1173 invalid, and this means we must check it when using it to see if it
1174 is still valid. You'll need to read search_by_key and the comments
1175 in it, especially about decrement_counters_in_path(), to understand
1178 Paths make the code so much harder to work with and debug.... An
1179 enormous number of bugs are due to them, and trying to write or modify
1180 code that uses them just makes my head hurt. They are based on an
1181 excessive effort to avoid disturbing the precious VFS code.:-( The
1182 gods only know how we are going to SMP the code that uses them.
1183 znodes are the way! */
1185 #define PATH_READA 0x1 /* do read ahead */
1186 #define PATH_READA_BACK 0x2 /* read backwards */
1189 int path_length
; /* Length of the array above. */
1191 struct path_element path_elements
[EXTENDED_MAX_HEIGHT
]; /* Array of the path elements. */
1195 #define pos_in_item(path) ((path)->pos_in_item)
1197 #define INITIALIZE_PATH(var) \
1198 struct path var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
1200 /* Get path element by path and path position. */
1201 #define PATH_OFFSET_PELEMENT(p_s_path,n_offset) ((p_s_path)->path_elements +(n_offset))
1203 /* Get buffer header at the path by path and path position. */
1204 #define PATH_OFFSET_PBUFFER(p_s_path,n_offset) (PATH_OFFSET_PELEMENT(p_s_path,n_offset)->pe_buffer)
1206 /* Get position in the element at the path by path and path position. */
1207 #define PATH_OFFSET_POSITION(p_s_path,n_offset) (PATH_OFFSET_PELEMENT(p_s_path,n_offset)->pe_position)
1210 #define PATH_PLAST_BUFFER(p_s_path) (PATH_OFFSET_PBUFFER((p_s_path), (p_s_path)->path_length))
1211 /* you know, to the person who didn't
1212 write this the macro name does not
1213 at first suggest what it does.
1214 Maybe POSITION_FROM_PATH_END? Or
1215 maybe we should just focus on
1216 dumping paths... -Hans */
1217 #define PATH_LAST_POSITION(p_s_path) (PATH_OFFSET_POSITION((p_s_path), (p_s_path)->path_length))
1220 #define PATH_PITEM_HEAD(p_s_path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(p_s_path),PATH_LAST_POSITION(p_s_path))
1222 /* in do_balance leaf has h == 0 in contrast with path structure,
1223 where root has level == 0. That is why we need these defines */
1224 #define PATH_H_PBUFFER(p_s_path, h) PATH_OFFSET_PBUFFER (p_s_path, p_s_path->path_length - (h)) /* tb->S[h] */
1225 #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1) /* tb->F[h] or tb->S[0]->b_parent */
1226 #define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h))
1227 #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1) /* tb->S[h]->b_item_order */
1229 #define PATH_H_PATH_OFFSET(p_s_path, n_h) ((p_s_path)->path_length - (n_h))
1231 #define get_last_bh(path) PATH_PLAST_BUFFER(path)
1232 #define get_ih(path) PATH_PITEM_HEAD(path)
1233 #define get_item_pos(path) PATH_LAST_POSITION(path)
1234 #define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path)))
1235 #define item_moved(ih,path) comp_items(ih, path)
1236 #define path_changed(ih,path) comp_items (ih, path)
1239 /***************************************************************************/
1241 /***************************************************************************/
1243 /* Size of pointer to the unformatted node. */
1244 #define UNFM_P_SIZE (sizeof(unp_t))
1245 #define UNFM_P_SHIFT 2
1247 // in in-core inode key is stored on le form
1248 #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key))
1250 #define MAX_UL_INT 0xffffffff
1251 #define MAX_INT 0x7ffffff
1252 #define MAX_US_INT 0xffff
1254 // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset
1255 #define U32_MAX (~(__u32)0)
1257 static inline loff_t
max_reiserfs_offset (struct inode
* inode
)
1259 if (get_inode_item_key_version(inode
) == KEY_FORMAT_3_5
)
1260 return (loff_t
)U32_MAX
;
1262 return (loff_t
)((~(__u64
)0) >> 4);
1266 /*#define MAX_KEY_UNIQUENESS MAX_UL_INT*/
1267 #define MAX_KEY_OBJECTID MAX_UL_INT
1270 #define MAX_B_NUM MAX_UL_INT
1271 #define MAX_FC_NUM MAX_US_INT
1274 /* the purpose is to detect overflow of an unsigned short */
1275 #define REISERFS_LINK_MAX (MAX_US_INT - 1000)
1278 /* The following defines are used in reiserfs_insert_item and reiserfs_append_item */
1279 #define REISERFS_KERNEL_MEM 0 /* reiserfs kernel memory mode */
1280 #define REISERFS_USER_MEM 1 /* reiserfs user memory mode */
1282 #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter)
1283 #define get_generation(s) atomic_read (&fs_generation(s))
1284 #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen)
1285 #define __fs_changed(gen,s) (gen != get_generation (s))
1286 #define fs_changed(gen,s) ({cond_resched(); __fs_changed(gen, s);})
1289 /***************************************************************************/
1291 /***************************************************************************/
1293 #define VI_TYPE_LEFT_MERGEABLE 1
1294 #define VI_TYPE_RIGHT_MERGEABLE 2
1296 /* To make any changes in the tree we always first find node, that
1297 contains item to be changed/deleted or place to insert a new
1298 item. We call this node S. To do balancing we need to decide what
1299 we will shift to left/right neighbor, or to a new node, where new
1300 item will be etc. To make this analysis simpler we build virtual
1301 node. Virtual node is an array of items, that will replace items of
1302 node S. (For instance if we are going to delete an item, virtual
1303 node does not contain it). Virtual node keeps information about
1304 item sizes and types, mergeability of first and last items, sizes
1305 of all entries in directory item. We use this array of items when
1306 calculating what we can shift to neighbors and how many nodes we
1307 have to have if we do not any shiftings, if we shift to left/right
1308 neighbor or to both. */
1311 int vi_index
; // index in the array of item operations
1312 unsigned short vi_type
; // left/right mergeability
1313 unsigned short vi_item_len
; /* length of item that it will have after balancing */
1314 struct item_head
* vi_ih
;
1315 const char * vi_item
; // body of item (old or new)
1316 const void * vi_new_data
; // 0 always but paste mode
1317 void * vi_uarea
; // item specific area
1323 char * vn_free_ptr
; /* this is a pointer to the free space in the buffer */
1324 unsigned short vn_nr_item
; /* number of items in virtual node */
1325 short vn_size
; /* size of node , that node would have if it has unlimited size and no balancing is performed */
1326 short vn_mode
; /* mode of balancing (paste, insert, delete, cut) */
1327 short vn_affected_item_num
;
1328 short vn_pos_in_item
;
1329 struct item_head
* vn_ins_ih
; /* item header of inserted item, 0 for other modes */
1330 const void * vn_data
;
1331 struct virtual_item
* vn_vi
; /* array of items (including a new one, excluding item to be deleted) */
1336 #pragma pack(push, 1)
1339 /* used by directory items when creating virtual nodes */
1340 struct direntry_uarea
{
1343 __u16 entry_sizes
[1];
1350 /***************************************************************************/
1352 /***************************************************************************/
1354 /* This temporary structure is used in tree balance algorithms, and
1355 constructed as we go to the extent that its various parts are
1356 needed. It contains arrays of nodes that can potentially be
1357 involved in the balancing of node S, and parameters that define how
1358 each of the nodes must be balanced. Note that in these algorithms
1359 for balancing the worst case is to need to balance the current node
1360 S and the left and right neighbors and all of their parents plus
1361 create a new node. We implement S1 balancing for the leaf nodes
1362 and S0 balancing for the internal nodes (S1 and S0 are defined in
1365 #define MAX_FREE_BLOCK 7 /* size of the array of buffers to free at end of do_balance */
1367 /* maximum number of FEB blocknrs on a single level */
1368 #define MAX_AMOUNT_NEEDED 2
1370 /* someday somebody will prefix every field in this struct with tb_ */
1374 int need_balance_dirty
;
1375 struct super_block
* tb_sb
;
1376 struct reiserfs_transaction_handle
*transaction_handle
;
1377 struct path
* tb_path
;
1378 struct buffer_head
* L
[MAX_HEIGHT
]; /* array of left neighbors of nodes in the path */
1379 struct buffer_head
* R
[MAX_HEIGHT
]; /* array of right neighbors of nodes in the path*/
1380 struct buffer_head
* FL
[MAX_HEIGHT
]; /* array of fathers of the left neighbors */
1381 struct buffer_head
* FR
[MAX_HEIGHT
]; /* array of fathers of the right neighbors */
1382 struct buffer_head
* CFL
[MAX_HEIGHT
]; /* array of common parents of center node and its left neighbor */
1383 struct buffer_head
* CFR
[MAX_HEIGHT
]; /* array of common parents of center node and its right neighbor */
1385 struct buffer_head
* FEB
[MAX_FEB_SIZE
]; /* array of empty buffers. Number of buffers in array equals
1387 struct buffer_head
* used
[MAX_FEB_SIZE
];
1388 struct buffer_head
* thrown
[MAX_FEB_SIZE
];
1389 int lnum
[MAX_HEIGHT
]; /* array of number of items which must be
1390 shifted to the left in order to balance the
1391 current node; for leaves includes item that
1392 will be partially shifted; for internal
1393 nodes, it is the number of child pointers
1394 rather than items. It includes the new item
1395 being created. The code sometimes subtracts
1396 one to get the number of wholly shifted
1397 items for other purposes. */
1398 int rnum
[MAX_HEIGHT
]; /* substitute right for left in comment above */
1399 int lkey
[MAX_HEIGHT
]; /* array indexed by height h mapping the key delimiting L[h] and
1400 S[h] to its item number within the node CFL[h] */
1401 int rkey
[MAX_HEIGHT
]; /* substitute r for l in comment above */
1402 int insert_size
[MAX_HEIGHT
]; /* the number of bytes by we are trying to add or remove from
1403 S[h]. A negative value means removing. */
1404 int blknum
[MAX_HEIGHT
]; /* number of nodes that will replace node S[h] after
1405 balancing on the level h of the tree. If 0 then S is
1406 being deleted, if 1 then S is remaining and no new nodes
1407 are being created, if 2 or 3 then 1 or 2 new nodes is
1410 /* fields that are used only for balancing leaves of the tree */
1411 int cur_blknum
; /* number of empty blocks having been already allocated */
1412 int s0num
; /* number of items that fall into left most node when S[0] splits */
1413 int s1num
; /* number of items that fall into first new node when S[0] splits */
1414 int s2num
; /* number of items that fall into second new node when S[0] splits */
1415 int lbytes
; /* number of bytes which can flow to the left neighbor from the left */
1416 /* most liquid item that cannot be shifted from S[0] entirely */
1417 /* if -1 then nothing will be partially shifted */
1418 int rbytes
; /* number of bytes which will flow to the right neighbor from the right */
1419 /* most liquid item that cannot be shifted from S[0] entirely */
1420 /* if -1 then nothing will be partially shifted */
1421 int s1bytes
; /* number of bytes which flow to the first new node when S[0] splits */
1422 /* note: if S[0] splits into 3 nodes, then items do not need to be cut */
1424 struct buffer_head
* buf_to_free
[MAX_FREE_BLOCK
]; /* buffers which are to be freed after do_balance finishes by unfix_nodes */
1425 char * vn_buf
; /* kmalloced memory. Used to create
1426 virtual node and keep map of
1427 dirtied bitmap blocks */
1428 int vn_buf_size
; /* size of the vn_buf */
1429 struct virtual_node
* tb_vn
; /* VN starts after bitmap of bitmap blocks */
1431 int fs_gen
; /* saved value of `reiserfs_generation' counter
1432 see FILESYSTEM_CHANGED() macro in reiserfs_fs.h */
1433 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1434 struct reiserfs_key key
; /* key pointer, to pass to block allocator or
1435 another low-level subsystem */
1439 /* These are modes of balancing */
1441 /* When inserting an item. */
1442 #define M_INSERT 'i'
1443 /* When inserting into (directories only) or appending onto an already
1446 /* When deleting an item. */
1447 #define M_DELETE 'd'
1448 /* When truncating an item or removing an entry from a (directory) item. */
1451 /* used when balancing on leaf level skipped (in reiserfsck) */
1452 #define M_INTERNAL 'n'
1454 /* When further balancing is not needed, then do_balance does not need
1456 #define M_SKIP_BALANCING 's'
1457 #define M_CONVERT 'v'
1459 /* modes of leaf_move_items */
1460 #define LEAF_FROM_S_TO_L 0
1461 #define LEAF_FROM_S_TO_R 1
1462 #define LEAF_FROM_R_TO_L 2
1463 #define LEAF_FROM_L_TO_R 3
1464 #define LEAF_FROM_S_TO_SNEW 4
1466 #define FIRST_TO_LAST 0
1467 #define LAST_TO_FIRST 1
1469 /* used in do_balance for passing parent of node information that has
1470 been gotten from tb struct */
1471 struct buffer_info
{
1472 struct tree_balance
* tb
;
1473 struct buffer_head
* bi_bh
;
1474 struct buffer_head
* bi_parent
;
1479 /* there are 4 types of items: stat data, directory item, indirect, direct.
1480 +-------------------+------------+--------------+------------+
1481 | | k_offset | k_uniqueness | mergeable? |
1482 +-------------------+------------+--------------+------------+
1483 | stat data | 0 | 0 | no |
1484 +-------------------+------------+--------------+------------+
1485 | 1st directory item| DOT_OFFSET |DIRENTRY_UNIQUENESS| no |
1486 | non 1st directory | hash value | | yes |
1488 +-------------------+------------+--------------+------------+
1489 | indirect item | offset + 1 |TYPE_INDIRECT | if this is not the first indirect item of the object
1490 +-------------------+------------+--------------+------------+
1491 | direct item | offset + 1 |TYPE_DIRECT | if not this is not the first direct item of the object
1492 +-------------------+------------+--------------+------------+
1495 struct item_operations
{
1496 int (*bytes_number
) (struct item_head
* ih
, int block_size
);
1497 void (*decrement_key
) (struct cpu_key
*);
1498 int (*is_left_mergeable
) (struct reiserfs_key
* ih
, unsigned long bsize
);
1499 void (*print_item
) (struct item_head
*, char * item
);
1500 void (*check_item
) (struct item_head
*, char * item
);
1502 int (*create_vi
) (struct virtual_node
* vn
, struct virtual_item
* vi
,
1503 int is_affected
, int insert_size
);
1504 int (*check_left
) (struct virtual_item
* vi
, int free
,
1505 int start_skip
, int end_skip
);
1506 int (*check_right
) (struct virtual_item
* vi
, int free
);
1507 int (*part_size
) (struct virtual_item
* vi
, int from
, int to
);
1508 int (*unit_num
) (struct virtual_item
* vi
);
1509 void (*print_vi
) (struct virtual_item
* vi
);
1513 extern struct item_operations
* item_ops
[TYPE_ANY
+ 1];
1515 #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize)
1516 #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize)
1517 #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item)
1518 #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item)
1519 #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)
1520 #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip)
1521 #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free)
1522 #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to)
1523 #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi)
1524 #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi)
1528 #define COMP_SHORT_KEYS comp_short_keys
1530 /* number of blocks pointed to by the indirect item */
1531 #define I_UNFM_NUM(p_s_ih) ( ih_item_len(p_s_ih) / UNFM_P_SIZE )
1533 /* the used space within the unformatted node corresponding to pos within the item pointed to by ih */
1534 #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size))
1536 /* number of bytes contained by the direct item or the unformatted nodes the indirect item points to */
1539 /* get the item header */
1540 #define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1543 #define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1546 #define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) )
1549 #define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num))))
1551 /* get the stat data by the buffer header and the item order */
1552 #define B_N_STAT_DATA(bh,nr) \
1553 ( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) )
1555 /* following defines use reiserfs buffer header and item header */
1558 #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) )
1560 // this is 3976 for size==4096
1561 #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
1563 /* indirect items consist of entries which contain blocknrs, pos
1564 indicates which entry, and B_I_POS_UNFM_POINTER resolves to the
1565 blocknr contained by the entry pos points to */
1566 #define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)))
1567 #define PUT_B_I_POS_UNFM_POINTER(bh,ih,pos, val) do {*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)) = cpu_to_le32(val); } while (0)
1569 struct reiserfs_iget_args
{
1574 /***************************************************************************/
1575 /* FUNCTION DECLARATIONS */
1576 /***************************************************************************/
1578 /*#ifdef __KERNEL__*/
1579 #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12)
1581 #define journal_trans_half(blocksize) \
1582 ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32))
1584 /* journal.c see journal.c for all the comments here */
1586 /* first block written in a commit. */
1587 struct reiserfs_journal_desc
{
1588 __u32 j_trans_id
; /* id of commit */
1589 __u32 j_len
; /* length of commit. len +1 is the commit block */
1590 __u32 j_mount_id
; /* mount id of this trans*/
1591 __u32 j_realblock
[1] ; /* real locations for each block */
1594 #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id)
1595 #define get_desc_trans_len(d) le32_to_cpu((d)->j_len)
1596 #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id)
1598 #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0)
1599 #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0)
1600 #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0)
1602 /* last block written in a commit */
1603 struct reiserfs_journal_commit
{
1604 __u32 j_trans_id
; /* must match j_trans_id from the desc block */
1605 __u32 j_len
; /* ditto */
1606 __u32 j_realblock
[1] ; /* real locations for each block */
1609 #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id)
1610 #define get_commit_trans_len(c) le32_to_cpu((c)->j_len)
1611 #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id)
1613 #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0)
1614 #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0)
1616 /* this header block gets written whenever a transaction is considered fully flushed, and is more recent than the
1617 ** last fully flushed transaction. fully flushed means all the log blocks and all the real blocks are on disk,
1618 ** and this transaction does not need to be replayed.
1620 struct reiserfs_journal_header
{
1621 __u32 j_last_flush_trans_id
; /* id of last fully flushed transaction */
1622 __u32 j_first_unflushed_offset
; /* offset in the log of where to start replay after a crash */
1624 /* 12 */ struct journal_params jh_journal
;
1627 /* biggest tunable defines are right here */
1628 #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */
1629 #define JOURNAL_TRANS_MAX_DEFAULT 1024 /* biggest possible single transaction, don't change for now (8/3/99) */
1630 #define JOURNAL_TRANS_MIN_DEFAULT 256
1631 #define JOURNAL_MAX_BATCH_DEFAULT 900 /* max blocks to batch into one transaction, don't make this any bigger than 900 */
1632 #define JOURNAL_MIN_RATIO 2
1633 #define JOURNAL_MAX_COMMIT_AGE 30
1634 #define JOURNAL_MAX_TRANS_AGE 30
1635 #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)
1637 #define REISERFS_QUOTA_TRANS_BLOCKS 2 /* We need to update data and inode (atime) */
1638 #define REISERFS_QUOTA_INIT_BLOCKS (DQUOT_MAX_WRITES*(JOURNAL_PER_BALANCE_CNT+2)+1) /* 1 balancing, 1 bitmap, 1 data per write + stat data update */
1640 #define REISERFS_QUOTA_TRANS_BLOCKS 0
1641 #define REISERFS_QUOTA_INIT_BLOCKS 0
1644 /* both of these can be as low as 1, or as high as you want. The min is the
1645 ** number of 4k bitmap nodes preallocated on mount. New nodes are allocated
1646 ** as needed, and released when transactions are committed. On release, if
1647 ** the current number of nodes is > max, the node is freed, otherwise,
1648 ** it is put on a free list for faster use later.
1650 #define REISERFS_MIN_BITMAP_NODES 10
1651 #define REISERFS_MAX_BITMAP_NODES 100
1653 #define JBH_HASH_SHIFT 13 /* these are based on journal hash size of 8192 */
1654 #define JBH_HASH_MASK 8191
1656 #define _jhashfn(sb,block) \
1657 (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \
1658 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
1659 #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
1661 // We need these to make journal.c code more readable
1662 #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1663 #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1664 #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1666 enum reiserfs_bh_state_bits
{
1667 BH_JDirty
= BH_PrivateStart
, /* buffer is in current transaction */
1669 BH_JNew
, /* disk block was taken off free list before
1670 * being in a finished transaction, or
1671 * written to disk. Can be reused immed. */
1674 BH_JTest
, // debugging only will go away
1677 BUFFER_FNS(JDirty
, journaled
);
1678 TAS_BUFFER_FNS(JDirty
, journaled
);
1679 BUFFER_FNS(JDirty_wait
, journal_dirty
);
1680 TAS_BUFFER_FNS(JDirty_wait
, journal_dirty
);
1681 BUFFER_FNS(JNew
, journal_new
);
1682 TAS_BUFFER_FNS(JNew
, journal_new
);
1683 BUFFER_FNS(JPrepared
, journal_prepared
);
1684 TAS_BUFFER_FNS(JPrepared
, journal_prepared
);
1685 BUFFER_FNS(JRestore_dirty
, journal_restore_dirty
);
1686 TAS_BUFFER_FNS(JRestore_dirty
, journal_restore_dirty
);
1687 BUFFER_FNS(JTest
, journal_test
);
1688 TAS_BUFFER_FNS(JTest
, journal_test
);
1691 ** transaction handle which is passed around for all journal calls
1693 struct reiserfs_transaction_handle
{
1694 struct super_block
*t_super
; /* super for this FS when journal_begin was
1695 called. saves calls to reiserfs_get_super
1696 also used by nested transactions to make
1697 sure they are nesting on the right FS
1698 _must_ be first in the handle
1701 int t_blocks_logged
; /* number of blocks this writer has logged */
1702 int t_blocks_allocated
; /* number of blocks this writer allocated */
1703 unsigned long t_trans_id
; /* sanity check, equals the current trans id */
1704 void *t_handle_save
; /* save existing current->journal_info */
1705 unsigned displace_new_blocks
:1; /* if new block allocation occurres, that block
1706 should be displaced from others */
1707 struct list_head t_list
;
1710 /* used to keep track of ordered and tail writes, attached to the buffer
1711 * head through b_journal_head.
1713 struct reiserfs_jh
{
1714 struct reiserfs_journal_list
*jl
;
1715 struct buffer_head
*bh
;
1716 struct list_head list
;
1719 void reiserfs_free_jh(struct buffer_head
*bh
);
1720 int reiserfs_add_tail_list(struct inode
*inode
, struct buffer_head
*bh
);
1721 int reiserfs_add_ordered_list(struct inode
*inode
, struct buffer_head
*bh
);
1722 int journal_mark_dirty(struct reiserfs_transaction_handle
*, struct super_block
*, struct buffer_head
*bh
) ;
1725 reiserfs_file_data_log(struct inode
*inode
) {
1726 if (reiserfs_data_log(inode
->i_sb
) ||
1727 (REISERFS_I(inode
)->i_flags
& i_data_log
))
1732 static inline int reiserfs_transaction_running(struct super_block
*s
) {
1733 struct reiserfs_transaction_handle
*th
= current
->journal_info
;
1734 if (th
&& th
->t_super
== s
)
1736 if (th
&& th
->t_super
== NULL
)
1741 int reiserfs_async_progress_wait(struct super_block
*s
);
1743 struct reiserfs_transaction_handle
*
1744 reiserfs_persistent_transaction(struct super_block
*, int count
);
1745 int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle
*);
1746 int reiserfs_commit_page(struct inode
*inode
, struct page
*page
,
1747 unsigned from
, unsigned to
);
1748 int reiserfs_flush_old_commits(struct super_block
*);
1749 int reiserfs_commit_for_inode(struct inode
*) ;
1750 int reiserfs_inode_needs_commit(struct inode
*) ;
1751 void reiserfs_update_inode_transaction(struct inode
*) ;
1752 void reiserfs_wait_on_write_block(struct super_block
*s
) ;
1753 void reiserfs_block_writes(struct reiserfs_transaction_handle
*th
) ;
1754 void reiserfs_allow_writes(struct super_block
*s
) ;
1755 void reiserfs_check_lock_depth(struct super_block
*s
, char *caller
) ;
1756 int reiserfs_prepare_for_journal(struct super_block
*, struct buffer_head
*bh
, int wait
) ;
1757 void reiserfs_restore_prepared_buffer(struct super_block
*, struct buffer_head
*bh
) ;
1758 int journal_init(struct super_block
*, const char * j_dev_name
, int old_format
, unsigned int) ;
1759 int journal_release(struct reiserfs_transaction_handle
*, struct super_block
*) ;
1760 int journal_release_error(struct reiserfs_transaction_handle
*, struct super_block
*) ;
1761 int journal_end(struct reiserfs_transaction_handle
*, struct super_block
*, unsigned long) ;
1762 int journal_end_sync(struct reiserfs_transaction_handle
*, struct super_block
*, unsigned long) ;
1763 int journal_mark_freed(struct reiserfs_transaction_handle
*, struct super_block
*, b_blocknr_t blocknr
) ;
1764 int journal_transaction_should_end(struct reiserfs_transaction_handle
*, int) ;
1765 int reiserfs_in_journal(struct super_block
*p_s_sb
, int bmap_nr
, int bit_nr
, int searchall
, b_blocknr_t
*next
) ;
1766 int journal_begin(struct reiserfs_transaction_handle
*, struct super_block
*p_s_sb
, unsigned long) ;
1767 int journal_join_abort(struct reiserfs_transaction_handle
*, struct super_block
*p_s_sb
, unsigned long) ;
1768 void reiserfs_journal_abort (struct super_block
*sb
, int errno
);
1769 void reiserfs_abort (struct super_block
*sb
, int errno
, const char *fmt
, ...);
1770 int reiserfs_allocate_list_bitmaps(struct super_block
*s
, struct reiserfs_list_bitmap
*, int) ;
1772 void add_save_link (struct reiserfs_transaction_handle
* th
,
1773 struct inode
* inode
, int truncate
);
1774 int remove_save_link (struct inode
* inode
, int truncate
);
1777 __u32
reiserfs_get_unused_objectid (struct reiserfs_transaction_handle
*th
);
1778 void reiserfs_release_objectid (struct reiserfs_transaction_handle
*th
, __u32 objectid_to_release
);
1779 int reiserfs_convert_objectid_map_v1(struct super_block
*) ;
1782 int B_IS_IN_TREE(const struct buffer_head
*);
1783 extern void copy_item_head(struct item_head
* p_v_to
,
1784 const struct item_head
* p_v_from
);
1786 // first key is in cpu form, second - le
1787 extern int comp_short_keys (const struct reiserfs_key
* le_key
,
1788 const struct cpu_key
* cpu_key
);
1789 extern void le_key2cpu_key (struct cpu_key
* to
, const struct reiserfs_key
* from
);
1791 // both are in le form
1792 extern int comp_le_keys (const struct reiserfs_key
*, const struct reiserfs_key
*);
1793 extern int comp_short_le_keys (const struct reiserfs_key
*, const struct reiserfs_key
*);
1796 // get key version from on disk key - kludge
1798 static inline int le_key_version (const struct reiserfs_key
* key
)
1802 type
= offset_v2_k_type( &(key
->u
.k_offset_v2
));
1803 if (type
!= TYPE_DIRECT
&& type
!= TYPE_INDIRECT
&& type
!= TYPE_DIRENTRY
)
1804 return KEY_FORMAT_3_5
;
1806 return KEY_FORMAT_3_6
;
1811 static inline void copy_key (struct reiserfs_key
*to
, const struct reiserfs_key
*from
)
1813 memcpy (to
, from
, KEY_SIZE
);
1817 int comp_items (const struct item_head
* stored_ih
, const struct path
* p_s_path
);
1818 const struct reiserfs_key
* get_rkey (const struct path
* p_s_chk_path
,
1819 const struct super_block
* p_s_sb
);
1820 int search_by_key (struct super_block
*, const struct cpu_key
*,
1821 struct path
*, int);
1822 #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)
1823 int search_for_position_by_key (struct super_block
* p_s_sb
,
1824 const struct cpu_key
* p_s_cpu_key
,
1825 struct path
* p_s_search_path
);
1826 extern void decrement_bcount (struct buffer_head
* p_s_bh
);
1827 void decrement_counters_in_path (struct path
* p_s_search_path
);
1828 void pathrelse (struct path
* p_s_search_path
);
1829 int reiserfs_check_path(struct path
*p
) ;
1830 void pathrelse_and_restore (struct super_block
*s
, struct path
* p_s_search_path
);
1832 int reiserfs_insert_item (struct reiserfs_transaction_handle
*th
,
1834 const struct cpu_key
* key
,
1835 struct item_head
* ih
,
1836 struct inode
*inode
, const char * body
);
1838 int reiserfs_paste_into_item (struct reiserfs_transaction_handle
*th
,
1840 const struct cpu_key
* key
,
1841 struct inode
*inode
,
1842 const char * body
, int paste_size
);
1844 int reiserfs_cut_from_item (struct reiserfs_transaction_handle
*th
,
1846 struct cpu_key
* key
,
1847 struct inode
* inode
,
1849 loff_t new_file_size
);
1851 int reiserfs_delete_item (struct reiserfs_transaction_handle
*th
,
1853 const struct cpu_key
* key
,
1854 struct inode
* inode
,
1855 struct buffer_head
* p_s_un_bh
);
1857 void reiserfs_delete_solid_item (struct reiserfs_transaction_handle
*th
,
1858 struct inode
*inode
, struct reiserfs_key
* key
);
1859 int reiserfs_delete_object (struct reiserfs_transaction_handle
*th
, struct inode
* p_s_inode
);
1860 int reiserfs_do_truncate (struct reiserfs_transaction_handle
*th
,
1861 struct inode
* p_s_inode
, struct page
*,
1862 int update_timestamps
);
1864 #define i_block_size(inode) ((inode)->i_sb->s_blocksize)
1865 #define file_size(inode) ((inode)->i_size)
1866 #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1))
1868 #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\
1869 !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 )
1871 void padd_item (char * item
, int total_length
, int length
);
1874 /* args for the create parameter of reiserfs_get_block */
1875 #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */
1876 #define GET_BLOCK_CREATE 1 /* add anything you need to find block */
1877 #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */
1878 #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */
1879 #define GET_BLOCK_NO_ISEM 8 /* i_sem is not held, don't preallocate */
1880 #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */
1882 int restart_transaction(struct reiserfs_transaction_handle
*th
, struct inode
*inode
, struct path
*path
);
1883 void reiserfs_read_locked_inode(struct inode
* inode
, struct reiserfs_iget_args
*args
) ;
1884 int reiserfs_find_actor(struct inode
* inode
, void *p
) ;
1885 int reiserfs_init_locked_inode(struct inode
* inode
, void *p
) ;
1886 void reiserfs_delete_inode (struct inode
* inode
);
1887 int reiserfs_write_inode (struct inode
* inode
, int) ;
1888 int reiserfs_get_block (struct inode
* inode
, sector_t block
, struct buffer_head
* bh_result
, int create
);
1889 struct dentry
*reiserfs_get_dentry(struct super_block
*, void *) ;
1890 struct dentry
*reiserfs_decode_fh(struct super_block
*sb
, __u32
*data
,
1891 int len
, int fhtype
,
1892 int (*acceptable
)(void *contect
, struct dentry
*de
),
1894 int reiserfs_encode_fh( struct dentry
*dentry
, __u32
*data
, int *lenp
,
1897 int reiserfs_truncate_file(struct inode
*, int update_timestamps
) ;
1898 void make_cpu_key (struct cpu_key
* cpu_key
, struct inode
* inode
, loff_t offset
,
1899 int type
, int key_length
);
1900 void make_le_item_head (struct item_head
* ih
, const struct cpu_key
* key
,
1902 loff_t offset
, int type
, int length
, int entry_count
);
1903 struct inode
* reiserfs_iget (struct super_block
* s
,
1904 const struct cpu_key
* key
);
1907 int reiserfs_new_inode (struct reiserfs_transaction_handle
*th
,
1908 struct inode
* dir
, int mode
,
1909 const char * symname
, loff_t i_size
,
1910 struct dentry
*dentry
, struct inode
*inode
);
1912 void reiserfs_update_sd_size (struct reiserfs_transaction_handle
*th
,
1913 struct inode
* inode
, loff_t size
);
1915 static inline void reiserfs_update_sd(struct reiserfs_transaction_handle
*th
,
1916 struct inode
*inode
)
1918 reiserfs_update_sd_size(th
, inode
, inode
->i_size
) ;
1921 void sd_attrs_to_i_attrs( __u16 sd_attrs
, struct inode
*inode
);
1922 void i_attrs_to_sd_attrs( struct inode
*inode
, __u16
*sd_attrs
);
1923 int reiserfs_setattr(struct dentry
*dentry
, struct iattr
*attr
);
1926 void set_de_name_and_namelen (struct reiserfs_dir_entry
* de
);
1927 int search_by_entry_key (struct super_block
* sb
, const struct cpu_key
* key
,
1929 struct reiserfs_dir_entry
* de
);
1930 struct dentry
*reiserfs_get_parent(struct dentry
*) ;
1933 #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )
1934 #define REISERFS_PROC_INFO
1936 #undef REISERFS_PROC_INFO
1939 int reiserfs_proc_info_init( struct super_block
*sb
);
1940 int reiserfs_proc_info_done( struct super_block
*sb
);
1941 struct proc_dir_entry
*reiserfs_proc_register_global( char *name
,
1942 read_proc_t
*func
);
1943 void reiserfs_proc_unregister_global( const char *name
);
1944 int reiserfs_proc_info_global_init( void );
1945 int reiserfs_proc_info_global_done( void );
1946 int reiserfs_global_version_in_proc( char *buffer
, char **start
, off_t offset
,
1947 int count
, int *eof
, void *data
);
1949 #if defined( REISERFS_PROC_INFO )
1951 #define PROC_EXP( e ) e
1953 #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data
1954 #define PROC_INFO_MAX( sb, field, value ) \
1955 __PINFO( sb ).field = \
1956 max( REISERFS_SB( sb ) -> s_proc_info_data.field, value )
1957 #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) )
1958 #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) )
1959 #define PROC_INFO_BH_STAT( sb, bh, level ) \
1960 PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \
1961 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
1962 PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
1964 #define PROC_EXP( e )
1965 #define VOID_V ( ( void ) 0 )
1966 #define PROC_INFO_MAX( sb, field, value ) VOID_V
1967 #define PROC_INFO_INC( sb, field ) VOID_V
1968 #define PROC_INFO_ADD( sb, field, val ) VOID_V
1969 #define PROC_INFO_BH_STAT( p_s_sb, p_s_bh, n_node_level ) VOID_V
1973 extern struct inode_operations reiserfs_dir_inode_operations
;
1974 extern struct inode_operations reiserfs_symlink_inode_operations
;
1975 extern struct inode_operations reiserfs_special_inode_operations
;
1976 extern struct file_operations reiserfs_dir_operations
;
1978 /* tail_conversion.c */
1979 int direct2indirect (struct reiserfs_transaction_handle
*, struct inode
*, struct path
*, struct buffer_head
*, loff_t
);
1980 int indirect2direct (struct reiserfs_transaction_handle
*, struct inode
*, struct page
*, struct path
*, const struct cpu_key
*, loff_t
, char *);
1981 void reiserfs_unmap_buffer(struct buffer_head
*) ;
1985 extern struct inode_operations reiserfs_file_inode_operations
;
1986 extern struct file_operations reiserfs_file_operations
;
1987 extern struct address_space_operations reiserfs_address_space_operations
;
1990 #ifdef CONFIG_REISERFS_CHECK
1991 void * reiserfs_kmalloc (size_t size
, int flags
, struct super_block
* s
);
1992 void reiserfs_kfree (const void * vp
, size_t size
, struct super_block
* s
);
1994 static inline void *reiserfs_kmalloc(size_t size
, int flags
,
1995 struct super_block
*s
)
1997 return kmalloc(size
, flags
);
2000 static inline void reiserfs_kfree(const void *vp
, size_t size
,
2001 struct super_block
*s
)
2007 int fix_nodes (int n_op_mode
, struct tree_balance
* p_s_tb
,
2008 struct item_head
* p_s_ins_ih
, const void *);
2009 void unfix_nodes (struct tree_balance
*);
2013 void reiserfs_panic (struct super_block
* s
, const char * fmt
, ...) __attribute__ ( ( noreturn
) );
2014 void reiserfs_info (struct super_block
*s
, const char * fmt
, ...);
2015 void reiserfs_debug (struct super_block
*s
, int level
, const char * fmt
, ...);
2016 void print_indirect_item (struct buffer_head
* bh
, int item_num
);
2017 void store_print_tb (struct tree_balance
* tb
);
2018 void print_cur_tb (char * mes
);
2019 void print_de (struct reiserfs_dir_entry
* de
);
2020 void print_bi (struct buffer_info
* bi
, char * mes
);
2021 #define PRINT_LEAF_ITEMS 1 /* print all items */
2022 #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */
2023 #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */
2024 void print_block (struct buffer_head
* bh
, ...);
2025 void print_bmap (struct super_block
* s
, int silent
);
2026 void print_bmap_block (int i
, char * data
, int size
, int silent
);
2027 /*void print_super_block (struct super_block * s, char * mes);*/
2028 void print_objectid_map (struct super_block
* s
);
2029 void print_block_head (struct buffer_head
* bh
, char * mes
);
2030 void check_leaf (struct buffer_head
* bh
);
2031 void check_internal (struct buffer_head
* bh
);
2032 void print_statistics (struct super_block
* s
);
2033 char * reiserfs_hashname(int code
);
2036 int leaf_move_items (int shift_mode
, struct tree_balance
* tb
, int mov_num
, int mov_bytes
, struct buffer_head
* Snew
);
2037 int leaf_shift_left (struct tree_balance
* tb
, int shift_num
, int shift_bytes
);
2038 int leaf_shift_right (struct tree_balance
* tb
, int shift_num
, int shift_bytes
);
2039 void leaf_delete_items (struct buffer_info
* cur_bi
, int last_first
, int first
, int del_num
, int del_bytes
);
2040 void leaf_insert_into_buf (struct buffer_info
* bi
, int before
,
2041 struct item_head
* inserted_item_ih
, const char * inserted_item_body
, int zeros_number
);
2042 void leaf_paste_in_buffer (struct buffer_info
* bi
, int pasted_item_num
,
2043 int pos_in_item
, int paste_size
, const char * body
, int zeros_number
);
2044 void leaf_cut_from_buffer (struct buffer_info
* bi
, int cut_item_num
, int pos_in_item
,
2046 void leaf_paste_entries (struct buffer_head
* bh
, int item_num
, int before
,
2047 int new_entry_count
, struct reiserfs_de_head
* new_dehs
, const char * records
, int paste_size
);
2049 int balance_internal (struct tree_balance
* , int, int, struct item_head
* ,
2050 struct buffer_head
**);
2053 void do_balance_mark_leaf_dirty (struct tree_balance
* tb
,
2054 struct buffer_head
* bh
, int flag
);
2055 #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty
2056 #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty
2058 void do_balance (struct tree_balance
* tb
, struct item_head
* ih
,
2059 const char * body
, int flag
);
2060 void reiserfs_invalidate_buffer (struct tree_balance
* tb
, struct buffer_head
* bh
);
2062 int get_left_neighbor_position (struct tree_balance
* tb
, int h
);
2063 int get_right_neighbor_position (struct tree_balance
* tb
, int h
);
2064 void replace_key (struct tree_balance
* tb
, struct buffer_head
*, int, struct buffer_head
*, int);
2065 void make_empty_node (struct buffer_info
*);
2066 struct buffer_head
* get_FEB (struct tree_balance
*);
2070 /* structure contains hints for block allocator, and it is a container for
2071 * arguments, such as node, search path, transaction_handle, etc. */
2072 struct __reiserfs_blocknr_hint
{
2073 struct inode
* inode
; /* inode passed to allocator, if we allocate unf. nodes */
2074 long block
; /* file offset, in blocks */
2075 struct reiserfs_key key
;
2076 struct path
* path
; /* search path, used by allocator to deternine search_start by
2078 struct reiserfs_transaction_handle
* th
; /* transaction handle is needed to log super blocks and
2079 * bitmap blocks changes */
2080 b_blocknr_t beg
, end
;
2081 b_blocknr_t search_start
; /* a field used to transfer search start value (block number)
2082 * between different block allocator procedures
2083 * (determine_search_start() and others) */
2084 int prealloc_size
; /* is set in determine_prealloc_size() function, used by underlayed
2085 * function that do actual allocation */
2087 unsigned formatted_node
:1; /* the allocator uses different polices for getting disk space for
2088 * formatted/unformatted blocks with/without preallocation */
2089 unsigned preallocate
:1;
2092 typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t
;
2094 int reiserfs_parse_alloc_options (struct super_block
*, char *);
2095 void reiserfs_init_alloc_options (struct super_block
*s
);
2098 * given a directory, this will tell you what packing locality
2099 * to use for a new object underneat it. The locality is returned
2100 * in disk byte order (le).
2102 u32
reiserfs_choose_packing(struct inode
*dir
);
2104 int is_reusable (struct super_block
* s
, b_blocknr_t block
, int bit_value
);
2105 void reiserfs_free_block (struct reiserfs_transaction_handle
*th
, struct inode
*, b_blocknr_t
, int for_unformatted
);
2106 int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t
*, b_blocknr_t
* , int, int);
2107 extern inline int reiserfs_new_form_blocknrs (struct tree_balance
* tb
,
2108 b_blocknr_t
*new_blocknrs
, int amount_needed
)
2110 reiserfs_blocknr_hint_t hint
= {
2111 .th
= tb
->transaction_handle
,
2112 .path
= tb
->tb_path
,
2118 return reiserfs_allocate_blocknrs(&hint
, new_blocknrs
, amount_needed
, 0);
2121 extern inline int reiserfs_new_unf_blocknrs (struct reiserfs_transaction_handle
*th
,
2122 struct inode
*inode
,
2123 b_blocknr_t
*new_blocknrs
,
2124 struct path
* path
, long block
)
2126 reiserfs_blocknr_hint_t hint
= {
2131 .formatted_node
= 0,
2134 return reiserfs_allocate_blocknrs(&hint
, new_blocknrs
, 1, 0);
2137 #ifdef REISERFS_PREALLOCATE
2138 extern inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle
*th
,
2139 struct inode
* inode
,
2140 b_blocknr_t
*new_blocknrs
,
2141 struct path
* path
, long block
)
2143 reiserfs_blocknr_hint_t hint
= {
2148 .formatted_node
= 0,
2151 return reiserfs_allocate_blocknrs(&hint
, new_blocknrs
, 1, 0);
2154 void reiserfs_discard_prealloc (struct reiserfs_transaction_handle
*th
,
2155 struct inode
* inode
);
2156 void reiserfs_discard_all_prealloc (struct reiserfs_transaction_handle
*th
);
2158 void reiserfs_claim_blocks_to_be_allocated( struct super_block
*sb
, int blocks
);
2159 void reiserfs_release_claimed_blocks( struct super_block
*sb
, int blocks
);
2160 int reiserfs_can_fit_pages(struct super_block
*sb
);
2163 __u32
keyed_hash (const signed char *msg
, int len
);
2164 __u32
yura_hash (const signed char *msg
, int len
);
2165 __u32
r5_hash (const signed char *msg
, int len
);
2167 /* the ext2 bit routines adjust for big or little endian as
2168 ** appropriate for the arch, so in our laziness we use them rather
2169 ** than using the bit routines they call more directly. These
2170 ** routines must be used when changing on disk bitmaps. */
2171 #define reiserfs_test_and_set_le_bit ext2_set_bit
2172 #define reiserfs_test_and_clear_le_bit ext2_clear_bit
2173 #define reiserfs_test_le_bit ext2_test_bit
2174 #define reiserfs_find_next_zero_le_bit ext2_find_next_zero_bit
2176 /* sometimes reiserfs_truncate may require to allocate few new blocks
2177 to perform indirect2direct conversion. People probably used to
2178 think, that truncate should work without problems on a filesystem
2179 without free disk space. They may complain that they can not
2180 truncate due to lack of free disk space. This spare space allows us
2181 to not worry about it. 500 is probably too much, but it should be
2183 #define SPARE_SPACE 500
2186 /* prototypes from ioctl.c */
2187 int reiserfs_ioctl (struct inode
* inode
, struct file
* filp
,
2188 unsigned int cmd
, unsigned long arg
);
2190 /* ioctl's command */
2191 #define REISERFS_IOC_UNPACK _IOW(0xCD,1,long)
2192 /* define following flags to be the same as in ext2, so that chattr(1),
2193 lsattr(1) will work with us. */
2194 #define REISERFS_IOC_GETFLAGS EXT2_IOC_GETFLAGS
2195 #define REISERFS_IOC_SETFLAGS EXT2_IOC_SETFLAGS
2196 #define REISERFS_IOC_GETVERSION EXT2_IOC_GETVERSION
2197 #define REISERFS_IOC_SETVERSION EXT2_IOC_SETVERSION
2199 /* Locking primitives */
2200 /* Right now we are still falling back to (un)lock_kernel, but eventually that
2201 would evolve into real per-fs locks */
2202 #define reiserfs_write_lock( sb ) lock_kernel()
2203 #define reiserfs_write_unlock( sb ) unlock_kernel()
2206 #define REISERFS_XATTR_DIR_SEM(s) (REISERFS_SB(s)->xattr_dir_sem)
2208 #endif /* _LINUX_REISER_FS_H */