msdos.c 15 KB

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