ocfs2.h 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643
  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. #ifndef CONFIG_OCFS2_COMPAT_JBD
  36. # include <linux/jbd2.h>
  37. #else
  38. # include <linux/jbd.h>
  39. # include "ocfs2_jbd_compat.h"
  40. #endif
  41. /* For union ocfs2_dlm_lksb */
  42. #include "stackglue.h"
  43. #include "ocfs2_fs.h"
  44. #include "ocfs2_lockid.h"
  45. /* Most user visible OCFS2 inodes will have very few pieces of
  46. * metadata, but larger files (including bitmaps, etc) must be taken
  47. * into account when designing an access scheme. We allow a small
  48. * amount of inlined blocks to be stored on an array and grow the
  49. * structure into a rb tree when necessary. */
  50. #define OCFS2_INODE_MAX_CACHE_ARRAY 2
  51. struct ocfs2_caching_info {
  52. unsigned int ci_num_cached;
  53. union {
  54. sector_t ci_array[OCFS2_INODE_MAX_CACHE_ARRAY];
  55. struct rb_root ci_tree;
  56. } ci_cache;
  57. };
  58. /* this limits us to 256 nodes
  59. * if we need more, we can do a kmalloc for the map */
  60. #define OCFS2_NODE_MAP_MAX_NODES 256
  61. struct ocfs2_node_map {
  62. u16 num_nodes;
  63. unsigned long map[BITS_TO_LONGS(OCFS2_NODE_MAP_MAX_NODES)];
  64. };
  65. enum ocfs2_ast_action {
  66. OCFS2_AST_INVALID = 0,
  67. OCFS2_AST_ATTACH,
  68. OCFS2_AST_CONVERT,
  69. OCFS2_AST_DOWNCONVERT,
  70. };
  71. /* actions for an unlockast function to take. */
  72. enum ocfs2_unlock_action {
  73. OCFS2_UNLOCK_INVALID = 0,
  74. OCFS2_UNLOCK_CANCEL_CONVERT,
  75. OCFS2_UNLOCK_DROP_LOCK,
  76. };
  77. /* ocfs2_lock_res->l_flags flags. */
  78. #define OCFS2_LOCK_ATTACHED (0x00000001) /* we have initialized
  79. * the lvb */
  80. #define OCFS2_LOCK_BUSY (0x00000002) /* we are currently in
  81. * dlm_lock */
  82. #define OCFS2_LOCK_BLOCKED (0x00000004) /* blocked waiting to
  83. * downconvert*/
  84. #define OCFS2_LOCK_LOCAL (0x00000008) /* newly created inode */
  85. #define OCFS2_LOCK_NEEDS_REFRESH (0x00000010)
  86. #define OCFS2_LOCK_REFRESHING (0x00000020)
  87. #define OCFS2_LOCK_INITIALIZED (0x00000040) /* track initialization
  88. * for shutdown paths */
  89. #define OCFS2_LOCK_FREEING (0x00000080) /* help dlmglue track
  90. * when to skip queueing
  91. * a lock because it's
  92. * about to be
  93. * dropped. */
  94. #define OCFS2_LOCK_QUEUED (0x00000100) /* queued for downconvert */
  95. #define OCFS2_LOCK_NOCACHE (0x00000200) /* don't use a holder count */
  96. #define OCFS2_LOCK_PENDING (0x00000400) /* This lockres is pending a
  97. call to dlm_lock. Only
  98. exists with BUSY set. */
  99. struct ocfs2_lock_res_ops;
  100. typedef void (*ocfs2_lock_callback)(int status, unsigned long data);
  101. struct ocfs2_lock_res {
  102. void *l_priv;
  103. struct ocfs2_lock_res_ops *l_ops;
  104. spinlock_t l_lock;
  105. struct list_head l_blocked_list;
  106. struct list_head l_mask_waiters;
  107. enum ocfs2_lock_type l_type;
  108. unsigned long l_flags;
  109. char l_name[OCFS2_LOCK_ID_MAX_LEN];
  110. int l_level;
  111. unsigned int l_ro_holders;
  112. unsigned int l_ex_holders;
  113. union ocfs2_dlm_lksb l_lksb;
  114. /* used from AST/BAST funcs. */
  115. enum ocfs2_ast_action l_action;
  116. enum ocfs2_unlock_action l_unlock_action;
  117. int l_requested;
  118. int l_blocking;
  119. unsigned int l_pending_gen;
  120. wait_queue_head_t l_event;
  121. struct list_head l_debug_list;
  122. #ifdef CONFIG_OCFS2_FS_STATS
  123. unsigned long long l_lock_num_prmode; /* PR acquires */
  124. unsigned long long l_lock_num_exmode; /* EX acquires */
  125. unsigned int l_lock_num_prmode_failed; /* Failed PR gets */
  126. unsigned int l_lock_num_exmode_failed; /* Failed EX gets */
  127. unsigned long long l_lock_total_prmode; /* Tot wait for PR */
  128. unsigned long long l_lock_total_exmode; /* Tot wait for EX */
  129. unsigned int l_lock_max_prmode; /* Max wait for PR */
  130. unsigned int l_lock_max_exmode; /* Max wait for EX */
  131. unsigned int l_lock_refresh; /* Disk refreshes */
  132. #endif
  133. };
  134. struct ocfs2_dlm_debug {
  135. struct kref d_refcnt;
  136. struct dentry *d_locking_state;
  137. struct list_head d_lockres_tracking;
  138. };
  139. enum ocfs2_vol_state
  140. {
  141. VOLUME_INIT = 0,
  142. VOLUME_MOUNTED,
  143. VOLUME_MOUNTED_QUOTAS,
  144. VOLUME_DISMOUNTED,
  145. VOLUME_DISABLED
  146. };
  147. struct ocfs2_alloc_stats
  148. {
  149. atomic_t moves;
  150. atomic_t local_data;
  151. atomic_t bitmap_data;
  152. atomic_t bg_allocs;
  153. atomic_t bg_extends;
  154. };
  155. enum ocfs2_local_alloc_state
  156. {
  157. OCFS2_LA_UNUSED = 0, /* Local alloc will never be used for
  158. * this mountpoint. */
  159. OCFS2_LA_ENABLED, /* Local alloc is in use. */
  160. OCFS2_LA_THROTTLED, /* Local alloc is in use, but number
  161. * of bits has been reduced. */
  162. OCFS2_LA_DISABLED /* Local alloc has temporarily been
  163. * disabled. */
  164. };
  165. enum ocfs2_mount_options
  166. {
  167. OCFS2_MOUNT_HB_LOCAL = 1 << 0, /* Heartbeat started in local mode */
  168. OCFS2_MOUNT_BARRIER = 1 << 1, /* Use block barriers */
  169. OCFS2_MOUNT_NOINTR = 1 << 2, /* Don't catch signals */
  170. OCFS2_MOUNT_ERRORS_PANIC = 1 << 3, /* Panic on errors */
  171. OCFS2_MOUNT_DATA_WRITEBACK = 1 << 4, /* No data ordering */
  172. OCFS2_MOUNT_LOCALFLOCKS = 1 << 5, /* No cluster aware user file locks */
  173. OCFS2_MOUNT_NOUSERXATTR = 1 << 6, /* No user xattr */
  174. OCFS2_MOUNT_INODE64 = 1 << 7, /* Allow inode numbers > 2^32 */
  175. OCFS2_MOUNT_POSIX_ACL = 1 << 8, /* POSIX access control lists */
  176. OCFS2_MOUNT_USRQUOTA = 1 << 9, /* We support user quotas */
  177. OCFS2_MOUNT_GRPQUOTA = 1 << 10, /* We support group quotas */
  178. };
  179. #define OCFS2_OSB_SOFT_RO 0x0001
  180. #define OCFS2_OSB_HARD_RO 0x0002
  181. #define OCFS2_OSB_ERROR_FS 0x0004
  182. #define OCFS2_DEFAULT_ATIME_QUANTUM 60
  183. struct ocfs2_journal;
  184. struct ocfs2_slot_info;
  185. struct ocfs2_recovery_map;
  186. struct ocfs2_quota_recovery;
  187. struct ocfs2_dentry_lock;
  188. struct ocfs2_super
  189. {
  190. struct task_struct *commit_task;
  191. struct super_block *sb;
  192. struct inode *root_inode;
  193. struct inode *sys_root_inode;
  194. struct inode *system_inodes[NUM_SYSTEM_INODES];
  195. struct ocfs2_slot_info *slot_info;
  196. u32 *slot_recovery_generations;
  197. spinlock_t node_map_lock;
  198. u64 root_blkno;
  199. u64 system_dir_blkno;
  200. u64 bitmap_blkno;
  201. u32 bitmap_cpg;
  202. u8 *uuid;
  203. char *uuid_str;
  204. u32 uuid_hash;
  205. u8 *vol_label;
  206. u64 first_cluster_group_blkno;
  207. u32 fs_generation;
  208. u32 s_feature_compat;
  209. u32 s_feature_incompat;
  210. u32 s_feature_ro_compat;
  211. /* Protects s_next_generation, osb_flags and s_inode_steal_slot.
  212. * Could protect more on osb as it's very short lived.
  213. */
  214. spinlock_t osb_lock;
  215. u32 s_next_generation;
  216. unsigned long osb_flags;
  217. s16 s_inode_steal_slot;
  218. atomic_t s_num_inodes_stolen;
  219. unsigned long s_mount_opt;
  220. unsigned int s_atime_quantum;
  221. unsigned int max_slots;
  222. unsigned int node_num;
  223. int slot_num;
  224. int preferred_slot;
  225. int s_sectsize_bits;
  226. int s_clustersize;
  227. int s_clustersize_bits;
  228. unsigned int s_xattr_inline_size;
  229. atomic_t vol_state;
  230. struct mutex recovery_lock;
  231. struct ocfs2_recovery_map *recovery_map;
  232. struct task_struct *recovery_thread_task;
  233. int disable_recovery;
  234. wait_queue_head_t checkpoint_event;
  235. atomic_t needs_checkpoint;
  236. struct ocfs2_journal *journal;
  237. unsigned long osb_commit_interval;
  238. struct delayed_work la_enable_wq;
  239. /*
  240. * Must hold local alloc i_mutex and osb->osb_lock to change
  241. * local_alloc_bits. Reads can be done under either lock.
  242. */
  243. unsigned int local_alloc_bits;
  244. unsigned int local_alloc_default_bits;
  245. enum ocfs2_local_alloc_state local_alloc_state; /* protected
  246. * by osb_lock */
  247. struct buffer_head *local_alloc_bh;
  248. u64 la_last_gd;
  249. #ifdef CONFIG_OCFS2_FS_STATS
  250. struct dentry *local_alloc_debug;
  251. char *local_alloc_debug_buf;
  252. #endif
  253. /* Next three fields are for local node slot recovery during
  254. * mount. */
  255. int dirty;
  256. struct ocfs2_dinode *local_alloc_copy;
  257. struct ocfs2_quota_recovery *quota_rec;
  258. struct ocfs2_alloc_stats alloc_stats;
  259. char dev_str[20]; /* "major,minor" of the device */
  260. char osb_cluster_stack[OCFS2_STACK_LABEL_LEN + 1];
  261. struct ocfs2_cluster_connection *cconn;
  262. struct ocfs2_lock_res osb_super_lockres;
  263. struct ocfs2_lock_res osb_rename_lockres;
  264. struct ocfs2_dlm_debug *osb_dlm_debug;
  265. struct dentry *osb_debug_root;
  266. wait_queue_head_t recovery_event;
  267. spinlock_t dc_task_lock;
  268. struct task_struct *dc_task;
  269. wait_queue_head_t dc_event;
  270. unsigned long dc_wake_sequence;
  271. unsigned long dc_work_sequence;
  272. /*
  273. * Any thread can add locks to the list, but the downconvert
  274. * thread is the only one allowed to remove locks. Any change
  275. * to this rule requires updating
  276. * ocfs2_downconvert_thread_do_work().
  277. */
  278. struct list_head blocked_lock_list;
  279. unsigned long blocked_lock_count;
  280. /* List of dentry locks to release. Anyone can add locks to
  281. * the list, ocfs2_wq processes the list */
  282. struct ocfs2_dentry_lock *dentry_lock_list;
  283. struct work_struct dentry_lock_work;
  284. wait_queue_head_t osb_mount_event;
  285. /* Truncate log info */
  286. struct inode *osb_tl_inode;
  287. struct buffer_head *osb_tl_bh;
  288. struct delayed_work osb_truncate_log_wq;
  289. struct ocfs2_node_map osb_recovering_orphan_dirs;
  290. unsigned int *osb_orphan_wipes;
  291. wait_queue_head_t osb_wipe_event;
  292. /* used to protect metaecc calculation check of xattr. */
  293. spinlock_t osb_xattr_lock;
  294. };
  295. #define OCFS2_SB(sb) ((struct ocfs2_super *)(sb)->s_fs_info)
  296. /* Useful typedef for passing around journal access functions */
  297. typedef int (*ocfs2_journal_access_func)(handle_t *handle, struct inode *inode,
  298. struct buffer_head *bh, int type);
  299. static inline int ocfs2_should_order_data(struct inode *inode)
  300. {
  301. if (!S_ISREG(inode->i_mode))
  302. return 0;
  303. if (OCFS2_SB(inode->i_sb)->s_mount_opt & OCFS2_MOUNT_DATA_WRITEBACK)
  304. return 0;
  305. return 1;
  306. }
  307. static inline int ocfs2_sparse_alloc(struct ocfs2_super *osb)
  308. {
  309. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_SPARSE_ALLOC)
  310. return 1;
  311. return 0;
  312. }
  313. static inline int ocfs2_writes_unwritten_extents(struct ocfs2_super *osb)
  314. {
  315. /*
  316. * Support for sparse files is a pre-requisite
  317. */
  318. if (!ocfs2_sparse_alloc(osb))
  319. return 0;
  320. if (osb->s_feature_ro_compat & OCFS2_FEATURE_RO_COMPAT_UNWRITTEN)
  321. return 1;
  322. return 0;
  323. }
  324. static inline int ocfs2_supports_inline_data(struct ocfs2_super *osb)
  325. {
  326. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_INLINE_DATA)
  327. return 1;
  328. return 0;
  329. }
  330. static inline int ocfs2_supports_xattr(struct ocfs2_super *osb)
  331. {
  332. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_XATTR)
  333. return 1;
  334. return 0;
  335. }
  336. static inline int ocfs2_meta_ecc(struct ocfs2_super *osb)
  337. {
  338. if (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_META_ECC)
  339. return 1;
  340. return 0;
  341. }
  342. /* set / clear functions because cluster events can make these happen
  343. * in parallel so we want the transitions to be atomic. this also
  344. * means that any future flags osb_flags must be protected by spinlock
  345. * too! */
  346. static inline void ocfs2_set_osb_flag(struct ocfs2_super *osb,
  347. unsigned long flag)
  348. {
  349. spin_lock(&osb->osb_lock);
  350. osb->osb_flags |= flag;
  351. spin_unlock(&osb->osb_lock);
  352. }
  353. static inline void ocfs2_set_ro_flag(struct ocfs2_super *osb,
  354. int hard)
  355. {
  356. spin_lock(&osb->osb_lock);
  357. osb->osb_flags &= ~(OCFS2_OSB_SOFT_RO|OCFS2_OSB_HARD_RO);
  358. if (hard)
  359. osb->osb_flags |= OCFS2_OSB_HARD_RO;
  360. else
  361. osb->osb_flags |= OCFS2_OSB_SOFT_RO;
  362. spin_unlock(&osb->osb_lock);
  363. }
  364. static inline int ocfs2_is_hard_readonly(struct ocfs2_super *osb)
  365. {
  366. int ret;
  367. spin_lock(&osb->osb_lock);
  368. ret = osb->osb_flags & OCFS2_OSB_HARD_RO;
  369. spin_unlock(&osb->osb_lock);
  370. return ret;
  371. }
  372. static inline int ocfs2_is_soft_readonly(struct ocfs2_super *osb)
  373. {
  374. int ret;
  375. spin_lock(&osb->osb_lock);
  376. ret = osb->osb_flags & OCFS2_OSB_SOFT_RO;
  377. spin_unlock(&osb->osb_lock);
  378. return ret;
  379. }
  380. static inline int ocfs2_userspace_stack(struct ocfs2_super *osb)
  381. {
  382. return (osb->s_feature_incompat &
  383. OCFS2_FEATURE_INCOMPAT_USERSPACE_STACK);
  384. }
  385. static inline int ocfs2_mount_local(struct ocfs2_super *osb)
  386. {
  387. return (osb->s_feature_incompat & OCFS2_FEATURE_INCOMPAT_LOCAL_MOUNT);
  388. }
  389. static inline int ocfs2_uses_extended_slot_map(struct ocfs2_super *osb)
  390. {
  391. return (osb->s_feature_incompat &
  392. OCFS2_FEATURE_INCOMPAT_EXTENDED_SLOT_MAP);
  393. }
  394. #define OCFS2_IS_VALID_DINODE(ptr) \
  395. (!strcmp((ptr)->i_signature, OCFS2_INODE_SIGNATURE))
  396. #define OCFS2_IS_VALID_EXTENT_BLOCK(ptr) \
  397. (!strcmp((ptr)->h_signature, OCFS2_EXTENT_BLOCK_SIGNATURE))
  398. #define OCFS2_IS_VALID_GROUP_DESC(ptr) \
  399. (!strcmp((ptr)->bg_signature, OCFS2_GROUP_DESC_SIGNATURE))
  400. #define OCFS2_IS_VALID_XATTR_BLOCK(ptr) \
  401. (!strcmp((ptr)->xb_signature, OCFS2_XATTR_BLOCK_SIGNATURE))
  402. #define OCFS2_IS_VALID_DIR_TRAILER(ptr) \
  403. (!strcmp((ptr)->db_signature, OCFS2_DIR_TRAILER_SIGNATURE))
  404. static inline unsigned long ino_from_blkno(struct super_block *sb,
  405. u64 blkno)
  406. {
  407. return (unsigned long)(blkno & (u64)ULONG_MAX);
  408. }
  409. static inline u64 ocfs2_clusters_to_blocks(struct super_block *sb,
  410. u32 clusters)
  411. {
  412. int c_to_b_bits = OCFS2_SB(sb)->s_clustersize_bits -
  413. sb->s_blocksize_bits;
  414. return (u64)clusters << c_to_b_bits;
  415. }
  416. static inline u32 ocfs2_blocks_to_clusters(struct super_block *sb,
  417. u64 blocks)
  418. {
  419. int b_to_c_bits = OCFS2_SB(sb)->s_clustersize_bits -
  420. sb->s_blocksize_bits;
  421. return (u32)(blocks >> b_to_c_bits);
  422. }
  423. static inline unsigned int ocfs2_clusters_for_bytes(struct super_block *sb,
  424. u64 bytes)
  425. {
  426. int cl_bits = OCFS2_SB(sb)->s_clustersize_bits;
  427. unsigned int clusters;
  428. bytes += OCFS2_SB(sb)->s_clustersize - 1;
  429. /* OCFS2 just cannot have enough clusters to overflow this */
  430. clusters = (unsigned int)(bytes >> cl_bits);
  431. return clusters;
  432. }
  433. static inline u64 ocfs2_blocks_for_bytes(struct super_block *sb,
  434. u64 bytes)
  435. {
  436. bytes += sb->s_blocksize - 1;
  437. return bytes >> sb->s_blocksize_bits;
  438. }
  439. static inline u64 ocfs2_clusters_to_bytes(struct super_block *sb,
  440. u32 clusters)
  441. {
  442. return (u64)clusters << OCFS2_SB(sb)->s_clustersize_bits;
  443. }
  444. static inline u64 ocfs2_align_bytes_to_clusters(struct super_block *sb,
  445. u64 bytes)
  446. {
  447. int cl_bits = OCFS2_SB(sb)->s_clustersize_bits;
  448. unsigned int clusters;
  449. clusters = ocfs2_clusters_for_bytes(sb, bytes);
  450. return (u64)clusters << cl_bits;
  451. }
  452. static inline u64 ocfs2_align_bytes_to_blocks(struct super_block *sb,
  453. u64 bytes)
  454. {
  455. u64 blocks;
  456. blocks = ocfs2_blocks_for_bytes(sb, bytes);
  457. return blocks << sb->s_blocksize_bits;
  458. }
  459. static inline unsigned long ocfs2_align_bytes_to_sectors(u64 bytes)
  460. {
  461. return (unsigned long)((bytes + 511) >> 9);
  462. }
  463. static inline unsigned int ocfs2_page_index_to_clusters(struct super_block *sb,
  464. unsigned long pg_index)
  465. {
  466. u32 clusters = pg_index;
  467. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  468. if (unlikely(PAGE_CACHE_SHIFT > cbits))
  469. clusters = pg_index << (PAGE_CACHE_SHIFT - cbits);
  470. else if (PAGE_CACHE_SHIFT < cbits)
  471. clusters = pg_index >> (cbits - PAGE_CACHE_SHIFT);
  472. return clusters;
  473. }
  474. /*
  475. * Find the 1st page index which covers the given clusters.
  476. */
  477. static inline pgoff_t ocfs2_align_clusters_to_page_index(struct super_block *sb,
  478. u32 clusters)
  479. {
  480. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  481. pgoff_t index = clusters;
  482. if (PAGE_CACHE_SHIFT > cbits) {
  483. index = (pgoff_t)clusters >> (PAGE_CACHE_SHIFT - cbits);
  484. } else if (PAGE_CACHE_SHIFT < cbits) {
  485. index = (pgoff_t)clusters << (cbits - PAGE_CACHE_SHIFT);
  486. }
  487. return index;
  488. }
  489. static inline unsigned int ocfs2_pages_per_cluster(struct super_block *sb)
  490. {
  491. unsigned int cbits = OCFS2_SB(sb)->s_clustersize_bits;
  492. unsigned int pages_per_cluster = 1;
  493. if (PAGE_CACHE_SHIFT < cbits)
  494. pages_per_cluster = 1 << (cbits - PAGE_CACHE_SHIFT);
  495. return pages_per_cluster;
  496. }
  497. static inline unsigned int ocfs2_megabytes_to_clusters(struct super_block *sb,
  498. unsigned int megs)
  499. {
  500. BUILD_BUG_ON(OCFS2_MAX_CLUSTERSIZE > 1048576);
  501. return megs << (20 - OCFS2_SB(sb)->s_clustersize_bits);
  502. }
  503. static inline void ocfs2_init_inode_steal_slot(struct ocfs2_super *osb)
  504. {
  505. spin_lock(&osb->osb_lock);
  506. osb->s_inode_steal_slot = OCFS2_INVALID_SLOT;
  507. spin_unlock(&osb->osb_lock);
  508. atomic_set(&osb->s_num_inodes_stolen, 0);
  509. }
  510. static inline void ocfs2_set_inode_steal_slot(struct ocfs2_super *osb,
  511. s16 slot)
  512. {
  513. spin_lock(&osb->osb_lock);
  514. osb->s_inode_steal_slot = slot;
  515. spin_unlock(&osb->osb_lock);
  516. }
  517. static inline s16 ocfs2_get_inode_steal_slot(struct ocfs2_super *osb)
  518. {
  519. s16 slot;
  520. spin_lock(&osb->osb_lock);
  521. slot = osb->s_inode_steal_slot;
  522. spin_unlock(&osb->osb_lock);
  523. return slot;
  524. }
  525. #define ocfs2_set_bit ext2_set_bit
  526. #define ocfs2_clear_bit ext2_clear_bit
  527. #define ocfs2_test_bit ext2_test_bit
  528. #define ocfs2_find_next_zero_bit ext2_find_next_zero_bit
  529. #define ocfs2_find_next_bit ext2_find_next_bit
  530. #endif /* OCFS2_H */