1 // SPDX-License-Identifier: GPL-2.0
4 * Copyright (C) 2019-2021 Paragon Software GmbH, All rights reserved.
8 #include <linux/blkdev.h>
9 #include <linux/buffer_head.h>
11 #include <linux/kernel.h>
17 static const struct INDEX_NAMES {
20 } s_index_names[INDEX_MUTEX_TOTAL] = {
21 { I30_NAME, ARRAY_SIZE(I30_NAME) }, { SII_NAME, ARRAY_SIZE(SII_NAME) },
22 { SDH_NAME, ARRAY_SIZE(SDH_NAME) }, { SO_NAME, ARRAY_SIZE(SO_NAME) },
23 { SQ_NAME, ARRAY_SIZE(SQ_NAME) }, { SR_NAME, ARRAY_SIZE(SR_NAME) },
27 * cmp_fnames - Compare two names in index.
30 * Both names are little endian on-disk ATTR_FILE_NAME structs.
32 * key1 - cpu_str, key2 - ATTR_FILE_NAME
34 static int cmp_fnames(const void *key1, size_t l1, const void *key2, size_t l2,
37 const struct ATTR_FILE_NAME *f2 = key2;
38 const struct ntfs_sb_info *sbi = data;
39 const struct ATTR_FILE_NAME *f1;
43 if (l2 <= offsetof(struct ATTR_FILE_NAME, name))
46 fsize2 = fname_full_size(f2);
50 both_case = f2->type != FILE_NAME_DOS /*&& !sbi->options.nocase*/;
52 const struct le_str *s2 = (struct le_str *)&f2->name_len;
55 * If names are equal (case insensitive)
56 * try to compare it case sensitive.
58 return ntfs_cmp_names_cpu(key1, s2, sbi->upcase, both_case);
62 return ntfs_cmp_names(f1->name, f1->name_len, f2->name, f2->name_len,
63 sbi->upcase, both_case);
67 * cmp_uint - $SII of $Secure and $Q of Quota
69 static int cmp_uint(const void *key1, size_t l1, const void *key2, size_t l2,
86 * cmp_sdh - $SDH of $Secure
88 static int cmp_sdh(const void *key1, size_t l1, const void *key2, size_t l2,
91 const struct SECURITY_KEY *k1 = key1;
92 const struct SECURITY_KEY *k2 = key2;
95 if (l2 < sizeof(struct SECURITY_KEY))
98 t1 = le32_to_cpu(k1->hash);
99 t2 = le32_to_cpu(k2->hash);
101 /* First value is a hash value itself. */
107 /* Second value is security Id. */
109 t1 = le32_to_cpu(k1->sec_id);
110 t2 = le32_to_cpu(k2->sec_id);
121 * cmp_uints - $O of ObjId and "$R" for Reparse.
123 static int cmp_uints(const void *key1, size_t l1, const void *key2, size_t l2,
126 const __le32 *k1 = key1;
127 const __le32 *k2 = key2;
130 if ((size_t)data == 1) {
132 * ni_delete_all -> ntfs_remove_reparse ->
133 * delete all with this reference.
134 * k1, k2 - pointers to REPARSE_KEY
137 k1 += 1; // Skip REPARSE_KEY.ReparseTag
138 k2 += 1; // Skip REPARSE_KEY.ReparseTag
139 if (l2 <= sizeof(int))
142 if (l1 <= sizeof(int))
147 if (l2 < sizeof(int))
150 for (count = min(l1, l2) >> 2; count > 0; --count, ++k1, ++k2) {
151 u32 t1 = le32_to_cpu(*k1);
152 u32 t2 = le32_to_cpu(*k2);
168 static inline NTFS_CMP_FUNC get_cmp_func(const struct INDEX_ROOT *root)
170 switch (root->type) {
172 if (root->rule == NTFS_COLLATION_TYPE_FILENAME)
176 switch (root->rule) {
177 case NTFS_COLLATION_TYPE_UINT:
179 case NTFS_COLLATION_TYPE_SECURITY_HASH:
181 case NTFS_COLLATION_TYPE_UINTS:
196 struct mft_inode *mi;
197 struct buffer_head *bh;
204 static int bmp_buf_get(struct ntfs_index *indx, struct ntfs_inode *ni,
205 size_t bit, struct bmp_buf *bbuf)
208 size_t data_size, valid_size, vbo, off = bit >> 3;
209 struct ntfs_sb_info *sbi = ni->mi.sbi;
210 CLST vcn = off >> sbi->cluster_bits;
211 struct ATTR_LIST_ENTRY *le = NULL;
212 struct buffer_head *bh;
213 struct super_block *sb;
215 const struct INDEX_NAMES *in = &s_index_names[indx->type];
219 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
226 data_size = le32_to_cpu(b->res.data_size);
228 if (off >= data_size)
231 bbuf->buf = (ulong *)resident_data(b);
233 bbuf->nbits = data_size * 8;
238 data_size = le64_to_cpu(b->nres.data_size);
239 if (WARN_ON(off >= data_size)) {
240 /* Looks like filesystem error. */
244 valid_size = le64_to_cpu(b->nres.valid_size);
246 bh = ntfs_bread_run(sbi, &indx->bitmap_run, off);
255 if (buffer_locked(bh))
256 __wait_on_buffer(bh);
261 blocksize = sb->s_blocksize;
263 vbo = off & ~(size_t)sbi->block_mask;
265 bbuf->new_valid = vbo + blocksize;
266 if (bbuf->new_valid <= valid_size)
268 else if (bbuf->new_valid > data_size)
269 bbuf->new_valid = data_size;
271 if (vbo >= valid_size) {
272 memset(bh->b_data, 0, blocksize);
273 } else if (vbo + blocksize > valid_size) {
274 u32 voff = valid_size & sbi->block_mask;
276 memset(bh->b_data + voff, 0, blocksize - voff);
279 bbuf->buf = (ulong *)bh->b_data;
280 bbuf->bit = 8 * (off & ~(size_t)sbi->block_mask);
281 bbuf->nbits = 8 * blocksize;
286 static void bmp_buf_put(struct bmp_buf *bbuf, bool dirty)
288 struct buffer_head *bh = bbuf->bh;
289 struct ATTRIB *b = bbuf->b;
292 if (b && !b->non_res && dirty)
293 bbuf->mi->dirty = true;
300 if (bbuf->new_valid) {
301 b->nres.valid_size = cpu_to_le64(bbuf->new_valid);
302 bbuf->mi->dirty = true;
305 set_buffer_uptodate(bh);
306 mark_buffer_dirty(bh);
314 * indx_mark_used - Mark the bit @bit as used.
316 static int indx_mark_used(struct ntfs_index *indx, struct ntfs_inode *ni,
322 err = bmp_buf_get(indx, ni, bit, &bbuf);
326 __set_bit(bit - bbuf.bit, bbuf.buf);
328 bmp_buf_put(&bbuf, true);
334 * indx_mark_free - Mark the bit @bit as free.
336 static int indx_mark_free(struct ntfs_index *indx, struct ntfs_inode *ni,
342 err = bmp_buf_get(indx, ni, bit, &bbuf);
346 __clear_bit(bit - bbuf.bit, bbuf.buf);
348 bmp_buf_put(&bbuf, true);
356 * If ntfs_readdir calls this function (indx_used_bit -> scan_nres_bitmap),
357 * inode is shared locked and no ni_lock.
358 * Use rw_semaphore for read/write access to bitmap_run.
360 static int scan_nres_bitmap(struct ntfs_inode *ni, struct ATTRIB *bitmap,
361 struct ntfs_index *indx, size_t from,
362 bool (*fn)(const ulong *buf, u32 bit, u32 bits,
366 struct ntfs_sb_info *sbi = ni->mi.sbi;
367 struct super_block *sb = sbi->sb;
368 struct runs_tree *run = &indx->bitmap_run;
369 struct rw_semaphore *lock = &indx->run_lock;
370 u32 nbits = sb->s_blocksize * 8;
371 u32 blocksize = sb->s_blocksize;
372 u64 valid_size = le64_to_cpu(bitmap->nres.valid_size);
373 u64 data_size = le64_to_cpu(bitmap->nres.data_size);
374 sector_t eblock = bytes_to_block(sb, data_size);
375 size_t vbo = from >> 3;
376 sector_t blk = (vbo & sbi->cluster_mask) >> sb->s_blocksize_bits;
377 sector_t vblock = vbo >> sb->s_blocksize_bits;
378 sector_t blen, block;
379 CLST lcn, clen, vcn, vcn_next;
381 struct buffer_head *bh;
386 if (vblock >= eblock)
390 vcn = vbo >> sbi->cluster_bits;
393 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
399 const struct INDEX_NAMES *name = &s_index_names[indx->type];
402 err = attr_load_runs_vcn(ni, ATTR_BITMAP, name->name,
403 name->name_len, run, vcn);
408 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
414 blen = (sector_t)clen * sbi->blocks_per_cluster;
415 block = (sector_t)lcn * sbi->blocks_per_cluster;
417 for (; blk < blen; blk++, from = 0) {
418 bh = ntfs_bread(sb, block + blk);
422 vbo = (u64)vblock << sb->s_blocksize_bits;
423 if (vbo >= valid_size) {
424 memset(bh->b_data, 0, blocksize);
425 } else if (vbo + blocksize > valid_size) {
426 u32 voff = valid_size & sbi->block_mask;
428 memset(bh->b_data + voff, 0, blocksize - voff);
431 if (vbo + blocksize > data_size)
432 nbits = 8 * (data_size - vbo);
434 ok = nbits > from ? (*fn)((ulong *)bh->b_data, from, nbits, ret)
443 if (++vblock >= eblock) {
449 vcn_next = vcn + clen;
451 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) && vcn == vcn_next;
458 static bool scan_for_free(const ulong *buf, u32 bit, u32 bits, size_t *ret)
460 size_t pos = find_next_zero_bit(buf, bits, bit);
469 * indx_find_free - Look for free bit.
471 * Return: -1 if no free bits.
473 static int indx_find_free(struct ntfs_index *indx, struct ntfs_inode *ni,
474 size_t *bit, struct ATTRIB **bitmap)
477 struct ATTR_LIST_ENTRY *le = NULL;
478 const struct INDEX_NAMES *in = &s_index_names[indx->type];
481 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
491 u32 nbits = 8 * le32_to_cpu(b->res.data_size);
492 size_t pos = find_next_zero_bit(resident_data(b), nbits, 0);
497 err = scan_nres_bitmap(ni, b, indx, 0, &scan_for_free, bit);
506 static bool scan_for_used(const ulong *buf, u32 bit, u32 bits, size_t *ret)
508 size_t pos = find_next_bit(buf, bits, bit);
517 * indx_used_bit - Look for used bit.
519 * Return: MINUS_ONE_T if no used bits.
521 int indx_used_bit(struct ntfs_index *indx, struct ntfs_inode *ni, size_t *bit)
524 struct ATTR_LIST_ENTRY *le = NULL;
526 const struct INDEX_NAMES *in = &s_index_names[indx->type];
529 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
538 u32 nbits = le32_to_cpu(b->res.data_size) * 8;
539 size_t pos = find_next_bit(resident_data(b), nbits, from);
544 err = scan_nres_bitmap(ni, b, indx, from, &scan_for_used, bit);
555 * Find a point at which the index allocation buffer would like to be split.
556 * NOTE: This function should never return 'END' entry NULL returns on error.
558 static const struct NTFS_DE *hdr_find_split(const struct INDEX_HDR *hdr)
561 const struct NTFS_DE *e = hdr_first_de(hdr);
562 u32 used_2 = le32_to_cpu(hdr->used) >> 1;
565 if (!e || de_is_last(e))
568 esize = le16_to_cpu(e->size);
569 for (o = le32_to_cpu(hdr->de_off) + esize; o < used_2; o += esize) {
570 const struct NTFS_DE *p = e;
574 /* We must not return END entry. */
578 esize = le16_to_cpu(e->size);
585 * hdr_insert_head - Insert some entries at the beginning of the buffer.
587 * It is used to insert entries into a newly-created buffer.
589 static const struct NTFS_DE *hdr_insert_head(struct INDEX_HDR *hdr,
590 const void *ins, u32 ins_bytes)
593 struct NTFS_DE *e = hdr_first_de(hdr);
594 u32 used = le32_to_cpu(hdr->used);
599 /* Now we just make room for the inserted entries and jam it in. */
600 to_move = used - le32_to_cpu(hdr->de_off);
601 memmove(Add2Ptr(e, ins_bytes), e, to_move);
602 memcpy(e, ins, ins_bytes);
603 hdr->used = cpu_to_le32(used + ins_bytes);
611 * return true if INDEX_HDR is valid
613 static bool index_hdr_check(const struct INDEX_HDR *hdr, u32 bytes)
615 u32 end = le32_to_cpu(hdr->used);
616 u32 tot = le32_to_cpu(hdr->total);
617 u32 off = le32_to_cpu(hdr->de_off);
619 if (!IS_ALIGNED(off, 8) || tot > bytes || end > tot ||
620 off + sizeof(struct NTFS_DE) > end) {
621 /* incorrect index buffer. */
631 * return true if INDEX_BUFFER seems is valid
633 static bool index_buf_check(const struct INDEX_BUFFER *ib, u32 bytes,
636 const struct NTFS_RECORD_HEADER *rhdr = &ib->rhdr;
637 u16 fo = le16_to_cpu(rhdr->fix_off);
638 u16 fn = le16_to_cpu(rhdr->fix_num);
640 if (bytes <= offsetof(struct INDEX_BUFFER, ihdr) ||
641 rhdr->sign != NTFS_INDX_SIGNATURE ||
642 fo < sizeof(struct INDEX_BUFFER)
643 /* Check index buffer vbn. */
644 || (vbn && *vbn != le64_to_cpu(ib->vbn)) || (fo % sizeof(short)) ||
645 fo + fn * sizeof(short) >= bytes ||
646 fn != ((bytes >> SECTOR_SHIFT) + 1)) {
647 /* incorrect index buffer. */
651 return index_hdr_check(&ib->ihdr,
652 bytes - offsetof(struct INDEX_BUFFER, ihdr));
655 void fnd_clear(struct ntfs_fnd *fnd)
659 for (i = fnd->level - 1; i >= 0; i--) {
660 struct indx_node *n = fnd->nodes[i];
666 fnd->nodes[i] = NULL;
672 static int fnd_push(struct ntfs_fnd *fnd, struct indx_node *n,
678 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes))
686 static struct indx_node *fnd_pop(struct ntfs_fnd *fnd)
693 fnd->nodes[i] = NULL;
699 static bool fnd_is_empty(struct ntfs_fnd *fnd)
702 return !fnd->root_de;
704 return !fnd->de[fnd->level - 1];
708 * hdr_find_e - Locate an entry the index buffer.
710 * If no matching entry is found, it returns the first entry which is greater
711 * than the desired entry If the search key is greater than all the entries the
712 * buffer, it returns the 'end' entry. This function does a binary search of the
713 * current index buffer, for the first entry that is <= to the search value.
715 * Return: NULL if error.
717 static struct NTFS_DE *hdr_find_e(const struct ntfs_index *indx,
718 const struct INDEX_HDR *hdr, const void *key,
719 size_t key_len, const void *ctx, int *diff)
721 struct NTFS_DE *e, *found = NULL;
722 NTFS_CMP_FUNC cmp = indx->cmp;
723 int min_idx = 0, mid_idx, max_idx = 0;
726 u32 e_size, e_key_len;
727 u32 end = le32_to_cpu(hdr->used);
728 u32 off = le32_to_cpu(hdr->de_off);
729 u32 total = le32_to_cpu(hdr->total);
736 if (off + sizeof(struct NTFS_DE) > end)
739 e = Add2Ptr(hdr, off);
740 e_size = le16_to_cpu(e->size);
742 if (e_size < sizeof(struct NTFS_DE) || off + e_size > end)
745 if (!de_is_last(e)) {
750 if (max_idx < table_size)
757 e_key_len = le16_to_cpu(e->key_size);
759 diff2 = (*cmp)(key, key_len, e + 1, e_key_len, ctx);
762 min_idx = mid_idx + 1;
768 table_size = min(table_size * 2,
769 (int)ARRAY_SIZE(offs));
772 } else if (diff2 < 0) {
774 max_idx = mid_idx - 1;
784 if (min_idx > max_idx) {
789 mid_idx = (min_idx + max_idx) >> 1;
790 e = Add2Ptr(hdr, offs[mid_idx]);
796 * hdr_insert_de - Insert an index entry into the buffer.
798 * 'before' should be a pointer previously returned from hdr_find_e.
800 static struct NTFS_DE *hdr_insert_de(const struct ntfs_index *indx,
801 struct INDEX_HDR *hdr,
802 const struct NTFS_DE *de,
803 struct NTFS_DE *before, const void *ctx)
806 size_t off = PtrOffset(hdr, before);
807 u32 used = le32_to_cpu(hdr->used);
808 u32 total = le32_to_cpu(hdr->total);
809 u16 de_size = le16_to_cpu(de->size);
811 /* First, check to see if there's enough room. */
812 if (used + de_size > total)
815 /* We know there's enough space, so we know we'll succeed. */
817 /* Check that before is inside Index. */
818 if (off >= used || off < le32_to_cpu(hdr->de_off) ||
819 off + le16_to_cpu(before->size) > total) {
824 /* No insert point is applied. Get it manually. */
825 before = hdr_find_e(indx, hdr, de + 1, le16_to_cpu(de->key_size), ctx,
829 off = PtrOffset(hdr, before);
832 /* Now we just make room for the entry and jam it in. */
833 memmove(Add2Ptr(before, de_size), before, used - off);
835 hdr->used = cpu_to_le32(used + de_size);
836 memcpy(before, de, de_size);
842 * hdr_delete_de - Remove an entry from the index buffer.
844 static inline struct NTFS_DE *hdr_delete_de(struct INDEX_HDR *hdr,
847 u32 used = le32_to_cpu(hdr->used);
848 u16 esize = le16_to_cpu(re->size);
849 u32 off = PtrOffset(hdr, re);
850 int bytes = used - (off + esize);
852 /* check INDEX_HDR valid before using INDEX_HDR */
853 if (!check_index_header(hdr, le32_to_cpu(hdr->total)))
856 if (off >= used || esize < sizeof(struct NTFS_DE) ||
857 bytes < sizeof(struct NTFS_DE))
860 hdr->used = cpu_to_le32(used - esize);
861 memmove(re, Add2Ptr(re, esize), bytes);
866 void indx_clear(struct ntfs_index *indx)
868 run_close(&indx->alloc_run);
869 run_close(&indx->bitmap_run);
872 int indx_init(struct ntfs_index *indx, struct ntfs_sb_info *sbi,
873 const struct ATTRIB *attr, enum index_mutex_classed type)
876 const struct INDEX_ROOT *root = resident_data(attr);
878 t32 = le32_to_cpu(attr->res.data_size);
879 if (t32 <= offsetof(struct INDEX_ROOT, ihdr) ||
880 !index_hdr_check(&root->ihdr,
881 t32 - offsetof(struct INDEX_ROOT, ihdr))) {
885 /* Check root fields. */
886 if (!root->index_block_clst)
890 indx->idx2vbn_bits = __ffs(root->index_block_clst);
892 t32 = le32_to_cpu(root->index_block_size);
893 indx->index_bits = blksize_bits(t32);
895 /* Check index record size. */
896 if (t32 < sbi->cluster_size) {
897 /* Index record is smaller than a cluster, use 512 blocks. */
898 if (t32 != root->index_block_clst * SECTOR_SIZE)
901 /* Check alignment to a cluster. */
902 if ((sbi->cluster_size >> SECTOR_SHIFT) &
903 (root->index_block_clst - 1)) {
907 indx->vbn2vbo_bits = SECTOR_SHIFT;
909 /* Index record must be a multiple of cluster size. */
910 if (t32 != root->index_block_clst << sbi->cluster_bits)
913 indx->vbn2vbo_bits = sbi->cluster_bits;
916 init_rwsem(&indx->run_lock);
918 indx->cmp = get_cmp_func(root);
925 ntfs_set_state(sbi, NTFS_DIRTY_DIRTY);
929 static struct indx_node *indx_new(struct ntfs_index *indx,
930 struct ntfs_inode *ni, CLST vbn,
931 const __le64 *sub_vbn)
936 struct INDEX_HDR *hdr;
937 struct INDEX_BUFFER *index;
938 u64 vbo = (u64)vbn << indx->vbn2vbo_bits;
939 u32 bytes = 1u << indx->index_bits;
943 r = kzalloc(sizeof(struct indx_node), GFP_NOFS);
945 return ERR_PTR(-ENOMEM);
947 index = kzalloc(bytes, GFP_NOFS);
950 return ERR_PTR(-ENOMEM);
953 err = ntfs_get_bh(ni->mi.sbi, &indx->alloc_run, vbo, bytes, &r->nb);
962 index->rhdr.sign = NTFS_INDX_SIGNATURE;
963 index->rhdr.fix_off = cpu_to_le16(sizeof(struct INDEX_BUFFER)); // 0x28
964 fn = (bytes >> SECTOR_SHIFT) + 1; // 9
965 index->rhdr.fix_num = cpu_to_le16(fn);
966 index->vbn = cpu_to_le64(vbn);
968 eo = ALIGN(sizeof(struct INDEX_BUFFER) + fn * sizeof(short), 8);
969 hdr->de_off = cpu_to_le32(eo);
971 e = Add2Ptr(hdr, eo);
974 e->flags = NTFS_IE_LAST | NTFS_IE_HAS_SUBNODES;
975 e->size = cpu_to_le16(sizeof(struct NTFS_DE) + sizeof(u64));
977 cpu_to_le32(eo + sizeof(struct NTFS_DE) + sizeof(u64));
978 de_set_vbn_le(e, *sub_vbn);
981 e->size = cpu_to_le16(sizeof(struct NTFS_DE));
982 hdr->used = cpu_to_le32(eo + sizeof(struct NTFS_DE));
983 e->flags = NTFS_IE_LAST;
986 hdr->total = cpu_to_le32(bytes - offsetof(struct INDEX_BUFFER, ihdr));
992 struct INDEX_ROOT *indx_get_root(struct ntfs_index *indx, struct ntfs_inode *ni,
993 struct ATTRIB **attr, struct mft_inode **mi)
995 struct ATTR_LIST_ENTRY *le = NULL;
997 const struct INDEX_NAMES *in = &s_index_names[indx->type];
999 a = ni_find_attr(ni, NULL, &le, ATTR_ROOT, in->name, in->name_len, NULL,
1007 return resident_data_ex(a, sizeof(struct INDEX_ROOT));
1010 static int indx_write(struct ntfs_index *indx, struct ntfs_inode *ni,
1011 struct indx_node *node, int sync)
1013 struct INDEX_BUFFER *ib = node->index;
1015 return ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &node->nb, sync);
1021 * If ntfs_readdir calls this function
1022 * inode is shared locked and no ni_lock.
1023 * Use rw_semaphore for read/write access to alloc_run.
1025 int indx_read(struct ntfs_index *indx, struct ntfs_inode *ni, CLST vbn,
1026 struct indx_node **node)
1029 struct INDEX_BUFFER *ib;
1030 struct runs_tree *run = &indx->alloc_run;
1031 struct rw_semaphore *lock = &indx->run_lock;
1032 u64 vbo = (u64)vbn << indx->vbn2vbo_bits;
1033 u32 bytes = 1u << indx->index_bits;
1034 struct indx_node *in = *node;
1035 const struct INDEX_NAMES *name;
1038 in = kzalloc(sizeof(struct indx_node), GFP_NOFS);
1047 ib = kmalloc(bytes, GFP_NOFS);
1055 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1060 if (err == -E_NTFS_FIXUP)
1066 name = &s_index_names[indx->type];
1068 err = attr_load_runs_range(ni, ATTR_ALLOC, name->name, name->name_len,
1069 run, vbo, vbo + bytes);
1075 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1077 if (err == -E_NTFS_FIXUP)
1084 if (!index_buf_check(ib, bytes, &vbn)) {
1085 ntfs_inode_err(&ni->vfs_inode, "directory corrupted");
1086 ntfs_set_state(ni->mi.sbi, NTFS_DIRTY_ERROR);
1091 if (err == -E_NTFS_FIXUP) {
1092 ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &in->nb, 0);
1096 /* check for index header length */
1097 if (offsetof(struct INDEX_BUFFER, ihdr) + ib->ihdr.used > bytes) {
1106 if (err == -E_NTFS_CORRUPT) {
1107 ntfs_inode_err(&ni->vfs_inode, "directory corrupted");
1108 ntfs_set_state(ni->mi.sbi, NTFS_DIRTY_ERROR);
1112 if (ib != in->index)
1124 * indx_find - Scan NTFS directory for given entry.
1126 int indx_find(struct ntfs_index *indx, struct ntfs_inode *ni,
1127 const struct INDEX_ROOT *root, const void *key, size_t key_len,
1128 const void *ctx, int *diff, struct NTFS_DE **entry,
1129 struct ntfs_fnd *fnd)
1133 struct indx_node *node;
1136 root = indx_get_root(&ni->dir, ni, NULL, NULL);
1139 /* Should not happen. */
1144 e = fnd->level ? fnd->de[fnd->level - 1] : fnd->root_de;
1145 if (e && !de_is_last(e) &&
1146 !(*indx->cmp)(key, key_len, e + 1, le16_to_cpu(e->key_size), ctx)) {
1152 /* Soft finder reset. */
1155 /* Lookup entry that is <= to the search value. */
1156 e = hdr_find_e(indx, &root->ihdr, key, key_len, ctx, diff);
1164 if (*diff >= 0 || !de_has_vcn_ex(e))
1167 /* Read next level. */
1168 err = indx_read(indx, ni, de_get_vbn(e), &node);
1172 /* Lookup entry that is <= to the search value. */
1173 e = hdr_find_e(indx, &node->index->ihdr, key, key_len, ctx,
1176 put_indx_node(node);
1180 fnd_push(fnd, node, e);
1187 int indx_find_sort(struct ntfs_index *indx, struct ntfs_inode *ni,
1188 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1189 struct ntfs_fnd *fnd)
1192 struct indx_node *n = NULL;
1195 int level = fnd->level;
1199 e = hdr_first_de(&root->ihdr);
1204 } else if (!level) {
1205 if (de_is_last(fnd->root_de)) {
1210 e = hdr_next_de(&root->ihdr, fnd->root_de);
1215 n = fnd->nodes[level - 1];
1216 e = fnd->de[level - 1];
1221 e = hdr_next_de(&n->index->ihdr, e);
1225 fnd->de[level - 1] = e;
1228 /* Just to avoid tree cycle. */
1233 while (de_has_vcn_ex(e)) {
1234 if (le16_to_cpu(e->size) <
1235 sizeof(struct NTFS_DE) + sizeof(u64)) {
1243 /* Read next level. */
1244 err = indx_read(indx, ni, de_get_vbn(e), &n);
1248 /* Try next level. */
1249 e = hdr_first_de(&n->index->ihdr);
1255 fnd_push(fnd, n, e);
1258 if (le16_to_cpu(e->size) > sizeof(struct NTFS_DE)) {
1268 /* Pop one level. */
1277 n = fnd->nodes[level - 1];
1278 e = fnd->de[level - 1];
1279 } else if (fnd->root_de) {
1282 fnd->root_de = NULL;
1288 if (le16_to_cpu(e->size) > sizeof(struct NTFS_DE)) {
1297 int indx_find_raw(struct ntfs_index *indx, struct ntfs_inode *ni,
1298 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1299 size_t *off, struct ntfs_fnd *fnd)
1302 struct indx_node *n = NULL;
1303 struct NTFS_DE *e = NULL;
1308 u32 record_size = ni->mi.sbi->record_size;
1310 /* Use non sorted algorithm. */
1312 /* This is the first call. */
1313 e = hdr_first_de(&root->ihdr);
1319 /* The first call with setup of initial element. */
1320 if (*off >= record_size) {
1321 next_vbn = (((*off - record_size) >> indx->index_bits))
1322 << indx->idx2vbn_bits;
1323 /* Jump inside cycle 'for'. */
1327 /* Start enumeration from root. */
1329 } else if (!fnd->root_de)
1333 /* Check if current entry can be used. */
1334 if (e && le16_to_cpu(e->size) > sizeof(struct NTFS_DE))
1338 /* Continue to enumerate root. */
1339 if (!de_is_last(fnd->root_de)) {
1340 e = hdr_next_de(&root->ihdr, fnd->root_de);
1347 /* Start to enumerate indexes from 0. */
1350 /* Continue to enumerate indexes. */
1351 e2 = fnd->de[fnd->level - 1];
1353 n = fnd->nodes[fnd->level - 1];
1355 if (!de_is_last(e2)) {
1356 e = hdr_next_de(&n->index->ihdr, e2);
1359 fnd->de[fnd->level - 1] = e;
1363 /* Continue with next index. */
1364 next_vbn = le64_to_cpu(n->index->vbn) +
1365 root->index_block_clst;
1369 /* Release current index. */
1376 /* Skip all free indexes. */
1377 bit = next_vbn >> indx->idx2vbn_bits;
1378 err = indx_used_bit(indx, ni, &bit);
1379 if (err == -ENOENT || bit == MINUS_ONE_T) {
1380 /* No used indexes. */
1385 next_used_vbn = bit << indx->idx2vbn_bits;
1387 /* Read buffer into memory. */
1388 err = indx_read(indx, ni, next_used_vbn, &n);
1392 e = hdr_first_de(&n->index->ihdr);
1393 fnd_push(fnd, n, e);
1399 /* Return offset to restore enumerator if necessary. */
1401 /* 'e' points in root, */
1402 *off = PtrOffset(&root->ihdr, e);
1404 /* 'e' points in index, */
1405 *off = (le64_to_cpu(n->index->vbn) << indx->vbn2vbo_bits) +
1406 record_size + PtrOffset(&n->index->ihdr, e);
1414 * indx_create_allocate - Create "Allocation + Bitmap" attributes.
1416 static int indx_create_allocate(struct ntfs_index *indx, struct ntfs_inode *ni,
1420 struct ntfs_sb_info *sbi = ni->mi.sbi;
1421 struct ATTRIB *bitmap;
1422 struct ATTRIB *alloc;
1423 u32 data_size = 1u << indx->index_bits;
1424 u32 alloc_size = ntfs_up_cluster(sbi, data_size);
1425 CLST len = alloc_size >> sbi->cluster_bits;
1426 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1428 struct runs_tree run;
1432 err = attr_allocate_clusters(sbi, &run, 0, 0, len, NULL, 0, &alen, 0,
1437 err = ni_insert_nonresident(ni, ATTR_ALLOC, in->name, in->name_len,
1438 &run, 0, len, 0, &alloc, NULL, NULL);
1442 alloc->nres.valid_size = alloc->nres.data_size = cpu_to_le64(data_size);
1444 err = ni_insert_resident(ni, bitmap_size(1), ATTR_BITMAP, in->name,
1445 in->name_len, &bitmap, NULL, NULL);
1449 if (in->name == I30_NAME) {
1450 ni->vfs_inode.i_size = data_size;
1451 inode_set_bytes(&ni->vfs_inode, alloc_size);
1454 memcpy(&indx->alloc_run, &run, sizeof(run));
1461 mi_remove_attr(NULL, &ni->mi, alloc);
1464 run_deallocate(sbi, &run, false);
1471 * indx_add_allocate - Add clusters to index.
1473 static int indx_add_allocate(struct ntfs_index *indx, struct ntfs_inode *ni,
1479 u64 bmp_size, bmp_size_v;
1480 struct ATTRIB *bmp, *alloc;
1481 struct mft_inode *mi;
1482 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1484 err = indx_find_free(indx, ni, &bit, &bmp);
1488 if (bit != MINUS_ONE_T) {
1492 bmp_size = le64_to_cpu(bmp->nres.data_size);
1493 bmp_size_v = le64_to_cpu(bmp->nres.valid_size);
1495 bmp_size = bmp_size_v = le32_to_cpu(bmp->res.data_size);
1498 bit = bmp_size << 3;
1501 data_size = (u64)(bit + 1) << indx->index_bits;
1504 /* Increase bitmap. */
1505 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1506 &indx->bitmap_run, bitmap_size(bit + 1),
1512 alloc = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, in->name, in->name_len,
1521 /* Increase allocation. */
1522 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
1523 &indx->alloc_run, data_size, &data_size, true,
1531 *vbn = bit << indx->idx2vbn_bits;
1536 /* Ops. No space? */
1537 attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1538 &indx->bitmap_run, bmp_size, &bmp_size_v, false, NULL);
1545 * indx_insert_into_root - Attempt to insert an entry into the index root.
1547 * @undo - True if we undoing previous remove.
1548 * If necessary, it will twiddle the index b-tree.
1550 static int indx_insert_into_root(struct ntfs_index *indx, struct ntfs_inode *ni,
1551 const struct NTFS_DE *new_de,
1552 struct NTFS_DE *root_de, const void *ctx,
1553 struct ntfs_fnd *fnd, bool undo)
1556 struct NTFS_DE *e, *e0, *re;
1557 struct mft_inode *mi;
1558 struct ATTRIB *attr;
1559 struct INDEX_HDR *hdr;
1560 struct indx_node *n;
1562 __le64 *sub_vbn, t_vbn;
1564 u32 hdr_used, hdr_total, asize, to_move;
1565 u32 root_size, new_root_size;
1566 struct ntfs_sb_info *sbi;
1568 struct INDEX_ROOT *root, *a_root;
1570 /* Get the record this root placed in. */
1571 root = indx_get_root(indx, ni, &attr, &mi);
1577 * hdr_insert_de will succeed if there's
1578 * room the root for the new entry.
1582 new_de_size = le16_to_cpu(new_de->size);
1583 hdr_used = le32_to_cpu(hdr->used);
1584 hdr_total = le32_to_cpu(hdr->total);
1585 asize = le32_to_cpu(attr->size);
1586 root_size = le32_to_cpu(attr->res.data_size);
1588 ds_root = new_de_size + hdr_used - hdr_total;
1590 /* If 'undo' is set then reduce requirements. */
1591 if ((undo || asize + ds_root < sbi->max_bytes_per_attr) &&
1592 mi_resize_attr(mi, attr, ds_root)) {
1593 hdr->total = cpu_to_le32(hdr_total + ds_root);
1594 e = hdr_insert_de(indx, hdr, new_de, root_de, ctx);
1602 /* Make a copy of root attribute to restore if error. */
1603 a_root = kmemdup(attr, asize, GFP_NOFS);
1608 * Copy all the non-end entries from
1609 * the index root to the new buffer.
1612 e0 = hdr_first_de(hdr);
1614 /* Calculate the size to copy. */
1615 for (e = e0;; e = hdr_next_de(hdr, e)) {
1623 to_move += le16_to_cpu(e->size);
1629 re = kmemdup(e0, to_move, GFP_NOFS);
1637 if (de_has_vcn(e)) {
1638 t_vbn = de_get_vbn_le(e);
1642 new_root_size = sizeof(struct INDEX_ROOT) + sizeof(struct NTFS_DE) +
1644 ds_root = new_root_size - root_size;
1646 if (ds_root > 0 && asize + ds_root > sbi->max_bytes_per_attr) {
1647 /* Make root external. */
1653 mi_resize_attr(mi, attr, ds_root);
1655 /* Fill first entry (vcn will be set later). */
1656 e = (struct NTFS_DE *)(root + 1);
1657 memset(e, 0, sizeof(struct NTFS_DE));
1658 e->size = cpu_to_le16(sizeof(struct NTFS_DE) + sizeof(u64));
1659 e->flags = NTFS_IE_HAS_SUBNODES | NTFS_IE_LAST;
1662 hdr->used = hdr->total =
1663 cpu_to_le32(new_root_size - offsetof(struct INDEX_ROOT, ihdr));
1665 fnd->root_de = hdr_first_de(hdr);
1668 /* Create alloc and bitmap attributes (if not). */
1669 err = run_is_empty(&indx->alloc_run)
1670 ? indx_create_allocate(indx, ni, &new_vbn)
1671 : indx_add_allocate(indx, ni, &new_vbn);
1673 /* Layout of record may be changed, so rescan root. */
1674 root = indx_get_root(indx, ni, &attr, &mi);
1677 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
1684 if (mi_resize_attr(mi, attr, -ds_root)) {
1685 memcpy(attr, a_root, asize);
1688 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
1693 e = (struct NTFS_DE *)(root + 1);
1694 *(__le64 *)(e + 1) = cpu_to_le64(new_vbn);
1697 /* Now we can create/format the new buffer and copy the entries into. */
1698 n = indx_new(indx, ni, new_vbn, sub_vbn);
1704 hdr = &n->index->ihdr;
1705 hdr_used = le32_to_cpu(hdr->used);
1706 hdr_total = le32_to_cpu(hdr->total);
1708 /* Copy root entries into new buffer. */
1709 hdr_insert_head(hdr, re, to_move);
1711 /* Update bitmap attribute. */
1712 indx_mark_used(indx, ni, new_vbn >> indx->idx2vbn_bits);
1714 /* Check if we can insert new entry new index buffer. */
1715 if (hdr_used + new_de_size > hdr_total) {
1717 * This occurs if MFT record is the same or bigger than index
1718 * buffer. Move all root new index and have no space to add
1719 * new entry classic case when MFT record is 1K and index
1720 * buffer 4K the problem should not occurs.
1723 indx_write(indx, ni, n, 0);
1727 err = indx_insert_entry(indx, ni, new_de, ctx, fnd, undo);
1732 * Now root is a parent for new index buffer.
1733 * Insert NewEntry a new buffer.
1735 e = hdr_insert_de(indx, hdr, new_de, NULL, ctx);
1740 fnd_push(fnd, n, e);
1742 /* Just write updates index into disk. */
1743 indx_write(indx, ni, n, 0);
1757 * indx_insert_into_buffer
1759 * Attempt to insert an entry into an Index Allocation Buffer.
1760 * If necessary, it will split the buffer.
1763 indx_insert_into_buffer(struct ntfs_index *indx, struct ntfs_inode *ni,
1764 struct INDEX_ROOT *root, const struct NTFS_DE *new_de,
1765 const void *ctx, int level, struct ntfs_fnd *fnd)
1768 const struct NTFS_DE *sp;
1769 struct NTFS_DE *e, *de_t, *up_e;
1770 struct indx_node *n2;
1771 struct indx_node *n1 = fnd->nodes[level];
1772 struct INDEX_HDR *hdr1 = &n1->index->ihdr;
1773 struct INDEX_HDR *hdr2;
1776 __le64 t_vbn, *sub_vbn;
1779 /* Try the most easy case. */
1780 e = fnd->level - 1 == level ? fnd->de[level] : NULL;
1781 e = hdr_insert_de(indx, hdr1, new_de, e, ctx);
1784 /* Just write updated index into disk. */
1785 indx_write(indx, ni, n1, 0);
1790 * No space to insert into buffer. Split it.
1792 * - Save split point ('cause index buffers will be changed)
1793 * - Allocate NewBuffer and copy all entries <= sp into new buffer
1794 * - Remove all entries (sp including) from TargetBuffer
1795 * - Insert NewEntry into left or right buffer (depending on sp <=>
1797 * - Insert sp into parent buffer (or root)
1798 * - Make sp a parent for new buffer
1800 sp = hdr_find_split(hdr1);
1804 sp_size = le16_to_cpu(sp->size);
1805 up_e = kmalloc(sp_size + sizeof(u64), GFP_NOFS);
1808 memcpy(up_e, sp, sp_size);
1811 up_e->flags |= NTFS_IE_HAS_SUBNODES;
1812 up_e->size = cpu_to_le16(sp_size + sizeof(u64));
1815 t_vbn = de_get_vbn_le(up_e);
1819 /* Allocate on disk a new index allocation buffer. */
1820 err = indx_add_allocate(indx, ni, &new_vbn);
1824 /* Allocate and format memory a new index buffer. */
1825 n2 = indx_new(indx, ni, new_vbn, sub_vbn);
1831 hdr2 = &n2->index->ihdr;
1833 /* Make sp a parent for new buffer. */
1834 de_set_vbn(up_e, new_vbn);
1836 /* Copy all the entries <= sp into the new buffer. */
1837 de_t = hdr_first_de(hdr1);
1838 to_copy = PtrOffset(de_t, sp);
1839 hdr_insert_head(hdr2, de_t, to_copy);
1841 /* Remove all entries (sp including) from hdr1. */
1842 used = le32_to_cpu(hdr1->used) - to_copy - sp_size;
1843 memmove(de_t, Add2Ptr(sp, sp_size), used - le32_to_cpu(hdr1->de_off));
1844 hdr1->used = cpu_to_le32(used);
1847 * Insert new entry into left or right buffer
1848 * (depending on sp <=> new_de).
1851 (*indx->cmp)(new_de + 1, le16_to_cpu(new_de->key_size),
1852 up_e + 1, le16_to_cpu(up_e->key_size),
1858 indx_mark_used(indx, ni, new_vbn >> indx->idx2vbn_bits);
1860 indx_write(indx, ni, n1, 0);
1861 indx_write(indx, ni, n2, 0);
1866 * We've finished splitting everybody, so we are ready to
1867 * insert the promoted entry into the parent.
1870 /* Insert in root. */
1871 err = indx_insert_into_root(indx, ni, up_e, NULL, ctx, fnd, 0);
1876 * The target buffer's parent is another index buffer.
1877 * TODO: Remove recursion.
1879 err = indx_insert_into_buffer(indx, ni, root, up_e, ctx,
1892 * indx_insert_entry - Insert new entry into index.
1894 * @undo - True if we undoing previous remove.
1896 int indx_insert_entry(struct ntfs_index *indx, struct ntfs_inode *ni,
1897 const struct NTFS_DE *new_de, const void *ctx,
1898 struct ntfs_fnd *fnd, bool undo)
1903 struct ntfs_fnd *fnd_a = NULL;
1904 struct INDEX_ROOT *root;
1915 root = indx_get_root(indx, ni, NULL, NULL);
1921 if (fnd_is_empty(fnd)) {
1923 * Find the spot the tree where we want to
1924 * insert the new entry.
1926 err = indx_find(indx, ni, root, new_de + 1,
1927 le16_to_cpu(new_de->key_size), ctx, &diff, &e,
1940 * The root is also a leaf, so we'll insert the
1941 * new entry into it.
1943 err = indx_insert_into_root(indx, ni, new_de, fnd->root_de, ctx,
1949 * Found a leaf buffer, so we'll insert the new entry into it.
1951 err = indx_insert_into_buffer(indx, ni, root, new_de, ctx,
1952 fnd->level - 1, fnd);
1964 * indx_find_buffer - Locate a buffer from the tree.
1966 static struct indx_node *indx_find_buffer(struct ntfs_index *indx,
1967 struct ntfs_inode *ni,
1968 const struct INDEX_ROOT *root,
1969 __le64 vbn, struct indx_node *n)
1972 const struct NTFS_DE *e;
1973 struct indx_node *r;
1974 const struct INDEX_HDR *hdr = n ? &n->index->ihdr : &root->ihdr;
1976 /* Step 1: Scan one level. */
1977 for (e = hdr_first_de(hdr);; e = hdr_next_de(hdr, e)) {
1979 return ERR_PTR(-EINVAL);
1981 if (de_has_vcn(e) && vbn == de_get_vbn_le(e))
1988 /* Step2: Do recursion. */
1989 e = Add2Ptr(hdr, le32_to_cpu(hdr->de_off));
1991 if (de_has_vcn_ex(e)) {
1992 err = indx_read(indx, ni, de_get_vbn(e), &n);
1994 return ERR_PTR(err);
1996 r = indx_find_buffer(indx, ni, root, vbn, n);
2004 e = Add2Ptr(e, le16_to_cpu(e->size));
2011 * indx_shrink - Deallocate unused tail indexes.
2013 static int indx_shrink(struct ntfs_index *indx, struct ntfs_inode *ni,
2020 struct ATTR_LIST_ENTRY *le = NULL;
2021 const struct INDEX_NAMES *in = &s_index_names[indx->type];
2023 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
2031 const unsigned long *bm = resident_data(b);
2033 nbits = (size_t)le32_to_cpu(b->res.data_size) * 8;
2038 pos = find_next_bit(bm, nbits, bit);
2042 size_t used = MINUS_ONE_T;
2044 nbits = le64_to_cpu(b->nres.data_size) * 8;
2049 err = scan_nres_bitmap(ni, b, indx, bit, &scan_for_used, &used);
2053 if (used != MINUS_ONE_T)
2057 new_data = (u64)bit << indx->index_bits;
2059 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2060 &indx->alloc_run, new_data, &new_data, false, NULL);
2064 bpb = bitmap_size(bit);
2065 if (bpb * 8 == nbits)
2068 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2069 &indx->bitmap_run, bpb, &bpb, false, NULL);
2074 static int indx_free_children(struct ntfs_index *indx, struct ntfs_inode *ni,
2075 const struct NTFS_DE *e, bool trim)
2078 struct indx_node *n = NULL;
2079 struct INDEX_HDR *hdr;
2080 CLST vbn = de_get_vbn(e);
2083 err = indx_read(indx, ni, vbn, &n);
2087 hdr = &n->index->ihdr;
2088 /* First, recurse into the children, if any. */
2089 if (hdr_has_subnode(hdr)) {
2090 for (e = hdr_first_de(hdr); e; e = hdr_next_de(hdr, e)) {
2091 indx_free_children(indx, ni, e, false);
2099 i = vbn >> indx->idx2vbn_bits;
2101 * We've gotten rid of the children; add this buffer to the free list.
2103 indx_mark_free(indx, ni, i);
2109 * If there are no used indexes after current free index
2110 * then we can truncate allocation and bitmap.
2111 * Use bitmap to estimate the case.
2113 indx_shrink(indx, ni, i + 1);
2118 * indx_get_entry_to_replace
2120 * Find a replacement entry for a deleted entry.
2121 * Always returns a node entry:
2122 * NTFS_IE_HAS_SUBNODES is set the flags and the size includes the sub_vcn.
2124 static int indx_get_entry_to_replace(struct ntfs_index *indx,
2125 struct ntfs_inode *ni,
2126 const struct NTFS_DE *de_next,
2127 struct NTFS_DE **de_to_replace,
2128 struct ntfs_fnd *fnd)
2133 struct NTFS_DE *e, *te, *re;
2134 struct indx_node *n;
2135 struct INDEX_BUFFER *ib;
2137 *de_to_replace = NULL;
2139 /* Find first leaf entry down from de_next. */
2140 vbn = de_get_vbn(de_next);
2143 err = indx_read(indx, ni, vbn, &n);
2147 e = hdr_first_de(&n->index->ihdr);
2148 fnd_push(fnd, n, e);
2150 if (!de_is_last(e)) {
2152 * This buffer is non-empty, so its first entry
2153 * could be used as the replacement entry.
2155 level = fnd->level - 1;
2161 /* This buffer is a node. Continue to go down. */
2162 vbn = de_get_vbn(e);
2168 n = fnd->nodes[level];
2169 te = hdr_first_de(&n->index->ihdr);
2170 /* Copy the candidate entry into the replacement entry buffer. */
2171 re = kmalloc(le16_to_cpu(te->size) + sizeof(u64), GFP_NOFS);
2177 *de_to_replace = re;
2178 memcpy(re, te, le16_to_cpu(te->size));
2180 if (!de_has_vcn(re)) {
2182 * The replacement entry we found doesn't have a sub_vcn.
2183 * increase its size to hold one.
2185 le16_add_cpu(&re->size, sizeof(u64));
2186 re->flags |= NTFS_IE_HAS_SUBNODES;
2189 * The replacement entry we found was a node entry, which
2190 * means that all its child buffers are empty. Return them
2193 indx_free_children(indx, ni, te, true);
2197 * Expunge the replacement entry from its former location,
2198 * and then write that buffer.
2201 e = hdr_delete_de(&ib->ihdr, te);
2204 indx_write(indx, ni, n, 0);
2206 /* Check to see if this action created an empty leaf. */
2207 if (ib_is_leaf(ib) && ib_is_empty(ib))
2216 * indx_delete_entry - Delete an entry from the index.
2218 int indx_delete_entry(struct ntfs_index *indx, struct ntfs_inode *ni,
2219 const void *key, u32 key_len, const void *ctx)
2222 struct INDEX_ROOT *root;
2223 struct INDEX_HDR *hdr;
2224 struct ntfs_fnd *fnd, *fnd2;
2225 struct INDEX_BUFFER *ib;
2226 struct NTFS_DE *e, *re, *next, *prev, *me;
2227 struct indx_node *n, *n2d = NULL;
2230 struct ATTRIB *attr;
2231 struct mft_inode *mi;
2232 u32 e_size, root_size, new_root_size;
2234 const struct INDEX_NAMES *in;
2248 root = indx_get_root(indx, ni, &attr, &mi);
2254 /* Locate the entry to remove. */
2255 err = indx_find(indx, ni, root, key, key_len, ctx, &diff, &e, fnd);
2267 n = fnd->nodes[level - 1];
2268 e = fnd->de[level - 1];
2277 e_size = le16_to_cpu(e->size);
2279 if (!de_has_vcn_ex(e)) {
2280 /* The entry to delete is a leaf, so we can just rip it out. */
2281 hdr_delete_de(hdr, e);
2284 hdr->total = hdr->used;
2286 /* Shrink resident root attribute. */
2287 mi_resize_attr(mi, attr, 0 - e_size);
2291 indx_write(indx, ni, n, 0);
2294 * Check to see if removing that entry made
2297 if (ib_is_leaf(ib) && ib_is_empty(ib)) {
2299 fnd_push(fnd2, n, e);
2303 * The entry we wish to delete is a node buffer, so we
2304 * have to find a replacement for it.
2306 next = de_get_next(e);
2308 err = indx_get_entry_to_replace(indx, ni, next, &re, fnd2);
2313 de_set_vbn_le(re, de_get_vbn_le(e));
2314 hdr_delete_de(hdr, e);
2316 err = level ? indx_insert_into_buffer(indx, ni, root,
2320 : indx_insert_into_root(indx, ni, re, e,
2328 * There is no replacement for the current entry.
2329 * This means that the subtree rooted at its node
2330 * is empty, and can be deleted, which turn means
2331 * that the node can just inherit the deleted
2334 indx_free_children(indx, ni, next, true);
2336 de_set_vbn_le(next, de_get_vbn_le(e));
2337 hdr_delete_de(hdr, e);
2339 indx_write(indx, ni, n, 0);
2341 hdr->total = hdr->used;
2343 /* Shrink resident root attribute. */
2344 mi_resize_attr(mi, attr, 0 - e_size);
2349 /* Delete a branch of tree. */
2350 if (!fnd2 || !fnd2->level)
2353 /* Reinit root 'cause it can be changed. */
2354 root = indx_get_root(indx, ni, &attr, &mi);
2361 sub_vbn = fnd2->nodes[0]->index->vbn;
2365 hdr = level ? &fnd->nodes[level - 1]->index->ihdr : &root->ihdr;
2367 /* Scan current level. */
2368 for (e = hdr_first_de(hdr);; e = hdr_next_de(hdr, e)) {
2374 if (de_has_vcn(e) && sub_vbn == de_get_vbn_le(e))
2377 if (de_is_last(e)) {
2384 /* Do slow search from root. */
2385 struct indx_node *in;
2389 in = indx_find_buffer(indx, ni, root, sub_vbn, NULL);
2396 fnd_push(fnd, in, NULL);
2399 /* Merge fnd2 -> fnd. */
2400 for (level = 0; level < fnd2->level; level++) {
2401 fnd_push(fnd, fnd2->nodes[level], fnd2->de[level]);
2402 fnd2->nodes[level] = NULL;
2407 for (level = fnd->level; level; level--) {
2408 struct indx_node *in = fnd->nodes[level - 1];
2411 if (ib_is_empty(ib)) {
2424 e = hdr_first_de(hdr);
2430 if (hdr != &root->ihdr || !de_is_last(e)) {
2432 while (!de_is_last(e)) {
2433 if (de_has_vcn(e) && sub_vbn == de_get_vbn_le(e))
2436 e = hdr_next_de(hdr, e);
2443 if (sub_vbn != de_get_vbn_le(e)) {
2445 * Didn't find the parent entry, although this buffer
2446 * is the parent trail. Something is corrupt.
2452 if (de_is_last(e)) {
2454 * Since we can't remove the end entry, we'll remove
2455 * its predecessor instead. This means we have to
2456 * transfer the predecessor's sub_vcn to the end entry.
2457 * Note: This index block is not empty, so the
2458 * predecessor must exist.
2465 if (de_has_vcn(prev)) {
2466 de_set_vbn_le(e, de_get_vbn_le(prev));
2467 } else if (de_has_vcn(e)) {
2468 le16_sub_cpu(&e->size, sizeof(u64));
2469 e->flags &= ~NTFS_IE_HAS_SUBNODES;
2470 le32_sub_cpu(&hdr->used, sizeof(u64));
2476 * Copy the current entry into a temporary buffer (stripping
2477 * off its down-pointer, if any) and delete it from the current
2478 * buffer or root, as appropriate.
2480 e_size = le16_to_cpu(e->size);
2481 me = kmemdup(e, e_size, GFP_NOFS);
2487 if (de_has_vcn(me)) {
2488 me->flags &= ~NTFS_IE_HAS_SUBNODES;
2489 le16_sub_cpu(&me->size, sizeof(u64));
2492 hdr_delete_de(hdr, e);
2494 if (hdr == &root->ihdr) {
2496 hdr->total = hdr->used;
2498 /* Shrink resident root attribute. */
2499 mi_resize_attr(mi, attr, 0 - e_size);
2501 indx_write(indx, ni, n2d, 0);
2505 /* Mark unused buffers as free. */
2507 for (; level < fnd->level; level++) {
2508 ib = fnd->nodes[level]->index;
2509 if (ib_is_empty(ib)) {
2510 size_t k = le64_to_cpu(ib->vbn) >>
2513 indx_mark_free(indx, ni, k);
2520 /*fnd->root_de = NULL;*/
2523 * Re-insert the entry into the tree.
2524 * Find the spot the tree where we want to insert the new entry.
2526 err = indx_insert_entry(indx, ni, me, ctx, fnd, 0);
2532 indx_shrink(indx, ni, trim_bit);
2535 * This tree needs to be collapsed down to an empty root.
2536 * Recreate the index root as an empty leaf and free all
2537 * the bits the index allocation bitmap.
2542 in = &s_index_names[indx->type];
2544 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2545 &indx->alloc_run, 0, NULL, false, NULL);
2546 err = ni_remove_attr(ni, ATTR_ALLOC, in->name, in->name_len,
2548 run_close(&indx->alloc_run);
2550 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2551 &indx->bitmap_run, 0, NULL, false, NULL);
2552 err = ni_remove_attr(ni, ATTR_BITMAP, in->name, in->name_len,
2554 run_close(&indx->bitmap_run);
2556 root = indx_get_root(indx, ni, &attr, &mi);
2562 root_size = le32_to_cpu(attr->res.data_size);
2564 sizeof(struct INDEX_ROOT) + sizeof(struct NTFS_DE);
2566 if (new_root_size != root_size &&
2567 !mi_resize_attr(mi, attr, new_root_size - root_size)) {
2572 /* Fill first entry. */
2573 e = (struct NTFS_DE *)(root + 1);
2577 e->size = cpu_to_le16(sizeof(struct NTFS_DE));
2578 e->flags = NTFS_IE_LAST; // 0x02
2584 hdr->used = hdr->total = cpu_to_le32(
2585 new_root_size - offsetof(struct INDEX_ROOT, ihdr));
2598 * Update duplicated information in directory entry
2599 * 'dup' - info from MFT record
2601 int indx_update_dup(struct ntfs_inode *ni, struct ntfs_sb_info *sbi,
2602 const struct ATTR_FILE_NAME *fname,
2603 const struct NTFS_DUP_INFO *dup, int sync)
2606 struct NTFS_DE *e = NULL;
2607 struct ATTR_FILE_NAME *e_fname;
2608 struct ntfs_fnd *fnd;
2609 struct INDEX_ROOT *root;
2610 struct mft_inode *mi;
2611 struct ntfs_index *indx = &ni->dir;
2617 root = indx_get_root(indx, ni, NULL, &mi);
2623 /* Find entry in directory. */
2624 err = indx_find(indx, ni, root, fname, fname_full_size(fname), sbi,
2639 e_fname = (struct ATTR_FILE_NAME *)(e + 1);
2641 if (!memcmp(&e_fname->dup, dup, sizeof(*dup))) {
2643 * Nothing to update in index! Try to avoid this call.
2648 memcpy(&e_fname->dup, dup, sizeof(*dup));
2651 /* Directory entry in index. */
2652 err = indx_write(indx, ni, fnd->nodes[fnd->level - 1], sync);
2654 /* Directory entry in directory MFT record. */
2657 err = mi_write(mi, 1);
2659 mark_inode_dirty(&ni->vfs_inode);