1 // SPDX-License-Identifier: BSD-2-Clause 2 /* 3 * Copyright (c) 2019, Linaro Limited 4 */ 5 6 #include <assert.h> 7 #include <ctype.h> 8 #include <elf32.h> 9 #include <elf64.h> 10 #include <elf_common.h> 11 #include <ldelf.h> 12 #include <pta_system.h> 13 #include <stdio.h> 14 #include <stdlib.h> 15 #include <string_ext.h> 16 #include <string.h> 17 #include <tee_api_types.h> 18 #include <tee_internal_api_extensions.h> 19 #include <user_ta_header.h> 20 #include <utee_syscalls.h> 21 #include <util.h> 22 23 #include "sys.h" 24 #include "ta_elf.h" 25 #include "unwind.h" 26 27 static vaddr_t ta_stack; 28 static vaddr_t ta_stack_size; 29 30 struct ta_elf_queue main_elf_queue = TAILQ_HEAD_INITIALIZER(main_elf_queue); 31 32 static struct ta_elf *queue_elf_helper(const TEE_UUID *uuid) 33 { 34 struct ta_elf *elf = calloc(1, sizeof(*elf)); 35 36 if (!elf) 37 return NULL; 38 39 TAILQ_INIT(&elf->segs); 40 41 elf->uuid = *uuid; 42 TAILQ_INSERT_TAIL(&main_elf_queue, elf, link); 43 return elf; 44 } 45 46 static struct ta_elf *queue_elf(const TEE_UUID *uuid) 47 { 48 struct ta_elf *elf = ta_elf_find_elf(uuid); 49 50 if (elf) 51 return NULL; 52 53 elf = queue_elf_helper(uuid); 54 if (!elf) 55 err(TEE_ERROR_OUT_OF_MEMORY, "queue_elf_helper"); 56 57 return elf; 58 } 59 60 struct ta_elf *ta_elf_find_elf(const TEE_UUID *uuid) 61 { 62 struct ta_elf *elf = NULL; 63 64 TAILQ_FOREACH(elf, &main_elf_queue, link) 65 if (!memcmp(uuid, &elf->uuid, sizeof(*uuid))) 66 return elf; 67 68 return NULL; 69 } 70 71 static TEE_Result e32_parse_ehdr(struct ta_elf *elf, Elf32_Ehdr *ehdr) 72 { 73 if (ehdr->e_ident[EI_VERSION] != EV_CURRENT || 74 ehdr->e_ident[EI_CLASS] != ELFCLASS32 || 75 ehdr->e_ident[EI_DATA] != ELFDATA2LSB || 76 ehdr->e_ident[EI_OSABI] != ELFOSABI_NONE || 77 ehdr->e_type != ET_DYN || ehdr->e_machine != EM_ARM || 78 (ehdr->e_flags & EF_ARM_ABIMASK) != EF_ARM_ABI_VERSION || 79 #ifndef CFG_WITH_VFP 80 (ehdr->e_flags & EF_ARM_ABI_FLOAT_HARD) || 81 #endif 82 ehdr->e_phentsize != sizeof(Elf32_Phdr) || 83 ehdr->e_shentsize != sizeof(Elf32_Shdr)) 84 return TEE_ERROR_BAD_FORMAT; 85 86 elf->is_32bit = true; 87 elf->e_entry = ehdr->e_entry; 88 elf->e_phoff = ehdr->e_phoff; 89 elf->e_shoff = ehdr->e_shoff; 90 elf->e_phnum = ehdr->e_phnum; 91 elf->e_shnum = ehdr->e_shnum; 92 elf->e_phentsize = ehdr->e_phentsize; 93 elf->e_shentsize = ehdr->e_shentsize; 94 95 return TEE_SUCCESS; 96 } 97 98 #ifdef ARM64 99 static TEE_Result e64_parse_ehdr(struct ta_elf *elf, Elf64_Ehdr *ehdr) 100 { 101 if (ehdr->e_ident[EI_VERSION] != EV_CURRENT || 102 ehdr->e_ident[EI_CLASS] != ELFCLASS64 || 103 ehdr->e_ident[EI_DATA] != ELFDATA2LSB || 104 ehdr->e_ident[EI_OSABI] != ELFOSABI_NONE || 105 ehdr->e_type != ET_DYN || ehdr->e_machine != EM_AARCH64 || 106 ehdr->e_flags || ehdr->e_phentsize != sizeof(Elf64_Phdr) || 107 ehdr->e_shentsize != sizeof(Elf64_Shdr)) 108 return TEE_ERROR_BAD_FORMAT; 109 110 111 elf->is_32bit = false; 112 elf->e_entry = ehdr->e_entry; 113 elf->e_phoff = ehdr->e_phoff; 114 elf->e_shoff = ehdr->e_shoff; 115 elf->e_phnum = ehdr->e_phnum; 116 elf->e_shnum = ehdr->e_shnum; 117 elf->e_phentsize = ehdr->e_phentsize; 118 elf->e_shentsize = ehdr->e_shentsize; 119 120 return TEE_SUCCESS; 121 } 122 #else /*ARM64*/ 123 static TEE_Result e64_parse_ehdr(struct ta_elf *elf __unused, 124 Elf64_Ehdr *ehdr __unused) 125 { 126 return TEE_ERROR_NOT_SUPPORTED; 127 } 128 #endif /*ARM64*/ 129 130 static void check_phdr_in_range(struct ta_elf *elf, unsigned int type, 131 vaddr_t addr, size_t memsz) 132 { 133 vaddr_t max_addr = 0; 134 135 if (ADD_OVERFLOW(addr, memsz, &max_addr)) 136 err(TEE_ERROR_BAD_FORMAT, "Program header %#x overflow", type); 137 138 /* 139 * elf->load_addr and elf->max_addr are both using the 140 * final virtual addresses, while this program header is 141 * relative to 0. 142 */ 143 if (max_addr > elf->max_addr - elf->load_addr) 144 err(TEE_ERROR_BAD_FORMAT, "Program header %#x out of bounds", 145 type); 146 } 147 148 static void read_dyn(struct ta_elf *elf, vaddr_t addr, 149 size_t idx, unsigned int *tag, size_t *val) 150 { 151 if (elf->is_32bit) { 152 Elf32_Dyn *dyn = (Elf32_Dyn *)(addr + elf->load_addr); 153 154 *tag = dyn[idx].d_tag; 155 *val = dyn[idx].d_un.d_val; 156 } else { 157 Elf64_Dyn *dyn = (Elf64_Dyn *)(addr + elf->load_addr); 158 159 *tag = dyn[idx].d_tag; 160 *val = dyn[idx].d_un.d_val; 161 } 162 } 163 164 static void save_hashtab_from_segment(struct ta_elf *elf, unsigned int type, 165 vaddr_t addr, size_t memsz) 166 { 167 size_t dyn_entsize = 0; 168 size_t num_dyns = 0; 169 size_t n = 0; 170 unsigned int tag = 0; 171 size_t val = 0; 172 173 if (type != PT_DYNAMIC) 174 return; 175 176 check_phdr_in_range(elf, type, addr, memsz); 177 178 if (elf->is_32bit) 179 dyn_entsize = sizeof(Elf32_Dyn); 180 else 181 dyn_entsize = sizeof(Elf64_Dyn); 182 183 assert(!(memsz % dyn_entsize)); 184 num_dyns = memsz / dyn_entsize; 185 186 for (n = 0; n < num_dyns; n++) { 187 read_dyn(elf, addr, n, &tag, &val); 188 if (tag == DT_HASH) { 189 elf->hashtab = (void *)(val + elf->load_addr); 190 break; 191 } 192 } 193 } 194 195 static void check_range(struct ta_elf *elf, const char *name, const void *ptr, 196 size_t sz) 197 { 198 size_t max_addr = 0; 199 200 if ((vaddr_t)ptr < elf->load_addr) 201 err(TEE_ERROR_GENERIC, "%s %p out of range", name, ptr); 202 203 if (ADD_OVERFLOW((vaddr_t)ptr, sz, &max_addr)) 204 err(TEE_ERROR_GENERIC, "%s range overflow", name); 205 206 if (max_addr > elf->max_addr) 207 err(TEE_ERROR_GENERIC, 208 "%s %p..%#zx out of range", name, ptr, max_addr); 209 } 210 211 static void check_hashtab(struct ta_elf *elf, void *ptr, size_t num_buckets, 212 size_t num_chains) 213 { 214 /* 215 * Starting from 2 as the first two words are mandatory and hold 216 * num_buckets and num_chains. So this function is called twice, 217 * first to see that there's indeed room for num_buckets and 218 * num_chains and then to see that all of it fits. 219 * See http://www.sco.com/developers/gabi/latest/ch5.dynamic.html#hash 220 */ 221 size_t num_words = 2; 222 size_t sz = 0; 223 224 if (!ALIGNMENT_IS_OK(ptr, uint32_t)) 225 err(TEE_ERROR_GENERIC, "Bad alignment of hashtab %p", ptr); 226 227 if (ADD_OVERFLOW(num_words, num_buckets, &num_words) || 228 ADD_OVERFLOW(num_words, num_chains, &num_words) || 229 MUL_OVERFLOW(num_words, sizeof(uint32_t), &sz)) 230 err(TEE_ERROR_GENERIC, "Hashtab overflow"); 231 232 check_range(elf, "Hashtab", ptr, sz); 233 } 234 235 static void save_hashtab(struct ta_elf *elf) 236 { 237 uint32_t *hashtab = NULL; 238 size_t n = 0; 239 240 if (elf->is_32bit) { 241 Elf32_Phdr *phdr = elf->phdr; 242 243 for (n = 0; n < elf->e_phnum; n++) 244 save_hashtab_from_segment(elf, phdr[n].p_type, 245 phdr[n].p_vaddr, 246 phdr[n].p_memsz); 247 } else { 248 Elf64_Phdr *phdr = elf->phdr; 249 250 for (n = 0; n < elf->e_phnum; n++) 251 save_hashtab_from_segment(elf, phdr[n].p_type, 252 phdr[n].p_vaddr, 253 phdr[n].p_memsz); 254 } 255 256 check_hashtab(elf, elf->hashtab, 0, 0); 257 hashtab = elf->hashtab; 258 check_hashtab(elf, elf->hashtab, hashtab[0], hashtab[1]); 259 } 260 261 static void e32_save_symtab(struct ta_elf *elf, size_t tab_idx) 262 { 263 Elf32_Shdr *shdr = elf->shdr; 264 size_t str_idx = shdr[tab_idx].sh_link; 265 266 elf->dynsymtab = (void *)(shdr[tab_idx].sh_addr + elf->load_addr); 267 if (!ALIGNMENT_IS_OK(elf->dynsymtab, Elf32_Sym)) 268 err(TEE_ERROR_GENERIC, "Bad alignment of dynsymtab %p", 269 elf->dynsymtab); 270 check_range(elf, "Dynsymtab", elf->dynsymtab, shdr[tab_idx].sh_size); 271 272 if (shdr[tab_idx].sh_size % sizeof(Elf32_Sym)) 273 err(TEE_ERROR_GENERIC, 274 "Size of dynsymtab not an even multiple of Elf32_Sym"); 275 elf->num_dynsyms = shdr[tab_idx].sh_size / sizeof(Elf32_Sym); 276 277 if (str_idx >= elf->e_shnum) 278 err(TEE_ERROR_GENERIC, "Dynstr section index out of range"); 279 elf->dynstr = (void *)(shdr[str_idx].sh_addr + elf->load_addr); 280 check_range(elf, "Dynstr", elf->dynstr, shdr[str_idx].sh_size); 281 282 elf->dynstr_size = shdr[str_idx].sh_size; 283 } 284 285 static void e64_save_symtab(struct ta_elf *elf, size_t tab_idx) 286 { 287 Elf64_Shdr *shdr = elf->shdr; 288 size_t str_idx = shdr[tab_idx].sh_link; 289 290 elf->dynsymtab = (void *)(vaddr_t)(shdr[tab_idx].sh_addr + 291 elf->load_addr); 292 293 if (!ALIGNMENT_IS_OK(elf->dynsymtab, Elf64_Sym)) 294 err(TEE_ERROR_GENERIC, "Bad alignment of dynsymtab %p", 295 elf->dynsymtab); 296 check_range(elf, "Dynsymtab", elf->dynsymtab, shdr[tab_idx].sh_size); 297 298 if (shdr[tab_idx].sh_size % sizeof(Elf64_Sym)) 299 err(TEE_ERROR_GENERIC, 300 "Size of dynsymtab not an even multiple of Elf64_Sym"); 301 elf->num_dynsyms = shdr[tab_idx].sh_size / sizeof(Elf64_Sym); 302 303 if (str_idx >= elf->e_shnum) 304 err(TEE_ERROR_GENERIC, "Dynstr section index out of range"); 305 elf->dynstr = (void *)(vaddr_t)(shdr[str_idx].sh_addr + elf->load_addr); 306 check_range(elf, "Dynstr", elf->dynstr, shdr[str_idx].sh_size); 307 308 elf->dynstr_size = shdr[str_idx].sh_size; 309 } 310 311 static void save_symtab(struct ta_elf *elf) 312 { 313 size_t n = 0; 314 315 if (elf->is_32bit) { 316 Elf32_Shdr *shdr = elf->shdr; 317 318 for (n = 0; n < elf->e_shnum; n++) { 319 if (shdr[n].sh_type == SHT_DYNSYM) { 320 e32_save_symtab(elf, n); 321 break; 322 } 323 } 324 } else { 325 Elf64_Shdr *shdr = elf->shdr; 326 327 for (n = 0; n < elf->e_shnum; n++) { 328 if (shdr[n].sh_type == SHT_DYNSYM) { 329 e64_save_symtab(elf, n); 330 break; 331 } 332 } 333 334 } 335 336 save_hashtab(elf); 337 } 338 339 static void init_elf(struct ta_elf *elf) 340 { 341 TEE_Result res = TEE_SUCCESS; 342 vaddr_t va = 0; 343 uint32_t flags = PTA_SYSTEM_MAP_FLAG_SHAREABLE; 344 size_t sz = 0; 345 346 res = sys_open_ta_bin(&elf->uuid, &elf->handle); 347 if (res) 348 err(res, "sys_open_ta_bin(%pUl)", (void *)&elf->uuid); 349 350 /* 351 * Map it read-only executable when we're loading a library where 352 * the ELF header is included in a load segment. 353 */ 354 if (!elf->is_main) 355 flags |= PTA_SYSTEM_MAP_FLAG_EXECUTABLE; 356 res = sys_map_ta_bin(&va, SMALL_PAGE_SIZE, flags, elf->handle, 0, 0, 0); 357 if (res) 358 err(res, "sys_map_ta_bin"); 359 elf->ehdr_addr = va; 360 if (!elf->is_main) { 361 elf->load_addr = va; 362 elf->max_addr = va + SMALL_PAGE_SIZE; 363 elf->max_offs = SMALL_PAGE_SIZE; 364 } 365 366 if (!IS_ELF(*(Elf32_Ehdr *)va)) 367 err(TEE_ERROR_BAD_FORMAT, "TA is not an ELF"); 368 369 res = e32_parse_ehdr(elf, (void *)va); 370 if (res == TEE_ERROR_BAD_FORMAT) 371 res = e64_parse_ehdr(elf, (void *)va); 372 if (res) 373 err(res, "Cannot parse ELF"); 374 375 if (MUL_OVERFLOW(elf->e_phnum, elf->e_phentsize, &sz) || 376 ADD_OVERFLOW(sz, elf->e_phoff, &sz)) 377 err(TEE_ERROR_BAD_FORMAT, "Program headers size overflow"); 378 379 if (sz > SMALL_PAGE_SIZE) 380 err(TEE_ERROR_NOT_SUPPORTED, "Cannot read program headers"); 381 382 elf->phdr = (void *)(va + elf->e_phoff); 383 } 384 385 static size_t roundup(size_t v) 386 { 387 return ROUNDUP(v, SMALL_PAGE_SIZE); 388 } 389 390 static size_t rounddown(size_t v) 391 { 392 return ROUNDDOWN(v, SMALL_PAGE_SIZE); 393 } 394 395 static void add_segment(struct ta_elf *elf, size_t offset, size_t vaddr, 396 size_t filesz, size_t memsz, size_t flags, size_t align) 397 { 398 struct segment *seg = calloc(1, sizeof(*seg)); 399 400 if (!seg) 401 err(TEE_ERROR_OUT_OF_MEMORY, "calloc"); 402 403 seg->offset = offset; 404 seg->vaddr = vaddr; 405 seg->filesz = filesz; 406 seg->memsz = memsz; 407 seg->flags = flags; 408 seg->align = align; 409 410 TAILQ_INSERT_TAIL(&elf->segs, seg, link); 411 } 412 413 static void parse_load_segments(struct ta_elf *elf) 414 { 415 size_t n = 0; 416 417 if (elf->is_32bit) { 418 Elf32_Phdr *phdr = elf->phdr; 419 420 for (n = 0; n < elf->e_phnum; n++) 421 if (phdr[n].p_type == PT_LOAD) { 422 add_segment(elf, phdr[n].p_offset, 423 phdr[n].p_vaddr, phdr[n].p_filesz, 424 phdr[n].p_memsz, phdr[n].p_flags, 425 phdr[n].p_align); 426 } else if (phdr[n].p_type == PT_ARM_EXIDX) { 427 elf->exidx_start = phdr[n].p_vaddr; 428 elf->exidx_size = phdr[n].p_filesz; 429 } 430 } else { 431 Elf64_Phdr *phdr = elf->phdr; 432 433 for (n = 0; n < elf->e_phnum; n++) 434 if (phdr[n].p_type == PT_LOAD) 435 add_segment(elf, phdr[n].p_offset, 436 phdr[n].p_vaddr, phdr[n].p_filesz, 437 phdr[n].p_memsz, phdr[n].p_flags, 438 phdr[n].p_align); 439 } 440 } 441 442 static void copy_remapped_to(struct ta_elf *elf, const struct segment *seg) 443 { 444 uint8_t *dst = (void *)(seg->vaddr + elf->load_addr); 445 size_t n = 0; 446 size_t offs = seg->offset; 447 size_t num_bytes = seg->filesz; 448 449 if (offs < elf->max_offs) { 450 n = MIN(elf->max_offs - offs, num_bytes); 451 memcpy(dst, (void *)(elf->max_addr + offs - elf->max_offs), n); 452 dst += n; 453 offs += n; 454 num_bytes -= n; 455 } 456 457 if (num_bytes) { 458 TEE_Result res = sys_copy_from_ta_bin(dst, num_bytes, 459 elf->handle, offs); 460 461 if (res) 462 err(res, "sys_copy_from_ta_bin"); 463 elf->max_offs += offs; 464 } 465 } 466 467 static void adjust_segments(struct ta_elf *elf) 468 { 469 struct segment *seg = NULL; 470 struct segment *prev_seg = NULL; 471 size_t prev_end_addr = 0; 472 size_t align = 0; 473 size_t mask = 0; 474 475 /* Sanity check */ 476 TAILQ_FOREACH(seg, &elf->segs, link) { 477 size_t dummy __maybe_unused = 0; 478 479 assert(seg->align >= SMALL_PAGE_SIZE); 480 assert(!ADD_OVERFLOW(seg->vaddr, seg->memsz, &dummy)); 481 assert(seg->filesz <= seg->memsz); 482 assert((seg->offset & SMALL_PAGE_MASK) == 483 (seg->vaddr & SMALL_PAGE_MASK)); 484 485 prev_seg = TAILQ_PREV(seg, segment_head, link); 486 if (prev_seg) { 487 assert(seg->vaddr >= prev_seg->vaddr + prev_seg->memsz); 488 assert(seg->offset >= 489 prev_seg->offset + prev_seg->filesz); 490 } 491 if (!align) 492 align = seg->align; 493 assert(align == seg->align); 494 } 495 496 mask = align - 1; 497 498 seg = TAILQ_FIRST(&elf->segs); 499 if (seg) 500 seg = TAILQ_NEXT(seg, link); 501 while (seg) { 502 prev_seg = TAILQ_PREV(seg, segment_head, link); 503 prev_end_addr = prev_seg->vaddr + prev_seg->memsz; 504 505 /* 506 * This segment may overlap with the last "page" in the 507 * previous segment in two different ways: 508 * 1. Virtual address (and offset) overlaps => 509 * Permissions needs to be merged. The offset must have 510 * the SMALL_PAGE_MASK bits set as vaddr and offset must 511 * add up with prevsion segment. 512 * 513 * 2. Only offset overlaps => 514 * The same page in the ELF is mapped at two different 515 * virtual addresses. As a limitation this segment must 516 * be mapped as writeable. 517 */ 518 519 /* Case 1. */ 520 if (rounddown(seg->vaddr) < prev_end_addr) { 521 assert((seg->vaddr & mask) == (seg->offset & mask)); 522 assert(prev_seg->memsz == prev_seg->filesz); 523 524 /* 525 * Merge the segments and their permissions. 526 * Note that the may be a small hole between the 527 * two sections. 528 */ 529 prev_seg->filesz = seg->vaddr + seg->filesz - 530 prev_seg->vaddr; 531 prev_seg->memsz = seg->vaddr + seg->memsz - 532 prev_seg->vaddr; 533 prev_seg->flags |= seg->flags; 534 535 TAILQ_REMOVE(&elf->segs, seg, link); 536 free(seg); 537 seg = TAILQ_NEXT(prev_seg, link); 538 continue; 539 } 540 541 /* Case 2. */ 542 if ((seg->offset & mask) && 543 rounddown(seg->offset) < 544 (prev_seg->offset + prev_seg->filesz)) { 545 546 assert(seg->flags & PF_W); 547 seg->remapped_writeable = true; 548 } 549 550 /* 551 * No overlap, but we may need to align address, offset and 552 * size. 553 */ 554 seg->filesz += seg->vaddr - rounddown(seg->vaddr); 555 seg->memsz += seg->vaddr - rounddown(seg->vaddr); 556 seg->vaddr = rounddown(seg->vaddr); 557 seg->offset = rounddown(seg->offset); 558 seg = TAILQ_NEXT(seg, link); 559 } 560 561 } 562 563 static void populate_segments_legacy(struct ta_elf *elf) 564 { 565 TEE_Result res = TEE_SUCCESS; 566 struct segment *seg = NULL; 567 vaddr_t va = 0; 568 569 assert(elf->is_legacy); 570 TAILQ_FOREACH(seg, &elf->segs, link) { 571 struct segment *last_seg = TAILQ_LAST(&elf->segs, segment_head); 572 size_t pad_end = roundup(last_seg->vaddr + last_seg->memsz - 573 seg->vaddr - seg->memsz); 574 size_t num_bytes = roundup(seg->memsz); 575 576 if (!elf->load_addr) 577 va = 0; 578 else 579 va = seg->vaddr + elf->load_addr; 580 581 582 if (!(seg->flags & PF_R)) 583 err(TEE_ERROR_NOT_SUPPORTED, 584 "Segment must be readable"); 585 586 res = sys_map_zi(num_bytes, 0, &va, 0, pad_end); 587 if (res) 588 err(res, "sys_map_zi"); 589 res = sys_copy_from_ta_bin((void *)va, seg->filesz, 590 elf->handle, seg->offset); 591 if (res) 592 err(res, "sys_copy_from_ta_bin"); 593 594 if (!elf->load_addr) 595 elf->load_addr = va; 596 elf->max_addr = va + num_bytes; 597 elf->max_offs = seg->offset + seg->filesz; 598 } 599 } 600 601 static size_t get_pad_begin(void) 602 { 603 #ifdef CFG_TA_ASLR 604 size_t min = CFG_TA_ASLR_MIN_OFFSET_PAGES; 605 size_t max = CFG_TA_ASLR_MAX_OFFSET_PAGES; 606 TEE_Result res = TEE_SUCCESS; 607 uint32_t rnd32 = 0; 608 size_t rnd = 0; 609 610 COMPILE_TIME_ASSERT(CFG_TA_ASLR_MIN_OFFSET_PAGES < 611 CFG_TA_ASLR_MAX_OFFSET_PAGES); 612 if (max > min) { 613 res = utee_cryp_random_number_generate(&rnd32, sizeof(rnd32)); 614 if (res) { 615 DMSG("Random read failed: %#"PRIx32, res); 616 return min * SMALL_PAGE_SIZE; 617 } 618 rnd = rnd32 % (max - min); 619 } 620 621 return (min + rnd) * SMALL_PAGE_SIZE; 622 #else /*!CFG_TA_ASLR*/ 623 return 0; 624 #endif /*!CFG_TA_ASLR*/ 625 } 626 627 static void populate_segments(struct ta_elf *elf) 628 { 629 TEE_Result res = TEE_SUCCESS; 630 struct segment *seg = NULL; 631 vaddr_t va = 0; 632 size_t pad_begin = 0; 633 634 assert(!elf->is_legacy); 635 TAILQ_FOREACH(seg, &elf->segs, link) { 636 struct segment *last_seg = TAILQ_LAST(&elf->segs, segment_head); 637 size_t pad_end = roundup(last_seg->vaddr + last_seg->memsz - 638 seg->vaddr - seg->memsz); 639 640 if (seg->remapped_writeable) { 641 size_t num_bytes = roundup(seg->vaddr + seg->memsz) - 642 rounddown(seg->vaddr); 643 644 assert(elf->load_addr); 645 va = rounddown(elf->load_addr + seg->vaddr); 646 assert(va >= elf->max_addr); 647 res = sys_map_zi(num_bytes, 0, &va, 0, pad_end); 648 if (res) 649 err(res, "sys_map_zi"); 650 651 copy_remapped_to(elf, seg); 652 elf->max_addr = va + num_bytes; 653 } else { 654 uint32_t flags = 0; 655 size_t filesz = seg->filesz; 656 size_t memsz = seg->memsz; 657 size_t offset = seg->offset; 658 size_t vaddr = seg->vaddr; 659 660 if (offset < elf->max_offs) { 661 /* 662 * We're in a load segment which overlaps 663 * with (or is covered by) the first page 664 * of a shared library. 665 */ 666 if (vaddr + filesz < SMALL_PAGE_SIZE) { 667 size_t num_bytes = 0; 668 669 /* 670 * If this segment is completely 671 * covered, take next. 672 */ 673 if (vaddr + memsz <= SMALL_PAGE_SIZE) 674 continue; 675 676 /* 677 * All data of the segment is 678 * loaded, but we need to zero 679 * extend it. 680 */ 681 va = elf->max_addr; 682 num_bytes = roundup(vaddr + memsz) - 683 roundup(vaddr) - 684 SMALL_PAGE_SIZE; 685 assert(num_bytes); 686 res = sys_map_zi(num_bytes, 0, &va, 0, 687 0); 688 if (res) 689 err(res, "sys_map_zi"); 690 elf->max_addr = roundup(va + num_bytes); 691 continue; 692 } 693 694 /* Partial overlap, remove the first page. */ 695 vaddr += SMALL_PAGE_SIZE; 696 filesz -= SMALL_PAGE_SIZE; 697 memsz -= SMALL_PAGE_SIZE; 698 offset += SMALL_PAGE_SIZE; 699 } 700 701 if (!elf->load_addr) { 702 va = 0; 703 pad_begin = get_pad_begin(); 704 /* 705 * If mapping with pad_begin fails we'll 706 * retry without pad_begin, effectively 707 * disabling ASLR for the current ELF file. 708 */ 709 } else { 710 va = vaddr + elf->load_addr; 711 pad_begin = 0; 712 } 713 714 if (seg->flags & PF_W) 715 flags |= PTA_SYSTEM_MAP_FLAG_WRITEABLE; 716 else 717 flags |= PTA_SYSTEM_MAP_FLAG_SHAREABLE; 718 if (seg->flags & PF_X) 719 flags |= PTA_SYSTEM_MAP_FLAG_EXECUTABLE; 720 if (!(seg->flags & PF_R)) 721 err(TEE_ERROR_NOT_SUPPORTED, 722 "Segment must be readable"); 723 if (flags & PTA_SYSTEM_MAP_FLAG_WRITEABLE) { 724 res = sys_map_zi(memsz, 0, &va, pad_begin, 725 pad_end); 726 if (pad_begin && res == TEE_ERROR_OUT_OF_MEMORY) 727 res = sys_map_zi(memsz, 0, &va, 0, 728 pad_end); 729 if (res) 730 err(res, "sys_map_zi"); 731 res = sys_copy_from_ta_bin((void *)va, filesz, 732 elf->handle, offset); 733 if (res) 734 err(res, "sys_copy_from_ta_bin"); 735 } else { 736 res = sys_map_ta_bin(&va, filesz, flags, 737 elf->handle, offset, 738 pad_begin, pad_end); 739 if (pad_begin && res == TEE_ERROR_OUT_OF_MEMORY) 740 res = sys_map_ta_bin(&va, filesz, flags, 741 elf->handle, 742 offset, 0, 743 pad_end); 744 if (res) 745 err(res, "sys_map_ta_bin"); 746 } 747 748 if (!elf->load_addr) 749 elf->load_addr = va; 750 elf->max_addr = roundup(va + filesz); 751 elf->max_offs += filesz; 752 } 753 } 754 } 755 756 static void map_segments(struct ta_elf *elf) 757 { 758 TEE_Result res = TEE_SUCCESS; 759 760 parse_load_segments(elf); 761 adjust_segments(elf); 762 if (TAILQ_FIRST(&elf->segs)->offset < SMALL_PAGE_SIZE) { 763 vaddr_t va = 0; 764 size_t sz = elf->max_addr - elf->load_addr; 765 struct segment *seg = TAILQ_LAST(&elf->segs, segment_head); 766 size_t pad_begin = get_pad_begin(); 767 768 /* 769 * We're loading a library, if not other parts of the code 770 * need to be updated too. 771 */ 772 assert(!elf->is_main); 773 774 /* 775 * Now that we know how much virtual memory is needed move 776 * the already mapped part to a location which can 777 * accommodate us. 778 */ 779 res = sys_remap(elf->load_addr, &va, sz, pad_begin, 780 roundup(seg->vaddr + seg->memsz)); 781 if (res == TEE_ERROR_OUT_OF_MEMORY) 782 res = sys_remap(elf->load_addr, &va, sz, 0, 783 roundup(seg->vaddr + seg->memsz)); 784 if (res) 785 err(res, "sys_remap"); 786 elf->ehdr_addr = va; 787 elf->load_addr = va; 788 elf->max_addr = va + sz; 789 elf->phdr = (void *)(va + elf->e_phoff); 790 } 791 } 792 793 static void add_deps_from_segment(struct ta_elf *elf, unsigned int type, 794 vaddr_t addr, size_t memsz) 795 { 796 size_t dyn_entsize = 0; 797 size_t num_dyns = 0; 798 size_t n = 0; 799 unsigned int tag = 0; 800 size_t val = 0; 801 TEE_UUID uuid = { }; 802 char *str_tab = NULL; 803 804 if (type != PT_DYNAMIC) 805 return; 806 807 check_phdr_in_range(elf, type, addr, memsz); 808 809 if (elf->is_32bit) 810 dyn_entsize = sizeof(Elf32_Dyn); 811 else 812 dyn_entsize = sizeof(Elf64_Dyn); 813 814 assert(!(memsz % dyn_entsize)); 815 num_dyns = memsz / dyn_entsize; 816 817 for (n = 0; n < num_dyns; n++) { 818 read_dyn(elf, addr, n, &tag, &val); 819 if (tag == DT_STRTAB) { 820 str_tab = (char *)(val + elf->load_addr); 821 break; 822 } 823 } 824 825 for (n = 0; n < num_dyns; n++) { 826 read_dyn(elf, addr, n, &tag, &val); 827 if (tag != DT_NEEDED) 828 continue; 829 tee_uuid_from_str(&uuid, str_tab + val); 830 queue_elf(&uuid); 831 } 832 } 833 834 static void add_dependencies(struct ta_elf *elf) 835 { 836 size_t n = 0; 837 838 if (elf->is_32bit) { 839 Elf32_Phdr *phdr = elf->phdr; 840 841 for (n = 0; n < elf->e_phnum; n++) 842 add_deps_from_segment(elf, phdr[n].p_type, 843 phdr[n].p_vaddr, phdr[n].p_memsz); 844 } else { 845 Elf64_Phdr *phdr = elf->phdr; 846 847 for (n = 0; n < elf->e_phnum; n++) 848 add_deps_from_segment(elf, phdr[n].p_type, 849 phdr[n].p_vaddr, phdr[n].p_memsz); 850 } 851 } 852 853 static void copy_section_headers(struct ta_elf *elf) 854 { 855 TEE_Result res = TEE_SUCCESS; 856 size_t sz = 0; 857 size_t offs = 0; 858 859 if (MUL_OVERFLOW(elf->e_shnum, elf->e_shentsize, &sz)) 860 err(TEE_ERROR_BAD_FORMAT, "Shdr size overflow"); 861 862 elf->shdr = malloc(sz); 863 if (!elf->shdr) 864 err(TEE_ERROR_OUT_OF_MEMORY, "malloc"); 865 866 /* 867 * We're assuming that section headers comes after the load segments, 868 * but if it's a very small dynamically linked library the section 869 * headers can still end up (partially?) in the first mapped page. 870 */ 871 if (elf->e_shoff < SMALL_PAGE_SIZE) { 872 assert(!elf->is_main); 873 offs = MIN(SMALL_PAGE_SIZE - elf->e_shoff, sz); 874 memcpy(elf->shdr, (void *)(elf->load_addr + elf->e_shoff), 875 offs); 876 } 877 878 if (offs < sz) { 879 res = sys_copy_from_ta_bin((uint8_t *)elf->shdr + offs, 880 sz - offs, elf->handle, 881 elf->e_shoff + offs); 882 if (res) 883 err(res, "sys_copy_from_ta_bin"); 884 } 885 } 886 887 static void close_handle(struct ta_elf *elf) 888 { 889 TEE_Result res = sys_close_ta_bin(elf->handle); 890 891 if (res) 892 err(res, "sys_close_ta_bin"); 893 elf->handle = -1; 894 } 895 896 static void clean_elf_load_main(struct ta_elf *elf) 897 { 898 TEE_Result res = TEE_SUCCESS; 899 900 /* 901 * Clean up from last attempt to load 902 */ 903 res = sys_unmap(elf->ehdr_addr, SMALL_PAGE_SIZE); 904 if (res) 905 err(res, "sys_unmap"); 906 907 while (!TAILQ_EMPTY(&elf->segs)) { 908 struct segment *seg = TAILQ_FIRST(&elf->segs); 909 vaddr_t va = 0; 910 size_t num_bytes = 0; 911 912 va = rounddown(elf->load_addr + seg->vaddr); 913 if (seg->remapped_writeable) 914 num_bytes = roundup(seg->vaddr + seg->memsz) - 915 rounddown(seg->vaddr); 916 else 917 num_bytes = seg->memsz; 918 919 res = sys_unmap(va, num_bytes); 920 if (res) 921 err(res, "sys_unmap"); 922 923 TAILQ_REMOVE(&elf->segs, seg, link); 924 free(seg); 925 } 926 927 free(elf->shdr); 928 memset(&elf->is_32bit, 0, 929 (vaddr_t)&elf->uuid - (vaddr_t)&elf->is_32bit); 930 931 TAILQ_INIT(&elf->segs); 932 } 933 934 static void load_main(struct ta_elf *elf) 935 { 936 init_elf(elf); 937 map_segments(elf); 938 populate_segments(elf); 939 add_dependencies(elf); 940 copy_section_headers(elf); 941 save_symtab(elf); 942 close_handle(elf); 943 944 elf->head = (struct ta_head *)elf->load_addr; 945 if (elf->head->depr_entry != UINT64_MAX) { 946 /* 947 * Legacy TAs sets their entry point in ta_head. For 948 * non-legacy TAs the entry point of the ELF is set instead 949 * and leaving the ta_head entry point set to UINT64_MAX to 950 * indicate that it's not used. 951 * 952 * NB, everything before the commit a73b5878c89d ("Replace 953 * ta_head.entry with elf entry") is considered legacy TAs 954 * for ldelf. 955 * 956 * Legacy TAs cannot be mapped with shared memory segments 957 * so restart the mapping if it turned out we're loading a 958 * legacy TA. 959 */ 960 961 DMSG("Reloading TA %pUl as legacy TA", (void *)&elf->uuid); 962 clean_elf_load_main(elf); 963 elf->is_legacy = true; 964 init_elf(elf); 965 map_segments(elf); 966 populate_segments_legacy(elf); 967 add_dependencies(elf); 968 copy_section_headers(elf); 969 save_symtab(elf); 970 close_handle(elf); 971 elf->head = (struct ta_head *)elf->load_addr; 972 /* 973 * Check that the TA is still a legacy TA, if it isn't give 974 * up now since we're likely under attack. 975 */ 976 if (elf->head->depr_entry == UINT64_MAX) 977 err(TEE_ERROR_GENERIC, 978 "TA %pUl was changed on disk to non-legacy", 979 (void *)&elf->uuid); 980 } 981 982 } 983 984 void ta_elf_load_main(const TEE_UUID *uuid, uint32_t *is_32bit, uint64_t *sp, 985 uint32_t *ta_flags) 986 { 987 struct ta_elf *elf = queue_elf(uuid); 988 vaddr_t va = 0; 989 TEE_Result res = TEE_SUCCESS; 990 991 assert(elf); 992 elf->is_main = true; 993 994 load_main(elf); 995 996 *is_32bit = elf->is_32bit; 997 res = sys_map_zi(elf->head->stack_size, 0, &va, 0, 0); 998 if (res) 999 err(res, "sys_map_zi stack"); 1000 1001 if (elf->head->flags & ~TA_FLAGS_MASK) 1002 err(TEE_ERROR_BAD_FORMAT, "Invalid TA flags(s) %#"PRIx32, 1003 elf->head->flags & ~TA_FLAGS_MASK); 1004 1005 *ta_flags = elf->head->flags; 1006 *sp = va + elf->head->stack_size; 1007 ta_stack = va; 1008 ta_stack_size = elf->head->stack_size; 1009 } 1010 1011 void ta_elf_finalize_load_main(uint64_t *entry) 1012 { 1013 struct ta_elf *elf = TAILQ_FIRST(&main_elf_queue); 1014 TEE_Result res = TEE_SUCCESS; 1015 1016 assert(elf->is_main); 1017 1018 res = ta_elf_set_init_fini_info(elf->is_32bit); 1019 if (res) 1020 err(res, "ta_elf_set_init_fini_info"); 1021 1022 if (elf->is_legacy) 1023 *entry = elf->head->depr_entry; 1024 else 1025 *entry = elf->e_entry + elf->load_addr; 1026 } 1027 1028 1029 void ta_elf_load_dependency(struct ta_elf *elf, bool is_32bit) 1030 { 1031 if (elf->is_main) 1032 return; 1033 1034 init_elf(elf); 1035 if (elf->is_32bit != is_32bit) 1036 err(TEE_ERROR_BAD_FORMAT, "ELF %pUl is %sbit (expected %sbit)", 1037 (void *)&elf->uuid, elf->is_32bit ? "32" : "64", 1038 is_32bit ? "32" : "64"); 1039 1040 map_segments(elf); 1041 populate_segments(elf); 1042 add_dependencies(elf); 1043 copy_section_headers(elf); 1044 save_symtab(elf); 1045 close_handle(elf); 1046 } 1047 1048 void ta_elf_finalize_mappings(struct ta_elf *elf) 1049 { 1050 TEE_Result res = TEE_SUCCESS; 1051 struct segment *seg = NULL; 1052 1053 if (!elf->is_legacy) 1054 return; 1055 1056 TAILQ_FOREACH(seg, &elf->segs, link) { 1057 vaddr_t va = elf->load_addr + seg->vaddr; 1058 uint32_t flags = 0; 1059 1060 if (seg->flags & PF_W) 1061 flags |= PTA_SYSTEM_MAP_FLAG_WRITEABLE; 1062 if (seg->flags & PF_X) 1063 flags |= PTA_SYSTEM_MAP_FLAG_EXECUTABLE; 1064 1065 res = sys_set_prot(va, seg->memsz, flags); 1066 if (res) 1067 err(res, "sys_set_prot"); 1068 } 1069 } 1070 1071 static void __printf(3, 4) print_wrapper(void *pctx, print_func_t print_func, 1072 const char *fmt, ...) 1073 { 1074 va_list ap; 1075 1076 va_start(ap, fmt); 1077 print_func(pctx, fmt, ap); 1078 va_end(ap); 1079 } 1080 1081 static void print_seg(void *pctx, print_func_t print_func, 1082 size_t idx __maybe_unused, int elf_idx __maybe_unused, 1083 vaddr_t va __maybe_unused, paddr_t pa __maybe_unused, 1084 size_t sz __maybe_unused, uint32_t flags) 1085 { 1086 int width __maybe_unused = 8; 1087 char desc[14] __maybe_unused = ""; 1088 char flags_str[] __maybe_unused = "----"; 1089 1090 if (elf_idx > -1) { 1091 snprintf(desc, sizeof(desc), " [%d]", elf_idx); 1092 } else { 1093 if (flags & DUMP_MAP_EPHEM) 1094 snprintf(desc, sizeof(desc), " (param)"); 1095 if (flags & DUMP_MAP_LDELF) 1096 snprintf(desc, sizeof(desc), " (ldelf)"); 1097 if (va == ta_stack) 1098 snprintf(desc, sizeof(desc), " (stack)"); 1099 } 1100 1101 if (flags & DUMP_MAP_READ) 1102 flags_str[0] = 'r'; 1103 if (flags & DUMP_MAP_WRITE) 1104 flags_str[1] = 'w'; 1105 if (flags & DUMP_MAP_EXEC) 1106 flags_str[2] = 'x'; 1107 if (flags & DUMP_MAP_SECURE) 1108 flags_str[3] = 's'; 1109 1110 print_wrapper(pctx, print_func, 1111 "region %2zu: va 0x%0*"PRIxVA" pa 0x%0*"PRIxPA" size 0x%06zx flags %s%s\n", 1112 idx, width, va, width, pa, sz, flags_str, desc); 1113 } 1114 1115 static bool get_next_in_order(struct ta_elf_queue *elf_queue, 1116 struct ta_elf **elf, struct segment **seg, 1117 size_t *elf_idx) 1118 { 1119 struct ta_elf *e = NULL; 1120 struct segment *s = NULL; 1121 size_t idx = 0; 1122 vaddr_t va = 0; 1123 struct ta_elf *e2 = NULL; 1124 size_t i2 = 0; 1125 1126 assert(elf && seg && elf_idx); 1127 e = *elf; 1128 s = *seg; 1129 assert((e == NULL && s == NULL) || (e != NULL && s != NULL)); 1130 1131 if (s) { 1132 s = TAILQ_NEXT(s, link); 1133 if (s) { 1134 *seg = s; 1135 return true; 1136 } 1137 } 1138 1139 if (e) 1140 va = e->load_addr; 1141 1142 /* Find the ELF with next load address */ 1143 e = NULL; 1144 TAILQ_FOREACH(e2, elf_queue, link) { 1145 if (e2->load_addr > va) { 1146 if (!e || e2->load_addr < e->load_addr) { 1147 e = e2; 1148 idx = i2; 1149 } 1150 } 1151 i2++; 1152 } 1153 if (!e) 1154 return false; 1155 1156 *elf = e; 1157 *seg = TAILQ_FIRST(&e->segs); 1158 *elf_idx = idx; 1159 return true; 1160 } 1161 1162 void ta_elf_print_mappings(void *pctx, print_func_t print_func, 1163 struct ta_elf_queue *elf_queue, size_t num_maps, 1164 struct dump_map *maps, vaddr_t mpool_base) 1165 { 1166 struct segment *seg = NULL; 1167 struct ta_elf *elf = NULL; 1168 size_t elf_idx = 0; 1169 size_t idx = 0; 1170 size_t map_idx = 0; 1171 1172 /* 1173 * Loop over all segments and maps, printing virtual address in 1174 * order. Segment has priority if the virtual address is present 1175 * in both map and segment. 1176 */ 1177 get_next_in_order(elf_queue, &elf, &seg, &elf_idx); 1178 while (true) { 1179 vaddr_t va = -1; 1180 size_t sz = 0; 1181 uint32_t flags = DUMP_MAP_SECURE; 1182 size_t offs = 0; 1183 1184 if (seg) { 1185 va = rounddown(seg->vaddr + elf->load_addr); 1186 sz = roundup(seg->vaddr + seg->memsz) - 1187 rounddown(seg->vaddr); 1188 } 1189 1190 while (map_idx < num_maps && maps[map_idx].va <= va) { 1191 uint32_t f = 0; 1192 1193 /* If there's a match, it should be the same map */ 1194 if (maps[map_idx].va == va) { 1195 /* 1196 * In shared libraries the first page is 1197 * mapped separately with the rest of that 1198 * segment following back to back in a 1199 * separate entry. 1200 */ 1201 if (map_idx + 1 < num_maps && 1202 maps[map_idx].sz == SMALL_PAGE_SIZE) { 1203 vaddr_t next_va = maps[map_idx].va + 1204 maps[map_idx].sz; 1205 size_t comb_sz = maps[map_idx].sz + 1206 maps[map_idx + 1].sz; 1207 1208 if (next_va == maps[map_idx + 1].va && 1209 comb_sz == sz && 1210 maps[map_idx].flags == 1211 maps[map_idx + 1].flags) { 1212 /* Skip this and next entry */ 1213 map_idx += 2; 1214 continue; 1215 } 1216 } 1217 assert(maps[map_idx].sz == sz); 1218 } else if (maps[map_idx].va < va) { 1219 if (maps[map_idx].va == mpool_base) 1220 f |= DUMP_MAP_LDELF; 1221 print_seg(pctx, print_func, idx, -1, 1222 maps[map_idx].va, maps[map_idx].pa, 1223 maps[map_idx].sz, 1224 maps[map_idx].flags | f); 1225 idx++; 1226 } 1227 map_idx++; 1228 } 1229 1230 if (!seg) 1231 break; 1232 1233 offs = rounddown(seg->offset); 1234 if (seg->flags & PF_R) 1235 flags |= DUMP_MAP_READ; 1236 if (seg->flags & PF_W) 1237 flags |= DUMP_MAP_WRITE; 1238 if (seg->flags & PF_X) 1239 flags |= DUMP_MAP_EXEC; 1240 1241 print_seg(pctx, print_func, idx, elf_idx, va, offs, sz, flags); 1242 idx++; 1243 1244 if (!get_next_in_order(elf_queue, &elf, &seg, &elf_idx)) 1245 seg = NULL; 1246 } 1247 1248 elf_idx = 0; 1249 TAILQ_FOREACH(elf, elf_queue, link) { 1250 print_wrapper(pctx, print_func, 1251 " [%zu] %pUl @ 0x%0*"PRIxVA"\n", 1252 elf_idx, (void *)&elf->uuid, 8, elf->load_addr); 1253 elf_idx++; 1254 } 1255 } 1256 1257 #ifdef CFG_UNWIND 1258 void ta_elf_stack_trace_a32(uint32_t regs[16]) 1259 { 1260 struct unwind_state_arm32 state = { }; 1261 1262 memcpy(state.registers, regs, sizeof(state.registers)); 1263 print_stack_arm32(&state, ta_stack, ta_stack_size); 1264 } 1265 1266 void ta_elf_stack_trace_a64(uint64_t fp, uint64_t sp, uint64_t pc) 1267 { 1268 struct unwind_state_arm64 state = { .fp = fp, .sp = sp, .pc = pc }; 1269 1270 print_stack_arm64(&state, ta_stack, ta_stack_size); 1271 } 1272 #endif 1273 1274 TEE_Result ta_elf_add_library(const TEE_UUID *uuid) 1275 { 1276 struct ta_elf *ta = TAILQ_FIRST(&main_elf_queue); 1277 struct ta_elf *lib = ta_elf_find_elf(uuid); 1278 struct ta_elf *elf = NULL; 1279 1280 if (lib) 1281 return TEE_SUCCESS; /* Already mapped */ 1282 1283 lib = queue_elf_helper(uuid); 1284 if (!lib) 1285 return TEE_ERROR_OUT_OF_MEMORY; 1286 1287 for (elf = lib; elf; elf = TAILQ_NEXT(elf, link)) 1288 ta_elf_load_dependency(elf, ta->is_32bit); 1289 1290 for (elf = lib; elf; elf = TAILQ_NEXT(elf, link)) { 1291 ta_elf_relocate(elf); 1292 ta_elf_finalize_mappings(elf); 1293 } 1294 1295 for (elf = lib; elf; elf = TAILQ_NEXT(elf, link)) 1296 DMSG("ELF (%pUl) at %#"PRIxVA, 1297 (void *)&elf->uuid, elf->load_addr); 1298 1299 return ta_elf_set_init_fini_info(ta->is_32bit); 1300 } 1301 1302 /* Get address/size of .init_array and .fini_array from the dynamic segment */ 1303 static void get_init_fini_array(struct ta_elf *elf, unsigned int type, 1304 vaddr_t addr, size_t memsz, vaddr_t *init, 1305 size_t *init_cnt, vaddr_t *fini, 1306 size_t *fini_cnt) 1307 { 1308 size_t addrsz = 0; 1309 size_t dyn_entsize = 0; 1310 size_t num_dyns = 0; 1311 size_t n = 0; 1312 unsigned int tag = 0; 1313 size_t val = 0; 1314 1315 assert(type == PT_DYNAMIC); 1316 1317 check_phdr_in_range(elf, type, addr, memsz); 1318 1319 if (elf->is_32bit) { 1320 dyn_entsize = sizeof(Elf32_Dyn); 1321 addrsz = 4; 1322 } else { 1323 dyn_entsize = sizeof(Elf64_Dyn); 1324 addrsz = 8; 1325 } 1326 1327 assert(!(memsz % dyn_entsize)); 1328 num_dyns = memsz / dyn_entsize; 1329 1330 for (n = 0; n < num_dyns; n++) { 1331 read_dyn(elf, addr, n, &tag, &val); 1332 if (tag == DT_INIT_ARRAY) 1333 *init = val + elf->load_addr; 1334 else if (tag == DT_FINI_ARRAY) 1335 *fini = val + elf->load_addr; 1336 else if (tag == DT_INIT_ARRAYSZ) 1337 *init_cnt = val / addrsz; 1338 else if (tag == DT_FINI_ARRAYSZ) 1339 *fini_cnt = val / addrsz; 1340 } 1341 } 1342 1343 /* Get address/size of .init_array and .fini_array in @elf (if present) */ 1344 static void elf_get_init_fini_array(struct ta_elf *elf, vaddr_t *init, 1345 size_t *init_cnt, vaddr_t *fini, 1346 size_t *fini_cnt) 1347 { 1348 size_t n = 0; 1349 1350 if (elf->is_32bit) { 1351 Elf32_Phdr *phdr = elf->phdr; 1352 1353 for (n = 0; n < elf->e_phnum; n++) { 1354 if (phdr[n].p_type == PT_DYNAMIC) { 1355 get_init_fini_array(elf, phdr[n].p_type, 1356 phdr[n].p_vaddr, 1357 phdr[n].p_memsz, 1358 init, init_cnt, fini, 1359 fini_cnt); 1360 return; 1361 } 1362 } 1363 } else { 1364 Elf64_Phdr *phdr = elf->phdr; 1365 1366 for (n = 0; n < elf->e_phnum; n++) { 1367 if (phdr[n].p_type == PT_DYNAMIC) { 1368 get_init_fini_array(elf, phdr[n].p_type, 1369 phdr[n].p_vaddr, 1370 phdr[n].p_memsz, 1371 init, init_cnt, fini, 1372 fini_cnt); 1373 return; 1374 } 1375 } 1376 } 1377 } 1378 1379 static TEE_Result realloc_ifs(vaddr_t va, size_t cnt, bool is_32bit) 1380 { 1381 struct __init_fini_info32 *info32 = (struct __init_fini_info32 *)va; 1382 struct __init_fini_info *info = (struct __init_fini_info *)va; 1383 struct __init_fini32 *ifs32 = NULL; 1384 struct __init_fini *ifs = NULL; 1385 size_t prev_cnt = 0; 1386 void *ptr = NULL; 1387 1388 if (is_32bit) { 1389 ptr = (void *)(vaddr_t)info32->ifs; 1390 ptr = realloc(ptr, cnt * sizeof(struct __init_fini32)); 1391 if (!ptr) 1392 return TEE_ERROR_OUT_OF_MEMORY; 1393 ifs32 = ptr; 1394 prev_cnt = info32->size; 1395 if (cnt > prev_cnt) 1396 memset(ifs32 + prev_cnt, 0, 1397 (cnt - prev_cnt) * sizeof(*ifs32)); 1398 info32->ifs = (uint32_t)(vaddr_t)ifs32; 1399 info32->size = cnt; 1400 } else { 1401 ptr = realloc(info->ifs, cnt * sizeof(struct __init_fini)); 1402 if (!ptr) 1403 return TEE_ERROR_OUT_OF_MEMORY; 1404 ifs = ptr; 1405 prev_cnt = info->size; 1406 if (cnt > prev_cnt) 1407 memset(ifs + prev_cnt, 0, 1408 (cnt - prev_cnt) * sizeof(*ifs)); 1409 info->ifs = ifs; 1410 info->size = cnt; 1411 } 1412 1413 return TEE_SUCCESS; 1414 } 1415 1416 static void fill_ifs(vaddr_t va, size_t idx, struct ta_elf *elf, bool is_32bit) 1417 { 1418 struct __init_fini_info32 *info32 = (struct __init_fini_info32 *)va; 1419 struct __init_fini_info *info = (struct __init_fini_info *)va; 1420 struct __init_fini32 *ifs32 = NULL; 1421 struct __init_fini *ifs = NULL; 1422 size_t init_cnt = 0; 1423 size_t fini_cnt = 0; 1424 vaddr_t init = 0; 1425 vaddr_t fini = 0; 1426 1427 if (is_32bit) { 1428 assert(idx < info32->size); 1429 ifs32 = &((struct __init_fini32 *)(vaddr_t)info32->ifs)[idx]; 1430 1431 if (ifs32->flags & __IFS_VALID) 1432 return; 1433 1434 elf_get_init_fini_array(elf, &init, &init_cnt, &fini, 1435 &fini_cnt); 1436 1437 ifs32->init = (uint32_t)init; 1438 ifs32->init_size = init_cnt; 1439 1440 ifs32->fini = (uint32_t)fini; 1441 ifs32->fini_size = fini_cnt; 1442 1443 ifs32->flags |= __IFS_VALID; 1444 } else { 1445 assert(idx < info->size); 1446 ifs = &info->ifs[idx]; 1447 1448 if (ifs->flags & __IFS_VALID) 1449 return; 1450 1451 elf_get_init_fini_array(elf, &init, &init_cnt, &fini, 1452 &fini_cnt); 1453 1454 ifs->init = (void (**)(void))init; 1455 ifs->init_size = init_cnt; 1456 1457 ifs->fini = (void (**)(void))fini; 1458 ifs->fini_size = fini_cnt; 1459 1460 ifs->flags |= __IFS_VALID; 1461 } 1462 } 1463 1464 /* 1465 * Set or update __init_fini_info in the TA with information from the ELF 1466 * queue 1467 */ 1468 TEE_Result ta_elf_set_init_fini_info(bool is_32bit) 1469 { 1470 struct __init_fini_info *info = NULL; 1471 TEE_Result res = TEE_SUCCESS; 1472 struct ta_elf *elf = NULL; 1473 vaddr_t info_va = 0; 1474 size_t cnt = 0; 1475 1476 res = ta_elf_resolve_sym("__init_fini_info", &info_va, NULL); 1477 if (res) { 1478 if (res == TEE_ERROR_ITEM_NOT_FOUND) { 1479 /* Older TA */ 1480 return TEE_SUCCESS; 1481 } 1482 return res; 1483 } 1484 assert(info_va); 1485 1486 info = (struct __init_fini_info *)info_va; 1487 if (info->reserved) 1488 return TEE_ERROR_NOT_SUPPORTED; 1489 1490 TAILQ_FOREACH(elf, &main_elf_queue, link) 1491 cnt++; 1492 1493 /* Queue has at least one file (main) */ 1494 assert(cnt); 1495 1496 res = realloc_ifs(info_va, cnt, is_32bit); 1497 if (res) 1498 goto err; 1499 1500 cnt = 0; 1501 TAILQ_FOREACH(elf, &main_elf_queue, link) { 1502 fill_ifs(info_va, cnt, elf, is_32bit); 1503 cnt++; 1504 } 1505 1506 return TEE_SUCCESS; 1507 err: 1508 free(info); 1509 return res; 1510 } 1511