5 * Directory related functions
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.
18 #include <linux/string.h>
19 #include <linux/bio.h>
20 #include <linux/crc-itu-t.h>
21 #include <linux/iversion.h>
23 static int udf_verify_fi(struct udf_fileident_iter *iter)
27 if (iter->fi.descTag.tagIdent != cpu_to_le16(TAG_IDENT_FID)) {
28 udf_err(iter->dir->i_sb,
29 "directory (ino %lu) has entry at pos %llu with incorrect tag %x\n",
30 iter->dir->i_ino, (unsigned long long)iter->pos,
31 le16_to_cpu(iter->fi.descTag.tagIdent));
34 len = udf_dir_entry_len(&iter->fi);
35 if (le16_to_cpu(iter->fi.lengthOfImpUse) & 3) {
36 udf_err(iter->dir->i_sb,
37 "directory (ino %lu) has entry at pos %llu with unaligned length of impUse field\n",
38 iter->dir->i_ino, (unsigned long long)iter->pos);
42 * This is in fact allowed by the spec due to long impUse field but
43 * we don't support it. If there is real media with this large impUse
44 * field, support can be added.
46 if (len > 1 << iter->dir->i_blkbits) {
47 udf_err(iter->dir->i_sb,
48 "directory (ino %lu) has too big (%u) entry at pos %llu\n",
49 iter->dir->i_ino, len, (unsigned long long)iter->pos);
52 if (iter->pos + len > iter->dir->i_size) {
53 udf_err(iter->dir->i_sb,
54 "directory (ino %lu) has entry past directory size at pos %llu\n",
55 iter->dir->i_ino, (unsigned long long)iter->pos);
58 if (udf_dir_entry_len(&iter->fi) !=
59 sizeof(struct tag) + le16_to_cpu(iter->fi.descTag.descCRCLength)) {
60 udf_err(iter->dir->i_sb,
61 "directory (ino %lu) has entry where CRC length (%u) does not match entry length (%u)\n",
63 (unsigned)le16_to_cpu(iter->fi.descTag.descCRCLength),
64 (unsigned)(udf_dir_entry_len(&iter->fi) -
71 static int udf_copy_fi(struct udf_fileident_iter *iter)
73 struct udf_inode_info *iinfo = UDF_I(iter->dir);
74 u32 blksize = 1 << iter->dir->i_blkbits;
75 u32 off, len, nameoff;
78 /* Skip copying when we are at EOF */
79 if (iter->pos >= iter->dir->i_size) {
83 if (iter->dir->i_size < iter->pos + sizeof(struct fileIdentDesc)) {
84 udf_err(iter->dir->i_sb,
85 "directory (ino %lu) has entry straddling EOF\n",
89 if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
90 memcpy(&iter->fi, iinfo->i_data + iinfo->i_lenEAttr + iter->pos,
91 sizeof(struct fileIdentDesc));
92 err = udf_verify_fi(iter);
95 iter->name = iinfo->i_data + iinfo->i_lenEAttr + iter->pos +
96 sizeof(struct fileIdentDesc) +
97 le16_to_cpu(iter->fi.lengthOfImpUse);
101 off = iter->pos & (blksize - 1);
102 len = min_t(int, sizeof(struct fileIdentDesc), blksize - off);
103 memcpy(&iter->fi, iter->bh[0]->b_data + off, len);
104 if (len < sizeof(struct fileIdentDesc))
105 memcpy((char *)(&iter->fi) + len, iter->bh[1]->b_data,
106 sizeof(struct fileIdentDesc) - len);
107 err = udf_verify_fi(iter);
111 /* Handle directory entry name */
112 nameoff = off + sizeof(struct fileIdentDesc) +
113 le16_to_cpu(iter->fi.lengthOfImpUse);
114 if (off + udf_dir_entry_len(&iter->fi) <= blksize) {
115 iter->name = iter->bh[0]->b_data + nameoff;
116 } else if (nameoff >= blksize) {
117 iter->name = iter->bh[1]->b_data + (nameoff - blksize);
119 iter->name = iter->namebuf;
120 len = blksize - nameoff;
121 memcpy(iter->name, iter->bh[0]->b_data + nameoff, len);
122 memcpy(iter->name + len, iter->bh[1]->b_data,
123 iter->fi.lengthFileIdent - len);
128 /* Readahead 8k once we are at 8k boundary */
129 static void udf_readahead_dir(struct udf_fileident_iter *iter)
131 unsigned int ralen = 16 >> (iter->dir->i_blkbits - 9);
132 struct buffer_head *tmp, *bha[16];
136 if (iter->loffset & (ralen - 1))
139 if (iter->loffset + ralen > (iter->elen >> iter->dir->i_blkbits))
140 ralen = (iter->elen >> iter->dir->i_blkbits) - iter->loffset;
142 for (i = 0; i < ralen; i++) {
143 blk = udf_get_lb_pblock(iter->dir->i_sb, &iter->eloc,
145 tmp = sb_getblk(iter->dir->i_sb, blk);
146 if (tmp && !buffer_uptodate(tmp) && !buffer_locked(tmp))
152 bh_readahead_batch(num, bha, REQ_RAHEAD);
153 for (i = 0; i < num; i++)
158 static struct buffer_head *udf_fiiter_bread_blk(struct udf_fileident_iter *iter)
162 udf_readahead_dir(iter);
163 blk = udf_get_lb_pblock(iter->dir->i_sb, &iter->eloc, iter->loffset);
164 return sb_bread(iter->dir->i_sb, blk);
168 * Updates loffset to point to next directory block; eloc, elen & epos are
169 * updated if we need to traverse to the next extent as well.
171 static int udf_fiiter_advance_blk(struct udf_fileident_iter *iter)
174 if (iter->loffset < DIV_ROUND_UP(iter->elen, 1<<iter->dir->i_blkbits))
178 if (udf_next_aext(iter->dir, &iter->epos, &iter->eloc, &iter->elen, 1)
179 != (EXT_RECORDED_ALLOCATED >> 30)) {
180 if (iter->pos == iter->dir->i_size) {
184 udf_err(iter->dir->i_sb,
185 "extent after position %llu not allocated in directory (ino %lu)\n",
186 (unsigned long long)iter->pos, iter->dir->i_ino);
187 return -EFSCORRUPTED;
192 static int udf_fiiter_load_bhs(struct udf_fileident_iter *iter)
194 int blksize = 1 << iter->dir->i_blkbits;
195 int off = iter->pos & (blksize - 1);
197 struct fileIdentDesc *fi;
199 /* Is there any further extent we can map from? */
200 if (!iter->bh[0] && iter->elen) {
201 iter->bh[0] = udf_fiiter_bread_blk(iter);
206 if (!buffer_uptodate(iter->bh[0])) {
211 /* There's no next block so we are done */
212 if (iter->pos >= iter->dir->i_size)
214 /* Need to fetch next block as well? */
215 if (off + sizeof(struct fileIdentDesc) > blksize)
217 fi = (struct fileIdentDesc *)(iter->bh[0]->b_data + off);
218 /* Need to fetch next block to get name? */
219 if (off + udf_dir_entry_len(fi) > blksize) {
221 err = udf_fiiter_advance_blk(iter);
224 iter->bh[1] = udf_fiiter_bread_blk(iter);
229 if (!buffer_uptodate(iter->bh[1])) {
238 iter->bh[0] = iter->bh[1] = NULL;
242 int udf_fiiter_init(struct udf_fileident_iter *iter, struct inode *dir,
245 struct udf_inode_info *iinfo = UDF_I(dir);
249 iter->bh[0] = iter->bh[1] = NULL;
252 iter->epos.bh = NULL;
255 * When directory is verified, we don't expect directory iteration to
256 * fail and it can be difficult to undo without corrupting filesystem.
257 * So just do not allow memory allocation failures here.
259 iter->namebuf = kmalloc(UDF_NAME_LEN_CS0, GFP_KERNEL | __GFP_NOFAIL);
261 if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
262 err = udf_copy_fi(iter);
266 if (inode_bmap(dir, iter->pos >> dir->i_blkbits, &iter->epos,
267 &iter->eloc, &iter->elen, &iter->loffset) !=
268 (EXT_RECORDED_ALLOCATED >> 30)) {
269 if (pos == dir->i_size)
272 "position %llu not allocated in directory (ino %lu)\n",
273 (unsigned long long)pos, dir->i_ino);
277 err = udf_fiiter_load_bhs(iter);
280 err = udf_copy_fi(iter);
283 udf_fiiter_release(iter);
287 int udf_fiiter_advance(struct udf_fileident_iter *iter)
289 unsigned int oldoff, len;
290 int blksize = 1 << iter->dir->i_blkbits;
293 oldoff = iter->pos & (blksize - 1);
294 len = udf_dir_entry_len(&iter->fi);
296 if (UDF_I(iter->dir)->i_alloc_type != ICBTAG_FLAG_AD_IN_ICB) {
297 if (oldoff + len >= blksize) {
300 /* Next block already loaded? */
302 iter->bh[0] = iter->bh[1];
305 err = udf_fiiter_advance_blk(iter);
310 err = udf_fiiter_load_bhs(iter);
314 return udf_copy_fi(iter);
317 void udf_fiiter_release(struct udf_fileident_iter *iter)
322 iter->bh[0] = iter->bh[1] = NULL;
323 kfree(iter->namebuf);
324 iter->namebuf = NULL;
327 static void udf_copy_to_bufs(void *buf1, int len1, void *buf2, int len2,
328 int off, void *src, int len)
335 copy = min(off + len, len1) - off;
336 memcpy(buf1 + off, src, copy);
342 if (WARN_ON_ONCE(off + len > len2 || !buf2))
344 memcpy(buf2 + off, src, len);
348 static uint16_t udf_crc_fi_bufs(void *buf1, int len1, void *buf2, int len2,
357 copy = min(off + len, len1) - off;
358 crc = crc_itu_t(crc, buf1 + off, copy);
363 if (WARN_ON_ONCE(off + len > len2 || !buf2))
365 crc = crc_itu_t(crc, buf2 + off, len);
370 static void udf_copy_fi_to_bufs(char *buf1, int len1, char *buf2, int len2,
371 int off, struct fileIdentDesc *fi,
372 uint8_t *impuse, uint8_t *name)
376 int crcoff = off + sizeof(struct tag);
377 unsigned int crclen = udf_dir_entry_len(fi) - sizeof(struct tag);
378 char zeros[UDF_NAME_PAD] = {};
379 int endoff = off + udf_dir_entry_len(fi);
381 udf_copy_to_bufs(buf1, len1, buf2, len2, off, fi,
382 sizeof(struct fileIdentDesc));
383 off += sizeof(struct fileIdentDesc);
385 udf_copy_to_bufs(buf1, len1, buf2, len2, off, impuse,
386 le16_to_cpu(fi->lengthOfImpUse));
387 off += le16_to_cpu(fi->lengthOfImpUse);
389 udf_copy_to_bufs(buf1, len1, buf2, len2, off, name,
390 fi->lengthFileIdent);
391 off += fi->lengthFileIdent;
392 udf_copy_to_bufs(buf1, len1, buf2, len2, off, zeros,
396 crc = udf_crc_fi_bufs(buf1, len1, buf2, len2, crcoff, crclen);
397 fi->descTag.descCRC = cpu_to_le16(crc);
398 fi->descTag.descCRCLength = cpu_to_le16(crclen);
399 fi->descTag.tagChecksum = udf_tag_checksum(&fi->descTag);
401 udf_copy_to_bufs(buf1, len1, buf2, len2, fioff, fi, sizeof(struct tag));
404 void udf_fiiter_write_fi(struct udf_fileident_iter *iter, uint8_t *impuse)
406 struct udf_inode_info *iinfo = UDF_I(iter->dir);
407 void *buf1, *buf2 = NULL;
408 int len1, len2 = 0, off;
409 int blksize = 1 << iter->dir->i_blkbits;
411 off = iter->pos & (blksize - 1);
412 if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
413 buf1 = iinfo->i_data + iinfo->i_lenEAttr;
414 len1 = iter->dir->i_size;
416 buf1 = iter->bh[0]->b_data;
419 buf2 = iter->bh[1]->b_data;
424 udf_copy_fi_to_bufs(buf1, len1, buf2, len2, off, &iter->fi, impuse,
425 iter->name == iter->namebuf ? iter->name : NULL);
427 if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB) {
428 mark_inode_dirty(iter->dir);
430 mark_buffer_dirty_inode(iter->bh[0], iter->dir);
432 mark_buffer_dirty_inode(iter->bh[1], iter->dir);
434 inode_inc_iversion(iter->dir);
437 void udf_fiiter_update_elen(struct udf_fileident_iter *iter, uint32_t new_elen)
439 struct udf_inode_info *iinfo = UDF_I(iter->dir);
440 int diff = new_elen - iter->elen;
442 /* Skip update when we already went past the last extent */
445 iter->elen = new_elen;
446 if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_SHORT)
447 iter->epos.offset -= sizeof(struct short_ad);
448 else if (iinfo->i_alloc_type == ICBTAG_FLAG_AD_LONG)
449 iter->epos.offset -= sizeof(struct long_ad);
450 udf_write_aext(iter->dir, &iter->epos, &iter->eloc, iter->elen, 1);
451 iinfo->i_lenExtents += diff;
452 mark_inode_dirty(iter->dir);
455 /* Append new block to directory. @iter is expected to point at EOF */
456 int udf_fiiter_append_blk(struct udf_fileident_iter *iter)
458 struct udf_inode_info *iinfo = UDF_I(iter->dir);
459 int blksize = 1 << iter->dir->i_blkbits;
460 struct buffer_head *bh;
462 uint32_t old_elen = iter->elen;
465 if (WARN_ON_ONCE(iinfo->i_alloc_type == ICBTAG_FLAG_AD_IN_ICB))
468 /* Round up last extent in the file */
469 udf_fiiter_update_elen(iter, ALIGN(iter->elen, blksize));
471 /* Allocate new block and refresh mapping information */
472 block = iinfo->i_lenExtents >> iter->dir->i_blkbits;
473 bh = udf_bread(iter->dir, block, 1, &err);
475 udf_fiiter_update_elen(iter, old_elen);
478 if (inode_bmap(iter->dir, block, &iter->epos, &iter->eloc, &iter->elen,
479 &iter->loffset) != (EXT_RECORDED_ALLOCATED >> 30)) {
480 udf_err(iter->dir->i_sb,
481 "block %llu not allocated in directory (ino %lu)\n",
482 (unsigned long long)block, iter->dir->i_ino);
483 return -EFSCORRUPTED;
485 if (!(iter->pos & (blksize - 1))) {
494 struct short_ad *udf_get_fileshortad(uint8_t *ptr, int maxoffset, uint32_t *offset,
499 if ((!ptr) || (!offset)) {
500 pr_err("%s: invalidparms\n", __func__);
504 if ((*offset + sizeof(struct short_ad)) > maxoffset)
507 sa = (struct short_ad *)ptr;
508 if (sa->extLength == 0)
513 *offset += sizeof(struct short_ad);
517 struct long_ad *udf_get_filelongad(uint8_t *ptr, int maxoffset, uint32_t *offset, int inc)
521 if ((!ptr) || (!offset)) {
522 pr_err("%s: invalidparms\n", __func__);
526 if ((*offset + sizeof(struct long_ad)) > maxoffset)
529 la = (struct long_ad *)ptr;
530 if (la->extLength == 0)
535 *offset += sizeof(struct long_ad);