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/vmalloc.h>
15 #ifdef CONFIG_NTFS3_LZX_XPRESS
19 static struct mft_inode *ni_ins_mi(struct ntfs_inode *ni, struct rb_root *tree,
20 CLST ino, struct rb_node *ins)
22 struct rb_node **p = &tree->rb_node;
23 struct rb_node *pr = NULL;
29 mi = rb_entry(pr, struct mft_inode, node);
32 else if (mi->rno < ino)
41 rb_link_node(ins, pr, p);
42 rb_insert_color(ins, tree);
43 return rb_entry(ins, struct mft_inode, node);
47 * ni_find_mi - Find mft_inode by record number.
49 static struct mft_inode *ni_find_mi(struct ntfs_inode *ni, CLST rno)
51 return ni_ins_mi(ni, &ni->mi_tree, rno, NULL);
55 * ni_add_mi - Add new mft_inode into ntfs_inode.
57 static void ni_add_mi(struct ntfs_inode *ni, struct mft_inode *mi)
59 ni_ins_mi(ni, &ni->mi_tree, mi->rno, &mi->node);
63 * ni_remove_mi - Remove mft_inode from ntfs_inode.
65 void ni_remove_mi(struct ntfs_inode *ni, struct mft_inode *mi)
67 rb_erase(&mi->node, &ni->mi_tree);
71 * ni_std - Return: Pointer into std_info from primary record.
73 struct ATTR_STD_INFO *ni_std(struct ntfs_inode *ni)
75 const struct ATTRIB *attr;
77 attr = mi_find_attr(&ni->mi, NULL, ATTR_STD, NULL, 0, NULL);
78 return attr ? resident_data_ex(attr, sizeof(struct ATTR_STD_INFO))
85 * Return: Pointer into std_info from primary record.
87 struct ATTR_STD_INFO5 *ni_std5(struct ntfs_inode *ni)
89 const struct ATTRIB *attr;
91 attr = mi_find_attr(&ni->mi, NULL, ATTR_STD, NULL, 0, NULL);
93 return attr ? resident_data_ex(attr, sizeof(struct ATTR_STD_INFO5))
98 * ni_clear - Clear resources allocated by ntfs_inode.
100 void ni_clear(struct ntfs_inode *ni)
102 struct rb_node *node;
104 if (!ni->vfs_inode.i_nlink && is_rec_inuse(ni->mi.mrec))
109 for (node = rb_first(&ni->mi_tree); node;) {
110 struct rb_node *next = rb_next(node);
111 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
113 rb_erase(node, &ni->mi_tree);
118 /* Bad inode always has mode == S_IFREG. */
119 if (ni->ni_flags & NI_FLAG_DIR)
120 indx_clear(&ni->dir);
122 run_close(&ni->file.run);
123 #ifdef CONFIG_NTFS3_LZX_XPRESS
124 if (ni->file.offs_page) {
125 /* On-demand allocated page for offsets. */
126 put_page(ni->file.offs_page);
127 ni->file.offs_page = NULL;
136 * ni_load_mi_ex - Find mft_inode by record number.
138 int ni_load_mi_ex(struct ntfs_inode *ni, CLST rno, struct mft_inode **mi)
143 r = ni_find_mi(ni, rno);
147 err = mi_get(ni->mi.sbi, rno, &r);
160 * ni_load_mi - Load mft_inode corresponded list_entry.
162 int ni_load_mi(struct ntfs_inode *ni, const struct ATTR_LIST_ENTRY *le,
163 struct mft_inode **mi)
172 rno = ino_get(&le->ref);
173 if (rno == ni->mi.rno) {
177 return ni_load_mi_ex(ni, rno, mi);
183 * Return: Attribute and record this attribute belongs to.
185 struct ATTRIB *ni_find_attr(struct ntfs_inode *ni, struct ATTRIB *attr,
186 struct ATTR_LIST_ENTRY **le_o, enum ATTR_TYPE type,
187 const __le16 *name, u8 name_len, const CLST *vcn,
188 struct mft_inode **mi)
190 struct ATTR_LIST_ENTRY *le;
193 if (!ni->attr_list.size ||
194 (!name_len && (type == ATTR_LIST || type == ATTR_STD))) {
200 /* Look for required attribute in primary record. */
201 return mi_find_attr(&ni->mi, attr, type, name, name_len, NULL);
204 /* First look for list entry of required type. */
205 le = al_find_ex(ni, le_o ? *le_o : NULL, type, name, name_len, vcn);
212 /* Load record that contains this attribute. */
213 if (ni_load_mi(ni, le, &m))
216 /* Look for required attribute. */
217 attr = mi_find_attr(m, NULL, type, name, name_len, &le->id);
222 if (!attr->non_res) {
228 } else if (le64_to_cpu(attr->nres.svcn) > *vcn ||
229 *vcn > le64_to_cpu(attr->nres.evcn)) {
238 ntfs_set_state(ni->mi.sbi, NTFS_DIRTY_ERROR);
243 * ni_enum_attr_ex - Enumerates attributes in ntfs_inode.
245 struct ATTRIB *ni_enum_attr_ex(struct ntfs_inode *ni, struct ATTRIB *attr,
246 struct ATTR_LIST_ENTRY **le,
247 struct mft_inode **mi)
249 struct mft_inode *mi2;
250 struct ATTR_LIST_ENTRY *le2;
252 /* Do we have an attribute list? */
253 if (!ni->attr_list.size) {
257 /* Enum attributes in primary record. */
258 return mi_enum_attr(&ni->mi, attr);
261 /* Get next list entry. */
262 le2 = *le = al_enumerate(ni, attr ? *le : NULL);
266 /* Load record that contains the required attribute. */
267 if (ni_load_mi(ni, le2, &mi2))
273 /* Find attribute in loaded record. */
274 return rec_find_attr_le(mi2, le2);
278 * ni_load_attr - Load attribute that contains given VCN.
280 struct ATTRIB *ni_load_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
281 const __le16 *name, u8 name_len, CLST vcn,
282 struct mft_inode **pmi)
284 struct ATTR_LIST_ENTRY *le;
286 struct mft_inode *mi;
287 struct ATTR_LIST_ENTRY *next;
289 if (!ni->attr_list.size) {
292 return mi_find_attr(&ni->mi, NULL, type, name, name_len, NULL);
295 le = al_find_ex(ni, NULL, type, name, name_len, NULL);
300 * Unfortunately ATTR_LIST_ENTRY contains only start VCN.
301 * So to find the ATTRIB segment that contains 'vcn' we should
302 * enumerate some entries.
306 next = al_find_ex(ni, le, type, name, name_len, NULL);
307 if (!next || le64_to_cpu(next->vcn) > vcn)
312 if (ni_load_mi(ni, le, &mi))
318 attr = mi_find_attr(mi, NULL, type, name, name_len, &le->id);
325 if (le64_to_cpu(attr->nres.svcn) <= vcn &&
326 vcn <= le64_to_cpu(attr->nres.evcn))
333 * ni_load_all_mi - Load all subrecords.
335 int ni_load_all_mi(struct ntfs_inode *ni)
338 struct ATTR_LIST_ENTRY *le;
340 if (!ni->attr_list.size)
345 while ((le = al_enumerate(ni, le))) {
346 CLST rno = ino_get(&le->ref);
348 if (rno == ni->mi.rno)
351 err = ni_load_mi_ex(ni, rno, NULL);
360 * ni_add_subrecord - Allocate + format + attach a new subrecord.
362 bool ni_add_subrecord(struct ntfs_inode *ni, CLST rno, struct mft_inode **mi)
366 m = kzalloc(sizeof(struct mft_inode), GFP_NOFS);
370 if (mi_format_new(m, ni->mi.sbi, rno, 0, ni->mi.rno == MFT_REC_MFT)) {
375 mi_get_ref(&ni->mi, &m->mrec->parent_ref);
383 * ni_remove_attr - Remove all attributes for the given type/name/id.
385 int ni_remove_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
386 const __le16 *name, size_t name_len, bool base_only,
391 struct ATTR_LIST_ENTRY *le;
392 struct mft_inode *mi;
396 if (base_only || type == ATTR_LIST || !ni->attr_list.size) {
397 attr = mi_find_attr(&ni->mi, NULL, type, name, name_len, id);
401 mi_remove_attr(ni, &ni->mi, attr);
405 type_in = le32_to_cpu(type);
409 le = al_enumerate(ni, le);
414 diff = le32_to_cpu(le->type) - type_in;
421 if (le->name_len != name_len)
425 memcmp(le_name(le), name, name_len * sizeof(short)))
428 if (id && le->id != *id)
430 err = ni_load_mi(ni, le, &mi);
434 al_remove_le(ni, le);
436 attr = mi_find_attr(mi, NULL, type, name, name_len, id);
440 mi_remove_attr(ni, mi, attr);
442 if (PtrOffset(ni->attr_list.le, le) >= ni->attr_list.size)
449 * ni_ins_new_attr - Insert the attribute into record.
451 * Return: Not full constructed attribute or NULL if not possible to create.
453 static struct ATTRIB *
454 ni_ins_new_attr(struct ntfs_inode *ni, struct mft_inode *mi,
455 struct ATTR_LIST_ENTRY *le, enum ATTR_TYPE type,
456 const __le16 *name, u8 name_len, u32 asize, u16 name_off,
457 CLST svcn, struct ATTR_LIST_ENTRY **ins_le)
461 bool le_added = false;
464 mi_get_ref(mi, &ref);
466 if (type != ATTR_LIST && !le && ni->attr_list.size) {
467 err = al_add_le(ni, type, name, name_len, svcn, cpu_to_le16(-1),
470 /* No memory or no space. */
476 * al_add_le -> attr_set_size (list) -> ni_expand_list
477 * which moves some attributes out of primary record
478 * this means that name may point into moved memory
479 * reinit 'name' from le.
484 attr = mi_insert_attr(mi, type, name, name_len, asize, name_off);
487 al_remove_le(ni, le);
491 if (type == ATTR_LIST) {
492 /* Attr list is not in list entry array. */
499 /* Update ATTRIB Id and record reference. */
501 ni->attr_list.dirty = true;
513 * Random write access to sparsed or compressed file may result to
514 * not optimized packed runs.
515 * Here is the place to optimize it.
517 static int ni_repack(struct ntfs_inode *ni)
520 struct ntfs_sb_info *sbi = ni->mi.sbi;
521 struct mft_inode *mi, *mi_p = NULL;
522 struct ATTRIB *attr = NULL, *attr_p;
523 struct ATTR_LIST_ENTRY *le = NULL, *le_p;
525 u8 cluster_bits = sbi->cluster_bits;
526 CLST svcn, evcn = 0, svcn_p, evcn_p, next_svcn;
527 u32 roff, rs = sbi->record_size;
528 struct runs_tree run;
532 while ((attr = ni_enum_attr_ex(ni, attr, &le, &mi))) {
536 svcn = le64_to_cpu(attr->nres.svcn);
537 if (svcn != le64_to_cpu(le->vcn)) {
543 alloc = le64_to_cpu(attr->nres.alloc_size) >>
546 } else if (svcn != evcn + 1) {
551 evcn = le64_to_cpu(attr->nres.evcn);
553 if (svcn > evcn + 1) {
559 /* Do not try if not enogh free space. */
560 if (le32_to_cpu(mi->mrec->used) + 8 >= rs)
563 /* Do not try if last attribute segment. */
564 if (evcn + 1 == alloc)
569 roff = le16_to_cpu(attr->nres.run_off);
570 err = run_unpack(&run, sbi, ni->mi.rno, svcn, evcn, svcn,
572 le32_to_cpu(attr->size) - roff);
587 * Run contains data from two records: mi_p and mi
588 * Try to pack in one.
590 err = mi_pack_runs(mi_p, attr_p, &run, evcn + 1 - svcn_p);
594 next_svcn = le64_to_cpu(attr_p->nres.evcn) + 1;
596 if (next_svcn >= evcn + 1) {
597 /* We can remove this attribute segment. */
598 al_remove_le(ni, le);
599 mi_remove_attr(NULL, mi, attr);
604 attr->nres.svcn = le->vcn = cpu_to_le64(next_svcn);
606 ni->attr_list.dirty = true;
608 if (evcn + 1 == alloc) {
609 err = mi_pack_runs(mi, attr, &run,
610 evcn + 1 - next_svcn);
620 run_truncate_head(&run, next_svcn);
625 ntfs_inode_warn(&ni->vfs_inode, "repack problem");
626 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
628 /* Pack loaded but not packed runs. */
630 mi_pack_runs(mi_p, attr_p, &run, evcn_p + 1 - svcn_p);
638 * ni_try_remove_attr_list
640 * Can we remove attribute list?
641 * Check the case when primary record contains enough space for all attributes.
643 static int ni_try_remove_attr_list(struct ntfs_inode *ni)
646 struct ntfs_sb_info *sbi = ni->mi.sbi;
647 struct ATTRIB *attr, *attr_list, *attr_ins;
648 struct ATTR_LIST_ENTRY *le;
649 struct mft_inode *mi;
654 if (!ni->attr_list.dirty)
661 attr_list = mi_find_attr(&ni->mi, NULL, ATTR_LIST, NULL, 0, NULL);
665 asize = le32_to_cpu(attr_list->size);
667 /* Free space in primary record without attribute list. */
668 free = sbi->record_size - le32_to_cpu(ni->mi.mrec->used) + asize;
669 mi_get_ref(&ni->mi, &ref);
672 while ((le = al_enumerate(ni, le))) {
673 if (!memcmp(&le->ref, &ref, sizeof(ref)))
679 mi = ni_find_mi(ni, ino_get(&le->ref));
683 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
684 le->name_len, &le->id);
688 asize = le32_to_cpu(attr->size);
695 /* It seems that attribute list can be removed from primary record. */
696 mi_remove_attr(NULL, &ni->mi, attr_list);
699 * Repeat the cycle above and move all attributes to primary record.
700 * It should be success!
703 while ((le = al_enumerate(ni, le))) {
704 if (!memcmp(&le->ref, &ref, sizeof(ref)))
707 mi = ni_find_mi(ni, ino_get(&le->ref));
709 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
710 le->name_len, &le->id);
711 asize = le32_to_cpu(attr->size);
713 /* Insert into primary record. */
714 attr_ins = mi_insert_attr(&ni->mi, le->type, le_name(le),
716 le16_to_cpu(attr->name_off));
719 /* Copy all except id. */
720 memcpy(attr_ins, attr, asize);
723 /* Remove from original record. */
724 mi_remove_attr(NULL, mi, attr);
727 run_deallocate(sbi, &ni->attr_list.run, true);
728 run_close(&ni->attr_list.run);
729 ni->attr_list.size = 0;
730 kfree(ni->attr_list.le);
731 ni->attr_list.le = NULL;
732 ni->attr_list.dirty = false;
738 * ni_create_attr_list - Generates an attribute list for this primary record.
740 int ni_create_attr_list(struct ntfs_inode *ni)
742 struct ntfs_sb_info *sbi = ni->mi.sbi;
746 struct ATTRIB *arr_move[7];
747 struct ATTR_LIST_ENTRY *le, *le_b[7];
751 struct mft_inode *mi;
752 u32 free_b, nb, to_free, rs;
755 is_mft = ni->mi.rno == MFT_REC_MFT;
757 rs = sbi->record_size;
760 * Skip estimating exact memory requirement.
761 * Looks like one record_size is always enough.
763 le = kmalloc(al_aligned(rs), GFP_NOFS);
769 mi_get_ref(&ni->mi, &le->ref);
770 ni->attr_list.le = le;
777 for (; (attr = mi_enum_attr(&ni->mi, attr)); le = Add2Ptr(le, sz)) {
778 sz = le_size(attr->name_len);
779 le->type = attr->type;
780 le->size = cpu_to_le16(sz);
781 le->name_len = attr->name_len;
782 le->name_off = offsetof(struct ATTR_LIST_ENTRY, name);
784 if (le != ni->attr_list.le)
785 le->ref = ni->attr_list.le->ref;
789 memcpy(le->name, attr_name(attr),
790 sizeof(short) * attr->name_len);
791 else if (attr->type == ATTR_STD)
793 else if (attr->type == ATTR_LIST)
795 else if (is_mft && attr->type == ATTR_DATA)
798 if (!nb || nb < ARRAY_SIZE(arr_move)) {
800 arr_move[nb++] = attr;
801 free_b += le32_to_cpu(attr->size);
805 lsize = PtrOffset(ni->attr_list.le, le);
806 ni->attr_list.size = lsize;
808 to_free = le32_to_cpu(rec->used) + lsize + SIZEOF_RESIDENT;
814 if (to_free > free_b) {
820 /* Allocate child MFT. */
821 err = ntfs_look_free_mft(sbi, &rno, is_mft, ni, &mi);
825 /* Call mi_remove_attr() in reverse order to keep pointers 'arr_move' valid. */
826 while (to_free > 0) {
827 struct ATTRIB *b = arr_move[--nb];
828 u32 asize = le32_to_cpu(b->size);
829 u16 name_off = le16_to_cpu(b->name_off);
831 attr = mi_insert_attr(mi, b->type, Add2Ptr(b, name_off),
832 b->name_len, asize, name_off);
835 mi_get_ref(mi, &le_b[nb]->ref);
836 le_b[nb]->id = attr->id;
838 /* Copy all except id. */
839 memcpy(attr, b, asize);
840 attr->id = le_b[nb]->id;
842 /* Remove from primary record. */
843 WARN_ON(!mi_remove_attr(NULL, &ni->mi, b));
845 if (to_free <= asize)
851 attr = mi_insert_attr(&ni->mi, ATTR_LIST, NULL, 0,
852 lsize + SIZEOF_RESIDENT, SIZEOF_RESIDENT);
857 attr->res.data_size = cpu_to_le32(lsize);
858 attr->res.data_off = SIZEOF_RESIDENT_LE;
862 memcpy(resident_data_ex(attr, lsize), ni->attr_list.le, lsize);
864 ni->attr_list.dirty = false;
866 mark_inode_dirty(&ni->vfs_inode);
870 kfree(ni->attr_list.le);
871 ni->attr_list.le = NULL;
872 ni->attr_list.size = 0;
879 * ni_ins_attr_ext - Add an external attribute to the ntfs_inode.
881 static int ni_ins_attr_ext(struct ntfs_inode *ni, struct ATTR_LIST_ENTRY *le,
882 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
883 u32 asize, CLST svcn, u16 name_off, bool force_ext,
884 struct ATTRIB **ins_attr, struct mft_inode **ins_mi,
885 struct ATTR_LIST_ENTRY **ins_le)
888 struct mft_inode *mi;
891 struct rb_node *node;
893 bool is_mft, is_mft_data;
894 struct ntfs_sb_info *sbi = ni->mi.sbi;
896 is_mft = ni->mi.rno == MFT_REC_MFT;
897 is_mft_data = is_mft && type == ATTR_DATA && !name_len;
899 if (asize > sbi->max_bytes_per_attr) {
905 * Standard information and attr_list cannot be made external.
906 * The Log File cannot have any external attributes.
908 if (type == ATTR_STD || type == ATTR_LIST ||
909 ni->mi.rno == MFT_REC_LOG) {
914 /* Create attribute list if it is not already existed. */
915 if (!ni->attr_list.size) {
916 err = ni_create_attr_list(ni);
921 vbo = is_mft_data ? ((u64)svcn << sbi->cluster_bits) : 0;
926 /* Load all subrecords into memory. */
927 err = ni_load_all_mi(ni);
931 /* Check each of loaded subrecord. */
932 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
933 mi = rb_entry(node, struct mft_inode, node);
936 (mi_enum_attr(mi, NULL) ||
937 vbo <= ((u64)mi->rno << sbi->record_bits))) {
938 /* We can't accept this record 'cause MFT's bootstrapping. */
942 mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0, NULL)) {
944 * This child record already has a ATTR_DATA.
945 * So it can't accept any other records.
950 if ((type != ATTR_NAME || name_len) &&
951 mi_find_attr(mi, NULL, type, name, name_len, NULL)) {
952 /* Only indexed attributes can share same record. */
956 /* Try to insert attribute into this subrecord. */
957 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
958 name_off, svcn, ins_le);
970 /* We have to allocate a new child subrecord. */
971 err = ntfs_look_free_mft(sbi, &rno, is_mft_data, ni, &mi);
975 if (is_mft_data && vbo <= ((u64)rno << sbi->record_bits)) {
980 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
981 name_off, svcn, ins_le);
993 ni_remove_mi(ni, mi);
998 ntfs_mark_rec_free(sbi, rno);
1005 * ni_insert_attr - Insert an attribute into the file.
1007 * If the primary record has room, it will just insert the attribute.
1008 * If not, it may make the attribute external.
1009 * For $MFT::Data it may make room for the attribute by
1010 * making other attributes external.
1013 * The ATTR_LIST and ATTR_STD cannot be made external.
1014 * This function does not fill new attribute full.
1015 * It only fills 'size'/'type'/'id'/'name_len' fields.
1017 static int ni_insert_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
1018 const __le16 *name, u8 name_len, u32 asize,
1019 u16 name_off, CLST svcn, struct ATTRIB **ins_attr,
1020 struct mft_inode **ins_mi,
1021 struct ATTR_LIST_ENTRY **ins_le)
1023 struct ntfs_sb_info *sbi = ni->mi.sbi;
1025 struct ATTRIB *attr, *eattr;
1026 struct MFT_REC *rec;
1028 struct ATTR_LIST_ENTRY *le;
1029 u32 list_reserve, max_free, free, used, t32;
1033 is_mft = ni->mi.rno == MFT_REC_MFT;
1036 list_reserve = SIZEOF_NONRESIDENT + 3 * (1 + 2 * sizeof(u32));
1037 used = le32_to_cpu(rec->used);
1038 free = sbi->record_size - used;
1040 if (is_mft && type != ATTR_LIST) {
1041 /* Reserve space for the ATTRIB list. */
1042 if (free < list_reserve)
1045 free -= list_reserve;
1048 if (asize <= free) {
1049 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len,
1050 asize, name_off, svcn, ins_le);
1061 if (!is_mft || type != ATTR_DATA || svcn) {
1062 /* This ATTRIB will be external. */
1063 err = ni_ins_attr_ext(ni, NULL, type, name, name_len, asize,
1064 svcn, name_off, false, ins_attr, ins_mi,
1070 * Here we have: "is_mft && type == ATTR_DATA && !svcn"
1072 * The first chunk of the $MFT::Data ATTRIB must be the base record.
1073 * Evict as many other attributes as possible.
1077 /* Estimate the result of moving all possible attributes away. */
1080 while ((attr = mi_enum_attr(&ni->mi, attr))) {
1081 if (attr->type == ATTR_STD)
1083 if (attr->type == ATTR_LIST)
1085 max_free += le32_to_cpu(attr->size);
1088 if (max_free < asize + list_reserve) {
1089 /* Impossible to insert this attribute into primary record. */
1094 /* Start real attribute moving. */
1098 attr = mi_enum_attr(&ni->mi, attr);
1100 /* We should never be here 'cause we have already check this case. */
1105 /* Skip attributes that MUST be primary record. */
1106 if (attr->type == ATTR_STD || attr->type == ATTR_LIST)
1110 if (ni->attr_list.size) {
1111 le = al_find_le(ni, NULL, attr);
1113 /* Really this is a serious bug. */
1119 t32 = le32_to_cpu(attr->size);
1120 t16 = le16_to_cpu(attr->name_off);
1121 err = ni_ins_attr_ext(ni, le, attr->type, Add2Ptr(attr, t16),
1122 attr->name_len, t32, attr_svcn(attr), t16,
1123 false, &eattr, NULL, NULL);
1128 memcpy(eattr, attr, t32);
1131 /* Remove from primary record. */
1132 mi_remove_attr(NULL, &ni->mi, attr);
1134 /* attr now points to next attribute. */
1135 if (attr->type == ATTR_END)
1138 while (asize + list_reserve > sbi->record_size - le32_to_cpu(rec->used))
1141 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len, asize,
1142 name_off, svcn, ins_le);
1157 /* ni_expand_mft_list - Split ATTR_DATA of $MFT. */
1158 static int ni_expand_mft_list(struct ntfs_inode *ni)
1161 struct runs_tree *run = &ni->file.run;
1162 u32 asize, run_size, done = 0;
1163 struct ATTRIB *attr;
1164 struct rb_node *node;
1165 CLST mft_min, mft_new, svcn, evcn, plen;
1166 struct mft_inode *mi, *mi_min, *mi_new;
1167 struct ntfs_sb_info *sbi = ni->mi.sbi;
1169 /* Find the nearest MFT. */
1174 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
1175 mi = rb_entry(node, struct mft_inode, node);
1177 attr = mi_enum_attr(mi, NULL);
1186 if (ntfs_look_free_mft(sbi, &mft_new, true, ni, &mi_new)) {
1188 /* Really this is not critical. */
1189 } else if (mft_min > mft_new) {
1193 ntfs_mark_rec_free(sbi, mft_new);
1195 ni_remove_mi(ni, mi_new);
1198 attr = mi_find_attr(&ni->mi, NULL, ATTR_DATA, NULL, 0, NULL);
1204 asize = le32_to_cpu(attr->size);
1206 evcn = le64_to_cpu(attr->nres.evcn);
1207 svcn = bytes_to_cluster(sbi, (u64)(mft_min + 1) << sbi->record_bits);
1208 if (evcn + 1 >= svcn) {
1214 * Split primary attribute [0 evcn] in two parts [0 svcn) + [svcn evcn].
1216 * Update first part of ATTR_DATA in 'primary MFT.
1218 err = run_pack(run, 0, svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1219 asize - SIZEOF_NONRESIDENT, &plen);
1223 run_size = ALIGN(err, 8);
1231 attr->nres.evcn = cpu_to_le64(svcn - 1);
1232 attr->size = cpu_to_le32(run_size + SIZEOF_NONRESIDENT);
1233 /* 'done' - How many bytes of primary MFT becomes free. */
1234 done = asize - run_size - SIZEOF_NONRESIDENT;
1235 le32_sub_cpu(&ni->mi.mrec->used, done);
1237 /* Estimate the size of second part: run_buf=NULL. */
1238 err = run_pack(run, svcn, evcn + 1 - svcn, NULL, sbi->record_size,
1243 run_size = ALIGN(err, 8);
1246 if (plen < evcn + 1 - svcn) {
1252 * This function may implicitly call expand attr_list.
1253 * Insert second part of ATTR_DATA in 'mi_min'.
1255 attr = ni_ins_new_attr(ni, mi_min, NULL, ATTR_DATA, NULL, 0,
1256 SIZEOF_NONRESIDENT + run_size,
1257 SIZEOF_NONRESIDENT, svcn, NULL);
1264 attr->name_off = SIZEOF_NONRESIDENT_LE;
1267 run_pack(run, svcn, evcn + 1 - svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1270 attr->nres.svcn = cpu_to_le64(svcn);
1271 attr->nres.evcn = cpu_to_le64(evcn);
1272 attr->nres.run_off = cpu_to_le16(SIZEOF_NONRESIDENT);
1276 ntfs_mark_rec_free(sbi, mft_new);
1277 ni_remove_mi(ni, mi_new);
1280 return !err && !done ? -EOPNOTSUPP : err;
1284 * ni_expand_list - Move all possible attributes out of primary record.
1286 int ni_expand_list(struct ntfs_inode *ni)
1289 u32 asize, done = 0;
1290 struct ATTRIB *attr, *ins_attr;
1291 struct ATTR_LIST_ENTRY *le;
1292 bool is_mft = ni->mi.rno == MFT_REC_MFT;
1295 mi_get_ref(&ni->mi, &ref);
1298 while ((le = al_enumerate(ni, le))) {
1299 if (le->type == ATTR_STD)
1302 if (memcmp(&ref, &le->ref, sizeof(struct MFT_REF)))
1305 if (is_mft && le->type == ATTR_DATA)
1308 /* Find attribute in primary record. */
1309 attr = rec_find_attr_le(&ni->mi, le);
1315 asize = le32_to_cpu(attr->size);
1317 /* Always insert into new record to avoid collisions (deep recursive). */
1318 err = ni_ins_attr_ext(ni, le, attr->type, attr_name(attr),
1319 attr->name_len, asize, attr_svcn(attr),
1320 le16_to_cpu(attr->name_off), true,
1321 &ins_attr, NULL, NULL);
1326 memcpy(ins_attr, attr, asize);
1327 ins_attr->id = le->id;
1328 /* Remove from primary record. */
1329 mi_remove_attr(NULL, &ni->mi, attr);
1336 err = -EFBIG; /* Attr list is too big(?) */
1340 /* Split MFT data as much as possible. */
1341 err = ni_expand_mft_list(ni);
1346 return !err && !done ? -EOPNOTSUPP : err;
1350 * ni_insert_nonresident - Insert new nonresident attribute.
1352 int ni_insert_nonresident(struct ntfs_inode *ni, enum ATTR_TYPE type,
1353 const __le16 *name, u8 name_len,
1354 const struct runs_tree *run, CLST svcn, CLST len,
1355 __le16 flags, struct ATTRIB **new_attr,
1356 struct mft_inode **mi)
1360 struct ATTRIB *attr;
1362 (flags & (ATTR_FLAG_SPARSED | ATTR_FLAG_COMPRESSED)) && !svcn;
1363 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1364 u32 name_off = is_ext ? SIZEOF_NONRESIDENT_EX : SIZEOF_NONRESIDENT;
1365 u32 run_off = name_off + name_size;
1366 u32 run_size, asize;
1367 struct ntfs_sb_info *sbi = ni->mi.sbi;
1369 err = run_pack(run, svcn, len, NULL, sbi->max_bytes_per_attr - run_off,
1374 run_size = ALIGN(err, 8);
1381 asize = run_off + run_size;
1383 if (asize > sbi->max_bytes_per_attr) {
1388 err = ni_insert_attr(ni, type, name, name_len, asize, name_off, svcn,
1395 attr->name_off = cpu_to_le16(name_off);
1396 attr->flags = flags;
1398 run_pack(run, svcn, len, Add2Ptr(attr, run_off), run_size, &plen);
1400 attr->nres.svcn = cpu_to_le64(svcn);
1401 attr->nres.evcn = cpu_to_le64((u64)svcn + len - 1);
1407 *(__le64 *)&attr->nres.run_off = cpu_to_le64(run_off);
1409 attr->nres.alloc_size =
1410 svcn ? 0 : cpu_to_le64((u64)len << ni->mi.sbi->cluster_bits);
1411 attr->nres.data_size = attr->nres.alloc_size;
1412 attr->nres.valid_size = attr->nres.alloc_size;
1415 if (flags & ATTR_FLAG_COMPRESSED)
1416 attr->nres.c_unit = COMPRESSION_UNIT;
1417 attr->nres.total_size = attr->nres.alloc_size;
1425 * ni_insert_resident - Inserts new resident attribute.
1427 int ni_insert_resident(struct ntfs_inode *ni, u32 data_size,
1428 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
1429 struct ATTRIB **new_attr, struct mft_inode **mi,
1430 struct ATTR_LIST_ENTRY **le)
1433 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1434 u32 asize = SIZEOF_RESIDENT + name_size + ALIGN(data_size, 8);
1435 struct ATTRIB *attr;
1437 err = ni_insert_attr(ni, type, name, name_len, asize, SIZEOF_RESIDENT,
1445 attr->res.data_size = cpu_to_le32(data_size);
1446 attr->res.data_off = cpu_to_le16(SIZEOF_RESIDENT + name_size);
1447 if (type == ATTR_NAME) {
1448 attr->res.flags = RESIDENT_FLAG_INDEXED;
1450 /* is_attr_indexed(attr)) == true */
1451 le16_add_cpu(&ni->mi.mrec->hard_links, 1);
1452 ni->mi.dirty = true;
1463 * ni_remove_attr_le - Remove attribute from record.
1465 void ni_remove_attr_le(struct ntfs_inode *ni, struct ATTRIB *attr,
1466 struct mft_inode *mi, struct ATTR_LIST_ENTRY *le)
1468 mi_remove_attr(ni, mi, attr);
1471 al_remove_le(ni, le);
1475 * ni_delete_all - Remove all attributes and frees allocates space.
1477 * ntfs_evict_inode->ntfs_clear_inode->ni_delete_all (if no links).
1479 int ni_delete_all(struct ntfs_inode *ni)
1482 struct ATTR_LIST_ENTRY *le = NULL;
1483 struct ATTRIB *attr = NULL;
1484 struct rb_node *node;
1488 struct ntfs_sb_info *sbi = ni->mi.sbi;
1489 bool nt3 = is_ntfs3(sbi);
1492 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
1493 if (!nt3 || attr->name_len) {
1495 } else if (attr->type == ATTR_REPARSE) {
1496 mi_get_ref(&ni->mi, &ref);
1497 ntfs_remove_reparse(sbi, 0, &ref);
1498 } else if (attr->type == ATTR_ID && !attr->non_res &&
1499 le32_to_cpu(attr->res.data_size) >=
1500 sizeof(struct GUID)) {
1501 ntfs_objid_remove(sbi, resident_data(attr));
1507 svcn = le64_to_cpu(attr->nres.svcn);
1508 evcn = le64_to_cpu(attr->nres.evcn);
1510 if (evcn + 1 <= svcn)
1513 asize = le32_to_cpu(attr->size);
1514 roff = le16_to_cpu(attr->nres.run_off);
1516 /* run==1 means unpack and deallocate. */
1517 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
1518 Add2Ptr(attr, roff), asize - roff);
1521 if (ni->attr_list.size) {
1522 run_deallocate(ni->mi.sbi, &ni->attr_list.run, true);
1526 /* Free all subrecords. */
1527 for (node = rb_first(&ni->mi_tree); node;) {
1528 struct rb_node *next = rb_next(node);
1529 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
1531 clear_rec_inuse(mi->mrec);
1535 ntfs_mark_rec_free(sbi, mi->rno);
1536 ni_remove_mi(ni, mi);
1541 /* Free base record. */
1542 clear_rec_inuse(ni->mi.mrec);
1543 ni->mi.dirty = true;
1544 err = mi_write(&ni->mi, 0);
1546 ntfs_mark_rec_free(sbi, ni->mi.rno);
1553 * Return: File name attribute by its value.
1555 struct ATTR_FILE_NAME *ni_fname_name(struct ntfs_inode *ni,
1556 const struct cpu_str *uni,
1557 const struct MFT_REF *home_dir,
1558 struct mft_inode **mi,
1559 struct ATTR_LIST_ENTRY **le)
1561 struct ATTRIB *attr = NULL;
1562 struct ATTR_FILE_NAME *fname;
1566 /* Enumerate all names. */
1568 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1572 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1576 if (home_dir && memcmp(home_dir, &fname->home, sizeof(*home_dir)))
1582 if (uni->len != fname->name_len)
1585 if (ntfs_cmp_names_cpu(uni, (struct le_str *)&fname->name_len, NULL,
1595 * Return: File name attribute with given type.
1597 struct ATTR_FILE_NAME *ni_fname_type(struct ntfs_inode *ni, u8 name_type,
1598 struct mft_inode **mi,
1599 struct ATTR_LIST_ENTRY **le)
1601 struct ATTRIB *attr = NULL;
1602 struct ATTR_FILE_NAME *fname;
1606 if (name_type == FILE_NAME_POSIX)
1609 /* Enumerate all names. */
1611 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1615 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1616 if (fname && name_type == fname->type)
1624 * Process compressed/sparsed in special way.
1625 * NOTE: You need to set ni->std_fa = new_fa
1626 * after this function to keep internal structures in consistency.
1628 int ni_new_attr_flags(struct ntfs_inode *ni, enum FILE_ATTRIBUTE new_fa)
1630 struct ATTRIB *attr;
1631 struct mft_inode *mi;
1635 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
1639 new_aflags = attr->flags;
1641 if (new_fa & FILE_ATTRIBUTE_SPARSE_FILE)
1642 new_aflags |= ATTR_FLAG_SPARSED;
1644 new_aflags &= ~ATTR_FLAG_SPARSED;
1646 if (new_fa & FILE_ATTRIBUTE_COMPRESSED)
1647 new_aflags |= ATTR_FLAG_COMPRESSED;
1649 new_aflags &= ~ATTR_FLAG_COMPRESSED;
1651 if (new_aflags == attr->flags)
1654 if ((new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) ==
1655 (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) {
1656 ntfs_inode_warn(&ni->vfs_inode,
1657 "file can't be sparsed and compressed");
1664 if (attr->nres.data_size) {
1667 "one can change sparsed/compressed only for empty files");
1671 /* Resize nonresident empty attribute in-place only. */
1672 new_asize = (new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED))
1673 ? (SIZEOF_NONRESIDENT_EX + 8)
1674 : (SIZEOF_NONRESIDENT + 8);
1676 if (!mi_resize_attr(mi, attr, new_asize - le32_to_cpu(attr->size)))
1679 if (new_aflags & ATTR_FLAG_SPARSED) {
1680 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1681 /* Windows uses 16 clusters per frame but supports one cluster per frame too. */
1682 attr->nres.c_unit = 0;
1683 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1684 } else if (new_aflags & ATTR_FLAG_COMPRESSED) {
1685 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1686 /* The only allowed: 16 clusters per frame. */
1687 attr->nres.c_unit = NTFS_LZNT_CUNIT;
1688 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops_cmpr;
1690 attr->name_off = SIZEOF_NONRESIDENT_LE;
1692 attr->nres.c_unit = 0;
1693 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1695 attr->nres.run_off = attr->name_off;
1697 attr->flags = new_aflags;
1706 * Buffer is at least 24 bytes.
1708 enum REPARSE_SIGN ni_parse_reparse(struct ntfs_inode *ni, struct ATTRIB *attr,
1711 const struct REPARSE_DATA_BUFFER *rp = NULL;
1714 typeof(rp->CompressReparseBuffer) *cmpr;
1716 static_assert(sizeof(struct REPARSE_DATA_BUFFER) <= 24);
1718 /* Try to estimate reparse point. */
1719 if (!attr->non_res) {
1720 rp = resident_data_ex(attr, sizeof(struct REPARSE_DATA_BUFFER));
1721 } else if (le64_to_cpu(attr->nres.data_size) >=
1722 sizeof(struct REPARSE_DATA_BUFFER)) {
1723 struct runs_tree run;
1727 if (!attr_load_runs_vcn(ni, ATTR_REPARSE, NULL, 0, &run, 0) &&
1728 !ntfs_read_run_nb(ni->mi.sbi, &run, 0, buffer,
1729 sizeof(struct REPARSE_DATA_BUFFER),
1738 return REPARSE_NONE;
1740 len = le16_to_cpu(rp->ReparseDataLength);
1741 switch (rp->ReparseTag) {
1742 case (IO_REPARSE_TAG_MICROSOFT | IO_REPARSE_TAG_SYMBOLIC_LINK):
1743 break; /* Symbolic link. */
1744 case IO_REPARSE_TAG_MOUNT_POINT:
1745 break; /* Mount points and junctions. */
1746 case IO_REPARSE_TAG_SYMLINK:
1748 case IO_REPARSE_TAG_COMPRESS:
1750 * WOF - Windows Overlay Filter - Used to compress files with
1753 * Unlike native NTFS file compression, the Windows
1754 * Overlay Filter supports only read operations. This means
1755 * that it doesn't need to sector-align each compressed chunk,
1756 * so the compressed data can be packed more tightly together.
1757 * If you open the file for writing, the WOF just decompresses
1758 * the entire file, turning it back into a plain file.
1760 * Ntfs3 driver decompresses the entire file only on write or
1761 * change size requests.
1764 cmpr = &rp->CompressReparseBuffer;
1765 if (len < sizeof(*cmpr) ||
1766 cmpr->WofVersion != WOF_CURRENT_VERSION ||
1767 cmpr->WofProvider != WOF_PROVIDER_SYSTEM ||
1768 cmpr->ProviderVer != WOF_PROVIDER_CURRENT_VERSION) {
1769 return REPARSE_NONE;
1772 switch (cmpr->CompressionFormat) {
1773 case WOF_COMPRESSION_XPRESS4K:
1776 case WOF_COMPRESSION_XPRESS8K:
1779 case WOF_COMPRESSION_XPRESS16K:
1782 case WOF_COMPRESSION_LZX32K:
1789 ni_set_ext_compress_bits(ni, bits);
1790 return REPARSE_COMPRESSED;
1792 case IO_REPARSE_TAG_DEDUP:
1793 ni->ni_flags |= NI_FLAG_DEDUPLICATED;
1794 return REPARSE_DEDUPLICATED;
1797 if (rp->ReparseTag & IO_REPARSE_TAG_NAME_SURROGATE)
1800 return REPARSE_NONE;
1803 /* Looks like normal symlink. */
1804 return REPARSE_LINK;
1808 * ni_fiemap - Helper for file_fiemap().
1811 * TODO: Less aggressive locks.
1813 int ni_fiemap(struct ntfs_inode *ni, struct fiemap_extent_info *fieinfo,
1814 __u64 vbo, __u64 len)
1817 struct ntfs_sb_info *sbi = ni->mi.sbi;
1818 u8 cluster_bits = sbi->cluster_bits;
1819 struct runs_tree *run;
1820 struct rw_semaphore *run_lock;
1821 struct ATTRIB *attr;
1822 CLST vcn = vbo >> cluster_bits;
1824 u64 valid = ni->i_valid;
1826 u64 end, alloc_size;
1831 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1832 run = &ni->dir.alloc_run;
1833 attr = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, I30_NAME,
1834 ARRAY_SIZE(I30_NAME), NULL, NULL);
1835 run_lock = &ni->dir.run_lock;
1837 run = &ni->file.run;
1838 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL,
1844 if (is_attr_compressed(attr)) {
1845 /* Unfortunately cp -r incorrectly treats compressed clusters. */
1849 "fiemap is not supported for compressed file (cp -r)");
1852 run_lock = &ni->file.run_lock;
1855 if (!attr || !attr->non_res) {
1856 err = fiemap_fill_next_extent(
1858 attr ? le32_to_cpu(attr->res.data_size) : 0,
1859 FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_LAST |
1860 FIEMAP_EXTENT_MERGED);
1865 alloc_size = le64_to_cpu(attr->nres.alloc_size);
1866 if (end > alloc_size)
1869 down_read(run_lock);
1873 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1875 CLST vcn_next = vcn;
1877 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) &&
1885 down_write(run_lock);
1887 err = attr_load_runs_vcn(ni, attr->type,
1889 attr->name_len, run, vcn);
1892 down_read(run_lock);
1897 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1910 if (lcn == SPARSE_LCN) {
1912 vbo = (u64)vcn << cluster_bits;
1916 flags = FIEMAP_EXTENT_MERGED;
1917 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1919 } else if (is_attr_compressed(attr)) {
1922 err = attr_is_frame_compressed(
1923 ni, attr, vcn >> attr->nres.c_unit, &clst_data);
1926 if (clst_data < NTFS_LZNT_CLUSTERS)
1927 flags |= FIEMAP_EXTENT_ENCODED;
1928 } else if (is_attr_encrypted(attr)) {
1929 flags |= FIEMAP_EXTENT_DATA_ENCRYPTED;
1932 vbo = (u64)vcn << cluster_bits;
1933 bytes = (u64)clen << cluster_bits;
1934 lbo = (u64)lcn << cluster_bits;
1938 if (vbo + bytes >= end) {
1940 flags |= FIEMAP_EXTENT_LAST;
1943 if (vbo + bytes <= valid) {
1945 } else if (vbo >= valid) {
1946 flags |= FIEMAP_EXTENT_UNWRITTEN;
1948 /* vbo < valid && valid < vbo + bytes */
1949 u64 dlen = valid - vbo;
1951 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, dlen,
1966 flags |= FIEMAP_EXTENT_UNWRITTEN;
1969 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, bytes, flags);
1989 * When decompressing, we typically obtain more than one page per reference.
1990 * We inject the additional pages into the page cache.
1992 int ni_readpage_cmpr(struct ntfs_inode *ni, struct page *page)
1995 struct ntfs_sb_info *sbi = ni->mi.sbi;
1996 struct address_space *mapping = page->mapping;
1997 pgoff_t index = page->index;
1998 u64 frame_vbo, vbo = (u64)index << PAGE_SHIFT;
1999 struct page **pages = NULL; /* Array of at most 16 pages. stack? */
2002 u32 i, idx, frame_size, pages_per_frame;
2006 if (vbo >= ni->vfs_inode.i_size) {
2007 SetPageUptodate(page);
2012 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2013 /* Xpress or LZX. */
2014 frame_bits = ni_ext_compress_bits(ni);
2016 /* LZNT compression. */
2017 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2019 frame_size = 1u << frame_bits;
2020 frame = vbo >> frame_bits;
2021 frame_vbo = (u64)frame << frame_bits;
2022 idx = (vbo - frame_vbo) >> PAGE_SHIFT;
2024 pages_per_frame = frame_size >> PAGE_SHIFT;
2025 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2032 index = frame_vbo >> PAGE_SHIFT;
2033 gfp_mask = mapping_gfp_mask(mapping);
2035 for (i = 0; i < pages_per_frame; i++, index++) {
2039 pg = find_or_create_page(mapping, index, gfp_mask);
2047 err = ni_read_frame(ni, frame_vbo, pages, pages_per_frame);
2053 for (i = 0; i < pages_per_frame; i++) {
2062 /* At this point, err contains 0 or -EIO depending on the "critical" page. */
2069 #ifdef CONFIG_NTFS3_LZX_XPRESS
2071 * ni_decompress_file - Decompress LZX/Xpress compressed file.
2073 * Remove ATTR_DATA::WofCompressedData.
2074 * Remove ATTR_REPARSE.
2076 int ni_decompress_file(struct ntfs_inode *ni)
2078 struct ntfs_sb_info *sbi = ni->mi.sbi;
2079 struct inode *inode = &ni->vfs_inode;
2080 loff_t i_size = inode->i_size;
2081 struct address_space *mapping = inode->i_mapping;
2082 gfp_t gfp_mask = mapping_gfp_mask(mapping);
2083 struct page **pages = NULL;
2084 struct ATTR_LIST_ENTRY *le;
2085 struct ATTRIB *attr;
2086 CLST vcn, cend, lcn, clen, end;
2090 u32 i, frame_size, pages_per_frame, bytes;
2091 struct mft_inode *mi;
2094 /* Clusters for decompressed data. */
2095 cend = bytes_to_cluster(sbi, i_size);
2100 /* Check in advance. */
2101 if (cend > wnd_zeroes(&sbi->used.bitmap)) {
2106 frame_bits = ni_ext_compress_bits(ni);
2107 frame_size = 1u << frame_bits;
2108 pages_per_frame = frame_size >> PAGE_SHIFT;
2109 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2116 * Step 1: Decompress data and copy to new allocated clusters.
2119 for (vbo = 0; vbo < i_size; vbo += bytes) {
2123 if (vbo + frame_size > i_size) {
2124 bytes = i_size - vbo;
2125 nr_pages = (bytes + PAGE_SIZE - 1) >> PAGE_SHIFT;
2127 nr_pages = pages_per_frame;
2131 end = bytes_to_cluster(sbi, vbo + bytes);
2133 for (vcn = vbo >> sbi->cluster_bits; vcn < end; vcn += clen) {
2134 err = attr_data_get_block(ni, vcn, cend - vcn, &lcn,
2140 for (i = 0; i < pages_per_frame; i++, index++) {
2143 pg = find_or_create_page(mapping, index, gfp_mask);
2146 unlock_page(pages[i]);
2155 err = ni_read_frame(ni, vbo, pages, pages_per_frame);
2158 down_read(&ni->file.run_lock);
2159 err = ntfs_bio_pages(sbi, &ni->file.run, pages,
2160 nr_pages, vbo, bytes,
2162 up_read(&ni->file.run_lock);
2165 for (i = 0; i < pages_per_frame; i++) {
2166 unlock_page(pages[i]);
2178 * Step 2: Deallocate attributes ATTR_DATA::WofCompressedData
2183 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
2187 if (attr->type == ATTR_REPARSE) {
2190 mi_get_ref(&ni->mi, &ref);
2191 ntfs_remove_reparse(sbi, 0, &ref);
2197 if (attr->type != ATTR_REPARSE &&
2198 (attr->type != ATTR_DATA ||
2199 attr->name_len != ARRAY_SIZE(WOF_NAME) ||
2200 memcmp(attr_name(attr), WOF_NAME, sizeof(WOF_NAME))))
2203 svcn = le64_to_cpu(attr->nres.svcn);
2204 evcn = le64_to_cpu(attr->nres.evcn);
2206 if (evcn + 1 <= svcn)
2209 asize = le32_to_cpu(attr->size);
2210 roff = le16_to_cpu(attr->nres.run_off);
2212 /*run==1 Means unpack and deallocate. */
2213 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
2214 Add2Ptr(attr, roff), asize - roff);
2218 * Step 3: Remove attribute ATTR_DATA::WofCompressedData.
2220 err = ni_remove_attr(ni, ATTR_DATA, WOF_NAME, ARRAY_SIZE(WOF_NAME),
2226 * Step 4: Remove ATTR_REPARSE.
2228 err = ni_remove_attr(ni, ATTR_REPARSE, NULL, 0, false, NULL);
2233 * Step 5: Remove sparse flag from data attribute.
2235 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
2241 if (attr->non_res && is_attr_sparsed(attr)) {
2242 /* Sparsed attribute header is 8 bytes bigger than normal. */
2243 struct MFT_REC *rec = mi->mrec;
2244 u32 used = le32_to_cpu(rec->used);
2245 u32 asize = le32_to_cpu(attr->size);
2246 u16 roff = le16_to_cpu(attr->nres.run_off);
2247 char *rbuf = Add2Ptr(attr, roff);
2249 memmove(rbuf - 8, rbuf, used - PtrOffset(rec, rbuf));
2250 attr->size = cpu_to_le32(asize - 8);
2251 attr->flags &= ~ATTR_FLAG_SPARSED;
2252 attr->nres.run_off = cpu_to_le16(roff - 8);
2253 attr->nres.c_unit = 0;
2254 rec->used = cpu_to_le32(used - 8);
2256 ni->std_fa &= ~(FILE_ATTRIBUTE_SPARSE_FILE |
2257 FILE_ATTRIBUTE_REPARSE_POINT);
2259 mark_inode_dirty(inode);
2262 /* Clear cached flag. */
2263 ni->ni_flags &= ~NI_FLAG_COMPRESSED_MASK;
2264 if (ni->file.offs_page) {
2265 put_page(ni->file.offs_page);
2266 ni->file.offs_page = NULL;
2268 mapping->a_ops = &ntfs_aops;
2273 make_bad_inode(inode);
2274 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
2281 * decompress_lzx_xpress - External compression LZX/Xpress.
2283 static int decompress_lzx_xpress(struct ntfs_sb_info *sbi, const char *cmpr,
2284 size_t cmpr_size, void *unc, size_t unc_size,
2290 if (cmpr_size == unc_size) {
2291 /* Frame not compressed. */
2292 memcpy(unc, cmpr, unc_size);
2297 if (frame_size == 0x8000) {
2298 mutex_lock(&sbi->compress.mtx_lzx);
2299 /* LZX: Frame compressed. */
2300 ctx = sbi->compress.lzx;
2302 /* Lazy initialize LZX decompress context. */
2303 ctx = lzx_allocate_decompressor();
2309 sbi->compress.lzx = ctx;
2312 if (lzx_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2313 /* Treat all errors as "invalid argument". */
2317 mutex_unlock(&sbi->compress.mtx_lzx);
2319 /* XPRESS: Frame compressed. */
2320 mutex_lock(&sbi->compress.mtx_xpress);
2321 ctx = sbi->compress.xpress;
2323 /* Lazy initialize Xpress decompress context. */
2324 ctx = xpress_allocate_decompressor();
2330 sbi->compress.xpress = ctx;
2333 if (xpress_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2334 /* Treat all errors as "invalid argument". */
2338 mutex_unlock(&sbi->compress.mtx_xpress);
2347 * Pages - Array of locked pages.
2349 int ni_read_frame(struct ntfs_inode *ni, u64 frame_vbo, struct page **pages,
2350 u32 pages_per_frame)
2353 struct ntfs_sb_info *sbi = ni->mi.sbi;
2354 u8 cluster_bits = sbi->cluster_bits;
2355 char *frame_ondisk = NULL;
2356 char *frame_mem = NULL;
2357 struct page **pages_disk = NULL;
2358 struct ATTR_LIST_ENTRY *le = NULL;
2359 struct runs_tree *run = &ni->file.run;
2360 u64 valid_size = ni->i_valid;
2363 u32 frame_size, i, npages_disk, ondisk_size;
2365 struct ATTRIB *attr;
2366 CLST frame, clst_data;
2369 * To simplify decompress algorithm do vmap for source
2372 for (i = 0; i < pages_per_frame; i++)
2375 frame_size = pages_per_frame << PAGE_SHIFT;
2376 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL);
2382 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, NULL);
2388 if (!attr->non_res) {
2389 u32 data_size = le32_to_cpu(attr->res.data_size);
2391 memset(frame_mem, 0, frame_size);
2392 if (frame_vbo < data_size) {
2393 ondisk_size = data_size - frame_vbo;
2394 memcpy(frame_mem, resident_data(attr) + frame_vbo,
2395 min(ondisk_size, frame_size));
2401 if (frame_vbo >= valid_size) {
2402 memset(frame_mem, 0, frame_size);
2407 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2408 #ifndef CONFIG_NTFS3_LZX_XPRESS
2412 u32 frame_bits = ni_ext_compress_bits(ni);
2413 u64 frame64 = frame_vbo >> frame_bits;
2414 u64 frames, vbo_data;
2416 if (frame_size != (1u << frame_bits)) {
2420 switch (frame_size) {
2427 /* Unknown compression. */
2432 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, WOF_NAME,
2433 ARRAY_SIZE(WOF_NAME), NULL, NULL);
2437 "external compressed file should contains data attribute \"WofCompressedData\"");
2442 if (!attr->non_res) {
2452 frames = (ni->vfs_inode.i_size - 1) >> frame_bits;
2454 err = attr_wof_frame_info(ni, attr, run, frame64, frames,
2455 frame_bits, &ondisk_size, &vbo_data);
2459 if (frame64 == frames) {
2460 unc_size = 1 + ((ni->vfs_inode.i_size - 1) &
2462 ondisk_size = attr_size(attr) - vbo_data;
2464 unc_size = frame_size;
2467 if (ondisk_size > frame_size) {
2472 if (!attr->non_res) {
2473 if (vbo_data + ondisk_size >
2474 le32_to_cpu(attr->res.data_size)) {
2479 err = decompress_lzx_xpress(
2480 sbi, Add2Ptr(resident_data(attr), vbo_data),
2481 ondisk_size, frame_mem, unc_size, frame_size);
2484 vbo_disk = vbo_data;
2485 /* Load all runs to read [vbo_disk-vbo_to). */
2486 err = attr_load_runs_range(ni, ATTR_DATA, WOF_NAME,
2487 ARRAY_SIZE(WOF_NAME), run, vbo_disk,
2488 vbo_data + ondisk_size);
2491 npages_disk = (ondisk_size + (vbo_disk & (PAGE_SIZE - 1)) +
2495 } else if (is_attr_compressed(attr)) {
2496 /* LZNT compression. */
2497 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2502 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2507 down_write(&ni->file.run_lock);
2508 run_truncate_around(run, le64_to_cpu(attr->nres.svcn));
2509 frame = frame_vbo >> (cluster_bits + NTFS_LZNT_CUNIT);
2510 err = attr_is_frame_compressed(ni, attr, frame, &clst_data);
2511 up_write(&ni->file.run_lock);
2516 memset(frame_mem, 0, frame_size);
2520 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2521 ondisk_size = clst_data << cluster_bits;
2523 if (clst_data >= NTFS_LZNT_CLUSTERS) {
2524 /* Frame is not compressed. */
2525 down_read(&ni->file.run_lock);
2526 err = ntfs_bio_pages(sbi, run, pages, pages_per_frame,
2527 frame_vbo, ondisk_size,
2529 up_read(&ni->file.run_lock);
2532 vbo_disk = frame_vbo;
2533 npages_disk = (ondisk_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
2535 __builtin_unreachable();
2540 pages_disk = kzalloc(npages_disk * sizeof(struct page *), GFP_NOFS);
2546 for (i = 0; i < npages_disk; i++) {
2547 pg = alloc_page(GFP_KERNEL);
2557 /* Read 'ondisk_size' bytes from disk. */
2558 down_read(&ni->file.run_lock);
2559 err = ntfs_bio_pages(sbi, run, pages_disk, npages_disk, vbo_disk,
2560 ondisk_size, REQ_OP_READ);
2561 up_read(&ni->file.run_lock);
2566 * To simplify decompress algorithm do vmap for source and target pages.
2568 frame_ondisk = vmap(pages_disk, npages_disk, VM_MAP, PAGE_KERNEL_RO);
2569 if (!frame_ondisk) {
2574 /* Decompress: Frame_ondisk -> frame_mem. */
2575 #ifdef CONFIG_NTFS3_LZX_XPRESS
2576 if (run != &ni->file.run) {
2578 err = decompress_lzx_xpress(
2579 sbi, frame_ondisk + (vbo_disk & (PAGE_SIZE - 1)),
2580 ondisk_size, frame_mem, unc_size, frame_size);
2584 /* LZNT - Native NTFS compression. */
2585 unc_size = decompress_lznt(frame_ondisk, ondisk_size, frame_mem,
2587 if ((ssize_t)unc_size < 0)
2589 else if (!unc_size || unc_size > frame_size)
2592 if (!err && valid_size < frame_vbo + frame_size) {
2593 size_t ok = valid_size - frame_vbo;
2595 memset(frame_mem + ok, 0, frame_size - ok);
2598 vunmap(frame_ondisk);
2601 for (i = 0; i < npages_disk; i++) {
2612 #ifdef CONFIG_NTFS3_LZX_XPRESS
2613 if (run != &ni->file.run)
2619 for (i = 0; i < pages_per_frame; i++) {
2623 SetPageUptodate(pg);
2632 * Pages - Array of locked pages.
2634 int ni_write_frame(struct ntfs_inode *ni, struct page **pages,
2635 u32 pages_per_frame)
2638 struct ntfs_sb_info *sbi = ni->mi.sbi;
2639 u8 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2640 u32 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2641 u64 frame_vbo = (u64)pages[0]->index << PAGE_SHIFT;
2642 CLST frame = frame_vbo >> frame_bits;
2643 char *frame_ondisk = NULL;
2644 struct page **pages_disk = NULL;
2645 struct ATTR_LIST_ENTRY *le = NULL;
2647 struct ATTRIB *attr;
2648 struct mft_inode *mi;
2651 size_t compr_size, ondisk_size;
2654 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, &mi);
2660 if (WARN_ON(!is_attr_compressed(attr))) {
2665 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2670 if (!attr->non_res) {
2671 down_write(&ni->file.run_lock);
2672 err = attr_make_nonresident(ni, attr, le, mi,
2673 le32_to_cpu(attr->res.data_size),
2674 &ni->file.run, &attr, pages[0]);
2675 up_write(&ni->file.run_lock);
2680 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2685 pages_disk = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2691 for (i = 0; i < pages_per_frame; i++) {
2692 pg = alloc_page(GFP_KERNEL);
2702 /* To simplify compress algorithm do vmap for source and target pages. */
2703 frame_ondisk = vmap(pages_disk, pages_per_frame, VM_MAP, PAGE_KERNEL);
2704 if (!frame_ondisk) {
2709 for (i = 0; i < pages_per_frame; i++)
2712 /* Map in-memory frame for read-only. */
2713 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL_RO);
2719 mutex_lock(&sbi->compress.mtx_lznt);
2721 if (!sbi->compress.lznt) {
2723 * LZNT implements two levels of compression:
2724 * 0 - Standard compression
2725 * 1 - Best compression, requires a lot of cpu
2728 lznt = get_lznt_ctx(0);
2730 mutex_unlock(&sbi->compress.mtx_lznt);
2735 sbi->compress.lznt = lznt;
2739 /* Compress: frame_mem -> frame_ondisk */
2740 compr_size = compress_lznt(frame_mem, frame_size, frame_ondisk,
2741 frame_size, sbi->compress.lznt);
2742 mutex_unlock(&sbi->compress.mtx_lznt);
2745 if (compr_size + sbi->cluster_size > frame_size) {
2746 /* Frame is not compressed. */
2747 compr_size = frame_size;
2748 ondisk_size = frame_size;
2749 } else if (compr_size) {
2750 /* Frame is compressed. */
2751 ondisk_size = ntfs_up_cluster(sbi, compr_size);
2752 memset(frame_ondisk + compr_size, 0, ondisk_size - compr_size);
2754 /* Frame is sparsed. */
2758 down_write(&ni->file.run_lock);
2759 run_truncate_around(&ni->file.run, le64_to_cpu(attr->nres.svcn));
2760 err = attr_allocate_frame(ni, frame, compr_size, ni->i_valid);
2761 up_write(&ni->file.run_lock);
2768 down_read(&ni->file.run_lock);
2769 err = ntfs_bio_pages(sbi, &ni->file.run,
2770 ondisk_size < frame_size ? pages_disk : pages,
2771 pages_per_frame, frame_vbo, ondisk_size,
2773 up_read(&ni->file.run_lock);
2779 for (i = 0; i < pages_per_frame; i++)
2782 vunmap(frame_ondisk);
2784 for (i = 0; i < pages_per_frame; i++) {
2798 * ni_remove_name - Removes name 'de' from MFT and from directory.
2799 * 'de2' and 'undo_step' are used to restore MFT/dir, if error occurs.
2801 int ni_remove_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2802 struct NTFS_DE *de, struct NTFS_DE **de2, int *undo_step)
2805 struct ntfs_sb_info *sbi = ni->mi.sbi;
2806 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2807 struct ATTR_FILE_NAME *fname;
2808 struct ATTR_LIST_ENTRY *le;
2809 struct mft_inode *mi;
2810 u16 de_key_size = le16_to_cpu(de->key_size);
2815 /* Find name in record. */
2816 mi_get_ref(&dir_ni->mi, &de_name->home);
2818 fname = ni_fname_name(ni, (struct cpu_str *)&de_name->name_len,
2819 &de_name->home, &mi, &le);
2823 memcpy(&de_name->dup, &fname->dup, sizeof(struct NTFS_DUP_INFO));
2824 name_type = paired_name(fname->type);
2826 /* Mark ntfs as dirty. It will be cleared at umount. */
2827 ntfs_set_state(sbi, NTFS_DIRTY_DIRTY);
2829 /* Step 1: Remove name from directory. */
2830 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname, de_key_size, sbi);
2834 /* Step 2: Remove name from MFT. */
2835 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2839 /* Get paired name. */
2840 fname = ni_fname_type(ni, name_type, &mi, &le);
2842 u16 de2_key_size = fname_full_size(fname);
2844 *de2 = Add2Ptr(de, 1024);
2845 (*de2)->key_size = cpu_to_le16(de2_key_size);
2847 memcpy(*de2 + 1, fname, de2_key_size);
2849 /* Step 3: Remove paired name from directory. */
2850 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname,
2855 /* Step 4: Remove paired name from MFT. */
2856 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2864 * ni_remove_name_undo - Paired function for ni_remove_name.
2866 * Return: True if ok
2868 bool ni_remove_name_undo(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2869 struct NTFS_DE *de, struct NTFS_DE *de2, int undo_step)
2871 struct ntfs_sb_info *sbi = ni->mi.sbi;
2872 struct ATTRIB *attr;
2873 u16 de_key_size = de2 ? le16_to_cpu(de2->key_size) : 0;
2875 switch (undo_step) {
2877 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2878 &attr, NULL, NULL)) {
2881 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de2 + 1, de_key_size);
2883 mi_get_ref(&ni->mi, &de2->ref);
2884 de2->size = cpu_to_le16(ALIGN(de_key_size, 8) +
2885 sizeof(struct NTFS_DE));
2889 if (indx_insert_entry(&dir_ni->dir, dir_ni, de2, sbi, NULL,
2896 de_key_size = le16_to_cpu(de->key_size);
2898 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2899 &attr, NULL, NULL)) {
2903 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de + 1, de_key_size);
2904 mi_get_ref(&ni->mi, &de->ref);
2906 if (indx_insert_entry(&dir_ni->dir, dir_ni, de, sbi, NULL, 1))
2914 * ni_add_name - Add new name in MFT and in directory.
2916 int ni_add_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2920 struct ATTRIB *attr;
2921 struct ATTR_LIST_ENTRY *le;
2922 struct mft_inode *mi;
2923 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2924 u16 de_key_size = le16_to_cpu(de->key_size);
2926 mi_get_ref(&ni->mi, &de->ref);
2927 mi_get_ref(&dir_ni->mi, &de_name->home);
2929 /* Insert new name in MFT. */
2930 err = ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0, &attr,
2935 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de_name, de_key_size);
2937 /* Insert new name in directory. */
2938 err = indx_insert_entry(&dir_ni->dir, dir_ni, de, ni->mi.sbi, NULL, 0);
2940 ni_remove_attr_le(ni, attr, mi, le);
2946 * ni_rename - Remove one name and insert new name.
2948 int ni_rename(struct ntfs_inode *dir_ni, struct ntfs_inode *new_dir_ni,
2949 struct ntfs_inode *ni, struct NTFS_DE *de, struct NTFS_DE *new_de,
2953 struct NTFS_DE *de2 = NULL;
2957 * There are two possible ways to rename:
2958 * 1) Add new name and remove old name.
2959 * 2) Remove old name and add new name.
2961 * In most cases (not all!) adding new name in MFT and in directory can
2962 * allocate additional cluster(s).
2963 * Second way may result to bad inode if we can't add new name
2964 * and then can't restore (add) old name.
2968 * Way 1 - Add new + remove old.
2970 err = ni_add_name(new_dir_ni, ni, new_de);
2972 err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
2973 if (err && ni_remove_name(new_dir_ni, ni, new_de, &de2, &undo))
2978 * Way 2 - Remove old + add new.
2981 * err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
2983 * err = ni_add_name(new_dir_ni, ni, new_de);
2984 * if (err && !ni_remove_name_undo(dir_ni, ni, de, de2, undo))
2993 * ni_is_dirty - Return: True if 'ni' requires ni_write_inode.
2995 bool ni_is_dirty(struct inode *inode)
2997 struct ntfs_inode *ni = ntfs_i(inode);
2998 struct rb_node *node;
3000 if (ni->mi.dirty || ni->attr_list.dirty ||
3001 (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3004 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
3005 if (rb_entry(node, struct mft_inode, node)->dirty)
3015 * Update duplicate info of ATTR_FILE_NAME in MFT and in parent directories.
3017 static bool ni_update_parent(struct ntfs_inode *ni, struct NTFS_DUP_INFO *dup,
3020 struct ATTRIB *attr;
3021 struct mft_inode *mi;
3022 struct ATTR_LIST_ENTRY *le = NULL;
3023 struct ntfs_sb_info *sbi = ni->mi.sbi;
3024 struct super_block *sb = sbi->sb;
3025 bool re_dirty = false;
3027 if (ni->mi.mrec->flags & RECORD_FLAG_DIR) {
3028 dup->fa |= FILE_ATTRIBUTE_DIRECTORY;
3030 dup->alloc_size = 0;
3033 dup->fa &= ~FILE_ATTRIBUTE_DIRECTORY;
3035 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL,
3038 dup->alloc_size = dup->data_size = 0;
3039 } else if (!attr->non_res) {
3040 u32 data_size = le32_to_cpu(attr->res.data_size);
3042 dup->alloc_size = cpu_to_le64(ALIGN(data_size, 8));
3043 dup->data_size = cpu_to_le64(data_size);
3045 u64 new_valid = ni->i_valid;
3046 u64 data_size = le64_to_cpu(attr->nres.data_size);
3049 dup->alloc_size = is_attr_ext(attr)
3050 ? attr->nres.total_size
3051 : attr->nres.alloc_size;
3052 dup->data_size = attr->nres.data_size;
3054 if (new_valid > data_size)
3055 new_valid = data_size;
3057 valid_le = cpu_to_le64(new_valid);
3058 if (valid_le != attr->nres.valid_size) {
3059 attr->nres.valid_size = valid_le;
3065 /* TODO: Fill reparse info. */
3069 if (ni->ni_flags & NI_FLAG_EA) {
3070 attr = ni_find_attr(ni, attr, &le, ATTR_EA_INFO, NULL, 0, NULL,
3073 const struct EA_INFO *info;
3075 info = resident_data_ex(attr, sizeof(struct EA_INFO));
3076 dup->ea_size = info->size_pack;
3083 while ((attr = ni_find_attr(ni, attr, &le, ATTR_NAME, NULL, 0, NULL,
3086 struct ATTR_FILE_NAME *fname;
3088 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
3089 if (!fname || !memcmp(&fname->dup, dup, sizeof(fname->dup)))
3092 /* ntfs_iget5 may sleep. */
3093 dir = ntfs_iget5(sb, &fname->home, NULL);
3097 "failed to open parent directory r=%lx to update",
3098 (long)ino_get(&fname->home));
3102 if (!is_bad_inode(dir)) {
3103 struct ntfs_inode *dir_ni = ntfs_i(dir);
3105 if (!ni_trylock(dir_ni)) {
3108 indx_update_dup(dir_ni, sbi, fname, dup, sync);
3110 memcpy(&fname->dup, dup, sizeof(fname->dup));
3121 * ni_write_inode - Write MFT base record and all subrecords to disk.
3123 int ni_write_inode(struct inode *inode, int sync, const char *hint)
3126 struct ntfs_inode *ni = ntfs_i(inode);
3127 struct super_block *sb = inode->i_sb;
3128 struct ntfs_sb_info *sbi = sb->s_fs_info;
3129 bool re_dirty = false;
3130 struct ATTR_STD_INFO *std;
3131 struct rb_node *node, *next;
3132 struct NTFS_DUP_INFO dup;
3134 if (is_bad_inode(inode) || sb_rdonly(sb))
3137 if (!ni_trylock(ni)) {
3138 /* 'ni' is under modification, skip for now. */
3139 mark_inode_dirty_sync(inode);
3143 if (is_rec_inuse(ni->mi.mrec) &&
3144 !(sbi->flags & NTFS_FLAGS_LOG_REPLAYING) && inode->i_nlink) {
3145 bool modified = false;
3147 /* Update times in standard attribute. */
3154 /* Update the access times if they have changed. */
3155 dup.m_time = kernel2nt(&inode->i_mtime);
3156 if (std->m_time != dup.m_time) {
3157 std->m_time = dup.m_time;
3161 dup.c_time = kernel2nt(&inode->i_ctime);
3162 if (std->c_time != dup.c_time) {
3163 std->c_time = dup.c_time;
3167 dup.a_time = kernel2nt(&inode->i_atime);
3168 if (std->a_time != dup.a_time) {
3169 std->a_time = dup.a_time;
3173 dup.fa = ni->std_fa;
3174 if (std->fa != dup.fa) {
3180 ni->mi.dirty = true;
3182 if (!ntfs_is_meta_file(sbi, inode->i_ino) &&
3183 (modified || (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3184 /* Avoid __wait_on_freeing_inode(inode). */
3185 && (sb->s_flags & SB_ACTIVE)) {
3186 dup.cr_time = std->cr_time;
3187 /* Not critical if this function fail. */
3188 re_dirty = ni_update_parent(ni, &dup, sync);
3191 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
3193 ni->ni_flags &= ~NI_FLAG_UPDATE_PARENT;
3196 /* Update attribute list. */
3197 if (ni->attr_list.size && ni->attr_list.dirty) {
3198 if (inode->i_ino != MFT_REC_MFT || sync) {
3199 err = ni_try_remove_attr_list(ni);
3204 err = al_update(ni);
3210 for (node = rb_first(&ni->mi_tree); node; node = next) {
3211 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
3214 next = rb_next(node);
3219 is_empty = !mi_enum_attr(mi, NULL);
3222 clear_rec_inuse(mi->mrec);
3224 err2 = mi_write(mi, sync);
3229 ntfs_mark_rec_free(sbi, mi->rno);
3230 rb_erase(node, &ni->mi_tree);
3236 err2 = mi_write(&ni->mi, sync);
3244 ntfs_err(sb, "%s r=%lx failed, %d.", hint, inode->i_ino, err);
3245 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
3250 mark_inode_dirty_sync(inode);