AddressSpace.cpp 16 KB

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