1
2
3
4
5
6
7
8
9
10
11#ifndef _LINUX_REISER_FS_H
12#define _LINUX_REISER_FS_H
13
14#include <linux/types.h>
15#include <linux/magic.h>
16
17#ifdef __KERNEL__
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/buffer_head.h>
26#include <linux/reiserfs_fs_i.h>
27#include <linux/reiserfs_fs_sb.h>
28#endif
29
30
31
32
33
34
35
36
37
38#define REISERFS_IOC_UNPACK _IOW(0xCD,1,long)
39
40
41#define REISERFS_IOC_GETFLAGS FS_IOC_GETFLAGS
42#define REISERFS_IOC_SETFLAGS FS_IOC_SETFLAGS
43#define REISERFS_IOC_GETVERSION FS_IOC_GETVERSION
44#define REISERFS_IOC_SETVERSION FS_IOC_SETVERSION
45
46#ifdef __KERNEL__
47
48#define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int)
49#define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
50#define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
51#define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION
52#define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION
53
54
55
56
57
58
59void reiserfs_write_lock(struct super_block *s);
60void reiserfs_write_unlock(struct super_block *s);
61int reiserfs_write_lock_once(struct super_block *s);
62void reiserfs_write_unlock_once(struct super_block *s, int lock_depth);
63
64#ifdef CONFIG_REISERFS_CHECK
65void reiserfs_lock_check_recursive(struct super_block *s);
66#else
67static inline void reiserfs_lock_check_recursive(struct super_block *s) { }
68#endif
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97static inline void reiserfs_mutex_lock_safe(struct mutex *m,
98 struct super_block *s)
99{
100 reiserfs_lock_check_recursive(s);
101 reiserfs_write_unlock(s);
102 mutex_lock(m);
103 reiserfs_write_lock(s);
104}
105
106static inline void
107reiserfs_mutex_lock_nested_safe(struct mutex *m, unsigned int subclass,
108 struct super_block *s)
109{
110 reiserfs_lock_check_recursive(s);
111 reiserfs_write_unlock(s);
112 mutex_lock_nested(m, subclass);
113 reiserfs_write_lock(s);
114}
115
116static inline void
117reiserfs_down_read_safe(struct rw_semaphore *sem, struct super_block *s)
118{
119 reiserfs_lock_check_recursive(s);
120 reiserfs_write_unlock(s);
121 down_read(sem);
122 reiserfs_write_lock(s);
123}
124
125
126
127
128
129static inline void reiserfs_cond_resched(struct super_block *s)
130{
131 if (need_resched()) {
132 reiserfs_write_unlock(s);
133 schedule();
134 reiserfs_write_lock(s);
135 }
136}
137
138struct fid;
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163#define USE_INODE_GENERATION_COUNTER
164
165#define REISERFS_PREALLOCATE
166#define DISPLACE_NEW_PACKING_LOCALITIES
167#define PREALLOCATION_SIZE 9
168
169
170#define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u))
171
172
173
174
175#define ROUND_UP(x) _ROUND_UP(x,8LL)
176
177
178
179
180#define REISERFS_DEBUG_CODE 5
181
182void __reiserfs_warning(struct super_block *s, const char *id,
183 const char *func, const char *fmt, ...);
184#define reiserfs_warning(s, id, fmt, args...) \
185 __reiserfs_warning(s, id, __func__, fmt, ##args)
186
187
188
189#define __RASSERT(cond, scond, format, args...) \
190do { \
191 if (!(cond)) \
192 reiserfs_panic(NULL, "assertion failure", "(" #cond ") at " \
193 __FILE__ ":%i:%s: " format "\n", \
194 in_interrupt() ? -1 : task_pid_nr(current), \
195 __LINE__, __func__ , ##args); \
196} while (0)
197
198#define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args)
199
200#if defined( CONFIG_REISERFS_CHECK )
201#define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args)
202#else
203#define RFALSE( cond, format, args... ) do {;} while( 0 )
204#endif
205
206#define CONSTF __attribute_const__
207
208
209
210
211
212
213
214
215
216
217
218
219#define UNSET_HASH 0
220
221#define TEA_HASH 1
222#define YURA_HASH 2
223#define R5_HASH 3
224#define DEFAULT_HASH R5_HASH
225
226struct journal_params {
227 __le32 jp_journal_1st_block;
228
229 __le32 jp_journal_dev;
230 __le32 jp_journal_size;
231 __le32 jp_journal_trans_max;
232 __le32 jp_journal_magic;
233
234 __le32 jp_journal_max_batch;
235
236 __le32 jp_journal_max_commit_age;
237
238 __le32 jp_journal_max_trans_age;
239
240};
241
242
243struct reiserfs_super_block_v1 {
244 __le32 s_block_count;
245 __le32 s_free_blocks;
246 __le32 s_root_block;
247 struct journal_params s_journal;
248 __le16 s_blocksize;
249 __le16 s_oid_maxsize;
250
251 __le16 s_oid_cursize;
252 __le16 s_umount_state;
253
254 char s_magic[10];
255
256
257 __le16 s_fs_state;
258
259 __le32 s_hash_function_code;
260
261 __le16 s_tree_height;
262 __le16 s_bmap_nr;
263
264 __le16 s_version;
265
266 __le16 s_reserved_for_journal;
267
268
269} __attribute__ ((__packed__));
270
271#define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1))
272
273
274struct reiserfs_super_block {
275 struct reiserfs_super_block_v1 s_v1;
276 __le32 s_inode_generation;
277 __le32 s_flags;
278 unsigned char s_uuid[16];
279 unsigned char s_label[16];
280 __le16 s_mnt_count;
281 __le16 s_max_mnt_count;
282 __le32 s_lastcheck;
283 __le32 s_check_interval;
284 char s_unused[76];
285
286
287
288} __attribute__ ((__packed__));
289
290#define SB_SIZE (sizeof(struct reiserfs_super_block))
291
292#define REISERFS_VERSION_1 0
293#define REISERFS_VERSION_2 2
294
295
296#define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs)
297#define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1))
298#define SB_BLOCKSIZE(s) \
299 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize))
300#define SB_BLOCK_COUNT(s) \
301 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count))
302#define SB_FREE_BLOCKS(s) \
303 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks))
304#define SB_REISERFS_MAGIC(s) \
305 (SB_V1_DISK_SUPER_BLOCK(s)->s_magic)
306#define SB_ROOT_BLOCK(s) \
307 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block))
308#define SB_TREE_HEIGHT(s) \
309 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height))
310#define SB_REISERFS_STATE(s) \
311 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state))
312#define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version))
313#define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr))
314
315#define PUT_SB_BLOCK_COUNT(s, val) \
316 do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0)
317#define PUT_SB_FREE_BLOCKS(s, val) \
318 do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0)
319#define PUT_SB_ROOT_BLOCK(s, val) \
320 do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0)
321#define PUT_SB_TREE_HEIGHT(s, val) \
322 do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0)
323#define PUT_SB_REISERFS_STATE(s, val) \
324 do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0)
325#define PUT_SB_VERSION(s, val) \
326 do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0)
327#define PUT_SB_BMAP_NR(s, val) \
328 do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0)
329
330#define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal)
331#define SB_ONDISK_JOURNAL_SIZE(s) \
332 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size))
333#define SB_ONDISK_JOURNAL_1st_BLOCK(s) \
334 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block))
335#define SB_ONDISK_JOURNAL_DEVICE(s) \
336 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev))
337#define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \
338 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal))
339
340#define is_block_in_log_or_reserved_area(s, block) \
341 block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
342 && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
343 ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \
344 SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s)))
345
346int is_reiserfs_3_5(struct reiserfs_super_block *rs);
347int is_reiserfs_3_6(struct reiserfs_super_block *rs);
348int is_reiserfs_jr(struct reiserfs_super_block *rs);
349
350
351
352
353
354
355#define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024)
356#define REISERFS_FIRST_BLOCK unused_define
357#define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES
358
359
360#define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024)
361
362
363#define CARRY_ON 0
364#define REPEAT_SEARCH -1
365#define IO_ERROR -2
366#define NO_DISK_SPACE -3
367#define NO_BALANCING_NEEDED (-4)
368#define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5)
369#define QUOTA_EXCEEDED -6
370
371typedef __u32 b_blocknr_t;
372typedef __le32 unp_t;
373
374struct unfm_nodeinfo {
375 unp_t unfm_nodenum;
376 unsigned short unfm_freespace;
377};
378
379
380
381#define KEY_FORMAT_3_5 0
382#define KEY_FORMAT_3_6 1
383
384
385#define STAT_DATA_V1 0
386#define STAT_DATA_V2 1
387
388static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode)
389{
390 return container_of(inode, struct reiserfs_inode_info, vfs_inode);
391}
392
393static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb)
394{
395 return sb->s_fs_info;
396}
397
398
399
400static inline __u32 reiserfs_bmap_count(struct super_block *sb)
401{
402 return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1;
403}
404
405static inline int bmap_would_wrap(unsigned bmap_nr)
406{
407 return bmap_nr > ((1LL << 16) - 1);
408}
409
410
411
412#define get_inode_item_key_version( inode ) \
413 ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5)
414
415#define set_inode_item_key_version( inode, version ) \
416 ({ if((version)==KEY_FORMAT_3_6) \
417 REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \
418 else \
419 REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; })
420
421#define get_inode_sd_version(inode) \
422 ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1)
423
424#define set_inode_sd_version(inode, version) \
425 ({ if((version)==STAT_DATA_V2) \
426 REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \
427 else \
428 REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; })
429
430
431
432
433
434
435
436
437
438
439
440#define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \
441(\
442 (!(n_tail_size)) || \
443 (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \
444 ( (n_file_size) >= (n_block_size) * 4 ) || \
445 ( ( (n_file_size) >= (n_block_size) * 3 ) && \
446 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \
447 ( ( (n_file_size) >= (n_block_size) * 2 ) && \
448 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \
449 ( ( (n_file_size) >= (n_block_size) ) && \
450 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \
451)
452
453
454
455
456
457
458#define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \
459(\
460 (!(n_tail_size)) || \
461 (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \
462)
463
464
465
466
467#define REISERFS_VALID_FS 1
468#define REISERFS_ERROR_FS 2
469
470
471
472
473#define TYPE_STAT_DATA 0
474#define TYPE_INDIRECT 1
475#define TYPE_DIRECT 2
476#define TYPE_DIRENTRY 3
477#define TYPE_MAXTYPE 3
478#define TYPE_ANY 15
479
480
481
482
483
484
485
486
487struct offset_v1 {
488 __le32 k_offset;
489 __le32 k_uniqueness;
490} __attribute__ ((__packed__));
491
492struct offset_v2 {
493 __le64 v;
494} __attribute__ ((__packed__));
495
496static inline __u16 offset_v2_k_type(const struct offset_v2 *v2)
497{
498 __u8 type = le64_to_cpu(v2->v) >> 60;
499 return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY;
500}
501
502static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type)
503{
504 v2->v =
505 (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60);
506}
507
508static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2)
509{
510 return le64_to_cpu(v2->v) & (~0ULL >> 4);
511}
512
513static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset)
514{
515 offset &= (~0ULL >> 4);
516 v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset);
517}
518
519
520
521struct reiserfs_key {
522 __le32 k_dir_id;
523
524 __le32 k_objectid;
525 union {
526 struct offset_v1 k_offset_v1;
527 struct offset_v2 k_offset_v2;
528 } __attribute__ ((__packed__)) u;
529} __attribute__ ((__packed__));
530
531struct in_core_key {
532 __u32 k_dir_id;
533
534 __u32 k_objectid;
535 __u64 k_offset;
536 __u8 k_type;
537};
538
539struct cpu_key {
540 struct in_core_key on_disk_key;
541 int version;
542 int key_length;
543
544};
545
546
547
548
549
550#define REISERFS_FULL_KEY_LEN 4
551#define REISERFS_SHORT_KEY_LEN 2
552
553
554#define FIRST_GREATER 1
555#define SECOND_GREATER -1
556#define KEYS_IDENTICAL 0
557#define KEY_FOUND 1
558#define KEY_NOT_FOUND 0
559
560#define KEY_SIZE (sizeof(struct reiserfs_key))
561#define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32))
562
563
564#define ITEM_FOUND 1
565#define ITEM_NOT_FOUND 0
566#define ENTRY_FOUND 1
567#define ENTRY_NOT_FOUND 0
568#define DIRECTORY_NOT_FOUND -1
569#define REGULAR_FILE_FOUND -2
570#define DIRECTORY_FOUND -3
571#define BYTE_FOUND 1
572#define BYTE_NOT_FOUND 0
573#define FILE_NOT_FOUND -1
574
575#define POSITION_FOUND 1
576#define POSITION_NOT_FOUND 0
577
578
579#define NAME_FOUND 1
580#define NAME_NOT_FOUND 0
581#define GOTO_PREVIOUS_ITEM 2
582#define NAME_FOUND_INVISIBLE 3
583
584
585
586
587
588
589struct item_head {
590
591
592 struct reiserfs_key ih_key;
593 union {
594
595
596
597
598
599
600 __le16 ih_free_space_reserved;
601
602
603 __le16 ih_entry_count;
604 } __attribute__ ((__packed__)) u;
605 __le16 ih_item_len;
606 __le16 ih_item_location;
607
608 __le16 ih_version;
609
610
611
612} __attribute__ ((__packed__));
613
614#define IH_SIZE (sizeof(struct item_head))
615
616#define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved)
617#define ih_version(ih) le16_to_cpu((ih)->ih_version)
618#define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count)
619#define ih_location(ih) le16_to_cpu((ih)->ih_item_location)
620#define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len)
621
622#define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0)
623#define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0)
624#define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0)
625#define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0)
626#define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0)
627
628#define unreachable_item(ih) (ih_version(ih) & (1 << 15))
629
630#define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih))
631#define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val)))
632
633
634
635
636
637
638
639#define get_block_num(p, i) get_unaligned_le32((p) + (i))
640#define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i))
641
642
643
644
645#define V1_SD_UNIQUENESS 0
646#define V1_INDIRECT_UNIQUENESS 0xfffffffe
647#define V1_DIRECT_UNIQUENESS 0xffffffff
648#define V1_DIRENTRY_UNIQUENESS 500
649#define V1_ANY_UNIQUENESS 555
650
651
652
653
654static inline int uniqueness2type(__u32 uniqueness) CONSTF;
655static inline int uniqueness2type(__u32 uniqueness)
656{
657 switch ((int)uniqueness) {
658 case V1_SD_UNIQUENESS:
659 return TYPE_STAT_DATA;
660 case V1_INDIRECT_UNIQUENESS:
661 return TYPE_INDIRECT;
662 case V1_DIRECT_UNIQUENESS:
663 return TYPE_DIRECT;
664 case V1_DIRENTRY_UNIQUENESS:
665 return TYPE_DIRENTRY;
666 case V1_ANY_UNIQUENESS:
667 default:
668 return TYPE_ANY;
669 }
670}
671
672static inline __u32 type2uniqueness(int type) CONSTF;
673static inline __u32 type2uniqueness(int type)
674{
675 switch (type) {
676 case TYPE_STAT_DATA:
677 return V1_SD_UNIQUENESS;
678 case TYPE_INDIRECT:
679 return V1_INDIRECT_UNIQUENESS;
680 case TYPE_DIRECT:
681 return V1_DIRECT_UNIQUENESS;
682 case TYPE_DIRENTRY:
683 return V1_DIRENTRY_UNIQUENESS;
684 case TYPE_ANY:
685 default:
686 return V1_ANY_UNIQUENESS;
687 }
688}
689
690
691
692
693
694
695static inline loff_t le_key_k_offset(int version,
696 const struct reiserfs_key *key)
697{
698 return (version == KEY_FORMAT_3_5) ?
699 le32_to_cpu(key->u.k_offset_v1.k_offset) :
700 offset_v2_k_offset(&(key->u.k_offset_v2));
701}
702
703static inline loff_t le_ih_k_offset(const struct item_head *ih)
704{
705 return le_key_k_offset(ih_version(ih), &(ih->ih_key));
706}
707
708static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key)
709{
710 return (version == KEY_FORMAT_3_5) ?
711 uniqueness2type(le32_to_cpu(key->u.k_offset_v1.k_uniqueness)) :
712 offset_v2_k_type(&(key->u.k_offset_v2));
713}
714
715static inline loff_t le_ih_k_type(const struct item_head *ih)
716{
717 return le_key_k_type(ih_version(ih), &(ih->ih_key));
718}
719
720static inline void set_le_key_k_offset(int version, struct reiserfs_key *key,
721 loff_t offset)
722{
723 (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_offset = cpu_to_le32(offset)) :
724 (void)(set_offset_v2_k_offset(&(key->u.k_offset_v2), offset));
725}
726
727static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset)
728{
729 set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset);
730}
731
732static inline void set_le_key_k_type(int version, struct reiserfs_key *key,
733 int type)
734{
735 (version == KEY_FORMAT_3_5) ?
736 (void)(key->u.k_offset_v1.k_uniqueness =
737 cpu_to_le32(type2uniqueness(type)))
738 : (void)(set_offset_v2_k_type(&(key->u.k_offset_v2), type));
739}
740
741static inline void set_le_ih_k_type(struct item_head *ih, int type)
742{
743 set_le_key_k_type(ih_version(ih), &(ih->ih_key), type);
744}
745
746static inline int is_direntry_le_key(int version, struct reiserfs_key *key)
747{
748 return le_key_k_type(version, key) == TYPE_DIRENTRY;
749}
750
751static inline int is_direct_le_key(int version, struct reiserfs_key *key)
752{
753 return le_key_k_type(version, key) == TYPE_DIRECT;
754}
755
756static inline int is_indirect_le_key(int version, struct reiserfs_key *key)
757{
758 return le_key_k_type(version, key) == TYPE_INDIRECT;
759}
760
761static inline int is_statdata_le_key(int version, struct reiserfs_key *key)
762{
763 return le_key_k_type(version, key) == TYPE_STAT_DATA;
764}
765
766
767
768
769static inline int is_direntry_le_ih(struct item_head *ih)
770{
771 return is_direntry_le_key(ih_version(ih), &ih->ih_key);
772}
773
774static inline int is_direct_le_ih(struct item_head *ih)
775{
776 return is_direct_le_key(ih_version(ih), &ih->ih_key);
777}
778
779static inline int is_indirect_le_ih(struct item_head *ih)
780{
781 return is_indirect_le_key(ih_version(ih), &ih->ih_key);
782}
783
784static inline int is_statdata_le_ih(struct item_head *ih)
785{
786 return is_statdata_le_key(ih_version(ih), &ih->ih_key);
787}
788
789
790
791
792static inline loff_t cpu_key_k_offset(const struct cpu_key *key)
793{
794 return key->on_disk_key.k_offset;
795}
796
797static inline loff_t cpu_key_k_type(const struct cpu_key *key)
798{
799 return key->on_disk_key.k_type;
800}
801
802static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset)
803{
804 key->on_disk_key.k_offset = offset;
805}
806
807static inline void set_cpu_key_k_type(struct cpu_key *key, int type)
808{
809 key->on_disk_key.k_type = type;
810}
811
812static inline void cpu_key_k_offset_dec(struct cpu_key *key)
813{
814 key->on_disk_key.k_offset--;
815}
816
817#define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY)
818#define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT)
819#define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT)
820#define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA)
821
822
823#define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key)))
824#define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key)))
825#define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key)))
826#define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key)))
827
828#define I_K_KEY_IN_ITEM(ih, key, n_blocksize) \
829 (!COMP_SHORT_KEYS(ih, key) && \
830 I_OFF_BYTE_IN_ITEM(ih, k_offset(key), n_blocksize))
831
832
833#define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
834#define MIN_ITEM_LEN 1
835
836
837#define REISERFS_ROOT_OBJECTID 2
838#define REISERFS_ROOT_PARENT_OBJECTID 1
839
840extern struct reiserfs_key root_key;
841
842
843
844
845
846
847
848
849
850
851
852
853struct block_head {
854 __le16 blk_level;
855 __le16 blk_nr_item;
856 __le16 blk_free_space;
857 __le16 blk_reserved;
858
859 struct reiserfs_key blk_right_delim_key;
860};
861
862#define BLKH_SIZE (sizeof(struct block_head))
863#define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level))
864#define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item))
865#define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space))
866#define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved))
867#define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val))
868#define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val))
869#define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val))
870#define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val))
871#define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key)
872#define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val)
873
874
875
876
877
878#define FREE_LEVEL 0
879
880
881
882
883#define DISK_LEAF_NODE_LEVEL 1
884
885
886#define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data))
887
888#define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh)))
889#define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh)))
890#define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh)))
891
892#define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0)
893#define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0)
894#define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0)
895
896
897#define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh))))
898
899
900#define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL)
901
902
903#define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \
904 && B_LEVEL(bh) <= MAX_HEIGHT)
905
906
907
908
909
910
911
912
913
914struct stat_data_v1 {
915 __le16 sd_mode;
916 __le16 sd_nlink;
917 __le16 sd_uid;
918 __le16 sd_gid;
919 __le32 sd_size;
920 __le32 sd_atime;
921 __le32 sd_mtime;
922 __le32 sd_ctime;
923 union {
924 __le32 sd_rdev;
925 __le32 sd_blocks;
926 } __attribute__ ((__packed__)) u;
927 __le32 sd_first_direct_byte;
928
929
930
931
932
933
934
935
936} __attribute__ ((__packed__));
937
938#define SD_V1_SIZE (sizeof(struct stat_data_v1))
939#define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5)
940#define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
941#define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
942#define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink))
943#define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v))
944#define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid))
945#define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v))
946#define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid))
947#define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v))
948#define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size))
949#define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v))
950#define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
951#define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
952#define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
953#define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
954#define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
955#define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
956#define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
957#define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
958#define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks))
959#define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v))
960#define sd_v1_first_direct_byte(sdp) \
961 (le32_to_cpu((sdp)->sd_first_direct_byte))
962#define set_sd_v1_first_direct_byte(sdp,v) \
963 ((sdp)->sd_first_direct_byte = cpu_to_le32(v))
964
965
966
967
968
969#define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL
970#define REISERFS_APPEND_FL FS_APPEND_FL
971#define REISERFS_SYNC_FL FS_SYNC_FL
972#define REISERFS_NOATIME_FL FS_NOATIME_FL
973#define REISERFS_NODUMP_FL FS_NODUMP_FL
974#define REISERFS_SECRM_FL FS_SECRM_FL
975#define REISERFS_UNRM_FL FS_UNRM_FL
976#define REISERFS_COMPR_FL FS_COMPR_FL
977#define REISERFS_NOTAIL_FL FS_NOTAIL_FL
978
979
980#define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \
981 REISERFS_SYNC_FL | \
982 REISERFS_NOATIME_FL | \
983 REISERFS_NODUMP_FL | \
984 REISERFS_SECRM_FL | \
985 REISERFS_COMPR_FL | \
986 REISERFS_NOTAIL_FL )
987
988
989
990struct stat_data {
991 __le16 sd_mode;
992 __le16 sd_attrs;
993 __le32 sd_nlink;
994 __le64 sd_size;
995 __le32 sd_uid;
996 __le32 sd_gid;
997 __le32 sd_atime;
998 __le32 sd_mtime;
999 __le32 sd_ctime;
1000 __le32 sd_blocks;
1001 union {
1002 __le32 sd_rdev;
1003 __le32 sd_generation;
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013 } __attribute__ ((__packed__)) u;
1014} __attribute__ ((__packed__));
1015
1016
1017
1018#define SD_SIZE (sizeof(struct stat_data))
1019#define SD_V2_SIZE SD_SIZE
1020#define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6)
1021#define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
1022#define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
1023
1024
1025#define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink))
1026#define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v))
1027#define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size))
1028#define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v))
1029#define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid))
1030#define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v))
1031#define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid))
1032#define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v))
1033#define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
1034#define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
1035#define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
1036#define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
1037#define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
1038#define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
1039#define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks))
1040#define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v))
1041#define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
1042#define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
1043#define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation))
1044#define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v))
1045#define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs))
1046#define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v))
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064#define SD_OFFSET 0
1065#define SD_UNIQUENESS 0
1066#define DOT_OFFSET 1
1067#define DOT_DOT_OFFSET 2
1068#define DIRENTRY_UNIQUENESS 500
1069
1070
1071#define FIRST_ITEM_OFFSET 1
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082struct reiserfs_de_head {
1083 __le32 deh_offset;
1084 __le32 deh_dir_id;
1085
1086 __le32 deh_objectid;
1087 __le16 deh_location;
1088 __le16 deh_state;
1089
1090} __attribute__ ((__packed__));
1091#define DEH_SIZE sizeof(struct reiserfs_de_head)
1092#define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset))
1093#define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id))
1094#define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid))
1095#define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location))
1096#define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state))
1097
1098#define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v)))
1099#define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v)))
1100#define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v)))
1101#define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v)))
1102#define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v)))
1103
1104
1105#define EMPTY_DIR_SIZE \
1106(DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen ("..")))
1107
1108
1109#define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3)
1110
1111#define DEH_Statdata 0
1112#define DEH_Visible 2
1113
1114
1115#if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__)
1116# define ADDR_UNALIGNED_BITS (3)
1117#endif
1118
1119
1120
1121
1122#ifdef ADDR_UNALIGNED_BITS
1123
1124# define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1)))
1125# define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3)
1126
1127# define set_bit_unaligned(nr, addr) ext2_set_bit((nr) + unaligned_offset(addr), aligned_address(addr))
1128# define clear_bit_unaligned(nr, addr) ext2_clear_bit((nr) + unaligned_offset(addr), aligned_address(addr))
1129# define test_bit_unaligned(nr, addr) ext2_test_bit((nr) + unaligned_offset(addr), aligned_address(addr))
1130
1131#else
1132
1133# define set_bit_unaligned(nr, addr) ext2_set_bit(nr, addr)
1134# define clear_bit_unaligned(nr, addr) ext2_clear_bit(nr, addr)
1135# define test_bit_unaligned(nr, addr) ext2_test_bit(nr, addr)
1136
1137#endif
1138
1139#define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1140#define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1141#define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1142#define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1143
1144#define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1145#define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1146#define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1147
1148extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
1149 __le32 par_dirid, __le32 par_objid);
1150extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
1151 __le32 par_dirid, __le32 par_objid);
1152
1153
1154
1155#define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) )
1156#define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih)))
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168static inline int entry_length(const struct buffer_head *bh,
1169 const struct item_head *ih, int pos_in_item)
1170{
1171 struct reiserfs_de_head *deh;
1172
1173 deh = B_I_DEH(bh, ih) + pos_in_item;
1174 if (pos_in_item)
1175 return deh_location(deh - 1) - deh_location(deh);
1176
1177 return ih_item_len(ih) - deh_location(deh);
1178}
1179
1180
1181#define I_ENTRY_COUNT(ih) (ih_entry_count((ih)))
1182
1183
1184#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))))
1185
1186
1187#define REISERFS_MAX_NAME(block_size) 255
1188
1189
1190
1191
1192
1193struct reiserfs_dir_entry {
1194 struct buffer_head *de_bh;
1195 int de_item_num;
1196 struct item_head *de_ih;
1197 int de_entry_num;
1198 struct reiserfs_de_head *de_deh;
1199 int de_entrylen;
1200 int de_namelen;
1201 char *de_name;
1202 unsigned long *de_gen_number_bit_string;
1203
1204 __u32 de_dir_id;
1205 __u32 de_objectid;
1206
1207 struct cpu_key de_entry_key;
1208};
1209
1210
1211
1212
1213#define B_I_DEH_ENTRY_FILE_NAME(bh,ih,deh) (B_I_PITEM (bh, ih) + deh_location(deh))
1214
1215
1216#define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \
1217(I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0))
1218
1219
1220#define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL)
1221
1222#define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL)
1223#define MAX_GENERATION_NUMBER 127
1224
1225#define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number))
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241struct disk_child {
1242 __le32 dc_block_number;
1243 __le16 dc_size;
1244 __le16 dc_reserved;
1245};
1246
1247#define DC_SIZE (sizeof(struct disk_child))
1248#define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number))
1249#define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size))
1250#define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0)
1251#define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0)
1252
1253
1254#define B_N_CHILD(bh, n_pos) ((struct disk_child *)\
1255((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
1256
1257
1258#define B_N_CHILD_NUM(bh, n_pos) (dc_block_number(B_N_CHILD(bh, n_pos)))
1259#define PUT_B_N_CHILD_NUM(bh, n_pos, val) \
1260 (put_dc_block_number(B_N_CHILD(bh, n_pos), val))
1261
1262
1263
1264#define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
1265
1266
1267#define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
1268
1269
1270#define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
1271#define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2)
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285struct path_element {
1286 struct buffer_head *pe_buffer;
1287 int pe_position;
1288
1289};
1290
1291#define MAX_HEIGHT 5
1292#define EXTENDED_MAX_HEIGHT 7
1293#define FIRST_PATH_ELEMENT_OFFSET 2
1294
1295#define ILLEGAL_PATH_ELEMENT_OFFSET 1
1296#define MAX_FEB_SIZE 6
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315#define PATH_READA 0x1
1316#define PATH_READA_BACK 0x2
1317
1318struct treepath {
1319 int path_length;
1320 int reada;
1321 struct path_element path_elements[EXTENDED_MAX_HEIGHT];
1322 int pos_in_item;
1323};
1324
1325#define pos_in_item(path) ((path)->pos_in_item)
1326
1327#define INITIALIZE_PATH(var) \
1328struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
1329
1330
1331#define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset))
1332
1333
1334#define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer)
1335
1336
1337#define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position)
1338
1339#define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
1340
1341
1342
1343
1344
1345
1346#define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
1347
1348#define PATH_PITEM_HEAD(path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path))
1349
1350
1351
1352#define PATH_H_PBUFFER(path, h) PATH_OFFSET_PBUFFER (path, path->path_length - (h))
1353#define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1)
1354#define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h))
1355#define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1)
1356
1357#define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
1358
1359#define get_last_bh(path) PATH_PLAST_BUFFER(path)
1360#define get_ih(path) PATH_PITEM_HEAD(path)
1361#define get_item_pos(path) PATH_LAST_POSITION(path)
1362#define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path)))
1363#define item_moved(ih,path) comp_items(ih, path)
1364#define path_changed(ih,path) comp_items (ih, path)
1365
1366
1367
1368
1369
1370
1371#define UNFM_P_SIZE (sizeof(unp_t))
1372#define UNFM_P_SHIFT 2
1373
1374
1375#define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key))
1376
1377#define MAX_UL_INT 0xffffffff
1378#define MAX_INT 0x7ffffff
1379#define MAX_US_INT 0xffff
1380
1381
1382#define U32_MAX (~(__u32)0)
1383
1384static inline loff_t max_reiserfs_offset(struct inode *inode)
1385{
1386 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5)
1387 return (loff_t) U32_MAX;
1388
1389 return (loff_t) ((~(__u64) 0) >> 4);
1390}
1391
1392
1393#define MAX_KEY_OBJECTID MAX_UL_INT
1394
1395#define MAX_B_NUM MAX_UL_INT
1396#define MAX_FC_NUM MAX_US_INT
1397
1398
1399#define REISERFS_LINK_MAX (MAX_US_INT - 1000)
1400
1401
1402#define REISERFS_KERNEL_MEM 0
1403#define REISERFS_USER_MEM 1
1404
1405#define fs_generation(s) (REISERFS_SB(s)->s_generation_counter)
1406#define get_generation(s) atomic_read (&fs_generation(s))
1407#define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen)
1408#define __fs_changed(gen,s) (gen != get_generation (s))
1409#define fs_changed(gen,s) \
1410({ \
1411 reiserfs_cond_resched(s); \
1412 __fs_changed(gen, s); \
1413})
1414
1415
1416
1417
1418
1419#define VI_TYPE_LEFT_MERGEABLE 1
1420#define VI_TYPE_RIGHT_MERGEABLE 2
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435struct virtual_item {
1436 int vi_index;
1437 unsigned short vi_type;
1438 unsigned short vi_item_len;
1439 struct item_head *vi_ih;
1440 const char *vi_item;
1441 const void *vi_new_data;
1442 void *vi_uarea;
1443};
1444
1445struct virtual_node {
1446 char *vn_free_ptr;
1447 unsigned short vn_nr_item;
1448 short vn_size;
1449 short vn_mode;
1450 short vn_affected_item_num;
1451 short vn_pos_in_item;
1452 struct item_head *vn_ins_ih;
1453 const void *vn_data;
1454 struct virtual_item *vn_vi;
1455};
1456
1457
1458struct direntry_uarea {
1459 int flags;
1460 __u16 entry_count;
1461 __u16 entry_sizes[1];
1462} __attribute__ ((__packed__));
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479#define MAX_FREE_BLOCK 7
1480
1481
1482#define MAX_AMOUNT_NEEDED 2
1483
1484
1485struct tree_balance {
1486 int tb_mode;
1487 int need_balance_dirty;
1488 struct super_block *tb_sb;
1489 struct reiserfs_transaction_handle *transaction_handle;
1490 struct treepath *tb_path;
1491 struct buffer_head *L[MAX_HEIGHT];
1492 struct buffer_head *R[MAX_HEIGHT];
1493 struct buffer_head *FL[MAX_HEIGHT];
1494 struct buffer_head *FR[MAX_HEIGHT];
1495 struct buffer_head *CFL[MAX_HEIGHT];
1496 struct buffer_head *CFR[MAX_HEIGHT];
1497
1498 struct buffer_head *FEB[MAX_FEB_SIZE];
1499
1500 struct buffer_head *used[MAX_FEB_SIZE];
1501 struct buffer_head *thrown[MAX_FEB_SIZE];
1502 int lnum[MAX_HEIGHT];
1503
1504
1505
1506
1507
1508
1509
1510
1511 int rnum[MAX_HEIGHT];
1512 int lkey[MAX_HEIGHT];
1513
1514 int rkey[MAX_HEIGHT];
1515 int insert_size[MAX_HEIGHT];
1516
1517 int blknum[MAX_HEIGHT];
1518
1519
1520
1521
1522
1523
1524 int cur_blknum;
1525 int s0num;
1526 int s1num;
1527 int s2num;
1528 int lbytes;
1529
1530
1531 int rbytes;
1532
1533
1534 int s1bytes;
1535
1536 int s2bytes;
1537 struct buffer_head *buf_to_free[MAX_FREE_BLOCK];
1538 char *vn_buf;
1539
1540
1541 int vn_buf_size;
1542 struct virtual_node *tb_vn;
1543
1544 int fs_gen;
1545
1546#ifdef DISPLACE_NEW_PACKING_LOCALITIES
1547 struct in_core_key key;
1548
1549#endif
1550};
1551
1552
1553
1554
1555#define M_INSERT 'i'
1556
1557
1558#define M_PASTE 'p'
1559
1560#define M_DELETE 'd'
1561
1562#define M_CUT 'c'
1563
1564
1565#define M_INTERNAL 'n'
1566
1567
1568
1569#define M_SKIP_BALANCING 's'
1570#define M_CONVERT 'v'
1571
1572
1573#define LEAF_FROM_S_TO_L 0
1574#define LEAF_FROM_S_TO_R 1
1575#define LEAF_FROM_R_TO_L 2
1576#define LEAF_FROM_L_TO_R 3
1577#define LEAF_FROM_S_TO_SNEW 4
1578
1579#define FIRST_TO_LAST 0
1580#define LAST_TO_FIRST 1
1581
1582
1583
1584struct buffer_info {
1585 struct tree_balance *tb;
1586 struct buffer_head *bi_bh;
1587 struct buffer_head *bi_parent;
1588 int bi_position;
1589};
1590
1591static inline struct super_block *sb_from_tb(struct tree_balance *tb)
1592{
1593 return tb ? tb->tb_sb : NULL;
1594}
1595
1596static inline struct super_block *sb_from_bi(struct buffer_info *bi)
1597{
1598 return bi ? sb_from_tb(bi->tb) : NULL;
1599}
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617struct item_operations {
1618 int (*bytes_number) (struct item_head * ih, int block_size);
1619 void (*decrement_key) (struct cpu_key *);
1620 int (*is_left_mergeable) (struct reiserfs_key * ih,
1621 unsigned long bsize);
1622 void (*print_item) (struct item_head *, char *item);
1623 void (*check_item) (struct item_head *, char *item);
1624
1625 int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi,
1626 int is_affected, int insert_size);
1627 int (*check_left) (struct virtual_item * vi, int free,
1628 int start_skip, int end_skip);
1629 int (*check_right) (struct virtual_item * vi, int free);
1630 int (*part_size) (struct virtual_item * vi, int from, int to);
1631 int (*unit_num) (struct virtual_item * vi);
1632 void (*print_vi) (struct virtual_item * vi);
1633};
1634
1635extern struct item_operations *item_ops[TYPE_ANY + 1];
1636
1637#define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize)
1638#define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize)
1639#define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item)
1640#define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item)
1641#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)
1642#define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip)
1643#define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free)
1644#define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to)
1645#define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi)
1646#define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi)
1647
1648#define COMP_SHORT_KEYS comp_short_keys
1649
1650
1651#define I_UNFM_NUM(ih) (ih_item_len(ih) / UNFM_P_SIZE)
1652
1653
1654#define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size))
1655
1656
1657
1658
1659#define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1660
1661
1662#define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) )
1663
1664
1665#define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) )
1666
1667
1668#define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num))))
1669
1670
1671#define B_N_STAT_DATA(bh,nr) \
1672( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) )
1673
1674
1675
1676
1677#define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) )
1678
1679
1680#define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
1681
1682
1683
1684
1685#define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)))
1686#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)
1687
1688struct reiserfs_iget_args {
1689 __u32 objectid;
1690 __u32 dirid;
1691};
1692
1693
1694
1695
1696
1697#define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12)
1698
1699#define journal_trans_half(blocksize) \
1700 ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32))
1701
1702
1703
1704
1705struct reiserfs_journal_desc {
1706 __le32 j_trans_id;
1707 __le32 j_len;
1708 __le32 j_mount_id;
1709 __le32 j_realblock[1];
1710};
1711
1712#define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id)
1713#define get_desc_trans_len(d) le32_to_cpu((d)->j_len)
1714#define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id)
1715
1716#define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0)
1717#define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0)
1718#define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0)
1719
1720
1721struct reiserfs_journal_commit {
1722 __le32 j_trans_id;
1723 __le32 j_len;
1724 __le32 j_realblock[1];
1725};
1726
1727#define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id)
1728#define get_commit_trans_len(c) le32_to_cpu((c)->j_len)
1729#define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id)
1730
1731#define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0)
1732#define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0)
1733
1734
1735
1736
1737
1738struct reiserfs_journal_header {
1739 __le32 j_last_flush_trans_id;
1740 __le32 j_first_unflushed_offset;
1741 __le32 j_mount_id;
1742 struct journal_params jh_journal;
1743};
1744
1745
1746#define JOURNAL_BLOCK_COUNT 8192
1747#define JOURNAL_TRANS_MAX_DEFAULT 1024
1748#define JOURNAL_TRANS_MIN_DEFAULT 256
1749#define JOURNAL_MAX_BATCH_DEFAULT 900
1750#define JOURNAL_MIN_RATIO 2
1751#define JOURNAL_MAX_COMMIT_AGE 30
1752#define JOURNAL_MAX_TRANS_AGE 30
1753#define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)
1754#define JOURNAL_BLOCKS_PER_OBJECT(sb) (JOURNAL_PER_BALANCE_CNT * 3 + \
1755 2 * (REISERFS_QUOTA_INIT_BLOCKS(sb) + \
1756 REISERFS_QUOTA_TRANS_BLOCKS(sb)))
1757
1758#ifdef CONFIG_QUOTA
1759
1760#define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? 2 : 0)
1761
1762#define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \
1763(DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0)
1764
1765#define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & (1<<REISERFS_QUOTA) ? \
1766(DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0)
1767#else
1768#define REISERFS_QUOTA_TRANS_BLOCKS(s) 0
1769#define REISERFS_QUOTA_INIT_BLOCKS(s) 0
1770#define REISERFS_QUOTA_DEL_BLOCKS(s) 0
1771#endif
1772
1773
1774
1775
1776
1777
1778
1779#define REISERFS_MIN_BITMAP_NODES 10
1780#define REISERFS_MAX_BITMAP_NODES 100
1781
1782#define JBH_HASH_SHIFT 13
1783#define JBH_HASH_MASK 8191
1784
1785#define _jhashfn(sb,block) \
1786 (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \
1787 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
1788#define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
1789
1790
1791#define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1792#define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1793#define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
1794
1795enum reiserfs_bh_state_bits {
1796 BH_JDirty = BH_PrivateStart,
1797 BH_JDirty_wait,
1798 BH_JNew,
1799
1800
1801 BH_JPrepared,
1802 BH_JRestore_dirty,
1803 BH_JTest,
1804};
1805
1806BUFFER_FNS(JDirty, journaled);
1807TAS_BUFFER_FNS(JDirty, journaled);
1808BUFFER_FNS(JDirty_wait, journal_dirty);
1809TAS_BUFFER_FNS(JDirty_wait, journal_dirty);
1810BUFFER_FNS(JNew, journal_new);
1811TAS_BUFFER_FNS(JNew, journal_new);
1812BUFFER_FNS(JPrepared, journal_prepared);
1813TAS_BUFFER_FNS(JPrepared, journal_prepared);
1814BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
1815TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
1816BUFFER_FNS(JTest, journal_test);
1817TAS_BUFFER_FNS(JTest, journal_test);
1818
1819
1820
1821
1822struct reiserfs_transaction_handle {
1823 struct super_block *t_super;
1824
1825
1826
1827
1828
1829 int t_refcount;
1830 int t_blocks_logged;
1831 int t_blocks_allocated;
1832 unsigned int t_trans_id;
1833 void *t_handle_save;
1834 unsigned displace_new_blocks:1;
1835
1836 struct list_head t_list;
1837};
1838
1839
1840
1841
1842struct reiserfs_jh {
1843 struct reiserfs_journal_list *jl;
1844 struct buffer_head *bh;
1845 struct list_head list;
1846};
1847
1848void reiserfs_free_jh(struct buffer_head *bh);
1849int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh);
1850int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh);
1851int journal_mark_dirty(struct reiserfs_transaction_handle *,
1852 struct super_block *, struct buffer_head *bh);
1853
1854static inline int reiserfs_file_data_log(struct inode *inode)
1855{
1856 if (reiserfs_data_log(inode->i_sb) ||
1857 (REISERFS_I(inode)->i_flags & i_data_log))
1858 return 1;
1859 return 0;
1860}
1861
1862static inline int reiserfs_transaction_running(struct super_block *s)
1863{
1864 struct reiserfs_transaction_handle *th = current->journal_info;
1865 if (th && th->t_super == s)
1866 return 1;
1867 if (th && th->t_super == NULL)
1868 BUG();
1869 return 0;
1870}
1871
1872static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th)
1873{
1874 return th->t_blocks_allocated - th->t_blocks_logged;
1875}
1876
1877struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct
1878 super_block
1879 *,
1880 int count);
1881int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *);
1882int reiserfs_commit_page(struct inode *inode, struct page *page,
1883 unsigned from, unsigned to);
1884int reiserfs_flush_old_commits(struct super_block *);
1885int reiserfs_commit_for_inode(struct inode *);
1886int reiserfs_inode_needs_commit(struct inode *);
1887void reiserfs_update_inode_transaction(struct inode *);
1888void reiserfs_wait_on_write_block(struct super_block *s);
1889void reiserfs_block_writes(struct reiserfs_transaction_handle *th);
1890void reiserfs_allow_writes(struct super_block *s);
1891void reiserfs_check_lock_depth(struct super_block *s, char *caller);
1892int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh,
1893 int wait);
1894void reiserfs_restore_prepared_buffer(struct super_block *,
1895 struct buffer_head *bh);
1896int journal_init(struct super_block *, const char *j_dev_name, int old_format,
1897 unsigned int);
1898int journal_release(struct reiserfs_transaction_handle *, struct super_block *);
1899int journal_release_error(struct reiserfs_transaction_handle *,
1900 struct super_block *);
1901int journal_end(struct reiserfs_transaction_handle *, struct super_block *,
1902 unsigned long);
1903int journal_end_sync(struct reiserfs_transaction_handle *, struct super_block *,
1904 unsigned long);
1905int journal_mark_freed(struct reiserfs_transaction_handle *,
1906 struct super_block *, b_blocknr_t blocknr);
1907int journal_transaction_should_end(struct reiserfs_transaction_handle *, int);
1908int reiserfs_in_journal(struct super_block *sb, unsigned int bmap_nr,
1909 int bit_nr, int searchall, b_blocknr_t *next);
1910int journal_begin(struct reiserfs_transaction_handle *,
1911 struct super_block *sb, unsigned long);
1912int journal_join_abort(struct reiserfs_transaction_handle *,
1913 struct super_block *sb, unsigned long);
1914void reiserfs_abort_journal(struct super_block *sb, int errno);
1915void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...);
1916int reiserfs_allocate_list_bitmaps(struct super_block *s,
1917 struct reiserfs_list_bitmap *, unsigned int);
1918
1919void add_save_link(struct reiserfs_transaction_handle *th,
1920 struct inode *inode, int truncate);
1921int remove_save_link(struct inode *inode, int truncate);
1922
1923
1924__u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th);
1925void reiserfs_release_objectid(struct reiserfs_transaction_handle *th,
1926 __u32 objectid_to_release);
1927int reiserfs_convert_objectid_map_v1(struct super_block *);
1928
1929
1930int B_IS_IN_TREE(const struct buffer_head *);
1931extern void copy_item_head(struct item_head *to,
1932 const struct item_head *from);
1933
1934
1935extern int comp_short_keys(const struct reiserfs_key *le_key,
1936 const struct cpu_key *cpu_key);
1937extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from);
1938
1939
1940extern int comp_le_keys(const struct reiserfs_key *,
1941 const struct reiserfs_key *);
1942extern int comp_short_le_keys(const struct reiserfs_key *,
1943 const struct reiserfs_key *);
1944
1945
1946
1947
1948static inline int le_key_version(const struct reiserfs_key *key)
1949{
1950 int type;
1951
1952 type = offset_v2_k_type(&(key->u.k_offset_v2));
1953 if (type != TYPE_DIRECT && type != TYPE_INDIRECT
1954 && type != TYPE_DIRENTRY)
1955 return KEY_FORMAT_3_5;
1956
1957 return KEY_FORMAT_3_6;
1958
1959}
1960
1961static inline void copy_key(struct reiserfs_key *to,
1962 const struct reiserfs_key *from)
1963{
1964 memcpy(to, from, KEY_SIZE);
1965}
1966
1967int comp_items(const struct item_head *stored_ih, const struct treepath *path);
1968const struct reiserfs_key *get_rkey(const struct treepath *chk_path,
1969 const struct super_block *sb);
1970int search_by_key(struct super_block *, const struct cpu_key *,
1971 struct treepath *, int);
1972#define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)
1973int search_for_position_by_key(struct super_block *sb,
1974 const struct cpu_key *cpu_key,
1975 struct treepath *search_path);
1976extern void decrement_bcount(struct buffer_head *bh);
1977void decrement_counters_in_path(struct treepath *search_path);
1978void pathrelse(struct treepath *search_path);
1979int reiserfs_check_path(struct treepath *p);
1980void pathrelse_and_restore(struct super_block *s, struct treepath *search_path);
1981
1982int reiserfs_insert_item(struct reiserfs_transaction_handle *th,
1983 struct treepath *path,
1984 const struct cpu_key *key,
1985 struct item_head *ih,
1986 struct inode *inode, const char *body);
1987
1988int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th,
1989 struct treepath *path,
1990 const struct cpu_key *key,
1991 struct inode *inode,
1992 const char *body, int paste_size);
1993
1994int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th,
1995 struct treepath *path,
1996 struct cpu_key *key,
1997 struct inode *inode,
1998 struct page *page, loff_t new_file_size);
1999
2000int reiserfs_delete_item(struct reiserfs_transaction_handle *th,
2001 struct treepath *path,
2002 const struct cpu_key *key,
2003 struct inode *inode, struct buffer_head *un_bh);
2004
2005void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th,
2006 struct inode *inode, struct reiserfs_key *key);
2007int reiserfs_delete_object(struct reiserfs_transaction_handle *th,
2008 struct inode *inode);
2009int reiserfs_do_truncate(struct reiserfs_transaction_handle *th,
2010 struct inode *inode, struct page *,
2011 int update_timestamps);
2012
2013#define i_block_size(inode) ((inode)->i_sb->s_blocksize)
2014#define file_size(inode) ((inode)->i_size)
2015#define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1))
2016
2017#define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\
2018!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 )
2019
2020void padd_item(char *item, int total_length, int length);
2021
2022
2023
2024#define GET_BLOCK_NO_CREATE 0
2025#define GET_BLOCK_CREATE 1
2026#define GET_BLOCK_NO_HOLE 2
2027#define GET_BLOCK_READ_DIRECT 4
2028#define GET_BLOCK_NO_IMUX 8
2029#define GET_BLOCK_NO_DANGLE 16
2030
2031void reiserfs_read_locked_inode(struct inode *inode,
2032 struct reiserfs_iget_args *args);
2033int reiserfs_find_actor(struct inode *inode, void *p);
2034int reiserfs_init_locked_inode(struct inode *inode, void *p);
2035void reiserfs_evict_inode(struct inode *inode);
2036int reiserfs_write_inode(struct inode *inode, struct writeback_control *wbc);
2037int reiserfs_get_block(struct inode *inode, sector_t block,
2038 struct buffer_head *bh_result, int create);
2039struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
2040 int fh_len, int fh_type);
2041struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
2042 int fh_len, int fh_type);
2043int reiserfs_encode_fh(struct dentry *dentry, __u32 * data, int *lenp,
2044 int connectable);
2045
2046int reiserfs_truncate_file(struct inode *, int update_timestamps);
2047void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset,
2048 int type, int key_length);
2049void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
2050 int version,
2051 loff_t offset, int type, int length, int entry_count);
2052struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key);
2053
2054struct reiserfs_security_handle;
2055int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
2056 struct inode *dir, int mode,
2057 const char *symname, loff_t i_size,
2058 struct dentry *dentry, struct inode *inode,
2059 struct reiserfs_security_handle *security);
2060
2061void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
2062 struct inode *inode, loff_t size);
2063
2064static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th,
2065 struct inode *inode)
2066{
2067 reiserfs_update_sd_size(th, inode, inode->i_size);
2068}
2069
2070void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode);
2071void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs);
2072int reiserfs_setattr(struct dentry *dentry, struct iattr *attr);
2073
2074int __reiserfs_write_begin(struct page *page, unsigned from, unsigned len);
2075
2076
2077void set_de_name_and_namelen(struct reiserfs_dir_entry *de);
2078int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
2079 struct treepath *path, struct reiserfs_dir_entry *de);
2080struct dentry *reiserfs_get_parent(struct dentry *);
2081
2082#ifdef CONFIG_REISERFS_PROC_INFO
2083int reiserfs_proc_info_init(struct super_block *sb);
2084int reiserfs_proc_info_done(struct super_block *sb);
2085int reiserfs_proc_info_global_init(void);
2086int reiserfs_proc_info_global_done(void);
2087
2088#define PROC_EXP( e ) e
2089
2090#define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data
2091#define PROC_INFO_MAX( sb, field, value ) \
2092 __PINFO( sb ).field = \
2093 max( REISERFS_SB( sb ) -> s_proc_info_data.field, value )
2094#define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) )
2095#define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) )
2096#define PROC_INFO_BH_STAT( sb, bh, level ) \
2097 PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \
2098 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
2099 PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
2100#else
2101static inline int reiserfs_proc_info_init(struct super_block *sb)
2102{
2103 return 0;
2104}
2105
2106static inline int reiserfs_proc_info_done(struct super_block *sb)
2107{
2108 return 0;
2109}
2110
2111static inline int reiserfs_proc_info_global_init(void)
2112{
2113 return 0;
2114}
2115
2116static inline int reiserfs_proc_info_global_done(void)
2117{
2118 return 0;
2119}
2120
2121#define PROC_EXP( e )
2122#define VOID_V ( ( void ) 0 )
2123#define PROC_INFO_MAX( sb, field, value ) VOID_V
2124#define PROC_INFO_INC( sb, field ) VOID_V
2125#define PROC_INFO_ADD( sb, field, val ) VOID_V
2126#define PROC_INFO_BH_STAT(sb, bh, n_node_level) VOID_V
2127#endif
2128
2129
2130extern const struct inode_operations reiserfs_dir_inode_operations;
2131extern const struct inode_operations reiserfs_symlink_inode_operations;
2132extern const struct inode_operations reiserfs_special_inode_operations;
2133extern const struct file_operations reiserfs_dir_operations;
2134int reiserfs_readdir_dentry(struct dentry *, void *, filldir_t, loff_t *);
2135
2136
2137int direct2indirect(struct reiserfs_transaction_handle *, struct inode *,
2138 struct treepath *, struct buffer_head *, loff_t);
2139int indirect2direct(struct reiserfs_transaction_handle *, struct inode *,
2140 struct page *, struct treepath *, const struct cpu_key *,
2141 loff_t, char *);
2142void reiserfs_unmap_buffer(struct buffer_head *);
2143
2144
2145extern const struct inode_operations reiserfs_file_inode_operations;
2146extern const struct file_operations reiserfs_file_operations;
2147extern const struct address_space_operations reiserfs_address_space_operations;
2148
2149
2150
2151int fix_nodes(int n_op_mode, struct tree_balance *tb,
2152 struct item_head *ins_ih, const void *);
2153void unfix_nodes(struct tree_balance *);
2154
2155
2156void __reiserfs_panic(struct super_block *s, const char *id,
2157 const char *function, const char *fmt, ...)
2158 __attribute__ ((noreturn));
2159#define reiserfs_panic(s, id, fmt, args...) \
2160 __reiserfs_panic(s, id, __func__, fmt, ##args)
2161void __reiserfs_error(struct super_block *s, const char *id,
2162 const char *function, const char *fmt, ...);
2163#define reiserfs_error(s, id, fmt, args...) \
2164 __reiserfs_error(s, id, __func__, fmt, ##args)
2165void reiserfs_info(struct super_block *s, const char *fmt, ...);
2166void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...);
2167void print_indirect_item(struct buffer_head *bh, int item_num);
2168void store_print_tb(struct tree_balance *tb);
2169void print_cur_tb(char *mes);
2170void print_de(struct reiserfs_dir_entry *de);
2171void print_bi(struct buffer_info *bi, char *mes);
2172#define PRINT_LEAF_ITEMS 1
2173#define PRINT_DIRECTORY_ITEMS 2
2174#define PRINT_DIRECT_ITEMS 4
2175void print_block(struct buffer_head *bh, ...);
2176void print_bmap(struct super_block *s, int silent);
2177void print_bmap_block(int i, char *data, int size, int silent);
2178
2179void print_objectid_map(struct super_block *s);
2180void print_block_head(struct buffer_head *bh, char *mes);
2181void check_leaf(struct buffer_head *bh);
2182void check_internal(struct buffer_head *bh);
2183void print_statistics(struct super_block *s);
2184char *reiserfs_hashname(int code);
2185
2186
2187int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
2188 int mov_bytes, struct buffer_head *Snew);
2189int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
2190int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
2191void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first,
2192 int del_num, int del_bytes);
2193void leaf_insert_into_buf(struct buffer_info *bi, int before,
2194 struct item_head *inserted_item_ih,
2195 const char *inserted_item_body, int zeros_number);
2196void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
2197 int pos_in_item, int paste_size, const char *body,
2198 int zeros_number);
2199void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
2200 int pos_in_item, int cut_size);
2201void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
2202 int new_entry_count, struct reiserfs_de_head *new_dehs,
2203 const char *records, int paste_size);
2204
2205int balance_internal(struct tree_balance *, int, int, struct item_head *,
2206 struct buffer_head **);
2207
2208
2209void do_balance_mark_leaf_dirty(struct tree_balance *tb,
2210 struct buffer_head *bh, int flag);
2211#define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty
2212#define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty
2213
2214void do_balance(struct tree_balance *tb, struct item_head *ih,
2215 const char *body, int flag);
2216void reiserfs_invalidate_buffer(struct tree_balance *tb,
2217 struct buffer_head *bh);
2218
2219int get_left_neighbor_position(struct tree_balance *tb, int h);
2220int get_right_neighbor_position(struct tree_balance *tb, int h);
2221void replace_key(struct tree_balance *tb, struct buffer_head *, int,
2222 struct buffer_head *, int);
2223void make_empty_node(struct buffer_info *);
2224struct buffer_head *get_FEB(struct tree_balance *);
2225
2226
2227
2228
2229
2230struct __reiserfs_blocknr_hint {
2231 struct inode *inode;
2232 sector_t block;
2233 struct in_core_key key;
2234 struct treepath *path;
2235
2236 struct reiserfs_transaction_handle *th;
2237
2238 b_blocknr_t beg, end;
2239 b_blocknr_t search_start;
2240
2241
2242 int prealloc_size;
2243
2244
2245 unsigned formatted_node:1;
2246
2247 unsigned preallocate:1;
2248};
2249
2250typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t;
2251
2252int reiserfs_parse_alloc_options(struct super_block *, char *);
2253void reiserfs_init_alloc_options(struct super_block *s);
2254
2255
2256
2257
2258
2259
2260__le32 reiserfs_choose_packing(struct inode *dir);
2261
2262int reiserfs_init_bitmap_cache(struct super_block *sb);
2263void reiserfs_free_bitmap_cache(struct super_block *sb);
2264void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info);
2265struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap);
2266int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
2267void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *,
2268 b_blocknr_t, int for_unformatted);
2269int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int,
2270 int);
2271static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb,
2272 b_blocknr_t * new_blocknrs,
2273 int amount_needed)
2274{
2275 reiserfs_blocknr_hint_t hint = {
2276 .th = tb->transaction_handle,
2277 .path = tb->tb_path,
2278 .inode = NULL,
2279 .key = tb->key,
2280 .block = 0,
2281 .formatted_node = 1
2282 };
2283 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed,
2284 0);
2285}
2286
2287static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle
2288 *th, struct inode *inode,
2289 b_blocknr_t * new_blocknrs,
2290 struct treepath *path,
2291 sector_t block)
2292{
2293 reiserfs_blocknr_hint_t hint = {
2294 .th = th,
2295 .path = path,
2296 .inode = inode,
2297 .block = block,
2298 .formatted_node = 0,
2299 .preallocate = 0
2300 };
2301 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2302}
2303
2304#ifdef REISERFS_PREALLOCATE
2305static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle
2306 *th, struct inode *inode,
2307 b_blocknr_t * new_blocknrs,
2308 struct treepath *path,
2309 sector_t block)
2310{
2311 reiserfs_blocknr_hint_t hint = {
2312 .th = th,
2313 .path = path,
2314 .inode = inode,
2315 .block = block,
2316 .formatted_node = 0,
2317 .preallocate = 1
2318 };
2319 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2320}
2321
2322void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th,
2323 struct inode *inode);
2324void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th);
2325#endif
2326
2327
2328__u32 keyed_hash(const signed char *msg, int len);
2329__u32 yura_hash(const signed char *msg, int len);
2330__u32 r5_hash(const signed char *msg, int len);
2331
2332
2333
2334
2335
2336#define reiserfs_test_and_set_le_bit ext2_set_bit
2337#define reiserfs_test_and_clear_le_bit ext2_clear_bit
2338#define reiserfs_test_le_bit ext2_test_bit
2339#define reiserfs_find_next_zero_le_bit ext2_find_next_zero_bit
2340
2341
2342
2343
2344
2345
2346
2347
2348#define SPARE_SPACE 500
2349
2350
2351long reiserfs_ioctl(struct file *filp, unsigned int cmd, unsigned long arg);
2352long reiserfs_compat_ioctl(struct file *filp,
2353 unsigned int cmd, unsigned long arg);
2354int reiserfs_unpack(struct inode *inode, struct file *filp);
2355
2356#endif
2357
2358#endif
2359