lwp.c 36 KB

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