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 /* Should never happened, 'cause already checked. */
713 attr = mi_find_attr(mi, NULL, le->type, le_name(le),
714 le->name_len, &le->id);
716 /* Should never happened, 'cause already checked. */
719 asize = le32_to_cpu(attr->size);
721 /* Insert into primary record. */
722 attr_ins = mi_insert_attr(&ni->mi, le->type, le_name(le),
724 le16_to_cpu(attr->name_off));
728 * Either no space in primary record (already checked).
729 * Either tried to insert another
730 * non indexed attribute (logic error).
735 /* Copy all except id. */
737 memcpy(attr_ins, attr, asize);
740 /* Remove from original record. */
741 mi_remove_attr(NULL, mi, attr);
744 run_deallocate(sbi, &ni->attr_list.run, true);
745 run_close(&ni->attr_list.run);
746 ni->attr_list.size = 0;
747 kfree(ni->attr_list.le);
748 ni->attr_list.le = NULL;
749 ni->attr_list.dirty = false;
753 ntfs_inode_err(&ni->vfs_inode, "Internal error");
754 make_bad_inode(&ni->vfs_inode);
759 * ni_create_attr_list - Generates an attribute list for this primary record.
761 int ni_create_attr_list(struct ntfs_inode *ni)
763 struct ntfs_sb_info *sbi = ni->mi.sbi;
767 struct ATTRIB *arr_move[7];
768 struct ATTR_LIST_ENTRY *le, *le_b[7];
772 struct mft_inode *mi;
773 u32 free_b, nb, to_free, rs;
776 is_mft = ni->mi.rno == MFT_REC_MFT;
778 rs = sbi->record_size;
781 * Skip estimating exact memory requirement.
782 * Looks like one record_size is always enough.
784 le = kmalloc(al_aligned(rs), GFP_NOFS);
790 mi_get_ref(&ni->mi, &le->ref);
791 ni->attr_list.le = le;
798 for (; (attr = mi_enum_attr(&ni->mi, attr)); le = Add2Ptr(le, sz)) {
799 sz = le_size(attr->name_len);
800 le->type = attr->type;
801 le->size = cpu_to_le16(sz);
802 le->name_len = attr->name_len;
803 le->name_off = offsetof(struct ATTR_LIST_ENTRY, name);
805 if (le != ni->attr_list.le)
806 le->ref = ni->attr_list.le->ref;
810 memcpy(le->name, attr_name(attr),
811 sizeof(short) * attr->name_len);
812 else if (attr->type == ATTR_STD)
814 else if (attr->type == ATTR_LIST)
816 else if (is_mft && attr->type == ATTR_DATA)
819 if (!nb || nb < ARRAY_SIZE(arr_move)) {
821 arr_move[nb++] = attr;
822 free_b += le32_to_cpu(attr->size);
826 lsize = PtrOffset(ni->attr_list.le, le);
827 ni->attr_list.size = lsize;
829 to_free = le32_to_cpu(rec->used) + lsize + SIZEOF_RESIDENT;
835 if (to_free > free_b) {
841 /* Allocate child MFT. */
842 err = ntfs_look_free_mft(sbi, &rno, is_mft, ni, &mi);
846 /* Call mi_remove_attr() in reverse order to keep pointers 'arr_move' valid. */
847 while (to_free > 0) {
848 struct ATTRIB *b = arr_move[--nb];
849 u32 asize = le32_to_cpu(b->size);
850 u16 name_off = le16_to_cpu(b->name_off);
852 attr = mi_insert_attr(mi, b->type, Add2Ptr(b, name_off),
853 b->name_len, asize, name_off);
856 mi_get_ref(mi, &le_b[nb]->ref);
857 le_b[nb]->id = attr->id;
859 /* Copy all except id. */
860 memcpy(attr, b, asize);
861 attr->id = le_b[nb]->id;
863 /* Remove from primary record. */
864 WARN_ON(!mi_remove_attr(NULL, &ni->mi, b));
866 if (to_free <= asize)
872 attr = mi_insert_attr(&ni->mi, ATTR_LIST, NULL, 0,
873 lsize + SIZEOF_RESIDENT, SIZEOF_RESIDENT);
878 attr->res.data_size = cpu_to_le32(lsize);
879 attr->res.data_off = SIZEOF_RESIDENT_LE;
883 memcpy(resident_data_ex(attr, lsize), ni->attr_list.le, lsize);
885 ni->attr_list.dirty = false;
887 mark_inode_dirty(&ni->vfs_inode);
891 kfree(ni->attr_list.le);
892 ni->attr_list.le = NULL;
893 ni->attr_list.size = 0;
900 * ni_ins_attr_ext - Add an external attribute to the ntfs_inode.
902 static int ni_ins_attr_ext(struct ntfs_inode *ni, struct ATTR_LIST_ENTRY *le,
903 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
904 u32 asize, CLST svcn, u16 name_off, bool force_ext,
905 struct ATTRIB **ins_attr, struct mft_inode **ins_mi,
906 struct ATTR_LIST_ENTRY **ins_le)
909 struct mft_inode *mi;
912 struct rb_node *node;
914 bool is_mft, is_mft_data;
915 struct ntfs_sb_info *sbi = ni->mi.sbi;
917 is_mft = ni->mi.rno == MFT_REC_MFT;
918 is_mft_data = is_mft && type == ATTR_DATA && !name_len;
920 if (asize > sbi->max_bytes_per_attr) {
926 * Standard information and attr_list cannot be made external.
927 * The Log File cannot have any external attributes.
929 if (type == ATTR_STD || type == ATTR_LIST ||
930 ni->mi.rno == MFT_REC_LOG) {
935 /* Create attribute list if it is not already existed. */
936 if (!ni->attr_list.size) {
937 err = ni_create_attr_list(ni);
942 vbo = is_mft_data ? ((u64)svcn << sbi->cluster_bits) : 0;
947 /* Load all subrecords into memory. */
948 err = ni_load_all_mi(ni);
952 /* Check each of loaded subrecord. */
953 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
954 mi = rb_entry(node, struct mft_inode, node);
957 (mi_enum_attr(mi, NULL) ||
958 vbo <= ((u64)mi->rno << sbi->record_bits))) {
959 /* We can't accept this record 'cause MFT's bootstrapping. */
963 mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0, NULL)) {
965 * This child record already has a ATTR_DATA.
966 * So it can't accept any other records.
971 if ((type != ATTR_NAME || name_len) &&
972 mi_find_attr(mi, NULL, type, name, name_len, NULL)) {
973 /* Only indexed attributes can share same record. */
978 * Do not try to insert this attribute
979 * if there is no room in record.
981 if (le32_to_cpu(mi->mrec->used) + asize > sbi->record_size)
984 /* Try to insert attribute into this subrecord. */
985 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
986 name_off, svcn, ins_le);
998 /* We have to allocate a new child subrecord. */
999 err = ntfs_look_free_mft(sbi, &rno, is_mft_data, ni, &mi);
1003 if (is_mft_data && vbo <= ((u64)rno << sbi->record_bits)) {
1008 attr = ni_ins_new_attr(ni, mi, le, type, name, name_len, asize,
1009 name_off, svcn, ins_le);
1021 ni_remove_mi(ni, mi);
1026 ntfs_mark_rec_free(sbi, rno);
1033 * ni_insert_attr - Insert an attribute into the file.
1035 * If the primary record has room, it will just insert the attribute.
1036 * If not, it may make the attribute external.
1037 * For $MFT::Data it may make room for the attribute by
1038 * making other attributes external.
1041 * The ATTR_LIST and ATTR_STD cannot be made external.
1042 * This function does not fill new attribute full.
1043 * It only fills 'size'/'type'/'id'/'name_len' fields.
1045 static int ni_insert_attr(struct ntfs_inode *ni, enum ATTR_TYPE type,
1046 const __le16 *name, u8 name_len, u32 asize,
1047 u16 name_off, CLST svcn, struct ATTRIB **ins_attr,
1048 struct mft_inode **ins_mi,
1049 struct ATTR_LIST_ENTRY **ins_le)
1051 struct ntfs_sb_info *sbi = ni->mi.sbi;
1053 struct ATTRIB *attr, *eattr;
1054 struct MFT_REC *rec;
1056 struct ATTR_LIST_ENTRY *le;
1057 u32 list_reserve, max_free, free, used, t32;
1061 is_mft = ni->mi.rno == MFT_REC_MFT;
1064 list_reserve = SIZEOF_NONRESIDENT + 3 * (1 + 2 * sizeof(u32));
1065 used = le32_to_cpu(rec->used);
1066 free = sbi->record_size - used;
1068 if (is_mft && type != ATTR_LIST) {
1069 /* Reserve space for the ATTRIB list. */
1070 if (free < list_reserve)
1073 free -= list_reserve;
1076 if (asize <= free) {
1077 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len,
1078 asize, name_off, svcn, ins_le);
1089 if (!is_mft || type != ATTR_DATA || svcn) {
1090 /* This ATTRIB will be external. */
1091 err = ni_ins_attr_ext(ni, NULL, type, name, name_len, asize,
1092 svcn, name_off, false, ins_attr, ins_mi,
1098 * Here we have: "is_mft && type == ATTR_DATA && !svcn"
1100 * The first chunk of the $MFT::Data ATTRIB must be the base record.
1101 * Evict as many other attributes as possible.
1105 /* Estimate the result of moving all possible attributes away. */
1108 while ((attr = mi_enum_attr(&ni->mi, attr))) {
1109 if (attr->type == ATTR_STD)
1111 if (attr->type == ATTR_LIST)
1113 max_free += le32_to_cpu(attr->size);
1116 if (max_free < asize + list_reserve) {
1117 /* Impossible to insert this attribute into primary record. */
1122 /* Start real attribute moving. */
1126 attr = mi_enum_attr(&ni->mi, attr);
1128 /* We should never be here 'cause we have already check this case. */
1133 /* Skip attributes that MUST be primary record. */
1134 if (attr->type == ATTR_STD || attr->type == ATTR_LIST)
1138 if (ni->attr_list.size) {
1139 le = al_find_le(ni, NULL, attr);
1141 /* Really this is a serious bug. */
1147 t32 = le32_to_cpu(attr->size);
1148 t16 = le16_to_cpu(attr->name_off);
1149 err = ni_ins_attr_ext(ni, le, attr->type, Add2Ptr(attr, t16),
1150 attr->name_len, t32, attr_svcn(attr), t16,
1151 false, &eattr, NULL, NULL);
1156 memcpy(eattr, attr, t32);
1159 /* Remove from primary record. */
1160 mi_remove_attr(NULL, &ni->mi, attr);
1162 /* attr now points to next attribute. */
1163 if (attr->type == ATTR_END)
1166 while (asize + list_reserve > sbi->record_size - le32_to_cpu(rec->used))
1169 attr = ni_ins_new_attr(ni, &ni->mi, NULL, type, name, name_len, asize,
1170 name_off, svcn, ins_le);
1185 /* ni_expand_mft_list - Split ATTR_DATA of $MFT. */
1186 static int ni_expand_mft_list(struct ntfs_inode *ni)
1189 struct runs_tree *run = &ni->file.run;
1190 u32 asize, run_size, done = 0;
1191 struct ATTRIB *attr;
1192 struct rb_node *node;
1193 CLST mft_min, mft_new, svcn, evcn, plen;
1194 struct mft_inode *mi, *mi_min, *mi_new;
1195 struct ntfs_sb_info *sbi = ni->mi.sbi;
1197 /* Find the nearest MFT. */
1202 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
1203 mi = rb_entry(node, struct mft_inode, node);
1205 attr = mi_enum_attr(mi, NULL);
1214 if (ntfs_look_free_mft(sbi, &mft_new, true, ni, &mi_new)) {
1216 /* Really this is not critical. */
1217 } else if (mft_min > mft_new) {
1221 ntfs_mark_rec_free(sbi, mft_new);
1223 ni_remove_mi(ni, mi_new);
1226 attr = mi_find_attr(&ni->mi, NULL, ATTR_DATA, NULL, 0, NULL);
1232 asize = le32_to_cpu(attr->size);
1234 evcn = le64_to_cpu(attr->nres.evcn);
1235 svcn = bytes_to_cluster(sbi, (u64)(mft_min + 1) << sbi->record_bits);
1236 if (evcn + 1 >= svcn) {
1242 * Split primary attribute [0 evcn] in two parts [0 svcn) + [svcn evcn].
1244 * Update first part of ATTR_DATA in 'primary MFT.
1246 err = run_pack(run, 0, svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1247 asize - SIZEOF_NONRESIDENT, &plen);
1251 run_size = ALIGN(err, 8);
1259 attr->nres.evcn = cpu_to_le64(svcn - 1);
1260 attr->size = cpu_to_le32(run_size + SIZEOF_NONRESIDENT);
1261 /* 'done' - How many bytes of primary MFT becomes free. */
1262 done = asize - run_size - SIZEOF_NONRESIDENT;
1263 le32_sub_cpu(&ni->mi.mrec->used, done);
1265 /* Estimate the size of second part: run_buf=NULL. */
1266 err = run_pack(run, svcn, evcn + 1 - svcn, NULL, sbi->record_size,
1271 run_size = ALIGN(err, 8);
1274 if (plen < evcn + 1 - svcn) {
1280 * This function may implicitly call expand attr_list.
1281 * Insert second part of ATTR_DATA in 'mi_min'.
1283 attr = ni_ins_new_attr(ni, mi_min, NULL, ATTR_DATA, NULL, 0,
1284 SIZEOF_NONRESIDENT + run_size,
1285 SIZEOF_NONRESIDENT, svcn, NULL);
1292 attr->name_off = SIZEOF_NONRESIDENT_LE;
1295 run_pack(run, svcn, evcn + 1 - svcn, Add2Ptr(attr, SIZEOF_NONRESIDENT),
1298 attr->nres.svcn = cpu_to_le64(svcn);
1299 attr->nres.evcn = cpu_to_le64(evcn);
1300 attr->nres.run_off = cpu_to_le16(SIZEOF_NONRESIDENT);
1304 ntfs_mark_rec_free(sbi, mft_new);
1305 ni_remove_mi(ni, mi_new);
1308 return !err && !done ? -EOPNOTSUPP : err;
1312 * ni_expand_list - Move all possible attributes out of primary record.
1314 int ni_expand_list(struct ntfs_inode *ni)
1317 u32 asize, done = 0;
1318 struct ATTRIB *attr, *ins_attr;
1319 struct ATTR_LIST_ENTRY *le;
1320 bool is_mft = ni->mi.rno == MFT_REC_MFT;
1323 mi_get_ref(&ni->mi, &ref);
1326 while ((le = al_enumerate(ni, le))) {
1327 if (le->type == ATTR_STD)
1330 if (memcmp(&ref, &le->ref, sizeof(struct MFT_REF)))
1333 if (is_mft && le->type == ATTR_DATA)
1336 /* Find attribute in primary record. */
1337 attr = rec_find_attr_le(&ni->mi, le);
1343 asize = le32_to_cpu(attr->size);
1345 /* Always insert into new record to avoid collisions (deep recursive). */
1346 err = ni_ins_attr_ext(ni, le, attr->type, attr_name(attr),
1347 attr->name_len, asize, attr_svcn(attr),
1348 le16_to_cpu(attr->name_off), true,
1349 &ins_attr, NULL, NULL);
1354 memcpy(ins_attr, attr, asize);
1355 ins_attr->id = le->id;
1356 /* Remove from primary record. */
1357 mi_remove_attr(NULL, &ni->mi, attr);
1364 err = -EFBIG; /* Attr list is too big(?) */
1368 /* Split MFT data as much as possible. */
1369 err = ni_expand_mft_list(ni);
1374 return !err && !done ? -EOPNOTSUPP : err;
1378 * ni_insert_nonresident - Insert new nonresident attribute.
1380 int ni_insert_nonresident(struct ntfs_inode *ni, enum ATTR_TYPE type,
1381 const __le16 *name, u8 name_len,
1382 const struct runs_tree *run, CLST svcn, CLST len,
1383 __le16 flags, struct ATTRIB **new_attr,
1384 struct mft_inode **mi)
1388 struct ATTRIB *attr;
1390 (flags & (ATTR_FLAG_SPARSED | ATTR_FLAG_COMPRESSED)) && !svcn;
1391 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1392 u32 name_off = is_ext ? SIZEOF_NONRESIDENT_EX : SIZEOF_NONRESIDENT;
1393 u32 run_off = name_off + name_size;
1394 u32 run_size, asize;
1395 struct ntfs_sb_info *sbi = ni->mi.sbi;
1397 err = run_pack(run, svcn, len, NULL, sbi->max_bytes_per_attr - run_off,
1402 run_size = ALIGN(err, 8);
1409 asize = run_off + run_size;
1411 if (asize > sbi->max_bytes_per_attr) {
1416 err = ni_insert_attr(ni, type, name, name_len, asize, name_off, svcn,
1423 attr->name_off = cpu_to_le16(name_off);
1424 attr->flags = flags;
1426 run_pack(run, svcn, len, Add2Ptr(attr, run_off), run_size, &plen);
1428 attr->nres.svcn = cpu_to_le64(svcn);
1429 attr->nres.evcn = cpu_to_le64((u64)svcn + len - 1);
1435 *(__le64 *)&attr->nres.run_off = cpu_to_le64(run_off);
1437 attr->nres.alloc_size =
1438 svcn ? 0 : cpu_to_le64((u64)len << ni->mi.sbi->cluster_bits);
1439 attr->nres.data_size = attr->nres.alloc_size;
1440 attr->nres.valid_size = attr->nres.alloc_size;
1443 if (flags & ATTR_FLAG_COMPRESSED)
1444 attr->nres.c_unit = COMPRESSION_UNIT;
1445 attr->nres.total_size = attr->nres.alloc_size;
1453 * ni_insert_resident - Inserts new resident attribute.
1455 int ni_insert_resident(struct ntfs_inode *ni, u32 data_size,
1456 enum ATTR_TYPE type, const __le16 *name, u8 name_len,
1457 struct ATTRIB **new_attr, struct mft_inode **mi,
1458 struct ATTR_LIST_ENTRY **le)
1461 u32 name_size = ALIGN(name_len * sizeof(short), 8);
1462 u32 asize = SIZEOF_RESIDENT + name_size + ALIGN(data_size, 8);
1463 struct ATTRIB *attr;
1465 err = ni_insert_attr(ni, type, name, name_len, asize, SIZEOF_RESIDENT,
1473 attr->res.data_size = cpu_to_le32(data_size);
1474 attr->res.data_off = cpu_to_le16(SIZEOF_RESIDENT + name_size);
1475 if (type == ATTR_NAME) {
1476 attr->res.flags = RESIDENT_FLAG_INDEXED;
1478 /* is_attr_indexed(attr)) == true */
1479 le16_add_cpu(&ni->mi.mrec->hard_links, 1);
1480 ni->mi.dirty = true;
1491 * ni_remove_attr_le - Remove attribute from record.
1493 void ni_remove_attr_le(struct ntfs_inode *ni, struct ATTRIB *attr,
1494 struct mft_inode *mi, struct ATTR_LIST_ENTRY *le)
1496 mi_remove_attr(ni, mi, attr);
1499 al_remove_le(ni, le);
1503 * ni_delete_all - Remove all attributes and frees allocates space.
1505 * ntfs_evict_inode->ntfs_clear_inode->ni_delete_all (if no links).
1507 int ni_delete_all(struct ntfs_inode *ni)
1510 struct ATTR_LIST_ENTRY *le = NULL;
1511 struct ATTRIB *attr = NULL;
1512 struct rb_node *node;
1516 struct ntfs_sb_info *sbi = ni->mi.sbi;
1517 bool nt3 = is_ntfs3(sbi);
1520 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
1521 if (!nt3 || attr->name_len) {
1523 } else if (attr->type == ATTR_REPARSE) {
1524 mi_get_ref(&ni->mi, &ref);
1525 ntfs_remove_reparse(sbi, 0, &ref);
1526 } else if (attr->type == ATTR_ID && !attr->non_res &&
1527 le32_to_cpu(attr->res.data_size) >=
1528 sizeof(struct GUID)) {
1529 ntfs_objid_remove(sbi, resident_data(attr));
1535 svcn = le64_to_cpu(attr->nres.svcn);
1536 evcn = le64_to_cpu(attr->nres.evcn);
1538 if (evcn + 1 <= svcn)
1541 asize = le32_to_cpu(attr->size);
1542 roff = le16_to_cpu(attr->nres.run_off);
1544 /* run==1 means unpack and deallocate. */
1545 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
1546 Add2Ptr(attr, roff), asize - roff);
1549 if (ni->attr_list.size) {
1550 run_deallocate(ni->mi.sbi, &ni->attr_list.run, true);
1554 /* Free all subrecords. */
1555 for (node = rb_first(&ni->mi_tree); node;) {
1556 struct rb_node *next = rb_next(node);
1557 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
1559 clear_rec_inuse(mi->mrec);
1563 ntfs_mark_rec_free(sbi, mi->rno);
1564 ni_remove_mi(ni, mi);
1569 /* Free base record. */
1570 clear_rec_inuse(ni->mi.mrec);
1571 ni->mi.dirty = true;
1572 err = mi_write(&ni->mi, 0);
1574 ntfs_mark_rec_free(sbi, ni->mi.rno);
1581 * Return: File name attribute by its value.
1583 struct ATTR_FILE_NAME *ni_fname_name(struct ntfs_inode *ni,
1584 const struct cpu_str *uni,
1585 const struct MFT_REF *home_dir,
1586 struct mft_inode **mi,
1587 struct ATTR_LIST_ENTRY **le)
1589 struct ATTRIB *attr = NULL;
1590 struct ATTR_FILE_NAME *fname;
1594 /* Enumerate all names. */
1596 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1600 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1604 if (home_dir && memcmp(home_dir, &fname->home, sizeof(*home_dir)))
1610 if (uni->len != fname->name_len)
1613 if (ntfs_cmp_names_cpu(uni, (struct le_str *)&fname->name_len, NULL,
1623 * Return: File name attribute with given type.
1625 struct ATTR_FILE_NAME *ni_fname_type(struct ntfs_inode *ni, u8 name_type,
1626 struct mft_inode **mi,
1627 struct ATTR_LIST_ENTRY **le)
1629 struct ATTRIB *attr = NULL;
1630 struct ATTR_FILE_NAME *fname;
1634 if (name_type == FILE_NAME_POSIX)
1637 /* Enumerate all names. */
1639 attr = ni_find_attr(ni, attr, le, ATTR_NAME, NULL, 0, NULL, mi);
1643 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
1644 if (fname && name_type == fname->type)
1652 * Process compressed/sparsed in special way.
1653 * NOTE: You need to set ni->std_fa = new_fa
1654 * after this function to keep internal structures in consistency.
1656 int ni_new_attr_flags(struct ntfs_inode *ni, enum FILE_ATTRIBUTE new_fa)
1658 struct ATTRIB *attr;
1659 struct mft_inode *mi;
1663 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
1667 new_aflags = attr->flags;
1669 if (new_fa & FILE_ATTRIBUTE_SPARSE_FILE)
1670 new_aflags |= ATTR_FLAG_SPARSED;
1672 new_aflags &= ~ATTR_FLAG_SPARSED;
1674 if (new_fa & FILE_ATTRIBUTE_COMPRESSED)
1675 new_aflags |= ATTR_FLAG_COMPRESSED;
1677 new_aflags &= ~ATTR_FLAG_COMPRESSED;
1679 if (new_aflags == attr->flags)
1682 if ((new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) ==
1683 (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED)) {
1684 ntfs_inode_warn(&ni->vfs_inode,
1685 "file can't be sparsed and compressed");
1692 if (attr->nres.data_size) {
1695 "one can change sparsed/compressed only for empty files");
1699 /* Resize nonresident empty attribute in-place only. */
1700 new_asize = (new_aflags & (ATTR_FLAG_COMPRESSED | ATTR_FLAG_SPARSED))
1701 ? (SIZEOF_NONRESIDENT_EX + 8)
1702 : (SIZEOF_NONRESIDENT + 8);
1704 if (!mi_resize_attr(mi, attr, new_asize - le32_to_cpu(attr->size)))
1707 if (new_aflags & ATTR_FLAG_SPARSED) {
1708 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1709 /* Windows uses 16 clusters per frame but supports one cluster per frame too. */
1710 attr->nres.c_unit = 0;
1711 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1712 } else if (new_aflags & ATTR_FLAG_COMPRESSED) {
1713 attr->name_off = SIZEOF_NONRESIDENT_EX_LE;
1714 /* The only allowed: 16 clusters per frame. */
1715 attr->nres.c_unit = NTFS_LZNT_CUNIT;
1716 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops_cmpr;
1718 attr->name_off = SIZEOF_NONRESIDENT_LE;
1720 attr->nres.c_unit = 0;
1721 ni->vfs_inode.i_mapping->a_ops = &ntfs_aops;
1723 attr->nres.run_off = attr->name_off;
1725 attr->flags = new_aflags;
1734 * buffer - memory for reparse buffer header
1736 enum REPARSE_SIGN ni_parse_reparse(struct ntfs_inode *ni, struct ATTRIB *attr,
1737 struct REPARSE_DATA_BUFFER *buffer)
1739 const struct REPARSE_DATA_BUFFER *rp = NULL;
1742 typeof(rp->CompressReparseBuffer) *cmpr;
1744 /* Try to estimate reparse point. */
1745 if (!attr->non_res) {
1746 rp = resident_data_ex(attr, sizeof(struct REPARSE_DATA_BUFFER));
1747 } else if (le64_to_cpu(attr->nres.data_size) >=
1748 sizeof(struct REPARSE_DATA_BUFFER)) {
1749 struct runs_tree run;
1753 if (!attr_load_runs_vcn(ni, ATTR_REPARSE, NULL, 0, &run, 0) &&
1754 !ntfs_read_run_nb(ni->mi.sbi, &run, 0, buffer,
1755 sizeof(struct REPARSE_DATA_BUFFER),
1764 return REPARSE_NONE;
1766 len = le16_to_cpu(rp->ReparseDataLength);
1767 switch (rp->ReparseTag) {
1768 case (IO_REPARSE_TAG_MICROSOFT | IO_REPARSE_TAG_SYMBOLIC_LINK):
1769 break; /* Symbolic link. */
1770 case IO_REPARSE_TAG_MOUNT_POINT:
1771 break; /* Mount points and junctions. */
1772 case IO_REPARSE_TAG_SYMLINK:
1774 case IO_REPARSE_TAG_COMPRESS:
1776 * WOF - Windows Overlay Filter - Used to compress files with
1779 * Unlike native NTFS file compression, the Windows
1780 * Overlay Filter supports only read operations. This means
1781 * that it doesn't need to sector-align each compressed chunk,
1782 * so the compressed data can be packed more tightly together.
1783 * If you open the file for writing, the WOF just decompresses
1784 * the entire file, turning it back into a plain file.
1786 * Ntfs3 driver decompresses the entire file only on write or
1787 * change size requests.
1790 cmpr = &rp->CompressReparseBuffer;
1791 if (len < sizeof(*cmpr) ||
1792 cmpr->WofVersion != WOF_CURRENT_VERSION ||
1793 cmpr->WofProvider != WOF_PROVIDER_SYSTEM ||
1794 cmpr->ProviderVer != WOF_PROVIDER_CURRENT_VERSION) {
1795 return REPARSE_NONE;
1798 switch (cmpr->CompressionFormat) {
1799 case WOF_COMPRESSION_XPRESS4K:
1802 case WOF_COMPRESSION_XPRESS8K:
1805 case WOF_COMPRESSION_XPRESS16K:
1808 case WOF_COMPRESSION_LZX32K:
1815 ni_set_ext_compress_bits(ni, bits);
1816 return REPARSE_COMPRESSED;
1818 case IO_REPARSE_TAG_DEDUP:
1819 ni->ni_flags |= NI_FLAG_DEDUPLICATED;
1820 return REPARSE_DEDUPLICATED;
1823 if (rp->ReparseTag & IO_REPARSE_TAG_NAME_SURROGATE)
1826 return REPARSE_NONE;
1830 memcpy(buffer, rp, sizeof(struct REPARSE_DATA_BUFFER));
1832 /* Looks like normal symlink. */
1833 return REPARSE_LINK;
1837 * ni_fiemap - Helper for file_fiemap().
1840 * TODO: Less aggressive locks.
1842 int ni_fiemap(struct ntfs_inode *ni, struct fiemap_extent_info *fieinfo,
1843 __u64 vbo, __u64 len)
1846 struct ntfs_sb_info *sbi = ni->mi.sbi;
1847 u8 cluster_bits = sbi->cluster_bits;
1848 struct runs_tree *run;
1849 struct rw_semaphore *run_lock;
1850 struct ATTRIB *attr;
1851 CLST vcn = vbo >> cluster_bits;
1853 u64 valid = ni->i_valid;
1855 u64 end, alloc_size;
1860 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1861 run = &ni->dir.alloc_run;
1862 attr = ni_find_attr(ni, NULL, NULL, ATTR_ALLOC, I30_NAME,
1863 ARRAY_SIZE(I30_NAME), NULL, NULL);
1864 run_lock = &ni->dir.run_lock;
1866 run = &ni->file.run;
1867 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL,
1873 if (is_attr_compressed(attr)) {
1874 /* Unfortunately cp -r incorrectly treats compressed clusters. */
1878 "fiemap is not supported for compressed file (cp -r)");
1881 run_lock = &ni->file.run_lock;
1884 if (!attr || !attr->non_res) {
1885 err = fiemap_fill_next_extent(
1887 attr ? le32_to_cpu(attr->res.data_size) : 0,
1888 FIEMAP_EXTENT_DATA_INLINE | FIEMAP_EXTENT_LAST |
1889 FIEMAP_EXTENT_MERGED);
1894 alloc_size = le64_to_cpu(attr->nres.alloc_size);
1895 if (end > alloc_size)
1898 down_read(run_lock);
1902 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1904 CLST vcn_next = vcn;
1906 ok = run_get_entry(run, ++idx, &vcn, &lcn, &clen) &&
1914 down_write(run_lock);
1916 err = attr_load_runs_vcn(ni, attr->type,
1918 attr->name_len, run, vcn);
1921 down_read(run_lock);
1926 ok = run_lookup_entry(run, vcn, &lcn, &clen, &idx);
1939 if (lcn == SPARSE_LCN) {
1941 vbo = (u64)vcn << cluster_bits;
1945 flags = FIEMAP_EXTENT_MERGED;
1946 if (S_ISDIR(ni->vfs_inode.i_mode)) {
1948 } else if (is_attr_compressed(attr)) {
1951 err = attr_is_frame_compressed(
1952 ni, attr, vcn >> attr->nres.c_unit, &clst_data);
1955 if (clst_data < NTFS_LZNT_CLUSTERS)
1956 flags |= FIEMAP_EXTENT_ENCODED;
1957 } else if (is_attr_encrypted(attr)) {
1958 flags |= FIEMAP_EXTENT_DATA_ENCRYPTED;
1961 vbo = (u64)vcn << cluster_bits;
1962 bytes = (u64)clen << cluster_bits;
1963 lbo = (u64)lcn << cluster_bits;
1967 if (vbo + bytes >= end) {
1969 flags |= FIEMAP_EXTENT_LAST;
1972 if (vbo + bytes <= valid) {
1974 } else if (vbo >= valid) {
1975 flags |= FIEMAP_EXTENT_UNWRITTEN;
1977 /* vbo < valid && valid < vbo + bytes */
1978 u64 dlen = valid - vbo;
1980 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, dlen,
1995 flags |= FIEMAP_EXTENT_UNWRITTEN;
1998 err = fiemap_fill_next_extent(fieinfo, vbo, lbo, bytes, flags);
2018 * When decompressing, we typically obtain more than one page per reference.
2019 * We inject the additional pages into the page cache.
2021 int ni_readpage_cmpr(struct ntfs_inode *ni, struct page *page)
2024 struct ntfs_sb_info *sbi = ni->mi.sbi;
2025 struct address_space *mapping = page->mapping;
2026 pgoff_t index = page->index;
2027 u64 frame_vbo, vbo = (u64)index << PAGE_SHIFT;
2028 struct page **pages = NULL; /* Array of at most 16 pages. stack? */
2031 u32 i, idx, frame_size, pages_per_frame;
2035 if (vbo >= ni->vfs_inode.i_size) {
2036 SetPageUptodate(page);
2041 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2042 /* Xpress or LZX. */
2043 frame_bits = ni_ext_compress_bits(ni);
2045 /* LZNT compression. */
2046 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2048 frame_size = 1u << frame_bits;
2049 frame = vbo >> frame_bits;
2050 frame_vbo = (u64)frame << frame_bits;
2051 idx = (vbo - frame_vbo) >> PAGE_SHIFT;
2053 pages_per_frame = frame_size >> PAGE_SHIFT;
2054 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2061 index = frame_vbo >> PAGE_SHIFT;
2062 gfp_mask = mapping_gfp_mask(mapping);
2064 for (i = 0; i < pages_per_frame; i++, index++) {
2068 pg = find_or_create_page(mapping, index, gfp_mask);
2076 err = ni_read_frame(ni, frame_vbo, pages, pages_per_frame);
2082 for (i = 0; i < pages_per_frame; i++) {
2091 /* At this point, err contains 0 or -EIO depending on the "critical" page. */
2098 #ifdef CONFIG_NTFS3_LZX_XPRESS
2100 * ni_decompress_file - Decompress LZX/Xpress compressed file.
2102 * Remove ATTR_DATA::WofCompressedData.
2103 * Remove ATTR_REPARSE.
2105 int ni_decompress_file(struct ntfs_inode *ni)
2107 struct ntfs_sb_info *sbi = ni->mi.sbi;
2108 struct inode *inode = &ni->vfs_inode;
2109 loff_t i_size = inode->i_size;
2110 struct address_space *mapping = inode->i_mapping;
2111 gfp_t gfp_mask = mapping_gfp_mask(mapping);
2112 struct page **pages = NULL;
2113 struct ATTR_LIST_ENTRY *le;
2114 struct ATTRIB *attr;
2115 CLST vcn, cend, lcn, clen, end;
2119 u32 i, frame_size, pages_per_frame, bytes;
2120 struct mft_inode *mi;
2123 /* Clusters for decompressed data. */
2124 cend = bytes_to_cluster(sbi, i_size);
2129 /* Check in advance. */
2130 if (cend > wnd_zeroes(&sbi->used.bitmap)) {
2135 frame_bits = ni_ext_compress_bits(ni);
2136 frame_size = 1u << frame_bits;
2137 pages_per_frame = frame_size >> PAGE_SHIFT;
2138 pages = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2145 * Step 1: Decompress data and copy to new allocated clusters.
2148 for (vbo = 0; vbo < i_size; vbo += bytes) {
2152 if (vbo + frame_size > i_size) {
2153 bytes = i_size - vbo;
2154 nr_pages = (bytes + PAGE_SIZE - 1) >> PAGE_SHIFT;
2156 nr_pages = pages_per_frame;
2160 end = bytes_to_cluster(sbi, vbo + bytes);
2162 for (vcn = vbo >> sbi->cluster_bits; vcn < end; vcn += clen) {
2163 err = attr_data_get_block(ni, vcn, cend - vcn, &lcn,
2169 for (i = 0; i < pages_per_frame; i++, index++) {
2172 pg = find_or_create_page(mapping, index, gfp_mask);
2175 unlock_page(pages[i]);
2184 err = ni_read_frame(ni, vbo, pages, pages_per_frame);
2187 down_read(&ni->file.run_lock);
2188 err = ntfs_bio_pages(sbi, &ni->file.run, pages,
2189 nr_pages, vbo, bytes,
2191 up_read(&ni->file.run_lock);
2194 for (i = 0; i < pages_per_frame; i++) {
2195 unlock_page(pages[i]);
2207 * Step 2: Deallocate attributes ATTR_DATA::WofCompressedData
2212 while ((attr = ni_enum_attr_ex(ni, attr, &le, NULL))) {
2216 if (attr->type == ATTR_REPARSE) {
2219 mi_get_ref(&ni->mi, &ref);
2220 ntfs_remove_reparse(sbi, 0, &ref);
2226 if (attr->type != ATTR_REPARSE &&
2227 (attr->type != ATTR_DATA ||
2228 attr->name_len != ARRAY_SIZE(WOF_NAME) ||
2229 memcmp(attr_name(attr), WOF_NAME, sizeof(WOF_NAME))))
2232 svcn = le64_to_cpu(attr->nres.svcn);
2233 evcn = le64_to_cpu(attr->nres.evcn);
2235 if (evcn + 1 <= svcn)
2238 asize = le32_to_cpu(attr->size);
2239 roff = le16_to_cpu(attr->nres.run_off);
2241 /*run==1 Means unpack and deallocate. */
2242 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn, evcn, svcn,
2243 Add2Ptr(attr, roff), asize - roff);
2247 * Step 3: Remove attribute ATTR_DATA::WofCompressedData.
2249 err = ni_remove_attr(ni, ATTR_DATA, WOF_NAME, ARRAY_SIZE(WOF_NAME),
2255 * Step 4: Remove ATTR_REPARSE.
2257 err = ni_remove_attr(ni, ATTR_REPARSE, NULL, 0, false, NULL);
2262 * Step 5: Remove sparse flag from data attribute.
2264 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
2270 if (attr->non_res && is_attr_sparsed(attr)) {
2271 /* Sparsed attribute header is 8 bytes bigger than normal. */
2272 struct MFT_REC *rec = mi->mrec;
2273 u32 used = le32_to_cpu(rec->used);
2274 u32 asize = le32_to_cpu(attr->size);
2275 u16 roff = le16_to_cpu(attr->nres.run_off);
2276 char *rbuf = Add2Ptr(attr, roff);
2278 memmove(rbuf - 8, rbuf, used - PtrOffset(rec, rbuf));
2279 attr->size = cpu_to_le32(asize - 8);
2280 attr->flags &= ~ATTR_FLAG_SPARSED;
2281 attr->nres.run_off = cpu_to_le16(roff - 8);
2282 attr->nres.c_unit = 0;
2283 rec->used = cpu_to_le32(used - 8);
2285 ni->std_fa &= ~(FILE_ATTRIBUTE_SPARSE_FILE |
2286 FILE_ATTRIBUTE_REPARSE_POINT);
2288 mark_inode_dirty(inode);
2291 /* Clear cached flag. */
2292 ni->ni_flags &= ~NI_FLAG_COMPRESSED_MASK;
2293 if (ni->file.offs_page) {
2294 put_page(ni->file.offs_page);
2295 ni->file.offs_page = NULL;
2297 mapping->a_ops = &ntfs_aops;
2302 make_bad_inode(inode);
2303 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
2310 * decompress_lzx_xpress - External compression LZX/Xpress.
2312 static int decompress_lzx_xpress(struct ntfs_sb_info *sbi, const char *cmpr,
2313 size_t cmpr_size, void *unc, size_t unc_size,
2319 if (cmpr_size == unc_size) {
2320 /* Frame not compressed. */
2321 memcpy(unc, cmpr, unc_size);
2326 if (frame_size == 0x8000) {
2327 mutex_lock(&sbi->compress.mtx_lzx);
2328 /* LZX: Frame compressed. */
2329 ctx = sbi->compress.lzx;
2331 /* Lazy initialize LZX decompress context. */
2332 ctx = lzx_allocate_decompressor();
2338 sbi->compress.lzx = ctx;
2341 if (lzx_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2342 /* Treat all errors as "invalid argument". */
2346 mutex_unlock(&sbi->compress.mtx_lzx);
2348 /* XPRESS: Frame compressed. */
2349 mutex_lock(&sbi->compress.mtx_xpress);
2350 ctx = sbi->compress.xpress;
2352 /* Lazy initialize Xpress decompress context. */
2353 ctx = xpress_allocate_decompressor();
2359 sbi->compress.xpress = ctx;
2362 if (xpress_decompress(ctx, cmpr, cmpr_size, unc, unc_size)) {
2363 /* Treat all errors as "invalid argument". */
2367 mutex_unlock(&sbi->compress.mtx_xpress);
2376 * Pages - Array of locked pages.
2378 int ni_read_frame(struct ntfs_inode *ni, u64 frame_vbo, struct page **pages,
2379 u32 pages_per_frame)
2382 struct ntfs_sb_info *sbi = ni->mi.sbi;
2383 u8 cluster_bits = sbi->cluster_bits;
2384 char *frame_ondisk = NULL;
2385 char *frame_mem = NULL;
2386 struct page **pages_disk = NULL;
2387 struct ATTR_LIST_ENTRY *le = NULL;
2388 struct runs_tree *run = &ni->file.run;
2389 u64 valid_size = ni->i_valid;
2392 u32 frame_size, i, npages_disk, ondisk_size;
2394 struct ATTRIB *attr;
2395 CLST frame, clst_data;
2398 * To simplify decompress algorithm do vmap for source
2401 for (i = 0; i < pages_per_frame; i++)
2404 frame_size = pages_per_frame << PAGE_SHIFT;
2405 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL);
2411 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, NULL);
2417 if (!attr->non_res) {
2418 u32 data_size = le32_to_cpu(attr->res.data_size);
2420 memset(frame_mem, 0, frame_size);
2421 if (frame_vbo < data_size) {
2422 ondisk_size = data_size - frame_vbo;
2423 memcpy(frame_mem, resident_data(attr) + frame_vbo,
2424 min(ondisk_size, frame_size));
2430 if (frame_vbo >= valid_size) {
2431 memset(frame_mem, 0, frame_size);
2436 if (ni->ni_flags & NI_FLAG_COMPRESSED_MASK) {
2437 #ifndef CONFIG_NTFS3_LZX_XPRESS
2441 u32 frame_bits = ni_ext_compress_bits(ni);
2442 u64 frame64 = frame_vbo >> frame_bits;
2443 u64 frames, vbo_data;
2445 if (frame_size != (1u << frame_bits)) {
2449 switch (frame_size) {
2456 /* Unknown compression. */
2461 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, WOF_NAME,
2462 ARRAY_SIZE(WOF_NAME), NULL, NULL);
2466 "external compressed file should contains data attribute \"WofCompressedData\"");
2471 if (!attr->non_res) {
2481 frames = (ni->vfs_inode.i_size - 1) >> frame_bits;
2483 err = attr_wof_frame_info(ni, attr, run, frame64, frames,
2484 frame_bits, &ondisk_size, &vbo_data);
2488 if (frame64 == frames) {
2489 unc_size = 1 + ((ni->vfs_inode.i_size - 1) &
2491 ondisk_size = attr_size(attr) - vbo_data;
2493 unc_size = frame_size;
2496 if (ondisk_size > frame_size) {
2501 if (!attr->non_res) {
2502 if (vbo_data + ondisk_size >
2503 le32_to_cpu(attr->res.data_size)) {
2508 err = decompress_lzx_xpress(
2509 sbi, Add2Ptr(resident_data(attr), vbo_data),
2510 ondisk_size, frame_mem, unc_size, frame_size);
2513 vbo_disk = vbo_data;
2514 /* Load all runs to read [vbo_disk-vbo_to). */
2515 err = attr_load_runs_range(ni, ATTR_DATA, WOF_NAME,
2516 ARRAY_SIZE(WOF_NAME), run, vbo_disk,
2517 vbo_data + ondisk_size);
2520 npages_disk = (ondisk_size + (vbo_disk & (PAGE_SIZE - 1)) +
2524 } else if (is_attr_compressed(attr)) {
2525 /* LZNT compression. */
2526 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2531 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2536 down_write(&ni->file.run_lock);
2537 run_truncate_around(run, le64_to_cpu(attr->nres.svcn));
2538 frame = frame_vbo >> (cluster_bits + NTFS_LZNT_CUNIT);
2539 err = attr_is_frame_compressed(ni, attr, frame, &clst_data);
2540 up_write(&ni->file.run_lock);
2545 memset(frame_mem, 0, frame_size);
2549 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2550 ondisk_size = clst_data << cluster_bits;
2552 if (clst_data >= NTFS_LZNT_CLUSTERS) {
2553 /* Frame is not compressed. */
2554 down_read(&ni->file.run_lock);
2555 err = ntfs_bio_pages(sbi, run, pages, pages_per_frame,
2556 frame_vbo, ondisk_size,
2558 up_read(&ni->file.run_lock);
2561 vbo_disk = frame_vbo;
2562 npages_disk = (ondisk_size + PAGE_SIZE - 1) >> PAGE_SHIFT;
2564 __builtin_unreachable();
2569 pages_disk = kzalloc(npages_disk * sizeof(struct page *), GFP_NOFS);
2575 for (i = 0; i < npages_disk; i++) {
2576 pg = alloc_page(GFP_KERNEL);
2586 /* Read 'ondisk_size' bytes from disk. */
2587 down_read(&ni->file.run_lock);
2588 err = ntfs_bio_pages(sbi, run, pages_disk, npages_disk, vbo_disk,
2589 ondisk_size, REQ_OP_READ);
2590 up_read(&ni->file.run_lock);
2595 * To simplify decompress algorithm do vmap for source and target pages.
2597 frame_ondisk = vmap(pages_disk, npages_disk, VM_MAP, PAGE_KERNEL_RO);
2598 if (!frame_ondisk) {
2603 /* Decompress: Frame_ondisk -> frame_mem. */
2604 #ifdef CONFIG_NTFS3_LZX_XPRESS
2605 if (run != &ni->file.run) {
2607 err = decompress_lzx_xpress(
2608 sbi, frame_ondisk + (vbo_disk & (PAGE_SIZE - 1)),
2609 ondisk_size, frame_mem, unc_size, frame_size);
2613 /* LZNT - Native NTFS compression. */
2614 unc_size = decompress_lznt(frame_ondisk, ondisk_size, frame_mem,
2616 if ((ssize_t)unc_size < 0)
2618 else if (!unc_size || unc_size > frame_size)
2621 if (!err && valid_size < frame_vbo + frame_size) {
2622 size_t ok = valid_size - frame_vbo;
2624 memset(frame_mem + ok, 0, frame_size - ok);
2627 vunmap(frame_ondisk);
2630 for (i = 0; i < npages_disk; i++) {
2641 #ifdef CONFIG_NTFS3_LZX_XPRESS
2642 if (run != &ni->file.run)
2648 for (i = 0; i < pages_per_frame; i++) {
2652 SetPageUptodate(pg);
2661 * Pages - Array of locked pages.
2663 int ni_write_frame(struct ntfs_inode *ni, struct page **pages,
2664 u32 pages_per_frame)
2667 struct ntfs_sb_info *sbi = ni->mi.sbi;
2668 u8 frame_bits = NTFS_LZNT_CUNIT + sbi->cluster_bits;
2669 u32 frame_size = sbi->cluster_size << NTFS_LZNT_CUNIT;
2670 u64 frame_vbo = (u64)pages[0]->index << PAGE_SHIFT;
2671 CLST frame = frame_vbo >> frame_bits;
2672 char *frame_ondisk = NULL;
2673 struct page **pages_disk = NULL;
2674 struct ATTR_LIST_ENTRY *le = NULL;
2676 struct ATTRIB *attr;
2677 struct mft_inode *mi;
2680 size_t compr_size, ondisk_size;
2683 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL, &mi);
2689 if (WARN_ON(!is_attr_compressed(attr))) {
2694 if (sbi->cluster_size > NTFS_LZNT_MAX_CLUSTER) {
2699 if (!attr->non_res) {
2700 down_write(&ni->file.run_lock);
2701 err = attr_make_nonresident(ni, attr, le, mi,
2702 le32_to_cpu(attr->res.data_size),
2703 &ni->file.run, &attr, pages[0]);
2704 up_write(&ni->file.run_lock);
2709 if (attr->nres.c_unit != NTFS_LZNT_CUNIT) {
2714 pages_disk = kcalloc(pages_per_frame, sizeof(struct page *), GFP_NOFS);
2720 for (i = 0; i < pages_per_frame; i++) {
2721 pg = alloc_page(GFP_KERNEL);
2731 /* To simplify compress algorithm do vmap for source and target pages. */
2732 frame_ondisk = vmap(pages_disk, pages_per_frame, VM_MAP, PAGE_KERNEL);
2733 if (!frame_ondisk) {
2738 for (i = 0; i < pages_per_frame; i++)
2741 /* Map in-memory frame for read-only. */
2742 frame_mem = vmap(pages, pages_per_frame, VM_MAP, PAGE_KERNEL_RO);
2748 mutex_lock(&sbi->compress.mtx_lznt);
2750 if (!sbi->compress.lznt) {
2752 * LZNT implements two levels of compression:
2753 * 0 - Standard compression
2754 * 1 - Best compression, requires a lot of cpu
2757 lznt = get_lznt_ctx(0);
2759 mutex_unlock(&sbi->compress.mtx_lznt);
2764 sbi->compress.lznt = lznt;
2768 /* Compress: frame_mem -> frame_ondisk */
2769 compr_size = compress_lznt(frame_mem, frame_size, frame_ondisk,
2770 frame_size, sbi->compress.lznt);
2771 mutex_unlock(&sbi->compress.mtx_lznt);
2774 if (compr_size + sbi->cluster_size > frame_size) {
2775 /* Frame is not compressed. */
2776 compr_size = frame_size;
2777 ondisk_size = frame_size;
2778 } else if (compr_size) {
2779 /* Frame is compressed. */
2780 ondisk_size = ntfs_up_cluster(sbi, compr_size);
2781 memset(frame_ondisk + compr_size, 0, ondisk_size - compr_size);
2783 /* Frame is sparsed. */
2787 down_write(&ni->file.run_lock);
2788 run_truncate_around(&ni->file.run, le64_to_cpu(attr->nres.svcn));
2789 err = attr_allocate_frame(ni, frame, compr_size, ni->i_valid);
2790 up_write(&ni->file.run_lock);
2797 down_read(&ni->file.run_lock);
2798 err = ntfs_bio_pages(sbi, &ni->file.run,
2799 ondisk_size < frame_size ? pages_disk : pages,
2800 pages_per_frame, frame_vbo, ondisk_size,
2802 up_read(&ni->file.run_lock);
2808 for (i = 0; i < pages_per_frame; i++)
2811 vunmap(frame_ondisk);
2813 for (i = 0; i < pages_per_frame; i++) {
2827 * ni_remove_name - Removes name 'de' from MFT and from directory.
2828 * 'de2' and 'undo_step' are used to restore MFT/dir, if error occurs.
2830 int ni_remove_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2831 struct NTFS_DE *de, struct NTFS_DE **de2, int *undo_step)
2834 struct ntfs_sb_info *sbi = ni->mi.sbi;
2835 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2836 struct ATTR_FILE_NAME *fname;
2837 struct ATTR_LIST_ENTRY *le;
2838 struct mft_inode *mi;
2839 u16 de_key_size = le16_to_cpu(de->key_size);
2844 /* Find name in record. */
2845 mi_get_ref(&dir_ni->mi, &de_name->home);
2847 fname = ni_fname_name(ni, (struct cpu_str *)&de_name->name_len,
2848 &de_name->home, &mi, &le);
2852 memcpy(&de_name->dup, &fname->dup, sizeof(struct NTFS_DUP_INFO));
2853 name_type = paired_name(fname->type);
2855 /* Mark ntfs as dirty. It will be cleared at umount. */
2856 ntfs_set_state(sbi, NTFS_DIRTY_DIRTY);
2858 /* Step 1: Remove name from directory. */
2859 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname, de_key_size, sbi);
2863 /* Step 2: Remove name from MFT. */
2864 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2868 /* Get paired name. */
2869 fname = ni_fname_type(ni, name_type, &mi, &le);
2871 u16 de2_key_size = fname_full_size(fname);
2873 *de2 = Add2Ptr(de, 1024);
2874 (*de2)->key_size = cpu_to_le16(de2_key_size);
2876 memcpy(*de2 + 1, fname, de2_key_size);
2878 /* Step 3: Remove paired name from directory. */
2879 err = indx_delete_entry(&dir_ni->dir, dir_ni, fname,
2884 /* Step 4: Remove paired name from MFT. */
2885 ni_remove_attr_le(ni, attr_from_name(fname), mi, le);
2893 * ni_remove_name_undo - Paired function for ni_remove_name.
2895 * Return: True if ok
2897 bool ni_remove_name_undo(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2898 struct NTFS_DE *de, struct NTFS_DE *de2, int undo_step)
2900 struct ntfs_sb_info *sbi = ni->mi.sbi;
2901 struct ATTRIB *attr;
2902 u16 de_key_size = de2 ? le16_to_cpu(de2->key_size) : 0;
2904 switch (undo_step) {
2906 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2907 &attr, NULL, NULL)) {
2910 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de2 + 1, de_key_size);
2912 mi_get_ref(&ni->mi, &de2->ref);
2913 de2->size = cpu_to_le16(ALIGN(de_key_size, 8) +
2914 sizeof(struct NTFS_DE));
2918 if (indx_insert_entry(&dir_ni->dir, dir_ni, de2, sbi, NULL,
2925 de_key_size = le16_to_cpu(de->key_size);
2927 if (ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0,
2928 &attr, NULL, NULL)) {
2932 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de + 1, de_key_size);
2933 mi_get_ref(&ni->mi, &de->ref);
2935 if (indx_insert_entry(&dir_ni->dir, dir_ni, de, sbi, NULL, 1))
2943 * ni_add_name - Add new name in MFT and in directory.
2945 int ni_add_name(struct ntfs_inode *dir_ni, struct ntfs_inode *ni,
2949 struct ATTRIB *attr;
2950 struct ATTR_LIST_ENTRY *le;
2951 struct mft_inode *mi;
2952 struct ATTR_FILE_NAME *de_name = (struct ATTR_FILE_NAME *)(de + 1);
2953 u16 de_key_size = le16_to_cpu(de->key_size);
2955 mi_get_ref(&ni->mi, &de->ref);
2956 mi_get_ref(&dir_ni->mi, &de_name->home);
2958 /* Insert new name in MFT. */
2959 err = ni_insert_resident(ni, de_key_size, ATTR_NAME, NULL, 0, &attr,
2964 memcpy(Add2Ptr(attr, SIZEOF_RESIDENT), de_name, de_key_size);
2966 /* Insert new name in directory. */
2967 err = indx_insert_entry(&dir_ni->dir, dir_ni, de, ni->mi.sbi, NULL, 0);
2969 ni_remove_attr_le(ni, attr, mi, le);
2975 * ni_rename - Remove one name and insert new name.
2977 int ni_rename(struct ntfs_inode *dir_ni, struct ntfs_inode *new_dir_ni,
2978 struct ntfs_inode *ni, struct NTFS_DE *de, struct NTFS_DE *new_de,
2982 struct NTFS_DE *de2 = NULL;
2986 * There are two possible ways to rename:
2987 * 1) Add new name and remove old name.
2988 * 2) Remove old name and add new name.
2990 * In most cases (not all!) adding new name in MFT and in directory can
2991 * allocate additional cluster(s).
2992 * Second way may result to bad inode if we can't add new name
2993 * and then can't restore (add) old name.
2997 * Way 1 - Add new + remove old.
2999 err = ni_add_name(new_dir_ni, ni, new_de);
3001 err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3002 if (err && ni_remove_name(new_dir_ni, ni, new_de, &de2, &undo))
3007 * Way 2 - Remove old + add new.
3010 * err = ni_remove_name(dir_ni, ni, de, &de2, &undo);
3012 * err = ni_add_name(new_dir_ni, ni, new_de);
3013 * if (err && !ni_remove_name_undo(dir_ni, ni, de, de2, undo))
3022 * ni_is_dirty - Return: True if 'ni' requires ni_write_inode.
3024 bool ni_is_dirty(struct inode *inode)
3026 struct ntfs_inode *ni = ntfs_i(inode);
3027 struct rb_node *node;
3029 if (ni->mi.dirty || ni->attr_list.dirty ||
3030 (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3033 for (node = rb_first(&ni->mi_tree); node; node = rb_next(node)) {
3034 if (rb_entry(node, struct mft_inode, node)->dirty)
3044 * Update duplicate info of ATTR_FILE_NAME in MFT and in parent directories.
3046 static bool ni_update_parent(struct ntfs_inode *ni, struct NTFS_DUP_INFO *dup,
3049 struct ATTRIB *attr;
3050 struct mft_inode *mi;
3051 struct ATTR_LIST_ENTRY *le = NULL;
3052 struct ntfs_sb_info *sbi = ni->mi.sbi;
3053 struct super_block *sb = sbi->sb;
3054 bool re_dirty = false;
3056 if (ni->mi.mrec->flags & RECORD_FLAG_DIR) {
3057 dup->fa |= FILE_ATTRIBUTE_DIRECTORY;
3059 dup->alloc_size = 0;
3062 dup->fa &= ~FILE_ATTRIBUTE_DIRECTORY;
3064 attr = ni_find_attr(ni, NULL, &le, ATTR_DATA, NULL, 0, NULL,
3067 dup->alloc_size = dup->data_size = 0;
3068 } else if (!attr->non_res) {
3069 u32 data_size = le32_to_cpu(attr->res.data_size);
3071 dup->alloc_size = cpu_to_le64(ALIGN(data_size, 8));
3072 dup->data_size = cpu_to_le64(data_size);
3074 u64 new_valid = ni->i_valid;
3075 u64 data_size = le64_to_cpu(attr->nres.data_size);
3078 dup->alloc_size = is_attr_ext(attr)
3079 ? attr->nres.total_size
3080 : attr->nres.alloc_size;
3081 dup->data_size = attr->nres.data_size;
3083 if (new_valid > data_size)
3084 new_valid = data_size;
3086 valid_le = cpu_to_le64(new_valid);
3087 if (valid_le != attr->nres.valid_size) {
3088 attr->nres.valid_size = valid_le;
3094 /* TODO: Fill reparse info. */
3098 if (ni->ni_flags & NI_FLAG_EA) {
3099 attr = ni_find_attr(ni, attr, &le, ATTR_EA_INFO, NULL, 0, NULL,
3102 const struct EA_INFO *info;
3104 info = resident_data_ex(attr, sizeof(struct EA_INFO));
3105 /* If ATTR_EA_INFO exists 'info' can't be NULL. */
3107 dup->ea_size = info->size_pack;
3114 while ((attr = ni_find_attr(ni, attr, &le, ATTR_NAME, NULL, 0, NULL,
3117 struct ATTR_FILE_NAME *fname;
3119 fname = resident_data_ex(attr, SIZEOF_ATTRIBUTE_FILENAME);
3120 if (!fname || !memcmp(&fname->dup, dup, sizeof(fname->dup)))
3123 /* ntfs_iget5 may sleep. */
3124 dir = ntfs_iget5(sb, &fname->home, NULL);
3128 "failed to open parent directory r=%lx to update",
3129 (long)ino_get(&fname->home));
3133 if (!is_bad_inode(dir)) {
3134 struct ntfs_inode *dir_ni = ntfs_i(dir);
3136 if (!ni_trylock(dir_ni)) {
3139 indx_update_dup(dir_ni, sbi, fname, dup, sync);
3141 memcpy(&fname->dup, dup, sizeof(fname->dup));
3152 * ni_write_inode - Write MFT base record and all subrecords to disk.
3154 int ni_write_inode(struct inode *inode, int sync, const char *hint)
3157 struct ntfs_inode *ni = ntfs_i(inode);
3158 struct super_block *sb = inode->i_sb;
3159 struct ntfs_sb_info *sbi = sb->s_fs_info;
3160 bool re_dirty = false;
3161 struct ATTR_STD_INFO *std;
3162 struct rb_node *node, *next;
3163 struct NTFS_DUP_INFO dup;
3165 if (is_bad_inode(inode) || sb_rdonly(sb))
3168 if (!ni_trylock(ni)) {
3169 /* 'ni' is under modification, skip for now. */
3170 mark_inode_dirty_sync(inode);
3174 if (is_rec_inuse(ni->mi.mrec) &&
3175 !(sbi->flags & NTFS_FLAGS_LOG_REPLAYING) && inode->i_nlink) {
3176 bool modified = false;
3178 /* Update times in standard attribute. */
3185 /* Update the access times if they have changed. */
3186 dup.m_time = kernel2nt(&inode->i_mtime);
3187 if (std->m_time != dup.m_time) {
3188 std->m_time = dup.m_time;
3192 dup.c_time = kernel2nt(&inode->i_ctime);
3193 if (std->c_time != dup.c_time) {
3194 std->c_time = dup.c_time;
3198 dup.a_time = kernel2nt(&inode->i_atime);
3199 if (std->a_time != dup.a_time) {
3200 std->a_time = dup.a_time;
3204 dup.fa = ni->std_fa;
3205 if (std->fa != dup.fa) {
3211 ni->mi.dirty = true;
3213 if (!ntfs_is_meta_file(sbi, inode->i_ino) &&
3214 (modified || (ni->ni_flags & NI_FLAG_UPDATE_PARENT))
3215 /* Avoid __wait_on_freeing_inode(inode). */
3216 && (sb->s_flags & SB_ACTIVE)) {
3217 dup.cr_time = std->cr_time;
3218 /* Not critical if this function fail. */
3219 re_dirty = ni_update_parent(ni, &dup, sync);
3222 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
3224 ni->ni_flags &= ~NI_FLAG_UPDATE_PARENT;
3227 /* Update attribute list. */
3228 if (ni->attr_list.size && ni->attr_list.dirty) {
3229 if (inode->i_ino != MFT_REC_MFT || sync) {
3230 err = ni_try_remove_attr_list(ni);
3235 err = al_update(ni, sync);
3241 for (node = rb_first(&ni->mi_tree); node; node = next) {
3242 struct mft_inode *mi = rb_entry(node, struct mft_inode, node);
3245 next = rb_next(node);
3250 is_empty = !mi_enum_attr(mi, NULL);
3253 clear_rec_inuse(mi->mrec);
3255 err2 = mi_write(mi, sync);
3260 ntfs_mark_rec_free(sbi, mi->rno);
3261 rb_erase(node, &ni->mi_tree);
3267 err2 = mi_write(&ni->mi, sync);
3275 ntfs_err(sb, "%s r=%lx failed, %d.", hint, inode->i_ino, err);
3276 ntfs_set_state(sbi, NTFS_DIRTY_ERROR);
3281 mark_inode_dirty_sync(inode);