journal.h 15 KB

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