part_common.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372
  1. /* Copyright Statement:
  2. *
  3. * This software/firmware and related documentation ("MediaTek Software") are
  4. * protected under relevant copyright laws. The information contained herein
  5. * is confidential and proprietary to MediaTek Inc. and/or its licensors.
  6. * Without the prior written permission of MediaTek inc. and/or its licensors,
  7. * any reproduction, modification, use or disclosure of MediaTek Software,
  8. * and information contained herein, in whole or in part, shall be strictly prohibited.
  9. */
  10. /* MediaTek Inc. (C) 2017. All rights reserved.
  11. *
  12. * BY OPENING THIS FILE, RECEIVER HEREBY UNEQUIVOCALLY ACKNOWLEDGES AND AGREES
  13. * THAT THE SOFTWARE/FIRMWARE AND ITS DOCUMENTATIONS ("MEDIATEK SOFTWARE")
  14. * RECEIVED FROM MEDIATEK AND/OR ITS REPRESENTATIVES ARE PROVIDED TO RECEIVER ON
  15. * AN "AS-IS" BASIS ONLY. MEDIATEK EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES,
  16. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF
  17. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT.
  18. * NEITHER DOES MEDIATEK PROVIDE ANY WARRANTY WHATSOEVER WITH RESPECT TO THE
  19. * SOFTWARE OF ANY THIRD PARTY WHICH MAY BE USED BY, INCORPORATED IN, OR
  20. * SUPPLIED WITH THE MEDIATEK SOFTWARE, AND RECEIVER AGREES TO LOOK ONLY TO SUCH
  21. * THIRD PARTY FOR ANY WARRANTY CLAIM RELATING THERETO. RECEIVER EXPRESSLY ACKNOWLEDGES
  22. * THAT IT IS RECEIVER'S SOLE RESPONSIBILITY TO OBTAIN FROM ANY THIRD PARTY ALL PROPER LICENSES
  23. * CONTAINED IN MEDIATEK SOFTWARE. MEDIATEK SHALL ALSO NOT BE RESPONSIBLE FOR ANY MEDIATEK
  24. * SOFTWARE RELEASES MADE TO RECEIVER'S SPECIFICATION OR TO CONFORM TO A PARTICULAR
  25. * STANDARD OR OPEN FORUM. RECEIVER'S SOLE AND EXCLUSIVE REMEDY AND MEDIATEK'S ENTIRE AND
  26. * CUMULATIVE LIABILITY WITH RESPECT TO THE MEDIATEK SOFTWARE RELEASED HEREUNDER WILL BE,
  27. * AT MEDIATEK'S OPTION, TO REVISE OR REPLACE THE MEDIATEK SOFTWARE AT ISSUE,
  28. * OR REFUND ANY SOFTWARE LICENSE FEES OR SERVICE CHARGE PAID BY RECEIVER TO
  29. * MEDIATEK FOR SUCH MEDIATEK SOFTWARE AT ISSUE.
  30. *
  31. * The following software/firmware and/or related documentation ("MediaTek Software")
  32. * have been modified by MediaTek Inc. All revisions are subject to any receiver\'s
  33. * applicable license agreements with MediaTek Inc.
  34. */
  35. #include <pal_typedefs.h>
  36. #include <pal_log.h>
  37. #include <pal_assert.h>
  38. #include <partition_api.h>
  39. #include <partition_error.h>
  40. #include <partition_active.h>
  41. #include <storage_api.h>
  42. #include <bootctrl.h>
  43. #include <platform.h>
  44. #ifdef MTK_PARTITION_COMMON
  45. #include "dram_buffer.h"
  46. #include "partition.h"
  47. #define part_num (g_dram_buf->part_num)
  48. #define part_info (g_dram_buf->part_info)
  49. #define partition_info (g_dram_buf->partition_info)
  50. #define meta_info (g_dram_buf->meta_info)
  51. #endif
  52. #define AB_TAG_SZ (2)
  53. #ifdef MTK_PARTITION_COMMON
  54. static u8 g_cur_part_name[32] = {0};
  55. static u8 g_part_ready = 0;
  56. struct active_part_entry g_active_part_tbl[] = {
  57. {"lk", "lk", "lk2"},
  58. {"tee", "tee1", "tee2"},
  59. {"gz", "gz1", "gz2"},
  60. {"sspm", "sspm_1", "sspm_2"},
  61. {"scp", "scp1", "scp2"},
  62. {"NULL", "NULL", "NULL"},
  63. };
  64. #endif
  65. static uint32_t name_compare(char *name1, char *name2)
  66. {
  67. uint32_t name1_sz = strlen(name1);
  68. uint32_t name2_sz = strlen(name2);
  69. if (name1_sz != name2_sz)
  70. return 1;
  71. return memcmp(name1, name2, sizeof(char) * name1_sz);
  72. }
  73. uint32_t partition_exists(char *part_name)
  74. {
  75. uint32_t exist = 0;
  76. part_t *part = NULL;
  77. if (NULL == part_name) {
  78. set_last_error(ERR_PART_GENERAL_INVALID_NAME);
  79. return -1;
  80. }
  81. if (NULL == (part = part_get(part_name)))
  82. exist = 0;
  83. else
  84. exist = 1;
  85. return exist;
  86. }
  87. uint32_t partition_get_gpt_active(char *part_name, uint32_t part_name_buf_sz,
  88. uint32_t op)
  89. {
  90. uint32_t ret = STATUS_OK;
  91. uint32_t active_1 = 0, active_2 = 0;
  92. uint32_t found = 0;
  93. uint32_t choice = 0;
  94. part_t *part = NULL;
  95. struct active_part_entry *iter = &g_active_part_tbl[0];
  96. if (NULL == part_name)
  97. return ERR_PART_GENERAL_INVALID_NAME;
  98. if (op != GET_ACTIVE && op != GET_INACTIVE)
  99. return ERR_PART_GENERAL_UNKNOWN_OP;
  100. /* look up base name in table, if not found, the partition does not
  101. support active mechanism, generally this table is pretty short so
  102. performance penalty should be low */
  103. while (name_compare("NULL", iter->base_name)) {
  104. if (!name_compare(part_name, iter->base_name)) {
  105. found = 1;
  106. part = part_get(iter->name1);
  107. if (NULL == part)
  108. return ERR_PART_GENERAL_NOT_EXIST;
  109. active_1 = mt_part_get_active_bit(part);
  110. if (GET_ACTIVE == op) {
  111. if (active_1) {
  112. choice = 1;
  113. break;
  114. }
  115. } else if (GET_INACTIVE == op) {
  116. if (!active_1) {
  117. choice = 1;
  118. break;
  119. }
  120. }
  121. part = part_get(iter->name2);
  122. if (NULL == part)
  123. //return ERR_PART_GENERAL_NOT_EXIST;
  124. break;
  125. active_2 = mt_part_get_active_bit(part);
  126. if (GET_ACTIVE == op) {
  127. if (active_2) {
  128. choice = 2;
  129. break;
  130. }
  131. } else if (GET_INACTIVE == op) {
  132. if (!active_2) {
  133. choice = 2;
  134. break;
  135. }
  136. }
  137. break;
  138. }
  139. iter++;
  140. }
  141. /* if this partition does not exist in base name in table, then
  142. * it does not support active bit mechanism so we keep its name
  143. * as is.
  144. */
  145. if (0 == found)
  146. return ret;
  147. /* active bit is not set before OTA. In this case, we boot
  148. * with set 1.
  149. */
  150. if (0 == choice || (active_1 == 0 && active_2 == 0)) {
  151. if (GET_ACTIVE == op) {
  152. choice = 1;
  153. } else if (GET_INACTIVE == op) {
  154. choice = 2;
  155. }
  156. }
  157. if (1 == choice) {
  158. uint32_t output_name_sz = strlen(iter->name1);
  159. if (output_name_sz > (part_name_buf_sz - 1))
  160. return ERR_PART_GENERAL_INVALID_NAME_SZ;
  161. memcpy(part_name, iter->name1, output_name_sz);
  162. *(part_name + output_name_sz) = 0;
  163. } else if (2 == choice) {
  164. uint32_t output_name_sz = strlen(iter->name2);
  165. if (output_name_sz > (part_name_buf_sz - 1))
  166. return ERR_PART_GENERAL_INVALID_NAME_SZ;
  167. memcpy(part_name, iter->name2, output_name_sz);
  168. *(part_name + output_name_sz) = 0;
  169. }
  170. return ret;
  171. }
  172. uint32_t partition_get_ab(char *part_name, uint32_t part_name_buf_sz,
  173. uint32_t op)
  174. {
  175. uint32_t ret = STATUS_OK;
  176. const char *ab_suffix = get_suffix();
  177. uint32_t part_name_sz = 0;
  178. uint32_t part_exist = 0;
  179. if (NULL == part_name)
  180. return ERR_PART_GENERAL_INVALID_NAME;
  181. if (op != GET_ACTIVE && op != GET_INACTIVE)
  182. return ERR_PART_GENERAL_UNKNOWN_OP;
  183. part_exist = partition_exists(part_name);
  184. /* use original name */
  185. if (1 == part_exist)
  186. return ret;
  187. /* something wrong with partition_exists api, return error code */
  188. if (-1 == part_exist)
  189. return get_last_error();
  190. if (ab_suffix == NULL)
  191. return ERR_PART_GENERAL_INVALID_SLOT;
  192. part_name_sz = strlen(part_name);
  193. if (part_name_sz > (part_name_buf_sz - 1 - AB_TAG_SZ))
  194. return ERR_PART_GENERAL_INVALID_NAME_SZ;
  195. if (!memcmp(ab_suffix, BOOTCTRL_SUFFIX_A, AB_TAG_SZ))
  196. memcpy(part_name + part_name_sz,
  197. GET_ACTIVE == op ? BOOTCTRL_SUFFIX_A : BOOTCTRL_SUFFIX_B, AB_TAG_SZ);
  198. else
  199. memcpy(part_name + part_name_sz,
  200. GET_ACTIVE == op ? BOOTCTRL_SUFFIX_B : BOOTCTRL_SUFFIX_A, AB_TAG_SZ);
  201. *(part_name + part_name_sz + AB_TAG_SZ) = 0;
  202. return ret;
  203. }
  204. uint32_t partition_get_active(char *part_name, uint32_t part_name_buf_sz,
  205. uint32_t op)
  206. {
  207. #if defined(MTK_AB_OTA_UPDATER)
  208. return partition_get_ab(part_name, part_name_buf_sz, op);
  209. #else
  210. return partition_get_gpt_active(part_name, part_name_buf_sz, op);
  211. #endif
  212. }
  213. #ifdef MTK_PARTITION_COMMON
  214. extern int read_gpt(part_t *part);
  215. static int (*read_partition[])(part_t *) = {
  216. read_gpt,
  217. NULL
  218. };
  219. int is_partition_init(void)
  220. {
  221. return g_part_ready;
  222. }
  223. int part_init(void)
  224. {
  225. int err, i;
  226. part_num = 0;
  227. memset(part_info, 0x00, sizeof(part_info));
  228. memset(partition_info, 0x0, sizeof(partition_info));
  229. memset(meta_info, 0x0, sizeof(meta_info));
  230. err = 0;
  231. i = 0;
  232. g_part_ready = 1; // ready means gpt structure is read to dram
  233. while (read_partition[i]) {
  234. err = read_partition[i](partition_info);
  235. if (!err)
  236. break;
  237. i++;
  238. }
  239. return 0;
  240. }
  241. static part_t tempart;
  242. static struct part_meta_info temmeta;
  243. part_t *get_part(char *name)
  244. {
  245. part_t *part;
  246. part_t *ret = NULL;
  247. if (g_part_ready == 1) {
  248. part = partition_info;
  249. while (part->nr_sects) {
  250. if (part->info) {
  251. if (!strcmp(name, part->info->name)) {
  252. memcpy(&tempart, part, sizeof(part_t));
  253. memcpy(&temmeta, part->info, sizeof(struct part_meta_info));
  254. tempart.info = &temmeta;
  255. ret = &tempart;
  256. break;
  257. }
  258. }
  259. part++;
  260. }
  261. } else {
  262. #ifdef EARLY_PARTITION_ACCESS
  263. part = mt_get_part_sram(name);
  264. if (part != NULL) {
  265. memcpy(&tempart, part, sizeof(part_t));
  266. ret = &tempart;
  267. }
  268. #else
  269. pal_log_err("[%s] cannot get_part before dram init\n", __func__);
  270. #endif
  271. }
  272. return ret;
  273. }
  274. part_t *part_get(char *name)
  275. {
  276. /* this api corrupts if length of name is > 32 */
  277. memcpy(g_cur_part_name, name, 32);
  278. return get_part(name);
  279. }
  280. u8 *partition_getCurPartName(void)
  281. {
  282. return g_cur_part_name;
  283. }
  284. /* retun > 0 if active bit exists, return = 0 if active bit is not existed */
  285. unsigned long mt_part_get_active_bit(part_t *part)
  286. {
  287. return (part->part_attr & PART_ATTR_LEGACY_BIOS_BOOTABLE);
  288. }
  289. #ifdef MTK_PART_DUMP_DISABLE
  290. void part_dump(void)
  291. {
  292. }
  293. #else
  294. void part_dump(void)
  295. {
  296. blkdev_t *bdev;
  297. part_t *part;
  298. u32 blksz;
  299. u64 start, end;
  300. bdev = blkdev_get(CFG_BOOT_DEV);
  301. if (!bdev)
  302. return;
  303. part = partition_info;
  304. blksz = bdev->blksz;
  305. pal_log_debug("\n[%s] blksz: %dB\n", __func__, blksz);
  306. while (part->nr_sects) {
  307. start = (u64)part->start_sect * blksz;
  308. end = (u64)(part->start_sect + part->nr_sects) * blksz - 1;
  309. pal_log_debug("[%s] [0x%llx-0x%llx] \"%s\" (%d blocks) \n", __func__, start, end,
  310. (part->info) ? (char *)part->info->name : "unknown", part->nr_sects);
  311. part++;
  312. }
  313. }
  314. #endif // MTK_PART_DUMP_DISABLE
  315. #endif // MTK_PARTITION_COMMON