5 * Block allocation handling routines for the OSTA-UDF(tm) filesystem.
8 * This file is distributed under the terms of the GNU General Public
9 * License (GPL). Copies of the GPL can be obtained from:
10 * ftp://prep.ai.mit.edu/pub/gnu/GPL
11 * Each contributing author retains all rights to their own work.
13 * (C) 1999-2001 Ben Fennema
14 * (C) 1999 Stelias Computing Inc
18 * 02/24/99 blf Created.
24 #include <linux/quotaops.h>
25 #include <linux/buffer_head.h>
26 #include <linux/bitops.h>
31 #define udf_clear_bit(nr, addr) ext2_clear_bit(nr, addr)
32 #define udf_set_bit(nr, addr) ext2_set_bit(nr, addr)
33 #define udf_test_bit(nr, addr) ext2_test_bit(nr, addr)
34 #define udf_find_first_one_bit(addr, size) find_first_one_bit(addr, size)
35 #define udf_find_next_one_bit(addr, size, offset) \
36 find_next_one_bit(addr, size, offset)
38 #define leBPL_to_cpup(x) leNUM_to_cpup(BITS_PER_LONG, x)
39 #define leNUM_to_cpup(x, y) xleNUM_to_cpup(x, y)
40 #define xleNUM_to_cpup(x, y) (le ## x ## _to_cpup(y))
41 #define uintBPL_t uint(BITS_PER_LONG)
42 #define uint(x) xuint(x)
43 #define xuint(x) __le ## x
45 static inline int find_next_one_bit(void *addr, int size, int offset)
47 uintBPL_t *p = ((uintBPL_t *) addr) + (offset / BITS_PER_LONG);
48 int result = offset & ~(BITS_PER_LONG - 1);
54 offset &= (BITS_PER_LONG - 1);
56 tmp = leBPL_to_cpup(p++);
57 tmp &= ~0UL << offset;
58 if (size < BITS_PER_LONG)
62 size -= BITS_PER_LONG;
63 result += BITS_PER_LONG;
65 while (size & ~(BITS_PER_LONG - 1)) {
66 tmp = leBPL_to_cpup(p++);
69 result += BITS_PER_LONG;
70 size -= BITS_PER_LONG;
74 tmp = leBPL_to_cpup(p);
76 tmp &= ~0UL >> (BITS_PER_LONG - size);
78 return result + ffz(~tmp);
81 #define find_first_one_bit(addr, size)\
82 find_next_one_bit((addr), (size), 0)
84 static int read_block_bitmap(struct super_block *sb,
85 struct udf_bitmap *bitmap, unsigned int block,
86 unsigned long bitmap_nr)
88 struct buffer_head *bh = NULL;
92 loc.logicalBlockNum = bitmap->s_extPosition;
93 loc.partitionReferenceNum = UDF_SB(sb)->s_partition;
95 bh = udf_tread(sb, udf_get_lb_pblock(sb, loc, block));
99 bitmap->s_block_bitmap[bitmap_nr] = bh;
103 static int __load_block_bitmap(struct super_block *sb,
104 struct udf_bitmap *bitmap,
105 unsigned int block_group)
108 int nr_groups = bitmap->s_nr_groups;
110 if (block_group >= nr_groups) {
111 udf_debug("block_group (%d) > nr_groups (%d)\n", block_group,
115 if (bitmap->s_block_bitmap[block_group]) {
118 retval = read_block_bitmap(sb, bitmap, block_group,
126 static inline int load_block_bitmap(struct super_block *sb,
127 struct udf_bitmap *bitmap,
128 unsigned int block_group)
132 slot = __load_block_bitmap(sb, bitmap, block_group);
137 if (!bitmap->s_block_bitmap[slot])
143 static bool udf_add_free_space(struct udf_sb_info *sbi,
144 u16 partition, u32 cnt)
146 struct logicalVolIntegrityDesc *lvid;
151 lvid = (struct logicalVolIntegrityDesc *)sbi->s_lvid_bh->b_data;
152 lvid->freeSpaceTable[partition] = cpu_to_le32(le32_to_cpu(
153 lvid->freeSpaceTable[partition]) + cnt);
157 static void udf_bitmap_free_blocks(struct super_block *sb,
159 struct udf_bitmap *bitmap,
160 kernel_lb_addr bloc, uint32_t offset,
163 struct udf_sb_info *sbi = UDF_SB(sb);
164 struct buffer_head *bh = NULL;
166 unsigned long block_group;
170 unsigned long overflow;
172 mutex_lock(&sbi->s_alloc_mutex);
173 if (bloc.logicalBlockNum < 0 ||
174 (bloc.logicalBlockNum + count) >
175 sbi->s_partmaps[bloc.partitionReferenceNum].s_partition_len) {
176 udf_debug("%d < %d || %d + %d > %d\n",
177 bloc.logicalBlockNum, 0, bloc.logicalBlockNum, count,
178 sbi->s_partmaps[bloc.partitionReferenceNum].
183 block = bloc.logicalBlockNum + offset +
184 (sizeof(struct spaceBitmapDesc) << 3);
188 block_group = block >> (sb->s_blocksize_bits + 3);
189 bit = block % (sb->s_blocksize << 3);
192 * Check to see if we are freeing blocks across a group boundary.
194 if (bit + count > (sb->s_blocksize << 3)) {
195 overflow = bit + count - (sb->s_blocksize << 3);
198 bitmap_nr = load_block_bitmap(sb, bitmap, block_group);
202 bh = bitmap->s_block_bitmap[bitmap_nr];
203 for (i = 0; i < count; i++) {
204 if (udf_set_bit(bit + i, bh->b_data)) {
205 udf_debug("bit %ld already set\n", bit + i);
206 udf_debug("byte=%2x\n",
207 ((char *)bh->b_data)[(bit + i) >> 3]);
210 DQUOT_FREE_BLOCK(inode, 1);
211 udf_add_free_space(sbi, sbi->s_partition, 1);
214 mark_buffer_dirty(bh);
223 mark_buffer_dirty(sbi->s_lvid_bh);
224 mutex_unlock(&sbi->s_alloc_mutex);
228 static int udf_bitmap_prealloc_blocks(struct super_block *sb,
230 struct udf_bitmap *bitmap,
231 uint16_t partition, uint32_t first_block,
232 uint32_t block_count)
234 struct udf_sb_info *sbi = UDF_SB(sb);
236 int bit, block, block_group, group_start;
237 int nr_groups, bitmap_nr;
238 struct buffer_head *bh;
241 mutex_lock(&sbi->s_alloc_mutex);
242 part_len = sbi->s_partmaps[partition].s_partition_len;
243 if (first_block < 0 || first_block >= part_len)
246 if (first_block + block_count > part_len)
247 block_count = part_len - first_block;
250 nr_groups = udf_compute_nr_groups(sb, partition);
251 block = first_block + (sizeof(struct spaceBitmapDesc) << 3);
252 block_group = block >> (sb->s_blocksize_bits + 3);
253 group_start = block_group ? 0 : sizeof(struct spaceBitmapDesc);
255 bitmap_nr = load_block_bitmap(sb, bitmap, block_group);
258 bh = bitmap->s_block_bitmap[bitmap_nr];
260 bit = block % (sb->s_blocksize << 3);
262 while (bit < (sb->s_blocksize << 3) && block_count > 0) {
263 if (!udf_test_bit(bit, bh->b_data)) {
265 } else if (DQUOT_PREALLOC_BLOCK(inode, 1)) {
267 } else if (!udf_clear_bit(bit, bh->b_data)) {
268 udf_debug("bit already cleared for block %d\n", bit);
269 DQUOT_FREE_BLOCK(inode, 1);
277 mark_buffer_dirty(bh);
281 if (udf_add_free_space(sbi, partition, -alloc_count))
282 mark_buffer_dirty(sbi->s_lvid_bh);
284 mutex_unlock(&sbi->s_alloc_mutex);
288 static int udf_bitmap_new_block(struct super_block *sb,
290 struct udf_bitmap *bitmap, uint16_t partition,
291 uint32_t goal, int *err)
293 struct udf_sb_info *sbi = UDF_SB(sb);
294 int newbit, bit = 0, block, block_group, group_start;
295 int end_goal, nr_groups, bitmap_nr, i;
296 struct buffer_head *bh = NULL;
301 mutex_lock(&sbi->s_alloc_mutex);
304 if (goal < 0 || goal >= sbi->s_partmaps[partition].s_partition_len)
307 nr_groups = bitmap->s_nr_groups;
308 block = goal + (sizeof(struct spaceBitmapDesc) << 3);
309 block_group = block >> (sb->s_blocksize_bits + 3);
310 group_start = block_group ? 0 : sizeof(struct spaceBitmapDesc);
312 bitmap_nr = load_block_bitmap(sb, bitmap, block_group);
315 bh = bitmap->s_block_bitmap[bitmap_nr];
316 ptr = memscan((char *)bh->b_data + group_start, 0xFF,
317 sb->s_blocksize - group_start);
319 if ((ptr - ((char *)bh->b_data)) < sb->s_blocksize) {
320 bit = block % (sb->s_blocksize << 3);
321 if (udf_test_bit(bit, bh->b_data))
324 end_goal = (bit + 63) & ~63;
325 bit = udf_find_next_one_bit(bh->b_data, end_goal, bit);
329 ptr = memscan((char *)bh->b_data + (bit >> 3), 0xFF,
330 sb->s_blocksize - ((bit + 7) >> 3));
331 newbit = (ptr - ((char *)bh->b_data)) << 3;
332 if (newbit < sb->s_blocksize << 3) {
337 newbit = udf_find_next_one_bit(bh->b_data,
338 sb->s_blocksize << 3, bit);
339 if (newbit < sb->s_blocksize << 3) {
345 for (i = 0; i < (nr_groups * 2); i++) {
347 if (block_group >= nr_groups)
349 group_start = block_group ? 0 : sizeof(struct spaceBitmapDesc);
351 bitmap_nr = load_block_bitmap(sb, bitmap, block_group);
354 bh = bitmap->s_block_bitmap[bitmap_nr];
356 ptr = memscan((char *)bh->b_data + group_start, 0xFF,
357 sb->s_blocksize - group_start);
358 if ((ptr - ((char *)bh->b_data)) < sb->s_blocksize) {
359 bit = (ptr - ((char *)bh->b_data)) << 3;
363 bit = udf_find_next_one_bit((char *)bh->b_data,
364 sb->s_blocksize << 3,
366 if (bit < sb->s_blocksize << 3)
370 if (i >= (nr_groups * 2)) {
371 mutex_unlock(&sbi->s_alloc_mutex);
374 if (bit < sb->s_blocksize << 3)
377 bit = udf_find_next_one_bit(bh->b_data, sb->s_blocksize << 3,
379 if (bit >= sb->s_blocksize << 3) {
380 mutex_unlock(&sbi->s_alloc_mutex);
386 while (i < 7 && bit > (group_start << 3) &&
387 udf_test_bit(bit - 1, bh->b_data)) {
395 * Check quota for allocation of this block.
397 if (inode && DQUOT_ALLOC_BLOCK(inode, 1)) {
398 mutex_unlock(&sbi->s_alloc_mutex);
403 newblock = bit + (block_group << (sb->s_blocksize_bits + 3)) -
404 (sizeof(struct spaceBitmapDesc) << 3);
406 if (!udf_clear_bit(bit, bh->b_data)) {
407 udf_debug("bit already cleared for block %d\n", bit);
411 mark_buffer_dirty(bh);
413 if (udf_add_free_space(sbi, partition, -1))
414 mark_buffer_dirty(sbi->s_lvid_bh);
416 mutex_unlock(&sbi->s_alloc_mutex);
422 mutex_unlock(&sbi->s_alloc_mutex);
426 static void udf_table_free_blocks(struct super_block *sb,
429 kernel_lb_addr bloc, uint32_t offset,
432 struct udf_sb_info *sbi = UDF_SB(sb);
436 struct extent_position oepos, epos;
440 mutex_lock(&sbi->s_alloc_mutex);
441 if (bloc.logicalBlockNum < 0 ||
442 (bloc.logicalBlockNum + count) >
443 sbi->s_partmaps[bloc.partitionReferenceNum].s_partition_len) {
444 udf_debug("%d < %d || %d + %d > %d\n",
445 bloc.logicalBlockNum, 0, bloc.logicalBlockNum, count,
446 sbi->s_partmaps[bloc.partitionReferenceNum].
451 /* We do this up front - There are some error conditions that
452 could occure, but.. oh well */
454 DQUOT_FREE_BLOCK(inode, count);
455 if (udf_add_free_space(sbi, sbi->s_partition, count))
456 mark_buffer_dirty(sbi->s_lvid_bh);
458 start = bloc.logicalBlockNum + offset;
459 end = bloc.logicalBlockNum + offset + count - 1;
461 epos.offset = oepos.offset = sizeof(struct unallocSpaceEntry);
463 epos.block = oepos.block = UDF_I_LOCATION(table);
464 epos.bh = oepos.bh = NULL;
467 (etype = udf_next_aext(table, &epos, &eloc, &elen, 1)) != -1) {
468 if (((eloc.logicalBlockNum +
469 (elen >> sb->s_blocksize_bits)) == start)) {
470 if ((0x3FFFFFFF - elen) <
471 (count << sb->s_blocksize_bits)) {
472 uint32_t tmp = ((0x3FFFFFFF - elen) >>
473 sb->s_blocksize_bits);
476 elen = (etype << 30) |
477 (0x40000000 - sb->s_blocksize);
479 elen = (etype << 30) |
481 (count << sb->s_blocksize_bits));
485 udf_write_aext(table, &oepos, eloc, elen, 1);
486 } else if (eloc.logicalBlockNum == (end + 1)) {
487 if ((0x3FFFFFFF - elen) <
488 (count << sb->s_blocksize_bits)) {
489 uint32_t tmp = ((0x3FFFFFFF - elen) >>
490 sb->s_blocksize_bits);
493 eloc.logicalBlockNum -= tmp;
494 elen = (etype << 30) |
495 (0x40000000 - sb->s_blocksize);
497 eloc.logicalBlockNum = start;
498 elen = (etype << 30) |
500 (count << sb->s_blocksize_bits));
504 udf_write_aext(table, &oepos, eloc, elen, 1);
507 if (epos.bh != oepos.bh) {
509 oepos.block = epos.block;
515 oepos.offset = epos.offset;
521 * NOTE: we CANNOT use udf_add_aext here, as it can try to
522 * allocate a new block, and since we hold the super block
523 * lock already very bad things would happen :)
525 * We copy the behavior of udf_add_aext, but instead of
526 * trying to allocate a new block close to the existing one,
527 * we just steal a block from the extent we are trying to add.
529 * It would be nice if the blocks were close together, but it
534 short_ad *sad = NULL;
536 struct allocExtDesc *aed;
538 eloc.logicalBlockNum = start;
539 elen = EXT_RECORDED_ALLOCATED |
540 (count << sb->s_blocksize_bits);
542 if (UDF_I_ALLOCTYPE(table) == ICBTAG_FLAG_AD_SHORT) {
543 adsize = sizeof(short_ad);
544 } else if (UDF_I_ALLOCTYPE(table) == ICBTAG_FLAG_AD_LONG) {
545 adsize = sizeof(long_ad);
552 if (epos.offset + (2 * adsize) > sb->s_blocksize) {
559 /* Steal a block from the extent being free'd */
560 epos.block.logicalBlockNum = eloc.logicalBlockNum;
561 eloc.logicalBlockNum++;
562 elen -= sb->s_blocksize;
564 epos.bh = udf_tread(sb,
565 udf_get_lb_pblock(sb, epos.block, 0));
570 aed = (struct allocExtDesc *)(epos.bh->b_data);
571 aed->previousAllocExtLocation =
572 cpu_to_le32(oepos.block.logicalBlockNum);
573 if (epos.offset + adsize > sb->s_blocksize) {
574 loffset = epos.offset;
575 aed->lengthAllocDescs = cpu_to_le32(adsize);
576 sptr = UDF_I_DATA(table) + epos.offset - adsize;
577 dptr = epos.bh->b_data +
578 sizeof(struct allocExtDesc);
579 memcpy(dptr, sptr, adsize);
580 epos.offset = sizeof(struct allocExtDesc) +
583 loffset = epos.offset + adsize;
584 aed->lengthAllocDescs = cpu_to_le32(0);
586 sptr = oepos.bh->b_data + epos.offset;
587 aed = (struct allocExtDesc *)
589 aed->lengthAllocDescs =
590 cpu_to_le32(le32_to_cpu(
591 aed->lengthAllocDescs) +
594 sptr = UDF_I_DATA(table) + epos.offset;
595 UDF_I_LENALLOC(table) += adsize;
596 mark_inode_dirty(table);
598 epos.offset = sizeof(struct allocExtDesc);
600 if (sbi->s_udfrev >= 0x0200)
601 udf_new_tag(epos.bh->b_data, TAG_IDENT_AED,
602 3, 1, epos.block.logicalBlockNum,
605 udf_new_tag(epos.bh->b_data, TAG_IDENT_AED,
606 2, 1, epos.block.logicalBlockNum,
609 switch (UDF_I_ALLOCTYPE(table)) {
610 case ICBTAG_FLAG_AD_SHORT:
611 sad = (short_ad *)sptr;
612 sad->extLength = cpu_to_le32(
613 EXT_NEXT_EXTENT_ALLOCDECS |
616 cpu_to_le32(epos.block.logicalBlockNum);
618 case ICBTAG_FLAG_AD_LONG:
619 lad = (long_ad *)sptr;
620 lad->extLength = cpu_to_le32(
621 EXT_NEXT_EXTENT_ALLOCDECS |
624 cpu_to_lelb(epos.block);
628 udf_update_tag(oepos.bh->b_data, loffset);
629 mark_buffer_dirty(oepos.bh);
631 mark_inode_dirty(table);
635 /* It's possible that stealing the block emptied the extent */
637 udf_write_aext(table, &epos, eloc, elen, 1);
640 UDF_I_LENALLOC(table) += adsize;
641 mark_inode_dirty(table);
643 aed = (struct allocExtDesc *)epos.bh->b_data;
644 aed->lengthAllocDescs =
645 cpu_to_le32(le32_to_cpu(
646 aed->lengthAllocDescs) + adsize);
647 udf_update_tag(epos.bh->b_data, epos.offset);
648 mark_buffer_dirty(epos.bh);
658 mutex_unlock(&sbi->s_alloc_mutex);
662 static int udf_table_prealloc_blocks(struct super_block *sb,
664 struct inode *table, uint16_t partition,
665 uint32_t first_block, uint32_t block_count)
667 struct udf_sb_info *sbi = UDF_SB(sb);
669 uint32_t elen, adsize;
671 struct extent_position epos;
674 if (first_block < 0 ||
675 first_block >= sbi->s_partmaps[partition].s_partition_len)
678 if (UDF_I_ALLOCTYPE(table) == ICBTAG_FLAG_AD_SHORT)
679 adsize = sizeof(short_ad);
680 else if (UDF_I_ALLOCTYPE(table) == ICBTAG_FLAG_AD_LONG)
681 adsize = sizeof(long_ad);
685 mutex_lock(&sbi->s_alloc_mutex);
686 epos.offset = sizeof(struct unallocSpaceEntry);
687 epos.block = UDF_I_LOCATION(table);
689 eloc.logicalBlockNum = 0xFFFFFFFF;
691 while (first_block != eloc.logicalBlockNum &&
692 (etype = udf_next_aext(table, &epos, &eloc, &elen, 1)) != -1) {
693 udf_debug("eloc=%d, elen=%d, first_block=%d\n",
694 eloc.logicalBlockNum, elen, first_block);
695 ; /* empty loop body */
698 if (first_block == eloc.logicalBlockNum) {
699 epos.offset -= adsize;
701 alloc_count = (elen >> sb->s_blocksize_bits);
702 if (inode && DQUOT_PREALLOC_BLOCK(inode,
703 alloc_count > block_count ? block_count : alloc_count))
705 else if (alloc_count > block_count) {
706 alloc_count = block_count;
707 eloc.logicalBlockNum += alloc_count;
708 elen -= (alloc_count << sb->s_blocksize_bits);
709 udf_write_aext(table, &epos, eloc,
710 (etype << 30) | elen, 1);
712 udf_delete_aext(table, epos, eloc,
713 (etype << 30) | elen);
720 if (alloc_count && udf_add_free_space(sbi, partition, -alloc_count)) {
721 mark_buffer_dirty(sbi->s_lvid_bh);
724 mutex_unlock(&sbi->s_alloc_mutex);
728 static int udf_table_new_block(struct super_block *sb,
730 struct inode *table, uint16_t partition,
731 uint32_t goal, int *err)
733 struct udf_sb_info *sbi = UDF_SB(sb);
734 uint32_t spread = 0xFFFFFFFF, nspread = 0xFFFFFFFF;
735 uint32_t newblock = 0, adsize;
736 uint32_t elen, goal_elen = 0;
737 kernel_lb_addr eloc, uninitialized_var(goal_eloc);
738 struct extent_position epos, goal_epos;
743 if (UDF_I_ALLOCTYPE(table) == ICBTAG_FLAG_AD_SHORT)
744 adsize = sizeof(short_ad);
745 else if (UDF_I_ALLOCTYPE(table) == ICBTAG_FLAG_AD_LONG)
746 adsize = sizeof(long_ad);
750 mutex_lock(&sbi->s_alloc_mutex);
751 if (goal < 0 || goal >= sbi->s_partmaps[partition].s_partition_len)
754 /* We search for the closest matching block to goal. If we find
755 a exact hit, we stop. Otherwise we keep going till we run out
756 of extents. We store the buffer_head, bloc, and extoffset
757 of the current closest match and use that when we are done.
759 epos.offset = sizeof(struct unallocSpaceEntry);
760 epos.block = UDF_I_LOCATION(table);
761 epos.bh = goal_epos.bh = NULL;
764 (etype = udf_next_aext(table, &epos, &eloc, &elen, 1)) != -1) {
765 if (goal >= eloc.logicalBlockNum) {
766 if (goal < eloc.logicalBlockNum +
767 (elen >> sb->s_blocksize_bits))
770 nspread = goal - eloc.logicalBlockNum -
771 (elen >> sb->s_blocksize_bits);
773 nspread = eloc.logicalBlockNum - goal;
776 if (nspread < spread) {
778 if (goal_epos.bh != epos.bh) {
779 brelse(goal_epos.bh);
780 goal_epos.bh = epos.bh;
781 get_bh(goal_epos.bh);
783 goal_epos.block = epos.block;
784 goal_epos.offset = epos.offset - adsize;
786 goal_elen = (etype << 30) | elen;
792 if (spread == 0xFFFFFFFF) {
793 brelse(goal_epos.bh);
794 mutex_unlock(&sbi->s_alloc_mutex);
798 /* Only allocate blocks from the beginning of the extent.
799 That way, we only delete (empty) extents, never have to insert an
800 extent because of splitting */
801 /* This works, but very poorly.... */
803 newblock = goal_eloc.logicalBlockNum;
804 goal_eloc.logicalBlockNum++;
805 goal_elen -= sb->s_blocksize;
807 if (inode && DQUOT_ALLOC_BLOCK(inode, 1)) {
808 brelse(goal_epos.bh);
809 mutex_unlock(&sbi->s_alloc_mutex);
815 udf_write_aext(table, &goal_epos, goal_eloc, goal_elen, 1);
817 udf_delete_aext(table, goal_epos, goal_eloc, goal_elen);
818 brelse(goal_epos.bh);
820 if (udf_add_free_space(sbi, partition, -1))
821 mark_buffer_dirty(sbi->s_lvid_bh);
824 mutex_unlock(&sbi->s_alloc_mutex);
829 inline void udf_free_blocks(struct super_block *sb,
831 kernel_lb_addr bloc, uint32_t offset,
834 uint16_t partition = bloc.partitionReferenceNum;
835 struct udf_part_map *map = &UDF_SB(sb)->s_partmaps[partition];
837 if (map->s_partition_flags & UDF_PART_FLAG_UNALLOC_BITMAP) {
838 return udf_bitmap_free_blocks(sb, inode,
839 map->s_uspace.s_bitmap,
840 bloc, offset, count);
841 } else if (map->s_partition_flags & UDF_PART_FLAG_UNALLOC_TABLE) {
842 return udf_table_free_blocks(sb, inode,
843 map->s_uspace.s_table,
844 bloc, offset, count);
845 } else if (map->s_partition_flags & UDF_PART_FLAG_FREED_BITMAP) {
846 return udf_bitmap_free_blocks(sb, inode,
847 map->s_fspace.s_bitmap,
848 bloc, offset, count);
849 } else if (map->s_partition_flags & UDF_PART_FLAG_FREED_TABLE) {
850 return udf_table_free_blocks(sb, inode,
851 map->s_fspace.s_table,
852 bloc, offset, count);
858 inline int udf_prealloc_blocks(struct super_block *sb,
860 uint16_t partition, uint32_t first_block,
861 uint32_t block_count)
863 struct udf_part_map *map = &UDF_SB(sb)->s_partmaps[partition];
865 if (map->s_partition_flags & UDF_PART_FLAG_UNALLOC_BITMAP)
866 return udf_bitmap_prealloc_blocks(sb, inode,
867 map->s_uspace.s_bitmap,
868 partition, first_block,
870 else if (map->s_partition_flags & UDF_PART_FLAG_UNALLOC_TABLE)
871 return udf_table_prealloc_blocks(sb, inode,
872 map->s_uspace.s_table,
873 partition, first_block,
875 else if (map->s_partition_flags & UDF_PART_FLAG_FREED_BITMAP)
876 return udf_bitmap_prealloc_blocks(sb, inode,
877 map->s_fspace.s_bitmap,
878 partition, first_block,
880 else if (map->s_partition_flags & UDF_PART_FLAG_FREED_TABLE)
881 return udf_table_prealloc_blocks(sb, inode,
882 map->s_fspace.s_table,
883 partition, first_block,
889 inline int udf_new_block(struct super_block *sb,
891 uint16_t partition, uint32_t goal, int *err)
893 struct udf_part_map *map = &UDF_SB(sb)->s_partmaps[partition];
895 if (map->s_partition_flags & UDF_PART_FLAG_UNALLOC_BITMAP)
896 return udf_bitmap_new_block(sb, inode,
897 map->s_uspace.s_bitmap,
898 partition, goal, err);
899 else if (map->s_partition_flags & UDF_PART_FLAG_UNALLOC_TABLE)
900 return udf_table_new_block(sb, inode,
901 map->s_uspace.s_table,
902 partition, goal, err);
903 else if (map->s_partition_flags & UDF_PART_FLAG_FREED_BITMAP)
904 return udf_bitmap_new_block(sb, inode,
905 map->s_fspace.s_bitmap,
906 partition, goal, err);
907 else if (map->s_partition_flags & UDF_PART_FLAG_FREED_TABLE)
908 return udf_table_new_block(sb, inode,
909 map->s_fspace.s_table,
910 partition, goal, err);