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