2 * fs/partitions/msdos.c
4 * Code extracted from drivers/block/genhd.c
5 * Copyright (C) 1991-1998 Linus Torvalds
7 * Thanks to Branko Lankester, lankeste@fwi.uva.nl, who found a bug
8 * in the early extended-partition checks and added DM partitions
10 * Support for DiskManager v6.0x added by Mark Lord,
11 * with information provided by OnTrack. This now works for linux fdisk
12 * and LILO, as well as loadlin and bootln. Note that disks other than
13 * /dev/hda *must* have a "DOS" type 0x51 partition in the first slot (hda1).
15 * More flexible handling of extended partitions - aeb, 950831
17 * Check partition table on IDE disks for common CHS translations
19 * Re-organised Feb 1998 Russell King
28 * Many architectures don't like unaligned accesses, while
29 * the nr_sects and start_sect partition table entries are
30 * at a 2 (mod 4) address.
32 #include <asm/unaligned.h>
34 #define SYS_IND(p) (get_unaligned(&p->sys_ind))
35 #define NR_SECTS(p) ({ __le32 __a = get_unaligned(&p->nr_sects); \
39 #define START_SECT(p) ({ __le32 __a = get_unaligned(&p->start_sect); \
43 static inline int is_extended_partition(struct partition
*p
)
45 return (SYS_IND(p
) == DOS_EXTENDED_PARTITION
||
46 SYS_IND(p
) == WIN98_EXTENDED_PARTITION
||
47 SYS_IND(p
) == LINUX_EXTENDED_PARTITION
);
50 #define MSDOS_LABEL_MAGIC1 0x55
51 #define MSDOS_LABEL_MAGIC2 0xAA
54 msdos_magic_present(unsigned char *p
)
56 return (p
[0] == MSDOS_LABEL_MAGIC1
&& p
[1] == MSDOS_LABEL_MAGIC2
);
59 /* Value is EBCDIC 'IBMA' */
60 #define AIX_LABEL_MAGIC1 0xC9
61 #define AIX_LABEL_MAGIC2 0xC2
62 #define AIX_LABEL_MAGIC3 0xD4
63 #define AIX_LABEL_MAGIC4 0xC1
64 static int aix_magic_present(unsigned char *p
, struct block_device
*bdev
)
70 if (p
[0] != AIX_LABEL_MAGIC1
&&
71 p
[1] != AIX_LABEL_MAGIC2
&&
72 p
[2] != AIX_LABEL_MAGIC3
&&
73 p
[3] != AIX_LABEL_MAGIC4
)
75 d
= read_dev_sector(bdev
, 7, §
);
77 if (d
[0] == '_' && d
[1] == 'L' && d
[2] == 'V' && d
[3] == 'M')
85 * Create devices for each logical partition in an extended partition.
86 * The logical partitions form a linked list, with each entry being
87 * a partition table with two entries. The first entry
88 * is the real data partition (with a start relative to the partition
89 * table start). The second is a pointer to the next logical partition
90 * (with a start relative to the entire extended partition).
91 * We do not create a Linux partition for the partition tables, but
92 * only for the actual data partitions.
96 parse_extended(struct parsed_partitions
*state
, struct block_device
*bdev
,
97 u32 first_sector
, u32 first_size
)
102 u32 this_sector
, this_size
;
103 int sector_size
= bdev_hardsect_size(bdev
) / 512;
104 int loopct
= 0; /* number of links followed
105 without finding a data partition */
108 this_sector
= first_sector
;
109 this_size
= first_size
;
114 if (state
->next
== state
->limit
)
116 data
= read_dev_sector(bdev
, this_sector
, §
);
120 if (!msdos_magic_present(data
+ 510))
123 p
= (struct partition
*) (data
+ 0x1be);
126 * Usually, the first entry is the real data partition,
127 * the 2nd entry is the next extended partition, or empty,
128 * and the 3rd and 4th entries are unused.
129 * However, DRDOS sometimes has the extended partition as
130 * the first entry (when the data partition is empty),
131 * and OS/2 seems to use all four entries.
135 * First process the data partition(s)
137 for (i
=0; i
<4; i
++, p
++) {
138 u32 offs
, size
, next
;
139 if (!NR_SECTS(p
) || is_extended_partition(p
))
142 /* Check the 3rd and 4th entries -
143 these sometimes contain random garbage */
144 offs
= START_SECT(p
)*sector_size
;
145 size
= NR_SECTS(p
)*sector_size
;
146 next
= this_sector
+ offs
;
148 if (offs
+ size
> this_size
)
150 if (next
< first_sector
)
152 if (next
+ size
> first_sector
+ first_size
)
156 put_partition(state
, state
->next
, next
, size
);
157 if (SYS_IND(p
) == LINUX_RAID_PARTITION
)
158 state
->parts
[state
->next
].flags
= 1;
160 if (++state
->next
== state
->limit
)
164 * Next, process the (first) extended partition, if present.
165 * (So far, there seems to be no reason to make
166 * parse_extended() recursive and allow a tree
167 * of extended partitions.)
168 * It should be a link to the next logical partition.
171 for (i
=0; i
<4; i
++, p
++)
172 if (NR_SECTS(p
) && is_extended_partition(p
))
175 goto done
; /* nothing left to do */
177 this_sector
= first_sector
+ START_SECT(p
) * sector_size
;
178 this_size
= NR_SECTS(p
) * sector_size
;
179 put_dev_sector(sect
);
182 put_dev_sector(sect
);
185 /* james@bpgc.com: Solaris has a nasty indicator: 0x82 which also
186 indicates linux swap. Be careful before believing this is Solaris. */
189 parse_solaris_x86(struct parsed_partitions
*state
, struct block_device
*bdev
,
190 u32 offset
, u32 size
, int origin
)
192 #ifdef CONFIG_SOLARIS_X86_PARTITION
194 struct solaris_x86_vtoc
*v
;
197 v
= (struct solaris_x86_vtoc
*)read_dev_sector(bdev
, offset
+1, §
);
200 if (le32_to_cpu(v
->v_sanity
) != SOLARIS_X86_VTOC_SANE
) {
201 put_dev_sector(sect
);
204 printk(" %s%d: <solaris:", state
->name
, origin
);
205 if (le32_to_cpu(v
->v_version
) != 1) {
206 printk(" cannot handle version %d vtoc>\n",
207 le32_to_cpu(v
->v_version
));
208 put_dev_sector(sect
);
211 for (i
=0; i
<SOLARIS_X86_NUMSLICE
&& state
->next
<state
->limit
; i
++) {
212 struct solaris_x86_slice
*s
= &v
->v_slice
[i
];
216 /* solaris partitions are relative to current MS-DOS
217 * one; must add the offset of the current partition */
218 put_partition(state
, state
->next
++,
219 le32_to_cpu(s
->s_start
)+offset
,
220 le32_to_cpu(s
->s_size
));
222 put_dev_sector(sect
);
227 #if defined(CONFIG_BSD_DISKLABEL)
229 * Create devices for BSD partitions listed in a disklabel, under a
230 * dos-like partition. See parse_extended() for more information.
233 parse_bsd(struct parsed_partitions
*state
, struct block_device
*bdev
,
234 u32 offset
, u32 size
, int origin
, char *flavour
,
238 struct bsd_disklabel
*l
;
239 struct bsd_partition
*p
;
241 l
= (struct bsd_disklabel
*)read_dev_sector(bdev
, offset
+1, §
);
244 if (le32_to_cpu(l
->d_magic
) != BSD_DISKMAGIC
) {
245 put_dev_sector(sect
);
248 printk(" %s%d: <%s:", state
->name
, origin
, flavour
);
250 if (le16_to_cpu(l
->d_npartitions
) < max_partitions
)
251 max_partitions
= le16_to_cpu(l
->d_npartitions
);
252 for (p
= l
->d_partitions
; p
- l
->d_partitions
< max_partitions
; p
++) {
253 u32 bsd_start
, bsd_size
;
255 if (state
->next
== state
->limit
)
257 if (p
->p_fstype
== BSD_FS_UNUSED
)
259 bsd_start
= le32_to_cpu(p
->p_offset
);
260 bsd_size
= le32_to_cpu(p
->p_size
);
261 if (offset
== bsd_start
&& size
== bsd_size
)
262 /* full parent partition, we have it already */
264 if (offset
> bsd_start
|| offset
+size
< bsd_start
+bsd_size
) {
265 printk("bad subpartition - ignored\n");
268 put_partition(state
, state
->next
++, bsd_start
, bsd_size
);
270 put_dev_sector(sect
);
271 if (le16_to_cpu(l
->d_npartitions
) > max_partitions
)
272 printk(" (ignored %d more)",
273 le16_to_cpu(l
->d_npartitions
) - max_partitions
);
279 parse_freebsd(struct parsed_partitions
*state
, struct block_device
*bdev
,
280 u32 offset
, u32 size
, int origin
)
282 #ifdef CONFIG_BSD_DISKLABEL
283 parse_bsd(state
, bdev
, offset
, size
, origin
,
284 "bsd", BSD_MAXPARTITIONS
);
289 parse_netbsd(struct parsed_partitions
*state
, struct block_device
*bdev
,
290 u32 offset
, u32 size
, int origin
)
292 #ifdef CONFIG_BSD_DISKLABEL
293 parse_bsd(state
, bdev
, offset
, size
, origin
,
294 "netbsd", BSD_MAXPARTITIONS
);
299 parse_openbsd(struct parsed_partitions
*state
, struct block_device
*bdev
,
300 u32 offset
, u32 size
, int origin
)
302 #ifdef CONFIG_BSD_DISKLABEL
303 parse_bsd(state
, bdev
, offset
, size
, origin
,
304 "openbsd", OPENBSD_MAXPARTITIONS
);
309 * Create devices for Unixware partitions listed in a disklabel, under a
310 * dos-like partition. See parse_extended() for more information.
313 parse_unixware(struct parsed_partitions
*state
, struct block_device
*bdev
,
314 u32 offset
, u32 size
, int origin
)
316 #ifdef CONFIG_UNIXWARE_DISKLABEL
318 struct unixware_disklabel
*l
;
319 struct unixware_slice
*p
;
321 l
= (struct unixware_disklabel
*)read_dev_sector(bdev
, offset
+29, §
);
324 if (le32_to_cpu(l
->d_magic
) != UNIXWARE_DISKMAGIC
||
325 le32_to_cpu(l
->vtoc
.v_magic
) != UNIXWARE_DISKMAGIC2
) {
326 put_dev_sector(sect
);
329 printk(" %s%d: <unixware:", state
->name
, origin
);
330 p
= &l
->vtoc
.v_slice
[1];
331 /* I omit the 0th slice as it is the same as whole disk. */
332 while (p
- &l
->vtoc
.v_slice
[0] < UNIXWARE_NUMSLICE
) {
333 if (state
->next
== state
->limit
)
336 if (p
->s_label
!= UNIXWARE_FS_UNUSED
)
337 put_partition(state
, state
->next
++,
338 START_SECT(p
), NR_SECTS(p
));
341 put_dev_sector(sect
);
347 * Minix 2.0.0/2.0.2 subpartition support.
348 * Anand Krishnamurthy <anandk@wiproge.med.ge.com>
349 * Rajeev V. Pillai <rajeevvp@yahoo.com>
352 parse_minix(struct parsed_partitions
*state
, struct block_device
*bdev
,
353 u32 offset
, u32 size
, int origin
)
355 #ifdef CONFIG_MINIX_SUBPARTITION
361 data
= read_dev_sector(bdev
, offset
, §
);
365 p
= (struct partition
*)(data
+ 0x1be);
367 /* The first sector of a Minix partition can have either
368 * a secondary MBR describing its subpartitions, or
369 * the normal boot sector. */
370 if (msdos_magic_present (data
+ 510) &&
371 SYS_IND(p
) == MINIX_PARTITION
) { /* subpartition table present */
373 printk(" %s%d: <minix:", state
->name
, origin
);
374 for (i
= 0; i
< MINIX_NR_SUBPARTITIONS
; i
++, p
++) {
375 if (state
->next
== state
->limit
)
377 /* add each partition in use */
378 if (SYS_IND(p
) == MINIX_PARTITION
)
379 put_partition(state
, state
->next
++,
380 START_SECT(p
), NR_SECTS(p
));
384 put_dev_sector(sect
);
385 #endif /* CONFIG_MINIX_SUBPARTITION */
390 void (*parse
)(struct parsed_partitions
*, struct block_device
*,
393 {FREEBSD_PARTITION
, parse_freebsd
},
394 {NETBSD_PARTITION
, parse_netbsd
},
395 {OPENBSD_PARTITION
, parse_openbsd
},
396 {MINIX_PARTITION
, parse_minix
},
397 {UNIXWARE_PARTITION
, parse_unixware
},
398 {SOLARIS_X86_PARTITION
, parse_solaris_x86
},
399 {NEW_SOLARIS_X86_PARTITION
, parse_solaris_x86
},
403 int msdos_partition(struct parsed_partitions
*state
, struct block_device
*bdev
)
405 int sector_size
= bdev_hardsect_size(bdev
) / 512;
411 data
= read_dev_sector(bdev
, 0, §
);
414 if (!msdos_magic_present(data
+ 510)) {
415 put_dev_sector(sect
);
419 if (aix_magic_present(data
, bdev
)) {
420 put_dev_sector(sect
);
426 * Now that the 55aa signature is present, this is probably
427 * either the boot sector of a FAT filesystem or a DOS-type
428 * partition table. Reject this in case the boot indicator
431 p
= (struct partition
*) (data
+ 0x1be);
432 for (slot
= 1; slot
<= 4; slot
++, p
++) {
433 if (p
->boot_ind
!= 0 && p
->boot_ind
!= 0x80) {
434 put_dev_sector(sect
);
439 #ifdef CONFIG_EFI_PARTITION
440 p
= (struct partition
*) (data
+ 0x1be);
441 for (slot
= 1 ; slot
<= 4 ; slot
++, p
++) {
442 /* If this is an EFI GPT disk, msdos should ignore it. */
443 if (SYS_IND(p
) == EFI_PMBR_OSTYPE_EFI_GPT
) {
444 put_dev_sector(sect
);
449 p
= (struct partition
*) (data
+ 0x1be);
452 * Look for partitions in two passes:
453 * First find the primary and DOS-type extended partitions.
454 * On the second pass look inside *BSD, Unixware and Solaris partitions.
458 for (slot
= 1 ; slot
<= 4 ; slot
++, p
++) {
459 u32 start
= START_SECT(p
)*sector_size
;
460 u32 size
= NR_SECTS(p
)*sector_size
;
463 if (is_extended_partition(p
)) {
464 /* prevent someone doing mkfs or mkswap on an
465 extended partition, but leave room for LILO */
466 put_partition(state
, slot
, start
, size
== 1 ? 1 : 2);
468 parse_extended(state
, bdev
, start
, size
);
472 put_partition(state
, slot
, start
, size
);
473 if (SYS_IND(p
) == LINUX_RAID_PARTITION
)
474 state
->parts
[slot
].flags
= 1;
475 if (SYS_IND(p
) == DM6_PARTITION
)
477 if (SYS_IND(p
) == EZD_PARTITION
)
483 /* second pass - output for each on a separate line */
484 p
= (struct partition
*) (0x1be + data
);
485 for (slot
= 1 ; slot
<= 4 ; slot
++, p
++) {
486 unsigned char id
= SYS_IND(p
);
492 for (n
= 0; subtypes
[n
].parse
&& id
!= subtypes
[n
].id
; n
++)
495 if (!subtypes
[n
].parse
)
497 subtypes
[n
].parse(state
, bdev
, START_SECT(p
)*sector_size
,
498 NR_SECTS(p
)*sector_size
, slot
);
500 put_dev_sector(sect
);