1 // SPDX-License-Identifier: GPL-2.0
4 * Copyright (C) 2019-2021 Paragon Software GmbH, All rights reserved.
8 #include <linux/fiemap.h>
10 #include <linux/minmax.h>
11 #include <linux/vmalloc.h>
16 #ifdef CONFIG_NTFS3_LZX_XPRESS
20 static struct mft_inode *ni_ins_mi(struct ntfs_inode *ni, struct rb_root *tree,
21 CLST ino, struct rb_node *ins)
23 struct rb_node **p = &tree->rb_node;
24 struct rb_node *pr = NULL;
30 mi = rb_entry(pr, struct mft_inode, node);
33 else if (mi->rno < ino)
42 rb_link_node(ins, pr, p);
43 rb_insert_color(ins, tree);
44 return rb_entry(ins, struct mft_inode, node);
48 * ni_find_mi - Find mft_inode by record number.
50 static struct mft_inode *ni_find_mi(struct ntfs_inode *ni, CLST rno)
52 return ni_ins_mi(ni, &ni->mi_tree, rno, NULL);
56 * ni_add_mi - Add new mft_inode into ntfs_inode.
58 static void ni_add_mi(struct ntfs_inode *ni, struct mft_inode *mi)
60 ni_ins_mi(ni, &ni->mi_tree, mi->rno, &mi->node);
64 * ni_remove_mi - Remove mft_inode from ntfs_inode.
66 void ni_remove_mi(struct ntfs_inode *ni, struct mft_inode *mi)
68 rb_erase(&mi->node, &ni->mi_tree);
72 * ni_std - Return: Pointer into std_info from primary record.
74 struct ATTR_STD_INFO *ni_std(struct ntfs_inode *ni)
76 const struct ATTRIB *attr;
78 attr = mi_find_attr(&ni->mi, NULL, ATTR_STD, NULL, 0, NULL);
79 return attr ? resident_data_ex(attr, sizeof(struct ATTR_STD_INFO))
86 * Return: Pointer into std_info from primary record.
88 struct ATTR_STD_INFO5 *ni_std5(struct ntfs_inode *ni)
90 const struct ATTRIB *attr;
92 attr = mi_find_attr(&ni->mi, NULL, ATTR_STD, NULL, 0, NULL);
94 return attr ? resident_data_ex(attr, sizeof(struct ATTR_STD_INFO5))
99 * ni_clear - Clear resources allocated by ntfs_inode.
101 void ni_clear(struct ntfs_inode *ni)
103 struct rb_node *node;
105 if (!ni->vfs_inode.i_nlink && is_rec_inuse(ni->mi.mrec))
110 for (node = rb_first(&ni->mi_tree); node;) {
111 struct rb_node *next = rb_next(node);
112 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
114 rb_erase(node, &ni->mi_tree);
119 /* Bad inode always has mode == S_IFREG. */
120 if (ni->ni_flags & NI_FLAG_DIR)
121 indx_clear(&ni->dir);
123 run_close(&ni->file.run);
124 #ifdef CONFIG_NTFS3_LZX_XPRESS
125 if (ni->file.offs_page) {
126 /* On-demand allocated page for offsets. */
127 put_page(ni->file.offs_page);
128 ni->file.offs_page = NULL;
137 * ni_load_mi_ex - Find mft_inode by record number.
139 int ni_load_mi_ex(struct ntfs_inode *ni, CLST rno, struct mft_inode **mi)
144 r = ni_find_mi(ni, rno);
148 err = mi_get(ni->mi.sbi, rno, &r);
161 * ni_load_mi - Load mft_inode corresponded list_entry.
163 int ni_load_mi(struct ntfs_inode *ni, const struct ATTR_LIST_ENTRY *le,
164 struct mft_inode **mi)
173 rno = ino_get(&le->ref);
174 if (rno == ni->mi.rno) {
178 return ni_load_mi_ex(ni, rno, mi);
184 * Return: Attribute and record this attribute belongs to.
186 struct ATTRIB *ni_find_attr(struct ntfs_inode *ni, struct ATTRIB *attr,
187 struct ATTR_LIST_ENTRY **le_o, enum ATTR_TYPE type,
188 const __le16 *name, u8 name_len, const CLST *vcn,
189 struct mft_inode **mi)
191 struct ATTR_LIST_ENTRY *le;
194 if (!ni->attr_list.size ||
195 (!name_len && (type == ATTR_LIST || type == ATTR_STD))) {
201 /* Look for required attribute in primary record. */
202 return mi_find_attr(&ni->mi, attr, type, name, name_len, NULL);
205 /* First look for list entry of required type. */
206 le = al_find_ex(ni, le_o ? *le_o : NULL, type, name, name_len, vcn);
213 /* Load record that contains this attribute. */
214 if (ni_load_mi(ni, le, &m))
217 /* Look for required attribute. */
218 attr = mi_find_attr(m, NULL, type, name, name_len, &le->id);
223 if (!attr->non_res) {
229 } else if (le64_to_cpu(attr->nres.svcn) > *vcn ||
230 *vcn > le64_to_cpu(attr->nres.evcn)) {
239 ntfs_set_state(ni->mi.sbi, NTFS_DIRTY_ERROR);
244 * ni_enum_attr_ex - Enumerates attributes in ntfs_inode.
246 struct ATTRIB *ni_enum_attr_ex(struct ntfs_inode *ni, struct ATTRIB *attr,
247 struct ATTR_LIST_ENTRY **le,
248 struct mft_inode **mi)
250 struct mft_inode *mi2;
251 struct ATTR_LIST_ENTRY *le2;
253 /* Do we have an attribute list? */
254 if (!ni->attr_list.size) {
258 /* Enum attributes in primary record. */
259 return mi_enum_attr(&ni->mi, attr);
262 /* Get next list entry. */
263 le2 = *le = al_enumerate(ni, attr ? *le : NULL);
267 /* Load record that contains the required attribute. */
268 if (ni_load_mi(ni, le2, &mi2))
274 /* Find attribute in loaded record. */
275 return rec_find_attr_le(mi2, le2);
279 * ni_load_attr - Load attribute that contains given VCN.
281 struct ATTRIB *ni_load_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
282 const __le16 *name, u8 name_len, CLST vcn,
283 struct mft_inode **pmi)
285 struct ATTR_LIST_ENTRY *le;
287 struct mft_inode *mi;
288 struct ATTR_LIST_ENTRY *next;
290 if (!ni->attr_list.size) {
293 return mi_find_attr(&ni->mi, NULL, type, name, name_len, NULL);
296 le = al_find_ex(ni, NULL, type, name, name_len, NULL);
301 * Unfortunately ATTR_LIST_ENTRY contains only start VCN.
302 * So to find the ATTRIB segment that contains 'vcn' we should
303 * enumerate some entries.
307 next = al_find_ex(ni, le, type, name, name_len, NULL);
308 if (!next || le64_to_cpu(next->vcn) > vcn)
313 if (ni_load_mi(ni, le, &mi))
319 attr = mi_find_attr(mi, NULL, type, name, name_len, &le->id);
326 if (le64_to_cpu(attr->nres.svcn) <= vcn &&
327 vcn <= le64_to_cpu(attr->nres.evcn))
334 * ni_load_all_mi - Load all subrecords.
336 int ni_load_all_mi(struct ntfs_inode *ni)
339 struct ATTR_LIST_ENTRY *le;
341 if (!ni->attr_list.size)
346 while ((le = al_enumerate(ni, le))) {
347 CLST rno = ino_get(&le->ref);
349 if (rno == ni->mi.rno)
352 err = ni_load_mi_ex(ni, rno, NULL);
361 * ni_add_subrecord - Allocate + format + attach a new subrecord.
363 bool ni_add_subrecord(struct ntfs_inode *ni, CLST rno, struct mft_inode **mi)
367 m = kzalloc(sizeof(struct mft_inode), GFP_NOFS);
371 if (mi_format_new(m, ni->mi.sbi, rno, 0, ni->mi.rno == MFT_REC_MFT)) {
376 mi_get_ref(&ni->mi, &m->mrec->parent_ref);
384 * ni_remove_attr - Remove all attributes for the given type/name/id.
386 int ni_remove_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
387 const __le16 *name, size_t name_len, bool base_only,
392 struct ATTR_LIST_ENTRY *le;
393 struct mft_inode *mi;
397 if (base_only || type == ATTR_LIST || !ni->attr_list.size) {
398 attr = mi_find_attr(&ni->mi, NULL, type, name, name_len, id);
402 mi_remove_attr(ni, &ni->mi, attr);
406 type_in = le32_to_cpu(type);
410 le = al_enumerate(ni, le);
415 diff = le32_to_cpu(le->type) - type_in;
422 if (le->name_len != name_len)
426 memcmp(le_name(le), name, name_len * sizeof(short)))
429 if (id && le->id != *id)
431 err = ni_load_mi(ni, le, &mi);
435 al_remove_le(ni, le);
437 attr = mi_find_attr(mi, NULL, type, name, name_len, id);
441 mi_remove_attr(ni, mi, attr);
443 if (PtrOffset(ni->attr_list.le, le) >= ni->attr_list.size)
450 * ni_ins_new_attr - Insert the attribute into record.
452 * Return: Not full constructed attribute or NULL if not possible to create.
454 static struct ATTRIB *
455 ni_ins_new_attr(struct ntfs_inode *ni, struct mft_inode *mi,
456 struct ATTR_LIST_ENTRY *le, enum ATTR_TYPE type,
457 const __le16 *name, u8 name_len, u32 asize, u16 name_off,
458 CLST svcn, struct ATTR_LIST_ENTRY **ins_le)
462 bool le_added = false;
465 mi_get_ref(mi, &ref);
467 if (type != ATTR_LIST && !le && ni->attr_list.size) {
468 err = al_add_le(ni, type, name, name_len, svcn, cpu_to_le16(-1),
471 /* No memory or no space. */
477 * al_add_le -> attr_set_size (list) -> ni_expand_list
478 * which moves some attributes out of primary record
479 * this means that name may point into moved memory
480 * reinit 'name' from le.
485 attr = mi_insert_attr(mi, type, name, name_len, asize, name_off);
488 al_remove_le(ni, le);
492 if (type == ATTR_LIST) {
493 /* Attr list is not in list entry array. */
500 /* Update ATTRIB Id and record reference. */
502 ni->attr_list.dirty = true;
514 * Random write access to sparsed or compressed file may result to
515 * not optimized packed runs.
516 * Here is the place to optimize it.
518 static int ni_repack(struct ntfs_inode *ni)
521 struct ntfs_sb_info *sbi = ni->mi.sbi;
522 struct mft_inode *mi, *mi_p = NULL;
523 struct ATTRIB *attr = NULL, *attr_p;
524 struct ATTR_LIST_ENTRY *le = NULL, *le_p;
526 u8 cluster_bits = sbi->cluster_bits;
527 CLST svcn, evcn = 0, svcn_p, evcn_p, next_svcn;
528 u32 roff, rs = sbi->record_size;
529 struct runs_tree run;
533 while ((attr = ni_enum_attr_ex(ni, attr, &le, &mi))) {
537 svcn = le64_to_cpu(attr->nres.svcn);
538 if (svcn != le64_to_cpu(le->vcn)) {
544 alloc = le64_to_cpu(attr->nres.alloc_size) >>
547 } else if (svcn != evcn + 1) {
552 evcn = le64_to_cpu(attr->nres.evcn);
554 if (svcn > evcn + 1) {
560 /* Do not try if not enogh free space. */
561 if (le32_to_cpu(mi->mrec->used) + 8 >= rs)
564 /* Do not try if last attribute segment. */
565 if (evcn + 1 == alloc)
570 roff = le16_to_cpu(attr->nres.run_off);
572 if (roff > le32_to_cpu(attr->size)) {
577 err = run_unpack(&run, sbi, ni->mi.rno, svcn, evcn, svcn,
579 le32_to_cpu(attr->size) - roff);
594 * Run contains data from two records: mi_p and mi
595 * Try to pack in one.
597 err = mi_pack_runs(mi_p, attr_p, &run, evcn + 1 - svcn_p);
601 next_svcn = le64_to_cpu(attr_p->nres.evcn) + 1;
603 if (next_svcn >= evcn + 1) {
604 /* We can remove this attribute segment. */
605 al_remove_le(ni, le);
606 mi_remove_attr(NULL, mi, attr);
611 attr->nres.svcn = le->vcn = cpu_to_le64(next_svcn);
613 ni->attr_list.dirty = true;
615 if (evcn + 1 == alloc) {
616 err = mi_pack_runs(mi, attr, &run,
617 evcn + 1 - next_svcn);
627 run_truncate_head(&run, next_svcn);
632 ntfs_inode_warn(&ni->vfs_inode, "repack problem");
633 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
635 /* Pack loaded but not packed runs. */
637 mi_pack_runs(mi_p, attr_p, &run, evcn_p + 1 - svcn_p);
645 * ni_try_remove_attr_list
647 * Can we remove attribute list?
648 * Check the case when primary record contains enough space for all attributes.
650 static int ni_try_remove_attr_list(struct ntfs_inode *ni)
653 struct ntfs_sb_info *sbi = ni->mi.sbi;
654 struct ATTRIB *attr, *attr_list, *attr_ins;
655 struct ATTR_LIST_ENTRY *le;
656 struct mft_inode *mi;
659 struct MFT_REC *mrec;
662 if (!ni->attr_list.dirty)
669 attr_list = mi_find_attr(&ni->mi, NULL, ATTR_LIST, NULL, 0, NULL);
673 asize = le32_to_cpu(attr_list->size);
675 /* Free space in primary record without attribute list. */
676 free = sbi->record_size - le32_to_cpu(ni->mi.mrec->used) + asize;
677 mi_get_ref(&ni->mi, &ref);
680 while ((le = al_enumerate(ni, le))) {
681 if (!memcmp(&le->ref, &ref, sizeof(ref)))
687 mi = ni_find_mi(ni, ino_get(&le->ref));
691 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
692 le->name_len, &le->id);
696 asize = le32_to_cpu(attr->size);
703 /* Make a copy of primary record to restore if error. */
704 mrec = kmemdup(ni->mi.mrec, sbi->record_size, GFP_NOFS);
706 return 0; /* Not critical. */
708 /* It seems that attribute list can be removed from primary record. */
709 mi_remove_attr(NULL, &ni->mi, attr_list);
712 * Repeat the cycle above and copy all attributes to primary record.
713 * Do not remove original attributes from subrecords!
714 * It should be success!
717 while ((le = al_enumerate(ni, le))) {
718 if (!memcmp(&le->ref, &ref, sizeof(ref)))
721 mi = ni_find_mi(ni, ino_get(&le->ref));
723 /* Should never happened, 'cause already checked. */
727 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
728 le->name_len, &le->id);
730 /* Should never happened, 'cause already checked. */
733 asize = le32_to_cpu(attr->size);
735 /* Insert into primary record. */
736 attr_ins = mi_insert_attr(&ni->mi, le->type, le_name(le),
738 le16_to_cpu(attr->name_off));
741 * No space in primary record (already checked).
746 /* Copy all except id. */
748 memcpy(attr_ins, attr, asize);
753 * Repeat the cycle above and remove all attributes from subrecords.
756 while ((le = al_enumerate(ni, le))) {
757 if (!memcmp(&le->ref, &ref, sizeof(ref)))
760 mi = ni_find_mi(ni, ino_get(&le->ref));
764 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
765 le->name_len, &le->id);
769 /* Remove from original record. */
770 mi_remove_attr(NULL, mi, attr);
773 run_deallocate(sbi, &ni->attr_list.run, true);
774 run_close(&ni->attr_list.run);
775 ni->attr_list.size = 0;
776 kfree(ni->attr_list.le);
777 ni->attr_list.le = NULL;
778 ni->attr_list.dirty = false;
783 /* Restore primary record. */
784 swap(mrec, ni->mi.mrec);
790 * ni_create_attr_list - Generates an attribute list for this primary record.
792 int ni_create_attr_list(struct ntfs_inode *ni)
794 struct ntfs_sb_info *sbi = ni->mi.sbi;
798 struct ATTRIB *arr_move[7];
799 struct ATTR_LIST_ENTRY *le, *le_b[7];
803 struct mft_inode *mi;
804 u32 free_b, nb, to_free, rs;
807 is_mft = ni->mi.rno == MFT_REC_MFT;
809 rs = sbi->record_size;
812 * Skip estimating exact memory requirement.
813 * Looks like one record_size is always enough.
815 le = kmalloc(al_aligned(rs), GFP_NOFS);
821 mi_get_ref(&ni->mi, &le->ref);
822 ni->attr_list.le = le;
829 for (; (attr = mi_enum_attr(&ni->mi, attr)); le = Add2Ptr(le, sz)) {
830 sz = le_size(attr->name_len);
831 le->type = attr->type;
832 le->size = cpu_to_le16(sz);
833 le->name_len = attr->name_len;
834 le->name_off = offsetof(struct ATTR_LIST_ENTRY, name);
836 if (le != ni->attr_list.le)
837 le->ref = ni->attr_list.le->ref;
841 memcpy(le->name, attr_name(attr),
842 sizeof(short) * attr->name_len);
843 else if (attr->type == ATTR_STD)
845 else if (attr->type == ATTR_LIST)
847 else if (is_mft && attr->type == ATTR_DATA)
850 if (!nb || nb < ARRAY_SIZE(arr_move)) {
852 arr_move[nb++] = attr;
853 free_b += le32_to_cpu(attr->size);
857 lsize = PtrOffset(ni->attr_list.le, le);
858 ni->attr_list.size = lsize;
860 to_free = le32_to_cpu(rec->used) + lsize + SIZEOF_RESIDENT;
866 if (to_free > free_b) {
872 /* Allocate child MFT. */
873 err = ntfs_look_free_mft(sbi, &rno, is_mft, ni, &mi);
878 /* Call mi_remove_attr() in reverse order to keep pointers 'arr_move' valid. */
879 while (to_free > 0) {
880 struct ATTRIB *b = arr_move[--nb];
881 u32 asize = le32_to_cpu(b->size);
882 u16 name_off = le16_to_cpu(b->name_off);
884 attr = mi_insert_attr(mi, b->type, Add2Ptr(b, name_off),
885 b->name_len, asize, name_off);
889 mi_get_ref(mi, &le_b[nb]->ref);
890 le_b[nb]->id = attr->id;
892 /* Copy all except id. */
893 memcpy(attr, b, asize);
894 attr->id = le_b[nb]->id;
896 /* Remove from primary record. */
897 if (!mi_remove_attr(NULL, &ni->mi, b))
900 if (to_free <= asize)
907 attr = mi_insert_attr(&ni->mi, ATTR_LIST, NULL, 0,
908 lsize + SIZEOF_RESIDENT, SIZEOF_RESIDENT);
914 attr->res.data_size = cpu_to_le32(lsize);
915 attr->res.data_off = SIZEOF_RESIDENT_LE;
919 memcpy(resident_data_ex(attr, lsize), ni->attr_list.le, lsize);
921 ni->attr_list.dirty = false;
923 mark_inode_dirty(&ni->vfs_inode);
927 kfree(ni->attr_list.le);
928 ni->attr_list.le = NULL;
929 ni->attr_list.size = 0;
937 * ni_ins_attr_ext - Add an external attribute to the ntfs_inode.
939 static int ni_ins_attr_ext(struct ntfs_inode *ni, struct ATTR_LIST_ENTRY *le,
940 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
941 u32 asize, CLST svcn, u16 name_off, bool force_ext,
942 struct ATTRIB **ins_attr, struct mft_inode **ins_mi,
943 struct ATTR_LIST_ENTRY **ins_le)
946 struct mft_inode *mi;
949 struct rb_node *node;
951 bool is_mft, is_mft_data;
952 struct ntfs_sb_info *sbi = ni->mi.sbi;
954 is_mft = ni->mi.rno == MFT_REC_MFT;
955 is_mft_data = is_mft && type == ATTR_DATA && !name_len;
957 if (asize > sbi->max_bytes_per_attr) {
963 * Standard information and attr_list cannot be made external.
964 * The Log File cannot have any external attributes.
966 if (type == ATTR_STD || type == ATTR_LIST ||
967 ni->mi.rno == MFT_REC_LOG) {
972 /* Create attribute list if it is not already existed. */
973 if (!ni->attr_list.size) {
974 err = ni_create_attr_list(ni);
979 vbo = is_mft_data ? ((u64)svcn << sbi->cluster_bits) : 0;
984 /* Load all subrecords into memory. */
985 err = ni_load_all_mi(ni);
989 /* Check each of loaded subrecord. */
990 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
991 mi = rb_entry(node, struct mft_inode, node);
994 (mi_enum_attr(mi, NULL) ||
995 vbo <= ((u64)mi->rno << sbi->record_bits))) {
996 /* We can't accept this record 'cause MFT's bootstrapping. */
1000 mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0, NULL)) {
1002 * This child record already has a ATTR_DATA.
1003 * So it can't accept any other records.
1008 if ((type != ATTR_NAME || name_len) &&
1009 mi_find_attr(mi, NULL, type, name, name_len, NULL)) {
1010 /* Only indexed attributes can share same record. */
1015 * Do not try to insert this attribute
1016 * if there is no room in record.
1018 if (le32_to_cpu(mi->mrec->used) + asize > sbi->record_size)
1021 /* Try to insert attribute into this subrecord. */
1022 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
1023 name_off, svcn, ins_le);
1027 return PTR_ERR(attr);
1037 /* We have to allocate a new child subrecord. */
1038 err = ntfs_look_free_mft(sbi, &rno, is_mft_data, ni, &mi);
1042 if (is_mft_data && vbo <= ((u64)rno << sbi->record_bits)) {
1047 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
1048 name_off, svcn, ins_le);
1055 err = PTR_ERR(attr);
1067 ni_remove_mi(ni, mi);
1071 ntfs_mark_rec_free(sbi, rno, is_mft);
1078 * ni_insert_attr - Insert an attribute into the file.
1080 * If the primary record has room, it will just insert the attribute.
1081 * If not, it may make the attribute external.
1082 * For $MFT::Data it may make room for the attribute by
1083 * making other attributes external.
1086 * The ATTR_LIST and ATTR_STD cannot be made external.
1087 * This function does not fill new attribute full.
1088 * It only fills 'size'/'type'/'id'/'name_len' fields.
1090 static int ni_insert_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
1091 const __le16 *name, u8 name_len, u32 asize,
1092 u16 name_off, CLST svcn, struct ATTRIB **ins_attr,
1093 struct mft_inode **ins_mi,
1094 struct ATTR_LIST_ENTRY **ins_le)
1096 struct ntfs_sb_info *sbi = ni->mi.sbi;
1098 struct ATTRIB *attr, *eattr;
1099 struct MFT_REC *rec;
1101 struct ATTR_LIST_ENTRY *le;
1102 u32 list_reserve, max_free, free, used, t32;
1106 is_mft = ni->mi.rno == MFT_REC_MFT;
1109 list_reserve = SIZEOF_NONRESIDENT + 3 * (1 + 2 * sizeof(u32));
1110 used = le32_to_cpu(rec->used);
1111 free = sbi->record_size - used;
1113 if (is_mft && type != ATTR_LIST) {
1114 /* Reserve space for the ATTRIB list. */
1115 if (free < list_reserve)
1118 free -= list_reserve;
1121 if (asize <= free) {
1122 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len,
1123 asize, name_off, svcn, ins_le);
1125 err = PTR_ERR(attr);
1139 if (!is_mft || type != ATTR_DATA || svcn) {
1140 /* This ATTRIB will be external. */
1141 err = ni_ins_attr_ext(ni, NULL, type, name, name_len, asize,
1142 svcn, name_off, false, ins_attr, ins_mi,
1148 * Here we have: "is_mft && type == ATTR_DATA && !svcn"
1150 * The first chunk of the $MFT::Data ATTRIB must be the base record.
1151 * Evict as many other attributes as possible.
1155 /* Estimate the result of moving all possible attributes away. */
1158 while ((attr = mi_enum_attr(&ni->mi, attr))) {
1159 if (attr->type == ATTR_STD)
1161 if (attr->type == ATTR_LIST)
1163 max_free += le32_to_cpu(attr->size);
1166 if (max_free < asize + list_reserve) {
1167 /* Impossible to insert this attribute into primary record. */
1172 /* Start real attribute moving. */
1176 attr = mi_enum_attr(&ni->mi, attr);
1178 /* We should never be here 'cause we have already check this case. */
1183 /* Skip attributes that MUST be primary record. */
1184 if (attr->type == ATTR_STD || attr->type == ATTR_LIST)
1188 if (ni->attr_list.size) {
1189 le = al_find_le(ni, NULL, attr);
1191 /* Really this is a serious bug. */
1197 t32 = le32_to_cpu(attr->size);
1198 t16 = le16_to_cpu(attr->name_off);
1199 err = ni_ins_attr_ext(ni, le, attr->type, Add2Ptr(attr, t16),
1200 attr->name_len, t32, attr_svcn(attr), t16,
1201 false, &eattr, NULL, NULL);
1206 memcpy(eattr, attr, t32);
1209 /* Remove from primary record. */
1210 mi_remove_attr(NULL, &ni->mi, attr);
1212 /* attr now points to next attribute. */
1213 if (attr->type == ATTR_END)
1216 while (asize + list_reserve > sbi->record_size - le32_to_cpu(rec->used))
1219 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len, asize,
1220 name_off, svcn, ins_le);
1227 err = PTR_ERR(attr);
1240 /* ni_expand_mft_list - Split ATTR_DATA of $MFT. */
1241 static int ni_expand_mft_list(struct ntfs_inode *ni)
1244 struct runs_tree *run = &ni->file.run;
1245 u32 asize, run_size, done = 0;
1246 struct ATTRIB *attr;
1247 struct rb_node *node;
1248 CLST mft_min, mft_new, svcn, evcn, plen;
1249 struct mft_inode *mi, *mi_min, *mi_new;
1250 struct ntfs_sb_info *sbi = ni->mi.sbi;
1252 /* Find the nearest MFT. */
1257 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
1258 mi = rb_entry(node, struct mft_inode, node);
1260 attr = mi_enum_attr(mi, NULL);
1269 if (ntfs_look_free_mft(sbi, &mft_new, true, ni, &mi_new)) {
1271 /* Really this is not critical. */
1272 } else if (mft_min > mft_new) {
1276 ntfs_mark_rec_free(sbi, mft_new, true);
1278 ni_remove_mi(ni, mi_new);
1281 attr = mi_find_attr(&ni->mi, NULL, ATTR_DATA, NULL, 0, NULL);
1287 asize = le32_to_cpu(attr->size);
1289 evcn = le64_to_cpu(attr->nres.evcn);
1290 svcn = bytes_to_cluster(sbi, (u64)(mft_min + 1) << sbi->record_bits);
1291 if (evcn + 1 >= svcn) {
1297 * Split primary attribute [0 evcn] in two parts [0 svcn) + [svcn evcn].
1299 * Update first part of ATTR_DATA in 'primary MFT.
1301 err = run_pack(run, 0, svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1302 asize - SIZEOF_NONRESIDENT, &plen);
1306 run_size = ALIGN(err, 8);
1314 attr->nres.evcn = cpu_to_le64(svcn - 1);
1315 attr->size = cpu_to_le32(run_size + SIZEOF_NONRESIDENT);
1316 /* 'done' - How many bytes of primary MFT becomes free. */
1317 done = asize - run_size - SIZEOF_NONRESIDENT;
1318 le32_sub_cpu(&ni->mi.mrec->used, done);
1320 /* Estimate packed size (run_buf=NULL). */
1321 err = run_pack(run, svcn, evcn + 1 - svcn, NULL, sbi->record_size,
1326 run_size = ALIGN(err, 8);
1329 if (plen < evcn + 1 - svcn) {
1335 * This function may implicitly call expand attr_list.
1336 * Insert second part of ATTR_DATA in 'mi_min'.
1338 attr = ni_ins_new_attr(ni, mi_min, NULL, ATTR_DATA, NULL, 0,
1339 SIZEOF_NONRESIDENT + run_size,
1340 SIZEOF_NONRESIDENT, svcn, NULL);
1347 err = PTR_ERR(attr);
1352 attr->name_off = SIZEOF_NONRESIDENT_LE;
1355 /* This function can't fail - cause already checked above. */
1356 run_pack(run, svcn, evcn + 1 - svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1359 attr->nres.svcn = cpu_to_le64(svcn);
1360 attr->nres.evcn = cpu_to_le64(evcn);
1361 attr->nres.run_off = cpu_to_le16(SIZEOF_NONRESIDENT);
1365 ntfs_mark_rec_free(sbi, mft_new, true);
1366 ni_remove_mi(ni, mi_new);
1369 return !err && !done ? -EOPNOTSUPP : err;
1373 * ni_expand_list - Move all possible attributes out of primary record.
1375 int ni_expand_list(struct ntfs_inode *ni)
1378 u32 asize, done = 0;
1379 struct ATTRIB *attr, *ins_attr;
1380 struct ATTR_LIST_ENTRY *le;
1381 bool is_mft = ni->mi.rno == MFT_REC_MFT;
1384 mi_get_ref(&ni->mi, &ref);
1387 while ((le = al_enumerate(ni, le))) {
1388 if (le->type == ATTR_STD)
1391 if (memcmp(&ref, &le->ref, sizeof(struct MFT_REF)))
1394 if (is_mft && le->type == ATTR_DATA)
1397 /* Find attribute in primary record. */
1398 attr = rec_find_attr_le(&ni->mi, le);
1404 asize = le32_to_cpu(attr->size);
1406 /* Always insert into new record to avoid collisions (deep recursive). */
1407 err = ni_ins_attr_ext(ni, le, attr->type, attr_name(attr),
1408 attr->name_len, asize, attr_svcn(attr),
1409 le16_to_cpu(attr->name_off), true,
1410 &ins_attr, NULL, NULL);
1415 memcpy(ins_attr, attr, asize);
1416 ins_attr->id = le->id;
1417 /* Remove from primary record. */
1418 mi_remove_attr(NULL, &ni->mi, attr);
1425 err = -EFBIG; /* Attr list is too big(?) */
1429 /* Split MFT data as much as possible. */
1430 err = ni_expand_mft_list(ni);
1433 return !err && !done ? -EOPNOTSUPP : err;
1437 * ni_insert_nonresident - Insert new nonresident attribute.
1439 int ni_insert_nonresident(struct ntfs_inode *ni, enum ATTR_TYPE type,
1440 const __le16 *name, u8 name_len,
1441 const struct runs_tree *run, CLST svcn, CLST len,
1442 __le16 flags, struct ATTRIB **new_attr,
1443 struct mft_inode **mi, struct ATTR_LIST_ENTRY **le)
1447 struct ATTRIB *attr;
1449 (flags & (ATTR_FLAG_SPARSED | ATTR_FLAG_COMPRESSED)) && !svcn;
1450 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1451 u32 name_off = is_ext ? SIZEOF_NONRESIDENT_EX : SIZEOF_NONRESIDENT;
1452 u32 run_off = name_off + name_size;
1453 u32 run_size, asize;
1454 struct ntfs_sb_info *sbi = ni->mi.sbi;
1456 /* Estimate packed size (run_buf=NULL). */
1457 err = run_pack(run, svcn, len, NULL, sbi->max_bytes_per_attr - run_off,
1462 run_size = ALIGN(err, 8);
1469 asize = run_off + run_size;
1471 if (asize > sbi->max_bytes_per_attr) {
1476 err = ni_insert_attr(ni, type, name, name_len, asize, name_off, svcn,
1483 attr->name_off = cpu_to_le16(name_off);
1484 attr->flags = flags;
1486 /* This function can't fail - cause already checked above. */
1487 run_pack(run, svcn, len, Add2Ptr(attr, run_off), run_size, &plen);
1489 attr->nres.svcn = cpu_to_le64(svcn);
1490 attr->nres.evcn = cpu_to_le64((u64)svcn + len - 1);
1495 *(__le64 *)&attr->nres.run_off = cpu_to_le64(run_off);
1497 attr->nres.alloc_size =
1498 svcn ? 0 : cpu_to_le64((u64)len << ni->mi.sbi->cluster_bits);
1499 attr->nres.data_size = attr->nres.alloc_size;
1500 attr->nres.valid_size = attr->nres.alloc_size;
1503 if (flags & ATTR_FLAG_COMPRESSED)
1504 attr->nres.c_unit = COMPRESSION_UNIT;
1505 attr->nres.total_size = attr->nres.alloc_size;
1513 * ni_insert_resident - Inserts new resident attribute.
1515 int ni_insert_resident(struct ntfs_inode *ni, u32 data_size,
1516 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
1517 struct ATTRIB **new_attr, struct mft_inode **mi,
1518 struct ATTR_LIST_ENTRY **le)
1521 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1522 u32 asize = SIZEOF_RESIDENT + name_size + ALIGN(data_size, 8);
1523 struct ATTRIB *attr;
1525 err = ni_insert_attr(ni, type, name, name_len, asize, SIZEOF_RESIDENT,
1533 attr->res.data_size = cpu_to_le32(data_size);
1534 attr->res.data_off = cpu_to_le16(SIZEOF_RESIDENT + name_size);
1535 if (type == ATTR_NAME) {
1536 attr->res.flags = RESIDENT_FLAG_INDEXED;
1538 /* is_attr_indexed(attr)) == true */
1539 le16_add_cpu(&ni->mi.mrec->hard_links, 1);
1540 ni->mi.dirty = true;
1551 * ni_remove_attr_le - Remove attribute from record.
1553 void ni_remove_attr_le(struct ntfs_inode *ni, struct ATTRIB *attr,
1554 struct mft_inode *mi, struct ATTR_LIST_ENTRY *le)
1556 mi_remove_attr(ni, mi, attr);
1559 al_remove_le(ni, le);
1563 * ni_delete_all - Remove all attributes and frees allocates space.
1565 * ntfs_evict_inode->ntfs_clear_inode->ni_delete_all (if no links).
1567 int ni_delete_all(struct ntfs_inode *ni)
1570 struct ATTR_LIST_ENTRY *le = NULL;
1571 struct ATTRIB *attr = NULL;
1572 struct rb_node *node;
1576 struct ntfs_sb_info *sbi = ni->mi.sbi;
1577 bool nt3 = is_ntfs3(sbi);
1580 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
1581 if (!nt3 || attr->name_len) {
1583 } else if (attr->type == ATTR_REPARSE) {
1584 mi_get_ref(&ni->mi, &ref);
1585 ntfs_remove_reparse(sbi, 0, &ref);
1586 } else if (attr->type == ATTR_ID && !attr->non_res &&
1587 le32_to_cpu(attr->res.data_size) >=
1588 sizeof(struct GUID)) {
1589 ntfs_objid_remove(sbi, resident_data(attr));
1595 svcn = le64_to_cpu(attr->nres.svcn);
1596 evcn = le64_to_cpu(attr->nres.evcn);
1598 if (evcn + 1 <= svcn)
1601 asize = le32_to_cpu(attr->size);
1602 roff = le16_to_cpu(attr->nres.run_off);
1607 /* run==1 means unpack and deallocate. */
1608 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
1609 Add2Ptr(attr, roff), asize - roff);
1612 if (ni->attr_list.size) {
1613 run_deallocate(ni->mi.sbi, &ni->attr_list.run, true);
1617 /* Free all subrecords. */
1618 for (node = rb_first(&ni->mi_tree); node;) {
1619 struct rb_node *next = rb_next(node);
1620 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
1622 clear_rec_inuse(mi->mrec);
1626 ntfs_mark_rec_free(sbi, mi->rno, false);
1627 ni_remove_mi(ni, mi);
1632 /* Free base record. */
1633 clear_rec_inuse(ni->mi.mrec);
1634 ni->mi.dirty = true;
1635 err = mi_write(&ni->mi, 0);
1637 ntfs_mark_rec_free(sbi, ni->mi.rno, false);
1644 * Return: File name attribute by its value.
1646 struct ATTR_FILE_NAME *ni_fname_name(struct ntfs_inode *ni,
1647 const struct cpu_str *uni,
1648 const struct MFT_REF *home_dir,
1649 struct mft_inode **mi,
1650 struct ATTR_LIST_ENTRY **le)
1652 struct ATTRIB *attr = NULL;
1653 struct ATTR_FILE_NAME *fname;
1658 /* Enumerate all names. */
1660 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1664 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1668 if (home_dir && memcmp(home_dir, &fname->home, sizeof(*home_dir)))
1674 if (uni->len != fname->name_len)
1677 if (ntfs_cmp_names_cpu(uni, (struct le_str *)&fname->name_len, NULL,
1687 * Return: File name attribute with given type.
1689 struct ATTR_FILE_NAME *ni_fname_type(struct ntfs_inode *ni, u8 name_type,
1690 struct mft_inode **mi,
1691 struct ATTR_LIST_ENTRY **le)
1693 struct ATTRIB *attr = NULL;
1694 struct ATTR_FILE_NAME *fname;
1698 if (name_type == FILE_NAME_POSIX)
1701 /* Enumerate all names. */
1703 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1707 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1708 if (fname && name_type == fname->type)
1716 * Process compressed/sparsed in special way.
1717 * NOTE: You need to set ni->std_fa = new_fa
1718 * after this function to keep internal structures in consistency.
1720 int ni_new_attr_flags(struct ntfs_inode *ni, enum FILE_ATTRIBUTE new_fa)
1722 struct ATTRIB *attr;
1723 struct mft_inode *mi;
1727 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
1731 new_aflags = attr->flags;
1733 if (new_fa & FILE_ATTRIBUTE_SPARSE_FILE)
1734 new_aflags |= ATTR_FLAG_SPARSED;
1736 new_aflags &= ~ATTR_FLAG_SPARSED;
1738 if (new_fa & FILE_ATTRIBUTE_COMPRESSED)
1739 new_aflags |= ATTR_FLAG_COMPRESSED;
1741 new_aflags &= ~ATTR_FLAG_COMPRESSED;
1743 if (new_aflags == attr->flags)
1746 if ((new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) ==
1747 (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) {
1748 ntfs_inode_warn(&ni->vfs_inode,
1749 "file can't be sparsed and compressed");
1756 if (attr->nres.data_size) {
1759 "one can change sparsed/compressed only for empty files");
1763 /* Resize nonresident empty attribute in-place only. */
1764 new_asize = (new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED))
1765 ? (SIZEOF_NONRESIDENT_EX + 8)
1766 : (SIZEOF_NONRESIDENT + 8);
1768 if (!mi_resize_attr(mi, attr, new_asize - le32_to_cpu(attr->size)))
1771 if (new_aflags & ATTR_FLAG_SPARSED) {
1772 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1773 /* Windows uses 16 clusters per frame but supports one cluster per frame too. */
1774 attr->nres.c_unit = 0;
1775 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1776 } else if (new_aflags & ATTR_FLAG_COMPRESSED) {
1777 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1778 /* The only allowed: 16 clusters per frame. */
1779 attr->nres.c_unit = NTFS_LZNT_CUNIT;
1780 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops_cmpr;
1782 attr->name_off = SIZEOF_NONRESIDENT_LE;
1784 attr->nres.c_unit = 0;
1785 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1787 attr->nres.run_off = attr->name_off;
1789 attr->flags = new_aflags;
1798 * buffer - memory for reparse buffer header
1800 enum REPARSE_SIGN ni_parse_reparse(struct ntfs_inode *ni, struct ATTRIB *attr,
1801 struct REPARSE_DATA_BUFFER *buffer)
1803 const struct REPARSE_DATA_BUFFER *rp = NULL;
1806 typeof(rp->CompressReparseBuffer) *cmpr;
1808 /* Try to estimate reparse point. */
1809 if (!attr->non_res) {
1810 rp = resident_data_ex(attr, sizeof(struct REPARSE_DATA_BUFFER));
1811 } else if (le64_to_cpu(attr->nres.data_size) >=
1812 sizeof(struct REPARSE_DATA_BUFFER)) {
1813 struct runs_tree run;
1817 if (!attr_load_runs_vcn(ni, ATTR_REPARSE, NULL, 0, &run, 0) &&
1818 !ntfs_read_run_nb(ni->mi.sbi, &run, 0, buffer,
1819 sizeof(struct REPARSE_DATA_BUFFER),
1828 return REPARSE_NONE;
1830 len = le16_to_cpu(rp->ReparseDataLength);
1831 switch (rp->ReparseTag) {
1832 case (IO_REPARSE_TAG_MICROSOFT | IO_REPARSE_TAG_SYMBOLIC_LINK):
1833 break; /* Symbolic link. */
1834 case IO_REPARSE_TAG_MOUNT_POINT:
1835 break; /* Mount points and junctions. */
1836 case IO_REPARSE_TAG_SYMLINK:
1838 case IO_REPARSE_TAG_COMPRESS:
1840 * WOF - Windows Overlay Filter - Used to compress files with
1843 * Unlike native NTFS file compression, the Windows
1844 * Overlay Filter supports only read operations. This means
1845 * that it doesn't need to sector-align each compressed chunk,
1846 * so the compressed data can be packed more tightly together.
1847 * If you open the file for writing, the WOF just decompresses
1848 * the entire file, turning it back into a plain file.
1850 * Ntfs3 driver decompresses the entire file only on write or
1851 * change size requests.
1854 cmpr = &rp->CompressReparseBuffer;
1855 if (len < sizeof(*cmpr) ||
1856 cmpr->WofVersion != WOF_CURRENT_VERSION ||
1857 cmpr->WofProvider != WOF_PROVIDER_SYSTEM ||
1858 cmpr->ProviderVer != WOF_PROVIDER_CURRENT_VERSION) {
1859 return REPARSE_NONE;
1862 switch (cmpr->CompressionFormat) {
1863 case WOF_COMPRESSION_XPRESS4K:
1866 case WOF_COMPRESSION_XPRESS8K:
1869 case WOF_COMPRESSION_XPRESS16K:
1872 case WOF_COMPRESSION_LZX32K:
1879 ni_set_ext_compress_bits(ni, bits);
1880 return REPARSE_COMPRESSED;
1882 case IO_REPARSE_TAG_DEDUP:
1883 ni->ni_flags |= NI_FLAG_DEDUPLICATED;
1884 return REPARSE_DEDUPLICATED;
1887 if (rp->ReparseTag & IO_REPARSE_TAG_NAME_SURROGATE)
1890 return REPARSE_NONE;
1894 memcpy(buffer, rp, sizeof(struct REPARSE_DATA_BUFFER));
1896 /* Looks like normal symlink. */
1897 return REPARSE_LINK;
1901 * ni_fiemap - Helper for file_fiemap().
1904 * TODO: Less aggressive locks.
1906 int ni_fiemap(struct ntfs_inode *ni, struct fiemap_extent_info *fieinfo,
1907 __u64 vbo, __u64 len)
1910 struct ntfs_sb_info *sbi = ni->mi.sbi;
1911 u8 cluster_bits = sbi->cluster_bits;
1912 struct runs_tree *run;
1913 struct rw_semaphore *run_lock;
1914 struct ATTRIB *attr;
1915 CLST vcn = vbo >> cluster_bits;
1917 u64 valid = ni->i_valid;
1919 u64 end, alloc_size;
1924 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1925 run = &ni->dir.alloc_run;
1926 attr = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, I30_NAME,
1927 ARRAY_SIZE(I30_NAME), NULL, NULL);
1928 run_lock = &ni->dir.run_lock;
1930 run = &ni->file.run;
1931 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL,
1937 if (is_attr_compressed(attr)) {
1938 /* Unfortunately cp -r incorrectly treats compressed clusters. */
1942 "fiemap is not supported for compressed file (cp -r)");
1945 run_lock = &ni->file.run_lock;
1948 if (!attr || !attr->non_res) {
1949 err = fiemap_fill_next_extent(
1951 attr ? le32_to_cpu(attr->res.data_size) : 0,
1952 FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_LAST |
1953 FIEMAP_EXTENT_MERGED);
1958 alloc_size = le64_to_cpu(attr->nres.alloc_size);
1959 if (end > alloc_size)
1962 down_read(run_lock);
1966 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1968 CLST vcn_next = vcn;
1970 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) &&
1978 down_write(run_lock);
1980 err = attr_load_runs_vcn(ni, attr->type,
1982 attr->name_len, run, vcn);
1985 down_read(run_lock);
1990 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
2003 if (lcn == SPARSE_LCN) {
2005 vbo = (u64)vcn << cluster_bits;
2009 flags = FIEMAP_EXTENT_MERGED;
2010 if (S_ISDIR(ni->vfs_inode.i_mode)) {
2012 } else if (is_attr_compressed(attr)) {
2015 err = attr_is_frame_compressed(
2016 ni, attr, vcn >> attr->nres.c_unit, &clst_data);
2019 if (clst_data < NTFS_LZNT_CLUSTERS)
2020 flags |= FIEMAP_EXTENT_ENCODED;
2021 } else if (is_attr_encrypted(attr)) {
2022 flags |= FIEMAP_EXTENT_DATA_ENCRYPTED;
2025 vbo = (u64)vcn << cluster_bits;
2026 bytes = (u64)clen << cluster_bits;
2027 lbo = (u64)lcn << cluster_bits;
2031 if (vbo + bytes >= end)
2034 if (vbo + bytes <= valid) {
2036 } else if (vbo >= valid) {
2037 flags |= FIEMAP_EXTENT_UNWRITTEN;
2039 /* vbo < valid && valid < vbo + bytes */
2040 u64 dlen = valid - vbo;
2042 if (vbo + dlen >= end)
2043 flags |= FIEMAP_EXTENT_LAST;
2045 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, dlen,
2060 flags |= FIEMAP_EXTENT_UNWRITTEN;
2063 if (vbo + bytes >= end)
2064 flags |= FIEMAP_EXTENT_LAST;
2066 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, bytes, flags);
2086 * When decompressing, we typically obtain more than one page per reference.
2087 * We inject the additional pages into the page cache.
2089 int ni_readpage_cmpr(struct ntfs_inode *ni, struct page *page)
2092 struct ntfs_sb_info *sbi = ni->mi.sbi;
2093 struct address_space *mapping = page->mapping;
2094 pgoff_t index = page->index;
2095 u64 frame_vbo, vbo = (u64)index << PAGE_SHIFT;
2096 struct page **pages = NULL; /* Array of at most 16 pages. stack? */
2099 u32 i, idx, frame_size, pages_per_frame;
2103 if (vbo >= ni->vfs_inode.i_size) {
2104 SetPageUptodate(page);
2109 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2110 /* Xpress or LZX. */
2111 frame_bits = ni_ext_compress_bits(ni);
2113 /* LZNT compression. */
2114 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2116 frame_size = 1u << frame_bits;
2117 frame = vbo >> frame_bits;
2118 frame_vbo = (u64)frame << frame_bits;
2119 idx = (vbo - frame_vbo) >> PAGE_SHIFT;
2121 pages_per_frame = frame_size >> PAGE_SHIFT;
2122 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2129 index = frame_vbo >> PAGE_SHIFT;
2130 gfp_mask = mapping_gfp_mask(mapping);
2132 for (i = 0; i < pages_per_frame; i++, index++) {
2136 pg = find_or_create_page(mapping, index, gfp_mask);
2144 err = ni_read_frame(ni, frame_vbo, pages, pages_per_frame);
2150 for (i = 0; i < pages_per_frame; i++) {
2159 /* At this point, err contains 0 or -EIO depending on the "critical" page. */
2166 #ifdef CONFIG_NTFS3_LZX_XPRESS
2168 * ni_decompress_file - Decompress LZX/Xpress compressed file.
2170 * Remove ATTR_DATA::WofCompressedData.
2171 * Remove ATTR_REPARSE.
2173 int ni_decompress_file(struct ntfs_inode *ni)
2175 struct ntfs_sb_info *sbi = ni->mi.sbi;
2176 struct inode *inode = &ni->vfs_inode;
2177 loff_t i_size = inode->i_size;
2178 struct address_space *mapping = inode->i_mapping;
2179 gfp_t gfp_mask = mapping_gfp_mask(mapping);
2180 struct page **pages = NULL;
2181 struct ATTR_LIST_ENTRY *le;
2182 struct ATTRIB *attr;
2183 CLST vcn, cend, lcn, clen, end;
2187 u32 i, frame_size, pages_per_frame, bytes;
2188 struct mft_inode *mi;
2191 /* Clusters for decompressed data. */
2192 cend = bytes_to_cluster(sbi, i_size);
2197 /* Check in advance. */
2198 if (cend > wnd_zeroes(&sbi->used.bitmap)) {
2203 frame_bits = ni_ext_compress_bits(ni);
2204 frame_size = 1u << frame_bits;
2205 pages_per_frame = frame_size >> PAGE_SHIFT;
2206 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2213 * Step 1: Decompress data and copy to new allocated clusters.
2216 for (vbo = 0; vbo < i_size; vbo += bytes) {
2220 if (vbo + frame_size > i_size) {
2221 bytes = i_size - vbo;
2222 nr_pages = (bytes + PAGE_SIZE - 1) >> PAGE_SHIFT;
2224 nr_pages = pages_per_frame;
2228 end = bytes_to_cluster(sbi, vbo + bytes);
2230 for (vcn = vbo >> sbi->cluster_bits; vcn < end; vcn += clen) {
2231 err = attr_data_get_block(ni, vcn, cend - vcn, &lcn,
2237 for (i = 0; i < pages_per_frame; i++, index++) {
2240 pg = find_or_create_page(mapping, index, gfp_mask);
2243 unlock_page(pages[i]);
2252 err = ni_read_frame(ni, vbo, pages, pages_per_frame);
2255 down_read(&ni->file.run_lock);
2256 err = ntfs_bio_pages(sbi, &ni->file.run, pages,
2257 nr_pages, vbo, bytes,
2259 up_read(&ni->file.run_lock);
2262 for (i = 0; i < pages_per_frame; i++) {
2263 unlock_page(pages[i]);
2275 * Step 2: Deallocate attributes ATTR_DATA::WofCompressedData
2280 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
2284 if (attr->type == ATTR_REPARSE) {
2287 mi_get_ref(&ni->mi, &ref);
2288 ntfs_remove_reparse(sbi, 0, &ref);
2294 if (attr->type != ATTR_REPARSE &&
2295 (attr->type != ATTR_DATA ||
2296 attr->name_len != ARRAY_SIZE(WOF_NAME) ||
2297 memcmp(attr_name(attr), WOF_NAME, sizeof(WOF_NAME))))
2300 svcn = le64_to_cpu(attr->nres.svcn);
2301 evcn = le64_to_cpu(attr->nres.evcn);
2303 if (evcn + 1 <= svcn)
2306 asize = le32_to_cpu(attr->size);
2307 roff = le16_to_cpu(attr->nres.run_off);
2314 /*run==1 Means unpack and deallocate. */
2315 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
2316 Add2Ptr(attr, roff), asize - roff);
2320 * Step 3: Remove attribute ATTR_DATA::WofCompressedData.
2322 err = ni_remove_attr(ni, ATTR_DATA, WOF_NAME, ARRAY_SIZE(WOF_NAME),
2328 * Step 4: Remove ATTR_REPARSE.
2330 err = ni_remove_attr(ni, ATTR_REPARSE, NULL, 0, false, NULL);
2335 * Step 5: Remove sparse flag from data attribute.
2337 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
2343 if (attr->non_res && is_attr_sparsed(attr)) {
2344 /* Sparsed attribute header is 8 bytes bigger than normal. */
2345 struct MFT_REC *rec = mi->mrec;
2346 u32 used = le32_to_cpu(rec->used);
2347 u32 asize = le32_to_cpu(attr->size);
2348 u16 roff = le16_to_cpu(attr->nres.run_off);
2349 char *rbuf = Add2Ptr(attr, roff);
2351 memmove(rbuf - 8, rbuf, used - PtrOffset(rec, rbuf));
2352 attr->size = cpu_to_le32(asize - 8);
2353 attr->flags &= ~ATTR_FLAG_SPARSED;
2354 attr->nres.run_off = cpu_to_le16(roff - 8);
2355 attr->nres.c_unit = 0;
2356 rec->used = cpu_to_le32(used - 8);
2358 ni->std_fa &= ~(FILE_ATTRIBUTE_SPARSE_FILE |
2359 FILE_ATTRIBUTE_REPARSE_POINT);
2361 mark_inode_dirty(inode);
2364 /* Clear cached flag. */
2365 ni->ni_flags &= ~NI_FLAG_COMPRESSED_MASK;
2366 if (ni->file.offs_page) {
2367 put_page(ni->file.offs_page);
2368 ni->file.offs_page = NULL;
2370 mapping->a_ops = &ntfs_aops;
2375 _ntfs_bad_inode(inode);
2381 * decompress_lzx_xpress - External compression LZX/Xpress.
2383 static int decompress_lzx_xpress(struct ntfs_sb_info *sbi, const char *cmpr,
2384 size_t cmpr_size, void *unc, size_t unc_size,
2390 if (cmpr_size == unc_size) {
2391 /* Frame not compressed. */
2392 memcpy(unc, cmpr, unc_size);
2397 if (frame_size == 0x8000) {
2398 mutex_lock(&sbi->compress.mtx_lzx);
2399 /* LZX: Frame compressed. */
2400 ctx = sbi->compress.lzx;
2402 /* Lazy initialize LZX decompress context. */
2403 ctx = lzx_allocate_decompressor();
2409 sbi->compress.lzx = ctx;
2412 if (lzx_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2413 /* Treat all errors as "invalid argument". */
2417 mutex_unlock(&sbi->compress.mtx_lzx);
2419 /* XPRESS: Frame compressed. */
2420 mutex_lock(&sbi->compress.mtx_xpress);
2421 ctx = sbi->compress.xpress;
2423 /* Lazy initialize Xpress decompress context. */
2424 ctx = xpress_allocate_decompressor();
2430 sbi->compress.xpress = ctx;
2433 if (xpress_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2434 /* Treat all errors as "invalid argument". */
2438 mutex_unlock(&sbi->compress.mtx_xpress);
2447 * Pages - Array of locked pages.
2449 int ni_read_frame(struct ntfs_inode *ni, u64 frame_vbo, struct page **pages,
2450 u32 pages_per_frame)
2453 struct ntfs_sb_info *sbi = ni->mi.sbi;
2454 u8 cluster_bits = sbi->cluster_bits;
2455 char *frame_ondisk = NULL;
2456 char *frame_mem = NULL;
2457 struct page **pages_disk = NULL;
2458 struct ATTR_LIST_ENTRY *le = NULL;
2459 struct runs_tree *run = &ni->file.run;
2460 u64 valid_size = ni->i_valid;
2463 u32 frame_size, i, npages_disk, ondisk_size;
2465 struct ATTRIB *attr;
2466 CLST frame, clst_data;
2469 * To simplify decompress algorithm do vmap for source
2472 for (i = 0; i < pages_per_frame; i++)
2475 frame_size = pages_per_frame << PAGE_SHIFT;
2476 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL);
2482 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, NULL);
2488 if (!attr->non_res) {
2489 u32 data_size = le32_to_cpu(attr->res.data_size);
2491 memset(frame_mem, 0, frame_size);
2492 if (frame_vbo < data_size) {
2493 ondisk_size = data_size - frame_vbo;
2494 memcpy(frame_mem, resident_data(attr) + frame_vbo,
2495 min(ondisk_size, frame_size));
2501 if (frame_vbo >= valid_size) {
2502 memset(frame_mem, 0, frame_size);
2507 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2508 #ifndef CONFIG_NTFS3_LZX_XPRESS
2512 u32 frame_bits = ni_ext_compress_bits(ni);
2513 u64 frame64 = frame_vbo >> frame_bits;
2514 u64 frames, vbo_data;
2516 if (frame_size != (1u << frame_bits)) {
2520 switch (frame_size) {
2527 /* Unknown compression. */
2532 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, WOF_NAME,
2533 ARRAY_SIZE(WOF_NAME), NULL, NULL);
2537 "external compressed file should contains data attribute \"WofCompressedData\"");
2542 if (!attr->non_res) {
2552 frames = (ni->vfs_inode.i_size - 1) >> frame_bits;
2554 err = attr_wof_frame_info(ni, attr, run, frame64, frames,
2555 frame_bits, &ondisk_size, &vbo_data);
2559 if (frame64 == frames) {
2560 unc_size = 1 + ((ni->vfs_inode.i_size - 1) &
2562 ondisk_size = attr_size(attr) - vbo_data;
2564 unc_size = frame_size;
2567 if (ondisk_size > frame_size) {
2572 if (!attr->non_res) {
2573 if (vbo_data + ondisk_size >
2574 le32_to_cpu(attr->res.data_size)) {
2579 err = decompress_lzx_xpress(
2580 sbi, Add2Ptr(resident_data(attr), vbo_data),
2581 ondisk_size, frame_mem, unc_size, frame_size);
2584 vbo_disk = vbo_data;
2585 /* Load all runs to read [vbo_disk-vbo_to). */
2586 err = attr_load_runs_range(ni, ATTR_DATA, WOF_NAME,
2587 ARRAY_SIZE(WOF_NAME), run, vbo_disk,
2588 vbo_data + ondisk_size);
2591 npages_disk = (ondisk_size + (vbo_disk & (PAGE_SIZE - 1)) +
2595 } else if (is_attr_compressed(attr)) {
2596 /* LZNT compression. */
2597 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2602 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2607 down_write(&ni->file.run_lock);
2608 run_truncate_around(run, le64_to_cpu(attr->nres.svcn));
2609 frame = frame_vbo >> (cluster_bits + NTFS_LZNT_CUNIT);
2610 err = attr_is_frame_compressed(ni, attr, frame, &clst_data);
2611 up_write(&ni->file.run_lock);
2616 memset(frame_mem, 0, frame_size);
2620 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2621 ondisk_size = clst_data << cluster_bits;
2623 if (clst_data >= NTFS_LZNT_CLUSTERS) {
2624 /* Frame is not compressed. */
2625 down_read(&ni->file.run_lock);
2626 err = ntfs_bio_pages(sbi, run, pages, pages_per_frame,
2627 frame_vbo, ondisk_size,
2629 up_read(&ni->file.run_lock);
2632 vbo_disk = frame_vbo;
2633 npages_disk = (ondisk_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
2635 __builtin_unreachable();
2640 pages_disk = kzalloc(npages_disk * sizeof(struct page *), GFP_NOFS);
2646 for (i = 0; i < npages_disk; i++) {
2647 pg = alloc_page(GFP_KERNEL);
2657 /* Read 'ondisk_size' bytes from disk. */
2658 down_read(&ni->file.run_lock);
2659 err = ntfs_bio_pages(sbi, run, pages_disk, npages_disk, vbo_disk,
2660 ondisk_size, REQ_OP_READ);
2661 up_read(&ni->file.run_lock);
2666 * To simplify decompress algorithm do vmap for source and target pages.
2668 frame_ondisk = vmap(pages_disk, npages_disk, VM_MAP, PAGE_KERNEL_RO);
2669 if (!frame_ondisk) {
2674 /* Decompress: Frame_ondisk -> frame_mem. */
2675 #ifdef CONFIG_NTFS3_LZX_XPRESS
2676 if (run != &ni->file.run) {
2678 err = decompress_lzx_xpress(
2679 sbi, frame_ondisk + (vbo_disk & (PAGE_SIZE - 1)),
2680 ondisk_size, frame_mem, unc_size, frame_size);
2684 /* LZNT - Native NTFS compression. */
2685 unc_size = decompress_lznt(frame_ondisk, ondisk_size, frame_mem,
2687 if ((ssize_t)unc_size < 0)
2689 else if (!unc_size || unc_size > frame_size)
2692 if (!err && valid_size < frame_vbo + frame_size) {
2693 size_t ok = valid_size - frame_vbo;
2695 memset(frame_mem + ok, 0, frame_size - ok);
2698 vunmap(frame_ondisk);
2701 for (i = 0; i < npages_disk; i++) {
2712 #ifdef CONFIG_NTFS3_LZX_XPRESS
2713 if (run != &ni->file.run)
2719 for (i = 0; i < pages_per_frame; i++) {
2723 SetPageUptodate(pg);
2732 * Pages - Array of locked pages.
2734 int ni_write_frame(struct ntfs_inode *ni, struct page **pages,
2735 u32 pages_per_frame)
2738 struct ntfs_sb_info *sbi = ni->mi.sbi;
2739 u8 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2740 u32 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2741 u64 frame_vbo = (u64)pages[0]->index << PAGE_SHIFT;
2742 CLST frame = frame_vbo >> frame_bits;
2743 char *frame_ondisk = NULL;
2744 struct page **pages_disk = NULL;
2745 struct ATTR_LIST_ENTRY *le = NULL;
2747 struct ATTRIB *attr;
2748 struct mft_inode *mi;
2751 size_t compr_size, ondisk_size;
2754 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, &mi);
2760 if (WARN_ON(!is_attr_compressed(attr))) {
2765 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2770 if (!attr->non_res) {
2771 down_write(&ni->file.run_lock);
2772 err = attr_make_nonresident(ni, attr, le, mi,
2773 le32_to_cpu(attr->res.data_size),
2774 &ni->file.run, &attr, pages[0]);
2775 up_write(&ni->file.run_lock);
2780 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2785 pages_disk = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2791 for (i = 0; i < pages_per_frame; i++) {
2792 pg = alloc_page(GFP_KERNEL);
2802 /* To simplify compress algorithm do vmap for source and target pages. */
2803 frame_ondisk = vmap(pages_disk, pages_per_frame, VM_MAP, PAGE_KERNEL);
2804 if (!frame_ondisk) {
2809 for (i = 0; i < pages_per_frame; i++)
2812 /* Map in-memory frame for read-only. */
2813 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL_RO);
2819 mutex_lock(&sbi->compress.mtx_lznt);
2821 if (!sbi->compress.lznt) {
2823 * LZNT implements two levels of compression:
2824 * 0 - Standard compression
2825 * 1 - Best compression, requires a lot of cpu
2828 lznt = get_lznt_ctx(0);
2830 mutex_unlock(&sbi->compress.mtx_lznt);
2835 sbi->compress.lznt = lznt;
2839 /* Compress: frame_mem -> frame_ondisk */
2840 compr_size = compress_lznt(frame_mem, frame_size, frame_ondisk,
2841 frame_size, sbi->compress.lznt);
2842 mutex_unlock(&sbi->compress.mtx_lznt);
2845 if (compr_size + sbi->cluster_size > frame_size) {
2846 /* Frame is not compressed. */
2847 compr_size = frame_size;
2848 ondisk_size = frame_size;
2849 } else if (compr_size) {
2850 /* Frame is compressed. */
2851 ondisk_size = ntfs_up_cluster(sbi, compr_size);
2852 memset(frame_ondisk + compr_size, 0, ondisk_size - compr_size);
2854 /* Frame is sparsed. */
2858 down_write(&ni->file.run_lock);
2859 run_truncate_around(&ni->file.run, le64_to_cpu(attr->nres.svcn));
2860 err = attr_allocate_frame(ni, frame, compr_size, ni->i_valid);
2861 up_write(&ni->file.run_lock);
2868 down_read(&ni->file.run_lock);
2869 err = ntfs_bio_pages(sbi, &ni->file.run,
2870 ondisk_size < frame_size ? pages_disk : pages,
2871 pages_per_frame, frame_vbo, ondisk_size,
2873 up_read(&ni->file.run_lock);
2879 for (i = 0; i < pages_per_frame; i++)
2882 vunmap(frame_ondisk);
2884 for (i = 0; i < pages_per_frame; i++) {
2898 * ni_remove_name - Removes name 'de' from MFT and from directory.
2899 * 'de2' and 'undo_step' are used to restore MFT/dir, if error occurs.
2901 int ni_remove_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2902 struct NTFS_DE *de, struct NTFS_DE **de2, int *undo_step)
2905 struct ntfs_sb_info *sbi = ni->mi.sbi;
2906 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2907 struct ATTR_FILE_NAME *fname;
2908 struct ATTR_LIST_ENTRY *le;
2909 struct mft_inode *mi;
2910 u16 de_key_size = le16_to_cpu(de->key_size);
2915 /* Find name in record. */
2916 mi_get_ref(&dir_ni->mi, &de_name->home);
2918 fname = ni_fname_name(ni, (struct cpu_str *)&de_name->name_len,
2919 &de_name->home, &mi, &le);
2923 memcpy(&de_name->dup, &fname->dup, sizeof(struct NTFS_DUP_INFO));
2924 name_type = paired_name(fname->type);
2926 /* Mark ntfs as dirty. It will be cleared at umount. */
2927 ntfs_set_state(sbi, NTFS_DIRTY_DIRTY);
2929 /* Step 1: Remove name from directory. */
2930 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname, de_key_size, sbi);
2934 /* Step 2: Remove name from MFT. */
2935 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2939 /* Get paired name. */
2940 fname = ni_fname_type(ni, name_type, &mi, &le);
2942 u16 de2_key_size = fname_full_size(fname);
2944 *de2 = Add2Ptr(de, 1024);
2945 (*de2)->key_size = cpu_to_le16(de2_key_size);
2947 memcpy(*de2 + 1, fname, de2_key_size);
2949 /* Step 3: Remove paired name from directory. */
2950 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname,
2955 /* Step 4: Remove paired name from MFT. */
2956 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2964 * ni_remove_name_undo - Paired function for ni_remove_name.
2966 * Return: True if ok
2968 bool ni_remove_name_undo(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2969 struct NTFS_DE *de, struct NTFS_DE *de2, int undo_step)
2971 struct ntfs_sb_info *sbi = ni->mi.sbi;
2972 struct ATTRIB *attr;
2973 u16 de_key_size = de2 ? le16_to_cpu(de2->key_size) : 0;
2975 switch (undo_step) {
2977 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2978 &attr, NULL, NULL)) {
2981 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de2 + 1, de_key_size);
2983 mi_get_ref(&ni->mi, &de2->ref);
2984 de2->size = cpu_to_le16(ALIGN(de_key_size, 8) +
2985 sizeof(struct NTFS_DE));
2989 if (indx_insert_entry(&dir_ni->dir, dir_ni, de2, sbi, NULL,
2996 de_key_size = le16_to_cpu(de->key_size);
2998 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2999 &attr, NULL, NULL)) {
3003 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de + 1, de_key_size);
3004 mi_get_ref(&ni->mi, &de->ref);
3006 if (indx_insert_entry(&dir_ni->dir, dir_ni, de, sbi, NULL, 1))
3014 * ni_add_name - Add new name into MFT and into directory.
3016 int ni_add_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
3020 struct ATTRIB *attr;
3021 struct ATTR_LIST_ENTRY *le;
3022 struct mft_inode *mi;
3023 struct ATTR_FILE_NAME *fname;
3024 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
3025 u16 de_key_size = le16_to_cpu(de->key_size);
3027 mi_get_ref(&ni->mi, &de->ref);
3028 mi_get_ref(&dir_ni->mi, &de_name->home);
3030 /* Fill duplicate from any ATTR_NAME. */
3031 fname = ni_fname_name(ni, NULL, NULL, NULL, NULL);
3033 memcpy(&de_name->dup, &fname->dup, sizeof(fname->dup));
3034 de_name->dup.fa = ni->std_fa;
3036 /* Insert new name into MFT. */
3037 err = ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0, &attr,
3042 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de_name, de_key_size);
3044 /* Insert new name into directory. */
3045 err = indx_insert_entry(&dir_ni->dir, dir_ni, de, ni->mi.sbi, NULL, 0);
3047 ni_remove_attr_le(ni, attr, mi, le);
3053 * ni_rename - Remove one name and insert new name.
3055 int ni_rename(struct ntfs_inode *dir_ni, struct ntfs_inode *new_dir_ni,
3056 struct ntfs_inode *ni, struct NTFS_DE *de, struct NTFS_DE *new_de,
3060 struct NTFS_DE *de2 = NULL;
3064 * There are two possible ways to rename:
3065 * 1) Add new name and remove old name.
3066 * 2) Remove old name and add new name.
3068 * In most cases (not all!) adding new name into MFT and into directory can
3069 * allocate additional cluster(s).
3070 * Second way may result to bad inode if we can't add new name
3071 * and then can't restore (add) old name.
3075 * Way 1 - Add new + remove old.
3077 err = ni_add_name(new_dir_ni, ni, new_de);
3079 err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3080 if (err && ni_remove_name(new_dir_ni, ni, new_de, &de2, &undo))
3085 * Way 2 - Remove old + add new.
3088 * err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3090 * err = ni_add_name(new_dir_ni, ni, new_de);
3091 * if (err && !ni_remove_name_undo(dir_ni, ni, de, de2, undo))
3100 * ni_is_dirty - Return: True if 'ni' requires ni_write_inode.
3102 bool ni_is_dirty(struct inode *inode)
3104 struct ntfs_inode *ni = ntfs_i(inode);
3105 struct rb_node *node;
3107 if (ni->mi.dirty || ni->attr_list.dirty ||
3108 (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3111 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
3112 if (rb_entry(node, struct mft_inode, node)->dirty)
3122 * Update duplicate info of ATTR_FILE_NAME in MFT and in parent directories.
3124 static bool ni_update_parent(struct ntfs_inode *ni, struct NTFS_DUP_INFO *dup,
3127 struct ATTRIB *attr;
3128 struct mft_inode *mi;
3129 struct ATTR_LIST_ENTRY *le = NULL;
3130 struct ntfs_sb_info *sbi = ni->mi.sbi;
3131 struct super_block *sb = sbi->sb;
3132 bool re_dirty = false;
3134 if (ni->mi.mrec->flags & RECORD_FLAG_DIR) {
3135 dup->fa |= FILE_ATTRIBUTE_DIRECTORY;
3137 dup->alloc_size = 0;
3140 dup->fa &= ~FILE_ATTRIBUTE_DIRECTORY;
3142 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL,
3145 dup->alloc_size = dup->data_size = 0;
3146 } else if (!attr->non_res) {
3147 u32 data_size = le32_to_cpu(attr->res.data_size);
3149 dup->alloc_size = cpu_to_le64(ALIGN(data_size, 8));
3150 dup->data_size = cpu_to_le64(data_size);
3152 u64 new_valid = ni->i_valid;
3153 u64 data_size = le64_to_cpu(attr->nres.data_size);
3156 dup->alloc_size = is_attr_ext(attr)
3157 ? attr->nres.total_size
3158 : attr->nres.alloc_size;
3159 dup->data_size = attr->nres.data_size;
3161 if (new_valid > data_size)
3162 new_valid = data_size;
3164 valid_le = cpu_to_le64(new_valid);
3165 if (valid_le != attr->nres.valid_size) {
3166 attr->nres.valid_size = valid_le;
3172 /* TODO: Fill reparse info. */
3176 if (ni->ni_flags & NI_FLAG_EA) {
3177 attr = ni_find_attr(ni, attr, &le, ATTR_EA_INFO, NULL, 0, NULL,
3180 const struct EA_INFO *info;
3182 info = resident_data_ex(attr, sizeof(struct EA_INFO));
3183 /* If ATTR_EA_INFO exists 'info' can't be NULL. */
3185 dup->ea_size = info->size_pack;
3192 while ((attr = ni_find_attr(ni, attr, &le, ATTR_NAME, NULL, 0, NULL,
3195 struct ATTR_FILE_NAME *fname;
3197 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
3198 if (!fname || !memcmp(&fname->dup, dup, sizeof(fname->dup)))
3201 /* ntfs_iget5 may sleep. */
3202 dir = ntfs_iget5(sb, &fname->home, NULL);
3206 "failed to open parent directory r=%lx to update",
3207 (long)ino_get(&fname->home));
3211 if (!is_bad_inode(dir)) {
3212 struct ntfs_inode *dir_ni = ntfs_i(dir);
3214 if (!ni_trylock(dir_ni)) {
3217 indx_update_dup(dir_ni, sbi, fname, dup, sync);
3219 memcpy(&fname->dup, dup, sizeof(fname->dup));
3230 * ni_write_inode - Write MFT base record and all subrecords to disk.
3232 int ni_write_inode(struct inode *inode, int sync, const char *hint)
3235 struct ntfs_inode *ni = ntfs_i(inode);
3236 struct super_block *sb = inode->i_sb;
3237 struct ntfs_sb_info *sbi = sb->s_fs_info;
3238 bool re_dirty = false;
3239 struct ATTR_STD_INFO *std;
3240 struct rb_node *node, *next;
3241 struct NTFS_DUP_INFO dup;
3243 if (is_bad_inode(inode) || sb_rdonly(sb))
3246 if (!ni_trylock(ni)) {
3247 /* 'ni' is under modification, skip for now. */
3248 mark_inode_dirty_sync(inode);
3252 if (is_rec_inuse(ni->mi.mrec) &&
3253 !(sbi->flags & NTFS_FLAGS_LOG_REPLAYING) && inode->i_nlink) {
3254 bool modified = false;
3256 /* Update times in standard attribute. */
3263 /* Update the access times if they have changed. */
3264 dup.m_time = kernel2nt(&inode->i_mtime);
3265 if (std->m_time != dup.m_time) {
3266 std->m_time = dup.m_time;
3270 dup.c_time = kernel2nt(&inode->i_ctime);
3271 if (std->c_time != dup.c_time) {
3272 std->c_time = dup.c_time;
3276 dup.a_time = kernel2nt(&inode->i_atime);
3277 if (std->a_time != dup.a_time) {
3278 std->a_time = dup.a_time;
3282 dup.fa = ni->std_fa;
3283 if (std->fa != dup.fa) {
3289 ni->mi.dirty = true;
3291 if (!ntfs_is_meta_file(sbi, inode->i_ino) &&
3292 (modified || (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3293 /* Avoid __wait_on_freeing_inode(inode). */
3294 && (sb->s_flags & SB_ACTIVE)) {
3295 dup.cr_time = std->cr_time;
3296 /* Not critical if this function fail. */
3297 re_dirty = ni_update_parent(ni, &dup, sync);
3300 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
3302 ni->ni_flags &= ~NI_FLAG_UPDATE_PARENT;
3305 /* Update attribute list. */
3306 if (ni->attr_list.size && ni->attr_list.dirty) {
3307 if (inode->i_ino != MFT_REC_MFT || sync) {
3308 err = ni_try_remove_attr_list(ni);
3313 err = al_update(ni, sync);
3319 for (node = rb_first(&ni->mi_tree); node; node = next) {
3320 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
3323 next = rb_next(node);
3328 is_empty = !mi_enum_attr(mi, NULL);
3331 clear_rec_inuse(mi->mrec);
3333 err2 = mi_write(mi, sync);
3338 ntfs_mark_rec_free(sbi, mi->rno, false);
3339 rb_erase(node, &ni->mi_tree);
3345 err2 = mi_write(&ni->mi, sync);
3353 ntfs_err(sb, "%s r=%lx failed, %d.", hint, inode->i_ino, err);
3354 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
3359 mark_inode_dirty_sync(inode);