AddressSpace.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431
  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 maybe_new_region = 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. if (maybe_new_region.is_error())
  116. return maybe_new_region.error();
  117. auto* region = add_region(maybe_new_region.release_value());
  118. if (!region)
  119. return ENOMEM;
  120. region->set_syscall_region(source_region.is_syscall_region());
  121. region->set_mmap(source_region.is_mmap());
  122. region->set_stack(source_region.is_stack());
  123. size_t page_offset_in_source_region = (offset_in_vmobject - source_region.offset_in_vmobject()) / PAGE_SIZE;
  124. for (size_t i = 0; i < region->page_count(); ++i) {
  125. if (source_region.should_cow(page_offset_in_source_region + i))
  126. region->set_should_cow(i, true);
  127. }
  128. return region;
  129. }
  130. KResultOr<Region*> AddressSpace::allocate_region(VirtualRange const& range, StringView name, int prot, AllocationStrategy strategy)
  131. {
  132. VERIFY(range.is_valid());
  133. auto maybe_vmobject = AnonymousVMObject::try_create_with_size(range.size(), strategy);
  134. if (maybe_vmobject.is_error())
  135. return maybe_vmobject.error();
  136. auto maybe_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);
  137. if (maybe_region.is_error())
  138. return maybe_region.error();
  139. auto region = maybe_region.release_value();
  140. if (!region->map(page_directory()))
  141. return ENOMEM;
  142. auto* added_region = add_region(move(region));
  143. if (!added_region)
  144. return ENOMEM;
  145. return added_region;
  146. }
  147. KResultOr<Region*> AddressSpace::allocate_region_with_vmobject(VirtualRange const& range, NonnullRefPtr<VMObject> vmobject, size_t offset_in_vmobject, StringView name, int prot, bool shared)
  148. {
  149. VERIFY(range.is_valid());
  150. size_t end_in_vmobject = offset_in_vmobject + range.size();
  151. if (end_in_vmobject <= offset_in_vmobject) {
  152. dbgln("allocate_region_with_vmobject: Overflow (offset + size)");
  153. return EINVAL;
  154. }
  155. if (offset_in_vmobject >= vmobject->size()) {
  156. dbgln("allocate_region_with_vmobject: Attempt to allocate a region with an offset past the end of its VMObject.");
  157. return EINVAL;
  158. }
  159. if (end_in_vmobject > vmobject->size()) {
  160. dbgln("allocate_region_with_vmobject: Attempt to allocate a region with an end past the end of its VMObject.");
  161. return EINVAL;
  162. }
  163. offset_in_vmobject &= PAGE_MASK;
  164. auto maybe_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);
  165. if (maybe_region.is_error()) {
  166. dbgln("allocate_region_with_vmobject: Unable to allocate Region");
  167. return maybe_region.error();
  168. }
  169. auto* added_region = add_region(maybe_region.release_value());
  170. if (!added_region)
  171. return ENOMEM;
  172. if (!added_region->map(page_directory()))
  173. return ENOMEM;
  174. return added_region;
  175. }
  176. void AddressSpace::deallocate_region(Region& region)
  177. {
  178. take_region(region);
  179. }
  180. NonnullOwnPtr<Region> AddressSpace::take_region(Region& region)
  181. {
  182. SpinlockLocker lock(m_lock);
  183. if (m_region_lookup_cache.region.unsafe_ptr() == &region)
  184. m_region_lookup_cache.region = nullptr;
  185. auto found_region = m_regions.unsafe_remove(region.vaddr().get());
  186. VERIFY(found_region.ptr() == &region);
  187. return found_region;
  188. }
  189. Region* AddressSpace::find_region_from_range(VirtualRange const& range)
  190. {
  191. SpinlockLocker lock(m_lock);
  192. if (m_region_lookup_cache.range.has_value() && m_region_lookup_cache.range.value() == range && m_region_lookup_cache.region)
  193. return m_region_lookup_cache.region.unsafe_ptr();
  194. auto found_region = m_regions.find(range.base().get());
  195. if (!found_region)
  196. return nullptr;
  197. auto& region = *found_region;
  198. size_t size = page_round_up(range.size());
  199. if (region->size() != size)
  200. return nullptr;
  201. m_region_lookup_cache.range = range;
  202. m_region_lookup_cache.region = *region;
  203. return region;
  204. }
  205. Region* AddressSpace::find_region_containing(VirtualRange const& range)
  206. {
  207. SpinlockLocker lock(m_lock);
  208. auto candidate = m_regions.find_largest_not_above(range.base().get());
  209. if (!candidate)
  210. return nullptr;
  211. return (*candidate)->range().contains(range) ? candidate->ptr() : nullptr;
  212. }
  213. Vector<Region*> AddressSpace::find_regions_intersecting(VirtualRange const& range)
  214. {
  215. Vector<Region*> regions = {};
  216. size_t total_size_collected = 0;
  217. SpinlockLocker lock(m_lock);
  218. auto found_region = m_regions.find_largest_not_above(range.base().get());
  219. if (!found_region)
  220. return regions;
  221. for (auto iter = m_regions.begin_from((*found_region)->vaddr().get()); !iter.is_end(); ++iter) {
  222. if ((*iter)->range().base() < range.end() && (*iter)->range().end() > range.base()) {
  223. regions.append(*iter);
  224. total_size_collected += (*iter)->size() - (*iter)->range().intersect(range).size();
  225. if (total_size_collected == range.size())
  226. break;
  227. }
  228. }
  229. return regions;
  230. }
  231. Region* AddressSpace::add_region(NonnullOwnPtr<Region> region)
  232. {
  233. auto* ptr = region.ptr();
  234. SpinlockLocker lock(m_lock);
  235. auto success = m_regions.try_insert(region->vaddr().get(), move(region));
  236. return success ? ptr : nullptr;
  237. }
  238. // Carve out a virtual address range from a region and return the two regions on either side
  239. KResultOr<Vector<Region*, 2>> AddressSpace::try_split_region_around_range(const Region& source_region, VirtualRange const& desired_range)
  240. {
  241. VirtualRange old_region_range = source_region.range();
  242. auto remaining_ranges_after_unmap = old_region_range.carve(desired_range);
  243. VERIFY(!remaining_ranges_after_unmap.is_empty());
  244. auto try_make_replacement_region = [&](VirtualRange const& new_range) -> KResultOr<Region*> {
  245. VERIFY(old_region_range.contains(new_range));
  246. size_t new_range_offset_in_vmobject = source_region.offset_in_vmobject() + (new_range.base().get() - old_region_range.base().get());
  247. return try_allocate_split_region(source_region, new_range, new_range_offset_in_vmobject);
  248. };
  249. Vector<Region*, 2> new_regions;
  250. for (auto& new_range : remaining_ranges_after_unmap) {
  251. auto new_region = TRY(try_make_replacement_region(new_range));
  252. new_regions.unchecked_append(new_region);
  253. }
  254. return new_regions;
  255. }
  256. void AddressSpace::dump_regions()
  257. {
  258. dbgln("Process regions:");
  259. #if ARCH(I386)
  260. auto addr_padding = "";
  261. #else
  262. auto addr_padding = " ";
  263. #endif
  264. dbgln("BEGIN{} END{} SIZE{} ACCESS NAME",
  265. addr_padding, addr_padding, addr_padding);
  266. SpinlockLocker lock(m_lock);
  267. for (auto& sorted_region : m_regions) {
  268. auto& region = *sorted_region;
  269. dbgln("{:p} -- {:p} {:p} {:c}{:c}{:c}{:c}{:c}{:c} {}", region.vaddr().get(), region.vaddr().offset(region.size() - 1).get(), region.size(),
  270. region.is_readable() ? 'R' : ' ',
  271. region.is_writable() ? 'W' : ' ',
  272. region.is_executable() ? 'X' : ' ',
  273. region.is_shared() ? 'S' : ' ',
  274. region.is_stack() ? 'T' : ' ',
  275. region.is_syscall_region() ? 'C' : ' ',
  276. region.name());
  277. }
  278. MM.dump_kernel_regions();
  279. }
  280. void AddressSpace::remove_all_regions(Badge<Process>)
  281. {
  282. SpinlockLocker lock(m_lock);
  283. m_regions.clear();
  284. }
  285. size_t AddressSpace::amount_dirty_private() const
  286. {
  287. SpinlockLocker lock(m_lock);
  288. // FIXME: This gets a bit more complicated for Regions sharing the same underlying VMObject.
  289. // The main issue I'm thinking of is when the VMObject has physical pages that none of the Regions are mapping.
  290. // That's probably a situation that needs to be looked at in general.
  291. size_t amount = 0;
  292. for (auto& region : m_regions) {
  293. if (!region->is_shared())
  294. amount += region->amount_dirty();
  295. }
  296. return amount;
  297. }
  298. size_t AddressSpace::amount_clean_inode() const
  299. {
  300. SpinlockLocker lock(m_lock);
  301. HashTable<const InodeVMObject*> vmobjects;
  302. for (auto& region : m_regions) {
  303. if (region->vmobject().is_inode())
  304. vmobjects.set(&static_cast<const InodeVMObject&>(region->vmobject()));
  305. }
  306. size_t amount = 0;
  307. for (auto& vmobject : vmobjects)
  308. amount += vmobject->amount_clean();
  309. return amount;
  310. }
  311. size_t AddressSpace::amount_virtual() const
  312. {
  313. SpinlockLocker lock(m_lock);
  314. size_t amount = 0;
  315. for (auto& region : m_regions) {
  316. amount += region->size();
  317. }
  318. return amount;
  319. }
  320. size_t AddressSpace::amount_resident() const
  321. {
  322. SpinlockLocker lock(m_lock);
  323. // FIXME: This will double count if multiple regions use the same physical page.
  324. size_t amount = 0;
  325. for (auto& region : m_regions) {
  326. amount += region->amount_resident();
  327. }
  328. return amount;
  329. }
  330. size_t AddressSpace::amount_shared() const
  331. {
  332. SpinlockLocker lock(m_lock);
  333. // FIXME: This will double count if multiple regions use the same physical page.
  334. // FIXME: It doesn't work at the moment, since it relies on PhysicalPage ref counts,
  335. // and each PhysicalPage is only reffed by its VMObject. This needs to be refactored
  336. // so that every Region contributes +1 ref to each of its PhysicalPages.
  337. size_t amount = 0;
  338. for (auto& region : m_regions) {
  339. amount += region->amount_shared();
  340. }
  341. return amount;
  342. }
  343. size_t AddressSpace::amount_purgeable_volatile() const
  344. {
  345. SpinlockLocker lock(m_lock);
  346. size_t amount = 0;
  347. for (auto& region : m_regions) {
  348. if (!region->vmobject().is_anonymous())
  349. continue;
  350. auto const& vmobject = static_cast<AnonymousVMObject const&>(region->vmobject());
  351. if (vmobject.is_purgeable() && vmobject.is_volatile())
  352. amount += region->amount_resident();
  353. }
  354. return amount;
  355. }
  356. size_t AddressSpace::amount_purgeable_nonvolatile() const
  357. {
  358. SpinlockLocker lock(m_lock);
  359. size_t amount = 0;
  360. for (auto& region : m_regions) {
  361. if (!region->vmobject().is_anonymous())
  362. continue;
  363. auto const& vmobject = static_cast<AnonymousVMObject const&>(region->vmobject());
  364. if (vmobject.is_purgeable() && !vmobject.is_volatile())
  365. amount += region->amount_resident();
  366. }
  367. return amount;
  368. }
  369. }