loader.cpp 32 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915
  1. /*
  2. * Copyright (C) 2011-2017 Intel Corporation. All rights reserved.
  3. *
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions
  6. * are met:
  7. *
  8. * * Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * * Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in
  12. * the documentation and/or other materials provided with the
  13. * distribution.
  14. * * Neither the name of Intel Corporation nor the names of its
  15. * contributors may be used to endorse or promote products derived
  16. * from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22. * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. *
  30. */
  31. #include "se_wrapper.h"
  32. #include "se_error_internal.h"
  33. #include "arch.h"
  34. #include "util.h"
  35. #include "loader.h"
  36. #include "se_page_attr.h"
  37. #include "enclave.h"
  38. #include "enclave_creator.h"
  39. #include "routine.h"
  40. #include "sgx_attributes.h"
  41. #include "se_vendor.h"
  42. #include "se_detect.h"
  43. #include "binparser.h"
  44. #include <assert.h>
  45. #include <vector>
  46. #include <algorithm>
  47. #define __STDC_FORMAT_MACROS
  48. #include <inttypes.h>
  49. #include <sys/mman.h>
  50. // enclave creator instance
  51. extern EnclaveCreator* g_enclave_creator;
  52. EnclaveCreator* get_enclave_creator(void)
  53. {
  54. return g_enclave_creator;
  55. }
  56. CLoader::CLoader(uint8_t *mapped_file_base, BinParser &parser)
  57. : m_mapped_file_base(mapped_file_base)
  58. , m_enclave_id(0)
  59. , m_start_addr(NULL)
  60. , m_metadata(NULL)
  61. , m_parser(parser)
  62. {
  63. memset(&m_secs, 0, sizeof(m_secs));
  64. }
  65. CLoader::~CLoader()
  66. {
  67. }
  68. sgx_enclave_id_t CLoader::get_enclave_id() const
  69. {
  70. return m_enclave_id;
  71. }
  72. const void* CLoader::get_start_addr() const
  73. {
  74. return m_start_addr;
  75. }
  76. const std::vector<std::pair<tcs_t *, bool>>& CLoader::get_tcs_list() const
  77. {
  78. return m_tcs_list;
  79. }
  80. const secs_t& CLoader::get_secs() const
  81. {
  82. return m_secs;
  83. }
  84. void* CLoader::get_symbol_address(const char * const symbol)
  85. {
  86. uint64_t rva = m_parser.get_symbol_rva(symbol);
  87. if(0 == rva)
  88. return NULL;
  89. return GET_PTR(void, m_start_addr, rva);
  90. }
  91. // is_relocation_page returns true if the specified RVA is a writable relocation page based on the bitmap.
  92. bool CLoader::is_relocation_page(const uint64_t rva, vector<uint8_t> *bitmap)
  93. {
  94. uint64_t page_frame = rva >> SE_PAGE_SHIFT;
  95. //NOTE:
  96. // Current enclave size is not beyond 128G, so the type-casting from (uint64>>15) to (size_t) is OK.
  97. // In the future, if the max enclave size is extended to beyond (1<<49), this type-casting will not work.
  98. // It only impacts the enclave signing process. (32bit signing tool to sign 64 bit enclaves)
  99. size_t index = (size_t)(page_frame / 8);
  100. if(bitmap && (index < bitmap->size()))
  101. {
  102. return ((*bitmap)[index] & (1 << (page_frame % 8)));
  103. }
  104. return false;
  105. }
  106. int CLoader::build_mem_region(const section_info_t &sec_info)
  107. {
  108. int ret = SGX_SUCCESS;
  109. uint64_t offset = 0;
  110. sec_info_t sinfo;
  111. memset(&sinfo, 0, sizeof(sinfo));
  112. // Build pages of the section that are contain initialized data. Each page
  113. // needs to be added individually as the page may hold relocation data, in
  114. // which case the page needs to be marked writable.
  115. while(offset < sec_info.raw_data_size)
  116. {
  117. uint64_t rva = sec_info.rva + offset;
  118. uint64_t size = MIN((SE_PAGE_SIZE - PAGE_OFFSET(rva)), (sec_info.raw_data_size - offset));
  119. sinfo.flags = sec_info.flag;
  120. if(is_relocation_page(rva, sec_info.bitmap) && !(sec_info.flag & SI_FLAG_W))
  121. {
  122. sinfo.flags = sec_info.flag | SI_FLAG_W;
  123. assert(g_enclave_creator != NULL);
  124. if(g_enclave_creator->use_se_hw() == true)
  125. {
  126. ret = mprotect((void*)(TRIM_TO_PAGE(rva) + (uint64_t)m_start_addr), SE_PAGE_SIZE,
  127. (int)(sinfo.flags & SI_MASK_MEM_ATTRIBUTE));
  128. if(ret != 0)
  129. {
  130. SE_TRACE(SE_TRACE_WARNING, "mprotect(rva=0x%llx, len=%d, flags=%d) failed\n",
  131. rva, SE_PAGE_SIZE, int(sinfo.flags & SI_MASK_MEM_ATTRIBUTE));
  132. return SGX_ERROR_UNEXPECTED;
  133. }
  134. }
  135. }
  136. if (size == SE_PAGE_SIZE)
  137. ret = build_pages(rva, size, sec_info.raw_data + offset, sinfo, ADD_EXTEND_PAGE);
  138. else
  139. ret = build_partial_page(rva, size, sec_info.raw_data + offset, sinfo, ADD_EXTEND_PAGE);
  140. if(SGX_SUCCESS != ret)
  141. return ret;
  142. // only the first time that rva may be not page aligned
  143. offset += SE_PAGE_SIZE - PAGE_OFFSET(rva);
  144. }
  145. assert(IS_PAGE_ALIGNED(sec_info.rva + offset));
  146. // Add any remaining uninitialized data. We can call build_pages directly
  147. // even if there are partial pages since the source is null, i.e. everything
  148. // is filled with '0'. Uninitialied data cannot be a relocation table, ergo
  149. // there is no need to check the relocation bitmap.
  150. if(sec_info.virtual_size > offset)
  151. {
  152. uint64_t rva = sec_info.rva + offset;
  153. size_t size = (size_t)(ROUND_TO_PAGE(sec_info.virtual_size - offset));
  154. sinfo.flags = sec_info.flag;
  155. if(SGX_SUCCESS != (ret = build_pages(rva, size, 0, sinfo, ADD_EXTEND_PAGE)))
  156. return ret;
  157. }
  158. return SGX_SUCCESS;
  159. }
  160. int CLoader::build_sections(vector<uint8_t> *bitmap)
  161. {
  162. int ret = SGX_SUCCESS;
  163. std::vector<Section*> sections = m_parser.get_sections();
  164. uint64_t max_rva =0;
  165. Section* last_section = NULL;
  166. for(unsigned int i = 0; i < sections.size() ; i++)
  167. {
  168. if((META_DATA_MAKE_VERSION(SGX_1_5_MAJOR_VERSION,SGX_1_5_MINOR_VERSION ) == m_metadata->version) &&
  169. (last_section != NULL) &&
  170. (ROUND_TO_PAGE(last_section->virtual_size() + last_section->get_rva()) < ROUND_TO_PAGE(ROUND_TO_PAGE(last_section->virtual_size()) + last_section->get_rva())) &&
  171. (ROUND_TO_PAGE(last_section->get_rva() + last_section->virtual_size()) < (sections[i]->get_rva() & (~(SE_PAGE_SIZE - 1)))))
  172. {
  173. size_t size = SE_PAGE_SIZE;
  174. sec_info_t sinfo;
  175. memset(&sinfo, 0, sizeof(sinfo));
  176. sinfo.flags = last_section->get_si_flags();
  177. uint64_t rva = ROUND_TO_PAGE(last_section->get_rva() + last_section->virtual_size());
  178. if(SGX_SUCCESS != (ret = build_pages(rva, size, 0, sinfo, ADD_EXTEND_PAGE)))
  179. return ret;
  180. }
  181. if(sections[i]->get_rva() > max_rva)
  182. {
  183. max_rva = sections[i]->get_rva();
  184. last_section = sections[i];
  185. }
  186. section_info_t sec_info = { sections[i]->raw_data(), sections[i]->raw_data_size(), sections[i]->get_rva(), sections[i]->virtual_size(), sections[i]->get_si_flags(), bitmap };
  187. if(SGX_SUCCESS != (ret = build_mem_region(sec_info)))
  188. return ret;
  189. }
  190. if((META_DATA_MAKE_VERSION(SGX_1_5_MAJOR_VERSION,SGX_1_5_MINOR_VERSION ) == m_metadata->version) &&
  191. (last_section != NULL) &&
  192. (ROUND_TO_PAGE(last_section->virtual_size() + last_section->get_rva()) < ROUND_TO_PAGE(ROUND_TO_PAGE(last_section->virtual_size()) + last_section->get_rva())))
  193. {
  194. size_t size = SE_PAGE_SIZE;
  195. sec_info_t sinfo;
  196. memset(&sinfo, 0, sizeof(sinfo));
  197. sinfo.flags = last_section->get_si_flags();
  198. uint64_t rva = ROUND_TO_PAGE(last_section->get_rva() + last_section->virtual_size());
  199. if(SGX_SUCCESS != (ret = build_pages(rva, size, 0, sinfo, ADD_EXTEND_PAGE)))
  200. return ret;
  201. }
  202. return SGX_SUCCESS;
  203. }
  204. int CLoader::build_partial_page(const uint64_t rva, const uint64_t size, const void *source, const sec_info_t &sinfo, const uint32_t attr)
  205. {
  206. // RVA may or may not be aligned.
  207. uint64_t offset = PAGE_OFFSET(rva);
  208. // Initialize the page with '0', this serves as both the padding at the start
  209. // of the page (if it's not aligned) as well as the fill for any unitilized
  210. // bytes at the end of the page, e.g. .bss data.
  211. uint8_t page_data[SE_PAGE_SIZE];
  212. memset(page_data, 0, SE_PAGE_SIZE);
  213. // The amount of raw data may be less than the number of bytes on the page,
  214. // but that portion of page_data has already been filled (see above).
  215. memcpy_s(&page_data[offset], (size_t)(SE_PAGE_SIZE - offset), source, (size_t)size);
  216. // Add the page, trimming the start address to make it page aligned.
  217. return build_pages(TRIM_TO_PAGE(rva), SE_PAGE_SIZE, page_data, sinfo, attr);
  218. }
  219. int CLoader::build_pages(const uint64_t start_rva, const uint64_t size, const void *source, const sec_info_t &sinfo, const uint32_t attr)
  220. {
  221. int ret = SGX_SUCCESS;
  222. uint64_t offset = 0;
  223. uint64_t rva = start_rva;
  224. assert(IS_PAGE_ALIGNED(start_rva) && IS_PAGE_ALIGNED(size));
  225. while(offset < size)
  226. {
  227. //call driver to add page;
  228. if(SGX_SUCCESS != (ret = get_enclave_creator()->add_enclave_page(ENCLAVE_ID_IOCTL, GET_PTR(void, source, 0), rva, sinfo, attr)))
  229. {
  230. //if add page failed , we should remove enclave somewhere;
  231. return ret;
  232. }
  233. offset += SE_PAGE_SIZE;
  234. rva += SE_PAGE_SIZE;
  235. }
  236. return SGX_SUCCESS;
  237. }
  238. int CLoader::post_init_action(layout_t *layout_start, layout_t *layout_end, uint64_t delta)
  239. {
  240. int ret = SGX_SUCCESS;
  241. for(layout_t *layout = layout_start; layout < layout_end; layout++)
  242. {
  243. if (!IS_GROUP_ID(layout->group.id) && (layout->entry.attributes & PAGE_ATTR_POST_REMOVE))
  244. {
  245. uint64_t start_addr = layout->entry.rva + delta + (uint64_t)get_start_addr();
  246. uint64_t page_count = (uint64_t)layout->entry.page_count;
  247. if (SGX_SUCCESS != (ret = get_enclave_creator()->trim_range(start_addr, start_addr + (page_count << SE_PAGE_SHIFT))))
  248. return ret;
  249. }
  250. else if (IS_GROUP_ID(layout->group.id))
  251. {
  252. uint64_t step = 0;
  253. for(uint32_t j = 0; j < layout->group.load_times; j++)
  254. {
  255. step += layout->group.load_step;
  256. if(SGX_SUCCESS != (ret = post_init_action(&layout[-layout->group.entry_count], layout, step)))
  257. return ret;
  258. }
  259. }
  260. }
  261. return SGX_SUCCESS;
  262. }
  263. int CLoader::post_init_action_commit(layout_t *layout_start, layout_t *layout_end, uint64_t delta)
  264. {
  265. int ret = SGX_SUCCESS;
  266. for(layout_t *layout = layout_start; layout < layout_end; layout++)
  267. {
  268. if (!IS_GROUP_ID(layout->group.id) && (layout->entry.attributes & PAGE_ATTR_POST_REMOVE))
  269. {
  270. uint64_t start_addr = layout->entry.rva + delta + (uint64_t)get_start_addr();
  271. uint64_t page_count = (uint64_t)layout->entry.page_count;
  272. for (uint64_t i = 0; i < page_count; i++)
  273. {
  274. if (SGX_SUCCESS != (ret = get_enclave_creator()->trim_accept(start_addr + (i << SE_PAGE_SHIFT))))
  275. return ret;
  276. }
  277. }
  278. else if (IS_GROUP_ID(layout->group.id))
  279. {
  280. uint64_t step = 0;
  281. for(uint32_t j = 0; j < layout->group.load_times; j++)
  282. {
  283. step += layout->group.load_step;
  284. if(SGX_SUCCESS != (ret = post_init_action_commit(&layout[-layout->group.entry_count], layout, step)))
  285. return ret;
  286. }
  287. }
  288. }
  289. return SGX_SUCCESS;
  290. }
  291. int CLoader::build_context(const uint64_t start_rva, layout_entry_t *layout)
  292. {
  293. int ret = SGX_ERROR_UNEXPECTED;
  294. uint8_t added_page[SE_PAGE_SIZE];
  295. sec_info_t sinfo;
  296. memset(added_page, 0, SE_PAGE_SIZE);
  297. memset(&sinfo, 0, sizeof(sinfo));
  298. uint64_t rva = start_rva + layout->rva;
  299. //uint64_t start_addr = (uint64_t)get_start_addr();
  300. assert(IS_PAGE_ALIGNED(rva));
  301. if (layout->attributes & PAGE_ATTR_EADD)
  302. {
  303. uint16_t attributes = layout->attributes;
  304. #ifdef SE_SIM
  305. attributes = attributes & (uint16_t)(~PAGE_ATTR_EREMOVE);
  306. #endif
  307. if (layout->content_offset)
  308. {
  309. if(layout->si_flags == SI_FLAGS_TCS)
  310. {
  311. memset(added_page, 0, SE_PAGE_SIZE);
  312. memcpy_s(added_page, SE_PAGE_SIZE, GET_PTR(uint8_t, m_metadata, layout->content_offset), layout->content_size);
  313. tcs_t *ptcs = reinterpret_cast<tcs_t*>(added_page);
  314. ptcs->ossa += rva;
  315. ptcs->ofs_base += rva;
  316. ptcs->ogs_base += rva;
  317. if(!(attributes & PAGE_ATTR_EREMOVE))
  318. {
  319. m_tcs_list.push_back(make_pair(GET_PTR(tcs_t, m_start_addr, rva), false));
  320. }
  321. sinfo.flags = layout->si_flags;
  322. if(SGX_SUCCESS != (ret = build_pages(rva, ((uint64_t)layout->page_count) << SE_PAGE_SHIFT, added_page, sinfo, attributes)))
  323. {
  324. return ret;
  325. }
  326. }
  327. else // guard page should not have content_offset != 0
  328. {
  329. section_info_t sec_info = {GET_PTR(uint8_t, m_metadata, layout->content_offset), layout->content_size, rva, ((uint64_t)layout->page_count) << SE_PAGE_SHIFT, layout->si_flags, NULL};
  330. if(SGX_SUCCESS != (ret = build_mem_region(sec_info)))
  331. {
  332. return ret;
  333. }
  334. }
  335. }
  336. else if (layout->si_flags != SI_FLAG_NONE)
  337. {
  338. sinfo.flags = layout->si_flags;
  339. void *source = NULL;
  340. if(layout->content_size)
  341. {
  342. for(uint32_t *p = (uint32_t *)added_page; p < GET_PTR(uint32_t, added_page, SE_PAGE_SIZE); p++)
  343. {
  344. *p = layout->content_size;
  345. }
  346. source = added_page;
  347. }
  348. if(SGX_SUCCESS != (ret = build_pages(rva, ((uint64_t)layout->page_count) << SE_PAGE_SHIFT, source, sinfo, layout->attributes)))
  349. {
  350. return ret;
  351. }
  352. }
  353. }
  354. if(layout->attributes & PAGE_ATTR_POST_ADD)
  355. {
  356. #ifndef SE_SIM
  357. if(layout->id == LAYOUT_ID_TCS_DYN)
  358. {
  359. m_tcs_list.push_back(make_pair(GET_PTR(tcs_t, m_start_addr, rva), true));
  360. }
  361. #endif
  362. }
  363. return SGX_SUCCESS;
  364. }
  365. int CLoader::build_contexts(layout_t *layout_start, layout_t *layout_end, uint64_t delta)
  366. {
  367. int ret = SGX_ERROR_UNEXPECTED;
  368. for(layout_t *layout = layout_start; layout < layout_end; layout++)
  369. {
  370. if (!IS_GROUP_ID(layout->group.id))
  371. {
  372. if(SGX_SUCCESS != (ret = build_context(delta, &layout->entry)))
  373. {
  374. return ret;
  375. }
  376. }
  377. else
  378. {
  379. uint64_t step = 0;
  380. for(uint32_t j = 0; j < layout->group.load_times; j++)
  381. {
  382. step += layout->group.load_step;
  383. if(SGX_SUCCESS != (ret = build_contexts(&layout[-layout->group.entry_count], layout, step)))
  384. {
  385. return ret;
  386. }
  387. }
  388. }
  389. }
  390. return SGX_SUCCESS;
  391. }
  392. int CLoader::build_secs(sgx_attributes_t * const secs_attr, sgx_misc_attribute_t * const misc_attr)
  393. {
  394. memset(&m_secs, 0, sizeof(secs_t)); //should set resvered field of secs as 0.
  395. //create secs structure.
  396. m_secs.base = 0; //base is allocated by driver. set it as 0
  397. m_secs.size = m_metadata->enclave_size;
  398. m_secs.misc_select = misc_attr->misc_select;
  399. memcpy_s(&m_secs.attributes, sizeof(m_secs.attributes), secs_attr, sizeof(m_secs.attributes));
  400. m_secs.ssa_frame_size = m_metadata->ssa_frame_size;
  401. EnclaveCreator *enclave_creator = get_enclave_creator();
  402. if(NULL == enclave_creator)
  403. return SGX_ERROR_UNEXPECTED;
  404. int ret = enclave_creator->create_enclave(&m_secs, &m_enclave_id, &m_start_addr, is_ae(&m_metadata->enclave_css));
  405. if(SGX_SUCCESS == ret)
  406. {
  407. SE_TRACE(SE_TRACE_NOTICE, "enclave start address = %p, size = 0x%llx\n", m_start_addr, m_metadata->enclave_size);
  408. if(enclave_creator->use_se_hw() == true)
  409. {
  410. set_memory_protection();
  411. }
  412. }
  413. return ret;
  414. }
  415. int CLoader::build_image(SGXLaunchToken * const lc, sgx_attributes_t * const secs_attr, le_prd_css_file_t *prd_css_file, sgx_misc_attribute_t * const misc_attr)
  416. {
  417. int ret = SGX_SUCCESS;
  418. if(SGX_SUCCESS != (ret = build_secs(secs_attr, misc_attr)))
  419. {
  420. SE_TRACE(SE_TRACE_WARNING, "build secs failed\n");
  421. return ret;
  422. };
  423. // read reloc bitmap before patch the enclave file
  424. // If load_enclave_ex try to load the enclave for the 2nd time,
  425. // the enclave image is already patched, and parser cannot read the information.
  426. // For linux, there's no map conflict. We assume load_enclave_ex will not do the retry.
  427. vector<uint8_t> bitmap;
  428. if(!m_parser.get_reloc_bitmap(bitmap))
  429. return SGX_ERROR_INVALID_ENCLAVE;
  430. // patch enclave file
  431. patch_entry_t *patch_start = GET_PTR(patch_entry_t, m_metadata, m_metadata->dirs[DIR_PATCH].offset);
  432. patch_entry_t *patch_end = GET_PTR(patch_entry_t, m_metadata, m_metadata->dirs[DIR_PATCH].offset + m_metadata->dirs[DIR_PATCH].size);
  433. for(patch_entry_t *patch = patch_start; patch < patch_end; patch++)
  434. {
  435. memcpy_s(GET_PTR(void, m_parser.get_start_addr(), patch->dst), patch->size, GET_PTR(void, m_metadata, patch->src), patch->size);
  436. }
  437. //build sections, copy export function table as well;
  438. if(SGX_SUCCESS != (ret = build_sections(&bitmap)))
  439. {
  440. SE_TRACE(SE_TRACE_WARNING, "build sections failed\n");
  441. goto fail;
  442. }
  443. // build heap/thread context
  444. if (SGX_SUCCESS != (ret = build_contexts(GET_PTR(layout_t, m_metadata, m_metadata->dirs[DIR_LAYOUT].offset),
  445. GET_PTR(layout_t, m_metadata, m_metadata->dirs[DIR_LAYOUT].offset + m_metadata->dirs[DIR_LAYOUT].size),
  446. 0)))
  447. {
  448. SE_TRACE(SE_TRACE_WARNING, "build heap/thread context failed\n");
  449. goto fail;
  450. }
  451. //initialize Enclave
  452. ret = get_enclave_creator()->init_enclave(ENCLAVE_ID_IOCTL, const_cast<enclave_css_t *>(&m_metadata->enclave_css), lc, prd_css_file);
  453. if(SGX_SUCCESS != ret)
  454. {
  455. SE_TRACE(SE_TRACE_WARNING, "init_enclave failed\n");
  456. goto fail;
  457. }
  458. return SGX_SUCCESS;
  459. fail:
  460. get_enclave_creator()->destroy_enclave(ENCLAVE_ID_IOCTL, m_secs.size);
  461. return ret;
  462. }
  463. bool CLoader::is_metadata_buffer(uint32_t offset, uint32_t size)
  464. {
  465. if((offsetof(metadata_t, data) > offset) || (offset >= m_metadata->size))
  466. {
  467. return false;
  468. }
  469. uint32_t end = offset + size;
  470. if ((end < offset) || (end < size) || (end > m_metadata->size))
  471. {
  472. return false;
  473. }
  474. return true;
  475. }
  476. bool CLoader::is_enclave_buffer(uint64_t offset, uint64_t size)
  477. {
  478. if(offset >= m_metadata->enclave_size)
  479. {
  480. return false;
  481. }
  482. uint64_t end = offset + size;
  483. if ((end < offset) || (end < size) || (end > m_metadata->enclave_size))
  484. {
  485. return false;
  486. }
  487. return true;
  488. }
  489. int CLoader::validate_layout_table()
  490. {
  491. layout_t *layout_start = GET_PTR(layout_t, m_metadata, m_metadata->dirs[DIR_LAYOUT].offset);
  492. layout_t *layout_end = GET_PTR(layout_t, m_metadata, m_metadata->dirs[DIR_LAYOUT].offset + m_metadata->dirs[DIR_LAYOUT].size);
  493. vector<pair<uint64_t, uint64_t>> rva_vector;
  494. for (layout_t *layout = layout_start; layout < layout_end; layout++)
  495. {
  496. if(!IS_GROUP_ID(layout->entry.id)) // layout entry
  497. {
  498. rva_vector.push_back(make_pair(layout->entry.rva, ((uint64_t)layout->entry.page_count) << SE_PAGE_SHIFT));
  499. if(layout->entry.content_offset)
  500. {
  501. if(false == is_metadata_buffer(layout->entry.content_offset, layout->entry.content_size))
  502. {
  503. return SGX_ERROR_INVALID_METADATA;
  504. }
  505. }
  506. }
  507. else // layout group
  508. {
  509. if (layout->group.entry_count > (uint32_t)(PTR_DIFF(layout, layout_start)/sizeof(layout_t)))
  510. {
  511. return SGX_ERROR_INVALID_METADATA;
  512. }
  513. uint64_t load_step = 0;
  514. for(uint32_t i = 0; i < layout->group.load_times; i++)
  515. {
  516. load_step += layout->group.load_step;
  517. if(load_step > m_metadata->enclave_size)
  518. {
  519. return SGX_ERROR_INVALID_METADATA;
  520. }
  521. for(layout_entry_t *entry = &layout[-layout->group.entry_count].entry; entry < &layout->entry; entry++)
  522. {
  523. if(IS_GROUP_ID(entry->id))
  524. {
  525. return SGX_ERROR_INVALID_METADATA;
  526. }
  527. rva_vector.push_back(make_pair(entry->rva + load_step, ((uint64_t)entry->page_count) << SE_PAGE_SHIFT));
  528. // no need to check integer overflow for entry->rva + load_step, because
  529. // entry->rva and load_step are less than enclave_size, whose size is no more than 37 bit
  530. }
  531. }
  532. }
  533. }
  534. sort(rva_vector.begin(), rva_vector.end());
  535. for (vector<pair<uint64_t, uint64_t>>::iterator it = rva_vector.begin(); it != rva_vector.end(); it++)
  536. {
  537. if(!IS_PAGE_ALIGNED(it->first))
  538. {
  539. return SGX_ERROR_INVALID_METADATA;
  540. }
  541. if(false == is_enclave_buffer(it->first, it->second))
  542. {
  543. return SGX_ERROR_INVALID_METADATA;
  544. }
  545. if((it+1) != rva_vector.end())
  546. {
  547. if((it->first+it->second) > (it+1)->first)
  548. {
  549. return SGX_ERROR_INVALID_METADATA;
  550. }
  551. }
  552. }
  553. return SGX_SUCCESS;
  554. }
  555. int CLoader::validate_patch_table()
  556. {
  557. patch_entry_t *patch_start = GET_PTR(patch_entry_t, m_metadata, m_metadata->dirs[DIR_PATCH].offset);
  558. patch_entry_t *patch_end = GET_PTR(patch_entry_t, m_metadata, m_metadata->dirs[DIR_PATCH].offset + m_metadata->dirs[DIR_PATCH].size);
  559. for(patch_entry_t *patch = patch_start; patch < patch_end; patch++)
  560. {
  561. if(false == is_metadata_buffer(patch->src, patch->size))
  562. {
  563. return SGX_ERROR_INVALID_METADATA;
  564. }
  565. if(false == is_enclave_buffer(patch->dst, patch->size))
  566. {
  567. return SGX_ERROR_INVALID_METADATA;
  568. }
  569. }
  570. return SGX_SUCCESS;
  571. }
  572. int CLoader::validate_metadata()
  573. {
  574. if(!m_metadata)
  575. return SGX_ERROR_INVALID_METADATA;
  576. uint64_t versions[] = {
  577. META_DATA_MAKE_VERSION(MAJOR_VERSION,MINOR_VERSION ),
  578. META_DATA_MAKE_VERSION(SGX_1_9_MAJOR_VERSION,SGX_1_9_MINOR_VERSION ),
  579. META_DATA_MAKE_VERSION(SGX_1_5_MAJOR_VERSION,SGX_1_5_MINOR_VERSION )
  580. };
  581. //if the version of metadata does NOT match the version of metadata in urts, we should NOT launch enclave.
  582. uint32_t idx;
  583. for(idx = 0; idx < (uint32_t)(sizeof(versions)/sizeof(versions[0])) && m_metadata->version != versions[idx]; idx ++);
  584. if(idx >= (uint32_t)(sizeof(versions)/sizeof(versions[0])))
  585. {
  586. SE_TRACE(SE_TRACE_WARNING, "Mismatch between the metadata urts required and the metadata in use.\n");
  587. return SGX_ERROR_INVALID_VERSION;
  588. }
  589. if(m_metadata->tcs_policy > TCS_POLICY_UNBIND)
  590. return SGX_ERROR_INVALID_METADATA;
  591. if(m_metadata->ssa_frame_size < SSA_FRAME_SIZE_MIN || m_metadata->ssa_frame_size > SSA_FRAME_SIZE_MAX)
  592. return SGX_ERROR_INVALID_METADATA;
  593. uint64_t size = m_metadata->enclave_size;
  594. if(size > m_parser.get_enclave_max_size())
  595. {
  596. return SGX_ERROR_INVALID_METADATA;
  597. }
  598. while ((size != 0) && ((size & 1) != 1))
  599. {
  600. size = size >> 1;
  601. }
  602. if(size != 1)
  603. {
  604. return SGX_ERROR_INVALID_METADATA;
  605. }
  606. // check dirs
  607. for(uint32_t i = 0; i < DIR_NUM; i++)
  608. {
  609. if(false == is_metadata_buffer(m_metadata->dirs[i].offset, m_metadata->dirs[i].size))
  610. {
  611. return SGX_ERROR_INVALID_METADATA;
  612. }
  613. }
  614. // check layout table
  615. int status = validate_layout_table();
  616. if(SGX_SUCCESS != status)
  617. {
  618. return status;
  619. }
  620. // check patch table
  621. status = validate_patch_table();
  622. if(SGX_SUCCESS != status)
  623. {
  624. return status;
  625. }
  626. return SGX_SUCCESS;
  627. }
  628. bool CLoader::is_ae(const enclave_css_t *enclave_css)
  629. {
  630. assert(NULL != enclave_css);
  631. if(INTEL_VENDOR_ID == enclave_css->header.module_vendor
  632. && AE_PRODUCT_ID == enclave_css->body.isv_prod_id)
  633. return true;
  634. return false;
  635. }
  636. int CLoader::load_enclave(SGXLaunchToken *lc, int debug, const metadata_t *metadata, le_prd_css_file_t *prd_css_file, sgx_misc_attribute_t *misc_attr)
  637. {
  638. int ret = SGX_SUCCESS;
  639. sgx_misc_attribute_t sgx_misc_attr;
  640. memset(&sgx_misc_attr, 0, sizeof(sgx_misc_attribute_t));
  641. m_metadata = metadata;
  642. ret = validate_metadata();
  643. if(SGX_SUCCESS != ret)
  644. {
  645. SE_TRACE(SE_TRACE_ERROR, "The metadata setting is not correct\n");
  646. return ret;
  647. }
  648. ret = get_enclave_creator()->get_misc_attr(&sgx_misc_attr, const_cast<metadata_t *>(m_metadata), lc, debug);
  649. if(SGX_SUCCESS != ret)
  650. {
  651. return ret;
  652. }
  653. ret = build_image(lc, &sgx_misc_attr.secs_attr, prd_css_file, &sgx_misc_attr);
  654. // Update misc_attr with secs.attr upon success.
  655. if(SGX_SUCCESS == ret)
  656. {
  657. if(misc_attr)
  658. {
  659. memcpy_s(misc_attr, sizeof(sgx_misc_attribute_t), &sgx_misc_attr, sizeof(sgx_misc_attribute_t));
  660. //When run here EINIT success, so SGX_FLAGS_INITTED should be set by ucode. uRTS align it with EINIT instruction.
  661. misc_attr->secs_attr.flags |= SGX_FLAGS_INITTED;
  662. }
  663. }
  664. return ret;
  665. }
  666. int CLoader::load_enclave_ex(SGXLaunchToken *lc, bool debug, const metadata_t *metadata, le_prd_css_file_t *prd_css_file, sgx_misc_attribute_t *misc_attr)
  667. {
  668. unsigned int ret = SGX_SUCCESS, map_conflict_count = 3;
  669. bool retry = true;
  670. while (retry)
  671. {
  672. ret = this->load_enclave(lc, debug, metadata, prd_css_file, misc_attr);
  673. switch(ret)
  674. {
  675. //If CreateEnclave failed due to power transition, we retry it.
  676. case SGX_ERROR_ENCLAVE_LOST: //caused by loading enclave while power transition occurs
  677. break;
  678. //If memroy map conflict occurs, we only retry 3 times.
  679. case SGX_ERROR_MEMORY_MAP_CONFLICT:
  680. if(0 == map_conflict_count)
  681. retry = false;
  682. else
  683. map_conflict_count--;
  684. break;
  685. //We don't re-load enclave due to other error code.
  686. default:
  687. retry = false;
  688. break;
  689. }
  690. }
  691. return ret;
  692. }
  693. int CLoader::destroy_enclave()
  694. {
  695. return get_enclave_creator()->destroy_enclave(ENCLAVE_ID_IOCTL, m_secs.size);
  696. }
  697. int CLoader::set_memory_protection()
  698. {
  699. uint64_t rva = 0;
  700. uint64_t len = 0;
  701. uint64_t last_section_end = 0;
  702. unsigned int i = 0;
  703. int ret = 0;
  704. //for sections
  705. std::vector<Section*> sections = m_parser.get_sections();
  706. for(i = 0; i < sections.size() ; i++)
  707. {
  708. //require the sec_info.rva be page aligned, we need handle the first page.
  709. //the first page;
  710. uint64_t offset = (sections[i]->get_rva() & (SE_PAGE_SIZE -1));
  711. uint64_t size = SE_PAGE_SIZE - offset;
  712. //the raw data may be smaller than the size, we get the min of them
  713. if(sections[i]->raw_data_size() < size)
  714. size = sections[i]->raw_data_size();
  715. len = SE_PAGE_SIZE;
  716. //if there is more pages, then calc the next paged aligned pages
  717. if((sections[i]->virtual_size() + offset) > SE_PAGE_SIZE)
  718. {
  719. uint64_t raw_data_size = sections[i]->raw_data_size() - size;
  720. //we need use (SE_PAGE_SIZE - offset), because (SE_PAGE_SIZE - offset) may larger than size
  721. uint64_t virtual_size = sections[i]->virtual_size() - (SE_PAGE_SIZE - offset);
  722. len += ROUND_TO_PAGE(raw_data_size);
  723. if(ROUND_TO_PAGE(virtual_size) > ROUND_TO_PAGE(raw_data_size))
  724. {
  725. len += ROUND_TO_PAGE(virtual_size) - ROUND_TO_PAGE(raw_data_size);
  726. }
  727. }
  728. rva = TRIM_TO_PAGE(sections[i]->get_rva()) + (uint64_t)m_start_addr;
  729. ret = mprotect((void*)rva, (size_t)len, (int)(sections[i]->get_si_flags()&SI_MASK_MEM_ATTRIBUTE));
  730. if(ret != 0)
  731. {
  732. SE_TRACE(SE_TRACE_WARNING, "section[%d]:mprotect(rva=%" PRIu64 ", len=%" PRIu64 ", flags=%" PRIu64 ") failed\n",
  733. i, rva, len, (sections[i]->get_si_flags()));
  734. return SGX_ERROR_UNEXPECTED;
  735. }
  736. //there is a gap between sections, need to set those to NONE access
  737. if(last_section_end != 0)
  738. {
  739. ret = mprotect((void*)last_section_end, (size_t)(rva - last_section_end), (int)(SI_FLAG_NONE & SI_MASK_MEM_ATTRIBUTE));
  740. if(ret != 0)
  741. {
  742. SE_TRACE(SE_TRACE_WARNING, "set protection for gap before section[%d]:mprotect(rva=%" PRIu64 ", len=%" PRIu64 ", flags=%" PRIu64 ") failed\n",
  743. i, last_section_end, rva - last_section_end, SI_FLAG_NONE);
  744. return SGX_ERROR_UNEXPECTED;
  745. }
  746. }
  747. last_section_end = rva + len;
  748. }
  749. ret = set_context_protection(GET_PTR(layout_t, m_metadata, m_metadata->dirs[DIR_LAYOUT].offset),
  750. GET_PTR(layout_t, m_metadata, m_metadata->dirs[DIR_LAYOUT].offset + m_metadata->dirs[DIR_LAYOUT].size),
  751. 0);
  752. if (SGX_SUCCESS != ret)
  753. {
  754. return ret;
  755. }
  756. return SGX_SUCCESS;
  757. }
  758. int CLoader::set_context_protection(layout_t *layout_start, layout_t *layout_end, uint64_t delta)
  759. {
  760. int ret = SGX_ERROR_UNEXPECTED;
  761. for(layout_t *layout = layout_start; layout < layout_end; layout++)
  762. {
  763. if (!IS_GROUP_ID(layout->group.id))
  764. {
  765. int prot = 0 ;
  766. if(layout->entry.si_flags == SI_FLAG_NONE)
  767. {
  768. prot = SI_FLAG_NONE & SI_MASK_MEM_ATTRIBUTE;
  769. }
  770. else
  771. {
  772. prot = SI_FLAGS_RW & SI_MASK_MEM_ATTRIBUTE;
  773. #ifndef SE_SIM
  774. //when a page is eremoved when loading, we should set this page to none access.
  775. //if this page is accessed, a sigbus exception will be raised.
  776. uint16_t attributes = layout->entry.attributes;
  777. if(attributes & PAGE_ATTR_EADD && attributes & PAGE_ATTR_EREMOVE)
  778. {
  779. if(attributes & PAGE_ATTR_EREMOVE)
  780. {
  781. prot = SI_FLAG_NONE & SI_MASK_MEM_ATTRIBUTE;
  782. }
  783. }
  784. #endif
  785. }
  786. ret = mprotect(GET_PTR(void, m_start_addr, layout->entry.rva + delta),
  787. (size_t)layout->entry.page_count << SE_PAGE_SHIFT,
  788. prot);
  789. if(ret != 0)
  790. {
  791. SE_TRACE(SE_TRACE_WARNING, "mprotect(rva=%" PRIu64 ", len=%" PRIu64 ", flags=%d) failed\n",
  792. (uint64_t)m_start_addr + layout->entry.rva + delta,
  793. (uint64_t)layout->entry.page_count << SE_PAGE_SHIFT,
  794. prot);
  795. return SGX_ERROR_UNEXPECTED;
  796. }
  797. }
  798. else
  799. {
  800. uint64_t step = 0;
  801. for(uint32_t j = 0; j < layout->group.load_times; j++)
  802. {
  803. step += layout->group.load_step;
  804. if(SGX_SUCCESS != (ret = set_context_protection(&layout[-layout->group.entry_count], layout, step)))
  805. {
  806. return ret;
  807. }
  808. }
  809. }
  810. }
  811. return SGX_SUCCESS;
  812. }