ocfs2.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530
  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. #define OCFS2_LOCK_NOCACHE (0x00000200) /* don't use a holder count */
  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. struct dlm_lockstatus 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. wait_queue_head_t l_event;
  115. struct list_head l_debug_list;
  116. };
  117. struct ocfs2_dlm_debug {
  118. struct kref d_refcnt;
  119. struct dentry *d_locking_state;
  120. struct list_head d_lockres_tracking;
  121. };
  122. enum ocfs2_vol_state
  123. {
  124. VOLUME_INIT = 0,
  125. VOLUME_MOUNTED,
  126. VOLUME_DISMOUNTED,
  127. VOLUME_DISABLED
  128. };
  129. struct ocfs2_alloc_stats
  130. {
  131. atomic_t moves;
  132. atomic_t local_data;
  133. atomic_t bitmap_data;
  134. atomic_t bg_allocs;
  135. atomic_t bg_extends;
  136. };
  137. enum ocfs2_local_alloc_state
  138. {
  139. OCFS2_LA_UNUSED = 0,
  140. OCFS2_LA_ENABLED,
  141. OCFS2_LA_DISABLED
  142. };
  143. enum ocfs2_mount_options
  144. {
  145. OCFS2_MOUNT_HB_LOCAL = 1 << 0, /* Heartbeat started in local mode */
  146. OCFS2_MOUNT_BARRIER = 1 << 1, /* Use block barriers */
  147. OCFS2_MOUNT_NOINTR = 1 << 2, /* Don't catch signals */
  148. OCFS2_MOUNT_ERRORS_PANIC = 1 << 3, /* Panic on errors */
  149. OCFS2_MOUNT_DATA_WRITEBACK = 1 << 4, /* No data ordering */
  150. OCFS2_MOUNT_LOCALFLOCKS = 1 << 5, /* No cluster aware user file locks */
  151. };
  152. #define OCFS2_OSB_SOFT_RO 0x0001
  153. #define OCFS2_OSB_HARD_RO 0x0002
  154. #define OCFS2_OSB_ERROR_FS 0x0004
  155. #define OCFS2_DEFAULT_ATIME_QUANTUM 60
  156. struct ocfs2_journal;
  157. struct ocfs2_super
  158. {
  159. struct task_struct *commit_task;
  160. struct super_block *sb;
  161. struct inode *root_inode;
  162. struct inode *sys_root_inode;
  163. struct inode *system_inodes[NUM_SYSTEM_INODES];
  164. struct ocfs2_slot_info *slot_info;
  165. spinlock_t node_map_lock;
  166. struct ocfs2_node_map recovery_map;
  167. u64 root_blkno;
  168. u64 system_dir_blkno;
  169. u64 bitmap_blkno;
  170. u32 bitmap_cpg;
  171. u8 *uuid;
  172. char *uuid_str;
  173. u8 *vol_label;
  174. u64 first_cluster_group_blkno;
  175. u32 fs_generation;
  176. u32 s_feature_compat;
  177. u32 s_feature_incompat;
  178. u32 s_feature_ro_compat;
  179. /* Protects s_next_generaion, osb_flags. Could protect more on
  180. * osb as it's very short lived. */
  181. spinlock_t osb_lock;
  182. u32 s_next_generation;
  183. unsigned long osb_flags;
  184. unsigned long s_mount_opt;
  185. unsigned int s_atime_quantum;
  186. u16 max_slots;
  187. s16 node_num;
  188. s16 slot_num;
  189. s16 preferred_slot;
  190. int s_sectsize_bits;
  191. int s_clustersize;
  192. int s_clustersize_bits;
  193. atomic_t vol_state;
  194. struct mutex recovery_lock;
  195. struct task_struct *recovery_thread_task;
  196. int disable_recovery;
  197. wait_queue_head_t checkpoint_event;
  198. atomic_t needs_checkpoint;
  199. struct ocfs2_journal *journal;
  200. unsigned long osb_commit_interval;
  201. int local_alloc_size;
  202. enum ocfs2_local_alloc_state local_alloc_state;
  203. struct buffer_head *local_alloc_bh;
  204. u64 la_last_gd;
  205. /* Next two fields are for local node slot recovery during
  206. * mount. */
  207. int dirty;
  208. struct ocfs2_dinode *local_alloc_copy;
  209. struct ocfs2_alloc_stats alloc_stats;
  210. char dev_str[20]; /* "major,minor" of the device */
  211. struct dlm_ctxt *dlm;
  212. struct ocfs2_lock_res osb_super_lockres;
  213. struct ocfs2_lock_res osb_rename_lockres;
  214. struct dlm_eviction_cb osb_eviction_cb;
  215. struct ocfs2_dlm_debug *osb_dlm_debug;
  216. struct dentry *osb_debug_root;
  217. wait_queue_head_t recovery_event;
  218. spinlock_t dc_task_lock;
  219. struct task_struct *dc_task;
  220. wait_queue_head_t dc_event;
  221. unsigned long dc_wake_sequence;
  222. unsigned long dc_work_sequence;
  223. /*
  224. * Any thread can add locks to the list, but the downconvert
  225. * thread is the only one allowed to remove locks. Any change
  226. * to this rule requires updating
  227. * ocfs2_downconvert_thread_do_work().
  228. */
  229. struct list_head blocked_lock_list;
  230. unsigned long blocked_lock_count;
  231. wait_queue_head_t osb_mount_event;
  232. /* Truncate log info */
  233. struct inode *osb_tl_inode;
  234. struct buffer_head *osb_tl_bh;
  235. struct delayed_work osb_truncate_log_wq;
  236. struct ocfs2_node_map osb_recovering_orphan_dirs;
  237. unsigned int *osb_orphan_wipes;
  238. wait_queue_head_t osb_wipe_event;
  239. };
  240. #define OCFS2_SB(sb) ((struct ocfs2_super *)(sb)->s_fs_info)
  241. static inline int ocfs2_should_order_data(struct inode *inode)
  242. {
  243. if (!S_ISREG(inode->i_mode))
  244. return 0;
  245. if (OCFS2_SB(inode->i_sb)->s_mount_opt & OCFS2_MOUNT_DATA_WRITEBACK)
  246. return 0;
  247. return 1;
  248. }
  249. static inline int ocfs2_sparse_alloc(struct ocfs2_super *osb)
  250. {
  251. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_SPARSE_ALLOC)
  252. return 1;
  253. return 0;
  254. }
  255. static inline int ocfs2_writes_unwritten_extents(struct ocfs2_super *osb)
  256. {
  257. /*
  258. * Support for sparse files is a pre-requisite
  259. */
  260. if (!ocfs2_sparse_alloc(osb))
  261. return 0;
  262. if (osb->s_feature_ro_compat & OCFS2_FEATURE_RO_COMPAT_UNWRITTEN)
  263. return 1;
  264. return 0;
  265. }
  266. static inline int ocfs2_supports_inline_data(struct ocfs2_super *osb)
  267. {
  268. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_INLINE_DATA)
  269. return 1;
  270. return 0;
  271. }
  272. /* set / clear functions because cluster events can make these happen
  273. * in parallel so we want the transitions to be atomic. this also
  274. * means that any future flags osb_flags must be protected by spinlock
  275. * too! */
  276. static inline void ocfs2_set_osb_flag(struct ocfs2_super *osb,
  277. unsigned long flag)
  278. {
  279. spin_lock(&osb->osb_lock);
  280. osb->osb_flags |= flag;
  281. spin_unlock(&osb->osb_lock);
  282. }
  283. static inline void ocfs2_set_ro_flag(struct ocfs2_super *osb,
  284. int hard)
  285. {
  286. spin_lock(&osb->osb_lock);
  287. osb->osb_flags &= ~(OCFS2_OSB_SOFT_RO|OCFS2_OSB_HARD_RO);
  288. if (hard)
  289. osb->osb_flags |= OCFS2_OSB_HARD_RO;
  290. else
  291. osb->osb_flags |= OCFS2_OSB_SOFT_RO;
  292. spin_unlock(&osb->osb_lock);
  293. }
  294. static inline int ocfs2_is_hard_readonly(struct ocfs2_super *osb)
  295. {
  296. int ret;
  297. spin_lock(&osb->osb_lock);
  298. ret = osb->osb_flags & OCFS2_OSB_HARD_RO;
  299. spin_unlock(&osb->osb_lock);
  300. return ret;
  301. }
  302. static inline int ocfs2_is_soft_readonly(struct ocfs2_super *osb)
  303. {
  304. int ret;
  305. spin_lock(&osb->osb_lock);
  306. ret = osb->osb_flags & OCFS2_OSB_SOFT_RO;
  307. spin_unlock(&osb->osb_lock);
  308. return ret;
  309. }
  310. static inline int ocfs2_mount_local(struct ocfs2_super *osb)
  311. {
  312. return (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_LOCAL_MOUNT);
  313. }
  314. #define OCFS2_IS_VALID_DINODE(ptr) \
  315. (!strcmp((ptr)->i_signature, OCFS2_INODE_SIGNATURE))
  316. #define OCFS2_RO_ON_INVALID_DINODE(__sb, __di) do { \
  317. typeof(__di) ____di = (__di); \
  318. ocfs2_error((__sb), \
  319. "Dinode # %llu has bad signature %.*s", \
  320. (unsigned long long)le64_to_cpu((____di)->i_blkno), 7, \
  321. (____di)->i_signature); \
  322. } while (0)
  323. #define OCFS2_IS_VALID_EXTENT_BLOCK(ptr) \
  324. (!strcmp((ptr)->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE))
  325. #define OCFS2_RO_ON_INVALID_EXTENT_BLOCK(__sb, __eb) do { \
  326. typeof(__eb) ____eb = (__eb); \
  327. ocfs2_error((__sb), \
  328. "Extent Block # %llu has bad signature %.*s", \
  329. (unsigned long long)le64_to_cpu((____eb)->h_blkno), 7, \
  330. (____eb)->h_signature); \
  331. } while (0)
  332. #define OCFS2_IS_VALID_GROUP_DESC(ptr) \
  333. (!strcmp((ptr)->bg_signature, OCFS2_GROUP_DESC_SIGNATURE))
  334. #define OCFS2_RO_ON_INVALID_GROUP_DESC(__sb, __gd) do { \
  335. typeof(__gd) ____gd = (__gd); \
  336. ocfs2_error((__sb), \
  337. "Group Descriptor # %llu has bad signature %.*s", \
  338. (unsigned long long)le64_to_cpu((____gd)->bg_blkno), 7, \
  339. (____gd)->bg_signature); \
  340. } while (0)
  341. static inline unsigned long ino_from_blkno(struct super_block *sb,
  342. u64 blkno)
  343. {
  344. return (unsigned long)(blkno & (u64)ULONG_MAX);
  345. }
  346. static inline u64 ocfs2_clusters_to_blocks(struct super_block *sb,
  347. u32 clusters)
  348. {
  349. int c_to_b_bits = OCFS2_SB(sb)->s_clustersize_bits -
  350. sb->s_blocksize_bits;
  351. return (u64)clusters << c_to_b_bits;
  352. }
  353. static inline u32 ocfs2_blocks_to_clusters(struct super_block *sb,
  354. u64 blocks)
  355. {
  356. int b_to_c_bits = OCFS2_SB(sb)->s_clustersize_bits -
  357. sb->s_blocksize_bits;
  358. return (u32)(blocks >> b_to_c_bits);
  359. }
  360. static inline unsigned int ocfs2_clusters_for_bytes(struct super_block *sb,
  361. u64 bytes)
  362. {
  363. int cl_bits = OCFS2_SB(sb)->s_clustersize_bits;
  364. unsigned int clusters;
  365. bytes += OCFS2_SB(sb)->s_clustersize - 1;
  366. /* OCFS2 just cannot have enough clusters to overflow this */
  367. clusters = (unsigned int)(bytes >> cl_bits);
  368. return clusters;
  369. }
  370. static inline u64 ocfs2_blocks_for_bytes(struct super_block *sb,
  371. u64 bytes)
  372. {
  373. bytes += sb->s_blocksize - 1;
  374. return bytes >> sb->s_blocksize_bits;
  375. }
  376. static inline u64 ocfs2_clusters_to_bytes(struct super_block *sb,
  377. u32 clusters)
  378. {
  379. return (u64)clusters << OCFS2_SB(sb)->s_clustersize_bits;
  380. }
  381. static inline u64 ocfs2_align_bytes_to_clusters(struct super_block *sb,
  382. u64 bytes)
  383. {
  384. int cl_bits = OCFS2_SB(sb)->s_clustersize_bits;
  385. unsigned int clusters;
  386. clusters = ocfs2_clusters_for_bytes(sb, bytes);
  387. return (u64)clusters << cl_bits;
  388. }
  389. static inline u64 ocfs2_align_bytes_to_blocks(struct super_block *sb,
  390. u64 bytes)
  391. {
  392. u64 blocks;
  393. blocks = ocfs2_blocks_for_bytes(sb, bytes);
  394. return blocks << sb->s_blocksize_bits;
  395. }
  396. static inline unsigned long ocfs2_align_bytes_to_sectors(u64 bytes)
  397. {
  398. return (unsigned long)((bytes + 511) >> 9);
  399. }
  400. static inline unsigned int ocfs2_page_index_to_clusters(struct super_block *sb,
  401. unsigned long pg_index)
  402. {
  403. u32 clusters = pg_index;
  404. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  405. if (unlikely(PAGE_CACHE_SHIFT > cbits))
  406. clusters = pg_index << (PAGE_CACHE_SHIFT - cbits);
  407. else if (PAGE_CACHE_SHIFT < cbits)
  408. clusters = pg_index >> (cbits - PAGE_CACHE_SHIFT);
  409. return clusters;
  410. }
  411. /*
  412. * Find the 1st page index which covers the given clusters.
  413. */
  414. static inline pgoff_t ocfs2_align_clusters_to_page_index(struct super_block *sb,
  415. u32 clusters)
  416. {
  417. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  418. pgoff_t index = clusters;
  419. if (PAGE_CACHE_SHIFT > cbits) {
  420. index = (pgoff_t)clusters >> (PAGE_CACHE_SHIFT - cbits);
  421. } else if (PAGE_CACHE_SHIFT < cbits) {
  422. index = (pgoff_t)clusters << (cbits - PAGE_CACHE_SHIFT);
  423. }
  424. return index;
  425. }
  426. static inline unsigned int ocfs2_pages_per_cluster(struct super_block *sb)
  427. {
  428. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  429. unsigned int pages_per_cluster = 1;
  430. if (PAGE_CACHE_SHIFT < cbits)
  431. pages_per_cluster = 1 << (cbits - PAGE_CACHE_SHIFT);
  432. return pages_per_cluster;
  433. }
  434. #define ocfs2_set_bit ext2_set_bit
  435. #define ocfs2_clear_bit ext2_clear_bit
  436. #define ocfs2_test_bit ext2_test_bit
  437. #define ocfs2_find_next_zero_bit ext2_find_next_zero_bit
  438. #endif /* OCFS2_H */