journal.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * journal.h
  5. *
  6. * Defines journalling api and structures.
  7. *
  8. * Copyright (C) 2003, 2005 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_JOURNAL_H
  26. #define OCFS2_JOURNAL_H
  27. #include <linux/fs.h>
  28. #include <linux/jbd.h>
  29. enum ocfs2_journal_state {
  30. OCFS2_JOURNAL_FREE = 0,
  31. OCFS2_JOURNAL_LOADED,
  32. OCFS2_JOURNAL_IN_SHUTDOWN,
  33. };
  34. struct ocfs2_super;
  35. struct ocfs2_dinode;
  36. struct ocfs2_journal_handle;
  37. struct ocfs2_journal {
  38. enum ocfs2_journal_state j_state; /* Journals current state */
  39. journal_t *j_journal; /* The kernels journal type */
  40. struct inode *j_inode; /* Kernel inode pointing to
  41. * this journal */
  42. struct ocfs2_super *j_osb; /* pointer to the super
  43. * block for the node
  44. * we're currently
  45. * running on -- not
  46. * necessarily the super
  47. * block from the node
  48. * which we usually run
  49. * from (recovery,
  50. * etc) */
  51. struct buffer_head *j_bh; /* Journal disk inode block */
  52. atomic_t j_num_trans; /* Number of transactions
  53. * currently in the system. */
  54. unsigned long j_trans_id;
  55. struct rw_semaphore j_trans_barrier;
  56. wait_queue_head_t j_checkpointed;
  57. spinlock_t j_lock;
  58. struct list_head j_la_cleanups;
  59. struct work_struct j_recovery_work;
  60. };
  61. extern spinlock_t trans_inc_lock;
  62. /* wrap j_trans_id so we never have it equal to zero. */
  63. static inline unsigned long ocfs2_inc_trans_id(struct ocfs2_journal *j)
  64. {
  65. unsigned long old_id;
  66. spin_lock(&trans_inc_lock);
  67. old_id = j->j_trans_id++;
  68. if (unlikely(!j->j_trans_id))
  69. j->j_trans_id = 1;
  70. spin_unlock(&trans_inc_lock);
  71. return old_id;
  72. }
  73. static inline void ocfs2_set_inode_lock_trans(struct ocfs2_journal *journal,
  74. struct inode *inode)
  75. {
  76. spin_lock(&trans_inc_lock);
  77. OCFS2_I(inode)->ip_last_trans = journal->j_trans_id;
  78. spin_unlock(&trans_inc_lock);
  79. }
  80. /* Used to figure out whether it's safe to drop a metadata lock on an
  81. * inode. Returns true if all the inodes changes have been
  82. * checkpointed to disk. You should be holding the spinlock on the
  83. * metadata lock while calling this to be sure that nobody can take
  84. * the lock and put it on another transaction. */
  85. static inline int ocfs2_inode_fully_checkpointed(struct inode *inode)
  86. {
  87. int ret;
  88. struct ocfs2_journal *journal = OCFS2_SB(inode->i_sb)->journal;
  89. spin_lock(&trans_inc_lock);
  90. ret = time_after(journal->j_trans_id, OCFS2_I(inode)->ip_last_trans);
  91. spin_unlock(&trans_inc_lock);
  92. return ret;
  93. }
  94. /* convenience function to check if an inode is still new (has never
  95. * hit disk) Will do you a favor and set created_trans = 0 when you've
  96. * been checkpointed. returns '1' if the inode is still new. */
  97. static inline int ocfs2_inode_is_new(struct inode *inode)
  98. {
  99. int ret;
  100. /* System files are never "new" as they're written out by
  101. * mkfs. This helps us early during mount, before we have the
  102. * journal open and j_trans_id could be junk. */
  103. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_SYSTEM_FILE)
  104. return 0;
  105. spin_lock(&trans_inc_lock);
  106. ret = !(time_after(OCFS2_SB(inode->i_sb)->journal->j_trans_id,
  107. OCFS2_I(inode)->ip_created_trans));
  108. if (!ret)
  109. OCFS2_I(inode)->ip_created_trans = 0;
  110. spin_unlock(&trans_inc_lock);
  111. return ret;
  112. }
  113. static inline void ocfs2_inode_set_new(struct ocfs2_super *osb,
  114. struct inode *inode)
  115. {
  116. spin_lock(&trans_inc_lock);
  117. OCFS2_I(inode)->ip_created_trans = osb->journal->j_trans_id;
  118. spin_unlock(&trans_inc_lock);
  119. }
  120. extern kmem_cache_t *ocfs2_lock_cache;
  121. struct ocfs2_journal_lock {
  122. struct inode *jl_inode;
  123. struct list_head jl_lock_list;
  124. };
  125. struct ocfs2_journal_handle {
  126. handle_t *k_handle; /* kernel handle. */
  127. struct ocfs2_journal *journal;
  128. /* The following two fields are for ocfs2_handle_add_lock */
  129. int num_locks;
  130. struct list_head locks; /* A bunch of locks to
  131. * release on commit. This
  132. * should be a list_head */
  133. };
  134. /* Exported only for the journal struct init code in super.c. Do not call. */
  135. void ocfs2_complete_recovery(void *data);
  136. /*
  137. * Journal Control:
  138. * Initialize, Load, Shutdown, Wipe a journal.
  139. *
  140. * ocfs2_journal_init - Initialize journal structures in the OSB.
  141. * ocfs2_journal_load - Load the given journal off disk. Replay it if
  142. * there's transactions still in there.
  143. * ocfs2_journal_shutdown - Shutdown a journal, this will flush all
  144. * uncommitted, uncheckpointed transactions.
  145. * ocfs2_journal_wipe - Wipe transactions from a journal. Optionally
  146. * zero out each block.
  147. * ocfs2_recovery_thread - Perform recovery on a node. osb is our own osb.
  148. * ocfs2_mark_dead_nodes - Start recovery on nodes we won't get a heartbeat
  149. * event on.
  150. * ocfs2_start_checkpoint - Kick the commit thread to do a checkpoint.
  151. */
  152. void ocfs2_set_journal_params(struct ocfs2_super *osb);
  153. int ocfs2_journal_init(struct ocfs2_journal *journal,
  154. int *dirty);
  155. void ocfs2_journal_shutdown(struct ocfs2_super *osb);
  156. int ocfs2_journal_wipe(struct ocfs2_journal *journal,
  157. int full);
  158. int ocfs2_journal_load(struct ocfs2_journal *journal);
  159. int ocfs2_check_journals_nolocks(struct ocfs2_super *osb);
  160. void ocfs2_recovery_thread(struct ocfs2_super *osb,
  161. int node_num);
  162. int ocfs2_mark_dead_nodes(struct ocfs2_super *osb);
  163. void ocfs2_complete_mount_recovery(struct ocfs2_super *osb);
  164. static inline void ocfs2_start_checkpoint(struct ocfs2_super *osb)
  165. {
  166. atomic_set(&osb->needs_checkpoint, 1);
  167. wake_up(&osb->checkpoint_event);
  168. }
  169. static inline void ocfs2_checkpoint_inode(struct inode *inode)
  170. {
  171. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  172. if (!ocfs2_inode_fully_checkpointed(inode)) {
  173. /* WARNING: This only kicks off a single
  174. * checkpoint. If someone races you and adds more
  175. * metadata to the journal, you won't know, and will
  176. * wind up waiting *alot* longer than necessary. Right
  177. * now we only use this in clear_inode so that's
  178. * OK. */
  179. ocfs2_start_checkpoint(osb);
  180. wait_event(osb->journal->j_checkpointed,
  181. ocfs2_inode_fully_checkpointed(inode));
  182. }
  183. }
  184. /*
  185. * Transaction Handling:
  186. * Manage the lifetime of a transaction handle.
  187. *
  188. * ocfs2_alloc_handle - Only allocate a handle so we can start putting
  189. * cluster locks on it. To actually change blocks,
  190. * call ocfs2_start_trans with the handle returned
  191. * from this function. You may call ocfs2_commit_trans
  192. * at any time in the lifetime of a handle.
  193. * ocfs2_start_trans - Begin a transaction. Give it an upper estimate of
  194. * the number of blocks that will be changed during
  195. * this handle.
  196. * ocfs2_commit_trans - Complete a handle.
  197. * ocfs2_extend_trans - Extend a handle by nblocks credits. This may
  198. * commit the handle to disk in the process, but will
  199. * not release any locks taken during the transaction.
  200. * ocfs2_journal_access - Notify the handle that we want to journal this
  201. * buffer. Will have to call ocfs2_journal_dirty once
  202. * we've actually dirtied it. Type is one of . or .
  203. * ocfs2_journal_dirty - Mark a journalled buffer as having dirty data.
  204. * ocfs2_journal_dirty_data - Indicate that a data buffer should go out before
  205. * the current handle commits.
  206. * ocfs2_handle_add_lock - Sometimes we need to delay lock release
  207. * until after a transaction has been completed. Use
  208. * ocfs2_handle_add_lock to indicate that a lock needs
  209. * to be released at the end of that handle. Locks
  210. * will be released in the order that they are added.
  211. */
  212. /* You must always start_trans with a number of buffs > 0, but it's
  213. * perfectly legal to go through an entire transaction without having
  214. * dirtied any buffers. */
  215. struct ocfs2_journal_handle *ocfs2_alloc_handle(struct ocfs2_super *osb);
  216. struct ocfs2_journal_handle *ocfs2_start_trans(struct ocfs2_super *osb,
  217. struct ocfs2_journal_handle *handle,
  218. int max_buffs);
  219. void ocfs2_commit_trans(struct ocfs2_journal_handle *handle);
  220. int ocfs2_extend_trans(handle_t *handle, int nblocks);
  221. /*
  222. * Create access is for when we get a newly created buffer and we're
  223. * not gonna read it off disk, but rather fill it ourselves. Right
  224. * now, we don't do anything special with this (it turns into a write
  225. * request), but this is a good placeholder in case we do...
  226. *
  227. * Write access is for when we read a block off disk and are going to
  228. * modify it. This way the journalling layer knows it may need to make
  229. * a copy of that block (if it's part of another, uncommitted
  230. * transaction) before we do so.
  231. */
  232. #define OCFS2_JOURNAL_ACCESS_CREATE 0
  233. #define OCFS2_JOURNAL_ACCESS_WRITE 1
  234. #define OCFS2_JOURNAL_ACCESS_UNDO 2
  235. int ocfs2_journal_access(struct ocfs2_journal_handle *handle,
  236. struct inode *inode,
  237. struct buffer_head *bh,
  238. int type);
  239. /*
  240. * A word about the journal_access/journal_dirty "dance". It is
  241. * entirely legal to journal_access a buffer more than once (as long
  242. * as the access type is the same -- I'm not sure what will happen if
  243. * access type is different but this should never happen anyway) It is
  244. * also legal to journal_dirty a buffer more than once. In fact, you
  245. * can even journal_access a buffer after you've done a
  246. * journal_access/journal_dirty pair. The only thing you cannot do
  247. * however, is journal_dirty a buffer which you haven't yet passed to
  248. * journal_access at least once.
  249. *
  250. * That said, 99% of the time this doesn't matter and this is what the
  251. * path looks like:
  252. *
  253. * <read a bh>
  254. * ocfs2_journal_access(handle, bh, OCFS2_JOURNAL_ACCESS_WRITE);
  255. * <modify the bh>
  256. * ocfs2_journal_dirty(handle, bh);
  257. */
  258. int ocfs2_journal_dirty(struct ocfs2_journal_handle *handle,
  259. struct buffer_head *bh);
  260. int ocfs2_journal_dirty_data(handle_t *handle,
  261. struct buffer_head *bh);
  262. int ocfs2_handle_add_lock(struct ocfs2_journal_handle *handle,
  263. struct inode *inode);
  264. /*
  265. * Credit Macros:
  266. * Convenience macros to calculate number of credits needed.
  267. *
  268. * For convenience sake, I have a set of macros here which calculate
  269. * the *maximum* number of sectors which will be changed for various
  270. * metadata updates.
  271. */
  272. /* simple file updates like chmod, etc. */
  273. #define OCFS2_INODE_UPDATE_CREDITS 1
  274. /* get one bit out of a suballocator: dinode + group descriptor +
  275. * prev. group desc. if we relink. */
  276. #define OCFS2_SUBALLOC_ALLOC (3)
  277. /* dinode + group descriptor update. We don't relink on free yet. */
  278. #define OCFS2_SUBALLOC_FREE (2)
  279. #define OCFS2_TRUNCATE_LOG_UPDATE OCFS2_INODE_UPDATE_CREDITS
  280. #define OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC (OCFS2_SUBALLOC_FREE \
  281. + OCFS2_TRUNCATE_LOG_UPDATE)
  282. /* data block for new dir/symlink, 2 for bitmap updates (bitmap fe +
  283. * bitmap block for the new bit) */
  284. #define OCFS2_DIR_LINK_ADDITIONAL_CREDITS (1 + 2)
  285. /* parent fe, parent block, new file entry, inode alloc fe, inode alloc
  286. * group descriptor + mkdir/symlink blocks */
  287. #define OCFS2_MKNOD_CREDITS (3 + OCFS2_SUBALLOC_ALLOC \
  288. + OCFS2_DIR_LINK_ADDITIONAL_CREDITS)
  289. /* local alloc metadata change + main bitmap updates */
  290. #define OCFS2_WINDOW_MOVE_CREDITS (OCFS2_INODE_UPDATE_CREDITS \
  291. + OCFS2_SUBALLOC_ALLOC + OCFS2_SUBALLOC_FREE)
  292. /* used when we don't need an allocation change for a dir extend. One
  293. * for the dinode, one for the new block. */
  294. #define OCFS2_SIMPLE_DIR_EXTEND_CREDITS (2)
  295. /* file update (nlink, etc) + dir entry block */
  296. #define OCFS2_LINK_CREDITS (OCFS2_INODE_UPDATE_CREDITS + 1)
  297. /* inode + dir inode (if we unlink a dir), + dir entry block + orphan
  298. * dir inode link */
  299. #define OCFS2_UNLINK_CREDITS (2 * OCFS2_INODE_UPDATE_CREDITS + 1 \
  300. + OCFS2_LINK_CREDITS)
  301. /* dinode + orphan dir dinode + inode alloc dinode + orphan dir entry +
  302. * inode alloc group descriptor */
  303. #define OCFS2_DELETE_INODE_CREDITS (3 * OCFS2_INODE_UPDATE_CREDITS + 1 + 1)
  304. /* dinode update, old dir dinode update, new dir dinode update, old
  305. * dir dir entry, new dir dir entry, dir entry update for renaming
  306. * directory + target unlink */
  307. #define OCFS2_RENAME_CREDITS (3 * OCFS2_INODE_UPDATE_CREDITS + 3 \
  308. + OCFS2_UNLINK_CREDITS)
  309. static inline int ocfs2_calc_extend_credits(struct super_block *sb,
  310. struct ocfs2_dinode *fe,
  311. u32 bits_wanted)
  312. {
  313. int bitmap_blocks, sysfile_bitmap_blocks, dinode_blocks;
  314. /* bitmap dinode, group desc. + relinked group. */
  315. bitmap_blocks = OCFS2_SUBALLOC_ALLOC;
  316. /* we might need to shift tree depth so lets assume an
  317. * absolute worst case of complete fragmentation. Even with
  318. * that, we only need one update for the dinode, and then
  319. * however many metadata chunks needed * a remaining suballoc
  320. * alloc. */
  321. sysfile_bitmap_blocks = 1 +
  322. (OCFS2_SUBALLOC_ALLOC - 1) * ocfs2_extend_meta_needed(fe);
  323. /* this does not include *new* metadata blocks, which are
  324. * accounted for in sysfile_bitmap_blocks. fe +
  325. * prev. last_eb_blk + blocks along edge of tree.
  326. * calc_symlink_credits passes because we just need 1
  327. * credit for the dinode there. */
  328. dinode_blocks = 1 + 1 + le16_to_cpu(fe->id2.i_list.l_tree_depth);
  329. return bitmap_blocks + sysfile_bitmap_blocks + dinode_blocks;
  330. }
  331. static inline int ocfs2_calc_symlink_credits(struct super_block *sb)
  332. {
  333. int blocks = OCFS2_MKNOD_CREDITS;
  334. /* links can be longer than one block so we may update many
  335. * within our single allocated extent. */
  336. blocks += ocfs2_clusters_to_blocks(sb, 1);
  337. return blocks;
  338. }
  339. static inline int ocfs2_calc_group_alloc_credits(struct super_block *sb,
  340. unsigned int cpg)
  341. {
  342. int blocks;
  343. int bitmap_blocks = OCFS2_SUBALLOC_ALLOC + 1;
  344. /* parent inode update + new block group header + bitmap inode update
  345. + bitmap blocks affected */
  346. blocks = 1 + 1 + 1 + bitmap_blocks;
  347. return blocks;
  348. }
  349. static inline int ocfs2_calc_tree_trunc_credits(struct super_block *sb,
  350. unsigned int clusters_to_del,
  351. struct ocfs2_dinode *fe,
  352. struct ocfs2_extent_list *last_el)
  353. {
  354. /* for dinode + all headers in this pass + update to next leaf */
  355. u16 next_free = le16_to_cpu(last_el->l_next_free_rec);
  356. u16 tree_depth = le16_to_cpu(fe->id2.i_list.l_tree_depth);
  357. int credits = 1 + tree_depth + 1;
  358. int i;
  359. i = next_free - 1;
  360. BUG_ON(i < 0);
  361. /* We may be deleting metadata blocks, so metadata alloc dinode +
  362. one desc. block for each possible delete. */
  363. if (tree_depth && next_free == 1 &&
  364. le32_to_cpu(last_el->l_recs[i].e_clusters) == clusters_to_del)
  365. credits += 1 + tree_depth;
  366. /* update to the truncate log. */
  367. credits += OCFS2_TRUNCATE_LOG_UPDATE;
  368. return credits;
  369. }
  370. #endif /* OCFS2_JOURNAL_H */