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>
16 static const struct INDEX_NAMES {
19 } s_index_names[INDEX_MUTEX_TOTAL] = {
20 { I30_NAME, ARRAY_SIZE(I30_NAME) }, { SII_NAME, ARRAY_SIZE(SII_NAME) },
21 { SDH_NAME, ARRAY_SIZE(SDH_NAME) }, { SO_NAME, ARRAY_SIZE(SO_NAME) },
22 { SQ_NAME, ARRAY_SIZE(SQ_NAME) }, { SR_NAME, ARRAY_SIZE(SR_NAME) },
26 * cmp_fnames - Compare two names in index.
29 * Both names are little endian on-disk ATTR_FILE_NAME structs.
31 * key1 - cpu_str, key2 - ATTR_FILE_NAME
33 static int cmp_fnames(const void *key1, size_t l1, const void *key2, size_t l2,
36 const struct ATTR_FILE_NAME *f2 = key2;
37 const struct ntfs_sb_info *sbi = data;
38 const struct ATTR_FILE_NAME *f1;
42 if (l2 <= offsetof(struct ATTR_FILE_NAME, name))
45 fsize2 = fname_full_size(f2);
49 both_case = f2->type != FILE_NAME_DOS /*&& !sbi->options.nocase*/;
51 const struct le_str *s2 = (struct le_str *)&f2->name_len;
54 * If names are equal (case insensitive)
55 * try to compare it case sensitive.
57 return ntfs_cmp_names_cpu(key1, s2, sbi->upcase, both_case);
61 return ntfs_cmp_names(f1->name, f1->name_len, f2->name, f2->name_len,
62 sbi->upcase, both_case);
66 * cmp_uint - $SII of $Secure and $Q of Quota
68 static int cmp_uint(const void *key1, size_t l1, const void *key2, size_t l2,
85 * cmp_sdh - $SDH of $Secure
87 static int cmp_sdh(const void *key1, size_t l1, const void *key2, size_t l2,
90 const struct SECURITY_KEY *k1 = key1;
91 const struct SECURITY_KEY *k2 = key2;
94 if (l2 < sizeof(struct SECURITY_KEY))
97 t1 = le32_to_cpu(k1->hash);
98 t2 = le32_to_cpu(k2->hash);
100 /* First value is a hash value itself. */
106 /* Second value is security Id. */
108 t1 = le32_to_cpu(k1->sec_id);
109 t2 = le32_to_cpu(k2->sec_id);
120 * cmp_uints - $O of ObjId and "$R" for Reparse.
122 static int cmp_uints(const void *key1, size_t l1, const void *key2, size_t l2,
125 const __le32 *k1 = key1;
126 const __le32 *k2 = key2;
129 if ((size_t)data == 1) {
131 * ni_delete_all -> ntfs_remove_reparse ->
132 * delete all with this reference.
133 * k1, k2 - pointers to REPARSE_KEY
136 k1 += 1; // Skip REPARSE_KEY.ReparseTag
137 k2 += 1; // Skip REPARSE_KEY.ReparseTag
138 if (l2 <= sizeof(int))
141 if (l1 <= sizeof(int))
146 if (l2 < sizeof(int))
149 for (count = min(l1, l2) >> 2; count > 0; --count, ++k1, ++k2) {
150 u32 t1 = le32_to_cpu(*k1);
151 u32 t2 = le32_to_cpu(*k2);
167 static inline NTFS_CMP_FUNC get_cmp_func(const struct INDEX_ROOT *root)
169 switch (root->type) {
171 if (root->rule == NTFS_COLLATION_TYPE_FILENAME)
175 switch (root->rule) {
176 case NTFS_COLLATION_TYPE_UINT:
178 case NTFS_COLLATION_TYPE_SECURITY_HASH:
180 case NTFS_COLLATION_TYPE_UINTS:
195 struct mft_inode *mi;
196 struct buffer_head *bh;
203 static int bmp_buf_get(struct ntfs_index *indx, struct ntfs_inode *ni,
204 size_t bit, struct bmp_buf *bbuf)
207 size_t data_size, valid_size, vbo, off = bit >> 3;
208 struct ntfs_sb_info *sbi = ni->mi.sbi;
209 CLST vcn = off >> sbi->cluster_bits;
210 struct ATTR_LIST_ENTRY *le = NULL;
211 struct buffer_head *bh;
212 struct super_block *sb;
214 const struct INDEX_NAMES *in = &s_index_names[indx->type];
218 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
225 data_size = le32_to_cpu(b->res.data_size);
227 if (off >= data_size)
230 bbuf->buf = (ulong *)resident_data(b);
232 bbuf->nbits = data_size * 8;
237 data_size = le64_to_cpu(b->nres.data_size);
238 if (WARN_ON(off >= data_size)) {
239 /* Looks like filesystem error. */
243 valid_size = le64_to_cpu(b->nres.valid_size);
245 bh = ntfs_bread_run(sbi, &indx->bitmap_run, off);
254 if (buffer_locked(bh))
255 __wait_on_buffer(bh);
260 blocksize = sb->s_blocksize;
262 vbo = off & ~(size_t)sbi->block_mask;
264 bbuf->new_valid = vbo + blocksize;
265 if (bbuf->new_valid <= valid_size)
267 else if (bbuf->new_valid > data_size)
268 bbuf->new_valid = data_size;
270 if (vbo >= valid_size) {
271 memset(bh->b_data, 0, blocksize);
272 } else if (vbo + blocksize > valid_size) {
273 u32 voff = valid_size & sbi->block_mask;
275 memset(bh->b_data + voff, 0, blocksize - voff);
278 bbuf->buf = (ulong *)bh->b_data;
279 bbuf->bit = 8 * (off & ~(size_t)sbi->block_mask);
280 bbuf->nbits = 8 * blocksize;
285 static void bmp_buf_put(struct bmp_buf *bbuf, bool dirty)
287 struct buffer_head *bh = bbuf->bh;
288 struct ATTRIB *b = bbuf->b;
291 if (b && !b->non_res && dirty)
292 bbuf->mi->dirty = true;
299 if (bbuf->new_valid) {
300 b->nres.valid_size = cpu_to_le64(bbuf->new_valid);
301 bbuf->mi->dirty = true;
304 set_buffer_uptodate(bh);
305 mark_buffer_dirty(bh);
313 * indx_mark_used - Mark the bit @bit as used.
315 static int indx_mark_used(struct ntfs_index *indx, struct ntfs_inode *ni,
321 err = bmp_buf_get(indx, ni, bit, &bbuf);
325 __set_bit(bit - bbuf.bit, bbuf.buf);
327 bmp_buf_put(&bbuf, true);
333 * indx_mark_free - Mark the bit @bit as free.
335 static int indx_mark_free(struct ntfs_index *indx, struct ntfs_inode *ni,
341 err = bmp_buf_get(indx, ni, bit, &bbuf);
345 __clear_bit(bit - bbuf.bit, bbuf.buf);
347 bmp_buf_put(&bbuf, true);
355 * If ntfs_readdir calls this function (indx_used_bit -> scan_nres_bitmap),
356 * inode is shared locked and no ni_lock.
357 * Use rw_semaphore for read/write access to bitmap_run.
359 static int scan_nres_bitmap(struct ntfs_inode *ni, struct ATTRIB *bitmap,
360 struct ntfs_index *indx, size_t from,
361 bool (*fn)(const ulong *buf, u32 bit, u32 bits,
365 struct ntfs_sb_info *sbi = ni->mi.sbi;
366 struct super_block *sb = sbi->sb;
367 struct runs_tree *run = &indx->bitmap_run;
368 struct rw_semaphore *lock = &indx->run_lock;
369 u32 nbits = sb->s_blocksize * 8;
370 u32 blocksize = sb->s_blocksize;
371 u64 valid_size = le64_to_cpu(bitmap->nres.valid_size);
372 u64 data_size = le64_to_cpu(bitmap->nres.data_size);
373 sector_t eblock = bytes_to_block(sb, data_size);
374 size_t vbo = from >> 3;
375 sector_t blk = (vbo & sbi->cluster_mask) >> sb->s_blocksize_bits;
376 sector_t vblock = vbo >> sb->s_blocksize_bits;
377 sector_t blen, block;
378 CLST lcn, clen, vcn, vcn_next;
380 struct buffer_head *bh;
385 if (vblock >= eblock)
389 vcn = vbo >> sbi->cluster_bits;
392 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
398 const struct INDEX_NAMES *name = &s_index_names[indx->type];
401 err = attr_load_runs_vcn(ni, ATTR_BITMAP, name->name,
402 name->name_len, run, vcn);
407 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
413 blen = (sector_t)clen * sbi->blocks_per_cluster;
414 block = (sector_t)lcn * sbi->blocks_per_cluster;
416 for (; blk < blen; blk++, from = 0) {
417 bh = ntfs_bread(sb, block + blk);
421 vbo = (u64)vblock << sb->s_blocksize_bits;
422 if (vbo >= valid_size) {
423 memset(bh->b_data, 0, blocksize);
424 } else if (vbo + blocksize > valid_size) {
425 u32 voff = valid_size & sbi->block_mask;
427 memset(bh->b_data + voff, 0, blocksize - voff);
430 if (vbo + blocksize > data_size)
431 nbits = 8 * (data_size - vbo);
433 ok = nbits > from ? (*fn)((ulong *)bh->b_data, from, nbits, ret)
442 if (++vblock >= eblock) {
448 vcn_next = vcn + clen;
450 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) && vcn == vcn_next;
457 static bool scan_for_free(const ulong *buf, u32 bit, u32 bits, size_t *ret)
459 size_t pos = find_next_zero_bit(buf, bits, bit);
468 * indx_find_free - Look for free bit.
470 * Return: -1 if no free bits.
472 static int indx_find_free(struct ntfs_index *indx, struct ntfs_inode *ni,
473 size_t *bit, struct ATTRIB **bitmap)
476 struct ATTR_LIST_ENTRY *le = NULL;
477 const struct INDEX_NAMES *in = &s_index_names[indx->type];
480 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
490 u32 nbits = 8 * le32_to_cpu(b->res.data_size);
491 size_t pos = find_next_zero_bit(resident_data(b), nbits, 0);
496 err = scan_nres_bitmap(ni, b, indx, 0, &scan_for_free, bit);
505 static bool scan_for_used(const ulong *buf, u32 bit, u32 bits, size_t *ret)
507 size_t pos = find_next_bit(buf, bits, bit);
516 * indx_used_bit - Look for used bit.
518 * Return: MINUS_ONE_T if no used bits.
520 int indx_used_bit(struct ntfs_index *indx, struct ntfs_inode *ni, size_t *bit)
523 struct ATTR_LIST_ENTRY *le = NULL;
525 const struct INDEX_NAMES *in = &s_index_names[indx->type];
528 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
537 u32 nbits = le32_to_cpu(b->res.data_size) * 8;
538 size_t pos = find_next_bit(resident_data(b), nbits, from);
543 err = scan_nres_bitmap(ni, b, indx, from, &scan_for_used, bit);
554 * Find a point at which the index allocation buffer would like to be split.
555 * NOTE: This function should never return 'END' entry NULL returns on error.
557 static const struct NTFS_DE *hdr_find_split(const struct INDEX_HDR *hdr)
560 const struct NTFS_DE *e = hdr_first_de(hdr);
561 u32 used_2 = le32_to_cpu(hdr->used) >> 1;
564 if (!e || de_is_last(e))
567 esize = le16_to_cpu(e->size);
568 for (o = le32_to_cpu(hdr->de_off) + esize; o < used_2; o += esize) {
569 const struct NTFS_DE *p = e;
573 /* We must not return END entry. */
577 esize = le16_to_cpu(e->size);
584 * hdr_insert_head - Insert some entries at the beginning of the buffer.
586 * It is used to insert entries into a newly-created buffer.
588 static const struct NTFS_DE *hdr_insert_head(struct INDEX_HDR *hdr,
589 const void *ins, u32 ins_bytes)
592 struct NTFS_DE *e = hdr_first_de(hdr);
593 u32 used = le32_to_cpu(hdr->used);
598 /* Now we just make room for the inserted entries and jam it in. */
599 to_move = used - le32_to_cpu(hdr->de_off);
600 memmove(Add2Ptr(e, ins_bytes), e, to_move);
601 memcpy(e, ins, ins_bytes);
602 hdr->used = cpu_to_le32(used + ins_bytes);
607 void fnd_clear(struct ntfs_fnd *fnd)
611 for (i = 0; i < fnd->level; i++) {
612 struct indx_node *n = fnd->nodes[i];
618 fnd->nodes[i] = NULL;
624 static int fnd_push(struct ntfs_fnd *fnd, struct indx_node *n,
630 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes))
638 static struct indx_node *fnd_pop(struct ntfs_fnd *fnd)
645 fnd->nodes[i] = NULL;
651 static bool fnd_is_empty(struct ntfs_fnd *fnd)
654 return !fnd->root_de;
656 return !fnd->de[fnd->level - 1];
660 * hdr_find_e - Locate an entry the index buffer.
662 * If no matching entry is found, it returns the first entry which is greater
663 * than the desired entry If the search key is greater than all the entries the
664 * buffer, it returns the 'end' entry. This function does a binary search of the
665 * current index buffer, for the first entry that is <= to the search value.
667 * Return: NULL if error.
669 static struct NTFS_DE *hdr_find_e(const struct ntfs_index *indx,
670 const struct INDEX_HDR *hdr, const void *key,
671 size_t key_len, const void *ctx, int *diff)
674 NTFS_CMP_FUNC cmp = indx->cmp;
675 u32 e_size, e_key_len;
676 u32 end = le32_to_cpu(hdr->used);
677 u32 off = le32_to_cpu(hdr->de_off);
679 #ifdef NTFS3_INDEX_BINARY_SEARCH
680 struct NTFS_DE *found = NULL;
681 int min_idx = 0, mid_idx, max_idx = 0;
689 if (off + sizeof(struct NTFS_DE) > end)
692 e = Add2Ptr(hdr, off);
693 e_size = le16_to_cpu(e->size);
695 if (e_size < sizeof(struct NTFS_DE) || off + e_size > end)
698 if (!de_is_last(e)) {
703 if (max_idx < ARRAY_SIZE(offs))
710 e_key_len = le16_to_cpu(e->key_size);
712 diff2 = (*cmp)(key, key_len, e + 1, e_key_len, ctx);
715 min_idx = mid_idx + 1;
723 } else if (diff2 < 0) {
725 max_idx = mid_idx - 1;
735 if (min_idx > max_idx) {
740 mid_idx = (min_idx + max_idx) >> 1;
741 e = Add2Ptr(hdr, offs[mid_idx]);
748 * Entries index are sorted.
749 * Enumerate all entries until we find entry
750 * that is <= to the search value.
752 if (off + sizeof(struct NTFS_DE) > end)
755 e = Add2Ptr(hdr, off);
756 e_size = le16_to_cpu(e->size);
758 if (e_size < sizeof(struct NTFS_DE) || off + e_size > end)
763 e_key_len = le16_to_cpu(e->key_size);
765 *diff = (*cmp)(key, key_len, e + 1, e_key_len, ctx);
780 * hdr_insert_de - Insert an index entry into the buffer.
782 * 'before' should be a pointer previously returned from hdr_find_e.
784 static struct NTFS_DE *hdr_insert_de(const struct ntfs_index *indx,
785 struct INDEX_HDR *hdr,
786 const struct NTFS_DE *de,
787 struct NTFS_DE *before, const void *ctx)
790 size_t off = PtrOffset(hdr, before);
791 u32 used = le32_to_cpu(hdr->used);
792 u32 total = le32_to_cpu(hdr->total);
793 u16 de_size = le16_to_cpu(de->size);
795 /* First, check to see if there's enough room. */
796 if (used + de_size > total)
799 /* We know there's enough space, so we know we'll succeed. */
801 /* Check that before is inside Index. */
802 if (off >= used || off < le32_to_cpu(hdr->de_off) ||
803 off + le16_to_cpu(before->size) > total) {
808 /* No insert point is applied. Get it manually. */
809 before = hdr_find_e(indx, hdr, de + 1, le16_to_cpu(de->key_size), ctx,
813 off = PtrOffset(hdr, before);
816 /* Now we just make room for the entry and jam it in. */
817 memmove(Add2Ptr(before, de_size), before, used - off);
819 hdr->used = cpu_to_le32(used + de_size);
820 memcpy(before, de, de_size);
826 * hdr_delete_de - Remove an entry from the index buffer.
828 static inline struct NTFS_DE *hdr_delete_de(struct INDEX_HDR *hdr,
831 u32 used = le32_to_cpu(hdr->used);
832 u16 esize = le16_to_cpu(re->size);
833 u32 off = PtrOffset(hdr, re);
834 int bytes = used - (off + esize);
836 if (off >= used || esize < sizeof(struct NTFS_DE) ||
837 bytes < sizeof(struct NTFS_DE))
840 hdr->used = cpu_to_le32(used - esize);
841 memmove(re, Add2Ptr(re, esize), bytes);
846 void indx_clear(struct ntfs_index *indx)
848 run_close(&indx->alloc_run);
849 run_close(&indx->bitmap_run);
852 int indx_init(struct ntfs_index *indx, struct ntfs_sb_info *sbi,
853 const struct ATTRIB *attr, enum index_mutex_classed type)
856 const struct INDEX_ROOT *root = resident_data(attr);
858 /* Check root fields. */
859 if (!root->index_block_clst)
863 indx->idx2vbn_bits = __ffs(root->index_block_clst);
865 t32 = le32_to_cpu(root->index_block_size);
866 indx->index_bits = blksize_bits(t32);
868 /* Check index record size. */
869 if (t32 < sbi->cluster_size) {
870 /* Index record is smaller than a cluster, use 512 blocks. */
871 if (t32 != root->index_block_clst * SECTOR_SIZE)
874 /* Check alignment to a cluster. */
875 if ((sbi->cluster_size >> SECTOR_SHIFT) &
876 (root->index_block_clst - 1)) {
880 indx->vbn2vbo_bits = SECTOR_SHIFT;
882 /* Index record must be a multiple of cluster size. */
883 if (t32 != root->index_block_clst << sbi->cluster_bits)
886 indx->vbn2vbo_bits = sbi->cluster_bits;
889 init_rwsem(&indx->run_lock);
891 indx->cmp = get_cmp_func(root);
892 return indx->cmp ? 0 : -EINVAL;
895 static struct indx_node *indx_new(struct ntfs_index *indx,
896 struct ntfs_inode *ni, CLST vbn,
897 const __le64 *sub_vbn)
902 struct INDEX_HDR *hdr;
903 struct INDEX_BUFFER *index;
904 u64 vbo = (u64)vbn << indx->vbn2vbo_bits;
905 u32 bytes = 1u << indx->index_bits;
909 r = kzalloc(sizeof(struct indx_node), GFP_NOFS);
911 return ERR_PTR(-ENOMEM);
913 index = kzalloc(bytes, GFP_NOFS);
916 return ERR_PTR(-ENOMEM);
919 err = ntfs_get_bh(ni->mi.sbi, &indx->alloc_run, vbo, bytes, &r->nb);
928 index->rhdr.sign = NTFS_INDX_SIGNATURE;
929 index->rhdr.fix_off = cpu_to_le16(sizeof(struct INDEX_BUFFER)); // 0x28
930 fn = (bytes >> SECTOR_SHIFT) + 1; // 9
931 index->rhdr.fix_num = cpu_to_le16(fn);
932 index->vbn = cpu_to_le64(vbn);
934 eo = ALIGN(sizeof(struct INDEX_BUFFER) + fn * sizeof(short), 8);
935 hdr->de_off = cpu_to_le32(eo);
937 e = Add2Ptr(hdr, eo);
940 e->flags = NTFS_IE_LAST | NTFS_IE_HAS_SUBNODES;
941 e->size = cpu_to_le16(sizeof(struct NTFS_DE) + sizeof(u64));
943 cpu_to_le32(eo + sizeof(struct NTFS_DE) + sizeof(u64));
944 de_set_vbn_le(e, *sub_vbn);
947 e->size = cpu_to_le16(sizeof(struct NTFS_DE));
948 hdr->used = cpu_to_le32(eo + sizeof(struct NTFS_DE));
949 e->flags = NTFS_IE_LAST;
952 hdr->total = cpu_to_le32(bytes - offsetof(struct INDEX_BUFFER, ihdr));
958 struct INDEX_ROOT *indx_get_root(struct ntfs_index *indx, struct ntfs_inode *ni,
959 struct ATTRIB **attr, struct mft_inode **mi)
961 struct ATTR_LIST_ENTRY *le = NULL;
963 const struct INDEX_NAMES *in = &s_index_names[indx->type];
965 a = ni_find_attr(ni, NULL, &le, ATTR_ROOT, in->name, in->name_len, NULL,
973 return resident_data_ex(a, sizeof(struct INDEX_ROOT));
976 static int indx_write(struct ntfs_index *indx, struct ntfs_inode *ni,
977 struct indx_node *node, int sync)
979 struct INDEX_BUFFER *ib = node->index;
981 return ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &node->nb, sync);
987 * If ntfs_readdir calls this function
988 * inode is shared locked and no ni_lock.
989 * Use rw_semaphore for read/write access to alloc_run.
991 int indx_read(struct ntfs_index *indx, struct ntfs_inode *ni, CLST vbn,
992 struct indx_node **node)
995 struct INDEX_BUFFER *ib;
996 struct runs_tree *run = &indx->alloc_run;
997 struct rw_semaphore *lock = &indx->run_lock;
998 u64 vbo = (u64)vbn << indx->vbn2vbo_bits;
999 u32 bytes = 1u << indx->index_bits;
1000 struct indx_node *in = *node;
1001 const struct INDEX_NAMES *name;
1004 in = kzalloc(sizeof(struct indx_node), GFP_NOFS);
1013 ib = kmalloc(bytes, GFP_NOFS);
1021 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1026 if (err == -E_NTFS_FIXUP)
1032 name = &s_index_names[indx->type];
1034 err = attr_load_runs_range(ni, ATTR_ALLOC, name->name, name->name_len,
1035 run, vbo, vbo + bytes);
1041 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1043 if (err == -E_NTFS_FIXUP)
1050 if (err == -E_NTFS_FIXUP) {
1051 ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &in->nb, 0);
1059 if (ib != in->index)
1071 * indx_find - Scan NTFS directory for given entry.
1073 int indx_find(struct ntfs_index *indx, struct ntfs_inode *ni,
1074 const struct INDEX_ROOT *root, const void *key, size_t key_len,
1075 const void *ctx, int *diff, struct NTFS_DE **entry,
1076 struct ntfs_fnd *fnd)
1080 const struct INDEX_HDR *hdr;
1081 struct indx_node *node;
1084 root = indx_get_root(&ni->dir, ni, NULL, NULL);
1094 e = fnd->level ? fnd->de[fnd->level - 1] : fnd->root_de;
1095 if (e && !de_is_last(e) &&
1096 !(*indx->cmp)(key, key_len, e + 1, le16_to_cpu(e->key_size), ctx)) {
1102 /* Soft finder reset. */
1105 /* Lookup entry that is <= to the search value. */
1106 e = hdr_find_e(indx, hdr, key, key_len, ctx, diff);
1117 if (*diff >= 0 || !de_has_vcn_ex(e)) {
1122 /* Read next level. */
1123 err = indx_read(indx, ni, de_get_vbn(e), &node);
1127 /* Lookup entry that is <= to the search value. */
1128 e = hdr_find_e(indx, &node->index->ihdr, key, key_len, ctx,
1132 put_indx_node(node);
1136 fnd_push(fnd, node, e);
1143 int indx_find_sort(struct ntfs_index *indx, struct ntfs_inode *ni,
1144 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1145 struct ntfs_fnd *fnd)
1148 struct indx_node *n = NULL;
1151 int level = fnd->level;
1155 e = hdr_first_de(&root->ihdr);
1160 } else if (!level) {
1161 if (de_is_last(fnd->root_de)) {
1166 e = hdr_next_de(&root->ihdr, fnd->root_de);
1171 n = fnd->nodes[level - 1];
1172 e = fnd->de[level - 1];
1177 e = hdr_next_de(&n->index->ihdr, e);
1181 fnd->de[level - 1] = e;
1184 /* Just to avoid tree cycle. */
1189 while (de_has_vcn_ex(e)) {
1190 if (le16_to_cpu(e->size) <
1191 sizeof(struct NTFS_DE) + sizeof(u64)) {
1199 /* Read next level. */
1200 err = indx_read(indx, ni, de_get_vbn(e), &n);
1204 /* Try next level. */
1205 e = hdr_first_de(&n->index->ihdr);
1211 fnd_push(fnd, n, e);
1214 if (le16_to_cpu(e->size) > sizeof(struct NTFS_DE)) {
1224 /* Pop one level. */
1233 n = fnd->nodes[level - 1];
1234 e = fnd->de[level - 1];
1235 } else if (fnd->root_de) {
1238 fnd->root_de = NULL;
1244 if (le16_to_cpu(e->size) > sizeof(struct NTFS_DE)) {
1253 int indx_find_raw(struct ntfs_index *indx, struct ntfs_inode *ni,
1254 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1255 size_t *off, struct ntfs_fnd *fnd)
1258 struct indx_node *n = NULL;
1259 struct NTFS_DE *e = NULL;
1264 u32 record_size = ni->mi.sbi->record_size;
1266 /* Use non sorted algorithm. */
1268 /* This is the first call. */
1269 e = hdr_first_de(&root->ihdr);
1275 /* The first call with setup of initial element. */
1276 if (*off >= record_size) {
1277 next_vbn = (((*off - record_size) >> indx->index_bits))
1278 << indx->idx2vbn_bits;
1279 /* Jump inside cycle 'for'. */
1283 /* Start enumeration from root. */
1285 } else if (!fnd->root_de)
1289 /* Check if current entry can be used. */
1290 if (e && le16_to_cpu(e->size) > sizeof(struct NTFS_DE))
1294 /* Continue to enumerate root. */
1295 if (!de_is_last(fnd->root_de)) {
1296 e = hdr_next_de(&root->ihdr, fnd->root_de);
1303 /* Start to enumerate indexes from 0. */
1306 /* Continue to enumerate indexes. */
1307 e2 = fnd->de[fnd->level - 1];
1309 n = fnd->nodes[fnd->level - 1];
1311 if (!de_is_last(e2)) {
1312 e = hdr_next_de(&n->index->ihdr, e2);
1315 fnd->de[fnd->level - 1] = e;
1319 /* Continue with next index. */
1320 next_vbn = le64_to_cpu(n->index->vbn) +
1321 root->index_block_clst;
1325 /* Release current index. */
1332 /* Skip all free indexes. */
1333 bit = next_vbn >> indx->idx2vbn_bits;
1334 err = indx_used_bit(indx, ni, &bit);
1335 if (err == -ENOENT || bit == MINUS_ONE_T) {
1336 /* No used indexes. */
1341 next_used_vbn = bit << indx->idx2vbn_bits;
1343 /* Read buffer into memory. */
1344 err = indx_read(indx, ni, next_used_vbn, &n);
1348 e = hdr_first_de(&n->index->ihdr);
1349 fnd_push(fnd, n, e);
1355 /* Return offset to restore enumerator if necessary. */
1357 /* 'e' points in root, */
1358 *off = PtrOffset(&root->ihdr, e);
1360 /* 'e' points in index, */
1361 *off = (le64_to_cpu(n->index->vbn) << indx->vbn2vbo_bits) +
1362 record_size + PtrOffset(&n->index->ihdr, e);
1370 * indx_create_allocate - Create "Allocation + Bitmap" attributes.
1372 static int indx_create_allocate(struct ntfs_index *indx, struct ntfs_inode *ni,
1376 struct ntfs_sb_info *sbi = ni->mi.sbi;
1377 struct ATTRIB *bitmap;
1378 struct ATTRIB *alloc;
1379 u32 data_size = 1u << indx->index_bits;
1380 u32 alloc_size = ntfs_up_cluster(sbi, data_size);
1381 CLST len = alloc_size >> sbi->cluster_bits;
1382 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1384 struct runs_tree run;
1388 err = attr_allocate_clusters(sbi, &run, 0, 0, len, NULL, 0, &alen, 0,
1393 err = ni_insert_nonresident(ni, ATTR_ALLOC, in->name, in->name_len,
1394 &run, 0, len, 0, &alloc, NULL);
1398 alloc->nres.valid_size = alloc->nres.data_size = cpu_to_le64(data_size);
1400 err = ni_insert_resident(ni, bitmap_size(1), ATTR_BITMAP, in->name,
1401 in->name_len, &bitmap, NULL, NULL);
1405 if (in->name == I30_NAME) {
1406 ni->vfs_inode.i_size = data_size;
1407 inode_set_bytes(&ni->vfs_inode, alloc_size);
1410 memcpy(&indx->alloc_run, &run, sizeof(run));
1417 mi_remove_attr(NULL, &ni->mi, alloc);
1420 run_deallocate(sbi, &run, false);
1427 * indx_add_allocate - Add clusters to index.
1429 static int indx_add_allocate(struct ntfs_index *indx, struct ntfs_inode *ni,
1435 u64 bmp_size, bmp_size_v;
1436 struct ATTRIB *bmp, *alloc;
1437 struct mft_inode *mi;
1438 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1440 err = indx_find_free(indx, ni, &bit, &bmp);
1444 if (bit != MINUS_ONE_T) {
1448 bmp_size = le64_to_cpu(bmp->nres.data_size);
1449 bmp_size_v = le64_to_cpu(bmp->nres.valid_size);
1451 bmp_size = bmp_size_v = le32_to_cpu(bmp->res.data_size);
1454 bit = bmp_size << 3;
1457 data_size = (u64)(bit + 1) << indx->index_bits;
1460 /* Increase bitmap. */
1461 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1462 &indx->bitmap_run, bitmap_size(bit + 1),
1468 alloc = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, in->name, in->name_len,
1477 /* Increase allocation. */
1478 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
1479 &indx->alloc_run, data_size, &data_size, true,
1487 *vbn = bit << indx->idx2vbn_bits;
1492 /* Ops. No space? */
1493 attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1494 &indx->bitmap_run, bmp_size, &bmp_size_v, false, NULL);
1501 * indx_insert_into_root - Attempt to insert an entry into the index root.
1503 * @undo - True if we undoing previous remove.
1504 * If necessary, it will twiddle the index b-tree.
1506 static int indx_insert_into_root(struct ntfs_index *indx, struct ntfs_inode *ni,
1507 const struct NTFS_DE *new_de,
1508 struct NTFS_DE *root_de, const void *ctx,
1509 struct ntfs_fnd *fnd, bool undo)
1512 struct NTFS_DE *e, *e0, *re;
1513 struct mft_inode *mi;
1514 struct ATTRIB *attr;
1515 struct INDEX_HDR *hdr;
1516 struct indx_node *n;
1518 __le64 *sub_vbn, t_vbn;
1520 u32 hdr_used, hdr_total, asize, to_move;
1521 u32 root_size, new_root_size;
1522 struct ntfs_sb_info *sbi;
1524 struct INDEX_ROOT *root, *a_root;
1526 /* Get the record this root placed in. */
1527 root = indx_get_root(indx, ni, &attr, &mi);
1533 * hdr_insert_de will succeed if there's
1534 * room the root for the new entry.
1538 new_de_size = le16_to_cpu(new_de->size);
1539 hdr_used = le32_to_cpu(hdr->used);
1540 hdr_total = le32_to_cpu(hdr->total);
1541 asize = le32_to_cpu(attr->size);
1542 root_size = le32_to_cpu(attr->res.data_size);
1544 ds_root = new_de_size + hdr_used - hdr_total;
1546 /* If 'undo' is set then reduce requirements. */
1547 if ((undo || asize + ds_root < sbi->max_bytes_per_attr) &&
1548 mi_resize_attr(mi, attr, ds_root)) {
1549 hdr->total = cpu_to_le32(hdr_total + ds_root);
1550 e = hdr_insert_de(indx, hdr, new_de, root_de, ctx);
1558 /* Make a copy of root attribute to restore if error. */
1559 a_root = kmemdup(attr, asize, GFP_NOFS);
1564 * Copy all the non-end entries from
1565 * the index root to the new buffer.
1568 e0 = hdr_first_de(hdr);
1570 /* Calculate the size to copy. */
1571 for (e = e0;; e = hdr_next_de(hdr, e)) {
1579 to_move += le16_to_cpu(e->size);
1585 re = kmemdup(e0, to_move, GFP_NOFS);
1593 if (de_has_vcn(e)) {
1594 t_vbn = de_get_vbn_le(e);
1598 new_root_size = sizeof(struct INDEX_ROOT) + sizeof(struct NTFS_DE) +
1600 ds_root = new_root_size - root_size;
1602 if (ds_root > 0 && asize + ds_root > sbi->max_bytes_per_attr) {
1603 /* Make root external. */
1609 mi_resize_attr(mi, attr, ds_root);
1611 /* Fill first entry (vcn will be set later). */
1612 e = (struct NTFS_DE *)(root + 1);
1613 memset(e, 0, sizeof(struct NTFS_DE));
1614 e->size = cpu_to_le16(sizeof(struct NTFS_DE) + sizeof(u64));
1615 e->flags = NTFS_IE_HAS_SUBNODES | NTFS_IE_LAST;
1618 hdr->used = hdr->total =
1619 cpu_to_le32(new_root_size - offsetof(struct INDEX_ROOT, ihdr));
1621 fnd->root_de = hdr_first_de(hdr);
1624 /* Create alloc and bitmap attributes (if not). */
1625 err = run_is_empty(&indx->alloc_run)
1626 ? indx_create_allocate(indx, ni, &new_vbn)
1627 : indx_add_allocate(indx, ni, &new_vbn);
1629 /* Layout of record may be changed, so rescan root. */
1630 root = indx_get_root(indx, ni, &attr, &mi);
1633 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
1640 if (mi_resize_attr(mi, attr, -ds_root))
1641 memcpy(attr, a_root, asize);
1644 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
1649 e = (struct NTFS_DE *)(root + 1);
1650 *(__le64 *)(e + 1) = cpu_to_le64(new_vbn);
1653 /* Now we can create/format the new buffer and copy the entries into. */
1654 n = indx_new(indx, ni, new_vbn, sub_vbn);
1660 hdr = &n->index->ihdr;
1661 hdr_used = le32_to_cpu(hdr->used);
1662 hdr_total = le32_to_cpu(hdr->total);
1664 /* Copy root entries into new buffer. */
1665 hdr_insert_head(hdr, re, to_move);
1667 /* Update bitmap attribute. */
1668 indx_mark_used(indx, ni, new_vbn >> indx->idx2vbn_bits);
1670 /* Check if we can insert new entry new index buffer. */
1671 if (hdr_used + new_de_size > hdr_total) {
1673 * This occurs if MFT record is the same or bigger than index
1674 * buffer. Move all root new index and have no space to add
1675 * new entry classic case when MFT record is 1K and index
1676 * buffer 4K the problem should not occurs.
1679 indx_write(indx, ni, n, 0);
1683 err = indx_insert_entry(indx, ni, new_de, ctx, fnd, undo);
1688 * Now root is a parent for new index buffer.
1689 * Insert NewEntry a new buffer.
1691 e = hdr_insert_de(indx, hdr, new_de, NULL, ctx);
1696 fnd_push(fnd, n, e);
1698 /* Just write updates index into disk. */
1699 indx_write(indx, ni, n, 0);
1713 * indx_insert_into_buffer
1715 * Attempt to insert an entry into an Index Allocation Buffer.
1716 * If necessary, it will split the buffer.
1719 indx_insert_into_buffer(struct ntfs_index *indx, struct ntfs_inode *ni,
1720 struct INDEX_ROOT *root, const struct NTFS_DE *new_de,
1721 const void *ctx, int level, struct ntfs_fnd *fnd)
1724 const struct NTFS_DE *sp;
1725 struct NTFS_DE *e, *de_t, *up_e = NULL;
1726 struct indx_node *n2 = NULL;
1727 struct indx_node *n1 = fnd->nodes[level];
1728 struct INDEX_HDR *hdr1 = &n1->index->ihdr;
1729 struct INDEX_HDR *hdr2;
1732 __le64 t_vbn, *sub_vbn;
1735 /* Try the most easy case. */
1736 e = fnd->level - 1 == level ? fnd->de[level] : NULL;
1737 e = hdr_insert_de(indx, hdr1, new_de, e, ctx);
1740 /* Just write updated index into disk. */
1741 indx_write(indx, ni, n1, 0);
1746 * No space to insert into buffer. Split it.
1748 * - Save split point ('cause index buffers will be changed)
1749 * - Allocate NewBuffer and copy all entries <= sp into new buffer
1750 * - Remove all entries (sp including) from TargetBuffer
1751 * - Insert NewEntry into left or right buffer (depending on sp <=>
1753 * - Insert sp into parent buffer (or root)
1754 * - Make sp a parent for new buffer
1756 sp = hdr_find_split(hdr1);
1760 sp_size = le16_to_cpu(sp->size);
1761 up_e = kmalloc(sp_size + sizeof(u64), GFP_NOFS);
1764 memcpy(up_e, sp, sp_size);
1767 up_e->flags |= NTFS_IE_HAS_SUBNODES;
1768 up_e->size = cpu_to_le16(sp_size + sizeof(u64));
1771 t_vbn = de_get_vbn_le(up_e);
1775 /* Allocate on disk a new index allocation buffer. */
1776 err = indx_add_allocate(indx, ni, &new_vbn);
1780 /* Allocate and format memory a new index buffer. */
1781 n2 = indx_new(indx, ni, new_vbn, sub_vbn);
1787 hdr2 = &n2->index->ihdr;
1789 /* Make sp a parent for new buffer. */
1790 de_set_vbn(up_e, new_vbn);
1792 /* Copy all the entries <= sp into the new buffer. */
1793 de_t = hdr_first_de(hdr1);
1794 to_copy = PtrOffset(de_t, sp);
1795 hdr_insert_head(hdr2, de_t, to_copy);
1797 /* Remove all entries (sp including) from hdr1. */
1798 used = le32_to_cpu(hdr1->used) - to_copy - sp_size;
1799 memmove(de_t, Add2Ptr(sp, sp_size), used - le32_to_cpu(hdr1->de_off));
1800 hdr1->used = cpu_to_le32(used);
1803 * Insert new entry into left or right buffer
1804 * (depending on sp <=> new_de).
1807 (*indx->cmp)(new_de + 1, le16_to_cpu(new_de->key_size),
1808 up_e + 1, le16_to_cpu(up_e->key_size),
1814 indx_mark_used(indx, ni, new_vbn >> indx->idx2vbn_bits);
1816 indx_write(indx, ni, n1, 0);
1817 indx_write(indx, ni, n2, 0);
1822 * We've finished splitting everybody, so we are ready to
1823 * insert the promoted entry into the parent.
1826 /* Insert in root. */
1827 err = indx_insert_into_root(indx, ni, up_e, NULL, ctx, fnd, 0);
1832 * The target buffer's parent is another index buffer.
1833 * TODO: Remove recursion.
1835 err = indx_insert_into_buffer(indx, ni, root, up_e, ctx,
1848 * indx_insert_entry - Insert new entry into index.
1850 * @undo - True if we undoing previous remove.
1852 int indx_insert_entry(struct ntfs_index *indx, struct ntfs_inode *ni,
1853 const struct NTFS_DE *new_de, const void *ctx,
1854 struct ntfs_fnd *fnd, bool undo)
1859 struct ntfs_fnd *fnd_a = NULL;
1860 struct INDEX_ROOT *root;
1871 root = indx_get_root(indx, ni, NULL, NULL);
1877 if (fnd_is_empty(fnd)) {
1879 * Find the spot the tree where we want to
1880 * insert the new entry.
1882 err = indx_find(indx, ni, root, new_de + 1,
1883 le16_to_cpu(new_de->key_size), ctx, &diff, &e,
1896 * The root is also a leaf, so we'll insert the
1897 * new entry into it.
1899 err = indx_insert_into_root(indx, ni, new_de, fnd->root_de, ctx,
1905 * Found a leaf buffer, so we'll insert the new entry into it.
1907 err = indx_insert_into_buffer(indx, ni, root, new_de, ctx,
1908 fnd->level - 1, fnd);
1920 * indx_find_buffer - Locate a buffer from the tree.
1922 static struct indx_node *indx_find_buffer(struct ntfs_index *indx,
1923 struct ntfs_inode *ni,
1924 const struct INDEX_ROOT *root,
1925 __le64 vbn, struct indx_node *n)
1928 const struct NTFS_DE *e;
1929 struct indx_node *r;
1930 const struct INDEX_HDR *hdr = n ? &n->index->ihdr : &root->ihdr;
1932 /* Step 1: Scan one level. */
1933 for (e = hdr_first_de(hdr);; e = hdr_next_de(hdr, e)) {
1935 return ERR_PTR(-EINVAL);
1937 if (de_has_vcn(e) && vbn == de_get_vbn_le(e))
1944 /* Step2: Do recursion. */
1945 e = Add2Ptr(hdr, le32_to_cpu(hdr->de_off));
1947 if (de_has_vcn_ex(e)) {
1948 err = indx_read(indx, ni, de_get_vbn(e), &n);
1950 return ERR_PTR(err);
1952 r = indx_find_buffer(indx, ni, root, vbn, n);
1960 e = Add2Ptr(e, le16_to_cpu(e->size));
1967 * indx_shrink - Deallocate unused tail indexes.
1969 static int indx_shrink(struct ntfs_index *indx, struct ntfs_inode *ni,
1976 struct ATTR_LIST_ENTRY *le = NULL;
1977 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1979 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
1987 const unsigned long *bm = resident_data(b);
1989 nbits = (size_t)le32_to_cpu(b->res.data_size) * 8;
1994 pos = find_next_bit(bm, nbits, bit);
1998 size_t used = MINUS_ONE_T;
2000 nbits = le64_to_cpu(b->nres.data_size) * 8;
2005 err = scan_nres_bitmap(ni, b, indx, bit, &scan_for_used, &used);
2009 if (used != MINUS_ONE_T)
2013 new_data = (u64)bit << indx->index_bits;
2015 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2016 &indx->alloc_run, new_data, &new_data, false, NULL);
2020 bpb = bitmap_size(bit);
2021 if (bpb * 8 == nbits)
2024 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2025 &indx->bitmap_run, bpb, &bpb, false, NULL);
2030 static int indx_free_children(struct ntfs_index *indx, struct ntfs_inode *ni,
2031 const struct NTFS_DE *e, bool trim)
2034 struct indx_node *n;
2035 struct INDEX_HDR *hdr;
2036 CLST vbn = de_get_vbn(e);
2039 err = indx_read(indx, ni, vbn, &n);
2043 hdr = &n->index->ihdr;
2044 /* First, recurse into the children, if any. */
2045 if (hdr_has_subnode(hdr)) {
2046 for (e = hdr_first_de(hdr); e; e = hdr_next_de(hdr, e)) {
2047 indx_free_children(indx, ni, e, false);
2055 i = vbn >> indx->idx2vbn_bits;
2057 * We've gotten rid of the children; add this buffer to the free list.
2059 indx_mark_free(indx, ni, i);
2065 * If there are no used indexes after current free index
2066 * then we can truncate allocation and bitmap.
2067 * Use bitmap to estimate the case.
2069 indx_shrink(indx, ni, i + 1);
2074 * indx_get_entry_to_replace
2076 * Find a replacement entry for a deleted entry.
2077 * Always returns a node entry:
2078 * NTFS_IE_HAS_SUBNODES is set the flags and the size includes the sub_vcn.
2080 static int indx_get_entry_to_replace(struct ntfs_index *indx,
2081 struct ntfs_inode *ni,
2082 const struct NTFS_DE *de_next,
2083 struct NTFS_DE **de_to_replace,
2084 struct ntfs_fnd *fnd)
2089 struct NTFS_DE *e, *te, *re;
2090 struct indx_node *n;
2091 struct INDEX_BUFFER *ib;
2093 *de_to_replace = NULL;
2095 /* Find first leaf entry down from de_next. */
2096 vbn = de_get_vbn(de_next);
2099 err = indx_read(indx, ni, vbn, &n);
2103 e = hdr_first_de(&n->index->ihdr);
2104 fnd_push(fnd, n, e);
2106 if (!de_is_last(e)) {
2108 * This buffer is non-empty, so its first entry
2109 * could be used as the replacement entry.
2111 level = fnd->level - 1;
2117 /* This buffer is a node. Continue to go down. */
2118 vbn = de_get_vbn(e);
2124 n = fnd->nodes[level];
2125 te = hdr_first_de(&n->index->ihdr);
2126 /* Copy the candidate entry into the replacement entry buffer. */
2127 re = kmalloc(le16_to_cpu(te->size) + sizeof(u64), GFP_NOFS);
2133 *de_to_replace = re;
2134 memcpy(re, te, le16_to_cpu(te->size));
2136 if (!de_has_vcn(re)) {
2138 * The replacement entry we found doesn't have a sub_vcn.
2139 * increase its size to hold one.
2141 le16_add_cpu(&re->size, sizeof(u64));
2142 re->flags |= NTFS_IE_HAS_SUBNODES;
2145 * The replacement entry we found was a node entry, which
2146 * means that all its child buffers are empty. Return them
2149 indx_free_children(indx, ni, te, true);
2153 * Expunge the replacement entry from its former location,
2154 * and then write that buffer.
2157 e = hdr_delete_de(&ib->ihdr, te);
2160 indx_write(indx, ni, n, 0);
2162 /* Check to see if this action created an empty leaf. */
2163 if (ib_is_leaf(ib) && ib_is_empty(ib))
2172 * indx_delete_entry - Delete an entry from the index.
2174 int indx_delete_entry(struct ntfs_index *indx, struct ntfs_inode *ni,
2175 const void *key, u32 key_len, const void *ctx)
2178 struct INDEX_ROOT *root;
2179 struct INDEX_HDR *hdr;
2180 struct ntfs_fnd *fnd, *fnd2;
2181 struct INDEX_BUFFER *ib;
2182 struct NTFS_DE *e, *re, *next, *prev, *me;
2183 struct indx_node *n, *n2d = NULL;
2186 struct ATTRIB *attr;
2187 struct mft_inode *mi;
2188 u32 e_size, root_size, new_root_size;
2190 const struct INDEX_NAMES *in;
2204 root = indx_get_root(indx, ni, &attr, &mi);
2210 /* Locate the entry to remove. */
2211 err = indx_find(indx, ni, root, key, key_len, ctx, &diff, &e, fnd);
2223 n = fnd->nodes[level - 1];
2224 e = fnd->de[level - 1];
2233 e_size = le16_to_cpu(e->size);
2235 if (!de_has_vcn_ex(e)) {
2236 /* The entry to delete is a leaf, so we can just rip it out. */
2237 hdr_delete_de(hdr, e);
2240 hdr->total = hdr->used;
2242 /* Shrink resident root attribute. */
2243 mi_resize_attr(mi, attr, 0 - e_size);
2247 indx_write(indx, ni, n, 0);
2250 * Check to see if removing that entry made
2253 if (ib_is_leaf(ib) && ib_is_empty(ib)) {
2255 fnd_push(fnd2, n, e);
2259 * The entry we wish to delete is a node buffer, so we
2260 * have to find a replacement for it.
2262 next = de_get_next(e);
2264 err = indx_get_entry_to_replace(indx, ni, next, &re, fnd2);
2269 de_set_vbn_le(re, de_get_vbn_le(e));
2270 hdr_delete_de(hdr, e);
2272 err = level ? indx_insert_into_buffer(indx, ni, root,
2276 : indx_insert_into_root(indx, ni, re, e,
2284 * There is no replacement for the current entry.
2285 * This means that the subtree rooted at its node
2286 * is empty, and can be deleted, which turn means
2287 * that the node can just inherit the deleted
2290 indx_free_children(indx, ni, next, true);
2292 de_set_vbn_le(next, de_get_vbn_le(e));
2293 hdr_delete_de(hdr, e);
2295 indx_write(indx, ni, n, 0);
2297 hdr->total = hdr->used;
2299 /* Shrink resident root attribute. */
2300 mi_resize_attr(mi, attr, 0 - e_size);
2305 /* Delete a branch of tree. */
2306 if (!fnd2 || !fnd2->level)
2309 /* Reinit root 'cause it can be changed. */
2310 root = indx_get_root(indx, ni, &attr, &mi);
2317 sub_vbn = fnd2->nodes[0]->index->vbn;
2321 hdr = level ? &fnd->nodes[level - 1]->index->ihdr : &root->ihdr;
2323 /* Scan current level. */
2324 for (e = hdr_first_de(hdr);; e = hdr_next_de(hdr, e)) {
2330 if (de_has_vcn(e) && sub_vbn == de_get_vbn_le(e))
2333 if (de_is_last(e)) {
2340 /* Do slow search from root. */
2341 struct indx_node *in;
2345 in = indx_find_buffer(indx, ni, root, sub_vbn, NULL);
2352 fnd_push(fnd, in, NULL);
2355 /* Merge fnd2 -> fnd. */
2356 for (level = 0; level < fnd2->level; level++) {
2357 fnd_push(fnd, fnd2->nodes[level], fnd2->de[level]);
2358 fnd2->nodes[level] = NULL;
2363 for (level = fnd->level; level; level--) {
2364 struct indx_node *in = fnd->nodes[level - 1];
2367 if (ib_is_empty(ib)) {
2380 e = hdr_first_de(hdr);
2386 if (hdr != &root->ihdr || !de_is_last(e)) {
2388 while (!de_is_last(e)) {
2389 if (de_has_vcn(e) && sub_vbn == de_get_vbn_le(e))
2392 e = hdr_next_de(hdr, e);
2399 if (sub_vbn != de_get_vbn_le(e)) {
2401 * Didn't find the parent entry, although this buffer
2402 * is the parent trail. Something is corrupt.
2408 if (de_is_last(e)) {
2410 * Since we can't remove the end entry, we'll remove
2411 * its predecessor instead. This means we have to
2412 * transfer the predecessor's sub_vcn to the end entry.
2413 * Note: This index block is not empty, so the
2414 * predecessor must exist.
2421 if (de_has_vcn(prev)) {
2422 de_set_vbn_le(e, de_get_vbn_le(prev));
2423 } else if (de_has_vcn(e)) {
2424 le16_sub_cpu(&e->size, sizeof(u64));
2425 e->flags &= ~NTFS_IE_HAS_SUBNODES;
2426 le32_sub_cpu(&hdr->used, sizeof(u64));
2432 * Copy the current entry into a temporary buffer (stripping
2433 * off its down-pointer, if any) and delete it from the current
2434 * buffer or root, as appropriate.
2436 e_size = le16_to_cpu(e->size);
2437 me = kmemdup(e, e_size, GFP_NOFS);
2443 if (de_has_vcn(me)) {
2444 me->flags &= ~NTFS_IE_HAS_SUBNODES;
2445 le16_sub_cpu(&me->size, sizeof(u64));
2448 hdr_delete_de(hdr, e);
2450 if (hdr == &root->ihdr) {
2452 hdr->total = hdr->used;
2454 /* Shrink resident root attribute. */
2455 mi_resize_attr(mi, attr, 0 - e_size);
2457 indx_write(indx, ni, n2d, 0);
2461 /* Mark unused buffers as free. */
2463 for (; level < fnd->level; level++) {
2464 ib = fnd->nodes[level]->index;
2465 if (ib_is_empty(ib)) {
2466 size_t k = le64_to_cpu(ib->vbn) >>
2469 indx_mark_free(indx, ni, k);
2476 /*fnd->root_de = NULL;*/
2479 * Re-insert the entry into the tree.
2480 * Find the spot the tree where we want to insert the new entry.
2482 err = indx_insert_entry(indx, ni, me, ctx, fnd, 0);
2488 indx_shrink(indx, ni, trim_bit);
2491 * This tree needs to be collapsed down to an empty root.
2492 * Recreate the index root as an empty leaf and free all
2493 * the bits the index allocation bitmap.
2498 in = &s_index_names[indx->type];
2500 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2501 &indx->alloc_run, 0, NULL, false, NULL);
2502 err = ni_remove_attr(ni, ATTR_ALLOC, in->name, in->name_len,
2504 run_close(&indx->alloc_run);
2506 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2507 &indx->bitmap_run, 0, NULL, false, NULL);
2508 err = ni_remove_attr(ni, ATTR_BITMAP, in->name, in->name_len,
2510 run_close(&indx->bitmap_run);
2512 root = indx_get_root(indx, ni, &attr, &mi);
2518 root_size = le32_to_cpu(attr->res.data_size);
2520 sizeof(struct INDEX_ROOT) + sizeof(struct NTFS_DE);
2522 if (new_root_size != root_size &&
2523 !mi_resize_attr(mi, attr, new_root_size - root_size)) {
2528 /* Fill first entry. */
2529 e = (struct NTFS_DE *)(root + 1);
2533 e->size = cpu_to_le16(sizeof(struct NTFS_DE));
2534 e->flags = NTFS_IE_LAST; // 0x02
2540 hdr->used = hdr->total = cpu_to_le32(
2541 new_root_size - offsetof(struct INDEX_ROOT, ihdr));
2554 * Update duplicated information in directory entry
2555 * 'dup' - info from MFT record
2557 int indx_update_dup(struct ntfs_inode *ni, struct ntfs_sb_info *sbi,
2558 const struct ATTR_FILE_NAME *fname,
2559 const struct NTFS_DUP_INFO *dup, int sync)
2562 struct NTFS_DE *e = NULL;
2563 struct ATTR_FILE_NAME *e_fname;
2564 struct ntfs_fnd *fnd;
2565 struct INDEX_ROOT *root;
2566 struct mft_inode *mi;
2567 struct ntfs_index *indx = &ni->dir;
2573 root = indx_get_root(indx, ni, NULL, &mi);
2579 /* Find entry in directory. */
2580 err = indx_find(indx, ni, root, fname, fname_full_size(fname), sbi,
2595 e_fname = (struct ATTR_FILE_NAME *)(e + 1);
2597 if (!memcmp(&e_fname->dup, dup, sizeof(*dup))) {
2599 * Nothing to update in index! Try to avoid this call.
2604 memcpy(&e_fname->dup, dup, sizeof(*dup));
2607 /* Directory entry in index. */
2608 err = indx_write(indx, ni, fnd->nodes[fnd->level - 1], sync);
2610 /* Directory entry in directory MFT record. */
2613 err = mi_write(mi, 1);
2615 mark_inode_dirty(&ni->vfs_inode);