lwp.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401
  1. /*
  2. * File : clock.c
  3. * This file is part of RT-Thread RTOS
  4. * COPYRIGHT (C) 2006 - 2018, RT-Thread Development Team
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License along
  17. * with this program; if not, write to the Free Software Foundation, Inc.,
  18. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  19. *
  20. * Change Logs:
  21. * Date Author Notes
  22. */
  23. #include <rtthread.h>
  24. #include <rthw.h>
  25. #include <dfs_posix.h>
  26. #ifndef RT_USING_DFS
  27. #error "lwp need file system(RT_USING_DFS)"
  28. #endif
  29. #include "lwp.h"
  30. #define DBG_ENABLE
  31. #define DBG_SECTION_NAME "LWP"
  32. #define DBG_COLOR
  33. #define DBG_LEVEL DBG_WARNING
  34. #include <rtdbg.h>
  35. extern rt_thread_t rt_current_thread;
  36. extern void lwp_user_entry(void *args, const void *text, void *data);
  37. /**
  38. * RT-Thread light-weight process
  39. */
  40. void lwp_set_kernel_sp(uint32_t *sp)
  41. {
  42. struct rt_lwp *user_data;
  43. user_data = (struct rt_lwp *)rt_current_thread->user_data;
  44. user_data->kernel_sp = sp;
  45. }
  46. uint32_t *lwp_get_kernel_sp(void)
  47. {
  48. struct rt_lwp *user_data;
  49. user_data = (struct rt_lwp *)rt_current_thread->user_data;
  50. return user_data->kernel_sp;
  51. }
  52. static int lwp_argscopy(struct rt_lwp *lwp, int argc, char **argv)
  53. {
  54. int size = sizeof(int)*3; /* store argc, argv, NULL */
  55. int *args;
  56. char *str;
  57. char **new_argv;
  58. int i;
  59. int len;
  60. for (i = 0; i < argc; i ++)
  61. {
  62. size += (rt_strlen(argv[i]) + 1);
  63. }
  64. size += (sizeof(int) * argc);
  65. args = (int*)rt_malloc(size);
  66. if (args == RT_NULL)
  67. return -1;
  68. str = (char*)((int)args + (argc + 3) * sizeof(int));
  69. new_argv = (char**)&args[2];
  70. args[0] = argc;
  71. args[1] = (int)new_argv;
  72. for (i = 0; i < argc; i ++)
  73. {
  74. len = rt_strlen(argv[i]) + 1;
  75. new_argv[i] = str;
  76. rt_memcpy(str, argv[i], len);
  77. str += len;
  78. }
  79. new_argv[i] = 0;
  80. lwp->args = args;
  81. return 0;
  82. }
  83. static int lwp_load(const char *filename, struct rt_lwp *lwp, uint8_t *load_addr, size_t addr_size)
  84. {
  85. int fd;
  86. uint8_t *ptr;
  87. int result = RT_EOK;
  88. int nbytes;
  89. struct lwp_header header;
  90. struct lwp_chunk chunk;
  91. /* check file name */
  92. RT_ASSERT(filename != RT_NULL);
  93. /* check lwp control block */
  94. RT_ASSERT(lwp != RT_NULL);
  95. if (load_addr != RT_NULL)
  96. {
  97. lwp->lwp_type = LWP_TYPE_FIX_ADDR;
  98. ptr = load_addr;
  99. }
  100. else
  101. {
  102. lwp->lwp_type = LWP_TYPE_DYN_ADDR;
  103. ptr = RT_NULL;
  104. }
  105. /* open lwp */
  106. fd = open(filename, 0, O_RDONLY);
  107. if (fd < 0)
  108. {
  109. dbg_log(DBG_ERROR, "open file:%s failed!\n", filename);
  110. result = -RT_ENOSYS;
  111. goto _exit;
  112. }
  113. /* read lwp header */
  114. nbytes = read(fd, &header, sizeof(struct lwp_header));
  115. if (nbytes != sizeof(struct lwp_header))
  116. {
  117. dbg_log(DBG_ERROR, "read lwp header return error size: %d!\n", nbytes);
  118. result = -RT_EIO;
  119. goto _exit;
  120. }
  121. /* check file header */
  122. if (header.magic != LWP_MAGIC)
  123. {
  124. dbg_log(DBG_ERROR, "erro header magic number: 0x%02X\n", header.magic);
  125. result = -RT_EINVAL;
  126. goto _exit;
  127. }
  128. /* read text chunk info */
  129. nbytes = read(fd, &chunk, sizeof(struct lwp_chunk));
  130. if (nbytes != sizeof(struct lwp_chunk))
  131. {
  132. dbg_log(DBG_ERROR, "read text chunk info failed!\n");
  133. result = -RT_EIO;
  134. goto _exit;
  135. }
  136. dbg_log(DBG_LOG, "chunk name: %s, total len %d, data %d, need space %d!\n",
  137. "text", /*chunk.name*/ chunk.total_len, chunk.data_len, chunk.data_len_space);
  138. /* load text */
  139. {
  140. lwp->text_size = RT_ALIGN(chunk.data_len_space, 4);
  141. if (load_addr)
  142. lwp->text_entry = ptr;
  143. else
  144. {
  145. #ifdef RT_USING_CACHE
  146. lwp->text_entry = (rt_uint8_t *)rt_malloc_align(lwp->text_size, RT_CPU_CACHE_LINE_SZ);
  147. #else
  148. lwp->text_entry = (rt_uint8_t *)rt_malloc(lwp->text_size);
  149. #endif
  150. if (lwp->text_entry == RT_NULL)
  151. {
  152. dbg_log(DBG_ERROR, "alloc text memory faild!\n");
  153. result = -RT_ENOMEM;
  154. goto _exit;
  155. }
  156. else
  157. {
  158. dbg_log(DBG_LOG, "lwp text malloc : %p, size: %d!\n", lwp->text_entry, lwp->text_size);
  159. }
  160. }
  161. dbg_log(DBG_INFO, "load text %d => (0x%08x, 0x%08x)\n", lwp->text_size, (uint32_t)lwp->text_entry, (uint32_t)lwp->text_entry + lwp->text_size);
  162. nbytes = read(fd, lwp->text_entry, chunk.data_len);
  163. if (nbytes != chunk.data_len)
  164. {
  165. dbg_log(DBG_ERROR, "read text region from file failed!\n");
  166. result = -RT_EIO;
  167. goto _exit;
  168. }
  169. #ifdef RT_USING_CACHE
  170. else
  171. {
  172. rt_hw_cpu_dcache_ops(RT_HW_CACHE_FLUSH, lwp->text_entry, lwp->text_size);
  173. rt_hw_cpu_icache_ops(RT_HW_CACHE_INVALIDATE, lwp->text_entry, lwp->text_size);
  174. }
  175. #endif
  176. if (ptr != RT_NULL) ptr += nbytes;
  177. /* skip text hole */
  178. if ((chunk.total_len - sizeof(struct lwp_chunk) - chunk.data_len))
  179. {
  180. dbg_log(DBG_LOG, "skip text hole %d!\n", (chunk.total_len - sizeof(struct lwp_chunk) - chunk.data_len));
  181. lseek(fd, (chunk.total_len - sizeof(struct lwp_chunk) - chunk.data_len), SEEK_CUR);
  182. }
  183. }
  184. /* load data */
  185. nbytes = read(fd, &chunk, sizeof(struct lwp_chunk));
  186. if (nbytes != sizeof(struct lwp_chunk))
  187. {
  188. dbg_log(DBG_ERROR, "read data chunk info failed!\n");
  189. result = -RT_EIO;
  190. goto _exit;
  191. }
  192. dbg_log(DBG_LOG, "chunk name: %s, total len %d, data %d, need space %d!\n",
  193. chunk.name, chunk.total_len, chunk.data_len, chunk.data_len_space);
  194. {
  195. lwp->data_size = RT_ALIGN(chunk.data_len_space, 4);
  196. if (load_addr)
  197. lwp->data = ptr;
  198. else
  199. {
  200. lwp->data = rt_malloc(lwp->data_size);
  201. if (lwp->data == RT_NULL)
  202. {
  203. dbg_log(DBG_ERROR, "alloc data memory faild!\n");
  204. result = -RT_ENOMEM;
  205. goto _exit;
  206. }
  207. else
  208. {
  209. dbg_log(DBG_LOG, "lwp data malloc : %p, size: %d!\n", lwp->data, lwp->data_size);
  210. rt_memset(lwp->data, 0, lwp->data_size);
  211. }
  212. }
  213. dbg_log(DBG_INFO, "load data %d => (0x%08x, 0x%08x)\n", lwp->data_size, (uint32_t)lwp->data, (uint32_t)lwp->data + lwp->data_size);
  214. nbytes = read(fd, lwp->data, chunk.data_len);
  215. if (nbytes != chunk.data_len)
  216. {
  217. dbg_log(DBG_ERROR, "read data region from file failed!\n");
  218. result = -RT_ERROR;
  219. goto _exit;
  220. }
  221. }
  222. _exit:
  223. if (fd >= 0)
  224. close(fd);
  225. if (result != RT_EOK)
  226. {
  227. if (lwp->lwp_type == LWP_TYPE_DYN_ADDR)
  228. {
  229. dbg_log(DBG_ERROR, "lwp dynamic load faild, %d\n", result);
  230. if (lwp->text_entry)
  231. {
  232. dbg_log(DBG_LOG, "lwp text free: %p\n", lwp->text_entry);
  233. #ifdef RT_USING_CACHE
  234. rt_free_align(lwp->text_entry);
  235. #else
  236. rt_free(lwp->text_entry);
  237. #endif
  238. }
  239. if (lwp->data)
  240. {
  241. dbg_log(DBG_LOG, "lwp data free: %p\n", lwp->data);
  242. rt_free(lwp->data);
  243. }
  244. }
  245. }
  246. return result;
  247. }
  248. static void lwp_cleanup(struct rt_thread *tid)
  249. {
  250. struct rt_lwp *lwp;
  251. dbg_log(DBG_INFO, "thread: %s, stack_addr: %08X\n", tid->name, tid->stack_addr);
  252. lwp = (struct rt_lwp *)tid->user_data;
  253. if (lwp->lwp_type == LWP_TYPE_DYN_ADDR)
  254. {
  255. dbg_log(DBG_INFO, "dynamic lwp\n");
  256. if (lwp->text_entry)
  257. {
  258. dbg_log(DBG_LOG, "lwp text free: %p\n", lwp->text_entry);
  259. #ifdef RT_USING_CACHE
  260. rt_free_align(lwp->text_entry);
  261. #else
  262. rt_free(lwp->text_entry);
  263. #endif
  264. }
  265. if (lwp->data)
  266. {
  267. dbg_log(DBG_LOG, "lwp data free: %p\n", lwp->data);
  268. rt_free(lwp->data);
  269. }
  270. }
  271. dbg_log(DBG_LOG, "lwp free memory pages\n");
  272. rt_lwp_mem_deinit(lwp);
  273. /* cleanup fd table */
  274. while (lwp->fdt.maxfd > 0)
  275. {
  276. lwp->fdt.maxfd --;
  277. close(lwp->fdt.maxfd);
  278. }
  279. rt_free(lwp->fdt.fds);
  280. rt_free(lwp->args);
  281. dbg_log(DBG_LOG, "lwp free: %p\n", lwp);
  282. rt_free(lwp);
  283. /* TODO: cleanup fd table */
  284. }
  285. static void lwp_thread(void *parameter)
  286. {
  287. volatile uint32_t tmp;
  288. rt_thread_t tid;
  289. struct rt_lwp *lwp;
  290. rt_kprintf("%08x %08x\n", &tmp, tmp);
  291. lwp = (struct rt_lwp *)parameter;
  292. rt_lwp_mem_init(lwp);
  293. tid = rt_thread_self();
  294. tid->user_data = (rt_uint32_t)lwp;
  295. tid->cleanup = lwp_cleanup;
  296. lwp_user_entry(lwp->args, lwp->text_entry, lwp->data);
  297. }
  298. struct rt_lwp *rt_lwp_self(void)
  299. {
  300. return (struct rt_lwp *)rt_thread_self()->user_data;
  301. }
  302. int exec(char *filename, int argc, char **argv)
  303. {
  304. struct rt_lwp *lwp;
  305. int result;
  306. if (filename == RT_NULL)
  307. return -RT_ERROR;
  308. lwp = (struct rt_lwp *)rt_malloc(sizeof(struct rt_lwp));
  309. if (lwp == RT_NULL)
  310. {
  311. dbg_log(DBG_ERROR, "lwp struct out of memory!\n");
  312. return -RT_ENOMEM;
  313. }
  314. dbg_log(DBG_INFO, "lwp malloc : %p, size: %d!\n", lwp, sizeof(struct rt_lwp));
  315. rt_memset(lwp, 0, sizeof(*lwp));
  316. if (lwp_argscopy(lwp, argc, argv) != 0)
  317. {
  318. rt_free(lwp);
  319. return -ENOMEM;
  320. }
  321. result = lwp_load(filename, lwp, RT_NULL, 0);
  322. if (result == RT_EOK)
  323. {
  324. rt_thread_t tid;
  325. tid = rt_thread_create("user", lwp_thread, (void *)lwp,
  326. 1024 * 4, 2, 200);
  327. if (tid != RT_NULL)
  328. {
  329. dbg_log(DBG_LOG, "lwp kernel => (0x%08x, 0x%08x)\n", (rt_uint32_t)tid->stack_addr, (rt_uint32_t)tid->stack_addr + tid->stack_size);
  330. rt_thread_startup(tid);
  331. return RT_EOK;
  332. }
  333. else
  334. {
  335. #ifdef RT_USING_CACHE
  336. rt_free_align(lwp->text_entry);
  337. #else
  338. rt_free(lwp->text_entry);
  339. #endif
  340. rt_free(lwp->data);
  341. }
  342. }
  343. rt_free(lwp->args);
  344. rt_free(lwp);
  345. return -RT_ERROR;
  346. }