reiserfs_fs_sb.h 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533
  1. /* Copyright 1996-2000 Hans Reiser, see reiserfs/README for licensing
  2. * and copyright details */
  3. #ifndef _LINUX_REISER_FS_SB
  4. #define _LINUX_REISER_FS_SB
  5. #ifdef __KERNEL__
  6. #include <linux/workqueue.h>
  7. #include <linux/rwsem.h>
  8. #endif
  9. typedef enum {
  10. reiserfs_attrs_cleared = 0x00000001,
  11. } reiserfs_super_block_flags;
  12. /* struct reiserfs_super_block accessors/mutators
  13. * since this is a disk structure, it will always be in
  14. * little endian format. */
  15. #define sb_block_count(sbp) (le32_to_cpu((sbp)->s_v1.s_block_count))
  16. #define set_sb_block_count(sbp,v) ((sbp)->s_v1.s_block_count = cpu_to_le32(v))
  17. #define sb_free_blocks(sbp) (le32_to_cpu((sbp)->s_v1.s_free_blocks))
  18. #define set_sb_free_blocks(sbp,v) ((sbp)->s_v1.s_free_blocks = cpu_to_le32(v))
  19. #define sb_root_block(sbp) (le32_to_cpu((sbp)->s_v1.s_root_block))
  20. #define set_sb_root_block(sbp,v) ((sbp)->s_v1.s_root_block = cpu_to_le32(v))
  21. #define sb_jp_journal_1st_block(sbp) \
  22. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_1st_block))
  23. #define set_sb_jp_journal_1st_block(sbp,v) \
  24. ((sbp)->s_v1.s_journal.jp_journal_1st_block = cpu_to_le32(v))
  25. #define sb_jp_journal_dev(sbp) \
  26. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_dev))
  27. #define set_sb_jp_journal_dev(sbp,v) \
  28. ((sbp)->s_v1.s_journal.jp_journal_dev = cpu_to_le32(v))
  29. #define sb_jp_journal_size(sbp) \
  30. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_size))
  31. #define set_sb_jp_journal_size(sbp,v) \
  32. ((sbp)->s_v1.s_journal.jp_journal_size = cpu_to_le32(v))
  33. #define sb_jp_journal_trans_max(sbp) \
  34. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_trans_max))
  35. #define set_sb_jp_journal_trans_max(sbp,v) \
  36. ((sbp)->s_v1.s_journal.jp_journal_trans_max = cpu_to_le32(v))
  37. #define sb_jp_journal_magic(sbp) \
  38. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_magic))
  39. #define set_sb_jp_journal_magic(sbp,v) \
  40. ((sbp)->s_v1.s_journal.jp_journal_magic = cpu_to_le32(v))
  41. #define sb_jp_journal_max_batch(sbp) \
  42. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_batch))
  43. #define set_sb_jp_journal_max_batch(sbp,v) \
  44. ((sbp)->s_v1.s_journal.jp_journal_max_batch = cpu_to_le32(v))
  45. #define sb_jp_jourmal_max_commit_age(sbp) \
  46. (le32_to_cpu((sbp)->s_v1.s_journal.jp_journal_max_commit_age))
  47. #define set_sb_jp_journal_max_commit_age(sbp,v) \
  48. ((sbp)->s_v1.s_journal.jp_journal_max_commit_age = cpu_to_le32(v))
  49. #define sb_blocksize(sbp) (le16_to_cpu((sbp)->s_v1.s_blocksize))
  50. #define set_sb_blocksize(sbp,v) ((sbp)->s_v1.s_blocksize = cpu_to_le16(v))
  51. #define sb_oid_maxsize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_maxsize))
  52. #define set_sb_oid_maxsize(sbp,v) ((sbp)->s_v1.s_oid_maxsize = cpu_to_le16(v))
  53. #define sb_oid_cursize(sbp) (le16_to_cpu((sbp)->s_v1.s_oid_cursize))
  54. #define set_sb_oid_cursize(sbp,v) ((sbp)->s_v1.s_oid_cursize = cpu_to_le16(v))
  55. #define sb_umount_state(sbp) (le16_to_cpu((sbp)->s_v1.s_umount_state))
  56. #define set_sb_umount_state(sbp,v) ((sbp)->s_v1.s_umount_state = cpu_to_le16(v))
  57. #define sb_fs_state(sbp) (le16_to_cpu((sbp)->s_v1.s_fs_state))
  58. #define set_sb_fs_state(sbp,v) ((sbp)->s_v1.s_fs_state = cpu_to_le16(v))
  59. #define sb_hash_function_code(sbp) \
  60. (le32_to_cpu((sbp)->s_v1.s_hash_function_code))
  61. #define set_sb_hash_function_code(sbp,v) \
  62. ((sbp)->s_v1.s_hash_function_code = cpu_to_le32(v))
  63. #define sb_tree_height(sbp) (le16_to_cpu((sbp)->s_v1.s_tree_height))
  64. #define set_sb_tree_height(sbp,v) ((sbp)->s_v1.s_tree_height = cpu_to_le16(v))
  65. #define sb_bmap_nr(sbp) (le16_to_cpu((sbp)->s_v1.s_bmap_nr))
  66. #define set_sb_bmap_nr(sbp,v) ((sbp)->s_v1.s_bmap_nr = cpu_to_le16(v))
  67. #define sb_version(sbp) (le16_to_cpu((sbp)->s_v1.s_version))
  68. #define set_sb_version(sbp,v) ((sbp)->s_v1.s_version = cpu_to_le16(v))
  69. #define sb_reserved_for_journal(sbp) \
  70. (le16_to_cpu((sbp)->s_v1.s_reserved_for_journal))
  71. #define set_sb_reserved_for_journal(sbp,v) \
  72. ((sbp)->s_v1.s_reserved_for_journal = cpu_to_le16(v))
  73. /* LOGGING -- */
  74. /* These all interelate for performance.
  75. **
  76. ** If the journal block count is smaller than n transactions, you lose speed.
  77. ** I don't know what n is yet, I'm guessing 8-16.
  78. **
  79. ** typical transaction size depends on the application, how often fsync is
  80. ** called, and how many metadata blocks you dirty in a 30 second period.
  81. ** The more small files (<16k) you use, the larger your transactions will
  82. ** be.
  83. **
  84. ** If your journal fills faster than dirty buffers get flushed to disk, it must flush them before allowing the journal
  85. ** to wrap, which slows things down. If you need high speed meta data updates, the journal should be big enough
  86. ** to prevent wrapping before dirty meta blocks get to disk.
  87. **
  88. ** If the batch max is smaller than the transaction max, you'll waste space at the end of the journal
  89. ** because journal_end sets the next transaction to start at 0 if the next transaction has any chance of wrapping.
  90. **
  91. ** The large the batch max age, the better the speed, and the more meta data changes you'll lose after a crash.
  92. **
  93. */
  94. /* don't mess with these for a while */
  95. /* we have a node size define somewhere in reiserfs_fs.h. -Hans */
  96. #define JOURNAL_BLOCK_SIZE 4096 /* BUG gotta get rid of this */
  97. #define JOURNAL_MAX_CNODE 1500 /* max cnodes to allocate. */
  98. #define JOURNAL_HASH_SIZE 8192
  99. #define JOURNAL_NUM_BITMAPS 5 /* number of copies of the bitmaps to have floating. Must be >= 2 */
  100. /* One of these for every block in every transaction
  101. ** Each one is in two hash tables. First, a hash of the current transaction, and after journal_end, a
  102. ** hash of all the in memory transactions.
  103. ** next and prev are used by the current transaction (journal_hash).
  104. ** hnext and hprev are used by journal_list_hash. If a block is in more than one transaction, the journal_list_hash
  105. ** links it in multiple times. This allows flush_journal_list to remove just the cnode belonging
  106. ** to a given transaction.
  107. */
  108. struct reiserfs_journal_cnode {
  109. struct buffer_head *bh; /* real buffer head */
  110. struct super_block *sb; /* dev of real buffer head */
  111. __u32 blocknr; /* block number of real buffer head, == 0 when buffer on disk */
  112. long state;
  113. struct reiserfs_journal_list *jlist; /* journal list this cnode lives in */
  114. struct reiserfs_journal_cnode *next; /* next in transaction list */
  115. struct reiserfs_journal_cnode *prev; /* prev in transaction list */
  116. struct reiserfs_journal_cnode *hprev; /* prev in hash list */
  117. struct reiserfs_journal_cnode *hnext; /* next in hash list */
  118. };
  119. struct reiserfs_bitmap_node {
  120. int id;
  121. char *data;
  122. struct list_head list;
  123. };
  124. struct reiserfs_list_bitmap {
  125. struct reiserfs_journal_list *journal_list;
  126. struct reiserfs_bitmap_node **bitmaps;
  127. };
  128. /*
  129. ** one of these for each transaction. The most important part here is the j_realblock.
  130. ** this list of cnodes is used to hash all the blocks in all the commits, to mark all the
  131. ** real buffer heads dirty once all the commits hit the disk,
  132. ** and to make sure every real block in a transaction is on disk before allowing the log area
  133. ** to be overwritten */
  134. struct reiserfs_journal_list {
  135. unsigned long j_start;
  136. unsigned long j_state;
  137. unsigned long j_len;
  138. atomic_t j_nonzerolen;
  139. atomic_t j_commit_left;
  140. atomic_t j_older_commits_done; /* all commits older than this on disk */
  141. struct semaphore j_commit_lock;
  142. unsigned long j_trans_id;
  143. time_t j_timestamp;
  144. struct reiserfs_list_bitmap *j_list_bitmap;
  145. struct buffer_head *j_commit_bh; /* commit buffer head */
  146. struct reiserfs_journal_cnode *j_realblock;
  147. struct reiserfs_journal_cnode *j_freedlist; /* list of buffers that were freed during this trans. free each of these on flush */
  148. /* time ordered list of all active transactions */
  149. struct list_head j_list;
  150. /* time ordered list of all transactions we haven't tried to flush yet */
  151. struct list_head j_working_list;
  152. /* list of tail conversion targets in need of flush before commit */
  153. struct list_head j_tail_bh_list;
  154. /* list of data=ordered buffers in need of flush before commit */
  155. struct list_head j_bh_list;
  156. int j_refcount;
  157. };
  158. struct reiserfs_journal {
  159. struct buffer_head **j_ap_blocks; /* journal blocks on disk */
  160. struct reiserfs_journal_cnode *j_last; /* newest journal block */
  161. struct reiserfs_journal_cnode *j_first; /* oldest journal block. start here for traverse */
  162. struct file *j_dev_file;
  163. struct block_device *j_dev_bd;
  164. int j_1st_reserved_block; /* first block on s_dev of reserved area journal */
  165. long j_state;
  166. unsigned long j_trans_id;
  167. unsigned long j_mount_id;
  168. unsigned long j_start; /* start of current waiting commit (index into j_ap_blocks) */
  169. unsigned long j_len; /* lenght of current waiting commit */
  170. unsigned long j_len_alloc; /* number of buffers requested by journal_begin() */
  171. atomic_t j_wcount; /* count of writers for current commit */
  172. unsigned long j_bcount; /* batch count. allows turning X transactions into 1 */
  173. unsigned long j_first_unflushed_offset; /* first unflushed transactions offset */
  174. unsigned long j_last_flush_trans_id; /* last fully flushed journal timestamp */
  175. struct buffer_head *j_header_bh;
  176. time_t j_trans_start_time; /* time this transaction started */
  177. struct semaphore j_lock;
  178. struct semaphore j_flush_sem;
  179. wait_queue_head_t j_join_wait; /* wait for current transaction to finish before starting new one */
  180. atomic_t j_jlock; /* lock for j_join_wait */
  181. int j_list_bitmap_index; /* number of next list bitmap to use */
  182. int j_must_wait; /* no more journal begins allowed. MUST sleep on j_join_wait */
  183. int j_next_full_flush; /* next journal_end will flush all journal list */
  184. int j_next_async_flush; /* next journal_end will flush all async commits */
  185. int j_cnode_used; /* number of cnodes on the used list */
  186. int j_cnode_free; /* number of cnodes on the free list */
  187. unsigned int j_trans_max; /* max number of blocks in a transaction. */
  188. unsigned int j_max_batch; /* max number of blocks to batch into a trans */
  189. unsigned int j_max_commit_age; /* in seconds, how old can an async commit be */
  190. unsigned int j_max_trans_age; /* in seconds, how old can a transaction be */
  191. unsigned int j_default_max_commit_age; /* the default for the max commit age */
  192. struct reiserfs_journal_cnode *j_cnode_free_list;
  193. struct reiserfs_journal_cnode *j_cnode_free_orig; /* orig pointer returned from vmalloc */
  194. struct reiserfs_journal_list *j_current_jl;
  195. int j_free_bitmap_nodes;
  196. int j_used_bitmap_nodes;
  197. int j_num_lists; /* total number of active transactions */
  198. int j_num_work_lists; /* number that need attention from kreiserfsd */
  199. /* debugging to make sure things are flushed in order */
  200. int j_last_flush_id;
  201. /* debugging to make sure things are committed in order */
  202. int j_last_commit_id;
  203. struct list_head j_bitmap_nodes;
  204. struct list_head j_dirty_buffers;
  205. spinlock_t j_dirty_buffers_lock; /* protects j_dirty_buffers */
  206. /* list of all active transactions */
  207. struct list_head j_journal_list;
  208. /* lists that haven't been touched by writeback attempts */
  209. struct list_head j_working_list;
  210. struct reiserfs_list_bitmap j_list_bitmap[JOURNAL_NUM_BITMAPS]; /* array of bitmaps to record the deleted blocks */
  211. struct reiserfs_journal_cnode *j_hash_table[JOURNAL_HASH_SIZE]; /* hash table for real buffer heads in current trans */
  212. struct reiserfs_journal_cnode *j_list_hash_table[JOURNAL_HASH_SIZE]; /* hash table for all the real buffer heads in all
  213. the transactions */
  214. struct list_head j_prealloc_list; /* list of inodes which have preallocated blocks */
  215. int j_persistent_trans;
  216. unsigned long j_max_trans_size;
  217. unsigned long j_max_batch_size;
  218. int j_errno;
  219. /* when flushing ordered buffers, throttle new ordered writers */
  220. struct delayed_work j_work;
  221. struct super_block *j_work_sb;
  222. atomic_t j_async_throttle;
  223. };
  224. enum journal_state_bits {
  225. J_WRITERS_BLOCKED = 1, /* set when new writers not allowed */
  226. J_WRITERS_QUEUED, /* set when log is full due to too many writers */
  227. J_ABORTED, /* set when log is aborted */
  228. };
  229. #define JOURNAL_DESC_MAGIC "ReIsErLB" /* ick. magic string to find desc blocks in the journal */
  230. typedef __u32(*hashf_t) (const signed char *, int);
  231. struct reiserfs_bitmap_info {
  232. // FIXME: Won't work with block sizes > 8K
  233. __u16 first_zero_hint;
  234. __u16 free_count;
  235. };
  236. struct proc_dir_entry;
  237. #if defined( CONFIG_PROC_FS ) && defined( CONFIG_REISERFS_PROC_INFO )
  238. typedef unsigned long int stat_cnt_t;
  239. typedef struct reiserfs_proc_info_data {
  240. spinlock_t lock;
  241. int exiting;
  242. int max_hash_collisions;
  243. stat_cnt_t breads;
  244. stat_cnt_t bread_miss;
  245. stat_cnt_t search_by_key;
  246. stat_cnt_t search_by_key_fs_changed;
  247. stat_cnt_t search_by_key_restarted;
  248. stat_cnt_t insert_item_restarted;
  249. stat_cnt_t paste_into_item_restarted;
  250. stat_cnt_t cut_from_item_restarted;
  251. stat_cnt_t delete_solid_item_restarted;
  252. stat_cnt_t delete_item_restarted;
  253. stat_cnt_t leaked_oid;
  254. stat_cnt_t leaves_removable;
  255. /* balances per level. Use explicit 5 as MAX_HEIGHT is not visible yet. */
  256. stat_cnt_t balance_at[5]; /* XXX */
  257. /* sbk == search_by_key */
  258. stat_cnt_t sbk_read_at[5]; /* XXX */
  259. stat_cnt_t sbk_fs_changed[5];
  260. stat_cnt_t sbk_restarted[5];
  261. stat_cnt_t items_at[5]; /* XXX */
  262. stat_cnt_t free_at[5]; /* XXX */
  263. stat_cnt_t can_node_be_removed[5]; /* XXX */
  264. long int lnum[5]; /* XXX */
  265. long int rnum[5]; /* XXX */
  266. long int lbytes[5]; /* XXX */
  267. long int rbytes[5]; /* XXX */
  268. stat_cnt_t get_neighbors[5];
  269. stat_cnt_t get_neighbors_restart[5];
  270. stat_cnt_t need_l_neighbor[5];
  271. stat_cnt_t need_r_neighbor[5];
  272. stat_cnt_t free_block;
  273. struct __scan_bitmap_stats {
  274. stat_cnt_t call;
  275. stat_cnt_t wait;
  276. stat_cnt_t bmap;
  277. stat_cnt_t retry;
  278. stat_cnt_t in_journal_hint;
  279. stat_cnt_t in_journal_nohint;
  280. stat_cnt_t stolen;
  281. } scan_bitmap;
  282. struct __journal_stats {
  283. stat_cnt_t in_journal;
  284. stat_cnt_t in_journal_bitmap;
  285. stat_cnt_t in_journal_reusable;
  286. stat_cnt_t lock_journal;
  287. stat_cnt_t lock_journal_wait;
  288. stat_cnt_t journal_being;
  289. stat_cnt_t journal_relock_writers;
  290. stat_cnt_t journal_relock_wcount;
  291. stat_cnt_t mark_dirty;
  292. stat_cnt_t mark_dirty_already;
  293. stat_cnt_t mark_dirty_notjournal;
  294. stat_cnt_t restore_prepared;
  295. stat_cnt_t prepare;
  296. stat_cnt_t prepare_retry;
  297. } journal;
  298. } reiserfs_proc_info_data_t;
  299. #else
  300. typedef struct reiserfs_proc_info_data {
  301. } reiserfs_proc_info_data_t;
  302. #endif
  303. /* reiserfs union of in-core super block data */
  304. struct reiserfs_sb_info {
  305. struct buffer_head *s_sbh; /* Buffer containing the super block */
  306. /* both the comment and the choice of
  307. name are unclear for s_rs -Hans */
  308. struct reiserfs_super_block *s_rs; /* Pointer to the super block in the buffer */
  309. struct reiserfs_bitmap_info *s_ap_bitmap;
  310. struct reiserfs_journal *s_journal; /* pointer to journal information */
  311. unsigned short s_mount_state; /* reiserfs state (valid, invalid) */
  312. /* Comment? -Hans */
  313. void (*end_io_handler) (struct buffer_head *, int);
  314. hashf_t s_hash_function; /* pointer to function which is used
  315. to sort names in directory. Set on
  316. mount */
  317. unsigned long s_mount_opt; /* reiserfs's mount options are set
  318. here (currently - NOTAIL, NOLOG,
  319. REPLAYONLY) */
  320. struct { /* This is a structure that describes block allocator options */
  321. unsigned long bits; /* Bitfield for enable/disable kind of options */
  322. unsigned long large_file_size; /* size started from which we consider file to be a large one(in blocks) */
  323. int border; /* percentage of disk, border takes */
  324. int preallocmin; /* Minimal file size (in blocks) starting from which we do preallocations */
  325. int preallocsize; /* Number of blocks we try to prealloc when file
  326. reaches preallocmin size (in blocks) or
  327. prealloc_list is empty. */
  328. } s_alloc_options;
  329. /* Comment? -Hans */
  330. wait_queue_head_t s_wait;
  331. /* To be obsoleted soon by per buffer seals.. -Hans */
  332. atomic_t s_generation_counter; // increased by one every time the
  333. // tree gets re-balanced
  334. unsigned long s_properties; /* File system properties. Currently holds
  335. on-disk FS format */
  336. /* session statistics */
  337. int s_disk_reads;
  338. int s_disk_writes;
  339. int s_fix_nodes;
  340. int s_do_balance;
  341. int s_unneeded_left_neighbor;
  342. int s_good_search_by_key_reada;
  343. int s_bmaps;
  344. int s_bmaps_without_search;
  345. int s_direct2indirect;
  346. int s_indirect2direct;
  347. /* set up when it's ok for reiserfs_read_inode2() to read from
  348. disk inode with nlink==0. Currently this is only used during
  349. finish_unfinished() processing at mount time */
  350. int s_is_unlinked_ok;
  351. reiserfs_proc_info_data_t s_proc_info_data;
  352. struct proc_dir_entry *procdir;
  353. int reserved_blocks; /* amount of blocks reserved for further allocations */
  354. spinlock_t bitmap_lock; /* this lock on now only used to protect reserved_blocks variable */
  355. struct dentry *priv_root; /* root of /.reiserfs_priv */
  356. struct dentry *xattr_root; /* root of /.reiserfs_priv/.xa */
  357. struct rw_semaphore xattr_dir_sem;
  358. int j_errno;
  359. #ifdef CONFIG_QUOTA
  360. char *s_qf_names[MAXQUOTAS];
  361. int s_jquota_fmt;
  362. #endif
  363. };
  364. /* Definitions of reiserfs on-disk properties: */
  365. #define REISERFS_3_5 0
  366. #define REISERFS_3_6 1
  367. #define REISERFS_OLD_FORMAT 2
  368. enum reiserfs_mount_options {
  369. /* Mount options */
  370. REISERFS_LARGETAIL, /* large tails will be created in a session */
  371. REISERFS_SMALLTAIL, /* small (for files less than block size) tails will be created in a session */
  372. REPLAYONLY, /* replay journal and return 0. Use by fsck */
  373. REISERFS_CONVERT, /* -o conv: causes conversion of old
  374. format super block to the new
  375. format. If not specified - old
  376. partition will be dealt with in a
  377. manner of 3.5.x */
  378. /* -o hash={tea, rupasov, r5, detect} is meant for properly mounting
  379. ** reiserfs disks from 3.5.19 or earlier. 99% of the time, this option
  380. ** is not required. If the normal autodection code can't determine which
  381. ** hash to use (because both hashes had the same value for a file)
  382. ** use this option to force a specific hash. It won't allow you to override
  383. ** the existing hash on the FS, so if you have a tea hash disk, and mount
  384. ** with -o hash=rupasov, the mount will fail.
  385. */
  386. FORCE_TEA_HASH, /* try to force tea hash on mount */
  387. FORCE_RUPASOV_HASH, /* try to force rupasov hash on mount */
  388. FORCE_R5_HASH, /* try to force rupasov hash on mount */
  389. FORCE_HASH_DETECT, /* try to detect hash function on mount */
  390. REISERFS_DATA_LOG,
  391. REISERFS_DATA_ORDERED,
  392. REISERFS_DATA_WRITEBACK,
  393. /* used for testing experimental features, makes benchmarking new
  394. features with and without more convenient, should never be used by
  395. users in any code shipped to users (ideally) */
  396. REISERFS_NO_BORDER,
  397. REISERFS_NO_UNHASHED_RELOCATION,
  398. REISERFS_HASHED_RELOCATION,
  399. REISERFS_ATTRS,
  400. REISERFS_XATTRS,
  401. REISERFS_XATTRS_USER,
  402. REISERFS_POSIXACL,
  403. REISERFS_BARRIER_NONE,
  404. REISERFS_BARRIER_FLUSH,
  405. /* Actions on error */
  406. REISERFS_ERROR_PANIC,
  407. REISERFS_ERROR_RO,
  408. REISERFS_ERROR_CONTINUE,
  409. REISERFS_QUOTA, /* Some quota option specified */
  410. REISERFS_TEST1,
  411. REISERFS_TEST2,
  412. REISERFS_TEST3,
  413. REISERFS_TEST4,
  414. REISERFS_UNSUPPORTED_OPT,
  415. };
  416. #define reiserfs_r5_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_R5_HASH))
  417. #define reiserfs_rupasov_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_RUPASOV_HASH))
  418. #define reiserfs_tea_hash(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_TEA_HASH))
  419. #define reiserfs_hash_detect(s) (REISERFS_SB(s)->s_mount_opt & (1 << FORCE_HASH_DETECT))
  420. #define reiserfs_no_border(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_BORDER))
  421. #define reiserfs_no_unhashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_NO_UNHASHED_RELOCATION))
  422. #define reiserfs_hashed_relocation(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_HASHED_RELOCATION))
  423. #define reiserfs_test4(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_TEST4))
  424. #define have_large_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_LARGETAIL))
  425. #define have_small_tails(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_SMALLTAIL))
  426. #define replay_only(s) (REISERFS_SB(s)->s_mount_opt & (1 << REPLAYONLY))
  427. #define reiserfs_attrs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ATTRS))
  428. #define old_format_only(s) (REISERFS_SB(s)->s_properties & (1 << REISERFS_3_5))
  429. #define convert_reiserfs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_CONVERT))
  430. #define reiserfs_data_log(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_LOG))
  431. #define reiserfs_data_ordered(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_ORDERED))
  432. #define reiserfs_data_writeback(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_DATA_WRITEBACK))
  433. #define reiserfs_xattrs(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_XATTRS))
  434. #define reiserfs_xattrs_user(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_XATTRS_USER))
  435. #define reiserfs_posixacl(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_POSIXACL))
  436. #define reiserfs_xattrs_optional(s) (reiserfs_xattrs_user(s) || reiserfs_posixacl(s))
  437. #define reiserfs_barrier_none(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_NONE))
  438. #define reiserfs_barrier_flush(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_BARRIER_FLUSH))
  439. #define reiserfs_error_panic(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_PANIC))
  440. #define reiserfs_error_ro(s) (REISERFS_SB(s)->s_mount_opt & (1 << REISERFS_ERROR_RO))
  441. void reiserfs_file_buffer(struct buffer_head *bh, int list);
  442. extern struct file_system_type reiserfs_fs_type;
  443. int reiserfs_resize(struct super_block *, unsigned long);
  444. #define CARRY_ON 0
  445. #define SCHEDULE_OCCURRED 1
  446. #define SB_BUFFER_WITH_SB(s) (REISERFS_SB(s)->s_sbh)
  447. #define SB_JOURNAL(s) (REISERFS_SB(s)->s_journal)
  448. #define SB_JOURNAL_1st_RESERVED_BLOCK(s) (SB_JOURNAL(s)->j_1st_reserved_block)
  449. #define SB_JOURNAL_LEN_FREE(s) (SB_JOURNAL(s)->j_journal_len_free)
  450. #define SB_AP_BITMAP(s) (REISERFS_SB(s)->s_ap_bitmap)
  451. #define SB_DISK_JOURNAL_HEAD(s) (SB_JOURNAL(s)->j_header_bh->)
  452. /* A safe version of the "bdevname", which returns the "s_id" field of
  453. * a superblock or else "Null superblock" if the super block is NULL.
  454. */
  455. static inline char *reiserfs_bdevname(struct super_block *s)
  456. {
  457. return (s == NULL) ? "Null superblock" : s->s_id;
  458. }
  459. #define reiserfs_is_journal_aborted(journal) (unlikely (__reiserfs_is_journal_aborted (journal)))
  460. static inline int __reiserfs_is_journal_aborted(struct reiserfs_journal
  461. *journal)
  462. {
  463. return test_bit(J_ABORTED, &journal->j_state);
  464. }
  465. #endif /* _LINUX_REISER_FS_SB */