AddressSpace.cpp 15 KB

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