msdos.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583
  1. /*
  2. * fs/partitions/msdos.c
  3. *
  4. * Code extracted from drivers/block/genhd.c
  5. * Copyright (C) 1991-1998 Linus Torvalds
  6. *
  7. * Thanks to Branko Lankester, lankeste@fwi.uva.nl, who found a bug
  8. * in the early extended-partition checks and added DM partitions
  9. *
  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).
  14. *
  15. * More flexible handling of extended partitions - aeb, 950831
  16. *
  17. * Check partition table on IDE disks for common CHS translations
  18. *
  19. * Re-organised Feb 1998 Russell King
  20. */
  21. #include <linux/msdos_fs.h>
  22. #include "check.h"
  23. #include "msdos.h"
  24. #include "efi.h"
  25. #include "aix.h"
  26. /*
  27. * Many architectures don't like unaligned accesses, while
  28. * the nr_sects and start_sect partition table entries are
  29. * at a 2 (mod 4) address.
  30. */
  31. #include <asm/unaligned.h>
  32. #define SYS_IND(p) get_unaligned(&p->sys_ind)
  33. static inline sector_t nr_sects(struct partition *p)
  34. {
  35. return (sector_t)get_unaligned_le32(&p->nr_sects);
  36. }
  37. static inline sector_t start_sect(struct partition *p)
  38. {
  39. return (sector_t)get_unaligned_le32(&p->start_sect);
  40. }
  41. static inline int is_extended_partition(struct partition *p)
  42. {
  43. return (SYS_IND(p) == DOS_EXTENDED_PARTITION ||
  44. SYS_IND(p) == WIN98_EXTENDED_PARTITION ||
  45. SYS_IND(p) == LINUX_EXTENDED_PARTITION);
  46. }
  47. #define MSDOS_LABEL_MAGIC1 0x55
  48. #define MSDOS_LABEL_MAGIC2 0xAA
  49. static inline int
  50. msdos_magic_present(unsigned char *p)
  51. {
  52. return (p[0] == MSDOS_LABEL_MAGIC1 && p[1] == MSDOS_LABEL_MAGIC2);
  53. }
  54. /* Value is EBCDIC 'IBMA' */
  55. #define AIX_LABEL_MAGIC1 0xC9
  56. #define AIX_LABEL_MAGIC2 0xC2
  57. #define AIX_LABEL_MAGIC3 0xD4
  58. #define AIX_LABEL_MAGIC4 0xC1
  59. static int aix_magic_present(struct parsed_partitions *state, unsigned char *p)
  60. {
  61. struct partition *pt = (struct partition *) (p + 0x1be);
  62. Sector sect;
  63. unsigned char *d;
  64. int slot, ret = 0;
  65. if (!(p[0] == AIX_LABEL_MAGIC1 &&
  66. p[1] == AIX_LABEL_MAGIC2 &&
  67. p[2] == AIX_LABEL_MAGIC3 &&
  68. p[3] == AIX_LABEL_MAGIC4))
  69. return 0;
  70. /* Assume the partition table is valid if Linux partitions exists */
  71. for (slot = 1; slot <= 4; slot++, pt++) {
  72. if (pt->sys_ind == LINUX_SWAP_PARTITION ||
  73. pt->sys_ind == LINUX_RAID_PARTITION ||
  74. pt->sys_ind == LINUX_DATA_PARTITION ||
  75. pt->sys_ind == LINUX_LVM_PARTITION ||
  76. is_extended_partition(pt))
  77. return 0;
  78. }
  79. d = read_part_sector(state, 7, &sect);
  80. if (d) {
  81. if (d[0] == '_' && d[1] == 'L' && d[2] == 'V' && d[3] == 'M')
  82. ret = 1;
  83. put_dev_sector(sect);
  84. }
  85. return ret;
  86. }
  87. static void set_info(struct parsed_partitions *state, int slot,
  88. u32 disksig)
  89. {
  90. struct partition_meta_info *info = &state->parts[slot].info;
  91. snprintf(info->uuid, sizeof(info->uuid), "%08x-%02x", disksig,
  92. slot);
  93. info->volname[0] = 0;
  94. state->parts[slot].has_info = true;
  95. }
  96. /*
  97. * Create devices for each logical partition in an extended partition.
  98. * The logical partitions form a linked list, with each entry being
  99. * a partition table with two entries. The first entry
  100. * is the real data partition (with a start relative to the partition
  101. * table start). The second is a pointer to the next logical partition
  102. * (with a start relative to the entire extended partition).
  103. * We do not create a Linux partition for the partition tables, but
  104. * only for the actual data partitions.
  105. */
  106. static void parse_extended(struct parsed_partitions *state,
  107. sector_t first_sector, sector_t first_size,
  108. u32 disksig)
  109. {
  110. struct partition *p;
  111. Sector sect;
  112. unsigned char *data;
  113. sector_t this_sector, this_size;
  114. sector_t sector_size = bdev_logical_block_size(state->bdev) / 512;
  115. int loopct = 0; /* number of links followed
  116. without finding a data partition */
  117. int i;
  118. this_sector = first_sector;
  119. this_size = first_size;
  120. while (1) {
  121. if (++loopct > 100)
  122. return;
  123. if (state->next == state->limit)
  124. return;
  125. data = read_part_sector(state, this_sector, &sect);
  126. if (!data)
  127. return;
  128. if (!msdos_magic_present(data + 510))
  129. goto done;
  130. p = (struct partition *) (data + 0x1be);
  131. /*
  132. * Usually, the first entry is the real data partition,
  133. * the 2nd entry is the next extended partition, or empty,
  134. * and the 3rd and 4th entries are unused.
  135. * However, DRDOS sometimes has the extended partition as
  136. * the first entry (when the data partition is empty),
  137. * and OS/2 seems to use all four entries.
  138. */
  139. /*
  140. * First process the data partition(s)
  141. */
  142. for (i = 0; i < 4; i++, p++) {
  143. sector_t offs, size, next;
  144. if (!nr_sects(p) || is_extended_partition(p))
  145. continue;
  146. /* Check the 3rd and 4th entries -
  147. these sometimes contain random garbage */
  148. offs = start_sect(p)*sector_size;
  149. size = nr_sects(p)*sector_size;
  150. next = this_sector + offs;
  151. if (i >= 2) {
  152. if (offs + size > this_size)
  153. continue;
  154. if (next < first_sector)
  155. continue;
  156. if (next + size > first_sector + first_size)
  157. continue;
  158. }
  159. put_partition(state, state->next, next, size);
  160. set_info(state, state->next, disksig);
  161. if (SYS_IND(p) == LINUX_RAID_PARTITION)
  162. state->parts[state->next].flags = ADDPART_FLAG_RAID;
  163. loopct = 0;
  164. if (++state->next == state->limit)
  165. goto done;
  166. }
  167. /*
  168. * Next, process the (first) extended partition, if present.
  169. * (So far, there seems to be no reason to make
  170. * parse_extended() recursive and allow a tree
  171. * of extended partitions.)
  172. * It should be a link to the next logical partition.
  173. */
  174. p -= 4;
  175. for (i = 0; i < 4; i++, p++)
  176. if (nr_sects(p) && is_extended_partition(p))
  177. break;
  178. if (i == 4)
  179. goto done; /* nothing left to do */
  180. this_sector = first_sector + start_sect(p) * sector_size;
  181. this_size = nr_sects(p) * sector_size;
  182. put_dev_sector(sect);
  183. }
  184. done:
  185. put_dev_sector(sect);
  186. }
  187. /* james@bpgc.com: Solaris has a nasty indicator: 0x82 which also
  188. indicates linux swap. Be careful before believing this is Solaris. */
  189. static void parse_solaris_x86(struct parsed_partitions *state,
  190. sector_t offset, sector_t size, int origin)
  191. {
  192. #ifdef CONFIG_SOLARIS_X86_PARTITION
  193. Sector sect;
  194. struct solaris_x86_vtoc *v;
  195. int i;
  196. short max_nparts;
  197. v = read_part_sector(state, offset + 1, &sect);
  198. if (!v)
  199. return;
  200. if (le32_to_cpu(v->v_sanity) != SOLARIS_X86_VTOC_SANE) {
  201. put_dev_sector(sect);
  202. return;
  203. }
  204. {
  205. char tmp[1 + BDEVNAME_SIZE + 10 + 11 + 1];
  206. snprintf(tmp, sizeof(tmp), " %s%d: <solaris:", state->name, origin);
  207. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  208. }
  209. if (le32_to_cpu(v->v_version) != 1) {
  210. char tmp[64];
  211. snprintf(tmp, sizeof(tmp), " cannot handle version %d vtoc>\n",
  212. le32_to_cpu(v->v_version));
  213. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  214. put_dev_sector(sect);
  215. return;
  216. }
  217. /* Ensure we can handle previous case of VTOC with 8 entries gracefully */
  218. max_nparts = le16_to_cpu(v->v_nparts) > 8 ? SOLARIS_X86_NUMSLICE : 8;
  219. for (i = 0; i < max_nparts && state->next < state->limit; i++) {
  220. struct solaris_x86_slice *s = &v->v_slice[i];
  221. char tmp[3 + 10 + 1 + 1];
  222. if (s->s_size == 0)
  223. continue;
  224. snprintf(tmp, sizeof(tmp), " [s%d]", i);
  225. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  226. /* solaris partitions are relative to current MS-DOS
  227. * one; must add the offset of the current partition */
  228. put_partition(state, state->next++,
  229. le32_to_cpu(s->s_start)+offset,
  230. le32_to_cpu(s->s_size));
  231. }
  232. put_dev_sector(sect);
  233. strlcat(state->pp_buf, " >\n", PAGE_SIZE);
  234. #endif
  235. }
  236. #if defined(CONFIG_BSD_DISKLABEL)
  237. /*
  238. * Create devices for BSD partitions listed in a disklabel, under a
  239. * dos-like partition. See parse_extended() for more information.
  240. */
  241. static void parse_bsd(struct parsed_partitions *state,
  242. sector_t offset, sector_t size, int origin, char *flavour,
  243. int max_partitions)
  244. {
  245. Sector sect;
  246. struct bsd_disklabel *l;
  247. struct bsd_partition *p;
  248. char tmp[64];
  249. l = read_part_sector(state, offset + 1, &sect);
  250. if (!l)
  251. return;
  252. if (le32_to_cpu(l->d_magic) != BSD_DISKMAGIC) {
  253. put_dev_sector(sect);
  254. return;
  255. }
  256. snprintf(tmp, sizeof(tmp), " %s%d: <%s:", state->name, origin, flavour);
  257. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  258. if (le16_to_cpu(l->d_npartitions) < max_partitions)
  259. max_partitions = le16_to_cpu(l->d_npartitions);
  260. for (p = l->d_partitions; p - l->d_partitions < max_partitions; p++) {
  261. sector_t bsd_start, bsd_size;
  262. if (state->next == state->limit)
  263. break;
  264. if (p->p_fstype == BSD_FS_UNUSED)
  265. continue;
  266. bsd_start = le32_to_cpu(p->p_offset);
  267. bsd_size = le32_to_cpu(p->p_size);
  268. if (offset == bsd_start && size == bsd_size)
  269. /* full parent partition, we have it already */
  270. continue;
  271. if (offset > bsd_start || offset+size < bsd_start+bsd_size) {
  272. strlcat(state->pp_buf, "bad subpartition - ignored\n", PAGE_SIZE);
  273. continue;
  274. }
  275. put_partition(state, state->next++, bsd_start, bsd_size);
  276. }
  277. put_dev_sector(sect);
  278. if (le16_to_cpu(l->d_npartitions) > max_partitions) {
  279. snprintf(tmp, sizeof(tmp), " (ignored %d more)",
  280. le16_to_cpu(l->d_npartitions) - max_partitions);
  281. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  282. }
  283. strlcat(state->pp_buf, " >\n", PAGE_SIZE);
  284. }
  285. #endif
  286. static void parse_freebsd(struct parsed_partitions *state,
  287. sector_t offset, sector_t size, int origin)
  288. {
  289. #ifdef CONFIG_BSD_DISKLABEL
  290. parse_bsd(state, offset, size, origin, "bsd", BSD_MAXPARTITIONS);
  291. #endif
  292. }
  293. static void parse_netbsd(struct parsed_partitions *state,
  294. sector_t offset, sector_t size, int origin)
  295. {
  296. #ifdef CONFIG_BSD_DISKLABEL
  297. parse_bsd(state, offset, size, origin, "netbsd", BSD_MAXPARTITIONS);
  298. #endif
  299. }
  300. static void parse_openbsd(struct parsed_partitions *state,
  301. sector_t offset, sector_t size, int origin)
  302. {
  303. #ifdef CONFIG_BSD_DISKLABEL
  304. parse_bsd(state, offset, size, origin, "openbsd",
  305. OPENBSD_MAXPARTITIONS);
  306. #endif
  307. }
  308. /*
  309. * Create devices for Unixware partitions listed in a disklabel, under a
  310. * dos-like partition. See parse_extended() for more information.
  311. */
  312. static void parse_unixware(struct parsed_partitions *state,
  313. sector_t offset, sector_t size, int origin)
  314. {
  315. #ifdef CONFIG_UNIXWARE_DISKLABEL
  316. Sector sect;
  317. struct unixware_disklabel *l;
  318. struct unixware_slice *p;
  319. l = read_part_sector(state, offset + 29, &sect);
  320. if (!l)
  321. return;
  322. if (le32_to_cpu(l->d_magic) != UNIXWARE_DISKMAGIC ||
  323. le32_to_cpu(l->vtoc.v_magic) != UNIXWARE_DISKMAGIC2) {
  324. put_dev_sector(sect);
  325. return;
  326. }
  327. {
  328. char tmp[1 + BDEVNAME_SIZE + 10 + 12 + 1];
  329. snprintf(tmp, sizeof(tmp), " %s%d: <unixware:", state->name, origin);
  330. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  331. }
  332. p = &l->vtoc.v_slice[1];
  333. /* I omit the 0th slice as it is the same as whole disk. */
  334. while (p - &l->vtoc.v_slice[0] < UNIXWARE_NUMSLICE) {
  335. if (state->next == state->limit)
  336. break;
  337. if (p->s_label != UNIXWARE_FS_UNUSED)
  338. put_partition(state, state->next++,
  339. le32_to_cpu(p->start_sect),
  340. le32_to_cpu(p->nr_sects));
  341. p++;
  342. }
  343. put_dev_sector(sect);
  344. strlcat(state->pp_buf, " >\n", PAGE_SIZE);
  345. #endif
  346. }
  347. /*
  348. * Minix 2.0.0/2.0.2 subpartition support.
  349. * Anand Krishnamurthy <anandk@wiproge.med.ge.com>
  350. * Rajeev V. Pillai <rajeevvp@yahoo.com>
  351. */
  352. static void parse_minix(struct parsed_partitions *state,
  353. sector_t offset, sector_t size, int origin)
  354. {
  355. #ifdef CONFIG_MINIX_SUBPARTITION
  356. Sector sect;
  357. unsigned char *data;
  358. struct partition *p;
  359. int i;
  360. data = read_part_sector(state, offset, &sect);
  361. if (!data)
  362. return;
  363. p = (struct partition *)(data + 0x1be);
  364. /* The first sector of a Minix partition can have either
  365. * a secondary MBR describing its subpartitions, or
  366. * the normal boot sector. */
  367. if (msdos_magic_present(data + 510) &&
  368. SYS_IND(p) == MINIX_PARTITION) { /* subpartition table present */
  369. char tmp[1 + BDEVNAME_SIZE + 10 + 9 + 1];
  370. snprintf(tmp, sizeof(tmp), " %s%d: <minix:", state->name, origin);
  371. strlcat(state->pp_buf, tmp, PAGE_SIZE);
  372. for (i = 0; i < MINIX_NR_SUBPARTITIONS; i++, p++) {
  373. if (state->next == state->limit)
  374. break;
  375. /* add each partition in use */
  376. if (SYS_IND(p) == MINIX_PARTITION)
  377. put_partition(state, state->next++,
  378. start_sect(p), nr_sects(p));
  379. }
  380. strlcat(state->pp_buf, " >\n", PAGE_SIZE);
  381. }
  382. put_dev_sector(sect);
  383. #endif /* CONFIG_MINIX_SUBPARTITION */
  384. }
  385. static struct {
  386. unsigned char id;
  387. void (*parse)(struct parsed_partitions *, sector_t, sector_t, int);
  388. } subtypes[] = {
  389. {FREEBSD_PARTITION, parse_freebsd},
  390. {NETBSD_PARTITION, parse_netbsd},
  391. {OPENBSD_PARTITION, parse_openbsd},
  392. {MINIX_PARTITION, parse_minix},
  393. {UNIXWARE_PARTITION, parse_unixware},
  394. {SOLARIS_X86_PARTITION, parse_solaris_x86},
  395. {NEW_SOLARIS_X86_PARTITION, parse_solaris_x86},
  396. {0, NULL},
  397. };
  398. int msdos_partition(struct parsed_partitions *state)
  399. {
  400. sector_t sector_size = bdev_logical_block_size(state->bdev) / 512;
  401. Sector sect;
  402. unsigned char *data;
  403. struct partition *p;
  404. struct fat_boot_sector *fb;
  405. int slot;
  406. u32 disksig;
  407. data = read_part_sector(state, 0, &sect);
  408. if (!data)
  409. return -1;
  410. /*
  411. * Note order! (some AIX disks, e.g. unbootable kind,
  412. * have no MSDOS 55aa)
  413. */
  414. if (aix_magic_present(state, data)) {
  415. put_dev_sector(sect);
  416. #ifdef CONFIG_AIX_PARTITION
  417. return aix_partition(state);
  418. #else
  419. strlcat(state->pp_buf, " [AIX]", PAGE_SIZE);
  420. return 0;
  421. #endif
  422. }
  423. if (!msdos_magic_present(data + 510)) {
  424. put_dev_sector(sect);
  425. return 0;
  426. }
  427. /*
  428. * Now that the 55aa signature is present, this is probably
  429. * either the boot sector of a FAT filesystem or a DOS-type
  430. * partition table. Reject this in case the boot indicator
  431. * is not 0 or 0x80.
  432. */
  433. p = (struct partition *) (data + 0x1be);
  434. for (slot = 1; slot <= 4; slot++, p++) {
  435. if (p->boot_ind != 0 && p->boot_ind != 0x80) {
  436. /*
  437. * Even without a valid boot inidicator value
  438. * its still possible this is valid FAT filesystem
  439. * without a partition table.
  440. */
  441. fb = (struct fat_boot_sector *) data;
  442. if (slot == 1 && fb->reserved && fb->fats
  443. && fat_valid_media(fb->media)) {
  444. strlcat(state->pp_buf, "\n", PAGE_SIZE);
  445. put_dev_sector(sect);
  446. return 1;
  447. } else {
  448. put_dev_sector(sect);
  449. return 0;
  450. }
  451. }
  452. }
  453. #ifdef CONFIG_EFI_PARTITION
  454. p = (struct partition *) (data + 0x1be);
  455. for (slot = 1 ; slot <= 4 ; slot++, p++) {
  456. /* If this is an EFI GPT disk, msdos should ignore it. */
  457. if (SYS_IND(p) == EFI_PMBR_OSTYPE_EFI_GPT) {
  458. put_dev_sector(sect);
  459. return 0;
  460. }
  461. }
  462. #endif
  463. p = (struct partition *) (data + 0x1be);
  464. disksig = le32_to_cpup((__le32 *)(data + 0x1b8));
  465. /*
  466. * Look for partitions in two passes:
  467. * First find the primary and DOS-type extended partitions.
  468. * On the second pass look inside *BSD, Unixware and Solaris partitions.
  469. */
  470. state->next = 5;
  471. for (slot = 1 ; slot <= 4 ; slot++, p++) {
  472. sector_t start = start_sect(p)*sector_size;
  473. sector_t size = nr_sects(p)*sector_size;
  474. if (!size)
  475. continue;
  476. if (is_extended_partition(p)) {
  477. /*
  478. * prevent someone doing mkfs or mkswap on an
  479. * extended partition, but leave room for LILO
  480. * FIXME: this uses one logical sector for > 512b
  481. * sector, although it may not be enough/proper.
  482. */
  483. sector_t n = 2;
  484. n = min(size, max(sector_size, n));
  485. put_partition(state, slot, start, n);
  486. strlcat(state->pp_buf, " <", PAGE_SIZE);
  487. parse_extended(state, start, size, disksig);
  488. strlcat(state->pp_buf, " >", PAGE_SIZE);
  489. continue;
  490. }
  491. put_partition(state, slot, start, size);
  492. set_info(state, slot, disksig);
  493. if (SYS_IND(p) == LINUX_RAID_PARTITION)
  494. state->parts[slot].flags = ADDPART_FLAG_RAID;
  495. if (SYS_IND(p) == DM6_PARTITION)
  496. strlcat(state->pp_buf, "[DM]", PAGE_SIZE);
  497. if (SYS_IND(p) == EZD_PARTITION)
  498. strlcat(state->pp_buf, "[EZD]", PAGE_SIZE);
  499. }
  500. strlcat(state->pp_buf, "\n", PAGE_SIZE);
  501. /* second pass - output for each on a separate line */
  502. p = (struct partition *) (0x1be + data);
  503. for (slot = 1 ; slot <= 4 ; slot++, p++) {
  504. unsigned char id = SYS_IND(p);
  505. int n;
  506. if (!nr_sects(p))
  507. continue;
  508. for (n = 0; subtypes[n].parse && id != subtypes[n].id; n++)
  509. ;
  510. if (!subtypes[n].parse)
  511. continue;
  512. subtypes[n].parse(state, start_sect(p) * sector_size,
  513. nr_sects(p) * sector_size, slot);
  514. }
  515. put_dev_sector(sect);
  516. return 1;
  517. }