part_efi.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474
  1. /*
  2. * Copyright (C) 2008 RuggedCom, Inc.
  3. * Richard Retanubun <RichardRetanubun@RuggedCom.com>
  4. *
  5. * See file CREDITS for list of people who contributed to this
  6. * project.
  7. *
  8. * This program is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public License as
  10. * published by the Free Software Foundation; either version 2 of
  11. * the License, or (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software
  20. * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
  21. * MA 02111-1307 USA
  22. */
  23. /*
  24. * Problems with CONFIG_SYS_64BIT_LBA:
  25. *
  26. * struct disk_partition.start in include/part.h is sized as ulong.
  27. * When CONFIG_SYS_64BIT_LBA is activated, lbaint_t changes from ulong to uint64_t.
  28. * For now, it is cast back to ulong at assignment.
  29. *
  30. * This limits the maximum size of addressable storage to < 2 Terra Bytes
  31. */
  32. #include <common.h>
  33. #include <command.h>
  34. #include <ide.h>
  35. #include <malloc.h>
  36. #include "part_efi.h"
  37. #include <linux/ctype.h>
  38. #if defined(CONFIG_CMD_IDE) || \
  39. defined(CONFIG_CMD_SATA) || \
  40. defined(CONFIG_CMD_SCSI) || \
  41. defined(CONFIG_CMD_USB) || \
  42. defined(CONFIG_MMC) || \
  43. defined(CONFIG_SYSTEMACE)
  44. /* Convert char[2] in little endian format to the host format integer
  45. */
  46. static inline unsigned short le16_to_int(unsigned char *le16)
  47. {
  48. return ((le16[1] << 8) + le16[0]);
  49. }
  50. /* Convert char[4] in little endian format to the host format integer
  51. */
  52. static inline unsigned long le32_to_int(unsigned char *le32)
  53. {
  54. return ((le32[3] << 24) + (le32[2] << 16) + (le32[1] << 8) + le32[0]);
  55. }
  56. /* Convert char[8] in little endian format to the host format integer
  57. */
  58. static inline unsigned long long le64_to_int(unsigned char *le64)
  59. {
  60. return (((unsigned long long)le64[7] << 56) +
  61. ((unsigned long long)le64[6] << 48) +
  62. ((unsigned long long)le64[5] << 40) +
  63. ((unsigned long long)le64[4] << 32) +
  64. ((unsigned long long)le64[3] << 24) +
  65. ((unsigned long long)le64[2] << 16) +
  66. ((unsigned long long)le64[1] << 8) +
  67. (unsigned long long)le64[0]);
  68. }
  69. /**
  70. * efi_crc32() - EFI version of crc32 function
  71. * @buf: buffer to calculate crc32 of
  72. * @len - length of buf
  73. *
  74. * Description: Returns EFI-style CRC32 value for @buf
  75. */
  76. static inline unsigned long efi_crc32(const void *buf, unsigned long len)
  77. {
  78. return crc32(0, buf, len);
  79. }
  80. /*
  81. * Private function prototypes
  82. */
  83. static int pmbr_part_valid(struct partition *part);
  84. static int is_pmbr_valid(legacy_mbr * mbr);
  85. static int is_gpt_valid(block_dev_desc_t * dev_desc, unsigned long long lba,
  86. gpt_header * pgpt_head, gpt_entry ** pgpt_pte);
  87. static gpt_entry *alloc_read_gpt_entries(block_dev_desc_t * dev_desc,
  88. gpt_header * pgpt_head);
  89. static int is_pte_valid(gpt_entry * pte);
  90. static char *print_efiname(gpt_entry *pte)
  91. {
  92. static char name[PARTNAME_SZ + 1];
  93. int i;
  94. for (i = 0; i < PARTNAME_SZ; i++) {
  95. u8 c;
  96. c = pte->partition_name[i] & 0xff;
  97. c = (c && !isprint(c)) ? '.' : c;
  98. name[i] = c;
  99. }
  100. name[PARTNAME_SZ] = 0;
  101. return name;
  102. }
  103. static void uuid_string(unsigned char *uuid, char *str)
  104. {
  105. static const u8 le[16] = {3, 2, 1, 0, 5, 4, 7, 6, 8, 9, 10, 11,
  106. 12, 13, 14, 15};
  107. int i;
  108. for (i = 0; i < 16; i++) {
  109. sprintf(str, "%02x", uuid[le[i]]);
  110. str += 2;
  111. switch (i) {
  112. case 3:
  113. case 5:
  114. case 7:
  115. case 9:
  116. *str++ = '-';
  117. break;
  118. }
  119. }
  120. }
  121. /*
  122. * Public Functions (include/part.h)
  123. */
  124. void print_part_efi(block_dev_desc_t * dev_desc)
  125. {
  126. ALLOC_CACHE_ALIGN_BUFFER(gpt_header, gpt_head, 1);
  127. gpt_entry *gpt_pte = NULL;
  128. int i = 0;
  129. char uuid[37];
  130. if (!dev_desc) {
  131. printf("%s: Invalid Argument(s)\n", __func__);
  132. return;
  133. }
  134. /* This function validates AND fills in the GPT header and PTE */
  135. if (is_gpt_valid(dev_desc, GPT_PRIMARY_PARTITION_TABLE_LBA,
  136. gpt_head, &gpt_pte) != 1) {
  137. printf("%s: *** ERROR: Invalid GPT ***\n", __func__);
  138. return;
  139. }
  140. debug("%s: gpt-entry at %p\n", __func__, gpt_pte);
  141. printf("Part\tStart LBA\tEnd LBA\t\tName\n");
  142. printf("\tAttributes\n");
  143. printf("\tType UUID\n");
  144. printf("\tPartition UUID\n");
  145. for (i = 0; i < le32_to_int(gpt_head->num_partition_entries); i++) {
  146. /* Stop at the first non valid PTE */
  147. if (!is_pte_valid(&gpt_pte[i]))
  148. break;
  149. printf("%3d\t0x%08llx\t0x%08llx\t\"%s\"\n", (i + 1),
  150. le64_to_int(gpt_pte[i].starting_lba),
  151. le64_to_int(gpt_pte[i].ending_lba),
  152. print_efiname(&gpt_pte[i]));
  153. printf("\tattrs:\t0x%016llx\n", gpt_pte[i].attributes.raw);
  154. uuid_string(gpt_pte[i].partition_type_guid.b, uuid);
  155. printf("\ttype:\t%s\n", uuid);
  156. uuid_string(gpt_pte[i].unique_partition_guid.b, uuid);
  157. printf("\tuuid:\t%s\n", uuid);
  158. }
  159. /* Remember to free pte */
  160. free(gpt_pte);
  161. return;
  162. }
  163. int get_partition_info_efi(block_dev_desc_t * dev_desc, int part,
  164. disk_partition_t * info)
  165. {
  166. ALLOC_CACHE_ALIGN_BUFFER(gpt_header, gpt_head, 1);
  167. gpt_entry *gpt_pte = NULL;
  168. /* "part" argument must be at least 1 */
  169. if (!dev_desc || !info || part < 1) {
  170. printf("%s: Invalid Argument(s)\n", __func__);
  171. return -1;
  172. }
  173. /* This function validates AND fills in the GPT header and PTE */
  174. if (is_gpt_valid(dev_desc, GPT_PRIMARY_PARTITION_TABLE_LBA,
  175. gpt_head, &gpt_pte) != 1) {
  176. printf("%s: *** ERROR: Invalid GPT ***\n", __func__);
  177. return -1;
  178. }
  179. if (part > le32_to_int(gpt_head->num_partition_entries) ||
  180. !is_pte_valid(&gpt_pte[part - 1])) {
  181. printf("%s: *** ERROR: Invalid partition number %d ***\n",
  182. __func__, part);
  183. return -1;
  184. }
  185. /* The ulong casting limits the maximum disk size to 2 TB */
  186. info->start = (ulong) le64_to_int(gpt_pte[part - 1].starting_lba);
  187. /* The ending LBA is inclusive, to calculate size, add 1 to it */
  188. info->size = ((ulong)le64_to_int(gpt_pte[part - 1].ending_lba) + 1)
  189. - info->start;
  190. info->blksz = GPT_BLOCK_SIZE;
  191. sprintf((char *)info->name, "%s",
  192. print_efiname(&gpt_pte[part - 1]));
  193. sprintf((char *)info->type, "U-Boot");
  194. #ifdef CONFIG_PARTITION_UUIDS
  195. uuid_string(gpt_pte[part - 1].unique_partition_guid.b, info->uuid);
  196. #endif
  197. debug("%s: start 0x%lX, size 0x%lX, name %s", __func__,
  198. info->start, info->size, info->name);
  199. /* Remember to free pte */
  200. free(gpt_pte);
  201. return 0;
  202. }
  203. int test_part_efi(block_dev_desc_t * dev_desc)
  204. {
  205. ALLOC_CACHE_ALIGN_BUFFER(legacy_mbr, legacymbr, 1);
  206. /* Read legacy MBR from block 0 and validate it */
  207. if ((dev_desc->block_read(dev_desc->dev, 0, 1, (ulong *)legacymbr) != 1)
  208. || (is_pmbr_valid(legacymbr) != 1)) {
  209. return -1;
  210. }
  211. return 0;
  212. }
  213. /*
  214. * Private functions
  215. */
  216. /*
  217. * pmbr_part_valid(): Check for EFI partition signature
  218. *
  219. * Returns: 1 if EFI GPT partition type is found.
  220. */
  221. static int pmbr_part_valid(struct partition *part)
  222. {
  223. if (part->sys_ind == EFI_PMBR_OSTYPE_EFI_GPT &&
  224. le32_to_int(part->start_sect) == 1UL) {
  225. return 1;
  226. }
  227. return 0;
  228. }
  229. /*
  230. * is_pmbr_valid(): test Protective MBR for validity
  231. *
  232. * Returns: 1 if PMBR is valid, 0 otherwise.
  233. * Validity depends on two things:
  234. * 1) MSDOS signature is in the last two bytes of the MBR
  235. * 2) One partition of type 0xEE is found, checked by pmbr_part_valid()
  236. */
  237. static int is_pmbr_valid(legacy_mbr * mbr)
  238. {
  239. int i = 0;
  240. if (!mbr || le16_to_int(mbr->signature) != MSDOS_MBR_SIGNATURE) {
  241. return 0;
  242. }
  243. for (i = 0; i < 4; i++) {
  244. if (pmbr_part_valid(&mbr->partition_record[i])) {
  245. return 1;
  246. }
  247. }
  248. return 0;
  249. }
  250. /**
  251. * is_gpt_valid() - tests one GPT header and PTEs for validity
  252. *
  253. * lba is the logical block address of the GPT header to test
  254. * gpt is a GPT header ptr, filled on return.
  255. * ptes is a PTEs ptr, filled on return.
  256. *
  257. * Description: returns 1 if valid, 0 on error.
  258. * If valid, returns pointers to PTEs.
  259. */
  260. static int is_gpt_valid(block_dev_desc_t * dev_desc, unsigned long long lba,
  261. gpt_header * pgpt_head, gpt_entry ** pgpt_pte)
  262. {
  263. unsigned char crc32_backup[4] = { 0 };
  264. unsigned long calc_crc32;
  265. unsigned long long lastlba;
  266. if (!dev_desc || !pgpt_head) {
  267. printf("%s: Invalid Argument(s)\n", __func__);
  268. return 0;
  269. }
  270. /* Read GPT Header from device */
  271. if (dev_desc->block_read(dev_desc->dev, lba, 1, pgpt_head) != 1) {
  272. printf("*** ERROR: Can't read GPT header ***\n");
  273. return 0;
  274. }
  275. /* Check the GPT header signature */
  276. if (le64_to_int(pgpt_head->signature) != GPT_HEADER_SIGNATURE) {
  277. printf("GUID Partition Table Header signature is wrong:"
  278. "0x%llX != 0x%llX\n",
  279. (unsigned long long)le64_to_int(pgpt_head->signature),
  280. (unsigned long long)GPT_HEADER_SIGNATURE);
  281. return 0;
  282. }
  283. /* Check the GUID Partition Table CRC */
  284. memcpy(crc32_backup, pgpt_head->header_crc32, sizeof(crc32_backup));
  285. memset(pgpt_head->header_crc32, 0, sizeof(pgpt_head->header_crc32));
  286. calc_crc32 = efi_crc32((const unsigned char *)pgpt_head,
  287. le32_to_int(pgpt_head->header_size));
  288. memcpy(pgpt_head->header_crc32, crc32_backup, sizeof(crc32_backup));
  289. if (calc_crc32 != le32_to_int(crc32_backup)) {
  290. printf("GUID Partition Table Header CRC is wrong:"
  291. "0x%08lX != 0x%08lX\n",
  292. le32_to_int(crc32_backup), calc_crc32);
  293. return 0;
  294. }
  295. /* Check that the my_lba entry points to the LBA that contains the GPT */
  296. if (le64_to_int(pgpt_head->my_lba) != lba) {
  297. printf("GPT: my_lba incorrect: %llX != %llX\n",
  298. (unsigned long long)le64_to_int(pgpt_head->my_lba),
  299. (unsigned long long)lba);
  300. return 0;
  301. }
  302. /* Check the first_usable_lba and last_usable_lba are within the disk. */
  303. lastlba = (unsigned long long)dev_desc->lba;
  304. if (le64_to_int(pgpt_head->first_usable_lba) > lastlba) {
  305. printf("GPT: first_usable_lba incorrect: %llX > %llX\n",
  306. le64_to_int(pgpt_head->first_usable_lba), lastlba);
  307. return 0;
  308. }
  309. if (le64_to_int(pgpt_head->last_usable_lba) > lastlba) {
  310. printf("GPT: last_usable_lba incorrect: %llX > %llX\n",
  311. le64_to_int(pgpt_head->last_usable_lba), lastlba);
  312. return 0;
  313. }
  314. debug("GPT: first_usable_lba: %llX last_usable_lba %llX last lba %llX\n",
  315. le64_to_int(pgpt_head->first_usable_lba),
  316. le64_to_int(pgpt_head->last_usable_lba), lastlba);
  317. /* Read and allocate Partition Table Entries */
  318. *pgpt_pte = alloc_read_gpt_entries(dev_desc, pgpt_head);
  319. if (*pgpt_pte == NULL) {
  320. printf("GPT: Failed to allocate memory for PTE\n");
  321. return 0;
  322. }
  323. /* Check the GUID Partition Table Entry Array CRC */
  324. calc_crc32 = efi_crc32((const unsigned char *)*pgpt_pte,
  325. le32_to_int(pgpt_head->num_partition_entries) *
  326. le32_to_int(pgpt_head->sizeof_partition_entry));
  327. if (calc_crc32 != le32_to_int(pgpt_head->partition_entry_array_crc32)) {
  328. printf("GUID Partition Table Entry Array CRC is wrong:"
  329. "0x%08lX != 0x%08lX\n",
  330. le32_to_int(pgpt_head->partition_entry_array_crc32),
  331. calc_crc32);
  332. free(*pgpt_pte);
  333. return 0;
  334. }
  335. /* We're done, all's well */
  336. return 1;
  337. }
  338. /**
  339. * alloc_read_gpt_entries(): reads partition entries from disk
  340. * @dev_desc
  341. * @gpt - GPT header
  342. *
  343. * Description: Returns ptes on success, NULL on error.
  344. * Allocates space for PTEs based on information found in @gpt.
  345. * Notes: remember to free pte when you're done!
  346. */
  347. static gpt_entry *alloc_read_gpt_entries(block_dev_desc_t * dev_desc,
  348. gpt_header * pgpt_head)
  349. {
  350. size_t count = 0;
  351. gpt_entry *pte = NULL;
  352. if (!dev_desc || !pgpt_head) {
  353. printf("%s: Invalid Argument(s)\n", __func__);
  354. return NULL;
  355. }
  356. count = le32_to_int(pgpt_head->num_partition_entries) *
  357. le32_to_int(pgpt_head->sizeof_partition_entry);
  358. debug("%s: count = %lu * %lu = %u\n", __func__,
  359. le32_to_int(pgpt_head->num_partition_entries),
  360. le32_to_int(pgpt_head->sizeof_partition_entry), count);
  361. /* Allocate memory for PTE, remember to FREE */
  362. if (count != 0) {
  363. pte = memalign(ARCH_DMA_MINALIGN, count);
  364. }
  365. if (count == 0 || pte == NULL) {
  366. printf("%s: ERROR: Can't allocate 0x%X bytes for GPT Entries\n",
  367. __func__, count);
  368. return NULL;
  369. }
  370. /* Read GPT Entries from device */
  371. if (dev_desc->block_read (dev_desc->dev,
  372. (unsigned long)le64_to_int(pgpt_head->partition_entry_lba),
  373. (lbaint_t) (count / GPT_BLOCK_SIZE), pte)
  374. != (count / GPT_BLOCK_SIZE)) {
  375. printf("*** ERROR: Can't read GPT Entries ***\n");
  376. free(pte);
  377. return NULL;
  378. }
  379. return pte;
  380. }
  381. /**
  382. * is_pte_valid(): validates a single Partition Table Entry
  383. * @gpt_entry - Pointer to a single Partition Table Entry
  384. *
  385. * Description: returns 1 if valid, 0 on error.
  386. */
  387. static int is_pte_valid(gpt_entry * pte)
  388. {
  389. efi_guid_t unused_guid;
  390. if (!pte) {
  391. printf("%s: Invalid Argument(s)\n", __func__);
  392. return 0;
  393. }
  394. /* Only one validation for now:
  395. * The GUID Partition Type != Unused Entry (ALL-ZERO)
  396. */
  397. memset(unused_guid.b, 0, sizeof(unused_guid.b));
  398. if (memcmp(pte->partition_type_guid.b, unused_guid.b,
  399. sizeof(unused_guid.b)) == 0) {
  400. debug("%s: Found an unused PTE GUID at 0x%08X\n", __func__,
  401. (unsigned int)pte);
  402. return 0;
  403. } else {
  404. return 1;
  405. }
  406. }
  407. #endif