1
2
3
4
5#include <linux/reiserfs_fs.h>
6
7#include <linux/slab.h>
8#include <linux/interrupt.h>
9#include <linux/sched.h>
10#include <linux/bug.h>
11#include <linux/workqueue.h>
12#include <asm/unaligned.h>
13#include <linux/bitops.h>
14#include <linux/proc_fs.h>
15#include <linux/buffer_head.h>
16
17
18#define REISERFS_IOC32_UNPACK _IOW(0xCD, 1, int)
19#define REISERFS_IOC32_GETFLAGS FS_IOC32_GETFLAGS
20#define REISERFS_IOC32_SETFLAGS FS_IOC32_SETFLAGS
21#define REISERFS_IOC32_GETVERSION FS_IOC32_GETVERSION
22#define REISERFS_IOC32_SETVERSION FS_IOC32_SETVERSION
23
24struct reiserfs_journal_list;
25
26
27typedef enum {
28
29
30
31 i_item_key_version_mask = 0x0001,
32
33
34 i_stat_data_version_mask = 0x0002,
35
36 i_pack_on_close_mask = 0x0004,
37
38 i_nopack_mask = 0x0008,
39
40
41
42 i_link_saved_unlink_mask = 0x0010,
43 i_link_saved_truncate_mask = 0x0020,
44 i_has_xattr_dir = 0x0040,
45 i_data_log = 0x0080,
46} reiserfs_inode_flags;
47
48struct reiserfs_inode_info {
49 __u32 i_key[4];
50
51
52 __u32 i_flags;
53
54 __u32 i_first_direct_byte;
55
56
57 __u32 i_attrs;
58
59 int i_prealloc_block;
60 int i_prealloc_count;
61 struct list_head i_prealloc_list;
62
63
64 unsigned new_packing_locality:1;
65
66
67
68
69
70
71 unsigned int i_trans_id;
72 struct reiserfs_journal_list *i_jl;
73 atomic_t openers;
74 struct mutex tailpack;
75#ifdef CONFIG_REISERFS_FS_XATTR
76 struct rw_semaphore i_xattr_sem;
77#endif
78 struct inode vfs_inode;
79};
80
81typedef enum {
82 reiserfs_attrs_cleared = 0x00000001,
83} reiserfs_super_block_flags;
84
85
86
87
88#define sb_block_count(sbp) (le32_to_cpu((sbp)->s_v1.s_block_count))
89#define set_sb_block_count(sbp,v) ((sbp)->s_v1.s_block_count = cpu_to_le32(v))
90#define sb_free_blocks(sbp) (le32_to_cpu((sbp)->s_v1.s_free_blocks))
91#define set_sb_free_blocks(sbp,v) ((sbp)->s_v1.s_free_blocks = cpu_to_le32(v))
92#define sb_root_block(sbp) (le32_to_cpu((sbp)->s_v1.s_root_block))
93#define set_sb_root_block(sbp,v) ((sbp)->s_v1.s_root_block = cpu_to_le32(v))
94
95#define sb_jp_journal_1st_block(sbp) \
96 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_1st_block))
97#define set_sb_jp_journal_1st_block(sbp,v) \
98 ((sbp)->s_v1.s_journal.jp_journal_1st_block = cpu_to_le32(v))
99#define sb_jp_journal_dev(sbp) \
100 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_dev))
101#define set_sb_jp_journal_dev(sbp,v) \
102 ((sbp)->s_v1.s_journal.jp_journal_dev = cpu_to_le32(v))
103#define sb_jp_journal_size(sbp) \
104 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_size))
105#define set_sb_jp_journal_size(sbp,v) \
106 ((sbp)->s_v1.s_journal.jp_journal_size = cpu_to_le32(v))
107#define sb_jp_journal_trans_max(sbp) \
108 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_trans_max))
109#define set_sb_jp_journal_trans_max(sbp,v) \
110 ((sbp)->s_v1.s_journal.jp_journal_trans_max = cpu_to_le32(v))
111#define sb_jp_journal_magic(sbp) \
112 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_magic))
113#define set_sb_jp_journal_magic(sbp,v) \
114 ((sbp)->s_v1.s_journal.jp_journal_magic = cpu_to_le32(v))
115#define sb_jp_journal_max_batch(sbp) \
116 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_batch))
117#define set_sb_jp_journal_max_batch(sbp,v) \
118 ((sbp)->s_v1.s_journal.jp_journal_max_batch = cpu_to_le32(v))
119#define sb_jp_jourmal_max_commit_age(sbp) \
120 (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_commit_age))
121#define set_sb_jp_journal_max_commit_age(sbp,v) \
122 ((sbp)->s_v1.s_journal.jp_journal_max_commit_age = cpu_to_le32(v))
123
124#define sb_blocksize(sbp) (le16_to_cpu((sbp)->s_v1.s_blocksize))
125#define set_sb_blocksize(sbp,v) ((sbp)->s_v1.s_blocksize = cpu_to_le16(v))
126#define sb_oid_maxsize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_maxsize))
127#define set_sb_oid_maxsize(sbp,v) ((sbp)->s_v1.s_oid_maxsize = cpu_to_le16(v))
128#define sb_oid_cursize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_cursize))
129#define set_sb_oid_cursize(sbp,v) ((sbp)->s_v1.s_oid_cursize = cpu_to_le16(v))
130#define sb_umount_state(sbp) (le16_to_cpu((sbp)->s_v1.s_umount_state))
131#define set_sb_umount_state(sbp,v) ((sbp)->s_v1.s_umount_state = cpu_to_le16(v))
132#define sb_fs_state(sbp) (le16_to_cpu((sbp)->s_v1.s_fs_state))
133#define set_sb_fs_state(sbp,v) ((sbp)->s_v1.s_fs_state = cpu_to_le16(v))
134#define sb_hash_function_code(sbp) \
135 (le32_to_cpu((sbp)->s_v1.s_hash_function_code))
136#define set_sb_hash_function_code(sbp,v) \
137 ((sbp)->s_v1.s_hash_function_code = cpu_to_le32(v))
138#define sb_tree_height(sbp) (le16_to_cpu((sbp)->s_v1.s_tree_height))
139#define set_sb_tree_height(sbp,v) ((sbp)->s_v1.s_tree_height = cpu_to_le16(v))
140#define sb_bmap_nr(sbp) (le16_to_cpu((sbp)->s_v1.s_bmap_nr))
141#define set_sb_bmap_nr(sbp,v) ((sbp)->s_v1.s_bmap_nr = cpu_to_le16(v))
142#define sb_version(sbp) (le16_to_cpu((sbp)->s_v1.s_version))
143#define set_sb_version(sbp,v) ((sbp)->s_v1.s_version = cpu_to_le16(v))
144
145#define sb_mnt_count(sbp) (le16_to_cpu((sbp)->s_mnt_count))
146#define set_sb_mnt_count(sbp, v) ((sbp)->s_mnt_count = cpu_to_le16(v))
147
148#define sb_reserved_for_journal(sbp) \
149 (le16_to_cpu((sbp)->s_v1.s_reserved_for_journal))
150#define set_sb_reserved_for_journal(sbp,v) \
151 ((sbp)->s_v1.s_reserved_for_journal = cpu_to_le16(v))
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178#define JOURNAL_BLOCK_SIZE 4096
179#define JOURNAL_MAX_CNODE 1500
180#define JOURNAL_HASH_SIZE 8192
181#define JOURNAL_NUM_BITMAPS 5
182
183
184
185
186
187
188
189
190
191struct reiserfs_journal_cnode {
192 struct buffer_head *bh;
193 struct super_block *sb;
194 __u32 blocknr;
195 unsigned long state;
196 struct reiserfs_journal_list *jlist;
197 struct reiserfs_journal_cnode *next;
198 struct reiserfs_journal_cnode *prev;
199 struct reiserfs_journal_cnode *hprev;
200 struct reiserfs_journal_cnode *hnext;
201};
202
203struct reiserfs_bitmap_node {
204 int id;
205 char *data;
206 struct list_head list;
207};
208
209struct reiserfs_list_bitmap {
210 struct reiserfs_journal_list *journal_list;
211 struct reiserfs_bitmap_node **bitmaps;
212};
213
214
215
216
217
218
219
220struct reiserfs_journal_list {
221 unsigned long j_start;
222 unsigned long j_state;
223 unsigned long j_len;
224 atomic_t j_nonzerolen;
225 atomic_t j_commit_left;
226 atomic_t j_older_commits_done;
227 struct mutex j_commit_mutex;
228 unsigned int j_trans_id;
229 time_t j_timestamp;
230 struct reiserfs_list_bitmap *j_list_bitmap;
231 struct buffer_head *j_commit_bh;
232 struct reiserfs_journal_cnode *j_realblock;
233 struct reiserfs_journal_cnode *j_freedlist;
234
235 struct list_head j_list;
236
237
238 struct list_head j_working_list;
239
240
241 struct list_head j_tail_bh_list;
242
243 struct list_head j_bh_list;
244 int j_refcount;
245};
246
247struct reiserfs_journal {
248 struct buffer_head **j_ap_blocks;
249 struct reiserfs_journal_cnode *j_last;
250 struct reiserfs_journal_cnode *j_first;
251
252 struct block_device *j_dev_bd;
253 fmode_t j_dev_mode;
254 int j_1st_reserved_block;
255
256 unsigned long j_state;
257 unsigned int j_trans_id;
258 unsigned long j_mount_id;
259 unsigned long j_start;
260 unsigned long j_len;
261 unsigned long j_len_alloc;
262 atomic_t j_wcount;
263 unsigned long j_bcount;
264 unsigned long j_first_unflushed_offset;
265 unsigned j_last_flush_trans_id;
266 struct buffer_head *j_header_bh;
267
268 time_t j_trans_start_time;
269 struct mutex j_mutex;
270 struct mutex j_flush_mutex;
271 wait_queue_head_t j_join_wait;
272 atomic_t j_jlock;
273 int j_list_bitmap_index;
274 int j_must_wait;
275 int j_next_full_flush;
276 int j_next_async_flush;
277
278 int j_cnode_used;
279 int j_cnode_free;
280
281 unsigned int j_trans_max;
282 unsigned int j_max_batch;
283 unsigned int j_max_commit_age;
284 unsigned int j_max_trans_age;
285 unsigned int j_default_max_commit_age;
286
287 struct reiserfs_journal_cnode *j_cnode_free_list;
288 struct reiserfs_journal_cnode *j_cnode_free_orig;
289
290 struct reiserfs_journal_list *j_current_jl;
291 int j_free_bitmap_nodes;
292 int j_used_bitmap_nodes;
293
294 int j_num_lists;
295 int j_num_work_lists;
296
297
298 unsigned int j_last_flush_id;
299
300
301 unsigned int j_last_commit_id;
302
303 struct list_head j_bitmap_nodes;
304 struct list_head j_dirty_buffers;
305 spinlock_t j_dirty_buffers_lock;
306
307
308 struct list_head j_journal_list;
309
310 struct list_head j_working_list;
311
312 struct reiserfs_list_bitmap j_list_bitmap[JOURNAL_NUM_BITMAPS];
313 struct reiserfs_journal_cnode *j_hash_table[JOURNAL_HASH_SIZE];
314 struct reiserfs_journal_cnode *j_list_hash_table[JOURNAL_HASH_SIZE];
315
316 struct list_head j_prealloc_list;
317 int j_persistent_trans;
318 unsigned long j_max_trans_size;
319 unsigned long j_max_batch_size;
320
321 int j_errno;
322
323
324 struct delayed_work j_work;
325 struct super_block *j_work_sb;
326 atomic_t j_async_throttle;
327};
328
329enum journal_state_bits {
330 J_WRITERS_BLOCKED = 1,
331 J_WRITERS_QUEUED,
332 J_ABORTED,
333};
334
335#define JOURNAL_DESC_MAGIC "ReIsErLB"
336
337typedef __u32(*hashf_t) (const signed char *, int);
338
339struct reiserfs_bitmap_info {
340 __u32 free_count;
341};
342
343struct proc_dir_entry;
344
345#if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )
346typedef unsigned long int stat_cnt_t;
347typedef struct reiserfs_proc_info_data {
348 spinlock_t lock;
349 int exiting;
350 int max_hash_collisions;
351
352 stat_cnt_t breads;
353 stat_cnt_t bread_miss;
354 stat_cnt_t search_by_key;
355 stat_cnt_t search_by_key_fs_changed;
356 stat_cnt_t search_by_key_restarted;
357
358 stat_cnt_t insert_item_restarted;
359 stat_cnt_t paste_into_item_restarted;
360 stat_cnt_t cut_from_item_restarted;
361 stat_cnt_t delete_solid_item_restarted;
362 stat_cnt_t delete_item_restarted;
363
364 stat_cnt_t leaked_oid;
365 stat_cnt_t leaves_removable;
366
367
368 stat_cnt_t balance_at[5];
369
370 stat_cnt_t sbk_read_at[5];
371 stat_cnt_t sbk_fs_changed[5];
372 stat_cnt_t sbk_restarted[5];
373 stat_cnt_t items_at[5];
374 stat_cnt_t free_at[5];
375 stat_cnt_t can_node_be_removed[5];
376 long int lnum[5];
377 long int rnum[5];
378 long int lbytes[5];
379 long int rbytes[5];
380 stat_cnt_t get_neighbors[5];
381 stat_cnt_t get_neighbors_restart[5];
382 stat_cnt_t need_l_neighbor[5];
383 stat_cnt_t need_r_neighbor[5];
384
385 stat_cnt_t free_block;
386 struct __scan_bitmap_stats {
387 stat_cnt_t call;
388 stat_cnt_t wait;
389 stat_cnt_t bmap;
390 stat_cnt_t retry;
391 stat_cnt_t in_journal_hint;
392 stat_cnt_t in_journal_nohint;
393 stat_cnt_t stolen;
394 } scan_bitmap;
395 struct __journal_stats {
396 stat_cnt_t in_journal;
397 stat_cnt_t in_journal_bitmap;
398 stat_cnt_t in_journal_reusable;
399 stat_cnt_t lock_journal;
400 stat_cnt_t lock_journal_wait;
401 stat_cnt_t journal_being;
402 stat_cnt_t journal_relock_writers;
403 stat_cnt_t journal_relock_wcount;
404 stat_cnt_t mark_dirty;
405 stat_cnt_t mark_dirty_already;
406 stat_cnt_t mark_dirty_notjournal;
407 stat_cnt_t restore_prepared;
408 stat_cnt_t prepare;
409 stat_cnt_t prepare_retry;
410 } journal;
411} reiserfs_proc_info_data_t;
412#else
413typedef struct reiserfs_proc_info_data {
414} reiserfs_proc_info_data_t;
415#endif
416
417
418struct reiserfs_sb_info {
419 struct buffer_head *s_sbh;
420
421
422 struct reiserfs_super_block *s_rs;
423 struct reiserfs_bitmap_info *s_ap_bitmap;
424 struct reiserfs_journal *s_journal;
425 unsigned short s_mount_state;
426
427
428 struct mutex lock;
429
430 struct task_struct *lock_owner;
431
432 int lock_depth;
433
434
435 void (*end_io_handler) (struct buffer_head *, int);
436 hashf_t s_hash_function;
437
438
439 unsigned long s_mount_opt;
440
441
442
443 struct {
444 unsigned long bits;
445 unsigned long large_file_size;
446 int border;
447 int preallocmin;
448 int preallocsize;
449
450
451 } s_alloc_options;
452
453
454 wait_queue_head_t s_wait;
455
456 atomic_t s_generation_counter;
457
458 unsigned long s_properties;
459
460
461
462 int s_disk_reads;
463 int s_disk_writes;
464 int s_fix_nodes;
465 int s_do_balance;
466 int s_unneeded_left_neighbor;
467 int s_good_search_by_key_reada;
468 int s_bmaps;
469 int s_bmaps_without_search;
470 int s_direct2indirect;
471 int s_indirect2direct;
472
473
474
475 int s_is_unlinked_ok;
476 reiserfs_proc_info_data_t s_proc_info_data;
477 struct proc_dir_entry *procdir;
478 int reserved_blocks;
479 spinlock_t bitmap_lock;
480 struct dentry *priv_root;
481 struct dentry *xattr_root;
482 int j_errno;
483
484 int work_queued;
485 struct delayed_work old_work;
486 spinlock_t old_work_lock;
487
488#ifdef CONFIG_QUOTA
489 char *s_qf_names[MAXQUOTAS];
490 int s_jquota_fmt;
491#endif
492 char *s_jdev;
493#ifdef CONFIG_REISERFS_CHECK
494
495 struct tree_balance *cur_tb;
496
497
498
499
500
501
502
503#endif
504};
505
506
507#define REISERFS_3_5 0
508#define REISERFS_3_6 1
509#define REISERFS_OLD_FORMAT 2
510
511enum reiserfs_mount_options {
512
513 REISERFS_LARGETAIL,
514 REISERFS_SMALLTAIL,
515 REPLAYONLY,
516 REISERFS_CONVERT,
517
518
519
520
521
522
523
524
525
526
527
528
529
530 FORCE_TEA_HASH,
531 FORCE_RUPASOV_HASH,
532 FORCE_R5_HASH,
533 FORCE_HASH_DETECT,
534
535 REISERFS_DATA_LOG,
536 REISERFS_DATA_ORDERED,
537 REISERFS_DATA_WRITEBACK,
538
539
540
541
542
543 REISERFS_NO_BORDER,
544 REISERFS_NO_UNHASHED_RELOCATION,
545 REISERFS_HASHED_RELOCATION,
546 REISERFS_ATTRS,
547 REISERFS_XATTRS_USER,
548 REISERFS_POSIXACL,
549 REISERFS_EXPOSE_PRIVROOT,
550 REISERFS_BARRIER_NONE,
551 REISERFS_BARRIER_FLUSH,
552
553
554 REISERFS_ERROR_PANIC,
555 REISERFS_ERROR_RO,
556 REISERFS_ERROR_CONTINUE,
557
558 REISERFS_USRQUOTA,
559 REISERFS_GRPQUOTA,
560
561 REISERFS_TEST1,
562 REISERFS_TEST2,
563 REISERFS_TEST3,
564 REISERFS_TEST4,
565 REISERFS_UNSUPPORTED_OPT,
566};
567
568#define reiserfs_r5_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_R5_HASH))
569#define reiserfs_rupasov_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_RUPASOV_HASH))
570#define reiserfs_tea_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_TEA_HASH))
571#define reiserfs_hash_detect(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_HASH_DETECT))
572#define reiserfs_no_border(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_BORDER))
573#define reiserfs_no_unhashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_UNHASHED_RELOCATION))
574#define reiserfs_hashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_HASHED_RELOCATION))
575#define reiserfs_test4(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_TEST4))
576
577#define have_large_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_LARGETAIL))
578#define have_small_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_SMALLTAIL))
579#define replay_only(s) (REISERFS_SB(s)->s_mount_opt & (1 << REPLAYONLY))
580#define reiserfs_attrs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ATTRS))
581#define old_format_only(s) (REISERFS_SB(s)->s_properties & (1 << REISERFS_3_5))
582#define convert_reiserfs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_CONVERT))
583#define reiserfs_data_log(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_LOG))
584#define reiserfs_data_ordered(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_ORDERED))
585#define reiserfs_data_writeback(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_WRITEBACK))
586#define reiserfs_xattrs_user(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_XATTRS_USER))
587#define reiserfs_posixacl(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_POSIXACL))
588#define reiserfs_expose_privroot(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_EXPOSE_PRIVROOT))
589#define reiserfs_xattrs_optional(s) (reiserfs_xattrs_user(s) || reiserfs_posixacl(s))
590#define reiserfs_barrier_none(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_NONE))
591#define reiserfs_barrier_flush(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_FLUSH))
592
593#define reiserfs_error_panic(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_PANIC))
594#define reiserfs_error_ro(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_RO))
595
596void reiserfs_file_buffer(struct buffer_head *bh, int list);
597extern struct file_system_type reiserfs_fs_type;
598int reiserfs_resize(struct super_block *, unsigned long);
599
600#define CARRY_ON 0
601#define SCHEDULE_OCCURRED 1
602
603#define SB_BUFFER_WITH_SB(s) (REISERFS_SB(s)->s_sbh)
604#define SB_JOURNAL(s) (REISERFS_SB(s)->s_journal)
605#define SB_JOURNAL_1st_RESERVED_BLOCK(s) (SB_JOURNAL(s)->j_1st_reserved_block)
606#define SB_JOURNAL_LEN_FREE(s) (SB_JOURNAL(s)->j_journal_len_free)
607#define SB_AP_BITMAP(s) (REISERFS_SB(s)->s_ap_bitmap)
608
609#define SB_DISK_JOURNAL_HEAD(s) (SB_JOURNAL(s)->j_header_bh->)
610
611
612
613
614static inline char *reiserfs_bdevname(struct super_block *s)
615{
616 return (s == NULL) ? "Null superblock" : s->s_id;
617}
618
619#define reiserfs_is_journal_aborted(journal) (unlikely (__reiserfs_is_journal_aborted (journal)))
620static inline int __reiserfs_is_journal_aborted(struct reiserfs_journal
621 *journal)
622{
623 return test_bit(J_ABORTED, &journal->j_state);
624}
625
626
627
628
629
630
631void reiserfs_write_lock(struct super_block *s);
632void reiserfs_write_unlock(struct super_block *s);
633int reiserfs_write_lock_once(struct super_block *s);
634void reiserfs_write_unlock_once(struct super_block *s, int lock_depth);
635
636#ifdef CONFIG_REISERFS_CHECK
637void reiserfs_lock_check_recursive(struct super_block *s);
638#else
639static inline void reiserfs_lock_check_recursive(struct super_block *s) { }
640#endif
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669static inline void reiserfs_mutex_lock_safe(struct mutex *m,
670 struct super_block *s)
671{
672 reiserfs_lock_check_recursive(s);
673 reiserfs_write_unlock(s);
674 mutex_lock(m);
675 reiserfs_write_lock(s);
676}
677
678static inline void
679reiserfs_mutex_lock_nested_safe(struct mutex *m, unsigned int subclass,
680 struct super_block *s)
681{
682 reiserfs_lock_check_recursive(s);
683 reiserfs_write_unlock(s);
684 mutex_lock_nested(m, subclass);
685 reiserfs_write_lock(s);
686}
687
688static inline void
689reiserfs_down_read_safe(struct rw_semaphore *sem, struct super_block *s)
690{
691 reiserfs_lock_check_recursive(s);
692 reiserfs_write_unlock(s);
693 down_read(sem);
694 reiserfs_write_lock(s);
695}
696
697
698
699
700
701static inline void reiserfs_cond_resched(struct super_block *s)
702{
703 if (need_resched()) {
704 reiserfs_write_unlock(s);
705 schedule();
706 reiserfs_write_lock(s);
707 }
708}
709
710struct fid;
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735#define USE_INODE_GENERATION_COUNTER
736
737#define REISERFS_PREALLOCATE
738#define DISPLACE_NEW_PACKING_LOCALITIES
739#define PREALLOCATION_SIZE 9
740
741
742#define _ROUND_UP(x,n) (((x)+(n)-1u) & ~((n)-1u))
743
744
745
746
747#define ROUND_UP(x) _ROUND_UP(x,8LL)
748
749
750
751
752#define REISERFS_DEBUG_CODE 5
753
754void __reiserfs_warning(struct super_block *s, const char *id,
755 const char *func, const char *fmt, ...);
756#define reiserfs_warning(s, id, fmt, args...) \
757 __reiserfs_warning(s, id, __func__, fmt, ##args)
758
759
760
761#define __RASSERT(cond, scond, format, args...) \
762do { \
763 if (!(cond)) \
764 reiserfs_panic(NULL, "assertion failure", "(" #cond ") at " \
765 __FILE__ ":%i:%s: " format "\n", \
766 in_interrupt() ? -1 : task_pid_nr(current), \
767 __LINE__, __func__ , ##args); \
768} while (0)
769
770#define RASSERT(cond, format, args...) __RASSERT(cond, #cond, format, ##args)
771
772#if defined( CONFIG_REISERFS_CHECK )
773#define RFALSE(cond, format, args...) __RASSERT(!(cond), "!(" #cond ")", format, ##args)
774#else
775#define RFALSE( cond, format, args... ) do {;} while( 0 )
776#endif
777
778#define CONSTF __attribute_const__
779
780
781
782
783
784
785
786
787
788
789
790
791#define UNSET_HASH 0
792
793#define TEA_HASH 1
794#define YURA_HASH 2
795#define R5_HASH 3
796#define DEFAULT_HASH R5_HASH
797
798struct journal_params {
799 __le32 jp_journal_1st_block;
800
801 __le32 jp_journal_dev;
802 __le32 jp_journal_size;
803 __le32 jp_journal_trans_max;
804 __le32 jp_journal_magic;
805
806 __le32 jp_journal_max_batch;
807
808 __le32 jp_journal_max_commit_age;
809
810 __le32 jp_journal_max_trans_age;
811
812};
813
814
815struct reiserfs_super_block_v1 {
816 __le32 s_block_count;
817 __le32 s_free_blocks;
818 __le32 s_root_block;
819 struct journal_params s_journal;
820 __le16 s_blocksize;
821 __le16 s_oid_maxsize;
822
823 __le16 s_oid_cursize;
824 __le16 s_umount_state;
825
826 char s_magic[10];
827
828
829 __le16 s_fs_state;
830
831 __le32 s_hash_function_code;
832
833 __le16 s_tree_height;
834 __le16 s_bmap_nr;
835
836 __le16 s_version;
837
838 __le16 s_reserved_for_journal;
839
840
841} __attribute__ ((__packed__));
842
843#define SB_SIZE_V1 (sizeof(struct reiserfs_super_block_v1))
844
845
846struct reiserfs_super_block {
847 struct reiserfs_super_block_v1 s_v1;
848 __le32 s_inode_generation;
849 __le32 s_flags;
850 unsigned char s_uuid[16];
851 unsigned char s_label[16];
852 __le16 s_mnt_count;
853 __le16 s_max_mnt_count;
854 __le32 s_lastcheck;
855 __le32 s_check_interval;
856 char s_unused[76];
857
858
859
860} __attribute__ ((__packed__));
861
862#define SB_SIZE (sizeof(struct reiserfs_super_block))
863
864#define REISERFS_VERSION_1 0
865#define REISERFS_VERSION_2 2
866
867
868#define SB_DISK_SUPER_BLOCK(s) (REISERFS_SB(s)->s_rs)
869#define SB_V1_DISK_SUPER_BLOCK(s) (&(SB_DISK_SUPER_BLOCK(s)->s_v1))
870#define SB_BLOCKSIZE(s) \
871 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_blocksize))
872#define SB_BLOCK_COUNT(s) \
873 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_block_count))
874#define SB_FREE_BLOCKS(s) \
875 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks))
876#define SB_REISERFS_MAGIC(s) \
877 (SB_V1_DISK_SUPER_BLOCK(s)->s_magic)
878#define SB_ROOT_BLOCK(s) \
879 le32_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_root_block))
880#define SB_TREE_HEIGHT(s) \
881 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height))
882#define SB_REISERFS_STATE(s) \
883 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state))
884#define SB_VERSION(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_version))
885#define SB_BMAP_NR(s) le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr))
886
887#define PUT_SB_BLOCK_COUNT(s, val) \
888 do { SB_V1_DISK_SUPER_BLOCK(s)->s_block_count = cpu_to_le32(val); } while (0)
889#define PUT_SB_FREE_BLOCKS(s, val) \
890 do { SB_V1_DISK_SUPER_BLOCK(s)->s_free_blocks = cpu_to_le32(val); } while (0)
891#define PUT_SB_ROOT_BLOCK(s, val) \
892 do { SB_V1_DISK_SUPER_BLOCK(s)->s_root_block = cpu_to_le32(val); } while (0)
893#define PUT_SB_TREE_HEIGHT(s, val) \
894 do { SB_V1_DISK_SUPER_BLOCK(s)->s_tree_height = cpu_to_le16(val); } while (0)
895#define PUT_SB_REISERFS_STATE(s, val) \
896 do { SB_V1_DISK_SUPER_BLOCK(s)->s_umount_state = cpu_to_le16(val); } while (0)
897#define PUT_SB_VERSION(s, val) \
898 do { SB_V1_DISK_SUPER_BLOCK(s)->s_version = cpu_to_le16(val); } while (0)
899#define PUT_SB_BMAP_NR(s, val) \
900 do { SB_V1_DISK_SUPER_BLOCK(s)->s_bmap_nr = cpu_to_le16 (val); } while (0)
901
902#define SB_ONDISK_JP(s) (&SB_V1_DISK_SUPER_BLOCK(s)->s_journal)
903#define SB_ONDISK_JOURNAL_SIZE(s) \
904 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_size))
905#define SB_ONDISK_JOURNAL_1st_BLOCK(s) \
906 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_1st_block))
907#define SB_ONDISK_JOURNAL_DEVICE(s) \
908 le32_to_cpu ((SB_ONDISK_JP(s)->jp_journal_dev))
909#define SB_ONDISK_RESERVED_FOR_JOURNAL(s) \
910 le16_to_cpu ((SB_V1_DISK_SUPER_BLOCK(s)->s_reserved_for_journal))
911
912#define is_block_in_log_or_reserved_area(s, block) \
913 block >= SB_JOURNAL_1st_RESERVED_BLOCK(s) \
914 && block < SB_JOURNAL_1st_RESERVED_BLOCK(s) + \
915 ((!is_reiserfs_jr(SB_DISK_SUPER_BLOCK(s)) ? \
916 SB_ONDISK_JOURNAL_SIZE(s) + 1 : SB_ONDISK_RESERVED_FOR_JOURNAL(s)))
917
918int is_reiserfs_3_5(struct reiserfs_super_block *rs);
919int is_reiserfs_3_6(struct reiserfs_super_block *rs);
920int is_reiserfs_jr(struct reiserfs_super_block *rs);
921
922
923
924
925
926
927#define REISERFS_DISK_OFFSET_IN_BYTES (64 * 1024)
928#define REISERFS_FIRST_BLOCK unused_define
929#define REISERFS_JOURNAL_OFFSET_IN_BYTES REISERFS_DISK_OFFSET_IN_BYTES
930
931
932#define REISERFS_OLD_DISK_OFFSET_IN_BYTES (8 * 1024)
933
934
935#define CARRY_ON 0
936#define REPEAT_SEARCH -1
937#define IO_ERROR -2
938#define NO_DISK_SPACE -3
939#define NO_BALANCING_NEEDED (-4)
940#define NO_MORE_UNUSED_CONTIGUOUS_BLOCKS (-5)
941#define QUOTA_EXCEEDED -6
942
943typedef __u32 b_blocknr_t;
944typedef __le32 unp_t;
945
946struct unfm_nodeinfo {
947 unp_t unfm_nodenum;
948 unsigned short unfm_freespace;
949};
950
951
952
953#define KEY_FORMAT_3_5 0
954#define KEY_FORMAT_3_6 1
955
956
957#define STAT_DATA_V1 0
958#define STAT_DATA_V2 1
959
960static inline struct reiserfs_inode_info *REISERFS_I(const struct inode *inode)
961{
962 return container_of(inode, struct reiserfs_inode_info, vfs_inode);
963}
964
965static inline struct reiserfs_sb_info *REISERFS_SB(const struct super_block *sb)
966{
967 return sb->s_fs_info;
968}
969
970
971
972static inline __u32 reiserfs_bmap_count(struct super_block *sb)
973{
974 return (SB_BLOCK_COUNT(sb) - 1) / (sb->s_blocksize * 8) + 1;
975}
976
977static inline int bmap_would_wrap(unsigned bmap_nr)
978{
979 return bmap_nr > ((1LL << 16) - 1);
980}
981
982
983
984#define get_inode_item_key_version( inode ) \
985 ((REISERFS_I(inode)->i_flags & i_item_key_version_mask) ? KEY_FORMAT_3_6 : KEY_FORMAT_3_5)
986
987#define set_inode_item_key_version( inode, version ) \
988 ({ if((version)==KEY_FORMAT_3_6) \
989 REISERFS_I(inode)->i_flags |= i_item_key_version_mask; \
990 else \
991 REISERFS_I(inode)->i_flags &= ~i_item_key_version_mask; })
992
993#define get_inode_sd_version(inode) \
994 ((REISERFS_I(inode)->i_flags & i_stat_data_version_mask) ? STAT_DATA_V2 : STAT_DATA_V1)
995
996#define set_inode_sd_version(inode, version) \
997 ({ if((version)==STAT_DATA_V2) \
998 REISERFS_I(inode)->i_flags |= i_stat_data_version_mask; \
999 else \
1000 REISERFS_I(inode)->i_flags &= ~i_stat_data_version_mask; })
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012#define STORE_TAIL_IN_UNFM_S1(n_file_size,n_tail_size,n_block_size) \
1013(\
1014 (!(n_tail_size)) || \
1015 (((n_tail_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) || \
1016 ( (n_file_size) >= (n_block_size) * 4 ) || \
1017 ( ( (n_file_size) >= (n_block_size) * 3 ) && \
1018 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/4) ) || \
1019 ( ( (n_file_size) >= (n_block_size) * 2 ) && \
1020 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size))/2) ) || \
1021 ( ( (n_file_size) >= (n_block_size) ) && \
1022 ( (n_tail_size) >= (MAX_DIRECT_ITEM_LEN(n_block_size) * 3)/4) ) ) \
1023)
1024
1025
1026
1027
1028
1029
1030#define STORE_TAIL_IN_UNFM_S2(n_file_size,n_tail_size,n_block_size) \
1031(\
1032 (!(n_tail_size)) || \
1033 (((n_file_size) > MAX_DIRECT_ITEM_LEN(n_block_size)) ) \
1034)
1035
1036
1037
1038
1039#define REISERFS_VALID_FS 1
1040#define REISERFS_ERROR_FS 2
1041
1042
1043
1044
1045#define TYPE_STAT_DATA 0
1046#define TYPE_INDIRECT 1
1047#define TYPE_DIRECT 2
1048#define TYPE_DIRENTRY 3
1049#define TYPE_MAXTYPE 3
1050#define TYPE_ANY 15
1051
1052
1053
1054
1055
1056
1057
1058
1059struct offset_v1 {
1060 __le32 k_offset;
1061 __le32 k_uniqueness;
1062} __attribute__ ((__packed__));
1063
1064struct offset_v2 {
1065 __le64 v;
1066} __attribute__ ((__packed__));
1067
1068static inline __u16 offset_v2_k_type(const struct offset_v2 *v2)
1069{
1070 __u8 type = le64_to_cpu(v2->v) >> 60;
1071 return (type <= TYPE_MAXTYPE) ? type : TYPE_ANY;
1072}
1073
1074static inline void set_offset_v2_k_type(struct offset_v2 *v2, int type)
1075{
1076 v2->v =
1077 (v2->v & cpu_to_le64(~0ULL >> 4)) | cpu_to_le64((__u64) type << 60);
1078}
1079
1080static inline loff_t offset_v2_k_offset(const struct offset_v2 *v2)
1081{
1082 return le64_to_cpu(v2->v) & (~0ULL >> 4);
1083}
1084
1085static inline void set_offset_v2_k_offset(struct offset_v2 *v2, loff_t offset)
1086{
1087 offset &= (~0ULL >> 4);
1088 v2->v = (v2->v & cpu_to_le64(15ULL << 60)) | cpu_to_le64(offset);
1089}
1090
1091
1092
1093struct reiserfs_key {
1094 __le32 k_dir_id;
1095
1096 __le32 k_objectid;
1097 union {
1098 struct offset_v1 k_offset_v1;
1099 struct offset_v2 k_offset_v2;
1100 } __attribute__ ((__packed__)) u;
1101} __attribute__ ((__packed__));
1102
1103struct in_core_key {
1104 __u32 k_dir_id;
1105
1106 __u32 k_objectid;
1107 __u64 k_offset;
1108 __u8 k_type;
1109};
1110
1111struct cpu_key {
1112 struct in_core_key on_disk_key;
1113 int version;
1114 int key_length;
1115
1116};
1117
1118
1119
1120
1121
1122#define REISERFS_FULL_KEY_LEN 4
1123#define REISERFS_SHORT_KEY_LEN 2
1124
1125
1126#define FIRST_GREATER 1
1127#define SECOND_GREATER -1
1128#define KEYS_IDENTICAL 0
1129#define KEY_FOUND 1
1130#define KEY_NOT_FOUND 0
1131
1132#define KEY_SIZE (sizeof(struct reiserfs_key))
1133#define SHORT_KEY_SIZE (sizeof (__u32) + sizeof (__u32))
1134
1135
1136#define ITEM_FOUND 1
1137#define ITEM_NOT_FOUND 0
1138#define ENTRY_FOUND 1
1139#define ENTRY_NOT_FOUND 0
1140#define DIRECTORY_NOT_FOUND -1
1141#define REGULAR_FILE_FOUND -2
1142#define DIRECTORY_FOUND -3
1143#define BYTE_FOUND 1
1144#define BYTE_NOT_FOUND 0
1145#define FILE_NOT_FOUND -1
1146
1147#define POSITION_FOUND 1
1148#define POSITION_NOT_FOUND 0
1149
1150
1151#define NAME_FOUND 1
1152#define NAME_NOT_FOUND 0
1153#define GOTO_PREVIOUS_ITEM 2
1154#define NAME_FOUND_INVISIBLE 3
1155
1156
1157
1158
1159
1160
1161struct item_head {
1162
1163
1164 struct reiserfs_key ih_key;
1165 union {
1166
1167
1168
1169
1170
1171
1172 __le16 ih_free_space_reserved;
1173
1174
1175 __le16 ih_entry_count;
1176 } __attribute__ ((__packed__)) u;
1177 __le16 ih_item_len;
1178 __le16 ih_item_location;
1179
1180 __le16 ih_version;
1181
1182
1183
1184} __attribute__ ((__packed__));
1185
1186#define IH_SIZE (sizeof(struct item_head))
1187
1188#define ih_free_space(ih) le16_to_cpu((ih)->u.ih_free_space_reserved)
1189#define ih_version(ih) le16_to_cpu((ih)->ih_version)
1190#define ih_entry_count(ih) le16_to_cpu((ih)->u.ih_entry_count)
1191#define ih_location(ih) le16_to_cpu((ih)->ih_item_location)
1192#define ih_item_len(ih) le16_to_cpu((ih)->ih_item_len)
1193
1194#define put_ih_free_space(ih, val) do { (ih)->u.ih_free_space_reserved = cpu_to_le16(val); } while(0)
1195#define put_ih_version(ih, val) do { (ih)->ih_version = cpu_to_le16(val); } while (0)
1196#define put_ih_entry_count(ih, val) do { (ih)->u.ih_entry_count = cpu_to_le16(val); } while (0)
1197#define put_ih_location(ih, val) do { (ih)->ih_item_location = cpu_to_le16(val); } while (0)
1198#define put_ih_item_len(ih, val) do { (ih)->ih_item_len = cpu_to_le16(val); } while (0)
1199
1200#define unreachable_item(ih) (ih_version(ih) & (1 << 15))
1201
1202#define get_ih_free_space(ih) (ih_version (ih) == KEY_FORMAT_3_6 ? 0 : ih_free_space (ih))
1203#define set_ih_free_space(ih,val) put_ih_free_space((ih), ((ih_version(ih) == KEY_FORMAT_3_6) ? 0 : (val)))
1204
1205
1206
1207
1208
1209
1210
1211#define get_block_num(p, i) get_unaligned_le32((p) + (i))
1212#define put_block_num(p, i, v) put_unaligned_le32((v), (p) + (i))
1213
1214
1215
1216
1217#define V1_SD_UNIQUENESS 0
1218#define V1_INDIRECT_UNIQUENESS 0xfffffffe
1219#define V1_DIRECT_UNIQUENESS 0xffffffff
1220#define V1_DIRENTRY_UNIQUENESS 500
1221#define V1_ANY_UNIQUENESS 555
1222
1223
1224
1225
1226static inline int uniqueness2type(__u32 uniqueness) CONSTF;
1227static inline int uniqueness2type(__u32 uniqueness)
1228{
1229 switch ((int)uniqueness) {
1230 case V1_SD_UNIQUENESS:
1231 return TYPE_STAT_DATA;
1232 case V1_INDIRECT_UNIQUENESS:
1233 return TYPE_INDIRECT;
1234 case V1_DIRECT_UNIQUENESS:
1235 return TYPE_DIRECT;
1236 case V1_DIRENTRY_UNIQUENESS:
1237 return TYPE_DIRENTRY;
1238 case V1_ANY_UNIQUENESS:
1239 default:
1240 return TYPE_ANY;
1241 }
1242}
1243
1244static inline __u32 type2uniqueness(int type) CONSTF;
1245static inline __u32 type2uniqueness(int type)
1246{
1247 switch (type) {
1248 case TYPE_STAT_DATA:
1249 return V1_SD_UNIQUENESS;
1250 case TYPE_INDIRECT:
1251 return V1_INDIRECT_UNIQUENESS;
1252 case TYPE_DIRECT:
1253 return V1_DIRECT_UNIQUENESS;
1254 case TYPE_DIRENTRY:
1255 return V1_DIRENTRY_UNIQUENESS;
1256 case TYPE_ANY:
1257 default:
1258 return V1_ANY_UNIQUENESS;
1259 }
1260}
1261
1262
1263
1264
1265
1266
1267static inline loff_t le_key_k_offset(int version,
1268 const struct reiserfs_key *key)
1269{
1270 return (version == KEY_FORMAT_3_5) ?
1271 le32_to_cpu(key->u.k_offset_v1.k_offset) :
1272 offset_v2_k_offset(&(key->u.k_offset_v2));
1273}
1274
1275static inline loff_t le_ih_k_offset(const struct item_head *ih)
1276{
1277 return le_key_k_offset(ih_version(ih), &(ih->ih_key));
1278}
1279
1280static inline loff_t le_key_k_type(int version, const struct reiserfs_key *key)
1281{
1282 return (version == KEY_FORMAT_3_5) ?
1283 uniqueness2type(le32_to_cpu(key->u.k_offset_v1.k_uniqueness)) :
1284 offset_v2_k_type(&(key->u.k_offset_v2));
1285}
1286
1287static inline loff_t le_ih_k_type(const struct item_head *ih)
1288{
1289 return le_key_k_type(ih_version(ih), &(ih->ih_key));
1290}
1291
1292static inline void set_le_key_k_offset(int version, struct reiserfs_key *key,
1293 loff_t offset)
1294{
1295 (version == KEY_FORMAT_3_5) ? (void)(key->u.k_offset_v1.k_offset = cpu_to_le32(offset)) :
1296 (void)(set_offset_v2_k_offset(&(key->u.k_offset_v2), offset));
1297}
1298
1299static inline void set_le_ih_k_offset(struct item_head *ih, loff_t offset)
1300{
1301 set_le_key_k_offset(ih_version(ih), &(ih->ih_key), offset);
1302}
1303
1304static inline void set_le_key_k_type(int version, struct reiserfs_key *key,
1305 int type)
1306{
1307 (version == KEY_FORMAT_3_5) ?
1308 (void)(key->u.k_offset_v1.k_uniqueness =
1309 cpu_to_le32(type2uniqueness(type)))
1310 : (void)(set_offset_v2_k_type(&(key->u.k_offset_v2), type));
1311}
1312
1313static inline void set_le_ih_k_type(struct item_head *ih, int type)
1314{
1315 set_le_key_k_type(ih_version(ih), &(ih->ih_key), type);
1316}
1317
1318static inline int is_direntry_le_key(int version, struct reiserfs_key *key)
1319{
1320 return le_key_k_type(version, key) == TYPE_DIRENTRY;
1321}
1322
1323static inline int is_direct_le_key(int version, struct reiserfs_key *key)
1324{
1325 return le_key_k_type(version, key) == TYPE_DIRECT;
1326}
1327
1328static inline int is_indirect_le_key(int version, struct reiserfs_key *key)
1329{
1330 return le_key_k_type(version, key) == TYPE_INDIRECT;
1331}
1332
1333static inline int is_statdata_le_key(int version, struct reiserfs_key *key)
1334{
1335 return le_key_k_type(version, key) == TYPE_STAT_DATA;
1336}
1337
1338
1339
1340
1341static inline int is_direntry_le_ih(struct item_head *ih)
1342{
1343 return is_direntry_le_key(ih_version(ih), &ih->ih_key);
1344}
1345
1346static inline int is_direct_le_ih(struct item_head *ih)
1347{
1348 return is_direct_le_key(ih_version(ih), &ih->ih_key);
1349}
1350
1351static inline int is_indirect_le_ih(struct item_head *ih)
1352{
1353 return is_indirect_le_key(ih_version(ih), &ih->ih_key);
1354}
1355
1356static inline int is_statdata_le_ih(struct item_head *ih)
1357{
1358 return is_statdata_le_key(ih_version(ih), &ih->ih_key);
1359}
1360
1361
1362
1363
1364static inline loff_t cpu_key_k_offset(const struct cpu_key *key)
1365{
1366 return key->on_disk_key.k_offset;
1367}
1368
1369static inline loff_t cpu_key_k_type(const struct cpu_key *key)
1370{
1371 return key->on_disk_key.k_type;
1372}
1373
1374static inline void set_cpu_key_k_offset(struct cpu_key *key, loff_t offset)
1375{
1376 key->on_disk_key.k_offset = offset;
1377}
1378
1379static inline void set_cpu_key_k_type(struct cpu_key *key, int type)
1380{
1381 key->on_disk_key.k_type = type;
1382}
1383
1384static inline void cpu_key_k_offset_dec(struct cpu_key *key)
1385{
1386 key->on_disk_key.k_offset--;
1387}
1388
1389#define is_direntry_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRENTRY)
1390#define is_direct_cpu_key(key) (cpu_key_k_type (key) == TYPE_DIRECT)
1391#define is_indirect_cpu_key(key) (cpu_key_k_type (key) == TYPE_INDIRECT)
1392#define is_statdata_cpu_key(key) (cpu_key_k_type (key) == TYPE_STAT_DATA)
1393
1394
1395#define is_direntry_cpu_ih(ih) (is_direntry_cpu_key (&((ih)->ih_key)))
1396#define is_direct_cpu_ih(ih) (is_direct_cpu_key (&((ih)->ih_key)))
1397#define is_indirect_cpu_ih(ih) (is_indirect_cpu_key (&((ih)->ih_key)))
1398#define is_statdata_cpu_ih(ih) (is_statdata_cpu_key (&((ih)->ih_key)))
1399
1400#define I_K_KEY_IN_ITEM(ih, key, n_blocksize) \
1401 (!COMP_SHORT_KEYS(ih, key) && \
1402 I_OFF_BYTE_IN_ITEM(ih, k_offset(key), n_blocksize))
1403
1404
1405#define MAX_ITEM_LEN(block_size) (block_size - BLKH_SIZE - IH_SIZE)
1406#define MIN_ITEM_LEN 1
1407
1408
1409#define REISERFS_ROOT_OBJECTID 2
1410#define REISERFS_ROOT_PARENT_OBJECTID 1
1411
1412extern struct reiserfs_key root_key;
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425struct block_head {
1426 __le16 blk_level;
1427 __le16 blk_nr_item;
1428 __le16 blk_free_space;
1429 __le16 blk_reserved;
1430
1431 struct reiserfs_key blk_right_delim_key;
1432};
1433
1434#define BLKH_SIZE (sizeof(struct block_head))
1435#define blkh_level(p_blkh) (le16_to_cpu((p_blkh)->blk_level))
1436#define blkh_nr_item(p_blkh) (le16_to_cpu((p_blkh)->blk_nr_item))
1437#define blkh_free_space(p_blkh) (le16_to_cpu((p_blkh)->blk_free_space))
1438#define blkh_reserved(p_blkh) (le16_to_cpu((p_blkh)->blk_reserved))
1439#define set_blkh_level(p_blkh,val) ((p_blkh)->blk_level = cpu_to_le16(val))
1440#define set_blkh_nr_item(p_blkh,val) ((p_blkh)->blk_nr_item = cpu_to_le16(val))
1441#define set_blkh_free_space(p_blkh,val) ((p_blkh)->blk_free_space = cpu_to_le16(val))
1442#define set_blkh_reserved(p_blkh,val) ((p_blkh)->blk_reserved = cpu_to_le16(val))
1443#define blkh_right_delim_key(p_blkh) ((p_blkh)->blk_right_delim_key)
1444#define set_blkh_right_delim_key(p_blkh,val) ((p_blkh)->blk_right_delim_key = val)
1445
1446
1447
1448
1449
1450#define FREE_LEVEL 0
1451
1452
1453
1454
1455#define DISK_LEAF_NODE_LEVEL 1
1456
1457
1458#define B_BLK_HEAD(bh) ((struct block_head *)((bh)->b_data))
1459
1460#define B_NR_ITEMS(bh) (blkh_nr_item(B_BLK_HEAD(bh)))
1461#define B_LEVEL(bh) (blkh_level(B_BLK_HEAD(bh)))
1462#define B_FREE_SPACE(bh) (blkh_free_space(B_BLK_HEAD(bh)))
1463
1464#define PUT_B_NR_ITEMS(bh, val) do { set_blkh_nr_item(B_BLK_HEAD(bh), val); } while (0)
1465#define PUT_B_LEVEL(bh, val) do { set_blkh_level(B_BLK_HEAD(bh), val); } while (0)
1466#define PUT_B_FREE_SPACE(bh, val) do { set_blkh_free_space(B_BLK_HEAD(bh), val); } while (0)
1467
1468
1469#define B_PRIGHT_DELIM_KEY(bh) (&(blk_right_delim_key(B_BLK_HEAD(bh))))
1470
1471
1472#define B_IS_ITEMS_LEVEL(bh) (B_LEVEL(bh) == DISK_LEAF_NODE_LEVEL)
1473
1474
1475#define B_IS_KEYS_LEVEL(bh) (B_LEVEL(bh) > DISK_LEAF_NODE_LEVEL \
1476 && B_LEVEL(bh) <= MAX_HEIGHT)
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486struct stat_data_v1 {
1487 __le16 sd_mode;
1488 __le16 sd_nlink;
1489 __le16 sd_uid;
1490 __le16 sd_gid;
1491 __le32 sd_size;
1492 __le32 sd_atime;
1493 __le32 sd_mtime;
1494 __le32 sd_ctime;
1495 union {
1496 __le32 sd_rdev;
1497 __le32 sd_blocks;
1498 } __attribute__ ((__packed__)) u;
1499 __le32 sd_first_direct_byte;
1500
1501
1502
1503
1504
1505
1506
1507
1508} __attribute__ ((__packed__));
1509
1510#define SD_V1_SIZE (sizeof(struct stat_data_v1))
1511#define stat_data_v1(ih) (ih_version (ih) == KEY_FORMAT_3_5)
1512#define sd_v1_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
1513#define set_sd_v1_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
1514#define sd_v1_nlink(sdp) (le16_to_cpu((sdp)->sd_nlink))
1515#define set_sd_v1_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le16(v))
1516#define sd_v1_uid(sdp) (le16_to_cpu((sdp)->sd_uid))
1517#define set_sd_v1_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le16(v))
1518#define sd_v1_gid(sdp) (le16_to_cpu((sdp)->sd_gid))
1519#define set_sd_v1_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le16(v))
1520#define sd_v1_size(sdp) (le32_to_cpu((sdp)->sd_size))
1521#define set_sd_v1_size(sdp,v) ((sdp)->sd_size = cpu_to_le32(v))
1522#define sd_v1_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
1523#define set_sd_v1_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
1524#define sd_v1_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
1525#define set_sd_v1_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
1526#define sd_v1_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
1527#define set_sd_v1_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
1528#define sd_v1_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
1529#define set_sd_v1_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
1530#define sd_v1_blocks(sdp) (le32_to_cpu((sdp)->u.sd_blocks))
1531#define set_sd_v1_blocks(sdp,v) ((sdp)->u.sd_blocks = cpu_to_le32(v))
1532#define sd_v1_first_direct_byte(sdp) \
1533 (le32_to_cpu((sdp)->sd_first_direct_byte))
1534#define set_sd_v1_first_direct_byte(sdp,v) \
1535 ((sdp)->sd_first_direct_byte = cpu_to_le32(v))
1536
1537
1538
1539
1540
1541#define REISERFS_IMMUTABLE_FL FS_IMMUTABLE_FL
1542#define REISERFS_APPEND_FL FS_APPEND_FL
1543#define REISERFS_SYNC_FL FS_SYNC_FL
1544#define REISERFS_NOATIME_FL FS_NOATIME_FL
1545#define REISERFS_NODUMP_FL FS_NODUMP_FL
1546#define REISERFS_SECRM_FL FS_SECRM_FL
1547#define REISERFS_UNRM_FL FS_UNRM_FL
1548#define REISERFS_COMPR_FL FS_COMPR_FL
1549#define REISERFS_NOTAIL_FL FS_NOTAIL_FL
1550
1551
1552#define REISERFS_INHERIT_MASK ( REISERFS_IMMUTABLE_FL | \
1553 REISERFS_SYNC_FL | \
1554 REISERFS_NOATIME_FL | \
1555 REISERFS_NODUMP_FL | \
1556 REISERFS_SECRM_FL | \
1557 REISERFS_COMPR_FL | \
1558 REISERFS_NOTAIL_FL )
1559
1560
1561
1562struct stat_data {
1563 __le16 sd_mode;
1564 __le16 sd_attrs;
1565 __le32 sd_nlink;
1566 __le64 sd_size;
1567 __le32 sd_uid;
1568 __le32 sd_gid;
1569 __le32 sd_atime;
1570 __le32 sd_mtime;
1571 __le32 sd_ctime;
1572 __le32 sd_blocks;
1573 union {
1574 __le32 sd_rdev;
1575 __le32 sd_generation;
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585 } __attribute__ ((__packed__)) u;
1586} __attribute__ ((__packed__));
1587
1588
1589
1590#define SD_SIZE (sizeof(struct stat_data))
1591#define SD_V2_SIZE SD_SIZE
1592#define stat_data_v2(ih) (ih_version (ih) == KEY_FORMAT_3_6)
1593#define sd_v2_mode(sdp) (le16_to_cpu((sdp)->sd_mode))
1594#define set_sd_v2_mode(sdp,v) ((sdp)->sd_mode = cpu_to_le16(v))
1595
1596
1597#define sd_v2_nlink(sdp) (le32_to_cpu((sdp)->sd_nlink))
1598#define set_sd_v2_nlink(sdp,v) ((sdp)->sd_nlink = cpu_to_le32(v))
1599#define sd_v2_size(sdp) (le64_to_cpu((sdp)->sd_size))
1600#define set_sd_v2_size(sdp,v) ((sdp)->sd_size = cpu_to_le64(v))
1601#define sd_v2_uid(sdp) (le32_to_cpu((sdp)->sd_uid))
1602#define set_sd_v2_uid(sdp,v) ((sdp)->sd_uid = cpu_to_le32(v))
1603#define sd_v2_gid(sdp) (le32_to_cpu((sdp)->sd_gid))
1604#define set_sd_v2_gid(sdp,v) ((sdp)->sd_gid = cpu_to_le32(v))
1605#define sd_v2_atime(sdp) (le32_to_cpu((sdp)->sd_atime))
1606#define set_sd_v2_atime(sdp,v) ((sdp)->sd_atime = cpu_to_le32(v))
1607#define sd_v2_mtime(sdp) (le32_to_cpu((sdp)->sd_mtime))
1608#define set_sd_v2_mtime(sdp,v) ((sdp)->sd_mtime = cpu_to_le32(v))
1609#define sd_v2_ctime(sdp) (le32_to_cpu((sdp)->sd_ctime))
1610#define set_sd_v2_ctime(sdp,v) ((sdp)->sd_ctime = cpu_to_le32(v))
1611#define sd_v2_blocks(sdp) (le32_to_cpu((sdp)->sd_blocks))
1612#define set_sd_v2_blocks(sdp,v) ((sdp)->sd_blocks = cpu_to_le32(v))
1613#define sd_v2_rdev(sdp) (le32_to_cpu((sdp)->u.sd_rdev))
1614#define set_sd_v2_rdev(sdp,v) ((sdp)->u.sd_rdev = cpu_to_le32(v))
1615#define sd_v2_generation(sdp) (le32_to_cpu((sdp)->u.sd_generation))
1616#define set_sd_v2_generation(sdp,v) ((sdp)->u.sd_generation = cpu_to_le32(v))
1617#define sd_v2_attrs(sdp) (le16_to_cpu((sdp)->sd_attrs))
1618#define set_sd_v2_attrs(sdp,v) ((sdp)->sd_attrs = cpu_to_le16(v))
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636#define SD_OFFSET 0
1637#define SD_UNIQUENESS 0
1638#define DOT_OFFSET 1
1639#define DOT_DOT_OFFSET 2
1640#define DIRENTRY_UNIQUENESS 500
1641
1642
1643#define FIRST_ITEM_OFFSET 1
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654struct reiserfs_de_head {
1655 __le32 deh_offset;
1656 __le32 deh_dir_id;
1657
1658 __le32 deh_objectid;
1659 __le16 deh_location;
1660 __le16 deh_state;
1661
1662} __attribute__ ((__packed__));
1663#define DEH_SIZE sizeof(struct reiserfs_de_head)
1664#define deh_offset(p_deh) (le32_to_cpu((p_deh)->deh_offset))
1665#define deh_dir_id(p_deh) (le32_to_cpu((p_deh)->deh_dir_id))
1666#define deh_objectid(p_deh) (le32_to_cpu((p_deh)->deh_objectid))
1667#define deh_location(p_deh) (le16_to_cpu((p_deh)->deh_location))
1668#define deh_state(p_deh) (le16_to_cpu((p_deh)->deh_state))
1669
1670#define put_deh_offset(p_deh,v) ((p_deh)->deh_offset = cpu_to_le32((v)))
1671#define put_deh_dir_id(p_deh,v) ((p_deh)->deh_dir_id = cpu_to_le32((v)))
1672#define put_deh_objectid(p_deh,v) ((p_deh)->deh_objectid = cpu_to_le32((v)))
1673#define put_deh_location(p_deh,v) ((p_deh)->deh_location = cpu_to_le16((v)))
1674#define put_deh_state(p_deh,v) ((p_deh)->deh_state = cpu_to_le16((v)))
1675
1676
1677#define EMPTY_DIR_SIZE \
1678(DEH_SIZE * 2 + ROUND_UP (strlen (".")) + ROUND_UP (strlen ("..")))
1679
1680
1681#define EMPTY_DIR_SIZE_V1 (DEH_SIZE * 2 + 3)
1682
1683#define DEH_Statdata 0
1684#define DEH_Visible 2
1685
1686
1687#if BITS_PER_LONG == 64 || defined(__s390__) || defined(__hppa__)
1688# define ADDR_UNALIGNED_BITS (3)
1689#endif
1690
1691
1692
1693
1694#ifdef ADDR_UNALIGNED_BITS
1695
1696# define aligned_address(addr) ((void *)((long)(addr) & ~((1UL << ADDR_UNALIGNED_BITS) - 1)))
1697# define unaligned_offset(addr) (((int)((long)(addr) & ((1 << ADDR_UNALIGNED_BITS) - 1))) << 3)
1698
1699# define set_bit_unaligned(nr, addr) \
1700 __test_and_set_bit_le((nr) + unaligned_offset(addr), aligned_address(addr))
1701# define clear_bit_unaligned(nr, addr) \
1702 __test_and_clear_bit_le((nr) + unaligned_offset(addr), aligned_address(addr))
1703# define test_bit_unaligned(nr, addr) \
1704 test_bit_le((nr) + unaligned_offset(addr), aligned_address(addr))
1705
1706#else
1707
1708# define set_bit_unaligned(nr, addr) __test_and_set_bit_le(nr, addr)
1709# define clear_bit_unaligned(nr, addr) __test_and_clear_bit_le(nr, addr)
1710# define test_bit_unaligned(nr, addr) test_bit_le(nr, addr)
1711
1712#endif
1713
1714#define mark_de_with_sd(deh) set_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1715#define mark_de_without_sd(deh) clear_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1716#define mark_de_visible(deh) set_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1717#define mark_de_hidden(deh) clear_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1718
1719#define de_with_sd(deh) test_bit_unaligned (DEH_Statdata, &((deh)->deh_state))
1720#define de_visible(deh) test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1721#define de_hidden(deh) !test_bit_unaligned (DEH_Visible, &((deh)->deh_state))
1722
1723extern void make_empty_dir_item_v1(char *body, __le32 dirid, __le32 objid,
1724 __le32 par_dirid, __le32 par_objid);
1725extern void make_empty_dir_item(char *body, __le32 dirid, __le32 objid,
1726 __le32 par_dirid, __le32 par_objid);
1727
1728
1729
1730#define B_I_PITEM(bh,ih) ( (bh)->b_data + ih_location(ih) )
1731#define B_I_DEH(bh,ih) ((struct reiserfs_de_head *)(B_I_PITEM(bh,ih)))
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743static inline int entry_length(const struct buffer_head *bh,
1744 const struct item_head *ih, int pos_in_item)
1745{
1746 struct reiserfs_de_head *deh;
1747
1748 deh = B_I_DEH(bh, ih) + pos_in_item;
1749 if (pos_in_item)
1750 return deh_location(deh - 1) - deh_location(deh);
1751
1752 return ih_item_len(ih) - deh_location(deh);
1753}
1754
1755
1756#define I_ENTRY_COUNT(ih) (ih_entry_count((ih)))
1757
1758
1759#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))))
1760
1761
1762#define REISERFS_MAX_NAME(block_size) 255
1763
1764
1765
1766
1767
1768struct reiserfs_dir_entry {
1769 struct buffer_head *de_bh;
1770 int de_item_num;
1771 struct item_head *de_ih;
1772 int de_entry_num;
1773 struct reiserfs_de_head *de_deh;
1774 int de_entrylen;
1775 int de_namelen;
1776 char *de_name;
1777 unsigned long *de_gen_number_bit_string;
1778
1779 __u32 de_dir_id;
1780 __u32 de_objectid;
1781
1782 struct cpu_key de_entry_key;
1783};
1784
1785
1786
1787
1788#define B_I_DEH_ENTRY_FILE_NAME(bh,ih,deh) (B_I_PITEM (bh, ih) + deh_location(deh))
1789
1790
1791#define I_DEH_N_ENTRY_FILE_NAME_LENGTH(ih,deh,entry_num) \
1792(I_DEH_N_ENTRY_LENGTH (ih, deh, entry_num) - (de_with_sd (deh) ? SD_SIZE : 0))
1793
1794
1795#define GET_HASH_VALUE(offset) ((offset) & 0x7fffff80LL)
1796
1797#define GET_GENERATION_NUMBER(offset) ((offset) & 0x7fLL)
1798#define MAX_GENERATION_NUMBER 127
1799
1800#define SET_GENERATION_NUMBER(offset,gen_number) (GET_HASH_VALUE(offset)|(gen_number))
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816struct disk_child {
1817 __le32 dc_block_number;
1818 __le16 dc_size;
1819 __le16 dc_reserved;
1820};
1821
1822#define DC_SIZE (sizeof(struct disk_child))
1823#define dc_block_number(dc_p) (le32_to_cpu((dc_p)->dc_block_number))
1824#define dc_size(dc_p) (le16_to_cpu((dc_p)->dc_size))
1825#define put_dc_block_number(dc_p, val) do { (dc_p)->dc_block_number = cpu_to_le32(val); } while(0)
1826#define put_dc_size(dc_p, val) do { (dc_p)->dc_size = cpu_to_le16(val); } while(0)
1827
1828
1829#define B_N_CHILD(bh, n_pos) ((struct disk_child *)\
1830((bh)->b_data + BLKH_SIZE + B_NR_ITEMS(bh) * KEY_SIZE + DC_SIZE * (n_pos)))
1831
1832
1833#define B_N_CHILD_NUM(bh, n_pos) (dc_block_number(B_N_CHILD(bh, n_pos)))
1834#define PUT_B_N_CHILD_NUM(bh, n_pos, val) \
1835 (put_dc_block_number(B_N_CHILD(bh, n_pos), val))
1836
1837
1838
1839#define MAX_CHILD_SIZE(bh) ((int)( (bh)->b_size - BLKH_SIZE ))
1840
1841
1842#define B_CHILD_SIZE(cur) (MAX_CHILD_SIZE(cur)-(B_FREE_SPACE(cur)))
1843
1844
1845#define MAX_NR_KEY(bh) ( (MAX_CHILD_SIZE(bh)-DC_SIZE)/(KEY_SIZE+DC_SIZE) )
1846#define MIN_NR_KEY(bh) (MAX_NR_KEY(bh)/2)
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860struct path_element {
1861 struct buffer_head *pe_buffer;
1862 int pe_position;
1863
1864};
1865
1866#define MAX_HEIGHT 5
1867#define EXTENDED_MAX_HEIGHT 7
1868#define FIRST_PATH_ELEMENT_OFFSET 2
1869
1870#define ILLEGAL_PATH_ELEMENT_OFFSET 1
1871#define MAX_FEB_SIZE 6
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890#define PATH_READA 0x1
1891#define PATH_READA_BACK 0x2
1892
1893struct treepath {
1894 int path_length;
1895 int reada;
1896 struct path_element path_elements[EXTENDED_MAX_HEIGHT];
1897 int pos_in_item;
1898};
1899
1900#define pos_in_item(path) ((path)->pos_in_item)
1901
1902#define INITIALIZE_PATH(var) \
1903struct treepath var = {.path_length = ILLEGAL_PATH_ELEMENT_OFFSET, .reada = 0,}
1904
1905
1906#define PATH_OFFSET_PELEMENT(path, n_offset) ((path)->path_elements + (n_offset))
1907
1908
1909#define PATH_OFFSET_PBUFFER(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_buffer)
1910
1911
1912#define PATH_OFFSET_POSITION(path, n_offset) (PATH_OFFSET_PELEMENT(path, n_offset)->pe_position)
1913
1914#define PATH_PLAST_BUFFER(path) (PATH_OFFSET_PBUFFER((path), (path)->path_length))
1915
1916
1917
1918
1919
1920
1921#define PATH_LAST_POSITION(path) (PATH_OFFSET_POSITION((path), (path)->path_length))
1922
1923#define PATH_PITEM_HEAD(path) B_N_PITEM_HEAD(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION(path))
1924
1925
1926
1927#define PATH_H_PBUFFER(path, h) PATH_OFFSET_PBUFFER (path, path->path_length - (h))
1928#define PATH_H_PPARENT(path, h) PATH_H_PBUFFER (path, (h) + 1)
1929#define PATH_H_POSITION(path, h) PATH_OFFSET_POSITION (path, path->path_length - (h))
1930#define PATH_H_B_ITEM_ORDER(path, h) PATH_H_POSITION(path, h + 1)
1931
1932#define PATH_H_PATH_OFFSET(path, n_h) ((path)->path_length - (n_h))
1933
1934#define get_last_bh(path) PATH_PLAST_BUFFER(path)
1935#define get_ih(path) PATH_PITEM_HEAD(path)
1936#define get_item_pos(path) PATH_LAST_POSITION(path)
1937#define get_item(path) ((void *)B_N_PITEM(PATH_PLAST_BUFFER(path), PATH_LAST_POSITION (path)))
1938#define item_moved(ih,path) comp_items(ih, path)
1939#define path_changed(ih,path) comp_items (ih, path)
1940
1941
1942
1943
1944
1945
1946#define UNFM_P_SIZE (sizeof(unp_t))
1947#define UNFM_P_SHIFT 2
1948
1949
1950#define INODE_PKEY(inode) ((struct reiserfs_key *)(REISERFS_I(inode)->i_key))
1951
1952#define MAX_UL_INT 0xffffffff
1953#define MAX_INT 0x7ffffff
1954#define MAX_US_INT 0xffff
1955
1956
1957#define U32_MAX (~(__u32)0)
1958
1959static inline loff_t max_reiserfs_offset(struct inode *inode)
1960{
1961 if (get_inode_item_key_version(inode) == KEY_FORMAT_3_5)
1962 return (loff_t) U32_MAX;
1963
1964 return (loff_t) ((~(__u64) 0) >> 4);
1965}
1966
1967
1968#define MAX_KEY_OBJECTID MAX_UL_INT
1969
1970#define MAX_B_NUM MAX_UL_INT
1971#define MAX_FC_NUM MAX_US_INT
1972
1973
1974#define REISERFS_LINK_MAX (MAX_US_INT - 1000)
1975
1976
1977#define REISERFS_KERNEL_MEM 0
1978#define REISERFS_USER_MEM 1
1979
1980#define fs_generation(s) (REISERFS_SB(s)->s_generation_counter)
1981#define get_generation(s) atomic_read (&fs_generation(s))
1982#define FILESYSTEM_CHANGED_TB(tb) (get_generation((tb)->tb_sb) != (tb)->fs_gen)
1983#define __fs_changed(gen,s) (gen != get_generation (s))
1984#define fs_changed(gen,s) \
1985({ \
1986 reiserfs_cond_resched(s); \
1987 __fs_changed(gen, s); \
1988})
1989
1990
1991
1992
1993
1994#define VI_TYPE_LEFT_MERGEABLE 1
1995#define VI_TYPE_RIGHT_MERGEABLE 2
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010struct virtual_item {
2011 int vi_index;
2012 unsigned short vi_type;
2013 unsigned short vi_item_len;
2014 struct item_head *vi_ih;
2015 const char *vi_item;
2016 const void *vi_new_data;
2017 void *vi_uarea;
2018};
2019
2020struct virtual_node {
2021 char *vn_free_ptr;
2022 unsigned short vn_nr_item;
2023 short vn_size;
2024 short vn_mode;
2025 short vn_affected_item_num;
2026 short vn_pos_in_item;
2027 struct item_head *vn_ins_ih;
2028 const void *vn_data;
2029 struct virtual_item *vn_vi;
2030};
2031
2032
2033struct direntry_uarea {
2034 int flags;
2035 __u16 entry_count;
2036 __u16 entry_sizes[1];
2037} __attribute__ ((__packed__));
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054#define MAX_FREE_BLOCK 7
2055
2056
2057#define MAX_AMOUNT_NEEDED 2
2058
2059
2060struct tree_balance {
2061 int tb_mode;
2062 int need_balance_dirty;
2063 struct super_block *tb_sb;
2064 struct reiserfs_transaction_handle *transaction_handle;
2065 struct treepath *tb_path;
2066 struct buffer_head *L[MAX_HEIGHT];
2067 struct buffer_head *R[MAX_HEIGHT];
2068 struct buffer_head *FL[MAX_HEIGHT];
2069 struct buffer_head *FR[MAX_HEIGHT];
2070 struct buffer_head *CFL[MAX_HEIGHT];
2071 struct buffer_head *CFR[MAX_HEIGHT];
2072
2073 struct buffer_head *FEB[MAX_FEB_SIZE];
2074
2075 struct buffer_head *used[MAX_FEB_SIZE];
2076 struct buffer_head *thrown[MAX_FEB_SIZE];
2077 int lnum[MAX_HEIGHT];
2078
2079
2080
2081
2082
2083
2084
2085
2086 int rnum[MAX_HEIGHT];
2087 int lkey[MAX_HEIGHT];
2088
2089 int rkey[MAX_HEIGHT];
2090 int insert_size[MAX_HEIGHT];
2091
2092 int blknum[MAX_HEIGHT];
2093
2094
2095
2096
2097
2098
2099 int cur_blknum;
2100 int s0num;
2101 int s1num;
2102 int s2num;
2103 int lbytes;
2104
2105
2106 int rbytes;
2107
2108
2109 int s1bytes;
2110
2111 int s2bytes;
2112 struct buffer_head *buf_to_free[MAX_FREE_BLOCK];
2113 char *vn_buf;
2114
2115
2116 int vn_buf_size;
2117 struct virtual_node *tb_vn;
2118
2119 int fs_gen;
2120
2121#ifdef DISPLACE_NEW_PACKING_LOCALITIES
2122 struct in_core_key key;
2123
2124#endif
2125};
2126
2127
2128
2129
2130#define M_INSERT 'i'
2131
2132
2133#define M_PASTE 'p'
2134
2135#define M_DELETE 'd'
2136
2137#define M_CUT 'c'
2138
2139
2140#define M_INTERNAL 'n'
2141
2142
2143
2144#define M_SKIP_BALANCING 's'
2145#define M_CONVERT 'v'
2146
2147
2148#define LEAF_FROM_S_TO_L 0
2149#define LEAF_FROM_S_TO_R 1
2150#define LEAF_FROM_R_TO_L 2
2151#define LEAF_FROM_L_TO_R 3
2152#define LEAF_FROM_S_TO_SNEW 4
2153
2154#define FIRST_TO_LAST 0
2155#define LAST_TO_FIRST 1
2156
2157
2158
2159struct buffer_info {
2160 struct tree_balance *tb;
2161 struct buffer_head *bi_bh;
2162 struct buffer_head *bi_parent;
2163 int bi_position;
2164};
2165
2166static inline struct super_block *sb_from_tb(struct tree_balance *tb)
2167{
2168 return tb ? tb->tb_sb : NULL;
2169}
2170
2171static inline struct super_block *sb_from_bi(struct buffer_info *bi)
2172{
2173 return bi ? sb_from_tb(bi->tb) : NULL;
2174}
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192struct item_operations {
2193 int (*bytes_number) (struct item_head * ih, int block_size);
2194 void (*decrement_key) (struct cpu_key *);
2195 int (*is_left_mergeable) (struct reiserfs_key * ih,
2196 unsigned long bsize);
2197 void (*print_item) (struct item_head *, char *item);
2198 void (*check_item) (struct item_head *, char *item);
2199
2200 int (*create_vi) (struct virtual_node * vn, struct virtual_item * vi,
2201 int is_affected, int insert_size);
2202 int (*check_left) (struct virtual_item * vi, int free,
2203 int start_skip, int end_skip);
2204 int (*check_right) (struct virtual_item * vi, int free);
2205 int (*part_size) (struct virtual_item * vi, int from, int to);
2206 int (*unit_num) (struct virtual_item * vi);
2207 void (*print_vi) (struct virtual_item * vi);
2208};
2209
2210extern struct item_operations *item_ops[TYPE_ANY + 1];
2211
2212#define op_bytes_number(ih,bsize) item_ops[le_ih_k_type (ih)]->bytes_number (ih, bsize)
2213#define op_is_left_mergeable(key,bsize) item_ops[le_key_k_type (le_key_version (key), key)]->is_left_mergeable (key, bsize)
2214#define op_print_item(ih,item) item_ops[le_ih_k_type (ih)]->print_item (ih, item)
2215#define op_check_item(ih,item) item_ops[le_ih_k_type (ih)]->check_item (ih, item)
2216#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)
2217#define op_check_left(vi,free,start_skip,end_skip) item_ops[(vi)->vi_index]->check_left (vi, free, start_skip, end_skip)
2218#define op_check_right(vi,free) item_ops[(vi)->vi_index]->check_right (vi, free)
2219#define op_part_size(vi,from,to) item_ops[(vi)->vi_index]->part_size (vi, from, to)
2220#define op_unit_num(vi) item_ops[(vi)->vi_index]->unit_num (vi)
2221#define op_print_vi(vi) item_ops[(vi)->vi_index]->print_vi (vi)
2222
2223#define COMP_SHORT_KEYS comp_short_keys
2224
2225
2226#define I_UNFM_NUM(ih) (ih_item_len(ih) / UNFM_P_SIZE)
2227
2228
2229#define I_POS_UNFM_SIZE(ih,pos,size) (((pos) == I_UNFM_NUM(ih) - 1 ) ? (size) - ih_free_space(ih) : (size))
2230
2231
2232
2233
2234#define B_N_PITEM_HEAD(bh,item_num) ( (struct item_head * )((bh)->b_data + BLKH_SIZE) + (item_num) )
2235
2236
2237#define B_N_PDELIM_KEY(bh,item_num) ( (struct reiserfs_key * )((bh)->b_data + BLKH_SIZE) + (item_num) )
2238
2239
2240#define B_N_PKEY(bh,item_num) ( &(B_N_PITEM_HEAD(bh,item_num)->ih_key) )
2241
2242
2243#define B_N_PITEM(bh,item_num) ( (bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(item_num))))
2244
2245
2246#define B_N_STAT_DATA(bh,nr) \
2247( (struct stat_data *)((bh)->b_data + ih_location(B_N_PITEM_HEAD((bh),(nr))) ) )
2248
2249
2250
2251
2252#define B_I_STAT_DATA(bh, ih) ( (struct stat_data * )((bh)->b_data + ih_location(ih)) )
2253
2254
2255#define MAX_DIRECT_ITEM_LEN(size) ((size) - BLKH_SIZE - 2*IH_SIZE - SD_SIZE - UNFM_P_SIZE)
2256
2257
2258
2259
2260#define B_I_POS_UNFM_POINTER(bh,ih,pos) le32_to_cpu(*(((unp_t *)B_I_PITEM(bh,ih)) + (pos)))
2261#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)
2262
2263struct reiserfs_iget_args {
2264 __u32 objectid;
2265 __u32 dirid;
2266};
2267
2268
2269
2270
2271
2272#define get_journal_desc_magic(bh) (bh->b_data + bh->b_size - 12)
2273
2274#define journal_trans_half(blocksize) \
2275 ((blocksize - sizeof (struct reiserfs_journal_desc) + sizeof (__u32) - 12) / sizeof (__u32))
2276
2277
2278
2279
2280struct reiserfs_journal_desc {
2281 __le32 j_trans_id;
2282 __le32 j_len;
2283 __le32 j_mount_id;
2284 __le32 j_realblock[1];
2285};
2286
2287#define get_desc_trans_id(d) le32_to_cpu((d)->j_trans_id)
2288#define get_desc_trans_len(d) le32_to_cpu((d)->j_len)
2289#define get_desc_mount_id(d) le32_to_cpu((d)->j_mount_id)
2290
2291#define set_desc_trans_id(d,val) do { (d)->j_trans_id = cpu_to_le32 (val); } while (0)
2292#define set_desc_trans_len(d,val) do { (d)->j_len = cpu_to_le32 (val); } while (0)
2293#define set_desc_mount_id(d,val) do { (d)->j_mount_id = cpu_to_le32 (val); } while (0)
2294
2295
2296struct reiserfs_journal_commit {
2297 __le32 j_trans_id;
2298 __le32 j_len;
2299 __le32 j_realblock[1];
2300};
2301
2302#define get_commit_trans_id(c) le32_to_cpu((c)->j_trans_id)
2303#define get_commit_trans_len(c) le32_to_cpu((c)->j_len)
2304#define get_commit_mount_id(c) le32_to_cpu((c)->j_mount_id)
2305
2306#define set_commit_trans_id(c,val) do { (c)->j_trans_id = cpu_to_le32 (val); } while (0)
2307#define set_commit_trans_len(c,val) do { (c)->j_len = cpu_to_le32 (val); } while (0)
2308
2309
2310
2311
2312
2313struct reiserfs_journal_header {
2314 __le32 j_last_flush_trans_id;
2315 __le32 j_first_unflushed_offset;
2316 __le32 j_mount_id;
2317 struct journal_params jh_journal;
2318};
2319
2320
2321#define JOURNAL_BLOCK_COUNT 8192
2322#define JOURNAL_TRANS_MAX_DEFAULT 1024
2323#define JOURNAL_TRANS_MIN_DEFAULT 256
2324#define JOURNAL_MAX_BATCH_DEFAULT 900
2325#define JOURNAL_MIN_RATIO 2
2326#define JOURNAL_MAX_COMMIT_AGE 30
2327#define JOURNAL_MAX_TRANS_AGE 30
2328#define JOURNAL_PER_BALANCE_CNT (3 * (MAX_HEIGHT-2) + 9)
2329#define JOURNAL_BLOCKS_PER_OBJECT(sb) (JOURNAL_PER_BALANCE_CNT * 3 + \
2330 2 * (REISERFS_QUOTA_INIT_BLOCKS(sb) + \
2331 REISERFS_QUOTA_TRANS_BLOCKS(sb)))
2332
2333#ifdef CONFIG_QUOTA
2334#define REISERFS_QUOTA_OPTS ((1 << REISERFS_USRQUOTA) | (1 << REISERFS_GRPQUOTA))
2335
2336#define REISERFS_QUOTA_TRANS_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? 2 : 0)
2337
2338#define REISERFS_QUOTA_INIT_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? \
2339(DQUOT_INIT_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_INIT_REWRITE+1) : 0)
2340
2341#define REISERFS_QUOTA_DEL_BLOCKS(s) (REISERFS_SB(s)->s_mount_opt & REISERFS_QUOTA_OPTS ? \
2342(DQUOT_DEL_ALLOC*(JOURNAL_PER_BALANCE_CNT+2)+DQUOT_DEL_REWRITE+1) : 0)
2343#else
2344#define REISERFS_QUOTA_TRANS_BLOCKS(s) 0
2345#define REISERFS_QUOTA_INIT_BLOCKS(s) 0
2346#define REISERFS_QUOTA_DEL_BLOCKS(s) 0
2347#endif
2348
2349
2350
2351
2352
2353
2354
2355#define REISERFS_MIN_BITMAP_NODES 10
2356#define REISERFS_MAX_BITMAP_NODES 100
2357
2358#define JBH_HASH_SHIFT 13
2359#define JBH_HASH_MASK 8191
2360
2361#define _jhashfn(sb,block) \
2362 (((unsigned long)sb>>L1_CACHE_SHIFT) ^ \
2363 (((block)<<(JBH_HASH_SHIFT - 6)) ^ ((block) >> 13) ^ ((block) << (JBH_HASH_SHIFT - 12))))
2364#define journal_hash(t,sb,block) ((t)[_jhashfn((sb),(block)) & JBH_HASH_MASK])
2365
2366
2367#define journal_find_get_block(s, block) __find_get_block(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
2368#define journal_getblk(s, block) __getblk(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
2369#define journal_bread(s, block) __bread(SB_JOURNAL(s)->j_dev_bd, block, s->s_blocksize)
2370
2371enum reiserfs_bh_state_bits {
2372 BH_JDirty = BH_PrivateStart,
2373 BH_JDirty_wait,
2374 BH_JNew,
2375
2376
2377 BH_JPrepared,
2378 BH_JRestore_dirty,
2379 BH_JTest,
2380};
2381
2382BUFFER_FNS(JDirty, journaled);
2383TAS_BUFFER_FNS(JDirty, journaled);
2384BUFFER_FNS(JDirty_wait, journal_dirty);
2385TAS_BUFFER_FNS(JDirty_wait, journal_dirty);
2386BUFFER_FNS(JNew, journal_new);
2387TAS_BUFFER_FNS(JNew, journal_new);
2388BUFFER_FNS(JPrepared, journal_prepared);
2389TAS_BUFFER_FNS(JPrepared, journal_prepared);
2390BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
2391TAS_BUFFER_FNS(JRestore_dirty, journal_restore_dirty);
2392BUFFER_FNS(JTest, journal_test);
2393TAS_BUFFER_FNS(JTest, journal_test);
2394
2395
2396
2397
2398struct reiserfs_transaction_handle {
2399 struct super_block *t_super;
2400
2401
2402
2403
2404
2405 int t_refcount;
2406 int t_blocks_logged;
2407 int t_blocks_allocated;
2408 unsigned int t_trans_id;
2409 void *t_handle_save;
2410 unsigned displace_new_blocks:1;
2411
2412 struct list_head t_list;
2413};
2414
2415
2416
2417
2418struct reiserfs_jh {
2419 struct reiserfs_journal_list *jl;
2420 struct buffer_head *bh;
2421 struct list_head list;
2422};
2423
2424void reiserfs_free_jh(struct buffer_head *bh);
2425int reiserfs_add_tail_list(struct inode *inode, struct buffer_head *bh);
2426int reiserfs_add_ordered_list(struct inode *inode, struct buffer_head *bh);
2427int journal_mark_dirty(struct reiserfs_transaction_handle *,
2428 struct super_block *, struct buffer_head *bh);
2429
2430static inline int reiserfs_file_data_log(struct inode *inode)
2431{
2432 if (reiserfs_data_log(inode->i_sb) ||
2433 (REISERFS_I(inode)->i_flags & i_data_log))
2434 return 1;
2435 return 0;
2436}
2437
2438static inline int reiserfs_transaction_running(struct super_block *s)
2439{
2440 struct reiserfs_transaction_handle *th = current->journal_info;
2441 if (th && th->t_super == s)
2442 return 1;
2443 if (th && th->t_super == NULL)
2444 BUG();
2445 return 0;
2446}
2447
2448static inline int reiserfs_transaction_free_space(struct reiserfs_transaction_handle *th)
2449{
2450 return th->t_blocks_allocated - th->t_blocks_logged;
2451}
2452
2453struct reiserfs_transaction_handle *reiserfs_persistent_transaction(struct
2454 super_block
2455 *,
2456 int count);
2457int reiserfs_end_persistent_transaction(struct reiserfs_transaction_handle *);
2458void reiserfs_vfs_truncate_file(struct inode *inode);
2459int reiserfs_commit_page(struct inode *inode, struct page *page,
2460 unsigned from, unsigned to);
2461void reiserfs_flush_old_commits(struct super_block *);
2462int reiserfs_commit_for_inode(struct inode *);
2463int reiserfs_inode_needs_commit(struct inode *);
2464void reiserfs_update_inode_transaction(struct inode *);
2465void reiserfs_wait_on_write_block(struct super_block *s);
2466void reiserfs_block_writes(struct reiserfs_transaction_handle *th);
2467void reiserfs_allow_writes(struct super_block *s);
2468void reiserfs_check_lock_depth(struct super_block *s, char *caller);
2469int reiserfs_prepare_for_journal(struct super_block *, struct buffer_head *bh,
2470 int wait);
2471void reiserfs_restore_prepared_buffer(struct super_block *,
2472 struct buffer_head *bh);
2473int journal_init(struct super_block *, const char *j_dev_name, int old_format,
2474 unsigned int);
2475int journal_release(struct reiserfs_transaction_handle *, struct super_block *);
2476int journal_release_error(struct reiserfs_transaction_handle *,
2477 struct super_block *);
2478int journal_end(struct reiserfs_transaction_handle *, struct super_block *,
2479 unsigned long);
2480int journal_end_sync(struct reiserfs_transaction_handle *, struct super_block *,
2481 unsigned long);
2482int journal_mark_freed(struct reiserfs_transaction_handle *,
2483 struct super_block *, b_blocknr_t blocknr);
2484int journal_transaction_should_end(struct reiserfs_transaction_handle *, int);
2485int reiserfs_in_journal(struct super_block *sb, unsigned int bmap_nr,
2486 int bit_nr, int searchall, b_blocknr_t *next);
2487int journal_begin(struct reiserfs_transaction_handle *,
2488 struct super_block *sb, unsigned long);
2489int journal_join_abort(struct reiserfs_transaction_handle *,
2490 struct super_block *sb, unsigned long);
2491void reiserfs_abort_journal(struct super_block *sb, int errno);
2492void reiserfs_abort(struct super_block *sb, int errno, const char *fmt, ...);
2493int reiserfs_allocate_list_bitmaps(struct super_block *s,
2494 struct reiserfs_list_bitmap *, unsigned int);
2495
2496void reiserfs_schedule_old_flush(struct super_block *s);
2497void add_save_link(struct reiserfs_transaction_handle *th,
2498 struct inode *inode, int truncate);
2499int remove_save_link(struct inode *inode, int truncate);
2500
2501
2502__u32 reiserfs_get_unused_objectid(struct reiserfs_transaction_handle *th);
2503void reiserfs_release_objectid(struct reiserfs_transaction_handle *th,
2504 __u32 objectid_to_release);
2505int reiserfs_convert_objectid_map_v1(struct super_block *);
2506
2507
2508int B_IS_IN_TREE(const struct buffer_head *);
2509extern void copy_item_head(struct item_head *to,
2510 const struct item_head *from);
2511
2512
2513extern int comp_short_keys(const struct reiserfs_key *le_key,
2514 const struct cpu_key *cpu_key);
2515extern void le_key2cpu_key(struct cpu_key *to, const struct reiserfs_key *from);
2516
2517
2518extern int comp_le_keys(const struct reiserfs_key *,
2519 const struct reiserfs_key *);
2520extern int comp_short_le_keys(const struct reiserfs_key *,
2521 const struct reiserfs_key *);
2522
2523
2524
2525
2526static inline int le_key_version(const struct reiserfs_key *key)
2527{
2528 int type;
2529
2530 type = offset_v2_k_type(&(key->u.k_offset_v2));
2531 if (type != TYPE_DIRECT && type != TYPE_INDIRECT
2532 && type != TYPE_DIRENTRY)
2533 return KEY_FORMAT_3_5;
2534
2535 return KEY_FORMAT_3_6;
2536
2537}
2538
2539static inline void copy_key(struct reiserfs_key *to,
2540 const struct reiserfs_key *from)
2541{
2542 memcpy(to, from, KEY_SIZE);
2543}
2544
2545int comp_items(const struct item_head *stored_ih, const struct treepath *path);
2546const struct reiserfs_key *get_rkey(const struct treepath *chk_path,
2547 const struct super_block *sb);
2548int search_by_key(struct super_block *, const struct cpu_key *,
2549 struct treepath *, int);
2550#define search_item(s,key,path) search_by_key (s, key, path, DISK_LEAF_NODE_LEVEL)
2551int search_for_position_by_key(struct super_block *sb,
2552 const struct cpu_key *cpu_key,
2553 struct treepath *search_path);
2554extern void decrement_bcount(struct buffer_head *bh);
2555void decrement_counters_in_path(struct treepath *search_path);
2556void pathrelse(struct treepath *search_path);
2557int reiserfs_check_path(struct treepath *p);
2558void pathrelse_and_restore(struct super_block *s, struct treepath *search_path);
2559
2560int reiserfs_insert_item(struct reiserfs_transaction_handle *th,
2561 struct treepath *path,
2562 const struct cpu_key *key,
2563 struct item_head *ih,
2564 struct inode *inode, const char *body);
2565
2566int reiserfs_paste_into_item(struct reiserfs_transaction_handle *th,
2567 struct treepath *path,
2568 const struct cpu_key *key,
2569 struct inode *inode,
2570 const char *body, int paste_size);
2571
2572int reiserfs_cut_from_item(struct reiserfs_transaction_handle *th,
2573 struct treepath *path,
2574 struct cpu_key *key,
2575 struct inode *inode,
2576 struct page *page, loff_t new_file_size);
2577
2578int reiserfs_delete_item(struct reiserfs_transaction_handle *th,
2579 struct treepath *path,
2580 const struct cpu_key *key,
2581 struct inode *inode, struct buffer_head *un_bh);
2582
2583void reiserfs_delete_solid_item(struct reiserfs_transaction_handle *th,
2584 struct inode *inode, struct reiserfs_key *key);
2585int reiserfs_delete_object(struct reiserfs_transaction_handle *th,
2586 struct inode *inode);
2587int reiserfs_do_truncate(struct reiserfs_transaction_handle *th,
2588 struct inode *inode, struct page *,
2589 int update_timestamps);
2590
2591#define i_block_size(inode) ((inode)->i_sb->s_blocksize)
2592#define file_size(inode) ((inode)->i_size)
2593#define tail_size(inode) (file_size (inode) & (i_block_size (inode) - 1))
2594
2595#define tail_has_to_be_packed(inode) (have_large_tails ((inode)->i_sb)?\
2596!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 )
2597
2598void padd_item(char *item, int total_length, int length);
2599
2600
2601
2602#define GET_BLOCK_NO_CREATE 0
2603#define GET_BLOCK_CREATE 1
2604#define GET_BLOCK_NO_HOLE 2
2605#define GET_BLOCK_READ_DIRECT 4
2606#define GET_BLOCK_NO_IMUX 8
2607#define GET_BLOCK_NO_DANGLE 16
2608
2609void reiserfs_read_locked_inode(struct inode *inode,
2610 struct reiserfs_iget_args *args);
2611int reiserfs_find_actor(struct inode *inode, void *p);
2612int reiserfs_init_locked_inode(struct inode *inode, void *p);
2613void reiserfs_evict_inode(struct inode *inode);
2614int reiserfs_write_inode(struct inode *inode, struct writeback_control *wbc);
2615int reiserfs_get_block(struct inode *inode, sector_t block,
2616 struct buffer_head *bh_result, int create);
2617struct dentry *reiserfs_fh_to_dentry(struct super_block *sb, struct fid *fid,
2618 int fh_len, int fh_type);
2619struct dentry *reiserfs_fh_to_parent(struct super_block *sb, struct fid *fid,
2620 int fh_len, int fh_type);
2621int reiserfs_encode_fh(struct inode *inode, __u32 * data, int *lenp,
2622 struct inode *parent);
2623
2624int reiserfs_truncate_file(struct inode *, int update_timestamps);
2625void make_cpu_key(struct cpu_key *cpu_key, struct inode *inode, loff_t offset,
2626 int type, int key_length);
2627void make_le_item_head(struct item_head *ih, const struct cpu_key *key,
2628 int version,
2629 loff_t offset, int type, int length, int entry_count);
2630struct inode *reiserfs_iget(struct super_block *s, const struct cpu_key *key);
2631
2632struct reiserfs_security_handle;
2633int reiserfs_new_inode(struct reiserfs_transaction_handle *th,
2634 struct inode *dir, umode_t mode,
2635 const char *symname, loff_t i_size,
2636 struct dentry *dentry, struct inode *inode,
2637 struct reiserfs_security_handle *security);
2638
2639void reiserfs_update_sd_size(struct reiserfs_transaction_handle *th,
2640 struct inode *inode, loff_t size);
2641
2642static inline void reiserfs_update_sd(struct reiserfs_transaction_handle *th,
2643 struct inode *inode)
2644{
2645 reiserfs_update_sd_size(th, inode, inode->i_size);
2646}
2647
2648void sd_attrs_to_i_attrs(__u16 sd_attrs, struct inode *inode);
2649void i_attrs_to_sd_attrs(struct inode *inode, __u16 * sd_attrs);
2650int reiserfs_setattr(struct dentry *dentry, struct iattr *attr);
2651
2652int __reiserfs_write_begin(struct page *page, unsigned from, unsigned len);
2653
2654
2655void set_de_name_and_namelen(struct reiserfs_dir_entry *de);
2656int search_by_entry_key(struct super_block *sb, const struct cpu_key *key,
2657 struct treepath *path, struct reiserfs_dir_entry *de);
2658struct dentry *reiserfs_get_parent(struct dentry *);
2659
2660#ifdef CONFIG_REISERFS_PROC_INFO
2661int reiserfs_proc_info_init(struct super_block *sb);
2662int reiserfs_proc_info_done(struct super_block *sb);
2663int reiserfs_proc_info_global_init(void);
2664int reiserfs_proc_info_global_done(void);
2665
2666#define PROC_EXP( e ) e
2667
2668#define __PINFO( sb ) REISERFS_SB(sb) -> s_proc_info_data
2669#define PROC_INFO_MAX( sb, field, value ) \
2670 __PINFO( sb ).field = \
2671 max( REISERFS_SB( sb ) -> s_proc_info_data.field, value )
2672#define PROC_INFO_INC( sb, field ) ( ++ ( __PINFO( sb ).field ) )
2673#define PROC_INFO_ADD( sb, field, val ) ( __PINFO( sb ).field += ( val ) )
2674#define PROC_INFO_BH_STAT( sb, bh, level ) \
2675 PROC_INFO_INC( sb, sbk_read_at[ ( level ) ] ); \
2676 PROC_INFO_ADD( sb, free_at[ ( level ) ], B_FREE_SPACE( bh ) ); \
2677 PROC_INFO_ADD( sb, items_at[ ( level ) ], B_NR_ITEMS( bh ) )
2678#else
2679static inline int reiserfs_proc_info_init(struct super_block *sb)
2680{
2681 return 0;
2682}
2683
2684static inline int reiserfs_proc_info_done(struct super_block *sb)
2685{
2686 return 0;
2687}
2688
2689static inline int reiserfs_proc_info_global_init(void)
2690{
2691 return 0;
2692}
2693
2694static inline int reiserfs_proc_info_global_done(void)
2695{
2696 return 0;
2697}
2698
2699#define PROC_EXP( e )
2700#define VOID_V ( ( void ) 0 )
2701#define PROC_INFO_MAX( sb, field, value ) VOID_V
2702#define PROC_INFO_INC( sb, field ) VOID_V
2703#define PROC_INFO_ADD( sb, field, val ) VOID_V
2704#define PROC_INFO_BH_STAT(sb, bh, n_node_level) VOID_V
2705#endif
2706
2707
2708extern const struct inode_operations reiserfs_dir_inode_operations;
2709extern const struct inode_operations reiserfs_symlink_inode_operations;
2710extern const struct inode_operations reiserfs_special_inode_operations;
2711extern const struct file_operations reiserfs_dir_operations;
2712int reiserfs_readdir_dentry(struct dentry *, void *, filldir_t, loff_t *);
2713
2714
2715int direct2indirect(struct reiserfs_transaction_handle *, struct inode *,
2716 struct treepath *, struct buffer_head *, loff_t);
2717int indirect2direct(struct reiserfs_transaction_handle *, struct inode *,
2718 struct page *, struct treepath *, const struct cpu_key *,
2719 loff_t, char *);
2720void reiserfs_unmap_buffer(struct buffer_head *);
2721
2722
2723extern const struct inode_operations reiserfs_file_inode_operations;
2724extern const struct file_operations reiserfs_file_operations;
2725extern const struct address_space_operations reiserfs_address_space_operations;
2726
2727
2728
2729int fix_nodes(int n_op_mode, struct tree_balance *tb,
2730 struct item_head *ins_ih, const void *);
2731void unfix_nodes(struct tree_balance *);
2732
2733
2734void __reiserfs_panic(struct super_block *s, const char *id,
2735 const char *function, const char *fmt, ...)
2736 __attribute__ ((noreturn));
2737#define reiserfs_panic(s, id, fmt, args...) \
2738 __reiserfs_panic(s, id, __func__, fmt, ##args)
2739void __reiserfs_error(struct super_block *s, const char *id,
2740 const char *function, const char *fmt, ...);
2741#define reiserfs_error(s, id, fmt, args...) \
2742 __reiserfs_error(s, id, __func__, fmt, ##args)
2743void reiserfs_info(struct super_block *s, const char *fmt, ...);
2744void reiserfs_debug(struct super_block *s, int level, const char *fmt, ...);
2745void print_indirect_item(struct buffer_head *bh, int item_num);
2746void store_print_tb(struct tree_balance *tb);
2747void print_cur_tb(char *mes);
2748void print_de(struct reiserfs_dir_entry *de);
2749void print_bi(struct buffer_info *bi, char *mes);
2750#define PRINT_LEAF_ITEMS 1
2751#define PRINT_DIRECTORY_ITEMS 2
2752#define PRINT_DIRECT_ITEMS 4
2753void print_block(struct buffer_head *bh, ...);
2754void print_bmap(struct super_block *s, int silent);
2755void print_bmap_block(int i, char *data, int size, int silent);
2756
2757void print_objectid_map(struct super_block *s);
2758void print_block_head(struct buffer_head *bh, char *mes);
2759void check_leaf(struct buffer_head *bh);
2760void check_internal(struct buffer_head *bh);
2761void print_statistics(struct super_block *s);
2762char *reiserfs_hashname(int code);
2763
2764
2765int leaf_move_items(int shift_mode, struct tree_balance *tb, int mov_num,
2766 int mov_bytes, struct buffer_head *Snew);
2767int leaf_shift_left(struct tree_balance *tb, int shift_num, int shift_bytes);
2768int leaf_shift_right(struct tree_balance *tb, int shift_num, int shift_bytes);
2769void leaf_delete_items(struct buffer_info *cur_bi, int last_first, int first,
2770 int del_num, int del_bytes);
2771void leaf_insert_into_buf(struct buffer_info *bi, int before,
2772 struct item_head *inserted_item_ih,
2773 const char *inserted_item_body, int zeros_number);
2774void leaf_paste_in_buffer(struct buffer_info *bi, int pasted_item_num,
2775 int pos_in_item, int paste_size, const char *body,
2776 int zeros_number);
2777void leaf_cut_from_buffer(struct buffer_info *bi, int cut_item_num,
2778 int pos_in_item, int cut_size);
2779void leaf_paste_entries(struct buffer_info *bi, int item_num, int before,
2780 int new_entry_count, struct reiserfs_de_head *new_dehs,
2781 const char *records, int paste_size);
2782
2783int balance_internal(struct tree_balance *, int, int, struct item_head *,
2784 struct buffer_head **);
2785
2786
2787void do_balance_mark_leaf_dirty(struct tree_balance *tb,
2788 struct buffer_head *bh, int flag);
2789#define do_balance_mark_internal_dirty do_balance_mark_leaf_dirty
2790#define do_balance_mark_sb_dirty do_balance_mark_leaf_dirty
2791
2792void do_balance(struct tree_balance *tb, struct item_head *ih,
2793 const char *body, int flag);
2794void reiserfs_invalidate_buffer(struct tree_balance *tb,
2795 struct buffer_head *bh);
2796
2797int get_left_neighbor_position(struct tree_balance *tb, int h);
2798int get_right_neighbor_position(struct tree_balance *tb, int h);
2799void replace_key(struct tree_balance *tb, struct buffer_head *, int,
2800 struct buffer_head *, int);
2801void make_empty_node(struct buffer_info *);
2802struct buffer_head *get_FEB(struct tree_balance *);
2803
2804
2805
2806
2807
2808struct __reiserfs_blocknr_hint {
2809 struct inode *inode;
2810 sector_t block;
2811 struct in_core_key key;
2812 struct treepath *path;
2813
2814 struct reiserfs_transaction_handle *th;
2815
2816 b_blocknr_t beg, end;
2817 b_blocknr_t search_start;
2818
2819
2820 int prealloc_size;
2821
2822
2823 unsigned formatted_node:1;
2824
2825 unsigned preallocate:1;
2826};
2827
2828typedef struct __reiserfs_blocknr_hint reiserfs_blocknr_hint_t;
2829
2830int reiserfs_parse_alloc_options(struct super_block *, char *);
2831void reiserfs_init_alloc_options(struct super_block *s);
2832
2833
2834
2835
2836
2837
2838__le32 reiserfs_choose_packing(struct inode *dir);
2839
2840int reiserfs_init_bitmap_cache(struct super_block *sb);
2841void reiserfs_free_bitmap_cache(struct super_block *sb);
2842void reiserfs_cache_bitmap_metadata(struct super_block *sb, struct buffer_head *bh, struct reiserfs_bitmap_info *info);
2843struct buffer_head *reiserfs_read_bitmap_block(struct super_block *sb, unsigned int bitmap);
2844int is_reusable(struct super_block *s, b_blocknr_t block, int bit_value);
2845void reiserfs_free_block(struct reiserfs_transaction_handle *th, struct inode *,
2846 b_blocknr_t, int for_unformatted);
2847int reiserfs_allocate_blocknrs(reiserfs_blocknr_hint_t *, b_blocknr_t *, int,
2848 int);
2849static inline int reiserfs_new_form_blocknrs(struct tree_balance *tb,
2850 b_blocknr_t * new_blocknrs,
2851 int amount_needed)
2852{
2853 reiserfs_blocknr_hint_t hint = {
2854 .th = tb->transaction_handle,
2855 .path = tb->tb_path,
2856 .inode = NULL,
2857 .key = tb->key,
2858 .block = 0,
2859 .formatted_node = 1
2860 };
2861 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, amount_needed,
2862 0);
2863}
2864
2865static inline int reiserfs_new_unf_blocknrs(struct reiserfs_transaction_handle
2866 *th, struct inode *inode,
2867 b_blocknr_t * new_blocknrs,
2868 struct treepath *path,
2869 sector_t block)
2870{
2871 reiserfs_blocknr_hint_t hint = {
2872 .th = th,
2873 .path = path,
2874 .inode = inode,
2875 .block = block,
2876 .formatted_node = 0,
2877 .preallocate = 0
2878 };
2879 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2880}
2881
2882#ifdef REISERFS_PREALLOCATE
2883static inline int reiserfs_new_unf_blocknrs2(struct reiserfs_transaction_handle
2884 *th, struct inode *inode,
2885 b_blocknr_t * new_blocknrs,
2886 struct treepath *path,
2887 sector_t block)
2888{
2889 reiserfs_blocknr_hint_t hint = {
2890 .th = th,
2891 .path = path,
2892 .inode = inode,
2893 .block = block,
2894 .formatted_node = 0,
2895 .preallocate = 1
2896 };
2897 return reiserfs_allocate_blocknrs(&hint, new_blocknrs, 1, 0);
2898}
2899
2900void reiserfs_discard_prealloc(struct reiserfs_transaction_handle *th,
2901 struct inode *inode);
2902void reiserfs_discard_all_prealloc(struct reiserfs_transaction_handle *th);
2903#endif
2904
2905
2906__u32 keyed_hash(const signed char *msg, int len);
2907__u32 yura_hash(const signed char *msg, int len);
2908__u32 r5_hash(const signed char *msg, int len);
2909
2910#define reiserfs_set_le_bit __set_bit_le
2911#define reiserfs_test_and_set_le_bit __test_and_set_bit_le
2912#define reiserfs_clear_le_bit __clear_bit_le
2913#define reiserfs_test_and_clear_le_bit __test_and_clear_bit_le
2914#define reiserfs_test_le_bit test_bit_le
2915#define reiserfs_find_next_zero_le_bit find_next_zero_bit_le
2916
2917
2918
2919
2920
2921
2922
2923
2924#define SPARE_SPACE 500
2925
2926
2927long reiserfs_ioctl(struct file *filp, unsigned int cmd, unsigned long arg);
2928long reiserfs_compat_ioctl(struct file *filp,
2929 unsigned int cmd, unsigned long arg);
2930int reiserfs_unpack(struct inode *inode, struct file *filp);
2931