diff options
| author | Kimplul <kimi.h.kuparinen@gmail.com> | 2022-11-13 07:28:52 +0200 |
|---|---|---|
| committer | Kimplul <kimi.h.kuparinen@gmail.com> | 2022-11-13 07:28:52 +0200 |
| commit | b36e3b83b402ee054c319f0472b16a2bd64bba7e (patch) | |
| tree | 91a1eff471354c2c2220b0f31c962d53595b43c4 /include | |
| parent | 6d3586aa42409fc720e30856cb5df5284329463a (diff) | |
| download | kmi-b36e3b83b402ee054c319f0472b16a2bd64bba7e.tar.gz kmi-b36e3b83b402ee054c319f0472b16a2bd64bba7e.zip | |
~1.3M ipc requests
+ The secret is using gravestones. I'll have to write up full
documentation for the feature but essentially riscv lets us encode
whatever we want into page table entries, as long as they're not
active. We use this to encode highest user address that is not a zero,
in that all entries in the top level are either active or gravestones.
When an active entry is removed, it is either a gravestone (if there
are other active entries above it) or it starts a cascade of removing
entries that have been previously removed
Slight runtime overhead to page mapping, pretty major advantage in rpc
calls. Feature will need to be tested more thorougly, and the init
program is sort of a best scenario with just one top level userspace
page table entry active at a time, leading to incredibly fast context
switches.
Current implementation limits a process' max virtual memory to 248 GiB
(in Sv39), but I don't think the missing 8 GiB is that big of a deal.
Diffstat (limited to 'include')
| -rw-r--r-- | include/arch/vmem.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/include/arch/vmem.h b/include/arch/vmem.h index 1a2ab7e..f6660ed 100644 --- a/include/arch/vmem.h +++ b/include/arch/vmem.h @@ -159,6 +159,6 @@ stat_t destroy_vmem(struct vmem *b); * @param b Destination virtual memory of clone. * @return \ref OK. */ -stat_t clone_uvmem(struct vmem *r, struct vmem *b); +void clone_uvmem(struct vmem *r, struct vmem *b); #endif /* APOS_ARCH_PAGES_H */ |
