Process.cpp 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728
  1. /*
  2. * Copyright (c) 2018-2021, Andreas Kling <kling@serenityos.org>
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. *
  8. * 1. Redistributions of source code must retain the above copyright notice, this
  9. * list of conditions and the following disclaimer.
  10. *
  11. * 2. Redistributions in binary form must reproduce the above copyright notice,
  12. * this list of conditions and the following disclaimer in the documentation
  13. * and/or other materials provided with the distribution.
  14. *
  15. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  16. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  17. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  18. * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
  19. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  20. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  21. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  22. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  23. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  24. * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  25. */
  26. #include <AK/Demangle.h>
  27. #include <AK/StdLibExtras.h>
  28. #include <AK/StringBuilder.h>
  29. #include <AK/Time.h>
  30. #include <AK/Types.h>
  31. #include <Kernel/API/Syscall.h>
  32. #include <Kernel/Arch/i386/CPU.h>
  33. #include <Kernel/CoreDump.h>
  34. #include <Kernel/Debug.h>
  35. #include <Kernel/Devices/NullDevice.h>
  36. #include <Kernel/FileSystem/Custody.h>
  37. #include <Kernel/FileSystem/FileDescription.h>
  38. #include <Kernel/FileSystem/VirtualFileSystem.h>
  39. #include <Kernel/KBufferBuilder.h>
  40. #include <Kernel/KSyms.h>
  41. #include <Kernel/Module.h>
  42. #include <Kernel/PerformanceEventBuffer.h>
  43. #include <Kernel/Process.h>
  44. #include <Kernel/RTC.h>
  45. #include <Kernel/StdLib.h>
  46. #include <Kernel/TTY/TTY.h>
  47. #include <Kernel/Thread.h>
  48. #include <Kernel/VM/AnonymousVMObject.h>
  49. #include <Kernel/VM/PageDirectory.h>
  50. #include <Kernel/VM/PrivateInodeVMObject.h>
  51. #include <Kernel/VM/SharedInodeVMObject.h>
  52. #include <LibC/errno_numbers.h>
  53. #include <LibC/limits.h>
  54. namespace Kernel {
  55. static void create_signal_trampoline();
  56. RecursiveSpinLock g_processes_lock;
  57. static Atomic<pid_t> next_pid;
  58. READONLY_AFTER_INIT InlineLinkedList<Process>* g_processes;
  59. READONLY_AFTER_INIT String* g_hostname;
  60. READONLY_AFTER_INIT Lock* g_hostname_lock;
  61. READONLY_AFTER_INIT HashMap<String, OwnPtr<Module>>* g_modules;
  62. READONLY_AFTER_INIT Region* g_signal_trampoline_region;
  63. ProcessID Process::allocate_pid()
  64. {
  65. // Overflow is UB, and negative PIDs wreck havoc.
  66. // TODO: Handle PID overflow
  67. // For example: Use an Atomic<u32>, mask the most significant bit,
  68. // retry if PID is already taken as a PID, taken as a TID,
  69. // takes as a PGID, taken as a SID, or zero.
  70. return next_pid.fetch_add(1, AK::MemoryOrder::memory_order_acq_rel);
  71. }
  72. UNMAP_AFTER_INIT void Process::initialize()
  73. {
  74. g_modules = new HashMap<String, OwnPtr<Module>>;
  75. next_pid.store(0, AK::MemoryOrder::memory_order_release);
  76. g_processes = new InlineLinkedList<Process>;
  77. g_process_groups = new InlineLinkedList<ProcessGroup>;
  78. g_hostname = new String("courage");
  79. g_hostname_lock = new Lock;
  80. create_signal_trampoline();
  81. }
  82. Vector<ProcessID> Process::all_pids()
  83. {
  84. Vector<ProcessID> pids;
  85. ScopedSpinLock lock(g_processes_lock);
  86. pids.ensure_capacity((int)g_processes->size_slow());
  87. for (auto& process : *g_processes)
  88. pids.append(process.pid());
  89. return pids;
  90. }
  91. NonnullRefPtrVector<Process> Process::all_processes()
  92. {
  93. NonnullRefPtrVector<Process> processes;
  94. ScopedSpinLock lock(g_processes_lock);
  95. processes.ensure_capacity((int)g_processes->size_slow());
  96. for (auto& process : *g_processes)
  97. processes.append(NonnullRefPtr<Process>(process));
  98. return processes;
  99. }
  100. bool Process::in_group(gid_t gid) const
  101. {
  102. return this->gid() == gid || m_extra_gids.contains_slow(gid);
  103. }
  104. void Process::kill_threads_except_self()
  105. {
  106. InterruptDisabler disabler;
  107. if (thread_count() <= 1)
  108. return;
  109. auto current_thread = Thread::current();
  110. for_each_thread([&](Thread& thread) {
  111. if (&thread == current_thread
  112. || thread.state() == Thread::State::Dead
  113. || thread.state() == Thread::State::Dying)
  114. return IterationDecision::Continue;
  115. // We need to detach this thread in case it hasn't been joined
  116. thread.detach();
  117. thread.set_should_die();
  118. return IterationDecision::Continue;
  119. });
  120. big_lock().clear_waiters();
  121. }
  122. void Process::kill_all_threads()
  123. {
  124. for_each_thread([&](Thread& thread) {
  125. // We need to detach this thread in case it hasn't been joined
  126. thread.detach();
  127. thread.set_should_die();
  128. return IterationDecision::Continue;
  129. });
  130. }
  131. RefPtr<Process> Process::create_user_process(RefPtr<Thread>& first_thread, const String& path, uid_t uid, gid_t gid, ProcessID parent_pid, int& error, Vector<String>&& arguments, Vector<String>&& environment, TTY* tty)
  132. {
  133. auto parts = path.split('/');
  134. if (arguments.is_empty()) {
  135. arguments.append(parts.last());
  136. }
  137. RefPtr<Custody> cwd;
  138. {
  139. ScopedSpinLock lock(g_processes_lock);
  140. if (auto parent = Process::from_pid(parent_pid)) {
  141. cwd = parent->m_cwd;
  142. }
  143. }
  144. if (!cwd)
  145. cwd = VFS::the().root_custody();
  146. auto process = adopt(*new Process(first_thread, parts.take_last(), uid, gid, parent_pid, false, move(cwd), nullptr, tty));
  147. if (!first_thread)
  148. return {};
  149. process->m_fds.resize(m_max_open_file_descriptors);
  150. auto& device_to_use_as_tty = tty ? (CharacterDevice&)*tty : NullDevice::the();
  151. auto description = device_to_use_as_tty.open(O_RDWR).value();
  152. process->m_fds[0].set(*description);
  153. process->m_fds[1].set(*description);
  154. process->m_fds[2].set(*description);
  155. error = process->exec(path, move(arguments), move(environment));
  156. if (error != 0) {
  157. dbgln("Failed to exec {}: {}", path, error);
  158. first_thread = nullptr;
  159. return {};
  160. }
  161. {
  162. ScopedSpinLock lock(g_processes_lock);
  163. g_processes->prepend(process);
  164. process->ref();
  165. }
  166. error = 0;
  167. return process;
  168. }
  169. RefPtr<Process> Process::create_kernel_process(RefPtr<Thread>& first_thread, String&& name, void (*entry)(void*), void* entry_data, u32 affinity)
  170. {
  171. auto process = adopt(*new Process(first_thread, move(name), (uid_t)0, (gid_t)0, ProcessID(0), true));
  172. if (!first_thread)
  173. return {};
  174. first_thread->tss().eip = (FlatPtr)entry;
  175. first_thread->tss().esp = FlatPtr(entry_data); // entry function argument is expected to be in tss.esp
  176. if (process->pid() != 0) {
  177. ScopedSpinLock lock(g_processes_lock);
  178. g_processes->prepend(process);
  179. process->ref();
  180. }
  181. ScopedSpinLock lock(g_scheduler_lock);
  182. first_thread->set_affinity(affinity);
  183. first_thread->set_state(Thread::State::Runnable);
  184. return process;
  185. }
  186. const Process::ProtectedData& Process::protected_data() const
  187. {
  188. return *reinterpret_cast<const ProtectedData*>(m_protected_data->data());
  189. }
  190. void Process::protect_data()
  191. {
  192. auto& region = m_protected_data->impl().region();
  193. if (!region.is_writable())
  194. return;
  195. region.set_writable(false);
  196. region.remap();
  197. }
  198. void Process::unprotect_data()
  199. {
  200. auto& region = m_protected_data->impl().region();
  201. if (region.is_writable())
  202. return;
  203. region.set_writable(true);
  204. region.remap();
  205. }
  206. Process::Process(RefPtr<Thread>& first_thread, const String& name, uid_t uid, gid_t gid, ProcessID ppid, bool is_kernel_process, RefPtr<Custody> cwd, RefPtr<Custody> executable, TTY* tty, Process* fork_parent)
  207. : m_name(move(name))
  208. , m_is_kernel_process(is_kernel_process)
  209. , m_executable(move(executable))
  210. , m_cwd(move(cwd))
  211. , m_tty(tty)
  212. , m_ppid(ppid)
  213. , m_wait_block_condition(*this)
  214. {
  215. m_protected_data = KBuffer::try_create_with_size(sizeof(ProtectedData));
  216. VERIFY(m_protected_data);
  217. {
  218. MutableProtectedData protected_data { *this };
  219. protected_data->pid = allocate_pid();
  220. protected_data->uid = uid;
  221. protected_data->gid = gid;
  222. protected_data->euid = uid;
  223. protected_data->egid = gid;
  224. protected_data->suid = uid;
  225. protected_data->sgid = gid;
  226. }
  227. dbgln_if(PROCESS_DEBUG, "Created new process {}({})", m_name, this->pid().value());
  228. m_space = Space::create(*this, fork_parent ? &fork_parent->space() : nullptr);
  229. if (fork_parent) {
  230. // NOTE: fork() doesn't clone all threads; the thread that called fork() becomes the only thread in the new process.
  231. first_thread = Thread::current()->clone(*this);
  232. } else {
  233. // NOTE: This non-forked code path is only taken when the kernel creates a process "manually" (at boot.)
  234. auto thread_or_error = Thread::try_create(*this);
  235. VERIFY(!thread_or_error.is_error());
  236. first_thread = thread_or_error.release_value();
  237. first_thread->detach();
  238. }
  239. }
  240. Process::~Process()
  241. {
  242. VERIFY(thread_count() == 0); // all threads should have been finalized
  243. VERIFY(!m_alarm_timer);
  244. {
  245. ScopedSpinLock processses_lock(g_processes_lock);
  246. if (prev() || next())
  247. g_processes->remove(this);
  248. }
  249. }
  250. // Make sure the compiler doesn't "optimize away" this function:
  251. extern void signal_trampoline_dummy();
  252. void signal_trampoline_dummy()
  253. {
  254. #if ARCH(I386)
  255. // The trampoline preserves the current eax, pushes the signal code and
  256. // then calls the signal handler. We do this because, when interrupting a
  257. // blocking syscall, that syscall may return some special error code in eax;
  258. // This error code would likely be overwritten by the signal handler, so it's
  259. // necessary to preserve it here.
  260. asm(
  261. ".intel_syntax noprefix\n"
  262. "asm_signal_trampoline:\n"
  263. "push ebp\n"
  264. "mov ebp, esp\n"
  265. "push eax\n" // we have to store eax 'cause it might be the return value from a syscall
  266. "sub esp, 4\n" // align the stack to 16 bytes
  267. "mov eax, [ebp+12]\n" // push the signal code
  268. "push eax\n"
  269. "call [ebp+8]\n" // call the signal handler
  270. "add esp, 8\n"
  271. "mov eax, %P0\n"
  272. "int 0x82\n" // sigreturn syscall
  273. "asm_signal_trampoline_end:\n"
  274. ".att_syntax" ::"i"(Syscall::SC_sigreturn));
  275. #elif ARCH(X86_64)
  276. asm("asm_signal_trampoline:\n"
  277. "cli;hlt\n"
  278. "asm_signal_trampoline_end:\n");
  279. #endif
  280. }
  281. extern "C" void asm_signal_trampoline(void);
  282. extern "C" void asm_signal_trampoline_end(void);
  283. void create_signal_trampoline()
  284. {
  285. // NOTE: We leak this region.
  286. g_signal_trampoline_region = MM.allocate_kernel_region(PAGE_SIZE, "Signal trampolines", Region::Access::Read | Region::Access::Write).leak_ptr();
  287. g_signal_trampoline_region->set_syscall_region(true);
  288. u8* trampoline = (u8*)asm_signal_trampoline;
  289. u8* trampoline_end = (u8*)asm_signal_trampoline_end;
  290. size_t trampoline_size = trampoline_end - trampoline;
  291. u8* code_ptr = (u8*)g_signal_trampoline_region->vaddr().as_ptr();
  292. memcpy(code_ptr, trampoline, trampoline_size);
  293. g_signal_trampoline_region->set_writable(false);
  294. g_signal_trampoline_region->remap();
  295. }
  296. void Process::crash(int signal, u32 eip, bool out_of_memory)
  297. {
  298. VERIFY(!is_dead());
  299. VERIFY(Process::current() == this);
  300. if (out_of_memory) {
  301. dbgln("\033[31;1mOut of memory\033[m, killing: {}", *this);
  302. } else {
  303. if (eip >= 0xc0000000 && g_kernel_symbols_available) {
  304. auto* symbol = symbolicate_kernel_address(eip);
  305. dbgln("\033[31;1m{:p} {} +{}\033[0m\n", eip, (symbol ? demangle(symbol->name) : "(k?)"), (symbol ? eip - symbol->address : 0));
  306. } else {
  307. dbgln("\033[31;1m{:p} (?)\033[0m\n", eip);
  308. }
  309. dump_backtrace();
  310. }
  311. m_termination_signal = signal;
  312. set_dump_core(!out_of_memory);
  313. space().dump_regions();
  314. VERIFY(is_user_process());
  315. die();
  316. // We can not return from here, as there is nowhere
  317. // to unwind to, so die right away.
  318. Thread::current()->die_if_needed();
  319. VERIFY_NOT_REACHED();
  320. }
  321. RefPtr<Process> Process::from_pid(ProcessID pid)
  322. {
  323. ScopedSpinLock lock(g_processes_lock);
  324. for (auto& process : *g_processes) {
  325. process.pid();
  326. if (process.pid() == pid)
  327. return &process;
  328. }
  329. return {};
  330. }
  331. RefPtr<FileDescription> Process::file_description(int fd) const
  332. {
  333. if (fd < 0)
  334. return nullptr;
  335. if (static_cast<size_t>(fd) < m_fds.size())
  336. return m_fds[fd].description();
  337. return nullptr;
  338. }
  339. int Process::fd_flags(int fd) const
  340. {
  341. if (fd < 0)
  342. return -1;
  343. if (static_cast<size_t>(fd) < m_fds.size())
  344. return m_fds[fd].flags();
  345. return -1;
  346. }
  347. int Process::number_of_open_file_descriptors() const
  348. {
  349. int count = 0;
  350. for (auto& description : m_fds) {
  351. if (description)
  352. ++count;
  353. }
  354. return count;
  355. }
  356. int Process::alloc_fd(int first_candidate_fd)
  357. {
  358. for (int i = first_candidate_fd; i < (int)m_max_open_file_descriptors; ++i) {
  359. if (!m_fds[i])
  360. return i;
  361. }
  362. return -EMFILE;
  363. }
  364. Time kgettimeofday()
  365. {
  366. return TimeManagement::now();
  367. }
  368. siginfo_t Process::wait_info()
  369. {
  370. siginfo_t siginfo {};
  371. siginfo.si_signo = SIGCHLD;
  372. siginfo.si_pid = pid().value();
  373. siginfo.si_uid = uid();
  374. if (m_termination_signal) {
  375. siginfo.si_status = m_termination_signal;
  376. siginfo.si_code = CLD_KILLED;
  377. } else {
  378. siginfo.si_status = m_termination_status;
  379. siginfo.si_code = CLD_EXITED;
  380. }
  381. return siginfo;
  382. }
  383. Custody& Process::current_directory()
  384. {
  385. if (!m_cwd)
  386. m_cwd = VFS::the().root_custody();
  387. return *m_cwd;
  388. }
  389. KResultOr<String> Process::get_syscall_path_argument(const char* user_path, size_t path_length) const
  390. {
  391. if (path_length == 0)
  392. return EINVAL;
  393. if (path_length > PATH_MAX)
  394. return ENAMETOOLONG;
  395. auto copied_string = copy_string_from_user(user_path, path_length);
  396. if (copied_string.is_null())
  397. return EFAULT;
  398. return copied_string;
  399. }
  400. KResultOr<String> Process::get_syscall_path_argument(const Syscall::StringArgument& path) const
  401. {
  402. return get_syscall_path_argument(path.characters, path.length);
  403. }
  404. bool Process::dump_core()
  405. {
  406. VERIFY(is_dumpable());
  407. VERIFY(should_core_dump());
  408. dbgln("Generating coredump for pid: {}", pid().value());
  409. auto coredump_path = String::formatted("/tmp/coredump/{}_{}_{}", name(), pid().value(), RTC::now());
  410. auto coredump = CoreDump::create(*this, coredump_path);
  411. if (!coredump)
  412. return false;
  413. return !coredump->write().is_error();
  414. }
  415. bool Process::dump_perfcore()
  416. {
  417. VERIFY(is_dumpable());
  418. VERIFY(m_perf_event_buffer);
  419. dbgln("Generating perfcore for pid: {}", pid().value());
  420. auto description_or_error = VFS::the().open(String::formatted("perfcore.{}", pid().value()), O_CREAT | O_EXCL, 0400, current_directory(), UidAndGid { uid(), gid() });
  421. if (description_or_error.is_error())
  422. return false;
  423. auto& description = description_or_error.value();
  424. KBufferBuilder builder;
  425. if (!m_perf_event_buffer->to_json(builder))
  426. return false;
  427. auto json = builder.build();
  428. if (!json)
  429. return false;
  430. auto json_buffer = UserOrKernelBuffer::for_kernel_buffer(json->data());
  431. return !description->write(json_buffer, json->size()).is_error();
  432. }
  433. void Process::finalize()
  434. {
  435. VERIFY(Thread::current() == g_finalizer);
  436. dbgln_if(PROCESS_DEBUG, "Finalizing process {}", *this);
  437. if (is_dumpable()) {
  438. if (m_should_dump_core)
  439. dump_core();
  440. if (m_perf_event_buffer)
  441. dump_perfcore();
  442. }
  443. m_threads_for_coredump.clear();
  444. if (m_alarm_timer)
  445. TimerQueue::the().cancel_timer(m_alarm_timer.release_nonnull());
  446. m_fds.clear();
  447. m_tty = nullptr;
  448. m_executable = nullptr;
  449. m_cwd = nullptr;
  450. m_root_directory = nullptr;
  451. m_root_directory_relative_to_global_root = nullptr;
  452. m_arguments.clear();
  453. m_environment.clear();
  454. m_dead = true;
  455. {
  456. // FIXME: PID/TID BUG
  457. if (auto parent_thread = Thread::from_tid(m_ppid.value())) {
  458. if (!(parent_thread->m_signal_action_data[SIGCHLD].flags & SA_NOCLDWAIT))
  459. parent_thread->send_signal(SIGCHLD, this);
  460. }
  461. }
  462. {
  463. ScopedSpinLock processses_lock(g_processes_lock);
  464. if (!!ppid()) {
  465. if (auto parent = Process::from_pid(ppid())) {
  466. parent->m_ticks_in_user_for_dead_children += m_ticks_in_user + m_ticks_in_user_for_dead_children;
  467. parent->m_ticks_in_kernel_for_dead_children += m_ticks_in_kernel + m_ticks_in_kernel_for_dead_children;
  468. }
  469. }
  470. }
  471. unblock_waiters(Thread::WaitBlocker::UnblockFlags::Terminated);
  472. m_space->remove_all_regions({});
  473. VERIFY(ref_count() > 0);
  474. // WaitBlockCondition::finalize will be in charge of dropping the last
  475. // reference if there are still waiters around, or whenever the last
  476. // waitable states are consumed. Unless there is no parent around
  477. // anymore, in which case we'll just drop it right away.
  478. m_wait_block_condition.finalize();
  479. }
  480. void Process::disowned_by_waiter(Process& process)
  481. {
  482. m_wait_block_condition.disowned_by_waiter(process);
  483. }
  484. void Process::unblock_waiters(Thread::WaitBlocker::UnblockFlags flags, u8 signal)
  485. {
  486. if (auto parent = Process::from_pid(ppid()))
  487. parent->m_wait_block_condition.unblock(*this, flags, signal);
  488. }
  489. void Process::die()
  490. {
  491. // Let go of the TTY, otherwise a slave PTY may keep the master PTY from
  492. // getting an EOF when the last process using the slave PTY dies.
  493. // If the master PTY owner relies on an EOF to know when to wait() on a
  494. // slave owner, we have to allow the PTY pair to be torn down.
  495. m_tty = nullptr;
  496. for_each_thread([&](auto& thread) {
  497. m_threads_for_coredump.append(thread);
  498. return IterationDecision::Continue;
  499. });
  500. {
  501. ScopedSpinLock lock(g_processes_lock);
  502. for (auto* process = g_processes->head(); process;) {
  503. auto* next_process = process->next();
  504. if (process->has_tracee_thread(pid())) {
  505. dbgln_if(PROCESS_DEBUG, "Process {} ({}) is attached by {} ({}) which will exit", process->name(), process->pid(), name(), pid());
  506. process->stop_tracing();
  507. auto err = process->send_signal(SIGSTOP, this);
  508. if (err.is_error())
  509. dbgln("Failed to send the SIGSTOP signal to {} ({})", process->name(), process->pid());
  510. }
  511. process = next_process;
  512. }
  513. }
  514. kill_all_threads();
  515. }
  516. void Process::terminate_due_to_signal(u8 signal)
  517. {
  518. VERIFY_INTERRUPTS_DISABLED();
  519. VERIFY(signal < 32);
  520. VERIFY(Process::current() == this);
  521. dbgln("Terminating {} due to signal {}", *this, signal);
  522. m_termination_status = 0;
  523. m_termination_signal = signal;
  524. die();
  525. }
  526. KResult Process::send_signal(u8 signal, Process* sender)
  527. {
  528. // Try to send it to the "obvious" main thread:
  529. auto receiver_thread = Thread::from_tid(pid().value());
  530. // If the main thread has died, there may still be other threads:
  531. if (!receiver_thread) {
  532. // The first one should be good enough.
  533. // Neither kill(2) nor kill(3) specify any selection precedure.
  534. for_each_thread([&receiver_thread](Thread& thread) -> IterationDecision {
  535. receiver_thread = &thread;
  536. return IterationDecision::Break;
  537. });
  538. }
  539. if (receiver_thread) {
  540. receiver_thread->send_signal(signal, sender);
  541. return KSuccess;
  542. }
  543. return ESRCH;
  544. }
  545. RefPtr<Thread> Process::create_kernel_thread(void (*entry)(void*), void* entry_data, u32 priority, const String& name, u32 affinity, bool joinable)
  546. {
  547. VERIFY((priority >= THREAD_PRIORITY_MIN) && (priority <= THREAD_PRIORITY_MAX));
  548. // FIXME: Do something with guard pages?
  549. auto thread_or_error = Thread::try_create(*this);
  550. if (thread_or_error.is_error())
  551. return {};
  552. auto thread = thread_or_error.release_value();
  553. thread->set_name(name);
  554. thread->set_affinity(affinity);
  555. thread->set_priority(priority);
  556. if (!joinable)
  557. thread->detach();
  558. auto& tss = thread->tss();
  559. tss.eip = (FlatPtr)entry;
  560. tss.esp = FlatPtr(entry_data); // entry function argument is expected to be in tss.esp
  561. ScopedSpinLock lock(g_scheduler_lock);
  562. thread->set_state(Thread::State::Runnable);
  563. return thread;
  564. }
  565. void Process::FileDescriptionAndFlags::clear()
  566. {
  567. m_description = nullptr;
  568. m_flags = 0;
  569. }
  570. void Process::FileDescriptionAndFlags::set(NonnullRefPtr<FileDescription>&& description, u32 flags)
  571. {
  572. m_description = move(description);
  573. m_flags = flags;
  574. }
  575. Custody& Process::root_directory()
  576. {
  577. if (!m_root_directory)
  578. m_root_directory = VFS::the().root_custody();
  579. return *m_root_directory;
  580. }
  581. Custody& Process::root_directory_relative_to_global_root()
  582. {
  583. if (!m_root_directory_relative_to_global_root)
  584. m_root_directory_relative_to_global_root = root_directory();
  585. return *m_root_directory_relative_to_global_root;
  586. }
  587. void Process::set_root_directory(const Custody& root)
  588. {
  589. m_root_directory = root;
  590. }
  591. void Process::set_tty(TTY* tty)
  592. {
  593. m_tty = tty;
  594. }
  595. void Process::start_tracing_from(ProcessID tracer)
  596. {
  597. m_tracer = ThreadTracer::create(tracer);
  598. }
  599. void Process::stop_tracing()
  600. {
  601. m_tracer = nullptr;
  602. }
  603. void Process::tracer_trap(Thread& thread, const RegisterState& regs)
  604. {
  605. VERIFY(m_tracer.ptr());
  606. m_tracer->set_regs(regs);
  607. thread.send_urgent_signal_to_self(SIGTRAP);
  608. }
  609. bool Process::create_perf_events_buffer_if_needed()
  610. {
  611. if (!m_perf_event_buffer) {
  612. m_perf_event_buffer = PerformanceEventBuffer::try_create_with_size(4 * MiB);
  613. m_perf_event_buffer->add_process(*this);
  614. }
  615. return !!m_perf_event_buffer;
  616. }
  617. bool Process::remove_thread(Thread& thread)
  618. {
  619. auto thread_cnt_before = m_thread_count.fetch_sub(1, AK::MemoryOrder::memory_order_acq_rel);
  620. VERIFY(thread_cnt_before != 0);
  621. ScopedSpinLock thread_list_lock(m_thread_list_lock);
  622. m_thread_list.remove(thread);
  623. return thread_cnt_before == 1;
  624. }
  625. bool Process::add_thread(Thread& thread)
  626. {
  627. bool is_first = m_thread_count.fetch_add(1, AK::MemoryOrder::memory_order_relaxed) == 0;
  628. ScopedSpinLock thread_list_lock(m_thread_list_lock);
  629. m_thread_list.append(thread);
  630. return is_first;
  631. }
  632. }