1 // SPDX-License-Identifier: GPL-2.0
4 * Copyright (C) 2019-2021 Paragon Software GmbH, All rights reserved.
6 * TODO: Merge attr_set_size/attr_data_get_block/attr_allocate_frame?
10 #include <linux/slab.h>
11 #include <linux/kernel.h>
18 * You can set external NTFS_MIN_LOG2_OF_CLUMP/NTFS_MAX_LOG2_OF_CLUMP to manage
19 * preallocate algorithm.
21 #ifndef NTFS_MIN_LOG2_OF_CLUMP
22 #define NTFS_MIN_LOG2_OF_CLUMP 16
25 #ifndef NTFS_MAX_LOG2_OF_CLUMP
26 #define NTFS_MAX_LOG2_OF_CLUMP 26
30 #define NTFS_CLUMP_MIN (1 << (NTFS_MIN_LOG2_OF_CLUMP + 8))
32 #define NTFS_CLUMP_MAX (1ull << (NTFS_MAX_LOG2_OF_CLUMP + 8))
34 static inline u64 get_pre_allocated(u64 size)
40 if (size <= NTFS_CLUMP_MIN) {
41 clump = 1 << NTFS_MIN_LOG2_OF_CLUMP;
42 align_shift = NTFS_MIN_LOG2_OF_CLUMP;
43 } else if (size >= NTFS_CLUMP_MAX) {
44 clump = 1 << NTFS_MAX_LOG2_OF_CLUMP;
45 align_shift = NTFS_MAX_LOG2_OF_CLUMP;
47 align_shift = NTFS_MIN_LOG2_OF_CLUMP - 1 +
48 __ffs(size >> (8 + NTFS_MIN_LOG2_OF_CLUMP));
49 clump = 1u << align_shift;
52 ret = (((size + clump - 1) >> align_shift)) << align_shift;
58 * attr_load_runs - Load all runs stored in @attr.
60 static int attr_load_runs(struct ATTRIB *attr, struct ntfs_inode *ni,
61 struct runs_tree *run, const CLST *vcn)
64 CLST svcn = le64_to_cpu(attr->nres.svcn);
65 CLST evcn = le64_to_cpu(attr->nres.evcn);
69 if (svcn >= evcn + 1 || run_is_mapped_full(run, svcn, evcn))
72 if (vcn && (evcn < *vcn || *vcn < svcn))
75 asize = le32_to_cpu(attr->size);
76 run_off = le16_to_cpu(attr->nres.run_off);
81 err = run_unpack_ex(run, ni->mi.sbi, ni->mi.rno, svcn, evcn,
82 vcn ? *vcn : svcn, Add2Ptr(attr, run_off),
91 * run_deallocate_ex - Deallocate clusters.
93 static int run_deallocate_ex(struct ntfs_sb_info *sbi, struct runs_tree *run,
94 CLST vcn, CLST len, CLST *done, bool trim)
97 CLST vcn_next, vcn0 = vcn, lcn, clen, dn = 0;
103 if (!run_lookup_entry(run, vcn, &lcn, &clen, &idx)) {
105 run_truncate(run, vcn0);
119 if (lcn != SPARSE_LCN) {
121 /* mark bitmap range [lcn + clen) as free and trim clusters. */
122 mark_as_free_ex(sbi, lcn, clen, trim);
131 vcn_next = vcn + clen;
132 if (!run_get_entry(run, ++idx, &vcn, &lcn, &clen) ||
134 /* Save memory - don't load entire run. */
147 * attr_allocate_clusters - Find free space, mark it as used and store in @run.
149 int attr_allocate_clusters(struct ntfs_sb_info *sbi, struct runs_tree *run,
150 CLST vcn, CLST lcn, CLST len, CLST *pre_alloc,
151 enum ALLOCATE_OPT opt, CLST *alen, const size_t fr,
152 CLST *new_lcn, CLST *new_len)
155 CLST flen, vcn0 = vcn, pre = pre_alloc ? *pre_alloc : 0;
156 size_t cnt = run->count;
159 err = ntfs_look_for_free_space(sbi, lcn, len + pre, &lcn, &flen,
162 if (err == -ENOSPC && pre) {
173 /* Return the first fragment. */
180 /* Add new fragment into run storage. */
181 if (!run_add_entry(run, vcn, lcn, flen, opt & ALLOCATE_MFT)) {
182 /* Undo last 'ntfs_look_for_free_space' */
183 mark_as_free_ex(sbi, lcn, len, false);
188 if (opt & ALLOCATE_ZERO) {
189 u8 shift = sbi->cluster_bits - SECTOR_SHIFT;
191 err = blkdev_issue_zeroout(sbi->sb->s_bdev,
192 (sector_t)lcn << shift,
193 (sector_t)flen << shift,
201 if (flen >= len || (opt & ALLOCATE_MFT) ||
202 (fr && run->count - cnt >= fr)) {
211 /* Undo 'ntfs_look_for_free_space' */
213 run_deallocate_ex(sbi, run, vcn0, vcn - vcn0, NULL, false);
214 run_truncate(run, vcn0);
221 * attr_make_nonresident
223 * If page is not NULL - it is already contains resident data
224 * and locked (called from ni_write_frame()).
226 int attr_make_nonresident(struct ntfs_inode *ni, struct ATTRIB *attr,
227 struct ATTR_LIST_ENTRY *le, struct mft_inode *mi,
228 u64 new_size, struct runs_tree *run,
229 struct ATTRIB **ins_attr, struct page *page)
231 struct ntfs_sb_info *sbi;
232 struct ATTRIB *attr_s;
234 u32 used, asize, rsize, aoff, align;
248 used = le32_to_cpu(rec->used);
249 asize = le32_to_cpu(attr->size);
250 next = Add2Ptr(attr, asize);
251 aoff = PtrOffset(rec, attr);
252 rsize = le32_to_cpu(attr->res.data_size);
253 is_data = attr->type == ATTR_DATA && !attr->name_len;
255 align = sbi->cluster_size;
256 if (is_attr_compressed(attr))
257 align <<= COMPRESSION_UNIT;
258 len = (rsize + align - 1) >> sbi->cluster_bits;
262 /* Make a copy of original attribute. */
263 attr_s = kmemdup(attr, asize, GFP_NOFS);
270 /* Empty resident -> Empty nonresident. */
273 const char *data = resident_data(attr);
275 err = attr_allocate_clusters(sbi, run, 0, 0, len, NULL,
276 ALLOCATE_DEF, &alen, 0, NULL,
282 /* Empty resident -> Non empty nonresident. */
283 } else if (!is_data) {
284 err = ntfs_sb_write_run(sbi, run, 0, data, rsize, 0);
290 page = grab_cache_page(ni->vfs_inode.i_mapping, 0);
295 kaddr = kmap_atomic(page);
296 memcpy(kaddr, data, rsize);
297 memset(kaddr + rsize, 0, PAGE_SIZE - rsize);
298 kunmap_atomic(kaddr);
299 flush_dcache_page(page);
300 SetPageUptodate(page);
301 set_page_dirty(page);
307 /* Remove original attribute. */
309 memmove(attr, Add2Ptr(attr, asize), used - aoff);
310 rec->used = cpu_to_le32(used);
313 al_remove_le(ni, le);
315 err = ni_insert_nonresident(ni, attr_s->type, attr_name(attr_s),
316 attr_s->name_len, run, 0, alen,
317 attr_s->flags, &attr, NULL, NULL);
322 attr->nres.data_size = cpu_to_le64(rsize);
323 attr->nres.valid_size = attr->nres.data_size;
328 ni->ni_flags &= ~NI_FLAG_RESIDENT;
330 /* Resident attribute becomes non resident. */
334 attr = Add2Ptr(rec, aoff);
335 memmove(next, attr, used - aoff);
336 memcpy(attr, attr_s, asize);
337 rec->used = cpu_to_le32(used + asize);
340 /* Undo: do not trim new allocated clusters. */
341 run_deallocate(sbi, run, false);
350 * attr_set_size_res - Helper for attr_set_size().
352 static int attr_set_size_res(struct ntfs_inode *ni, struct ATTRIB *attr,
353 struct ATTR_LIST_ENTRY *le, struct mft_inode *mi,
354 u64 new_size, struct runs_tree *run,
355 struct ATTRIB **ins_attr)
357 struct ntfs_sb_info *sbi = mi->sbi;
358 struct MFT_REC *rec = mi->mrec;
359 u32 used = le32_to_cpu(rec->used);
360 u32 asize = le32_to_cpu(attr->size);
361 u32 aoff = PtrOffset(rec, attr);
362 u32 rsize = le32_to_cpu(attr->res.data_size);
363 u32 tail = used - aoff - asize;
364 char *next = Add2Ptr(attr, asize);
365 s64 dsize = ALIGN(new_size, 8) - ALIGN(rsize, 8);
368 memmove(next + dsize, next, tail);
369 } else if (dsize > 0) {
370 if (used + dsize > sbi->max_bytes_per_attr)
371 return attr_make_nonresident(ni, attr, le, mi, new_size,
372 run, ins_attr, NULL);
374 memmove(next + dsize, next, tail);
375 memset(next, 0, dsize);
378 if (new_size > rsize)
379 memset(Add2Ptr(resident_data(attr), rsize), 0,
382 rec->used = cpu_to_le32(used + dsize);
383 attr->size = cpu_to_le32(asize + dsize);
384 attr->res.data_size = cpu_to_le32(new_size);
392 * attr_set_size - Change the size of attribute.
395 * - Sparse/compressed: No allocated clusters.
396 * - Normal: Append allocated and preallocated new clusters.
398 * - No deallocate if @keep_prealloc is set.
400 int attr_set_size(struct ntfs_inode *ni, enum ATTR_TYPE type,
401 const __le16 *name, u8 name_len, struct runs_tree *run,
402 u64 new_size, const u64 *new_valid, bool keep_prealloc,
406 struct ntfs_sb_info *sbi = ni->mi.sbi;
407 u8 cluster_bits = sbi->cluster_bits;
408 bool is_mft = ni->mi.rno == MFT_REC_MFT && type == ATTR_DATA &&
410 u64 old_valid, old_size, old_alloc, new_alloc, new_alloc_tmp;
411 struct ATTRIB *attr = NULL, *attr_b;
412 struct ATTR_LIST_ENTRY *le, *le_b;
413 struct mft_inode *mi, *mi_b;
414 CLST alen, vcn, lcn, new_alen, old_alen, svcn, evcn;
415 CLST next_svcn, pre_alloc = -1, done = 0;
416 bool is_ext, is_bad = false;
424 attr_b = ni_find_attr(ni, NULL, &le_b, type, name, name_len, NULL,
431 if (!attr_b->non_res) {
432 err = attr_set_size_res(ni, attr_b, le_b, mi_b, new_size, run,
437 /* Return if file is still resident. */
438 if (!attr_b->non_res) {
443 /* Layout of records may be changed, so do a full search. */
447 is_ext = is_attr_ext(attr_b);
448 align = sbi->cluster_size;
450 align <<= attr_b->nres.c_unit;
452 old_valid = le64_to_cpu(attr_b->nres.valid_size);
453 old_size = le64_to_cpu(attr_b->nres.data_size);
454 old_alloc = le64_to_cpu(attr_b->nres.alloc_size);
457 old_alen = old_alloc >> cluster_bits;
459 new_alloc = (new_size + align - 1) & ~(u64)(align - 1);
460 new_alen = new_alloc >> cluster_bits;
462 if (keep_prealloc && new_size < old_size) {
463 attr_b->nres.data_size = cpu_to_le64(new_size);
464 mi_b->dirty = dirty = true;
470 svcn = le64_to_cpu(attr_b->nres.svcn);
471 evcn = le64_to_cpu(attr_b->nres.evcn);
473 if (svcn <= vcn && vcn <= evcn) {
482 attr = ni_find_attr(ni, attr_b, &le, type, name, name_len, &vcn,
490 svcn = le64_to_cpu(attr->nres.svcn);
491 evcn = le64_to_cpu(attr->nres.evcn);
495 * attr,mi,le - last attribute segment (containing 'vcn').
496 * attr_b,mi_b,le_b - base (primary) attribute segment.
500 err = attr_load_runs(attr, ni, run, NULL);
504 if (new_size > old_size) {
508 if (new_alloc <= old_alloc) {
509 attr_b->nres.data_size = cpu_to_le64(new_size);
510 mi_b->dirty = dirty = true;
515 * Add clusters. In simple case we have to:
516 * - allocate space (vcn, lcn, len)
517 * - update packed run in 'mi'
518 * - update attr->nres.evcn
519 * - update attr_b->nres.data_size/attr_b->nres.alloc_size
521 to_allocate = new_alen - old_alen;
522 add_alloc_in_same_attr_seg:
525 /* MFT allocates clusters from MFT zone. */
528 /* No preallocate for sparse/compress. */
530 } else if (pre_alloc == -1) {
532 if (type == ATTR_DATA && !name_len &&
533 sbi->options->prealloc) {
534 pre_alloc = bytes_to_cluster(
535 sbi, get_pre_allocated(
540 /* Get the last LCN to allocate from. */
542 !run_lookup_entry(run, vcn, &lcn, NULL, NULL)) {
546 if (lcn == SPARSE_LCN)
551 free = wnd_zeroes(&sbi->used.bitmap);
552 if (to_allocate > free) {
557 if (pre_alloc && to_allocate + pre_alloc > free)
564 if (!run_add_entry(run, vcn, SPARSE_LCN, to_allocate,
571 /* ~3 bytes per fragment. */
572 err = attr_allocate_clusters(
573 sbi, run, vcn, lcn, to_allocate, &pre_alloc,
574 is_mft ? ALLOCATE_MFT : ALLOCATE_DEF, &alen,
577 le32_to_cpu(rec->used) + 8) /
587 if (to_allocate > alen)
593 err = mi_pack_runs(mi, attr, run, vcn - svcn);
597 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
598 new_alloc_tmp = (u64)next_svcn << cluster_bits;
599 attr_b->nres.alloc_size = cpu_to_le64(new_alloc_tmp);
600 mi_b->dirty = dirty = true;
602 if (next_svcn >= vcn && !to_allocate) {
603 /* Normal way. Update attribute and exit. */
604 attr_b->nres.data_size = cpu_to_le64(new_size);
608 /* At least two MFT to avoid recursive loop. */
609 if (is_mft && next_svcn == vcn &&
610 ((u64)done << sbi->cluster_bits) >= 2 * sbi->record_size) {
611 new_size = new_alloc_tmp;
612 attr_b->nres.data_size = attr_b->nres.alloc_size;
616 if (le32_to_cpu(rec->used) < sbi->record_size) {
617 old_alen = next_svcn;
619 goto add_alloc_in_same_attr_seg;
622 attr_b->nres.data_size = attr_b->nres.alloc_size;
623 if (new_alloc_tmp < old_valid)
624 attr_b->nres.valid_size = attr_b->nres.data_size;
626 if (type == ATTR_LIST) {
627 err = ni_expand_list(ni);
633 /* Layout of records is changed. */
637 if (!ni->attr_list.size) {
638 err = ni_create_attr_list(ni);
639 /* In case of error layout of records is not changed. */
642 /* Layout of records is changed. */
645 if (next_svcn >= vcn) {
646 /* This is MFT data, repeat. */
650 /* Insert new attribute segment. */
651 err = ni_insert_nonresident(ni, type, name, name_len, run,
652 next_svcn, vcn - next_svcn,
653 attr_b->flags, &attr, &mi, NULL);
656 * Layout of records maybe changed.
657 * Find base attribute to update.
660 attr_b = ni_find_attr(ni, NULL, &le_b, type, name, name_len,
668 /* ni_insert_nonresident failed. */
674 run_truncate_head(run, evcn + 1);
676 svcn = le64_to_cpu(attr->nres.svcn);
677 evcn = le64_to_cpu(attr->nres.evcn);
680 * Attribute is in consistency state.
681 * Save this point to restore to if next steps fail.
683 old_valid = old_size = old_alloc = (u64)vcn << cluster_bits;
684 attr_b->nres.valid_size = attr_b->nres.data_size =
685 attr_b->nres.alloc_size = cpu_to_le64(old_size);
686 mi_b->dirty = dirty = true;
690 if (new_size != old_size ||
691 (new_alloc != old_alloc && !keep_prealloc)) {
693 * Truncate clusters. In simple case we have to:
694 * - update packed run in 'mi'
695 * - update attr->nres.evcn
696 * - update attr_b->nres.data_size/attr_b->nres.alloc_size
697 * - mark and trim clusters as free (vcn, lcn, len)
701 vcn = max(svcn, new_alen);
702 new_alloc_tmp = (u64)vcn << cluster_bits;
705 err = mi_pack_runs(mi, attr, run, vcn - svcn);
708 } else if (le && le->vcn) {
709 u16 le_sz = le16_to_cpu(le->size);
712 * NOTE: List entries for one attribute are always
713 * the same size. We deal with last entry (vcn==0)
714 * and it is not first in entries array
715 * (list entry for std attribute always first).
716 * So it is safe to step back.
718 mi_remove_attr(NULL, mi, attr);
720 if (!al_remove_le(ni, le)) {
725 le = (struct ATTR_LIST_ENTRY *)((u8 *)le - le_sz);
727 attr->nres.evcn = cpu_to_le64((u64)vcn - 1);
731 attr_b->nres.alloc_size = cpu_to_le64(new_alloc_tmp);
733 if (vcn == new_alen) {
734 attr_b->nres.data_size = cpu_to_le64(new_size);
735 if (new_size < old_valid)
736 attr_b->nres.valid_size =
737 attr_b->nres.data_size;
740 le64_to_cpu(attr_b->nres.data_size))
741 attr_b->nres.data_size =
742 attr_b->nres.alloc_size;
744 le64_to_cpu(attr_b->nres.valid_size))
745 attr_b->nres.valid_size =
746 attr_b->nres.alloc_size;
748 mi_b->dirty = dirty = true;
750 err = run_deallocate_ex(sbi, run, vcn, evcn - vcn + 1, &dlen,
756 /* dlen - really deallocated clusters. */
757 le64_sub_cpu(&attr_b->nres.total_size,
758 ((u64)dlen << cluster_bits));
761 run_truncate(run, vcn);
763 if (new_alloc_tmp <= new_alloc)
766 old_size = new_alloc_tmp;
777 if (le->type != type || le->name_len != name_len ||
778 memcmp(le_name(le), name, name_len * sizeof(short))) {
783 err = ni_load_mi(ni, le, &mi);
787 attr = mi_find_attr(mi, NULL, type, name, name_len, &le->id);
797 __le64 valid = cpu_to_le64(min(*new_valid, new_size));
799 if (attr_b->nres.valid_size != valid) {
800 attr_b->nres.valid_size = valid;
809 if (((type == ATTR_DATA && !name_len) ||
810 (type == ATTR_ALLOC && name == I30_NAME))) {
811 /* Update inode_set_bytes. */
812 if (attr_b->non_res) {
813 new_alloc = le64_to_cpu(attr_b->nres.alloc_size);
814 if (inode_get_bytes(&ni->vfs_inode) != new_alloc) {
815 inode_set_bytes(&ni->vfs_inode, new_alloc);
820 /* Don't forget to update duplicate information in parent. */
822 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
823 mark_inode_dirty(&ni->vfs_inode);
831 attr_b->nres.data_size = cpu_to_le64(old_size);
832 attr_b->nres.valid_size = cpu_to_le64(old_valid);
833 attr_b->nres.alloc_size = cpu_to_le64(old_alloc);
835 /* Restore 'attr' and 'mi'. */
839 if (le64_to_cpu(attr_b->nres.svcn) <= svcn &&
840 svcn <= le64_to_cpu(attr_b->nres.evcn)) {
849 attr = ni_find_attr(ni, attr_b, &le, type, name, name_len,
856 if (mi_pack_runs(mi, attr, run, evcn - svcn + 1))
860 run_deallocate_ex(sbi, run, vcn, alen, NULL, false);
862 run_truncate(run, vcn);
866 _ntfs_bad_inode(&ni->vfs_inode);
872 * attr_data_get_block - Returns 'lcn' and 'len' for given 'vcn'.
874 * @new == NULL means just to get current mapping for 'vcn'
875 * @new != NULL means allocate real cluster if 'vcn' maps to hole
876 * @zero - zeroout new allocated clusters
879 * - @new != NULL is called only for sparsed or compressed attributes.
880 * - new allocated clusters are zeroed via blkdev_issue_zeroout.
882 int attr_data_get_block(struct ntfs_inode *ni, CLST vcn, CLST clen, CLST *lcn,
883 CLST *len, bool *new, bool zero)
886 struct runs_tree *run = &ni->file.run;
887 struct ntfs_sb_info *sbi;
889 struct ATTRIB *attr = NULL, *attr_b;
890 struct ATTR_LIST_ENTRY *le, *le_b;
891 struct mft_inode *mi, *mi_b;
892 CLST hint, svcn, to_alloc, evcn1, next_svcn, asize, end, vcn0, alen;
895 u64 total_size, total_size0;
901 /* Try to find in cache. */
902 down_read(&ni->file.run_lock);
903 if (!run_lookup_entry(run, vcn, lcn, len, NULL))
905 up_read(&ni->file.run_lock);
908 if (*lcn != SPARSE_LCN || !new)
909 return 0; /* Fast normal way without allocation. */
910 else if (clen > *len)
914 /* No cluster in cache or we need to allocate cluster in hole. */
916 cluster_bits = sbi->cluster_bits;
919 down_write(&ni->file.run_lock);
922 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL, &mi_b);
928 if (!attr_b->non_res) {
934 asize = le64_to_cpu(attr_b->nres.alloc_size) >> cluster_bits;
945 svcn = le64_to_cpu(attr_b->nres.svcn);
946 evcn1 = le64_to_cpu(attr_b->nres.evcn) + 1;
952 if (le_b && (vcn < svcn || evcn1 <= vcn)) {
953 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0, &vcn,
959 svcn = le64_to_cpu(attr->nres.svcn);
960 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
963 /* Load in cache actual information. */
964 err = attr_load_runs(attr, ni, run, NULL);
969 if (run_lookup_entry(run, vcn, lcn, len, NULL)) {
970 if (*lcn != SPARSE_LCN || !new)
971 goto ok; /* Slow normal way without allocation. */
976 /* Here we may return -ENOENT.
977 * In any case caller gets zero length. */
982 if (!is_attr_ext(attr_b)) {
983 /* The code below only for sparsed or compressed attributes. */
990 fr = (sbi->record_size - le32_to_cpu(mi->mrec->used) + 8) / 3 + 1;
991 /* Allocate frame aligned clusters.
992 * ntfs.sys usually uses 16 clusters per frame for sparsed or compressed.
993 * ntfs3 uses 1 cluster per frame for new created sparsed files. */
994 if (attr_b->nres.c_unit) {
995 CLST clst_per_frame = 1u << attr_b->nres.c_unit;
996 CLST cmask = ~(clst_per_frame - 1);
998 /* Get frame aligned vcn and to_alloc. */
1000 to_alloc = ((vcn0 + clen + clst_per_frame - 1) & cmask) - vcn;
1001 if (fr < clst_per_frame)
1002 fr = clst_per_frame;
1005 /* Check if 'vcn' and 'vcn0' in different attribute segments. */
1006 if (vcn < svcn || evcn1 <= vcn) {
1007 /* Load attribute for truncated vcn. */
1008 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0,
1014 svcn = le64_to_cpu(attr->nres.svcn);
1015 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
1016 err = attr_load_runs(attr, ni, run, NULL);
1022 if (vcn + to_alloc > asize)
1023 to_alloc = asize - vcn;
1025 /* Get the last LCN to allocate from. */
1029 if (!run_add_entry(run, evcn1, SPARSE_LCN, vcn - evcn1,
1034 } else if (vcn && !run_lookup_entry(run, vcn - 1, &hint, NULL, NULL)) {
1038 /* Allocate and zeroout new clusters. */
1039 err = attr_allocate_clusters(sbi, run, vcn, hint + 1, to_alloc, NULL,
1040 zero ? ALLOCATE_ZERO : ALLOCATE_DEF, &alen,
1048 /* Save 'total_size0' to restore if error. */
1049 total_size0 = le64_to_cpu(attr_b->nres.total_size);
1050 total_size = total_size0 + ((u64)alen << cluster_bits);
1053 if (!run_lookup_entry(run, vcn0, lcn, len, NULL)) {
1057 if (*lcn == SPARSE_LCN) {
1058 /* Internal error. Should not happened. */
1063 /* Check case when vcn0 + len overlaps new allocated clusters. */
1064 if (vcn0 + *len > end)
1069 err = mi_pack_runs(mi, attr, run, max(end, evcn1) - svcn);
1073 attr_b->nres.total_size = cpu_to_le64(total_size);
1074 inode_set_bytes(&ni->vfs_inode, total_size);
1075 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
1078 mark_inode_dirty(&ni->vfs_inode);
1080 /* Stored [vcn : next_svcn) from [vcn : end). */
1081 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
1084 if (next_svcn == evcn1) {
1085 /* Normal way. Update attribute and exit. */
1088 /* Add new segment [next_svcn : evcn1 - next_svcn). */
1089 if (!ni->attr_list.size) {
1090 err = ni_create_attr_list(ni);
1093 /* Layout of records is changed. */
1095 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL,
1110 * The code below may require additional cluster (to extend attribute list)
1111 * and / or one MFT record
1112 * It is too complex to undo operations if -ENOSPC occurs deep inside
1113 * in 'ni_insert_nonresident'.
1114 * Return in advance -ENOSPC here if there are no free cluster and no free MFT.
1116 if (!ntfs_check_for_free_space(sbi, 1, 1)) {
1125 /* Estimate next attribute. */
1126 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, NULL, 0, &svcn, &mi);
1129 /* Insert new attribute segment. */
1133 /* Try to update existed attribute segment. */
1134 alloc = bytes_to_cluster(sbi, le64_to_cpu(attr_b->nres.alloc_size));
1135 evcn = le64_to_cpu(attr->nres.evcn);
1137 if (end < next_svcn)
1139 while (end > evcn) {
1140 /* Remove segment [svcn : evcn). */
1141 mi_remove_attr(NULL, mi, attr);
1143 if (!al_remove_le(ni, le)) {
1148 if (evcn + 1 >= alloc) {
1149 /* Last attribute segment. */
1154 if (ni_load_mi(ni, le, &mi)) {
1159 attr = mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0, &le->id);
1164 svcn = le64_to_cpu(attr->nres.svcn);
1165 evcn = le64_to_cpu(attr->nres.evcn);
1171 err = attr_load_runs(attr, ni, run, &end);
1176 attr->nres.svcn = cpu_to_le64(next_svcn);
1177 err = mi_pack_runs(mi, attr, run, evcn1 - next_svcn);
1181 le->vcn = cpu_to_le64(next_svcn);
1182 ni->attr_list.dirty = true;
1184 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
1187 if (evcn1 > next_svcn) {
1188 err = ni_insert_nonresident(ni, ATTR_DATA, NULL, 0, run,
1189 next_svcn, evcn1 - next_svcn,
1190 attr_b->flags, &attr, &mi, NULL);
1195 run_truncate_around(run, vcn);
1197 if (err && step > 1) {
1198 /* Too complex to restore. */
1199 _ntfs_bad_inode(&ni->vfs_inode);
1201 up_write(&ni->file.run_lock);
1208 attr_b->nres.total_size = cpu_to_le64(total_size0);
1209 inode_set_bytes(&ni->vfs_inode, total_size0);
1211 if (run_deallocate_ex(sbi, run, vcn, alen, NULL, false) ||
1212 !run_add_entry(run, vcn, SPARSE_LCN, alen, false) ||
1213 mi_pack_runs(mi, attr, run, max(end, evcn1) - svcn)) {
1214 _ntfs_bad_inode(&ni->vfs_inode);
1219 int attr_data_read_resident(struct ntfs_inode *ni, struct page *page)
1222 struct ATTRIB *attr;
1225 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, NULL);
1230 return E_NTFS_NONRESIDENT;
1232 vbo = page->index << PAGE_SHIFT;
1233 data_size = le32_to_cpu(attr->res.data_size);
1234 if (vbo < data_size) {
1235 const char *data = resident_data(attr);
1236 char *kaddr = kmap_atomic(page);
1237 u32 use = data_size - vbo;
1239 if (use > PAGE_SIZE)
1242 memcpy(kaddr, data + vbo, use);
1243 memset(kaddr + use, 0, PAGE_SIZE - use);
1244 kunmap_atomic(kaddr);
1245 flush_dcache_page(page);
1246 SetPageUptodate(page);
1247 } else if (!PageUptodate(page)) {
1248 zero_user_segment(page, 0, PAGE_SIZE);
1249 SetPageUptodate(page);
1255 int attr_data_write_resident(struct ntfs_inode *ni, struct page *page)
1258 struct mft_inode *mi;
1259 struct ATTRIB *attr;
1262 attr = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL, &mi);
1266 if (attr->non_res) {
1267 /* Return special error code to check this case. */
1268 return E_NTFS_NONRESIDENT;
1271 vbo = page->index << PAGE_SHIFT;
1272 data_size = le32_to_cpu(attr->res.data_size);
1273 if (vbo < data_size) {
1274 char *data = resident_data(attr);
1275 char *kaddr = kmap_atomic(page);
1276 u32 use = data_size - vbo;
1278 if (use > PAGE_SIZE)
1280 memcpy(data + vbo, kaddr, use);
1281 kunmap_atomic(kaddr);
1284 ni->i_valid = data_size;
1290 * attr_load_runs_vcn - Load runs with VCN.
1292 int attr_load_runs_vcn(struct ntfs_inode *ni, enum ATTR_TYPE type,
1293 const __le16 *name, u8 name_len, struct runs_tree *run,
1296 struct ATTRIB *attr;
1302 /* Is record corrupted? */
1306 attr = ni_find_attr(ni, NULL, NULL, type, name, name_len, &vcn, NULL);
1308 /* Is record corrupted? */
1312 svcn = le64_to_cpu(attr->nres.svcn);
1313 evcn = le64_to_cpu(attr->nres.evcn);
1315 if (evcn < vcn || vcn < svcn) {
1316 /* Is record corrupted? */
1320 ro = le16_to_cpu(attr->nres.run_off);
1322 if (ro > le32_to_cpu(attr->size))
1325 err = run_unpack_ex(run, ni->mi.sbi, ni->mi.rno, svcn, evcn, svcn,
1326 Add2Ptr(attr, ro), le32_to_cpu(attr->size) - ro);
1333 * attr_load_runs_range - Load runs for given range [from to).
1335 int attr_load_runs_range(struct ntfs_inode *ni, enum ATTR_TYPE type,
1336 const __le16 *name, u8 name_len, struct runs_tree *run,
1339 struct ntfs_sb_info *sbi = ni->mi.sbi;
1340 u8 cluster_bits = sbi->cluster_bits;
1342 CLST vcn_last = (to - 1) >> cluster_bits;
1346 for (vcn = from >> cluster_bits; vcn <= vcn_last; vcn += clen) {
1347 if (!run_lookup_entry(run, vcn, &lcn, &clen, NULL)) {
1348 err = attr_load_runs_vcn(ni, type, name, name_len, run,
1352 clen = 0; /* Next run_lookup_entry(vcn) must be success. */
1359 #ifdef CONFIG_NTFS3_LZX_XPRESS
1361 * attr_wof_frame_info
1363 * Read header of Xpress/LZX file to get info about frame.
1365 int attr_wof_frame_info(struct ntfs_inode *ni, struct ATTRIB *attr,
1366 struct runs_tree *run, u64 frame, u64 frames,
1367 u8 frame_bits, u32 *ondisk_size, u64 *vbo_data)
1369 struct ntfs_sb_info *sbi = ni->mi.sbi;
1370 u64 vbo[2], off[2], wof_size;
1379 if (ni->vfs_inode.i_size < 0x100000000ull) {
1380 /* File starts with array of 32 bit offsets. */
1381 bytes_per_off = sizeof(__le32);
1382 vbo[1] = frame << 2;
1383 *vbo_data = frames << 2;
1385 /* File starts with array of 64 bit offsets. */
1386 bytes_per_off = sizeof(__le64);
1387 vbo[1] = frame << 3;
1388 *vbo_data = frames << 3;
1392 * Read 4/8 bytes at [vbo - 4(8)] == offset where compressed frame starts.
1393 * Read 4/8 bytes at [vbo] == offset where compressed frame ends.
1395 if (!attr->non_res) {
1396 if (vbo[1] + bytes_per_off > le32_to_cpu(attr->res.data_size)) {
1397 ntfs_inode_err(&ni->vfs_inode, "is corrupted");
1400 addr = resident_data(attr);
1402 if (bytes_per_off == sizeof(__le32)) {
1403 off32 = Add2Ptr(addr, vbo[1]);
1404 off[0] = vbo[1] ? le32_to_cpu(off32[-1]) : 0;
1405 off[1] = le32_to_cpu(off32[0]);
1407 off64 = Add2Ptr(addr, vbo[1]);
1408 off[0] = vbo[1] ? le64_to_cpu(off64[-1]) : 0;
1409 off[1] = le64_to_cpu(off64[0]);
1412 *vbo_data += off[0];
1413 *ondisk_size = off[1] - off[0];
1417 wof_size = le64_to_cpu(attr->nres.data_size);
1418 down_write(&ni->file.run_lock);
1419 page = ni->file.offs_page;
1421 page = alloc_page(GFP_KERNEL);
1427 ni->file.offs_page = page;
1430 addr = page_address(page);
1433 voff = vbo[1] & (PAGE_SIZE - 1);
1434 vbo[0] = vbo[1] - bytes_per_off;
1444 pgoff_t index = vbo[i] >> PAGE_SHIFT;
1446 if (index != page->index) {
1447 u64 from = vbo[i] & ~(u64)(PAGE_SIZE - 1);
1448 u64 to = min(from + PAGE_SIZE, wof_size);
1450 err = attr_load_runs_range(ni, ATTR_DATA, WOF_NAME,
1451 ARRAY_SIZE(WOF_NAME), run,
1456 err = ntfs_bio_pages(sbi, run, &page, 1, from,
1457 to - from, REQ_OP_READ);
1462 page->index = index;
1466 if (bytes_per_off == sizeof(__le32)) {
1467 off32 = Add2Ptr(addr, voff);
1468 off[1] = le32_to_cpu(*off32);
1470 off64 = Add2Ptr(addr, voff);
1471 off[1] = le64_to_cpu(*off64);
1474 if (bytes_per_off == sizeof(__le32)) {
1475 off32 = Add2Ptr(addr, PAGE_SIZE - sizeof(u32));
1476 off[0] = le32_to_cpu(*off32);
1478 off64 = Add2Ptr(addr, PAGE_SIZE - sizeof(u64));
1479 off[0] = le64_to_cpu(*off64);
1482 /* Two values in one page. */
1483 if (bytes_per_off == sizeof(__le32)) {
1484 off32 = Add2Ptr(addr, voff);
1485 off[0] = le32_to_cpu(off32[-1]);
1486 off[1] = le32_to_cpu(off32[0]);
1488 off64 = Add2Ptr(addr, voff);
1489 off[0] = le64_to_cpu(off64[-1]);
1490 off[1] = le64_to_cpu(off64[0]);
1496 *vbo_data += off[0];
1497 *ondisk_size = off[1] - off[0];
1502 up_write(&ni->file.run_lock);
1508 * attr_is_frame_compressed - Used to detect compressed frame.
1510 int attr_is_frame_compressed(struct ntfs_inode *ni, struct ATTRIB *attr,
1511 CLST frame, CLST *clst_data)
1515 CLST clen, lcn, vcn, alen, slen, vcn_next;
1517 struct runs_tree *run;
1521 if (!is_attr_compressed(attr))
1527 clst_frame = 1u << attr->nres.c_unit;
1528 vcn = frame * clst_frame;
1529 run = &ni->file.run;
1531 if (!run_lookup_entry(run, vcn, &lcn, &clen, &idx)) {
1532 err = attr_load_runs_vcn(ni, attr->type, attr_name(attr),
1533 attr->name_len, run, vcn);
1537 if (!run_lookup_entry(run, vcn, &lcn, &clen, &idx))
1541 if (lcn == SPARSE_LCN) {
1542 /* Sparsed frame. */
1546 if (clen >= clst_frame) {
1548 * The frame is not compressed 'cause
1549 * it does not contain any sparse clusters.
1551 *clst_data = clst_frame;
1555 alen = bytes_to_cluster(ni->mi.sbi, le64_to_cpu(attr->nres.alloc_size));
1560 * The frame is compressed if *clst_data + slen >= clst_frame.
1561 * Check next fragments.
1563 while ((vcn += clen) < alen) {
1566 if (!run_get_entry(run, ++idx, &vcn, &lcn, &clen) ||
1568 err = attr_load_runs_vcn(ni, attr->type,
1570 attr->name_len, run, vcn_next);
1575 if (!run_lookup_entry(run, vcn, &lcn, &clen, &idx))
1579 if (lcn == SPARSE_LCN) {
1584 * Data_clusters + sparse_clusters =
1585 * not enough for frame.
1592 if (*clst_data + slen >= clst_frame) {
1595 * There is no sparsed clusters in this frame
1596 * so it is not compressed.
1598 *clst_data = clst_frame;
1600 /* Frame is compressed. */
1610 * attr_allocate_frame - Allocate/free clusters for @frame.
1612 * Assumed: down_write(&ni->file.run_lock);
1614 int attr_allocate_frame(struct ntfs_inode *ni, CLST frame, size_t compr_size,
1618 struct runs_tree *run = &ni->file.run;
1619 struct ntfs_sb_info *sbi = ni->mi.sbi;
1620 struct ATTRIB *attr = NULL, *attr_b;
1621 struct ATTR_LIST_ENTRY *le, *le_b;
1622 struct mft_inode *mi, *mi_b;
1623 CLST svcn, evcn1, next_svcn, len;
1624 CLST vcn, end, clst_data;
1625 u64 total_size, valid_size, data_size;
1628 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL, &mi_b);
1632 if (!is_attr_ext(attr_b))
1635 vcn = frame << NTFS_LZNT_CUNIT;
1636 total_size = le64_to_cpu(attr_b->nres.total_size);
1638 svcn = le64_to_cpu(attr_b->nres.svcn);
1639 evcn1 = le64_to_cpu(attr_b->nres.evcn) + 1;
1640 data_size = le64_to_cpu(attr_b->nres.data_size);
1642 if (svcn <= vcn && vcn < evcn1) {
1651 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0, &vcn,
1657 svcn = le64_to_cpu(attr->nres.svcn);
1658 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
1661 err = attr_load_runs(attr, ni, run, NULL);
1665 err = attr_is_frame_compressed(ni, attr_b, frame, &clst_data);
1669 total_size -= (u64)clst_data << sbi->cluster_bits;
1671 len = bytes_to_cluster(sbi, compr_size);
1673 if (len == clst_data)
1676 if (len < clst_data) {
1677 err = run_deallocate_ex(sbi, run, vcn + len, clst_data - len,
1682 if (!run_add_entry(run, vcn + len, SPARSE_LCN, clst_data - len,
1687 end = vcn + clst_data;
1688 /* Run contains updated range [vcn + len : end). */
1690 CLST alen, hint = 0;
1691 /* Get the last LCN to allocate from. */
1692 if (vcn + clst_data &&
1693 !run_lookup_entry(run, vcn + clst_data - 1, &hint, NULL,
1698 err = attr_allocate_clusters(sbi, run, vcn + clst_data,
1699 hint + 1, len - clst_data, NULL,
1700 ALLOCATE_DEF, &alen, 0, NULL,
1706 /* Run contains updated range [vcn + clst_data : end). */
1709 total_size += (u64)len << sbi->cluster_bits;
1712 err = mi_pack_runs(mi, attr, run, max(end, evcn1) - svcn);
1716 attr_b->nres.total_size = cpu_to_le64(total_size);
1717 inode_set_bytes(&ni->vfs_inode, total_size);
1720 mark_inode_dirty(&ni->vfs_inode);
1722 /* Stored [vcn : next_svcn) from [vcn : end). */
1723 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
1726 if (next_svcn == evcn1) {
1727 /* Normal way. Update attribute and exit. */
1730 /* Add new segment [next_svcn : evcn1 - next_svcn). */
1731 if (!ni->attr_list.size) {
1732 err = ni_create_attr_list(ni);
1735 /* Layout of records is changed. */
1737 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL,
1751 /* Estimate next attribute. */
1752 attr = ni_find_attr(ni, attr, &le, ATTR_DATA, NULL, 0, &svcn, &mi);
1755 CLST alloc = bytes_to_cluster(
1756 sbi, le64_to_cpu(attr_b->nres.alloc_size));
1757 CLST evcn = le64_to_cpu(attr->nres.evcn);
1759 if (end < next_svcn)
1761 while (end > evcn) {
1762 /* Remove segment [svcn : evcn). */
1763 mi_remove_attr(NULL, mi, attr);
1765 if (!al_remove_le(ni, le)) {
1770 if (evcn + 1 >= alloc) {
1771 /* Last attribute segment. */
1776 if (ni_load_mi(ni, le, &mi)) {
1781 attr = mi_find_attr(mi, NULL, ATTR_DATA, NULL, 0,
1787 svcn = le64_to_cpu(attr->nres.svcn);
1788 evcn = le64_to_cpu(attr->nres.evcn);
1794 err = attr_load_runs(attr, ni, run, &end);
1799 attr->nres.svcn = cpu_to_le64(next_svcn);
1800 err = mi_pack_runs(mi, attr, run, evcn1 - next_svcn);
1804 le->vcn = cpu_to_le64(next_svcn);
1805 ni->attr_list.dirty = true;
1808 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
1811 if (evcn1 > next_svcn) {
1812 err = ni_insert_nonresident(ni, ATTR_DATA, NULL, 0, run,
1813 next_svcn, evcn1 - next_svcn,
1814 attr_b->flags, &attr, &mi, NULL);
1819 run_truncate_around(run, vcn);
1821 if (new_valid > data_size)
1822 new_valid = data_size;
1824 valid_size = le64_to_cpu(attr_b->nres.valid_size);
1825 if (new_valid != valid_size) {
1826 attr_b->nres.valid_size = cpu_to_le64(valid_size);
1834 * attr_collapse_range - Collapse range in file.
1836 int attr_collapse_range(struct ntfs_inode *ni, u64 vbo, u64 bytes)
1839 struct runs_tree *run = &ni->file.run;
1840 struct ntfs_sb_info *sbi = ni->mi.sbi;
1841 struct ATTRIB *attr = NULL, *attr_b;
1842 struct ATTR_LIST_ENTRY *le, *le_b;
1843 struct mft_inode *mi, *mi_b;
1844 CLST svcn, evcn1, len, dealloc, alen;
1846 u64 valid_size, data_size, alloc_size, total_size;
1854 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL, &mi_b);
1858 if (!attr_b->non_res) {
1859 /* Attribute is resident. Nothing to do? */
1863 data_size = le64_to_cpu(attr_b->nres.data_size);
1864 alloc_size = le64_to_cpu(attr_b->nres.alloc_size);
1865 a_flags = attr_b->flags;
1867 if (is_attr_ext(attr_b)) {
1868 total_size = le64_to_cpu(attr_b->nres.total_size);
1869 mask = (sbi->cluster_size << attr_b->nres.c_unit) - 1;
1871 total_size = alloc_size;
1872 mask = sbi->cluster_mask;
1875 if ((vbo & mask) || (bytes & mask)) {
1876 /* Allow to collapse only cluster aligned ranges. */
1880 if (vbo > data_size)
1883 down_write(&ni->file.run_lock);
1885 if (vbo + bytes >= data_size) {
1886 u64 new_valid = min(ni->i_valid, vbo);
1888 /* Simple truncate file at 'vbo'. */
1889 truncate_setsize(&ni->vfs_inode, vbo);
1890 err = attr_set_size(ni, ATTR_DATA, NULL, 0, &ni->file.run, vbo,
1891 &new_valid, true, NULL);
1893 if (!err && new_valid < ni->i_valid)
1894 ni->i_valid = new_valid;
1900 * Enumerate all attribute segments and collapse.
1902 alen = alloc_size >> sbi->cluster_bits;
1903 vcn = vbo >> sbi->cluster_bits;
1904 len = bytes >> sbi->cluster_bits;
1908 svcn = le64_to_cpu(attr_b->nres.svcn);
1909 evcn1 = le64_to_cpu(attr_b->nres.evcn) + 1;
1911 if (svcn <= vcn && vcn < evcn1) {
1920 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0, &vcn,
1927 svcn = le64_to_cpu(attr->nres.svcn);
1928 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
1934 attr->nres.svcn = cpu_to_le64(svcn - len);
1935 attr->nres.evcn = cpu_to_le64(evcn1 - 1 - len);
1937 le->vcn = attr->nres.svcn;
1938 ni->attr_list.dirty = true;
1941 } else if (svcn < vcn || end < evcn1) {
1942 CLST vcn1, eat, next_svcn;
1944 /* Collapse a part of this attribute segment. */
1945 err = attr_load_runs(attr, ni, run, &svcn);
1948 vcn1 = max(vcn, svcn);
1949 eat = min(end, evcn1) - vcn1;
1951 err = run_deallocate_ex(sbi, run, vcn1, eat, &dealloc,
1956 if (!run_collapse_range(run, vcn1, eat)) {
1963 attr->nres.svcn = cpu_to_le64(vcn);
1965 le->vcn = attr->nres.svcn;
1966 ni->attr_list.dirty = true;
1970 err = mi_pack_runs(mi, attr, run, evcn1 - svcn - eat);
1974 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
1975 if (next_svcn + eat < evcn1) {
1976 err = ni_insert_nonresident(
1977 ni, ATTR_DATA, NULL, 0, run, next_svcn,
1978 evcn1 - eat - next_svcn, a_flags, &attr,
1983 /* Layout of records maybe changed. */
1987 /* Free all allocated memory. */
1988 run_truncate(run, 0);
1991 u16 roff = le16_to_cpu(attr->nres.run_off);
1993 if (roff > le32_to_cpu(attr->size)) {
1998 run_unpack_ex(RUN_DEALLOCATE, sbi, ni->mi.rno, svcn,
1999 evcn1 - 1, svcn, Add2Ptr(attr, roff),
2000 le32_to_cpu(attr->size) - roff);
2002 /* Delete this attribute segment. */
2003 mi_remove_attr(NULL, mi, attr);
2007 le_sz = le16_to_cpu(le->size);
2008 if (!al_remove_le(ni, le)) {
2017 /* Load next record that contains this attribute. */
2018 if (ni_load_mi(ni, le, &mi)) {
2023 /* Look for required attribute. */
2024 attr = mi_find_attr(mi, NULL, ATTR_DATA, NULL,
2032 le = (struct ATTR_LIST_ENTRY *)((u8 *)le - le_sz);
2038 attr = ni_enum_attr_ex(ni, attr, &le, &mi);
2045 svcn = le64_to_cpu(attr->nres.svcn);
2046 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
2051 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL,
2060 valid_size = ni->i_valid;
2061 if (vbo + bytes <= valid_size)
2062 valid_size -= bytes;
2063 else if (vbo < valid_size)
2066 attr_b->nres.alloc_size = cpu_to_le64(alloc_size - bytes);
2067 attr_b->nres.data_size = cpu_to_le64(data_size);
2068 attr_b->nres.valid_size = cpu_to_le64(min(valid_size, data_size));
2069 total_size -= (u64)dealloc << sbi->cluster_bits;
2070 if (is_attr_ext(attr_b))
2071 attr_b->nres.total_size = cpu_to_le64(total_size);
2074 /* Update inode size. */
2075 ni->i_valid = valid_size;
2076 ni->vfs_inode.i_size = data_size;
2077 inode_set_bytes(&ni->vfs_inode, total_size);
2078 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
2079 mark_inode_dirty(&ni->vfs_inode);
2082 up_write(&ni->file.run_lock);
2084 _ntfs_bad_inode(&ni->vfs_inode);
2092 * Not for normal files.
2094 int attr_punch_hole(struct ntfs_inode *ni, u64 vbo, u64 bytes, u32 *frame_size)
2097 struct runs_tree *run = &ni->file.run;
2098 struct ntfs_sb_info *sbi = ni->mi.sbi;
2099 struct ATTRIB *attr = NULL, *attr_b;
2100 struct ATTR_LIST_ENTRY *le, *le_b;
2101 struct mft_inode *mi, *mi_b;
2102 CLST svcn, evcn1, vcn, len, end, alen, hole, next_svcn;
2103 u64 total_size, alloc_size;
2106 struct runs_tree run2;
2112 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL, &mi_b);
2116 if (!attr_b->non_res) {
2117 u32 data_size = le32_to_cpu(attr_b->res.data_size);
2120 if (vbo > data_size)
2124 to = min_t(u64, vbo + bytes, data_size);
2125 memset(Add2Ptr(resident_data(attr_b), from), 0, to - from);
2129 if (!is_attr_ext(attr_b))
2132 alloc_size = le64_to_cpu(attr_b->nres.alloc_size);
2133 total_size = le64_to_cpu(attr_b->nres.total_size);
2135 if (vbo >= alloc_size) {
2136 /* NOTE: It is allowed. */
2140 mask = (sbi->cluster_size << attr_b->nres.c_unit) - 1;
2143 if (bytes > alloc_size)
2147 if ((vbo & mask) || (bytes & mask)) {
2148 /* We have to zero a range(s). */
2149 if (frame_size == NULL) {
2150 /* Caller insists range is aligned. */
2153 *frame_size = mask + 1;
2154 return E_NTFS_NOTALIGNED;
2157 down_write(&ni->file.run_lock);
2159 run_truncate(run, 0);
2162 * Enumerate all attribute segments and punch hole where necessary.
2164 alen = alloc_size >> sbi->cluster_bits;
2165 vcn = vbo >> sbi->cluster_bits;
2166 len = bytes >> sbi->cluster_bits;
2170 svcn = le64_to_cpu(attr_b->nres.svcn);
2171 evcn1 = le64_to_cpu(attr_b->nres.evcn) + 1;
2172 a_flags = attr_b->flags;
2174 if (svcn <= vcn && vcn < evcn1) {
2183 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0, &vcn,
2190 svcn = le64_to_cpu(attr->nres.svcn);
2191 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
2194 while (svcn < end) {
2195 CLST vcn1, zero, hole2 = hole;
2197 err = attr_load_runs(attr, ni, run, &svcn);
2200 vcn1 = max(vcn, svcn);
2201 zero = min(end, evcn1) - vcn1;
2204 * Check range [vcn1 + zero).
2205 * Calculate how many clusters there are.
2206 * Don't do any destructive actions.
2208 err = run_deallocate_ex(NULL, run, vcn1, zero, &hole2, false);
2212 /* Check if required range is already hole. */
2216 /* Make a clone of run to undo. */
2217 err = run_clone(run, &run2);
2221 /* Make a hole range (sparse) [vcn1 + zero). */
2222 if (!run_add_entry(run, vcn1, SPARSE_LCN, zero, false)) {
2227 /* Update run in attribute segment. */
2228 err = mi_pack_runs(mi, attr, run, evcn1 - svcn);
2231 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
2232 if (next_svcn < evcn1) {
2233 /* Insert new attribute segment. */
2234 err = ni_insert_nonresident(ni, ATTR_DATA, NULL, 0, run,
2236 evcn1 - next_svcn, a_flags,
2241 /* Layout of records maybe changed. */
2245 /* Real deallocate. Should not fail. */
2246 run_deallocate_ex(sbi, &run2, vcn1, zero, &hole, true);
2249 /* Free all allocated memory. */
2250 run_truncate(run, 0);
2255 /* Get next attribute segment. */
2256 attr = ni_enum_attr_ex(ni, attr, &le, &mi);
2262 svcn = le64_to_cpu(attr->nres.svcn);
2263 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
2271 attr_b = ni_find_attr(ni, NULL, NULL, ATTR_DATA, NULL, 0, NULL,
2279 total_size -= (u64)hole << sbi->cluster_bits;
2280 attr_b->nres.total_size = cpu_to_le64(total_size);
2283 /* Update inode size. */
2284 inode_set_bytes(&ni->vfs_inode, total_size);
2285 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
2286 mark_inode_dirty(&ni->vfs_inode);
2290 up_write(&ni->file.run_lock);
2294 _ntfs_bad_inode(&ni->vfs_inode);
2299 * Restore packed runs.
2300 * 'mi_pack_runs' should not fail, cause we restore original.
2302 if (mi_pack_runs(mi, attr, &run2, evcn1 - svcn))
2309 * attr_insert_range - Insert range (hole) in file.
2310 * Not for normal files.
2312 int attr_insert_range(struct ntfs_inode *ni, u64 vbo, u64 bytes)
2315 struct runs_tree *run = &ni->file.run;
2316 struct ntfs_sb_info *sbi = ni->mi.sbi;
2317 struct ATTRIB *attr = NULL, *attr_b;
2318 struct ATTR_LIST_ENTRY *le, *le_b;
2319 struct mft_inode *mi, *mi_b;
2320 CLST vcn, svcn, evcn1, len, next_svcn;
2321 u64 data_size, alloc_size;
2329 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL, &mi_b);
2333 if (!is_attr_ext(attr_b)) {
2334 /* It was checked above. See fallocate. */
2338 if (!attr_b->non_res) {
2339 data_size = le32_to_cpu(attr_b->res.data_size);
2340 alloc_size = data_size;
2341 mask = sbi->cluster_mask; /* cluster_size - 1 */
2343 data_size = le64_to_cpu(attr_b->nres.data_size);
2344 alloc_size = le64_to_cpu(attr_b->nres.alloc_size);
2345 mask = (sbi->cluster_size << attr_b->nres.c_unit) - 1;
2348 if (vbo > data_size) {
2349 /* Insert range after the file size is not allowed. */
2353 if ((vbo & mask) || (bytes & mask)) {
2354 /* Allow to insert only frame aligned ranges. */
2359 * valid_size <= data_size <= alloc_size
2360 * Check alloc_size for maximum possible.
2362 if (bytes > sbi->maxbytes_sparse - alloc_size)
2365 vcn = vbo >> sbi->cluster_bits;
2366 len = bytes >> sbi->cluster_bits;
2368 down_write(&ni->file.run_lock);
2370 if (!attr_b->non_res) {
2371 err = attr_set_size(ni, ATTR_DATA, NULL, 0, run,
2372 data_size + bytes, NULL, false, NULL);
2375 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL,
2385 if (!attr_b->non_res) {
2386 /* Still resident. */
2387 char *data = Add2Ptr(attr_b,
2388 le16_to_cpu(attr_b->res.data_off));
2390 memmove(data + bytes, data, bytes);
2391 memset(data, 0, bytes);
2395 /* Resident files becomes nonresident. */
2396 data_size = le64_to_cpu(attr_b->nres.data_size);
2397 alloc_size = le64_to_cpu(attr_b->nres.alloc_size);
2401 * Enumerate all attribute segments and shift start vcn.
2403 a_flags = attr_b->flags;
2404 svcn = le64_to_cpu(attr_b->nres.svcn);
2405 evcn1 = le64_to_cpu(attr_b->nres.evcn) + 1;
2407 if (svcn <= vcn && vcn < evcn1) {
2416 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0, &vcn,
2423 svcn = le64_to_cpu(attr->nres.svcn);
2424 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
2427 run_truncate(run, 0); /* clear cached values. */
2428 err = attr_load_runs(attr, ni, run, NULL);
2432 if (!run_insert_range(run, vcn, len)) {
2437 /* Try to pack in current record as much as possible. */
2438 err = mi_pack_runs(mi, attr, run, evcn1 + len - svcn);
2442 next_svcn = le64_to_cpu(attr->nres.evcn) + 1;
2444 while ((attr = ni_enum_attr_ex(ni, attr, &le, &mi)) &&
2445 attr->type == ATTR_DATA && !attr->name_len) {
2446 le64_add_cpu(&attr->nres.svcn, len);
2447 le64_add_cpu(&attr->nres.evcn, len);
2449 le->vcn = attr->nres.svcn;
2450 ni->attr_list.dirty = true;
2455 if (next_svcn < evcn1 + len) {
2456 err = ni_insert_nonresident(ni, ATTR_DATA, NULL, 0, run,
2457 next_svcn, evcn1 + len - next_svcn,
2458 a_flags, NULL, NULL, NULL);
2461 attr_b = ni_find_attr(ni, NULL, &le_b, ATTR_DATA, NULL, 0, NULL,
2469 /* ni_insert_nonresident failed. Try to undo. */
2470 goto undo_insert_range;
2475 * Update primary attribute segment.
2477 if (vbo <= ni->i_valid)
2478 ni->i_valid += bytes;
2480 attr_b->nres.data_size = cpu_to_le64(data_size + bytes);
2481 attr_b->nres.alloc_size = cpu_to_le64(alloc_size + bytes);
2483 /* ni->valid may be not equal valid_size (temporary). */
2484 if (ni->i_valid > data_size + bytes)
2485 attr_b->nres.valid_size = attr_b->nres.data_size;
2487 attr_b->nres.valid_size = cpu_to_le64(ni->i_valid);
2491 ni->vfs_inode.i_size += bytes;
2492 ni->ni_flags |= NI_FLAG_UPDATE_PARENT;
2493 mark_inode_dirty(&ni->vfs_inode);
2496 run_truncate(run, 0); /* clear cached values. */
2498 up_write(&ni->file.run_lock);
2503 _ntfs_bad_inode(&ni->vfs_inode);
2507 svcn = le64_to_cpu(attr_b->nres.svcn);
2508 evcn1 = le64_to_cpu(attr_b->nres.evcn) + 1;
2510 if (svcn <= vcn && vcn < evcn1) {
2518 attr = ni_find_attr(ni, attr_b, &le, ATTR_DATA, NULL, 0, &vcn,
2524 svcn = le64_to_cpu(attr->nres.svcn);
2525 evcn1 = le64_to_cpu(attr->nres.evcn) + 1;
2528 if (attr_load_runs(attr, ni, run, NULL))
2531 if (!run_collapse_range(run, vcn, len))
2534 if (mi_pack_runs(mi, attr, run, evcn1 + len - svcn))
2537 while ((attr = ni_enum_attr_ex(ni, attr, &le, &mi)) &&
2538 attr->type == ATTR_DATA && !attr->name_len) {
2539 le64_sub_cpu(&attr->nres.svcn, len);
2540 le64_sub_cpu(&attr->nres.evcn, len);
2542 le->vcn = attr->nres.svcn;
2543 ni->attr_list.dirty = true;