mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-09-19 09:17:38 +03:00
2d045d2a64
sys$fork() now clones all writable regions with per-page COW bits. The pages are then mapped read-only and we handle a PF by COWing the pages. This is quite delightful. Obviously there's lots of work to do still, and it needs better data structures, but the general concept works.
113 lines
3.0 KiB
C++
113 lines
3.0 KiB
C++
#pragma once
|
|
|
|
#include <AK/Types.h>
|
|
|
|
#define PACKED __attribute__ ((packed))
|
|
#define NORETURN __attribute__ ((noreturn))
|
|
#define ALWAYS_INLINE __attribute__ ((always_inline))
|
|
#define PURE __attribute__ ((pure))
|
|
#define PUBLIC
|
|
#define PRIVATE static
|
|
|
|
typedef unsigned char BYTE;
|
|
typedef unsigned short WORD;
|
|
typedef unsigned int DWORD;
|
|
|
|
typedef DWORD __u32;
|
|
typedef WORD __u16;
|
|
typedef BYTE __u8;
|
|
typedef int __s32;
|
|
typedef short __s16;
|
|
|
|
typedef DWORD uid_t;
|
|
typedef DWORD gid_t;
|
|
typedef int pid_t;
|
|
typedef DWORD time_t;
|
|
typedef DWORD suseconds_t;
|
|
typedef DWORD size_t;
|
|
|
|
struct timeval {
|
|
time_t tv_sec;
|
|
suseconds_t tv_usec;
|
|
};
|
|
|
|
#define UTSNAME_ENTRY_LEN 65
|
|
|
|
struct utsname {
|
|
char sysname[UTSNAME_ENTRY_LEN];
|
|
char nodename[UTSNAME_ENTRY_LEN];
|
|
char release[UTSNAME_ENTRY_LEN];
|
|
char version[UTSNAME_ENTRY_LEN];
|
|
char machine[UTSNAME_ENTRY_LEN];
|
|
};
|
|
|
|
typedef dword ino_t;
|
|
typedef signed_dword off_t;
|
|
|
|
typedef dword dev_t;
|
|
typedef dword mode_t;
|
|
typedef dword nlink_t;
|
|
typedef dword blksize_t;
|
|
typedef dword blkcnt_t;
|
|
typedef dword time_t;
|
|
typedef dword suseconds_t;
|
|
|
|
struct FarPtr {
|
|
DWORD offset { 0 };
|
|
WORD selector { 0 };
|
|
} PACKED;
|
|
|
|
class PhysicalAddress {
|
|
public:
|
|
PhysicalAddress() { }
|
|
explicit PhysicalAddress(dword address) : m_address(address) { }
|
|
|
|
dword get() const { return m_address; }
|
|
void set(dword address) { m_address = address; }
|
|
void mask(dword m) { m_address &= m; }
|
|
|
|
bool is_null() const { return m_address == 0; }
|
|
|
|
byte* asPtr() { return reinterpret_cast<byte*>(m_address); }
|
|
const byte* asPtr() const { return reinterpret_cast<const byte*>(m_address); }
|
|
|
|
dword pageBase() const { return m_address & 0xfffff000; }
|
|
|
|
bool operator==(const PhysicalAddress& other) const { return m_address == other.m_address; }
|
|
|
|
private:
|
|
dword m_address { 0 };
|
|
};
|
|
|
|
class LinearAddress {
|
|
public:
|
|
LinearAddress() { }
|
|
explicit LinearAddress(dword address) : m_address(address) { }
|
|
|
|
bool is_null() const { return m_address == 0; }
|
|
|
|
LinearAddress offset(dword o) const { return LinearAddress(m_address + o); }
|
|
dword get() const { return m_address; }
|
|
void set(dword address) { m_address = address; }
|
|
void mask(dword m) { m_address &= m; }
|
|
|
|
bool operator<=(const LinearAddress& other) const { return m_address <= other.m_address; }
|
|
bool operator>=(const LinearAddress& other) const { return m_address >= other.m_address; }
|
|
bool operator>(const LinearAddress& other) const { return m_address > other.m_address; }
|
|
bool operator<(const LinearAddress& other) const { return m_address < other.m_address; }
|
|
bool operator==(const LinearAddress& other) const { return m_address == other.m_address; }
|
|
|
|
byte* asPtr() { return reinterpret_cast<byte*>(m_address); }
|
|
const byte* asPtr() const { return reinterpret_cast<const byte*>(m_address); }
|
|
|
|
dword pageBase() const { return m_address & 0xfffff000; }
|
|
|
|
private:
|
|
dword m_address { 0 };
|
|
};
|
|
|
|
inline LinearAddress operator-(const LinearAddress& a, const LinearAddress& b)
|
|
{
|
|
return LinearAddress(a.get() - b.get());
|
|
}
|