lwp.c 37 KB

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