/*
|
/*
|
* fs/partitions/msdos.c
|
* fs/partitions/msdos.c
|
*
|
*
|
* Code extracted from drivers/block/genhd.c
|
* Code extracted from drivers/block/genhd.c
|
* Copyright (C) 1991-1998 Linus Torvalds
|
* Copyright (C) 1991-1998 Linus Torvalds
|
*
|
*
|
* Thanks to Branko Lankester, lankeste@fwi.uva.nl, who found a bug
|
* Thanks to Branko Lankester, lankeste@fwi.uva.nl, who found a bug
|
* in the early extended-partition checks and added DM partitions
|
* in the early extended-partition checks and added DM partitions
|
*
|
*
|
* Support for DiskManager v6.0x added by Mark Lord,
|
* Support for DiskManager v6.0x added by Mark Lord,
|
* with information provided by OnTrack. This now works for linux fdisk
|
* with information provided by OnTrack. This now works for linux fdisk
|
* and LILO, as well as loadlin and bootln. Note that disks other than
|
* and LILO, as well as loadlin and bootln. Note that disks other than
|
* /dev/hda *must* have a "DOS" type 0x51 partition in the first slot (hda1).
|
* /dev/hda *must* have a "DOS" type 0x51 partition in the first slot (hda1).
|
*
|
*
|
* More flexible handling of extended partitions - aeb, 950831
|
* More flexible handling of extended partitions - aeb, 950831
|
*
|
*
|
* Check partition table on IDE disks for common CHS translations
|
* Check partition table on IDE disks for common CHS translations
|
*
|
*
|
* Re-organised Feb 1998 Russell King
|
* Re-organised Feb 1998 Russell King
|
*/
|
*/
|
|
|
|
|
#include "check.h"
|
#include "check.h"
|
#include "msdos.h"
|
#include "msdos.h"
|
#include "efi.h"
|
#include "efi.h"
|
|
|
/*
|
/*
|
* Many architectures don't like unaligned accesses, while
|
* Many architectures don't like unaligned accesses, while
|
* the nr_sects and start_sect partition table entries are
|
* the nr_sects and start_sect partition table entries are
|
* at a 2 (mod 4) address.
|
* at a 2 (mod 4) address.
|
*/
|
*/
|
#include <asm/unaligned.h>
|
#include <asm/unaligned.h>
|
|
|
#define SYS_IND(p) (get_unaligned(&p->sys_ind))
|
#define SYS_IND(p) (get_unaligned(&p->sys_ind))
|
#define NR_SECTS(p) ({ __le32 __a = get_unaligned(&p->nr_sects); \
|
#define NR_SECTS(p) ({ __le32 __a = get_unaligned(&p->nr_sects); \
|
le32_to_cpu(__a); \
|
le32_to_cpu(__a); \
|
})
|
})
|
|
|
#define START_SECT(p) ({ __le32 __a = get_unaligned(&p->start_sect); \
|
#define START_SECT(p) ({ __le32 __a = get_unaligned(&p->start_sect); \
|
le32_to_cpu(__a); \
|
le32_to_cpu(__a); \
|
})
|
})
|
|
|
static inline int is_extended_partition(struct partition *p)
|
static inline int is_extended_partition(struct partition *p)
|
{
|
{
|
return (SYS_IND(p) == DOS_EXTENDED_PARTITION ||
|
return (SYS_IND(p) == DOS_EXTENDED_PARTITION ||
|
SYS_IND(p) == WIN98_EXTENDED_PARTITION ||
|
SYS_IND(p) == WIN98_EXTENDED_PARTITION ||
|
SYS_IND(p) == LINUX_EXTENDED_PARTITION);
|
SYS_IND(p) == LINUX_EXTENDED_PARTITION);
|
}
|
}
|
|
|
#define MSDOS_LABEL_MAGIC1 0x55
|
#define MSDOS_LABEL_MAGIC1 0x55
|
#define MSDOS_LABEL_MAGIC2 0xAA
|
#define MSDOS_LABEL_MAGIC2 0xAA
|
|
|
static inline int
|
static inline int
|
msdos_magic_present(unsigned char *p)
|
msdos_magic_present(unsigned char *p)
|
{
|
{
|
return (p[0] == MSDOS_LABEL_MAGIC1 && p[1] == MSDOS_LABEL_MAGIC2);
|
return (p[0] == MSDOS_LABEL_MAGIC1 && p[1] == MSDOS_LABEL_MAGIC2);
|
}
|
}
|
|
|
/* Value is EBCDIC 'IBMA' */
|
/* Value is EBCDIC 'IBMA' */
|
#define AIX_LABEL_MAGIC1 0xC9
|
#define AIX_LABEL_MAGIC1 0xC9
|
#define AIX_LABEL_MAGIC2 0xC2
|
#define AIX_LABEL_MAGIC2 0xC2
|
#define AIX_LABEL_MAGIC3 0xD4
|
#define AIX_LABEL_MAGIC3 0xD4
|
#define AIX_LABEL_MAGIC4 0xC1
|
#define AIX_LABEL_MAGIC4 0xC1
|
static int aix_magic_present(unsigned char *p, struct block_device *bdev)
|
static int aix_magic_present(unsigned char *p, struct block_device *bdev)
|
{
|
{
|
struct partition *pt = (struct partition *) (p + 0x1be);
|
struct partition *pt = (struct partition *) (p + 0x1be);
|
Sector sect;
|
Sector sect;
|
unsigned char *d;
|
unsigned char *d;
|
int slot, ret = 0;
|
int slot, ret = 0;
|
|
|
if (!(p[0] == AIX_LABEL_MAGIC1 &&
|
if (!(p[0] == AIX_LABEL_MAGIC1 &&
|
p[1] == AIX_LABEL_MAGIC2 &&
|
p[1] == AIX_LABEL_MAGIC2 &&
|
p[2] == AIX_LABEL_MAGIC3 &&
|
p[2] == AIX_LABEL_MAGIC3 &&
|
p[3] == AIX_LABEL_MAGIC4))
|
p[3] == AIX_LABEL_MAGIC4))
|
return 0;
|
return 0;
|
/* Assume the partition table is valid if Linux partitions exists */
|
/* Assume the partition table is valid if Linux partitions exists */
|
for (slot = 1; slot <= 4; slot++, pt++) {
|
for (slot = 1; slot <= 4; slot++, pt++) {
|
if (pt->sys_ind == LINUX_SWAP_PARTITION ||
|
if (pt->sys_ind == LINUX_SWAP_PARTITION ||
|
pt->sys_ind == LINUX_RAID_PARTITION ||
|
pt->sys_ind == LINUX_RAID_PARTITION ||
|
pt->sys_ind == LINUX_DATA_PARTITION ||
|
pt->sys_ind == LINUX_DATA_PARTITION ||
|
pt->sys_ind == LINUX_LVM_PARTITION ||
|
pt->sys_ind == LINUX_LVM_PARTITION ||
|
is_extended_partition(pt))
|
is_extended_partition(pt))
|
return 0;
|
return 0;
|
}
|
}
|
d = read_dev_sector(bdev, 7, §);
|
d = read_dev_sector(bdev, 7, §);
|
if (d) {
|
if (d) {
|
if (d[0] == '_' && d[1] == 'L' && d[2] == 'V' && d[3] == 'M')
|
if (d[0] == '_' && d[1] == 'L' && d[2] == 'V' && d[3] == 'M')
|
ret = 1;
|
ret = 1;
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
};
|
};
|
return ret;
|
return ret;
|
}
|
}
|
|
|
/*
|
/*
|
* Create devices for each logical partition in an extended partition.
|
* Create devices for each logical partition in an extended partition.
|
* The logical partitions form a linked list, with each entry being
|
* The logical partitions form a linked list, with each entry being
|
* a partition table with two entries. The first entry
|
* a partition table with two entries. The first entry
|
* is the real data partition (with a start relative to the partition
|
* is the real data partition (with a start relative to the partition
|
* table start). The second is a pointer to the next logical partition
|
* table start). The second is a pointer to the next logical partition
|
* (with a start relative to the entire extended partition).
|
* (with a start relative to the entire extended partition).
|
* We do not create a Linux partition for the partition tables, but
|
* We do not create a Linux partition for the partition tables, but
|
* only for the actual data partitions.
|
* only for the actual data partitions.
|
*/
|
*/
|
|
|
static void
|
static void
|
parse_extended(struct parsed_partitions *state, struct block_device *bdev,
|
parse_extended(struct parsed_partitions *state, struct block_device *bdev,
|
u32 first_sector, u32 first_size)
|
u32 first_sector, u32 first_size)
|
{
|
{
|
struct partition *p;
|
struct partition *p;
|
Sector sect;
|
Sector sect;
|
unsigned char *data;
|
unsigned char *data;
|
u32 this_sector, this_size;
|
u32 this_sector, this_size;
|
int sector_size = bdev_hardsect_size(bdev) / 512;
|
int sector_size = bdev_hardsect_size(bdev) / 512;
|
int loopct = 0; /* number of links followed
|
int loopct = 0; /* number of links followed
|
without finding a data partition */
|
without finding a data partition */
|
int i;
|
int i;
|
|
|
this_sector = first_sector;
|
this_sector = first_sector;
|
this_size = first_size;
|
this_size = first_size;
|
|
|
while (1) {
|
while (1) {
|
if (++loopct > 100)
|
if (++loopct > 100)
|
return;
|
return;
|
if (state->next == state->limit)
|
if (state->next == state->limit)
|
return;
|
return;
|
data = read_dev_sector(bdev, this_sector, §);
|
data = read_dev_sector(bdev, this_sector, §);
|
if (!data)
|
if (!data)
|
return;
|
return;
|
|
|
if (!msdos_magic_present(data + 510))
|
if (!msdos_magic_present(data + 510))
|
goto done;
|
goto done;
|
|
|
p = (struct partition *) (data + 0x1be);
|
p = (struct partition *) (data + 0x1be);
|
|
|
/*
|
/*
|
* Usually, the first entry is the real data partition,
|
* Usually, the first entry is the real data partition,
|
* the 2nd entry is the next extended partition, or empty,
|
* the 2nd entry is the next extended partition, or empty,
|
* and the 3rd and 4th entries are unused.
|
* and the 3rd and 4th entries are unused.
|
* However, DRDOS sometimes has the extended partition as
|
* However, DRDOS sometimes has the extended partition as
|
* the first entry (when the data partition is empty),
|
* the first entry (when the data partition is empty),
|
* and OS/2 seems to use all four entries.
|
* and OS/2 seems to use all four entries.
|
*/
|
*/
|
|
|
/*
|
/*
|
* First process the data partition(s)
|
* First process the data partition(s)
|
*/
|
*/
|
for (i=0; i<4; i++, p++) {
|
for (i=0; i<4; i++, p++) {
|
u32 offs, size, next;
|
u32 offs, size, next;
|
if (!NR_SECTS(p) || is_extended_partition(p))
|
if (!NR_SECTS(p) || is_extended_partition(p))
|
continue;
|
continue;
|
|
|
/* Check the 3rd and 4th entries -
|
/* Check the 3rd and 4th entries -
|
these sometimes contain random garbage */
|
these sometimes contain random garbage */
|
offs = START_SECT(p)*sector_size;
|
offs = START_SECT(p)*sector_size;
|
size = NR_SECTS(p)*sector_size;
|
size = NR_SECTS(p)*sector_size;
|
next = this_sector + offs;
|
next = this_sector + offs;
|
if (i >= 2) {
|
if (i >= 2) {
|
if (offs + size > this_size)
|
if (offs + size > this_size)
|
continue;
|
continue;
|
if (next < first_sector)
|
if (next < first_sector)
|
continue;
|
continue;
|
if (next + size > first_sector + first_size)
|
if (next + size > first_sector + first_size)
|
continue;
|
continue;
|
}
|
}
|
|
|
put_partition(state, state->next, next, size);
|
put_partition(state, state->next, next, size);
|
if (SYS_IND(p) == LINUX_RAID_PARTITION)
|
if (SYS_IND(p) == LINUX_RAID_PARTITION)
|
state->parts[state->next].flags = ADDPART_FLAG_RAID;
|
state->parts[state->next].flags = ADDPART_FLAG_RAID;
|
loopct = 0;
|
loopct = 0;
|
if (++state->next == state->limit)
|
if (++state->next == state->limit)
|
goto done;
|
goto done;
|
}
|
}
|
/*
|
/*
|
* Next, process the (first) extended partition, if present.
|
* Next, process the (first) extended partition, if present.
|
* (So far, there seems to be no reason to make
|
* (So far, there seems to be no reason to make
|
* parse_extended() recursive and allow a tree
|
* parse_extended() recursive and allow a tree
|
* of extended partitions.)
|
* of extended partitions.)
|
* It should be a link to the next logical partition.
|
* It should be a link to the next logical partition.
|
*/
|
*/
|
p -= 4;
|
p -= 4;
|
for (i=0; i<4; i++, p++)
|
for (i=0; i<4; i++, p++)
|
if (NR_SECTS(p) && is_extended_partition(p))
|
if (NR_SECTS(p) && is_extended_partition(p))
|
break;
|
break;
|
if (i == 4)
|
if (i == 4)
|
goto done; /* nothing left to do */
|
goto done; /* nothing left to do */
|
|
|
this_sector = first_sector + START_SECT(p) * sector_size;
|
this_sector = first_sector + START_SECT(p) * sector_size;
|
this_size = NR_SECTS(p) * sector_size;
|
this_size = NR_SECTS(p) * sector_size;
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
}
|
}
|
done:
|
done:
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
}
|
}
|
|
|
/* james@bpgc.com: Solaris has a nasty indicator: 0x82 which also
|
/* james@bpgc.com: Solaris has a nasty indicator: 0x82 which also
|
indicates linux swap. Be careful before believing this is Solaris. */
|
indicates linux swap. Be careful before believing this is Solaris. */
|
|
|
static void
|
static void
|
parse_solaris_x86(struct parsed_partitions *state, struct block_device *bdev,
|
parse_solaris_x86(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin)
|
u32 offset, u32 size, int origin)
|
{
|
{
|
#ifdef CONFIG_SOLARIS_X86_PARTITION
|
#ifdef CONFIG_SOLARIS_X86_PARTITION
|
Sector sect;
|
Sector sect;
|
struct solaris_x86_vtoc *v;
|
struct solaris_x86_vtoc *v;
|
int i;
|
int i;
|
short max_nparts;
|
short max_nparts;
|
|
|
v = (struct solaris_x86_vtoc *)read_dev_sector(bdev, offset+1, §);
|
v = (struct solaris_x86_vtoc *)read_dev_sector(bdev, offset+1, §);
|
if (!v)
|
if (!v)
|
return;
|
return;
|
if (le32_to_cpu(v->v_sanity) != SOLARIS_X86_VTOC_SANE) {
|
if (le32_to_cpu(v->v_sanity) != SOLARIS_X86_VTOC_SANE) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return;
|
return;
|
}
|
}
|
printk(" %s%d: <solaris:", state->name, origin);
|
printk(" %s%d: <solaris:", state->name, origin);
|
if (le32_to_cpu(v->v_version) != 1) {
|
if (le32_to_cpu(v->v_version) != 1) {
|
printk(" cannot handle version %d vtoc>\n",
|
printk(" cannot handle version %d vtoc>\n",
|
le32_to_cpu(v->v_version));
|
le32_to_cpu(v->v_version));
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return;
|
return;
|
}
|
}
|
/* Ensure we can handle previous case of VTOC with 8 entries gracefully */
|
/* Ensure we can handle previous case of VTOC with 8 entries gracefully */
|
max_nparts = le16_to_cpu (v->v_nparts) > 8 ? SOLARIS_X86_NUMSLICE : 8;
|
max_nparts = le16_to_cpu (v->v_nparts) > 8 ? SOLARIS_X86_NUMSLICE : 8;
|
for (i=0; i<max_nparts && state->next<state->limit; i++) {
|
for (i=0; i<max_nparts && state->next<state->limit; i++) {
|
struct solaris_x86_slice *s = &v->v_slice[i];
|
struct solaris_x86_slice *s = &v->v_slice[i];
|
if (s->s_size == 0)
|
if (s->s_size == 0)
|
continue;
|
continue;
|
printk(" [s%d]", i);
|
printk(" [s%d]", i);
|
/* solaris partitions are relative to current MS-DOS
|
/* solaris partitions are relative to current MS-DOS
|
* one; must add the offset of the current partition */
|
* one; must add the offset of the current partition */
|
put_partition(state, state->next++,
|
put_partition(state, state->next++,
|
le32_to_cpu(s->s_start)+offset,
|
le32_to_cpu(s->s_start)+offset,
|
le32_to_cpu(s->s_size));
|
le32_to_cpu(s->s_size));
|
}
|
}
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
printk(" >\n");
|
printk(" >\n");
|
#endif
|
#endif
|
}
|
}
|
|
|
#if defined(CONFIG_BSD_DISKLABEL)
|
#if defined(CONFIG_BSD_DISKLABEL)
|
/*
|
/*
|
* Create devices for BSD partitions listed in a disklabel, under a
|
* Create devices for BSD partitions listed in a disklabel, under a
|
* dos-like partition. See parse_extended() for more information.
|
* dos-like partition. See parse_extended() for more information.
|
*/
|
*/
|
static void
|
static void
|
parse_bsd(struct parsed_partitions *state, struct block_device *bdev,
|
parse_bsd(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin, char *flavour,
|
u32 offset, u32 size, int origin, char *flavour,
|
int max_partitions)
|
int max_partitions)
|
{
|
{
|
Sector sect;
|
Sector sect;
|
struct bsd_disklabel *l;
|
struct bsd_disklabel *l;
|
struct bsd_partition *p;
|
struct bsd_partition *p;
|
|
|
l = (struct bsd_disklabel *)read_dev_sector(bdev, offset+1, §);
|
l = (struct bsd_disklabel *)read_dev_sector(bdev, offset+1, §);
|
if (!l)
|
if (!l)
|
return;
|
return;
|
if (le32_to_cpu(l->d_magic) != BSD_DISKMAGIC) {
|
if (le32_to_cpu(l->d_magic) != BSD_DISKMAGIC) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return;
|
return;
|
}
|
}
|
printk(" %s%d: <%s:", state->name, origin, flavour);
|
printk(" %s%d: <%s:", state->name, origin, flavour);
|
|
|
if (le16_to_cpu(l->d_npartitions) < max_partitions)
|
if (le16_to_cpu(l->d_npartitions) < max_partitions)
|
max_partitions = le16_to_cpu(l->d_npartitions);
|
max_partitions = le16_to_cpu(l->d_npartitions);
|
for (p = l->d_partitions; p - l->d_partitions < max_partitions; p++) {
|
for (p = l->d_partitions; p - l->d_partitions < max_partitions; p++) {
|
u32 bsd_start, bsd_size;
|
u32 bsd_start, bsd_size;
|
|
|
if (state->next == state->limit)
|
if (state->next == state->limit)
|
break;
|
break;
|
if (p->p_fstype == BSD_FS_UNUSED)
|
if (p->p_fstype == BSD_FS_UNUSED)
|
continue;
|
continue;
|
bsd_start = le32_to_cpu(p->p_offset);
|
bsd_start = le32_to_cpu(p->p_offset);
|
bsd_size = le32_to_cpu(p->p_size);
|
bsd_size = le32_to_cpu(p->p_size);
|
if (offset == bsd_start && size == bsd_size)
|
if (offset == bsd_start && size == bsd_size)
|
/* full parent partition, we have it already */
|
/* full parent partition, we have it already */
|
continue;
|
continue;
|
if (offset > bsd_start || offset+size < bsd_start+bsd_size) {
|
if (offset > bsd_start || offset+size < bsd_start+bsd_size) {
|
printk("bad subpartition - ignored\n");
|
printk("bad subpartition - ignored\n");
|
continue;
|
continue;
|
}
|
}
|
put_partition(state, state->next++, bsd_start, bsd_size);
|
put_partition(state, state->next++, bsd_start, bsd_size);
|
}
|
}
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
if (le16_to_cpu(l->d_npartitions) > max_partitions)
|
if (le16_to_cpu(l->d_npartitions) > max_partitions)
|
printk(" (ignored %d more)",
|
printk(" (ignored %d more)",
|
le16_to_cpu(l->d_npartitions) - max_partitions);
|
le16_to_cpu(l->d_npartitions) - max_partitions);
|
printk(" >\n");
|
printk(" >\n");
|
}
|
}
|
#endif
|
#endif
|
|
|
static void
|
static void
|
parse_freebsd(struct parsed_partitions *state, struct block_device *bdev,
|
parse_freebsd(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin)
|
u32 offset, u32 size, int origin)
|
{
|
{
|
#ifdef CONFIG_BSD_DISKLABEL
|
#ifdef CONFIG_BSD_DISKLABEL
|
parse_bsd(state, bdev, offset, size, origin,
|
parse_bsd(state, bdev, offset, size, origin,
|
"bsd", BSD_MAXPARTITIONS);
|
"bsd", BSD_MAXPARTITIONS);
|
#endif
|
#endif
|
}
|
}
|
|
|
static void
|
static void
|
parse_netbsd(struct parsed_partitions *state, struct block_device *bdev,
|
parse_netbsd(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin)
|
u32 offset, u32 size, int origin)
|
{
|
{
|
#ifdef CONFIG_BSD_DISKLABEL
|
#ifdef CONFIG_BSD_DISKLABEL
|
parse_bsd(state, bdev, offset, size, origin,
|
parse_bsd(state, bdev, offset, size, origin,
|
"netbsd", BSD_MAXPARTITIONS);
|
"netbsd", BSD_MAXPARTITIONS);
|
#endif
|
#endif
|
}
|
}
|
|
|
static void
|
static void
|
parse_openbsd(struct parsed_partitions *state, struct block_device *bdev,
|
parse_openbsd(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin)
|
u32 offset, u32 size, int origin)
|
{
|
{
|
#ifdef CONFIG_BSD_DISKLABEL
|
#ifdef CONFIG_BSD_DISKLABEL
|
parse_bsd(state, bdev, offset, size, origin,
|
parse_bsd(state, bdev, offset, size, origin,
|
"openbsd", OPENBSD_MAXPARTITIONS);
|
"openbsd", OPENBSD_MAXPARTITIONS);
|
#endif
|
#endif
|
}
|
}
|
|
|
/*
|
/*
|
* Create devices for Unixware partitions listed in a disklabel, under a
|
* Create devices for Unixware partitions listed in a disklabel, under a
|
* dos-like partition. See parse_extended() for more information.
|
* dos-like partition. See parse_extended() for more information.
|
*/
|
*/
|
static void
|
static void
|
parse_unixware(struct parsed_partitions *state, struct block_device *bdev,
|
parse_unixware(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin)
|
u32 offset, u32 size, int origin)
|
{
|
{
|
#ifdef CONFIG_UNIXWARE_DISKLABEL
|
#ifdef CONFIG_UNIXWARE_DISKLABEL
|
Sector sect;
|
Sector sect;
|
struct unixware_disklabel *l;
|
struct unixware_disklabel *l;
|
struct unixware_slice *p;
|
struct unixware_slice *p;
|
|
|
l = (struct unixware_disklabel *)read_dev_sector(bdev, offset+29, §);
|
l = (struct unixware_disklabel *)read_dev_sector(bdev, offset+29, §);
|
if (!l)
|
if (!l)
|
return;
|
return;
|
if (le32_to_cpu(l->d_magic) != UNIXWARE_DISKMAGIC ||
|
if (le32_to_cpu(l->d_magic) != UNIXWARE_DISKMAGIC ||
|
le32_to_cpu(l->vtoc.v_magic) != UNIXWARE_DISKMAGIC2) {
|
le32_to_cpu(l->vtoc.v_magic) != UNIXWARE_DISKMAGIC2) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return;
|
return;
|
}
|
}
|
printk(" %s%d: <unixware:", state->name, origin);
|
printk(" %s%d: <unixware:", state->name, origin);
|
p = &l->vtoc.v_slice[1];
|
p = &l->vtoc.v_slice[1];
|
/* I omit the 0th slice as it is the same as whole disk. */
|
/* I omit the 0th slice as it is the same as whole disk. */
|
while (p - &l->vtoc.v_slice[0] < UNIXWARE_NUMSLICE) {
|
while (p - &l->vtoc.v_slice[0] < UNIXWARE_NUMSLICE) {
|
if (state->next == state->limit)
|
if (state->next == state->limit)
|
break;
|
break;
|
|
|
if (p->s_label != UNIXWARE_FS_UNUSED)
|
if (p->s_label != UNIXWARE_FS_UNUSED)
|
put_partition(state, state->next++,
|
put_partition(state, state->next++,
|
START_SECT(p), NR_SECTS(p));
|
START_SECT(p), NR_SECTS(p));
|
p++;
|
p++;
|
}
|
}
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
printk(" >\n");
|
printk(" >\n");
|
#endif
|
#endif
|
}
|
}
|
|
|
/*
|
/*
|
* Minix 2.0.0/2.0.2 subpartition support.
|
* Minix 2.0.0/2.0.2 subpartition support.
|
* Anand Krishnamurthy <anandk@wiproge.med.ge.com>
|
* Anand Krishnamurthy <anandk@wiproge.med.ge.com>
|
* Rajeev V. Pillai <rajeevvp@yahoo.com>
|
* Rajeev V. Pillai <rajeevvp@yahoo.com>
|
*/
|
*/
|
static void
|
static void
|
parse_minix(struct parsed_partitions *state, struct block_device *bdev,
|
parse_minix(struct parsed_partitions *state, struct block_device *bdev,
|
u32 offset, u32 size, int origin)
|
u32 offset, u32 size, int origin)
|
{
|
{
|
#ifdef CONFIG_MINIX_SUBPARTITION
|
#ifdef CONFIG_MINIX_SUBPARTITION
|
Sector sect;
|
Sector sect;
|
unsigned char *data;
|
unsigned char *data;
|
struct partition *p;
|
struct partition *p;
|
int i;
|
int i;
|
|
|
data = read_dev_sector(bdev, offset, §);
|
data = read_dev_sector(bdev, offset, §);
|
if (!data)
|
if (!data)
|
return;
|
return;
|
|
|
p = (struct partition *)(data + 0x1be);
|
p = (struct partition *)(data + 0x1be);
|
|
|
/* The first sector of a Minix partition can have either
|
/* The first sector of a Minix partition can have either
|
* a secondary MBR describing its subpartitions, or
|
* a secondary MBR describing its subpartitions, or
|
* the normal boot sector. */
|
* the normal boot sector. */
|
if (msdos_magic_present (data + 510) &&
|
if (msdos_magic_present (data + 510) &&
|
SYS_IND(p) == MINIX_PARTITION) { /* subpartition table present */
|
SYS_IND(p) == MINIX_PARTITION) { /* subpartition table present */
|
|
|
printk(" %s%d: <minix:", state->name, origin);
|
printk(" %s%d: <minix:", state->name, origin);
|
for (i = 0; i < MINIX_NR_SUBPARTITIONS; i++, p++) {
|
for (i = 0; i < MINIX_NR_SUBPARTITIONS; i++, p++) {
|
if (state->next == state->limit)
|
if (state->next == state->limit)
|
break;
|
break;
|
/* add each partition in use */
|
/* add each partition in use */
|
if (SYS_IND(p) == MINIX_PARTITION)
|
if (SYS_IND(p) == MINIX_PARTITION)
|
put_partition(state, state->next++,
|
put_partition(state, state->next++,
|
START_SECT(p), NR_SECTS(p));
|
START_SECT(p), NR_SECTS(p));
|
}
|
}
|
printk(" >\n");
|
printk(" >\n");
|
}
|
}
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
#endif /* CONFIG_MINIX_SUBPARTITION */
|
#endif /* CONFIG_MINIX_SUBPARTITION */
|
}
|
}
|
|
|
static struct {
|
static struct {
|
unsigned char id;
|
unsigned char id;
|
void (*parse)(struct parsed_partitions *, struct block_device *,
|
void (*parse)(struct parsed_partitions *, struct block_device *,
|
u32, u32, int);
|
u32, u32, int);
|
} subtypes[] = {
|
} subtypes[] = {
|
{FREEBSD_PARTITION, parse_freebsd},
|
{FREEBSD_PARTITION, parse_freebsd},
|
{NETBSD_PARTITION, parse_netbsd},
|
{NETBSD_PARTITION, parse_netbsd},
|
{OPENBSD_PARTITION, parse_openbsd},
|
{OPENBSD_PARTITION, parse_openbsd},
|
{MINIX_PARTITION, parse_minix},
|
{MINIX_PARTITION, parse_minix},
|
{UNIXWARE_PARTITION, parse_unixware},
|
{UNIXWARE_PARTITION, parse_unixware},
|
{SOLARIS_X86_PARTITION, parse_solaris_x86},
|
{SOLARIS_X86_PARTITION, parse_solaris_x86},
|
{NEW_SOLARIS_X86_PARTITION, parse_solaris_x86},
|
{NEW_SOLARIS_X86_PARTITION, parse_solaris_x86},
|
{0, NULL},
|
{0, NULL},
|
};
|
};
|
|
|
int msdos_partition(struct parsed_partitions *state, struct block_device *bdev)
|
int msdos_partition(struct parsed_partitions *state, struct block_device *bdev)
|
{
|
{
|
int sector_size = bdev_hardsect_size(bdev) / 512;
|
int sector_size = bdev_hardsect_size(bdev) / 512;
|
Sector sect;
|
Sector sect;
|
unsigned char *data;
|
unsigned char *data;
|
struct partition *p;
|
struct partition *p;
|
int slot;
|
int slot;
|
|
|
data = read_dev_sector(bdev, 0, §);
|
data = read_dev_sector(bdev, 0, §);
|
if (!data)
|
if (!data)
|
return -1;
|
return -1;
|
if (!msdos_magic_present(data + 510)) {
|
if (!msdos_magic_present(data + 510)) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return 0;
|
return 0;
|
}
|
}
|
|
|
if (aix_magic_present(data, bdev)) {
|
if (aix_magic_present(data, bdev)) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
printk( " [AIX]");
|
printk( " [AIX]");
|
return 0;
|
return 0;
|
}
|
}
|
|
|
/*
|
/*
|
* Now that the 55aa signature is present, this is probably
|
* Now that the 55aa signature is present, this is probably
|
* either the boot sector of a FAT filesystem or a DOS-type
|
* either the boot sector of a FAT filesystem or a DOS-type
|
* partition table. Reject this in case the boot indicator
|
* partition table. Reject this in case the boot indicator
|
* is not 0 or 0x80.
|
* is not 0 or 0x80.
|
*/
|
*/
|
p = (struct partition *) (data + 0x1be);
|
p = (struct partition *) (data + 0x1be);
|
for (slot = 1; slot <= 4; slot++, p++) {
|
for (slot = 1; slot <= 4; slot++, p++) {
|
if (p->boot_ind != 0 && p->boot_ind != 0x80) {
|
if (p->boot_ind != 0 && p->boot_ind != 0x80) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
|
|
#ifdef CONFIG_EFI_PARTITION
|
#ifdef CONFIG_EFI_PARTITION
|
p = (struct partition *) (data + 0x1be);
|
p = (struct partition *) (data + 0x1be);
|
for (slot = 1 ; slot <= 4 ; slot++, p++) {
|
for (slot = 1 ; slot <= 4 ; slot++, p++) {
|
/* If this is an EFI GPT disk, msdos should ignore it. */
|
/* If this is an EFI GPT disk, msdos should ignore it. */
|
if (SYS_IND(p) == EFI_PMBR_OSTYPE_EFI_GPT) {
|
if (SYS_IND(p) == EFI_PMBR_OSTYPE_EFI_GPT) {
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return 0;
|
return 0;
|
}
|
}
|
}
|
}
|
#endif
|
#endif
|
p = (struct partition *) (data + 0x1be);
|
p = (struct partition *) (data + 0x1be);
|
|
|
/*
|
/*
|
* Look for partitions in two passes:
|
* Look for partitions in two passes:
|
* First find the primary and DOS-type extended partitions.
|
* First find the primary and DOS-type extended partitions.
|
* On the second pass look inside *BSD, Unixware and Solaris partitions.
|
* On the second pass look inside *BSD, Unixware and Solaris partitions.
|
*/
|
*/
|
|
|
state->next = 5;
|
state->next = 5;
|
for (slot = 1 ; slot <= 4 ; slot++, p++) {
|
for (slot = 1 ; slot <= 4 ; slot++, p++) {
|
u32 start = START_SECT(p)*sector_size;
|
u32 start = START_SECT(p)*sector_size;
|
u32 size = NR_SECTS(p)*sector_size;
|
u32 size = NR_SECTS(p)*sector_size;
|
if (!size)
|
if (!size)
|
continue;
|
continue;
|
if (is_extended_partition(p)) {
|
if (is_extended_partition(p)) {
|
/* prevent someone doing mkfs or mkswap on an
|
/* prevent someone doing mkfs or mkswap on an
|
extended partition, but leave room for LILO */
|
extended partition, but leave room for LILO */
|
put_partition(state, slot, start, size == 1 ? 1 : 2);
|
put_partition(state, slot, start, size == 1 ? 1 : 2);
|
printk(" <");
|
printk(" <");
|
parse_extended(state, bdev, start, size);
|
parse_extended(state, bdev, start, size);
|
printk(" >");
|
printk(" >");
|
continue;
|
continue;
|
}
|
}
|
put_partition(state, slot, start, size);
|
put_partition(state, slot, start, size);
|
if (SYS_IND(p) == LINUX_RAID_PARTITION)
|
if (SYS_IND(p) == LINUX_RAID_PARTITION)
|
state->parts[slot].flags = 1;
|
state->parts[slot].flags = 1;
|
if (SYS_IND(p) == DM6_PARTITION)
|
if (SYS_IND(p) == DM6_PARTITION)
|
printk("[DM]");
|
printk("[DM]");
|
if (SYS_IND(p) == EZD_PARTITION)
|
if (SYS_IND(p) == EZD_PARTITION)
|
printk("[EZD]");
|
printk("[EZD]");
|
}
|
}
|
|
|
printk("\n");
|
printk("\n");
|
|
|
/* second pass - output for each on a separate line */
|
/* second pass - output for each on a separate line */
|
#if 0
|
|
p = (struct partition *) (0x1be + data);
|
p = (struct partition *) (0x1be + data);
|
for (slot = 1 ; slot <= 4 ; slot++, p++) {
|
for (slot = 1 ; slot <= 4 ; slot++, p++) {
|
unsigned char id = SYS_IND(p);
|
unsigned char id = SYS_IND(p);
|
int n;
|
int n;
|
|
|
if (!NR_SECTS(p))
|
if (!NR_SECTS(p))
|
continue;
|
continue;
|
|
|
for (n = 0; subtypes[n].parse && id != subtypes[n].id; n++)
|
for (n = 0; subtypes[n].parse && id != subtypes[n].id; n++)
|
;
|
;
|
|
|
if (!subtypes[n].parse)
|
if (!subtypes[n].parse)
|
continue;
|
continue;
|
subtypes[n].parse(state, bdev, START_SECT(p)*sector_size,
|
subtypes[n].parse(state, bdev, START_SECT(p)*sector_size,
|
NR_SECTS(p)*sector_size, slot);
|
NR_SECTS(p)*sector_size, slot);
|
}
|
}
|
#endif
|
|
put_dev_sector(sect);
|
put_dev_sector(sect);
|
return 1;
|
return 1;
|
}
|
}
|
|
|
