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