Loading...
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * linux/fs/ext2/dir.c
4 *
5 * Copyright (C) 1992, 1993, 1994, 1995
6 * Remy Card (card@masi.ibp.fr)
7 * Laboratoire MASI - Institut Blaise Pascal
8 * Universite Pierre et Marie Curie (Paris VI)
9 *
10 * from
11 *
12 * linux/fs/minix/dir.c
13 *
14 * Copyright (C) 1991, 1992 Linus Torvalds
15 *
16 * ext2 directory handling functions
17 *
18 * Big-endian to little-endian byte-swapping/bitmaps by
19 * David S. Miller (davem@caip.rutgers.edu), 1995
20 *
21 * All code that works with directory layout had been switched to pagecache
22 * and moved here. AV
23 */
24
25#include "ext2.h"
26#include <linux/buffer_head.h>
27#include <linux/pagemap.h>
28#include <linux/swap.h>
29#include <linux/iversion.h>
30
31typedef struct ext2_dir_entry_2 ext2_dirent;
32
33/*
34 * Tests against MAX_REC_LEN etc were put in place for 64k block
35 * sizes; if that is not possible on this arch, we can skip
36 * those tests and speed things up.
37 */
38static inline unsigned ext2_rec_len_from_disk(__le16 dlen)
39{
40 unsigned len = le16_to_cpu(dlen);
41
42#if (PAGE_SIZE >= 65536)
43 if (len == EXT2_MAX_REC_LEN)
44 return 1 << 16;
45#endif
46 return len;
47}
48
49static inline __le16 ext2_rec_len_to_disk(unsigned len)
50{
51#if (PAGE_SIZE >= 65536)
52 if (len == (1 << 16))
53 return cpu_to_le16(EXT2_MAX_REC_LEN);
54 else
55 BUG_ON(len > (1 << 16));
56#endif
57 return cpu_to_le16(len);
58}
59
60/*
61 * ext2 uses block-sized chunks. Arguably, sector-sized ones would be
62 * more robust, but we have what we have
63 */
64static inline unsigned ext2_chunk_size(struct inode *inode)
65{
66 return inode->i_sb->s_blocksize;
67}
68
69/*
70 * Return the offset into page `page_nr' of the last valid
71 * byte in that page, plus one.
72 */
73static unsigned
74ext2_last_byte(struct inode *inode, unsigned long page_nr)
75{
76 unsigned last_byte = inode->i_size;
77
78 last_byte -= page_nr << PAGE_SHIFT;
79 if (last_byte > PAGE_SIZE)
80 last_byte = PAGE_SIZE;
81 return last_byte;
82}
83
84static void ext2_commit_chunk(struct folio *folio, loff_t pos, unsigned len)
85{
86 struct address_space *mapping = folio->mapping;
87 struct inode *dir = mapping->host;
88
89 inode_inc_iversion(dir);
90 block_write_end(NULL, mapping, pos, len, len, folio, NULL);
91
92 if (pos+len > dir->i_size) {
93 i_size_write(dir, pos+len);
94 mark_inode_dirty(dir);
95 }
96 folio_unlock(folio);
97}
98
99static bool ext2_check_folio(struct folio *folio, int quiet, char *kaddr)
100{
101 struct inode *dir = folio->mapping->host;
102 struct super_block *sb = dir->i_sb;
103 unsigned chunk_size = ext2_chunk_size(dir);
104 u32 max_inumber = le32_to_cpu(EXT2_SB(sb)->s_es->s_inodes_count);
105 unsigned offs, rec_len;
106 unsigned limit = folio_size(folio);
107 ext2_dirent *p;
108 char *error;
109
110 if (dir->i_size < folio_pos(folio) + limit) {
111 limit = offset_in_folio(folio, dir->i_size);
112 if (limit & (chunk_size - 1))
113 goto Ebadsize;
114 if (!limit)
115 goto out;
116 }
117 for (offs = 0; offs <= limit - EXT2_DIR_REC_LEN(1); offs += rec_len) {
118 p = (ext2_dirent *)(kaddr + offs);
119 rec_len = ext2_rec_len_from_disk(p->rec_len);
120
121 if (unlikely(rec_len < EXT2_DIR_REC_LEN(1)))
122 goto Eshort;
123 if (unlikely(rec_len & 3))
124 goto Ealign;
125 if (unlikely(rec_len < EXT2_DIR_REC_LEN(p->name_len)))
126 goto Enamelen;
127 if (unlikely(((offs + rec_len - 1) ^ offs) & ~(chunk_size-1)))
128 goto Espan;
129 if (unlikely(le32_to_cpu(p->inode) > max_inumber))
130 goto Einumber;
131 }
132 if (offs != limit)
133 goto Eend;
134out:
135 folio_set_checked(folio);
136 return true;
137
138 /* Too bad, we had an error */
139
140Ebadsize:
141 if (!quiet)
142 ext2_error(sb, __func__,
143 "size of directory #%lu is not a multiple "
144 "of chunk size", dir->i_ino);
145 goto fail;
146Eshort:
147 error = "rec_len is smaller than minimal";
148 goto bad_entry;
149Ealign:
150 error = "unaligned directory entry";
151 goto bad_entry;
152Enamelen:
153 error = "rec_len is too small for name_len";
154 goto bad_entry;
155Espan:
156 error = "directory entry across blocks";
157 goto bad_entry;
158Einumber:
159 error = "inode out of bounds";
160bad_entry:
161 if (!quiet)
162 ext2_error(sb, __func__, "bad entry in directory #%lu: : %s - "
163 "offset=%llu, inode=%lu, rec_len=%d, name_len=%d",
164 dir->i_ino, error, folio_pos(folio) + offs,
165 (unsigned long) le32_to_cpu(p->inode),
166 rec_len, p->name_len);
167 goto fail;
168Eend:
169 if (!quiet) {
170 p = (ext2_dirent *)(kaddr + offs);
171 ext2_error(sb, "ext2_check_folio",
172 "entry in directory #%lu spans the page boundary"
173 "offset=%llu, inode=%lu",
174 dir->i_ino, folio_pos(folio) + offs,
175 (unsigned long) le32_to_cpu(p->inode));
176 }
177fail:
178 return false;
179}
180
181/*
182 * Calls to ext2_get_folio()/folio_release_kmap() must be nested according
183 * to the rules documented in kmap_local_folio()/kunmap_local().
184 *
185 * NOTE: ext2_find_entry() and ext2_dotdot() act as a call
186 * to folio_release_kmap() and should be treated as a call to
187 * folio_release_kmap() for nesting purposes.
188 */
189static void *ext2_get_folio(struct inode *dir, unsigned long n,
190 int quiet, struct folio **foliop)
191{
192 struct address_space *mapping = dir->i_mapping;
193 struct folio *folio = read_mapping_folio(mapping, n, NULL);
194 void *kaddr;
195
196 if (IS_ERR(folio))
197 return ERR_CAST(folio);
198 kaddr = kmap_local_folio(folio, 0);
199 if (unlikely(!folio_test_checked(folio))) {
200 if (!ext2_check_folio(folio, quiet, kaddr))
201 goto fail;
202 }
203 *foliop = folio;
204 return kaddr;
205
206fail:
207 folio_release_kmap(folio, kaddr);
208 return ERR_PTR(-EIO);
209}
210
211/*
212 * NOTE! unlike strncmp, ext2_match returns 1 for success, 0 for failure.
213 *
214 * len <= EXT2_NAME_LEN and de != NULL are guaranteed by caller.
215 */
216static inline int ext2_match (int len, const char * const name,
217 struct ext2_dir_entry_2 * de)
218{
219 if (len != de->name_len)
220 return 0;
221 if (!de->inode)
222 return 0;
223 return !memcmp(name, de->name, len);
224}
225
226/*
227 * p is at least 6 bytes before the end of page
228 */
229static inline ext2_dirent *ext2_next_entry(ext2_dirent *p)
230{
231 return (ext2_dirent *)((char *)p +
232 ext2_rec_len_from_disk(p->rec_len));
233}
234
235static inline unsigned
236ext2_validate_entry(char *base, unsigned offset, unsigned mask)
237{
238 ext2_dirent *de = (ext2_dirent*)(base + offset);
239 ext2_dirent *p = (ext2_dirent*)(base + (offset&mask));
240 while ((char*)p < (char*)de) {
241 if (p->rec_len == 0)
242 break;
243 p = ext2_next_entry(p);
244 }
245 return offset_in_page(p);
246}
247
248static inline void ext2_set_de_type(ext2_dirent *de, struct inode *inode)
249{
250 if (EXT2_HAS_INCOMPAT_FEATURE(inode->i_sb, EXT2_FEATURE_INCOMPAT_FILETYPE))
251 de->file_type = fs_umode_to_ftype(inode->i_mode);
252 else
253 de->file_type = 0;
254}
255
256static int
257ext2_readdir(struct file *file, struct dir_context *ctx)
258{
259 loff_t pos = ctx->pos;
260 struct inode *inode = file_inode(file);
261 struct super_block *sb = inode->i_sb;
262 unsigned int offset = pos & ~PAGE_MASK;
263 unsigned long n = pos >> PAGE_SHIFT;
264 unsigned long npages = dir_pages(inode);
265 unsigned chunk_mask = ~(ext2_chunk_size(inode)-1);
266 bool need_revalidate = !inode_eq_iversion(inode, *(u64 *)file->private_data);
267 bool has_filetype;
268
269 if (pos > inode->i_size - EXT2_DIR_REC_LEN(1))
270 return 0;
271
272 has_filetype =
273 EXT2_HAS_INCOMPAT_FEATURE(sb, EXT2_FEATURE_INCOMPAT_FILETYPE);
274
275 for ( ; n < npages; n++, offset = 0) {
276 ext2_dirent *de;
277 struct folio *folio;
278 char *kaddr = ext2_get_folio(inode, n, 0, &folio);
279 char *limit;
280
281 if (IS_ERR(kaddr)) {
282 ext2_error(sb, __func__,
283 "bad page in #%lu",
284 inode->i_ino);
285 ctx->pos += PAGE_SIZE - offset;
286 return PTR_ERR(kaddr);
287 }
288 if (unlikely(need_revalidate)) {
289 if (offset) {
290 offset = ext2_validate_entry(kaddr, offset, chunk_mask);
291 ctx->pos = (n<<PAGE_SHIFT) + offset;
292 }
293 *(u64 *)file->private_data = inode_query_iversion(inode);
294 need_revalidate = false;
295 }
296 de = (ext2_dirent *)(kaddr+offset);
297 limit = kaddr + ext2_last_byte(inode, n) - EXT2_DIR_REC_LEN(1);
298 for ( ;(char*)de <= limit; de = ext2_next_entry(de)) {
299 if (de->rec_len == 0) {
300 ext2_error(sb, __func__,
301 "zero-length directory entry");
302 folio_release_kmap(folio, de);
303 return -EIO;
304 }
305 if (de->inode) {
306 unsigned char d_type = DT_UNKNOWN;
307
308 if (has_filetype)
309 d_type = fs_ftype_to_dtype(de->file_type);
310
311 if (!dir_emit(ctx, de->name, de->name_len,
312 le32_to_cpu(de->inode),
313 d_type)) {
314 folio_release_kmap(folio, de);
315 return 0;
316 }
317 }
318 ctx->pos += ext2_rec_len_from_disk(de->rec_len);
319 }
320 folio_release_kmap(folio, kaddr);
321 }
322 return 0;
323}
324
325/*
326 * ext2_find_entry()
327 *
328 * finds an entry in the specified directory with the wanted name. It
329 * returns the page in which the entry was found (as a parameter - res_page),
330 * and the entry itself. Page is returned mapped and unlocked.
331 * Entry is guaranteed to be valid.
332 *
333 * On Success folio_release_kmap() should be called on *foliop.
334 *
335 * NOTE: Calls to ext2_get_folio()/folio_release_kmap() must be nested
336 * according to the rules documented in kmap_local_folio()/kunmap_local().
337 *
338 * ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_folio()
339 * and should be treated as a call to ext2_get_folio() for nesting
340 * purposes.
341 */
342struct ext2_dir_entry_2 *ext2_find_entry (struct inode *dir,
343 const struct qstr *child, struct folio **foliop)
344{
345 const char *name = child->name;
346 int namelen = child->len;
347 unsigned reclen = EXT2_DIR_REC_LEN(namelen);
348 unsigned long start, n;
349 unsigned long npages = dir_pages(dir);
350 struct ext2_inode_info *ei = EXT2_I(dir);
351 ext2_dirent * de;
352
353 if (npages == 0)
354 goto out;
355
356 start = ei->i_dir_start_lookup;
357 if (start >= npages)
358 start = 0;
359 n = start;
360 do {
361 char *kaddr = ext2_get_folio(dir, n, 0, foliop);
362 if (IS_ERR(kaddr))
363 return ERR_CAST(kaddr);
364
365 de = (ext2_dirent *) kaddr;
366 kaddr += ext2_last_byte(dir, n) - reclen;
367 while ((char *) de <= kaddr) {
368 if (de->rec_len == 0) {
369 ext2_error(dir->i_sb, __func__,
370 "zero-length directory entry");
371 folio_release_kmap(*foliop, de);
372 goto out;
373 }
374 if (ext2_match(namelen, name, de))
375 goto found;
376 de = ext2_next_entry(de);
377 }
378 folio_release_kmap(*foliop, kaddr);
379
380 if (++n >= npages)
381 n = 0;
382 /* next folio is past the blocks we've got */
383 if (unlikely(n > (dir->i_blocks >> (PAGE_SHIFT - 9)))) {
384 ext2_error(dir->i_sb, __func__,
385 "dir %lu size %lld exceeds block count %llu",
386 dir->i_ino, dir->i_size,
387 (unsigned long long)dir->i_blocks);
388 goto out;
389 }
390 } while (n != start);
391out:
392 return ERR_PTR(-ENOENT);
393
394found:
395 ei->i_dir_start_lookup = n;
396 return de;
397}
398
399/*
400 * Return the '..' directory entry and the page in which the entry was found
401 * (as a parameter - p).
402 *
403 * On Success folio_release_kmap() should be called on *foliop.
404 *
405 * NOTE: Calls to ext2_get_folio()/folio_release_kmap() must be nested
406 * according to the rules documented in kmap_local_folio()/kunmap_local().
407 *
408 * ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_folio()
409 * and should be treated as a call to ext2_get_folio() for nesting
410 * purposes.
411 */
412struct ext2_dir_entry_2 *ext2_dotdot(struct inode *dir, struct folio **foliop)
413{
414 ext2_dirent *de = ext2_get_folio(dir, 0, 0, foliop);
415
416 if (!IS_ERR(de))
417 return ext2_next_entry(de);
418 return NULL;
419}
420
421int ext2_inode_by_name(struct inode *dir, const struct qstr *child, ino_t *ino)
422{
423 struct ext2_dir_entry_2 *de;
424 struct folio *folio;
425
426 de = ext2_find_entry(dir, child, &folio);
427 if (IS_ERR(de))
428 return PTR_ERR(de);
429
430 *ino = le32_to_cpu(de->inode);
431 folio_release_kmap(folio, de);
432 return 0;
433}
434
435static int ext2_prepare_chunk(struct folio *folio, loff_t pos, unsigned len)
436{
437 return __block_write_begin(folio, pos, len, ext2_get_block);
438}
439
440static int ext2_handle_dirsync(struct inode *dir)
441{
442 int err;
443
444 err = filemap_write_and_wait(dir->i_mapping);
445 if (!err)
446 err = sync_inode_metadata(dir, 1);
447 return err;
448}
449
450int ext2_set_link(struct inode *dir, struct ext2_dir_entry_2 *de,
451 struct folio *folio, struct inode *inode, bool update_times)
452{
453 loff_t pos = folio_pos(folio) + offset_in_folio(folio, de);
454 unsigned len = ext2_rec_len_from_disk(de->rec_len);
455 int err;
456
457 folio_lock(folio);
458 err = ext2_prepare_chunk(folio, pos, len);
459 if (err) {
460 folio_unlock(folio);
461 return err;
462 }
463 de->inode = cpu_to_le32(inode->i_ino);
464 ext2_set_de_type(de, inode);
465 ext2_commit_chunk(folio, pos, len);
466 if (update_times)
467 inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
468 EXT2_I(dir)->i_flags &= ~EXT2_BTREE_FL;
469 mark_inode_dirty(dir);
470 return ext2_handle_dirsync(dir);
471}
472
473/*
474 * Parent is locked.
475 */
476int ext2_add_link (struct dentry *dentry, struct inode *inode)
477{
478 struct inode *dir = d_inode(dentry->d_parent);
479 const char *name = dentry->d_name.name;
480 int namelen = dentry->d_name.len;
481 unsigned chunk_size = ext2_chunk_size(dir);
482 unsigned reclen = EXT2_DIR_REC_LEN(namelen);
483 unsigned short rec_len, name_len;
484 struct folio *folio = NULL;
485 ext2_dirent * de;
486 unsigned long npages = dir_pages(dir);
487 unsigned long n;
488 loff_t pos;
489 int err;
490
491 /*
492 * We take care of directory expansion in the same loop.
493 * This code plays outside i_size, so it locks the folio
494 * to protect that region.
495 */
496 for (n = 0; n <= npages; n++) {
497 char *kaddr = ext2_get_folio(dir, n, 0, &folio);
498 char *dir_end;
499
500 if (IS_ERR(kaddr))
501 return PTR_ERR(kaddr);
502 folio_lock(folio);
503 dir_end = kaddr + ext2_last_byte(dir, n);
504 de = (ext2_dirent *)kaddr;
505 kaddr += folio_size(folio) - reclen;
506 while ((char *)de <= kaddr) {
507 if ((char *)de == dir_end) {
508 /* We hit i_size */
509 name_len = 0;
510 rec_len = chunk_size;
511 de->rec_len = ext2_rec_len_to_disk(chunk_size);
512 de->inode = 0;
513 goto got_it;
514 }
515 if (de->rec_len == 0) {
516 ext2_error(dir->i_sb, __func__,
517 "zero-length directory entry");
518 err = -EIO;
519 goto out_unlock;
520 }
521 err = -EEXIST;
522 if (ext2_match (namelen, name, de))
523 goto out_unlock;
524 name_len = EXT2_DIR_REC_LEN(de->name_len);
525 rec_len = ext2_rec_len_from_disk(de->rec_len);
526 if (!de->inode && rec_len >= reclen)
527 goto got_it;
528 if (rec_len >= name_len + reclen)
529 goto got_it;
530 de = (ext2_dirent *) ((char *) de + rec_len);
531 }
532 folio_unlock(folio);
533 folio_release_kmap(folio, kaddr);
534 }
535 BUG();
536 return -EINVAL;
537
538got_it:
539 pos = folio_pos(folio) + offset_in_folio(folio, de);
540 err = ext2_prepare_chunk(folio, pos, rec_len);
541 if (err)
542 goto out_unlock;
543 if (de->inode) {
544 ext2_dirent *de1 = (ext2_dirent *) ((char *) de + name_len);
545 de1->rec_len = ext2_rec_len_to_disk(rec_len - name_len);
546 de->rec_len = ext2_rec_len_to_disk(name_len);
547 de = de1;
548 }
549 de->name_len = namelen;
550 memcpy(de->name, name, namelen);
551 de->inode = cpu_to_le32(inode->i_ino);
552 ext2_set_de_type (de, inode);
553 ext2_commit_chunk(folio, pos, rec_len);
554 inode_set_mtime_to_ts(dir, inode_set_ctime_current(dir));
555 EXT2_I(dir)->i_flags &= ~EXT2_BTREE_FL;
556 mark_inode_dirty(dir);
557 err = ext2_handle_dirsync(dir);
558 /* OFFSET_CACHE */
559out_put:
560 folio_release_kmap(folio, de);
561 return err;
562out_unlock:
563 folio_unlock(folio);
564 goto out_put;
565}
566
567/*
568 * ext2_delete_entry deletes a directory entry by merging it with the
569 * previous entry. Page is up-to-date.
570 */
571int ext2_delete_entry(struct ext2_dir_entry_2 *dir, struct folio *folio)
572{
573 struct inode *inode = folio->mapping->host;
574 size_t from, to;
575 char *kaddr;
576 loff_t pos;
577 ext2_dirent *de, *pde = NULL;
578 int err;
579
580 from = offset_in_folio(folio, dir);
581 to = from + ext2_rec_len_from_disk(dir->rec_len);
582 kaddr = (char *)dir - from;
583 from &= ~(ext2_chunk_size(inode)-1);
584 de = (ext2_dirent *)(kaddr + from);
585
586 while ((char*)de < (char*)dir) {
587 if (de->rec_len == 0) {
588 ext2_error(inode->i_sb, __func__,
589 "zero-length directory entry");
590 return -EIO;
591 }
592 pde = de;
593 de = ext2_next_entry(de);
594 }
595 if (pde)
596 from = offset_in_folio(folio, pde);
597 pos = folio_pos(folio) + from;
598 folio_lock(folio);
599 err = ext2_prepare_chunk(folio, pos, to - from);
600 if (err) {
601 folio_unlock(folio);
602 return err;
603 }
604 if (pde)
605 pde->rec_len = ext2_rec_len_to_disk(to - from);
606 dir->inode = 0;
607 ext2_commit_chunk(folio, pos, to - from);
608 inode_set_mtime_to_ts(inode, inode_set_ctime_current(inode));
609 EXT2_I(inode)->i_flags &= ~EXT2_BTREE_FL;
610 mark_inode_dirty(inode);
611 return ext2_handle_dirsync(inode);
612}
613
614/*
615 * Set the first fragment of directory.
616 */
617int ext2_make_empty(struct inode *inode, struct inode *parent)
618{
619 struct folio *folio = filemap_grab_folio(inode->i_mapping, 0);
620 unsigned chunk_size = ext2_chunk_size(inode);
621 struct ext2_dir_entry_2 * de;
622 int err;
623 void *kaddr;
624
625 if (IS_ERR(folio))
626 return PTR_ERR(folio);
627
628 err = ext2_prepare_chunk(folio, 0, chunk_size);
629 if (err) {
630 folio_unlock(folio);
631 goto fail;
632 }
633 kaddr = kmap_local_folio(folio, 0);
634 memset(kaddr, 0, chunk_size);
635 de = (struct ext2_dir_entry_2 *)kaddr;
636 de->name_len = 1;
637 de->rec_len = ext2_rec_len_to_disk(EXT2_DIR_REC_LEN(1));
638 memcpy (de->name, ".\0\0", 4);
639 de->inode = cpu_to_le32(inode->i_ino);
640 ext2_set_de_type (de, inode);
641
642 de = (struct ext2_dir_entry_2 *)(kaddr + EXT2_DIR_REC_LEN(1));
643 de->name_len = 2;
644 de->rec_len = ext2_rec_len_to_disk(chunk_size - EXT2_DIR_REC_LEN(1));
645 de->inode = cpu_to_le32(parent->i_ino);
646 memcpy (de->name, "..\0", 4);
647 ext2_set_de_type (de, inode);
648 kunmap_local(kaddr);
649 ext2_commit_chunk(folio, 0, chunk_size);
650 err = ext2_handle_dirsync(inode);
651fail:
652 folio_put(folio);
653 return err;
654}
655
656/*
657 * routine to check that the specified directory is empty (for rmdir)
658 */
659int ext2_empty_dir(struct inode *inode)
660{
661 struct folio *folio;
662 char *kaddr;
663 unsigned long i, npages = dir_pages(inode);
664
665 for (i = 0; i < npages; i++) {
666 ext2_dirent *de;
667
668 kaddr = ext2_get_folio(inode, i, 0, &folio);
669 if (IS_ERR(kaddr))
670 return 0;
671
672 de = (ext2_dirent *)kaddr;
673 kaddr += ext2_last_byte(inode, i) - EXT2_DIR_REC_LEN(1);
674
675 while ((char *)de <= kaddr) {
676 if (de->rec_len == 0) {
677 ext2_error(inode->i_sb, __func__,
678 "zero-length directory entry");
679 printk("kaddr=%p, de=%p\n", kaddr, de);
680 goto not_empty;
681 }
682 if (de->inode != 0) {
683 /* check for . and .. */
684 if (de->name[0] != '.')
685 goto not_empty;
686 if (de->name_len > 2)
687 goto not_empty;
688 if (de->name_len < 2) {
689 if (de->inode !=
690 cpu_to_le32(inode->i_ino))
691 goto not_empty;
692 } else if (de->name[1] != '.')
693 goto not_empty;
694 }
695 de = ext2_next_entry(de);
696 }
697 folio_release_kmap(folio, kaddr);
698 }
699 return 1;
700
701not_empty:
702 folio_release_kmap(folio, kaddr);
703 return 0;
704}
705
706static int ext2_dir_open(struct inode *inode, struct file *file)
707{
708 file->private_data = kzalloc(sizeof(u64), GFP_KERNEL);
709 if (!file->private_data)
710 return -ENOMEM;
711 return 0;
712}
713
714static int ext2_dir_release(struct inode *inode, struct file *file)
715{
716 kfree(file->private_data);
717 return 0;
718}
719
720static loff_t ext2_dir_llseek(struct file *file, loff_t offset, int whence)
721{
722 return generic_llseek_cookie(file, offset, whence,
723 (u64 *)file->private_data);
724}
725
726const struct file_operations ext2_dir_operations = {
727 .open = ext2_dir_open,
728 .release = ext2_dir_release,
729 .llseek = ext2_dir_llseek,
730 .read = generic_read_dir,
731 .iterate_shared = ext2_readdir,
732 .unlocked_ioctl = ext2_ioctl,
733#ifdef CONFIG_COMPAT
734 .compat_ioctl = ext2_compat_ioctl,
735#endif
736 .fsync = ext2_fsync,
737};
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * linux/fs/ext2/dir.c
4 *
5 * Copyright (C) 1992, 1993, 1994, 1995
6 * Remy Card (card@masi.ibp.fr)
7 * Laboratoire MASI - Institut Blaise Pascal
8 * Universite Pierre et Marie Curie (Paris VI)
9 *
10 * from
11 *
12 * linux/fs/minix/dir.c
13 *
14 * Copyright (C) 1991, 1992 Linus Torvalds
15 *
16 * ext2 directory handling functions
17 *
18 * Big-endian to little-endian byte-swapping/bitmaps by
19 * David S. Miller (davem@caip.rutgers.edu), 1995
20 *
21 * All code that works with directory layout had been switched to pagecache
22 * and moved here. AV
23 */
24
25#include "ext2.h"
26#include <linux/buffer_head.h>
27#include <linux/pagemap.h>
28#include <linux/swap.h>
29#include <linux/iversion.h>
30
31typedef struct ext2_dir_entry_2 ext2_dirent;
32
33/*
34 * Tests against MAX_REC_LEN etc were put in place for 64k block
35 * sizes; if that is not possible on this arch, we can skip
36 * those tests and speed things up.
37 */
38static inline unsigned ext2_rec_len_from_disk(__le16 dlen)
39{
40 unsigned len = le16_to_cpu(dlen);
41
42#if (PAGE_SIZE >= 65536)
43 if (len == EXT2_MAX_REC_LEN)
44 return 1 << 16;
45#endif
46 return len;
47}
48
49static inline __le16 ext2_rec_len_to_disk(unsigned len)
50{
51#if (PAGE_SIZE >= 65536)
52 if (len == (1 << 16))
53 return cpu_to_le16(EXT2_MAX_REC_LEN);
54 else
55 BUG_ON(len > (1 << 16));
56#endif
57 return cpu_to_le16(len);
58}
59
60/*
61 * ext2 uses block-sized chunks. Arguably, sector-sized ones would be
62 * more robust, but we have what we have
63 */
64static inline unsigned ext2_chunk_size(struct inode *inode)
65{
66 return inode->i_sb->s_blocksize;
67}
68
69/*
70 * Return the offset into page `page_nr' of the last valid
71 * byte in that page, plus one.
72 */
73static unsigned
74ext2_last_byte(struct inode *inode, unsigned long page_nr)
75{
76 unsigned last_byte = inode->i_size;
77
78 last_byte -= page_nr << PAGE_SHIFT;
79 if (last_byte > PAGE_SIZE)
80 last_byte = PAGE_SIZE;
81 return last_byte;
82}
83
84static int ext2_commit_chunk(struct page *page, loff_t pos, unsigned len)
85{
86 struct address_space *mapping = page->mapping;
87 struct inode *dir = mapping->host;
88 int err = 0;
89
90 inode_inc_iversion(dir);
91 block_write_end(NULL, mapping, pos, len, len, page, NULL);
92
93 if (pos+len > dir->i_size) {
94 i_size_write(dir, pos+len);
95 mark_inode_dirty(dir);
96 }
97
98 if (IS_DIRSYNC(dir)) {
99 err = write_one_page(page);
100 if (!err)
101 err = sync_inode_metadata(dir, 1);
102 } else {
103 unlock_page(page);
104 }
105
106 return err;
107}
108
109static bool ext2_check_page(struct page *page, int quiet, char *kaddr)
110{
111 struct inode *dir = page->mapping->host;
112 struct super_block *sb = dir->i_sb;
113 unsigned chunk_size = ext2_chunk_size(dir);
114 u32 max_inumber = le32_to_cpu(EXT2_SB(sb)->s_es->s_inodes_count);
115 unsigned offs, rec_len;
116 unsigned limit = PAGE_SIZE;
117 ext2_dirent *p;
118 char *error;
119
120 if ((dir->i_size >> PAGE_SHIFT) == page->index) {
121 limit = dir->i_size & ~PAGE_MASK;
122 if (limit & (chunk_size - 1))
123 goto Ebadsize;
124 if (!limit)
125 goto out;
126 }
127 for (offs = 0; offs <= limit - EXT2_DIR_REC_LEN(1); offs += rec_len) {
128 p = (ext2_dirent *)(kaddr + offs);
129 rec_len = ext2_rec_len_from_disk(p->rec_len);
130
131 if (unlikely(rec_len < EXT2_DIR_REC_LEN(1)))
132 goto Eshort;
133 if (unlikely(rec_len & 3))
134 goto Ealign;
135 if (unlikely(rec_len < EXT2_DIR_REC_LEN(p->name_len)))
136 goto Enamelen;
137 if (unlikely(((offs + rec_len - 1) ^ offs) & ~(chunk_size-1)))
138 goto Espan;
139 if (unlikely(le32_to_cpu(p->inode) > max_inumber))
140 goto Einumber;
141 }
142 if (offs != limit)
143 goto Eend;
144out:
145 SetPageChecked(page);
146 return true;
147
148 /* Too bad, we had an error */
149
150Ebadsize:
151 if (!quiet)
152 ext2_error(sb, __func__,
153 "size of directory #%lu is not a multiple "
154 "of chunk size", dir->i_ino);
155 goto fail;
156Eshort:
157 error = "rec_len is smaller than minimal";
158 goto bad_entry;
159Ealign:
160 error = "unaligned directory entry";
161 goto bad_entry;
162Enamelen:
163 error = "rec_len is too small for name_len";
164 goto bad_entry;
165Espan:
166 error = "directory entry across blocks";
167 goto bad_entry;
168Einumber:
169 error = "inode out of bounds";
170bad_entry:
171 if (!quiet)
172 ext2_error(sb, __func__, "bad entry in directory #%lu: : %s - "
173 "offset=%lu, inode=%lu, rec_len=%d, name_len=%d",
174 dir->i_ino, error, (page->index<<PAGE_SHIFT)+offs,
175 (unsigned long) le32_to_cpu(p->inode),
176 rec_len, p->name_len);
177 goto fail;
178Eend:
179 if (!quiet) {
180 p = (ext2_dirent *)(kaddr + offs);
181 ext2_error(sb, "ext2_check_page",
182 "entry in directory #%lu spans the page boundary"
183 "offset=%lu, inode=%lu",
184 dir->i_ino, (page->index<<PAGE_SHIFT)+offs,
185 (unsigned long) le32_to_cpu(p->inode));
186 }
187fail:
188 SetPageError(page);
189 return false;
190}
191
192/*
193 * Calls to ext2_get_page()/ext2_put_page() must be nested according to the
194 * rules documented in kmap_local_page()/kunmap_local().
195 *
196 * NOTE: ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_page()
197 * and should be treated as a call to ext2_get_page() for nesting purposes.
198 */
199static struct page * ext2_get_page(struct inode *dir, unsigned long n,
200 int quiet, void **page_addr)
201{
202 struct address_space *mapping = dir->i_mapping;
203 struct page *page = read_mapping_page(mapping, n, NULL);
204 if (!IS_ERR(page)) {
205 *page_addr = kmap_local_page(page);
206 if (unlikely(!PageChecked(page))) {
207 if (PageError(page) || !ext2_check_page(page, quiet,
208 *page_addr))
209 goto fail;
210 }
211 }
212 return page;
213
214fail:
215 ext2_put_page(page, *page_addr);
216 return ERR_PTR(-EIO);
217}
218
219/*
220 * NOTE! unlike strncmp, ext2_match returns 1 for success, 0 for failure.
221 *
222 * len <= EXT2_NAME_LEN and de != NULL are guaranteed by caller.
223 */
224static inline int ext2_match (int len, const char * const name,
225 struct ext2_dir_entry_2 * de)
226{
227 if (len != de->name_len)
228 return 0;
229 if (!de->inode)
230 return 0;
231 return !memcmp(name, de->name, len);
232}
233
234/*
235 * p is at least 6 bytes before the end of page
236 */
237static inline ext2_dirent *ext2_next_entry(ext2_dirent *p)
238{
239 return (ext2_dirent *)((char *)p +
240 ext2_rec_len_from_disk(p->rec_len));
241}
242
243static inline unsigned
244ext2_validate_entry(char *base, unsigned offset, unsigned mask)
245{
246 ext2_dirent *de = (ext2_dirent*)(base + offset);
247 ext2_dirent *p = (ext2_dirent*)(base + (offset&mask));
248 while ((char*)p < (char*)de) {
249 if (p->rec_len == 0)
250 break;
251 p = ext2_next_entry(p);
252 }
253 return (char *)p - base;
254}
255
256static inline void ext2_set_de_type(ext2_dirent *de, struct inode *inode)
257{
258 if (EXT2_HAS_INCOMPAT_FEATURE(inode->i_sb, EXT2_FEATURE_INCOMPAT_FILETYPE))
259 de->file_type = fs_umode_to_ftype(inode->i_mode);
260 else
261 de->file_type = 0;
262}
263
264static int
265ext2_readdir(struct file *file, struct dir_context *ctx)
266{
267 loff_t pos = ctx->pos;
268 struct inode *inode = file_inode(file);
269 struct super_block *sb = inode->i_sb;
270 unsigned int offset = pos & ~PAGE_MASK;
271 unsigned long n = pos >> PAGE_SHIFT;
272 unsigned long npages = dir_pages(inode);
273 unsigned chunk_mask = ~(ext2_chunk_size(inode)-1);
274 bool need_revalidate = !inode_eq_iversion(inode, file->f_version);
275 bool has_filetype;
276
277 if (pos > inode->i_size - EXT2_DIR_REC_LEN(1))
278 return 0;
279
280 has_filetype =
281 EXT2_HAS_INCOMPAT_FEATURE(sb, EXT2_FEATURE_INCOMPAT_FILETYPE);
282
283 for ( ; n < npages; n++, offset = 0) {
284 char *kaddr, *limit;
285 ext2_dirent *de;
286 struct page *page = ext2_get_page(inode, n, 0, (void **)&kaddr);
287
288 if (IS_ERR(page)) {
289 ext2_error(sb, __func__,
290 "bad page in #%lu",
291 inode->i_ino);
292 ctx->pos += PAGE_SIZE - offset;
293 return PTR_ERR(page);
294 }
295 if (unlikely(need_revalidate)) {
296 if (offset) {
297 offset = ext2_validate_entry(kaddr, offset, chunk_mask);
298 ctx->pos = (n<<PAGE_SHIFT) + offset;
299 }
300 file->f_version = inode_query_iversion(inode);
301 need_revalidate = false;
302 }
303 de = (ext2_dirent *)(kaddr+offset);
304 limit = kaddr + ext2_last_byte(inode, n) - EXT2_DIR_REC_LEN(1);
305 for ( ;(char*)de <= limit; de = ext2_next_entry(de)) {
306 if (de->rec_len == 0) {
307 ext2_error(sb, __func__,
308 "zero-length directory entry");
309 ext2_put_page(page, kaddr);
310 return -EIO;
311 }
312 if (de->inode) {
313 unsigned char d_type = DT_UNKNOWN;
314
315 if (has_filetype)
316 d_type = fs_ftype_to_dtype(de->file_type);
317
318 if (!dir_emit(ctx, de->name, de->name_len,
319 le32_to_cpu(de->inode),
320 d_type)) {
321 ext2_put_page(page, kaddr);
322 return 0;
323 }
324 }
325 ctx->pos += ext2_rec_len_from_disk(de->rec_len);
326 }
327 ext2_put_page(page, kaddr);
328 }
329 return 0;
330}
331
332/*
333 * ext2_find_entry()
334 *
335 * finds an entry in the specified directory with the wanted name. It
336 * returns the page in which the entry was found (as a parameter - res_page),
337 * and the entry itself. Page is returned mapped and unlocked.
338 * Entry is guaranteed to be valid.
339 *
340 * On Success ext2_put_page() should be called on *res_page.
341 *
342 * NOTE: Calls to ext2_get_page()/ext2_put_page() must be nested according to
343 * the rules documented in kmap_local_page()/kunmap_local().
344 *
345 * ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_page() and
346 * should be treated as a call to ext2_get_page() for nesting purposes.
347 */
348struct ext2_dir_entry_2 *ext2_find_entry (struct inode *dir,
349 const struct qstr *child, struct page **res_page,
350 void **res_page_addr)
351{
352 const char *name = child->name;
353 int namelen = child->len;
354 unsigned reclen = EXT2_DIR_REC_LEN(namelen);
355 unsigned long start, n;
356 unsigned long npages = dir_pages(dir);
357 struct page *page = NULL;
358 struct ext2_inode_info *ei = EXT2_I(dir);
359 ext2_dirent * de;
360 void *page_addr;
361
362 if (npages == 0)
363 goto out;
364
365 /* OFFSET_CACHE */
366 *res_page = NULL;
367 *res_page_addr = NULL;
368
369 start = ei->i_dir_start_lookup;
370 if (start >= npages)
371 start = 0;
372 n = start;
373 do {
374 char *kaddr;
375 page = ext2_get_page(dir, n, 0, &page_addr);
376 if (IS_ERR(page))
377 return ERR_CAST(page);
378
379 kaddr = page_addr;
380 de = (ext2_dirent *) kaddr;
381 kaddr += ext2_last_byte(dir, n) - reclen;
382 while ((char *) de <= kaddr) {
383 if (de->rec_len == 0) {
384 ext2_error(dir->i_sb, __func__,
385 "zero-length directory entry");
386 ext2_put_page(page, page_addr);
387 goto out;
388 }
389 if (ext2_match(namelen, name, de))
390 goto found;
391 de = ext2_next_entry(de);
392 }
393 ext2_put_page(page, page_addr);
394
395 if (++n >= npages)
396 n = 0;
397 /* next page is past the blocks we've got */
398 if (unlikely(n > (dir->i_blocks >> (PAGE_SHIFT - 9)))) {
399 ext2_error(dir->i_sb, __func__,
400 "dir %lu size %lld exceeds block count %llu",
401 dir->i_ino, dir->i_size,
402 (unsigned long long)dir->i_blocks);
403 goto out;
404 }
405 } while (n != start);
406out:
407 return ERR_PTR(-ENOENT);
408
409found:
410 *res_page = page;
411 *res_page_addr = page_addr;
412 ei->i_dir_start_lookup = n;
413 return de;
414}
415
416/**
417 * Return the '..' directory entry and the page in which the entry was found
418 * (as a parameter - p).
419 *
420 * On Success ext2_put_page() should be called on *p.
421 *
422 * NOTE: Calls to ext2_get_page()/ext2_put_page() must be nested according to
423 * the rules documented in kmap_local_page()/kunmap_local().
424 *
425 * ext2_find_entry() and ext2_dotdot() act as a call to ext2_get_page() and
426 * should be treated as a call to ext2_get_page() for nesting purposes.
427 */
428struct ext2_dir_entry_2 *ext2_dotdot(struct inode *dir, struct page **p,
429 void **pa)
430{
431 void *page_addr;
432 struct page *page = ext2_get_page(dir, 0, 0, &page_addr);
433 ext2_dirent *de = NULL;
434
435 if (!IS_ERR(page)) {
436 de = ext2_next_entry((ext2_dirent *) page_addr);
437 *p = page;
438 *pa = page_addr;
439 }
440 return de;
441}
442
443int ext2_inode_by_name(struct inode *dir, const struct qstr *child, ino_t *ino)
444{
445 struct ext2_dir_entry_2 *de;
446 struct page *page;
447 void *page_addr;
448
449 de = ext2_find_entry(dir, child, &page, &page_addr);
450 if (IS_ERR(de))
451 return PTR_ERR(de);
452
453 *ino = le32_to_cpu(de->inode);
454 ext2_put_page(page, page_addr);
455 return 0;
456}
457
458static int ext2_prepare_chunk(struct page *page, loff_t pos, unsigned len)
459{
460 return __block_write_begin(page, pos, len, ext2_get_block);
461}
462
463void ext2_set_link(struct inode *dir, struct ext2_dir_entry_2 *de,
464 struct page *page, void *page_addr, struct inode *inode,
465 int update_times)
466{
467 loff_t pos = page_offset(page) +
468 (char *) de - (char *) page_addr;
469 unsigned len = ext2_rec_len_from_disk(de->rec_len);
470 int err;
471
472 lock_page(page);
473 err = ext2_prepare_chunk(page, pos, len);
474 BUG_ON(err);
475 de->inode = cpu_to_le32(inode->i_ino);
476 ext2_set_de_type(de, inode);
477 err = ext2_commit_chunk(page, pos, len);
478 if (update_times)
479 dir->i_mtime = dir->i_ctime = current_time(dir);
480 EXT2_I(dir)->i_flags &= ~EXT2_BTREE_FL;
481 mark_inode_dirty(dir);
482}
483
484/*
485 * Parent is locked.
486 */
487int ext2_add_link (struct dentry *dentry, struct inode *inode)
488{
489 struct inode *dir = d_inode(dentry->d_parent);
490 const char *name = dentry->d_name.name;
491 int namelen = dentry->d_name.len;
492 unsigned chunk_size = ext2_chunk_size(dir);
493 unsigned reclen = EXT2_DIR_REC_LEN(namelen);
494 unsigned short rec_len, name_len;
495 struct page *page = NULL;
496 void *page_addr = NULL;
497 ext2_dirent * de;
498 unsigned long npages = dir_pages(dir);
499 unsigned long n;
500 loff_t pos;
501 int err;
502
503 /*
504 * We take care of directory expansion in the same loop.
505 * This code plays outside i_size, so it locks the page
506 * to protect that region.
507 */
508 for (n = 0; n <= npages; n++) {
509 char *kaddr;
510 char *dir_end;
511
512 page = ext2_get_page(dir, n, 0, &page_addr);
513 err = PTR_ERR(page);
514 if (IS_ERR(page))
515 goto out;
516 lock_page(page);
517 kaddr = page_addr;
518 dir_end = kaddr + ext2_last_byte(dir, n);
519 de = (ext2_dirent *)kaddr;
520 kaddr += PAGE_SIZE - reclen;
521 while ((char *)de <= kaddr) {
522 if ((char *)de == dir_end) {
523 /* We hit i_size */
524 name_len = 0;
525 rec_len = chunk_size;
526 de->rec_len = ext2_rec_len_to_disk(chunk_size);
527 de->inode = 0;
528 goto got_it;
529 }
530 if (de->rec_len == 0) {
531 ext2_error(dir->i_sb, __func__,
532 "zero-length directory entry");
533 err = -EIO;
534 goto out_unlock;
535 }
536 err = -EEXIST;
537 if (ext2_match (namelen, name, de))
538 goto out_unlock;
539 name_len = EXT2_DIR_REC_LEN(de->name_len);
540 rec_len = ext2_rec_len_from_disk(de->rec_len);
541 if (!de->inode && rec_len >= reclen)
542 goto got_it;
543 if (rec_len >= name_len + reclen)
544 goto got_it;
545 de = (ext2_dirent *) ((char *) de + rec_len);
546 }
547 unlock_page(page);
548 ext2_put_page(page, page_addr);
549 }
550 BUG();
551 return -EINVAL;
552
553got_it:
554 pos = page_offset(page) +
555 (char *)de - (char *)page_addr;
556 err = ext2_prepare_chunk(page, pos, rec_len);
557 if (err)
558 goto out_unlock;
559 if (de->inode) {
560 ext2_dirent *de1 = (ext2_dirent *) ((char *) de + name_len);
561 de1->rec_len = ext2_rec_len_to_disk(rec_len - name_len);
562 de->rec_len = ext2_rec_len_to_disk(name_len);
563 de = de1;
564 }
565 de->name_len = namelen;
566 memcpy(de->name, name, namelen);
567 de->inode = cpu_to_le32(inode->i_ino);
568 ext2_set_de_type (de, inode);
569 err = ext2_commit_chunk(page, pos, rec_len);
570 dir->i_mtime = dir->i_ctime = current_time(dir);
571 EXT2_I(dir)->i_flags &= ~EXT2_BTREE_FL;
572 mark_inode_dirty(dir);
573 /* OFFSET_CACHE */
574out_put:
575 ext2_put_page(page, page_addr);
576out:
577 return err;
578out_unlock:
579 unlock_page(page);
580 goto out_put;
581}
582
583/*
584 * ext2_delete_entry deletes a directory entry by merging it with the
585 * previous entry. Page is up-to-date.
586 */
587int ext2_delete_entry (struct ext2_dir_entry_2 *dir, struct page *page,
588 char *kaddr)
589{
590 struct inode *inode = page->mapping->host;
591 unsigned from = ((char*)dir - kaddr) & ~(ext2_chunk_size(inode)-1);
592 unsigned to = ((char *)dir - kaddr) +
593 ext2_rec_len_from_disk(dir->rec_len);
594 loff_t pos;
595 ext2_dirent * pde = NULL;
596 ext2_dirent * de = (ext2_dirent *) (kaddr + from);
597 int err;
598
599 while ((char*)de < (char*)dir) {
600 if (de->rec_len == 0) {
601 ext2_error(inode->i_sb, __func__,
602 "zero-length directory entry");
603 err = -EIO;
604 goto out;
605 }
606 pde = de;
607 de = ext2_next_entry(de);
608 }
609 if (pde)
610 from = (char *)pde - kaddr;
611 pos = page_offset(page) + from;
612 lock_page(page);
613 err = ext2_prepare_chunk(page, pos, to - from);
614 BUG_ON(err);
615 if (pde)
616 pde->rec_len = ext2_rec_len_to_disk(to - from);
617 dir->inode = 0;
618 err = ext2_commit_chunk(page, pos, to - from);
619 inode->i_ctime = inode->i_mtime = current_time(inode);
620 EXT2_I(inode)->i_flags &= ~EXT2_BTREE_FL;
621 mark_inode_dirty(inode);
622out:
623 return err;
624}
625
626/*
627 * Set the first fragment of directory.
628 */
629int ext2_make_empty(struct inode *inode, struct inode *parent)
630{
631 struct page *page = grab_cache_page(inode->i_mapping, 0);
632 unsigned chunk_size = ext2_chunk_size(inode);
633 struct ext2_dir_entry_2 * de;
634 int err;
635 void *kaddr;
636
637 if (!page)
638 return -ENOMEM;
639
640 err = ext2_prepare_chunk(page, 0, chunk_size);
641 if (err) {
642 unlock_page(page);
643 goto fail;
644 }
645 kaddr = kmap_atomic(page);
646 memset(kaddr, 0, chunk_size);
647 de = (struct ext2_dir_entry_2 *)kaddr;
648 de->name_len = 1;
649 de->rec_len = ext2_rec_len_to_disk(EXT2_DIR_REC_LEN(1));
650 memcpy (de->name, ".\0\0", 4);
651 de->inode = cpu_to_le32(inode->i_ino);
652 ext2_set_de_type (de, inode);
653
654 de = (struct ext2_dir_entry_2 *)(kaddr + EXT2_DIR_REC_LEN(1));
655 de->name_len = 2;
656 de->rec_len = ext2_rec_len_to_disk(chunk_size - EXT2_DIR_REC_LEN(1));
657 de->inode = cpu_to_le32(parent->i_ino);
658 memcpy (de->name, "..\0", 4);
659 ext2_set_de_type (de, inode);
660 kunmap_atomic(kaddr);
661 err = ext2_commit_chunk(page, 0, chunk_size);
662fail:
663 put_page(page);
664 return err;
665}
666
667/*
668 * routine to check that the specified directory is empty (for rmdir)
669 */
670int ext2_empty_dir (struct inode * inode)
671{
672 void *page_addr = NULL;
673 struct page *page = NULL;
674 unsigned long i, npages = dir_pages(inode);
675 int dir_has_error = 0;
676
677 for (i = 0; i < npages; i++) {
678 char *kaddr;
679 ext2_dirent * de;
680 page = ext2_get_page(inode, i, dir_has_error, &page_addr);
681
682 if (IS_ERR(page)) {
683 dir_has_error = 1;
684 continue;
685 }
686
687 kaddr = page_addr;
688 de = (ext2_dirent *)kaddr;
689 kaddr += ext2_last_byte(inode, i) - EXT2_DIR_REC_LEN(1);
690
691 while ((char *)de <= kaddr) {
692 if (de->rec_len == 0) {
693 ext2_error(inode->i_sb, __func__,
694 "zero-length directory entry");
695 printk("kaddr=%p, de=%p\n", kaddr, de);
696 goto not_empty;
697 }
698 if (de->inode != 0) {
699 /* check for . and .. */
700 if (de->name[0] != '.')
701 goto not_empty;
702 if (de->name_len > 2)
703 goto not_empty;
704 if (de->name_len < 2) {
705 if (de->inode !=
706 cpu_to_le32(inode->i_ino))
707 goto not_empty;
708 } else if (de->name[1] != '.')
709 goto not_empty;
710 }
711 de = ext2_next_entry(de);
712 }
713 ext2_put_page(page, page_addr);
714 }
715 return 1;
716
717not_empty:
718 ext2_put_page(page, page_addr);
719 return 0;
720}
721
722const struct file_operations ext2_dir_operations = {
723 .llseek = generic_file_llseek,
724 .read = generic_read_dir,
725 .iterate_shared = ext2_readdir,
726 .unlocked_ioctl = ext2_ioctl,
727#ifdef CONFIG_COMPAT
728 .compat_ioctl = ext2_compat_ioctl,
729#endif
730 .fsync = ext2_fsync,
731};