ocfs2.h 13 KB

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