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 && ni->mi.mrec && 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);
571 if (roff > le32_to_cpu(attr->size)) {
576 err = run_unpack(&run, sbi, ni->mi.rno, svcn, evcn, svcn,
578 le32_to_cpu(attr->size) - roff);
593 * Run contains data from two records: mi_p and mi
594 * Try to pack in one.
596 err = mi_pack_runs(mi_p, attr_p, &run, evcn + 1 - svcn_p);
600 next_svcn = le64_to_cpu(attr_p->nres.evcn) + 1;
602 if (next_svcn >= evcn + 1) {
603 /* We can remove this attribute segment. */
604 al_remove_le(ni, le);
605 mi_remove_attr(NULL, mi, attr);
610 attr->nres.svcn = le->vcn = cpu_to_le64(next_svcn);
612 ni->attr_list.dirty = true;
614 if (evcn + 1 == alloc) {
615 err = mi_pack_runs(mi, attr, &run,
616 evcn + 1 - next_svcn);
626 run_truncate_head(&run, next_svcn);
631 ntfs_inode_warn(&ni->vfs_inode, "repack problem");
632 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
634 /* Pack loaded but not packed runs. */
636 mi_pack_runs(mi_p, attr_p, &run, evcn_p + 1 - svcn_p);
644 * ni_try_remove_attr_list
646 * Can we remove attribute list?
647 * Check the case when primary record contains enough space for all attributes.
649 static int ni_try_remove_attr_list(struct ntfs_inode *ni)
652 struct ntfs_sb_info *sbi = ni->mi.sbi;
653 struct ATTRIB *attr, *attr_list, *attr_ins;
654 struct ATTR_LIST_ENTRY *le;
655 struct mft_inode *mi;
660 if (!ni->attr_list.dirty)
667 attr_list = mi_find_attr(&ni->mi, NULL, ATTR_LIST, NULL, 0, NULL);
671 asize = le32_to_cpu(attr_list->size);
673 /* Free space in primary record without attribute list. */
674 free = sbi->record_size - le32_to_cpu(ni->mi.mrec->used) + asize;
675 mi_get_ref(&ni->mi, &ref);
678 while ((le = al_enumerate(ni, le))) {
679 if (!memcmp(&le->ref, &ref, sizeof(ref)))
685 mi = ni_find_mi(ni, ino_get(&le->ref));
689 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
690 le->name_len, &le->id);
694 asize = le32_to_cpu(attr->size);
701 /* It seems that attribute list can be removed from primary record. */
702 mi_remove_attr(NULL, &ni->mi, attr_list);
705 * Repeat the cycle above and move all attributes to primary record.
706 * It should be success!
709 while ((le = al_enumerate(ni, le))) {
710 if (!memcmp(&le->ref, &ref, sizeof(ref)))
713 mi = ni_find_mi(ni, ino_get(&le->ref));
715 /* Should never happened, 'cause already checked. */
719 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
720 le->name_len, &le->id);
722 /* Should never happened, 'cause already checked. */
725 asize = le32_to_cpu(attr->size);
727 /* Insert into primary record. */
728 attr_ins = mi_insert_attr(&ni->mi, le->type, le_name(le),
730 le16_to_cpu(attr->name_off));
734 * Either no space in primary record (already checked).
735 * Either tried to insert another
736 * non indexed attribute (logic error).
741 /* Copy all except id. */
743 memcpy(attr_ins, attr, asize);
746 /* Remove from original record. */
747 mi_remove_attr(NULL, mi, attr);
750 run_deallocate(sbi, &ni->attr_list.run, true);
751 run_close(&ni->attr_list.run);
752 ni->attr_list.size = 0;
753 kfree(ni->attr_list.le);
754 ni->attr_list.le = NULL;
755 ni->attr_list.dirty = false;
759 ntfs_inode_err(&ni->vfs_inode, "Internal error");
760 make_bad_inode(&ni->vfs_inode);
765 * ni_create_attr_list - Generates an attribute list for this primary record.
767 int ni_create_attr_list(struct ntfs_inode *ni)
769 struct ntfs_sb_info *sbi = ni->mi.sbi;
773 struct ATTRIB *arr_move[7];
774 struct ATTR_LIST_ENTRY *le, *le_b[7];
778 struct mft_inode *mi;
779 u32 free_b, nb, to_free, rs;
782 is_mft = ni->mi.rno == MFT_REC_MFT;
784 rs = sbi->record_size;
787 * Skip estimating exact memory requirement.
788 * Looks like one record_size is always enough.
790 le = kmalloc(al_aligned(rs), GFP_NOFS);
796 mi_get_ref(&ni->mi, &le->ref);
797 ni->attr_list.le = le;
804 for (; (attr = mi_enum_attr(&ni->mi, attr)); le = Add2Ptr(le, sz)) {
805 sz = le_size(attr->name_len);
806 le->type = attr->type;
807 le->size = cpu_to_le16(sz);
808 le->name_len = attr->name_len;
809 le->name_off = offsetof(struct ATTR_LIST_ENTRY, name);
811 if (le != ni->attr_list.le)
812 le->ref = ni->attr_list.le->ref;
816 memcpy(le->name, attr_name(attr),
817 sizeof(short) * attr->name_len);
818 else if (attr->type == ATTR_STD)
820 else if (attr->type == ATTR_LIST)
822 else if (is_mft && attr->type == ATTR_DATA)
825 if (!nb || nb < ARRAY_SIZE(arr_move)) {
827 arr_move[nb++] = attr;
828 free_b += le32_to_cpu(attr->size);
832 lsize = PtrOffset(ni->attr_list.le, le);
833 ni->attr_list.size = lsize;
835 to_free = le32_to_cpu(rec->used) + lsize + SIZEOF_RESIDENT;
841 if (to_free > free_b) {
847 /* Allocate child MFT. */
848 err = ntfs_look_free_mft(sbi, &rno, is_mft, ni, &mi);
853 /* Call mi_remove_attr() in reverse order to keep pointers 'arr_move' valid. */
854 while (to_free > 0) {
855 struct ATTRIB *b = arr_move[--nb];
856 u32 asize = le32_to_cpu(b->size);
857 u16 name_off = le16_to_cpu(b->name_off);
859 attr = mi_insert_attr(mi, b->type, Add2Ptr(b, name_off),
860 b->name_len, asize, name_off);
864 mi_get_ref(mi, &le_b[nb]->ref);
865 le_b[nb]->id = attr->id;
867 /* Copy all except id. */
868 memcpy(attr, b, asize);
869 attr->id = le_b[nb]->id;
871 /* Remove from primary record. */
872 if (!mi_remove_attr(NULL, &ni->mi, b))
875 if (to_free <= asize)
882 attr = mi_insert_attr(&ni->mi, ATTR_LIST, NULL, 0,
883 lsize + SIZEOF_RESIDENT, SIZEOF_RESIDENT);
889 attr->res.data_size = cpu_to_le32(lsize);
890 attr->res.data_off = SIZEOF_RESIDENT_LE;
894 memcpy(resident_data_ex(attr, lsize), ni->attr_list.le, lsize);
896 ni->attr_list.dirty = false;
898 mark_inode_dirty(&ni->vfs_inode);
902 kfree(ni->attr_list.le);
903 ni->attr_list.le = NULL;
904 ni->attr_list.size = 0;
912 * ni_ins_attr_ext - Add an external attribute to the ntfs_inode.
914 static int ni_ins_attr_ext(struct ntfs_inode *ni, struct ATTR_LIST_ENTRY *le,
915 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
916 u32 asize, CLST svcn, u16 name_off, bool force_ext,
917 struct ATTRIB **ins_attr, struct mft_inode **ins_mi,
918 struct ATTR_LIST_ENTRY **ins_le)
921 struct mft_inode *mi;
924 struct rb_node *node;
926 bool is_mft, is_mft_data;
927 struct ntfs_sb_info *sbi = ni->mi.sbi;
929 is_mft = ni->mi.rno == MFT_REC_MFT;
930 is_mft_data = is_mft && type == ATTR_DATA && !name_len;
932 if (asize > sbi->max_bytes_per_attr) {
938 * Standard information and attr_list cannot be made external.
939 * The Log File cannot have any external attributes.
941 if (type == ATTR_STD || type == ATTR_LIST ||
942 ni->mi.rno == MFT_REC_LOG) {
947 /* Create attribute list if it is not already existed. */
948 if (!ni->attr_list.size) {
949 err = ni_create_attr_list(ni);
954 vbo = is_mft_data ? ((u64)svcn << sbi->cluster_bits) : 0;
959 /* Load all subrecords into memory. */
960 err = ni_load_all_mi(ni);
964 /* Check each of loaded subrecord. */
965 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
966 mi = rb_entry(node, struct mft_inode, node);
969 (mi_enum_attr(mi, NULL) ||
970 vbo <= ((u64)mi->rno << sbi->record_bits))) {
971 /* We can't accept this record 'cause MFT's bootstrapping. */
975 mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0, NULL)) {
977 * This child record already has a ATTR_DATA.
978 * So it can't accept any other records.
983 if ((type != ATTR_NAME || name_len) &&
984 mi_find_attr(mi, NULL, type, name, name_len, NULL)) {
985 /* Only indexed attributes can share same record. */
990 * Do not try to insert this attribute
991 * if there is no room in record.
993 if (le32_to_cpu(mi->mrec->used) + asize > sbi->record_size)
996 /* Try to insert attribute into this subrecord. */
997 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
998 name_off, svcn, ins_le);
1010 /* We have to allocate a new child subrecord. */
1011 err = ntfs_look_free_mft(sbi, &rno, is_mft_data, ni, &mi);
1015 if (is_mft_data && vbo <= ((u64)rno << sbi->record_bits)) {
1020 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
1021 name_off, svcn, ins_le);
1033 ni_remove_mi(ni, mi);
1038 ntfs_mark_rec_free(sbi, rno);
1045 * ni_insert_attr - Insert an attribute into the file.
1047 * If the primary record has room, it will just insert the attribute.
1048 * If not, it may make the attribute external.
1049 * For $MFT::Data it may make room for the attribute by
1050 * making other attributes external.
1053 * The ATTR_LIST and ATTR_STD cannot be made external.
1054 * This function does not fill new attribute full.
1055 * It only fills 'size'/'type'/'id'/'name_len' fields.
1057 static int ni_insert_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
1058 const __le16 *name, u8 name_len, u32 asize,
1059 u16 name_off, CLST svcn, struct ATTRIB **ins_attr,
1060 struct mft_inode **ins_mi,
1061 struct ATTR_LIST_ENTRY **ins_le)
1063 struct ntfs_sb_info *sbi = ni->mi.sbi;
1065 struct ATTRIB *attr, *eattr;
1066 struct MFT_REC *rec;
1068 struct ATTR_LIST_ENTRY *le;
1069 u32 list_reserve, max_free, free, used, t32;
1073 is_mft = ni->mi.rno == MFT_REC_MFT;
1076 list_reserve = SIZEOF_NONRESIDENT + 3 * (1 + 2 * sizeof(u32));
1077 used = le32_to_cpu(rec->used);
1078 free = sbi->record_size - used;
1080 if (is_mft && type != ATTR_LIST) {
1081 /* Reserve space for the ATTRIB list. */
1082 if (free < list_reserve)
1085 free -= list_reserve;
1088 if (asize <= free) {
1089 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len,
1090 asize, name_off, svcn, ins_le);
1101 if (!is_mft || type != ATTR_DATA || svcn) {
1102 /* This ATTRIB will be external. */
1103 err = ni_ins_attr_ext(ni, NULL, type, name, name_len, asize,
1104 svcn, name_off, false, ins_attr, ins_mi,
1110 * Here we have: "is_mft && type == ATTR_DATA && !svcn"
1112 * The first chunk of the $MFT::Data ATTRIB must be the base record.
1113 * Evict as many other attributes as possible.
1117 /* Estimate the result of moving all possible attributes away. */
1120 while ((attr = mi_enum_attr(&ni->mi, attr))) {
1121 if (attr->type == ATTR_STD)
1123 if (attr->type == ATTR_LIST)
1125 max_free += le32_to_cpu(attr->size);
1128 if (max_free < asize + list_reserve) {
1129 /* Impossible to insert this attribute into primary record. */
1134 /* Start real attribute moving. */
1138 attr = mi_enum_attr(&ni->mi, attr);
1140 /* We should never be here 'cause we have already check this case. */
1145 /* Skip attributes that MUST be primary record. */
1146 if (attr->type == ATTR_STD || attr->type == ATTR_LIST)
1150 if (ni->attr_list.size) {
1151 le = al_find_le(ni, NULL, attr);
1153 /* Really this is a serious bug. */
1159 t32 = le32_to_cpu(attr->size);
1160 t16 = le16_to_cpu(attr->name_off);
1161 err = ni_ins_attr_ext(ni, le, attr->type, Add2Ptr(attr, t16),
1162 attr->name_len, t32, attr_svcn(attr), t16,
1163 false, &eattr, NULL, NULL);
1168 memcpy(eattr, attr, t32);
1171 /* Remove from primary record. */
1172 mi_remove_attr(NULL, &ni->mi, attr);
1174 /* attr now points to next attribute. */
1175 if (attr->type == ATTR_END)
1178 while (asize + list_reserve > sbi->record_size - le32_to_cpu(rec->used))
1181 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len, asize,
1182 name_off, svcn, ins_le);
1197 /* ni_expand_mft_list - Split ATTR_DATA of $MFT. */
1198 static int ni_expand_mft_list(struct ntfs_inode *ni)
1201 struct runs_tree *run = &ni->file.run;
1202 u32 asize, run_size, done = 0;
1203 struct ATTRIB *attr;
1204 struct rb_node *node;
1205 CLST mft_min, mft_new, svcn, evcn, plen;
1206 struct mft_inode *mi, *mi_min, *mi_new;
1207 struct ntfs_sb_info *sbi = ni->mi.sbi;
1209 /* Find the nearest MFT. */
1214 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
1215 mi = rb_entry(node, struct mft_inode, node);
1217 attr = mi_enum_attr(mi, NULL);
1226 if (ntfs_look_free_mft(sbi, &mft_new, true, ni, &mi_new)) {
1228 /* Really this is not critical. */
1229 } else if (mft_min > mft_new) {
1233 ntfs_mark_rec_free(sbi, mft_new);
1235 ni_remove_mi(ni, mi_new);
1238 attr = mi_find_attr(&ni->mi, NULL, ATTR_DATA, NULL, 0, NULL);
1244 asize = le32_to_cpu(attr->size);
1246 evcn = le64_to_cpu(attr->nres.evcn);
1247 svcn = bytes_to_cluster(sbi, (u64)(mft_min + 1) << sbi->record_bits);
1248 if (evcn + 1 >= svcn) {
1254 * Split primary attribute [0 evcn] in two parts [0 svcn) + [svcn evcn].
1256 * Update first part of ATTR_DATA in 'primary MFT.
1258 err = run_pack(run, 0, svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1259 asize - SIZEOF_NONRESIDENT, &plen);
1263 run_size = ALIGN(err, 8);
1271 attr->nres.evcn = cpu_to_le64(svcn - 1);
1272 attr->size = cpu_to_le32(run_size + SIZEOF_NONRESIDENT);
1273 /* 'done' - How many bytes of primary MFT becomes free. */
1274 done = asize - run_size - SIZEOF_NONRESIDENT;
1275 le32_sub_cpu(&ni->mi.mrec->used, done);
1277 /* Estimate the size of second part: run_buf=NULL. */
1278 err = run_pack(run, svcn, evcn + 1 - svcn, NULL, sbi->record_size,
1283 run_size = ALIGN(err, 8);
1286 if (plen < evcn + 1 - svcn) {
1292 * This function may implicitly call expand attr_list.
1293 * Insert second part of ATTR_DATA in 'mi_min'.
1295 attr = ni_ins_new_attr(ni, mi_min, NULL, ATTR_DATA, NULL, 0,
1296 SIZEOF_NONRESIDENT + run_size,
1297 SIZEOF_NONRESIDENT, svcn, NULL);
1304 attr->name_off = SIZEOF_NONRESIDENT_LE;
1307 run_pack(run, svcn, evcn + 1 - svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1310 attr->nres.svcn = cpu_to_le64(svcn);
1311 attr->nres.evcn = cpu_to_le64(evcn);
1312 attr->nres.run_off = cpu_to_le16(SIZEOF_NONRESIDENT);
1316 ntfs_mark_rec_free(sbi, mft_new);
1317 ni_remove_mi(ni, mi_new);
1320 return !err && !done ? -EOPNOTSUPP : err;
1324 * ni_expand_list - Move all possible attributes out of primary record.
1326 int ni_expand_list(struct ntfs_inode *ni)
1329 u32 asize, done = 0;
1330 struct ATTRIB *attr, *ins_attr;
1331 struct ATTR_LIST_ENTRY *le;
1332 bool is_mft = ni->mi.rno == MFT_REC_MFT;
1335 mi_get_ref(&ni->mi, &ref);
1338 while ((le = al_enumerate(ni, le))) {
1339 if (le->type == ATTR_STD)
1342 if (memcmp(&ref, &le->ref, sizeof(struct MFT_REF)))
1345 if (is_mft && le->type == ATTR_DATA)
1348 /* Find attribute in primary record. */
1349 attr = rec_find_attr_le(&ni->mi, le);
1355 asize = le32_to_cpu(attr->size);
1357 /* Always insert into new record to avoid collisions (deep recursive). */
1358 err = ni_ins_attr_ext(ni, le, attr->type, attr_name(attr),
1359 attr->name_len, asize, attr_svcn(attr),
1360 le16_to_cpu(attr->name_off), true,
1361 &ins_attr, NULL, NULL);
1366 memcpy(ins_attr, attr, asize);
1367 ins_attr->id = le->id;
1368 /* Remove from primary record. */
1369 mi_remove_attr(NULL, &ni->mi, attr);
1376 err = -EFBIG; /* Attr list is too big(?) */
1380 /* Split MFT data as much as possible. */
1381 err = ni_expand_mft_list(ni);
1386 return !err && !done ? -EOPNOTSUPP : err;
1390 * ni_insert_nonresident - Insert new nonresident attribute.
1392 int ni_insert_nonresident(struct ntfs_inode *ni, enum ATTR_TYPE type,
1393 const __le16 *name, u8 name_len,
1394 const struct runs_tree *run, CLST svcn, CLST len,
1395 __le16 flags, struct ATTRIB **new_attr,
1396 struct mft_inode **mi)
1400 struct ATTRIB *attr;
1402 (flags & (ATTR_FLAG_SPARSED | ATTR_FLAG_COMPRESSED)) && !svcn;
1403 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1404 u32 name_off = is_ext ? SIZEOF_NONRESIDENT_EX : SIZEOF_NONRESIDENT;
1405 u32 run_off = name_off + name_size;
1406 u32 run_size, asize;
1407 struct ntfs_sb_info *sbi = ni->mi.sbi;
1409 err = run_pack(run, svcn, len, NULL, sbi->max_bytes_per_attr - run_off,
1414 run_size = ALIGN(err, 8);
1421 asize = run_off + run_size;
1423 if (asize > sbi->max_bytes_per_attr) {
1428 err = ni_insert_attr(ni, type, name, name_len, asize, name_off, svcn,
1435 attr->name_off = cpu_to_le16(name_off);
1436 attr->flags = flags;
1438 run_pack(run, svcn, len, Add2Ptr(attr, run_off), run_size, &plen);
1440 attr->nres.svcn = cpu_to_le64(svcn);
1441 attr->nres.evcn = cpu_to_le64((u64)svcn + len - 1);
1447 *(__le64 *)&attr->nres.run_off = cpu_to_le64(run_off);
1449 attr->nres.alloc_size =
1450 svcn ? 0 : cpu_to_le64((u64)len << ni->mi.sbi->cluster_bits);
1451 attr->nres.data_size = attr->nres.alloc_size;
1452 attr->nres.valid_size = attr->nres.alloc_size;
1455 if (flags & ATTR_FLAG_COMPRESSED)
1456 attr->nres.c_unit = COMPRESSION_UNIT;
1457 attr->nres.total_size = attr->nres.alloc_size;
1465 * ni_insert_resident - Inserts new resident attribute.
1467 int ni_insert_resident(struct ntfs_inode *ni, u32 data_size,
1468 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
1469 struct ATTRIB **new_attr, struct mft_inode **mi,
1470 struct ATTR_LIST_ENTRY **le)
1473 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1474 u32 asize = SIZEOF_RESIDENT + name_size + ALIGN(data_size, 8);
1475 struct ATTRIB *attr;
1477 err = ni_insert_attr(ni, type, name, name_len, asize, SIZEOF_RESIDENT,
1485 attr->res.data_size = cpu_to_le32(data_size);
1486 attr->res.data_off = cpu_to_le16(SIZEOF_RESIDENT + name_size);
1487 if (type == ATTR_NAME) {
1488 attr->res.flags = RESIDENT_FLAG_INDEXED;
1490 /* is_attr_indexed(attr)) == true */
1491 le16_add_cpu(&ni->mi.mrec->hard_links, 1);
1492 ni->mi.dirty = true;
1503 * ni_remove_attr_le - Remove attribute from record.
1505 void ni_remove_attr_le(struct ntfs_inode *ni, struct ATTRIB *attr,
1506 struct mft_inode *mi, struct ATTR_LIST_ENTRY *le)
1508 mi_remove_attr(ni, mi, attr);
1511 al_remove_le(ni, le);
1515 * ni_delete_all - Remove all attributes and frees allocates space.
1517 * ntfs_evict_inode->ntfs_clear_inode->ni_delete_all (if no links).
1519 int ni_delete_all(struct ntfs_inode *ni)
1522 struct ATTR_LIST_ENTRY *le = NULL;
1523 struct ATTRIB *attr = NULL;
1524 struct rb_node *node;
1528 struct ntfs_sb_info *sbi = ni->mi.sbi;
1529 bool nt3 = is_ntfs3(sbi);
1532 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
1533 if (!nt3 || attr->name_len) {
1535 } else if (attr->type == ATTR_REPARSE) {
1536 mi_get_ref(&ni->mi, &ref);
1537 ntfs_remove_reparse(sbi, 0, &ref);
1538 } else if (attr->type == ATTR_ID && !attr->non_res &&
1539 le32_to_cpu(attr->res.data_size) >=
1540 sizeof(struct GUID)) {
1541 ntfs_objid_remove(sbi, resident_data(attr));
1547 svcn = le64_to_cpu(attr->nres.svcn);
1548 evcn = le64_to_cpu(attr->nres.evcn);
1550 if (evcn + 1 <= svcn)
1553 asize = le32_to_cpu(attr->size);
1554 roff = le16_to_cpu(attr->nres.run_off);
1559 /* run==1 means unpack and deallocate. */
1560 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
1561 Add2Ptr(attr, roff), asize - roff);
1564 if (ni->attr_list.size) {
1565 run_deallocate(ni->mi.sbi, &ni->attr_list.run, true);
1569 /* Free all subrecords. */
1570 for (node = rb_first(&ni->mi_tree); node;) {
1571 struct rb_node *next = rb_next(node);
1572 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
1574 clear_rec_inuse(mi->mrec);
1578 ntfs_mark_rec_free(sbi, mi->rno);
1579 ni_remove_mi(ni, mi);
1584 /* Free base record. */
1585 clear_rec_inuse(ni->mi.mrec);
1586 ni->mi.dirty = true;
1587 err = mi_write(&ni->mi, 0);
1589 ntfs_mark_rec_free(sbi, ni->mi.rno);
1596 * Return: File name attribute by its value.
1598 struct ATTR_FILE_NAME *ni_fname_name(struct ntfs_inode *ni,
1599 const struct cpu_str *uni,
1600 const struct MFT_REF *home_dir,
1601 struct mft_inode **mi,
1602 struct ATTR_LIST_ENTRY **le)
1604 struct ATTRIB *attr = NULL;
1605 struct ATTR_FILE_NAME *fname;
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);
1619 if (home_dir && memcmp(home_dir, &fname->home, sizeof(*home_dir)))
1625 if (uni->len != fname->name_len)
1628 if (ntfs_cmp_names_cpu(uni, (struct le_str *)&fname->name_len, NULL,
1638 * Return: File name attribute with given type.
1640 struct ATTR_FILE_NAME *ni_fname_type(struct ntfs_inode *ni, u8 name_type,
1641 struct mft_inode **mi,
1642 struct ATTR_LIST_ENTRY **le)
1644 struct ATTRIB *attr = NULL;
1645 struct ATTR_FILE_NAME *fname;
1649 if (name_type == FILE_NAME_POSIX)
1652 /* Enumerate all names. */
1654 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1658 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1659 if (fname && name_type == fname->type)
1667 * Process compressed/sparsed in special way.
1668 * NOTE: You need to set ni->std_fa = new_fa
1669 * after this function to keep internal structures in consistency.
1671 int ni_new_attr_flags(struct ntfs_inode *ni, enum FILE_ATTRIBUTE new_fa)
1673 struct ATTRIB *attr;
1674 struct mft_inode *mi;
1678 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
1682 new_aflags = attr->flags;
1684 if (new_fa & FILE_ATTRIBUTE_SPARSE_FILE)
1685 new_aflags |= ATTR_FLAG_SPARSED;
1687 new_aflags &= ~ATTR_FLAG_SPARSED;
1689 if (new_fa & FILE_ATTRIBUTE_COMPRESSED)
1690 new_aflags |= ATTR_FLAG_COMPRESSED;
1692 new_aflags &= ~ATTR_FLAG_COMPRESSED;
1694 if (new_aflags == attr->flags)
1697 if ((new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) ==
1698 (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) {
1699 ntfs_inode_warn(&ni->vfs_inode,
1700 "file can't be sparsed and compressed");
1707 if (attr->nres.data_size) {
1710 "one can change sparsed/compressed only for empty files");
1714 /* Resize nonresident empty attribute in-place only. */
1715 new_asize = (new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED))
1716 ? (SIZEOF_NONRESIDENT_EX + 8)
1717 : (SIZEOF_NONRESIDENT + 8);
1719 if (!mi_resize_attr(mi, attr, new_asize - le32_to_cpu(attr->size)))
1722 if (new_aflags & ATTR_FLAG_SPARSED) {
1723 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1724 /* Windows uses 16 clusters per frame but supports one cluster per frame too. */
1725 attr->nres.c_unit = 0;
1726 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1727 } else if (new_aflags & ATTR_FLAG_COMPRESSED) {
1728 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1729 /* The only allowed: 16 clusters per frame. */
1730 attr->nres.c_unit = NTFS_LZNT_CUNIT;
1731 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops_cmpr;
1733 attr->name_off = SIZEOF_NONRESIDENT_LE;
1735 attr->nres.c_unit = 0;
1736 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1738 attr->nres.run_off = attr->name_off;
1740 attr->flags = new_aflags;
1749 * buffer - memory for reparse buffer header
1751 enum REPARSE_SIGN ni_parse_reparse(struct ntfs_inode *ni, struct ATTRIB *attr,
1752 struct REPARSE_DATA_BUFFER *buffer)
1754 const struct REPARSE_DATA_BUFFER *rp = NULL;
1757 typeof(rp->CompressReparseBuffer) *cmpr;
1759 /* Try to estimate reparse point. */
1760 if (!attr->non_res) {
1761 rp = resident_data_ex(attr, sizeof(struct REPARSE_DATA_BUFFER));
1762 } else if (le64_to_cpu(attr->nres.data_size) >=
1763 sizeof(struct REPARSE_DATA_BUFFER)) {
1764 struct runs_tree run;
1768 if (!attr_load_runs_vcn(ni, ATTR_REPARSE, NULL, 0, &run, 0) &&
1769 !ntfs_read_run_nb(ni->mi.sbi, &run, 0, buffer,
1770 sizeof(struct REPARSE_DATA_BUFFER),
1779 return REPARSE_NONE;
1781 len = le16_to_cpu(rp->ReparseDataLength);
1782 switch (rp->ReparseTag) {
1783 case (IO_REPARSE_TAG_MICROSOFT | IO_REPARSE_TAG_SYMBOLIC_LINK):
1784 break; /* Symbolic link. */
1785 case IO_REPARSE_TAG_MOUNT_POINT:
1786 break; /* Mount points and junctions. */
1787 case IO_REPARSE_TAG_SYMLINK:
1789 case IO_REPARSE_TAG_COMPRESS:
1791 * WOF - Windows Overlay Filter - Used to compress files with
1794 * Unlike native NTFS file compression, the Windows
1795 * Overlay Filter supports only read operations. This means
1796 * that it doesn't need to sector-align each compressed chunk,
1797 * so the compressed data can be packed more tightly together.
1798 * If you open the file for writing, the WOF just decompresses
1799 * the entire file, turning it back into a plain file.
1801 * Ntfs3 driver decompresses the entire file only on write or
1802 * change size requests.
1805 cmpr = &rp->CompressReparseBuffer;
1806 if (len < sizeof(*cmpr) ||
1807 cmpr->WofVersion != WOF_CURRENT_VERSION ||
1808 cmpr->WofProvider != WOF_PROVIDER_SYSTEM ||
1809 cmpr->ProviderVer != WOF_PROVIDER_CURRENT_VERSION) {
1810 return REPARSE_NONE;
1813 switch (cmpr->CompressionFormat) {
1814 case WOF_COMPRESSION_XPRESS4K:
1817 case WOF_COMPRESSION_XPRESS8K:
1820 case WOF_COMPRESSION_XPRESS16K:
1823 case WOF_COMPRESSION_LZX32K:
1830 ni_set_ext_compress_bits(ni, bits);
1831 return REPARSE_COMPRESSED;
1833 case IO_REPARSE_TAG_DEDUP:
1834 ni->ni_flags |= NI_FLAG_DEDUPLICATED;
1835 return REPARSE_DEDUPLICATED;
1838 if (rp->ReparseTag & IO_REPARSE_TAG_NAME_SURROGATE)
1841 return REPARSE_NONE;
1845 memcpy(buffer, rp, sizeof(struct REPARSE_DATA_BUFFER));
1847 /* Looks like normal symlink. */
1848 return REPARSE_LINK;
1852 * ni_fiemap - Helper for file_fiemap().
1855 * TODO: Less aggressive locks.
1857 int ni_fiemap(struct ntfs_inode *ni, struct fiemap_extent_info *fieinfo,
1858 __u64 vbo, __u64 len)
1861 struct ntfs_sb_info *sbi = ni->mi.sbi;
1862 u8 cluster_bits = sbi->cluster_bits;
1863 struct runs_tree *run;
1864 struct rw_semaphore *run_lock;
1865 struct ATTRIB *attr;
1866 CLST vcn = vbo >> cluster_bits;
1868 u64 valid = ni->i_valid;
1870 u64 end, alloc_size;
1875 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1876 run = &ni->dir.alloc_run;
1877 attr = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, I30_NAME,
1878 ARRAY_SIZE(I30_NAME), NULL, NULL);
1879 run_lock = &ni->dir.run_lock;
1881 run = &ni->file.run;
1882 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL,
1888 if (is_attr_compressed(attr)) {
1889 /* Unfortunately cp -r incorrectly treats compressed clusters. */
1893 "fiemap is not supported for compressed file (cp -r)");
1896 run_lock = &ni->file.run_lock;
1899 if (!attr || !attr->non_res) {
1900 err = fiemap_fill_next_extent(
1902 attr ? le32_to_cpu(attr->res.data_size) : 0,
1903 FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_LAST |
1904 FIEMAP_EXTENT_MERGED);
1909 alloc_size = le64_to_cpu(attr->nres.alloc_size);
1910 if (end > alloc_size)
1913 down_read(run_lock);
1917 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1919 CLST vcn_next = vcn;
1921 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) &&
1929 down_write(run_lock);
1931 err = attr_load_runs_vcn(ni, attr->type,
1933 attr->name_len, run, vcn);
1936 down_read(run_lock);
1941 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1954 if (lcn == SPARSE_LCN) {
1956 vbo = (u64)vcn << cluster_bits;
1960 flags = FIEMAP_EXTENT_MERGED;
1961 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1963 } else if (is_attr_compressed(attr)) {
1966 err = attr_is_frame_compressed(
1967 ni, attr, vcn >> attr->nres.c_unit, &clst_data);
1970 if (clst_data < NTFS_LZNT_CLUSTERS)
1971 flags |= FIEMAP_EXTENT_ENCODED;
1972 } else if (is_attr_encrypted(attr)) {
1973 flags |= FIEMAP_EXTENT_DATA_ENCRYPTED;
1976 vbo = (u64)vcn << cluster_bits;
1977 bytes = (u64)clen << cluster_bits;
1978 lbo = (u64)lcn << cluster_bits;
1982 if (vbo + bytes >= end)
1985 if (vbo + bytes <= valid) {
1987 } else if (vbo >= valid) {
1988 flags |= FIEMAP_EXTENT_UNWRITTEN;
1990 /* vbo < valid && valid < vbo + bytes */
1991 u64 dlen = valid - vbo;
1993 if (vbo + dlen >= end)
1994 flags |= FIEMAP_EXTENT_LAST;
1996 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, dlen,
2011 flags |= FIEMAP_EXTENT_UNWRITTEN;
2014 if (vbo + bytes >= end)
2015 flags |= FIEMAP_EXTENT_LAST;
2017 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, bytes, flags);
2037 * When decompressing, we typically obtain more than one page per reference.
2038 * We inject the additional pages into the page cache.
2040 int ni_readpage_cmpr(struct ntfs_inode *ni, struct page *page)
2043 struct ntfs_sb_info *sbi = ni->mi.sbi;
2044 struct address_space *mapping = page->mapping;
2045 pgoff_t index = page->index;
2046 u64 frame_vbo, vbo = (u64)index << PAGE_SHIFT;
2047 struct page **pages = NULL; /* Array of at most 16 pages. stack? */
2050 u32 i, idx, frame_size, pages_per_frame;
2054 if (vbo >= ni->vfs_inode.i_size) {
2055 SetPageUptodate(page);
2060 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2061 /* Xpress or LZX. */
2062 frame_bits = ni_ext_compress_bits(ni);
2064 /* LZNT compression. */
2065 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2067 frame_size = 1u << frame_bits;
2068 frame = vbo >> frame_bits;
2069 frame_vbo = (u64)frame << frame_bits;
2070 idx = (vbo - frame_vbo) >> PAGE_SHIFT;
2072 pages_per_frame = frame_size >> PAGE_SHIFT;
2073 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2080 index = frame_vbo >> PAGE_SHIFT;
2081 gfp_mask = mapping_gfp_mask(mapping);
2083 for (i = 0; i < pages_per_frame; i++, index++) {
2087 pg = find_or_create_page(mapping, index, gfp_mask);
2095 err = ni_read_frame(ni, frame_vbo, pages, pages_per_frame);
2101 for (i = 0; i < pages_per_frame; i++) {
2110 /* At this point, err contains 0 or -EIO depending on the "critical" page. */
2117 #ifdef CONFIG_NTFS3_LZX_XPRESS
2119 * ni_decompress_file - Decompress LZX/Xpress compressed file.
2121 * Remove ATTR_DATA::WofCompressedData.
2122 * Remove ATTR_REPARSE.
2124 int ni_decompress_file(struct ntfs_inode *ni)
2126 struct ntfs_sb_info *sbi = ni->mi.sbi;
2127 struct inode *inode = &ni->vfs_inode;
2128 loff_t i_size = inode->i_size;
2129 struct address_space *mapping = inode->i_mapping;
2130 gfp_t gfp_mask = mapping_gfp_mask(mapping);
2131 struct page **pages = NULL;
2132 struct ATTR_LIST_ENTRY *le;
2133 struct ATTRIB *attr;
2134 CLST vcn, cend, lcn, clen, end;
2138 u32 i, frame_size, pages_per_frame, bytes;
2139 struct mft_inode *mi;
2142 /* Clusters for decompressed data. */
2143 cend = bytes_to_cluster(sbi, i_size);
2148 /* Check in advance. */
2149 if (cend > wnd_zeroes(&sbi->used.bitmap)) {
2154 frame_bits = ni_ext_compress_bits(ni);
2155 frame_size = 1u << frame_bits;
2156 pages_per_frame = frame_size >> PAGE_SHIFT;
2157 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2164 * Step 1: Decompress data and copy to new allocated clusters.
2167 for (vbo = 0; vbo < i_size; vbo += bytes) {
2171 if (vbo + frame_size > i_size) {
2172 bytes = i_size - vbo;
2173 nr_pages = (bytes + PAGE_SIZE - 1) >> PAGE_SHIFT;
2175 nr_pages = pages_per_frame;
2179 end = bytes_to_cluster(sbi, vbo + bytes);
2181 for (vcn = vbo >> sbi->cluster_bits; vcn < end; vcn += clen) {
2182 err = attr_data_get_block(ni, vcn, cend - vcn, &lcn,
2188 for (i = 0; i < pages_per_frame; i++, index++) {
2191 pg = find_or_create_page(mapping, index, gfp_mask);
2194 unlock_page(pages[i]);
2203 err = ni_read_frame(ni, vbo, pages, pages_per_frame);
2206 down_read(&ni->file.run_lock);
2207 err = ntfs_bio_pages(sbi, &ni->file.run, pages,
2208 nr_pages, vbo, bytes,
2210 up_read(&ni->file.run_lock);
2213 for (i = 0; i < pages_per_frame; i++) {
2214 unlock_page(pages[i]);
2226 * Step 2: Deallocate attributes ATTR_DATA::WofCompressedData
2231 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
2235 if (attr->type == ATTR_REPARSE) {
2238 mi_get_ref(&ni->mi, &ref);
2239 ntfs_remove_reparse(sbi, 0, &ref);
2245 if (attr->type != ATTR_REPARSE &&
2246 (attr->type != ATTR_DATA ||
2247 attr->name_len != ARRAY_SIZE(WOF_NAME) ||
2248 memcmp(attr_name(attr), WOF_NAME, sizeof(WOF_NAME))))
2251 svcn = le64_to_cpu(attr->nres.svcn);
2252 evcn = le64_to_cpu(attr->nres.evcn);
2254 if (evcn + 1 <= svcn)
2257 asize = le32_to_cpu(attr->size);
2258 roff = le16_to_cpu(attr->nres.run_off);
2265 /*run==1 Means unpack and deallocate. */
2266 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
2267 Add2Ptr(attr, roff), asize - roff);
2271 * Step 3: Remove attribute ATTR_DATA::WofCompressedData.
2273 err = ni_remove_attr(ni, ATTR_DATA, WOF_NAME, ARRAY_SIZE(WOF_NAME),
2279 * Step 4: Remove ATTR_REPARSE.
2281 err = ni_remove_attr(ni, ATTR_REPARSE, NULL, 0, false, NULL);
2286 * Step 5: Remove sparse flag from data attribute.
2288 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
2294 if (attr->non_res && is_attr_sparsed(attr)) {
2295 /* Sparsed attribute header is 8 bytes bigger than normal. */
2296 struct MFT_REC *rec = mi->mrec;
2297 u32 used = le32_to_cpu(rec->used);
2298 u32 asize = le32_to_cpu(attr->size);
2299 u16 roff = le16_to_cpu(attr->nres.run_off);
2300 char *rbuf = Add2Ptr(attr, roff);
2302 memmove(rbuf - 8, rbuf, used - PtrOffset(rec, rbuf));
2303 attr->size = cpu_to_le32(asize - 8);
2304 attr->flags &= ~ATTR_FLAG_SPARSED;
2305 attr->nres.run_off = cpu_to_le16(roff - 8);
2306 attr->nres.c_unit = 0;
2307 rec->used = cpu_to_le32(used - 8);
2309 ni->std_fa &= ~(FILE_ATTRIBUTE_SPARSE_FILE |
2310 FILE_ATTRIBUTE_REPARSE_POINT);
2312 mark_inode_dirty(inode);
2315 /* Clear cached flag. */
2316 ni->ni_flags &= ~NI_FLAG_COMPRESSED_MASK;
2317 if (ni->file.offs_page) {
2318 put_page(ni->file.offs_page);
2319 ni->file.offs_page = NULL;
2321 mapping->a_ops = &ntfs_aops;
2326 make_bad_inode(inode);
2327 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
2334 * decompress_lzx_xpress - External compression LZX/Xpress.
2336 static int decompress_lzx_xpress(struct ntfs_sb_info *sbi, const char *cmpr,
2337 size_t cmpr_size, void *unc, size_t unc_size,
2343 if (cmpr_size == unc_size) {
2344 /* Frame not compressed. */
2345 memcpy(unc, cmpr, unc_size);
2350 if (frame_size == 0x8000) {
2351 mutex_lock(&sbi->compress.mtx_lzx);
2352 /* LZX: Frame compressed. */
2353 ctx = sbi->compress.lzx;
2355 /* Lazy initialize LZX decompress context. */
2356 ctx = lzx_allocate_decompressor();
2362 sbi->compress.lzx = ctx;
2365 if (lzx_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2366 /* Treat all errors as "invalid argument". */
2370 mutex_unlock(&sbi->compress.mtx_lzx);
2372 /* XPRESS: Frame compressed. */
2373 mutex_lock(&sbi->compress.mtx_xpress);
2374 ctx = sbi->compress.xpress;
2376 /* Lazy initialize Xpress decompress context. */
2377 ctx = xpress_allocate_decompressor();
2383 sbi->compress.xpress = ctx;
2386 if (xpress_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2387 /* Treat all errors as "invalid argument". */
2391 mutex_unlock(&sbi->compress.mtx_xpress);
2400 * Pages - Array of locked pages.
2402 int ni_read_frame(struct ntfs_inode *ni, u64 frame_vbo, struct page **pages,
2403 u32 pages_per_frame)
2406 struct ntfs_sb_info *sbi = ni->mi.sbi;
2407 u8 cluster_bits = sbi->cluster_bits;
2408 char *frame_ondisk = NULL;
2409 char *frame_mem = NULL;
2410 struct page **pages_disk = NULL;
2411 struct ATTR_LIST_ENTRY *le = NULL;
2412 struct runs_tree *run = &ni->file.run;
2413 u64 valid_size = ni->i_valid;
2416 u32 frame_size, i, npages_disk, ondisk_size;
2418 struct ATTRIB *attr;
2419 CLST frame, clst_data;
2422 * To simplify decompress algorithm do vmap for source
2425 for (i = 0; i < pages_per_frame; i++)
2428 frame_size = pages_per_frame << PAGE_SHIFT;
2429 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL);
2435 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, NULL);
2441 if (!attr->non_res) {
2442 u32 data_size = le32_to_cpu(attr->res.data_size);
2444 memset(frame_mem, 0, frame_size);
2445 if (frame_vbo < data_size) {
2446 ondisk_size = data_size - frame_vbo;
2447 memcpy(frame_mem, resident_data(attr) + frame_vbo,
2448 min(ondisk_size, frame_size));
2454 if (frame_vbo >= valid_size) {
2455 memset(frame_mem, 0, frame_size);
2460 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2461 #ifndef CONFIG_NTFS3_LZX_XPRESS
2465 u32 frame_bits = ni_ext_compress_bits(ni);
2466 u64 frame64 = frame_vbo >> frame_bits;
2467 u64 frames, vbo_data;
2469 if (frame_size != (1u << frame_bits)) {
2473 switch (frame_size) {
2480 /* Unknown compression. */
2485 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, WOF_NAME,
2486 ARRAY_SIZE(WOF_NAME), NULL, NULL);
2490 "external compressed file should contains data attribute \"WofCompressedData\"");
2495 if (!attr->non_res) {
2505 frames = (ni->vfs_inode.i_size - 1) >> frame_bits;
2507 err = attr_wof_frame_info(ni, attr, run, frame64, frames,
2508 frame_bits, &ondisk_size, &vbo_data);
2512 if (frame64 == frames) {
2513 unc_size = 1 + ((ni->vfs_inode.i_size - 1) &
2515 ondisk_size = attr_size(attr) - vbo_data;
2517 unc_size = frame_size;
2520 if (ondisk_size > frame_size) {
2525 if (!attr->non_res) {
2526 if (vbo_data + ondisk_size >
2527 le32_to_cpu(attr->res.data_size)) {
2532 err = decompress_lzx_xpress(
2533 sbi, Add2Ptr(resident_data(attr), vbo_data),
2534 ondisk_size, frame_mem, unc_size, frame_size);
2537 vbo_disk = vbo_data;
2538 /* Load all runs to read [vbo_disk-vbo_to). */
2539 err = attr_load_runs_range(ni, ATTR_DATA, WOF_NAME,
2540 ARRAY_SIZE(WOF_NAME), run, vbo_disk,
2541 vbo_data + ondisk_size);
2544 npages_disk = (ondisk_size + (vbo_disk & (PAGE_SIZE - 1)) +
2548 } else if (is_attr_compressed(attr)) {
2549 /* LZNT compression. */
2550 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2555 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2560 down_write(&ni->file.run_lock);
2561 run_truncate_around(run, le64_to_cpu(attr->nres.svcn));
2562 frame = frame_vbo >> (cluster_bits + NTFS_LZNT_CUNIT);
2563 err = attr_is_frame_compressed(ni, attr, frame, &clst_data);
2564 up_write(&ni->file.run_lock);
2569 memset(frame_mem, 0, frame_size);
2573 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2574 ondisk_size = clst_data << cluster_bits;
2576 if (clst_data >= NTFS_LZNT_CLUSTERS) {
2577 /* Frame is not compressed. */
2578 down_read(&ni->file.run_lock);
2579 err = ntfs_bio_pages(sbi, run, pages, pages_per_frame,
2580 frame_vbo, ondisk_size,
2582 up_read(&ni->file.run_lock);
2585 vbo_disk = frame_vbo;
2586 npages_disk = (ondisk_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
2588 __builtin_unreachable();
2593 pages_disk = kzalloc(npages_disk * sizeof(struct page *), GFP_NOFS);
2599 for (i = 0; i < npages_disk; i++) {
2600 pg = alloc_page(GFP_KERNEL);
2610 /* Read 'ondisk_size' bytes from disk. */
2611 down_read(&ni->file.run_lock);
2612 err = ntfs_bio_pages(sbi, run, pages_disk, npages_disk, vbo_disk,
2613 ondisk_size, REQ_OP_READ);
2614 up_read(&ni->file.run_lock);
2619 * To simplify decompress algorithm do vmap for source and target pages.
2621 frame_ondisk = vmap(pages_disk, npages_disk, VM_MAP, PAGE_KERNEL_RO);
2622 if (!frame_ondisk) {
2627 /* Decompress: Frame_ondisk -> frame_mem. */
2628 #ifdef CONFIG_NTFS3_LZX_XPRESS
2629 if (run != &ni->file.run) {
2631 err = decompress_lzx_xpress(
2632 sbi, frame_ondisk + (vbo_disk & (PAGE_SIZE - 1)),
2633 ondisk_size, frame_mem, unc_size, frame_size);
2637 /* LZNT - Native NTFS compression. */
2638 unc_size = decompress_lznt(frame_ondisk, ondisk_size, frame_mem,
2640 if ((ssize_t)unc_size < 0)
2642 else if (!unc_size || unc_size > frame_size)
2645 if (!err && valid_size < frame_vbo + frame_size) {
2646 size_t ok = valid_size - frame_vbo;
2648 memset(frame_mem + ok, 0, frame_size - ok);
2651 vunmap(frame_ondisk);
2654 for (i = 0; i < npages_disk; i++) {
2665 #ifdef CONFIG_NTFS3_LZX_XPRESS
2666 if (run != &ni->file.run)
2672 for (i = 0; i < pages_per_frame; i++) {
2676 SetPageUptodate(pg);
2685 * Pages - Array of locked pages.
2687 int ni_write_frame(struct ntfs_inode *ni, struct page **pages,
2688 u32 pages_per_frame)
2691 struct ntfs_sb_info *sbi = ni->mi.sbi;
2692 u8 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2693 u32 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2694 u64 frame_vbo = (u64)pages[0]->index << PAGE_SHIFT;
2695 CLST frame = frame_vbo >> frame_bits;
2696 char *frame_ondisk = NULL;
2697 struct page **pages_disk = NULL;
2698 struct ATTR_LIST_ENTRY *le = NULL;
2700 struct ATTRIB *attr;
2701 struct mft_inode *mi;
2704 size_t compr_size, ondisk_size;
2707 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, &mi);
2713 if (WARN_ON(!is_attr_compressed(attr))) {
2718 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2723 if (!attr->non_res) {
2724 down_write(&ni->file.run_lock);
2725 err = attr_make_nonresident(ni, attr, le, mi,
2726 le32_to_cpu(attr->res.data_size),
2727 &ni->file.run, &attr, pages[0]);
2728 up_write(&ni->file.run_lock);
2733 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2738 pages_disk = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2744 for (i = 0; i < pages_per_frame; i++) {
2745 pg = alloc_page(GFP_KERNEL);
2755 /* To simplify compress algorithm do vmap for source and target pages. */
2756 frame_ondisk = vmap(pages_disk, pages_per_frame, VM_MAP, PAGE_KERNEL);
2757 if (!frame_ondisk) {
2762 for (i = 0; i < pages_per_frame; i++)
2765 /* Map in-memory frame for read-only. */
2766 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL_RO);
2772 mutex_lock(&sbi->compress.mtx_lznt);
2774 if (!sbi->compress.lznt) {
2776 * LZNT implements two levels of compression:
2777 * 0 - Standard compression
2778 * 1 - Best compression, requires a lot of cpu
2781 lznt = get_lznt_ctx(0);
2783 mutex_unlock(&sbi->compress.mtx_lznt);
2788 sbi->compress.lznt = lznt;
2792 /* Compress: frame_mem -> frame_ondisk */
2793 compr_size = compress_lznt(frame_mem, frame_size, frame_ondisk,
2794 frame_size, sbi->compress.lznt);
2795 mutex_unlock(&sbi->compress.mtx_lznt);
2798 if (compr_size + sbi->cluster_size > frame_size) {
2799 /* Frame is not compressed. */
2800 compr_size = frame_size;
2801 ondisk_size = frame_size;
2802 } else if (compr_size) {
2803 /* Frame is compressed. */
2804 ondisk_size = ntfs_up_cluster(sbi, compr_size);
2805 memset(frame_ondisk + compr_size, 0, ondisk_size - compr_size);
2807 /* Frame is sparsed. */
2811 down_write(&ni->file.run_lock);
2812 run_truncate_around(&ni->file.run, le64_to_cpu(attr->nres.svcn));
2813 err = attr_allocate_frame(ni, frame, compr_size, ni->i_valid);
2814 up_write(&ni->file.run_lock);
2821 down_read(&ni->file.run_lock);
2822 err = ntfs_bio_pages(sbi, &ni->file.run,
2823 ondisk_size < frame_size ? pages_disk : pages,
2824 pages_per_frame, frame_vbo, ondisk_size,
2826 up_read(&ni->file.run_lock);
2832 for (i = 0; i < pages_per_frame; i++)
2835 vunmap(frame_ondisk);
2837 for (i = 0; i < pages_per_frame; i++) {
2851 * ni_remove_name - Removes name 'de' from MFT and from directory.
2852 * 'de2' and 'undo_step' are used to restore MFT/dir, if error occurs.
2854 int ni_remove_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2855 struct NTFS_DE *de, struct NTFS_DE **de2, int *undo_step)
2858 struct ntfs_sb_info *sbi = ni->mi.sbi;
2859 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2860 struct ATTR_FILE_NAME *fname;
2861 struct ATTR_LIST_ENTRY *le;
2862 struct mft_inode *mi;
2863 u16 de_key_size = le16_to_cpu(de->key_size);
2868 /* Find name in record. */
2869 mi_get_ref(&dir_ni->mi, &de_name->home);
2871 fname = ni_fname_name(ni, (struct cpu_str *)&de_name->name_len,
2872 &de_name->home, &mi, &le);
2876 memcpy(&de_name->dup, &fname->dup, sizeof(struct NTFS_DUP_INFO));
2877 name_type = paired_name(fname->type);
2879 /* Mark ntfs as dirty. It will be cleared at umount. */
2880 ntfs_set_state(sbi, NTFS_DIRTY_DIRTY);
2882 /* Step 1: Remove name from directory. */
2883 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname, de_key_size, sbi);
2887 /* Step 2: Remove name from MFT. */
2888 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2892 /* Get paired name. */
2893 fname = ni_fname_type(ni, name_type, &mi, &le);
2895 u16 de2_key_size = fname_full_size(fname);
2897 *de2 = Add2Ptr(de, 1024);
2898 (*de2)->key_size = cpu_to_le16(de2_key_size);
2900 memcpy(*de2 + 1, fname, de2_key_size);
2902 /* Step 3: Remove paired name from directory. */
2903 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname,
2908 /* Step 4: Remove paired name from MFT. */
2909 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2917 * ni_remove_name_undo - Paired function for ni_remove_name.
2919 * Return: True if ok
2921 bool ni_remove_name_undo(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2922 struct NTFS_DE *de, struct NTFS_DE *de2, int undo_step)
2924 struct ntfs_sb_info *sbi = ni->mi.sbi;
2925 struct ATTRIB *attr;
2926 u16 de_key_size = de2 ? le16_to_cpu(de2->key_size) : 0;
2928 switch (undo_step) {
2930 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2931 &attr, NULL, NULL)) {
2934 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de2 + 1, de_key_size);
2936 mi_get_ref(&ni->mi, &de2->ref);
2937 de2->size = cpu_to_le16(ALIGN(de_key_size, 8) +
2938 sizeof(struct NTFS_DE));
2942 if (indx_insert_entry(&dir_ni->dir, dir_ni, de2, sbi, NULL,
2949 de_key_size = le16_to_cpu(de->key_size);
2951 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2952 &attr, NULL, NULL)) {
2956 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de + 1, de_key_size);
2957 mi_get_ref(&ni->mi, &de->ref);
2959 if (indx_insert_entry(&dir_ni->dir, dir_ni, de, sbi, NULL, 1))
2967 * ni_add_name - Add new name in MFT and in directory.
2969 int ni_add_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2973 struct ATTRIB *attr;
2974 struct ATTR_LIST_ENTRY *le;
2975 struct mft_inode *mi;
2976 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2977 u16 de_key_size = le16_to_cpu(de->key_size);
2979 mi_get_ref(&ni->mi, &de->ref);
2980 mi_get_ref(&dir_ni->mi, &de_name->home);
2982 /* Insert new name in MFT. */
2983 err = ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0, &attr,
2988 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de_name, de_key_size);
2990 /* Insert new name in directory. */
2991 err = indx_insert_entry(&dir_ni->dir, dir_ni, de, ni->mi.sbi, NULL, 0);
2993 ni_remove_attr_le(ni, attr, mi, le);
2999 * ni_rename - Remove one name and insert new name.
3001 int ni_rename(struct ntfs_inode *dir_ni, struct ntfs_inode *new_dir_ni,
3002 struct ntfs_inode *ni, struct NTFS_DE *de, struct NTFS_DE *new_de,
3006 struct NTFS_DE *de2 = NULL;
3010 * There are two possible ways to rename:
3011 * 1) Add new name and remove old name.
3012 * 2) Remove old name and add new name.
3014 * In most cases (not all!) adding new name in MFT and in directory can
3015 * allocate additional cluster(s).
3016 * Second way may result to bad inode if we can't add new name
3017 * and then can't restore (add) old name.
3021 * Way 1 - Add new + remove old.
3023 err = ni_add_name(new_dir_ni, ni, new_de);
3025 err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3026 if (err && ni_remove_name(new_dir_ni, ni, new_de, &de2, &undo))
3031 * Way 2 - Remove old + add new.
3034 * err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3036 * err = ni_add_name(new_dir_ni, ni, new_de);
3037 * if (err && !ni_remove_name_undo(dir_ni, ni, de, de2, undo))
3046 * ni_is_dirty - Return: True if 'ni' requires ni_write_inode.
3048 bool ni_is_dirty(struct inode *inode)
3050 struct ntfs_inode *ni = ntfs_i(inode);
3051 struct rb_node *node;
3053 if (ni->mi.dirty || ni->attr_list.dirty ||
3054 (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3057 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
3058 if (rb_entry(node, struct mft_inode, node)->dirty)
3068 * Update duplicate info of ATTR_FILE_NAME in MFT and in parent directories.
3070 static bool ni_update_parent(struct ntfs_inode *ni, struct NTFS_DUP_INFO *dup,
3073 struct ATTRIB *attr;
3074 struct mft_inode *mi;
3075 struct ATTR_LIST_ENTRY *le = NULL;
3076 struct ntfs_sb_info *sbi = ni->mi.sbi;
3077 struct super_block *sb = sbi->sb;
3078 bool re_dirty = false;
3080 if (ni->mi.mrec->flags & RECORD_FLAG_DIR) {
3081 dup->fa |= FILE_ATTRIBUTE_DIRECTORY;
3083 dup->alloc_size = 0;
3086 dup->fa &= ~FILE_ATTRIBUTE_DIRECTORY;
3088 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL,
3091 dup->alloc_size = dup->data_size = 0;
3092 } else if (!attr->non_res) {
3093 u32 data_size = le32_to_cpu(attr->res.data_size);
3095 dup->alloc_size = cpu_to_le64(ALIGN(data_size, 8));
3096 dup->data_size = cpu_to_le64(data_size);
3098 u64 new_valid = ni->i_valid;
3099 u64 data_size = le64_to_cpu(attr->nres.data_size);
3102 dup->alloc_size = is_attr_ext(attr)
3103 ? attr->nres.total_size
3104 : attr->nres.alloc_size;
3105 dup->data_size = attr->nres.data_size;
3107 if (new_valid > data_size)
3108 new_valid = data_size;
3110 valid_le = cpu_to_le64(new_valid);
3111 if (valid_le != attr->nres.valid_size) {
3112 attr->nres.valid_size = valid_le;
3118 /* TODO: Fill reparse info. */
3122 if (ni->ni_flags & NI_FLAG_EA) {
3123 attr = ni_find_attr(ni, attr, &le, ATTR_EA_INFO, NULL, 0, NULL,
3126 const struct EA_INFO *info;
3128 info = resident_data_ex(attr, sizeof(struct EA_INFO));
3129 /* If ATTR_EA_INFO exists 'info' can't be NULL. */
3131 dup->ea_size = info->size_pack;
3138 while ((attr = ni_find_attr(ni, attr, &le, ATTR_NAME, NULL, 0, NULL,
3141 struct ATTR_FILE_NAME *fname;
3143 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
3144 if (!fname || !memcmp(&fname->dup, dup, sizeof(fname->dup)))
3147 /* ntfs_iget5 may sleep. */
3148 dir = ntfs_iget5(sb, &fname->home, NULL);
3152 "failed to open parent directory r=%lx to update",
3153 (long)ino_get(&fname->home));
3157 if (!is_bad_inode(dir)) {
3158 struct ntfs_inode *dir_ni = ntfs_i(dir);
3160 if (!ni_trylock(dir_ni)) {
3163 indx_update_dup(dir_ni, sbi, fname, dup, sync);
3165 memcpy(&fname->dup, dup, sizeof(fname->dup));
3176 * ni_write_inode - Write MFT base record and all subrecords to disk.
3178 int ni_write_inode(struct inode *inode, int sync, const char *hint)
3181 struct ntfs_inode *ni = ntfs_i(inode);
3182 struct super_block *sb = inode->i_sb;
3183 struct ntfs_sb_info *sbi = sb->s_fs_info;
3184 bool re_dirty = false;
3185 struct ATTR_STD_INFO *std;
3186 struct rb_node *node, *next;
3187 struct NTFS_DUP_INFO dup;
3189 if (is_bad_inode(inode) || sb_rdonly(sb))
3192 if (!ni_trylock(ni)) {
3193 /* 'ni' is under modification, skip for now. */
3194 mark_inode_dirty_sync(inode);
3201 if (is_rec_inuse(ni->mi.mrec) &&
3202 !(sbi->flags & NTFS_FLAGS_LOG_REPLAYING) && inode->i_nlink) {
3203 bool modified = false;
3205 /* Update times in standard attribute. */
3212 /* Update the access times if they have changed. */
3213 dup.m_time = kernel2nt(&inode->i_mtime);
3214 if (std->m_time != dup.m_time) {
3215 std->m_time = dup.m_time;
3219 dup.c_time = kernel2nt(&inode->i_ctime);
3220 if (std->c_time != dup.c_time) {
3221 std->c_time = dup.c_time;
3225 dup.a_time = kernel2nt(&inode->i_atime);
3226 if (std->a_time != dup.a_time) {
3227 std->a_time = dup.a_time;
3231 dup.fa = ni->std_fa;
3232 if (std->fa != dup.fa) {
3238 ni->mi.dirty = true;
3240 if (!ntfs_is_meta_file(sbi, inode->i_ino) &&
3241 (modified || (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3242 /* Avoid __wait_on_freeing_inode(inode). */
3243 && (sb->s_flags & SB_ACTIVE)) {
3244 dup.cr_time = std->cr_time;
3245 /* Not critical if this function fail. */
3246 re_dirty = ni_update_parent(ni, &dup, sync);
3249 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
3251 ni->ni_flags &= ~NI_FLAG_UPDATE_PARENT;
3254 /* Update attribute list. */
3255 if (ni->attr_list.size && ni->attr_list.dirty) {
3256 if (inode->i_ino != MFT_REC_MFT || sync) {
3257 err = ni_try_remove_attr_list(ni);
3262 err = al_update(ni, sync);
3268 for (node = rb_first(&ni->mi_tree); node; node = next) {
3269 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
3272 next = rb_next(node);
3277 is_empty = !mi_enum_attr(mi, NULL);
3280 clear_rec_inuse(mi->mrec);
3282 err2 = mi_write(mi, sync);
3287 ntfs_mark_rec_free(sbi, mi->rno);
3288 rb_erase(node, &ni->mi_tree);
3294 err2 = mi_write(&ni->mi, sync);
3302 ntfs_err(sb, "%s r=%lx failed, %d.", hint, inode->i_ino, err);
3303 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
3308 mark_inode_dirty_sync(inode);