trans.c 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193
  1. /*
  2. * Copyright (C) Sistina Software, Inc. 1997-2003 All rights reserved.
  3. * Copyright (C) 2004-2006 Red Hat, Inc. All rights reserved.
  4. *
  5. * This copyrighted material is made available to anyone wishing to use,
  6. * modify, copy, or redistribute it subject to the terms and conditions
  7. * of the GNU General Public License version 2.
  8. */
  9. #include <linux/sched.h>
  10. #include <linux/slab.h>
  11. #include <linux/spinlock.h>
  12. #include <linux/completion.h>
  13. #include <linux/buffer_head.h>
  14. #include <linux/kallsyms.h>
  15. #include <linux/gfs2_ondisk.h>
  16. #include "gfs2.h"
  17. #include "incore.h"
  18. #include "glock.h"
  19. #include "log.h"
  20. #include "lops.h"
  21. #include "meta_io.h"
  22. #include "trans.h"
  23. #include "util.h"
  24. #include "trace_gfs2.h"
  25. int gfs2_trans_begin(struct gfs2_sbd *sdp, unsigned int blocks,
  26. unsigned int revokes)
  27. {
  28. struct gfs2_trans *tr;
  29. int error;
  30. BUG_ON(current->journal_info);
  31. BUG_ON(blocks == 0 && revokes == 0);
  32. if (!test_bit(SDF_JOURNAL_LIVE, &sdp->sd_flags))
  33. return -EROFS;
  34. tr = kzalloc(sizeof(struct gfs2_trans), GFP_NOFS);
  35. if (!tr)
  36. return -ENOMEM;
  37. tr->tr_ip = (unsigned long)__builtin_return_address(0);
  38. tr->tr_blocks = blocks;
  39. tr->tr_revokes = revokes;
  40. tr->tr_reserved = 1;
  41. if (blocks)
  42. tr->tr_reserved += 6 + blocks;
  43. if (revokes)
  44. tr->tr_reserved += gfs2_struct2blk(sdp, revokes,
  45. sizeof(u64));
  46. INIT_LIST_HEAD(&tr->tr_list_buf);
  47. gfs2_holder_init(sdp->sd_trans_gl, LM_ST_SHARED, 0, &tr->tr_t_gh);
  48. error = gfs2_glock_nq(&tr->tr_t_gh);
  49. if (error)
  50. goto fail_holder_uninit;
  51. error = gfs2_log_reserve(sdp, tr->tr_reserved);
  52. if (error)
  53. goto fail_gunlock;
  54. current->journal_info = tr;
  55. return 0;
  56. fail_gunlock:
  57. gfs2_glock_dq(&tr->tr_t_gh);
  58. fail_holder_uninit:
  59. gfs2_holder_uninit(&tr->tr_t_gh);
  60. kfree(tr);
  61. return error;
  62. }
  63. /**
  64. * gfs2_log_release - Release a given number of log blocks
  65. * @sdp: The GFS2 superblock
  66. * @blks: The number of blocks
  67. *
  68. */
  69. static void gfs2_log_release(struct gfs2_sbd *sdp, unsigned int blks)
  70. {
  71. atomic_add(blks, &sdp->sd_log_blks_free);
  72. trace_gfs2_log_blocks(sdp, blks);
  73. gfs2_assert_withdraw(sdp, atomic_read(&sdp->sd_log_blks_free) <=
  74. sdp->sd_jdesc->jd_blocks);
  75. up_read(&sdp->sd_log_flush_lock);
  76. }
  77. void gfs2_trans_end(struct gfs2_sbd *sdp)
  78. {
  79. struct gfs2_trans *tr = current->journal_info;
  80. BUG_ON(!tr);
  81. current->journal_info = NULL;
  82. if (!tr->tr_touched) {
  83. gfs2_log_release(sdp, tr->tr_reserved);
  84. if (tr->tr_t_gh.gh_gl) {
  85. gfs2_glock_dq(&tr->tr_t_gh);
  86. gfs2_holder_uninit(&tr->tr_t_gh);
  87. kfree(tr);
  88. }
  89. return;
  90. }
  91. if (gfs2_assert_withdraw(sdp, tr->tr_num_buf <= tr->tr_blocks)) {
  92. fs_err(sdp, "tr_num_buf = %u, tr_blocks = %u ",
  93. tr->tr_num_buf, tr->tr_blocks);
  94. print_symbol(KERN_WARNING "GFS2: Transaction created at: %s\n", tr->tr_ip);
  95. }
  96. if (gfs2_assert_withdraw(sdp, tr->tr_num_revoke <= tr->tr_revokes)) {
  97. fs_err(sdp, "tr_num_revoke = %u, tr_revokes = %u ",
  98. tr->tr_num_revoke, tr->tr_revokes);
  99. print_symbol(KERN_WARNING "GFS2: Transaction created at: %s\n", tr->tr_ip);
  100. }
  101. gfs2_log_commit(sdp, tr);
  102. if (tr->tr_t_gh.gh_gl) {
  103. gfs2_glock_dq(&tr->tr_t_gh);
  104. gfs2_holder_uninit(&tr->tr_t_gh);
  105. kfree(tr);
  106. }
  107. if (sdp->sd_vfs->s_flags & MS_SYNCHRONOUS)
  108. gfs2_log_flush(sdp, NULL);
  109. }
  110. /**
  111. * gfs2_trans_add_bh - Add a to-be-modified buffer to the current transaction
  112. * @gl: the glock the buffer belongs to
  113. * @bh: The buffer to add
  114. * @meta: True in the case of adding metadata
  115. *
  116. */
  117. void gfs2_trans_add_bh(struct gfs2_glock *gl, struct buffer_head *bh, int meta)
  118. {
  119. struct gfs2_sbd *sdp = gl->gl_sbd;
  120. struct gfs2_bufdata *bd;
  121. bd = bh->b_private;
  122. if (bd)
  123. gfs2_assert(sdp, bd->bd_gl == gl);
  124. else {
  125. gfs2_attach_bufdata(gl, bh, meta);
  126. bd = bh->b_private;
  127. }
  128. lops_add(sdp, &bd->bd_le);
  129. }
  130. void gfs2_trans_add_revoke(struct gfs2_sbd *sdp, struct gfs2_bufdata *bd)
  131. {
  132. BUG_ON(!list_empty(&bd->bd_le.le_list));
  133. BUG_ON(!list_empty(&bd->bd_ail_st_list));
  134. BUG_ON(!list_empty(&bd->bd_ail_gl_list));
  135. lops_init_le(&bd->bd_le, &gfs2_revoke_lops);
  136. lops_add(sdp, &bd->bd_le);
  137. }
  138. void gfs2_trans_add_unrevoke(struct gfs2_sbd *sdp, u64 blkno, unsigned int len)
  139. {
  140. struct gfs2_bufdata *bd, *tmp;
  141. struct gfs2_trans *tr = current->journal_info;
  142. unsigned int n = len;
  143. gfs2_log_lock(sdp);
  144. list_for_each_entry_safe(bd, tmp, &sdp->sd_log_le_revoke, bd_le.le_list) {
  145. if ((bd->bd_blkno >= blkno) && (bd->bd_blkno < (blkno + len))) {
  146. list_del_init(&bd->bd_le.le_list);
  147. gfs2_assert_withdraw(sdp, sdp->sd_log_num_revoke);
  148. sdp->sd_log_num_revoke--;
  149. kmem_cache_free(gfs2_bufdata_cachep, bd);
  150. tr->tr_num_revoke_rm++;
  151. if (--n == 0)
  152. break;
  153. }
  154. }
  155. gfs2_log_unlock(sdp);
  156. }
  157. void gfs2_trans_add_rg(struct gfs2_rgrpd *rgd)
  158. {
  159. lops_add(rgd->rd_sbd, &rgd->rd_le);
  160. }