truncate.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316
  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/udf_fs.h>
  25. #include <linux/buffer_head.h>
  26. #include "udf_i.h"
  27. #include "udf_sb.h"
  28. static void extent_trunc(struct inode * inode, struct extent_position *epos,
  29. kernel_lb_addr eloc, int8_t etype, uint32_t elen, uint32_t nelen)
  30. {
  31. kernel_lb_addr neloc = { 0, 0 };
  32. int last_block = (elen + inode->i_sb->s_blocksize - 1) >> inode->i_sb->s_blocksize_bits;
  33. int first_block = (nelen + inode->i_sb->s_blocksize - 1) >> inode->i_sb->s_blocksize_bits;
  34. if (nelen)
  35. {
  36. if (etype == (EXT_NOT_RECORDED_ALLOCATED >> 30))
  37. {
  38. udf_free_blocks(inode->i_sb, inode, eloc, 0, last_block);
  39. etype = (EXT_NOT_RECORDED_NOT_ALLOCATED >> 30);
  40. }
  41. else
  42. neloc = eloc;
  43. nelen = (etype << 30) | nelen;
  44. }
  45. if (elen != nelen)
  46. {
  47. udf_write_aext(inode, epos, neloc, nelen, 0);
  48. if (last_block - first_block > 0)
  49. {
  50. if (etype == (EXT_RECORDED_ALLOCATED >> 30))
  51. mark_inode_dirty(inode);
  52. if (etype != (EXT_NOT_RECORDED_NOT_ALLOCATED >> 30))
  53. udf_free_blocks(inode->i_sb, inode, eloc, first_block, 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 = { NULL, 0, {0, 0}};
  64. kernel_lb_addr eloc;
  65. uint32_t elen, nelen;
  66. uint64_t lbcount = 0;
  67. int8_t etype = -1, netype;
  68. int adsize;
  69. if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_IN_ICB ||
  70. inode->i_size == UDF_I_LENEXTENTS(inode))
  71. return;
  72. /* Are we going to delete the file anyway? */
  73. if (inode->i_nlink == 0)
  74. return;
  75. if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_SHORT)
  76. adsize = sizeof(short_ad);
  77. else if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_LONG)
  78. adsize = sizeof(long_ad);
  79. else
  80. BUG();
  81. /* Find the last extent in the file */
  82. while ((netype = udf_next_aext(inode, &epos, &eloc, &elen, 1)) != -1)
  83. {
  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. UDF_I_LENEXTENTS(inode) = 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. kernel_lb_addr eloc;
  117. uint32_t elen;
  118. uint64_t lbcount = 0;
  119. int8_t etype = -1, netype;
  120. int adsize;
  121. if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_IN_ICB ||
  122. inode->i_size == UDF_I_LENEXTENTS(inode))
  123. return;
  124. if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_SHORT)
  125. adsize = sizeof(short_ad);
  126. else if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_LONG)
  127. adsize = sizeof(long_ad);
  128. else
  129. adsize = 0;
  130. epos.block = UDF_I_LOCATION(inode);
  131. /* Find the last extent in the file */
  132. while ((netype = udf_next_aext(inode, &epos, &eloc, &elen, 1)) != -1) {
  133. etype = netype;
  134. lbcount += elen;
  135. }
  136. if (etype == (EXT_NOT_RECORDED_ALLOCATED >> 30)) {
  137. epos.offset -= adsize;
  138. lbcount -= elen;
  139. extent_trunc(inode, &epos, eloc, etype, elen, 0);
  140. if (!epos.bh) {
  141. UDF_I_LENALLOC(inode) = epos.offset - udf_file_entry_alloc_offset(inode);
  142. mark_inode_dirty(inode);
  143. } else {
  144. struct allocExtDesc *aed = (struct allocExtDesc *)(epos.bh->b_data);
  145. aed->lengthAllocDescs = cpu_to_le32(epos.offset - sizeof(struct allocExtDesc));
  146. if (!UDF_QUERY_FLAG(inode->i_sb, UDF_FLAG_STRICT) || UDF_SB_UDFREV(inode->i_sb) >= 0x0201)
  147. udf_update_tag(epos.bh->b_data, epos.offset);
  148. else
  149. udf_update_tag(epos.bh->b_data, sizeof(struct allocExtDesc));
  150. mark_buffer_dirty_inode(epos.bh, inode);
  151. }
  152. }
  153. /* This inode entry is in-memory only and thus we don't have to mark
  154. * the inode dirty */
  155. UDF_I_LENEXTENTS(inode) = lbcount;
  156. brelse(epos.bh);
  157. }
  158. void udf_truncate_extents(struct inode * inode)
  159. {
  160. struct extent_position epos;
  161. kernel_lb_addr eloc, neloc = { 0, 0 };
  162. uint32_t elen, nelen = 0, indirect_ext_len = 0, lenalloc;
  163. int8_t etype;
  164. struct super_block *sb = inode->i_sb;
  165. sector_t first_block = inode->i_size >> sb->s_blocksize_bits, offset;
  166. loff_t byte_offset;
  167. int adsize;
  168. if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_SHORT)
  169. adsize = sizeof(short_ad);
  170. else if (UDF_I_ALLOCTYPE(inode) == ICBTAG_FLAG_AD_LONG)
  171. adsize = sizeof(long_ad);
  172. else
  173. BUG();
  174. etype = inode_bmap(inode, first_block, &epos, &eloc, &elen, &offset);
  175. byte_offset = (offset << sb->s_blocksize_bits) + (inode->i_size & (sb->s_blocksize-1));
  176. if (etype != -1)
  177. {
  178. epos.offset -= adsize;
  179. extent_trunc(inode, &epos, eloc, etype, elen, byte_offset);
  180. epos.offset += adsize;
  181. if (byte_offset)
  182. lenalloc = epos.offset;
  183. else
  184. lenalloc = epos.offset - adsize;
  185. if (!epos.bh)
  186. lenalloc -= udf_file_entry_alloc_offset(inode);
  187. else
  188. lenalloc -= sizeof(struct allocExtDesc);
  189. while ((etype = udf_current_aext(inode, &epos, &eloc, &elen, 0)) != -1)
  190. {
  191. if (etype == (EXT_NEXT_EXTENT_ALLOCDECS >> 30))
  192. {
  193. udf_write_aext(inode, &epos, neloc, nelen, 0);
  194. if (indirect_ext_len)
  195. {
  196. /* We managed to free all extents in the
  197. * indirect extent - free it too */
  198. if (!epos.bh)
  199. BUG();
  200. udf_free_blocks(sb, inode, epos.block, 0, indirect_ext_len);
  201. }
  202. else
  203. {
  204. if (!epos.bh)
  205. {
  206. UDF_I_LENALLOC(inode) = lenalloc;
  207. mark_inode_dirty(inode);
  208. }
  209. else
  210. {
  211. struct allocExtDesc *aed = (struct allocExtDesc *)(epos.bh->b_data);
  212. aed->lengthAllocDescs = cpu_to_le32(lenalloc);
  213. if (!UDF_QUERY_FLAG(sb, UDF_FLAG_STRICT) || UDF_SB_UDFREV(sb) >= 0x0201)
  214. udf_update_tag(epos.bh->b_data, lenalloc +
  215. sizeof(struct allocExtDesc));
  216. else
  217. udf_update_tag(epos.bh->b_data, sizeof(struct allocExtDesc));
  218. mark_buffer_dirty_inode(epos.bh, inode);
  219. }
  220. }
  221. brelse(epos.bh);
  222. epos.offset = sizeof(struct allocExtDesc);
  223. epos.block = eloc;
  224. epos.bh = udf_tread(sb, udf_get_lb_pblock(sb, eloc, 0));
  225. if (elen)
  226. indirect_ext_len = (elen +
  227. sb->s_blocksize - 1) >>
  228. sb->s_blocksize_bits;
  229. else
  230. indirect_ext_len = 1;
  231. }
  232. else
  233. {
  234. extent_trunc(inode, &epos, eloc, etype, elen, 0);
  235. epos.offset += adsize;
  236. }
  237. }
  238. if (indirect_ext_len)
  239. {
  240. if (!epos.bh)
  241. BUG();
  242. udf_free_blocks(sb, inode, epos.block, 0, indirect_ext_len);
  243. }
  244. else
  245. {
  246. if (!epos.bh)
  247. {
  248. UDF_I_LENALLOC(inode) = lenalloc;
  249. mark_inode_dirty(inode);
  250. }
  251. else
  252. {
  253. struct allocExtDesc *aed = (struct allocExtDesc *)(epos.bh->b_data);
  254. aed->lengthAllocDescs = cpu_to_le32(lenalloc);
  255. if (!UDF_QUERY_FLAG(sb, UDF_FLAG_STRICT) || UDF_SB_UDFREV(sb) >= 0x0201)
  256. udf_update_tag(epos.bh->b_data, lenalloc +
  257. sizeof(struct allocExtDesc));
  258. else
  259. udf_update_tag(epos.bh->b_data, sizeof(struct allocExtDesc));
  260. mark_buffer_dirty_inode(epos.bh, inode);
  261. }
  262. }
  263. }
  264. else if (inode->i_size)
  265. {
  266. if (byte_offset)
  267. {
  268. kernel_long_ad extent;
  269. /*
  270. * OK, there is not extent covering inode->i_size and
  271. * no extent above inode->i_size => truncate is
  272. * extending the file by 'offset' blocks.
  273. */
  274. if ((!epos.bh && epos.offset == udf_file_entry_alloc_offset(inode)) ||
  275. (epos.bh && epos.offset == sizeof(struct allocExtDesc))) {
  276. /* File has no extents at all or has empty last
  277. * indirect extent! Create a fake extent... */
  278. extent.extLocation.logicalBlockNum = 0;
  279. extent.extLocation.partitionReferenceNum = 0;
  280. extent.extLength = EXT_NOT_RECORDED_NOT_ALLOCATED;
  281. }
  282. else {
  283. epos.offset -= adsize;
  284. etype = udf_next_aext(inode, &epos,
  285. &extent.extLocation, &extent.extLength, 0);
  286. extent.extLength |= etype << 30;
  287. }
  288. udf_extend_file(inode, &epos, &extent, offset+((inode->i_size & (sb->s_blocksize-1)) != 0));
  289. }
  290. }
  291. UDF_I_LENEXTENTS(inode) = inode->i_size;
  292. brelse(epos.bh);
  293. }