2020-01-18 08:38:21 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice, this
|
|
|
|
* list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
|
|
|
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
|
|
|
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
#pragma once
|
|
|
|
|
2020-05-31 18:56:17 +00:00
|
|
|
#include <AK/Checked.h>
|
2020-02-18 09:19:32 +00:00
|
|
|
#include <AK/FixedArray.h>
|
2020-02-16 01:01:42 +00:00
|
|
|
#include <AK/HashMap.h>
|
2019-05-28 09:53:16 +00:00
|
|
|
#include <AK/InlineLinkedList.h>
|
2020-02-16 01:01:42 +00:00
|
|
|
#include <AK/NonnullOwnPtrVector.h>
|
2020-08-02 02:04:56 +00:00
|
|
|
#include <AK/NonnullRefPtrVector.h>
|
2019-09-27 12:19:07 +00:00
|
|
|
#include <AK/String.h>
|
2020-07-31 14:28:37 +00:00
|
|
|
#include <AK/Userspace.h>
|
2020-02-24 12:24:30 +00:00
|
|
|
#include <AK/WeakPtr.h>
|
2020-08-06 09:17:53 +00:00
|
|
|
#include <AK/Weakable.h>
|
2020-07-04 23:37:36 +00:00
|
|
|
#include <Kernel/API/Syscall.h>
|
2020-02-16 01:01:42 +00:00
|
|
|
#include <Kernel/FileSystem/InodeMetadata.h>
|
2020-02-16 00:50:16 +00:00
|
|
|
#include <Kernel/Forward.h>
|
2019-05-28 09:53:16 +00:00
|
|
|
#include <Kernel/Lock.h>
|
2020-06-18 20:18:44 +00:00
|
|
|
#include <Kernel/StdLib.h>
|
2019-03-23 21:03:17 +00:00
|
|
|
#include <Kernel/Thread.h>
|
2019-05-28 09:53:16 +00:00
|
|
|
#include <Kernel/UnixTypes.h>
|
|
|
|
#include <Kernel/VM/RangeAllocator.h>
|
2019-05-26 00:08:51 +00:00
|
|
|
#include <LibC/signal_numbers.h>
|
2020-07-04 23:37:36 +00:00
|
|
|
#include <LibELF/AuxiliaryVector.h>
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2020-04-11 18:24:07 +00:00
|
|
|
namespace ELF {
|
|
|
|
class Loader;
|
|
|
|
}
|
2020-02-16 00:27:42 +00:00
|
|
|
|
|
|
|
namespace Kernel {
|
|
|
|
|
2019-06-06 15:46:41 +00:00
|
|
|
timeval kgettimeofday();
|
2019-03-13 12:13:23 +00:00
|
|
|
void kgettimeofday(timeval&);
|
|
|
|
|
2019-07-19 15:01:16 +00:00
|
|
|
extern VirtualAddress g_return_to_ring3_from_signal_trampoline;
|
|
|
|
|
2020-06-18 20:18:44 +00:00
|
|
|
#define ENUMERATE_PLEDGE_PROMISES \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(stdio) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(rpath) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(wpath) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(cpath) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(dpath) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(inet) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(id) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(proc) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(exec) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(unix) \
|
2020-06-24 20:57:37 +00:00
|
|
|
__ENUMERATE_PLEDGE_PROMISE(recvfd) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(sendfd) \
|
2020-06-18 20:18:44 +00:00
|
|
|
__ENUMERATE_PLEDGE_PROMISE(fattr) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(tty) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(chown) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(chroot) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(thread) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(video) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(accept) \
|
|
|
|
__ENUMERATE_PLEDGE_PROMISE(settime) \
|
2020-05-26 10:49:35 +00:00
|
|
|
__ENUMERATE_PLEDGE_PROMISE(sigaction) \
|
2020-06-18 20:18:44 +00:00
|
|
|
__ENUMERATE_PLEDGE_PROMISE(setkeymap) \
|
2020-01-11 19:48:43 +00:00
|
|
|
__ENUMERATE_PLEDGE_PROMISE(shared_buffer)
|
|
|
|
|
|
|
|
enum class Pledge : u32 {
|
|
|
|
#define __ENUMERATE_PLEDGE_PROMISE(x) x,
|
|
|
|
ENUMERATE_PLEDGE_PROMISES
|
|
|
|
#undef __ENUMERATE_PLEDGE_PROMISE
|
|
|
|
};
|
|
|
|
|
2020-01-21 18:28:29 +00:00
|
|
|
enum class VeilState {
|
Kernel: Add a basic implementation of unveil()
This syscall is a complement to pledge() and adds the same sort of
incremental relinquishing of capabilities for filesystem access.
The first call to unveil() will "drop a veil" on the process, and from
now on, only unveiled parts of the filesystem are visible to it.
Each call to unveil() specifies a path to either a directory or a file
along with permissions for that path. The permissions are a combination
of the following:
- r: Read access (like the "rpath" promise)
- w: Write access (like the "wpath" promise)
- x: Execute access
- c: Create/remove access (like the "cpath" promise)
Attempts to open a path that has not been unveiled with fail with
ENOENT. If the unveiled path lacks sufficient permissions, it will fail
with EACCES.
Like pledge(), subsequent calls to unveil() with the same path can only
remove permissions, not add them.
Once you call unveil(nullptr, nullptr), the veil is locked, and it's no
longer possible to unveil any more paths for the process, ever.
This concept comes from OpenBSD, and their implementation does various
things differently, I'm sure. This is just a first implementation for
SerenityOS, and we'll keep improving on it as we go. :^)
2020-01-20 21:12:04 +00:00
|
|
|
None,
|
2020-01-21 18:28:29 +00:00
|
|
|
Dropped,
|
|
|
|
Locked,
|
Kernel: Add a basic implementation of unveil()
This syscall is a complement to pledge() and adds the same sort of
incremental relinquishing of capabilities for filesystem access.
The first call to unveil() will "drop a veil" on the process, and from
now on, only unveiled parts of the filesystem are visible to it.
Each call to unveil() specifies a path to either a directory or a file
along with permissions for that path. The permissions are a combination
of the following:
- r: Read access (like the "rpath" promise)
- w: Write access (like the "wpath" promise)
- x: Execute access
- c: Create/remove access (like the "cpath" promise)
Attempts to open a path that has not been unveiled with fail with
ENOENT. If the unveiled path lacks sufficient permissions, it will fail
with EACCES.
Like pledge(), subsequent calls to unveil() with the same path can only
remove permissions, not add them.
Once you call unveil(nullptr, nullptr), the veil is locked, and it's no
longer possible to unveil any more paths for the process, ever.
This concept comes from OpenBSD, and their implementation does various
things differently, I'm sure. This is just a first implementation for
SerenityOS, and we'll keep improving on it as we go. :^)
2020-01-20 21:12:04 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct UnveiledPath {
|
|
|
|
enum Access {
|
|
|
|
Read = 1,
|
|
|
|
Write = 2,
|
|
|
|
Execute = 4,
|
|
|
|
CreateOrRemove = 8,
|
|
|
|
};
|
|
|
|
|
|
|
|
String path;
|
|
|
|
unsigned permissions { 0 };
|
|
|
|
};
|
|
|
|
|
2020-08-06 09:17:53 +00:00
|
|
|
class Process
|
|
|
|
: public RefCounted<Process>
|
|
|
|
, public InlineLinkedListNode<Process>
|
|
|
|
, public Weakable<Process> {
|
|
|
|
|
2020-04-22 09:54:58 +00:00
|
|
|
AK_MAKE_NONCOPYABLE(Process);
|
|
|
|
AK_MAKE_NONMOVABLE(Process);
|
|
|
|
|
2018-11-01 12:15:46 +00:00
|
|
|
friend class InlineLinkedListNode<Process>;
|
2019-03-23 21:03:17 +00:00
|
|
|
friend class Thread;
|
2019-05-28 09:53:16 +00:00
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
public:
|
2020-06-28 21:34:31 +00:00
|
|
|
inline static Process* current()
|
|
|
|
{
|
|
|
|
auto current_thread = Processor::current().current_thread();
|
|
|
|
return current_thread ? ¤t_thread->process() : nullptr;
|
|
|
|
}
|
2020-02-17 14:04:27 +00:00
|
|
|
|
2020-08-02 02:04:56 +00:00
|
|
|
static NonnullRefPtr<Process> create_kernel_process(Thread*& first_thread, String&& name, void (*entry)(), u32 affinity = THREAD_AFFINITY_DEFAULT);
|
2020-08-08 15:32:34 +00:00
|
|
|
static RefPtr<Process> create_user_process(Thread*& first_thread, const String& path, uid_t, gid_t, ProcessID ppid, int& error, Vector<String>&& arguments = Vector<String>(), Vector<String>&& environment = Vector<String>(), TTY* = nullptr);
|
2018-11-01 12:15:46 +00:00
|
|
|
~Process();
|
2018-10-23 10:44:46 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
static Vector<ProcessID> all_pids();
|
2020-08-02 02:04:56 +00:00
|
|
|
static AK::NonnullRefPtrVector<Process> all_processes();
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2020-06-28 21:34:31 +00:00
|
|
|
Thread* create_kernel_thread(void (*entry)(), u32 priority, const String& name, u32 affinity = THREAD_AFFINITY_DEFAULT, bool joinable = true);
|
|
|
|
|
2019-12-11 19:36:56 +00:00
|
|
|
bool is_profiling() const { return m_profiling; }
|
|
|
|
void set_profiling(bool profiling) { m_profiling = profiling; }
|
|
|
|
|
2019-08-08 12:56:50 +00:00
|
|
|
enum RingLevel : u8 {
|
2018-10-16 09:01:38 +00:00
|
|
|
Ring0 = 0,
|
|
|
|
Ring3 = 3,
|
|
|
|
};
|
|
|
|
|
2020-08-02 02:04:56 +00:00
|
|
|
KBuffer backtrace() const;
|
2019-07-25 19:02:19 +00:00
|
|
|
|
2019-03-24 00:20:35 +00:00
|
|
|
bool is_dead() const { return m_dead; }
|
2019-03-23 21:03:17 +00:00
|
|
|
|
2019-01-31 16:31:23 +00:00
|
|
|
bool is_ring0() const { return m_ring == Ring0; }
|
|
|
|
bool is_ring3() const { return m_ring == Ring3; }
|
2018-11-07 20:19:47 +00:00
|
|
|
|
2018-11-09 00:25:31 +00:00
|
|
|
PageDirectory& page_directory() { return *m_page_directory; }
|
|
|
|
const PageDirectory& page_directory() const { return *m_page_directory; }
|
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
static RefPtr<Process> from_pid(ProcessID);
|
2020-08-08 20:04:20 +00:00
|
|
|
static SessionID get_sid_from_pgid(ProcessGroupID pgid);
|
2018-10-16 09:01:38 +00:00
|
|
|
|
|
|
|
const String& name() const { return m_name; }
|
2020-08-08 15:32:34 +00:00
|
|
|
ProcessID pid() const { return m_pid; }
|
2020-08-08 20:04:20 +00:00
|
|
|
SessionID sid() const { return m_sid; }
|
|
|
|
bool is_session_leader() const { return m_sid.value() == m_pid.value(); }
|
|
|
|
ProcessGroupID pgid() const { return m_pgid; }
|
|
|
|
bool is_group_leader() const { return m_pgid.value() == m_pid.value(); }
|
2020-02-18 09:19:32 +00:00
|
|
|
const FixedArray<gid_t>& extra_gids() const { return m_extra_gids; }
|
2018-11-05 14:04:19 +00:00
|
|
|
uid_t euid() const { return m_euid; }
|
|
|
|
gid_t egid() const { return m_egid; }
|
2020-06-17 12:58:00 +00:00
|
|
|
uid_t uid() const { return m_uid; }
|
|
|
|
gid_t gid() const { return m_gid; }
|
|
|
|
uid_t suid() const { return m_suid; }
|
|
|
|
gid_t sgid() const { return m_sgid; }
|
2020-08-08 15:32:34 +00:00
|
|
|
ProcessID ppid() const { return m_ppid; }
|
2018-10-25 08:15:13 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
ThreadID exec_tid() const { return m_exec_tid; }
|
Kernel: Allow process with multiple threads to call exec and exit
This allows a process wich has more than 1 thread to call exec, even
from a thread. This kills all the other threads, but it won't wait for
them to finish, just makes sure that they are not in a running/runable
state.
In the case where a thread does exec, the new program PID will be the
thread TID, to keep the PID == TID in the new process.
This introduces a new function inside the Process class,
kill_threads_except_self which is called on exit() too (exit with
multiple threads wasn't properly working either).
Inside the Lock class, there is the need for a new function,
clear_waiters, which removes all the waiters from the
Process::big_lock. This is needed since after a exit/exec, there should
be no other threads waiting for this lock, the threads should be simply
killed. Only queued threads should wait for this lock at this point,
since blocked threads are handled in set_should_die.
2020-02-18 12:28:28 +00:00
|
|
|
|
2019-02-22 01:39:13 +00:00
|
|
|
mode_t umask() const { return m_umask; }
|
|
|
|
|
2019-02-27 11:32:53 +00:00
|
|
|
bool in_group(gid_t) const;
|
|
|
|
|
2020-01-07 14:53:42 +00:00
|
|
|
RefPtr<FileDescription> file_description(int fd) const;
|
2019-09-28 20:00:38 +00:00
|
|
|
int fd_flags(int fd) const;
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2019-05-28 09:53:16 +00:00
|
|
|
template<typename Callback>
|
|
|
|
static void for_each(Callback);
|
|
|
|
template<typename Callback>
|
2020-08-08 20:04:20 +00:00
|
|
|
static void for_each_in_pgrp(ProcessGroupID, Callback);
|
2019-05-28 09:53:16 +00:00
|
|
|
template<typename Callback>
|
|
|
|
void for_each_child(Callback);
|
|
|
|
template<typename Callback>
|
|
|
|
void for_each_thread(Callback) const;
|
2018-11-02 13:06:48 +00:00
|
|
|
|
2019-01-30 17:26:19 +00:00
|
|
|
void die();
|
2019-02-06 17:45:21 +00:00
|
|
|
void finalize();
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2020-08-02 02:04:56 +00:00
|
|
|
ALWAYS_INLINE SpinLock<u32>& get_lock() const { return m_lock; }
|
|
|
|
|
2019-11-09 21:18:16 +00:00
|
|
|
int sys$yield();
|
|
|
|
int sys$sync();
|
|
|
|
int sys$beep();
|
2020-08-01 09:37:40 +00:00
|
|
|
int sys$get_process_name(Userspace<char*> buffer, size_t buffer_size);
|
|
|
|
int sys$set_process_name(Userspace<const char*> user_name, size_t user_name_length);
|
|
|
|
int sys$watch_file(Userspace<const char*> path, size_t path_length);
|
2019-07-21 17:45:31 +00:00
|
|
|
int sys$dbgputch(u8);
|
2020-08-01 09:37:40 +00:00
|
|
|
int sys$dbgputstr(Userspace<const u8*>, int length);
|
2019-07-21 07:59:17 +00:00
|
|
|
int sys$dump_backtrace();
|
2020-08-08 23:08:24 +00:00
|
|
|
pid_t sys$gettid();
|
|
|
|
int sys$donate(pid_t tid);
|
2019-04-08 23:10:00 +00:00
|
|
|
int sys$ftruncate(int fd, off_t);
|
2018-11-02 11:56:51 +00:00
|
|
|
pid_t sys$setsid();
|
|
|
|
pid_t sys$getsid(pid_t);
|
|
|
|
int sys$setpgid(pid_t pid, pid_t pgid);
|
|
|
|
pid_t sys$getpgrp();
|
|
|
|
pid_t sys$getpgid(pid_t);
|
2018-10-16 09:01:38 +00:00
|
|
|
uid_t sys$getuid();
|
2018-10-22 11:55:11 +00:00
|
|
|
gid_t sys$getgid();
|
2018-11-05 14:04:19 +00:00
|
|
|
uid_t sys$geteuid();
|
|
|
|
gid_t sys$getegid();
|
2018-10-22 11:55:11 +00:00
|
|
|
pid_t sys$getpid();
|
2018-11-06 12:33:06 +00:00
|
|
|
pid_t sys$getppid();
|
2020-08-09 19:34:08 +00:00
|
|
|
int sys$getresuid(Userspace<uid_t*>, Userspace<uid_t*>, Userspace<uid_t*>);
|
2020-08-09 19:37:47 +00:00
|
|
|
int sys$getresgid(Userspace<gid_t*>, Userspace<gid_t*>, Userspace<gid_t*>);
|
2018-11-06 12:40:23 +00:00
|
|
|
mode_t sys$umask(mode_t);
|
2020-08-05 05:16:59 +00:00
|
|
|
int sys$open(Userspace<const Syscall::SC_open_params*>);
|
2018-10-16 09:01:38 +00:00
|
|
|
int sys$close(int fd);
|
2020-07-31 14:28:37 +00:00
|
|
|
ssize_t sys$read(int fd, Userspace<u8*>, ssize_t);
|
2019-07-03 19:17:35 +00:00
|
|
|
ssize_t sys$write(int fd, const u8*, ssize_t);
|
2019-05-10 01:19:25 +00:00
|
|
|
ssize_t sys$writev(int fd, const struct iovec* iov, int iov_count);
|
2020-08-09 21:57:50 +00:00
|
|
|
int sys$fstat(int fd, Userspace<stat*>);
|
2020-07-31 14:28:37 +00:00
|
|
|
int sys$stat(Userspace<const Syscall::SC_stat_params*>);
|
2018-10-31 16:50:43 +00:00
|
|
|
int sys$lseek(int fd, off_t, int whence);
|
2020-08-08 15:32:34 +00:00
|
|
|
int sys$kill(pid_t pid_or_pgid, int sig);
|
2019-02-15 11:30:48 +00:00
|
|
|
[[noreturn]] void sys$exit(int status);
|
2020-02-15 23:15:37 +00:00
|
|
|
int sys$sigreturn(RegisterState& registers);
|
2020-08-05 05:29:28 +00:00
|
|
|
pid_t sys$waitid(Userspace<const Syscall::SC_waitid_params*>);
|
2020-08-05 05:30:40 +00:00
|
|
|
void* sys$mmap(Userspace<const Syscall::SC_mmap_params*>);
|
2018-10-24 07:48:24 +00:00
|
|
|
int sys$munmap(void*, size_t size);
|
2020-08-05 05:38:00 +00:00
|
|
|
int sys$set_mmap_name(Userspace<const Syscall::SC_set_mmap_name_params*>);
|
2019-08-12 17:33:24 +00:00
|
|
|
int sys$mprotect(void*, size_t, int prot);
|
2019-12-09 18:12:38 +00:00
|
|
|
int sys$madvise(void*, size_t, int advice);
|
2020-04-12 18:22:26 +00:00
|
|
|
int sys$minherit(void*, size_t, int inherit);
|
2019-12-29 12:16:53 +00:00
|
|
|
int sys$purge(int mode);
|
2019-01-15 22:12:20 +00:00
|
|
|
int sys$select(const Syscall::SC_select_params*);
|
2020-08-05 06:15:42 +00:00
|
|
|
int sys$poll(Userspace<const Syscall::SC_poll_params*>);
|
2019-02-25 20:19:57 +00:00
|
|
|
ssize_t sys$get_dir_entries(int fd, void*, ssize_t);
|
2020-07-31 14:34:47 +00:00
|
|
|
int sys$getcwd(Userspace<char*>, ssize_t);
|
|
|
|
int sys$chdir(Userspace<const char*>, size_t);
|
2019-09-11 23:18:25 +00:00
|
|
|
int sys$fchdir(int fd);
|
2018-10-25 11:53:49 +00:00
|
|
|
int sys$sleep(unsigned seconds);
|
2019-02-03 15:11:28 +00:00
|
|
|
int sys$usleep(useconds_t usec);
|
2020-08-05 05:18:51 +00:00
|
|
|
int sys$gettimeofday(Userspace<timeval*>);
|
2020-08-09 19:42:51 +00:00
|
|
|
int sys$clock_gettime(clockid_t, Userspace<timespec*>);
|
2020-08-09 19:48:49 +00:00
|
|
|
int sys$clock_settime(clockid_t, Userspace<const timespec*>);
|
2020-08-05 05:24:45 +00:00
|
|
|
int sys$clock_nanosleep(Userspace<const Syscall::SC_clock_nanosleep_params*>);
|
2020-08-09 19:51:41 +00:00
|
|
|
int sys$gethostname(Userspace<char*>, ssize_t);
|
2020-08-09 19:53:12 +00:00
|
|
|
int sys$sethostname(Userspace<const char*>, ssize_t);
|
2020-08-09 20:02:27 +00:00
|
|
|
int sys$uname(Userspace<utsname*>);
|
2020-08-05 05:32:19 +00:00
|
|
|
int sys$readlink(Userspace<const Syscall::SC_readlink_params*>);
|
2020-08-04 14:27:52 +00:00
|
|
|
int sys$ttyname(int fd, Userspace<char*>, size_t);
|
|
|
|
int sys$ptsname(int fd, Userspace<char*>, size_t);
|
2020-02-15 23:15:37 +00:00
|
|
|
pid_t sys$fork(RegisterState&);
|
2020-08-09 19:11:13 +00:00
|
|
|
int sys$execve(Userspace<const Syscall::SC_execve_params*>);
|
2018-11-05 18:01:22 +00:00
|
|
|
int sys$dup(int oldfd);
|
|
|
|
int sys$dup2(int oldfd, int newfd);
|
2019-01-23 05:53:01 +00:00
|
|
|
int sys$sigaction(int signum, const sigaction* act, sigaction* old_act);
|
2020-08-09 21:58:31 +00:00
|
|
|
int sys$sigprocmask(int how, Userspace<const sigset_t*> set, Userspace<sigset_t*> old_set);
|
2020-08-09 21:58:50 +00:00
|
|
|
int sys$sigpending(Userspace<sigset_t*>);
|
2020-08-09 19:20:04 +00:00
|
|
|
int sys$getgroups(ssize_t, Userspace<gid_t*>);
|
2020-08-09 19:17:12 +00:00
|
|
|
int sys$setgroups(ssize_t, Userspace<const gid_t*>);
|
2019-08-05 12:29:05 +00:00
|
|
|
int sys$pipe(int pipefd[2], int flags);
|
2020-08-08 15:32:34 +00:00
|
|
|
int sys$killpg(pid_t pgrp, int sig);
|
2020-06-17 12:58:00 +00:00
|
|
|
int sys$seteuid(uid_t);
|
|
|
|
int sys$setegid(gid_t);
|
2018-11-10 23:20:53 +00:00
|
|
|
int sys$setuid(uid_t);
|
2020-06-17 12:58:00 +00:00
|
|
|
int sys$setgid(gid_t);
|
|
|
|
int sys$setresuid(uid_t, uid_t, uid_t);
|
|
|
|
int sys$setresgid(gid_t, gid_t, gid_t);
|
2018-11-10 23:20:53 +00:00
|
|
|
unsigned sys$alarm(unsigned seconds);
|
2020-08-01 17:38:31 +00:00
|
|
|
int sys$access(Userspace<const char*> pathname, size_t path_length, int mode);
|
2019-07-03 19:17:35 +00:00
|
|
|
int sys$fcntl(int fd, int cmd, u32 extra_arg);
|
2020-05-23 11:17:58 +00:00
|
|
|
int sys$ioctl(int fd, unsigned request, FlatPtr arg);
|
2020-08-01 17:38:31 +00:00
|
|
|
int sys$mkdir(Userspace<const char*> pathname, size_t path_length, mode_t mode);
|
2020-08-09 19:26:56 +00:00
|
|
|
clock_t sys$times(Userspace<tms*>);
|
2020-07-31 14:38:47 +00:00
|
|
|
int sys$utime(Userspace<const char*> pathname, size_t path_length, Userspace<const struct utimbuf*>);
|
2020-08-03 16:40:28 +00:00
|
|
|
int sys$link(Userspace<const Syscall::SC_link_params*>);
|
2020-08-09 22:02:04 +00:00
|
|
|
int sys$unlink(Userspace<const char*> pathname, size_t path_length);
|
2020-08-03 16:40:28 +00:00
|
|
|
int sys$symlink(Userspace<const Syscall::SC_symlink_params*>);
|
2020-08-01 17:38:31 +00:00
|
|
|
int sys$rmdir(Userspace<const char*> pathname, size_t path_length);
|
2020-08-07 03:49:16 +00:00
|
|
|
int sys$mount(Userspace<const Syscall::SC_mount_params*>);
|
2020-08-09 22:08:07 +00:00
|
|
|
int sys$umount(Userspace<const char*> mountpoint, size_t mountpoint_length);
|
2020-08-09 22:09:10 +00:00
|
|
|
int sys$chmod(Userspace<const char*> pathname, size_t path_length, mode_t);
|
2019-03-01 09:39:19 +00:00
|
|
|
int sys$fchmod(int fd, mode_t);
|
2020-08-07 03:52:24 +00:00
|
|
|
int sys$chown(Userspace<const Syscall::SC_chown_params*>);
|
2019-06-01 18:31:36 +00:00
|
|
|
int sys$fchown(int fd, uid_t, gid_t);
|
2019-02-14 13:17:38 +00:00
|
|
|
int sys$socket(int domain, int type, int protocol);
|
2020-08-09 22:13:43 +00:00
|
|
|
int sys$bind(int sockfd, Userspace<const sockaddr*> addr, socklen_t);
|
2019-02-14 13:17:38 +00:00
|
|
|
int sys$listen(int sockfd, int backlog);
|
2020-08-09 22:23:13 +00:00
|
|
|
int sys$accept(int sockfd, Userspace<sockaddr*>, Userspace<socklen_t*>);
|
2020-08-09 22:25:53 +00:00
|
|
|
int sys$connect(int sockfd, Userspace<const sockaddr*>, socklen_t);
|
2020-02-07 23:52:33 +00:00
|
|
|
int sys$shutdown(int sockfd, int how);
|
2019-03-12 14:51:42 +00:00
|
|
|
ssize_t sys$sendto(const Syscall::SC_sendto_params*);
|
2019-03-12 16:27:07 +00:00
|
|
|
ssize_t sys$recvfrom(const Syscall::SC_recvfrom_params*);
|
2020-08-07 09:29:05 +00:00
|
|
|
int sys$getsockopt(Userspace<const Syscall::SC_getsockopt_params*>);
|
2020-08-07 07:18:20 +00:00
|
|
|
int sys$setsockopt(Userspace<const Syscall::SC_setsockopt_params*>);
|
2020-08-07 07:03:37 +00:00
|
|
|
int sys$getsockname(Userspace<const Syscall::SC_getsockname_params*>);
|
2020-08-07 07:00:17 +00:00
|
|
|
int sys$getpeername(Userspace<const Syscall::SC_getpeername_params*>);
|
2020-08-02 01:06:29 +00:00
|
|
|
int sys$sched_setparam(pid_t pid, Userspace<const struct sched_param*>);
|
2020-08-02 00:55:28 +00:00
|
|
|
int sys$sched_getparam(pid_t pid, Userspace<struct sched_param*>);
|
2020-08-05 07:11:56 +00:00
|
|
|
int sys$create_thread(void* (*)(void*), Userspace<const Syscall::SC_create_thread_params*>);
|
2019-11-13 20:49:24 +00:00
|
|
|
void sys$exit_thread(void*);
|
2020-08-08 23:08:24 +00:00
|
|
|
int sys$join_thread(pid_t tid, void** exit_value);
|
|
|
|
int sys$detach_thread(pid_t tid);
|
2020-08-09 22:27:23 +00:00
|
|
|
int sys$set_thread_name(pid_t tid, Userspace<const char*> buffer, size_t buffer_size);
|
2020-08-09 22:29:55 +00:00
|
|
|
int sys$get_thread_name(pid_t tid, Userspace<char*> buffer, size_t buffer_size);
|
2020-08-05 07:05:08 +00:00
|
|
|
int sys$rename(Userspace<const Syscall::SC_rename_params*>);
|
2020-08-05 07:02:19 +00:00
|
|
|
int sys$mknod(Userspace<const Syscall::SC_mknod_params*>);
|
2020-02-28 10:45:19 +00:00
|
|
|
int sys$shbuf_create(int, void** buffer);
|
|
|
|
int sys$shbuf_allow_pid(int, pid_t peer_pid);
|
|
|
|
int sys$shbuf_allow_all(int);
|
2020-08-09 22:30:11 +00:00
|
|
|
void* sys$shbuf_get(int shbuf_id, Userspace<size_t*> size);
|
2020-02-28 10:45:19 +00:00
|
|
|
int sys$shbuf_release(int shbuf_id);
|
|
|
|
int sys$shbuf_seal(int shbuf_id);
|
|
|
|
int sys$shbuf_set_volatile(int shbuf_id, bool);
|
2019-07-19 11:08:26 +00:00
|
|
|
int sys$halt();
|
2019-07-19 07:58:12 +00:00
|
|
|
int sys$reboot();
|
2019-07-29 05:26:01 +00:00
|
|
|
int sys$set_process_icon(int icon_id);
|
2020-08-07 09:37:39 +00:00
|
|
|
int sys$realpath(Userspace<const Syscall::SC_realpath_params*>);
|
2020-08-09 22:35:06 +00:00
|
|
|
ssize_t sys$getrandom(Userspace<void*>, size_t, unsigned int);
|
2020-08-01 23:34:01 +00:00
|
|
|
int sys$setkeymap(Userspace<const Syscall::SC_setkeymap_params*>);
|
2019-11-28 19:59:11 +00:00
|
|
|
int sys$module_load(const char* path, size_t path_length);
|
|
|
|
int sys$module_unload(const char* name, size_t name_length);
|
2019-12-11 19:36:56 +00:00
|
|
|
int sys$profiling_enable(pid_t);
|
|
|
|
int sys$profiling_disable(pid_t);
|
2020-08-05 06:53:23 +00:00
|
|
|
int sys$futex(Userspace<const Syscall::SC_futex_params*>);
|
2020-08-08 23:08:24 +00:00
|
|
|
int sys$set_thread_boost(pid_t tid, int amount);
|
2019-12-30 19:10:00 +00:00
|
|
|
int sys$set_process_boost(pid_t, int amount);
|
2020-01-12 18:03:42 +00:00
|
|
|
int sys$chroot(const char* path, size_t path_length, int mount_flags);
|
2020-08-01 23:17:45 +00:00
|
|
|
int sys$pledge(Userspace<const Syscall::SC_pledge_params*>);
|
2020-08-01 23:12:09 +00:00
|
|
|
int sys$unveil(Userspace<const Syscall::SC_unveil_params*>);
|
2020-03-08 09:36:51 +00:00
|
|
|
int sys$perf_event(int type, FlatPtr arg1, FlatPtr arg2);
|
2020-03-16 18:06:33 +00:00
|
|
|
int sys$get_stack_bounds(FlatPtr* stack_base, size_t* stack_size);
|
2020-08-01 22:25:19 +00:00
|
|
|
int sys$ptrace(Userspace<const Syscall::SC_ptrace_params*>);
|
2020-06-24 20:57:37 +00:00
|
|
|
int sys$sendfd(int sockfd, int fd);
|
|
|
|
int sys$recvfd(int sockfd);
|
2020-07-14 20:41:59 +00:00
|
|
|
long sys$sysconf(int name);
|
2020-08-08 15:32:34 +00:00
|
|
|
int sys$disown(ProcessID);
|
2019-02-16 11:13:43 +00:00
|
|
|
|
2020-01-27 20:11:36 +00:00
|
|
|
template<bool sockname, typename Params>
|
|
|
|
int get_sock_or_peer_name(const Params&);
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
static void initialize();
|
|
|
|
|
2020-05-06 19:11:38 +00:00
|
|
|
[[noreturn]] void crash(int signal, u32 eip, bool out_of_memory = false);
|
2020-02-05 16:42:43 +00:00
|
|
|
[[nodiscard]] static siginfo_t reap(Process&);
|
2018-10-17 22:26:30 +00:00
|
|
|
|
2018-10-30 14:33:37 +00:00
|
|
|
const TTY* tty() const { return m_tty; }
|
2020-02-16 01:01:42 +00:00
|
|
|
void set_tty(TTY*);
|
2018-10-30 14:33:37 +00:00
|
|
|
|
2019-01-31 16:31:23 +00:00
|
|
|
size_t region_count() const { return m_regions.size(); }
|
2020-08-02 02:04:56 +00:00
|
|
|
const NonnullOwnPtrVector<Region>& regions() const
|
|
|
|
{
|
|
|
|
ASSERT(m_lock.is_locked());
|
|
|
|
return m_regions;
|
|
|
|
}
|
2019-01-31 16:31:23 +00:00
|
|
|
void dump_regions();
|
2018-10-18 12:53:00 +00:00
|
|
|
|
2019-07-03 19:17:35 +00:00
|
|
|
u32 m_ticks_in_user { 0 };
|
|
|
|
u32 m_ticks_in_kernel { 0 };
|
2018-12-03 00:12:26 +00:00
|
|
|
|
2019-07-03 19:17:35 +00:00
|
|
|
u32 m_ticks_in_user_for_dead_children { 0 };
|
|
|
|
u32 m_ticks_in_kernel_for_dead_children { 0 };
|
2018-12-03 00:12:26 +00:00
|
|
|
|
2020-04-13 20:40:38 +00:00
|
|
|
[[nodiscard]] bool validate_read_from_kernel(VirtualAddress, size_t) const;
|
2018-10-26 22:14:24 +00:00
|
|
|
|
2020-04-13 20:40:38 +00:00
|
|
|
[[nodiscard]] bool validate_read(const void*, size_t) const;
|
|
|
|
[[nodiscard]] bool validate_write(void*, size_t) const;
|
2020-05-31 18:56:17 +00:00
|
|
|
|
2020-07-31 14:28:37 +00:00
|
|
|
template<typename T>
|
|
|
|
[[nodiscard]] bool validate_read(Userspace<T*> ptr, size_t size) const
|
|
|
|
{
|
2020-07-31 16:46:55 +00:00
|
|
|
return validate_read(ptr.unsafe_userspace_ptr(), size);
|
2020-07-31 14:28:37 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
[[nodiscard]] bool validate_write(Userspace<T*> ptr, size_t size) const
|
|
|
|
{
|
2020-07-31 16:46:55 +00:00
|
|
|
return validate_write(ptr.unsafe_userspace_ptr(), size);
|
2020-07-31 14:28:37 +00:00
|
|
|
}
|
|
|
|
|
2019-05-28 09:53:16 +00:00
|
|
|
template<typename T>
|
2020-05-31 18:56:17 +00:00
|
|
|
[[nodiscard]] bool validate_read_typed(T* value, size_t count = 1)
|
|
|
|
{
|
|
|
|
Checked size = sizeof(T);
|
|
|
|
size *= count;
|
|
|
|
if (size.has_overflow())
|
|
|
|
return false;
|
|
|
|
return validate_read(value, size.value());
|
|
|
|
}
|
|
|
|
|
2020-07-31 14:38:47 +00:00
|
|
|
template<typename T>
|
|
|
|
[[nodiscard]] bool validate_read_typed(Userspace<T*> value, size_t count = 1)
|
|
|
|
{
|
|
|
|
Checked size = sizeof(T);
|
|
|
|
size *= count;
|
|
|
|
if (size.has_overflow())
|
|
|
|
return false;
|
|
|
|
return validate_read(value, size.value());
|
|
|
|
}
|
|
|
|
|
2019-05-28 09:53:16 +00:00
|
|
|
template<typename T>
|
2020-04-13 20:40:38 +00:00
|
|
|
[[nodiscard]] bool validate_read_and_copy_typed(T* dest, const T* src)
|
2020-01-13 10:19:18 +00:00
|
|
|
{
|
|
|
|
bool validated = validate_read_typed(src);
|
|
|
|
if (validated) {
|
|
|
|
copy_from_user(dest, src);
|
|
|
|
}
|
|
|
|
return validated;
|
|
|
|
}
|
2020-05-31 18:56:17 +00:00
|
|
|
|
2020-07-31 14:28:37 +00:00
|
|
|
template<typename T>
|
|
|
|
[[nodiscard]] bool validate_read_and_copy_typed(T* dest, Userspace<const T*> src)
|
|
|
|
{
|
2020-07-31 16:46:55 +00:00
|
|
|
bool validated = validate_read_typed(src);
|
2020-07-31 14:28:37 +00:00
|
|
|
if (validated) {
|
2020-07-31 16:46:55 +00:00
|
|
|
copy_from_user(dest, src);
|
2020-07-31 14:28:37 +00:00
|
|
|
}
|
|
|
|
return validated;
|
|
|
|
}
|
|
|
|
|
2020-08-07 07:00:17 +00:00
|
|
|
template<typename T>
|
|
|
|
[[nodiscard]] bool validate_read_and_copy_typed(T* dest, Userspace<T*> src)
|
|
|
|
{
|
|
|
|
Userspace<const T*> const_src { src.ptr() };
|
|
|
|
return validate_read_and_copy_typed(dest, const_src);
|
|
|
|
}
|
|
|
|
|
2020-01-13 10:19:18 +00:00
|
|
|
template<typename T>
|
2020-05-31 18:56:17 +00:00
|
|
|
[[nodiscard]] bool validate_write_typed(T* value, size_t count = 1)
|
|
|
|
{
|
|
|
|
Checked size = sizeof(T);
|
|
|
|
size *= count;
|
|
|
|
if (size.has_overflow())
|
|
|
|
return false;
|
|
|
|
return validate_write(value, size.value());
|
|
|
|
}
|
2020-07-31 14:28:37 +00:00
|
|
|
|
|
|
|
template<typename T>
|
|
|
|
[[nodiscard]] bool validate_write_typed(Userspace<T*> value, size_t count = 1)
|
|
|
|
{
|
|
|
|
Checked size = sizeof(T);
|
|
|
|
size *= count;
|
|
|
|
if (size.has_overflow())
|
|
|
|
return false;
|
2020-07-31 16:46:55 +00:00
|
|
|
return validate_write(value, size.value());
|
2020-07-31 14:28:37 +00:00
|
|
|
}
|
|
|
|
|
2020-01-10 19:13:23 +00:00
|
|
|
template<typename DataType, typename SizeType>
|
2020-07-30 21:38:15 +00:00
|
|
|
[[nodiscard]] bool validate(const Syscall::MutableBufferArgument<DataType, SizeType>& buffer)
|
|
|
|
{
|
|
|
|
return validate_write(buffer.data, buffer.size);
|
|
|
|
}
|
|
|
|
|
2020-01-11 11:47:47 +00:00
|
|
|
template<typename DataType, typename SizeType>
|
2020-07-30 21:38:15 +00:00
|
|
|
[[nodiscard]] bool validate(const Syscall::ImmutableBufferArgument<DataType, SizeType>& buffer)
|
|
|
|
{
|
|
|
|
return validate_read(buffer.data, buffer.size);
|
|
|
|
}
|
2018-11-16 14:41:48 +00:00
|
|
|
|
2020-04-13 20:40:38 +00:00
|
|
|
[[nodiscard]] String validate_and_copy_string_from_user(const char*, size_t) const;
|
2020-07-31 14:28:37 +00:00
|
|
|
|
|
|
|
[[nodiscard]] String validate_and_copy_string_from_user(Userspace<const char*> user_characters, size_t size) const
|
|
|
|
{
|
2020-08-06 09:17:53 +00:00
|
|
|
return validate_and_copy_string_from_user(user_characters.unsafe_userspace_ptr(), size);
|
|
|
|
}
|
2020-07-31 14:28:37 +00:00
|
|
|
|
2020-04-13 20:40:38 +00:00
|
|
|
[[nodiscard]] String validate_and_copy_string_from_user(const Syscall::StringArgument&) const;
|
2020-01-10 20:26:47 +00:00
|
|
|
|
2019-05-30 18:23:50 +00:00
|
|
|
Custody& current_directory();
|
2020-07-30 21:38:15 +00:00
|
|
|
Custody* executable()
|
|
|
|
{
|
|
|
|
return m_executable.ptr();
|
|
|
|
}
|
2018-10-28 11:20:25 +00:00
|
|
|
|
2019-03-06 21:30:13 +00:00
|
|
|
int number_of_open_file_descriptors() const;
|
2020-07-30 21:38:15 +00:00
|
|
|
int max_open_file_descriptors() const
|
|
|
|
{
|
|
|
|
return m_max_open_file_descriptors;
|
|
|
|
}
|
2018-11-01 12:39:28 +00:00
|
|
|
|
2019-12-29 11:45:58 +00:00
|
|
|
size_t amount_clean_inode() const;
|
2019-12-29 11:28:32 +00:00
|
|
|
size_t amount_dirty_private() const;
|
2019-02-03 17:53:18 +00:00
|
|
|
size_t amount_virtual() const;
|
|
|
|
size_t amount_resident() const;
|
|
|
|
size_t amount_shared() const;
|
2019-12-09 18:12:38 +00:00
|
|
|
size_t amount_purgeable_volatile() const;
|
|
|
|
size_t amount_purgeable_nonvolatile() const;
|
2019-02-03 17:53:18 +00:00
|
|
|
|
Kernel: Tighten up exec/do_exec and allow for PT_INTERP iterpreters
This patch changes how exec() figures out which program image to
actually load. Previously, we opened the path to our main executable in
find_shebang_interpreter_for_executable, read the first page (or less,
if the file was smaller) and then decided whether to recurse with the
interpreter instead. We then then re-opened the main executable in
do_exec.
However, since we now want to parse the ELF header and Program Headers
of an elf image before even doing any memory region work, we can change
the way this whole process works. We open the file and read (up to) the
first page in exec() itself, then pass just the page and the amount read
to find_shebang_interpreter_for_executable. Since we now have that page
and the FileDescription for the main executable handy, we can do a few
things. First, validate the ELF header and ELF program headers for any
shenanigans. ELF32 Little Endian i386 only, please. Second, we can grab
the PT_INTERP interpreter from any ET_DYN files, and open that guy right
away if it exists. Finally, we can pass the main executable's and
optionally the PT_INTERP interpreter's file descriptions down to do_exec
and not have to feel guilty about opening the file twice.
In do_exec, we now have a choice. Are we going to load the main
executable, or the interpreter? We could load both, but it'll be way
easier for the inital pass on the RTLD if we only load the interpreter.
Then it can load the main executable itself like any old shared object,
just, the one with main in it :). Later on we can load both of them
into memory and the RTLD can relocate itself before trying to do
anything. The way it's written now the RTLD will get dibs on its
requested virtual addresses being the actual virtual addresses.
2020-01-11 01:28:02 +00:00
|
|
|
int exec(String path, Vector<String> arguments, Vector<String> environment, int recusion_depth = 0);
|
2018-11-02 19:41:58 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
bool is_superuser() const
|
|
|
|
{
|
|
|
|
return m_euid == 0;
|
|
|
|
}
|
2018-11-07 00:38:51 +00:00
|
|
|
|
2020-03-02 09:46:24 +00:00
|
|
|
Region* allocate_region_with_vmobject(VirtualAddress, size_t, NonnullRefPtr<VMObject>, size_t offset_in_vmobject, const String& name, int prot);
|
2020-05-08 19:47:08 +00:00
|
|
|
Region* allocate_region(VirtualAddress, size_t, const String& name, int prot = PROT_READ | PROT_WRITE, bool should_commit = true);
|
2020-03-02 09:46:24 +00:00
|
|
|
Region* allocate_region_with_vmobject(const Range&, NonnullRefPtr<VMObject>, size_t offset_in_vmobject, const String& name, int prot);
|
2020-05-08 19:47:08 +00:00
|
|
|
Region* allocate_region(const Range&, const String& name, int prot = PROT_READ | PROT_WRITE, bool should_commit = true);
|
2019-02-16 11:13:43 +00:00
|
|
|
bool deallocate_region(Region& region);
|
2019-02-16 08:57:42 +00:00
|
|
|
|
2019-12-19 18:13:44 +00:00
|
|
|
Region& allocate_split_region(const Region& source_region, const Range&, size_t offset_in_vmobject);
|
2019-12-30 20:11:25 +00:00
|
|
|
Vector<Region*, 2> split_region_around_range(const Region& source_region, const Range&);
|
2019-08-29 18:57:02 +00:00
|
|
|
|
2019-07-03 19:17:35 +00:00
|
|
|
void terminate_due_to_signal(u8 signal);
|
2020-05-16 10:33:48 +00:00
|
|
|
KResult send_signal(u8 signal, Process* sender);
|
2019-03-23 21:03:17 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
u16 thread_count() const
|
|
|
|
{
|
|
|
|
return m_thread_count.load(AK::MemoryOrder::memory_order_consume);
|
|
|
|
}
|
2019-12-22 10:35:02 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
Lock& big_lock()
|
|
|
|
{
|
|
|
|
return m_big_lock;
|
|
|
|
}
|
2019-04-01 18:02:05 +00:00
|
|
|
|
2020-03-02 09:40:40 +00:00
|
|
|
struct ELFBundle {
|
|
|
|
OwnPtr<Region> region;
|
2020-04-17 11:40:38 +00:00
|
|
|
RefPtr<ELF::Loader> elf_loader;
|
2020-03-02 09:40:40 +00:00
|
|
|
};
|
|
|
|
OwnPtr<ELFBundle> elf_bundle() const;
|
2019-05-16 15:18:25 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
int icon_id() const
|
|
|
|
{
|
|
|
|
return m_icon_id;
|
|
|
|
}
|
2019-07-29 05:26:01 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
u32 priority_boost() const
|
|
|
|
{
|
|
|
|
return m_priority_boost;
|
|
|
|
}
|
2019-12-30 19:10:00 +00:00
|
|
|
|
2020-01-10 22:14:04 +00:00
|
|
|
Custody& root_directory();
|
2020-01-12 18:42:01 +00:00
|
|
|
Custody& root_directory_relative_to_global_root();
|
2020-01-10 22:14:04 +00:00
|
|
|
void set_root_directory(const Custody&);
|
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
bool has_promises() const
|
|
|
|
{
|
|
|
|
return m_promises;
|
|
|
|
}
|
|
|
|
bool has_promised(Pledge pledge) const
|
|
|
|
{
|
|
|
|
return m_promises & (1u << (u32)pledge);
|
|
|
|
}
|
2020-01-11 19:48:43 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
VeilState veil_state() const
|
|
|
|
{
|
|
|
|
return m_veil_state;
|
|
|
|
}
|
|
|
|
const Vector<UnveiledPath>& unveiled_paths() const
|
|
|
|
{
|
|
|
|
return m_unveiled_paths;
|
|
|
|
}
|
Kernel: Add a basic implementation of unveil()
This syscall is a complement to pledge() and adds the same sort of
incremental relinquishing of capabilities for filesystem access.
The first call to unveil() will "drop a veil" on the process, and from
now on, only unveiled parts of the filesystem are visible to it.
Each call to unveil() specifies a path to either a directory or a file
along with permissions for that path. The permissions are a combination
of the following:
- r: Read access (like the "rpath" promise)
- w: Write access (like the "wpath" promise)
- x: Execute access
- c: Create/remove access (like the "cpath" promise)
Attempts to open a path that has not been unveiled with fail with
ENOENT. If the unveiled path lacks sufficient permissions, it will fail
with EACCES.
Like pledge(), subsequent calls to unveil() with the same path can only
remove permissions, not add them.
Once you call unveil(nullptr, nullptr), the veil is locked, and it's no
longer possible to unveil any more paths for the process, ever.
This concept comes from OpenBSD, and their implementation does various
things differently, I'm sure. This is just a first implementation for
SerenityOS, and we'll keep improving on it as we go. :^)
2020-01-20 21:12:04 +00:00
|
|
|
|
2020-07-30 21:38:15 +00:00
|
|
|
bool wait_for_tracer_at_next_execve() const
|
|
|
|
{
|
|
|
|
return m_wait_for_tracer_at_next_execve;
|
|
|
|
}
|
|
|
|
void set_wait_for_tracer_at_next_execve(bool val)
|
|
|
|
{
|
|
|
|
m_wait_for_tracer_at_next_execve = val;
|
|
|
|
}
|
2020-04-07 15:23:37 +00:00
|
|
|
|
2020-08-01 22:25:19 +00:00
|
|
|
KResultOr<u32> peek_user_data(Userspace<const u32*> address);
|
|
|
|
KResult poke_user_data(Userspace<u32*> address, u32 data);
|
2020-04-07 15:23:37 +00:00
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
private:
|
2018-10-18 11:05:00 +00:00
|
|
|
friend class MemoryManager;
|
2018-11-07 21:15:02 +00:00
|
|
|
friend class Scheduler;
|
2018-11-08 13:35:30 +00:00
|
|
|
friend class Region;
|
2018-10-18 11:05:00 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
Process(Thread*& first_thread, const String& name, uid_t, gid_t, ProcessID ppid, RingLevel, RefPtr<Custody> cwd = nullptr, RefPtr<Custody> executable = nullptr, TTY* = nullptr, Process* fork_parent = nullptr);
|
|
|
|
static ProcessID allocate_pid();
|
2018-10-25 09:15:17 +00:00
|
|
|
|
2020-02-16 11:55:56 +00:00
|
|
|
Range allocate_range(VirtualAddress, size_t, size_t alignment = PAGE_SIZE);
|
2019-05-17 02:39:22 +00:00
|
|
|
|
2020-01-19 15:25:38 +00:00
|
|
|
Region& add_region(NonnullOwnPtr<Region>);
|
|
|
|
|
Kernel: Allow process with multiple threads to call exec and exit
This allows a process wich has more than 1 thread to call exec, even
from a thread. This kills all the other threads, but it won't wait for
them to finish, just makes sure that they are not in a running/runable
state.
In the case where a thread does exec, the new program PID will be the
thread TID, to keep the PID == TID in the new process.
This introduces a new function inside the Process class,
kill_threads_except_self which is called on exit() too (exit with
multiple threads wasn't properly working either).
Inside the Lock class, there is the need for a new function,
clear_waiters, which removes all the waiters from the
Process::big_lock. This is needed since after a exit/exec, there should
be no other threads waiting for this lock, the threads should be simply
killed. Only queued threads should wait for this lock at this point,
since blocked threads are handled in set_should_die.
2020-02-18 12:28:28 +00:00
|
|
|
void kill_threads_except_self();
|
|
|
|
void kill_all_threads();
|
|
|
|
|
2020-07-03 11:19:50 +00:00
|
|
|
int do_exec(NonnullRefPtr<FileDescription> main_program_description, Vector<String> arguments, Vector<String> environment, RefPtr<FileDescription> interpreter_description, Thread*& new_main_thread, u32& prev_flags);
|
2019-07-03 19:17:35 +00:00
|
|
|
ssize_t do_write(FileDescription&, const u8*, int data_size);
|
2018-10-16 09:01:38 +00:00
|
|
|
|
Kernel: Tighten up exec/do_exec and allow for PT_INTERP iterpreters
This patch changes how exec() figures out which program image to
actually load. Previously, we opened the path to our main executable in
find_shebang_interpreter_for_executable, read the first page (or less,
if the file was smaller) and then decided whether to recurse with the
interpreter instead. We then then re-opened the main executable in
do_exec.
However, since we now want to parse the ELF header and Program Headers
of an elf image before even doing any memory region work, we can change
the way this whole process works. We open the file and read (up to) the
first page in exec() itself, then pass just the page and the amount read
to find_shebang_interpreter_for_executable. Since we now have that page
and the FileDescription for the main executable handy, we can do a few
things. First, validate the ELF header and ELF program headers for any
shenanigans. ELF32 Little Endian i386 only, please. Second, we can grab
the PT_INTERP interpreter from any ET_DYN files, and open that guy right
away if it exists. Finally, we can pass the main executable's and
optionally the PT_INTERP interpreter's file descriptions down to do_exec
and not have to feel guilty about opening the file twice.
In do_exec, we now have a choice. Are we going to load the main
executable, or the interpreter? We could load both, but it'll be way
easier for the inital pass on the RTLD if we only load the interpreter.
Then it can load the main executable itself like any old shared object,
just, the one with main in it :). Later on we can load both of them
into memory and the RTLD can relocate itself before trying to do
anything. The way it's written now the RTLD will get dibs on its
requested virtual addresses being the actual virtual addresses.
2020-01-11 01:28:02 +00:00
|
|
|
KResultOr<NonnullRefPtr<FileDescription>> find_elf_interpreter_for_executable(const String& path, char (&first_page)[PAGE_SIZE], int nread, size_t file_size);
|
2020-07-04 23:37:36 +00:00
|
|
|
Vector<AuxiliaryValue> generate_auxiliary_vector() const;
|
Kernel: Tighten up exec/do_exec and allow for PT_INTERP iterpreters
This patch changes how exec() figures out which program image to
actually load. Previously, we opened the path to our main executable in
find_shebang_interpreter_for_executable, read the first page (or less,
if the file was smaller) and then decided whether to recurse with the
interpreter instead. We then then re-opened the main executable in
do_exec.
However, since we now want to parse the ELF header and Program Headers
of an elf image before even doing any memory region work, we can change
the way this whole process works. We open the file and read (up to) the
first page in exec() itself, then pass just the page and the amount read
to find_shebang_interpreter_for_executable. Since we now have that page
and the FileDescription for the main executable handy, we can do a few
things. First, validate the ELF header and ELF program headers for any
shenanigans. ELF32 Little Endian i386 only, please. Second, we can grab
the PT_INTERP interpreter from any ET_DYN files, and open that guy right
away if it exists. Finally, we can pass the main executable's and
optionally the PT_INTERP interpreter's file descriptions down to do_exec
and not have to feel guilty about opening the file twice.
In do_exec, we now have a choice. Are we going to load the main
executable, or the interpreter? We could load both, but it'll be way
easier for the inital pass on the RTLD if we only load the interpreter.
Then it can load the main executable itself like any old shared object,
just, the one with main in it :). Later on we can load both of them
into memory and the RTLD can relocate itself before trying to do
anything. The way it's written now the RTLD will get dibs on its
requested virtual addresses being the actual virtual addresses.
2020-01-11 01:28:02 +00:00
|
|
|
|
2019-04-06 12:54:32 +00:00
|
|
|
int alloc_fd(int first_candidate_fd = 0);
|
2019-02-16 11:13:43 +00:00
|
|
|
void disown_all_shared_buffers();
|
2018-11-12 00:28:46 +00:00
|
|
|
|
2019-11-14 16:16:30 +00:00
|
|
|
KResult do_kill(Process&, int signal);
|
2020-08-08 23:08:24 +00:00
|
|
|
KResult do_killpg(ProcessGroupID pgrp, int signal);
|
2020-04-26 00:45:23 +00:00
|
|
|
KResult do_killall(int signal);
|
|
|
|
KResult do_killself(int signal);
|
2019-11-14 16:16:30 +00:00
|
|
|
|
2020-02-05 16:42:43 +00:00
|
|
|
KResultOr<siginfo_t> do_waitid(idtype_t idtype, int id, int options);
|
|
|
|
|
2020-01-11 11:47:47 +00:00
|
|
|
KResultOr<String> get_syscall_path_argument(const char* user_path, size_t path_length) const;
|
2020-07-31 14:28:37 +00:00
|
|
|
KResultOr<String> get_syscall_path_argument(Userspace<const char*> user_path, size_t path_length) const
|
|
|
|
{
|
2020-07-31 16:46:55 +00:00
|
|
|
return get_syscall_path_argument(user_path.unsafe_userspace_ptr(), path_length);
|
2020-07-31 14:28:37 +00:00
|
|
|
}
|
2020-01-11 11:47:47 +00:00
|
|
|
KResultOr<String> get_syscall_path_argument(const Syscall::StringArgument&) const;
|
2020-01-06 10:05:59 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
bool has_tracee_thread(ProcessID tracer_pid) const;
|
2020-03-28 08:47:16 +00:00
|
|
|
|
2019-06-21 16:37:47 +00:00
|
|
|
RefPtr<PageDirectory> m_page_directory;
|
2018-11-01 08:01:51 +00:00
|
|
|
|
2018-11-01 12:15:46 +00:00
|
|
|
Process* m_prev { nullptr };
|
|
|
|
Process* m_next { nullptr };
|
2018-10-16 09:01:38 +00:00
|
|
|
|
|
|
|
String m_name;
|
2019-03-23 21:03:17 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
ProcessID m_pid { 0 };
|
2020-08-08 20:04:20 +00:00
|
|
|
SessionID m_sid { 0 };
|
|
|
|
ProcessGroupID m_pgid { 0 };
|
2019-03-23 21:03:17 +00:00
|
|
|
|
2020-06-17 12:58:00 +00:00
|
|
|
uid_t m_euid { 0 };
|
|
|
|
gid_t m_egid { 0 };
|
|
|
|
uid_t m_uid { 0 };
|
|
|
|
gid_t m_gid { 0 };
|
|
|
|
uid_t m_suid { 0 };
|
|
|
|
gid_t m_sgid { 0 };
|
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
ThreadID m_exec_tid { 0 };
|
2020-07-04 23:37:36 +00:00
|
|
|
FlatPtr m_load_offset { 0U };
|
|
|
|
FlatPtr m_entry_eip { 0U };
|
Kernel: Allow process with multiple threads to call exec and exit
This allows a process wich has more than 1 thread to call exec, even
from a thread. This kills all the other threads, but it won't wait for
them to finish, just makes sure that they are not in a running/runable
state.
In the case where a thread does exec, the new program PID will be the
thread TID, to keep the PID == TID in the new process.
This introduces a new function inside the Process class,
kill_threads_except_self which is called on exit() too (exit with
multiple threads wasn't properly working either).
Inside the Lock class, there is the need for a new function,
clear_waiters, which removes all the waiters from the
Process::big_lock. This is needed since after a exit/exec, there should
be no other threads waiting for this lock, the threads should be simply
killed. Only queued threads should wait for this lock at this point,
since blocked threads are handled in set_should_die.
2020-02-18 12:28:28 +00:00
|
|
|
|
2019-08-08 12:56:50 +00:00
|
|
|
static const int m_max_open_file_descriptors { FD_SETSIZE };
|
2019-03-23 21:03:17 +00:00
|
|
|
|
2020-07-30 21:50:31 +00:00
|
|
|
class FileDescriptionAndFlags {
|
|
|
|
public:
|
|
|
|
operator bool() const { return !!m_description; }
|
|
|
|
|
|
|
|
FileDescription* description() { return m_description; }
|
|
|
|
const FileDescription* description() const { return m_description; }
|
|
|
|
|
|
|
|
u32 flags() const { return m_flags; }
|
|
|
|
void set_flags(u32 flags) { m_flags = flags; }
|
|
|
|
|
2019-04-29 02:55:54 +00:00
|
|
|
void clear();
|
2020-07-30 21:50:31 +00:00
|
|
|
void set(NonnullRefPtr<FileDescription>&&, u32 flags = 0);
|
|
|
|
|
|
|
|
private:
|
|
|
|
RefPtr<FileDescription> m_description;
|
|
|
|
u32 m_flags { 0 };
|
2018-11-13 00:36:31 +00:00
|
|
|
};
|
2019-06-07 07:36:51 +00:00
|
|
|
Vector<FileDescriptionAndFlags> m_fds;
|
2018-11-07 17:30:59 +00:00
|
|
|
|
2019-08-08 12:56:50 +00:00
|
|
|
RingLevel m_ring { Ring0 };
|
2019-07-03 19:17:35 +00:00
|
|
|
u8 m_termination_status { 0 };
|
|
|
|
u8 m_termination_signal { 0 };
|
2020-06-28 21:34:31 +00:00
|
|
|
Atomic<u16> m_thread_count { 0 };
|
2018-10-18 11:05:00 +00:00
|
|
|
|
2019-08-08 12:56:50 +00:00
|
|
|
bool m_dead { false };
|
2019-12-11 19:36:56 +00:00
|
|
|
bool m_profiling { false };
|
2019-08-08 12:56:50 +00:00
|
|
|
|
2019-06-21 16:37:47 +00:00
|
|
|
RefPtr<Custody> m_executable;
|
|
|
|
RefPtr<Custody> m_cwd;
|
2020-01-10 22:14:04 +00:00
|
|
|
RefPtr<Custody> m_root_directory;
|
2020-01-12 18:42:01 +00:00
|
|
|
RefPtr<Custody> m_root_directory_relative_to_global_root;
|
2018-10-24 12:28:22 +00:00
|
|
|
|
2019-11-06 15:52:54 +00:00
|
|
|
RefPtr<TTY> m_tty;
|
2018-10-30 12:59:29 +00:00
|
|
|
|
2020-07-30 21:52:28 +00:00
|
|
|
Region* find_region_from_range(const Range&);
|
|
|
|
Region* find_region_containing(const Range&);
|
2018-10-18 12:53:00 +00:00
|
|
|
|
2019-09-27 12:19:07 +00:00
|
|
|
NonnullOwnPtrVector<Region> m_regions;
|
2020-01-19 15:44:37 +00:00
|
|
|
struct RegionLookupCache {
|
|
|
|
Range range;
|
2020-02-24 12:24:30 +00:00
|
|
|
WeakPtr<Region> region;
|
2020-01-19 15:44:37 +00:00
|
|
|
};
|
|
|
|
RegionLookupCache m_region_lookup_cache;
|
2018-10-18 11:05:00 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
ProcessID m_ppid { 0 };
|
2018-11-06 12:40:23 +00:00
|
|
|
mode_t m_umask { 022 };
|
2018-10-26 09:16:56 +00:00
|
|
|
|
2020-02-18 09:19:32 +00:00
|
|
|
FixedArray<gid_t> m_extra_gids;
|
2018-11-07 20:19:47 +00:00
|
|
|
|
2020-02-28 13:04:49 +00:00
|
|
|
WeakPtr<Region> m_master_tls_region;
|
2019-09-07 13:50:44 +00:00
|
|
|
size_t m_master_tls_size { 0 };
|
|
|
|
size_t m_master_tls_alignment { 0 };
|
|
|
|
|
2019-05-02 01:28:20 +00:00
|
|
|
Lock m_big_lock { "Process" };
|
2020-08-01 20:41:54 +00:00
|
|
|
mutable SpinLock<u32> m_lock;
|
2019-06-07 09:30:07 +00:00
|
|
|
|
2019-07-03 19:17:35 +00:00
|
|
|
u64 m_alarm_deadline { 0 };
|
2019-07-29 05:26:01 +00:00
|
|
|
|
|
|
|
int m_icon_id { -1 };
|
2019-12-22 20:29:47 +00:00
|
|
|
|
2019-12-30 19:10:00 +00:00
|
|
|
u32 m_priority_boost { 0 };
|
|
|
|
|
2020-01-11 19:48:43 +00:00
|
|
|
u32 m_promises { 0 };
|
|
|
|
u32 m_execpromises { 0 };
|
|
|
|
|
2020-01-21 18:28:29 +00:00
|
|
|
VeilState m_veil_state { VeilState::None };
|
Kernel: Add a basic implementation of unveil()
This syscall is a complement to pledge() and adds the same sort of
incremental relinquishing of capabilities for filesystem access.
The first call to unveil() will "drop a veil" on the process, and from
now on, only unveiled parts of the filesystem are visible to it.
Each call to unveil() specifies a path to either a directory or a file
along with permissions for that path. The permissions are a combination
of the following:
- r: Read access (like the "rpath" promise)
- w: Write access (like the "wpath" promise)
- x: Execute access
- c: Create/remove access (like the "cpath" promise)
Attempts to open a path that has not been unveiled with fail with
ENOENT. If the unveiled path lacks sufficient permissions, it will fail
with EACCES.
Like pledge(), subsequent calls to unveil() with the same path can only
remove permissions, not add them.
Once you call unveil(nullptr, nullptr), the veil is locked, and it's no
longer possible to unveil any more paths for the process, ever.
This concept comes from OpenBSD, and their implementation does various
things differently, I'm sure. This is just a first implementation for
SerenityOS, and we'll keep improving on it as we go. :^)
2020-01-20 21:12:04 +00:00
|
|
|
Vector<UnveiledPath> m_unveiled_paths;
|
|
|
|
|
2020-08-05 06:53:23 +00:00
|
|
|
WaitQueue& futex_queue(Userspace<const i32*>);
|
2019-12-22 20:29:47 +00:00
|
|
|
HashMap<u32, OwnPtr<WaitQueue>> m_futex_queues;
|
2020-02-02 19:26:27 +00:00
|
|
|
|
|
|
|
OwnPtr<PerformanceEventBuffer> m_perf_event_buffer;
|
2020-02-17 12:29:49 +00:00
|
|
|
|
2020-03-28 08:47:16 +00:00
|
|
|
// This member is used in the implementation of ptrace's PT_TRACEME flag.
|
|
|
|
// If it is set to true, the process will stop at the next execve syscall
|
|
|
|
// and wait for a tracer to attach.
|
|
|
|
bool m_wait_for_tracer_at_next_execve { false };
|
2018-10-16 09:01:38 +00:00
|
|
|
};
|
|
|
|
|
2018-11-07 21:15:02 +00:00
|
|
|
extern InlineLinkedList<Process>* g_processes;
|
2020-06-28 21:34:31 +00:00
|
|
|
extern RecursiveSpinLock g_processes_lock;
|
2018-11-08 15:09:05 +00:00
|
|
|
|
|
|
|
template<typename Callback>
|
|
|
|
inline void Process::for_each(Callback callback)
|
|
|
|
{
|
|
|
|
ASSERT_INTERRUPTS_DISABLED();
|
2020-06-28 21:34:31 +00:00
|
|
|
ScopedSpinLock lock(g_processes_lock);
|
2018-11-08 15:09:05 +00:00
|
|
|
for (auto* process = g_processes->head(); process;) {
|
|
|
|
auto* next_process = process->next();
|
2019-06-07 15:13:23 +00:00
|
|
|
if (callback(*process) == IterationDecision::Break)
|
2018-11-08 15:09:05 +00:00
|
|
|
break;
|
|
|
|
process = next_process;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-11 14:36:40 +00:00
|
|
|
template<typename Callback>
|
|
|
|
inline void Process::for_each_child(Callback callback)
|
|
|
|
{
|
|
|
|
ASSERT_INTERRUPTS_DISABLED();
|
2020-08-08 15:32:34 +00:00
|
|
|
ProcessID my_pid = pid();
|
2020-06-28 21:34:31 +00:00
|
|
|
ScopedSpinLock lock(g_processes_lock);
|
2018-11-11 14:36:40 +00:00
|
|
|
for (auto* process = g_processes->head(); process;) {
|
|
|
|
auto* next_process = process->next();
|
2020-08-08 23:08:24 +00:00
|
|
|
if (process->ppid() == my_pid || process->has_tracee_thread(m_pid)) {
|
2019-07-14 09:35:49 +00:00
|
|
|
if (callback(*process) == IterationDecision::Break)
|
2018-11-11 14:36:40 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
process = next_process;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-11-08 15:09:05 +00:00
|
|
|
template<typename Callback>
|
2019-03-23 21:03:17 +00:00
|
|
|
inline void Process::for_each_thread(Callback callback) const
|
2018-11-08 15:09:05 +00:00
|
|
|
{
|
2019-03-23 21:03:17 +00:00
|
|
|
InterruptDisabler disabler;
|
2020-08-08 15:32:34 +00:00
|
|
|
ProcessID my_pid = pid();
|
2019-11-26 20:25:11 +00:00
|
|
|
|
|
|
|
if (my_pid == 0) {
|
2019-12-22 10:35:02 +00:00
|
|
|
// NOTE: Special case the colonel process, since its main thread is not in the global thread table.
|
2020-06-28 21:34:31 +00:00
|
|
|
Processor::for_each(
|
2020-07-04 23:37:36 +00:00
|
|
|
[&](Processor& proc) -> IterationDecision {
|
2020-06-28 21:34:31 +00:00
|
|
|
auto idle_thread = proc.idle_thread();
|
|
|
|
if (idle_thread != nullptr)
|
|
|
|
return callback(*idle_thread);
|
|
|
|
return IterationDecision::Continue;
|
|
|
|
});
|
2019-11-26 20:25:11 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2019-07-19 10:16:46 +00:00
|
|
|
Thread::for_each([callback, my_pid](Thread& thread) -> IterationDecision {
|
|
|
|
if (thread.pid() == my_pid)
|
|
|
|
return callback(thread);
|
|
|
|
|
|
|
|
return IterationDecision::Continue;
|
|
|
|
});
|
2018-11-08 15:09:05 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template<typename Callback>
|
2020-08-08 20:04:20 +00:00
|
|
|
inline void Process::for_each_in_pgrp(ProcessGroupID pgid, Callback callback)
|
2018-11-08 15:09:05 +00:00
|
|
|
{
|
|
|
|
ASSERT_INTERRUPTS_DISABLED();
|
2020-06-28 21:34:31 +00:00
|
|
|
ScopedSpinLock lock(g_processes_lock);
|
2018-11-08 15:09:05 +00:00
|
|
|
for (auto* process = g_processes->head(); process;) {
|
|
|
|
auto* next_process = process->next();
|
2019-12-26 21:20:39 +00:00
|
|
|
if (!process->is_dead() && process->pgid() == pgid) {
|
2019-08-22 19:12:55 +00:00
|
|
|
if (callback(*process) == IterationDecision::Break)
|
2019-03-23 21:03:17 +00:00
|
|
|
break;
|
|
|
|
}
|
2018-11-08 15:09:05 +00:00
|
|
|
process = next_process;
|
|
|
|
}
|
|
|
|
}
|
2019-02-21 14:45:31 +00:00
|
|
|
|
2020-01-07 18:17:35 +00:00
|
|
|
inline bool InodeMetadata::may_read(const Process& process) const
|
2019-02-21 14:45:31 +00:00
|
|
|
{
|
2020-01-02 22:45:52 +00:00
|
|
|
return may_read(process.euid(), process.egid(), process.extra_gids());
|
2019-02-21 14:45:31 +00:00
|
|
|
}
|
|
|
|
|
2020-01-07 18:17:35 +00:00
|
|
|
inline bool InodeMetadata::may_write(const Process& process) const
|
2019-02-21 14:45:31 +00:00
|
|
|
{
|
2020-01-02 22:45:52 +00:00
|
|
|
return may_write(process.euid(), process.egid(), process.extra_gids());
|
2019-02-21 14:45:31 +00:00
|
|
|
}
|
|
|
|
|
2020-01-07 18:17:35 +00:00
|
|
|
inline bool InodeMetadata::may_execute(const Process& process) const
|
2019-02-21 14:45:31 +00:00
|
|
|
{
|
2020-01-02 22:45:52 +00:00
|
|
|
return may_execute(process.euid(), process.egid(), process.extra_gids());
|
2019-02-21 14:45:31 +00:00
|
|
|
}
|
2019-03-23 21:03:17 +00:00
|
|
|
|
2020-08-08 15:32:34 +00:00
|
|
|
inline ProcessID Thread::pid() const
|
2019-03-23 21:03:17 +00:00
|
|
|
{
|
2020-08-02 02:04:56 +00:00
|
|
|
return m_process->pid();
|
2019-03-23 21:03:17 +00:00
|
|
|
}
|
2019-07-08 16:58:19 +00:00
|
|
|
|
|
|
|
inline const LogStream& operator<<(const LogStream& stream, const Process& process)
|
|
|
|
{
|
2020-08-08 15:32:34 +00:00
|
|
|
return stream << process.name() << '(' << process.pid().value() << ')';
|
2019-07-08 16:58:19 +00:00
|
|
|
}
|
2019-12-30 19:10:00 +00:00
|
|
|
|
|
|
|
inline u32 Thread::effective_priority() const
|
|
|
|
{
|
2020-08-02 02:04:56 +00:00
|
|
|
return m_priority + m_process->priority_boost() + m_priority_boost + m_extra_priority;
|
2019-12-30 19:10:00 +00:00
|
|
|
}
|
2020-01-12 01:17:30 +00:00
|
|
|
|
2020-06-28 21:34:31 +00:00
|
|
|
#define REQUIRE_NO_PROMISES \
|
|
|
|
do { \
|
|
|
|
if (Process::current()->has_promises()) { \
|
|
|
|
dbg() << "Has made a promise"; \
|
|
|
|
cli(); \
|
|
|
|
Process::current()->crash(SIGABRT, 0); \
|
|
|
|
ASSERT_NOT_REACHED(); \
|
|
|
|
} \
|
2020-01-12 01:17:30 +00:00
|
|
|
} while (0)
|
|
|
|
|
2020-06-28 21:34:31 +00:00
|
|
|
#define REQUIRE_PROMISE(promise) \
|
|
|
|
do { \
|
|
|
|
if (Process::current()->has_promises() \
|
|
|
|
&& !Process::current()->has_promised(Pledge::promise)) { \
|
|
|
|
dbg() << "Has not pledged " << #promise; \
|
|
|
|
cli(); \
|
|
|
|
Process::current()->crash(SIGABRT, 0); \
|
|
|
|
ASSERT_NOT_REACHED(); \
|
|
|
|
} \
|
2020-01-12 01:17:30 +00:00
|
|
|
} while (0)
|
2020-02-16 00:27:42 +00:00
|
|
|
|
|
|
|
}
|