AddressSpace.cpp 16 KB

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