ocfs2.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * ocfs2.h
  5. *
  6. * Defines macros and structures used in OCFS2
  7. *
  8. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. */
  25. #ifndef OCFS2_H
  26. #define OCFS2_H
  27. #include <linux/spinlock.h>
  28. #include <linux/sched.h>
  29. #include <linux/wait.h>
  30. #include <linux/list.h>
  31. #include <linux/rbtree.h>
  32. #include <linux/workqueue.h>
  33. #include <linux/kref.h>
  34. #include <linux/mutex.h>
  35. #include <linux/jbd.h>
  36. /* For union ocfs2_dlm_lksb */
  37. #include "stackglue.h"
  38. #include "ocfs2_fs.h"
  39. #include "ocfs2_lockid.h"
  40. /* Most user visible OCFS2 inodes will have very few pieces of
  41. * metadata, but larger files (including bitmaps, etc) must be taken
  42. * into account when designing an access scheme. We allow a small
  43. * amount of inlined blocks to be stored on an array and grow the
  44. * structure into a rb tree when necessary. */
  45. #define OCFS2_INODE_MAX_CACHE_ARRAY 2
  46. struct ocfs2_caching_info {
  47. unsigned int ci_num_cached;
  48. union {
  49. sector_t ci_array[OCFS2_INODE_MAX_CACHE_ARRAY];
  50. struct rb_root ci_tree;
  51. } ci_cache;
  52. };
  53. /* this limits us to 256 nodes
  54. * if we need more, we can do a kmalloc for the map */
  55. #define OCFS2_NODE_MAP_MAX_NODES 256
  56. struct ocfs2_node_map {
  57. u16 num_nodes;
  58. unsigned long map[BITS_TO_LONGS(OCFS2_NODE_MAP_MAX_NODES)];
  59. };
  60. enum ocfs2_ast_action {
  61. OCFS2_AST_INVALID = 0,
  62. OCFS2_AST_ATTACH,
  63. OCFS2_AST_CONVERT,
  64. OCFS2_AST_DOWNCONVERT,
  65. };
  66. /* actions for an unlockast function to take. */
  67. enum ocfs2_unlock_action {
  68. OCFS2_UNLOCK_INVALID = 0,
  69. OCFS2_UNLOCK_CANCEL_CONVERT,
  70. OCFS2_UNLOCK_DROP_LOCK,
  71. };
  72. /* ocfs2_lock_res->l_flags flags. */
  73. #define OCFS2_LOCK_ATTACHED (0x00000001) /* have we initialized
  74. * the lvb */
  75. #define OCFS2_LOCK_BUSY (0x00000002) /* we are currently in
  76. * dlm_lock */
  77. #define OCFS2_LOCK_BLOCKED (0x00000004) /* blocked waiting to
  78. * downconvert*/
  79. #define OCFS2_LOCK_LOCAL (0x00000008) /* newly created inode */
  80. #define OCFS2_LOCK_NEEDS_REFRESH (0x00000010)
  81. #define OCFS2_LOCK_REFRESHING (0x00000020)
  82. #define OCFS2_LOCK_INITIALIZED (0x00000040) /* track initialization
  83. * for shutdown paths */
  84. #define OCFS2_LOCK_FREEING (0x00000080) /* help dlmglue track
  85. * when to skip queueing
  86. * a lock because it's
  87. * about to be
  88. * dropped. */
  89. #define OCFS2_LOCK_QUEUED (0x00000100) /* queued for downconvert */
  90. #define OCFS2_LOCK_NOCACHE (0x00000200) /* don't use a holder count */
  91. #define OCFS2_LOCK_PENDING (0x00000400) /* This lockres is pending a
  92. call to dlm_lock. Only
  93. exists with BUSY set. */
  94. struct ocfs2_lock_res_ops;
  95. typedef void (*ocfs2_lock_callback)(int status, unsigned long data);
  96. struct ocfs2_lock_res {
  97. void *l_priv;
  98. struct ocfs2_lock_res_ops *l_ops;
  99. spinlock_t l_lock;
  100. struct list_head l_blocked_list;
  101. struct list_head l_mask_waiters;
  102. enum ocfs2_lock_type l_type;
  103. unsigned long l_flags;
  104. char l_name[OCFS2_LOCK_ID_MAX_LEN];
  105. int l_level;
  106. unsigned int l_ro_holders;
  107. unsigned int l_ex_holders;
  108. union ocfs2_dlm_lksb l_lksb;
  109. /* used from AST/BAST funcs. */
  110. enum ocfs2_ast_action l_action;
  111. enum ocfs2_unlock_action l_unlock_action;
  112. int l_requested;
  113. int l_blocking;
  114. unsigned int l_pending_gen;
  115. wait_queue_head_t l_event;
  116. struct list_head l_debug_list;
  117. };
  118. struct ocfs2_dlm_debug {
  119. struct kref d_refcnt;
  120. struct dentry *d_locking_state;
  121. struct list_head d_lockres_tracking;
  122. };
  123. enum ocfs2_vol_state
  124. {
  125. VOLUME_INIT = 0,
  126. VOLUME_MOUNTED,
  127. VOLUME_DISMOUNTED,
  128. VOLUME_DISABLED
  129. };
  130. struct ocfs2_alloc_stats
  131. {
  132. atomic_t moves;
  133. atomic_t local_data;
  134. atomic_t bitmap_data;
  135. atomic_t bg_allocs;
  136. atomic_t bg_extends;
  137. };
  138. enum ocfs2_local_alloc_state
  139. {
  140. OCFS2_LA_UNUSED = 0,
  141. OCFS2_LA_ENABLED,
  142. OCFS2_LA_DISABLED
  143. };
  144. enum ocfs2_mount_options
  145. {
  146. OCFS2_MOUNT_HB_LOCAL = 1 << 0, /* Heartbeat started in local mode */
  147. OCFS2_MOUNT_BARRIER = 1 << 1, /* Use block barriers */
  148. OCFS2_MOUNT_NOINTR = 1 << 2, /* Don't catch signals */
  149. OCFS2_MOUNT_ERRORS_PANIC = 1 << 3, /* Panic on errors */
  150. OCFS2_MOUNT_DATA_WRITEBACK = 1 << 4, /* No data ordering */
  151. OCFS2_MOUNT_LOCALFLOCKS = 1 << 5, /* No cluster aware user file locks */
  152. };
  153. #define OCFS2_OSB_SOFT_RO 0x0001
  154. #define OCFS2_OSB_HARD_RO 0x0002
  155. #define OCFS2_OSB_ERROR_FS 0x0004
  156. #define OCFS2_DEFAULT_ATIME_QUANTUM 60
  157. struct ocfs2_journal;
  158. struct ocfs2_slot_info;
  159. struct ocfs2_recovery_map;
  160. struct ocfs2_super
  161. {
  162. struct task_struct *commit_task;
  163. struct super_block *sb;
  164. struct inode *root_inode;
  165. struct inode *sys_root_inode;
  166. struct inode *system_inodes[NUM_SYSTEM_INODES];
  167. struct ocfs2_slot_info *slot_info;
  168. spinlock_t node_map_lock;
  169. u64 root_blkno;
  170. u64 system_dir_blkno;
  171. u64 bitmap_blkno;
  172. u32 bitmap_cpg;
  173. u8 *uuid;
  174. char *uuid_str;
  175. u8 *vol_label;
  176. u64 first_cluster_group_blkno;
  177. u32 fs_generation;
  178. u32 s_feature_compat;
  179. u32 s_feature_incompat;
  180. u32 s_feature_ro_compat;
  181. /* Protects s_next_generaion, osb_flags. Could protect more on
  182. * osb as it's very short lived. */
  183. spinlock_t osb_lock;
  184. u32 s_next_generation;
  185. unsigned long osb_flags;
  186. unsigned long s_mount_opt;
  187. unsigned int s_atime_quantum;
  188. unsigned int max_slots;
  189. unsigned int node_num;
  190. int slot_num;
  191. int preferred_slot;
  192. int s_sectsize_bits;
  193. int s_clustersize;
  194. int s_clustersize_bits;
  195. atomic_t vol_state;
  196. struct mutex recovery_lock;
  197. struct ocfs2_recovery_map *recovery_map;
  198. struct task_struct *recovery_thread_task;
  199. int disable_recovery;
  200. wait_queue_head_t checkpoint_event;
  201. atomic_t needs_checkpoint;
  202. struct ocfs2_journal *journal;
  203. unsigned long osb_commit_interval;
  204. int local_alloc_size;
  205. enum ocfs2_local_alloc_state local_alloc_state;
  206. struct buffer_head *local_alloc_bh;
  207. u64 la_last_gd;
  208. /* Next two fields are for local node slot recovery during
  209. * mount. */
  210. int dirty;
  211. struct ocfs2_dinode *local_alloc_copy;
  212. struct ocfs2_alloc_stats alloc_stats;
  213. char dev_str[20]; /* "major,minor" of the device */
  214. struct ocfs2_cluster_connection *cconn;
  215. struct ocfs2_lock_res osb_super_lockres;
  216. struct ocfs2_lock_res osb_rename_lockres;
  217. struct ocfs2_dlm_debug *osb_dlm_debug;
  218. struct dentry *osb_debug_root;
  219. wait_queue_head_t recovery_event;
  220. spinlock_t dc_task_lock;
  221. struct task_struct *dc_task;
  222. wait_queue_head_t dc_event;
  223. unsigned long dc_wake_sequence;
  224. unsigned long dc_work_sequence;
  225. /*
  226. * Any thread can add locks to the list, but the downconvert
  227. * thread is the only one allowed to remove locks. Any change
  228. * to this rule requires updating
  229. * ocfs2_downconvert_thread_do_work().
  230. */
  231. struct list_head blocked_lock_list;
  232. unsigned long blocked_lock_count;
  233. wait_queue_head_t osb_mount_event;
  234. /* Truncate log info */
  235. struct inode *osb_tl_inode;
  236. struct buffer_head *osb_tl_bh;
  237. struct delayed_work osb_truncate_log_wq;
  238. struct ocfs2_node_map osb_recovering_orphan_dirs;
  239. unsigned int *osb_orphan_wipes;
  240. wait_queue_head_t osb_wipe_event;
  241. };
  242. #define OCFS2_SB(sb) ((struct ocfs2_super *)(sb)->s_fs_info)
  243. static inline int ocfs2_should_order_data(struct inode *inode)
  244. {
  245. if (!S_ISREG(inode->i_mode))
  246. return 0;
  247. if (OCFS2_SB(inode->i_sb)->s_mount_opt & OCFS2_MOUNT_DATA_WRITEBACK)
  248. return 0;
  249. return 1;
  250. }
  251. static inline int ocfs2_sparse_alloc(struct ocfs2_super *osb)
  252. {
  253. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_SPARSE_ALLOC)
  254. return 1;
  255. return 0;
  256. }
  257. static inline int ocfs2_writes_unwritten_extents(struct ocfs2_super *osb)
  258. {
  259. /*
  260. * Support for sparse files is a pre-requisite
  261. */
  262. if (!ocfs2_sparse_alloc(osb))
  263. return 0;
  264. if (osb->s_feature_ro_compat & OCFS2_FEATURE_RO_COMPAT_UNWRITTEN)
  265. return 1;
  266. return 0;
  267. }
  268. static inline int ocfs2_supports_inline_data(struct ocfs2_super *osb)
  269. {
  270. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_INLINE_DATA)
  271. return 1;
  272. return 0;
  273. }
  274. /* set / clear functions because cluster events can make these happen
  275. * in parallel so we want the transitions to be atomic. this also
  276. * means that any future flags osb_flags must be protected by spinlock
  277. * too! */
  278. static inline void ocfs2_set_osb_flag(struct ocfs2_super *osb,
  279. unsigned long flag)
  280. {
  281. spin_lock(&osb->osb_lock);
  282. osb->osb_flags |= flag;
  283. spin_unlock(&osb->osb_lock);
  284. }
  285. static inline void ocfs2_set_ro_flag(struct ocfs2_super *osb,
  286. int hard)
  287. {
  288. spin_lock(&osb->osb_lock);
  289. osb->osb_flags &= ~(OCFS2_OSB_SOFT_RO|OCFS2_OSB_HARD_RO);
  290. if (hard)
  291. osb->osb_flags |= OCFS2_OSB_HARD_RO;
  292. else
  293. osb->osb_flags |= OCFS2_OSB_SOFT_RO;
  294. spin_unlock(&osb->osb_lock);
  295. }
  296. static inline int ocfs2_is_hard_readonly(struct ocfs2_super *osb)
  297. {
  298. int ret;
  299. spin_lock(&osb->osb_lock);
  300. ret = osb->osb_flags & OCFS2_OSB_HARD_RO;
  301. spin_unlock(&osb->osb_lock);
  302. return ret;
  303. }
  304. static inline int ocfs2_is_soft_readonly(struct ocfs2_super *osb)
  305. {
  306. int ret;
  307. spin_lock(&osb->osb_lock);
  308. ret = osb->osb_flags & OCFS2_OSB_SOFT_RO;
  309. spin_unlock(&osb->osb_lock);
  310. return ret;
  311. }
  312. static inline int ocfs2_mount_local(struct ocfs2_super *osb)
  313. {
  314. return (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_LOCAL_MOUNT);
  315. }
  316. static inline int ocfs2_uses_extended_slot_map(struct ocfs2_super *osb)
  317. {
  318. return (osb->s_feature_incompat &
  319. OCFS2_FEATURE_INCOMPAT_EXTENDED_SLOT_MAP);
  320. }
  321. #define OCFS2_IS_VALID_DINODE(ptr) \
  322. (!strcmp((ptr)->i_signature, OCFS2_INODE_SIGNATURE))
  323. #define OCFS2_RO_ON_INVALID_DINODE(__sb, __di) do { \
  324. typeof(__di) ____di = (__di); \
  325. ocfs2_error((__sb), \
  326. "Dinode # %llu has bad signature %.*s", \
  327. (unsigned long long)le64_to_cpu((____di)->i_blkno), 7, \
  328. (____di)->i_signature); \
  329. } while (0)
  330. #define OCFS2_IS_VALID_EXTENT_BLOCK(ptr) \
  331. (!strcmp((ptr)->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE))
  332. #define OCFS2_RO_ON_INVALID_EXTENT_BLOCK(__sb, __eb) do { \
  333. typeof(__eb) ____eb = (__eb); \
  334. ocfs2_error((__sb), \
  335. "Extent Block # %llu has bad signature %.*s", \
  336. (unsigned long long)le64_to_cpu((____eb)->h_blkno), 7, \
  337. (____eb)->h_signature); \
  338. } while (0)
  339. #define OCFS2_IS_VALID_GROUP_DESC(ptr) \
  340. (!strcmp((ptr)->bg_signature, OCFS2_GROUP_DESC_SIGNATURE))
  341. #define OCFS2_RO_ON_INVALID_GROUP_DESC(__sb, __gd) do { \
  342. typeof(__gd) ____gd = (__gd); \
  343. ocfs2_error((__sb), \
  344. "Group Descriptor # %llu has bad signature %.*s", \
  345. (unsigned long long)le64_to_cpu((____gd)->bg_blkno), 7, \
  346. (____gd)->bg_signature); \
  347. } while (0)
  348. static inline unsigned long ino_from_blkno(struct super_block *sb,
  349. u64 blkno)
  350. {
  351. return (unsigned long)(blkno & (u64)ULONG_MAX);
  352. }
  353. static inline u64 ocfs2_clusters_to_blocks(struct super_block *sb,
  354. u32 clusters)
  355. {
  356. int c_to_b_bits = OCFS2_SB(sb)->s_clustersize_bits -
  357. sb->s_blocksize_bits;
  358. return (u64)clusters << c_to_b_bits;
  359. }
  360. static inline u32 ocfs2_blocks_to_clusters(struct super_block *sb,
  361. u64 blocks)
  362. {
  363. int b_to_c_bits = OCFS2_SB(sb)->s_clustersize_bits -
  364. sb->s_blocksize_bits;
  365. return (u32)(blocks >> b_to_c_bits);
  366. }
  367. static inline unsigned int ocfs2_clusters_for_bytes(struct super_block *sb,
  368. u64 bytes)
  369. {
  370. int cl_bits = OCFS2_SB(sb)->s_clustersize_bits;
  371. unsigned int clusters;
  372. bytes += OCFS2_SB(sb)->s_clustersize - 1;
  373. /* OCFS2 just cannot have enough clusters to overflow this */
  374. clusters = (unsigned int)(bytes >> cl_bits);
  375. return clusters;
  376. }
  377. static inline u64 ocfs2_blocks_for_bytes(struct super_block *sb,
  378. u64 bytes)
  379. {
  380. bytes += sb->s_blocksize - 1;
  381. return bytes >> sb->s_blocksize_bits;
  382. }
  383. static inline u64 ocfs2_clusters_to_bytes(struct super_block *sb,
  384. u32 clusters)
  385. {
  386. return (u64)clusters << OCFS2_SB(sb)->s_clustersize_bits;
  387. }
  388. static inline u64 ocfs2_align_bytes_to_clusters(struct super_block *sb,
  389. u64 bytes)
  390. {
  391. int cl_bits = OCFS2_SB(sb)->s_clustersize_bits;
  392. unsigned int clusters;
  393. clusters = ocfs2_clusters_for_bytes(sb, bytes);
  394. return (u64)clusters << cl_bits;
  395. }
  396. static inline u64 ocfs2_align_bytes_to_blocks(struct super_block *sb,
  397. u64 bytes)
  398. {
  399. u64 blocks;
  400. blocks = ocfs2_blocks_for_bytes(sb, bytes);
  401. return blocks << sb->s_blocksize_bits;
  402. }
  403. static inline unsigned long ocfs2_align_bytes_to_sectors(u64 bytes)
  404. {
  405. return (unsigned long)((bytes + 511) >> 9);
  406. }
  407. static inline unsigned int ocfs2_page_index_to_clusters(struct super_block *sb,
  408. unsigned long pg_index)
  409. {
  410. u32 clusters = pg_index;
  411. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  412. if (unlikely(PAGE_CACHE_SHIFT > cbits))
  413. clusters = pg_index << (PAGE_CACHE_SHIFT - cbits);
  414. else if (PAGE_CACHE_SHIFT < cbits)
  415. clusters = pg_index >> (cbits - PAGE_CACHE_SHIFT);
  416. return clusters;
  417. }
  418. /*
  419. * Find the 1st page index which covers the given clusters.
  420. */
  421. static inline pgoff_t ocfs2_align_clusters_to_page_index(struct super_block *sb,
  422. u32 clusters)
  423. {
  424. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  425. pgoff_t index = clusters;
  426. if (PAGE_CACHE_SHIFT > cbits) {
  427. index = (pgoff_t)clusters >> (PAGE_CACHE_SHIFT - cbits);
  428. } else if (PAGE_CACHE_SHIFT < cbits) {
  429. index = (pgoff_t)clusters << (cbits - PAGE_CACHE_SHIFT);
  430. }
  431. return index;
  432. }
  433. static inline unsigned int ocfs2_pages_per_cluster(struct super_block *sb)
  434. {
  435. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  436. unsigned int pages_per_cluster = 1;
  437. if (PAGE_CACHE_SHIFT < cbits)
  438. pages_per_cluster = 1 << (cbits - PAGE_CACHE_SHIFT);
  439. return pages_per_cluster;
  440. }
  441. #define ocfs2_set_bit ext2_set_bit
  442. #define ocfs2_clear_bit ext2_clear_bit
  443. #define ocfs2_test_bit ext2_test_bit
  444. #define ocfs2_find_next_zero_bit ext2_find_next_zero_bit
  445. #endif /* OCFS2_H */