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