AddressSpace.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421
  1. /*
  2. * Copyright (c) 2021, Andreas Kling <kling@serenityos.org>
  3. * Copyright (c) 2021, Leon Albrecht <leon2002.la@gmail.com>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <Kernel/Arch/CPU.h>
  8. #include <Kernel/Locking/Spinlock.h>
  9. #include <Kernel/Memory/AddressSpace.h>
  10. #include <Kernel/Memory/AnonymousVMObject.h>
  11. #include <Kernel/Memory/InodeVMObject.h>
  12. #include <Kernel/Memory/MemoryManager.h>
  13. #include <Kernel/PerformanceManager.h>
  14. #include <Kernel/Process.h>
  15. #include <Kernel/Scheduler.h>
  16. namespace Kernel::Memory {
  17. ErrorOr<NonnullOwnPtr<AddressSpace>> AddressSpace::try_create(AddressSpace const* parent)
  18. {
  19. auto page_directory = TRY(PageDirectory::try_create_for_userspace(parent ? &parent->page_directory().range_allocator() : nullptr));
  20. auto space = TRY(adopt_nonnull_own_or_enomem(new (nothrow) AddressSpace(page_directory)));
  21. space->page_directory().set_space({}, *space);
  22. return space;
  23. }
  24. AddressSpace::AddressSpace(NonnullRefPtr<PageDirectory> page_directory)
  25. : m_page_directory(move(page_directory))
  26. {
  27. }
  28. AddressSpace::~AddressSpace() = default;
  29. ErrorOr<void> AddressSpace::unmap_mmap_range(VirtualAddress addr, size_t size)
  30. {
  31. if (!size)
  32. return EINVAL;
  33. auto range_to_unmap = TRY(VirtualRange::expand_to_page_boundaries(addr.get(), size));
  34. if (!is_user_range(range_to_unmap))
  35. return EFAULT;
  36. if (auto* whole_region = find_region_from_range(range_to_unmap)) {
  37. if (!whole_region->is_mmap())
  38. return EPERM;
  39. PerformanceManager::add_unmap_perf_event(Process::current(), whole_region->range());
  40. deallocate_region(*whole_region);
  41. return {};
  42. }
  43. if (auto* old_region = find_region_containing(range_to_unmap)) {
  44. if (!old_region->is_mmap())
  45. return EPERM;
  46. // Remove the old region from our regions tree, since were going to add another region
  47. // with the exact same start address, but don't deallocate it yet.
  48. auto region = take_region(*old_region);
  49. // We manually unmap the old region here, specifying that we *don't* want the VM deallocated.
  50. region->unmap(Region::ShouldDeallocateVirtualRange::No);
  51. auto new_regions = TRY(try_split_region_around_range(*region, range_to_unmap));
  52. // Instead we give back the unwanted VM manually.
  53. page_directory().range_allocator().deallocate(range_to_unmap);
  54. // And finally we map the new region(s) using our page directory (they were just allocated and don't have one).
  55. for (auto* new_region : new_regions) {
  56. // TODO: Ideally we should do this in a way that can be rolled back on failure, as failing here
  57. // leaves the caller in an undefined state.
  58. TRY(new_region->map(page_directory()));
  59. }
  60. PerformanceManager::add_unmap_perf_event(Process::current(), range_to_unmap);
  61. return {};
  62. }
  63. // Try again while checking multiple regions at a time.
  64. auto const& regions = TRY(find_regions_intersecting(range_to_unmap));
  65. if (regions.is_empty())
  66. return {};
  67. // Check if any of the regions is not mmap'ed, to not accidentally
  68. // error out with just half a region map left.
  69. for (auto* region : regions) {
  70. if (!region->is_mmap())
  71. return EPERM;
  72. }
  73. Vector<Region*, 2> new_regions;
  74. for (auto* old_region : regions) {
  75. // If it's a full match we can remove the entire old region.
  76. if (old_region->range().intersect(range_to_unmap).size() == old_region->size()) {
  77. deallocate_region(*old_region);
  78. continue;
  79. }
  80. // Remove the old region from our regions tree, since were going to add another region
  81. // with the exact same start address, but don't deallocate it yet.
  82. auto region = take_region(*old_region);
  83. // We manually unmap the old region here, specifying that we *don't* want the VM deallocated.
  84. region->unmap(Region::ShouldDeallocateVirtualRange::No);
  85. // Otherwise, split the regions and collect them for future mapping.
  86. auto split_regions = TRY(try_split_region_around_range(*region, range_to_unmap));
  87. TRY(new_regions.try_extend(split_regions));
  88. }
  89. // Give back any unwanted VM to the range allocator.
  90. page_directory().range_allocator().deallocate(range_to_unmap);
  91. // And finally map the new region(s) into our page directory.
  92. for (auto* new_region : new_regions) {
  93. // TODO: Ideally we should do this in a way that can be rolled back on failure, as failing here
  94. // leaves the caller in an undefined state.
  95. TRY(new_region->map(page_directory()));
  96. }
  97. PerformanceManager::add_unmap_perf_event(Process::current(), range_to_unmap);
  98. return {};
  99. }
  100. ErrorOr<VirtualRange> AddressSpace::try_allocate_range(VirtualAddress vaddr, size_t size, size_t alignment)
  101. {
  102. vaddr.mask(PAGE_MASK);
  103. size = TRY(page_round_up(size));
  104. if (vaddr.is_null())
  105. return page_directory().range_allocator().try_allocate_anywhere(size, alignment);
  106. return page_directory().range_allocator().try_allocate_specific(vaddr, size);
  107. }
  108. ErrorOr<Region*> AddressSpace::try_allocate_split_region(Region const& source_region, VirtualRange const& range, size_t offset_in_vmobject)
  109. {
  110. OwnPtr<KString> region_name;
  111. if (!source_region.name().is_null())
  112. region_name = TRY(KString::try_create(source_region.name()));
  113. auto new_region = TRY(Region::try_create_user_accessible(
  114. range, source_region.vmobject(), offset_in_vmobject, move(region_name), source_region.access(), source_region.is_cacheable() ? Region::Cacheable::Yes : Region::Cacheable::No, source_region.is_shared()));
  115. new_region->set_syscall_region(source_region.is_syscall_region());
  116. new_region->set_mmap(source_region.is_mmap());
  117. new_region->set_stack(source_region.is_stack());
  118. size_t page_offset_in_source_region = (offset_in_vmobject - source_region.offset_in_vmobject()) / PAGE_SIZE;
  119. for (size_t i = 0; i < new_region->page_count(); ++i) {
  120. if (source_region.should_cow(page_offset_in_source_region + i))
  121. TRY(new_region->set_should_cow(i, true));
  122. }
  123. return add_region(move(new_region));
  124. }
  125. ErrorOr<Region*> AddressSpace::allocate_region(VirtualRange const& range, StringView name, int prot, AllocationStrategy strategy)
  126. {
  127. VERIFY(range.is_valid());
  128. OwnPtr<KString> region_name;
  129. if (!name.is_null())
  130. region_name = TRY(KString::try_create(name));
  131. auto vmobject = TRY(AnonymousVMObject::try_create_with_size(range.size(), strategy));
  132. auto region = TRY(Region::try_create_user_accessible(range, move(vmobject), 0, move(region_name), prot_to_region_access_flags(prot), Region::Cacheable::Yes, false));
  133. TRY(region->map(page_directory(), ShouldFlushTLB::No));
  134. return add_region(move(region));
  135. }
  136. ErrorOr<Region*> AddressSpace::allocate_region_with_vmobject(VirtualRange const& range, NonnullRefPtr<VMObject> vmobject, size_t offset_in_vmobject, StringView name, int prot, bool shared)
  137. {
  138. VERIFY(range.is_valid());
  139. size_t end_in_vmobject = offset_in_vmobject + range.size();
  140. if (end_in_vmobject <= offset_in_vmobject) {
  141. dbgln("allocate_region_with_vmobject: Overflow (offset + size)");
  142. return EINVAL;
  143. }
  144. if (offset_in_vmobject >= vmobject->size()) {
  145. dbgln("allocate_region_with_vmobject: Attempt to allocate a region with an offset past the end of its VMObject.");
  146. return EINVAL;
  147. }
  148. if (end_in_vmobject > vmobject->size()) {
  149. dbgln("allocate_region_with_vmobject: Attempt to allocate a region with an end past the end of its VMObject.");
  150. return EINVAL;
  151. }
  152. offset_in_vmobject &= PAGE_MASK;
  153. OwnPtr<KString> region_name;
  154. if (!name.is_null())
  155. region_name = TRY(KString::try_create(name));
  156. auto region = TRY(Region::try_create_user_accessible(range, move(vmobject), offset_in_vmobject, move(region_name), prot_to_region_access_flags(prot), Region::Cacheable::Yes, shared));
  157. if (prot == PROT_NONE) {
  158. // For PROT_NONE mappings, we don't have to set up any page table mappings.
  159. // We do still need to attach the region to the page_directory though.
  160. SpinlockLocker mm_locker(s_mm_lock);
  161. region->set_page_directory(page_directory());
  162. } else {
  163. TRY(region->map(page_directory(), ShouldFlushTLB::No));
  164. }
  165. return add_region(move(region));
  166. }
  167. void AddressSpace::deallocate_region(Region& region)
  168. {
  169. (void)take_region(region);
  170. }
  171. NonnullOwnPtr<Region> AddressSpace::take_region(Region& region)
  172. {
  173. SpinlockLocker lock(m_lock);
  174. auto found_region = m_regions.unsafe_remove(region.vaddr().get());
  175. VERIFY(found_region.ptr() == &region);
  176. return found_region;
  177. }
  178. Region* AddressSpace::find_region_from_range(VirtualRange const& range)
  179. {
  180. SpinlockLocker lock(m_lock);
  181. auto* found_region = m_regions.find(range.base().get());
  182. if (!found_region)
  183. return nullptr;
  184. auto& region = *found_region;
  185. auto rounded_range_size = page_round_up(range.size());
  186. if (rounded_range_size.is_error() || region->size() != rounded_range_size.value())
  187. return nullptr;
  188. return region;
  189. }
  190. Region* AddressSpace::find_region_containing(VirtualRange const& range)
  191. {
  192. SpinlockLocker lock(m_lock);
  193. auto* candidate = m_regions.find_largest_not_above(range.base().get());
  194. if (!candidate)
  195. return nullptr;
  196. return (*candidate)->range().contains(range) ? candidate->ptr() : nullptr;
  197. }
  198. ErrorOr<Vector<Region*>> AddressSpace::find_regions_intersecting(VirtualRange const& range)
  199. {
  200. Vector<Region*> regions = {};
  201. size_t total_size_collected = 0;
  202. SpinlockLocker lock(m_lock);
  203. auto* found_region = m_regions.find_largest_not_above(range.base().get());
  204. if (!found_region)
  205. return regions;
  206. for (auto iter = m_regions.begin_from((*found_region)->vaddr().get()); !iter.is_end(); ++iter) {
  207. auto const& iter_range = (*iter)->range();
  208. if (iter_range.base() < range.end() && iter_range.end() > range.base()) {
  209. TRY(regions.try_append(*iter));
  210. total_size_collected += (*iter)->size() - iter_range.intersect(range).size();
  211. if (total_size_collected == range.size())
  212. break;
  213. }
  214. }
  215. return regions;
  216. }
  217. ErrorOr<Region*> AddressSpace::add_region(NonnullOwnPtr<Region> region)
  218. {
  219. auto* ptr = region.ptr();
  220. SpinlockLocker lock(m_lock);
  221. TRY(m_regions.try_insert(region->vaddr().get(), move(region)));
  222. return ptr;
  223. }
  224. // Carve out a virtual address range from a region and return the two regions on either side
  225. ErrorOr<Vector<Region*, 2>> AddressSpace::try_split_region_around_range(Region const& source_region, VirtualRange const& desired_range)
  226. {
  227. VirtualRange old_region_range = source_region.range();
  228. auto remaining_ranges_after_unmap = old_region_range.carve(desired_range);
  229. VERIFY(!remaining_ranges_after_unmap.is_empty());
  230. auto try_make_replacement_region = [&](VirtualRange const& new_range) -> ErrorOr<Region*> {
  231. VERIFY(old_region_range.contains(new_range));
  232. size_t new_range_offset_in_vmobject = source_region.offset_in_vmobject() + (new_range.base().get() - old_region_range.base().get());
  233. return try_allocate_split_region(source_region, new_range, new_range_offset_in_vmobject);
  234. };
  235. Vector<Region*, 2> new_regions;
  236. for (auto& new_range : remaining_ranges_after_unmap) {
  237. auto* new_region = TRY(try_make_replacement_region(new_range));
  238. new_regions.unchecked_append(new_region);
  239. }
  240. return new_regions;
  241. }
  242. void AddressSpace::dump_regions()
  243. {
  244. dbgln("Process regions:");
  245. #if ARCH(I386)
  246. char const* addr_padding = "";
  247. #else
  248. char const* addr_padding = " ";
  249. #endif
  250. dbgln("BEGIN{} END{} SIZE{} ACCESS NAME",
  251. addr_padding, addr_padding, addr_padding);
  252. SpinlockLocker lock(m_lock);
  253. for (auto const& sorted_region : m_regions) {
  254. auto const& region = *sorted_region;
  255. dbgln("{:p} -- {:p} {:p} {:c}{:c}{:c}{:c}{:c}{:c} {}", region.vaddr().get(), region.vaddr().offset(region.size() - 1).get(), region.size(),
  256. region.is_readable() ? 'R' : ' ',
  257. region.is_writable() ? 'W' : ' ',
  258. region.is_executable() ? 'X' : ' ',
  259. region.is_shared() ? 'S' : ' ',
  260. region.is_stack() ? 'T' : ' ',
  261. region.is_syscall_region() ? 'C' : ' ',
  262. region.name());
  263. }
  264. MM.dump_kernel_regions();
  265. }
  266. void AddressSpace::remove_all_regions(Badge<Process>)
  267. {
  268. VERIFY(Thread::current() == g_finalizer);
  269. SpinlockLocker locker(m_lock);
  270. {
  271. SpinlockLocker pd_locker(m_page_directory->get_lock());
  272. SpinlockLocker mm_locker(s_mm_lock);
  273. for (auto& region : m_regions)
  274. (*region).unmap_with_locks_held(Region::ShouldDeallocateVirtualRange::No, ShouldFlushTLB::No, pd_locker, mm_locker);
  275. }
  276. m_regions.clear();
  277. }
  278. size_t AddressSpace::amount_dirty_private() const
  279. {
  280. SpinlockLocker lock(m_lock);
  281. // FIXME: This gets a bit more complicated for Regions sharing the same underlying VMObject.
  282. // The main issue I'm thinking of is when the VMObject has physical pages that none of the Regions are mapping.
  283. // That's probably a situation that needs to be looked at in general.
  284. size_t amount = 0;
  285. for (auto const& region : m_regions) {
  286. if (!region->is_shared())
  287. amount += region->amount_dirty();
  288. }
  289. return amount;
  290. }
  291. ErrorOr<size_t> AddressSpace::amount_clean_inode() const
  292. {
  293. SpinlockLocker lock(m_lock);
  294. HashTable<InodeVMObject const*> vmobjects;
  295. for (auto const& region : m_regions) {
  296. if (region->vmobject().is_inode())
  297. TRY(vmobjects.try_set(&static_cast<InodeVMObject const&>(region->vmobject())));
  298. }
  299. size_t amount = 0;
  300. for (auto& vmobject : vmobjects)
  301. amount += vmobject->amount_clean();
  302. return amount;
  303. }
  304. size_t AddressSpace::amount_virtual() const
  305. {
  306. SpinlockLocker lock(m_lock);
  307. size_t amount = 0;
  308. for (auto const& region : m_regions) {
  309. amount += region->size();
  310. }
  311. return amount;
  312. }
  313. size_t AddressSpace::amount_resident() const
  314. {
  315. SpinlockLocker lock(m_lock);
  316. // FIXME: This will double count if multiple regions use the same physical page.
  317. size_t amount = 0;
  318. for (auto const& region : m_regions) {
  319. amount += region->amount_resident();
  320. }
  321. return amount;
  322. }
  323. size_t AddressSpace::amount_shared() const
  324. {
  325. SpinlockLocker lock(m_lock);
  326. // FIXME: This will double count if multiple regions use the same physical page.
  327. // FIXME: It doesn't work at the moment, since it relies on PhysicalPage ref counts,
  328. // and each PhysicalPage is only reffed by its VMObject. This needs to be refactored
  329. // so that every Region contributes +1 ref to each of its PhysicalPages.
  330. size_t amount = 0;
  331. for (auto const& region : m_regions) {
  332. amount += region->amount_shared();
  333. }
  334. return amount;
  335. }
  336. size_t AddressSpace::amount_purgeable_volatile() const
  337. {
  338. SpinlockLocker lock(m_lock);
  339. size_t amount = 0;
  340. for (auto const& region : m_regions) {
  341. if (!region->vmobject().is_anonymous())
  342. continue;
  343. auto const& vmobject = static_cast<AnonymousVMObject const&>(region->vmobject());
  344. if (vmobject.is_purgeable() && vmobject.is_volatile())
  345. amount += region->amount_resident();
  346. }
  347. return amount;
  348. }
  349. size_t AddressSpace::amount_purgeable_nonvolatile() const
  350. {
  351. SpinlockLocker lock(m_lock);
  352. size_t amount = 0;
  353. for (auto const& region : m_regions) {
  354. if (!region->vmobject().is_anonymous())
  355. continue;
  356. auto const& vmobject = static_cast<AnonymousVMObject const&>(region->vmobject());
  357. if (vmobject.is_purgeable() && !vmobject.is_volatile())
  358. amount += region->amount_resident();
  359. }
  360. return amount;
  361. }
  362. }