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);
571 err = run_unpack(&run, sbi, ni->mi.rno, svcn, evcn, svcn,
573 le32_to_cpu(attr->size) - roff);
588 * Run contains data from two records: mi_p and mi
589 * Try to pack in one.
591 err = mi_pack_runs(mi_p, attr_p, &run, evcn + 1 - svcn_p);
595 next_svcn = le64_to_cpu(attr_p->nres.evcn) + 1;
597 if (next_svcn >= evcn + 1) {
598 /* We can remove this attribute segment. */
599 al_remove_le(ni, le);
600 mi_remove_attr(NULL, mi, attr);
605 attr->nres.svcn = le->vcn = cpu_to_le64(next_svcn);
607 ni->attr_list.dirty = true;
609 if (evcn + 1 == alloc) {
610 err = mi_pack_runs(mi, attr, &run,
611 evcn + 1 - next_svcn);
621 run_truncate_head(&run, next_svcn);
626 ntfs_inode_warn(&ni->vfs_inode, "repack problem");
627 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
629 /* Pack loaded but not packed runs. */
631 mi_pack_runs(mi_p, attr_p, &run, evcn_p + 1 - svcn_p);
639 * ni_try_remove_attr_list
641 * Can we remove attribute list?
642 * Check the case when primary record contains enough space for all attributes.
644 static int ni_try_remove_attr_list(struct ntfs_inode *ni)
647 struct ntfs_sb_info *sbi = ni->mi.sbi;
648 struct ATTRIB *attr, *attr_list, *attr_ins;
649 struct ATTR_LIST_ENTRY *le;
650 struct mft_inode *mi;
653 struct MFT_REC *mrec;
656 if (!ni->attr_list.dirty)
663 attr_list = mi_find_attr(&ni->mi, NULL, ATTR_LIST, NULL, 0, NULL);
667 asize = le32_to_cpu(attr_list->size);
669 /* Free space in primary record without attribute list. */
670 free = sbi->record_size - le32_to_cpu(ni->mi.mrec->used) + asize;
671 mi_get_ref(&ni->mi, &ref);
674 while ((le = al_enumerate(ni, le))) {
675 if (!memcmp(&le->ref, &ref, sizeof(ref)))
681 mi = ni_find_mi(ni, ino_get(&le->ref));
685 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
686 le->name_len, &le->id);
690 asize = le32_to_cpu(attr->size);
697 /* Make a copy of primary record to restore if error. */
698 mrec = kmemdup(ni->mi.mrec, sbi->record_size, GFP_NOFS);
700 return 0; /* Not critical. */
702 /* It seems that attribute list can be removed from primary record. */
703 mi_remove_attr(NULL, &ni->mi, attr_list);
706 * Repeat the cycle above and copy all attributes to primary record.
707 * Do not remove original attributes from subrecords!
708 * It should be success!
711 while ((le = al_enumerate(ni, le))) {
712 if (!memcmp(&le->ref, &ref, sizeof(ref)))
715 mi = ni_find_mi(ni, ino_get(&le->ref));
717 /* Should never happened, 'cause already checked. */
721 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
722 le->name_len, &le->id);
724 /* Should never happened, 'cause already checked. */
727 asize = le32_to_cpu(attr->size);
729 /* Insert into primary record. */
730 attr_ins = mi_insert_attr(&ni->mi, le->type, le_name(le),
732 le16_to_cpu(attr->name_off));
735 * No space in primary record (already checked).
740 /* Copy all except id. */
742 memcpy(attr_ins, attr, asize);
747 * Repeat the cycle above and remove all attributes from subrecords.
750 while ((le = al_enumerate(ni, le))) {
751 if (!memcmp(&le->ref, &ref, sizeof(ref)))
754 mi = ni_find_mi(ni, ino_get(&le->ref));
758 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
759 le->name_len, &le->id);
763 /* Remove from original record. */
764 mi_remove_attr(NULL, mi, attr);
767 run_deallocate(sbi, &ni->attr_list.run, true);
768 run_close(&ni->attr_list.run);
769 ni->attr_list.size = 0;
770 kfree(ni->attr_list.le);
771 ni->attr_list.le = NULL;
772 ni->attr_list.dirty = false;
777 /* Restore primary record. */
778 swap(mrec, ni->mi.mrec);
784 * ni_create_attr_list - Generates an attribute list for this primary record.
786 int ni_create_attr_list(struct ntfs_inode *ni)
788 struct ntfs_sb_info *sbi = ni->mi.sbi;
792 struct ATTRIB *arr_move[7];
793 struct ATTR_LIST_ENTRY *le, *le_b[7];
797 struct mft_inode *mi;
798 u32 free_b, nb, to_free, rs;
801 is_mft = ni->mi.rno == MFT_REC_MFT;
803 rs = sbi->record_size;
806 * Skip estimating exact memory requirement.
807 * Looks like one record_size is always enough.
809 le = kmalloc(al_aligned(rs), GFP_NOFS);
815 mi_get_ref(&ni->mi, &le->ref);
816 ni->attr_list.le = le;
823 for (; (attr = mi_enum_attr(&ni->mi, attr)); le = Add2Ptr(le, sz)) {
824 sz = le_size(attr->name_len);
825 le->type = attr->type;
826 le->size = cpu_to_le16(sz);
827 le->name_len = attr->name_len;
828 le->name_off = offsetof(struct ATTR_LIST_ENTRY, name);
830 if (le != ni->attr_list.le)
831 le->ref = ni->attr_list.le->ref;
835 memcpy(le->name, attr_name(attr),
836 sizeof(short) * attr->name_len);
837 else if (attr->type == ATTR_STD)
839 else if (attr->type == ATTR_LIST)
841 else if (is_mft && attr->type == ATTR_DATA)
844 if (!nb || nb < ARRAY_SIZE(arr_move)) {
846 arr_move[nb++] = attr;
847 free_b += le32_to_cpu(attr->size);
851 lsize = PtrOffset(ni->attr_list.le, le);
852 ni->attr_list.size = lsize;
854 to_free = le32_to_cpu(rec->used) + lsize + SIZEOF_RESIDENT;
860 if (to_free > free_b) {
866 /* Allocate child MFT. */
867 err = ntfs_look_free_mft(sbi, &rno, is_mft, ni, &mi);
871 /* Call mi_remove_attr() in reverse order to keep pointers 'arr_move' valid. */
872 while (to_free > 0) {
873 struct ATTRIB *b = arr_move[--nb];
874 u32 asize = le32_to_cpu(b->size);
875 u16 name_off = le16_to_cpu(b->name_off);
877 attr = mi_insert_attr(mi, b->type, Add2Ptr(b, name_off),
878 b->name_len, asize, name_off);
881 mi_get_ref(mi, &le_b[nb]->ref);
882 le_b[nb]->id = attr->id;
884 /* Copy all except id. */
885 memcpy(attr, b, asize);
886 attr->id = le_b[nb]->id;
888 /* Remove from primary record. */
889 WARN_ON(!mi_remove_attr(NULL, &ni->mi, b));
891 if (to_free <= asize)
897 attr = mi_insert_attr(&ni->mi, ATTR_LIST, NULL, 0,
898 lsize + SIZEOF_RESIDENT, SIZEOF_RESIDENT);
903 attr->res.data_size = cpu_to_le32(lsize);
904 attr->res.data_off = SIZEOF_RESIDENT_LE;
908 memcpy(resident_data_ex(attr, lsize), ni->attr_list.le, lsize);
910 ni->attr_list.dirty = false;
912 mark_inode_dirty(&ni->vfs_inode);
916 kfree(ni->attr_list.le);
917 ni->attr_list.le = NULL;
918 ni->attr_list.size = 0;
925 * ni_ins_attr_ext - Add an external attribute to the ntfs_inode.
927 static int ni_ins_attr_ext(struct ntfs_inode *ni, struct ATTR_LIST_ENTRY *le,
928 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
929 u32 asize, CLST svcn, u16 name_off, bool force_ext,
930 struct ATTRIB **ins_attr, struct mft_inode **ins_mi,
931 struct ATTR_LIST_ENTRY **ins_le)
934 struct mft_inode *mi;
937 struct rb_node *node;
939 bool is_mft, is_mft_data;
940 struct ntfs_sb_info *sbi = ni->mi.sbi;
942 is_mft = ni->mi.rno == MFT_REC_MFT;
943 is_mft_data = is_mft && type == ATTR_DATA && !name_len;
945 if (asize > sbi->max_bytes_per_attr) {
951 * Standard information and attr_list cannot be made external.
952 * The Log File cannot have any external attributes.
954 if (type == ATTR_STD || type == ATTR_LIST ||
955 ni->mi.rno == MFT_REC_LOG) {
960 /* Create attribute list if it is not already existed. */
961 if (!ni->attr_list.size) {
962 err = ni_create_attr_list(ni);
967 vbo = is_mft_data ? ((u64)svcn << sbi->cluster_bits) : 0;
972 /* Load all subrecords into memory. */
973 err = ni_load_all_mi(ni);
977 /* Check each of loaded subrecord. */
978 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
979 mi = rb_entry(node, struct mft_inode, node);
982 (mi_enum_attr(mi, NULL) ||
983 vbo <= ((u64)mi->rno << sbi->record_bits))) {
984 /* We can't accept this record 'cause MFT's bootstrapping. */
988 mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0, NULL)) {
990 * This child record already has a ATTR_DATA.
991 * So it can't accept any other records.
996 if ((type != ATTR_NAME || name_len) &&
997 mi_find_attr(mi, NULL, type, name, name_len, NULL)) {
998 /* Only indexed attributes can share same record. */
1003 * Do not try to insert this attribute
1004 * if there is no room in record.
1006 if (le32_to_cpu(mi->mrec->used) + asize > sbi->record_size)
1009 /* Try to insert attribute into this subrecord. */
1010 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
1011 name_off, svcn, ins_le);
1015 return PTR_ERR(attr);
1025 /* We have to allocate a new child subrecord. */
1026 err = ntfs_look_free_mft(sbi, &rno, is_mft_data, ni, &mi);
1030 if (is_mft_data && vbo <= ((u64)rno << sbi->record_bits)) {
1035 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
1036 name_off, svcn, ins_le);
1043 err = PTR_ERR(attr);
1055 ni_remove_mi(ni, mi);
1059 ntfs_mark_rec_free(sbi, rno, is_mft);
1066 * ni_insert_attr - Insert an attribute into the file.
1068 * If the primary record has room, it will just insert the attribute.
1069 * If not, it may make the attribute external.
1070 * For $MFT::Data it may make room for the attribute by
1071 * making other attributes external.
1074 * The ATTR_LIST and ATTR_STD cannot be made external.
1075 * This function does not fill new attribute full.
1076 * It only fills 'size'/'type'/'id'/'name_len' fields.
1078 static int ni_insert_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
1079 const __le16 *name, u8 name_len, u32 asize,
1080 u16 name_off, CLST svcn, struct ATTRIB **ins_attr,
1081 struct mft_inode **ins_mi,
1082 struct ATTR_LIST_ENTRY **ins_le)
1084 struct ntfs_sb_info *sbi = ni->mi.sbi;
1086 struct ATTRIB *attr, *eattr;
1087 struct MFT_REC *rec;
1089 struct ATTR_LIST_ENTRY *le;
1090 u32 list_reserve, max_free, free, used, t32;
1094 is_mft = ni->mi.rno == MFT_REC_MFT;
1097 list_reserve = SIZEOF_NONRESIDENT + 3 * (1 + 2 * sizeof(u32));
1098 used = le32_to_cpu(rec->used);
1099 free = sbi->record_size - used;
1101 if (is_mft && type != ATTR_LIST) {
1102 /* Reserve space for the ATTRIB list. */
1103 if (free < list_reserve)
1106 free -= list_reserve;
1109 if (asize <= free) {
1110 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len,
1111 asize, name_off, svcn, ins_le);
1113 err = PTR_ERR(attr);
1127 if (!is_mft || type != ATTR_DATA || svcn) {
1128 /* This ATTRIB will be external. */
1129 err = ni_ins_attr_ext(ni, NULL, type, name, name_len, asize,
1130 svcn, name_off, false, ins_attr, ins_mi,
1136 * Here we have: "is_mft && type == ATTR_DATA && !svcn"
1138 * The first chunk of the $MFT::Data ATTRIB must be the base record.
1139 * Evict as many other attributes as possible.
1143 /* Estimate the result of moving all possible attributes away. */
1146 while ((attr = mi_enum_attr(&ni->mi, attr))) {
1147 if (attr->type == ATTR_STD)
1149 if (attr->type == ATTR_LIST)
1151 max_free += le32_to_cpu(attr->size);
1154 if (max_free < asize + list_reserve) {
1155 /* Impossible to insert this attribute into primary record. */
1160 /* Start real attribute moving. */
1164 attr = mi_enum_attr(&ni->mi, attr);
1166 /* We should never be here 'cause we have already check this case. */
1171 /* Skip attributes that MUST be primary record. */
1172 if (attr->type == ATTR_STD || attr->type == ATTR_LIST)
1176 if (ni->attr_list.size) {
1177 le = al_find_le(ni, NULL, attr);
1179 /* Really this is a serious bug. */
1185 t32 = le32_to_cpu(attr->size);
1186 t16 = le16_to_cpu(attr->name_off);
1187 err = ni_ins_attr_ext(ni, le, attr->type, Add2Ptr(attr, t16),
1188 attr->name_len, t32, attr_svcn(attr), t16,
1189 false, &eattr, NULL, NULL);
1194 memcpy(eattr, attr, t32);
1197 /* Remove from primary record. */
1198 mi_remove_attr(NULL, &ni->mi, attr);
1200 /* attr now points to next attribute. */
1201 if (attr->type == ATTR_END)
1204 while (asize + list_reserve > sbi->record_size - le32_to_cpu(rec->used))
1207 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len, asize,
1208 name_off, svcn, ins_le);
1215 err = PTR_ERR(attr);
1228 /* ni_expand_mft_list - Split ATTR_DATA of $MFT. */
1229 static int ni_expand_mft_list(struct ntfs_inode *ni)
1232 struct runs_tree *run = &ni->file.run;
1233 u32 asize, run_size, done = 0;
1234 struct ATTRIB *attr;
1235 struct rb_node *node;
1236 CLST mft_min, mft_new, svcn, evcn, plen;
1237 struct mft_inode *mi, *mi_min, *mi_new;
1238 struct ntfs_sb_info *sbi = ni->mi.sbi;
1240 /* Find the nearest MFT. */
1245 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
1246 mi = rb_entry(node, struct mft_inode, node);
1248 attr = mi_enum_attr(mi, NULL);
1257 if (ntfs_look_free_mft(sbi, &mft_new, true, ni, &mi_new)) {
1259 /* Really this is not critical. */
1260 } else if (mft_min > mft_new) {
1264 ntfs_mark_rec_free(sbi, mft_new, true);
1266 ni_remove_mi(ni, mi_new);
1269 attr = mi_find_attr(&ni->mi, NULL, ATTR_DATA, NULL, 0, NULL);
1275 asize = le32_to_cpu(attr->size);
1277 evcn = le64_to_cpu(attr->nres.evcn);
1278 svcn = bytes_to_cluster(sbi, (u64)(mft_min + 1) << sbi->record_bits);
1279 if (evcn + 1 >= svcn) {
1285 * Split primary attribute [0 evcn] in two parts [0 svcn) + [svcn evcn].
1287 * Update first part of ATTR_DATA in 'primary MFT.
1289 err = run_pack(run, 0, svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1290 asize - SIZEOF_NONRESIDENT, &plen);
1294 run_size = ALIGN(err, 8);
1302 attr->nres.evcn = cpu_to_le64(svcn - 1);
1303 attr->size = cpu_to_le32(run_size + SIZEOF_NONRESIDENT);
1304 /* 'done' - How many bytes of primary MFT becomes free. */
1305 done = asize - run_size - SIZEOF_NONRESIDENT;
1306 le32_sub_cpu(&ni->mi.mrec->used, done);
1308 /* Estimate packed size (run_buf=NULL). */
1309 err = run_pack(run, svcn, evcn + 1 - svcn, NULL, sbi->record_size,
1314 run_size = ALIGN(err, 8);
1317 if (plen < evcn + 1 - svcn) {
1323 * This function may implicitly call expand attr_list.
1324 * Insert second part of ATTR_DATA in 'mi_min'.
1326 attr = ni_ins_new_attr(ni, mi_min, NULL, ATTR_DATA, NULL, 0,
1327 SIZEOF_NONRESIDENT + run_size,
1328 SIZEOF_NONRESIDENT, svcn, NULL);
1335 err = PTR_ERR(attr);
1340 attr->name_off = SIZEOF_NONRESIDENT_LE;
1343 /* This function can't fail - cause already checked above. */
1344 run_pack(run, svcn, evcn + 1 - svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1347 attr->nres.svcn = cpu_to_le64(svcn);
1348 attr->nres.evcn = cpu_to_le64(evcn);
1349 attr->nres.run_off = cpu_to_le16(SIZEOF_NONRESIDENT);
1353 ntfs_mark_rec_free(sbi, mft_new, true);
1354 ni_remove_mi(ni, mi_new);
1357 return !err && !done ? -EOPNOTSUPP : err;
1361 * ni_expand_list - Move all possible attributes out of primary record.
1363 int ni_expand_list(struct ntfs_inode *ni)
1366 u32 asize, done = 0;
1367 struct ATTRIB *attr, *ins_attr;
1368 struct ATTR_LIST_ENTRY *le;
1369 bool is_mft = ni->mi.rno == MFT_REC_MFT;
1372 mi_get_ref(&ni->mi, &ref);
1375 while ((le = al_enumerate(ni, le))) {
1376 if (le->type == ATTR_STD)
1379 if (memcmp(&ref, &le->ref, sizeof(struct MFT_REF)))
1382 if (is_mft && le->type == ATTR_DATA)
1385 /* Find attribute in primary record. */
1386 attr = rec_find_attr_le(&ni->mi, le);
1392 asize = le32_to_cpu(attr->size);
1394 /* Always insert into new record to avoid collisions (deep recursive). */
1395 err = ni_ins_attr_ext(ni, le, attr->type, attr_name(attr),
1396 attr->name_len, asize, attr_svcn(attr),
1397 le16_to_cpu(attr->name_off), true,
1398 &ins_attr, NULL, NULL);
1403 memcpy(ins_attr, attr, asize);
1404 ins_attr->id = le->id;
1405 /* Remove from primary record. */
1406 mi_remove_attr(NULL, &ni->mi, attr);
1413 err = -EFBIG; /* Attr list is too big(?) */
1417 /* Split MFT data as much as possible. */
1418 err = ni_expand_mft_list(ni);
1421 return !err && !done ? -EOPNOTSUPP : err;
1425 * ni_insert_nonresident - Insert new nonresident attribute.
1427 int ni_insert_nonresident(struct ntfs_inode *ni, enum ATTR_TYPE type,
1428 const __le16 *name, u8 name_len,
1429 const struct runs_tree *run, CLST svcn, CLST len,
1430 __le16 flags, struct ATTRIB **new_attr,
1431 struct mft_inode **mi, struct ATTR_LIST_ENTRY **le)
1435 struct ATTRIB *attr;
1437 (flags & (ATTR_FLAG_SPARSED | ATTR_FLAG_COMPRESSED)) && !svcn;
1438 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1439 u32 name_off = is_ext ? SIZEOF_NONRESIDENT_EX : SIZEOF_NONRESIDENT;
1440 u32 run_off = name_off + name_size;
1441 u32 run_size, asize;
1442 struct ntfs_sb_info *sbi = ni->mi.sbi;
1444 /* Estimate packed size (run_buf=NULL). */
1445 err = run_pack(run, svcn, len, NULL, sbi->max_bytes_per_attr - run_off,
1450 run_size = ALIGN(err, 8);
1457 asize = run_off + run_size;
1459 if (asize > sbi->max_bytes_per_attr) {
1464 err = ni_insert_attr(ni, type, name, name_len, asize, name_off, svcn,
1471 attr->name_off = cpu_to_le16(name_off);
1472 attr->flags = flags;
1474 /* This function can't fail - cause already checked above. */
1475 run_pack(run, svcn, len, Add2Ptr(attr, run_off), run_size, &plen);
1477 attr->nres.svcn = cpu_to_le64(svcn);
1478 attr->nres.evcn = cpu_to_le64((u64)svcn + len - 1);
1483 *(__le64 *)&attr->nres.run_off = cpu_to_le64(run_off);
1485 attr->nres.alloc_size =
1486 svcn ? 0 : cpu_to_le64((u64)len << ni->mi.sbi->cluster_bits);
1487 attr->nres.data_size = attr->nres.alloc_size;
1488 attr->nres.valid_size = attr->nres.alloc_size;
1491 if (flags & ATTR_FLAG_COMPRESSED)
1492 attr->nres.c_unit = COMPRESSION_UNIT;
1493 attr->nres.total_size = attr->nres.alloc_size;
1501 * ni_insert_resident - Inserts new resident attribute.
1503 int ni_insert_resident(struct ntfs_inode *ni, u32 data_size,
1504 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
1505 struct ATTRIB **new_attr, struct mft_inode **mi,
1506 struct ATTR_LIST_ENTRY **le)
1509 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1510 u32 asize = SIZEOF_RESIDENT + name_size + ALIGN(data_size, 8);
1511 struct ATTRIB *attr;
1513 err = ni_insert_attr(ni, type, name, name_len, asize, SIZEOF_RESIDENT,
1521 attr->res.data_size = cpu_to_le32(data_size);
1522 attr->res.data_off = cpu_to_le16(SIZEOF_RESIDENT + name_size);
1523 if (type == ATTR_NAME) {
1524 attr->res.flags = RESIDENT_FLAG_INDEXED;
1526 /* is_attr_indexed(attr)) == true */
1527 le16_add_cpu(&ni->mi.mrec->hard_links, 1);
1528 ni->mi.dirty = true;
1539 * ni_remove_attr_le - Remove attribute from record.
1541 void ni_remove_attr_le(struct ntfs_inode *ni, struct ATTRIB *attr,
1542 struct mft_inode *mi, struct ATTR_LIST_ENTRY *le)
1544 mi_remove_attr(ni, mi, attr);
1547 al_remove_le(ni, le);
1551 * ni_delete_all - Remove all attributes and frees allocates space.
1553 * ntfs_evict_inode->ntfs_clear_inode->ni_delete_all (if no links).
1555 int ni_delete_all(struct ntfs_inode *ni)
1558 struct ATTR_LIST_ENTRY *le = NULL;
1559 struct ATTRIB *attr = NULL;
1560 struct rb_node *node;
1564 struct ntfs_sb_info *sbi = ni->mi.sbi;
1565 bool nt3 = is_ntfs3(sbi);
1568 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
1569 if (!nt3 || attr->name_len) {
1571 } else if (attr->type == ATTR_REPARSE) {
1572 mi_get_ref(&ni->mi, &ref);
1573 ntfs_remove_reparse(sbi, 0, &ref);
1574 } else if (attr->type == ATTR_ID && !attr->non_res &&
1575 le32_to_cpu(attr->res.data_size) >=
1576 sizeof(struct GUID)) {
1577 ntfs_objid_remove(sbi, resident_data(attr));
1583 svcn = le64_to_cpu(attr->nres.svcn);
1584 evcn = le64_to_cpu(attr->nres.evcn);
1586 if (evcn + 1 <= svcn)
1589 asize = le32_to_cpu(attr->size);
1590 roff = le16_to_cpu(attr->nres.run_off);
1592 /* run==1 means unpack and deallocate. */
1593 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
1594 Add2Ptr(attr, roff), asize - roff);
1597 if (ni->attr_list.size) {
1598 run_deallocate(ni->mi.sbi, &ni->attr_list.run, true);
1602 /* Free all subrecords. */
1603 for (node = rb_first(&ni->mi_tree); node;) {
1604 struct rb_node *next = rb_next(node);
1605 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
1607 clear_rec_inuse(mi->mrec);
1611 ntfs_mark_rec_free(sbi, mi->rno, false);
1612 ni_remove_mi(ni, mi);
1617 /* Free base record. */
1618 clear_rec_inuse(ni->mi.mrec);
1619 ni->mi.dirty = true;
1620 err = mi_write(&ni->mi, 0);
1622 ntfs_mark_rec_free(sbi, ni->mi.rno, false);
1629 * Return: File name attribute by its value.
1631 struct ATTR_FILE_NAME *ni_fname_name(struct ntfs_inode *ni,
1632 const struct cpu_str *uni,
1633 const struct MFT_REF *home_dir,
1634 struct mft_inode **mi,
1635 struct ATTR_LIST_ENTRY **le)
1637 struct ATTRIB *attr = NULL;
1638 struct ATTR_FILE_NAME *fname;
1643 /* Enumerate all names. */
1645 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1649 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1653 if (home_dir && memcmp(home_dir, &fname->home, sizeof(*home_dir)))
1659 if (uni->len != fname->name_len)
1662 if (ntfs_cmp_names_cpu(uni, (struct le_str *)&fname->name_len, NULL,
1672 * Return: File name attribute with given type.
1674 struct ATTR_FILE_NAME *ni_fname_type(struct ntfs_inode *ni, u8 name_type,
1675 struct mft_inode **mi,
1676 struct ATTR_LIST_ENTRY **le)
1678 struct ATTRIB *attr = NULL;
1679 struct ATTR_FILE_NAME *fname;
1683 if (name_type == FILE_NAME_POSIX)
1686 /* Enumerate all names. */
1688 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1692 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1693 if (fname && name_type == fname->type)
1701 * Process compressed/sparsed in special way.
1702 * NOTE: You need to set ni->std_fa = new_fa
1703 * after this function to keep internal structures in consistency.
1705 int ni_new_attr_flags(struct ntfs_inode *ni, enum FILE_ATTRIBUTE new_fa)
1707 struct ATTRIB *attr;
1708 struct mft_inode *mi;
1712 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
1716 new_aflags = attr->flags;
1718 if (new_fa & FILE_ATTRIBUTE_SPARSE_FILE)
1719 new_aflags |= ATTR_FLAG_SPARSED;
1721 new_aflags &= ~ATTR_FLAG_SPARSED;
1723 if (new_fa & FILE_ATTRIBUTE_COMPRESSED)
1724 new_aflags |= ATTR_FLAG_COMPRESSED;
1726 new_aflags &= ~ATTR_FLAG_COMPRESSED;
1728 if (new_aflags == attr->flags)
1731 if ((new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) ==
1732 (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) {
1733 ntfs_inode_warn(&ni->vfs_inode,
1734 "file can't be sparsed and compressed");
1741 if (attr->nres.data_size) {
1744 "one can change sparsed/compressed only for empty files");
1748 /* Resize nonresident empty attribute in-place only. */
1749 new_asize = (new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED))
1750 ? (SIZEOF_NONRESIDENT_EX + 8)
1751 : (SIZEOF_NONRESIDENT + 8);
1753 if (!mi_resize_attr(mi, attr, new_asize - le32_to_cpu(attr->size)))
1756 if (new_aflags & ATTR_FLAG_SPARSED) {
1757 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1758 /* Windows uses 16 clusters per frame but supports one cluster per frame too. */
1759 attr->nres.c_unit = 0;
1760 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1761 } else if (new_aflags & ATTR_FLAG_COMPRESSED) {
1762 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1763 /* The only allowed: 16 clusters per frame. */
1764 attr->nres.c_unit = NTFS_LZNT_CUNIT;
1765 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops_cmpr;
1767 attr->name_off = SIZEOF_NONRESIDENT_LE;
1769 attr->nres.c_unit = 0;
1770 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1772 attr->nres.run_off = attr->name_off;
1774 attr->flags = new_aflags;
1783 * buffer - memory for reparse buffer header
1785 enum REPARSE_SIGN ni_parse_reparse(struct ntfs_inode *ni, struct ATTRIB *attr,
1786 struct REPARSE_DATA_BUFFER *buffer)
1788 const struct REPARSE_DATA_BUFFER *rp = NULL;
1791 typeof(rp->CompressReparseBuffer) *cmpr;
1793 /* Try to estimate reparse point. */
1794 if (!attr->non_res) {
1795 rp = resident_data_ex(attr, sizeof(struct REPARSE_DATA_BUFFER));
1796 } else if (le64_to_cpu(attr->nres.data_size) >=
1797 sizeof(struct REPARSE_DATA_BUFFER)) {
1798 struct runs_tree run;
1802 if (!attr_load_runs_vcn(ni, ATTR_REPARSE, NULL, 0, &run, 0) &&
1803 !ntfs_read_run_nb(ni->mi.sbi, &run, 0, buffer,
1804 sizeof(struct REPARSE_DATA_BUFFER),
1813 return REPARSE_NONE;
1815 len = le16_to_cpu(rp->ReparseDataLength);
1816 switch (rp->ReparseTag) {
1817 case (IO_REPARSE_TAG_MICROSOFT | IO_REPARSE_TAG_SYMBOLIC_LINK):
1818 break; /* Symbolic link. */
1819 case IO_REPARSE_TAG_MOUNT_POINT:
1820 break; /* Mount points and junctions. */
1821 case IO_REPARSE_TAG_SYMLINK:
1823 case IO_REPARSE_TAG_COMPRESS:
1825 * WOF - Windows Overlay Filter - Used to compress files with
1828 * Unlike native NTFS file compression, the Windows
1829 * Overlay Filter supports only read operations. This means
1830 * that it doesn't need to sector-align each compressed chunk,
1831 * so the compressed data can be packed more tightly together.
1832 * If you open the file for writing, the WOF just decompresses
1833 * the entire file, turning it back into a plain file.
1835 * Ntfs3 driver decompresses the entire file only on write or
1836 * change size requests.
1839 cmpr = &rp->CompressReparseBuffer;
1840 if (len < sizeof(*cmpr) ||
1841 cmpr->WofVersion != WOF_CURRENT_VERSION ||
1842 cmpr->WofProvider != WOF_PROVIDER_SYSTEM ||
1843 cmpr->ProviderVer != WOF_PROVIDER_CURRENT_VERSION) {
1844 return REPARSE_NONE;
1847 switch (cmpr->CompressionFormat) {
1848 case WOF_COMPRESSION_XPRESS4K:
1851 case WOF_COMPRESSION_XPRESS8K:
1854 case WOF_COMPRESSION_XPRESS16K:
1857 case WOF_COMPRESSION_LZX32K:
1864 ni_set_ext_compress_bits(ni, bits);
1865 return REPARSE_COMPRESSED;
1867 case IO_REPARSE_TAG_DEDUP:
1868 ni->ni_flags |= NI_FLAG_DEDUPLICATED;
1869 return REPARSE_DEDUPLICATED;
1872 if (rp->ReparseTag & IO_REPARSE_TAG_NAME_SURROGATE)
1875 return REPARSE_NONE;
1879 memcpy(buffer, rp, sizeof(struct REPARSE_DATA_BUFFER));
1881 /* Looks like normal symlink. */
1882 return REPARSE_LINK;
1886 * ni_fiemap - Helper for file_fiemap().
1889 * TODO: Less aggressive locks.
1891 int ni_fiemap(struct ntfs_inode *ni, struct fiemap_extent_info *fieinfo,
1892 __u64 vbo, __u64 len)
1895 struct ntfs_sb_info *sbi = ni->mi.sbi;
1896 u8 cluster_bits = sbi->cluster_bits;
1897 struct runs_tree *run;
1898 struct rw_semaphore *run_lock;
1899 struct ATTRIB *attr;
1900 CLST vcn = vbo >> cluster_bits;
1902 u64 valid = ni->i_valid;
1904 u64 end, alloc_size;
1909 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1910 run = &ni->dir.alloc_run;
1911 attr = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, I30_NAME,
1912 ARRAY_SIZE(I30_NAME), NULL, NULL);
1913 run_lock = &ni->dir.run_lock;
1915 run = &ni->file.run;
1916 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL,
1922 if (is_attr_compressed(attr)) {
1923 /* Unfortunately cp -r incorrectly treats compressed clusters. */
1927 "fiemap is not supported for compressed file (cp -r)");
1930 run_lock = &ni->file.run_lock;
1933 if (!attr || !attr->non_res) {
1934 err = fiemap_fill_next_extent(
1936 attr ? le32_to_cpu(attr->res.data_size) : 0,
1937 FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_LAST |
1938 FIEMAP_EXTENT_MERGED);
1943 alloc_size = le64_to_cpu(attr->nres.alloc_size);
1944 if (end > alloc_size)
1947 down_read(run_lock);
1951 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1953 CLST vcn_next = vcn;
1955 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) &&
1963 down_write(run_lock);
1965 err = attr_load_runs_vcn(ni, attr->type,
1967 attr->name_len, run, vcn);
1970 down_read(run_lock);
1975 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1988 if (lcn == SPARSE_LCN) {
1990 vbo = (u64)vcn << cluster_bits;
1994 flags = FIEMAP_EXTENT_MERGED;
1995 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1997 } else if (is_attr_compressed(attr)) {
2000 err = attr_is_frame_compressed(
2001 ni, attr, vcn >> attr->nres.c_unit, &clst_data);
2004 if (clst_data < NTFS_LZNT_CLUSTERS)
2005 flags |= FIEMAP_EXTENT_ENCODED;
2006 } else if (is_attr_encrypted(attr)) {
2007 flags |= FIEMAP_EXTENT_DATA_ENCRYPTED;
2010 vbo = (u64)vcn << cluster_bits;
2011 bytes = (u64)clen << cluster_bits;
2012 lbo = (u64)lcn << cluster_bits;
2016 if (vbo + bytes >= end)
2019 if (vbo + bytes <= valid) {
2021 } else if (vbo >= valid) {
2022 flags |= FIEMAP_EXTENT_UNWRITTEN;
2024 /* vbo < valid && valid < vbo + bytes */
2025 u64 dlen = valid - vbo;
2027 if (vbo + dlen >= end)
2028 flags |= FIEMAP_EXTENT_LAST;
2030 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, dlen,
2045 flags |= FIEMAP_EXTENT_UNWRITTEN;
2048 if (vbo + bytes >= end)
2049 flags |= FIEMAP_EXTENT_LAST;
2051 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, bytes, flags);
2071 * When decompressing, we typically obtain more than one page per reference.
2072 * We inject the additional pages into the page cache.
2074 int ni_readpage_cmpr(struct ntfs_inode *ni, struct page *page)
2077 struct ntfs_sb_info *sbi = ni->mi.sbi;
2078 struct address_space *mapping = page->mapping;
2079 pgoff_t index = page->index;
2080 u64 frame_vbo, vbo = (u64)index << PAGE_SHIFT;
2081 struct page **pages = NULL; /* Array of at most 16 pages. stack? */
2084 u32 i, idx, frame_size, pages_per_frame;
2088 if (vbo >= ni->vfs_inode.i_size) {
2089 SetPageUptodate(page);
2094 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2095 /* Xpress or LZX. */
2096 frame_bits = ni_ext_compress_bits(ni);
2098 /* LZNT compression. */
2099 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2101 frame_size = 1u << frame_bits;
2102 frame = vbo >> frame_bits;
2103 frame_vbo = (u64)frame << frame_bits;
2104 idx = (vbo - frame_vbo) >> PAGE_SHIFT;
2106 pages_per_frame = frame_size >> PAGE_SHIFT;
2107 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2114 index = frame_vbo >> PAGE_SHIFT;
2115 gfp_mask = mapping_gfp_mask(mapping);
2117 for (i = 0; i < pages_per_frame; i++, index++) {
2121 pg = find_or_create_page(mapping, index, gfp_mask);
2129 err = ni_read_frame(ni, frame_vbo, pages, pages_per_frame);
2135 for (i = 0; i < pages_per_frame; i++) {
2144 /* At this point, err contains 0 or -EIO depending on the "critical" page. */
2151 #ifdef CONFIG_NTFS3_LZX_XPRESS
2153 * ni_decompress_file - Decompress LZX/Xpress compressed file.
2155 * Remove ATTR_DATA::WofCompressedData.
2156 * Remove ATTR_REPARSE.
2158 int ni_decompress_file(struct ntfs_inode *ni)
2160 struct ntfs_sb_info *sbi = ni->mi.sbi;
2161 struct inode *inode = &ni->vfs_inode;
2162 loff_t i_size = inode->i_size;
2163 struct address_space *mapping = inode->i_mapping;
2164 gfp_t gfp_mask = mapping_gfp_mask(mapping);
2165 struct page **pages = NULL;
2166 struct ATTR_LIST_ENTRY *le;
2167 struct ATTRIB *attr;
2168 CLST vcn, cend, lcn, clen, end;
2172 u32 i, frame_size, pages_per_frame, bytes;
2173 struct mft_inode *mi;
2176 /* Clusters for decompressed data. */
2177 cend = bytes_to_cluster(sbi, i_size);
2182 /* Check in advance. */
2183 if (cend > wnd_zeroes(&sbi->used.bitmap)) {
2188 frame_bits = ni_ext_compress_bits(ni);
2189 frame_size = 1u << frame_bits;
2190 pages_per_frame = frame_size >> PAGE_SHIFT;
2191 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2198 * Step 1: Decompress data and copy to new allocated clusters.
2201 for (vbo = 0; vbo < i_size; vbo += bytes) {
2205 if (vbo + frame_size > i_size) {
2206 bytes = i_size - vbo;
2207 nr_pages = (bytes + PAGE_SIZE - 1) >> PAGE_SHIFT;
2209 nr_pages = pages_per_frame;
2213 end = bytes_to_cluster(sbi, vbo + bytes);
2215 for (vcn = vbo >> sbi->cluster_bits; vcn < end; vcn += clen) {
2216 err = attr_data_get_block(ni, vcn, cend - vcn, &lcn,
2222 for (i = 0; i < pages_per_frame; i++, index++) {
2225 pg = find_or_create_page(mapping, index, gfp_mask);
2228 unlock_page(pages[i]);
2237 err = ni_read_frame(ni, vbo, pages, pages_per_frame);
2240 down_read(&ni->file.run_lock);
2241 err = ntfs_bio_pages(sbi, &ni->file.run, pages,
2242 nr_pages, vbo, bytes,
2244 up_read(&ni->file.run_lock);
2247 for (i = 0; i < pages_per_frame; i++) {
2248 unlock_page(pages[i]);
2260 * Step 2: Deallocate attributes ATTR_DATA::WofCompressedData
2265 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
2269 if (attr->type == ATTR_REPARSE) {
2272 mi_get_ref(&ni->mi, &ref);
2273 ntfs_remove_reparse(sbi, 0, &ref);
2279 if (attr->type != ATTR_REPARSE &&
2280 (attr->type != ATTR_DATA ||
2281 attr->name_len != ARRAY_SIZE(WOF_NAME) ||
2282 memcmp(attr_name(attr), WOF_NAME, sizeof(WOF_NAME))))
2285 svcn = le64_to_cpu(attr->nres.svcn);
2286 evcn = le64_to_cpu(attr->nres.evcn);
2288 if (evcn + 1 <= svcn)
2291 asize = le32_to_cpu(attr->size);
2292 roff = le16_to_cpu(attr->nres.run_off);
2294 /*run==1 Means unpack and deallocate. */
2295 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
2296 Add2Ptr(attr, roff), asize - roff);
2300 * Step 3: Remove attribute ATTR_DATA::WofCompressedData.
2302 err = ni_remove_attr(ni, ATTR_DATA, WOF_NAME, ARRAY_SIZE(WOF_NAME),
2308 * Step 4: Remove ATTR_REPARSE.
2310 err = ni_remove_attr(ni, ATTR_REPARSE, NULL, 0, false, NULL);
2315 * Step 5: Remove sparse flag from data attribute.
2317 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
2323 if (attr->non_res && is_attr_sparsed(attr)) {
2324 /* Sparsed attribute header is 8 bytes bigger than normal. */
2325 struct MFT_REC *rec = mi->mrec;
2326 u32 used = le32_to_cpu(rec->used);
2327 u32 asize = le32_to_cpu(attr->size);
2328 u16 roff = le16_to_cpu(attr->nres.run_off);
2329 char *rbuf = Add2Ptr(attr, roff);
2331 memmove(rbuf - 8, rbuf, used - PtrOffset(rec, rbuf));
2332 attr->size = cpu_to_le32(asize - 8);
2333 attr->flags &= ~ATTR_FLAG_SPARSED;
2334 attr->nres.run_off = cpu_to_le16(roff - 8);
2335 attr->nres.c_unit = 0;
2336 rec->used = cpu_to_le32(used - 8);
2338 ni->std_fa &= ~(FILE_ATTRIBUTE_SPARSE_FILE |
2339 FILE_ATTRIBUTE_REPARSE_POINT);
2341 mark_inode_dirty(inode);
2344 /* Clear cached flag. */
2345 ni->ni_flags &= ~NI_FLAG_COMPRESSED_MASK;
2346 if (ni->file.offs_page) {
2347 put_page(ni->file.offs_page);
2348 ni->file.offs_page = NULL;
2350 mapping->a_ops = &ntfs_aops;
2355 _ntfs_bad_inode(inode);
2361 * decompress_lzx_xpress - External compression LZX/Xpress.
2363 static int decompress_lzx_xpress(struct ntfs_sb_info *sbi, const char *cmpr,
2364 size_t cmpr_size, void *unc, size_t unc_size,
2370 if (cmpr_size == unc_size) {
2371 /* Frame not compressed. */
2372 memcpy(unc, cmpr, unc_size);
2377 if (frame_size == 0x8000) {
2378 mutex_lock(&sbi->compress.mtx_lzx);
2379 /* LZX: Frame compressed. */
2380 ctx = sbi->compress.lzx;
2382 /* Lazy initialize LZX decompress context. */
2383 ctx = lzx_allocate_decompressor();
2389 sbi->compress.lzx = ctx;
2392 if (lzx_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2393 /* Treat all errors as "invalid argument". */
2397 mutex_unlock(&sbi->compress.mtx_lzx);
2399 /* XPRESS: Frame compressed. */
2400 mutex_lock(&sbi->compress.mtx_xpress);
2401 ctx = sbi->compress.xpress;
2403 /* Lazy initialize Xpress decompress context. */
2404 ctx = xpress_allocate_decompressor();
2410 sbi->compress.xpress = ctx;
2413 if (xpress_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2414 /* Treat all errors as "invalid argument". */
2418 mutex_unlock(&sbi->compress.mtx_xpress);
2427 * Pages - Array of locked pages.
2429 int ni_read_frame(struct ntfs_inode *ni, u64 frame_vbo, struct page **pages,
2430 u32 pages_per_frame)
2433 struct ntfs_sb_info *sbi = ni->mi.sbi;
2434 u8 cluster_bits = sbi->cluster_bits;
2435 char *frame_ondisk = NULL;
2436 char *frame_mem = NULL;
2437 struct page **pages_disk = NULL;
2438 struct ATTR_LIST_ENTRY *le = NULL;
2439 struct runs_tree *run = &ni->file.run;
2440 u64 valid_size = ni->i_valid;
2443 u32 frame_size, i, npages_disk, ondisk_size;
2445 struct ATTRIB *attr;
2446 CLST frame, clst_data;
2449 * To simplify decompress algorithm do vmap for source
2452 for (i = 0; i < pages_per_frame; i++)
2455 frame_size = pages_per_frame << PAGE_SHIFT;
2456 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL);
2462 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, NULL);
2468 if (!attr->non_res) {
2469 u32 data_size = le32_to_cpu(attr->res.data_size);
2471 memset(frame_mem, 0, frame_size);
2472 if (frame_vbo < data_size) {
2473 ondisk_size = data_size - frame_vbo;
2474 memcpy(frame_mem, resident_data(attr) + frame_vbo,
2475 min(ondisk_size, frame_size));
2481 if (frame_vbo >= valid_size) {
2482 memset(frame_mem, 0, frame_size);
2487 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2488 #ifndef CONFIG_NTFS3_LZX_XPRESS
2492 u32 frame_bits = ni_ext_compress_bits(ni);
2493 u64 frame64 = frame_vbo >> frame_bits;
2494 u64 frames, vbo_data;
2496 if (frame_size != (1u << frame_bits)) {
2500 switch (frame_size) {
2507 /* Unknown compression. */
2512 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, WOF_NAME,
2513 ARRAY_SIZE(WOF_NAME), NULL, NULL);
2517 "external compressed file should contains data attribute \"WofCompressedData\"");
2522 if (!attr->non_res) {
2532 frames = (ni->vfs_inode.i_size - 1) >> frame_bits;
2534 err = attr_wof_frame_info(ni, attr, run, frame64, frames,
2535 frame_bits, &ondisk_size, &vbo_data);
2539 if (frame64 == frames) {
2540 unc_size = 1 + ((ni->vfs_inode.i_size - 1) &
2542 ondisk_size = attr_size(attr) - vbo_data;
2544 unc_size = frame_size;
2547 if (ondisk_size > frame_size) {
2552 if (!attr->non_res) {
2553 if (vbo_data + ondisk_size >
2554 le32_to_cpu(attr->res.data_size)) {
2559 err = decompress_lzx_xpress(
2560 sbi, Add2Ptr(resident_data(attr), vbo_data),
2561 ondisk_size, frame_mem, unc_size, frame_size);
2564 vbo_disk = vbo_data;
2565 /* Load all runs to read [vbo_disk-vbo_to). */
2566 err = attr_load_runs_range(ni, ATTR_DATA, WOF_NAME,
2567 ARRAY_SIZE(WOF_NAME), run, vbo_disk,
2568 vbo_data + ondisk_size);
2571 npages_disk = (ondisk_size + (vbo_disk & (PAGE_SIZE - 1)) +
2575 } else if (is_attr_compressed(attr)) {
2576 /* LZNT compression. */
2577 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2582 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2587 down_write(&ni->file.run_lock);
2588 run_truncate_around(run, le64_to_cpu(attr->nres.svcn));
2589 frame = frame_vbo >> (cluster_bits + NTFS_LZNT_CUNIT);
2590 err = attr_is_frame_compressed(ni, attr, frame, &clst_data);
2591 up_write(&ni->file.run_lock);
2596 memset(frame_mem, 0, frame_size);
2600 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2601 ondisk_size = clst_data << cluster_bits;
2603 if (clst_data >= NTFS_LZNT_CLUSTERS) {
2604 /* Frame is not compressed. */
2605 down_read(&ni->file.run_lock);
2606 err = ntfs_bio_pages(sbi, run, pages, pages_per_frame,
2607 frame_vbo, ondisk_size,
2609 up_read(&ni->file.run_lock);
2612 vbo_disk = frame_vbo;
2613 npages_disk = (ondisk_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
2615 __builtin_unreachable();
2620 pages_disk = kzalloc(npages_disk * sizeof(struct page *), GFP_NOFS);
2626 for (i = 0; i < npages_disk; i++) {
2627 pg = alloc_page(GFP_KERNEL);
2637 /* Read 'ondisk_size' bytes from disk. */
2638 down_read(&ni->file.run_lock);
2639 err = ntfs_bio_pages(sbi, run, pages_disk, npages_disk, vbo_disk,
2640 ondisk_size, REQ_OP_READ);
2641 up_read(&ni->file.run_lock);
2646 * To simplify decompress algorithm do vmap for source and target pages.
2648 frame_ondisk = vmap(pages_disk, npages_disk, VM_MAP, PAGE_KERNEL_RO);
2649 if (!frame_ondisk) {
2654 /* Decompress: Frame_ondisk -> frame_mem. */
2655 #ifdef CONFIG_NTFS3_LZX_XPRESS
2656 if (run != &ni->file.run) {
2658 err = decompress_lzx_xpress(
2659 sbi, frame_ondisk + (vbo_disk & (PAGE_SIZE - 1)),
2660 ondisk_size, frame_mem, unc_size, frame_size);
2664 /* LZNT - Native NTFS compression. */
2665 unc_size = decompress_lznt(frame_ondisk, ondisk_size, frame_mem,
2667 if ((ssize_t)unc_size < 0)
2669 else if (!unc_size || unc_size > frame_size)
2672 if (!err && valid_size < frame_vbo + frame_size) {
2673 size_t ok = valid_size - frame_vbo;
2675 memset(frame_mem + ok, 0, frame_size - ok);
2678 vunmap(frame_ondisk);
2681 for (i = 0; i < npages_disk; i++) {
2692 #ifdef CONFIG_NTFS3_LZX_XPRESS
2693 if (run != &ni->file.run)
2699 for (i = 0; i < pages_per_frame; i++) {
2703 SetPageUptodate(pg);
2712 * Pages - Array of locked pages.
2714 int ni_write_frame(struct ntfs_inode *ni, struct page **pages,
2715 u32 pages_per_frame)
2718 struct ntfs_sb_info *sbi = ni->mi.sbi;
2719 u8 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2720 u32 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2721 u64 frame_vbo = (u64)pages[0]->index << PAGE_SHIFT;
2722 CLST frame = frame_vbo >> frame_bits;
2723 char *frame_ondisk = NULL;
2724 struct page **pages_disk = NULL;
2725 struct ATTR_LIST_ENTRY *le = NULL;
2727 struct ATTRIB *attr;
2728 struct mft_inode *mi;
2731 size_t compr_size, ondisk_size;
2734 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, &mi);
2740 if (WARN_ON(!is_attr_compressed(attr))) {
2745 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2750 if (!attr->non_res) {
2751 down_write(&ni->file.run_lock);
2752 err = attr_make_nonresident(ni, attr, le, mi,
2753 le32_to_cpu(attr->res.data_size),
2754 &ni->file.run, &attr, pages[0]);
2755 up_write(&ni->file.run_lock);
2760 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2765 pages_disk = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2771 for (i = 0; i < pages_per_frame; i++) {
2772 pg = alloc_page(GFP_KERNEL);
2782 /* To simplify compress algorithm do vmap for source and target pages. */
2783 frame_ondisk = vmap(pages_disk, pages_per_frame, VM_MAP, PAGE_KERNEL);
2784 if (!frame_ondisk) {
2789 for (i = 0; i < pages_per_frame; i++)
2792 /* Map in-memory frame for read-only. */
2793 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL_RO);
2799 mutex_lock(&sbi->compress.mtx_lznt);
2801 if (!sbi->compress.lznt) {
2803 * LZNT implements two levels of compression:
2804 * 0 - Standard compression
2805 * 1 - Best compression, requires a lot of cpu
2808 lznt = get_lznt_ctx(0);
2810 mutex_unlock(&sbi->compress.mtx_lznt);
2815 sbi->compress.lznt = lznt;
2819 /* Compress: frame_mem -> frame_ondisk */
2820 compr_size = compress_lznt(frame_mem, frame_size, frame_ondisk,
2821 frame_size, sbi->compress.lznt);
2822 mutex_unlock(&sbi->compress.mtx_lznt);
2825 if (compr_size + sbi->cluster_size > frame_size) {
2826 /* Frame is not compressed. */
2827 compr_size = frame_size;
2828 ondisk_size = frame_size;
2829 } else if (compr_size) {
2830 /* Frame is compressed. */
2831 ondisk_size = ntfs_up_cluster(sbi, compr_size);
2832 memset(frame_ondisk + compr_size, 0, ondisk_size - compr_size);
2834 /* Frame is sparsed. */
2838 down_write(&ni->file.run_lock);
2839 run_truncate_around(&ni->file.run, le64_to_cpu(attr->nres.svcn));
2840 err = attr_allocate_frame(ni, frame, compr_size, ni->i_valid);
2841 up_write(&ni->file.run_lock);
2848 down_read(&ni->file.run_lock);
2849 err = ntfs_bio_pages(sbi, &ni->file.run,
2850 ondisk_size < frame_size ? pages_disk : pages,
2851 pages_per_frame, frame_vbo, ondisk_size,
2853 up_read(&ni->file.run_lock);
2859 for (i = 0; i < pages_per_frame; i++)
2862 vunmap(frame_ondisk);
2864 for (i = 0; i < pages_per_frame; i++) {
2878 * ni_remove_name - Removes name 'de' from MFT and from directory.
2879 * 'de2' and 'undo_step' are used to restore MFT/dir, if error occurs.
2881 int ni_remove_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2882 struct NTFS_DE *de, struct NTFS_DE **de2, int *undo_step)
2885 struct ntfs_sb_info *sbi = ni->mi.sbi;
2886 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2887 struct ATTR_FILE_NAME *fname;
2888 struct ATTR_LIST_ENTRY *le;
2889 struct mft_inode *mi;
2890 u16 de_key_size = le16_to_cpu(de->key_size);
2895 /* Find name in record. */
2896 mi_get_ref(&dir_ni->mi, &de_name->home);
2898 fname = ni_fname_name(ni, (struct cpu_str *)&de_name->name_len,
2899 &de_name->home, &mi, &le);
2903 memcpy(&de_name->dup, &fname->dup, sizeof(struct NTFS_DUP_INFO));
2904 name_type = paired_name(fname->type);
2906 /* Mark ntfs as dirty. It will be cleared at umount. */
2907 ntfs_set_state(sbi, NTFS_DIRTY_DIRTY);
2909 /* Step 1: Remove name from directory. */
2910 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname, de_key_size, sbi);
2914 /* Step 2: Remove name from MFT. */
2915 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2919 /* Get paired name. */
2920 fname = ni_fname_type(ni, name_type, &mi, &le);
2922 u16 de2_key_size = fname_full_size(fname);
2924 *de2 = Add2Ptr(de, 1024);
2925 (*de2)->key_size = cpu_to_le16(de2_key_size);
2927 memcpy(*de2 + 1, fname, de2_key_size);
2929 /* Step 3: Remove paired name from directory. */
2930 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname,
2935 /* Step 4: Remove paired name from MFT. */
2936 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2944 * ni_remove_name_undo - Paired function for ni_remove_name.
2946 * Return: True if ok
2948 bool ni_remove_name_undo(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2949 struct NTFS_DE *de, struct NTFS_DE *de2, int undo_step)
2951 struct ntfs_sb_info *sbi = ni->mi.sbi;
2952 struct ATTRIB *attr;
2953 u16 de_key_size = de2 ? le16_to_cpu(de2->key_size) : 0;
2955 switch (undo_step) {
2957 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2958 &attr, NULL, NULL)) {
2961 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de2 + 1, de_key_size);
2963 mi_get_ref(&ni->mi, &de2->ref);
2964 de2->size = cpu_to_le16(ALIGN(de_key_size, 8) +
2965 sizeof(struct NTFS_DE));
2969 if (indx_insert_entry(&dir_ni->dir, dir_ni, de2, sbi, NULL,
2976 de_key_size = le16_to_cpu(de->key_size);
2978 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2979 &attr, NULL, NULL)) {
2983 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de + 1, de_key_size);
2984 mi_get_ref(&ni->mi, &de->ref);
2986 if (indx_insert_entry(&dir_ni->dir, dir_ni, de, sbi, NULL, 1))
2994 * ni_add_name - Add new name into MFT and into directory.
2996 int ni_add_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
3000 struct ATTRIB *attr;
3001 struct ATTR_LIST_ENTRY *le;
3002 struct mft_inode *mi;
3003 struct ATTR_FILE_NAME *fname;
3004 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
3005 u16 de_key_size = le16_to_cpu(de->key_size);
3007 mi_get_ref(&ni->mi, &de->ref);
3008 mi_get_ref(&dir_ni->mi, &de_name->home);
3010 /* Fill duplicate from any ATTR_NAME. */
3011 fname = ni_fname_name(ni, NULL, NULL, NULL, NULL);
3013 memcpy(&de_name->dup, &fname->dup, sizeof(fname->dup));
3014 de_name->dup.fa = ni->std_fa;
3016 /* Insert new name into MFT. */
3017 err = ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0, &attr,
3022 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de_name, de_key_size);
3024 /* Insert new name into directory. */
3025 err = indx_insert_entry(&dir_ni->dir, dir_ni, de, ni->mi.sbi, NULL, 0);
3027 ni_remove_attr_le(ni, attr, mi, le);
3033 * ni_rename - Remove one name and insert new name.
3035 int ni_rename(struct ntfs_inode *dir_ni, struct ntfs_inode *new_dir_ni,
3036 struct ntfs_inode *ni, struct NTFS_DE *de, struct NTFS_DE *new_de,
3040 struct NTFS_DE *de2 = NULL;
3044 * There are two possible ways to rename:
3045 * 1) Add new name and remove old name.
3046 * 2) Remove old name and add new name.
3048 * In most cases (not all!) adding new name into MFT and into directory can
3049 * allocate additional cluster(s).
3050 * Second way may result to bad inode if we can't add new name
3051 * and then can't restore (add) old name.
3055 * Way 1 - Add new + remove old.
3057 err = ni_add_name(new_dir_ni, ni, new_de);
3059 err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3060 if (err && ni_remove_name(new_dir_ni, ni, new_de, &de2, &undo))
3065 * Way 2 - Remove old + add new.
3068 * err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3070 * err = ni_add_name(new_dir_ni, ni, new_de);
3071 * if (err && !ni_remove_name_undo(dir_ni, ni, de, de2, undo))
3080 * ni_is_dirty - Return: True if 'ni' requires ni_write_inode.
3082 bool ni_is_dirty(struct inode *inode)
3084 struct ntfs_inode *ni = ntfs_i(inode);
3085 struct rb_node *node;
3087 if (ni->mi.dirty || ni->attr_list.dirty ||
3088 (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3091 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
3092 if (rb_entry(node, struct mft_inode, node)->dirty)
3102 * Update duplicate info of ATTR_FILE_NAME in MFT and in parent directories.
3104 static bool ni_update_parent(struct ntfs_inode *ni, struct NTFS_DUP_INFO *dup,
3107 struct ATTRIB *attr;
3108 struct mft_inode *mi;
3109 struct ATTR_LIST_ENTRY *le = NULL;
3110 struct ntfs_sb_info *sbi = ni->mi.sbi;
3111 struct super_block *sb = sbi->sb;
3112 bool re_dirty = false;
3114 if (ni->mi.mrec->flags & RECORD_FLAG_DIR) {
3115 dup->fa |= FILE_ATTRIBUTE_DIRECTORY;
3117 dup->alloc_size = 0;
3120 dup->fa &= ~FILE_ATTRIBUTE_DIRECTORY;
3122 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL,
3125 dup->alloc_size = dup->data_size = 0;
3126 } else if (!attr->non_res) {
3127 u32 data_size = le32_to_cpu(attr->res.data_size);
3129 dup->alloc_size = cpu_to_le64(ALIGN(data_size, 8));
3130 dup->data_size = cpu_to_le64(data_size);
3132 u64 new_valid = ni->i_valid;
3133 u64 data_size = le64_to_cpu(attr->nres.data_size);
3136 dup->alloc_size = is_attr_ext(attr)
3137 ? attr->nres.total_size
3138 : attr->nres.alloc_size;
3139 dup->data_size = attr->nres.data_size;
3141 if (new_valid > data_size)
3142 new_valid = data_size;
3144 valid_le = cpu_to_le64(new_valid);
3145 if (valid_le != attr->nres.valid_size) {
3146 attr->nres.valid_size = valid_le;
3152 /* TODO: Fill reparse info. */
3156 if (ni->ni_flags & NI_FLAG_EA) {
3157 attr = ni_find_attr(ni, attr, &le, ATTR_EA_INFO, NULL, 0, NULL,
3160 const struct EA_INFO *info;
3162 info = resident_data_ex(attr, sizeof(struct EA_INFO));
3163 /* If ATTR_EA_INFO exists 'info' can't be NULL. */
3165 dup->ea_size = info->size_pack;
3172 while ((attr = ni_find_attr(ni, attr, &le, ATTR_NAME, NULL, 0, NULL,
3175 struct ATTR_FILE_NAME *fname;
3177 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
3178 if (!fname || !memcmp(&fname->dup, dup, sizeof(fname->dup)))
3181 /* ntfs_iget5 may sleep. */
3182 dir = ntfs_iget5(sb, &fname->home, NULL);
3186 "failed to open parent directory r=%lx to update",
3187 (long)ino_get(&fname->home));
3191 if (!is_bad_inode(dir)) {
3192 struct ntfs_inode *dir_ni = ntfs_i(dir);
3194 if (!ni_trylock(dir_ni)) {
3197 indx_update_dup(dir_ni, sbi, fname, dup, sync);
3199 memcpy(&fname->dup, dup, sizeof(fname->dup));
3210 * ni_write_inode - Write MFT base record and all subrecords to disk.
3212 int ni_write_inode(struct inode *inode, int sync, const char *hint)
3215 struct ntfs_inode *ni = ntfs_i(inode);
3216 struct super_block *sb = inode->i_sb;
3217 struct ntfs_sb_info *sbi = sb->s_fs_info;
3218 bool re_dirty = false;
3219 struct ATTR_STD_INFO *std;
3220 struct rb_node *node, *next;
3221 struct NTFS_DUP_INFO dup;
3223 if (is_bad_inode(inode) || sb_rdonly(sb))
3226 if (!ni_trylock(ni)) {
3227 /* 'ni' is under modification, skip for now. */
3228 mark_inode_dirty_sync(inode);
3232 if (is_rec_inuse(ni->mi.mrec) &&
3233 !(sbi->flags & NTFS_FLAGS_LOG_REPLAYING) && inode->i_nlink) {
3234 bool modified = false;
3236 /* Update times in standard attribute. */
3243 /* Update the access times if they have changed. */
3244 dup.m_time = kernel2nt(&inode->i_mtime);
3245 if (std->m_time != dup.m_time) {
3246 std->m_time = dup.m_time;
3250 dup.c_time = kernel2nt(&inode->i_ctime);
3251 if (std->c_time != dup.c_time) {
3252 std->c_time = dup.c_time;
3256 dup.a_time = kernel2nt(&inode->i_atime);
3257 if (std->a_time != dup.a_time) {
3258 std->a_time = dup.a_time;
3262 dup.fa = ni->std_fa;
3263 if (std->fa != dup.fa) {
3269 ni->mi.dirty = true;
3271 if (!ntfs_is_meta_file(sbi, inode->i_ino) &&
3272 (modified || (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3273 /* Avoid __wait_on_freeing_inode(inode). */
3274 && (sb->s_flags & SB_ACTIVE)) {
3275 dup.cr_time = std->cr_time;
3276 /* Not critical if this function fail. */
3277 re_dirty = ni_update_parent(ni, &dup, sync);
3280 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
3282 ni->ni_flags &= ~NI_FLAG_UPDATE_PARENT;
3285 /* Update attribute list. */
3286 if (ni->attr_list.size && ni->attr_list.dirty) {
3287 if (inode->i_ino != MFT_REC_MFT || sync) {
3288 err = ni_try_remove_attr_list(ni);
3293 err = al_update(ni, sync);
3299 for (node = rb_first(&ni->mi_tree); node; node = next) {
3300 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
3303 next = rb_next(node);
3308 is_empty = !mi_enum_attr(mi, NULL);
3311 clear_rec_inuse(mi->mrec);
3313 err2 = mi_write(mi, sync);
3318 ntfs_mark_rec_free(sbi, mi->rno, false);
3319 rb_erase(node, &ni->mi_tree);
3325 err2 = mi_write(&ni->mi, sync);
3333 ntfs_err(sb, "%s r=%lx failed, %d.", hint, inode->i_ino, err);
3334 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
3339 mark_inode_dirty_sync(inode);