journal.h 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577
  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/jbd2.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. /*
  37. * The recovery_list is a simple linked list of node numbers to recover.
  38. * It is protected by the recovery_lock.
  39. */
  40. struct ocfs2_recovery_map {
  41. unsigned int rm_used;
  42. unsigned int *rm_entries;
  43. };
  44. struct ocfs2_journal {
  45. enum ocfs2_journal_state j_state; /* Journals current state */
  46. journal_t *j_journal; /* The kernels journal type */
  47. struct inode *j_inode; /* Kernel inode pointing to
  48. * this journal */
  49. struct ocfs2_super *j_osb; /* pointer to the super
  50. * block for the node
  51. * we're currently
  52. * running on -- not
  53. * necessarily the super
  54. * block from the node
  55. * which we usually run
  56. * from (recovery,
  57. * etc) */
  58. struct buffer_head *j_bh; /* Journal disk inode block */
  59. atomic_t j_num_trans; /* Number of transactions
  60. * currently in the system. */
  61. unsigned long j_trans_id;
  62. struct rw_semaphore j_trans_barrier;
  63. wait_queue_head_t j_checkpointed;
  64. spinlock_t j_lock;
  65. struct list_head j_la_cleanups;
  66. struct work_struct j_recovery_work;
  67. };
  68. extern spinlock_t trans_inc_lock;
  69. /* wrap j_trans_id so we never have it equal to zero. */
  70. static inline unsigned long ocfs2_inc_trans_id(struct ocfs2_journal *j)
  71. {
  72. unsigned long old_id;
  73. spin_lock(&trans_inc_lock);
  74. old_id = j->j_trans_id++;
  75. if (unlikely(!j->j_trans_id))
  76. j->j_trans_id = 1;
  77. spin_unlock(&trans_inc_lock);
  78. return old_id;
  79. }
  80. static inline void ocfs2_set_inode_lock_trans(struct ocfs2_journal *journal,
  81. struct inode *inode)
  82. {
  83. spin_lock(&trans_inc_lock);
  84. OCFS2_I(inode)->ip_last_trans = journal->j_trans_id;
  85. spin_unlock(&trans_inc_lock);
  86. }
  87. /* Used to figure out whether it's safe to drop a metadata lock on an
  88. * inode. Returns true if all the inodes changes have been
  89. * checkpointed to disk. You should be holding the spinlock on the
  90. * metadata lock while calling this to be sure that nobody can take
  91. * the lock and put it on another transaction. */
  92. static inline int ocfs2_inode_fully_checkpointed(struct inode *inode)
  93. {
  94. int ret;
  95. struct ocfs2_journal *journal = OCFS2_SB(inode->i_sb)->journal;
  96. spin_lock(&trans_inc_lock);
  97. ret = time_after(journal->j_trans_id, OCFS2_I(inode)->ip_last_trans);
  98. spin_unlock(&trans_inc_lock);
  99. return ret;
  100. }
  101. /* convenience function to check if an inode is still new (has never
  102. * hit disk) Will do you a favor and set created_trans = 0 when you've
  103. * been checkpointed. returns '1' if the inode is still new. */
  104. static inline int ocfs2_inode_is_new(struct inode *inode)
  105. {
  106. int ret;
  107. /* System files are never "new" as they're written out by
  108. * mkfs. This helps us early during mount, before we have the
  109. * journal open and j_trans_id could be junk. */
  110. if (OCFS2_I(inode)->ip_flags & OCFS2_INODE_SYSTEM_FILE)
  111. return 0;
  112. spin_lock(&trans_inc_lock);
  113. ret = !(time_after(OCFS2_SB(inode->i_sb)->journal->j_trans_id,
  114. OCFS2_I(inode)->ip_created_trans));
  115. if (!ret)
  116. OCFS2_I(inode)->ip_created_trans = 0;
  117. spin_unlock(&trans_inc_lock);
  118. return ret;
  119. }
  120. static inline void ocfs2_inode_set_new(struct ocfs2_super *osb,
  121. struct inode *inode)
  122. {
  123. spin_lock(&trans_inc_lock);
  124. OCFS2_I(inode)->ip_created_trans = osb->journal->j_trans_id;
  125. spin_unlock(&trans_inc_lock);
  126. }
  127. /* Exported only for the journal struct init code in super.c. Do not call. */
  128. void ocfs2_orphan_scan_init(struct ocfs2_super *osb);
  129. void ocfs2_orphan_scan_start(struct ocfs2_super *osb);
  130. void ocfs2_orphan_scan_stop(struct ocfs2_super *osb);
  131. void ocfs2_orphan_scan_exit(struct ocfs2_super *osb);
  132. void ocfs2_complete_recovery(struct work_struct *work);
  133. void ocfs2_wait_for_recovery(struct ocfs2_super *osb);
  134. int ocfs2_recovery_init(struct ocfs2_super *osb);
  135. void ocfs2_recovery_exit(struct ocfs2_super *osb);
  136. int ocfs2_compute_replay_slots(struct ocfs2_super *osb);
  137. /*
  138. * Journal Control:
  139. * Initialize, Load, Shutdown, Wipe a journal.
  140. *
  141. * ocfs2_journal_init - Initialize journal structures in the OSB.
  142. * ocfs2_journal_load - Load the given journal off disk. Replay it if
  143. * there's transactions still in there.
  144. * ocfs2_journal_shutdown - Shutdown a journal, this will flush all
  145. * uncommitted, uncheckpointed transactions.
  146. * ocfs2_journal_wipe - Wipe transactions from a journal. Optionally
  147. * zero out each block.
  148. * ocfs2_recovery_thread - Perform recovery on a node. osb is our own osb.
  149. * ocfs2_mark_dead_nodes - Start recovery on nodes we won't get a heartbeat
  150. * event on.
  151. * ocfs2_start_checkpoint - Kick the commit thread to do a checkpoint.
  152. */
  153. void ocfs2_set_journal_params(struct ocfs2_super *osb);
  154. int ocfs2_journal_init(struct ocfs2_journal *journal,
  155. int *dirty);
  156. void ocfs2_journal_shutdown(struct ocfs2_super *osb);
  157. int ocfs2_journal_wipe(struct ocfs2_journal *journal,
  158. int full);
  159. int ocfs2_journal_load(struct ocfs2_journal *journal, int local,
  160. int replayed);
  161. int ocfs2_check_journals_nolocks(struct ocfs2_super *osb);
  162. void ocfs2_recovery_thread(struct ocfs2_super *osb,
  163. int node_num);
  164. int ocfs2_mark_dead_nodes(struct ocfs2_super *osb);
  165. void ocfs2_complete_mount_recovery(struct ocfs2_super *osb);
  166. void ocfs2_complete_quota_recovery(struct ocfs2_super *osb);
  167. static inline void ocfs2_start_checkpoint(struct ocfs2_super *osb)
  168. {
  169. atomic_set(&osb->needs_checkpoint, 1);
  170. wake_up(&osb->checkpoint_event);
  171. }
  172. static inline void ocfs2_checkpoint_inode(struct inode *inode)
  173. {
  174. struct ocfs2_super *osb = OCFS2_SB(inode->i_sb);
  175. if (ocfs2_mount_local(osb))
  176. return;
  177. if (!ocfs2_inode_fully_checkpointed(inode)) {
  178. /* WARNING: This only kicks off a single
  179. * checkpoint. If someone races you and adds more
  180. * metadata to the journal, you won't know, and will
  181. * wind up waiting *alot* longer than necessary. Right
  182. * now we only use this in clear_inode so that's
  183. * OK. */
  184. ocfs2_start_checkpoint(osb);
  185. wait_event(osb->journal->j_checkpointed,
  186. ocfs2_inode_fully_checkpointed(inode));
  187. }
  188. }
  189. /*
  190. * Transaction Handling:
  191. * Manage the lifetime of a transaction handle.
  192. *
  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. It might return -EIO if
  197. * the journal was aborted. The majority of paths don't
  198. * check the return value as an error there comes too
  199. * late to do anything (and will be picked up in a
  200. * later transaction).
  201. * ocfs2_extend_trans - Extend a handle by nblocks credits. This may
  202. * commit the handle to disk in the process, but will
  203. * not release any locks taken during the transaction.
  204. * ocfs2_journal_access* - Notify the handle that we want to journal this
  205. * buffer. Will have to call ocfs2_journal_dirty once
  206. * we've actually dirtied it. Type is one of . or .
  207. * Always call the specific flavor of
  208. * ocfs2_journal_access_*() unless you intend to
  209. * manage the checksum by hand.
  210. * ocfs2_journal_dirty - Mark a journalled buffer as having dirty data.
  211. * ocfs2_jbd2_file_inode - Mark an inode so that its data goes out before
  212. * the current handle commits.
  213. */
  214. /* You must always start_trans with a number of buffs > 0, but it's
  215. * perfectly legal to go through an entire transaction without having
  216. * dirtied any buffers. */
  217. handle_t *ocfs2_start_trans(struct ocfs2_super *osb,
  218. int max_buffs);
  219. int ocfs2_commit_trans(struct ocfs2_super *osb,
  220. handle_t *handle);
  221. int ocfs2_extend_trans(handle_t *handle, int nblocks);
  222. /*
  223. * Create access is for when we get a newly created buffer and we're
  224. * not gonna read it off disk, but rather fill it ourselves. Right
  225. * now, we don't do anything special with this (it turns into a write
  226. * request), but this is a good placeholder in case we do...
  227. *
  228. * Write access is for when we read a block off disk and are going to
  229. * modify it. This way the journalling layer knows it may need to make
  230. * a copy of that block (if it's part of another, uncommitted
  231. * transaction) before we do so.
  232. */
  233. #define OCFS2_JOURNAL_ACCESS_CREATE 0
  234. #define OCFS2_JOURNAL_ACCESS_WRITE 1
  235. #define OCFS2_JOURNAL_ACCESS_UNDO 2
  236. /* ocfs2_inode */
  237. int ocfs2_journal_access_di(handle_t *handle, struct inode *inode,
  238. struct buffer_head *bh, int type);
  239. /* ocfs2_extent_block */
  240. int ocfs2_journal_access_eb(handle_t *handle, struct inode *inode,
  241. struct buffer_head *bh, int type);
  242. /* ocfs2_group_desc */
  243. int ocfs2_journal_access_gd(handle_t *handle, struct inode *inode,
  244. struct buffer_head *bh, int type);
  245. /* ocfs2_xattr_block */
  246. int ocfs2_journal_access_xb(handle_t *handle, struct inode *inode,
  247. struct buffer_head *bh, int type);
  248. /* quota blocks */
  249. int ocfs2_journal_access_dq(handle_t *handle, struct inode *inode,
  250. struct buffer_head *bh, int type);
  251. /* dirblock */
  252. int ocfs2_journal_access_db(handle_t *handle, struct inode *inode,
  253. struct buffer_head *bh, int type);
  254. /* ocfs2_dx_root_block */
  255. int ocfs2_journal_access_dr(handle_t *handle, struct inode *inode,
  256. struct buffer_head *bh, int type);
  257. /* ocfs2_dx_leaf */
  258. int ocfs2_journal_access_dl(handle_t *handle, struct inode *inode,
  259. struct buffer_head *bh, int type);
  260. /* Anything that has no ecc */
  261. int ocfs2_journal_access(handle_t *handle, struct inode *inode,
  262. struct buffer_head *bh, int type);
  263. /*
  264. * A word about the journal_access/journal_dirty "dance". It is
  265. * entirely legal to journal_access a buffer more than once (as long
  266. * as the access type is the same -- I'm not sure what will happen if
  267. * access type is different but this should never happen anyway) It is
  268. * also legal to journal_dirty a buffer more than once. In fact, you
  269. * can even journal_access a buffer after you've done a
  270. * journal_access/journal_dirty pair. The only thing you cannot do
  271. * however, is journal_dirty a buffer which you haven't yet passed to
  272. * journal_access at least once.
  273. *
  274. * That said, 99% of the time this doesn't matter and this is what the
  275. * path looks like:
  276. *
  277. * <read a bh>
  278. * ocfs2_journal_access(handle, bh, OCFS2_JOURNAL_ACCESS_WRITE);
  279. * <modify the bh>
  280. * ocfs2_journal_dirty(handle, bh);
  281. */
  282. int ocfs2_journal_dirty(handle_t *handle,
  283. struct buffer_head *bh);
  284. /*
  285. * Credit Macros:
  286. * Convenience macros to calculate number of credits needed.
  287. *
  288. * For convenience sake, I have a set of macros here which calculate
  289. * the *maximum* number of sectors which will be changed for various
  290. * metadata updates.
  291. */
  292. /* simple file updates like chmod, etc. */
  293. #define OCFS2_INODE_UPDATE_CREDITS 1
  294. /* extended attribute block update */
  295. #define OCFS2_XATTR_BLOCK_UPDATE_CREDITS 1
  296. /* Update of a single quota block */
  297. #define OCFS2_QUOTA_BLOCK_UPDATE_CREDITS 1
  298. /* global quotafile inode update, data block */
  299. #define OCFS2_QINFO_WRITE_CREDITS (OCFS2_INODE_UPDATE_CREDITS + \
  300. OCFS2_QUOTA_BLOCK_UPDATE_CREDITS)
  301. #define OCFS2_LOCAL_QINFO_WRITE_CREDITS OCFS2_QUOTA_BLOCK_UPDATE_CREDITS
  302. /*
  303. * The two writes below can accidentally see global info dirty due
  304. * to set_info() quotactl so make them prepared for the writes.
  305. */
  306. /* quota data block, global info */
  307. /* Write to local quota file */
  308. #define OCFS2_QWRITE_CREDITS (OCFS2_QINFO_WRITE_CREDITS + \
  309. OCFS2_QUOTA_BLOCK_UPDATE_CREDITS)
  310. /* global quota data block, local quota data block, global quota inode,
  311. * global quota info */
  312. #define OCFS2_QSYNC_CREDITS (OCFS2_QINFO_WRITE_CREDITS + \
  313. 2 * OCFS2_QUOTA_BLOCK_UPDATE_CREDITS)
  314. static inline int ocfs2_quota_trans_credits(struct super_block *sb)
  315. {
  316. int credits = 0;
  317. if (OCFS2_HAS_RO_COMPAT_FEATURE(sb, OCFS2_FEATURE_RO_COMPAT_USRQUOTA))
  318. credits += OCFS2_QWRITE_CREDITS;
  319. if (OCFS2_HAS_RO_COMPAT_FEATURE(sb, OCFS2_FEATURE_RO_COMPAT_GRPQUOTA))
  320. credits += OCFS2_QWRITE_CREDITS;
  321. return credits;
  322. }
  323. /* group extend. inode update and last group update. */
  324. #define OCFS2_GROUP_EXTEND_CREDITS (OCFS2_INODE_UPDATE_CREDITS + 1)
  325. /* group add. inode update and the new group update. */
  326. #define OCFS2_GROUP_ADD_CREDITS (OCFS2_INODE_UPDATE_CREDITS + 1)
  327. /* get one bit out of a suballocator: dinode + group descriptor +
  328. * prev. group desc. if we relink. */
  329. #define OCFS2_SUBALLOC_ALLOC (3)
  330. static inline int ocfs2_inline_to_extents_credits(struct super_block *sb)
  331. {
  332. return OCFS2_SUBALLOC_ALLOC + OCFS2_INODE_UPDATE_CREDITS +
  333. ocfs2_quota_trans_credits(sb);
  334. }
  335. /* dinode + group descriptor update. We don't relink on free yet. */
  336. #define OCFS2_SUBALLOC_FREE (2)
  337. #define OCFS2_TRUNCATE_LOG_UPDATE OCFS2_INODE_UPDATE_CREDITS
  338. #define OCFS2_TRUNCATE_LOG_FLUSH_ONE_REC (OCFS2_SUBALLOC_FREE \
  339. + OCFS2_TRUNCATE_LOG_UPDATE)
  340. static inline int ocfs2_remove_extent_credits(struct super_block *sb)
  341. {
  342. return OCFS2_TRUNCATE_LOG_UPDATE + OCFS2_INODE_UPDATE_CREDITS +
  343. ocfs2_quota_trans_credits(sb);
  344. }
  345. /* data block for new dir/symlink, 2 for bitmap updates (bitmap fe +
  346. * bitmap block for the new bit) dx_root update for free list */
  347. #define OCFS2_DIR_LINK_ADDITIONAL_CREDITS (1 + 2 + 1)
  348. static inline int ocfs2_add_dir_index_credits(struct super_block *sb)
  349. {
  350. /* 1 block for index, 2 allocs (data, metadata), 1 clusters
  351. * worth of blocks for initial extent. */
  352. return 1 + 2 * OCFS2_SUBALLOC_ALLOC +
  353. ocfs2_clusters_to_blocks(sb, 1);
  354. }
  355. /* parent fe, parent block, new file entry, index leaf, inode alloc fe, inode
  356. * alloc group descriptor + mkdir/symlink blocks + dir blocks + xattr
  357. * blocks + quota update */
  358. static inline int ocfs2_mknod_credits(struct super_block *sb, int is_dir,
  359. int xattr_credits)
  360. {
  361. int dir_credits = OCFS2_DIR_LINK_ADDITIONAL_CREDITS;
  362. if (is_dir)
  363. dir_credits += ocfs2_add_dir_index_credits(sb);
  364. return 4 + OCFS2_SUBALLOC_ALLOC + dir_credits + xattr_credits +
  365. ocfs2_quota_trans_credits(sb);
  366. }
  367. /* local alloc metadata change + main bitmap updates */
  368. #define OCFS2_WINDOW_MOVE_CREDITS (OCFS2_INODE_UPDATE_CREDITS \
  369. + OCFS2_SUBALLOC_ALLOC + OCFS2_SUBALLOC_FREE)
  370. /* used when we don't need an allocation change for a dir extend. One
  371. * for the dinode, one for the new block. */
  372. #define OCFS2_SIMPLE_DIR_EXTEND_CREDITS (2)
  373. /* file update (nlink, etc) + directory mtime/ctime + dir entry block + quota
  374. * update on dir + index leaf + dx root update for free list */
  375. static inline int ocfs2_link_credits(struct super_block *sb)
  376. {
  377. return 2*OCFS2_INODE_UPDATE_CREDITS + 3 +
  378. ocfs2_quota_trans_credits(sb);
  379. }
  380. /* inode + dir inode (if we unlink a dir), + dir entry block + orphan
  381. * dir inode link + dir inode index leaf + dir index root */
  382. static inline int ocfs2_unlink_credits(struct super_block *sb)
  383. {
  384. /* The quota update from ocfs2_link_credits is unused here... */
  385. return 2 * OCFS2_INODE_UPDATE_CREDITS + 3 + ocfs2_link_credits(sb);
  386. }
  387. /* dinode + orphan dir dinode + inode alloc dinode + orphan dir entry +
  388. * inode alloc group descriptor + orphan dir index root +
  389. * orphan dir index leaf */
  390. #define OCFS2_DELETE_INODE_CREDITS (3 * OCFS2_INODE_UPDATE_CREDITS + 4)
  391. /* dinode update, old dir dinode update, new dir dinode update, old
  392. * dir dir entry, new dir dir entry, dir entry update for renaming
  393. * directory + target unlink + 3 x dir index leaves */
  394. static inline int ocfs2_rename_credits(struct super_block *sb)
  395. {
  396. return 3 * OCFS2_INODE_UPDATE_CREDITS + 6 + ocfs2_unlink_credits(sb);
  397. }
  398. /* global bitmap dinode, group desc., relinked group,
  399. * suballocator dinode, group desc., relinked group,
  400. * dinode, xattr block */
  401. #define OCFS2_XATTR_BLOCK_CREATE_CREDITS (OCFS2_SUBALLOC_ALLOC * 2 + \
  402. + OCFS2_INODE_UPDATE_CREDITS \
  403. + OCFS2_XATTR_BLOCK_UPDATE_CREDITS)
  404. /* inode update, removal of dx root block from allocator */
  405. #define OCFS2_DX_ROOT_REMOVE_CREDITS (OCFS2_INODE_UPDATE_CREDITS + \
  406. OCFS2_SUBALLOC_FREE)
  407. static inline int ocfs2_calc_dxi_expand_credits(struct super_block *sb)
  408. {
  409. int credits = 1 + OCFS2_SUBALLOC_ALLOC;
  410. credits += ocfs2_clusters_to_blocks(sb, 1);
  411. credits += ocfs2_quota_trans_credits(sb);
  412. return credits;
  413. }
  414. /*
  415. * Please note that the caller must make sure that root_el is the root
  416. * of extent tree. So for an inode, it should be &fe->id2.i_list. Otherwise
  417. * the result may be wrong.
  418. */
  419. static inline int ocfs2_calc_extend_credits(struct super_block *sb,
  420. struct ocfs2_extent_list *root_el,
  421. u32 bits_wanted)
  422. {
  423. int bitmap_blocks, sysfile_bitmap_blocks, extent_blocks;
  424. /* bitmap dinode, group desc. + relinked group. */
  425. bitmap_blocks = OCFS2_SUBALLOC_ALLOC;
  426. /* we might need to shift tree depth so lets assume an
  427. * absolute worst case of complete fragmentation. Even with
  428. * that, we only need one update for the dinode, and then
  429. * however many metadata chunks needed * a remaining suballoc
  430. * alloc. */
  431. sysfile_bitmap_blocks = 1 +
  432. (OCFS2_SUBALLOC_ALLOC - 1) * ocfs2_extend_meta_needed(root_el);
  433. /* this does not include *new* metadata blocks, which are
  434. * accounted for in sysfile_bitmap_blocks. root_el +
  435. * prev. last_eb_blk + blocks along edge of tree.
  436. * calc_symlink_credits passes because we just need 1
  437. * credit for the dinode there. */
  438. extent_blocks = 1 + 1 + le16_to_cpu(root_el->l_tree_depth);
  439. return bitmap_blocks + sysfile_bitmap_blocks + extent_blocks +
  440. ocfs2_quota_trans_credits(sb);
  441. }
  442. static inline int ocfs2_calc_symlink_credits(struct super_block *sb)
  443. {
  444. int blocks = ocfs2_mknod_credits(sb, 0, 0);
  445. /* links can be longer than one block so we may update many
  446. * within our single allocated extent. */
  447. blocks += ocfs2_clusters_to_blocks(sb, 1);
  448. return blocks + ocfs2_quota_trans_credits(sb);
  449. }
  450. static inline int ocfs2_calc_group_alloc_credits(struct super_block *sb,
  451. unsigned int cpg)
  452. {
  453. int blocks;
  454. int bitmap_blocks = OCFS2_SUBALLOC_ALLOC + 1;
  455. /* parent inode update + new block group header + bitmap inode update
  456. + bitmap blocks affected */
  457. blocks = 1 + 1 + 1 + bitmap_blocks;
  458. return blocks;
  459. }
  460. static inline int ocfs2_calc_tree_trunc_credits(struct super_block *sb,
  461. unsigned int clusters_to_del,
  462. struct ocfs2_dinode *fe,
  463. struct ocfs2_extent_list *last_el)
  464. {
  465. /* for dinode + all headers in this pass + update to next leaf */
  466. u16 next_free = le16_to_cpu(last_el->l_next_free_rec);
  467. u16 tree_depth = le16_to_cpu(fe->id2.i_list.l_tree_depth);
  468. int credits = 1 + tree_depth + 1;
  469. int i;
  470. i = next_free - 1;
  471. BUG_ON(i < 0);
  472. /* We may be deleting metadata blocks, so metadata alloc dinode +
  473. one desc. block for each possible delete. */
  474. if (tree_depth && next_free == 1 &&
  475. ocfs2_rec_clusters(last_el, &last_el->l_recs[i]) == clusters_to_del)
  476. credits += 1 + tree_depth;
  477. /* update to the truncate log. */
  478. credits += OCFS2_TRUNCATE_LOG_UPDATE;
  479. credits += ocfs2_quota_trans_credits(sb);
  480. return credits;
  481. }
  482. static inline int ocfs2_jbd2_file_inode(handle_t *handle, struct inode *inode)
  483. {
  484. return jbd2_journal_file_inode(handle, &OCFS2_I(inode)->ip_jinode);
  485. }
  486. static inline int ocfs2_begin_ordered_truncate(struct inode *inode,
  487. loff_t new_size)
  488. {
  489. return jbd2_journal_begin_ordered_truncate(
  490. OCFS2_SB(inode->i_sb)->journal->j_journal,
  491. &OCFS2_I(inode)->ip_jinode,
  492. new_size);
  493. }
  494. #endif /* OCFS2_JOURNAL_H */