lwp.c 33 KB

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