// SPDX-License-Identifier: GPL-2.0 /* * linux/fs/ext2/dir.c * * Copyright (C) 1992, 1993, 1994, 1995 * Remy Card (card@masi.ibp.fr) * Laboratoire MASI - Institut Blaise Pascal * Universite Pierre et Marie Curie (Paris VI) * * from * * linux/fs/minix/dir.c * * Copyright (C) 1991, 1992 Linus Torvalds * * ext2 directory handling functions * * Big-endian to little-endian byte-swapping/bitmaps by * David S. Miller (davem@caip.rutgers.edu), 1995 * * All code that works with directory layout had been switched to pagecache * and moved here. AV
*/
/* * Tests against MAX_REC_LEN etc were put in place for 64k block * sizes; if that is not possible on this arch, we can skip * those tests and speed things up.
*/ staticinlineunsigned ext2_rec_len_from_disk(__le16 dlen)
{ unsigned len = le16_to_cpu(dlen);
/* * ext2 uses block-sized chunks. Arguably, sector-sized ones would be * more robust, but we have what we have
*/ staticinlineunsigned ext2_chunk_size(struct inode *inode)
{ return inode->i_sb->s_blocksize;
}
/* * Return the offset into page `page_nr' of the last valid * byte in that page, plus one.
*/ staticunsigned
ext2_last_byte(struct inode *inode, unsignedlong page_nr)
{ unsigned last_byte = inode->i_size;
if (dir->i_size < folio_pos(folio) + limit) {
limit = offset_in_folio(folio, dir->i_size); if (limit & (chunk_size - 1)) goto Ebadsize; if (!limit) goto out;
} for (offs = 0; offs <= limit - EXT2_DIR_REC_LEN(1); offs += rec_len) {
p = (ext2_dirent *)(kaddr + offs);
rec_len = ext2_rec_len_from_disk(p->rec_len);
if (unlikely(rec_len < EXT2_DIR_REC_LEN(1))) goto Eshort; if (unlikely(rec_len & 3)) goto Ealign; if (unlikely(rec_len < EXT2_DIR_REC_LEN(p->name_len))) goto Enamelen; if (unlikely(((offs + rec_len - 1) ^ offs) & ~(chunk_size-1))) goto Espan; if (unlikely(le32_to_cpu(p->inode) > max_inumber)) goto Einumber;
} if (offs != limit) goto Eend;
out:
folio_set_checked(folio); returntrue;
/* Too bad, we had an error */
Ebadsize: if (!quiet)
ext2_error(sb, __func__, "size of directory #%lu is not a multiple " "of chunk size", dir->i_ino); goto fail;
Eshort:
error = "rec_len is smaller than minimal"; goto bad_entry;
Ealign:
error = "unaligned directory entry"; goto bad_entry;
Enamelen:
error = "rec_len is too small for name_len"; goto bad_entry;
Espan:
error = "directory entry across blocks"; goto bad_entry;
Einumber:
error = "inode out of bounds";
bad_entry: if (!quiet)
ext2_error(sb, __func__, "bad entry in directory #%lu: : %s - " "offset=%llu, inode=%lu, rec_len=%d, name_len=%d",
dir->i_ino, error, folio_pos(folio) + offs,
(unsignedlong) le32_to_cpu(p->inode),
rec_len, p->name_len); goto fail;
Eend: if (!quiet) {
p = (ext2_dirent *)(kaddr + offs);
ext2_error(sb, "ext2_check_folio", "entry in directory #%lu spans the page boundary" "offset=%llu, inode=%lu",
dir->i_ino, folio_pos(folio) + offs,
(unsignedlong) le32_to_cpu(p->inode));
}
fail: returnfalse;
}
/* * Calls to ext2_get_folio()/folio_release_kmap() must be nested according * to the rules documented in kmap_local_folio()/kunmap_local(). * * NOTE: ext2_find_entry() and ext2_dotdot() act as a call * to folio_release_kmap() and should be treated as a call to * folio_release_kmap() for nesting purposes.
*/ staticvoid *ext2_get_folio(struct inode *dir, unsignedlong n, int quiet, struct folio **foliop)
{ struct address_space *mapping = dir->i_mapping; struct folio *folio = read_mapping_folio(mapping, n, NULL); void *kaddr;
if (IS_ERR(folio)) return ERR_CAST(folio);
kaddr = kmap_local_folio(folio, 0); if (unlikely(!folio_test_checked(folio))) { if (!ext2_check_folio(folio, quiet, kaddr)) goto fail;
}
*foliop = folio; return kaddr;
/* * NOTE! unlike strncmp, ext2_match returns 1 for success, 0 for failure. * * len <= EXT2_NAME_LEN and de != NULL are guaranteed by caller.
*/ staticinlineint ext2_match (int len, constchar * const name, struct ext2_dir_entry_2 * de)
{ if (len != de->name_len) return 0; if (!de->inode) return 0; return !memcmp(name, de->name, len);
}
/* * p is at least 6 bytes before the end of page
*/ staticinline ext2_dirent *ext2_next_entry(ext2_dirent *p)
{ return (ext2_dirent *)((char *)p +
ext2_rec_len_from_disk(p->rec_len));
}
/* * ext2_find_entry() * * finds an entry in the specified directory with the wanted name. It * returns the page in which the entry was found (as a parameter - res_page), * and the entry itself. Page is returned mapped and unlocked. * Entry is guaranteed to be valid. * * On Success folio_release_kmap() should be called on *foliop. * * NOTE: Calls to ext2_get_folio()/folio_release_kmap() must be nested * according to the rules documented in kmap_local_folio()/kunmap_local(). * * ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_folio() * and should be treated as a call to ext2_get_folio() for nesting * purposes.
*/ struct ext2_dir_entry_2 *ext2_find_entry (struct inode *dir, conststruct qstr *child, struct folio **foliop)
{ constchar *name = child->name; int namelen = child->len; unsigned reclen = EXT2_DIR_REC_LEN(namelen); unsignedlong start, n; unsignedlong npages = dir_pages(dir); struct ext2_inode_info *ei = EXT2_I(dir);
ext2_dirent * de;
if (npages == 0) goto out;
start = ei->i_dir_start_lookup; if (start >= npages)
start = 0;
n = start; do { char *kaddr = ext2_get_folio(dir, n, 0, foliop); if (IS_ERR(kaddr)) return ERR_CAST(kaddr);
de = (ext2_dirent *) kaddr;
kaddr += ext2_last_byte(dir, n) - reclen; while ((char *) de <= kaddr) { if (de->rec_len == 0) {
ext2_error(dir->i_sb, __func__, "zero-length directory entry");
folio_release_kmap(*foliop, de); goto out;
} if (ext2_match(namelen, name, de)) goto found;
de = ext2_next_entry(de);
}
folio_release_kmap(*foliop, kaddr);
if (++n >= npages)
n = 0; /* next folio is past the blocks we've got */ if (unlikely(n > (dir->i_blocks >> (PAGE_SHIFT - 9)))) {
ext2_error(dir->i_sb, __func__, "dir %lu size %lld exceeds block count %llu",
dir->i_ino, dir->i_size,
(unsignedlonglong)dir->i_blocks); goto out;
}
} while (n != start);
out: return ERR_PTR(-ENOENT);
found:
ei->i_dir_start_lookup = n; return de;
}
/* * Return the '..' directory entry and the page in which the entry was found * (as a parameter - p). * * On Success folio_release_kmap() should be called on *foliop. * * NOTE: Calls to ext2_get_folio()/folio_release_kmap() must be nested * according to the rules documented in kmap_local_folio()/kunmap_local(). * * ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_folio() * and should be treated as a call to ext2_get_folio() for nesting * purposes.
*/ struct ext2_dir_entry_2 *ext2_dotdot(struct inode *dir, struct folio **foliop)
{
ext2_dirent *de = ext2_get_folio(dir, 0, 0, foliop);
if (!IS_ERR(de)) return ext2_next_entry(de); return NULL;
}
/* * We take care of directory expansion in the same loop. * This code plays outside i_size, so it locks the folio * to protect that region.
*/ for (n = 0; n <= npages; n++) { char *kaddr = ext2_get_folio(dir, n, 0, &folio); char *dir_end;
if (IS_ERR(kaddr)) return PTR_ERR(kaddr);
folio_lock(folio);
dir_end = kaddr + ext2_last_byte(dir, n);
de = (ext2_dirent *)kaddr;
kaddr += folio_size(folio) - reclen; while ((char *)de <= kaddr) { if ((char *)de == dir_end) { /* We hit i_size */
name_len = 0;
rec_len = chunk_size;
de->rec_len = ext2_rec_len_to_disk(chunk_size);
de->inode = 0; goto got_it;
} if (de->rec_len == 0) {
ext2_error(dir->i_sb, __func__, "zero-length directory entry");
err = -EIO; goto out_unlock;
}
err = -EEXIST; if (ext2_match (namelen, name, de)) goto out_unlock;
name_len = EXT2_DIR_REC_LEN(de->name_len);
rec_len = ext2_rec_len_from_disk(de->rec_len); if (!de->inode && rec_len >= reclen) goto got_it; if (rec_len >= name_len + reclen) goto got_it;
de = (ext2_dirent *) ((char *) de + rec_len);
}
folio_unlock(folio);
folio_release_kmap(folio, kaddr);
}
BUG(); return -EINVAL;
/* * ext2_delete_entry deletes a directory entry by merging it with the * previous entry. Page is up-to-date.
*/ int ext2_delete_entry(struct ext2_dir_entry_2 *dir, struct folio *folio)
{ struct inode *inode = folio->mapping->host;
size_t from, to; char *kaddr;
loff_t pos;
ext2_dirent *de, *pde = NULL; int err;
from = offset_in_folio(folio, dir);
to = from + ext2_rec_len_from_disk(dir->rec_len);
kaddr = (char *)dir - from;
from &= ~(ext2_chunk_size(inode)-1);
de = (ext2_dirent *)(kaddr + from);
while ((char*)de < (char*)dir) { if (de->rec_len == 0) {
ext2_error(inode->i_sb, __func__, "zero-length directory entry"); return -EIO;
}
pde = de;
de = ext2_next_entry(de);
} if (pde)
from = offset_in_folio(folio, pde);
pos = folio_pos(folio) + from;
folio_lock(folio);
err = ext2_prepare_chunk(folio, pos, to - from); if (err) {
folio_unlock(folio); return err;
} if (pde)
pde->rec_len = ext2_rec_len_to_disk(to - from);
dir->inode = 0;
ext2_commit_chunk(folio, pos, to - from);
inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
EXT2_I(inode)->i_flags &= ~EXT2_BTREE_FL;
mark_inode_dirty(inode); return ext2_handle_dirsync(inode);
}
/* * Set the first fragment of directory.
*/ int ext2_make_empty(struct inode *inode, struct inode *parent)
{ struct folio *folio = filemap_grab_folio(inode->i_mapping, 0); unsigned chunk_size = ext2_chunk_size(inode); struct ext2_dir_entry_2 * de; int err; void *kaddr;
/* * routine to check that the specified directory is empty (for rmdir)
*/ int ext2_empty_dir(struct inode *inode)
{ struct folio *folio; char *kaddr; unsignedlong i, npages = dir_pages(inode);
for (i = 0; i < npages; i++) {
ext2_dirent *de;
kaddr = ext2_get_folio(inode, i, 0, &folio); if (IS_ERR(kaddr)) return 0;
de = (ext2_dirent *)kaddr;
kaddr += ext2_last_byte(inode, i) - EXT2_DIR_REC_LEN(1);
while ((char *)de <= kaddr) { if (de->rec_len == 0) {
ext2_error(inode->i_sb, __func__, "zero-length directory entry");
printk("kaddr=%p, de=%p\n", kaddr, de); goto not_empty;
} if (de->inode != 0) { /* check for . and .. */ if (de->name[0] != '.') goto not_empty; if (de->name_len > 2) goto not_empty; if (de->name_len < 2) { if (de->inode !=
cpu_to_le32(inode->i_ino)) goto not_empty;
} elseif (de->name[1] != '.') goto not_empty;
}
de = ext2_next_entry(de);
}
folio_release_kmap(folio, kaddr);
} return 1;
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.