5 * Partition handling routines for the OSTA-UDF(tm) filesystem.
8 * E-mail regarding any portion of the Linux UDF file system should be
9 * directed to the development team mailing list (run by majordomo):
10 * linux_udf@hpesjro.fc.hp.com
13 * This file is distributed under the terms of the GNU General Public
14 * License (GPL). Copies of the GPL can be obtained from:
15 * ftp://prep.ai.mit.edu/pub/gnu/GPL
16 * Each contributing author retains all rights to their own work.
18 * (C) 1998-2001 Ben Fennema
22 * 12/06/98 blf Created file.
31 #include <linux/string.h>
32 #include <linux/udf_fs.h>
33 #include <linux/slab.h>
35 inline uint32_t udf_get_pblock(struct super_block *sb, uint32_t block, uint16_t partition, uint32_t offset)
37 if (partition >= UDF_SB_NUMPARTS(sb))
39 udf_debug("block=%d, partition=%d, offset=%d: invalid partition\n",
40 block, partition, offset);
43 if (UDF_SB_PARTFUNC(sb, partition))
44 return UDF_SB_PARTFUNC(sb, partition)(sb, block, partition, offset);
46 return UDF_SB_PARTROOT(sb, partition) + block + offset;
49 uint32_t udf_get_pblock_virt15(struct super_block *sb, uint32_t block, uint16_t partition, uint32_t offset)
51 struct buffer_head *bh = NULL;
56 index = (sb->s_blocksize - UDF_SB_TYPEVIRT(sb,partition).s_start_offset) / sizeof(uint32_t);
58 if (block > UDF_SB_TYPEVIRT(sb,partition).s_num_entries)
60 udf_debug("Trying to access block beyond end of VAT (%d max %d)\n",
61 block, UDF_SB_TYPEVIRT(sb,partition).s_num_entries);
68 newblock = 1 + (block / (sb->s_blocksize / sizeof(uint32_t)));
69 index = block % (sb->s_blocksize / sizeof(uint32_t));
74 index = UDF_SB_TYPEVIRT(sb,partition).s_start_offset / sizeof(uint32_t) + block;
77 loc = udf_block_map(UDF_SB_VAT(sb), newblock);
79 if (!(bh = sb_bread(sb, loc)))
81 udf_debug("get_pblock(UDF_VIRTUAL_MAP:%p,%d,%d) VAT: %d[%d]\n",
82 sb, block, partition, loc, index);
86 loc = le32_to_cpu(((uint32_t *)bh->b_data)[index]);
90 if (UDF_I_LOCATION(UDF_SB_VAT(sb)).partitionReferenceNum == partition)
92 udf_debug("recursive call to udf_get_pblock!\n");
96 return udf_get_pblock(sb, loc, UDF_I_LOCATION(UDF_SB_VAT(sb)).partitionReferenceNum, offset);
99 inline uint32_t udf_get_pblock_virt20(struct super_block *sb, uint32_t block, uint16_t partition, uint32_t offset)
101 return udf_get_pblock_virt15(sb, block, partition, offset);
104 uint32_t udf_get_pblock_spar15(struct super_block *sb, uint32_t block, uint16_t partition, uint32_t offset)
107 struct sparingTable *st = NULL;
108 uint32_t packet = (block + offset) & ~(UDF_SB_TYPESPAR(sb,partition).s_packet_len - 1);
112 if (UDF_SB_TYPESPAR(sb,partition).s_spar_map[i] != NULL)
114 st = (struct sparingTable *)UDF_SB_TYPESPAR(sb,partition).s_spar_map[i]->b_data;
121 for (i=0; i<st->reallocationTableLen; i++)
123 if (le32_to_cpu(st->mapEntry[i].origLocation) >= 0xFFFFFFF0)
125 else if (le32_to_cpu(st->mapEntry[i].origLocation) == packet)
127 return le32_to_cpu(st->mapEntry[i].mappedLocation) +
128 ((block + offset) & (UDF_SB_TYPESPAR(sb,partition).s_packet_len - 1));
130 else if (le32_to_cpu(st->mapEntry[i].origLocation) > packet)
134 return UDF_SB_PARTROOT(sb,partition) + block + offset;
137 int udf_relocate_blocks(struct super_block *sb, long old_block, long *new_block)
139 struct udf_sparing_data *sdata;
140 struct sparingTable *st = NULL;
141 struct sparingEntry mapEntry;
145 for (i=0; i<UDF_SB_NUMPARTS(sb); i++)
147 if (old_block > UDF_SB_PARTROOT(sb,i) &&
148 old_block < UDF_SB_PARTROOT(sb,i) + UDF_SB_PARTLEN(sb,i))
150 sdata = &UDF_SB_TYPESPAR(sb,i);
151 packet = (old_block - UDF_SB_PARTROOT(sb,i)) & ~(sdata->s_packet_len - 1);
155 if (UDF_SB_TYPESPAR(sb,i).s_spar_map[j] != NULL)
157 st = (struct sparingTable *)sdata->s_spar_map[j]->b_data;
165 for (k=0; k<st->reallocationTableLen; k++)
167 if (le32_to_cpu(st->mapEntry[k].origLocation) == 0xFFFFFFFF)
171 if (sdata->s_spar_map[j])
173 st = (struct sparingTable *)sdata->s_spar_map[j]->b_data;
174 st->mapEntry[k].origLocation = cpu_to_le32(packet);
175 udf_update_tag((char *)st, sizeof(struct sparingTable) + st->reallocationTableLen * sizeof(struct sparingEntry));
176 mark_buffer_dirty(sdata->s_spar_map[j]);
179 *new_block = le32_to_cpu(st->mapEntry[k].mappedLocation) +
180 ((old_block - UDF_SB_PARTROOT(sb,i)) & (sdata->s_packet_len - 1));
183 else if (le32_to_cpu(st->mapEntry[k].origLocation) == packet)
185 *new_block = le32_to_cpu(st->mapEntry[k].mappedLocation) +
186 ((old_block - UDF_SB_PARTROOT(sb,i)) & (sdata->s_packet_len - 1));
189 else if (le32_to_cpu(st->mapEntry[k].origLocation) > packet)
192 for (l=k; l<st->reallocationTableLen; l++)
194 if (le32_to_cpu(st->mapEntry[l].origLocation) == 0xFFFFFFFF)
198 if (sdata->s_spar_map[j])
200 st = (struct sparingTable *)sdata->s_spar_map[j]->b_data;
201 mapEntry = st->mapEntry[l];
202 mapEntry.origLocation = cpu_to_le32(packet);
203 memmove(&st->mapEntry[k+1], &st->mapEntry[k], (l-k)*sizeof(struct sparingEntry));
204 st->mapEntry[k] = mapEntry;
205 udf_update_tag((char *)st, sizeof(struct sparingTable) + st->reallocationTableLen * sizeof(struct sparingEntry));
206 mark_buffer_dirty(sdata->s_spar_map[j]);
209 *new_block = le32_to_cpu(st->mapEntry[k].mappedLocation) +
210 ((old_block - UDF_SB_PARTROOT(sb,i)) & (sdata->s_packet_len - 1));
217 if (i == UDF_SB_NUMPARTS(sb))
219 /* outside of partitions */
220 /* for now, fail =) */