shim_exec.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2014 Stony Brook University
  4. This file is part of Graphene Library OS.
  5. Graphene Library OS is free software: you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public License
  7. as published by the Free Software Foundation, either version 3 of the
  8. License, or (at your option) any later version.
  9. Graphene Library OS is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * shim_epoll.c
  17. *
  18. * Implementation of system call "execve".
  19. */
  20. #include <shim_internal.h>
  21. #include <shim_table.h>
  22. #include <shim_thread.h>
  23. #include <shim_fs.h>
  24. #include <shim_ipc.h>
  25. #include <shim_profile.h>
  26. #include <pal.h>
  27. #include <pal_error.h>
  28. #include <errno.h>
  29. #include <linux/futex.h>
  30. #include <sys/syscall.h>
  31. #include <sys/mman.h>
  32. #include <asm/prctl.h>
  33. static int close_on_exec (struct shim_fd_handle * fd_hdl,
  34. struct shim_handle_map * map, void * arg)
  35. {
  36. if (fd_hdl->flags & FD_CLOEXEC) {
  37. struct shim_handle * hdl = __detach_fd_handle(fd_hdl, NULL, map);
  38. close_handle(hdl);
  39. }
  40. return 0;
  41. }
  42. static int close_cloexec_handle (struct shim_handle_map * map)
  43. {
  44. return walk_handle_map(&close_on_exec, map, NULL);
  45. }
  46. DEFINE_PROFILE_CATAGORY(exec_rtld, exec);
  47. DEFINE_PROFILE_INTERVAL(alloc_new_stack_for_exec, exec_rtld);
  48. DEFINE_PROFILE_INTERVAL(arrange_arguments_for_exec, exec_rtld);
  49. DEFINE_PROFILE_INTERVAL(unmap_executable_for_exec, exec_rtld);
  50. DEFINE_PROFILE_INTERVAL(unmap_loaded_binaries_for_exec, exec_rtld);
  51. DEFINE_PROFILE_INTERVAL(unmap_all_vmas_for_exec, exec_rtld);
  52. DEFINE_PROFILE_INTERVAL(load_new_executable_for_exec, exec_rtld);
  53. static void * old_stack_top, * old_stack, * old_stack_red;
  54. static const char ** new_argp;
  55. static int new_argc;
  56. static elf_auxv_t * new_auxp;
  57. #define REQUIRED_ELF_AUXV 6
  58. int init_brk_from_executable (struct shim_handle * exec);
  59. int shim_do_execve_rtld (struct shim_handle * hdl, const char ** argv,
  60. const char ** envp)
  61. {
  62. BEGIN_PROFILE_INTERVAL();
  63. struct shim_thread * cur_thread = get_cur_thread();
  64. int ret;
  65. if ((ret = close_cloexec_handle(cur_thread->handle_map)) < 0)
  66. return ret;
  67. SAVE_PROFILE_INTERVAL(close_CLOEXEC_files_for_exec);
  68. void * tcb = malloc(sizeof(__libc_tcb_t));
  69. if (!tcb)
  70. return -ENOMEM;
  71. populate_tls(tcb, false);
  72. debug("set tcb to %p\n", tcb);
  73. put_handle(cur_thread->exec);
  74. get_handle(hdl);
  75. cur_thread->exec = hdl;
  76. old_stack_top = cur_thread->stack_top;
  77. old_stack = cur_thread->stack;
  78. old_stack_red = cur_thread->stack_red;
  79. cur_thread->stack_top = NULL;
  80. cur_thread->stack = NULL;
  81. cur_thread->stack_red = NULL;
  82. initial_envp = NULL;
  83. new_argc = 0;
  84. for (const char ** a = argv ; *a ; a++, new_argc++);
  85. if ((ret = init_stack(argv, envp, &new_argp,
  86. REQUIRED_ELF_AUXV, &new_auxp)) < 0)
  87. return ret;
  88. SAVE_PROFILE_INTERVAL(alloc_new_stack_for_exec);
  89. switch_stack(new_argp);
  90. cur_thread = get_cur_thread();
  91. UPDATE_PROFILE_INTERVAL();
  92. DkVirtualMemoryFree(old_stack, old_stack_top - old_stack);
  93. DkVirtualMemoryFree(old_stack_red, old_stack - old_stack_red);
  94. if (bkeep_munmap(old_stack, old_stack_top - old_stack, 0) < 0 ||
  95. bkeep_munmap(old_stack_red, old_stack - old_stack_red, 0) < 0)
  96. bug();
  97. remove_loaded_libraries();
  98. clean_link_map_list();
  99. SAVE_PROFILE_INTERVAL(unmap_loaded_binaries_for_exec);
  100. reset_brk();
  101. size_t count = DEFAULT_VMA_COUNT;
  102. struct shim_vma_val * vmas = malloc(sizeof(struct shim_vma_val) * count);
  103. if (!vmas)
  104. return -ENOMEM;
  105. retry_dump_vmas:
  106. ret = dump_all_vmas(vmas, count);
  107. if (ret == -EOVERFLOW) {
  108. struct shim_vma_val * new_vmas
  109. = malloc(sizeof(struct shim_vma_val) * count * 2);
  110. if (!new_vmas) {
  111. free(vmas);
  112. return -ENOMEM;
  113. }
  114. free(vmas);
  115. vmas = new_vmas;
  116. count *= 2;
  117. goto retry_dump_vmas;
  118. }
  119. if (ret < 0) {
  120. free(vmas);
  121. return ret;
  122. }
  123. count = ret;
  124. for (struct shim_vma_val * vma = vmas ; vma < vmas + count ; vma++) {
  125. /* Don't free the current stack */
  126. if (vma->addr == cur_thread->stack)
  127. continue;
  128. /* Free all the mapped VMAs */
  129. if (!(vma->flags & VMA_UNMAPPED))
  130. DkVirtualMemoryFree(vma->addr, vma->length);
  131. /* Remove the VMAs */
  132. bkeep_munmap(vma->addr, vma->length, vma->flags);
  133. }
  134. free_vma_val_array(vmas, count);
  135. SAVE_PROFILE_INTERVAL(unmap_all_vmas_for_exec);
  136. if ((ret = load_elf_object(cur_thread->exec, NULL, 0)) < 0)
  137. shim_terminate();
  138. init_brk_from_executable(cur_thread->exec);
  139. load_elf_interp(cur_thread->exec);
  140. SAVE_PROFILE_INTERVAL(load_new_executable_for_exec);
  141. cur_thread->robust_list = NULL;
  142. #ifdef PROFILE
  143. if (ENTER_TIME)
  144. SAVE_PROFILE_INTERVAL_SINCE(syscall_execve, ENTER_TIME);
  145. #endif
  146. debug("execve: start execution\n");
  147. execute_elf_object(cur_thread->exec, new_argc, new_argp,
  148. REQUIRED_ELF_AUXV, new_auxp);
  149. return 0;
  150. }
  151. #include <shim_checkpoint.h>
  152. DEFINE_PROFILE_CATAGORY(exec, );
  153. DEFINE_PROFILE_INTERVAL(search_and_check_file_for_exec, exec);
  154. DEFINE_PROFILE_INTERVAL(open_file_for_exec, exec);
  155. DEFINE_PROFILE_INTERVAL(close_CLOEXEC_files_for_exec, exec);
  156. static int migrate_execve (struct shim_cp_store * cpstore,
  157. struct shim_thread * thread,
  158. struct shim_process * process, va_list ap)
  159. {
  160. struct shim_handle_map * handle_map;
  161. const char ** envp = va_arg(ap, const char **);
  162. int ret;
  163. BEGIN_PROFILE_INTERVAL();
  164. if ((ret = dup_handle_map(&handle_map, thread->handle_map)) < 0)
  165. return ret;
  166. set_handle_map(thread, handle_map);
  167. if ((ret = close_cloexec_handle(handle_map)) < 0)
  168. return ret;
  169. SAVE_PROFILE_INTERVAL(close_CLOEXEC_files_for_exec);
  170. /* Now we start to migrate bookkeeping for exec.
  171. The data we need to migrate are:
  172. 1. cur_threadrent thread
  173. 2. cur_threadrent filesystem
  174. 3. handle mapping
  175. 4. each handle */
  176. BEGIN_MIGRATION_DEF(execve,
  177. struct shim_thread * thread,
  178. struct shim_process * proc,
  179. const char ** envp)
  180. {
  181. DEFINE_MIGRATE(process, proc, sizeof(struct shim_process));
  182. DEFINE_MIGRATE(all_mounts, NULL, 0);
  183. DEFINE_MIGRATE(running_thread, thread, sizeof(struct shim_thread));
  184. DEFINE_MIGRATE(handle_map, thread->handle_map,
  185. sizeof (struct shim_handle_map));
  186. DEFINE_MIGRATE(migratable, NULL, 0);
  187. DEFINE_MIGRATE(environ, envp, 0);
  188. }
  189. END_MIGRATION_DEF(execve)
  190. return START_MIGRATE(cpstore, execve, thread, process, envp);
  191. }
  192. int shim_do_execve (const char * file, const char ** argv,
  193. const char ** envp)
  194. {
  195. struct shim_thread * cur_thread = get_cur_thread();
  196. struct shim_dentry * dent = NULL;
  197. int ret = 0, argc = 0;
  198. for (const char ** a = argv ; *a ; a++, argc++);
  199. if (!envp)
  200. envp = initial_envp;
  201. BEGIN_PROFILE_INTERVAL();
  202. DEFINE_LIST(sharg);
  203. struct sharg {
  204. LIST_TYPE(sharg) list;
  205. int len;
  206. char arg[0];
  207. };
  208. DEFINE_LISTP(sharg);
  209. LISTP_TYPE(sharg) shargs;
  210. INIT_LISTP(&shargs);
  211. reopen:
  212. /* XXX: Not sure what to do here yet */
  213. assert(cur_thread);
  214. if ((ret = path_lookupat(NULL, file, LOOKUP_OPEN, &dent, NULL)) < 0)
  215. return ret;
  216. struct shim_mount * fs = dent->fs;
  217. get_dentry(dent);
  218. if (!fs->d_ops->open) {
  219. ret = -EACCES;
  220. err:
  221. put_dentry(dent);
  222. return ret;
  223. }
  224. if (fs->d_ops->mode) {
  225. __kernel_mode_t mode;
  226. if ((ret = fs->d_ops->mode(dent, &mode, 1)) < 0)
  227. goto err;
  228. }
  229. SAVE_PROFILE_INTERVAL(search_and_check_file_for_exec);
  230. struct shim_handle * exec = NULL;
  231. if (!(exec = get_new_handle())) {
  232. ret = -ENOMEM;
  233. goto err;
  234. }
  235. set_handle_fs(exec, fs);
  236. exec->flags = O_RDONLY;
  237. exec->acc_mode = MAY_READ;
  238. ret = fs->d_ops->open(exec, dent, O_RDONLY);
  239. if (qstrempty(&exec->uri)) {
  240. put_handle(exec);
  241. return -EACCES;
  242. }
  243. int pathlen;
  244. char *path = dentry_get_path(dent, true, &pathlen);
  245. qstrsetstr(&exec->path, path, pathlen);
  246. if ((ret = check_elf_object(exec)) < 0 && ret != -EINVAL) {
  247. put_handle(exec);
  248. return ret;
  249. }
  250. if (ret == -EINVAL) { /* it's a shebang */
  251. LISTP_TYPE(sharg) new_shargs;
  252. struct sharg * next = NULL;
  253. bool ended = false, started = false;
  254. char buf[80];
  255. do {
  256. ret = do_handle_read(exec, buf, 80);
  257. if (ret <= 0)
  258. break;
  259. char * s = buf, * c = buf, * e = buf + ret;
  260. if (!started) {
  261. if (ret < 2 || buf[0] != '#' || buf[1] != '!')
  262. break;
  263. s += 2;
  264. c += 2;
  265. started = true;
  266. }
  267. for (; c < e ; c++) {
  268. if (*c == ' ' || *c == '\n' || c == e - 1) {
  269. int l = (*c == ' ' || * c == '\n') ? c - s : e - s;
  270. if (next) {
  271. struct sharg * sh =
  272. __alloca(sizeof(struct sharg) + next->len + l + 1);
  273. sh->len = next->len + l;
  274. memcpy(sh->arg, next->arg, next->len);
  275. memcpy(sh->arg + next->len, s, l);
  276. sh->arg[next->len + l] = 0;
  277. next = sh;
  278. } else {
  279. next = __alloca(sizeof(struct sharg) + l + 1);
  280. next->len = l;
  281. memcpy(next->arg, s, l);
  282. next->arg[l] = 0;
  283. }
  284. if (*c == ' ' || *c == '\n') {
  285. INIT_LIST_HEAD(next, list);
  286. listp_add_tail(next, &new_shargs, list);
  287. next = NULL;
  288. s = c + 1;
  289. if (*c == '\n') {
  290. ended = true;
  291. break;
  292. }
  293. }
  294. }
  295. }
  296. } while (!ended);
  297. if (started) {
  298. if (next) {
  299. INIT_LIST_HEAD(next, list);
  300. listp_add_tail(next, &new_shargs, list);
  301. }
  302. struct sharg * first =
  303. listp_first_entry(&new_shargs, struct sharg, list);
  304. assert(first);
  305. debug("detected as script: run by %s\n", first->arg);
  306. file = first->arg;
  307. listp_splice(&new_shargs, &shargs, list, sharg);
  308. put_handle(exec);
  309. goto reopen;
  310. }
  311. }
  312. SAVE_PROFILE_INTERVAL(open_file_for_exec);
  313. #if EXECVE_RTLD == 1
  314. if (!strcmp_static(PAL_CB(host_type), "Linux-SGX")) {
  315. int is_last = check_last_thread(cur_thread) == 0;
  316. if (is_last) {
  317. debug("execve() in the same process\n");
  318. return shim_do_execve_rtld(exec, argv, envp);
  319. }
  320. debug("execve() in a new process\n");
  321. }
  322. #endif
  323. INC_PROFILE_OCCURENCE(syscall_use_ipc);
  324. if (!listp_empty(&shargs)) {
  325. struct sharg * sh;
  326. int shargc = 0, cnt = 0;
  327. listp_for_each_entry(sh, &shargs, list)
  328. shargc++;
  329. const char ** new_argv =
  330. __alloca(sizeof(const char *) * (argc + shargc + 1));
  331. listp_for_each_entry(sh, &shargs, list)
  332. new_argv[cnt++] = sh->arg;
  333. for (cnt = 0 ; cnt < argc ; cnt++)
  334. new_argv[shargc + cnt] = argv[cnt];
  335. new_argv[shargc + argc] = NULL;
  336. argv = new_argv;
  337. }
  338. lock(cur_thread->lock);
  339. put_handle(cur_thread->exec);
  340. cur_thread->exec = exec;
  341. void * stack = cur_thread->stack;
  342. void * stack_top = cur_thread->stack_top;
  343. void * tcb = cur_thread->tcb;
  344. bool user_tcb = cur_thread->user_tcb;
  345. void * frameptr = cur_thread->frameptr;
  346. cur_thread->stack = NULL;
  347. cur_thread->stack_top = NULL;
  348. cur_thread->frameptr = NULL;
  349. cur_thread->tcb = NULL;
  350. cur_thread->user_tcb = false;
  351. cur_thread->in_vm = false;
  352. unlock(cur_thread->lock);
  353. ret = do_migrate_process(&migrate_execve, exec, argv, cur_thread, envp);
  354. lock(cur_thread->lock);
  355. cur_thread->stack = stack;
  356. cur_thread->stack_top = stack_top;
  357. cur_thread->frameptr = frameptr;
  358. cur_thread->tcb = tcb;
  359. cur_thread->user_tcb = user_tcb;
  360. if (ret < 0) {
  361. cur_thread->in_vm = true;
  362. unlock(cur_thread->lock);
  363. return ret;
  364. }
  365. struct shim_handle_map * handle_map = cur_thread->handle_map;
  366. cur_thread->handle_map = NULL;
  367. unlock(cur_thread->lock);
  368. if (handle_map)
  369. put_handle_map(handle_map);
  370. if (cur_thread->dummy)
  371. switch_dummy_thread(cur_thread);
  372. try_process_exit(0, 0);
  373. return 0;
  374. }