ocfs2.h 16 KB

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