1 // SPDX-License-Identifier: GPL-2.0
3 * linux/fs/hfsplus/extents.c
6 * Brad Boyer (flar@allandria.com)
7 * (C) 2003 Ardis Technologies <roman@ardistech.com>
9 * Handling of Extents both in catalog and extents overflow trees
12 #include <linux/errno.h>
14 #include <linux/pagemap.h>
16 #include "hfsplus_fs.h"
17 #include "hfsplus_raw.h"
19 /* Compare two extents keys, returns 0 on same, pos/neg for difference */
20 int hfsplus_ext_cmp_key(const hfsplus_btree_key *k1,
21 const hfsplus_btree_key *k2)
29 return be32_to_cpu(k1id) < be32_to_cpu(k2id) ? -1 : 1;
31 if (k1->ext.fork_type != k2->ext.fork_type)
32 return k1->ext.fork_type < k2->ext.fork_type ? -1 : 1;
34 k1s = k1->ext.start_block;
35 k2s = k2->ext.start_block;
38 return be32_to_cpu(k1s) < be32_to_cpu(k2s) ? -1 : 1;
41 static void hfsplus_ext_build_key(hfsplus_btree_key *key, u32 cnid,
44 key->key_len = cpu_to_be16(HFSPLUS_EXT_KEYLEN - 2);
45 key->ext.cnid = cpu_to_be32(cnid);
46 key->ext.start_block = cpu_to_be32(block);
47 key->ext.fork_type = type;
51 static u32 hfsplus_ext_find_block(struct hfsplus_extent *ext, u32 off)
56 for (i = 0; i < 8; ext++, i++) {
57 count = be32_to_cpu(ext->block_count);
59 return be32_to_cpu(ext->start_block) + off;
66 static int hfsplus_ext_block_count(struct hfsplus_extent *ext)
71 for (i = 0; i < 8; ext++, i++)
72 count += be32_to_cpu(ext->block_count);
76 static u32 hfsplus_ext_lastblock(struct hfsplus_extent *ext)
81 for (i = 0; i < 7; ext--, i++)
84 return be32_to_cpu(ext->start_block) + be32_to_cpu(ext->block_count);
87 static int __hfsplus_ext_write_extent(struct inode *inode,
88 struct hfs_find_data *fd)
90 struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
93 WARN_ON(!mutex_is_locked(&hip->extents_lock));
95 hfsplus_ext_build_key(fd->search_key, inode->i_ino, hip->cached_start,
96 HFSPLUS_IS_RSRC(inode) ?
97 HFSPLUS_TYPE_RSRC : HFSPLUS_TYPE_DATA);
99 res = hfs_brec_find(fd, hfs_find_rec_by_key);
100 if (hip->extent_state & HFSPLUS_EXT_NEW) {
103 /* Fail early and avoid ENOSPC during the btree operation */
104 res = hfs_bmap_reserve(fd->tree, fd->tree->depth + 1);
107 hfs_brec_insert(fd, hip->cached_extents,
108 sizeof(hfsplus_extent_rec));
109 hip->extent_state &= ~(HFSPLUS_EXT_DIRTY | HFSPLUS_EXT_NEW);
113 hfs_bnode_write(fd->bnode, hip->cached_extents,
114 fd->entryoffset, fd->entrylength);
115 hip->extent_state &= ~HFSPLUS_EXT_DIRTY;
119 * We can't just use hfsplus_mark_inode_dirty here, because we
120 * also get called from hfsplus_write_inode, which should not
121 * redirty the inode. Instead the callers have to be careful
122 * to explicily mark the inode dirty, too.
124 set_bit(HFSPLUS_I_EXT_DIRTY, &hip->flags);
129 static int hfsplus_ext_write_extent_locked(struct inode *inode)
133 if (HFSPLUS_I(inode)->extent_state & HFSPLUS_EXT_DIRTY) {
134 struct hfs_find_data fd;
136 res = hfs_find_init(HFSPLUS_SB(inode->i_sb)->ext_tree, &fd);
139 res = __hfsplus_ext_write_extent(inode, &fd);
145 int hfsplus_ext_write_extent(struct inode *inode)
149 mutex_lock(&HFSPLUS_I(inode)->extents_lock);
150 res = hfsplus_ext_write_extent_locked(inode);
151 mutex_unlock(&HFSPLUS_I(inode)->extents_lock);
156 static inline int __hfsplus_ext_read_extent(struct hfs_find_data *fd,
157 struct hfsplus_extent *extent,
158 u32 cnid, u32 block, u8 type)
162 hfsplus_ext_build_key(fd->search_key, cnid, block, type);
163 fd->key->ext.cnid = 0;
164 res = hfs_brec_find(fd, hfs_find_rec_by_key);
165 if (res && res != -ENOENT)
167 if (fd->key->ext.cnid != fd->search_key->ext.cnid ||
168 fd->key->ext.fork_type != fd->search_key->ext.fork_type)
170 if (fd->entrylength != sizeof(hfsplus_extent_rec))
172 hfs_bnode_read(fd->bnode, extent, fd->entryoffset,
173 sizeof(hfsplus_extent_rec));
177 static inline int __hfsplus_ext_cache_extent(struct hfs_find_data *fd,
178 struct inode *inode, u32 block)
180 struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
183 WARN_ON(!mutex_is_locked(&hip->extents_lock));
185 if (hip->extent_state & HFSPLUS_EXT_DIRTY) {
186 res = __hfsplus_ext_write_extent(inode, fd);
191 res = __hfsplus_ext_read_extent(fd, hip->cached_extents, inode->i_ino,
192 block, HFSPLUS_IS_RSRC(inode) ?
196 hip->cached_start = be32_to_cpu(fd->key->ext.start_block);
198 hfsplus_ext_block_count(hip->cached_extents);
200 hip->cached_start = hip->cached_blocks = 0;
201 hip->extent_state &= ~(HFSPLUS_EXT_DIRTY | HFSPLUS_EXT_NEW);
206 static int hfsplus_ext_read_extent(struct inode *inode, u32 block)
208 struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
209 struct hfs_find_data fd;
212 if (block >= hip->cached_start &&
213 block < hip->cached_start + hip->cached_blocks)
216 res = hfs_find_init(HFSPLUS_SB(inode->i_sb)->ext_tree, &fd);
218 res = __hfsplus_ext_cache_extent(&fd, inode, block);
224 /* Get a block at iblock for inode, possibly allocating if create */
225 int hfsplus_get_block(struct inode *inode, sector_t iblock,
226 struct buffer_head *bh_result, int create)
228 struct super_block *sb = inode->i_sb;
229 struct hfsplus_sb_info *sbi = HFSPLUS_SB(sb);
230 struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
232 u32 ablock, dblock, mask;
236 /* Convert inode block to disk allocation block */
237 ablock = iblock >> sbi->fs_shift;
239 if (iblock >= hip->fs_blocks) {
240 if (iblock > hip->fs_blocks || !create)
242 if (ablock >= hip->alloc_blocks) {
243 res = hfsplus_file_extend(inode, false);
250 if (ablock < hip->first_blocks) {
251 dblock = hfsplus_ext_find_block(hip->first_extents, ablock);
255 if (inode->i_ino == HFSPLUS_EXT_CNID)
258 mutex_lock(&hip->extents_lock);
261 * hfsplus_ext_read_extent will write out a cached extent into
262 * the extents btree. In that case we may have to mark the inode
263 * dirty even for a pure read of an extent here.
265 was_dirty = (hip->extent_state & HFSPLUS_EXT_DIRTY);
266 res = hfsplus_ext_read_extent(inode, ablock);
268 mutex_unlock(&hip->extents_lock);
271 dblock = hfsplus_ext_find_block(hip->cached_extents,
272 ablock - hip->cached_start);
273 mutex_unlock(&hip->extents_lock);
276 hfs_dbg(EXTENT, "get_block(%lu): %llu - %u\n",
277 inode->i_ino, (long long)iblock, dblock);
279 mask = (1 << sbi->fs_shift) - 1;
280 sector = ((sector_t)dblock << sbi->fs_shift) +
281 sbi->blockoffset + (iblock & mask);
282 map_bh(bh_result, sb, sector);
285 set_buffer_new(bh_result);
286 hip->phys_size += sb->s_blocksize;
288 inode_add_bytes(inode, sb->s_blocksize);
290 if (create || was_dirty)
291 mark_inode_dirty(inode);
295 static void hfsplus_dump_extent(struct hfsplus_extent *extent)
299 hfs_dbg(EXTENT, " ");
300 for (i = 0; i < 8; i++)
301 hfs_dbg_cont(EXTENT, " %u:%u",
302 be32_to_cpu(extent[i].start_block),
303 be32_to_cpu(extent[i].block_count));
304 hfs_dbg_cont(EXTENT, "\n");
307 static int hfsplus_add_extent(struct hfsplus_extent *extent, u32 offset,
308 u32 alloc_block, u32 block_count)
313 hfsplus_dump_extent(extent);
314 for (i = 0; i < 8; extent++, i++) {
315 count = be32_to_cpu(extent->block_count);
316 if (offset == count) {
317 start = be32_to_cpu(extent->start_block);
318 if (alloc_block != start + count) {
322 extent->start_block = cpu_to_be32(alloc_block);
324 block_count += count;
325 extent->block_count = cpu_to_be32(block_count);
327 } else if (offset < count)
335 static int hfsplus_free_extents(struct super_block *sb,
336 struct hfsplus_extent *extent,
337 u32 offset, u32 block_nr)
343 /* Mapping the allocation file may lock the extent tree */
344 WARN_ON(mutex_is_locked(&HFSPLUS_SB(sb)->ext_tree->tree_lock));
346 hfsplus_dump_extent(extent);
347 for (i = 0; i < 8; extent++, i++) {
348 count = be32_to_cpu(extent->block_count);
351 else if (offset < count)
359 start = be32_to_cpu(extent->start_block);
360 if (count <= block_nr) {
361 err = hfsplus_block_free(sb, start, count);
363 pr_err("can't free extent\n");
364 hfs_dbg(EXTENT, " start: %u count: %u\n",
367 extent->block_count = 0;
368 extent->start_block = 0;
372 err = hfsplus_block_free(sb, start + count, block_nr);
374 pr_err("can't free extent\n");
375 hfs_dbg(EXTENT, " start: %u count: %u\n",
378 extent->block_count = cpu_to_be32(count);
381 if (!block_nr || !i) {
383 * Try to free all extents and
384 * return only last error
390 count = be32_to_cpu(extent->block_count);
394 int hfsplus_free_fork(struct super_block *sb, u32 cnid,
395 struct hfsplus_fork_raw *fork, int type)
397 struct hfs_find_data fd;
398 hfsplus_extent_rec ext_entry;
399 u32 total_blocks, blocks, start;
402 total_blocks = be32_to_cpu(fork->total_blocks);
407 for (i = 0; i < 8; i++)
408 blocks += be32_to_cpu(fork->extents[i].block_count);
410 res = hfsplus_free_extents(sb, fork->extents, blocks, blocks);
413 if (total_blocks == blocks)
416 res = hfs_find_init(HFSPLUS_SB(sb)->ext_tree, &fd);
420 res = __hfsplus_ext_read_extent(&fd, ext_entry, cnid,
424 start = be32_to_cpu(fd.key->ext.start_block);
425 hfs_brec_remove(&fd);
427 mutex_unlock(&fd.tree->tree_lock);
428 hfsplus_free_extents(sb, ext_entry, total_blocks - start,
430 total_blocks = start;
431 mutex_lock(&fd.tree->tree_lock);
432 } while (total_blocks > blocks);
438 int hfsplus_file_extend(struct inode *inode, bool zeroout)
440 struct super_block *sb = inode->i_sb;
441 struct hfsplus_sb_info *sbi = HFSPLUS_SB(sb);
442 struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
443 u32 start, len, goal;
446 if (sbi->alloc_file->i_size * 8 <
447 sbi->total_blocks - sbi->free_blocks + 8) {
448 /* extend alloc file */
449 pr_err("extend alloc file! (%llu,%u,%u)\n",
450 sbi->alloc_file->i_size * 8,
451 sbi->total_blocks, sbi->free_blocks);
455 mutex_lock(&hip->extents_lock);
456 if (hip->alloc_blocks == hip->first_blocks)
457 goal = hfsplus_ext_lastblock(hip->first_extents);
459 res = hfsplus_ext_read_extent(inode, hip->alloc_blocks);
462 goal = hfsplus_ext_lastblock(hip->cached_extents);
465 len = hip->clump_blocks;
466 start = hfsplus_block_allocate(sb, sbi->total_blocks, goal, &len);
467 if (start >= sbi->total_blocks) {
468 start = hfsplus_block_allocate(sb, goal, 0, &len);
476 res = sb_issue_zeroout(sb, start, len, GFP_NOFS);
481 hfs_dbg(EXTENT, "extend %lu: %u,%u\n", inode->i_ino, start, len);
483 if (hip->alloc_blocks <= hip->first_blocks) {
484 if (!hip->first_blocks) {
485 hfs_dbg(EXTENT, "first extents\n");
487 hip->first_extents[0].start_block = cpu_to_be32(start);
488 hip->first_extents[0].block_count = cpu_to_be32(len);
491 /* try to append to extents in inode */
492 res = hfsplus_add_extent(hip->first_extents,
499 hfsplus_dump_extent(hip->first_extents);
500 hip->first_blocks += len;
503 res = hfsplus_add_extent(hip->cached_extents,
504 hip->alloc_blocks - hip->cached_start,
507 hfsplus_dump_extent(hip->cached_extents);
508 hip->extent_state |= HFSPLUS_EXT_DIRTY;
509 hip->cached_blocks += len;
510 } else if (res == -ENOSPC)
515 hip->alloc_blocks += len;
516 mutex_unlock(&hip->extents_lock);
517 hfsplus_mark_inode_dirty(inode, HFSPLUS_I_ALLOC_DIRTY);
520 mutex_unlock(&hip->extents_lock);
524 hfs_dbg(EXTENT, "insert new extent\n");
525 res = hfsplus_ext_write_extent_locked(inode);
529 memset(hip->cached_extents, 0, sizeof(hfsplus_extent_rec));
530 hip->cached_extents[0].start_block = cpu_to_be32(start);
531 hip->cached_extents[0].block_count = cpu_to_be32(len);
532 hfsplus_dump_extent(hip->cached_extents);
533 hip->extent_state |= HFSPLUS_EXT_DIRTY | HFSPLUS_EXT_NEW;
534 hip->cached_start = hip->alloc_blocks;
535 hip->cached_blocks = len;
541 void hfsplus_file_truncate(struct inode *inode)
543 struct super_block *sb = inode->i_sb;
544 struct hfsplus_inode_info *hip = HFSPLUS_I(inode);
545 struct hfs_find_data fd;
546 u32 alloc_cnt, blk_cnt, start;
549 hfs_dbg(INODE, "truncate: %lu, %llu -> %llu\n",
550 inode->i_ino, (long long)hip->phys_size, inode->i_size);
552 if (inode->i_size > hip->phys_size) {
553 struct address_space *mapping = inode->i_mapping;
556 loff_t size = inode->i_size;
558 res = pagecache_write_begin(NULL, mapping, size, 0, 0,
562 res = pagecache_write_end(NULL, mapping, size,
566 mark_inode_dirty(inode);
568 } else if (inode->i_size == hip->phys_size)
571 blk_cnt = (inode->i_size + HFSPLUS_SB(sb)->alloc_blksz - 1) >>
572 HFSPLUS_SB(sb)->alloc_blksz_shift;
574 mutex_lock(&hip->extents_lock);
576 alloc_cnt = hip->alloc_blocks;
577 if (blk_cnt == alloc_cnt)
580 res = hfs_find_init(HFSPLUS_SB(sb)->ext_tree, &fd);
582 mutex_unlock(&hip->extents_lock);
583 /* XXX: We lack error handling of hfsplus_file_truncate() */
587 if (alloc_cnt == hip->first_blocks) {
588 mutex_unlock(&fd.tree->tree_lock);
589 hfsplus_free_extents(sb, hip->first_extents,
590 alloc_cnt, alloc_cnt - blk_cnt);
591 hfsplus_dump_extent(hip->first_extents);
592 hip->first_blocks = blk_cnt;
593 mutex_lock(&fd.tree->tree_lock);
596 res = __hfsplus_ext_cache_extent(&fd, inode, alloc_cnt);
599 hfs_brec_remove(&fd);
601 mutex_unlock(&fd.tree->tree_lock);
602 start = hip->cached_start;
603 hfsplus_free_extents(sb, hip->cached_extents,
604 alloc_cnt - start, alloc_cnt - blk_cnt);
605 hfsplus_dump_extent(hip->cached_extents);
606 if (blk_cnt > start) {
607 hip->extent_state |= HFSPLUS_EXT_DIRTY;
611 hip->cached_start = hip->cached_blocks = 0;
612 hip->extent_state &= ~(HFSPLUS_EXT_DIRTY | HFSPLUS_EXT_NEW);
613 mutex_lock(&fd.tree->tree_lock);
617 hip->alloc_blocks = blk_cnt;
619 mutex_unlock(&hip->extents_lock);
620 hip->phys_size = inode->i_size;
621 hip->fs_blocks = (inode->i_size + sb->s_blocksize - 1) >>
622 sb->s_blocksize_bits;
623 inode_set_bytes(inode, hip->fs_blocks << sb->s_blocksize_bits);
624 hfsplus_mark_inode_dirty(inode, HFSPLUS_I_ALLOC_DIRTY);