lwp.c 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314
  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. * 2021-08-26 linzhenxing add lwp_setcwd\lwp_getcwd
  12. */
  13. #include <rthw.h>
  14. #include <rtthread.h>
  15. #include <dfs_posix.h>
  16. #include <lwp_elf.h>
  17. #ifndef RT_USING_DFS
  18. #error "lwp need file system(RT_USING_DFS)"
  19. #endif
  20. #include "lwp.h"
  21. #include "lwp_arch.h"
  22. #include "console.h"
  23. #define DBG_TAG "LWP"
  24. #define DBG_LVL DBG_WARNING
  25. #include <rtdbg.h>
  26. #ifdef RT_USING_USERSPACE
  27. #include <lwp_mm_area.h>
  28. #include <lwp_user_mm.h>
  29. #endif /* end of RT_USING_USERSPACE */
  30. static const char elf_magic[] = {0x7f, 'E', 'L', 'F'};
  31. #ifdef DFS_USING_WORKDIR
  32. extern char working_directory[];
  33. #endif
  34. struct termios stdin_termios, old_stdin_termios;
  35. extern void lwp_user_entry(void *args, const void *text, void *ustack, void *k_stack);
  36. int load_ldso(struct rt_lwp *lwp, char *exec_name, char *const argv[], char *const envp[]);
  37. void lwp_setcwd(char *buf)
  38. {
  39. struct rt_lwp *lwp = RT_NULL;
  40. if(strlen(buf) >= DFS_PATH_MAX)
  41. {
  42. rt_kprintf("buf too long!\n");
  43. return ;
  44. }
  45. lwp = (struct rt_lwp *)rt_thread_self()->lwp;
  46. if (lwp)
  47. {
  48. rt_strncpy(lwp->working_directory, buf, DFS_PATH_MAX);
  49. }
  50. else
  51. {
  52. rt_strncpy(working_directory, buf, DFS_PATH_MAX);
  53. }
  54. return ;
  55. }
  56. char *lwp_getcwd(void)
  57. {
  58. char *dir_buf = RT_NULL;
  59. struct rt_lwp *lwp = RT_NULL;
  60. lwp = (struct rt_lwp *)rt_thread_self()->lwp;
  61. if (lwp)
  62. {
  63. if(lwp->working_directory[0] != '/')
  64. {
  65. dir_buf = &working_directory[0];
  66. }
  67. else
  68. {
  69. dir_buf = &lwp->working_directory[0];
  70. }
  71. }
  72. else
  73. dir_buf = &working_directory[0];
  74. return dir_buf;
  75. }
  76. /**
  77. * RT-Thread light-weight process
  78. */
  79. void lwp_set_kernel_sp(uint32_t *sp)
  80. {
  81. rt_thread_self()->kernel_sp = (rt_uint32_t *)sp;
  82. }
  83. uint32_t *lwp_get_kernel_sp(void)
  84. {
  85. #ifdef RT_USING_USERSPACE
  86. return (uint32_t *)rt_thread_self()->sp;
  87. #else
  88. uint32_t* kernel_sp;
  89. extern rt_uint32_t rt_interrupt_from_thread;
  90. extern rt_uint32_t rt_thread_switch_interrupt_flag;
  91. if (rt_thread_switch_interrupt_flag)
  92. {
  93. kernel_sp = (uint32_t *)((rt_thread_t)rt_container_of(rt_interrupt_from_thread, struct rt_thread, sp))->kernel_sp;
  94. }
  95. else
  96. {
  97. kernel_sp = (uint32_t *)rt_thread_self()->kernel_sp;
  98. }
  99. return kernel_sp;
  100. #endif
  101. }
  102. #ifdef RT_USING_USERSPACE
  103. struct process_aux *lwp_argscopy(struct rt_lwp *lwp, int argc, char **argv, char **envp)
  104. {
  105. int size = sizeof(size_t) * 5; /* store argc, argv, envp, aux, NULL */
  106. int *args;
  107. char *str;
  108. char *str_k;
  109. char **new_argve;
  110. int i;
  111. int len;
  112. size_t *args_k;
  113. struct process_aux *aux;
  114. for (i = 0; i < argc; i++)
  115. {
  116. size += (rt_strlen(argv[i]) + 1);
  117. }
  118. size += (sizeof(size_t) * argc);
  119. i = 0;
  120. if (envp)
  121. {
  122. while (envp[i] != 0)
  123. {
  124. size += (rt_strlen(envp[i]) + 1);
  125. size += sizeof(size_t);
  126. i++;
  127. }
  128. }
  129. /* for aux */
  130. size += sizeof(struct process_aux);
  131. if (size > ARCH_PAGE_SIZE)
  132. {
  133. return RT_NULL;
  134. }
  135. /* args = (int *)lwp_map_user(lwp, 0, size); */
  136. args = (int *)lwp_map_user(lwp, (void *)(USER_VADDR_TOP - ARCH_PAGE_SIZE), size, 0);
  137. if (args == RT_NULL)
  138. {
  139. return RT_NULL;
  140. }
  141. args_k = (size_t *)rt_hw_mmu_v2p(&lwp->mmu_info, args);
  142. args_k = (size_t *)((size_t)args_k - PV_OFFSET);
  143. /* argc, argv[], 0, envp[], 0 , aux[] */
  144. str = (char *)((size_t)args + (argc + 2 + i + 1 + AUX_ARRAY_ITEMS_NR * 2 + 1) * sizeof(size_t));
  145. str_k = (char *)((size_t)args_k + (argc + 2 + i + 1 + AUX_ARRAY_ITEMS_NR * 2 + 1) * sizeof(size_t));
  146. new_argve = (char **)&args_k[1];
  147. args_k[0] = argc;
  148. for (i = 0; i < argc; i++)
  149. {
  150. len = rt_strlen(argv[i]) + 1;
  151. new_argve[i] = str;
  152. rt_memcpy(str_k, argv[i], len);
  153. str += len;
  154. str_k += len;
  155. }
  156. new_argve[i] = 0;
  157. i++;
  158. new_argve[i] = 0;
  159. if (envp)
  160. {
  161. int j;
  162. for (j = 0; envp[j] != 0; j++)
  163. {
  164. len = rt_strlen(envp[j]) + 1;
  165. new_argve[i] = str;
  166. rt_memcpy(str_k, envp[j], len);
  167. str += len;
  168. str_k += len;
  169. i++;
  170. }
  171. new_argve[i] = 0;
  172. }
  173. i++;
  174. /* aux */
  175. aux = (struct process_aux *)(new_argve + i);
  176. aux->item[0].key = AT_EXECFN;
  177. aux->item[0].value = (size_t)(size_t)new_argve[0];
  178. i += AUX_ARRAY_ITEMS_NR * 2;
  179. new_argve[i] = 0;
  180. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, args_k, size);
  181. lwp->args = args;
  182. return aux;
  183. }
  184. #else
  185. static struct process_aux *lwp_argscopy(struct rt_lwp *lwp, int argc, char **argv, char **envp)
  186. {
  187. #ifdef ARCH_MM_MMU
  188. int size = sizeof(int) * 5; /* store argc, argv, envp, aux, NULL */
  189. struct process_aux *aux;
  190. #else
  191. int size = sizeof(int) * 4; /* store argc, argv, envp, NULL */
  192. #endif /* ARCH_MM_MMU */
  193. int *args;
  194. char *str;
  195. char **new_argve;
  196. int i;
  197. int len;
  198. for (i = 0; i < argc; i++)
  199. {
  200. size += (rt_strlen(argv[i]) + 1);
  201. }
  202. size += (sizeof(int) * argc);
  203. i = 0;
  204. if (envp)
  205. {
  206. while (envp[i] != 0)
  207. {
  208. size += (rt_strlen(envp[i]) + 1);
  209. size += sizeof(int);
  210. i++;
  211. }
  212. }
  213. #ifdef ARCH_MM_MMU
  214. /* for aux */
  215. size += sizeof(struct process_aux);
  216. args = (int *)rt_malloc(size);
  217. if (args == RT_NULL)
  218. {
  219. return RT_NULL;
  220. }
  221. /* argc, argv[], 0, envp[], 0 */
  222. str = (char *)((size_t)args + (argc + 2 + i + 1 + AUX_ARRAY_ITEMS_NR * 2 + 1) * sizeof(int));
  223. #else
  224. args = (int *)rt_malloc(size);
  225. if (args == RT_NULL)
  226. {
  227. return RT_NULL;
  228. }
  229. str = (char*)((int)args + (argc + 2 + i + 1) * sizeof(int));
  230. #endif /* ARCH_MM_MMU */
  231. new_argve = (char **)&args[1];
  232. args[0] = argc;
  233. for (i = 0; i < argc; i++)
  234. {
  235. len = rt_strlen(argv[i]) + 1;
  236. new_argve[i] = str;
  237. rt_memcpy(str, argv[i], len);
  238. str += len;
  239. }
  240. new_argve[i] = 0;
  241. i++;
  242. new_argve[i] = 0;
  243. if (envp)
  244. {
  245. int j;
  246. for (j = 0; envp[j] != 0; j++)
  247. {
  248. len = rt_strlen(envp[j]) + 1;
  249. new_argve[i] = str;
  250. rt_memcpy(str, envp[j], len);
  251. str += len;
  252. i++;
  253. }
  254. new_argve[i] = 0;
  255. }
  256. #ifdef ARCH_MM_MMU
  257. /* aux */
  258. aux = (struct process_aux *)(new_argve + i);
  259. aux->item[0].key = AT_EXECFN;
  260. aux->item[0].value = (uint32_t)(size_t)new_argve[0];
  261. i += AUX_ARRAY_ITEMS_NR * 2;
  262. new_argve[i] = 0;
  263. lwp->args = args;
  264. return aux;
  265. #else
  266. lwp->args = args;
  267. lwp->args_length = size;
  268. return (struct process_aux *)(new_argve + i);
  269. #endif /* ARCH_MM_MMU */
  270. }
  271. #endif
  272. #ifdef ARCH_MM_MMU
  273. #define check_off(voff, vlen) \
  274. do \
  275. { \
  276. if (voff > vlen) \
  277. { \
  278. result = -RT_ERROR; \
  279. goto _exit; \
  280. } \
  281. } while (0)
  282. #define check_read(vrlen, vrlen_want) \
  283. do \
  284. { \
  285. if (vrlen < vrlen_want) \
  286. { \
  287. result = -RT_ERROR; \
  288. goto _exit; \
  289. } \
  290. } while (0)
  291. static size_t load_fread(void *ptr, size_t size, size_t nmemb, int fd)
  292. {
  293. size_t read_block = 0;
  294. while (nmemb)
  295. {
  296. size_t count;
  297. count = read(fd, ptr, size * nmemb) / size;
  298. if (count < nmemb)
  299. {
  300. LOG_E("ERROR: file size error!");
  301. break;
  302. }
  303. ptr = (void *)((uint8_t *)ptr + (count * size));
  304. nmemb -= count;
  305. read_block += count;
  306. }
  307. return read_block;
  308. }
  309. typedef struct
  310. {
  311. Elf_Word st_name;
  312. Elf_Addr st_value;
  313. Elf_Word st_size;
  314. unsigned char st_info;
  315. unsigned char st_other;
  316. Elf_Half st_shndx;
  317. } Elf_sym;
  318. #ifdef RT_USING_USERSPACE
  319. 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);
  320. #else
  321. 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);
  322. #endif
  323. #ifdef RT_USING_USERSPACE
  324. struct map_range
  325. {
  326. void *start;
  327. size_t size;
  328. };
  329. static void expand_map_range(struct map_range *m, void *start, size_t size)
  330. {
  331. if (!m->start)
  332. {
  333. m->start = start;
  334. m->size = size;
  335. }
  336. else
  337. {
  338. void *end = (void *)((char*)start + size);
  339. void *mend = (void *)((char*)m->start + m->size);
  340. if (m->start > start)
  341. {
  342. m->start = start;
  343. }
  344. if (mend < end)
  345. {
  346. mend = end;
  347. }
  348. m->size = (char *)mend - (char *)m->start;
  349. }
  350. }
  351. static int map_range_ckeck(struct map_range *m1, struct map_range *m2)
  352. {
  353. void *m1_start = (void *)((size_t)m1->start & ~ARCH_PAGE_MASK);
  354. void *m1_end = (void *)((((size_t)m1->start + m1->size) + ARCH_PAGE_MASK) & ~ARCH_PAGE_MASK);
  355. void *m2_start = (void *)((size_t)m2->start & ~ARCH_PAGE_MASK);
  356. void *m2_end = (void *)((((size_t)m2->start + m2->size) + ARCH_PAGE_MASK) & ~ARCH_PAGE_MASK);
  357. if (m1->size)
  358. {
  359. if (m1_start < (void *)USER_LOAD_VADDR)
  360. {
  361. return -1;
  362. }
  363. if (m1_start > (void *)USER_STACK_VSTART)
  364. {
  365. return -1;
  366. }
  367. if (m1_end < (void *)USER_LOAD_VADDR)
  368. {
  369. return -1;
  370. }
  371. if (m1_end > (void *)USER_STACK_VSTART)
  372. {
  373. return -1;
  374. }
  375. }
  376. if (m2->size)
  377. {
  378. if (m2_start < (void *)USER_LOAD_VADDR)
  379. {
  380. return -1;
  381. }
  382. if (m2_start > (void *)USER_STACK_VSTART)
  383. {
  384. return -1;
  385. }
  386. if (m2_end < (void *)USER_LOAD_VADDR)
  387. {
  388. return -1;
  389. }
  390. if (m2_end > (void *)USER_STACK_VSTART)
  391. {
  392. return -1;
  393. }
  394. }
  395. if ((m1->size != 0) && (m2->size != 0))
  396. {
  397. if (m1_start < m2_start)
  398. {
  399. if (m1_end > m2_start)
  400. {
  401. return -1;
  402. }
  403. }
  404. else /* m2_start <= m1_start */
  405. {
  406. if (m2_end > m1_start)
  407. {
  408. return -1;
  409. }
  410. }
  411. }
  412. return 0;
  413. }
  414. #endif
  415. static int load_elf(int fd, int len, struct rt_lwp *lwp, uint8_t *load_addr, struct process_aux *aux)
  416. {
  417. uint32_t i;
  418. uint32_t off = 0;
  419. size_t load_off = 0;
  420. char *p_section_str = 0;
  421. Elf_sym *dynsym = 0;
  422. Elf_Ehdr eheader;
  423. Elf_Phdr pheader;
  424. Elf_Shdr sheader;
  425. int result = RT_EOK;
  426. uint32_t magic;
  427. size_t read_len;
  428. void *got_start = 0;
  429. size_t got_size = 0;
  430. void *rel_dyn_start = 0;
  431. size_t rel_dyn_size = 0;
  432. size_t dynsym_off = 0;
  433. size_t dynsym_size = 0;
  434. #ifdef RT_USING_USERSPACE
  435. struct map_range user_area[2] = {{NULL, 0}, {NULL, 0}}; /* 0 is text, 1 is data */
  436. void *pa, *va;
  437. void *va_self;
  438. rt_mmu_info *m_info = &lwp->mmu_info;
  439. #endif
  440. if (len < sizeof eheader)
  441. {
  442. return -RT_ERROR;
  443. }
  444. lseek(fd, 0, SEEK_SET);
  445. read_len = load_fread(&magic, 1, sizeof magic, fd);
  446. check_read(read_len, sizeof magic);
  447. if (memcmp(elf_magic, &magic, 4) != 0)
  448. {
  449. return -RT_ERROR;
  450. }
  451. lseek(fd, off, SEEK_SET);
  452. read_len = load_fread(&eheader, 1, sizeof eheader, fd);
  453. check_read(read_len, sizeof eheader);
  454. #ifndef ARCH_CPU_64BIT
  455. if (eheader.e_ident[4] != 1)
  456. { /* not 32bit */
  457. return -RT_ERROR;
  458. }
  459. #else
  460. if (eheader.e_ident[4] != 2)
  461. { /* not 64bit */
  462. return -RT_ERROR;
  463. }
  464. #endif
  465. if (eheader.e_ident[6] != 1)
  466. { /* ver not 1 */
  467. return -RT_ERROR;
  468. }
  469. if ((eheader.e_type != ET_DYN)
  470. #ifdef RT_USING_USERSPACE
  471. && (eheader.e_type != ET_EXEC)
  472. #endif
  473. )
  474. {
  475. /* not pie or exec elf */
  476. return -RT_ERROR;
  477. }
  478. #ifdef RT_USING_USERSPACE
  479. {
  480. off = eheader.e_phoff;
  481. for (i = 0; i < eheader.e_phnum; i++, off += sizeof pheader)
  482. {
  483. check_off(off, len);
  484. lseek(fd, off, SEEK_SET);
  485. read_len = load_fread(&pheader, 1, sizeof pheader, fd);
  486. check_read(read_len, sizeof pheader);
  487. if (pheader.p_type == PT_DYNAMIC)
  488. {
  489. /* load ld.so */
  490. return 1; /* 1 means dynamic */
  491. }
  492. }
  493. }
  494. #endif
  495. if (eheader.e_entry != 0)
  496. {
  497. if ((eheader.e_entry != USER_LOAD_VADDR)
  498. && (eheader.e_entry != LDSO_LOAD_VADDR))
  499. {
  500. /* the entry is invalidate */
  501. return -RT_ERROR;
  502. }
  503. }
  504. { /* load aux */
  505. uint8_t *process_header;
  506. size_t process_header_size;
  507. off = eheader.e_phoff;
  508. process_header_size = eheader.e_phnum * sizeof pheader;
  509. #ifdef RT_USING_USERSPACE
  510. if (process_header_size > ARCH_PAGE_SIZE - sizeof(char[16]))
  511. {
  512. return -RT_ERROR;
  513. }
  514. va = (uint8_t *)lwp_map_user(lwp, (void *)(USER_VADDR_TOP - ARCH_PAGE_SIZE * 2), process_header_size, 0);
  515. if (!va)
  516. {
  517. return -RT_ERROR;
  518. }
  519. pa = rt_hw_mmu_v2p(m_info, va);
  520. process_header = (uint8_t *)pa - PV_OFFSET;
  521. #else
  522. process_header = (uint8_t *)rt_malloc(process_header_size + sizeof(char[16]));
  523. if (!process_header)
  524. {
  525. return -RT_ERROR;
  526. }
  527. #endif
  528. check_off(off, len);
  529. lseek(fd, off, SEEK_SET);
  530. read_len = load_fread(process_header, 1, process_header_size, fd);
  531. check_read(read_len, process_header_size);
  532. #ifdef RT_USING_USERSPACE
  533. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, process_header, process_header_size);
  534. #endif
  535. aux->item[1].key = AT_PAGESZ;
  536. #ifdef RT_USING_USERSPACE
  537. aux->item[1].value = ARCH_PAGE_SIZE;
  538. #else
  539. aux->item[1].value = RT_MM_PAGE_SIZE;
  540. #endif
  541. aux->item[2].key = AT_RANDOM;
  542. {
  543. uint32_t random_value = rt_tick_get();
  544. uint8_t *random;
  545. #ifdef RT_USING_USERSPACE
  546. uint8_t *krandom;
  547. random = (uint8_t *)(USER_VADDR_TOP - ARCH_PAGE_SIZE - sizeof(char[16]));
  548. krandom = (uint8_t *)rt_hw_mmu_v2p(m_info, random);
  549. krandom = (uint8_t *)krandom - PV_OFFSET;
  550. rt_memcpy(krandom, &random_value, sizeof random_value);
  551. #else
  552. random = (uint8_t *)(process_header + process_header_size);
  553. rt_memcpy(random, &random_value, sizeof random_value);
  554. #endif
  555. aux->item[2].value = (size_t)random;
  556. }
  557. aux->item[3].key = AT_PHDR;
  558. #ifdef RT_USING_USERSPACE
  559. aux->item[3].value = (size_t)va;
  560. #else
  561. aux->item[3].value = (size_t)process_header;
  562. #endif
  563. aux->item[4].key = AT_PHNUM;
  564. aux->item[4].value = eheader.e_phnum;
  565. aux->item[5].key = AT_PHENT;
  566. aux->item[5].value = sizeof pheader;
  567. #ifdef RT_USING_USERSPACE
  568. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, aux, sizeof *aux);
  569. #endif
  570. }
  571. if (load_addr)
  572. {
  573. load_off = (size_t)load_addr;
  574. }
  575. #ifdef RT_USING_USERSPACE
  576. else
  577. {
  578. /* map user */
  579. off = eheader.e_shoff;
  580. for (i = 0; i < eheader.e_shnum; i++, off += sizeof sheader)
  581. {
  582. check_off(off, len);
  583. lseek(fd, off, SEEK_SET);
  584. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  585. check_read(read_len, sizeof sheader);
  586. if ((sheader.sh_flags & SHF_ALLOC) == 0)
  587. {
  588. continue;
  589. }
  590. switch (sheader.sh_type)
  591. {
  592. case SHT_PROGBITS:
  593. if ((sheader.sh_flags & SHF_WRITE) == 0)
  594. {
  595. expand_map_range(&user_area[0], (void *)sheader.sh_addr, sheader.sh_size);
  596. }
  597. else
  598. {
  599. expand_map_range(&user_area[1], (void *)sheader.sh_addr, sheader.sh_size);
  600. }
  601. break;
  602. case SHT_NOBITS:
  603. expand_map_range(&user_area[1], (void *)sheader.sh_addr, sheader.sh_size);
  604. break;
  605. default:
  606. expand_map_range(&user_area[1], (void *)sheader.sh_addr, sheader.sh_size);
  607. break;
  608. }
  609. }
  610. if (user_area[0].size == 0)
  611. {
  612. /* no code */
  613. result = -RT_ERROR;
  614. goto _exit;
  615. }
  616. if (user_area[0].start == NULL)
  617. {
  618. /* DYN */
  619. load_off = USER_LOAD_VADDR;
  620. user_area[0].start = (void *)((char*)user_area[0].start + load_off);
  621. user_area[1].start = (void *)((char*)user_area[1].start + load_off);
  622. }
  623. if (map_range_ckeck(&user_area[0], &user_area[1]) != 0)
  624. {
  625. result = -RT_ERROR;
  626. goto _exit;
  627. }
  628. /* text and data */
  629. for (i = 0; i < 2; i++)
  630. {
  631. if (user_area[i].size != 0)
  632. {
  633. va = lwp_map_user(lwp, user_area[i].start, user_area[i].size, (int)(i == 0));
  634. if (!va || (va != user_area[i].start))
  635. {
  636. result = -RT_ERROR;
  637. goto _exit;
  638. }
  639. }
  640. }
  641. lwp->text_size = user_area[0].size;
  642. }
  643. #else
  644. else
  645. {
  646. size_t start = -1UL;
  647. size_t end = 0UL;
  648. size_t total_size;
  649. off = eheader.e_shoff;
  650. for (i = 0; i < eheader.e_shnum; i++, off += sizeof sheader)
  651. {
  652. check_off(off, len);
  653. lseek(fd, off, SEEK_SET);
  654. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  655. check_read(read_len, sizeof sheader);
  656. if ((sheader.sh_flags & SHF_ALLOC) == 0)
  657. {
  658. continue;
  659. }
  660. switch (sheader.sh_type)
  661. {
  662. case SHT_PROGBITS:
  663. case SHT_NOBITS:
  664. if (start > sheader.sh_addr)
  665. {
  666. start = sheader.sh_addr;
  667. }
  668. if (sheader.sh_addr + sheader.sh_size > end)
  669. {
  670. end = sheader.sh_addr + sheader.sh_size;
  671. }
  672. break;
  673. default:
  674. break;
  675. }
  676. }
  677. total_size = end - start;
  678. #ifdef RT_USING_CACHE
  679. load_off = (size_t)rt_malloc_align(total_size, RT_CPU_CACHE_LINE_SZ);
  680. #else
  681. load_off = (size_t)rt_malloc(total_size);
  682. #endif
  683. if (load_off == 0)
  684. {
  685. LOG_E("alloc text memory faild!");
  686. result = -RT_ENOMEM;
  687. goto _exit;
  688. }
  689. else
  690. {
  691. LOG_D("lwp text malloc : %p, size: %d!", (void *)load_off, lwp->text_size);
  692. }
  693. lwp->load_off = load_off; /* for free */
  694. lwp->text_size = total_size;
  695. }
  696. #endif
  697. lwp->text_entry = (void *)(eheader.e_entry + load_off);
  698. off = eheader.e_phoff;
  699. for (i = 0; i < eheader.e_phnum; i++, off += sizeof pheader)
  700. {
  701. check_off(off, len);
  702. lseek(fd, off, SEEK_SET);
  703. read_len = load_fread(&pheader, 1, sizeof pheader, fd);
  704. check_read(read_len, sizeof pheader);
  705. if (pheader.p_type == PT_LOAD)
  706. {
  707. if (pheader.p_filesz > pheader.p_memsz)
  708. {
  709. return -RT_ERROR;
  710. }
  711. check_off(pheader.p_offset, len);
  712. lseek(fd, pheader.p_offset, SEEK_SET);
  713. #ifdef RT_USING_USERSPACE
  714. {
  715. uint32_t size = pheader.p_filesz;
  716. size_t tmp_len = 0;
  717. va = (void *)(pheader.p_vaddr + load_addr);
  718. read_len = 0;
  719. while (size)
  720. {
  721. pa = rt_hw_mmu_v2p(m_info, va);
  722. va_self = (void *)((char *)pa - PV_OFFSET);
  723. LOG_D("va_self = %p pa = %p", va_self, pa);
  724. tmp_len = (size < ARCH_PAGE_SIZE) ? size : ARCH_PAGE_SIZE;
  725. tmp_len = load_fread(va_self, 1, tmp_len, fd);
  726. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, va_self, tmp_len);
  727. read_len += tmp_len;
  728. size -= tmp_len;
  729. va = (void *)((char *)va + ARCH_PAGE_SIZE);
  730. }
  731. }
  732. #else
  733. read_len = load_fread((void*)(pheader.p_vaddr + load_off), 1, pheader.p_filesz, fd);
  734. #endif
  735. check_read(read_len, pheader.p_filesz);
  736. if (pheader.p_filesz < pheader.p_memsz)
  737. {
  738. #ifdef RT_USING_USERSPACE
  739. uint32_t size = pheader.p_memsz - pheader.p_filesz;
  740. uint32_t size_s;
  741. uint32_t off;
  742. off = pheader.p_filesz & ARCH_PAGE_MASK;
  743. va = (void *)((pheader.p_vaddr + pheader.p_filesz + load_off) & ~ARCH_PAGE_MASK);
  744. while (size)
  745. {
  746. size_s = (size < ARCH_PAGE_SIZE - off) ? size : ARCH_PAGE_SIZE - off;
  747. pa = rt_hw_mmu_v2p(m_info, va);
  748. va_self = (void *)((char *)pa - PV_OFFSET);
  749. memset((void *)((char *)va_self + off), 0, size_s);
  750. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, (void *)((char *)va_self + off), size_s);
  751. off = 0;
  752. size -= size_s;
  753. va = (void *)((char *)va + ARCH_PAGE_SIZE);
  754. }
  755. #else
  756. memset((uint8_t *)pheader.p_vaddr + pheader.p_filesz + load_off, 0, (size_t)(pheader.p_memsz - pheader.p_filesz));
  757. #endif
  758. }
  759. }
  760. }
  761. /* relocate */
  762. if (eheader.e_type == ET_DYN)
  763. {
  764. /* section info */
  765. off = eheader.e_shoff;
  766. /* find section string table */
  767. check_off(off, len);
  768. lseek(fd, off + (sizeof sheader) * eheader.e_shstrndx, SEEK_SET);
  769. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  770. check_read(read_len, sizeof sheader);
  771. p_section_str = (char *)rt_malloc(sheader.sh_size);
  772. if (!p_section_str)
  773. {
  774. LOG_E("out of memory!");
  775. result = -ENOMEM;
  776. goto _exit;
  777. }
  778. check_off(sheader.sh_offset, len);
  779. lseek(fd, sheader.sh_offset, SEEK_SET);
  780. read_len = load_fread(p_section_str, 1, sheader.sh_size, fd);
  781. check_read(read_len, sheader.sh_size);
  782. check_off(off, len);
  783. lseek(fd, off, SEEK_SET);
  784. for (i = 0; i < eheader.e_shnum; i++, off += sizeof sheader)
  785. {
  786. read_len = load_fread(&sheader, 1, sizeof sheader, fd);
  787. check_read(read_len, sizeof sheader);
  788. if (strcmp(p_section_str + sheader.sh_name, ".got") == 0)
  789. {
  790. got_start = (void *)((uint8_t *)sheader.sh_addr + load_off);
  791. got_size = (size_t)sheader.sh_size;
  792. }
  793. else if (strcmp(p_section_str + sheader.sh_name, ".rel.dyn") == 0)
  794. {
  795. rel_dyn_start = (void *)((uint8_t *)sheader.sh_addr + load_off);
  796. rel_dyn_size = (size_t)sheader.sh_size;
  797. }
  798. else if (strcmp(p_section_str + sheader.sh_name, ".dynsym") == 0)
  799. {
  800. dynsym_off = (size_t)sheader.sh_offset;
  801. dynsym_size = (size_t)sheader.sh_size;
  802. }
  803. }
  804. /* reloc */
  805. if (dynsym_size)
  806. {
  807. dynsym = rt_malloc(dynsym_size);
  808. if (!dynsym)
  809. {
  810. LOG_E("ERROR: Malloc error!");
  811. result = -ENOMEM;
  812. goto _exit;
  813. }
  814. check_off(dynsym_off, len);
  815. lseek(fd, dynsym_off, SEEK_SET);
  816. read_len = load_fread(dynsym, 1, dynsym_size, fd);
  817. check_read(read_len, dynsym_size);
  818. }
  819. #ifdef RT_USING_USERSPACE
  820. lwp_elf_reloc(m_info, (void *)load_off, rel_dyn_start, rel_dyn_size, got_start, got_size, dynsym);
  821. #else
  822. lwp_elf_reloc((void *)load_off, rel_dyn_start, rel_dyn_size, got_start, got_size, dynsym);
  823. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, lwp->text_entry, lwp->text_size);
  824. rt_hw_cpu_icache_ops(RT_HW_CACHE_INVALIDATE, lwp->text_entry, lwp->text_size);
  825. #endif
  826. }
  827. LOG_D("lwp->text_entry = 0x%p", lwp->text_entry);
  828. LOG_D("lwp->text_size = 0x%p", lwp->text_size);
  829. _exit:
  830. if (dynsym)
  831. {
  832. rt_free(dynsym);
  833. }
  834. if (p_section_str)
  835. {
  836. rt_free(p_section_str);
  837. }
  838. if (result != RT_EOK)
  839. {
  840. LOG_E("lwp load faild, %d", result);
  841. }
  842. return result;
  843. }
  844. #endif /* ARCH_MM_MMU */
  845. RT_WEAK int lwp_load(const char *filename, struct rt_lwp *lwp, uint8_t *load_addr, size_t addr_size, struct process_aux *aux)
  846. {
  847. uint8_t *ptr;
  848. int ret = -1;
  849. int len;
  850. int fd = -1;
  851. /* check file name */
  852. RT_ASSERT(filename != RT_NULL);
  853. /* check lwp control block */
  854. RT_ASSERT(lwp != RT_NULL);
  855. /* copy file name to process name */
  856. rt_strncpy(lwp->cmd, filename, RT_NAME_MAX);
  857. if (load_addr != RT_NULL)
  858. {
  859. lwp->lwp_type = LWP_TYPE_FIX_ADDR;
  860. ptr = load_addr;
  861. }
  862. else
  863. {
  864. lwp->lwp_type = LWP_TYPE_DYN_ADDR;
  865. ptr = RT_NULL;
  866. }
  867. fd = open(filename, O_BINARY | O_RDONLY, 0);
  868. if (fd < 0)
  869. {
  870. LOG_E("ERROR: Can't open elf file %s!", filename);
  871. goto out;
  872. }
  873. len = lseek(fd, 0, SEEK_END);
  874. if (len < 0)
  875. {
  876. LOG_E("ERROR: File %s size error!", filename);
  877. goto out;
  878. }
  879. lseek(fd, 0, SEEK_SET);
  880. ret = load_elf(fd, len, lwp, ptr, aux);
  881. if ((ret != RT_EOK) && (ret != 1))
  882. {
  883. LOG_E("lwp load ret = %d", ret);
  884. }
  885. out:
  886. if (fd > 0)
  887. {
  888. close(fd);
  889. }
  890. return ret;
  891. }
  892. void lwp_cleanup(struct rt_thread *tid)
  893. {
  894. rt_base_t level;
  895. struct rt_lwp *lwp;
  896. if (tid == NULL)
  897. {
  898. return;
  899. }
  900. LOG_I("cleanup thread: %s, stack_addr: %08X", tid->name, tid->stack_addr);
  901. level = rt_hw_interrupt_disable();
  902. lwp = (struct rt_lwp *)tid->lwp;
  903. lwp_tid_put(tid->tid);
  904. rt_list_remove(&tid->sibling);
  905. lwp_ref_dec(lwp);
  906. rt_hw_interrupt_enable(level);
  907. return;
  908. }
  909. static void lwp_copy_stdio_fdt(struct rt_lwp *lwp)
  910. {
  911. struct dfs_fd *d;
  912. struct dfs_fdtable *lwp_fdt;
  913. lwp_fdt = &lwp->fdt;
  914. /* init 4 fds */
  915. lwp_fdt->fds = rt_calloc(4, sizeof(void *));
  916. if (lwp_fdt->fds)
  917. {
  918. lwp_fdt->maxfd = 4;
  919. d = fd_get(0);
  920. fd_associate(lwp_fdt, 0, d);
  921. d = fd_get(1);
  922. fd_associate(lwp_fdt, 1, d);
  923. d = fd_get(2);
  924. fd_associate(lwp_fdt, 2, d);
  925. }
  926. return;
  927. }
  928. static void lwp_thread_entry(void *parameter)
  929. {
  930. rt_thread_t tid;
  931. struct rt_lwp *lwp;
  932. tid = rt_thread_self();
  933. lwp = (struct rt_lwp *)tid->lwp;
  934. tid->cleanup = lwp_cleanup;
  935. tid->user_stack = RT_NULL;
  936. if (lwp->debug)
  937. {
  938. lwp->bak_first_ins = *(uint32_t *)lwp->text_entry;
  939. *(uint32_t *)lwp->text_entry = dbg_get_ins();
  940. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, lwp->text_entry, sizeof(uint32_t));
  941. icache_invalid_all();
  942. }
  943. #ifdef ARCH_MM_MMU
  944. lwp_user_entry(lwp->args, lwp->text_entry, (void *)USER_STACK_VEND, tid->stack_addr + tid->stack_size);
  945. #else
  946. lwp_user_entry(lwp->args, lwp->text_entry, lwp->data_entry, (void *)((uint32_t)lwp->data_entry + lwp->data_size));
  947. #endif /* ARCH_MM_MMU */
  948. }
  949. struct rt_lwp *lwp_self(void)
  950. {
  951. rt_thread_t tid;
  952. tid = rt_thread_self();
  953. if (tid)
  954. {
  955. return (struct rt_lwp *)tid->lwp;
  956. }
  957. return RT_NULL;
  958. }
  959. pid_t lwp_execve(char *filename, int debug, int argc, char **argv, char **envp)
  960. {
  961. int result;
  962. rt_base_t level;
  963. struct rt_lwp *lwp;
  964. char *thread_name;
  965. char *argv_last = argv[argc - 1];
  966. int bg = 0;
  967. struct process_aux *aux;
  968. int tid = 0;
  969. if (filename == RT_NULL)
  970. {
  971. return -RT_ERROR;
  972. }
  973. lwp = lwp_new();
  974. if (lwp == RT_NULL)
  975. {
  976. dbg_log(DBG_ERROR, "lwp struct out of memory!\n");
  977. return -RT_ENOMEM;
  978. }
  979. LOG_D("lwp malloc : %p, size: %d!", lwp, sizeof(struct rt_lwp));
  980. if ((tid = lwp_tid_get()) == 0)
  981. {
  982. lwp_ref_dec(lwp);
  983. return -ENOMEM;
  984. }
  985. #ifdef RT_USING_USERSPACE
  986. if (lwp_user_space_init(lwp) != 0)
  987. {
  988. lwp_tid_put(tid);
  989. lwp_ref_dec(lwp);
  990. return -ENOMEM;
  991. }
  992. #endif
  993. if (argv_last[0] == '&' && argv_last[1] == '\0')
  994. {
  995. argc--;
  996. bg = 1;
  997. }
  998. if ((aux = lwp_argscopy(lwp, argc, argv, envp)) == RT_NULL)
  999. {
  1000. lwp_tid_put(tid);
  1001. lwp_ref_dec(lwp);
  1002. return -ENOMEM;
  1003. }
  1004. result = lwp_load(filename, lwp, RT_NULL, 0, aux);
  1005. #ifdef ARCH_MM_MMU
  1006. if (result == 1)
  1007. {
  1008. /* dynmaic */
  1009. lwp_unmap_user(lwp, (void *)(USER_VADDR_TOP - ARCH_PAGE_SIZE));
  1010. result = load_ldso(lwp, filename, argv, envp);
  1011. }
  1012. #endif /* ARCH_MM_MMU */
  1013. if (result == RT_EOK)
  1014. {
  1015. rt_thread_t thread = RT_NULL;
  1016. rt_uint32_t priority = 25, tick = 200;
  1017. lwp_copy_stdio_fdt(lwp);
  1018. /* obtain the base name */
  1019. thread_name = strrchr(filename, '/');
  1020. thread_name = thread_name ? thread_name + 1 : filename;
  1021. #ifndef ARCH_MM_MMU
  1022. struct lwp_app_head *app_head = lwp->text_entry;
  1023. if (app_head->priority)
  1024. {
  1025. priority = app_head->priority;
  1026. }
  1027. if (app_head->tick)
  1028. {
  1029. tick = app_head->tick;
  1030. }
  1031. #endif /* not defined ARCH_MM_MMU */
  1032. thread = rt_thread_create(thread_name, lwp_thread_entry, RT_NULL,
  1033. LWP_TASK_STACK_SIZE, priority, tick);
  1034. if (thread != RT_NULL)
  1035. {
  1036. struct rt_lwp *self_lwp;
  1037. thread->tid = tid;
  1038. lwp_tid_set_thread(tid, thread);
  1039. LOG_D("lwp kernel => (0x%08x, 0x%08x)\n", (rt_uint32_t)thread->stack_addr,
  1040. (rt_uint32_t)thread->stack_addr + thread->stack_size);
  1041. level = rt_hw_interrupt_disable();
  1042. self_lwp = lwp_self();
  1043. if (self_lwp)
  1044. {
  1045. //lwp->tgroup_leader = &thread; //add thread group leader for lwp
  1046. lwp->__pgrp = tid;
  1047. lwp->session = self_lwp->session;
  1048. /* lwp add to children link */
  1049. lwp->sibling = self_lwp->first_child;
  1050. self_lwp->first_child = lwp;
  1051. lwp->parent = self_lwp;
  1052. }
  1053. else
  1054. {
  1055. //lwp->tgroup_leader = &thread; //add thread group leader for lwp
  1056. lwp->__pgrp = tid;
  1057. }
  1058. if (!bg)
  1059. {
  1060. if (lwp->session == -1)
  1061. {
  1062. struct tty_struct *tty = RT_NULL;
  1063. tty = (struct tty_struct *)console_tty_get();
  1064. lwp->tty = tty;
  1065. lwp->tty->pgrp = lwp->__pgrp;
  1066. lwp->tty->session = lwp->session;
  1067. lwp->tty->foreground = lwp;
  1068. tcgetattr(1, &stdin_termios);
  1069. old_stdin_termios = stdin_termios;
  1070. stdin_termios.c_lflag |= ICANON | ECHO | ECHOCTL;
  1071. tcsetattr(1, 0, &stdin_termios);
  1072. }
  1073. else
  1074. {
  1075. if (self_lwp != RT_NULL)
  1076. {
  1077. lwp->tty = self_lwp->tty;
  1078. lwp->tty->pgrp = lwp->__pgrp;
  1079. lwp->tty->session = lwp->session;
  1080. lwp->tty->foreground = lwp;
  1081. }
  1082. else
  1083. {
  1084. lwp->tty = RT_NULL;
  1085. }
  1086. }
  1087. }
  1088. thread->lwp = lwp;
  1089. #ifndef ARCH_MM_MMU
  1090. struct lwp_app_head *app_head = (struct lwp_app_head*)lwp->text_entry;
  1091. thread->user_stack = app_head->stack_offset ?
  1092. (void *)(app_head->stack_offset -
  1093. app_head->data_offset +
  1094. (uint32_t)lwp->data_entry) : RT_NULL;
  1095. thread->user_stack_size = app_head->stack_size;
  1096. /* init data area */
  1097. rt_memset(lwp->data_entry, 0, lwp->data_size);
  1098. /* init user stack */
  1099. rt_memset(thread->user_stack, '#', thread->user_stack_size);
  1100. #endif /* not defined ARCH_MM_MMU */
  1101. rt_list_insert_after(&lwp->t_grp, &thread->sibling);
  1102. if (debug && rt_dbg_ops)
  1103. {
  1104. lwp->debug = debug;
  1105. }
  1106. rt_hw_interrupt_enable(level);
  1107. rt_thread_startup(thread);
  1108. return lwp_to_pid(lwp);
  1109. }
  1110. }
  1111. lwp_tid_put(tid);
  1112. lwp_ref_dec(lwp);
  1113. return -RT_ERROR;
  1114. }
  1115. #ifdef RT_USING_MUSL
  1116. extern char **__environ;
  1117. #else
  1118. char __environ = 0;
  1119. #endif
  1120. pid_t exec(char *filename, int debug, int argc, char **argv)
  1121. {
  1122. return lwp_execve(filename, debug, argc, argv, __environ);
  1123. }
  1124. #ifdef ARCH_MM_MMU
  1125. void lwp_user_setting_save(rt_thread_t thread)
  1126. {
  1127. if (thread)
  1128. {
  1129. thread->thread_idr = rt_cpu_get_thread_idr();
  1130. }
  1131. }
  1132. void lwp_user_setting_restore(rt_thread_t thread)
  1133. {
  1134. if (!thread)
  1135. {
  1136. return;
  1137. }
  1138. rt_cpu_set_thread_idr(thread->thread_idr);
  1139. if (rt_dbg_ops)
  1140. {
  1141. struct rt_lwp *l = (struct rt_lwp *)thread->lwp;
  1142. if (l != 0)
  1143. {
  1144. set_process_id((size_t)l->pid);
  1145. }
  1146. else
  1147. {
  1148. set_process_id(0);
  1149. }
  1150. if (l && l->debug)
  1151. {
  1152. uint32_t step_type = 0;
  1153. step_type = dbg_step_type();
  1154. if ((step_type == 2) || (thread->step_exec && (step_type == 1)))
  1155. {
  1156. dbg_activate_step();
  1157. }
  1158. else
  1159. {
  1160. dbg_deactivate_step();
  1161. }
  1162. }
  1163. }
  1164. }
  1165. #endif /* ARCH_MM_MMU */