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>
34 * include/linux/reiser_fs.h
36 * Reiser File System constants and structures
40 /* in reading the #defines, it may help to understand that they employ
41 the following abbreviations:
45 H = Height within the tree (should be changed to LEV)
46 N = Number of the item in the node
48 DEH = Directory Entry Header
53 UNFM = UNForMatted node
57 These #defines are named by concatenating these abbreviations,
58 where first comes the arguments, and last comes the return value,
63 #define USE_INODE_GENERATION_COUNTER
65 #define REISERFS_PREALLOCATE
66 #define DISPLACE_NEW_PACKING_LOCALITIES
67 #define PREALLOCATION_SIZE 9
69 /* n must be power of 2 */
70 #define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u))
72 // to be ok for alpha and others we have to align structures to 8 byte
74 // FIXME: do not change 4 by anything else: there is code which relies on that
75 #define ROUND_UP(x) _ROUND_UP(x,8LL)
77 /* debug levels. Right now, CONFIG_REISERFS_CHECK means print all debug
80 #define REISERFS_DEBUG_CODE 5 /* extra messages to help find/debug errors */
82 void reiserfs_warning(struct super_block *s, const char *fmt, ...);
83 /* assertions handling */
85 /** always check a condition and panic if it's false. */
86 #define __RASSERT( cond, scond, format, args... ) \
88 reiserfs_panic( NULL, "reiserfs[%i]: assertion " scond " failed at " \
89 __FILE__ ":%i:%s: " format "\n", \
90 in_interrupt() ? -1 : task_pid_nr(current), __LINE__ , __func__ , ##args )
92 #define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args)
94 #if defined( CONFIG_REISERFS_CHECK )
95 #define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args)
97 #define RFALSE( cond, format, args... ) do {;} while( 0 )
100 #define CONSTF __attribute_const__
102 * Disk Data Structures
105 /***************************************************************************/
107 /***************************************************************************/
110 * Structure of super block on disk, a version of which in RAM is often accessed as REISERFS_SB(s)->s_rs
111 * the version in RAM is part of a larger structure containing fields never written to disk.
113 #define UNSET_HASH 0 // read_super will guess about, what hash names
114 // in directories were sorted with
118 #define DEFAULT_HASH R5_HASH
120 struct journal_params {
121 __le32 jp_journal_1st_block; /* where does journal start from on its
123 __le32 jp_journal_dev; /* journal device st_rdev */
124 __le32 jp_journal_size; /* size of the journal */
125 __le32 jp_journal_trans_max; /* max number of blocks in a transaction. */
126 __le32 jp_journal_magic; /* random value made on fs creation (this
127 * was sb_journal_block_count) */
128 __le32 jp_journal_max_batch; /* max number of blocks to batch into a
130 __le32 jp_journal_max_commit_age; /* in seconds, how old can an async
132 __le32 jp_journal_max_trans_age; /* in seconds, how old can a transaction
136 /* this is the super from 3.5.X, where X >= 10 */
137 struct reiserfs_super_block_v1 {
138 __le32 s_block_count; /* blocks count */
139 __le32 s_free_blocks; /* free blocks count */
140 __le32 s_root_block; /* root block number */
141 struct journal_params s_journal;
142 __le16 s_blocksize; /* block size */
143 __le16 s_oid_maxsize; /* max size of object id array, see
144 * get_objectid() commentary */
145 __le16 s_oid_cursize; /* current size of object id array */
146 __le16 s_umount_state; /* this is set to 1 when filesystem was
147 * umounted, to 2 - when not */
148 char s_magic[10]; /* reiserfs magic string indicates that
149 * file system is reiserfs:
150 * "ReIsErFs" or "ReIsEr2Fs" or "ReIsEr3Fs" */
151 __le16 s_fs_state; /* it is set to used by fsck to mark which
152 * phase of rebuilding is done */
153 __le32 s_hash_function_code; /* indicate, what hash function is being use
154 * to sort names in a directory*/
155 __le16 s_tree_height; /* height of disk tree */
156 __le16 s_bmap_nr; /* amount of bitmap blocks needed to address
157 * each block of file system */
158 __le16 s_version; /* this field is only reliable on filesystem
159 * with non-standard journal */
160 __le16 s_reserved_for_journal; /* size in blocks of journal area on main
161 * device, we need to keep after
162 * making fs with non-standard journal */
163 } __attribute__ ((__packed__));
165 #define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1))
167 /* this is the on disk super block */
168 struct reiserfs_super_block {
169 struct reiserfs_super_block_v1 s_v1;
170 __le32 s_inode_generation;
171 __le32 s_flags; /* Right now used only by inode-attributes, if enabled */
172 unsigned char s_uuid[16]; /* filesystem unique identifier */
173 unsigned char s_label[16]; /* filesystem volume label */
174 char s_unused[88]; /* zero filled by mkreiserfs and
175 * reiserfs_convert_objectid_map_v1()
176 * so any additions must be updated
178 } __attribute__ ((__packed__));
180 #define SB_SIZE (sizeof(struct reiserfs_super_block))
182 #define REISERFS_VERSION_1 0
183 #define REISERFS_VERSION_2 2
185 // on-disk super block fields converted to cpu form
186 #define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs)
187 #define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1))
188 #define SB_BLOCKSIZE(s) \
189 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize))
190 #define SB_BLOCK_COUNT(s) \
191 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count))
192 #define SB_FREE_BLOCKS(s) \
193 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks))
194 #define SB_REISERFS_MAGIC(s) \
195 (SB_V1_DISK_SUPER_BLOCK(s)->s_magic)
196 #define SB_ROOT_BLOCK(s) \
197 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block))
198 #define SB_TREE_HEIGHT(s) \
199 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height))
200 #define SB_REISERFS_STATE(s) \
201 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state))
202 #define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version))
203 #define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr))
205 #define PUT_SB_BLOCK_COUNT(s, val) \
206 do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0)
207 #define PUT_SB_FREE_BLOCKS(s, val) \
208 do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0)
209 #define PUT_SB_ROOT_BLOCK(s, val) \
210 do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0)
211 #define PUT_SB_TREE_HEIGHT(s, val) \
212 do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0)
213 #define PUT_SB_REISERFS_STATE(s, val) \
214 do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0)
215 #define PUT_SB_VERSION(s, val) \
216 do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0)
217 #define PUT_SB_BMAP_NR(s, val) \
218 do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0)
220 #define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal)
221 #define SB_ONDISK_JOURNAL_SIZE(s) \
222 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size))
223 #define SB_ONDISK_JOURNAL_1st_BLOCK(s) \
224 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block))
225 #define SB_ONDISK_JOURNAL_DEVICE(s) \
226 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev))
227 #define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \
228 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal))
230 #define is_block_in_log_or_reserved_area(s, block) \
231 block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
232 && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
233 ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \
234 SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s)))
236 int is_reiserfs_3_5(struct reiserfs_super_block *rs);
237 int is_reiserfs_3_6(struct reiserfs_super_block *rs);
238 int is_reiserfs_jr(struct reiserfs_super_block *rs);
240 /* ReiserFS leaves the first 64k unused, so that partition labels have
241 enough space. If someone wants to write a fancy bootloader that
242 needs more than 64k, let us know, and this will be increased in size.
243 This number must be larger than than the largest block size on any
244 platform, or code will break. -Hans */
245 #define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024)
246 #define REISERFS_FIRST_BLOCK unused_define
247 #define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES
249 /* the spot for the super in versions 3.5 - 3.5.10 (inclusive) */
250 #define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024)
252 // reiserfs internal error code (used by search_by_key adn fix_nodes))
254 #define REPEAT_SEARCH -1
256 #define NO_DISK_SPACE -3
257 #define NO_BALANCING_NEEDED (-4)
258 #define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5)
259 #define QUOTA_EXCEEDED -6
261 typedef __u32 b_blocknr_t;
262 typedef __le32 unp_t;
264 struct unfm_nodeinfo {
266 unsigned short unfm_freespace;
269 /* there are two formats of keys: 3.5 and 3.6
271 #define KEY_FORMAT_3_5 0
272 #define KEY_FORMAT_3_6 1
274 /* there are two stat datas */
275 #define STAT_DATA_V1 0
276 #define STAT_DATA_V2 1
278 static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode)
280 return container_of(inode, struct reiserfs_inode_info, vfs_inode);
283 static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb)
285 return sb->s_fs_info;
288 /* Don't trust REISERFS_SB(sb)->s_bmap_nr, it's a u16
289 * which overflows on large file systems. */
290 static inline __u32 reiserfs_bmap_count(struct super_block *sb)
292 return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1;
295 static inline int bmap_would_wrap(unsigned bmap_nr)
297 return bmap_nr > ((1LL << 16) - 1);
300 /** this says about version of key of all items (but stat data) the
301 object consists of */
302 #define get_inode_item_key_version( inode ) \
303 ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5)
305 #define set_inode_item_key_version( inode, version ) \
306 ({ if((version)==KEY_FORMAT_3_6) \
307 REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \
309 REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; })
311 #define get_inode_sd_version(inode) \
312 ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1)
314 #define set_inode_sd_version(inode, version) \
315 ({ if((version)==STAT_DATA_V2) \
316 REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \
318 REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; })
320 /* This is an aggressive tail suppression policy, I am hoping it
321 improves our benchmarks. The principle behind it is that percentage
322 space saving is what matters, not absolute space saving. This is
323 non-intuitive, but it helps to understand it if you consider that the
324 cost to access 4 blocks is not much more than the cost to access 1
325 block, if you have to do a seek and rotate. A tail risks a
326 non-linear disk access that is significant as a percentage of total
327 time cost for a 4 block file and saves an amount of space that is
328 less significant as a percentage of space, or so goes the hypothesis.
330 #define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \
332 (!(n_tail_size)) || \
333 (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \
334 ( (n_file_size) >= (n_block_size) * 4 ) || \
335 ( ( (n_file_size) >= (n_block_size) * 3 ) && \
336 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \
337 ( ( (n_file_size) >= (n_block_size) * 2 ) && \
338 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \
339 ( ( (n_file_size) >= (n_block_size) ) && \
340 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \
343 /* Another strategy for tails, this one means only create a tail if all the
344 file would fit into one DIRECT item.
345 Primary intention for this one is to increase performance by decreasing
348 #define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \
350 (!(n_tail_size)) || \
351 (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \
355 * values for s_umount_state field
357 #define REISERFS_VALID_FS 1
358 #define REISERFS_ERROR_FS 2
361 // there are 5 item types currently
363 #define TYPE_STAT_DATA 0
364 #define TYPE_INDIRECT 1
365 #define TYPE_DIRECT 2
366 #define TYPE_DIRENTRY 3
367 #define TYPE_MAXTYPE 3
368 #define TYPE_ANY 15 // FIXME: comment is required
370 /***************************************************************************/
371 /* KEY & ITEM HEAD */
372 /***************************************************************************/
375 // directories use this key as well as old files
380 } __attribute__ ((__packed__));
384 } __attribute__ ((__packed__));
386 static inline __u16 offset_v2_k_type(const struct offset_v2 *v2)
388 __u8 type = le64_to_cpu(v2->v) >> 60;
389 return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY;
392 static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type)
395 (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60);
398 static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2)
400 return le64_to_cpu(v2->v) & (~0ULL >> 4);
403 static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset)
405 offset &= (~0ULL >> 4);
406 v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset);
409 /* Key of an item determines its location in the S+tree, and
410 is composed of 4 components */
411 struct reiserfs_key {
412 __le32 k_dir_id; /* packing locality: by default parent
413 directory object id */
414 __le32 k_objectid; /* object identifier */
416 struct offset_v1 k_offset_v1;
417 struct offset_v2 k_offset_v2;
418 } __attribute__ ((__packed__)) u;
419 } __attribute__ ((__packed__));
422 __u32 k_dir_id; /* packing locality: by default parent
423 directory object id */
424 __u32 k_objectid; /* object identifier */
430 struct in_core_key on_disk_key;
432 int key_length; /* 3 in all cases but direct2indirect and
433 indirect2direct conversion */
436 /* Our function for comparing keys can compare keys of different
437 lengths. It takes as a parameter the length of the keys it is to
438 compare. These defines are used in determining what is to be passed
439 to it as that parameter. */
440 #define REISERFS_FULL_KEY_LEN 4
441 #define REISERFS_SHORT_KEY_LEN 2
443 /* The result of the key compare */
444 #define FIRST_GREATER 1
445 #define SECOND_GREATER -1
446 #define KEYS_IDENTICAL 0
448 #define KEY_NOT_FOUND 0
450 #define KEY_SIZE (sizeof(struct reiserfs_key))
451 #define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32))
453 /* return values for search_by_key and clones */
455 #define ITEM_NOT_FOUND 0
456 #define ENTRY_FOUND 1
457 #define ENTRY_NOT_FOUND 0
458 #define DIRECTORY_NOT_FOUND -1
459 #define REGULAR_FILE_FOUND -2
460 #define DIRECTORY_FOUND -3
462 #define BYTE_NOT_FOUND 0
463 #define FILE_NOT_FOUND -1
465 #define POSITION_FOUND 1
466 #define POSITION_NOT_FOUND 0
468 // return values for reiserfs_find_entry and search_by_entry_key
470 #define NAME_NOT_FOUND 0
471 #define GOTO_PREVIOUS_ITEM 2
472 #define NAME_FOUND_INVISIBLE 3
474 /* Everything in the filesystem is stored as a set of items. The
475 item head contains the key of the item, its free space (for
476 indirect items) and specifies the location of the item itself
480 /* Everything in the tree is found by searching for it based on
482 struct reiserfs_key ih_key;
484 /* The free space in the last unformatted node of an
485 indirect item if this is an indirect item. This
486 equals 0xFFFF iff this is a direct item or stat data
487 item. Note that the key, not this field, is used to
488 determine the item type, and thus which field this
490 __le16 ih_free_space_reserved;
491 /* Iff this is a directory item, this field equals the
492 number of directory entries in the directory item. */
493 __le16 ih_entry_count;
494 } __attribute__ ((__packed__)) u;
495 __le16 ih_item_len; /* total size of the item body */
496 __le16 ih_item_location; /* an offset to the item body
497 * within the block */
498 __le16 ih_version; /* 0 for all old items, 2 for new
499 ones. Highest bit is set by fsck
500 temporary, cleaned after all
502 } __attribute__ ((__packed__));
503 /* size of item header */
504 #define IH_SIZE (sizeof(struct item_head))
506 #define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved)
507 #define ih_version(ih) le16_to_cpu((ih)->ih_version)
508 #define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count)
509 #define ih_location(ih) le16_to_cpu((ih)->ih_item_location)
510 #define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len)
512 #define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0)
513 #define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0)
514 #define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0)
515 #define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0)
516 #define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0)
518 #define unreachable_item(ih) (ih_version(ih) & (1 << 15))
520 #define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih))
521 #define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val)))
523 /* these operate on indirect items, where you've got an array of ints
524 ** at a possibly unaligned location. These are a noop on ia32
526 ** p is the array of __u32, i is the index into the array, v is the value
529 #define get_block_num(p, i) get_unaligned_le32((p) + (i))
530 #define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i))
533 // in old version uniqueness field shows key type
535 #define V1_SD_UNIQUENESS 0
536 #define V1_INDIRECT_UNIQUENESS 0xfffffffe
537 #define V1_DIRECT_UNIQUENESS 0xffffffff
538 #define V1_DIRENTRY_UNIQUENESS 500
539 #define V1_ANY_UNIQUENESS 555 // FIXME: comment is required
542 // here are conversion routines
544 static inline int uniqueness2type(__u32 uniqueness) CONSTF;
545 static inline int uniqueness2type(__u32 uniqueness)
547 switch ((int)uniqueness) {
548 case V1_SD_UNIQUENESS:
549 return TYPE_STAT_DATA;
550 case V1_INDIRECT_UNIQUENESS:
551 return TYPE_INDIRECT;
552 case V1_DIRECT_UNIQUENESS:
554 case V1_DIRENTRY_UNIQUENESS:
555 return TYPE_DIRENTRY;
557 reiserfs_warning(NULL, "vs-500: unknown uniqueness %d",
559 case V1_ANY_UNIQUENESS:
564 static inline __u32 type2uniqueness(int type) CONSTF;
565 static inline __u32 type2uniqueness(int type)
569 return V1_SD_UNIQUENESS;
571 return V1_INDIRECT_UNIQUENESS;
573 return V1_DIRECT_UNIQUENESS;
575 return V1_DIRENTRY_UNIQUENESS;
577 reiserfs_warning(NULL, "vs-501: unknown type %d", type);
579 return V1_ANY_UNIQUENESS;
584 // key is pointer to on disk key which is stored in le, result is cpu,
585 // there is no way to get version of object from key, so, provide
586 // version to these defines
588 static inline loff_t le_key_k_offset(int version,
589 const struct reiserfs_key *key)
591 return (version == KEY_FORMAT_3_5) ?
592 le32_to_cpu(key->u.k_offset_v1.k_offset) :
593 offset_v2_k_offset(&(key->u.k_offset_v2));
596 static inline loff_t le_ih_k_offset(const struct item_head *ih)
598 return le_key_k_offset(ih_version(ih), &(ih->ih_key));
601 static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key)
603 return (version == KEY_FORMAT_3_5) ?
604 uniqueness2type(le32_to_cpu(key->u.k_offset_v1.k_uniqueness)) :
605 offset_v2_k_type(&(key->u.k_offset_v2));
608 static inline loff_t le_ih_k_type(const struct item_head *ih)
610 return le_key_k_type(ih_version(ih), &(ih->ih_key));
613 static inline void set_le_key_k_offset(int version, struct reiserfs_key *key,
616 (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_offset = cpu_to_le32(offset)) : /* jdm check */
617 (void)(set_offset_v2_k_offset(&(key->u.k_offset_v2), offset));
620 static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset)
622 set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset);
625 static inline void set_le_key_k_type(int version, struct reiserfs_key *key,
628 (version == KEY_FORMAT_3_5) ?
629 (void)(key->u.k_offset_v1.k_uniqueness =
630 cpu_to_le32(type2uniqueness(type)))
631 : (void)(set_offset_v2_k_type(&(key->u.k_offset_v2), type));
633 static inline void set_le_ih_k_type(struct item_head *ih, int type)
635 set_le_key_k_type(ih_version(ih), &(ih->ih_key), type);
638 #define is_direntry_le_key(version,key) (le_key_k_type (version, key) == TYPE_DIRENTRY)
639 #define is_direct_le_key(version,key) (le_key_k_type (version, key) == TYPE_DIRECT)
640 #define is_indirect_le_key(version,key) (le_key_k_type (version, key) == TYPE_INDIRECT)
641 #define is_statdata_le_key(version,key) (le_key_k_type (version, key) == TYPE_STAT_DATA)
644 // item header has version.
646 #define is_direntry_le_ih(ih) is_direntry_le_key (ih_version (ih), &((ih)->ih_key))
647 #define is_direct_le_ih(ih) is_direct_le_key (ih_version (ih), &((ih)->ih_key))
648 #define is_indirect_le_ih(ih) is_indirect_le_key (ih_version(ih), &((ih)->ih_key))
649 #define is_statdata_le_ih(ih) is_statdata_le_key (ih_version (ih), &((ih)->ih_key))
652 // key is pointer to cpu key, result is cpu
654 static inline loff_t cpu_key_k_offset(const struct cpu_key *key)
656 return key->on_disk_key.k_offset;
659 static inline loff_t cpu_key_k_type(const struct cpu_key *key)
661 return key->on_disk_key.k_type;
664 static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset)
666 key->on_disk_key.k_offset = offset;
669 static inline void set_cpu_key_k_type(struct cpu_key *key, int type)
671 key->on_disk_key.k_type = type;
674 static inline void cpu_key_k_offset_dec(struct cpu_key *key)
676 key->on_disk_key.k_offset--;
679 #define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY)
680 #define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT)
681 #define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT)
682 #define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA)
684 /* are these used ? */
685 #define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key)))
686 #define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key)))
687 #define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key)))
688 #define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key)))
690 #define I_K_KEY_IN_ITEM(p_s_ih, p_s_key, n_blocksize) \
691 ( ! COMP_SHORT_KEYS(p_s_ih, p_s_key) && \
692 I_OFF_BYTE_IN_ITEM(p_s_ih, k_offset (p_s_key), n_blocksize) )
694 /* maximal length of item */
695 #define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
696 #define MIN_ITEM_LEN 1
698 /* object identifier for root dir */
699 #define REISERFS_ROOT_OBJECTID 2
700 #define REISERFS_ROOT_PARENT_OBJECTID 1
702 extern struct reiserfs_key root_key;
703 #endif /* __KERNEL__ */
706 * Picture represents a leaf of the S+tree
707 * ______________________________________________________
709 * |Block | Object-Item | F r e e | Objects- |
710 * | head | Headers | S p a c e | Items |
711 * |______|_______________|___________________|___________|
714 /* Header of a disk block. More precisely, header of a formatted leaf
715 or internal node, and not the header of an unformatted node. */
717 __le16 blk_level; /* Level of a block in the tree. */
718 __le16 blk_nr_item; /* Number of keys/items in a block. */
719 __le16 blk_free_space; /* Block free space in bytes. */
721 /* dump this in v4/planA */
722 struct reiserfs_key blk_right_delim_key; /* kept only for compatibility */
725 #define BLKH_SIZE (sizeof(struct block_head))
726 #define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level))
727 #define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item))
728 #define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space))
729 #define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved))
730 #define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val))
731 #define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val))
732 #define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val))
733 #define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val))
734 #define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key)
735 #define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val)
738 * values for blk_level field of the struct block_head
741 #define FREE_LEVEL 0 /* when node gets removed from the tree its
742 blk_level is set to FREE_LEVEL. It is then
743 used to see whether the node is still in the
746 #define DISK_LEAF_NODE_LEVEL 1 /* Leaf node level. */
748 /* Given the buffer head of a formatted node, resolve to the block head of that node. */
749 #define B_BLK_HEAD(p_s_bh) ((struct block_head *)((p_s_bh)->b_data))
750 /* Number of items that are in buffer. */
751 #define B_NR_ITEMS(p_s_bh) (blkh_nr_item(B_BLK_HEAD(p_s_bh)))
752 #define B_LEVEL(p_s_bh) (blkh_level(B_BLK_HEAD(p_s_bh)))
753 #define B_FREE_SPACE(p_s_bh) (blkh_free_space(B_BLK_HEAD(p_s_bh)))
755 #define PUT_B_NR_ITEMS(p_s_bh,val) do { set_blkh_nr_item(B_BLK_HEAD(p_s_bh),val); } while (0)
756 #define PUT_B_LEVEL(p_s_bh,val) do { set_blkh_level(B_BLK_HEAD(p_s_bh),val); } while (0)
757 #define PUT_B_FREE_SPACE(p_s_bh,val) do { set_blkh_free_space(B_BLK_HEAD(p_s_bh),val); } while (0)
759 /* Get right delimiting key. -- little endian */
760 #define B_PRIGHT_DELIM_KEY(p_s_bh) (&(blk_right_delim_key(B_BLK_HEAD(p_s_bh))))
762 /* Does the buffer contain a disk leaf. */
763 #define B_IS_ITEMS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) == DISK_LEAF_NODE_LEVEL)
765 /* Does the buffer contain a disk internal node */
766 #define B_IS_KEYS_LEVEL(p_s_bh) (B_LEVEL(p_s_bh) > DISK_LEAF_NODE_LEVEL \
767 && B_LEVEL(p_s_bh) <= MAX_HEIGHT)
769 /***************************************************************************/
771 /***************************************************************************/
774 // old stat data is 32 bytes long. We are going to distinguish new one by
777 struct stat_data_v1 {
778 __le16 sd_mode; /* file type, permissions */
779 __le16 sd_nlink; /* number of hard links */
780 __le16 sd_uid; /* owner */
781 __le16 sd_gid; /* group */
782 __le32 sd_size; /* file size */
783 __le32 sd_atime; /* time of last access */
784 __le32 sd_mtime; /* time file was last modified */
785 __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */
788 __le32 sd_blocks; /* number of blocks file uses */
789 } __attribute__ ((__packed__)) u;
790 __le32 sd_first_direct_byte; /* first byte of file which is stored
791 in a direct item: except that if it
792 equals 1 it is a symlink and if it
793 equals ~(__u32)0 there is no
794 direct item. The existence of this
795 field really grates on me. Let's
796 replace it with a macro based on
797 sd_size and our tail suppression
798 policy. Someday. -Hans */
799 } __attribute__ ((__packed__));
801 #define SD_V1_SIZE (sizeof(struct stat_data_v1))
802 #define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5)
803 #define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
804 #define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
805 #define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink))
806 #define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v))
807 #define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid))
808 #define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v))
809 #define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid))
810 #define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v))
811 #define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size))
812 #define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v))
813 #define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
814 #define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
815 #define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
816 #define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
817 #define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
818 #define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
819 #define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
820 #define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
821 #define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks))
822 #define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v))
823 #define sd_v1_first_direct_byte(sdp) \
824 (le32_to_cpu((sdp)->sd_first_direct_byte))
825 #define set_sd_v1_first_direct_byte(sdp,v) \
826 ((sdp)->sd_first_direct_byte = cpu_to_le32(v))
828 /* inode flags stored in sd_attrs (nee sd_reserved) */
830 /* we want common flags to have the same values as in ext2,
831 so chattr(1) will work without problems */
832 #define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL
833 #define REISERFS_APPEND_FL FS_APPEND_FL
834 #define REISERFS_SYNC_FL FS_SYNC_FL
835 #define REISERFS_NOATIME_FL FS_NOATIME_FL
836 #define REISERFS_NODUMP_FL FS_NODUMP_FL
837 #define REISERFS_SECRM_FL FS_SECRM_FL
838 #define REISERFS_UNRM_FL FS_UNRM_FL
839 #define REISERFS_COMPR_FL FS_COMPR_FL
840 #define REISERFS_NOTAIL_FL FS_NOTAIL_FL
842 /* persistent flags that file inherits from the parent directory */
843 #define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \
845 REISERFS_NOATIME_FL | \
846 REISERFS_NODUMP_FL | \
847 REISERFS_SECRM_FL | \
848 REISERFS_COMPR_FL | \
851 /* Stat Data on disk (reiserfs version of UFS disk inode minus the
854 __le16 sd_mode; /* file type, permissions */
855 __le16 sd_attrs; /* persistent inode flags */
856 __le32 sd_nlink; /* number of hard links */
857 __le64 sd_size; /* file size */
858 __le32 sd_uid; /* owner */
859 __le32 sd_gid; /* group */
860 __le32 sd_atime; /* time of last access */
861 __le32 sd_mtime; /* time file was last modified */
862 __le32 sd_ctime; /* time inode (stat data) was last changed (except changes to sd_atime and sd_mtime) */
866 __le32 sd_generation;
867 //__le32 sd_first_direct_byte;
868 /* first byte of file which is stored in a
869 direct item: except that if it equals 1
870 it is a symlink and if it equals
871 ~(__u32)0 there is no direct item. The
872 existence of this field really grates
873 on me. Let's replace it with a macro
874 based on sd_size and our tail
875 suppression policy? */
876 } __attribute__ ((__packed__)) u;
877 } __attribute__ ((__packed__));
879 // this is 44 bytes long
881 #define SD_SIZE (sizeof(struct stat_data))
882 #define SD_V2_SIZE SD_SIZE
883 #define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6)
884 #define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
885 #define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
887 /* set_sd_reserved */
888 #define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink))
889 #define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v))
890 #define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size))
891 #define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v))
892 #define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid))
893 #define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v))
894 #define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid))
895 #define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v))
896 #define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
897 #define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
898 #define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
899 #define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
900 #define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
901 #define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
902 #define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks))
903 #define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v))
904 #define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
905 #define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
906 #define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation))
907 #define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v))
908 #define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs))
909 #define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v))
911 /***************************************************************************/
912 /* DIRECTORY STRUCTURE */
913 /***************************************************************************/
915 Picture represents the structure of directory items
916 ________________________________________________
917 | Array of | | | | | |
918 | directory |N-1| N-2 | .... | 1st |0th|
919 | entry headers | | | | | |
920 |_______________|___|_____|________|_______|___|
921 <---- directory entries ------>
923 First directory item has k_offset component 1. We store "." and ".."
924 in one item, always, we never split "." and ".." into differing
925 items. This makes, among other things, the code for removing
926 directories simpler. */
928 #define SD_UNIQUENESS 0
930 #define DOT_DOT_OFFSET 2
931 #define DIRENTRY_UNIQUENESS 500
934 #define FIRST_ITEM_OFFSET 1
937 Q: How to get key of object pointed to by entry from entry?
939 A: Each directory entry has its header. This header has deh_dir_id and deh_objectid fields, those are key
940 of object, entry points to */
943 Directory will someday contain stat data of object */
945 struct reiserfs_de_head {
946 __le32 deh_offset; /* third component of the directory entry key */
947 __le32 deh_dir_id; /* objectid of the parent directory of the object, that is referenced
948 by directory entry */
949 __le32 deh_objectid; /* objectid of the object, that is referenced by directory entry */
950 __le16 deh_location; /* offset of name in the whole item */
951 __le16 deh_state; /* whether 1) entry contains stat data (for future), and 2) whether
952 entry is hidden (unlinked) */
953 } __attribute__ ((__packed__));
954 #define DEH_SIZE sizeof(struct reiserfs_de_head)
955 #define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset))
956 #define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id))
957 #define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid))
958 #define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location))
959 #define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state))
961 #define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v)))
962 #define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v)))
963 #define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v)))
964 #define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v)))
965 #define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v)))
967 /* empty directory contains two entries "." and ".." and their headers */
968 #define EMPTY_DIR_SIZE \
969 (DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen ("..")))
971 /* old format directories have this size when empty */
972 #define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3)
974 #define DEH_Statdata 0 /* not used now */
975 #define DEH_Visible 2
977 /* 64 bit systems (and the S/390) need to be aligned explicitly -jdm */
978 #if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__)
979 # define ADDR_UNALIGNED_BITS (3)
982 /* These are only used to manipulate deh_state.
983 * Because of this, we'll use the ext2_ bit routines,
984 * since they are little endian */
985 #ifdef ADDR_UNALIGNED_BITS
987 # define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1)))
988 # define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3)
990 # define set_bit_unaligned(nr, addr) ext2_set_bit((nr) + unaligned_offset(addr), aligned_address(addr))
991 # define clear_bit_unaligned(nr, addr) ext2_clear_bit((nr) + unaligned_offset(addr), aligned_address(addr))
992 # define test_bit_unaligned(nr, addr) ext2_test_bit((nr) + unaligned_offset(addr), aligned_address(addr))
996 # define set_bit_unaligned(nr, addr) ext2_set_bit(nr, addr)
997 # define clear_bit_unaligned(nr, addr) ext2_clear_bit(nr, addr)
998 # define test_bit_unaligned(nr, addr) ext2_test_bit(nr, addr)
1002 #define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1003 #define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1004 #define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1005 #define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1007 #define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1008 #define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1009 #define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1012 extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
1013 __le32 par_dirid, __le32 par_objid);
1014 extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
1015 __le32 par_dirid, __le32 par_objid);
1016 #endif /* __KERNEL__ */
1018 /* array of the entry headers */
1020 #define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) )
1021 #define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih)))
1023 /* length of the directory entry in directory item. This define
1024 calculates length of i-th directory entry using directory entry
1025 locations from dir entry head. When it calculates length of 0-th
1026 directory entry, it uses length of whole item in place of entry
1027 location of the non-existent following entry in the calculation.
1028 See picture above.*/
1030 #define I_DEH_N_ENTRY_LENGTH(ih,deh,i) \
1031 ((i) ? (deh_location((deh)-1) - deh_location((deh))) : (ih_item_len((ih)) - deh_location((deh))))
1033 static inline int entry_length(const struct buffer_head *bh,
1034 const struct item_head *ih, int pos_in_item)
1036 struct reiserfs_de_head *deh;
1038 deh = B_I_DEH(bh, ih) + pos_in_item;
1040 return deh_location(deh - 1) - deh_location(deh);
1042 return ih_item_len(ih) - deh_location(deh);
1045 /* number of entries in the directory item, depends on ENTRY_COUNT being at the start of directory dynamic data. */
1046 #define I_ENTRY_COUNT(ih) (ih_entry_count((ih)))
1048 /* name by bh, ih and entry_num */
1049 #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))))
1051 // two entries per block (at least)
1052 #define REISERFS_MAX_NAME(block_size) 255
1054 /* this structure is used for operations on directory entries. It is
1055 not a disk structure. */
1056 /* When reiserfs_find_entry or search_by_entry_key find directory
1057 entry, they return filled reiserfs_dir_entry structure */
1058 struct reiserfs_dir_entry {
1059 struct buffer_head *de_bh;
1061 struct item_head *de_ih;
1063 struct reiserfs_de_head *de_deh;
1067 unsigned long *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))
1084 /* hash value occupies bits from 7 up to 30 */
1085 #define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL)
1086 /* generation number occupies 7 bits starting from 0 up to 6 */
1087 #define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL)
1088 #define MAX_GENERATION_NUMBER 127
1090 #define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number))
1093 * Picture represents an internal node of the reiserfs tree
1094 * ______________________________________________________
1095 * | | Array of | Array of | Free |
1096 * |block | keys | pointers | space |
1097 * | head | N | N+1 | |
1098 * |______|_______________|___________________|___________|
1101 /***************************************************************************/
1103 /***************************************************************************/
1104 /* Disk child pointer: The pointer from an internal node of the tree
1105 to a node that is on disk. */
1107 __le32 dc_block_number; /* Disk child's block number. */
1108 __le16 dc_size; /* Disk child's used space. */
1112 #define DC_SIZE (sizeof(struct disk_child))
1113 #define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number))
1114 #define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size))
1115 #define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0)
1116 #define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0)
1118 /* Get disk child by buffer header and position in the tree node. */
1119 #define B_N_CHILD(p_s_bh,n_pos) ((struct disk_child *)\
1120 ((p_s_bh)->b_data+BLKH_SIZE+B_NR_ITEMS(p_s_bh)*KEY_SIZE+DC_SIZE*(n_pos)))
1122 /* Get disk child number by buffer header and position in the tree node. */
1123 #define B_N_CHILD_NUM(p_s_bh,n_pos) (dc_block_number(B_N_CHILD(p_s_bh,n_pos)))
1124 #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 ))
1126 /* maximal value of field child_size in structure disk_child */
1127 /* child size is the combined size of all items and their headers */
1128 #define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
1130 /* amount of used space in buffer (not including block head) */
1131 #define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
1133 /* max and min number of keys in internal node */
1134 #define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
1135 #define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2)
1137 /***************************************************************************/
1138 /* PATH STRUCTURES AND DEFINES */
1139 /***************************************************************************/
1141 /* Search_by_key fills up the path from the root to the leaf as it descends the tree looking for the
1142 key. It uses reiserfs_bread to try to find buffers in the cache given their block number. If it
1143 does not find them in the cache it reads them from disk. For each node search_by_key finds using
1144 reiserfs_bread it then uses bin_search to look through that node. bin_search will find the
1145 position of the block_number of the next node if it is looking through an internal node. If it
1146 is looking through a leaf node bin_search will find the position of the item which has key either
1147 equal to given key, or which is the maximal key less than the given key. */
1149 struct path_element {
1150 struct buffer_head *pe_buffer; /* Pointer to the buffer at the path in the tree. */
1151 int pe_position; /* Position in the tree node which is placed in the */
1155 #define MAX_HEIGHT 5 /* maximal height of a tree. don't change this without changing JOURNAL_PER_BALANCE_CNT */
1156 #define EXTENDED_MAX_HEIGHT 7 /* Must be equals MAX_HEIGHT + FIRST_PATH_ELEMENT_OFFSET */
1157 #define FIRST_PATH_ELEMENT_OFFSET 2 /* Must be equal to at least 2. */
1159 #define ILLEGAL_PATH_ELEMENT_OFFSET 1 /* Must be equal to FIRST_PATH_ELEMENT_OFFSET - 1 */
1160 #define MAX_FEB_SIZE 6 /* this MUST be MAX_HEIGHT + 1. See about FEB below */
1162 /* We need to keep track of who the ancestors of nodes are. When we
1163 perform a search we record which nodes were visited while
1164 descending the tree looking for the node we searched for. This list
1165 of nodes is called the path. This information is used while
1166 performing balancing. Note that this path information may become
1167 invalid, and this means we must check it when using it to see if it
1168 is still valid. You'll need to read search_by_key and the comments
1169 in it, especially about decrement_counters_in_path(), to understand
1172 Paths make the code so much harder to work with and debug.... An
1173 enormous number of bugs are due to them, and trying to write or modify
1174 code that uses them just makes my head hurt. They are based on an
1175 excessive effort to avoid disturbing the precious VFS code.:-( The
1176 gods only know how we are going to SMP the code that uses them.
1177 znodes are the way! */
1179 #define PATH_READA 0x1 /* do read ahead */
1180 #define PATH_READA_BACK 0x2 /* read backwards */
1183 int path_length; /* Length of the array above. */
1185 struct path_element path_elements[EXTENDED_MAX_HEIGHT]; /* Array of the path elements. */
1189 #define pos_in_item(path) ((path)->pos_in_item)
1191 #define INITIALIZE_PATH(var) \
1192 struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
1194 /* Get path element by path and path position. */
1195 #define PATH_OFFSET_PELEMENT(p_s_path,n_offset) ((p_s_path)->path_elements +(n_offset))
1197 /* Get buffer header at the path by path and path position. */
1198 #define PATH_OFFSET_PBUFFER(p_s_path,n_offset) (PATH_OFFSET_PELEMENT(p_s_path,n_offset)->pe_buffer)
1200 /* Get position in the element at the path by path and path position. */
1201 #define PATH_OFFSET_POSITION(p_s_path,n_offset) (PATH_OFFSET_PELEMENT(p_s_path,n_offset)->pe_position)
1203 #define PATH_PLAST_BUFFER(p_s_path) (PATH_OFFSET_PBUFFER((p_s_path), (p_s_path)->path_length))
1204 /* you know, to the person who didn't
1205 write this the macro name does not
1206 at first suggest what it does.
1207 Maybe POSITION_FROM_PATH_END? Or
1208 maybe we should just focus on
1209 dumping paths... -Hans */
1210 #define PATH_LAST_POSITION(p_s_path) (PATH_OFFSET_POSITION((p_s_path), (p_s_path)->path_length))
1212 #define PATH_PITEM_HEAD(p_s_path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(p_s_path),PATH_LAST_POSITION(p_s_path))
1214 /* in do_balance leaf has h == 0 in contrast with path structure,
1215 where root has level == 0. That is why we need these defines */
1216 #define PATH_H_PBUFFER(p_s_path, h) PATH_OFFSET_PBUFFER (p_s_path, p_s_path->path_length - (h)) /* tb->S[h] */
1217 #define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1) /* tb->F[h] or tb->S[0]->b_parent */
1218 #define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h))
1219 #define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1) /* tb->S[h]->b_item_order */
1221 #define PATH_H_PATH_OFFSET(p_s_path, n_h) ((p_s_path)->path_length - (n_h))
1223 #define get_last_bh(path) PATH_PLAST_BUFFER(path)
1224 #define get_ih(path) PATH_PITEM_HEAD(path)
1225 #define get_item_pos(path) PATH_LAST_POSITION(path)
1226 #define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path)))
1227 #define item_moved(ih,path) comp_items(ih, path)
1228 #define path_changed(ih,path) comp_items (ih, path)
1230 /***************************************************************************/
1232 /***************************************************************************/
1234 /* Size of pointer to the unformatted node. */
1235 #define UNFM_P_SIZE (sizeof(unp_t))
1236 #define UNFM_P_SHIFT 2
1238 // in in-core inode key is stored on le form
1239 #define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key))
1241 #define MAX_UL_INT 0xffffffff
1242 #define MAX_INT 0x7ffffff
1243 #define MAX_US_INT 0xffff
1245 // reiserfs version 2 has max offset 60 bits. Version 1 - 32 bit offset
1246 #define U32_MAX (~(__u32)0)
1248 static inline loff_t max_reiserfs_offset(struct inode *inode)
1250 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5)
1251 return (loff_t) U32_MAX;
1253 return (loff_t) ((~(__u64) 0) >> 4);
1256 /*#define MAX_KEY_UNIQUENESS MAX_UL_INT*/
1257 #define MAX_KEY_OBJECTID MAX_UL_INT
1259 #define MAX_B_NUM MAX_UL_INT
1260 #define MAX_FC_NUM MAX_US_INT
1262 /* the purpose is to detect overflow of an unsigned short */
1263 #define REISERFS_LINK_MAX (MAX_US_INT - 1000)
1265 /* The following defines are used in reiserfs_insert_item and reiserfs_append_item */
1266 #define REISERFS_KERNEL_MEM 0 /* reiserfs kernel memory mode */
1267 #define REISERFS_USER_MEM 1 /* reiserfs user memory mode */
1269 #define fs_generation(s) (REISERFS_SB(s)->s_generation_counter)
1270 #define get_generation(s) atomic_read (&fs_generation(s))
1271 #define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen)
1272 #define __fs_changed(gen,s) (gen != get_generation (s))
1273 #define fs_changed(gen,s) ({cond_resched(); __fs_changed(gen, s);})
1275 /***************************************************************************/
1277 /***************************************************************************/
1279 #define VI_TYPE_LEFT_MERGEABLE 1
1280 #define VI_TYPE_RIGHT_MERGEABLE 2
1282 /* To make any changes in the tree we always first find node, that
1283 contains item to be changed/deleted or place to insert a new
1284 item. We call this node S. To do balancing we need to decide what
1285 we will shift to left/right neighbor, or to a new node, where new
1286 item will be etc. To make this analysis simpler we build virtual
1287 node. Virtual node is an array of items, that will replace items of
1288 node S. (For instance if we are going to delete an item, virtual
1289 node does not contain it). Virtual node keeps information about
1290 item sizes and types, mergeability of first and last items, sizes
1291 of all entries in directory item. We use this array of items when
1292 calculating what we can shift to neighbors and how many nodes we
1293 have to have if we do not any shiftings, if we shift to left/right
1294 neighbor or to both. */
1295 struct virtual_item {
1296 int vi_index; // index in the array of item operations
1297 unsigned short vi_type; // left/right mergeability
1298 unsigned short vi_item_len; /* length of item that it will have after balancing */
1299 struct item_head *vi_ih;
1300 const char *vi_item; // body of item (old or new)
1301 const void *vi_new_data; // 0 always but paste mode
1302 void *vi_uarea; // item specific area
1305 struct virtual_node {
1306 char *vn_free_ptr; /* this is a pointer to the free space in the buffer */
1307 unsigned short vn_nr_item; /* number of items in virtual node */
1308 short vn_size; /* size of node , that node would have if it has unlimited size and no balancing is performed */
1309 short vn_mode; /* mode of balancing (paste, insert, delete, cut) */
1310 short vn_affected_item_num;
1311 short vn_pos_in_item;
1312 struct item_head *vn_ins_ih; /* item header of inserted item, 0 for other modes */
1313 const void *vn_data;
1314 struct virtual_item *vn_vi; /* array of items (including a new one, excluding item to be deleted) */
1317 /* used by directory items when creating virtual nodes */
1318 struct direntry_uarea {
1321 __u16 entry_sizes[1];
1322 } __attribute__ ((__packed__));
1324 /***************************************************************************/
1326 /***************************************************************************/
1328 /* This temporary structure is used in tree balance algorithms, and
1329 constructed as we go to the extent that its various parts are
1330 needed. It contains arrays of nodes that can potentially be
1331 involved in the balancing of node S, and parameters that define how
1332 each of the nodes must be balanced. Note that in these algorithms
1333 for balancing the worst case is to need to balance the current node
1334 S and the left and right neighbors and all of their parents plus
1335 create a new node. We implement S1 balancing for the leaf nodes
1336 and S0 balancing for the internal nodes (S1 and S0 are defined in
1339 #define MAX_FREE_BLOCK 7 /* size of the array of buffers to free at end of do_balance */
1341 /* maximum number of FEB blocknrs on a single level */
1342 #define MAX_AMOUNT_NEEDED 2
1344 /* someday somebody will prefix every field in this struct with tb_ */
1345 struct tree_balance {
1347 int need_balance_dirty;
1348 struct super_block *tb_sb;
1349 struct reiserfs_transaction_handle *transaction_handle;
1350 struct treepath *tb_path;
1351 struct buffer_head *L[MAX_HEIGHT]; /* array of left neighbors of nodes in the path */
1352 struct buffer_head *R[MAX_HEIGHT]; /* array of right neighbors of nodes in the path */
1353 struct buffer_head *FL[MAX_HEIGHT]; /* array of fathers of the left neighbors */
1354 struct buffer_head *FR[MAX_HEIGHT]; /* array of fathers of the right neighbors */
1355 struct buffer_head *CFL[MAX_HEIGHT]; /* array of common parents of center node and its left neighbor */
1356 struct buffer_head *CFR[MAX_HEIGHT]; /* array of common parents of center node and its right neighbor */
1358 struct buffer_head *FEB[MAX_FEB_SIZE]; /* array of empty buffers. Number of buffers in array equals
1360 struct buffer_head *used[MAX_FEB_SIZE];
1361 struct buffer_head *thrown[MAX_FEB_SIZE];
1362 int lnum[MAX_HEIGHT]; /* array of number of items which must be
1363 shifted to the left in order to balance the
1364 current node; for leaves includes item that
1365 will be partially shifted; for internal
1366 nodes, it is the number of child pointers
1367 rather than items. It includes the new item
1368 being created. The code sometimes subtracts
1369 one to get the number of wholly shifted
1370 items for other purposes. */
1371 int rnum[MAX_HEIGHT]; /* substitute right for left in comment above */
1372 int lkey[MAX_HEIGHT]; /* array indexed by height h mapping the key delimiting L[h] and
1373 S[h] to its item number within the node CFL[h] */
1374 int rkey[MAX_HEIGHT]; /* substitute r for l in comment above */
1375 int insert_size[MAX_HEIGHT]; /* the number of bytes by we are trying to add or remove from
1376 S[h]. A negative value means removing. */
1377 int blknum[MAX_HEIGHT]; /* number of nodes that will replace node S[h] after
1378 balancing on the level h of the tree. If 0 then S is
1379 being deleted, if 1 then S is remaining and no new nodes
1380 are being created, if 2 or 3 then 1 or 2 new nodes is
1383 /* fields that are used only for balancing leaves of the tree */
1384 int cur_blknum; /* number of empty blocks having been already allocated */
1385 int s0num; /* number of items that fall into left most node when S[0] splits */
1386 int s1num; /* number of items that fall into first new node when S[0] splits */
1387 int s2num; /* number of items that fall into second new node when S[0] splits */
1388 int lbytes; /* number of bytes which can flow to the left neighbor from the left */
1389 /* most liquid item that cannot be shifted from S[0] entirely */
1390 /* if -1 then nothing will be partially shifted */
1391 int rbytes; /* number of bytes which will flow to the right neighbor from the right */
1392 /* most liquid item that cannot be shifted from S[0] entirely */
1393 /* if -1 then nothing will be partially shifted */
1394 int s1bytes; /* number of bytes which flow to the first new node when S[0] splits */
1395 /* note: if S[0] splits into 3 nodes, then items do not need to be cut */
1397 struct buffer_head *buf_to_free[MAX_FREE_BLOCK]; /* buffers which are to be freed after do_balance finishes by unfix_nodes */
1398 char *vn_buf; /* kmalloced memory. Used to create
1399 virtual node and keep map of
1400 dirtied bitmap blocks */
1401 int vn_buf_size; /* size of the vn_buf */
1402 struct virtual_node *tb_vn; /* VN starts after bitmap of bitmap blocks */
1404 int fs_gen; /* saved value of `reiserfs_generation' counter
1405 see FILESYSTEM_CHANGED() macro in reiserfs_fs.h */
1406 #ifdef DISPLACE_NEW_PACKING_LOCALITIES
1407 struct in_core_key key; /* key pointer, to pass to block allocator or
1408 another low-level subsystem */
1412 /* These are modes of balancing */
1414 /* When inserting an item. */
1415 #define M_INSERT 'i'
1416 /* When inserting into (directories only) or appending onto an already
1419 /* When deleting an item. */
1420 #define M_DELETE 'd'
1421 /* When truncating an item or removing an entry from a (directory) item. */
1424 /* used when balancing on leaf level skipped (in reiserfsck) */
1425 #define M_INTERNAL 'n'
1427 /* When further balancing is not needed, then do_balance does not need
1429 #define M_SKIP_BALANCING 's'
1430 #define M_CONVERT 'v'
1432 /* modes of leaf_move_items */
1433 #define LEAF_FROM_S_TO_L 0
1434 #define LEAF_FROM_S_TO_R 1
1435 #define LEAF_FROM_R_TO_L 2
1436 #define LEAF_FROM_L_TO_R 3
1437 #define LEAF_FROM_S_TO_SNEW 4
1439 #define FIRST_TO_LAST 0
1440 #define LAST_TO_FIRST 1
1442 /* used in do_balance for passing parent of node information that has
1443 been gotten from tb struct */
1444 struct buffer_info {
1445 struct tree_balance *tb;
1446 struct buffer_head *bi_bh;
1447 struct buffer_head *bi_parent;
1451 /* there are 4 types of items: stat data, directory item, indirect, direct.
1452 +-------------------+------------+--------------+------------+
1453 | | k_offset | k_uniqueness | mergeable? |
1454 +-------------------+------------+--------------+------------+
1455 | stat data | 0 | 0 | no |
1456 +-------------------+------------+--------------+------------+
1457 | 1st directory item| DOT_OFFSET |DIRENTRY_UNIQUENESS| no |
1458 | non 1st directory | hash value | | yes |
1460 +-------------------+------------+--------------+------------+
1461 | indirect item | offset + 1 |TYPE_INDIRECT | if this is not the first indirect item of the object
1462 +-------------------+------------+--------------+------------+
1463 | direct item | offset + 1 |TYPE_DIRECT | if not this is not the first direct item of the object
1464 +-------------------+------------+--------------+------------+
1467 struct item_operations {
1468 int (*bytes_number) (struct item_head * ih, int block_size);
1469 void (*decrement_key) (struct cpu_key *);
1470 int (*is_left_mergeable) (struct reiserfs_key * ih,
1471 unsigned long bsize);
1472 void (*print_item) (struct item_head *, char *item);
1473 void (*check_item) (struct item_head *, char *item);
1475 int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi,
1476 int is_affected, int insert_size);
1477 int (*check_left) (struct virtual_item * vi, int free,
1478 int start_skip, int end_skip);
1479 int (*check_right) (struct virtual_item * vi, int free);
1480 int (*part_size) (struct virtual_item * vi, int from, int to);
1481 int (*unit_num) (struct virtual_item * vi);
1482 void (*print_vi) (struct virtual_item * vi);
1486 extern struct item_operations *item_ops[TYPE_ANY + 1];
1487 #endif /* __KERNEL__ */
1489 #define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize)
1490 #define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize)
1491 #define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item)
1492 #define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item)
1493 #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)
1494 #define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip)
1495 #define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free)
1496 #define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to)
1497 #define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi)
1498 #define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi)
1500 #define COMP_SHORT_KEYS comp_short_keys
1502 /* number of blocks pointed to by the indirect item */
1503 #define I_UNFM_NUM(p_s_ih) ( ih_item_len(p_s_ih) / UNFM_P_SIZE )
1505 /* the used space within the unformatted node corresponding to pos within the item pointed to by ih */
1506 #define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size))
1508 /* number of bytes contained by the direct item or the unformatted nodes the indirect item points to */
1510 /* get the item header */
1511 #define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1514 #define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1517 #define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) )
1520 #define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num))))
1522 /* get the stat data by the buffer header and the item order */
1523 #define B_N_STAT_DATA(bh,nr) \
1524 ( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) )
1526 /* following defines use reiserfs buffer header and item header */
1529 #define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) )
1531 // this is 3976 for size==4096
1532 #define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
1534 /* indirect items consist of entries which contain blocknrs, pos
1535 indicates which entry, and B_I_POS_UNFM_POINTER resolves to the
1536 blocknr contained by the entry pos points to */
1537 #define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)))
1538 #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)
1540 struct reiserfs_iget_args {
1545 /***************************************************************************/
1546 /* FUNCTION DECLARATIONS */
1547 /***************************************************************************/
1549 /*#ifdef __KERNEL__*/
1550 #define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12)
1552 #define journal_trans_half(blocksize) \
1553 ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32))
1555 /* journal.c see journal.c for all the comments here */
1557 /* first block written in a commit. */
1558 struct reiserfs_journal_desc {
1559 __le32 j_trans_id; /* id of commit */
1560 __le32 j_len; /* length of commit. len +1 is the commit block */
1561 __le32 j_mount_id; /* mount id of this trans */
1562 __le32 j_realblock[1]; /* real locations for each block */
1565 #define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id)
1566 #define get_desc_trans_len(d) le32_to_cpu((d)->j_len)
1567 #define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id)
1569 #define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0)
1570 #define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0)
1571 #define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0)
1573 /* last block written in a commit */
1574 struct reiserfs_journal_commit {
1575 __le32 j_trans_id; /* must match j_trans_id from the desc block */
1576 __le32 j_len; /* ditto */
1577 __le32 j_realblock[1]; /* real locations for each block */
1580 #define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id)
1581 #define get_commit_trans_len(c) le32_to_cpu((c)->j_len)
1582 #define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id)
1584 #define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0)
1585 #define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0)
1587 /* this header block gets written whenever a transaction is considered fully flushed, and is more recent than the
1588 ** last fully flushed transaction. fully flushed means all the log blocks and all the real blocks are on disk,
1589 ** and this transaction does not need to be replayed.
1591 struct reiserfs_journal_header {
1592 __le32 j_last_flush_trans_id; /* id of last fully flushed transaction */
1593 __le32 j_first_unflushed_offset; /* offset in the log of where to start replay after a crash */
1595 /* 12 */ struct journal_params jh_journal;
1598 /* biggest tunable defines are right here */
1599 #define JOURNAL_BLOCK_COUNT 8192 /* number of blocks in the journal */
1600 #define JOURNAL_TRANS_MAX_DEFAULT 1024 /* biggest possible single transaction, don't change for now (8/3/99) */
1601 #define JOURNAL_TRANS_MIN_DEFAULT 256
1602 #define JOURNAL_MAX_BATCH_DEFAULT 900 /* max blocks to batch into one transaction, don't make this any bigger than 900 */
1603 #define JOURNAL_MIN_RATIO 2
1604 #define JOURNAL_MAX_COMMIT_AGE 30
1605 #define JOURNAL_MAX_TRANS_AGE 30
1606 #define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)
1608 /* We need to update data and inode (atime) */
1609 #define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? 2 : 0)
1610 /* 1 balancing, 1 bitmap, 1 data per write + stat data update */
1611 #define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \
1612 (DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0)
1613 /* same as with INIT */
1614 #define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \
1615 (DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0)
1617 #define REISERFS_QUOTA_TRANS_BLOCKS(s) 0
1618 #define REISERFS_QUOTA_INIT_BLOCKS(s) 0
1619 #define REISERFS_QUOTA_DEL_BLOCKS(s) 0
1622 /* both of these can be as low as 1, or as high as you want. The min is the
1623 ** number of 4k bitmap nodes preallocated on mount. New nodes are allocated
1624 ** as needed, and released when transactions are committed. On release, if
1625 ** the current number of nodes is > max, the node is freed, otherwise,
1626 ** it is put on a free list for faster use later.
1628 #define REISERFS_MIN_BITMAP_NODES 10
1629 #define REISERFS_MAX_BITMAP_NODES 100
1631 #define JBH_HASH_SHIFT 13 /* these are based on journal hash size of 8192 */
1632 #define JBH_HASH_MASK 8191
1634 #define _jhashfn(sb,block) \
1635 (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \
1636 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
1637 #define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
1639 // We need these to make journal.c code more readable
1640 #define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1641 #define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1642 #define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1644 enum reiserfs_bh_state_bits {
1645 BH_JDirty = BH_PrivateStart, /* buffer is in current transaction */
1647 BH_JNew, /* disk block was taken off free list before
1648 * being in a finished transaction, or
1649 * written to disk. Can be reused immed. */
1652 BH_JTest, // debugging only will go away
1655 BUFFER_FNS(JDirty, journaled);
1656 TAS_BUFFER_FNS(JDirty, journaled);
1657 BUFFER_FNS(JDirty_wait, journal_dirty);
1658 TAS_BUFFER_FNS(JDirty_wait, journal_dirty);
1659 BUFFER_FNS(JNew, journal_new);
1660 TAS_BUFFER_FNS(JNew, journal_new);
1661 BUFFER_FNS(JPrepared, journal_prepared);
1662 TAS_BUFFER_FNS(JPrepared, journal_prepared);
1663 BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
1664 TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
1665 BUFFER_FNS(JTest, journal_test);
1666 TAS_BUFFER_FNS(JTest, journal_test);
1669 ** transaction handle which is passed around for all journal calls
1671 struct reiserfs_transaction_handle {
1672 struct super_block *t_super; /* super for this FS when journal_begin was
1673 called. saves calls to reiserfs_get_super
1674 also used by nested transactions to make
1675 sure they are nesting on the right FS
1676 _must_ be first in the handle
1679 int t_blocks_logged; /* number of blocks this writer has logged */
1680 int t_blocks_allocated; /* number of blocks this writer allocated */
1681 unsigned long t_trans_id; /* sanity check, equals the current trans id */
1682 void *t_handle_save; /* save existing current->journal_info */
1683 unsigned displace_new_blocks:1; /* if new block allocation occurres, that block
1684 should be displaced from others */
1685 struct list_head t_list;
1689 /* used to keep track of ordered and tail writes, attached to the buffer
1690 * head through b_journal_head.
1692 struct reiserfs_jh {
1693 struct reiserfs_journal_list *jl;
1694 struct buffer_head *bh;
1695 struct list_head list;
1698 void reiserfs_free_jh(struct buffer_head *bh);
1699 int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh);
1700 int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh);
1701 int journal_mark_dirty(struct reiserfs_transaction_handle *,
1702 struct super_block *, struct buffer_head *bh);
1704 static inline int reiserfs_file_data_log(struct inode *inode)
1706 if (reiserfs_data_log(inode->i_sb) ||
1707 (REISERFS_I(inode)->i_flags & i_data_log))
1712 static inline int reiserfs_transaction_running(struct super_block *s)
1714 struct reiserfs_transaction_handle *th = current->journal_info;
1715 if (th && th->t_super == s)
1717 if (th && th->t_super == NULL)
1722 static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th)
1724 return th->t_blocks_allocated - th->t_blocks_logged;
1727 struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct
1731 int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *);
1732 int reiserfs_commit_page(struct inode *inode, struct page *page,
1733 unsigned from, unsigned to);
1734 int reiserfs_flush_old_commits(struct super_block *);
1735 int reiserfs_commit_for_inode(struct inode *);
1736 int reiserfs_inode_needs_commit(struct inode *);
1737 void reiserfs_update_inode_transaction(struct inode *);
1738 void reiserfs_wait_on_write_block(struct super_block *s);
1739 void reiserfs_block_writes(struct reiserfs_transaction_handle *th);
1740 void reiserfs_allow_writes(struct super_block *s);
1741 void reiserfs_check_lock_depth(struct super_block *s, char *caller);
1742 int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh,
1744 void reiserfs_restore_prepared_buffer(struct super_block *,
1745 struct buffer_head *bh);
1746 int journal_init(struct super_block *, const char *j_dev_name, int old_format,
1748 int journal_release(struct reiserfs_transaction_handle *, struct super_block *);
1749 int journal_release_error(struct reiserfs_transaction_handle *,
1750 struct super_block *);
1751 int journal_end(struct reiserfs_transaction_handle *, struct super_block *,
1753 int journal_end_sync(struct reiserfs_transaction_handle *, struct super_block *,
1755 int journal_mark_freed(struct reiserfs_transaction_handle *,
1756 struct super_block *, b_blocknr_t blocknr);
1757 int journal_transaction_should_end(struct reiserfs_transaction_handle *, int);
1758 int reiserfs_in_journal(struct super_block *p_s_sb, unsigned int bmap_nr,
1759 int bit_nr, int searchall, b_blocknr_t *next);
1760 int journal_begin(struct reiserfs_transaction_handle *,
1761 struct super_block *p_s_sb, unsigned long);
1762 int journal_join_abort(struct reiserfs_transaction_handle *,
1763 struct super_block *p_s_sb, unsigned long);
1764 void reiserfs_journal_abort(struct super_block *sb, int errno);
1765 void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...);
1766 int reiserfs_allocate_list_bitmaps(struct super_block *s,
1767 struct reiserfs_list_bitmap *, unsigned int);
1769 void add_save_link(struct reiserfs_transaction_handle *th,
1770 struct inode *inode, int truncate);
1771 int remove_save_link(struct inode *inode, int truncate);
1774 __u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th);
1775 void reiserfs_release_objectid(struct reiserfs_transaction_handle *th,
1776 __u32 objectid_to_release);
1777 int reiserfs_convert_objectid_map_v1(struct super_block *);
1780 int B_IS_IN_TREE(const struct buffer_head *);
1781 extern void copy_item_head(struct item_head *p_v_to,
1782 const struct item_head *p_v_from);
1784 // first key is in cpu form, second - le
1785 extern int comp_short_keys(const struct reiserfs_key *le_key,
1786 const struct cpu_key *cpu_key);
1787 extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from);
1789 // both are in le form
1790 extern int comp_le_keys(const struct reiserfs_key *,
1791 const struct reiserfs_key *);
1792 extern int comp_short_le_keys(const struct reiserfs_key *,
1793 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
1804 && type != TYPE_DIRENTRY)
1805 return KEY_FORMAT_3_5;
1807 return KEY_FORMAT_3_6;
1811 static inline void copy_key(struct reiserfs_key *to,
1812 const struct reiserfs_key *from)
1814 memcpy(to, from, KEY_SIZE);
1817 int comp_items(const struct item_head *stored_ih, const struct treepath *p_s_path);
1818 const struct reiserfs_key *get_rkey(const struct treepath *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 treepath *, 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 treepath *p_s_search_path);
1826 extern void decrement_bcount(struct buffer_head *p_s_bh);
1827 void decrement_counters_in_path(struct treepath *p_s_search_path);
1828 void pathrelse(struct treepath *p_s_search_path);
1829 int reiserfs_check_path(struct treepath *p);
1830 void pathrelse_and_restore(struct super_block *s, struct treepath *p_s_search_path);
1832 int reiserfs_insert_item(struct reiserfs_transaction_handle *th,
1833 struct treepath *path,
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,
1839 struct treepath *path,
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,
1845 struct treepath *path,
1846 struct cpu_key *key,
1847 struct inode *inode,
1848 struct page *page, loff_t new_file_size);
1850 int reiserfs_delete_item(struct reiserfs_transaction_handle *th,
1851 struct treepath *path,
1852 const struct cpu_key *key,
1853 struct inode *inode, struct buffer_head *p_s_un_bh);
1855 void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th,
1856 struct inode *inode, struct reiserfs_key *key);
1857 int reiserfs_delete_object(struct reiserfs_transaction_handle *th,
1858 struct inode *p_s_inode);
1859 int reiserfs_do_truncate(struct reiserfs_transaction_handle *th,
1860 struct inode *p_s_inode, struct page *,
1861 int update_timestamps);
1863 #define i_block_size(inode) ((inode)->i_sb->s_blocksize)
1864 #define file_size(inode) ((inode)->i_size)
1865 #define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1))
1867 #define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\
1868 !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 )
1870 void padd_item(char *item, int total_length, int length);
1873 /* args for the create parameter of reiserfs_get_block */
1874 #define GET_BLOCK_NO_CREATE 0 /* don't create new blocks or convert tails */
1875 #define GET_BLOCK_CREATE 1 /* add anything you need to find block */
1876 #define GET_BLOCK_NO_HOLE 2 /* return -ENOENT for file holes */
1877 #define GET_BLOCK_READ_DIRECT 4 /* read the tail if indirect item not found */
1878 #define GET_BLOCK_NO_IMUX 8 /* i_mutex is not held, don't preallocate */
1879 #define GET_BLOCK_NO_DANGLE 16 /* don't leave any transactions running */
1881 void reiserfs_read_locked_inode(struct inode *inode,
1882 struct reiserfs_iget_args *args);
1883 int reiserfs_find_actor(struct inode *inode, void *p);
1884 int reiserfs_init_locked_inode(struct inode *inode, void *p);
1885 void reiserfs_delete_inode(struct inode *inode);
1886 int reiserfs_write_inode(struct inode *inode, int);
1887 int reiserfs_get_block(struct inode *inode, sector_t block,
1888 struct buffer_head *bh_result, int create);
1889 struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
1890 int fh_len, int fh_type);
1891 struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
1892 int fh_len, int fh_type);
1893 int reiserfs_encode_fh(struct dentry *dentry, __u32 * data, int *lenp,
1896 int reiserfs_truncate_file(struct inode *, int update_timestamps);
1897 void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset,
1898 int type, int key_length);
1899 void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
1901 loff_t offset, int type, int length, int entry_count);
1902 struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key);
1904 int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
1905 struct inode *dir, int mode,
1906 const char *symname, loff_t i_size,
1907 struct dentry *dentry, struct inode *inode);
1909 void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
1910 struct inode *inode, loff_t size);
1912 static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th,
1913 struct inode *inode)
1915 reiserfs_update_sd_size(th, inode, inode->i_size);
1918 void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode);
1919 void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs);
1920 int reiserfs_setattr(struct dentry *dentry, struct iattr *attr);
1923 void set_de_name_and_namelen(struct reiserfs_dir_entry *de);
1924 int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
1925 struct treepath *path, struct reiserfs_dir_entry *de);
1926 struct dentry *reiserfs_get_parent(struct dentry *);
1929 #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )
1930 #define REISERFS_PROC_INFO
1932 #undef REISERFS_PROC_INFO
1935 int reiserfs_proc_info_init(struct super_block *sb);
1936 int reiserfs_proc_info_done(struct super_block *sb);
1937 struct proc_dir_entry *reiserfs_proc_register_global(char *name,
1938 read_proc_t * func);
1939 void reiserfs_proc_unregister_global(const char *name);
1940 int reiserfs_proc_info_global_init(void);
1941 int reiserfs_proc_info_global_done(void);
1942 int reiserfs_global_version_in_proc(char *buffer, char **start, off_t offset,
1943 int count, int *eof, void *data);
1945 #if defined( REISERFS_PROC_INFO )
1947 #define PROC_EXP( e ) e
1949 #define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data
1950 #define PROC_INFO_MAX( sb, field, value ) \
1951 __PINFO( sb ).field = \
1952 max( REISERFS_SB( sb ) -> s_proc_info_data.field, value )
1953 #define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) )
1954 #define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) )
1955 #define PROC_INFO_BH_STAT( sb, bh, level ) \
1956 PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \
1957 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
1958 PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
1960 #define PROC_EXP( e )
1961 #define VOID_V ( ( void ) 0 )
1962 #define PROC_INFO_MAX( sb, field, value ) VOID_V
1963 #define PROC_INFO_INC( sb, field ) VOID_V
1964 #define PROC_INFO_ADD( sb, field, val ) VOID_V
1965 #define PROC_INFO_BH_STAT( p_s_sb, p_s_bh, n_node_level ) VOID_V
1969 extern const struct inode_operations reiserfs_dir_inode_operations;
1970 extern const struct inode_operations reiserfs_symlink_inode_operations;
1971 extern const struct inode_operations reiserfs_special_inode_operations;
1972 extern const struct file_operations reiserfs_dir_operations;
1974 /* tail_conversion.c */
1975 int direct2indirect(struct reiserfs_transaction_handle *, struct inode *,
1976 struct treepath *, struct buffer_head *, loff_t);
1977 int indirect2direct(struct reiserfs_transaction_handle *, struct inode *,
1978 struct page *, struct treepath *, const struct cpu_key *,
1980 void reiserfs_unmap_buffer(struct buffer_head *);
1983 extern const struct inode_operations reiserfs_file_inode_operations;
1984 extern const struct file_operations reiserfs_file_operations;
1985 extern const struct address_space_operations reiserfs_address_space_operations;
1989 int fix_nodes(int n_op_mode, struct tree_balance *p_s_tb,
1990 struct item_head *p_s_ins_ih, const void *);
1991 void unfix_nodes(struct tree_balance *);
1994 void reiserfs_panic(struct super_block *s, const char *fmt, ...)
1995 __attribute__ ((noreturn));
1996 void reiserfs_info(struct super_block *s, const char *fmt, ...);
1997 void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...);
1998 void print_indirect_item(struct buffer_head *bh, int item_num);
1999 void store_print_tb(struct tree_balance *tb);
2000 void print_cur_tb(char *mes);
2001 void print_de(struct reiserfs_dir_entry *de);
2002 void print_bi(struct buffer_info *bi, char *mes);
2003 #define PRINT_LEAF_ITEMS 1 /* print all items */
2004 #define PRINT_DIRECTORY_ITEMS 2 /* print directory items */
2005 #define PRINT_DIRECT_ITEMS 4 /* print contents of direct items */
2006 void print_block(struct buffer_head *bh, ...);
2007 void print_bmap(struct super_block *s, int silent);
2008 void print_bmap_block(int i, char *data, int size, int silent);
2009 /*void print_super_block (struct super_block * s, char * mes);*/
2010 void print_objectid_map(struct super_block *s);
2011 void print_block_head(struct buffer_head *bh, char *mes);
2012 void check_leaf(struct buffer_head *bh);
2013 void check_internal(struct buffer_head *bh);
2014 void print_statistics(struct super_block *s);
2015 char *reiserfs_hashname(int code);
2018 int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
2019 int mov_bytes, struct buffer_head *Snew);
2020 int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
2021 int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
2022 void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first,
2023 int del_num, int del_bytes);
2024 void leaf_insert_into_buf(struct buffer_info *bi, int before,
2025 struct item_head *inserted_item_ih,
2026 const char *inserted_item_body, int zeros_number);
2027 void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
2028 int pos_in_item, int paste_size, const char *body,
2030 void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
2031 int pos_in_item, int cut_size);
2032 void leaf_paste_entries(struct buffer_head *bh, int item_num, int before,
2033 int new_entry_count, struct reiserfs_de_head *new_dehs,
2034 const char *records, int paste_size);
2036 int balance_internal(struct tree_balance *, int, int, struct item_head *,
2037 struct buffer_head **);
2040 void do_balance_mark_leaf_dirty(struct tree_balance *tb,
2041 struct buffer_head *bh, int flag);
2042 #define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty
2043 #define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty
2045 void do_balance(struct tree_balance *tb, struct item_head *ih,
2046 const char *body, int flag);
2047 void reiserfs_invalidate_buffer(struct tree_balance *tb,
2048 struct buffer_head *bh);
2050 int get_left_neighbor_position(struct tree_balance *tb, int h);
2051 int get_right_neighbor_position(struct tree_balance *tb, int h);
2052 void replace_key(struct tree_balance *tb, struct buffer_head *, int,
2053 struct buffer_head *, int);
2054 void make_empty_node(struct buffer_info *);
2055 struct buffer_head *get_FEB(struct tree_balance *);
2059 /* structure contains hints for block allocator, and it is a container for
2060 * arguments, such as node, search path, transaction_handle, etc. */
2061 struct __reiserfs_blocknr_hint {
2062 struct inode *inode; /* inode passed to allocator, if we allocate unf. nodes */
2063 sector_t block; /* file offset, in blocks */
2064 struct in_core_key key;
2065 struct treepath *path; /* search path, used by allocator to deternine search_start by
2067 struct reiserfs_transaction_handle *th; /* transaction handle is needed to log super blocks and
2068 * bitmap blocks changes */
2069 b_blocknr_t beg, end;
2070 b_blocknr_t search_start; /* a field used to transfer search start value (block number)
2071 * between different block allocator procedures
2072 * (determine_search_start() and others) */
2073 int prealloc_size; /* is set in determine_prealloc_size() function, used by underlayed
2074 * function that do actual allocation */
2076 unsigned formatted_node:1; /* the allocator uses different polices for getting disk space for
2077 * formatted/unformatted blocks with/without preallocation */
2078 unsigned preallocate:1;
2081 typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t;
2083 int reiserfs_parse_alloc_options(struct super_block *, char *);
2084 void reiserfs_init_alloc_options(struct super_block *s);
2087 * given a directory, this will tell you what packing locality
2088 * to use for a new object underneat it. The locality is returned
2089 * in disk byte order (le).
2091 __le32 reiserfs_choose_packing(struct inode *dir);
2093 int reiserfs_init_bitmap_cache(struct super_block *sb);
2094 void reiserfs_free_bitmap_cache(struct super_block *sb);
2095 void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info);
2096 struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap);
2097 int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
2098 void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *,
2099 b_blocknr_t, int for_unformatted);
2100 int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int,
2102 static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb,
2103 b_blocknr_t * new_blocknrs,
2106 reiserfs_blocknr_hint_t hint = {
2107 .th = tb->transaction_handle,
2108 .path = tb->tb_path,
2114 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed,
2118 static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle
2119 *th, struct inode *inode,
2120 b_blocknr_t * new_blocknrs,
2121 struct treepath *path,
2124 reiserfs_blocknr_hint_t hint = {
2129 .formatted_node = 0,
2132 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2135 #ifdef REISERFS_PREALLOCATE
2136 static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle
2137 *th, struct inode *inode,
2138 b_blocknr_t * new_blocknrs,
2139 struct treepath *path,
2142 reiserfs_blocknr_hint_t hint = {
2147 .formatted_node = 0,
2150 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2153 void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th,
2154 struct inode *inode);
2155 void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th);
2159 __u32 keyed_hash(const signed char *msg, int len);
2160 __u32 yura_hash(const signed char *msg, int len);
2161 __u32 r5_hash(const signed char *msg, int len);
2163 /* the ext2 bit routines adjust for big or little endian as
2164 ** appropriate for the arch, so in our laziness we use them rather
2165 ** than using the bit routines they call more directly. These
2166 ** routines must be used when changing on disk bitmaps. */
2167 #define reiserfs_test_and_set_le_bit ext2_set_bit
2168 #define reiserfs_test_and_clear_le_bit ext2_clear_bit
2169 #define reiserfs_test_le_bit ext2_test_bit
2170 #define reiserfs_find_next_zero_le_bit ext2_find_next_zero_bit
2172 /* sometimes reiserfs_truncate may require to allocate few new blocks
2173 to perform indirect2direct conversion. People probably used to
2174 think, that truncate should work without problems on a filesystem
2175 without free disk space. They may complain that they can not
2176 truncate due to lack of free disk space. This spare space allows us
2177 to not worry about it. 500 is probably too much, but it should be
2179 #define SPARE_SPACE 500
2181 /* prototypes from ioctl.c */
2182 int reiserfs_ioctl(struct inode *inode, struct file *filp,
2183 unsigned int cmd, unsigned long arg);
2184 long reiserfs_compat_ioctl(struct file *filp,
2185 unsigned int cmd, unsigned long arg);
2186 int reiserfs_unpack(struct inode *inode, struct file *filp);
2188 /* ioctl's command */
2189 #define REISERFS_IOC_UNPACK _IOW(0xCD,1,long)
2190 /* define following flags to be the same as in ext2, so that chattr(1),
2191 lsattr(1) will work with us. */
2192 #define REISERFS_IOC_GETFLAGS FS_IOC_GETFLAGS
2193 #define REISERFS_IOC_SETFLAGS FS_IOC_SETFLAGS
2194 #define REISERFS_IOC_GETVERSION FS_IOC_GETVERSION
2195 #define REISERFS_IOC_SETVERSION FS_IOC_SETVERSION
2197 /* the 32 bit compat definitions with int argument */
2198 #define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int)
2199 #define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
2200 #define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
2201 #define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION
2202 #define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION
2204 /* Locking primitives */
2205 /* Right now we are still falling back to (un)lock_kernel, but eventually that
2206 would evolve into real per-fs locks */
2207 #define reiserfs_write_lock( sb ) lock_kernel()
2208 #define reiserfs_write_unlock( sb ) unlock_kernel()
2211 #define REISERFS_XATTR_DIR_SEM(s) (REISERFS_SB(s)->xattr_dir_sem)
2213 #endif /* __KERNEL__ */
2214 #endif /* _LINUX_REISER_FS_H */