lwp.c 26 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040
  1. /*
  2. * Copyright (c) 2006-2021, RT-Thread Development Team
  3. *
  4. * SPDX-License-Identifier: Apache-2.0
  5. *
  6. * Change Logs:
  7. * Date Author Notes
  8. * 2006-03-12 Bernard first version
  9. * 2018-11-02 heyuanjie fix complie error in iar
  10. * 2021-02-03 lizhirui add 64-bit arch support and riscv64 arch support
  11. */
  12. #include <rthw.h>
  13. #include <rtthread.h>
  14. #include <dfs_posix.h>
  15. #include <lwp_elf.h>
  16. #include <lwp_console.h>
  17. #ifndef RT_USING_DFS
  18. #error "lwp need file system(RT_USING_DFS)"
  19. #endif
  20. #include "lwp.h"
  21. #define DBG_TAG "LWP"
  22. #define DBG_LVL DBG_WARNING
  23. #include <rtdbg.h>
  24. #ifdef RT_USING_USERSPACE
  25. #ifdef RT_USING_GDBSERVER
  26. #include <hw_breakpoint.h>
  27. #include <lwp_gdbserver.h>
  28. #endif
  29. #include <lwp_mm_area.h>
  30. #include <lwp_user_mm.h>
  31. #ifdef ARCH_RISCV64
  32. #define USER_LOAD_VADDR 0x200000000
  33. #else
  34. #define USER_LOAD_VADDR 0x100000
  35. #endif
  36. #endif
  37. static const char elf_magic[] = {0x7f, 'E', 'L', 'F'};
  38. extern void lwp_user_entry(void *args, const void *text, void *data, void *k_stack);
  39. extern int libc_stdio_get_console(void);
  40. /**
  41. * RT-Thread light-weight process
  42. */
  43. void lwp_set_kernel_sp(uint32_t *sp)
  44. {
  45. rt_thread_self()->kernel_sp = (rt_uint32_t *)sp;
  46. }
  47. uint32_t *lwp_get_kernel_sp(void)
  48. {
  49. #ifdef RT_USING_USERSPACE
  50. return (uint32_t *)rt_thread_self()->sp;
  51. #else
  52. return (uint32_t *)rt_thread_self()->kernel_sp;
  53. #endif
  54. }
  55. #ifdef RT_USING_USERSPACE
  56. struct process_aux *lwp_argscopy(struct rt_lwp *lwp, int argc, char **argv, char **envp)
  57. {
  58. int size = sizeof(int) * 5; /* store argc, argv, envp, aux, NULL */
  59. int *args;
  60. char *str;
  61. char *str_k;
  62. char **new_argve;
  63. int i;
  64. int len;
  65. int *args_k;
  66. struct process_aux *aux;
  67. for (i = 0; i < argc; i++)
  68. {
  69. size += (rt_strlen(argv[i]) + 1);
  70. }
  71. size += (sizeof(int) * argc);
  72. i = 0;
  73. if (envp)
  74. {
  75. while (envp[i] != 0)
  76. {
  77. size += (rt_strlen(envp[i]) + 1);
  78. size += sizeof(int);
  79. i++;
  80. }
  81. }
  82. /* for aux */
  83. size += sizeof(struct process_aux);
  84. if (size > ARCH_PAGE_SIZE)
  85. {
  86. return RT_NULL;
  87. }
  88. /* args = (int *)lwp_map_user(lwp, 0, size); */
  89. args = (int *)lwp_map_user(lwp, (void *)(KERNEL_VADDR_START - ARCH_PAGE_SIZE), size, 0);
  90. if (args == RT_NULL)
  91. {
  92. return RT_NULL;
  93. }
  94. args_k = (int *)rt_hw_mmu_v2p(&lwp->mmu_info, args);
  95. args_k = (int *)((size_t)args_k - PV_OFFSET);
  96. /* argc, argv[], 0, envp[], 0 , aux[] */
  97. str = (char *)((size_t)args + (argc + 2 + i + 1 + AUX_ARRAY_ITEMS_NR * 2 + 1) * sizeof(int));
  98. str_k = (char *)((size_t)args_k + (argc + 2 + i + 1 + AUX_ARRAY_ITEMS_NR * 2 + 1) * sizeof(int));
  99. new_argve = (char **)&args_k[1];
  100. args_k[0] = argc;
  101. for (i = 0; i < argc; i++)
  102. {
  103. len = rt_strlen(argv[i]) + 1;
  104. new_argve[i] = str;
  105. rt_memcpy(str_k, argv[i], len);
  106. str += len;
  107. str_k += len;
  108. }
  109. new_argve[i] = 0;
  110. i++;
  111. new_argve[i] = 0;
  112. if (envp)
  113. {
  114. int j;
  115. for (j = 0; envp[j] != 0; j++)
  116. {
  117. len = rt_strlen(envp[j]) + 1;
  118. new_argve[i] = str;
  119. rt_memcpy(str_k, envp[j], len);
  120. str += len;
  121. str_k += len;
  122. i++;
  123. }
  124. new_argve[i] = 0;
  125. }
  126. i++;
  127. /* aux */
  128. aux = (struct process_aux *)(new_argve + i);
  129. aux->item[0].key = AT_EXECFN;
  130. aux->item[0].value = (uint32_t)(size_t)new_argve[0];
  131. i += AUX_ARRAY_ITEMS_NR * 2;
  132. new_argve[i] = 0;
  133. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, args_k, size);
  134. lwp->args = args;
  135. return aux;
  136. }
  137. #else
  138. static struct process_aux *lwp_argscopy(struct rt_lwp *lwp, int argc, char **argv, char **envp)
  139. {
  140. int size = sizeof(int) * 5; /* store argc, argv, envp, aux, NULL */
  141. int *args;
  142. char *str;
  143. char **new_argve;
  144. int i;
  145. int len;
  146. struct process_aux *aux;
  147. for (i = 0; i < argc; i++)
  148. {
  149. size += (rt_strlen(argv[i]) + 1);
  150. }
  151. size += (sizeof(int) * argc);
  152. i = 0;
  153. if (envp)
  154. {
  155. while (envp[i] != 0)
  156. {
  157. size += (rt_strlen(envp[i]) + 1);
  158. size += sizeof(int);
  159. i++;
  160. }
  161. }
  162. /* for aux */
  163. size += sizeof(struct process_aux);
  164. args = (int *)rt_malloc(size);
  165. if (args == RT_NULL)
  166. {
  167. return RT_NULL;
  168. }
  169. /* argc, argv[], 0, envp[], 0 */
  170. str = (char *)((size_t)args + (argc + 2 + i + 1 + AUX_ARRAY_ITEMS_NR * 2 + 1) * sizeof(int));
  171. new_argve = (char **)&args[1];
  172. args[0] = argc;
  173. for (i = 0; i < argc; i++)
  174. {
  175. len = rt_strlen(argv[i]) + 1;
  176. new_argve[i] = str;
  177. rt_memcpy(str, argv[i], len);
  178. str += len;
  179. }
  180. new_argve[i] = 0;
  181. i++;
  182. new_argve[i] = 0;
  183. if (envp)
  184. {
  185. int j;
  186. for (j = 0; envp[j] != 0; j++)
  187. {
  188. len = rt_strlen(envp[j]) + 1;
  189. new_argve[i] = str;
  190. rt_memcpy(str, envp[j], len);
  191. str += len;
  192. i++;
  193. }
  194. new_argve[i] = 0;
  195. }
  196. /* aux */
  197. aux = (struct process_aux *)(new_argve + i);
  198. aux->item[0].key = AT_EXECFN;
  199. aux->item[0].value = (uint32_t)(size_t)new_argve[0];
  200. i += AUX_ARRAY_ITEMS_NR * 2;
  201. new_argve[i] = 0;
  202. lwp->args = args;
  203. return aux;
  204. }
  205. #endif
  206. #define check_off(voff, vlen) \
  207. do \
  208. { \
  209. if (voff > vlen) \
  210. { \
  211. result = -RT_ERROR; \
  212. goto _exit; \
  213. } \
  214. } while (0)
  215. #define check_read(vrlen, vrlen_want) \
  216. do \
  217. { \
  218. if (vrlen < vrlen_want) \
  219. { \
  220. result = -RT_ERROR; \
  221. goto _exit; \
  222. } \
  223. } while (0)
  224. static size_t load_fread(void *ptr, size_t size, size_t nmemb, int fd)
  225. {
  226. size_t read_block = 0;
  227. while (nmemb)
  228. {
  229. size_t count;
  230. count = read(fd, ptr, size * nmemb) / size;
  231. if (count < nmemb)
  232. {
  233. LOG_E("ERROR: file size error!");
  234. break;
  235. }
  236. ptr = (void *)((uint8_t *)ptr + (count * size));
  237. nmemb -= count;
  238. read_block += count;
  239. }
  240. return read_block;
  241. }
  242. #ifdef ARCH_CPU_64BIT
  243. #define Elf_Word Elf64_Word
  244. #define Elf_Addr Elf64_Addr
  245. #define Elf_Half Elf64_Half
  246. #define Elf_Ehdr Elf64_Ehdr
  247. #define Elf_Phdr Elf64_Phdr
  248. #define Elf_Shdr Elf64_Shdr
  249. #else
  250. #define Elf_Word Elf32_Word
  251. #define Elf_Addr Elf32_Addr
  252. #define Elf_Half Elf32_Half
  253. #define Elf_Ehdr Elf32_Ehdr
  254. #define Elf_Phdr Elf32_Phdr
  255. #define Elf_Shdr Elf32_Shdr
  256. #endif
  257. typedef struct
  258. {
  259. Elf_Word st_name;
  260. Elf_Addr st_value;
  261. Elf_Word st_size;
  262. unsigned char st_info;
  263. unsigned char st_other;
  264. Elf_Half st_shndx;
  265. } Elf_sym;
  266. #ifdef RT_USING_USERSPACE
  267. void lwp_elf_reloc(rt_mmu_info *m_info, void *text_start, void *rel_dyn_start, size_t rel_dyn_size, void *got_start, size_t got_size, Elf_sym *dynsym);
  268. #else
  269. void lwp_elf_reloc(void *text_start, void *rel_dyn_start, size_t rel_dyn_size, void *got_start, size_t got_size, Elf_sym *dynsym);
  270. #endif
  271. struct map_range
  272. {
  273. void *start;
  274. size_t size;
  275. };
  276. static void expand_map_range(struct map_range *m, void *start, size_t size)
  277. {
  278. if (!m->start)
  279. {
  280. m->start = start;
  281. m->size = size;
  282. }
  283. else
  284. {
  285. void *end = (void *)((char*)start + size);
  286. void *mend = (void *)((char*)m->start + m->size);
  287. if (m->start > start)
  288. {
  289. m->start = start;
  290. }
  291. if (mend < end)
  292. {
  293. mend = end;
  294. }
  295. m->size = (char *)mend - (char *)m->start;
  296. }
  297. }
  298. static int map_range_ckeck(struct map_range *m1, struct map_range *m2)
  299. {
  300. int ret = 0;
  301. void *m1_start = (void *)((size_t)m1->start & ~ARCH_PAGE_MASK);
  302. void *m1_end = (void *)((((size_t)m1->start + m1->size) + ARCH_PAGE_MASK) & ~ARCH_PAGE_MASK);
  303. void *m2_start = (void *)((size_t)m2->start & ~ARCH_PAGE_MASK);
  304. void *m2_end = (void *)((((size_t)m2->start + m2->size) + ARCH_PAGE_MASK) & ~ARCH_PAGE_MASK);
  305. if (m1_start < m2_start)
  306. {
  307. if (m1_end > m2_start)
  308. {
  309. ret = -1;
  310. }
  311. }
  312. else /* m2_start <= m1_start */
  313. {
  314. if (m2_end > m1_start)
  315. {
  316. ret = -1;
  317. }
  318. }
  319. return ret;
  320. }
  321. static int load_elf(int fd, int len, struct rt_lwp *lwp, uint8_t *load_addr, struct process_aux *aux)
  322. {
  323. uint32_t i;
  324. uint32_t off = 0;
  325. char *p_section_str = 0;
  326. Elf_sym *dynsym = 0;
  327. Elf_Ehdr eheader;
  328. Elf_Phdr pheader;
  329. Elf_Shdr sheader;
  330. int result = RT_EOK;
  331. uint32_t magic;
  332. size_t read_len;
  333. void *got_start = 0;
  334. size_t got_size = 0;
  335. void *rel_dyn_start = 0;
  336. size_t rel_dyn_size = 0;
  337. size_t dynsym_off = 0;
  338. size_t dynsym_size = 0;
  339. struct map_range text_area = {NULL, 0};
  340. struct map_range data_area = {NULL, 0};
  341. #ifdef RT_USING_USERSPACE
  342. void *pa, *va;
  343. #endif
  344. #ifdef RT_USING_USERSPACE
  345. rt_mmu_info *m_info = &lwp->mmu_info;
  346. #endif
  347. if (len < sizeof eheader)
  348. {
  349. return -RT_ERROR;
  350. }
  351. lseek(fd, 0, SEEK_SET);
  352. read_len = load_fread(&magic, 1, sizeof magic, fd);
  353. check_read(read_len, sizeof magic);
  354. if (memcmp(elf_magic, &magic, 4) != 0)
  355. {
  356. return -RT_ERROR;
  357. }
  358. lseek(fd, off, SEEK_SET);
  359. read_len = load_fread(&eheader, 1, sizeof eheader, fd);
  360. check_read(read_len, sizeof eheader);
  361. #ifndef ARCH_CPU_64BIT
  362. if (eheader.e_ident[4] != 1)
  363. { /* not 32bit */
  364. return -RT_ERROR;
  365. }
  366. #else
  367. if (eheader.e_ident[4] != 2)
  368. { /* not 64bit */
  369. return -RT_ERROR;
  370. }
  371. #endif
  372. if (eheader.e_ident[6] != 1)
  373. { /* ver not 1 */
  374. return -RT_ERROR;
  375. }
  376. if ((eheader.e_type != ET_DYN)
  377. #ifdef RT_USING_USERSPACE
  378. && (eheader.e_type != ET_EXEC)
  379. #endif
  380. )
  381. {
  382. /* not pie or exec elf */
  383. return -RT_ERROR;
  384. }
  385. { /* load aux */
  386. uint8_t *process_header;
  387. size_t process_header_size;
  388. off = eheader.e_phoff;
  389. process_header_size = eheader.e_phnum * sizeof pheader;
  390. if (process_header_size > ARCH_PAGE_SIZE)
  391. {
  392. return -RT_ERROR;
  393. }
  394. #ifdef RT_USING_USERSPACE
  395. va = (uint8_t *)lwp_map_user(lwp, (void *)(KERNEL_VADDR_START - ARCH_PAGE_SIZE * 2), process_header_size, 0);
  396. if (!va)
  397. {
  398. return -RT_ERROR;
  399. }
  400. pa = rt_hw_mmu_v2p(m_info, va);
  401. process_header = (uint8_t *)pa - PV_OFFSET;
  402. #else
  403. process_header = (uint8_t *)rt_malloc(process_header_size);
  404. if (!process_header)
  405. {
  406. return -RT_ERROR;
  407. }
  408. #endif
  409. check_off(off, len);
  410. lseek(fd, off, SEEK_SET);
  411. read_len = load_fread(process_header, 1, process_header_size, fd);
  412. check_read(read_len, process_header_size);
  413. #ifdef RT_USING_USERSPACE
  414. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, process_header, process_header_size);
  415. #endif
  416. aux->item[1].key = AT_PAGESZ;
  417. aux->item[1].value = ARCH_PAGE_SIZE;
  418. aux->item[2].key = AT_RANDOM;
  419. aux->item[2].value = rt_tick_get();
  420. aux->item[3].key = AT_PHDR;
  421. #ifdef RT_USING_USERSPACE
  422. aux->item[3].value = (uint32_t)(size_t)va;
  423. #else
  424. aux->item[3].value = (uint32_t)(size_t)process_header;
  425. #endif
  426. aux->item[4].key = AT_PHNUM;
  427. aux->item[4].value = eheader.e_phnum;
  428. aux->item[5].key = AT_PHENT;
  429. aux->item[5].value = sizeof pheader;
  430. #ifdef RT_USING_USERSPACE
  431. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, aux, sizeof *aux);
  432. #endif
  433. }
  434. #ifdef RT_USING_USERSPACE
  435. /* map user */
  436. off = eheader.e_shoff;
  437. for (i = 0; i < eheader.e_shnum; i++, off += sizeof sheader)
  438. {
  439. check_off(off, len);
  440. lseek(fd, off, SEEK_SET);
  441. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  442. check_read(read_len, sizeof sheader);
  443. if ((sheader.sh_flags & SHF_ALLOC) == 0)
  444. {
  445. continue;
  446. }
  447. switch (sheader.sh_type)
  448. {
  449. case SHT_PROGBITS:
  450. if ((sheader.sh_flags & SHF_WRITE) == 0)
  451. {
  452. expand_map_range(&text_area, (void *)sheader.sh_addr, sheader.sh_size);
  453. }
  454. else
  455. {
  456. expand_map_range(&data_area, (void *)sheader.sh_addr, sheader.sh_size);
  457. }
  458. break;
  459. case SHT_NOBITS:
  460. expand_map_range(&data_area, (void *)sheader.sh_addr, sheader.sh_size);
  461. break;
  462. default:
  463. break;
  464. }
  465. }
  466. if (map_range_ckeck(&text_area, &data_area) != 0)
  467. {
  468. result = -RT_ERROR;
  469. goto _exit;
  470. }
  471. if (text_area.start)
  472. {
  473. va = lwp_map_user(lwp, text_area.start, text_area.size, 1);
  474. if (!va || (va != text_area.start))
  475. {
  476. result = -RT_ERROR;
  477. goto _exit;
  478. }
  479. }
  480. if (data_area.start)
  481. {
  482. va = lwp_map_user(lwp, data_area.start, data_area.size, 0);
  483. if (!va || (va != data_area.start))
  484. {
  485. result = -RT_ERROR;
  486. goto _exit;
  487. }
  488. }
  489. #endif
  490. off = eheader.e_phoff;
  491. for (i = 0; i < eheader.e_phnum; i++, off += sizeof pheader)
  492. {
  493. check_off(off, len);
  494. lseek(fd, off, SEEK_SET);
  495. read_len = load_fread(&pheader, 1, sizeof pheader, fd);
  496. check_read(read_len, sizeof pheader);
  497. if (pheader.p_type == PT_LOAD)
  498. {
  499. if (pheader.p_filesz > pheader.p_memsz)
  500. {
  501. return -RT_ERROR;
  502. }
  503. if (load_addr)
  504. {
  505. if (eheader.e_type == ET_EXEC)
  506. {
  507. result = -RT_ERROR;
  508. goto _exit;
  509. }
  510. lwp->text_entry = load_addr;
  511. }
  512. else
  513. {
  514. #ifdef RT_USING_USERSPACE
  515. void *va;
  516. if (eheader.e_type == ET_EXEC)
  517. {
  518. if (pheader.p_vaddr != USER_LOAD_VADDR)
  519. {
  520. result = -RT_ERROR;
  521. goto _exit;
  522. }
  523. }
  524. va = (void *)pheader.p_vaddr;
  525. if (va)
  526. {
  527. lwp->text_entry = va;
  528. lwp->text_size = pheader.p_memsz;
  529. }
  530. else
  531. {
  532. lwp->text_entry = RT_NULL;
  533. }
  534. #else
  535. #ifdef RT_USING_CACHE
  536. lwp->text_entry = (rt_uint8_t *)rt_malloc_align(pheader.p_memsz, RT_CPU_CACHE_LINE_SZ);
  537. #else
  538. lwp->text_entry = (rt_uint8_t *)rt_malloc(pheader.p_memsz);
  539. #endif
  540. #endif
  541. if (lwp->text_entry == RT_NULL)
  542. {
  543. LOG_E("alloc text memory faild!");
  544. result = -RT_ENOMEM;
  545. goto _exit;
  546. }
  547. else
  548. {
  549. LOG_D("lwp text malloc : %p, size: %d!", lwp->text_entry, lwp->text_size);
  550. }
  551. check_off(pheader.p_offset, len);
  552. lseek(fd, pheader.p_offset, SEEK_SET);
  553. #ifdef RT_USING_USERSPACE
  554. {
  555. uint32_t size = pheader.p_filesz;
  556. void *va_self;
  557. void *pa;
  558. size_t tmp_len = 0;
  559. read_len = 0;
  560. while (size)
  561. {
  562. pa = rt_hw_mmu_v2p(m_info, va);
  563. va_self = (void *)((char *)pa - PV_OFFSET);
  564. LOG_D("va_self = %p pa = %p", va_self, pa);
  565. tmp_len = (size < ARCH_PAGE_SIZE) ? size : ARCH_PAGE_SIZE;
  566. tmp_len = load_fread(va_self, 1, tmp_len, fd);
  567. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, va_self, tmp_len);
  568. read_len += tmp_len;
  569. size -= tmp_len;
  570. va = (void *)((char *)va + ARCH_PAGE_SIZE);
  571. }
  572. }
  573. #else
  574. read_len = load_fread(lwp->text_entry, 1, pheader.p_filesz, fd);
  575. #endif
  576. check_read(read_len, pheader.p_filesz);
  577. }
  578. if (pheader.p_filesz < pheader.p_memsz)
  579. {
  580. #ifdef RT_USING_USERSPACE
  581. void *va = (void *)((char *)lwp->text_entry + pheader.p_filesz);
  582. void *va_self;
  583. void *pa;
  584. uint32_t size = pheader.p_memsz - pheader.p_filesz;
  585. uint32_t size_s;
  586. uint32_t off;
  587. off = pheader.p_filesz & ARCH_PAGE_MASK;
  588. va = (void *)(((size_t)lwp->text_entry + pheader.p_filesz) & ~ARCH_PAGE_MASK);
  589. while (size)
  590. {
  591. size_s = (size < ARCH_PAGE_SIZE - off) ? size : ARCH_PAGE_SIZE - off;
  592. pa = rt_hw_mmu_v2p(m_info, va);
  593. va_self = (void *)((char *)pa - PV_OFFSET);
  594. memset((void *)((char *)va_self + off), 0, size_s);
  595. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, (void *)((char *)va_self + off), size_s);
  596. off = 0;
  597. size -= size_s;
  598. va = (void *)((char *)va + ARCH_PAGE_SIZE);
  599. }
  600. #else
  601. memset((uint8_t *)lwp->text_entry + pheader.p_filesz, 0, (size_t)(pheader.p_memsz - pheader.p_filesz));
  602. #endif
  603. }
  604. break;
  605. }
  606. }
  607. if (eheader.e_type == ET_DYN)
  608. {
  609. /* section info */
  610. off = eheader.e_shoff;
  611. /* find section string table */
  612. check_off(off, len);
  613. lseek(fd, off + (sizeof sheader) * eheader.e_shstrndx, SEEK_SET);
  614. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  615. check_read(read_len, sizeof sheader);
  616. p_section_str = (char *)rt_malloc(sheader.sh_size);
  617. if (!p_section_str)
  618. {
  619. LOG_E("out of memory!");
  620. result = -ENOMEM;
  621. goto _exit;
  622. }
  623. check_off(sheader.sh_offset, len);
  624. lseek(fd, sheader.sh_offset, SEEK_SET);
  625. read_len = load_fread(p_section_str, 1, sheader.sh_size, fd);
  626. check_read(read_len, sheader.sh_size);
  627. check_off(off, len);
  628. lseek(fd, off, SEEK_SET);
  629. for (i = 0; i < eheader.e_shnum; i++, off += sizeof sheader)
  630. {
  631. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  632. check_read(read_len, sizeof sheader);
  633. if (strcmp(p_section_str + sheader.sh_name, "text") == 0)
  634. {
  635. lwp->text_size = sheader.sh_size;
  636. }
  637. else if (strcmp(p_section_str + sheader.sh_name, ".got") == 0)
  638. {
  639. got_start = (void *)((uint8_t *)lwp->text_entry + sheader.sh_addr);
  640. got_size = (size_t)sheader.sh_size;
  641. }
  642. else if (strcmp(p_section_str + sheader.sh_name, ".rel.dyn") == 0)
  643. {
  644. rel_dyn_start = (void *)((uint8_t *)lwp->text_entry + sheader.sh_addr);
  645. rel_dyn_size = (size_t)sheader.sh_size;
  646. }
  647. else if (strcmp(p_section_str + sheader.sh_name, ".dynsym") == 0)
  648. {
  649. dynsym_off = (size_t)sheader.sh_offset;
  650. dynsym_size = (size_t)sheader.sh_size;
  651. }
  652. }
  653. /* reloc */
  654. if (dynsym_size)
  655. {
  656. dynsym = rt_malloc(dynsym_size);
  657. if (!dynsym)
  658. {
  659. LOG_E("ERROR: Malloc error!");
  660. result = -ENOMEM;
  661. goto _exit;
  662. }
  663. check_off(dynsym_off, len);
  664. lseek(fd, dynsym_off, SEEK_SET);
  665. read_len = load_fread(dynsym, 1, dynsym_size, fd);
  666. check_read(read_len, dynsym_size);
  667. }
  668. #ifdef RT_USING_USERSPACE
  669. lwp_elf_reloc(m_info, (void *)lwp->text_entry, rel_dyn_start, rel_dyn_size, got_start, got_size, dynsym);
  670. #else
  671. lwp_elf_reloc((void *)lwp->text_entry, rel_dyn_start, rel_dyn_size, got_start, got_size, dynsym);
  672. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, lwp->text_entry, lwp->text_size);
  673. rt_hw_cpu_icache_ops(RT_HW_CACHE_INVALIDATE, lwp->text_entry, lwp->text_size);
  674. #endif
  675. }
  676. LOG_D("lwp->text_entry = 0x%p", lwp->text_entry);
  677. LOG_D("lwp->text_size = 0x%p", lwp->text_size);
  678. _exit:
  679. if (dynsym)
  680. {
  681. rt_free(dynsym);
  682. }
  683. if (p_section_str)
  684. {
  685. rt_free(p_section_str);
  686. }
  687. if (result != RT_EOK)
  688. {
  689. LOG_E("lwp dynamic load faild, %d", result);
  690. }
  691. return result;
  692. }
  693. int lwp_load(const char *filename, struct rt_lwp *lwp, uint8_t *load_addr, size_t addr_size, struct process_aux *aux);
  694. RT_WEAK int lwp_load(const char *filename, struct rt_lwp *lwp, uint8_t *load_addr, size_t addr_size, struct process_aux *aux)
  695. {
  696. uint8_t *ptr;
  697. int ret = -1;
  698. int len;
  699. int fd = -1;
  700. /* check file name */
  701. RT_ASSERT(filename != RT_NULL);
  702. /* check lwp control block */
  703. RT_ASSERT(lwp != RT_NULL);
  704. /* copy file name to process name */
  705. rt_strncpy(lwp->cmd, filename, RT_NAME_MAX);
  706. if (load_addr != RT_NULL)
  707. {
  708. lwp->lwp_type = LWP_TYPE_FIX_ADDR;
  709. ptr = load_addr;
  710. }
  711. else
  712. {
  713. lwp->lwp_type = LWP_TYPE_DYN_ADDR;
  714. ptr = RT_NULL;
  715. }
  716. fd = open(filename, O_BINARY | O_RDONLY, 0);
  717. if (fd < 0)
  718. {
  719. LOG_E("ERROR: Can't open elf file %s!", filename);
  720. goto out;
  721. }
  722. len = lseek(fd, 0, SEEK_END);
  723. if (len < 0)
  724. {
  725. LOG_E("ERROR: File %s size error!", filename);
  726. goto out;
  727. }
  728. lseek(fd, 0, SEEK_SET);
  729. ret = load_elf(fd, len, lwp, ptr, aux);
  730. if (ret != RT_EOK)
  731. {
  732. LOG_E("lwp load ret = %d", ret);
  733. }
  734. out:
  735. if (fd > 0)
  736. {
  737. close(fd);
  738. }
  739. return ret;
  740. }
  741. void lwp_cleanup(struct rt_thread *tid)
  742. {
  743. rt_base_t level;
  744. struct rt_lwp *lwp;
  745. if (tid == NULL) return;
  746. LOG_I("cleanup thread: %s, stack_addr: %08X", tid->name, tid->stack_addr);
  747. #ifndef RT_USING_USERSPACE
  748. if (tid->user_stack != RT_NULL)
  749. {
  750. rt_free(tid->user_stack);
  751. }
  752. #endif
  753. level = rt_hw_interrupt_disable();
  754. lwp = (struct rt_lwp *)tid->lwp;
  755. lwp_tid_put(tid->tid);
  756. rt_list_remove(&tid->sibling);
  757. lwp_ref_dec(lwp);
  758. rt_hw_interrupt_enable(level);
  759. return;
  760. }
  761. static void lwp_copy_stdio_fdt(struct rt_lwp *lwp)
  762. {
  763. struct dfs_fd *d;
  764. struct dfs_fdtable *lwp_fdt;
  765. lwp_fdt = &lwp->fdt;
  766. /* init 4 fds */
  767. lwp_fdt->fds = rt_calloc(4, sizeof(void *));
  768. if (lwp_fdt->fds)
  769. {
  770. lwp_fdt->maxfd = 4;
  771. d = fd_get(0);
  772. fd_associate(lwp_fdt, 0, d);
  773. d = fd_get(1);
  774. fd_associate(lwp_fdt, 1, d);
  775. d = fd_get(2);
  776. fd_associate(lwp_fdt, 2, d);
  777. }
  778. return;
  779. }
  780. static void lwp_thread_entry(void *parameter)
  781. {
  782. rt_thread_t tid;
  783. struct rt_lwp *lwp;
  784. tid = rt_thread_self();
  785. lwp = (struct rt_lwp *)tid->lwp;
  786. tid->cleanup = lwp_cleanup;
  787. tid->user_stack = RT_NULL;
  788. #ifdef RT_USING_GDBSERVER
  789. if (lwp->debug)
  790. {
  791. lwp->bak_first_ins = *(uint32_t *)lwp->text_entry;
  792. *(uint32_t *)lwp->text_entry = INS_BREAK_CONNECT;
  793. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, lwp->text_entry, sizeof(uint32_t));
  794. icache_invalid_all();
  795. }
  796. #endif
  797. lwp_user_entry(lwp->args, lwp->text_entry, lwp->data_entry, tid->stack_addr + tid->stack_size);
  798. }
  799. struct rt_lwp *lwp_self(void)
  800. {
  801. rt_thread_t tid;
  802. tid = rt_thread_self();
  803. if (tid)
  804. {
  805. return (struct rt_lwp *)tid->lwp;
  806. }
  807. return RT_NULL;
  808. }
  809. #ifdef RT_USING_GDBSERVER
  810. pid_t lwp_execve(char *filename, int debug, int argc, char **argv, char **envp)
  811. #else
  812. pid_t lwp_execve(char *filename, int argc, char **argv, char **envp)
  813. #endif
  814. {
  815. int result;
  816. rt_base_t level;
  817. struct rt_lwp *lwp;
  818. char *thread_name;
  819. char *argv_last = argv[argc - 1];
  820. int bg = 0;
  821. struct process_aux *aux;
  822. int tid = 0;
  823. if (filename == RT_NULL)
  824. {
  825. return -RT_ERROR;
  826. }
  827. lwp = lwp_new();
  828. if (lwp == RT_NULL)
  829. {
  830. dbg_log(DBG_ERROR, "lwp struct out of memory!\n");
  831. return -RT_ENOMEM;
  832. }
  833. LOG_D("lwp malloc : %p, size: %d!", lwp, sizeof(struct rt_lwp));
  834. if ((tid = lwp_tid_get()) == 0)
  835. {
  836. lwp_ref_dec(lwp);
  837. return -ENOMEM;
  838. }
  839. #ifdef RT_USING_USERSPACE
  840. if (lwp_user_space_init(lwp) != 0)
  841. {
  842. lwp_tid_put(tid);
  843. lwp_ref_dec(lwp);
  844. return -ENOMEM;
  845. }
  846. #endif
  847. if (argv_last[0] == '&' && argv_last[1] == '\0')
  848. {
  849. argc--;
  850. bg = 1;
  851. }
  852. if ((aux = lwp_argscopy(lwp, argc, argv, envp)) == RT_NULL)
  853. {
  854. lwp_tid_put(tid);
  855. lwp_ref_dec(lwp);
  856. return -ENOMEM;
  857. }
  858. result = lwp_load(filename, lwp, RT_NULL, 0, aux);
  859. if (result == RT_EOK)
  860. {
  861. rt_thread_t thread = RT_NULL;
  862. lwp_copy_stdio_fdt(lwp);
  863. /* obtain the base name */
  864. thread_name = strrchr(filename, '/');
  865. thread_name = thread_name ? thread_name + 1 : filename;
  866. thread = rt_thread_create(thread_name, lwp_thread_entry, RT_NULL,
  867. LWP_TASK_STACK_SIZE, 25, 200);
  868. if (thread != RT_NULL)
  869. {
  870. struct rt_lwp *self_lwp;
  871. thread->tid = tid;
  872. lwp_tid_set_thread(tid, thread);
  873. LOG_D("lwp kernel => (0x%08x, 0x%08x)\n", (rt_uint32_t)thread->stack_addr,
  874. (rt_uint32_t)thread->stack_addr + thread->stack_size);
  875. level = rt_hw_interrupt_disable();
  876. self_lwp = lwp_self();
  877. if (self_lwp)
  878. {
  879. /* lwp add to children link */
  880. lwp->sibling = self_lwp->first_child;
  881. self_lwp->first_child = lwp;
  882. lwp->parent = self_lwp;
  883. }
  884. thread->lwp = lwp;
  885. rt_list_insert_after(&lwp->t_grp, &thread->sibling);
  886. #ifdef RT_USING_GDBSERVER
  887. if (debug)
  888. {
  889. lwp->debug = debug;
  890. }
  891. #endif
  892. if ((rt_console_get_foreground() == self_lwp) && !bg)
  893. {
  894. rt_console_set_foreground(lwp);
  895. }
  896. rt_hw_interrupt_enable(level);
  897. rt_thread_startup(thread);
  898. return lwp_to_pid(lwp);
  899. }
  900. }
  901. lwp_tid_put(tid);
  902. lwp_ref_dec(lwp);
  903. return -RT_ERROR;
  904. }
  905. #ifdef RT_USING_GDBSERVER
  906. pid_t exec(char *filename, int debug, int argc, char **argv)
  907. {
  908. return lwp_execve(filename, debug, argc, argv, 0);
  909. }
  910. #else
  911. pid_t exec(char *filename, int argc, char **argv)
  912. {
  913. return lwp_execve(filename, argc, argv, 0);
  914. }
  915. #endif