truncate.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315
  1. /*
  2. * truncate.c
  3. *
  4. * PURPOSE
  5. * Truncate handling routines for the OSTA-UDF(tm) filesystem.
  6. *
  7. * COPYRIGHT
  8. * This file is distributed under the terms of the GNU General Public
  9. * License (GPL). Copies of the GPL can be obtained from:
  10. * ftp://prep.ai.mit.edu/pub/gnu/GPL
  11. * Each contributing author retains all rights to their own work.
  12. *
  13. * (C) 1999-2004 Ben Fennema
  14. * (C) 1999 Stelias Computing Inc
  15. *
  16. * HISTORY
  17. *
  18. * 02/24/99 blf Created.
  19. *
  20. */
  21. #include "udfdecl.h"
  22. #include <linux/fs.h>
  23. #include <linux/mm.h>
  24. #include <linux/buffer_head.h>
  25. #include "udf_i.h"
  26. #include "udf_sb.h"
  27. static void extent_trunc(struct inode *inode, struct extent_position *epos,
  28. struct kernel_lb_addr *eloc, int8_t etype, uint32_t elen,
  29. uint32_t nelen)
  30. {
  31. struct kernel_lb_addr neloc = {};
  32. int last_block = (elen + inode->i_sb->s_blocksize - 1) >>
  33. inode->i_sb->s_blocksize_bits;
  34. int first_block = (nelen + inode->i_sb->s_blocksize - 1) >>
  35. inode->i_sb->s_blocksize_bits;
  36. if (nelen) {
  37. if (etype == (EXT_NOT_RECORDED_ALLOCATED >> 30)) {
  38. udf_free_blocks(inode->i_sb, inode, eloc, 0,
  39. last_block);
  40. etype = (EXT_NOT_RECORDED_NOT_ALLOCATED >> 30);
  41. } else
  42. neloc = *eloc;
  43. nelen = (etype << 30) | nelen;
  44. }
  45. if (elen != nelen) {
  46. udf_write_aext(inode, epos, &neloc, nelen, 0);
  47. if (last_block - first_block > 0) {
  48. if (etype == (EXT_RECORDED_ALLOCATED >> 30))
  49. mark_inode_dirty(inode);
  50. if (etype != (EXT_NOT_RECORDED_NOT_ALLOCATED >> 30))
  51. udf_free_blocks(inode->i_sb, inode, eloc,
  52. first_block,
  53. last_block - first_block);
  54. }
  55. }
  56. }
  57. /*
  58. * Truncate the last extent to match i_size. This function assumes
  59. * that preallocation extent is already truncated.
  60. */
  61. void udf_truncate_tail_extent(struct inode *inode)
  62. {
  63. struct extent_position epos = {};
  64. struct kernel_lb_addr eloc;
  65. uint32_t elen, nelen;
  66. uint64_t lbcount = 0;
  67. int8_t etype = -1, netype;
  68. int adsize;
  69. struct udf_inode_info *iinfo = UDF_I(inode);
  70. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB ||
  71. inode->i_size == iinfo->i_lenExtents)
  72. return;
  73. /* Are we going to delete the file anyway? */
  74. if (inode->i_nlink == 0)
  75. return;
  76. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_SHORT)
  77. adsize = sizeof(struct short_ad);
  78. else if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_LONG)
  79. adsize = sizeof(struct long_ad);
  80. else
  81. BUG();
  82. /* Find the last extent in the file */
  83. while ((netype = udf_next_aext(inode, &epos, &eloc, &elen, 1)) != -1) {
  84. etype = netype;
  85. lbcount += elen;
  86. if (lbcount > inode->i_size) {
  87. if (lbcount - inode->i_size >= inode->i_sb->s_blocksize)
  88. printk(KERN_WARNING
  89. "udf_truncate_tail_extent(): Too long "
  90. "extent after EOF in inode %u: i_size: "
  91. "%Ld lbcount: %Ld extent %u+%u\n",
  92. (unsigned)inode->i_ino,
  93. (long long)inode->i_size,
  94. (long long)lbcount,
  95. (unsigned)eloc.logicalBlockNum,
  96. (unsigned)elen);
  97. nelen = elen - (lbcount - inode->i_size);
  98. epos.offset -= adsize;
  99. extent_trunc(inode, &epos, &eloc, etype, elen, nelen);
  100. epos.offset += adsize;
  101. if (udf_next_aext(inode, &epos, &eloc, &elen, 1) != -1)
  102. printk(KERN_ERR "udf_truncate_tail_extent(): "
  103. "Extent after EOF in inode %u.\n",
  104. (unsigned)inode->i_ino);
  105. break;
  106. }
  107. }
  108. /* This inode entry is in-memory only and thus we don't have to mark
  109. * the inode dirty */
  110. iinfo->i_lenExtents = inode->i_size;
  111. brelse(epos.bh);
  112. }
  113. void udf_discard_prealloc(struct inode *inode)
  114. {
  115. struct extent_position epos = { NULL, 0, {0, 0} };
  116. struct kernel_lb_addr eloc;
  117. uint32_t elen;
  118. uint64_t lbcount = 0;
  119. int8_t etype = -1, netype;
  120. int adsize;
  121. struct udf_inode_info *iinfo = UDF_I(inode);
  122. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB ||
  123. inode->i_size == iinfo->i_lenExtents)
  124. return;
  125. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_SHORT)
  126. adsize = sizeof(struct short_ad);
  127. else if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_LONG)
  128. adsize = sizeof(struct long_ad);
  129. else
  130. adsize = 0;
  131. epos.block = iinfo->i_location;
  132. /* Find the last extent in the file */
  133. while ((netype = udf_next_aext(inode, &epos, &eloc, &elen, 1)) != -1) {
  134. etype = netype;
  135. lbcount += elen;
  136. }
  137. if (etype == (EXT_NOT_RECORDED_ALLOCATED >> 30)) {
  138. epos.offset -= adsize;
  139. lbcount -= elen;
  140. extent_trunc(inode, &epos, &eloc, etype, elen, 0);
  141. if (!epos.bh) {
  142. iinfo->i_lenAlloc =
  143. epos.offset -
  144. udf_file_entry_alloc_offset(inode);
  145. mark_inode_dirty(inode);
  146. } else {
  147. struct allocExtDesc *aed =
  148. (struct allocExtDesc *)(epos.bh->b_data);
  149. aed->lengthAllocDescs =
  150. cpu_to_le32(epos.offset -
  151. sizeof(struct allocExtDesc));
  152. if (!UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_STRICT) ||
  153. UDF_SB(inode->i_sb)->s_udfrev >= 0x0201)
  154. udf_update_tag(epos.bh->b_data, epos.offset);
  155. else
  156. udf_update_tag(epos.bh->b_data,
  157. sizeof(struct allocExtDesc));
  158. mark_buffer_dirty_inode(epos.bh, inode);
  159. }
  160. }
  161. /* This inode entry is in-memory only and thus we don't have to mark
  162. * the inode dirty */
  163. iinfo->i_lenExtents = lbcount;
  164. brelse(epos.bh);
  165. }
  166. static void udf_update_alloc_ext_desc(struct inode *inode,
  167. struct extent_position *epos,
  168. u32 lenalloc)
  169. {
  170. struct super_block *sb = inode->i_sb;
  171. struct udf_sb_info *sbi = UDF_SB(sb);
  172. struct allocExtDesc *aed = (struct allocExtDesc *) (epos->bh->b_data);
  173. int len = sizeof(struct allocExtDesc);
  174. aed->lengthAllocDescs = cpu_to_le32(lenalloc);
  175. if (!UDF_QUERY_FLAG(sb, UDF_FLAG_STRICT) || sbi->s_udfrev >= 0x0201)
  176. len += lenalloc;
  177. udf_update_tag(epos->bh->b_data, len);
  178. mark_buffer_dirty_inode(epos->bh, inode);
  179. }
  180. void udf_truncate_extents(struct inode *inode)
  181. {
  182. struct extent_position epos;
  183. struct kernel_lb_addr eloc, neloc = {};
  184. uint32_t elen, nelen = 0, indirect_ext_len = 0, lenalloc;
  185. int8_t etype;
  186. struct super_block *sb = inode->i_sb;
  187. sector_t first_block = inode->i_size >> sb->s_blocksize_bits, offset;
  188. loff_t byte_offset;
  189. int adsize;
  190. struct udf_inode_info *iinfo = UDF_I(inode);
  191. if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_SHORT)
  192. adsize = sizeof(struct short_ad);
  193. else if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_LONG)
  194. adsize = sizeof(struct long_ad);
  195. else
  196. BUG();
  197. etype = inode_bmap(inode, first_block, &epos, &eloc, &elen, &offset);
  198. byte_offset = (offset << sb->s_blocksize_bits) +
  199. (inode->i_size & (sb->s_blocksize - 1));
  200. if (etype != -1) {
  201. epos.offset -= adsize;
  202. extent_trunc(inode, &epos, &eloc, etype, elen, byte_offset);
  203. epos.offset += adsize;
  204. if (byte_offset)
  205. lenalloc = epos.offset;
  206. else
  207. lenalloc = epos.offset - adsize;
  208. if (!epos.bh)
  209. lenalloc -= udf_file_entry_alloc_offset(inode);
  210. else
  211. lenalloc -= sizeof(struct allocExtDesc);
  212. while ((etype = udf_current_aext(inode, &epos, &eloc,
  213. &elen, 0)) != -1) {
  214. if (etype == (EXT_NEXT_EXTENT_ALLOCDECS >> 30)) {
  215. udf_write_aext(inode, &epos, &neloc, nelen, 0);
  216. if (indirect_ext_len) {
  217. /* We managed to free all extents in the
  218. * indirect extent - free it too */
  219. BUG_ON(!epos.bh);
  220. udf_free_blocks(sb, inode, &epos.block,
  221. 0, indirect_ext_len);
  222. } else if (!epos.bh) {
  223. iinfo->i_lenAlloc = lenalloc;
  224. mark_inode_dirty(inode);
  225. } else
  226. udf_update_alloc_ext_desc(inode,
  227. &epos, lenalloc);
  228. brelse(epos.bh);
  229. epos.offset = sizeof(struct allocExtDesc);
  230. epos.block = eloc;
  231. epos.bh = udf_tread(sb,
  232. udf_get_lb_pblock(sb, &eloc, 0));
  233. if (elen)
  234. indirect_ext_len =
  235. (elen + sb->s_blocksize - 1) >>
  236. sb->s_blocksize_bits;
  237. else
  238. indirect_ext_len = 1;
  239. } else {
  240. extent_trunc(inode, &epos, &eloc, etype,
  241. elen, 0);
  242. epos.offset += adsize;
  243. }
  244. }
  245. if (indirect_ext_len) {
  246. BUG_ON(!epos.bh);
  247. udf_free_blocks(sb, inode, &epos.block, 0,
  248. indirect_ext_len);
  249. } else if (!epos.bh) {
  250. iinfo->i_lenAlloc = lenalloc;
  251. mark_inode_dirty(inode);
  252. } else
  253. udf_update_alloc_ext_desc(inode, &epos, lenalloc);
  254. } else if (inode->i_size) {
  255. if (byte_offset) {
  256. struct kernel_long_ad extent;
  257. /*
  258. * OK, there is not extent covering inode->i_size and
  259. * no extent above inode->i_size => truncate is
  260. * extending the file by 'offset' blocks.
  261. */
  262. if ((!epos.bh &&
  263. epos.offset ==
  264. udf_file_entry_alloc_offset(inode)) ||
  265. (epos.bh && epos.offset ==
  266. sizeof(struct allocExtDesc))) {
  267. /* File has no extents at all or has empty last
  268. * indirect extent! Create a fake extent... */
  269. extent.extLocation.logicalBlockNum = 0;
  270. extent.extLocation.partitionReferenceNum = 0;
  271. extent.extLength =
  272. EXT_NOT_RECORDED_NOT_ALLOCATED;
  273. } else {
  274. epos.offset -= adsize;
  275. etype = udf_next_aext(inode, &epos,
  276. &extent.extLocation,
  277. &extent.extLength, 0);
  278. extent.extLength |= etype << 30;
  279. }
  280. udf_extend_file(inode, &epos, &extent,
  281. offset +
  282. ((inode->i_size &
  283. (sb->s_blocksize - 1)) != 0));
  284. }
  285. }
  286. iinfo->i_lenExtents = inode->i_size;
  287. brelse(epos.bh);
  288. }