2 * Copyright 1996, 1997, 1998 Hans Reiser, see reiserfs/README for licensing and copyright details
5 /* this file has an amazingly stupid
6 name, yura please fix it to be
7 reiserfs.h, and merge all the rest
8 of our .h files that are in this
11 #ifndef _LINUX_REISER_FS_H
12 #define _LINUX_REISER_FS_H
14 #include <linux/types.h>
15 #include <linux/magic.h>
18 #include <linux/slab.h>
19 #include <linux/interrupt.h>
20 #include <linux/sched.h>
21 #include <linux/workqueue.h>
22 #include <asm/unaligned.h>
23 #include <linux/bitops.h>
24 #include <linux/proc_fs.h>
25 #include <linux/smp_lock.h>
26 #include <linux/buffer_head.h>
27 #include <linux/reiserfs_fs_i.h>
28 #include <linux/reiserfs_fs_sb.h>
32 * include/linux/reiser_fs.h
34 * Reiser File System constants and structures
39 #define REISERFS_IOC_UNPACK _IOW(0xCD,1,long)
40 /* define following flags to be the same as in ext2, so that chattr(1),
41 lsattr(1) will work with us. */
42 #define REISERFS_IOC_GETFLAGS FS_IOC_GETFLAGS
43 #define REISERFS_IOC_SETFLAGS FS_IOC_SETFLAGS
44 #define REISERFS_IOC_GETVERSION FS_IOC_GETVERSION
45 #define REISERFS_IOC_SETVERSION FS_IOC_SETVERSION
48 /* the 32 bit compat definitions with int argument */
49 #define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int)
50 #define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
51 #define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
52 #define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION
53 #define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION
56 * Locking primitives. The write lock is a per superblock
57 * special mutex that has properties close to the Big Kernel Lock
58 * which was used in the previous locking scheme.
60 void reiserfs_write_lock(struct super_block *s);
61 void reiserfs_write_unlock(struct super_block *s);
65 /* in reading the #defines, it may help to understand that they employ
66 the following abbreviations:
70 H = Height within the tree (should be changed to LEV)
71 N = Number of the item in the node
73 DEH = Directory Entry Header
78 UNFM = UNForMatted node
82 These #defines are named by concatenating these abbreviations,
83 where first comes the arguments, and last comes the return value,
88 #define USE_INODE_GENERATION_COUNTER
90 #define REISERFS_PREALLOCATE
91 #define DISPLACE_NEW_PACKING_LOCALITIES
92 #define PREALLOCATION_SIZE 9
94 /* n must be power of 2 */
95 #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u))
97 // to be ok for alpha and others we have to align structures to 8 byte
99 // FIXME: do not change 4 by anything else: there is code which relies on that
100 #define ROUND_UP(x) _ROUND_UP(x,8LL)
102 /* debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug
105 #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */
107 void __reiserfs_warning(struct super_block *s, const char *id,
108 const char *func, const char *fmt, ...);
109 #define reiserfs_warning(s, id, fmt, args...) \
110 __reiserfs_warning(s, id, __func__, fmt, ##args)
111 /* assertions handling */
113 /** always check a condition and panic if it's false. */
114 #define __RASSERT(cond, scond, format, args...) \
117 reiserfs_panic(NULL, "assertion failure", "(" #cond ") at " \
118 __FILE__ ":%i:%s: " format "\n", \
119 in_interrupt() ? -1 : task_pid_nr(current), \
120 __LINE__, __func__ , ##args); \
123 #define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args)
125 #if defined( CONFIG_REISERFS_CHECK )
126 #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args)
128 #define RFALSE( cond, format, args... ) do {;} while( 0 )
131 #define CONSTF __attribute_const__
133 * Disk Data Structures
136 /***************************************************************************/
138 /***************************************************************************/
141 * Structure of super block on disk, a version of which in RAM is often accessed as REISERFS_SB(s)->s_rs
142 * the version in RAM is part of a larger structure containing fields never written to disk.
144 #define UNSET_HASH 0 // read_super will guess about, what hash names
145 // in directories were sorted with
149 #define DEFAULT_HASH R5_HASH
151 struct journal_params {
152 __le32 jp_journal_1st_block; /* where does journal start from on its
154 __le32 jp_journal_dev; /* journal device st_rdev */
155 __le32 jp_journal_size; /* size of the journal */
156 __le32 jp_journal_trans_max; /* max number of blocks in a transaction. */
157 __le32 jp_journal_magic; /* random value made on fs creation (this
158 * was sb_journal_block_count) */
159 __le32 jp_journal_max_batch; /* max number of blocks to batch into a
161 __le32 jp_journal_max_commit_age; /* in seconds, how old can an async
163 __le32 jp_journal_max_trans_age; /* in seconds, how old can a transaction
167 /* this is the super from 3.5.X, where X >= 10 */
168 struct reiserfs_super_block_v1 {
169 __le32 s_block_count; /* blocks count */
170 __le32 s_free_blocks; /* free blocks count */
171 __le32 s_root_block; /* root block number */
172 struct journal_params s_journal;
173 __le16 s_blocksize; /* block size */
174 __le16 s_oid_maxsize; /* max size of object id array, see
175 * get_objectid() commentary */
176 __le16 s_oid_cursize; /* current size of object id array */
177 __le16 s_umount_state; /* this is set to 1 when filesystem was
178 * umounted, to 2 - when not */
179 char s_magic[10]; /* reiserfs magic string indicates that
180 * file system is reiserfs:
181 * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs" */
182 __le16 s_fs_state; /* it is set to used by fsck to mark which
183 * phase of rebuilding is done */
184 __le32 s_hash_function_code; /* indicate, what hash function is being use
185 * to sort names in a directory*/
186 __le16 s_tree_height; /* height of disk tree */
187 __le16 s_bmap_nr; /* amount of bitmap blocks needed to address
188 * each block of file system */
189 __le16 s_version; /* this field is only reliable on filesystem
190 * with non-standard journal */
191 __le16 s_reserved_for_journal; /* size in blocks of journal area on main
192 * device, we need to keep after
193 * making fs with non-standard journal */
194 } __attribute__ ((__packed__));
196 #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1))
198 /* this is the on disk super block */
199 struct reiserfs_super_block {
200 struct reiserfs_super_block_v1 s_v1;
201 __le32 s_inode_generation;
202 __le32 s_flags; /* Right now used only by inode-attributes, if enabled */
203 unsigned char s_uuid[16]; /* filesystem unique identifier */
204 unsigned char s_label[16]; /* filesystem volume label */
205 __le16 s_mnt_count; /* Count of mounts since last fsck */
206 __le16 s_max_mnt_count; /* Maximum mounts before check */
207 __le32 s_lastcheck; /* Timestamp of last fsck */
208 __le32 s_check_interval; /* Interval between checks */
209 char s_unused[76]; /* zero filled by mkreiserfs and
210 * reiserfs_convert_objectid_map_v1()
211 * so any additions must be updated
213 } __attribute__ ((__packed__));
215 #define SB_SIZE (sizeof(struct reiserfs_super_block))
217 #define REISERFS_VERSION_1 0
218 #define REISERFS_VERSION_2 2
220 // on-disk super block fields converted to cpu form
221 #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs)
222 #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1))
223 #define SB_BLOCKSIZE(s) \
224 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize))
225 #define SB_BLOCK_COUNT(s) \
226 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count))
227 #define SB_FREE_BLOCKS(s) \
228 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks))
229 #define SB_REISERFS_MAGIC(s) \
230 (SB_V1_DISK_SUPER_BLOCK(s)->s_magic)
231 #define SB_ROOT_BLOCK(s) \
232 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block))
233 #define SB_TREE_HEIGHT(s) \
234 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height))
235 #define SB_REISERFS_STATE(s) \
236 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state))
237 #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version))
238 #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr))
240 #define PUT_SB_BLOCK_COUNT(s, val) \
241 do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0)
242 #define PUT_SB_FREE_BLOCKS(s, val) \
243 do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0)
244 #define PUT_SB_ROOT_BLOCK(s, val) \
245 do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0)
246 #define PUT_SB_TREE_HEIGHT(s, val) \
247 do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0)
248 #define PUT_SB_REISERFS_STATE(s, val) \
249 do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0)
250 #define PUT_SB_VERSION(s, val) \
251 do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0)
252 #define PUT_SB_BMAP_NR(s, val) \
253 do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0)
255 #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal)
256 #define SB_ONDISK_JOURNAL_SIZE(s) \
257 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size))
258 #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \
259 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block))
260 #define SB_ONDISK_JOURNAL_DEVICE(s) \
261 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev))
262 #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \
263 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal))
265 #define is_block_in_log_or_reserved_area(s, block) \
266 block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
267 && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
268 ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \
269 SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s)))
271 int is_reiserfs_3_5(struct reiserfs_super_block *rs);
272 int is_reiserfs_3_6(struct reiserfs_super_block *rs);
273 int is_reiserfs_jr(struct reiserfs_super_block *rs);
275 /* ReiserFS leaves the first 64k unused, so that partition labels have
276 enough space. If someone wants to write a fancy bootloader that
277 needs more than 64k, let us know, and this will be increased in size.
278 This number must be larger than than the largest block size on any
279 platform, or code will break. -Hans */
280 #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024)
281 #define REISERFS_FIRST_BLOCK unused_define
282 #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES
284 /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */
285 #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024)
287 // reiserfs internal error code (used by search_by_key adn fix_nodes))
289 #define REPEAT_SEARCH -1
291 #define NO_DISK_SPACE -3
292 #define NO_BALANCING_NEEDED (-4)
293 #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5)
294 #define QUOTA_EXCEEDED -6
296 typedef __u32 b_blocknr_t;
297 typedef __le32 unp_t;
299 struct unfm_nodeinfo {
301 unsigned short unfm_freespace;
304 /* there are two formats of keys: 3.5 and 3.6
306 #define KEY_FORMAT_3_5 0
307 #define KEY_FORMAT_3_6 1
309 /* there are two stat datas */
310 #define STAT_DATA_V1 0
311 #define STAT_DATA_V2 1
313 static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode)
315 return container_of(inode, struct reiserfs_inode_info, vfs_inode);
318 static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb)
320 return sb->s_fs_info;
323 /* Don't trust REISERFS_SB(sb)->s_bmap_nr, it's a u16
324 * which overflows on large file systems. */
325 static inline __u32 reiserfs_bmap_count(struct super_block *sb)
327 return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1;
330 static inline int bmap_would_wrap(unsigned bmap_nr)
332 return bmap_nr > ((1LL << 16) - 1);
335 /** this says about version of key of all items (but stat data) the
336 object consists of */
337 #define get_inode_item_key_version( inode ) \
338 ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5)
340 #define set_inode_item_key_version( inode, version ) \
341 ({ if((version)==KEY_FORMAT_3_6) \
342 REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \
344 REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; })
346 #define get_inode_sd_version(inode) \
347 ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1)
349 #define set_inode_sd_version(inode, version) \
350 ({ if((version)==STAT_DATA_V2) \
351 REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \
353 REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; })
355 /* This is an aggressive tail suppression policy, I am hoping it
356 improves our benchmarks. The principle behind it is that percentage
357 space saving is what matters, not absolute space saving. This is
358 non-intuitive, but it helps to understand it if you consider that the
359 cost to access 4 blocks is not much more than the cost to access 1
360 block, if you have to do a seek and rotate. A tail risks a
361 non-linear disk access that is significant as a percentage of total
362 time cost for a 4 block file and saves an amount of space that is
363 less significant as a percentage of space, or so goes the hypothesis.
365 #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \
367 (!(n_tail_size)) || \
368 (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \
369 ( (n_file_size) >= (n_block_size) * 4 ) || \
370 ( ( (n_file_size) >= (n_block_size) * 3 ) && \
371 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \
372 ( ( (n_file_size) >= (n_block_size) * 2 ) && \
373 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \
374 ( ( (n_file_size) >= (n_block_size) ) && \
375 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \
378 /* Another strategy for tails, this one means only create a tail if all the
379 file would fit into one DIRECT item.
380 Primary intention for this one is to increase performance by decreasing
383 #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \
385 (!(n_tail_size)) || \
386 (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \
390 * values for s_umount_state field
392 #define REISERFS_VALID_FS 1
393 #define REISERFS_ERROR_FS 2
396 // there are 5 item types currently
398 #define TYPE_STAT_DATA 0
399 #define TYPE_INDIRECT 1
400 #define TYPE_DIRECT 2
401 #define TYPE_DIRENTRY 3
402 #define TYPE_MAXTYPE 3
403 #define TYPE_ANY 15 // FIXME: comment is required
405 /***************************************************************************/
406 /* KEY & ITEM HEAD */
407 /***************************************************************************/
410 // directories use this key as well as old files
415 } __attribute__ ((__packed__));
419 } __attribute__ ((__packed__));
421 static inline __u16 offset_v2_k_type(const struct offset_v2 *v2)
423 __u8 type = le64_to_cpu(v2->v) >> 60;
424 return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY;
427 static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type)
430 (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60);
433 static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2)
435 return le64_to_cpu(v2->v) & (~0ULL >> 4);
438 static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset)
440 offset &= (~0ULL >> 4);
441 v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset);
444 /* Key of an item determines its location in the S+tree, and
445 is composed of 4 components */
446 struct reiserfs_key {
447 __le32 k_dir_id; /* packing locality: by default parent
448 directory object id */
449 __le32 k_objectid; /* object identifier */
451 struct offset_v1 k_offset_v1;
452 struct offset_v2 k_offset_v2;
453 } __attribute__ ((__packed__)) u;
454 } __attribute__ ((__packed__));
457 __u32 k_dir_id; /* packing locality: by default parent
458 directory object id */
459 __u32 k_objectid; /* object identifier */
465 struct in_core_key on_disk_key;
467 int key_length; /* 3 in all cases but direct2indirect and
468 indirect2direct conversion */
471 /* Our function for comparing keys can compare keys of different
472 lengths. It takes as a parameter the length of the keys it is to
473 compare. These defines are used in determining what is to be passed
474 to it as that parameter. */
475 #define REISERFS_FULL_KEY_LEN 4
476 #define REISERFS_SHORT_KEY_LEN 2
478 /* The result of the key compare */
479 #define FIRST_GREATER 1
480 #define SECOND_GREATER -1
481 #define KEYS_IDENTICAL 0
483 #define KEY_NOT_FOUND 0
485 #define KEY_SIZE (sizeof(struct reiserfs_key))
486 #define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32))
488 /* return values for search_by_key and clones */
490 #define ITEM_NOT_FOUND 0
491 #define ENTRY_FOUND 1
492 #define ENTRY_NOT_FOUND 0
493 #define DIRECTORY_NOT_FOUND -1
494 #define REGULAR_FILE_FOUND -2
495 #define DIRECTORY_FOUND -3
497 #define BYTE_NOT_FOUND 0
498 #define FILE_NOT_FOUND -1
500 #define POSITION_FOUND 1
501 #define POSITION_NOT_FOUND 0
503 // return values for reiserfs_find_entry and search_by_entry_key
505 #define NAME_NOT_FOUND 0
506 #define GOTO_PREVIOUS_ITEM 2
507 #define NAME_FOUND_INVISIBLE 3
509 /* Everything in the filesystem is stored as a set of items. The
510 item head contains the key of the item, its free space (for
511 indirect items) and specifies the location of the item itself
515 /* Everything in the tree is found by searching for it based on
517 struct reiserfs_key ih_key;
519 /* The free space in the last unformatted node of an
520 indirect item if this is an indirect item. This
521 equals 0xFFFF iff this is a direct item or stat data
522 item. Note that the key, not this field, is used to
523 determine the item type, and thus which field this
525 __le16 ih_free_space_reserved;
526 /* Iff this is a directory item, this field equals the
527 number of directory entries in the directory item. */
528 __le16 ih_entry_count;
529 } __attribute__ ((__packed__)) u;
530 __le16 ih_item_len; /* total size of the item body */
531 __le16 ih_item_location; /* an offset to the item body
532 * within the block */
533 __le16 ih_version; /* 0 for all old items, 2 for new
534 ones. Highest bit is set by fsck
535 temporary, cleaned after all
537 } __attribute__ ((__packed__));
538 /* size of item header */
539 #define IH_SIZE (sizeof(struct item_head))
541 #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved)
542 #define ih_version(ih) le16_to_cpu((ih)->ih_version)
543 #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count)
544 #define ih_location(ih) le16_to_cpu((ih)->ih_item_location)
545 #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len)
547 #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0)
548 #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0)
549 #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0)
550 #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0)
551 #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0)
553 #define unreachable_item(ih) (ih_version(ih) & (1 << 15))
555 #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih))
556 #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val)))
558 /* these operate on indirect items, where you've got an array of ints
559 ** at a possibly unaligned location. These are a noop on ia32
561 ** p is the array of __u32, i is the index into the array, v is the value
564 #define get_block_num(p, i) get_unaligned_le32((p) + (i))
565 #define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i))
568 // in old version uniqueness field shows key type
570 #define V1_SD_UNIQUENESS 0
571 #define V1_INDIRECT_UNIQUENESS 0xfffffffe
572 #define V1_DIRECT_UNIQUENESS 0xffffffff
573 #define V1_DIRENTRY_UNIQUENESS 500
574 #define V1_ANY_UNIQUENESS 555 // FIXME: comment is required
577 // here are conversion routines
579 static inline int uniqueness2type(__u32 uniqueness) CONSTF;
580 static inline int uniqueness2type(__u32 uniqueness)
582 switch ((int)uniqueness) {
583 case V1_SD_UNIQUENESS:
584 return TYPE_STAT_DATA;
585 case V1_INDIRECT_UNIQUENESS:
586 return TYPE_INDIRECT;
587 case V1_DIRECT_UNIQUENESS:
589 case V1_DIRENTRY_UNIQUENESS:
590 return TYPE_DIRENTRY;
591 case V1_ANY_UNIQUENESS:
597 static inline __u32 type2uniqueness(int type) CONSTF;
598 static inline __u32 type2uniqueness(int type)
602 return V1_SD_UNIQUENESS;
604 return V1_INDIRECT_UNIQUENESS;
606 return V1_DIRECT_UNIQUENESS;
608 return V1_DIRENTRY_UNIQUENESS;
611 return V1_ANY_UNIQUENESS;
616 // key is pointer to on disk key which is stored in le, result is cpu,
617 // there is no way to get version of object from key, so, provide
618 // version to these defines
620 static inline loff_t le_key_k_offset(int version,
621 const struct reiserfs_key *key)
623 return (version == KEY_FORMAT_3_5) ?
624 le32_to_cpu(key->u.k_offset_v1.k_offset) :
625 offset_v2_k_offset(&(key->u.k_offset_v2));
628 static inline loff_t le_ih_k_offset(const struct item_head *ih)
630 return le_key_k_offset(ih_version(ih), &(ih->ih_key));
633 static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key)
635 return (version == KEY_FORMAT_3_5) ?
636 uniqueness2type(le32_to_cpu(key->u.k_offset_v1.k_uniqueness)) :
637 offset_v2_k_type(&(key->u.k_offset_v2));
640 static inline loff_t le_ih_k_type(const struct item_head *ih)
642 return le_key_k_type(ih_version(ih), &(ih->ih_key));
645 static inline void set_le_key_k_offset(int version, struct reiserfs_key *key,
648 (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_offset = cpu_to_le32(offset)) : /* jdm check */
649 (void)(set_offset_v2_k_offset(&(key->u.k_offset_v2), offset));
652 static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset)
654 set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset);
657 static inline void set_le_key_k_type(int version, struct reiserfs_key *key,
660 (version == KEY_FORMAT_3_5) ?
661 (void)(key->u.k_offset_v1.k_uniqueness =
662 cpu_to_le32(type2uniqueness(type)))
663 : (void)(set_offset_v2_k_type(&(key->u.k_offset_v2), type));
666 static inline void set_le_ih_k_type(struct item_head *ih, int type)
668 set_le_key_k_type(ih_version(ih), &(ih->ih_key), type);
671 static inline int is_direntry_le_key(int version, struct reiserfs_key *key)
673 return le_key_k_type(version, key) == TYPE_DIRENTRY;
676 static inline int is_direct_le_key(int version, struct reiserfs_key *key)
678 return le_key_k_type(version, key) == TYPE_DIRECT;
681 static inline int is_indirect_le_key(int version, struct reiserfs_key *key)
683 return le_key_k_type(version, key) == TYPE_INDIRECT;
686 static inline int is_statdata_le_key(int version, struct reiserfs_key *key)
688 return le_key_k_type(version, key) == TYPE_STAT_DATA;
692 // item header has version.
694 static inline int is_direntry_le_ih(struct item_head *ih)
696 return is_direntry_le_key(ih_version(ih), &ih->ih_key);
699 static inline int is_direct_le_ih(struct item_head *ih)
701 return is_direct_le_key(ih_version(ih), &ih->ih_key);
704 static inline int is_indirect_le_ih(struct item_head *ih)
706 return is_indirect_le_key(ih_version(ih), &ih->ih_key);
709 static inline int is_statdata_le_ih(struct item_head *ih)
711 return is_statdata_le_key(ih_version(ih), &ih->ih_key);
715 // key is pointer to cpu key, result is cpu
717 static inline loff_t cpu_key_k_offset(const struct cpu_key *key)
719 return key->on_disk_key.k_offset;
722 static inline loff_t cpu_key_k_type(const struct cpu_key *key)
724 return key->on_disk_key.k_type;
727 static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset)
729 key->on_disk_key.k_offset = offset;
732 static inline void set_cpu_key_k_type(struct cpu_key *key, int type)
734 key->on_disk_key.k_type = type;
737 static inline void cpu_key_k_offset_dec(struct cpu_key *key)
739 key->on_disk_key.k_offset--;
742 #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY)
743 #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT)
744 #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT)
745 #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA)
747 /* are these used ? */
748 #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key)))
749 #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key)))
750 #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key)))
751 #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key)))
753 #define I_K_KEY_IN_ITEM(ih, key, n_blocksize) \
754 (!COMP_SHORT_KEYS(ih, key) && \
755 I_OFF_BYTE_IN_ITEM(ih, k_offset(key), n_blocksize))
757 /* maximal length of item */
758 #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
759 #define MIN_ITEM_LEN 1
761 /* object identifier for root dir */
762 #define REISERFS_ROOT_OBJECTID 2
763 #define REISERFS_ROOT_PARENT_OBJECTID 1
765 extern struct reiserfs_key root_key;
768 * Picture represents a leaf of the S+tree
769 * ______________________________________________________
771 * |Block | Object-Item | F r e e | Objects- |
772 * | head | Headers | S p a c e | Items |
773 * |______|_______________|___________________|___________|
776 /* Header of a disk block. More precisely, header of a formatted leaf
777 or internal node, and not the header of an unformatted node. */
779 __le16 blk_level; /* Level of a block in the tree. */
780 __le16 blk_nr_item; /* Number of keys/items in a block. */
781 __le16 blk_free_space; /* Block free space in bytes. */
783 /* dump this in v4/planA */
784 struct reiserfs_key blk_right_delim_key; /* kept only for compatibility */
787 #define BLKH_SIZE (sizeof(struct block_head))
788 #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level))
789 #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item))
790 #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space))
791 #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved))
792 #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val))
793 #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val))
794 #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val))
795 #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val))
796 #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key)
797 #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val)
800 * values for blk_level field of the struct block_head
803 #define FREE_LEVEL 0 /* when node gets removed from the tree its
804 blk_level is set to FREE_LEVEL. It is then
805 used to see whether the node is still in the
808 #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */
810 /* Given the buffer head of a formatted node, resolve to the block head of that node. */
811 #define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data))
812 /* Number of items that are in buffer. */
813 #define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh)))
814 #define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh)))
815 #define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh)))
817 #define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0)
818 #define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0)
819 #define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0)
821 /* Get right delimiting key. -- little endian */
822 #define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh))))
824 /* Does the buffer contain a disk leaf. */
825 #define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL)
827 /* Does the buffer contain a disk internal node */
828 #define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \
829 && B_LEVEL(bh) <= MAX_HEIGHT)
831 /***************************************************************************/
833 /***************************************************************************/
836 // old stat data is 32 bytes long. We are going to distinguish new one by
839 struct stat_data_v1 {
840 __le16 sd_mode; /* file type, permissions */
841 __le16 sd_nlink; /* number of hard links */
842 __le16 sd_uid; /* owner */
843 __le16 sd_gid; /* group */
844 __le32 sd_size; /* file size */
845 __le32 sd_atime; /* time of last access */
846 __le32 sd_mtime; /* time file was last modified */
847 __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */
850 __le32 sd_blocks; /* number of blocks file uses */
851 } __attribute__ ((__packed__)) u;
852 __le32 sd_first_direct_byte; /* first byte of file which is stored
853 in a direct item: except that if it
854 equals 1 it is a symlink and if it
855 equals ~(__u32)0 there is no
856 direct item. The existence of this
857 field really grates on me. Let's
858 replace it with a macro based on
859 sd_size and our tail suppression
860 policy. Someday. -Hans */
861 } __attribute__ ((__packed__));
863 #define SD_V1_SIZE (sizeof(struct stat_data_v1))
864 #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5)
865 #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
866 #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
867 #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink))
868 #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v))
869 #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid))
870 #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v))
871 #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid))
872 #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v))
873 #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size))
874 #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v))
875 #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
876 #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
877 #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
878 #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
879 #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
880 #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
881 #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
882 #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
883 #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks))
884 #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v))
885 #define sd_v1_first_direct_byte(sdp) \
886 (le32_to_cpu((sdp)->sd_first_direct_byte))
887 #define set_sd_v1_first_direct_byte(sdp,v) \
888 ((sdp)->sd_first_direct_byte = cpu_to_le32(v))
890 /* inode flags stored in sd_attrs (nee sd_reserved) */
892 /* we want common flags to have the same values as in ext2,
893 so chattr(1) will work without problems */
894 #define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL
895 #define REISERFS_APPEND_FL FS_APPEND_FL
896 #define REISERFS_SYNC_FL FS_SYNC_FL
897 #define REISERFS_NOATIME_FL FS_NOATIME_FL
898 #define REISERFS_NODUMP_FL FS_NODUMP_FL
899 #define REISERFS_SECRM_FL FS_SECRM_FL
900 #define REISERFS_UNRM_FL FS_UNRM_FL
901 #define REISERFS_COMPR_FL FS_COMPR_FL
902 #define REISERFS_NOTAIL_FL FS_NOTAIL_FL
904 /* persistent flags that file inherits from the parent directory */
905 #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \
907 REISERFS_NOATIME_FL | \
908 REISERFS_NODUMP_FL | \
909 REISERFS_SECRM_FL | \
910 REISERFS_COMPR_FL | \
913 /* Stat Data on disk (reiserfs version of UFS disk inode minus the
916 __le16 sd_mode; /* file type, permissions */
917 __le16 sd_attrs; /* persistent inode flags */
918 __le32 sd_nlink; /* number of hard links */
919 __le64 sd_size; /* file size */
920 __le32 sd_uid; /* owner */
921 __le32 sd_gid; /* group */
922 __le32 sd_atime; /* time of last access */
923 __le32 sd_mtime; /* time file was last modified */
924 __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */
928 __le32 sd_generation;
929 //__le32 sd_first_direct_byte;
930 /* first byte of file which is stored in a
931 direct item: except that if it equals 1
932 it is a symlink and if it equals
933 ~(__u32)0 there is no direct item. The
934 existence of this field really grates
935 on me. Let's replace it with a macro
936 based on sd_size and our tail
937 suppression policy? */
938 } __attribute__ ((__packed__)) u;
939 } __attribute__ ((__packed__));
941 // this is 44 bytes long
943 #define SD_SIZE (sizeof(struct stat_data))
944 #define SD_V2_SIZE SD_SIZE
945 #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6)
946 #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
947 #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
949 /* set_sd_reserved */
950 #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink))
951 #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v))
952 #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size))
953 #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v))
954 #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid))
955 #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v))
956 #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid))
957 #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v))
958 #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
959 #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
960 #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
961 #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
962 #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
963 #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
964 #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks))
965 #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v))
966 #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
967 #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
968 #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation))
969 #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v))
970 #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs))
971 #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v))
973 /***************************************************************************/
974 /* DIRECTORY STRUCTURE */
975 /***************************************************************************/
977 Picture represents the structure of directory items
978 ________________________________________________
979 | Array of | | | | | |
980 | directory |N-1| N-2 | .... | 1st |0th|
981 | entry headers | | | | | |
982 |_______________|___|_____|________|_______|___|
983 <---- directory entries ------>
985 First directory item has k_offset component 1. We store "." and ".."
986 in one item, always, we never split "." and ".." into differing
987 items. This makes, among other things, the code for removing
988 directories simpler. */
990 #define SD_UNIQUENESS 0
992 #define DOT_DOT_OFFSET 2
993 #define DIRENTRY_UNIQUENESS 500
996 #define FIRST_ITEM_OFFSET 1
999 Q: How to get key of object pointed to by entry from entry?
1001 A: Each directory entry has its header. This header has deh_dir_id and deh_objectid fields, those are key
1002 of object, entry points to */
1005 Directory will someday contain stat data of object */
1007 struct reiserfs_de_head {
1008 __le32 deh_offset; /* third component of the directory entry key */
1009 __le32 deh_dir_id; /* objectid of the parent directory of the object, that is referenced
1010 by directory entry */
1011 __le32 deh_objectid; /* objectid of the object, that is referenced by directory entry */
1012 __le16 deh_location; /* offset of name in the whole item */
1013 __le16 deh_state; /* whether 1) entry contains stat data (for future), and 2) whether
1014 entry is hidden (unlinked) */
1015 } __attribute__ ((__packed__));
1016 #define DEH_SIZE sizeof(struct reiserfs_de_head)
1017 #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset))
1018 #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id))
1019 #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid))
1020 #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location))
1021 #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state))
1023 #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v)))
1024 #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v)))
1025 #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v)))
1026 #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v)))
1027 #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v)))
1029 /* empty directory contains two entries "." and ".." and their headers */
1030 #define EMPTY_DIR_SIZE \
1031 (DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen ("..")))
1033 /* old format directories have this size when empty */
1034 #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3)
1036 #define DEH_Statdata 0 /* not used now */
1037 #define DEH_Visible 2
1039 /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */
1040 #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__)
1041 # define ADDR_UNALIGNED_BITS (3)
1044 /* These are only used to manipulate deh_state.
1045 * Because of this, we'll use the ext2_ bit routines,
1046 * since they are little endian */
1047 #ifdef ADDR_UNALIGNED_BITS
1049 # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1)))
1050 # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3)
1052 # define set_bit_unaligned(nr, addr) ext2_set_bit((nr) + unaligned_offset(addr), aligned_address(addr))
1053 # define clear_bit_unaligned(nr, addr) ext2_clear_bit((nr) + unaligned_offset(addr), aligned_address(addr))
1054 # define test_bit_unaligned(nr, addr) ext2_test_bit((nr) + unaligned_offset(addr), aligned_address(addr))
1058 # define set_bit_unaligned(nr, addr) ext2_set_bit(nr, addr)
1059 # define clear_bit_unaligned(nr, addr) ext2_clear_bit(nr, addr)
1060 # define test_bit_unaligned(nr, addr) ext2_test_bit(nr, addr)
1064 #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1065 #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1066 #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1067 #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1069 #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1070 #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1071 #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1073 extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
1074 __le32 par_dirid, __le32 par_objid);
1075 extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
1076 __le32 par_dirid, __le32 par_objid);
1078 /* array of the entry headers */
1080 #define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) )
1081 #define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih)))
1083 /* length of the directory entry in directory item. This define
1084 calculates length of i-th directory entry using directory entry
1085 locations from dir entry head. When it calculates length of 0-th
1086 directory entry, it uses length of whole item in place of entry
1087 location of the non-existent following entry in the calculation.
1088 See picture above.*/
1090 #define I_DEH_N_ENTRY_LENGTH(ih,deh,i) \
1091 ((i) ? (deh_location((deh)-1) - deh_location((deh))) : (ih_item_len((ih)) - deh_location((deh))))
1093 static inline int entry_length(const struct buffer_head *bh,
1094 const struct item_head *ih, int pos_in_item)
1096 struct reiserfs_de_head *deh;
1098 deh = B_I_DEH(bh, ih) + pos_in_item;
1100 return deh_location(deh - 1) - deh_location(deh);
1102 return ih_item_len(ih) - deh_location(deh);
1105 /* number of entries in the directory item, depends on ENTRY_COUNT being at the start of directory dynamic data. */
1106 #define I_ENTRY_COUNT(ih) (ih_entry_count((ih)))
1108 /* name by bh, ih and entry_num */
1109 #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))))
1111 // two entries per block (at least)
1112 #define REISERFS_MAX_NAME(block_size) 255
1114 /* this structure is used for operations on directory entries. It is
1115 not a disk structure. */
1116 /* When reiserfs_find_entry or search_by_entry_key find directory
1117 entry, they return filled reiserfs_dir_entry structure */
1118 struct reiserfs_dir_entry {
1119 struct buffer_head *de_bh;
1121 struct item_head *de_ih;
1123 struct reiserfs_de_head *de_deh;
1127 unsigned long *de_gen_number_bit_string;
1132 struct cpu_key de_entry_key;
1135 /* these defines are useful when a particular member of a reiserfs_dir_entry is needed */
1137 /* pointer to file name, stored in entry */
1138 #define B_I_DEH_ENTRY_FILE_NAME(bh,ih,deh) (B_I_PITEM (bh, ih) + deh_location(deh))
1140 /* length of name */
1141 #define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \
1142 (I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0))
1144 /* hash value occupies bits from 7 up to 30 */
1145 #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL)
1146 /* generation number occupies 7 bits starting from 0 up to 6 */
1147 #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL)
1148 #define MAX_GENERATION_NUMBER 127
1150 #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number))
1153 * Picture represents an internal node of the reiserfs tree
1154 * ______________________________________________________
1155 * | | Array of | Array of | Free |
1156 * |block | keys | pointers | space |
1157 * | head | N | N+1 | |
1158 * |______|_______________|___________________|___________|
1161 /***************************************************************************/
1163 /***************************************************************************/
1164 /* Disk child pointer: The pointer from an internal node of the tree
1165 to a node that is on disk. */
1167 __le32 dc_block_number; /* Disk child's block number. */
1168 __le16 dc_size; /* Disk child's used space. */
1172 #define DC_SIZE (sizeof(struct disk_child))
1173 #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number))
1174 #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size))
1175 #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0)
1176 #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0)
1178 /* Get disk child by buffer header and position in the tree node. */
1179 #define B_N_CHILD(bh, n_pos) ((struct disk_child *)\
1180 ((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
1182 /* Get disk child number by buffer header and position in the tree node. */
1183 #define B_N_CHILD_NUM(bh, n_pos) (dc_block_number(B_N_CHILD(bh, n_pos)))
1184 #define PUT_B_N_CHILD_NUM(bh, n_pos, val) \
1185 (put_dc_block_number(B_N_CHILD(bh, n_pos), val))
1187 /* maximal value of field child_size in structure disk_child */
1188 /* child size is the combined size of all items and their headers */
1189 #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
1191 /* amount of used space in buffer (not including block head) */
1192 #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
1194 /* max and min number of keys in internal node */
1195 #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
1196 #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2)
1198 /***************************************************************************/
1199 /* PATH STRUCTURES AND DEFINES */
1200 /***************************************************************************/
1202 /* Search_by_key fills up the path from the root to the leaf as it descends the tree looking for the
1203 key. It uses reiserfs_bread to try to find buffers in the cache given their block number. If it
1204 does not find them in the cache it reads them from disk. For each node search_by_key finds using
1205 reiserfs_bread it then uses bin_search to look through that node. bin_search will find the
1206 position of the block_number of the next node if it is looking through an internal node. If it
1207 is looking through a leaf node bin_search will find the position of the item which has key either
1208 equal to given key, or which is the maximal key less than the given key. */
1210 struct path_element {
1211 struct buffer_head *pe_buffer; /* Pointer to the buffer at the path in the tree. */
1212 int pe_position; /* Position in the tree node which is placed in the */
1216 #define MAX_HEIGHT 5 /* maximal height of a tree. don't change this without changing JOURNAL_PER_BALANCE_CNT */
1217 #define EXTENDED_MAX_HEIGHT 7 /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */
1218 #define FIRST_PATH_ELEMENT_OFFSET 2 /* Must be equal to at least 2. */
1220 #define ILLEGAL_PATH_ELEMENT_OFFSET 1 /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */
1221 #define MAX_FEB_SIZE 6 /* this MUST be MAX_HEIGHT + 1. See about FEB below */
1223 /* We need to keep track of who the ancestors of nodes are. When we
1224 perform a search we record which nodes were visited while
1225 descending the tree looking for the node we searched for. This list
1226 of nodes is called the path. This information is used while
1227 performing balancing. Note that this path information may become
1228 invalid, and this means we must check it when using it to see if it
1229 is still valid. You'll need to read search_by_key and the comments
1230 in it, especially about decrement_counters_in_path(), to understand
1233 Paths make the code so much harder to work with and debug.... An
1234 enormous number of bugs are due to them, and trying to write or modify
1235 code that uses them just makes my head hurt. They are based on an
1236 excessive effort to avoid disturbing the precious VFS code.:-( The
1237 gods only know how we are going to SMP the code that uses them.
1238 znodes are the way! */
1240 #define PATH_READA 0x1 /* do read ahead */
1241 #define PATH_READA_BACK 0x2 /* read backwards */
1244 int path_length; /* Length of the array above. */
1246 struct path_element path_elements[EXTENDED_MAX_HEIGHT]; /* Array of the path elements. */
1250 #define pos_in_item(path) ((path)->pos_in_item)
1252 #define INITIALIZE_PATH(var) \
1253 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
1255 /* Get path element by path and path position. */
1256 #define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset))
1258 /* Get buffer header at the path by path and path position. */
1259 #define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer)
1261 /* Get position in the element at the path by path and path position. */
1262 #define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position)
1264 #define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
1265 /* you know, to the person who didn't
1266 write this the macro name does not
1267 at first suggest what it does.
1268 Maybe POSITION_FROM_PATH_END? Or
1269 maybe we should just focus on
1270 dumping paths... -Hans */
1271 #define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
1273 #define PATH_PITEM_HEAD(path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path))
1275 /* in do_balance leaf has h == 0 in contrast with path structure,
1276 where root has level == 0. That is why we need these defines */
1277 #define PATH_H_PBUFFER(path, h) PATH_OFFSET_PBUFFER (path, path->path_length - (h)) /* tb->S[h] */
1278 #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1) /* tb->F[h] or tb->S[0]->b_parent */
1279 #define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h))
1280 #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1) /* tb->S[h]->b_item_order */
1282 #define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
1284 #define get_last_bh(path) PATH_PLAST_BUFFER(path)
1285 #define get_ih(path) PATH_PITEM_HEAD(path)
1286 #define get_item_pos(path) PATH_LAST_POSITION(path)
1287 #define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path)))
1288 #define item_moved(ih,path) comp_items(ih, path)
1289 #define path_changed(ih,path) comp_items (ih, path)
1291 /***************************************************************************/
1293 /***************************************************************************/
1295 /* Size of pointer to the unformatted node. */
1296 #define UNFM_P_SIZE (sizeof(unp_t))
1297 #define UNFM_P_SHIFT 2
1299 // in in-core inode key is stored on le form
1300 #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key))
1302 #define MAX_UL_INT 0xffffffff
1303 #define MAX_INT 0x7ffffff
1304 #define MAX_US_INT 0xffff
1306 // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset
1307 #define U32_MAX (~(__u32)0)
1309 static inline loff_t max_reiserfs_offset(struct inode *inode)
1311 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5)
1312 return (loff_t) U32_MAX;
1314 return (loff_t) ((~(__u64) 0) >> 4);
1317 /*#define MAX_KEY_UNIQUENESS MAX_UL_INT*/
1318 #define MAX_KEY_OBJECTID MAX_UL_INT
1320 #define MAX_B_NUM MAX_UL_INT
1321 #define MAX_FC_NUM MAX_US_INT
1323 /* the purpose is to detect overflow of an unsigned short */
1324 #define REISERFS_LINK_MAX (MAX_US_INT - 1000)
1326 /* The following defines are used in reiserfs_insert_item and reiserfs_append_item */
1327 #define REISERFS_KERNEL_MEM 0 /* reiserfs kernel memory mode */
1328 #define REISERFS_USER_MEM 1 /* reiserfs user memory mode */
1330 #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter)
1331 #define get_generation(s) atomic_read (&fs_generation(s))
1332 #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen)
1333 #define __fs_changed(gen,s) (gen != get_generation (s))
1334 #define fs_changed(gen,s) ({cond_resched(); __fs_changed(gen, s);})
1336 /***************************************************************************/
1338 /***************************************************************************/
1340 #define VI_TYPE_LEFT_MERGEABLE 1
1341 #define VI_TYPE_RIGHT_MERGEABLE 2
1343 /* To make any changes in the tree we always first find node, that
1344 contains item to be changed/deleted or place to insert a new
1345 item. We call this node S. To do balancing we need to decide what
1346 we will shift to left/right neighbor, or to a new node, where new
1347 item will be etc. To make this analysis simpler we build virtual
1348 node. Virtual node is an array of items, that will replace items of
1349 node S. (For instance if we are going to delete an item, virtual
1350 node does not contain it). Virtual node keeps information about
1351 item sizes and types, mergeability of first and last items, sizes
1352 of all entries in directory item. We use this array of items when
1353 calculating what we can shift to neighbors and how many nodes we
1354 have to have if we do not any shiftings, if we shift to left/right
1355 neighbor or to both. */
1356 struct virtual_item {
1357 int vi_index; // index in the array of item operations
1358 unsigned short vi_type; // left/right mergeability
1359 unsigned short vi_item_len; /* length of item that it will have after balancing */
1360 struct item_head *vi_ih;
1361 const char *vi_item; // body of item (old or new)
1362 const void *vi_new_data; // 0 always but paste mode
1363 void *vi_uarea; // item specific area
1366 struct virtual_node {
1367 char *vn_free_ptr; /* this is a pointer to the free space in the buffer */
1368 unsigned short vn_nr_item; /* number of items in virtual node */
1369 short vn_size; /* size of node , that node would have if it has unlimited size and no balancing is performed */
1370 short vn_mode; /* mode of balancing (paste, insert, delete, cut) */
1371 short vn_affected_item_num;
1372 short vn_pos_in_item;
1373 struct item_head *vn_ins_ih; /* item header of inserted item, 0 for other modes */
1374 const void *vn_data;
1375 struct virtual_item *vn_vi; /* array of items (including a new one, excluding item to be deleted) */
1378 /* used by directory items when creating virtual nodes */
1379 struct direntry_uarea {
1382 __u16 entry_sizes[1];
1383 } __attribute__ ((__packed__));
1385 /***************************************************************************/
1387 /***************************************************************************/
1389 /* This temporary structure is used in tree balance algorithms, and
1390 constructed as we go to the extent that its various parts are
1391 needed. It contains arrays of nodes that can potentially be
1392 involved in the balancing of node S, and parameters that define how
1393 each of the nodes must be balanced. Note that in these algorithms
1394 for balancing the worst case is to need to balance the current node
1395 S and the left and right neighbors and all of their parents plus
1396 create a new node. We implement S1 balancing for the leaf nodes
1397 and S0 balancing for the internal nodes (S1 and S0 are defined in
1400 #define MAX_FREE_BLOCK 7 /* size of the array of buffers to free at end of do_balance */
1402 /* maximum number of FEB blocknrs on a single level */
1403 #define MAX_AMOUNT_NEEDED 2
1405 /* someday somebody will prefix every field in this struct with tb_ */
1406 struct tree_balance {
1408 int need_balance_dirty;
1409 struct super_block *tb_sb;
1410 struct reiserfs_transaction_handle *transaction_handle;
1411 struct treepath *tb_path;
1412 struct buffer_head *L[MAX_HEIGHT]; /* array of left neighbors of nodes in the path */
1413 struct buffer_head *R[MAX_HEIGHT]; /* array of right neighbors of nodes in the path */
1414 struct buffer_head *FL[MAX_HEIGHT]; /* array of fathers of the left neighbors */
1415 struct buffer_head *FR[MAX_HEIGHT]; /* array of fathers of the right neighbors */
1416 struct buffer_head *CFL[MAX_HEIGHT]; /* array of common parents of center node and its left neighbor */
1417 struct buffer_head *CFR[MAX_HEIGHT]; /* array of common parents of center node and its right neighbor */
1419 struct buffer_head *FEB[MAX_FEB_SIZE]; /* array of empty buffers. Number of buffers in array equals
1421 struct buffer_head *used[MAX_FEB_SIZE];
1422 struct buffer_head *thrown[MAX_FEB_SIZE];
1423 int lnum[MAX_HEIGHT]; /* array of number of items which must be
1424 shifted to the left in order to balance the
1425 current node; for leaves includes item that
1426 will be partially shifted; for internal
1427 nodes, it is the number of child pointers
1428 rather than items. It includes the new item
1429 being created. The code sometimes subtracts
1430 one to get the number of wholly shifted
1431 items for other purposes. */
1432 int rnum[MAX_HEIGHT]; /* substitute right for left in comment above */
1433 int lkey[MAX_HEIGHT]; /* array indexed by height h mapping the key delimiting L[h] and
1434 S[h] to its item number within the node CFL[h] */
1435 int rkey[MAX_HEIGHT]; /* substitute r for l in comment above */
1436 int insert_size[MAX_HEIGHT]; /* the number of bytes by we are trying to add or remove from
1437 S[h]. A negative value means removing. */
1438 int blknum[MAX_HEIGHT]; /* number of nodes that will replace node S[h] after
1439 balancing on the level h of the tree. If 0 then S is
1440 being deleted, if 1 then S is remaining and no new nodes
1441 are being created, if 2 or 3 then 1 or 2 new nodes is
1444 /* fields that are used only for balancing leaves of the tree */
1445 int cur_blknum; /* number of empty blocks having been already allocated */
1446 int s0num; /* number of items that fall into left most node when S[0] splits */
1447 int s1num; /* number of items that fall into first new node when S[0] splits */
1448 int s2num; /* number of items that fall into second new node when S[0] splits */
1449 int lbytes; /* number of bytes which can flow to the left neighbor from the left */
1450 /* most liquid item that cannot be shifted from S[0] entirely */
1451 /* if -1 then nothing will be partially shifted */
1452 int rbytes; /* number of bytes which will flow to the right neighbor from the right */
1453 /* most liquid item that cannot be shifted from S[0] entirely */
1454 /* if -1 then nothing will be partially shifted */
1455 int s1bytes; /* number of bytes which flow to the first new node when S[0] splits */
1456 /* note: if S[0] splits into 3 nodes, then items do not need to be cut */
1458 struct buffer_head *buf_to_free[MAX_FREE_BLOCK]; /* buffers which are to be freed after do_balance finishes by unfix_nodes */
1459 char *vn_buf; /* kmalloced memory. Used to create
1460 virtual node and keep map of
1461 dirtied bitmap blocks */
1462 int vn_buf_size; /* size of the vn_buf */
1463 struct virtual_node *tb_vn; /* VN starts after bitmap of bitmap blocks */
1465 int fs_gen; /* saved value of `reiserfs_generation' counter
1466 see FILESYSTEM_CHANGED() macro in reiserfs_fs.h */
1467 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1468 struct in_core_key key; /* key pointer, to pass to block allocator or
1469 another low-level subsystem */
1473 /* These are modes of balancing */
1475 /* When inserting an item. */
1476 #define M_INSERT 'i'
1477 /* When inserting into (directories only) or appending onto an already
1480 /* When deleting an item. */
1481 #define M_DELETE 'd'
1482 /* When truncating an item or removing an entry from a (directory) item. */
1485 /* used when balancing on leaf level skipped (in reiserfsck) */
1486 #define M_INTERNAL 'n'
1488 /* When further balancing is not needed, then do_balance does not need
1490 #define M_SKIP_BALANCING 's'
1491 #define M_CONVERT 'v'
1493 /* modes of leaf_move_items */
1494 #define LEAF_FROM_S_TO_L 0
1495 #define LEAF_FROM_S_TO_R 1
1496 #define LEAF_FROM_R_TO_L 2
1497 #define LEAF_FROM_L_TO_R 3
1498 #define LEAF_FROM_S_TO_SNEW 4
1500 #define FIRST_TO_LAST 0
1501 #define LAST_TO_FIRST 1
1503 /* used in do_balance for passing parent of node information that has
1504 been gotten from tb struct */
1505 struct buffer_info {
1506 struct tree_balance *tb;
1507 struct buffer_head *bi_bh;
1508 struct buffer_head *bi_parent;
1512 static inline struct super_block *sb_from_tb(struct tree_balance *tb)
1514 return tb ? tb->tb_sb : NULL;
1517 static inline struct super_block *sb_from_bi(struct buffer_info *bi)
1519 return bi ? sb_from_tb(bi->tb) : NULL;
1522 /* there are 4 types of items: stat data, directory item, indirect, direct.
1523 +-------------------+------------+--------------+------------+
1524 | | k_offset | k_uniqueness | mergeable? |
1525 +-------------------+------------+--------------+------------+
1526 | stat data | 0 | 0 | no |
1527 +-------------------+------------+--------------+------------+
1528 | 1st directory item| DOT_OFFSET |DIRENTRY_UNIQUENESS| no |
1529 | non 1st directory | hash value | | yes |
1531 +-------------------+------------+--------------+------------+
1532 | indirect item | offset + 1 |TYPE_INDIRECT | if this is not the first indirect item of the object
1533 +-------------------+------------+--------------+------------+
1534 | direct item | offset + 1 |TYPE_DIRECT | if not this is not the first direct item of the object
1535 +-------------------+------------+--------------+------------+
1538 struct item_operations {
1539 int (*bytes_number) (struct item_head * ih, int block_size);
1540 void (*decrement_key) (struct cpu_key *);
1541 int (*is_left_mergeable) (struct reiserfs_key * ih,
1542 unsigned long bsize);
1543 void (*print_item) (struct item_head *, char *item);
1544 void (*check_item) (struct item_head *, char *item);
1546 int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi,
1547 int is_affected, int insert_size);
1548 int (*check_left) (struct virtual_item * vi, int free,
1549 int start_skip, int end_skip);
1550 int (*check_right) (struct virtual_item * vi, int free);
1551 int (*part_size) (struct virtual_item * vi, int from, int to);
1552 int (*unit_num) (struct virtual_item * vi);
1553 void (*print_vi) (struct virtual_item * vi);
1556 extern struct item_operations *item_ops[TYPE_ANY + 1];
1558 #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize)
1559 #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize)
1560 #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item)
1561 #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item)
1562 #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)
1563 #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip)
1564 #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free)
1565 #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to)
1566 #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi)
1567 #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi)
1569 #define COMP_SHORT_KEYS comp_short_keys
1571 /* number of blocks pointed to by the indirect item */
1572 #define I_UNFM_NUM(ih) (ih_item_len(ih) / UNFM_P_SIZE)
1574 /* the used space within the unformatted node corresponding to pos within the item pointed to by ih */
1575 #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size))
1577 /* number of bytes contained by the direct item or the unformatted nodes the indirect item points to */
1579 /* get the item header */
1580 #define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1583 #define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1586 #define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) )
1589 #define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num))))
1591 /* get the stat data by the buffer header and the item order */
1592 #define B_N_STAT_DATA(bh,nr) \
1593 ( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) )
1595 /* following defines use reiserfs buffer header and item header */
1598 #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) )
1600 // this is 3976 for size==4096
1601 #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
1603 /* indirect items consist of entries which contain blocknrs, pos
1604 indicates which entry, and B_I_POS_UNFM_POINTER resolves to the
1605 blocknr contained by the entry pos points to */
1606 #define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)))
1607 #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)
1609 struct reiserfs_iget_args {
1614 /***************************************************************************/
1615 /* FUNCTION DECLARATIONS */
1616 /***************************************************************************/
1618 #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12)
1620 #define journal_trans_half(blocksize) \
1621 ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32))
1623 /* journal.c see journal.c for all the comments here */
1625 /* first block written in a commit. */
1626 struct reiserfs_journal_desc {
1627 __le32 j_trans_id; /* id of commit */
1628 __le32 j_len; /* length of commit. len +1 is the commit block */
1629 __le32 j_mount_id; /* mount id of this trans */
1630 __le32 j_realblock[1]; /* real locations for each block */
1633 #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id)
1634 #define get_desc_trans_len(d) le32_to_cpu((d)->j_len)
1635 #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id)
1637 #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0)
1638 #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0)
1639 #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0)
1641 /* last block written in a commit */
1642 struct reiserfs_journal_commit {
1643 __le32 j_trans_id; /* must match j_trans_id from the desc block */
1644 __le32 j_len; /* ditto */
1645 __le32 j_realblock[1]; /* real locations for each block */
1648 #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id)
1649 #define get_commit_trans_len(c) le32_to_cpu((c)->j_len)
1650 #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id)
1652 #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0)
1653 #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0)
1655 /* this header block gets written whenever a transaction is considered fully flushed, and is more recent than the
1656 ** last fully flushed transaction. fully flushed means all the log blocks and all the real blocks are on disk,
1657 ** and this transaction does not need to be replayed.
1659 struct reiserfs_journal_header {
1660 __le32 j_last_flush_trans_id; /* id of last fully flushed transaction */
1661 __le32 j_first_unflushed_offset; /* offset in the log of where to start replay after a crash */
1663 /* 12 */ struct journal_params jh_journal;
1666 /* biggest tunable defines are right here */
1667 #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */
1668 #define JOURNAL_TRANS_MAX_DEFAULT 1024 /* biggest possible single transaction, don't change for now (8/3/99) */
1669 #define JOURNAL_TRANS_MIN_DEFAULT 256
1670 #define JOURNAL_MAX_BATCH_DEFAULT 900 /* max blocks to batch into one transaction, don't make this any bigger than 900 */
1671 #define JOURNAL_MIN_RATIO 2
1672 #define JOURNAL_MAX_COMMIT_AGE 30
1673 #define JOURNAL_MAX_TRANS_AGE 30
1674 #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)
1675 #define JOURNAL_BLOCKS_PER_OBJECT(sb) (JOURNAL_PER_BALANCE_CNT * 3 + \
1676 2 * (REISERFS_QUOTA_INIT_BLOCKS(sb) + \
1677 REISERFS_QUOTA_TRANS_BLOCKS(sb)))
1680 /* We need to update data and inode (atime) */
1681 #define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? 2 : 0)
1682 /* 1 balancing, 1 bitmap, 1 data per write + stat data update */
1683 #define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \
1684 (DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0)
1685 /* same as with INIT */
1686 #define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \
1687 (DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0)
1689 #define REISERFS_QUOTA_TRANS_BLOCKS(s) 0
1690 #define REISERFS_QUOTA_INIT_BLOCKS(s) 0
1691 #define REISERFS_QUOTA_DEL_BLOCKS(s) 0
1694 /* both of these can be as low as 1, or as high as you want. The min is the
1695 ** number of 4k bitmap nodes preallocated on mount. New nodes are allocated
1696 ** as needed, and released when transactions are committed. On release, if
1697 ** the current number of nodes is > max, the node is freed, otherwise,
1698 ** it is put on a free list for faster use later.
1700 #define REISERFS_MIN_BITMAP_NODES 10
1701 #define REISERFS_MAX_BITMAP_NODES 100
1703 #define JBH_HASH_SHIFT 13 /* these are based on journal hash size of 8192 */
1704 #define JBH_HASH_MASK 8191
1706 #define _jhashfn(sb,block) \
1707 (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \
1708 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
1709 #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
1711 // We need these to make journal.c code more readable
1712 #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1713 #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1714 #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1716 enum reiserfs_bh_state_bits {
1717 BH_JDirty = BH_PrivateStart, /* buffer is in current transaction */
1719 BH_JNew, /* disk block was taken off free list before
1720 * being in a finished transaction, or
1721 * written to disk. Can be reused immed. */
1724 BH_JTest, // debugging only will go away
1727 BUFFER_FNS(JDirty, journaled);
1728 TAS_BUFFER_FNS(JDirty, journaled);
1729 BUFFER_FNS(JDirty_wait, journal_dirty);
1730 TAS_BUFFER_FNS(JDirty_wait, journal_dirty);
1731 BUFFER_FNS(JNew, journal_new);
1732 TAS_BUFFER_FNS(JNew, journal_new);
1733 BUFFER_FNS(JPrepared, journal_prepared);
1734 TAS_BUFFER_FNS(JPrepared, journal_prepared);
1735 BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
1736 TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
1737 BUFFER_FNS(JTest, journal_test);
1738 TAS_BUFFER_FNS(JTest, journal_test);
1741 ** transaction handle which is passed around for all journal calls
1743 struct reiserfs_transaction_handle {
1744 struct super_block *t_super; /* super for this FS when journal_begin was
1745 called. saves calls to reiserfs_get_super
1746 also used by nested transactions to make
1747 sure they are nesting on the right FS
1748 _must_ be first in the handle
1751 int t_blocks_logged; /* number of blocks this writer has logged */
1752 int t_blocks_allocated; /* number of blocks this writer allocated */
1753 unsigned int t_trans_id; /* sanity check, equals the current trans id */
1754 void *t_handle_save; /* save existing current->journal_info */
1755 unsigned displace_new_blocks:1; /* if new block allocation occurres, that block
1756 should be displaced from others */
1757 struct list_head t_list;
1760 /* used to keep track of ordered and tail writes, attached to the buffer
1761 * head through b_journal_head.
1763 struct reiserfs_jh {
1764 struct reiserfs_journal_list *jl;
1765 struct buffer_head *bh;
1766 struct list_head list;
1769 void reiserfs_free_jh(struct buffer_head *bh);
1770 int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh);
1771 int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh);
1772 int journal_mark_dirty(struct reiserfs_transaction_handle *,
1773 struct super_block *, struct buffer_head *bh);
1775 static inline int reiserfs_file_data_log(struct inode *inode)
1777 if (reiserfs_data_log(inode->i_sb) ||
1778 (REISERFS_I(inode)->i_flags & i_data_log))
1783 static inline int reiserfs_transaction_running(struct super_block *s)
1785 struct reiserfs_transaction_handle *th = current->journal_info;
1786 if (th && th->t_super == s)
1788 if (th && th->t_super == NULL)
1793 static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th)
1795 return th->t_blocks_allocated - th->t_blocks_logged;
1798 struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct
1802 int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *);
1803 int reiserfs_commit_page(struct inode *inode, struct page *page,
1804 unsigned from, unsigned to);
1805 int reiserfs_flush_old_commits(struct super_block *);
1806 int reiserfs_commit_for_inode(struct inode *);
1807 int reiserfs_inode_needs_commit(struct inode *);
1808 void reiserfs_update_inode_transaction(struct inode *);
1809 void reiserfs_wait_on_write_block(struct super_block *s);
1810 void reiserfs_block_writes(struct reiserfs_transaction_handle *th);
1811 void reiserfs_allow_writes(struct super_block *s);
1812 void reiserfs_check_lock_depth(struct super_block *s, char *caller);
1813 int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh,
1815 void reiserfs_restore_prepared_buffer(struct super_block *,
1816 struct buffer_head *bh);
1817 int journal_init(struct super_block *, const char *j_dev_name, int old_format,
1819 int journal_release(struct reiserfs_transaction_handle *, struct super_block *);
1820 int journal_release_error(struct reiserfs_transaction_handle *,
1821 struct super_block *);
1822 int journal_end(struct reiserfs_transaction_handle *, struct super_block *,
1824 int journal_end_sync(struct reiserfs_transaction_handle *, struct super_block *,
1826 int journal_mark_freed(struct reiserfs_transaction_handle *,
1827 struct super_block *, b_blocknr_t blocknr);
1828 int journal_transaction_should_end(struct reiserfs_transaction_handle *, int);
1829 int reiserfs_in_journal(struct super_block *sb, unsigned int bmap_nr,
1830 int bit_nr, int searchall, b_blocknr_t *next);
1831 int journal_begin(struct reiserfs_transaction_handle *,
1832 struct super_block *sb, unsigned long);
1833 int journal_join_abort(struct reiserfs_transaction_handle *,
1834 struct super_block *sb, unsigned long);
1835 void reiserfs_abort_journal(struct super_block *sb, int errno);
1836 void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...);
1837 int reiserfs_allocate_list_bitmaps(struct super_block *s,
1838 struct reiserfs_list_bitmap *, unsigned int);
1840 void add_save_link(struct reiserfs_transaction_handle *th,
1841 struct inode *inode, int truncate);
1842 int remove_save_link(struct inode *inode, int truncate);
1845 __u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th);
1846 void reiserfs_release_objectid(struct reiserfs_transaction_handle *th,
1847 __u32 objectid_to_release);
1848 int reiserfs_convert_objectid_map_v1(struct super_block *);
1851 int B_IS_IN_TREE(const struct buffer_head *);
1852 extern void copy_item_head(struct item_head *to,
1853 const struct item_head *from);
1855 // first key is in cpu form, second - le
1856 extern int comp_short_keys(const struct reiserfs_key *le_key,
1857 const struct cpu_key *cpu_key);
1858 extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from);
1860 // both are in le form
1861 extern int comp_le_keys(const struct reiserfs_key *,
1862 const struct reiserfs_key *);
1863 extern int comp_short_le_keys(const struct reiserfs_key *,
1864 const struct reiserfs_key *);
1867 // get key version from on disk key - kludge
1869 static inline int le_key_version(const struct reiserfs_key *key)
1873 type = offset_v2_k_type(&(key->u.k_offset_v2));
1874 if (type != TYPE_DIRECT && type != TYPE_INDIRECT
1875 && type != TYPE_DIRENTRY)
1876 return KEY_FORMAT_3_5;
1878 return KEY_FORMAT_3_6;
1882 static inline void copy_key(struct reiserfs_key *to,
1883 const struct reiserfs_key *from)
1885 memcpy(to, from, KEY_SIZE);
1888 int comp_items(const struct item_head *stored_ih, const struct treepath *path);
1889 const struct reiserfs_key *get_rkey(const struct treepath *chk_path,
1890 const struct super_block *sb);
1891 int search_by_key(struct super_block *, const struct cpu_key *,
1892 struct treepath *, int);
1893 #define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)
1894 int search_for_position_by_key(struct super_block *sb,
1895 const struct cpu_key *cpu_key,
1896 struct treepath *search_path);
1897 extern void decrement_bcount(struct buffer_head *bh);
1898 void decrement_counters_in_path(struct treepath *search_path);
1899 void pathrelse(struct treepath *search_path);
1900 int reiserfs_check_path(struct treepath *p);
1901 void pathrelse_and_restore(struct super_block *s, struct treepath *search_path);
1903 int reiserfs_insert_item(struct reiserfs_transaction_handle *th,
1904 struct treepath *path,
1905 const struct cpu_key *key,
1906 struct item_head *ih,
1907 struct inode *inode, const char *body);
1909 int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th,
1910 struct treepath *path,
1911 const struct cpu_key *key,
1912 struct inode *inode,
1913 const char *body, int paste_size);
1915 int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th,
1916 struct treepath *path,
1917 struct cpu_key *key,
1918 struct inode *inode,
1919 struct page *page, loff_t new_file_size);
1921 int reiserfs_delete_item(struct reiserfs_transaction_handle *th,
1922 struct treepath *path,
1923 const struct cpu_key *key,
1924 struct inode *inode, struct buffer_head *un_bh);
1926 void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th,
1927 struct inode *inode, struct reiserfs_key *key);
1928 int reiserfs_delete_object(struct reiserfs_transaction_handle *th,
1929 struct inode *inode);
1930 int reiserfs_do_truncate(struct reiserfs_transaction_handle *th,
1931 struct inode *inode, struct page *,
1932 int update_timestamps);
1934 #define i_block_size(inode) ((inode)->i_sb->s_blocksize)
1935 #define file_size(inode) ((inode)->i_size)
1936 #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1))
1938 #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\
1939 !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 )
1941 void padd_item(char *item, int total_length, int length);
1944 /* args for the create parameter of reiserfs_get_block */
1945 #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */
1946 #define GET_BLOCK_CREATE 1 /* add anything you need to find block */
1947 #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */
1948 #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */
1949 #define GET_BLOCK_NO_IMUX 8 /* i_mutex is not held, don't preallocate */
1950 #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */
1952 void reiserfs_read_locked_inode(struct inode *inode,
1953 struct reiserfs_iget_args *args);
1954 int reiserfs_find_actor(struct inode *inode, void *p);
1955 int reiserfs_init_locked_inode(struct inode *inode, void *p);
1956 void reiserfs_delete_inode(struct inode *inode);
1957 int reiserfs_write_inode(struct inode *inode, int);
1958 int reiserfs_get_block(struct inode *inode, sector_t block,
1959 struct buffer_head *bh_result, int create);
1960 struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
1961 int fh_len, int fh_type);
1962 struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
1963 int fh_len, int fh_type);
1964 int reiserfs_encode_fh(struct dentry *dentry, __u32 * data, int *lenp,
1967 int reiserfs_truncate_file(struct inode *, int update_timestamps);
1968 void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset,
1969 int type, int key_length);
1970 void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
1972 loff_t offset, int type, int length, int entry_count);
1973 struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key);
1975 struct reiserfs_security_handle;
1976 int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
1977 struct inode *dir, int mode,
1978 const char *symname, loff_t i_size,
1979 struct dentry *dentry, struct inode *inode,
1980 struct reiserfs_security_handle *security);
1982 void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
1983 struct inode *inode, loff_t size);
1985 static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th,
1986 struct inode *inode)
1988 reiserfs_update_sd_size(th, inode, inode->i_size);
1991 void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode);
1992 void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs);
1993 int reiserfs_setattr(struct dentry *dentry, struct iattr *attr);
1996 void set_de_name_and_namelen(struct reiserfs_dir_entry *de);
1997 int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
1998 struct treepath *path, struct reiserfs_dir_entry *de);
1999 struct dentry *reiserfs_get_parent(struct dentry *);
2002 #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )
2003 #define REISERFS_PROC_INFO
2005 #undef REISERFS_PROC_INFO
2008 int reiserfs_proc_info_init(struct super_block *sb);
2009 int reiserfs_proc_info_done(struct super_block *sb);
2010 struct proc_dir_entry *reiserfs_proc_register_global(char *name,
2011 read_proc_t * func);
2012 void reiserfs_proc_unregister_global(const char *name);
2013 int reiserfs_proc_info_global_init(void);
2014 int reiserfs_proc_info_global_done(void);
2015 int reiserfs_global_version_in_proc(char *buffer, char **start, off_t offset,
2016 int count, int *eof, void *data);
2018 #if defined( REISERFS_PROC_INFO )
2020 #define PROC_EXP( e ) e
2022 #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data
2023 #define PROC_INFO_MAX( sb, field, value ) \
2024 __PINFO( sb ).field = \
2025 max( REISERFS_SB( sb ) -> s_proc_info_data.field, value )
2026 #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) )
2027 #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) )
2028 #define PROC_INFO_BH_STAT( sb, bh, level ) \
2029 PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \
2030 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
2031 PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
2033 #define PROC_EXP( e )
2034 #define VOID_V ( ( void ) 0 )
2035 #define PROC_INFO_MAX( sb, field, value ) VOID_V
2036 #define PROC_INFO_INC( sb, field ) VOID_V
2037 #define PROC_INFO_ADD( sb, field, val ) VOID_V
2038 #define PROC_INFO_BH_STAT(sb, bh, n_node_level) VOID_V
2042 extern const struct inode_operations reiserfs_dir_inode_operations;
2043 extern const struct inode_operations reiserfs_symlink_inode_operations;
2044 extern const struct inode_operations reiserfs_special_inode_operations;
2045 extern const struct file_operations reiserfs_dir_operations;
2046 int reiserfs_readdir_dentry(struct dentry *, void *, filldir_t, loff_t *);
2048 /* tail_conversion.c */
2049 int direct2indirect(struct reiserfs_transaction_handle *, struct inode *,
2050 struct treepath *, struct buffer_head *, loff_t);
2051 int indirect2direct(struct reiserfs_transaction_handle *, struct inode *,
2052 struct page *, struct treepath *, const struct cpu_key *,
2054 void reiserfs_unmap_buffer(struct buffer_head *);
2057 extern const struct inode_operations reiserfs_file_inode_operations;
2058 extern const struct file_operations reiserfs_file_operations;
2059 extern const struct address_space_operations reiserfs_address_space_operations;
2063 int fix_nodes(int n_op_mode, struct tree_balance *tb,
2064 struct item_head *ins_ih, const void *);
2065 void unfix_nodes(struct tree_balance *);
2068 void __reiserfs_panic(struct super_block *s, const char *id,
2069 const char *function, const char *fmt, ...)
2070 __attribute__ ((noreturn));
2071 #define reiserfs_panic(s, id, fmt, args...) \
2072 __reiserfs_panic(s, id, __func__, fmt, ##args)
2073 void __reiserfs_error(struct super_block *s, const char *id,
2074 const char *function, const char *fmt, ...);
2075 #define reiserfs_error(s, id, fmt, args...) \
2076 __reiserfs_error(s, id, __func__, fmt, ##args)
2077 void reiserfs_info(struct super_block *s, const char *fmt, ...);
2078 void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...);
2079 void print_indirect_item(struct buffer_head *bh, int item_num);
2080 void store_print_tb(struct tree_balance *tb);
2081 void print_cur_tb(char *mes);
2082 void print_de(struct reiserfs_dir_entry *de);
2083 void print_bi(struct buffer_info *bi, char *mes);
2084 #define PRINT_LEAF_ITEMS 1 /* print all items */
2085 #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */
2086 #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */
2087 void print_block(struct buffer_head *bh, ...);
2088 void print_bmap(struct super_block *s, int silent);
2089 void print_bmap_block(int i, char *data, int size, int silent);
2090 /*void print_super_block (struct super_block * s, char * mes);*/
2091 void print_objectid_map(struct super_block *s);
2092 void print_block_head(struct buffer_head *bh, char *mes);
2093 void check_leaf(struct buffer_head *bh);
2094 void check_internal(struct buffer_head *bh);
2095 void print_statistics(struct super_block *s);
2096 char *reiserfs_hashname(int code);
2099 int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
2100 int mov_bytes, struct buffer_head *Snew);
2101 int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
2102 int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
2103 void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first,
2104 int del_num, int del_bytes);
2105 void leaf_insert_into_buf(struct buffer_info *bi, int before,
2106 struct item_head *inserted_item_ih,
2107 const char *inserted_item_body, int zeros_number);
2108 void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
2109 int pos_in_item, int paste_size, const char *body,
2111 void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
2112 int pos_in_item, int cut_size);
2113 void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
2114 int new_entry_count, struct reiserfs_de_head *new_dehs,
2115 const char *records, int paste_size);
2117 int balance_internal(struct tree_balance *, int, int, struct item_head *,
2118 struct buffer_head **);
2121 void do_balance_mark_leaf_dirty(struct tree_balance *tb,
2122 struct buffer_head *bh, int flag);
2123 #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty
2124 #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty
2126 void do_balance(struct tree_balance *tb, struct item_head *ih,
2127 const char *body, int flag);
2128 void reiserfs_invalidate_buffer(struct tree_balance *tb,
2129 struct buffer_head *bh);
2131 int get_left_neighbor_position(struct tree_balance *tb, int h);
2132 int get_right_neighbor_position(struct tree_balance *tb, int h);
2133 void replace_key(struct tree_balance *tb, struct buffer_head *, int,
2134 struct buffer_head *, int);
2135 void make_empty_node(struct buffer_info *);
2136 struct buffer_head *get_FEB(struct tree_balance *);
2140 /* structure contains hints for block allocator, and it is a container for
2141 * arguments, such as node, search path, transaction_handle, etc. */
2142 struct __reiserfs_blocknr_hint {
2143 struct inode *inode; /* inode passed to allocator, if we allocate unf. nodes */
2144 sector_t block; /* file offset, in blocks */
2145 struct in_core_key key;
2146 struct treepath *path; /* search path, used by allocator to deternine search_start by
2148 struct reiserfs_transaction_handle *th; /* transaction handle is needed to log super blocks and
2149 * bitmap blocks changes */
2150 b_blocknr_t beg, end;
2151 b_blocknr_t search_start; /* a field used to transfer search start value (block number)
2152 * between different block allocator procedures
2153 * (determine_search_start() and others) */
2154 int prealloc_size; /* is set in determine_prealloc_size() function, used by underlayed
2155 * function that do actual allocation */
2157 unsigned formatted_node:1; /* the allocator uses different polices for getting disk space for
2158 * formatted/unformatted blocks with/without preallocation */
2159 unsigned preallocate:1;
2162 typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t;
2164 int reiserfs_parse_alloc_options(struct super_block *, char *);
2165 void reiserfs_init_alloc_options(struct super_block *s);
2168 * given a directory, this will tell you what packing locality
2169 * to use for a new object underneat it. The locality is returned
2170 * in disk byte order (le).
2172 __le32 reiserfs_choose_packing(struct inode *dir);
2174 int reiserfs_init_bitmap_cache(struct super_block *sb);
2175 void reiserfs_free_bitmap_cache(struct super_block *sb);
2176 void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info);
2177 struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap);
2178 int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
2179 void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *,
2180 b_blocknr_t, int for_unformatted);
2181 int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int,
2183 static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb,
2184 b_blocknr_t * new_blocknrs,
2187 reiserfs_blocknr_hint_t hint = {
2188 .th = tb->transaction_handle,
2189 .path = tb->tb_path,
2195 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed,
2199 static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle
2200 *th, struct inode *inode,
2201 b_blocknr_t * new_blocknrs,
2202 struct treepath *path,
2205 reiserfs_blocknr_hint_t hint = {
2210 .formatted_node = 0,
2213 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2216 #ifdef REISERFS_PREALLOCATE
2217 static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle
2218 *th, struct inode *inode,
2219 b_blocknr_t * new_blocknrs,
2220 struct treepath *path,
2223 reiserfs_blocknr_hint_t hint = {
2228 .formatted_node = 0,
2231 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2234 void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th,
2235 struct inode *inode);
2236 void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th);
2240 __u32 keyed_hash(const signed char *msg, int len);
2241 __u32 yura_hash(const signed char *msg, int len);
2242 __u32 r5_hash(const signed char *msg, int len);
2244 /* the ext2 bit routines adjust for big or little endian as
2245 ** appropriate for the arch, so in our laziness we use them rather
2246 ** than using the bit routines they call more directly. These
2247 ** routines must be used when changing on disk bitmaps. */
2248 #define reiserfs_test_and_set_le_bit ext2_set_bit
2249 #define reiserfs_test_and_clear_le_bit ext2_clear_bit
2250 #define reiserfs_test_le_bit ext2_test_bit
2251 #define reiserfs_find_next_zero_le_bit ext2_find_next_zero_bit
2253 /* sometimes reiserfs_truncate may require to allocate few new blocks
2254 to perform indirect2direct conversion. People probably used to
2255 think, that truncate should work without problems on a filesystem
2256 without free disk space. They may complain that they can not
2257 truncate due to lack of free disk space. This spare space allows us
2258 to not worry about it. 500 is probably too much, but it should be
2260 #define SPARE_SPACE 500
2262 /* prototypes from ioctl.c */
2263 int reiserfs_ioctl(struct inode *inode, struct file *filp,
2264 unsigned int cmd, unsigned long arg);
2265 long reiserfs_compat_ioctl(struct file *filp,
2266 unsigned int cmd, unsigned long arg);
2267 int reiserfs_unpack(struct inode *inode, struct file *filp);
2269 #endif /* __KERNEL__ */
2271 #endif /* _LINUX_REISER_FS_H */