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/nls.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 * 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);
65 /* $SII of $Secure and $Q of Quota */
66 static int cmp_uint(const void *key1, size_t l1, const void *key2, size_t l2,
83 static int cmp_sdh(const void *key1, size_t l1, const void *key2, size_t l2,
86 const struct SECURITY_KEY *k1 = key1;
87 const struct SECURITY_KEY *k2 = key2;
90 if (l2 < sizeof(struct SECURITY_KEY))
93 t1 = le32_to_cpu(k1->hash);
94 t2 = le32_to_cpu(k2->hash);
96 /* First value is a hash value itself */
102 /* Second value is security Id */
104 t1 = le32_to_cpu(k1->sec_id);
105 t2 = le32_to_cpu(k2->sec_id);
115 /* $O of ObjId and "$R" for Reparse */
116 static int cmp_uints(const void *key1, size_t l1, const void *key2, size_t l2,
119 const __le32 *k1 = key1;
120 const __le32 *k2 = key2;
123 if ((size_t)data == 1) {
125 * ni_delete_all -> ntfs_remove_reparse -> delete all with this reference
126 * k1, k2 - pointers to REPARSE_KEY
129 k1 += 1; // skip REPARSE_KEY.ReparseTag
130 k2 += 1; // skip REPARSE_KEY.ReparseTag
131 if (l2 <= sizeof(int))
134 if (l1 <= sizeof(int))
139 if (l2 < sizeof(int))
142 for (count = min(l1, l2) >> 2; count > 0; --count, ++k1, ++k2) {
143 u32 t1 = le32_to_cpu(*k1);
144 u32 t2 = le32_to_cpu(*k2);
160 static inline NTFS_CMP_FUNC get_cmp_func(const struct INDEX_ROOT *root)
162 switch (root->type) {
164 if (root->rule == NTFS_COLLATION_TYPE_FILENAME)
168 switch (root->rule) {
169 case NTFS_COLLATION_TYPE_UINT:
171 case NTFS_COLLATION_TYPE_SECURITY_HASH:
173 case NTFS_COLLATION_TYPE_UINTS:
187 struct mft_inode *mi;
188 struct buffer_head *bh;
195 static int bmp_buf_get(struct ntfs_index *indx, struct ntfs_inode *ni,
196 size_t bit, struct bmp_buf *bbuf)
199 size_t data_size, valid_size, vbo, off = bit >> 3;
200 struct ntfs_sb_info *sbi = ni->mi.sbi;
201 CLST vcn = off >> sbi->cluster_bits;
202 struct ATTR_LIST_ENTRY *le = NULL;
203 struct buffer_head *bh;
204 struct super_block *sb;
206 const struct INDEX_NAMES *in = &s_index_names[indx->type];
210 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
217 data_size = le32_to_cpu(b->res.data_size);
219 if (off >= data_size)
222 bbuf->buf = (ulong *)resident_data(b);
224 bbuf->nbits = data_size * 8;
229 data_size = le64_to_cpu(b->nres.data_size);
230 if (WARN_ON(off >= data_size)) {
231 /* looks like filesystem error */
235 valid_size = le64_to_cpu(b->nres.valid_size);
237 bh = ntfs_bread_run(sbi, &indx->bitmap_run, off);
246 if (buffer_locked(bh))
247 __wait_on_buffer(bh);
252 blocksize = sb->s_blocksize;
254 vbo = off & ~(size_t)sbi->block_mask;
256 bbuf->new_valid = vbo + blocksize;
257 if (bbuf->new_valid <= valid_size)
259 else if (bbuf->new_valid > data_size)
260 bbuf->new_valid = data_size;
262 if (vbo >= valid_size) {
263 memset(bh->b_data, 0, blocksize);
264 } else if (vbo + blocksize > valid_size) {
265 u32 voff = valid_size & sbi->block_mask;
267 memset(bh->b_data + voff, 0, blocksize - voff);
270 bbuf->buf = (ulong *)bh->b_data;
271 bbuf->bit = 8 * (off & ~(size_t)sbi->block_mask);
272 bbuf->nbits = 8 * blocksize;
277 static void bmp_buf_put(struct bmp_buf *bbuf, bool dirty)
279 struct buffer_head *bh = bbuf->bh;
280 struct ATTRIB *b = bbuf->b;
283 if (b && !b->non_res && dirty)
284 bbuf->mi->dirty = true;
291 if (bbuf->new_valid) {
292 b->nres.valid_size = cpu_to_le64(bbuf->new_valid);
293 bbuf->mi->dirty = true;
296 set_buffer_uptodate(bh);
297 mark_buffer_dirty(bh);
307 * marks the bit 'bit' as used
309 static int indx_mark_used(struct ntfs_index *indx, struct ntfs_inode *ni,
315 err = bmp_buf_get(indx, ni, bit, &bbuf);
319 __set_bit(bit - bbuf.bit, bbuf.buf);
321 bmp_buf_put(&bbuf, true);
329 * the bit 'bit' as free
331 static int indx_mark_free(struct ntfs_index *indx, struct ntfs_inode *ni,
337 err = bmp_buf_get(indx, ni, bit, &bbuf);
341 __clear_bit(bit - bbuf.bit, bbuf.buf);
343 bmp_buf_put(&bbuf, true);
349 * if ntfs_readdir calls this function (indx_used_bit -> scan_nres_bitmap),
350 * inode is shared locked and no ni_lock
351 * use rw_semaphore for read/write access to bitmap_run
353 static int scan_nres_bitmap(struct ntfs_inode *ni, struct ATTRIB *bitmap,
354 struct ntfs_index *indx, size_t from,
355 bool (*fn)(const ulong *buf, u32 bit, u32 bits,
359 struct ntfs_sb_info *sbi = ni->mi.sbi;
360 struct super_block *sb = sbi->sb;
361 struct runs_tree *run = &indx->bitmap_run;
362 struct rw_semaphore *lock = &indx->run_lock;
363 u32 nbits = sb->s_blocksize * 8;
364 u32 blocksize = sb->s_blocksize;
365 u64 valid_size = le64_to_cpu(bitmap->nres.valid_size);
366 u64 data_size = le64_to_cpu(bitmap->nres.data_size);
367 sector_t eblock = bytes_to_block(sb, data_size);
368 size_t vbo = from >> 3;
369 sector_t blk = (vbo & sbi->cluster_mask) >> sb->s_blocksize_bits;
370 sector_t vblock = vbo >> sb->s_blocksize_bits;
371 sector_t blen, block;
372 CLST lcn, clen, vcn, vcn_next;
374 struct buffer_head *bh;
379 if (vblock >= eblock)
383 vcn = vbo >> sbi->cluster_bits;
386 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
392 const struct INDEX_NAMES *name = &s_index_names[indx->type];
395 err = attr_load_runs_vcn(ni, ATTR_BITMAP, name->name,
396 name->name_len, run, vcn);
401 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
407 blen = (sector_t)clen * sbi->blocks_per_cluster;
408 block = (sector_t)lcn * sbi->blocks_per_cluster;
410 for (; blk < blen; blk++, from = 0) {
411 bh = ntfs_bread(sb, block + blk);
415 vbo = (u64)vblock << sb->s_blocksize_bits;
416 if (vbo >= valid_size) {
417 memset(bh->b_data, 0, blocksize);
418 } else if (vbo + blocksize > valid_size) {
419 u32 voff = valid_size & sbi->block_mask;
421 memset(bh->b_data + voff, 0, blocksize - voff);
424 if (vbo + blocksize > data_size)
425 nbits = 8 * (data_size - vbo);
427 ok = nbits > from ? (*fn)((ulong *)bh->b_data, from, nbits, ret)
436 if (++vblock >= eblock) {
442 vcn_next = vcn + clen;
444 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) && vcn == vcn_next;
451 static bool scan_for_free(const ulong *buf, u32 bit, u32 bits, size_t *ret)
453 size_t pos = find_next_zero_bit(buf, bits, bit);
465 * returns -1 if no free bits
467 static int indx_find_free(struct ntfs_index *indx, struct ntfs_inode *ni,
468 size_t *bit, struct ATTRIB **bitmap)
471 struct ATTR_LIST_ENTRY *le = NULL;
472 const struct INDEX_NAMES *in = &s_index_names[indx->type];
475 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
485 u32 nbits = 8 * le32_to_cpu(b->res.data_size);
486 size_t pos = find_next_zero_bit(resident_data(b), nbits, 0);
491 err = scan_nres_bitmap(ni, b, indx, 0, &scan_for_free, bit);
500 static bool scan_for_used(const ulong *buf, u32 bit, u32 bits, size_t *ret)
502 size_t pos = find_next_bit(buf, bits, bit);
514 * returns MINUS_ONE_T if no used bits
516 int indx_used_bit(struct ntfs_index *indx, struct ntfs_inode *ni, size_t *bit)
519 struct ATTR_LIST_ENTRY *le = NULL;
521 const struct INDEX_NAMES *in = &s_index_names[indx->type];
524 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
533 u32 nbits = le32_to_cpu(b->res.data_size) * 8;
534 size_t pos = find_next_bit(resident_data(b), nbits, from);
539 err = scan_nres_bitmap(ni, b, indx, from, &scan_for_used, bit);
550 * finds a point at which the index allocation buffer would like to
552 * NOTE: This function should never return 'END' entry NULL returns on error
554 static const struct NTFS_DE *hdr_find_split(const struct INDEX_HDR *hdr)
557 const struct NTFS_DE *e = hdr_first_de(hdr);
558 u32 used_2 = le32_to_cpu(hdr->used) >> 1;
559 u16 esize = le16_to_cpu(e->size);
561 if (!e || de_is_last(e))
564 for (o = le32_to_cpu(hdr->de_off) + esize; o < used_2; o += esize) {
565 const struct NTFS_DE *p = e;
569 /* We must not return END entry */
573 esize = le16_to_cpu(e->size);
582 * inserts some entries at the beginning of the buffer.
583 * It is used to insert entries into a newly-created buffer.
585 static const struct NTFS_DE *hdr_insert_head(struct INDEX_HDR *hdr,
586 const void *ins, u32 ins_bytes)
589 struct NTFS_DE *e = hdr_first_de(hdr);
590 u32 used = le32_to_cpu(hdr->used);
595 /* Now we just make room for the inserted entries and jam it in. */
596 to_move = used - le32_to_cpu(hdr->de_off);
597 memmove(Add2Ptr(e, ins_bytes), e, to_move);
598 memcpy(e, ins, ins_bytes);
599 hdr->used = cpu_to_le32(used + ins_bytes);
604 void fnd_clear(struct ntfs_fnd *fnd)
608 for (i = 0; i < fnd->level; i++) {
609 struct indx_node *n = fnd->nodes[i];
615 fnd->nodes[i] = NULL;
621 static int fnd_push(struct ntfs_fnd *fnd, struct indx_node *n,
627 if (i < 0 || i >= ARRAY_SIZE(fnd->nodes))
635 static struct indx_node *fnd_pop(struct ntfs_fnd *fnd)
642 fnd->nodes[i] = NULL;
648 static bool fnd_is_empty(struct ntfs_fnd *fnd)
651 return !fnd->root_de;
653 return !fnd->de[fnd->level - 1];
659 * locates an entry the index buffer.
660 * If no matching entry is found, it returns the first entry which is greater
661 * than the desired entry If the search key is greater than all the entries the
662 * buffer, it returns the 'end' entry. This function does a binary search of the
663 * current index buffer, for the first entry that is <= to the search value
664 * Returns NULL if error
666 static struct NTFS_DE *hdr_find_e(const struct ntfs_index *indx,
667 const struct INDEX_HDR *hdr, const void *key,
668 size_t key_len, const void *ctx, int *diff)
671 NTFS_CMP_FUNC cmp = indx->cmp;
672 u32 e_size, e_key_len;
673 u32 end = le32_to_cpu(hdr->used);
674 u32 off = le32_to_cpu(hdr->de_off);
676 #ifdef NTFS3_INDEX_BINARY_SEARCH
677 int max_idx = 0, fnd, min_idx;
684 offs = ntfs_malloc(sizeof(u16) * nslots);
688 /* use binary search algorithm */
690 if (off + sizeof(struct NTFS_DE) > end) {
694 e = Add2Ptr(hdr, off);
695 e_size = le16_to_cpu(e->size);
697 if (e_size < sizeof(struct NTFS_DE) || off + e_size > end) {
702 if (max_idx >= nslots) {
704 int new_slots = QuadAlign(2 * nslots);
706 ptr = ntfs_malloc(sizeof(u16) * new_slots);
708 memcpy(ptr, offs, sizeof(u16) * max_idx);
716 /* Store entry table */
719 if (!de_is_last(e)) {
726 * Table of pointers is created
727 * Use binary search to find entry that is <= to the search value
732 while (min_idx <= max_idx) {
733 int mid_idx = min_idx + ((max_idx - min_idx) >> 1);
736 e = Add2Ptr(hdr, offs[mid_idx]);
738 e_key_len = le16_to_cpu(e->key_size);
740 diff2 = (*cmp)(key, key_len, e + 1, e_key_len, ctx);
748 max_idx = mid_idx - 1;
753 min_idx = mid_idx + 1;
763 e = Add2Ptr(hdr, offs[fnd]);
773 * Entries index are sorted
774 * Enumerate all entries until we find entry that is <= to the search value
776 if (off + sizeof(struct NTFS_DE) > end)
779 e = Add2Ptr(hdr, off);
780 e_size = le16_to_cpu(e->size);
782 if (e_size < sizeof(struct NTFS_DE) || off + e_size > end)
787 e_key_len = le16_to_cpu(e->key_size);
789 *diff = (*cmp)(key, key_len, e + 1, e_key_len, ctx);
806 * inserts an index entry into the buffer.
807 * 'before' should be a pointer previously returned from hdr_find_e
809 static struct NTFS_DE *hdr_insert_de(const struct ntfs_index *indx,
810 struct INDEX_HDR *hdr,
811 const struct NTFS_DE *de,
812 struct NTFS_DE *before, const void *ctx)
815 size_t off = PtrOffset(hdr, before);
816 u32 used = le32_to_cpu(hdr->used);
817 u32 total = le32_to_cpu(hdr->total);
818 u16 de_size = le16_to_cpu(de->size);
820 /* First, check to see if there's enough room */
821 if (used + de_size > total)
824 /* We know there's enough space, so we know we'll succeed. */
826 /* Check that before is inside Index */
827 if (off >= used || off < le32_to_cpu(hdr->de_off) ||
828 off + le16_to_cpu(before->size) > total) {
833 /* No insert point is applied. Get it manually */
834 before = hdr_find_e(indx, hdr, de + 1, le16_to_cpu(de->key_size), ctx,
838 off = PtrOffset(hdr, before);
841 /* Now we just make room for the entry and jam it in. */
842 memmove(Add2Ptr(before, de_size), before, used - off);
844 hdr->used = cpu_to_le32(used + de_size);
845 memcpy(before, de, de_size);
853 * removes an entry from the index buffer
855 static inline struct NTFS_DE *hdr_delete_de(struct INDEX_HDR *hdr,
858 u32 used = le32_to_cpu(hdr->used);
859 u16 esize = le16_to_cpu(re->size);
860 u32 off = PtrOffset(hdr, re);
861 int bytes = used - (off + esize);
863 if (off >= used || esize < sizeof(struct NTFS_DE) ||
864 bytes < sizeof(struct NTFS_DE))
867 hdr->used = cpu_to_le32(used - esize);
868 memmove(re, Add2Ptr(re, esize), bytes);
873 void indx_clear(struct ntfs_index *indx)
875 run_close(&indx->alloc_run);
876 run_close(&indx->bitmap_run);
879 int indx_init(struct ntfs_index *indx, struct ntfs_sb_info *sbi,
880 const struct ATTRIB *attr, enum index_mutex_classed type)
883 const struct INDEX_ROOT *root = resident_data(attr);
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);
919 return indx->cmp ? 0 : -EINVAL;
922 static struct indx_node *indx_new(struct ntfs_index *indx,
923 struct ntfs_inode *ni, CLST vbn,
924 const __le64 *sub_vbn)
929 struct INDEX_HDR *hdr;
930 struct INDEX_BUFFER *index;
931 u64 vbo = (u64)vbn << indx->vbn2vbo_bits;
932 u32 bytes = 1u << indx->index_bits;
936 r = ntfs_zalloc(sizeof(struct indx_node));
938 return ERR_PTR(-ENOMEM);
940 index = ntfs_zalloc(bytes);
943 return ERR_PTR(-ENOMEM);
946 err = ntfs_get_bh(ni->mi.sbi, &indx->alloc_run, vbo, bytes, &r->nb);
955 index->rhdr.sign = NTFS_INDX_SIGNATURE;
956 index->rhdr.fix_off = cpu_to_le16(sizeof(struct INDEX_BUFFER)); // 0x28
957 fn = (bytes >> SECTOR_SHIFT) + 1; // 9
958 index->rhdr.fix_num = cpu_to_le16(fn);
959 index->vbn = cpu_to_le64(vbn);
961 eo = QuadAlign(sizeof(struct INDEX_BUFFER) + fn * sizeof(short));
962 hdr->de_off = cpu_to_le32(eo);
964 e = Add2Ptr(hdr, eo);
967 e->flags = NTFS_IE_LAST | NTFS_IE_HAS_SUBNODES;
968 e->size = cpu_to_le16(sizeof(struct NTFS_DE) + sizeof(u64));
970 cpu_to_le32(eo + sizeof(struct NTFS_DE) + sizeof(u64));
971 de_set_vbn_le(e, *sub_vbn);
974 e->size = cpu_to_le16(sizeof(struct NTFS_DE));
975 hdr->used = cpu_to_le32(eo + sizeof(struct NTFS_DE));
976 e->flags = NTFS_IE_LAST;
979 hdr->total = cpu_to_le32(bytes - offsetof(struct INDEX_BUFFER, ihdr));
985 struct INDEX_ROOT *indx_get_root(struct ntfs_index *indx, struct ntfs_inode *ni,
986 struct ATTRIB **attr, struct mft_inode **mi)
988 struct ATTR_LIST_ENTRY *le = NULL;
990 const struct INDEX_NAMES *in = &s_index_names[indx->type];
992 a = ni_find_attr(ni, NULL, &le, ATTR_ROOT, in->name, in->name_len, NULL,
1000 return resident_data_ex(a, sizeof(struct INDEX_ROOT));
1003 static int indx_write(struct ntfs_index *indx, struct ntfs_inode *ni,
1004 struct indx_node *node, int sync)
1006 struct INDEX_BUFFER *ib = node->index;
1008 return ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &node->nb, sync);
1012 * if ntfs_readdir calls this function
1013 * inode is shared locked and no ni_lock
1014 * use rw_semaphore for read/write access to alloc_run
1016 int indx_read(struct ntfs_index *indx, struct ntfs_inode *ni, CLST vbn,
1017 struct indx_node **node)
1020 struct INDEX_BUFFER *ib;
1021 struct runs_tree *run = &indx->alloc_run;
1022 struct rw_semaphore *lock = &indx->run_lock;
1023 u64 vbo = (u64)vbn << indx->vbn2vbo_bits;
1024 u32 bytes = 1u << indx->index_bits;
1025 struct indx_node *in = *node;
1026 const struct INDEX_NAMES *name;
1029 in = ntfs_zalloc(sizeof(struct indx_node));
1038 ib = ntfs_malloc(bytes);
1046 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1051 if (err == -E_NTFS_FIXUP)
1057 name = &s_index_names[indx->type];
1059 err = attr_load_runs_range(ni, ATTR_ALLOC, name->name, name->name_len,
1060 run, vbo, vbo + bytes);
1066 err = ntfs_read_bh(ni->mi.sbi, run, vbo, &ib->rhdr, bytes, &in->nb);
1068 if (err == -E_NTFS_FIXUP)
1075 if (err == -E_NTFS_FIXUP) {
1076 ntfs_write_bh(ni->mi.sbi, &ib->rhdr, &in->nb, 0);
1084 if (ib != in->index)
1098 * scans NTFS directory for given entry
1100 int indx_find(struct ntfs_index *indx, struct ntfs_inode *ni,
1101 const struct INDEX_ROOT *root, const void *key, size_t key_len,
1102 const void *ctx, int *diff, struct NTFS_DE **entry,
1103 struct ntfs_fnd *fnd)
1107 const struct INDEX_HDR *hdr;
1108 struct indx_node *node;
1111 root = indx_get_root(&ni->dir, ni, NULL, NULL);
1121 e = fnd->level ? fnd->de[fnd->level - 1] : fnd->root_de;
1122 if (e && !de_is_last(e) &&
1123 !(*indx->cmp)(key, key_len, e + 1, le16_to_cpu(e->key_size), ctx)) {
1129 /* Soft finder reset */
1132 /* Lookup entry that is <= to the search value */
1133 e = hdr_find_e(indx, hdr, key, key_len, ctx, diff);
1144 if (*diff >= 0 || !de_has_vcn_ex(e)) {
1149 /* Read next level. */
1150 err = indx_read(indx, ni, de_get_vbn(e), &node);
1154 /* Lookup entry that is <= to the search value */
1155 e = hdr_find_e(indx, &node->index->ihdr, key, key_len, ctx,
1159 put_indx_node(node);
1163 fnd_push(fnd, node, e);
1170 int indx_find_sort(struct ntfs_index *indx, struct ntfs_inode *ni,
1171 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1172 struct ntfs_fnd *fnd)
1175 struct indx_node *n = NULL;
1178 int level = fnd->level;
1182 e = hdr_first_de(&root->ihdr);
1187 } else if (!level) {
1188 if (de_is_last(fnd->root_de)) {
1193 e = hdr_next_de(&root->ihdr, fnd->root_de);
1198 n = fnd->nodes[level - 1];
1199 e = fnd->de[level - 1];
1204 e = hdr_next_de(&n->index->ihdr, e);
1208 fnd->de[level - 1] = e;
1211 /* Just to avoid tree cycle */
1216 while (de_has_vcn_ex(e)) {
1217 if (le16_to_cpu(e->size) <
1218 sizeof(struct NTFS_DE) + sizeof(u64)) {
1226 /* Read next level */
1227 err = indx_read(indx, ni, de_get_vbn(e), &n);
1231 /* Try next level */
1232 e = hdr_first_de(&n->index->ihdr);
1238 fnd_push(fnd, n, e);
1241 if (le16_to_cpu(e->size) > sizeof(struct NTFS_DE)) {
1260 n = fnd->nodes[level - 1];
1261 e = fnd->de[level - 1];
1262 } else if (fnd->root_de) {
1265 fnd->root_de = NULL;
1271 if (le16_to_cpu(e->size) > sizeof(struct NTFS_DE)) {
1280 int indx_find_raw(struct ntfs_index *indx, struct ntfs_inode *ni,
1281 const struct INDEX_ROOT *root, struct NTFS_DE **entry,
1282 size_t *off, struct ntfs_fnd *fnd)
1285 struct indx_node *n = NULL;
1286 struct NTFS_DE *e = NULL;
1291 u32 record_size = ni->mi.sbi->record_size;
1293 /* Use non sorted algorithm */
1295 /* This is the first call */
1296 e = hdr_first_de(&root->ihdr);
1302 /* The first call with setup of initial element */
1303 if (*off >= record_size) {
1304 next_vbn = (((*off - record_size) >> indx->index_bits))
1305 << indx->idx2vbn_bits;
1306 /* jump inside cycle 'for'*/
1310 /* Start enumeration from root */
1312 } else if (!fnd->root_de)
1316 /* Check if current entry can be used */
1317 if (e && le16_to_cpu(e->size) > sizeof(struct NTFS_DE))
1321 /* Continue to enumerate root */
1322 if (!de_is_last(fnd->root_de)) {
1323 e = hdr_next_de(&root->ihdr, fnd->root_de);
1330 /* Start to enumerate indexes from 0 */
1333 /* Continue to enumerate indexes */
1334 e2 = fnd->de[fnd->level - 1];
1336 n = fnd->nodes[fnd->level - 1];
1338 if (!de_is_last(e2)) {
1339 e = hdr_next_de(&n->index->ihdr, e2);
1342 fnd->de[fnd->level - 1] = e;
1346 /* Continue with next index */
1347 next_vbn = le64_to_cpu(n->index->vbn) +
1348 root->index_block_clst;
1352 /* Release current index */
1359 /* Skip all free indexes */
1360 bit = next_vbn >> indx->idx2vbn_bits;
1361 err = indx_used_bit(indx, ni, &bit);
1362 if (err == -ENOENT || bit == MINUS_ONE_T) {
1363 /* No used indexes */
1368 next_used_vbn = bit << indx->idx2vbn_bits;
1370 /* Read buffer into memory */
1371 err = indx_read(indx, ni, next_used_vbn, &n);
1375 e = hdr_first_de(&n->index->ihdr);
1376 fnd_push(fnd, n, e);
1382 /* return offset to restore enumerator if necessary */
1384 /* 'e' points in root */
1385 *off = PtrOffset(&root->ihdr, e);
1387 /* 'e' points in index */
1388 *off = (le64_to_cpu(n->index->vbn) << indx->vbn2vbo_bits) +
1389 record_size + PtrOffset(&n->index->ihdr, e);
1397 * indx_create_allocate
1399 * create "Allocation + Bitmap" attributes
1401 static int indx_create_allocate(struct ntfs_index *indx, struct ntfs_inode *ni,
1405 struct ntfs_sb_info *sbi = ni->mi.sbi;
1406 struct ATTRIB *bitmap;
1407 struct ATTRIB *alloc;
1408 u32 data_size = 1u << indx->index_bits;
1409 u32 alloc_size = ntfs_up_cluster(sbi, data_size);
1410 CLST len = alloc_size >> sbi->cluster_bits;
1411 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1413 struct runs_tree run;
1417 err = attr_allocate_clusters(sbi, &run, 0, 0, len, NULL, 0, &alen, 0,
1422 err = ni_insert_nonresident(ni, ATTR_ALLOC, in->name, in->name_len,
1423 &run, 0, len, 0, &alloc, NULL);
1427 alloc->nres.valid_size = alloc->nres.data_size = cpu_to_le64(data_size);
1429 err = ni_insert_resident(ni, bitmap_size(1), ATTR_BITMAP, in->name,
1430 in->name_len, &bitmap, NULL);
1434 if (in->name == I30_NAME) {
1435 ni->vfs_inode.i_size = data_size;
1436 inode_set_bytes(&ni->vfs_inode, alloc_size);
1439 memcpy(&indx->alloc_run, &run, sizeof(run));
1446 mi_remove_attr(&ni->mi, alloc);
1449 run_deallocate(sbi, &run, false);
1458 * add clusters to index
1460 static int indx_add_allocate(struct ntfs_index *indx, struct ntfs_inode *ni,
1466 u64 bmp_size, bmp_size_v;
1467 struct ATTRIB *bmp, *alloc;
1468 struct mft_inode *mi;
1469 const struct INDEX_NAMES *in = &s_index_names[indx->type];
1471 err = indx_find_free(indx, ni, &bit, &bmp);
1475 if (bit != MINUS_ONE_T) {
1479 bmp_size = le64_to_cpu(bmp->nres.data_size);
1480 bmp_size_v = le64_to_cpu(bmp->nres.valid_size);
1482 bmp_size = bmp_size_v = le32_to_cpu(bmp->res.data_size);
1485 bit = bmp_size << 3;
1488 data_size = (u64)(bit + 1) << indx->index_bits;
1491 /* Increase bitmap */
1492 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1493 &indx->bitmap_run, bitmap_size(bit + 1),
1499 alloc = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, in->name, in->name_len,
1507 /* Increase allocation */
1508 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
1509 &indx->alloc_run, data_size, &data_size, true,
1517 *vbn = bit << indx->idx2vbn_bits;
1522 /* Ops (no space?) */
1523 attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
1524 &indx->bitmap_run, bmp_size, &bmp_size_v, false, NULL);
1531 * indx_insert_into_root
1533 * attempts to insert an entry into the index root
1534 * If necessary, it will twiddle the index b-tree.
1536 static int indx_insert_into_root(struct ntfs_index *indx, struct ntfs_inode *ni,
1537 const struct NTFS_DE *new_de,
1538 struct NTFS_DE *root_de, const void *ctx,
1539 struct ntfs_fnd *fnd)
1542 struct NTFS_DE *e, *e0, *re;
1543 struct mft_inode *mi;
1544 struct ATTRIB *attr;
1545 struct MFT_REC *rec;
1546 struct INDEX_HDR *hdr;
1547 struct indx_node *n;
1549 __le64 *sub_vbn, t_vbn;
1551 u32 hdr_used, hdr_total, asize, used, to_move;
1552 u32 root_size, new_root_size;
1553 struct ntfs_sb_info *sbi;
1555 struct INDEX_ROOT *root, *a_root = NULL;
1557 /* Get the record this root placed in */
1558 root = indx_get_root(indx, ni, &attr, &mi);
1564 * hdr_insert_de will succeed if there's room the root for the new entry.
1569 used = le32_to_cpu(rec->used);
1570 new_de_size = le16_to_cpu(new_de->size);
1571 hdr_used = le32_to_cpu(hdr->used);
1572 hdr_total = le32_to_cpu(hdr->total);
1573 asize = le32_to_cpu(attr->size);
1574 root_size = le32_to_cpu(attr->res.data_size);
1576 ds_root = new_de_size + hdr_used - hdr_total;
1578 if (used + ds_root < sbi->max_bytes_per_attr) {
1579 /* make a room for new elements */
1580 mi_resize_attr(mi, attr, ds_root);
1581 hdr->total = cpu_to_le32(hdr_total + ds_root);
1582 e = hdr_insert_de(indx, hdr, new_de, root_de, ctx);
1590 /* Make a copy of root attribute to restore if error */
1591 a_root = ntfs_memdup(attr, asize);
1597 /* copy all the non-end entries from the index root to the new buffer.*/
1599 e0 = hdr_first_de(hdr);
1601 /* Calculate the size to copy */
1602 for (e = e0;; e = hdr_next_de(hdr, e)) {
1610 to_move += le16_to_cpu(e->size);
1617 re = ntfs_memdup(e0, to_move);
1625 if (de_has_vcn(e)) {
1626 t_vbn = de_get_vbn_le(e);
1630 new_root_size = sizeof(struct INDEX_ROOT) + sizeof(struct NTFS_DE) +
1632 ds_root = new_root_size - root_size;
1634 if (ds_root > 0 && used + ds_root > sbi->max_bytes_per_attr) {
1635 /* make root external */
1641 mi_resize_attr(mi, attr, ds_root);
1643 /* Fill first entry (vcn will be set later) */
1644 e = (struct NTFS_DE *)(root + 1);
1645 memset(e, 0, sizeof(struct NTFS_DE));
1646 e->size = cpu_to_le16(sizeof(struct NTFS_DE) + sizeof(u64));
1647 e->flags = NTFS_IE_HAS_SUBNODES | NTFS_IE_LAST;
1650 hdr->used = hdr->total =
1651 cpu_to_le32(new_root_size - offsetof(struct INDEX_ROOT, ihdr));
1653 fnd->root_de = hdr_first_de(hdr);
1656 /* Create alloc and bitmap attributes (if not) */
1657 err = run_is_empty(&indx->alloc_run)
1658 ? indx_create_allocate(indx, ni, &new_vbn)
1659 : indx_add_allocate(indx, ni, &new_vbn);
1661 /* layout of record may be changed, so rescan root */
1662 root = indx_get_root(indx, ni, &attr, &mi);
1665 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
1672 if (mi_resize_attr(mi, attr, -ds_root))
1673 memcpy(attr, a_root, asize);
1676 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
1681 e = (struct NTFS_DE *)(root + 1);
1682 *(__le64 *)(e + 1) = cpu_to_le64(new_vbn);
1685 /* now we can create/format the new buffer and copy the entries into */
1686 n = indx_new(indx, ni, new_vbn, sub_vbn);
1692 hdr = &n->index->ihdr;
1693 hdr_used = le32_to_cpu(hdr->used);
1694 hdr_total = le32_to_cpu(hdr->total);
1696 /* Copy root entries into new buffer */
1697 hdr_insert_head(hdr, re, to_move);
1699 /* Update bitmap attribute */
1700 indx_mark_used(indx, ni, new_vbn >> indx->idx2vbn_bits);
1702 /* Check if we can insert new entry new index buffer */
1703 if (hdr_used + new_de_size > hdr_total) {
1705 * This occurs if mft record is the same or bigger than index
1706 * buffer. Move all root new index and have no space to add
1707 * new entry classic case when mft record is 1K and index
1708 * buffer 4K the problem should not occurs
1711 indx_write(indx, ni, n, 0);
1715 err = indx_insert_entry(indx, ni, new_de, ctx, fnd);
1720 * Now root is a parent for new index buffer
1721 * Insert NewEntry a new buffer
1723 e = hdr_insert_de(indx, hdr, new_de, NULL, ctx);
1728 fnd_push(fnd, n, e);
1730 /* Just write updates index into disk */
1731 indx_write(indx, ni, n, 0);
1746 * indx_insert_into_buffer
1748 * attempts to insert an entry into an Index Allocation Buffer.
1749 * If necessary, it will split the buffer.
1752 indx_insert_into_buffer(struct ntfs_index *indx, struct ntfs_inode *ni,
1753 struct INDEX_ROOT *root, const struct NTFS_DE *new_de,
1754 const void *ctx, int level, struct ntfs_fnd *fnd)
1757 const struct NTFS_DE *sp;
1758 struct NTFS_DE *e, *de_t, *up_e = NULL;
1759 struct indx_node *n2 = NULL;
1760 struct indx_node *n1 = fnd->nodes[level];
1761 struct INDEX_HDR *hdr1 = &n1->index->ihdr;
1762 struct INDEX_HDR *hdr2;
1765 __le64 t_vbn, *sub_vbn;
1768 /* Try the most easy case */
1769 e = fnd->level - 1 == level ? fnd->de[level] : NULL;
1770 e = hdr_insert_de(indx, hdr1, new_de, e, ctx);
1773 /* Just write updated index into disk */
1774 indx_write(indx, ni, n1, 0);
1779 * No space to insert into buffer. Split it.
1781 * - Save split point ('cause index buffers will be changed)
1782 * - Allocate NewBuffer and copy all entries <= sp into new buffer
1783 * - Remove all entries (sp including) from TargetBuffer
1784 * - Insert NewEntry into left or right buffer (depending on sp <=>
1786 * - Insert sp into parent buffer (or root)
1787 * - Make sp a parent for new buffer
1789 sp = hdr_find_split(hdr1);
1793 sp_size = le16_to_cpu(sp->size);
1794 up_e = ntfs_malloc(sp_size + sizeof(u64));
1797 memcpy(up_e, sp, sp_size);
1800 up_e->flags |= NTFS_IE_HAS_SUBNODES;
1801 up_e->size = cpu_to_le16(sp_size + sizeof(u64));
1804 t_vbn = de_get_vbn_le(up_e);
1808 /* Allocate on disk a new index allocation buffer. */
1809 err = indx_add_allocate(indx, ni, &new_vbn);
1813 /* Allocate and format memory a new index buffer */
1814 n2 = indx_new(indx, ni, new_vbn, sub_vbn);
1820 hdr2 = &n2->index->ihdr;
1822 /* Make sp a parent for new buffer */
1823 de_set_vbn(up_e, new_vbn);
1825 /* copy all the entries <= sp into the new buffer. */
1826 de_t = hdr_first_de(hdr1);
1827 to_copy = PtrOffset(de_t, sp);
1828 hdr_insert_head(hdr2, de_t, to_copy);
1830 /* remove all entries (sp including) from hdr1 */
1831 used = le32_to_cpu(hdr1->used) - to_copy - sp_size;
1832 memmove(de_t, Add2Ptr(sp, sp_size), used - le32_to_cpu(hdr1->de_off));
1833 hdr1->used = cpu_to_le32(used);
1835 /* Insert new entry into left or right buffer (depending on sp <=> new_de) */
1837 (*indx->cmp)(new_de + 1, le16_to_cpu(new_de->key_size),
1838 up_e + 1, le16_to_cpu(up_e->key_size),
1844 indx_mark_used(indx, ni, new_vbn >> indx->idx2vbn_bits);
1846 indx_write(indx, ni, n1, 0);
1847 indx_write(indx, ni, n2, 0);
1852 * we've finished splitting everybody, so we are ready to
1853 * insert the promoted entry into the parent.
1856 /* Insert in root */
1857 err = indx_insert_into_root(indx, ni, up_e, NULL, ctx, fnd);
1862 * The target buffer's parent is another index buffer
1863 * TODO: Remove recursion
1865 err = indx_insert_into_buffer(indx, ni, root, up_e, ctx,
1880 * inserts new entry into index
1882 int indx_insert_entry(struct ntfs_index *indx, struct ntfs_inode *ni,
1883 const struct NTFS_DE *new_de, const void *ctx,
1884 struct ntfs_fnd *fnd)
1889 struct ntfs_fnd *fnd_a = NULL;
1890 struct INDEX_ROOT *root;
1901 root = indx_get_root(indx, ni, NULL, NULL);
1907 if (fnd_is_empty(fnd)) {
1908 /* Find the spot the tree where we want to insert the new entry. */
1909 err = indx_find(indx, ni, root, new_de + 1,
1910 le16_to_cpu(new_de->key_size), ctx, &diff, &e,
1922 /* The root is also a leaf, so we'll insert the new entry into it. */
1923 err = indx_insert_into_root(indx, ni, new_de, fnd->root_de, ctx,
1928 /* found a leaf buffer, so we'll insert the new entry into it.*/
1929 err = indx_insert_into_buffer(indx, ni, root, new_de, ctx,
1930 fnd->level - 1, fnd);
1944 * locates a buffer the tree.
1946 static struct indx_node *indx_find_buffer(struct ntfs_index *indx,
1947 struct ntfs_inode *ni,
1948 const struct INDEX_ROOT *root,
1949 __le64 vbn, struct indx_node *n)
1952 const struct NTFS_DE *e;
1953 struct indx_node *r;
1954 const struct INDEX_HDR *hdr = n ? &n->index->ihdr : &root->ihdr;
1956 /* Step 1: Scan one level */
1957 for (e = hdr_first_de(hdr);; e = hdr_next_de(hdr, e)) {
1959 return ERR_PTR(-EINVAL);
1961 if (de_has_vcn(e) && vbn == de_get_vbn_le(e))
1968 /* Step2: Do recursion */
1969 e = Add2Ptr(hdr, le32_to_cpu(hdr->de_off));
1971 if (de_has_vcn_ex(e)) {
1972 err = indx_read(indx, ni, de_get_vbn(e), &n);
1974 return ERR_PTR(err);
1976 r = indx_find_buffer(indx, ni, root, vbn, n);
1984 e = Add2Ptr(e, le16_to_cpu(e->size));
1993 * deallocates unused tail indexes
1995 static int indx_shrink(struct ntfs_index *indx, struct ntfs_inode *ni,
2002 struct ATTR_LIST_ENTRY *le = NULL;
2003 const struct INDEX_NAMES *in = &s_index_names[indx->type];
2005 b = ni_find_attr(ni, NULL, &le, ATTR_BITMAP, in->name, in->name_len,
2013 const unsigned long *bm = resident_data(b);
2015 nbits = (size_t)le32_to_cpu(b->res.data_size) * 8;
2020 pos = find_next_bit(bm, nbits, bit);
2024 size_t used = MINUS_ONE_T;
2026 nbits = le64_to_cpu(b->nres.data_size) * 8;
2031 err = scan_nres_bitmap(ni, b, indx, bit, &scan_for_used, &used);
2035 if (used != MINUS_ONE_T)
2039 new_data = (u64)bit << indx->index_bits;
2041 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2042 &indx->alloc_run, new_data, &new_data, false, NULL);
2046 bpb = bitmap_size(bit);
2047 if (bpb * 8 == nbits)
2050 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2051 &indx->bitmap_run, bpb, &bpb, false, NULL);
2056 static int indx_free_children(struct ntfs_index *indx, struct ntfs_inode *ni,
2057 const struct NTFS_DE *e, bool trim)
2060 struct indx_node *n;
2061 struct INDEX_HDR *hdr;
2062 CLST vbn = de_get_vbn(e);
2065 err = indx_read(indx, ni, vbn, &n);
2069 hdr = &n->index->ihdr;
2070 /* First, recurse into the children, if any.*/
2071 if (hdr_has_subnode(hdr)) {
2072 for (e = hdr_first_de(hdr); e; e = hdr_next_de(hdr, e)) {
2073 indx_free_children(indx, ni, e, false);
2081 i = vbn >> indx->idx2vbn_bits;
2082 /* We've gotten rid of the children; add this buffer to the free list. */
2083 indx_mark_free(indx, ni, i);
2089 * If there are no used indexes after current free index
2090 * then we can truncate allocation and bitmap
2091 * Use bitmap to estimate the case
2093 indx_shrink(indx, ni, i + 1);
2098 * indx_get_entry_to_replace
2100 * finds a replacement entry for a deleted entry
2101 * always returns a node entry:
2102 * NTFS_IE_HAS_SUBNODES is set the flags and the size includes the sub_vcn
2104 static int indx_get_entry_to_replace(struct ntfs_index *indx,
2105 struct ntfs_inode *ni,
2106 const struct NTFS_DE *de_next,
2107 struct NTFS_DE **de_to_replace,
2108 struct ntfs_fnd *fnd)
2113 struct NTFS_DE *e, *te, *re;
2114 struct indx_node *n;
2115 struct INDEX_BUFFER *ib;
2117 *de_to_replace = NULL;
2119 /* Find first leaf entry down from de_next */
2120 vbn = de_get_vbn(de_next);
2123 err = indx_read(indx, ni, vbn, &n);
2127 e = hdr_first_de(&n->index->ihdr);
2128 fnd_push(fnd, n, e);
2130 if (!de_is_last(e)) {
2132 * This buffer is non-empty, so its first entry could be used as the
2133 * replacement entry.
2135 level = fnd->level - 1;
2141 /* This buffer is a node. Continue to go down */
2142 vbn = de_get_vbn(e);
2148 n = fnd->nodes[level];
2149 te = hdr_first_de(&n->index->ihdr);
2150 /* Copy the candidate entry into the replacement entry buffer. */
2151 re = ntfs_malloc(le16_to_cpu(te->size) + sizeof(u64));
2157 *de_to_replace = re;
2158 memcpy(re, te, le16_to_cpu(te->size));
2160 if (!de_has_vcn(re)) {
2162 * The replacement entry we found doesn't have a sub_vcn. increase its size
2165 le16_add_cpu(&re->size, sizeof(u64));
2166 re->flags |= NTFS_IE_HAS_SUBNODES;
2169 * The replacement entry we found was a node entry, which means that all
2170 * its child buffers are empty. Return them to the free pool.
2172 indx_free_children(indx, ni, te, true);
2176 * Expunge the replacement entry from its former location,
2177 * and then write that buffer.
2180 e = hdr_delete_de(&ib->ihdr, te);
2183 indx_write(indx, ni, n, 0);
2185 /* Check to see if this action created an empty leaf. */
2186 if (ib_is_leaf(ib) && ib_is_empty(ib))
2197 * deletes an entry from the index.
2199 int indx_delete_entry(struct ntfs_index *indx, struct ntfs_inode *ni,
2200 const void *key, u32 key_len, const void *ctx)
2203 struct INDEX_ROOT *root;
2204 struct INDEX_HDR *hdr;
2205 struct ntfs_fnd *fnd, *fnd2;
2206 struct INDEX_BUFFER *ib;
2207 struct NTFS_DE *e, *re, *next, *prev, *me;
2208 struct indx_node *n, *n2d = NULL;
2211 struct ATTRIB *attr;
2212 struct mft_inode *mi;
2213 u32 e_size, root_size, new_root_size;
2215 const struct INDEX_NAMES *in;
2229 root = indx_get_root(indx, ni, &attr, &mi);
2235 /* Locate the entry to remove. */
2236 err = indx_find(indx, ni, root, key, key_len, ctx, &diff, &e, fnd);
2248 n = fnd->nodes[level - 1];
2249 e = fnd->de[level - 1];
2258 e_size = le16_to_cpu(e->size);
2260 if (!de_has_vcn_ex(e)) {
2261 /* The entry to delete is a leaf, so we can just rip it out */
2262 hdr_delete_de(hdr, e);
2265 hdr->total = hdr->used;
2267 /* Shrink resident root attribute */
2268 mi_resize_attr(mi, attr, 0 - e_size);
2272 indx_write(indx, ni, n, 0);
2275 * Check to see if removing that entry made
2278 if (ib_is_leaf(ib) && ib_is_empty(ib)) {
2280 fnd_push(fnd2, n, e);
2284 * The entry we wish to delete is a node buffer, so we
2285 * have to find a replacement for it.
2287 next = de_get_next(e);
2289 err = indx_get_entry_to_replace(indx, ni, next, &re, fnd2);
2294 de_set_vbn_le(re, de_get_vbn_le(e));
2295 hdr_delete_de(hdr, e);
2297 err = level ? indx_insert_into_buffer(indx, ni, root,
2301 : indx_insert_into_root(indx, ni, re, e,
2309 * There is no replacement for the current entry.
2310 * This means that the subtree rooted at its node is empty,
2311 * and can be deleted, which turn means that the node can
2312 * just inherit the deleted entry sub_vcn
2314 indx_free_children(indx, ni, next, true);
2316 de_set_vbn_le(next, de_get_vbn_le(e));
2317 hdr_delete_de(hdr, e);
2319 indx_write(indx, ni, n, 0);
2321 hdr->total = hdr->used;
2323 /* Shrink resident root attribute */
2324 mi_resize_attr(mi, attr, 0 - e_size);
2329 /* Delete a branch of tree */
2330 if (!fnd2 || !fnd2->level)
2333 /* Reinit root 'cause it can be changed */
2334 root = indx_get_root(indx, ni, &attr, &mi);
2341 sub_vbn = fnd2->nodes[0]->index->vbn;
2345 hdr = level ? &fnd->nodes[level - 1]->index->ihdr : &root->ihdr;
2347 /* Scan current level */
2348 for (e = hdr_first_de(hdr);; e = hdr_next_de(hdr, e)) {
2354 if (de_has_vcn(e) && sub_vbn == de_get_vbn_le(e))
2357 if (de_is_last(e)) {
2364 /* Do slow search from root */
2365 struct indx_node *in;
2369 in = indx_find_buffer(indx, ni, root, sub_vbn, NULL);
2376 fnd_push(fnd, in, NULL);
2379 /* Merge fnd2 -> fnd */
2380 for (level = 0; level < fnd2->level; level++) {
2381 fnd_push(fnd, fnd2->nodes[level], fnd2->de[level]);
2382 fnd2->nodes[level] = NULL;
2387 for (level = fnd->level; level; level--) {
2388 struct indx_node *in = fnd->nodes[level - 1];
2391 if (ib_is_empty(ib)) {
2404 e = hdr_first_de(hdr);
2410 if (hdr != &root->ihdr || !de_is_last(e)) {
2412 while (!de_is_last(e)) {
2413 if (de_has_vcn(e) && sub_vbn == de_get_vbn_le(e))
2416 e = hdr_next_de(hdr, e);
2423 if (sub_vbn != de_get_vbn_le(e)) {
2425 * Didn't find the parent entry, although this buffer is the parent trail.
2426 * Something is corrupt.
2432 if (de_is_last(e)) {
2434 * Since we can't remove the end entry, we'll remove its
2435 * predecessor instead. This means we have to transfer the
2436 * predecessor's sub_vcn to the end entry.
2437 * Note: that this index block is not empty, so the
2438 * predecessor must exist
2445 if (de_has_vcn(prev)) {
2446 de_set_vbn_le(e, de_get_vbn_le(prev));
2447 } else if (de_has_vcn(e)) {
2448 le16_sub_cpu(&e->size, sizeof(u64));
2449 e->flags &= ~NTFS_IE_HAS_SUBNODES;
2450 le32_sub_cpu(&hdr->used, sizeof(u64));
2456 * Copy the current entry into a temporary buffer (stripping off its
2457 * down-pointer, if any) and delete it from the current buffer or root,
2460 e_size = le16_to_cpu(e->size);
2461 me = ntfs_memdup(e, e_size);
2467 if (de_has_vcn(me)) {
2468 me->flags &= ~NTFS_IE_HAS_SUBNODES;
2469 le16_sub_cpu(&me->size, sizeof(u64));
2472 hdr_delete_de(hdr, e);
2474 if (hdr == &root->ihdr) {
2476 hdr->total = hdr->used;
2478 /* Shrink resident root attribute */
2479 mi_resize_attr(mi, attr, 0 - e_size);
2481 indx_write(indx, ni, n2d, 0);
2485 /* Mark unused buffers as free */
2487 for (; level < fnd->level; level++) {
2488 ib = fnd->nodes[level]->index;
2489 if (ib_is_empty(ib)) {
2490 size_t k = le64_to_cpu(ib->vbn) >>
2493 indx_mark_free(indx, ni, k);
2500 /*fnd->root_de = NULL;*/
2503 * Re-insert the entry into the tree.
2504 * Find the spot the tree where we want to insert the new entry.
2506 err = indx_insert_entry(indx, ni, me, ctx, fnd);
2512 indx_shrink(indx, ni, trim_bit);
2515 * This tree needs to be collapsed down to an empty root.
2516 * Recreate the index root as an empty leaf and free all the bits the
2517 * index allocation bitmap.
2522 in = &s_index_names[indx->type];
2524 err = attr_set_size(ni, ATTR_ALLOC, in->name, in->name_len,
2525 &indx->alloc_run, 0, NULL, false, NULL);
2526 err = ni_remove_attr(ni, ATTR_ALLOC, in->name, in->name_len,
2528 run_close(&indx->alloc_run);
2530 err = attr_set_size(ni, ATTR_BITMAP, in->name, in->name_len,
2531 &indx->bitmap_run, 0, NULL, false, NULL);
2532 err = ni_remove_attr(ni, ATTR_BITMAP, in->name, in->name_len,
2534 run_close(&indx->bitmap_run);
2536 root = indx_get_root(indx, ni, &attr, &mi);
2542 root_size = le32_to_cpu(attr->res.data_size);
2544 sizeof(struct INDEX_ROOT) + sizeof(struct NTFS_DE);
2546 if (new_root_size != root_size &&
2547 !mi_resize_attr(mi, attr, new_root_size - root_size)) {
2552 /* Fill first entry */
2553 e = (struct NTFS_DE *)(root + 1);
2557 e->size = cpu_to_le16(sizeof(struct NTFS_DE));
2558 e->flags = NTFS_IE_LAST; // 0x02
2564 hdr->used = hdr->total = cpu_to_le32(
2565 new_root_size - offsetof(struct INDEX_ROOT, ihdr));
2578 * Update duplicated information in directory entry
2579 * 'dup' - info from MFT record
2581 int indx_update_dup(struct ntfs_inode *ni, struct ntfs_sb_info *sbi,
2582 const struct ATTR_FILE_NAME *fname,
2583 const struct NTFS_DUP_INFO *dup, int sync)
2586 struct NTFS_DE *e = NULL;
2587 struct ATTR_FILE_NAME *e_fname;
2588 struct ntfs_fnd *fnd;
2589 struct INDEX_ROOT *root;
2590 struct mft_inode *mi;
2591 struct ntfs_index *indx = &ni->dir;
2599 root = indx_get_root(indx, ni, NULL, &mi);
2605 /* Find entry in directory */
2606 err = indx_find(indx, ni, root, fname, fname_full_size(fname), sbi,
2621 e_fname = (struct ATTR_FILE_NAME *)(e + 1);
2623 if (!memcmp(&e_fname->dup, dup, sizeof(*dup))) {
2624 /* nothing to update in index! Try to avoid this call */
2628 memcpy(&e_fname->dup, dup, sizeof(*dup));
2631 /* directory entry in index */
2632 err = indx_write(indx, ni, fnd->nodes[fnd->level - 1], sync);
2634 /* directory entry in directory MFT record */
2637 err = mi_write(mi, 1);
2639 mark_inode_dirty(&ni->vfs_inode);