WebSVN – HelenOS – Blame – /branches/dynload/kernel/generic/src/mm/as.c

Rev	Author	Line No.	Line
703	jermar	1	/*
2071	jermar	2	* Copyright (c) 2001-2006 Jakub Jermar
703	jermar	3	* All rights reserved.
		4	*
		5	* Redistribution and use in source and binary forms, with or without
		6	* modification, are permitted provided that the following conditions
		7	* are met:
		8	*
		9	* - Redistributions of source code must retain the above copyright
		10	* notice, this list of conditions and the following disclaimer.
		11	* - Redistributions in binary form must reproduce the above copyright
		12	* notice, this list of conditions and the following disclaimer in the
		13	* documentation and/or other materials provided with the distribution.
		14	* - The name of the author may not be used to endorse or promote products
		15	* derived from this software without specific prior written permission.
		16	*
		17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
		18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
		19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
		20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
		21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
		22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
		23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
		24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
		25	* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
		26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
		27	*/
		28
1757	jermar	29	/** @addtogroup genericmm
1702	cejka	30	* @{
		31	*/
		32
1248	jermar	33	/**
1702	cejka	34	* @file
1248	jermar	35	* @brief Address space related functions.
		36	*
703	jermar	37	* This file contains address space manipulation functions.
		38	* Roughly speaking, this is a higher-level client of
		39	* Virtual Address Translation (VAT) subsystem.
1248	jermar	40	*
		41	* Functionality provided by this file allows one to
1757	jermar	42	* create address spaces and create, resize and share
1248	jermar	43	* address space areas.
		44	*
		45	* @see page.c
		46	*
703	jermar	47	*/
		48
		49	#include <mm/as.h>
756	jermar	50	#include <arch/mm/as.h>
703	jermar	51	#include <mm/page.h>
		52	#include <mm/frame.h>
814	palkovsky	53	#include <mm/slab.h>
703	jermar	54	#include <mm/tlb.h>
		55	#include <arch/mm/page.h>
		56	#include <genarch/mm/page_pt.h>
1108	jermar	57	#include <genarch/mm/page_ht.h>
727	jermar	58	#include <mm/asid.h>
703	jermar	59	#include <arch/mm/asid.h>
2183	jermar	60	#include <preemption.h>
703	jermar	61	#include <synch/spinlock.h>
1380	jermar	62	#include <synch/mutex.h>
788	jermar	63	#include <adt/list.h>
1147	jermar	64	#include <adt/btree.h>
1235	jermar	65	#include <proc/task.h>
1288	jermar	66	#include <proc/thread.h>
1235	jermar	67	#include <arch/asm.h>
703	jermar	68	#include <panic.h>
		69	#include <debug.h>
1235	jermar	70	#include <print.h>
703	jermar	71	#include <memstr.h>
1070	jermar	72	#include <macros.h>
703	jermar	73	#include <arch.h>
1235	jermar	74	#include <errno.h>
		75	#include <config.h>
1387	jermar	76	#include <align.h>
1235	jermar	77	#include <arch/types.h>
1288	jermar	78	#include <syscall/copy.h>
		79	#include <arch/interrupt.h>
703	jermar	80
2009	jermar	81	#ifdef CONFIG_VIRT_IDX_DCACHE
		82	#include <arch/mm/cache.h>
		83	#endif /* CONFIG_VIRT_IDX_DCACHE */
		84
2125	decky	85	#ifndef __OBJC__
1757	jermar	86	/**
		87	* Each architecture decides what functions will be used to carry out
		88	* address space operations such as creating or locking page tables.
		89	*/
756	jermar	90	as_operations_t *as_operations = NULL;
703	jermar	91
1890	jermar	92	/**
		93	* Slab for as_t objects.
		94	*/
		95	static slab_cache_t *as_slab;
2126	decky	96	#endif
1890	jermar	97
2087	jermar	98	/**
2170	jermar	99	* This lock serializes access to the ASID subsystem.
		100	* It protects:
		101	* - inactive_as_with_asid_head list
		102	* - as->asid for each as of the as_t type
		103	* - asids_allocated counter
2087	jermar	104	*/
2170	jermar	105	SPINLOCK_INITIALIZE(asidlock);
823	jermar	106
		107	/**
		108	* This list contains address spaces that are not active on any
		109	* processor and that have valid ASID.
		110	*/
		111	LIST_INITIALIZE(inactive_as_with_asid_head);
		112
757	jermar	113	/** Kernel address space. */
		114	as_t *AS_KERNEL = NULL;
		115
1235	jermar	116	static int area_flags_to_page_flags(int aflags);
1780	jermar	117	static as_area_t find_area_and_lock(as_t as, uintptr_t va);
2087	jermar	118	static bool check_area_conflicts(as_t *as, uintptr_t va, size_t size,
		119	as_area_t *avoid_area);
1409	jermar	120	static void sh_info_remove_reference(share_info_t *sh_info);
703	jermar	121
2126	decky	122	#ifndef __OBJC__
1891	jermar	123	static int as_constructor(void *obj, int flags)
		124	{
		125	as_t as = (as_t ) obj;
		126	int rc;
		127
		128	link_initialize(&as->inactive_as_with_asid_link);
		129	mutex_initialize(&as->lock);
		130
		131	rc = as_constructor_arch(as, flags);
		132
		133	return rc;
		134	}
		135
		136	static int as_destructor(void *obj)
		137	{
		138	as_t as = (as_t ) obj;
		139
		140	return as_destructor_arch(as);
		141	}
2126	decky	142	#endif
1891	jermar	143
756	jermar	144	/** Initialize address space subsystem. */
		145	void as_init(void)
		146	{
		147	as_arch_init();
2126	decky	148
		149	#ifndef __OBJC__
1891	jermar	150	as_slab = slab_cache_create("as_slab", sizeof(as_t), 0,
2087	jermar	151	as_constructor, as_destructor, SLAB_CACHE_MAGDEFERRED);
2126	decky	152	#endif
1890	jermar	153
789	palkovsky	154	AS_KERNEL = as_create(FLAG_AS_KERNEL);
1383	decky	155	if (!AS_KERNEL)
		156	panic("can't create kernel address space\n");
		157
756	jermar	158	}
		159
757	jermar	160	/** Create address space.
		161	*
		162	* @param flags Flags that influence way in wich the address space is created.
		163	*/
756	jermar	164	as_t *as_create(int flags)
703	jermar	165	{
		166	as_t *as;
		167
2126	decky	168	#ifdef __OBJC__
		169	as = [as_t new];
		170	link_initialize(&as->inactive_as_with_asid_link);
		171	mutex_initialize(&as->lock);
		172	(void) as_constructor_arch(as, flags);
		173	#else
1890	jermar	174	as = (as_t *) slab_alloc(as_slab, 0);
2126	decky	175	#endif
1891	jermar	176	(void) as_create_arch(as, 0);
		177
1147	jermar	178	btree_create(&as->as_area_btree);
822	palkovsky	179
		180	if (flags & FLAG_AS_KERNEL)
		181	as->asid = ASID_KERNEL;
		182	else
		183	as->asid = ASID_INVALID;
		184
2183	jermar	185	atomic_set(&as->refcount, 0);
1415	jermar	186	as->cpu_refcount = 0;
2089	decky	187	#ifdef AS_PAGE_TABLE
2106	jermar	188	as->genarch.page_table = page_table_create(flags);
2089	decky	189	#else
		190	page_table_create(flags);
		191	#endif
703	jermar	192
		193	return as;
		194	}
		195
1468	jermar	196	/** Destroy adress space.
		197	*
2087	jermar	198	* When there are no tasks referencing this address space (i.e. its refcount is
		199	* zero), the address space can be destroyed.
2183	jermar	200	*
		201	* We know that we don't hold any spinlock.
1468	jermar	202	*/
		203	void as_destroy(as_t *as)
973	palkovsky	204	{
1468	jermar	205	ipl_t ipl;
1594	jermar	206	bool cond;
2183	jermar	207	DEADLOCK_PROBE_INIT(p_asidlock);
973	palkovsky	208
2183	jermar	209	ASSERT(atomic_get(&as->refcount) == 0);
1468	jermar	210
		211	/*
		212	* Since there is no reference to this area,
		213	* it is safe not to lock its mutex.
		214	*/
2170	jermar	215
2183	jermar	216	/*
		217	* We need to avoid deadlock between TLB shootdown and asidlock.
		218	* We therefore try to take asid conditionally and if we don't succeed,
		219	* we enable interrupts and try again. This is done while preemption is
		220	* disabled to prevent nested context switches. We also depend on the
		221	* fact that so far no spinlocks are held.
		222	*/
		223	preemption_disable();
		224	ipl = interrupts_read();
		225	retry:
		226	interrupts_disable();
		227	if (!spinlock_trylock(&asidlock)) {
		228	interrupts_enable();
		229	DEADLOCK_PROBE(p_asidlock, DEADLOCK_THRESHOLD);
		230	goto retry;
		231	}
		232	preemption_enable(); /* Interrupts disabled, enable preemption */
1587	jermar	233	if (as->asid != ASID_INVALID && as != AS_KERNEL) {
1594	jermar	234	if (as != AS && as->cpu_refcount == 0)
1587	jermar	235	list_remove(&as->inactive_as_with_asid_link);
1468	jermar	236	asid_put(as->asid);
		237	}
2170	jermar	238	spinlock_unlock(&asidlock);
1468	jermar	239
		240	/*
		241	* Destroy address space areas of the address space.
1954	jermar	242	* The B+tree must be walked carefully because it is
1594	jermar	243	* also being destroyed.
1468	jermar	244	*/
1594	jermar	245	for (cond = true; cond; ) {
1468	jermar	246	btree_node_t *node;
1594	jermar	247
		248	ASSERT(!list_empty(&as->as_area_btree.leaf_head));
2087	jermar	249	node = list_get_instance(as->as_area_btree.leaf_head.next,
		250	btree_node_t, leaf_link);
1594	jermar	251
		252	if ((cond = node->keys)) {
		253	as_area_destroy(as, node->key[0]);
		254	}
1468	jermar	255	}
1495	jermar	256
1483	jermar	257	btree_destroy(&as->as_area_btree);
2089	decky	258	#ifdef AS_PAGE_TABLE
2106	jermar	259	page_table_destroy(as->genarch.page_table);
2089	decky	260	#else
		261	page_table_destroy(NULL);
		262	#endif
1468	jermar	263
		264	interrupts_restore(ipl);
2126	decky	265
		266	#ifdef __OBJC__
		267	[as free];
		268	#else
1890	jermar	269	slab_free(as_slab, as);
2126	decky	270	#endif
973	palkovsky	271	}
		272
703	jermar	273	/** Create address space area of common attributes.
		274	*
		275	* The created address space area is added to the target address space.
		276	*
		277	* @param as Target address space.
1239	jermar	278	* @param flags Flags of the area memory.
1048	jermar	279	* @param size Size of area.
703	jermar	280	* @param base Base address of area.
1239	jermar	281	* @param attrs Attributes of the area.
1409	jermar	282	* @param backend Address space area backend. NULL if no backend is used.
		283	* @param backend_data NULL or a pointer to an array holding two void *.
703	jermar	284	*
		285	* @return Address space area on success or NULL on failure.
		286	*/
2069	jermar	287	as_area_t *
		288	as_area_create(as_t *as, int flags, size_t size, uintptr_t base, int attrs,
1424	jermar	289	mem_backend_t backend, mem_backend_data_t backend_data)
703	jermar	290	{
		291	ipl_t ipl;
		292	as_area_t *a;
		293
		294	if (base % PAGE_SIZE)
1048	jermar	295	return NULL;
		296
1233	jermar	297	if (!size)
		298	return NULL;
		299
1048	jermar	300	/* Writeable executable areas are not supported. */
		301	if ((flags & AS_AREA_EXEC) && (flags & AS_AREA_WRITE))
		302	return NULL;
703	jermar	303
		304	ipl = interrupts_disable();
1380	jermar	305	mutex_lock(&as->lock);
703	jermar	306
1048	jermar	307	if (!check_area_conflicts(as, base, size, NULL)) {
1380	jermar	308	mutex_unlock(&as->lock);
1048	jermar	309	interrupts_restore(ipl);
		310	return NULL;
		311	}
703	jermar	312
822	palkovsky	313	a = (as_area_t *) malloc(sizeof(as_area_t), 0);
703	jermar	314
1380	jermar	315	mutex_initialize(&a->lock);
822	palkovsky	316
1424	jermar	317	a->as = as;
1026	jermar	318	a->flags = flags;
1239	jermar	319	a->attributes = attrs;
1048	jermar	320	a->pages = SIZE2FRAMES(size);
822	palkovsky	321	a->base = base;
1409	jermar	322	a->sh_info = NULL;
		323	a->backend = backend;
1424	jermar	324	if (backend_data)
		325	a->backend_data = *backend_data;
		326	else
3153	svoboda	327	memsetb(&a->backend_data, sizeof(a->backend_data), 0);
1424	jermar	328
1387	jermar	329	btree_create(&a->used_space);
822	palkovsky	330
1147	jermar	331	btree_insert(&as->as_area_btree, base, (void *) a, NULL);
822	palkovsky	332
1380	jermar	333	mutex_unlock(&as->lock);
703	jermar	334	interrupts_restore(ipl);
704	jermar	335
703	jermar	336	return a;
		337	}
		338
1235	jermar	339	/** Find address space area and change it.
		340	*
		341	* @param as Address space.
2087	jermar	342	* @param address Virtual address belonging to the area to be changed. Must be
		343	* page-aligned.
1235	jermar	344	* @param size New size of the virtual memory block starting at address.
		345	* @param flags Flags influencing the remap operation. Currently unused.
		346	*
1306	jermar	347	* @return Zero on success or a value from @ref errno.h otherwise.
1235	jermar	348	*/
1780	jermar	349	int as_area_resize(as_t *as, uintptr_t address, size_t size, int flags)
1235	jermar	350	{
1306	jermar	351	as_area_t *area;
1235	jermar	352	ipl_t ipl;
		353	size_t pages;
		354
		355	ipl = interrupts_disable();
1380	jermar	356	mutex_lock(&as->lock);
1235	jermar	357
		358	/*
		359	* Locate the area.
		360	*/
		361	area = find_area_and_lock(as, address);
		362	if (!area) {
1380	jermar	363	mutex_unlock(&as->lock);
1235	jermar	364	interrupts_restore(ipl);
1306	jermar	365	return ENOENT;
1235	jermar	366	}
		367
1424	jermar	368	if (area->backend == &phys_backend) {
1235	jermar	369	/*
		370	* Remapping of address space areas associated
		371	* with memory mapped devices is not supported.
		372	*/
1380	jermar	373	mutex_unlock(&area->lock);
		374	mutex_unlock(&as->lock);
1235	jermar	375	interrupts_restore(ipl);
1306	jermar	376	return ENOTSUP;
1235	jermar	377	}
1409	jermar	378	if (area->sh_info) {
		379	/*
		380	* Remapping of shared address space areas
		381	* is not supported.
		382	*/
		383	mutex_unlock(&area->lock);
		384	mutex_unlock(&as->lock);
		385	interrupts_restore(ipl);
		386	return ENOTSUP;
		387	}
1235	jermar	388
		389	pages = SIZE2FRAMES((address - area->base) + size);
		390	if (!pages) {
		391	/*
		392	* Zero size address space areas are not allowed.
		393	*/
1380	jermar	394	mutex_unlock(&area->lock);
		395	mutex_unlock(&as->lock);
1235	jermar	396	interrupts_restore(ipl);
1306	jermar	397	return EPERM;
1235	jermar	398	}
		399
		400	if (pages < area->pages) {
1403	jermar	401	bool cond;
1780	jermar	402	uintptr_t start_free = area->base + pages*PAGE_SIZE;
1235	jermar	403
		404	/*
		405	* Shrinking the area.
		406	* No need to check for overlaps.
		407	*/
1403	jermar	408
		409	/*
1436	jermar	410	* Start TLB shootdown sequence.
		411	*/
2087	jermar	412	tlb_shootdown_start(TLB_INVL_PAGES, AS->asid, area->base +
		413	pages * PAGE_SIZE, area->pages - pages);
1436	jermar	414
		415	/*
1403	jermar	416	* Remove frames belonging to used space starting from
		417	* the highest addresses downwards until an overlap with
		418	* the resized address space area is found. Note that this
		419	* is also the right way to remove part of the used_space
		420	* B+tree leaf list.
		421	*/
		422	for (cond = true; cond;) {
		423	btree_node_t *node;
		424
		425	ASSERT(!list_empty(&area->used_space.leaf_head));
2087	jermar	426	node =
		427	list_get_instance(area->used_space.leaf_head.prev,
		428	btree_node_t, leaf_link);
1403	jermar	429	if ((cond = (bool) node->keys)) {
1780	jermar	430	uintptr_t b = node->key[node->keys - 1];
2087	jermar	431	count_t c =
		432	(count_t) node->value[node->keys - 1];
2745	decky	433	unsigned int i = 0;
1235	jermar	434
2087	jermar	435	if (overlaps(b, c * PAGE_SIZE, area->base,
2133	jermar	436	pages * PAGE_SIZE)) {
1403	jermar	437
2087	jermar	438	if (b + c * PAGE_SIZE <= start_free) {
1403	jermar	439	/*
2087	jermar	440	* The whole interval fits
		441	* completely in the resized
		442	* address space area.
1403	jermar	443	*/
		444	break;
		445	}
		446
		447	/*
2087	jermar	448	* Part of the interval corresponding
		449	* to b and c overlaps with the resized
		450	* address space area.
1403	jermar	451	*/
		452
		453	cond = false; /* we are almost done */
		454	i = (start_free - b) >> PAGE_WIDTH;
3149	svoboda	455	if (!used_space_remove(area, start_free, c - i))
		456	panic("Could not remove used space.\n");
1403	jermar	457	} else {
		458	/*
2087	jermar	459	* The interval of used space can be
		460	* completely removed.
1403	jermar	461	*/
		462	if (!used_space_remove(area, b, c))
3149	svoboda	463	panic("Could not remove used space.\n");
1403	jermar	464	}
		465
		466	for (; i < c; i++) {
		467	pte_t *pte;
		468
		469	page_table_lock(as, false);
2087	jermar	470	pte = page_mapping_find(as, b +
		471	i * PAGE_SIZE);
		472	ASSERT(pte && PTE_VALID(pte) &&
		473	PTE_PRESENT(pte));
		474	if (area->backend &&
		475	area->backend->frame_free) {
1424	jermar	476	area->backend->frame_free(area,
2087	jermar	477	b + i * PAGE_SIZE,
		478	PTE_GET_FRAME(pte));
1409	jermar	479	}
2087	jermar	480	page_mapping_remove(as, b +
		481	i * PAGE_SIZE);
1403	jermar	482	page_table_unlock(as, false);
		483	}
1235	jermar	484	}
		485	}
1436	jermar	486
1235	jermar	487	/*
1436	jermar	488	* Finish TLB shootdown sequence.
1235	jermar	489	*/
2183	jermar	490
2087	jermar	491	tlb_invalidate_pages(as->asid, area->base + pages * PAGE_SIZE,
		492	area->pages - pages);
1889	jermar	493	/*
		494	* Invalidate software translation caches (e.g. TSB on sparc64).
		495	*/
2087	jermar	496	as_invalidate_translation_cache(as, area->base +
		497	pages * PAGE_SIZE, area->pages - pages);
2183	jermar	498	tlb_shootdown_finalize();
		499
1235	jermar	500	} else {
		501	/*
		502	* Growing the area.
		503	* Check for overlaps with other address space areas.
		504	*/
2087	jermar	505	if (!check_area_conflicts(as, address, pages * PAGE_SIZE,
		506	area)) {
1380	jermar	507	mutex_unlock(&area->lock);
		508	mutex_unlock(&as->lock);
1235	jermar	509	interrupts_restore(ipl);
1306	jermar	510	return EADDRNOTAVAIL;
1235	jermar	511	}
		512	}
		513
		514	area->pages = pages;
		515
1380	jermar	516	mutex_unlock(&area->lock);
		517	mutex_unlock(&as->lock);
1235	jermar	518	interrupts_restore(ipl);
		519
1306	jermar	520	return 0;
1235	jermar	521	}
		522
1306	jermar	523	/** Destroy address space area.
		524	*
		525	* @param as Address space.
		526	* @param address Address withing the area to be deleted.
		527	*
		528	* @return Zero on success or a value from @ref errno.h on failure.
		529	*/
1780	jermar	530	int as_area_destroy(as_t *as, uintptr_t address)
1306	jermar	531	{
		532	as_area_t *area;
1780	jermar	533	uintptr_t base;
1495	jermar	534	link_t *cur;
1306	jermar	535	ipl_t ipl;
		536
		537	ipl = interrupts_disable();
1380	jermar	538	mutex_lock(&as->lock);
1306	jermar	539
		540	area = find_area_and_lock(as, address);
		541	if (!area) {
1380	jermar	542	mutex_unlock(&as->lock);
1306	jermar	543	interrupts_restore(ipl);
		544	return ENOENT;
		545	}
		546
1403	jermar	547	base = area->base;
		548
1411	jermar	549	/*
1436	jermar	550	* Start TLB shootdown sequence.
		551	*/
1889	jermar	552	tlb_shootdown_start(TLB_INVL_PAGES, as->asid, area->base, area->pages);
1436	jermar	553
		554	/*
1411	jermar	555	* Visit only the pages mapped by used_space B+tree.
		556	*/
2087	jermar	557	for (cur = area->used_space.leaf_head.next;
		558	cur != &area->used_space.leaf_head; cur = cur->next) {
1411	jermar	559	btree_node_t *node;
2745	decky	560	unsigned int i;
1403	jermar	561
1495	jermar	562	node = list_get_instance(cur, btree_node_t, leaf_link);
		563	for (i = 0; i < node->keys; i++) {
1780	jermar	564	uintptr_t b = node->key[i];
1495	jermar	565	count_t j;
1411	jermar	566	pte_t *pte;
1403	jermar	567
1495	jermar	568	for (j = 0; j < (count_t) node->value[i]; j++) {
1411	jermar	569	page_table_lock(as, false);
2087	jermar	570	pte = page_mapping_find(as, b + j * PAGE_SIZE);
		571	ASSERT(pte && PTE_VALID(pte) &&
		572	PTE_PRESENT(pte));
		573	if (area->backend &&
		574	area->backend->frame_free) {
		575	area->backend->frame_free(area, b +
2133	jermar	576	j * PAGE_SIZE, PTE_GET_FRAME(pte));
1403	jermar	577	}
2087	jermar	578	page_mapping_remove(as, b + j * PAGE_SIZE);
1411	jermar	579	page_table_unlock(as, false);
1306	jermar	580	}
		581	}
		582	}
1403	jermar	583
1306	jermar	584	/*
1436	jermar	585	* Finish TLB shootdown sequence.
1306	jermar	586	*/
2183	jermar	587
1889	jermar	588	tlb_invalidate_pages(as->asid, area->base, area->pages);
		589	/*
2087	jermar	590	* Invalidate potential software translation caches (e.g. TSB on
		591	* sparc64).
1889	jermar	592	*/
		593	as_invalidate_translation_cache(as, area->base, area->pages);
2183	jermar	594	tlb_shootdown_finalize();
1889	jermar	595
1436	jermar	596	btree_destroy(&area->used_space);
1306	jermar	597
1309	jermar	598	area->attributes \|= AS_AREA_ATTR_PARTIAL;
1409	jermar	599
		600	if (area->sh_info)
		601	sh_info_remove_reference(area->sh_info);
		602
1380	jermar	603	mutex_unlock(&area->lock);
1306	jermar	604
		605	/*
		606	* Remove the empty area from address space.
		607	*/
1889	jermar	608	btree_remove(&as->as_area_btree, base, NULL);
1306	jermar	609
1309	jermar	610	free(area);
		611
1889	jermar	612	mutex_unlock(&as->lock);
1306	jermar	613	interrupts_restore(ipl);
		614	return 0;
		615	}
		616
1413	jermar	617	/** Share address space area with another or the same address space.
1235	jermar	618	*
1424	jermar	619	* Address space area mapping is shared with a new address space area.
		620	* If the source address space area has not been shared so far,
		621	* a new sh_info is created. The new address space area simply gets the
		622	* sh_info of the source area. The process of duplicating the
		623	* mapping is done through the backend share function.
1413	jermar	624	*
1417	jermar	625	* @param src_as Pointer to source address space.
1239	jermar	626	* @param src_base Base address of the source address space area.
1417	jermar	627	* @param acc_size Expected size of the source area.
1428	palkovsky	628	* @param dst_as Pointer to destination address space.
1417	jermar	629	* @param dst_base Target base address.
		630	* @param dst_flags_mask Destination address space area flags mask.
1235	jermar	631	*
2007	jermar	632	* @return Zero on success or ENOENT if there is no such task or if there is no
		633	* such address space area, EPERM if there was a problem in accepting the area
		634	* or ENOMEM if there was a problem in allocating destination address space
		635	* area. ENOTSUP is returned if the address space area backend does not support
2141	jermar	636	* sharing.
1235	jermar	637	*/
1780	jermar	638	int as_area_share(as_t *src_as, uintptr_t src_base, size_t acc_size,
2647	jermar	639	as_t *dst_as, uintptr_t dst_base, int dst_flags_mask)
1235	jermar	640	{
		641	ipl_t ipl;
1239	jermar	642	int src_flags;
		643	size_t src_size;
		644	as_area_t src_area, dst_area;
1413	jermar	645	share_info_t *sh_info;
1424	jermar	646	mem_backend_t *src_backend;
		647	mem_backend_data_t src_backend_data;
1434	palkovsky	648
1235	jermar	649	ipl = interrupts_disable();
1380	jermar	650	mutex_lock(&src_as->lock);
1329	palkovsky	651	src_area = find_area_and_lock(src_as, src_base);
1239	jermar	652	if (!src_area) {
1238	jermar	653	/*
		654	* Could not find the source address space area.
		655	*/
1380	jermar	656	mutex_unlock(&src_as->lock);
1238	jermar	657	interrupts_restore(ipl);
		658	return ENOENT;
		659	}
2007	jermar	660
1424	jermar	661	if (!src_area->backend \|\| !src_area->backend->share) {
1413	jermar	662	/*
1851	jermar	663	* There is no backend or the backend does not
1424	jermar	664	* know how to share the area.
1413	jermar	665	*/
		666	mutex_unlock(&src_area->lock);
		667	mutex_unlock(&src_as->lock);
		668	interrupts_restore(ipl);
		669	return ENOTSUP;
		670	}
		671
1239	jermar	672	src_size = src_area->pages * PAGE_SIZE;
		673	src_flags = src_area->flags;
1424	jermar	674	src_backend = src_area->backend;
		675	src_backend_data = src_area->backend_data;
1544	palkovsky	676
		677	/* Share the cacheable flag from the original mapping */
		678	if (src_flags & AS_AREA_CACHEABLE)
		679	dst_flags_mask \|= AS_AREA_CACHEABLE;
		680
2087	jermar	681	if (src_size != acc_size \|\|
		682	(src_flags & dst_flags_mask) != dst_flags_mask) {
1413	jermar	683	mutex_unlock(&src_area->lock);
		684	mutex_unlock(&src_as->lock);
1235	jermar	685	interrupts_restore(ipl);
		686	return EPERM;
		687	}
1413	jermar	688
1235	jermar	689	/*
1413	jermar	690	* Now we are committed to sharing the area.
1954	jermar	691	* First, prepare the area for sharing.
1413	jermar	692	* Then it will be safe to unlock it.
		693	*/
		694	sh_info = src_area->sh_info;
		695	if (!sh_info) {
		696	sh_info = (share_info_t *) malloc(sizeof(share_info_t), 0);
		697	mutex_initialize(&sh_info->lock);
		698	sh_info->refcount = 2;
		699	btree_create(&sh_info->pagemap);
		700	src_area->sh_info = sh_info;
2647	jermar	701	/*
		702	* Call the backend to setup sharing.
		703	*/
		704	src_area->backend->share(src_area);
1413	jermar	705	} else {
		706	mutex_lock(&sh_info->lock);
		707	sh_info->refcount++;
		708	mutex_unlock(&sh_info->lock);
		709	}
		710
		711	mutex_unlock(&src_area->lock);
		712	mutex_unlock(&src_as->lock);
		713
		714	/*
1239	jermar	715	* Create copy of the source address space area.
		716	* The destination area is created with AS_AREA_ATTR_PARTIAL
		717	* attribute set which prevents race condition with
		718	* preliminary as_page_fault() calls.
1417	jermar	719	* The flags of the source area are masked against dst_flags_mask
		720	* to support sharing in less privileged mode.
1235	jermar	721	*/
1461	palkovsky	722	dst_area = as_area_create(dst_as, dst_flags_mask, src_size, dst_base,
2087	jermar	723	AS_AREA_ATTR_PARTIAL, src_backend, &src_backend_data);
1239	jermar	724	if (!dst_area) {
1235	jermar	725	/*
		726	* Destination address space area could not be created.
		727	*/
1413	jermar	728	sh_info_remove_reference(sh_info);
		729
1235	jermar	730	interrupts_restore(ipl);
		731	return ENOMEM;
		732	}
2009	jermar	733
1235	jermar	734	/*
1239	jermar	735	* Now the destination address space area has been
		736	* fully initialized. Clear the AS_AREA_ATTR_PARTIAL
1413	jermar	737	* attribute and set the sh_info.
1239	jermar	738	*/
2009	jermar	739	mutex_lock(&dst_as->lock);
1380	jermar	740	mutex_lock(&dst_area->lock);
1239	jermar	741	dst_area->attributes &= ~AS_AREA_ATTR_PARTIAL;
1413	jermar	742	dst_area->sh_info = sh_info;
1380	jermar	743	mutex_unlock(&dst_area->lock);
2009	jermar	744	mutex_unlock(&dst_as->lock);
		745
1235	jermar	746	interrupts_restore(ipl);
		747
		748	return 0;
		749	}
		750
1423	jermar	751	/** Check access mode for address space area.
		752	*
		753	* The address space area must be locked prior to this call.
		754	*
		755	* @param area Address space area.
		756	* @param access Access mode.
		757	*
		758	* @return False if access violates area's permissions, true otherwise.
		759	*/
		760	bool as_area_check_access(as_area_t *area, pf_access_t access)
		761	{
		762	int flagmap[] = {
		763	[PF_ACCESS_READ] = AS_AREA_READ,
		764	[PF_ACCESS_WRITE] = AS_AREA_WRITE,
		765	[PF_ACCESS_EXEC] = AS_AREA_EXEC
		766	};
		767
		768	if (!(area->flags & flagmap[access]))
		769	return false;
		770
		771	return true;
		772	}
		773
2984	svoboda	774	/** Change adress area flags.
		775	*
		776	* The idea is to have the same data, but with a different access mode.
		777	* This is needed e.g. for writing code into memory and then executing it.
		778	* In order for this to work properly, this may copy the data
		779	* into private anonymous memory (unless it's already there).
		780	*
		781	* @param as Address space.
		782	* @param flags Flags of the area memory.
		783	* @param address Address withing the area to be changed.
		784	*
		785	* @return Zero on success or a value from @ref errno.h on failure.
		786	*/
		787	int as_area_change_flags(as_t *as, int flags, uintptr_t address)
		788	{
		789	as_area_t *area;
		790	uintptr_t base;
		791	link_t *cur;
		792	ipl_t ipl;
2985	svoboda	793	int page_flags;
2986	svoboda	794	uintptr_t old_frame;
2984	svoboda	795
2985	svoboda	796	/* Flags for the new memory mapping */
		797	page_flags = area_flags_to_page_flags(flags);
		798
2984	svoboda	799	ipl = interrupts_disable();
		800	mutex_lock(&as->lock);
		801
		802	area = find_area_and_lock(as, address);
		803	if (!area) {
		804	mutex_unlock(&as->lock);
		805	interrupts_restore(ipl);
		806	return ENOENT;
		807	}
		808
		809	if (area->sh_info \|\| area->backend != &anon_backend) {
		810	/* Copying shared areas not supported yet */
		811	/* Copying non-anonymous memory not supported yet */
2985	svoboda	812	mutex_unlock(&area->lock);
2984	svoboda	813	mutex_unlock(&as->lock);
		814	interrupts_restore(ipl);
		815	return ENOTSUP;
		816	}
		817
		818	base = area->base;
		819
		820	/*
		821	* Start TLB shootdown sequence.
		822	*/
		823	tlb_shootdown_start(TLB_INVL_PAGES, as->asid, area->base, area->pages);
		824
		825	/*
		826	* Visit only the pages mapped by used_space B+tree.
		827	*/
		828	for (cur = area->used_space.leaf_head.next;
		829	cur != &area->used_space.leaf_head; cur = cur->next) {
		830	btree_node_t *node;
		831	unsigned int i;
		832
		833	node = list_get_instance(cur, btree_node_t, leaf_link);
		834	for (i = 0; i < node->keys; i++) {
		835	uintptr_t b = node->key[i];
		836	count_t j;
		837	pte_t *pte;
		838
		839	for (j = 0; j < (count_t) node->value[i]; j++) {
		840	page_table_lock(as, false);
		841	pte = page_mapping_find(as, b + j * PAGE_SIZE);
		842	ASSERT(pte && PTE_VALID(pte) &&
		843	PTE_PRESENT(pte));
3129	svoboda	844	old_frame = PTE_GET_FRAME(pte);
2984	svoboda	845
		846	/* Remove old mapping and insert the new one */
		847	page_mapping_remove(as, b + j * PAGE_SIZE);
		848	page_mapping_insert(as, b + j * PAGE_SIZE,
2985	svoboda	849	old_frame, page_flags);
		850
2984	svoboda	851	page_table_unlock(as, false);
		852	}
		853	}
		854	}
		855
		856	/*
		857	* Finish TLB shootdown sequence.
		858	*/
		859
		860	tlb_invalidate_pages(as->asid, area->base, area->pages);
		861	/*
		862	* Invalidate potential software translation caches (e.g. TSB on
		863	* sparc64).
		864	*/
		865	as_invalidate_translation_cache(as, area->base, area->pages);
		866	tlb_shootdown_finalize();
		867
		868	mutex_unlock(&area->lock);
		869	mutex_unlock(&as->lock);
		870	interrupts_restore(ipl);
		871
		872	return 0;
		873	}
		874
		875
703	jermar	876	/** Handle page fault within the current address space.
		877	*
1409	jermar	878	* This is the high-level page fault handler. It decides
		879	* whether the page fault can be resolved by any backend
		880	* and if so, it invokes the backend to resolve the page
		881	* fault.
		882	*
703	jermar	883	* Interrupts are assumed disabled.
		884	*
		885	* @param page Faulting page.
1411	jermar	886	* @param access Access mode that caused the fault (i.e. read/write/exec).
1288	jermar	887	* @param istate Pointer to interrupted state.
703	jermar	888	*
1409	jermar	889	* @return AS_PF_FAULT on page fault, AS_PF_OK on success or AS_PF_DEFER if the
		890	* fault was caused by copy_to_uspace() or copy_from_uspace().
703	jermar	891	*/
1780	jermar	892	int as_page_fault(uintptr_t page, pf_access_t access, istate_t *istate)
703	jermar	893	{
1044	jermar	894	pte_t *pte;
977	jermar	895	as_area_t *area;
703	jermar	896
1380	jermar	897	if (!THREAD)
1409	jermar	898	return AS_PF_FAULT;
1380	jermar	899
703	jermar	900	ASSERT(AS);
1044	jermar	901
1380	jermar	902	mutex_lock(&AS->lock);
977	jermar	903	area = find_area_and_lock(AS, page);
703	jermar	904	if (!area) {
		905	/*
		906	* No area contained mapping for 'page'.
		907	* Signal page fault to low-level handler.
		908	*/
1380	jermar	909	mutex_unlock(&AS->lock);
1288	jermar	910	goto page_fault;
703	jermar	911	}
		912
1239	jermar	913	if (area->attributes & AS_AREA_ATTR_PARTIAL) {
		914	/*
		915	* The address space area is not fully initialized.
		916	* Avoid possible race by returning error.
		917	*/
1380	jermar	918	mutex_unlock(&area->lock);
		919	mutex_unlock(&AS->lock);
1288	jermar	920	goto page_fault;
1239	jermar	921	}
		922
1424	jermar	923	if (!area->backend \|\| !area->backend->page_fault) {
1409	jermar	924	/*
		925	* The address space area is not backed by any backend
		926	* or the backend cannot handle page faults.
		927	*/
		928	mutex_unlock(&area->lock);
		929	mutex_unlock(&AS->lock);
		930	goto page_fault;
		931	}
1179	jermar	932
1044	jermar	933	page_table_lock(AS, false);
		934
703	jermar	935	/*
1044	jermar	936	* To avoid race condition between two page faults
		937	* on the same address, we need to make sure
		938	* the mapping has not been already inserted.
		939	*/
		940	if ((pte = page_mapping_find(AS, page))) {
		941	if (PTE_PRESENT(pte)) {
1423	jermar	942	if (((access == PF_ACCESS_READ) && PTE_READABLE(pte)) \|\|
2087	jermar	943	(access == PF_ACCESS_WRITE && PTE_WRITABLE(pte)) \|\|
		944	(access == PF_ACCESS_EXEC && PTE_EXECUTABLE(pte))) {
1423	jermar	945	page_table_unlock(AS, false);
		946	mutex_unlock(&area->lock);
		947	mutex_unlock(&AS->lock);
		948	return AS_PF_OK;
		949	}
1044	jermar	950	}
		951	}
1409	jermar	952
1044	jermar	953	/*
1409	jermar	954	* Resort to the backend page fault handler.
703	jermar	955	*/
1424	jermar	956	if (area->backend->page_fault(area, page, access) != AS_PF_OK) {
1409	jermar	957	page_table_unlock(AS, false);
		958	mutex_unlock(&area->lock);
		959	mutex_unlock(&AS->lock);
		960	goto page_fault;
		961	}
703	jermar	962
1044	jermar	963	page_table_unlock(AS, false);
1380	jermar	964	mutex_unlock(&area->lock);
		965	mutex_unlock(&AS->lock);
1288	jermar	966	return AS_PF_OK;
		967
		968	page_fault:
		969	if (THREAD->in_copy_from_uspace) {
		970	THREAD->in_copy_from_uspace = false;
2087	jermar	971	istate_set_retaddr(istate,
		972	(uintptr_t) &memcpy_from_uspace_failover_address);
1288	jermar	973	} else if (THREAD->in_copy_to_uspace) {
		974	THREAD->in_copy_to_uspace = false;
2087	jermar	975	istate_set_retaddr(istate,
		976	(uintptr_t) &memcpy_to_uspace_failover_address);
1288	jermar	977	} else {
		978	return AS_PF_FAULT;
		979	}
		980
		981	return AS_PF_DEFER;
703	jermar	982	}
		983
823	jermar	984	/** Switch address spaces.
703	jermar	985	*
1380	jermar	986	* Note that this function cannot sleep as it is essentially a part of
2170	jermar	987	* scheduling. Sleeping here would lead to deadlock on wakeup. Another
		988	* thing which is forbidden in this context is locking the address space.
1380	jermar	989	*
2183	jermar	990	* When this function is enetered, no spinlocks may be held.
		991	*
823	jermar	992	* @param old Old address space or NULL.
		993	* @param new New address space.
703	jermar	994	*/
2106	jermar	995	void as_switch(as_t old_as, as_t new_as)
703	jermar	996	{
2183	jermar	997	DEADLOCK_PROBE_INIT(p_asidlock);
		998	preemption_disable();
		999	retry:
		1000	(void) interrupts_disable();
		1001	if (!spinlock_trylock(&asidlock)) {
		1002	/*
		1003	* Avoid deadlock with TLB shootdown.
		1004	* We can enable interrupts here because
		1005	* preemption is disabled. We should not be
		1006	* holding any other lock.
		1007	*/
		1008	(void) interrupts_enable();
		1009	DEADLOCK_PROBE(p_asidlock, DEADLOCK_THRESHOLD);
		1010	goto retry;
		1011	}
		1012	preemption_enable();
703	jermar	1013
		1014	/*
823	jermar	1015	* First, take care of the old address space.
		1016	*/
2106	jermar	1017	if (old_as) {
		1018	ASSERT(old_as->cpu_refcount);
		1019	if((--old_as->cpu_refcount == 0) && (old_as != AS_KERNEL)) {
823	jermar	1020	/*
		1021	* The old address space is no longer active on
		1022	* any processor. It can be appended to the
		1023	* list of inactive address spaces with assigned
		1024	* ASID.
		1025	*/
2141	jermar	1026	ASSERT(old_as->asid != ASID_INVALID);
		1027	list_append(&old_as->inactive_as_with_asid_link,
		1028	&inactive_as_with_asid_head);
823	jermar	1029	}
1890	jermar	1030
		1031	/*
		1032	* Perform architecture-specific tasks when the address space
		1033	* is being removed from the CPU.
		1034	*/
2106	jermar	1035	as_deinstall_arch(old_as);
823	jermar	1036	}
		1037
		1038	/*
		1039	* Second, prepare the new address space.
		1040	*/
2106	jermar	1041	if ((new_as->cpu_refcount++ == 0) && (new_as != AS_KERNEL)) {
2170	jermar	1042	if (new_as->asid != ASID_INVALID)
2106	jermar	1043	list_remove(&new_as->inactive_as_with_asid_link);
2170	jermar	1044	else
		1045	new_as->asid = asid_get();
823	jermar	1046	}
2106	jermar	1047	#ifdef AS_PAGE_TABLE
		1048	SET_PTL0_ADDRESS(new_as->genarch.page_table);
		1049	#endif
823	jermar	1050
		1051	/*
703	jermar	1052	* Perform architecture-specific steps.
727	jermar	1053	* (e.g. write ASID to hardware register etc.)
703	jermar	1054	*/
2106	jermar	1055	as_install_arch(new_as);
2170	jermar	1056
		1057	spinlock_unlock(&asidlock);
703	jermar	1058
2106	jermar	1059	AS = new_as;
703	jermar	1060	}
754	jermar	1061
1235	jermar	1062	/** Convert address space area flags to page flags.
754	jermar	1063	*
1235	jermar	1064	* @param aflags Flags of some address space area.
754	jermar	1065	*
1235	jermar	1066	* @return Flags to be passed to page_mapping_insert().
754	jermar	1067	*/
1235	jermar	1068	int area_flags_to_page_flags(int aflags)
754	jermar	1069	{
		1070	int flags;
		1071
1178	jermar	1072	flags = PAGE_USER \| PAGE_PRESENT;
754	jermar	1073
1235	jermar	1074	if (aflags & AS_AREA_READ)
1026	jermar	1075	flags \|= PAGE_READ;
		1076
1235	jermar	1077	if (aflags & AS_AREA_WRITE)
1026	jermar	1078	flags \|= PAGE_WRITE;
		1079
1235	jermar	1080	if (aflags & AS_AREA_EXEC)
1026	jermar	1081	flags \|= PAGE_EXEC;
		1082
1424	jermar	1083	if (aflags & AS_AREA_CACHEABLE)
1178	jermar	1084	flags \|= PAGE_CACHEABLE;
		1085
754	jermar	1086	return flags;
		1087	}
756	jermar	1088
1235	jermar	1089	/** Compute flags for virtual address translation subsytem.
		1090	*
		1091	* The address space area must be locked.
		1092	* Interrupts must be disabled.
		1093	*
		1094	* @param a Address space area.
		1095	*
		1096	* @return Flags to be used in page_mapping_insert().
		1097	*/
1409	jermar	1098	int as_area_get_flags(as_area_t *a)
1235	jermar	1099	{
		1100	return area_flags_to_page_flags(a->flags);
		1101	}
		1102
756	jermar	1103	/** Create page table.
		1104	*
		1105	* Depending on architecture, create either address space
		1106	* private or global page table.
		1107	*
		1108	* @param flags Flags saying whether the page table is for kernel address space.
		1109	*
		1110	* @return First entry of the page table.
		1111	*/
		1112	pte_t *page_table_create(int flags)
		1113	{
2125	decky	1114	#ifdef __OBJC__
		1115	return [as_t page_table_create: flags];
		1116	#else
		1117	ASSERT(as_operations);
		1118	ASSERT(as_operations->page_table_create);
		1119
		1120	return as_operations->page_table_create(flags);
		1121	#endif
756	jermar	1122	}
977	jermar	1123
1468	jermar	1124	/** Destroy page table.
		1125	*
		1126	* Destroy page table in architecture specific way.
		1127	*
		1128	* @param page_table Physical address of PTL0.
		1129	*/
		1130	void page_table_destroy(pte_t *page_table)
		1131	{
2125	decky	1132	#ifdef __OBJC__
		1133	return [as_t page_table_destroy: page_table];
		1134	#else
		1135	ASSERT(as_operations);
		1136	ASSERT(as_operations->page_table_destroy);
		1137
		1138	as_operations->page_table_destroy(page_table);
		1139	#endif
1468	jermar	1140	}
		1141
1044	jermar	1142	/** Lock page table.
		1143	*
		1144	* This function should be called before any page_mapping_insert(),
		1145	* page_mapping_remove() and page_mapping_find().
		1146	*
		1147	* Locking order is such that address space areas must be locked
		1148	* prior to this call. Address space can be locked prior to this
		1149	* call in which case the lock argument is false.
		1150	*
		1151	* @param as Address space.
1248	jermar	1152	* @param lock If false, do not attempt to lock as->lock.
1044	jermar	1153	*/
		1154	void page_table_lock(as_t *as, bool lock)
		1155	{
2125	decky	1156	#ifdef __OBJC__
		1157	[as page_table_lock: lock];
		1158	#else
1044	jermar	1159	ASSERT(as_operations);
		1160	ASSERT(as_operations->page_table_lock);
2125	decky	1161
1044	jermar	1162	as_operations->page_table_lock(as, lock);
2125	decky	1163	#endif
1044	jermar	1164	}
		1165
		1166	/** Unlock page table.
		1167	*
		1168	* @param as Address space.
1248	jermar	1169	* @param unlock If false, do not attempt to unlock as->lock.
1044	jermar	1170	*/
		1171	void page_table_unlock(as_t *as, bool unlock)
		1172	{
2125	decky	1173	#ifdef __OBJC__
		1174	[as page_table_unlock: unlock];
		1175	#else
1044	jermar	1176	ASSERT(as_operations);
		1177	ASSERT(as_operations->page_table_unlock);
2125	decky	1178
1044	jermar	1179	as_operations->page_table_unlock(as, unlock);
2125	decky	1180	#endif
1044	jermar	1181	}
		1182
977	jermar	1183
		1184	/** Find address space area and lock it.
		1185	*
		1186	* The address space must be locked and interrupts must be disabled.
		1187	*
		1188	* @param as Address space.
		1189	* @param va Virtual address.
		1190	*
2087	jermar	1191	* @return Locked address space area containing va on success or NULL on
		1192	* failure.
977	jermar	1193	*/
1780	jermar	1194	as_area_t find_area_and_lock(as_t as, uintptr_t va)
977	jermar	1195	{
		1196	as_area_t *a;
1147	jermar	1197	btree_node_t leaf, lnode;
2745	decky	1198	unsigned int i;
977	jermar	1199
1147	jermar	1200	a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf);
		1201	if (a) {
		1202	/* va is the base address of an address space area */
1380	jermar	1203	mutex_lock(&a->lock);
1147	jermar	1204	return a;
		1205	}
		1206
		1207	/*
1150	jermar	1208	* Search the leaf node and the righmost record of its left neighbour
1147	jermar	1209	* to find out whether this is a miss or va belongs to an address
		1210	* space area found there.
		1211	*/
		1212
		1213	/* First, search the leaf node itself. */
		1214	for (i = 0; i < leaf->keys; i++) {
		1215	a = (as_area_t *) leaf->value[i];
1380	jermar	1216	mutex_lock(&a->lock);
1147	jermar	1217	if ((a->base <= va) && (va < a->base + a->pages * PAGE_SIZE)) {
		1218	return a;
		1219	}
1380	jermar	1220	mutex_unlock(&a->lock);
1147	jermar	1221	}
977	jermar	1222
1147	jermar	1223	/*
1150	jermar	1224	* Second, locate the left neighbour and test its last record.
1148	jermar	1225	* Because of its position in the B+tree, it must have base < va.
1147	jermar	1226	*/
2087	jermar	1227	lnode = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf);
		1228	if (lnode) {
1147	jermar	1229	a = (as_area_t *) lnode->value[lnode->keys - 1];
1380	jermar	1230	mutex_lock(&a->lock);
1147	jermar	1231	if (va < a->base + a->pages * PAGE_SIZE) {
1048	jermar	1232	return a;
1147	jermar	1233	}
1380	jermar	1234	mutex_unlock(&a->lock);
977	jermar	1235	}
		1236
		1237	return NULL;
		1238	}
1048	jermar	1239
		1240	/** Check area conflicts with other areas.
		1241	*
		1242	* The address space must be locked and interrupts must be disabled.
		1243	*
		1244	* @param as Address space.
		1245	* @param va Starting virtual address of the area being tested.
		1246	* @param size Size of the area being tested.
		1247	* @param avoid_area Do not touch this area.
		1248	*
		1249	* @return True if there is no conflict, false otherwise.
		1250	*/
2087	jermar	1251	bool check_area_conflicts(as_t *as, uintptr_t va, size_t size,
		1252	as_area_t *avoid_area)
1048	jermar	1253	{
		1254	as_area_t *a;
1147	jermar	1255	btree_node_t leaf, node;
2745	decky	1256	unsigned int i;
1048	jermar	1257
1070	jermar	1258	/*
		1259	* We don't want any area to have conflicts with NULL page.
		1260	*/
		1261	if (overlaps(va, size, NULL, PAGE_SIZE))
		1262	return false;
		1263
1147	jermar	1264	/*
		1265	* The leaf node is found in O(log n), where n is proportional to
		1266	* the number of address space areas belonging to as.
		1267	* The check for conflicts is then attempted on the rightmost
1150	jermar	1268	* record in the left neighbour, the leftmost record in the right
		1269	* neighbour and all records in the leaf node itself.
1147	jermar	1270	*/
1048	jermar	1271
1147	jermar	1272	if ((a = (as_area_t *) btree_search(&as->as_area_btree, va, &leaf))) {
		1273	if (a != avoid_area)
		1274	return false;
		1275	}
		1276
		1277	/* First, check the two border cases. */
1150	jermar	1278	if ((node = btree_leaf_node_left_neighbour(&as->as_area_btree, leaf))) {
1147	jermar	1279	a = (as_area_t *) node->value[node->keys - 1];
1380	jermar	1280	mutex_lock(&a->lock);
1147	jermar	1281	if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) {
1380	jermar	1282	mutex_unlock(&a->lock);
1147	jermar	1283	return false;
		1284	}
1380	jermar	1285	mutex_unlock(&a->lock);
1147	jermar	1286	}
2087	jermar	1287	node = btree_leaf_node_right_neighbour(&as->as_area_btree, leaf);
		1288	if (node) {
1147	jermar	1289	a = (as_area_t *) node->value[0];
1380	jermar	1290	mutex_lock(&a->lock);
1147	jermar	1291	if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) {
1380	jermar	1292	mutex_unlock(&a->lock);
1147	jermar	1293	return false;
		1294	}
1380	jermar	1295	mutex_unlock(&a->lock);
1147	jermar	1296	}
		1297
		1298	/* Second, check the leaf node. */
		1299	for (i = 0; i < leaf->keys; i++) {
		1300	a = (as_area_t *) leaf->value[i];
		1301
1048	jermar	1302	if (a == avoid_area)
		1303	continue;
1147	jermar	1304
1380	jermar	1305	mutex_lock(&a->lock);
1147	jermar	1306	if (overlaps(va, size, a->base, a->pages * PAGE_SIZE)) {
1380	jermar	1307	mutex_unlock(&a->lock);
1147	jermar	1308	return false;
		1309	}
1380	jermar	1310	mutex_unlock(&a->lock);
1048	jermar	1311	}
		1312
1070	jermar	1313	/*
		1314	* So far, the area does not conflict with other areas.
		1315	* Check if it doesn't conflict with kernel address space.
		1316	*/
		1317	if (!KERNEL_ADDRESS_SPACE_SHADOWED) {
		1318	return !overlaps(va, size,
2087	jermar	1319	KERNEL_ADDRESS_SPACE_START,
		1320	KERNEL_ADDRESS_SPACE_END - KERNEL_ADDRESS_SPACE_START);
1070	jermar	1321	}
		1322
1048	jermar	1323	return true;
		1324	}
1235	jermar	1325
2556	jermar	1326	/** Return size of the address space area with given base.
		1327	*
		1328	* @param base Arbitrary address insede the address space area.
		1329	*
		1330	* @return Size of the address space area in bytes or zero if it
		1331	* does not exist.
		1332	*/
		1333	size_t as_area_get_size(uintptr_t base)
1329	palkovsky	1334	{
		1335	ipl_t ipl;
		1336	as_area_t *src_area;
		1337	size_t size;
		1338
		1339	ipl = interrupts_disable();
		1340	src_area = find_area_and_lock(AS, base);
		1341	if (src_area){
		1342	size = src_area->pages * PAGE_SIZE;
1380	jermar	1343	mutex_unlock(&src_area->lock);
1329	palkovsky	1344	} else {
		1345	size = 0;
		1346	}
		1347	interrupts_restore(ipl);
		1348	return size;
		1349	}
		1350
1387	jermar	1351	/** Mark portion of address space area as used.
		1352	*
		1353	* The address space area must be already locked.
		1354	*
		1355	* @param a Address space area.
		1356	* @param page First page to be marked.
		1357	* @param count Number of page to be marked.
		1358	*
		1359	* @return 0 on failure and 1 on success.
		1360	*/
1780	jermar	1361	int used_space_insert(as_area_t *a, uintptr_t page, count_t count)
1387	jermar	1362	{
		1363	btree_node_t leaf, node;
		1364	count_t pages;
2745	decky	1365	unsigned int i;
1387	jermar	1366
		1367	ASSERT(page == ALIGN_DOWN(page, PAGE_SIZE));
		1368	ASSERT(count);
		1369
		1370	pages = (count_t) btree_search(&a->used_space, page, &leaf);
		1371	if (pages) {
		1372	/*
		1373	* We hit the beginning of some used space.
		1374	*/
		1375	return 0;
		1376	}
		1377
1437	jermar	1378	if (!leaf->keys) {
		1379	btree_insert(&a->used_space, page, (void *) count, leaf);
		1380	return 1;
		1381	}
		1382
1387	jermar	1383	node = btree_leaf_node_left_neighbour(&a->used_space, leaf);
		1384	if (node) {
2087	jermar	1385	uintptr_t left_pg = node->key[node->keys - 1];
		1386	uintptr_t right_pg = leaf->key[0];
		1387	count_t left_cnt = (count_t) node->value[node->keys - 1];
		1388	count_t right_cnt = (count_t) leaf->value[0];
1387	jermar	1389
		1390	/*
		1391	* Examine the possibility that the interval fits
		1392	* somewhere between the rightmost interval of
		1393	* the left neigbour and the first interval of the leaf.
		1394	*/
		1395
		1396	if (page >= right_pg) {
		1397	/* Do nothing. */
2087	jermar	1398	} else if (overlaps(page, count * PAGE_SIZE, left_pg,
		1399	left_cnt * PAGE_SIZE)) {
1387	jermar	1400	/* The interval intersects with the left interval. */
		1401	return 0;
2087	jermar	1402	} else if (overlaps(page, count * PAGE_SIZE, right_pg,
		1403	right_cnt * PAGE_SIZE)) {
1387	jermar	1404	/* The interval intersects with the right interval. */
		1405	return 0;
2087	jermar	1406	} else if ((page == left_pg + left_cnt * PAGE_SIZE) &&
		1407	(page + count * PAGE_SIZE == right_pg)) {
		1408	/*
		1409	* The interval can be added by merging the two already
		1410	* present intervals.
		1411	*/
1403	jermar	1412	node->value[node->keys - 1] += count + right_cnt;
1387	jermar	1413	btree_remove(&a->used_space, right_pg, leaf);
		1414	return 1;
2087	jermar	1415	} else if (page == left_pg + left_cnt * PAGE_SIZE) {
		1416	/*
		1417	* The interval can be added by simply growing the left
		1418	* interval.
		1419	*/
1403	jermar	1420	node->value[node->keys - 1] += count;
1387	jermar	1421	return 1;
2087	jermar	1422	} else if (page + count * PAGE_SIZE == right_pg) {
1387	jermar	1423	/*
2087	jermar	1424	* The interval can be addded by simply moving base of
		1425	* the right interval down and increasing its size
		1426	* accordingly.
1387	jermar	1427	*/
1403	jermar	1428	leaf->value[0] += count;
1387	jermar	1429	leaf->key[0] = page;
		1430	return 1;
		1431	} else {
		1432	/*
		1433	* The interval is between both neigbouring intervals,
		1434	* but cannot be merged with any of them.
		1435	*/
2087	jermar	1436	btree_insert(&a->used_space, page, (void *) count,
		1437	leaf);
1387	jermar	1438	return 1;
		1439	}
		1440	} else if (page < leaf->key[0]) {
1780	jermar	1441	uintptr_t right_pg = leaf->key[0];
1387	jermar	1442	count_t right_cnt = (count_t) leaf->value[0];
		1443
		1444	/*
2087	jermar	1445	* Investigate the border case in which the left neighbour does
		1446	* not exist but the interval fits from the left.
1387	jermar	1447	*/
		1448
2087	jermar	1449	if (overlaps(page, count * PAGE_SIZE, right_pg,
		1450	right_cnt * PAGE_SIZE)) {
1387	jermar	1451	/* The interval intersects with the right interval. */
		1452	return 0;
2087	jermar	1453	} else if (page + count * PAGE_SIZE == right_pg) {
1387	jermar	1454	/*
2087	jermar	1455	* The interval can be added by moving the base of the
		1456	* right interval down and increasing its size
		1457	* accordingly.
1387	jermar	1458	*/
		1459	leaf->key[0] = page;
1403	jermar	1460	leaf->value[0] += count;
1387	jermar	1461	return 1;
		1462	} else {
		1463	/*
		1464	* The interval doesn't adjoin with the right interval.
		1465	* It must be added individually.
		1466	*/
2087	jermar	1467	btree_insert(&a->used_space, page, (void *) count,
		1468	leaf);
1387	jermar	1469	return 1;
		1470	}
		1471	}
		1472
		1473	node = btree_leaf_node_right_neighbour(&a->used_space, leaf);
		1474	if (node) {
2087	jermar	1475	uintptr_t left_pg = leaf->key[leaf->keys - 1];
		1476	uintptr_t right_pg = node->key[0];
		1477	count_t left_cnt = (count_t) leaf->value[leaf->keys - 1];
		1478	count_t right_cnt = (count_t) node->value[0];
1387	jermar	1479
		1480	/*
		1481	* Examine the possibility that the interval fits
		1482	* somewhere between the leftmost interval of
		1483	* the right neigbour and the last interval of the leaf.
		1484	*/
		1485
		1486	if (page < left_pg) {
		1487	/* Do nothing. */
2087	jermar	1488	} else if (overlaps(page, count * PAGE_SIZE, left_pg,
		1489	left_cnt * PAGE_SIZE)) {
1387	jermar	1490	/* The interval intersects with the left interval. */
		1491	return 0;
2087	jermar	1492	} else if (overlaps(page, count * PAGE_SIZE, right_pg,
		1493	right_cnt * PAGE_SIZE)) {
1387	jermar	1494	/* The interval intersects with the right interval. */
		1495	return 0;
2087	jermar	1496	} else if ((page == left_pg + left_cnt * PAGE_SIZE) &&
		1497	(page + count * PAGE_SIZE == right_pg)) {
		1498	/*
		1499	* The interval can be added by merging the two already
		1500	* present intervals.
		1501	* */
1403	jermar	1502	leaf->value[leaf->keys - 1] += count + right_cnt;
1387	jermar	1503	btree_remove(&a->used_space, right_pg, node);
		1504	return 1;
2087	jermar	1505	} else if (page == left_pg + left_cnt * PAGE_SIZE) {
		1506	/*
		1507	* The interval can be added by simply growing the left
		1508	* interval.
		1509	* */
1403	jermar	1510	leaf->value[leaf->keys - 1] += count;
1387	jermar	1511	return 1;
2087	jermar	1512	} else if (page + count * PAGE_SIZE == right_pg) {
1387	jermar	1513	/*
2087	jermar	1514	* The interval can be addded by simply moving base of
		1515	* the right interval down and increasing its size
		1516	* accordingly.
1387	jermar	1517	*/
1403	jermar	1518	node->value[0] += count;
1387	jermar	1519	node->key[0] = page;
		1520	return 1;
		1521	} else {
		1522	/*
		1523	* The interval is between both neigbouring intervals,
		1524	* but cannot be merged with any of them.
		1525	*/
2087	jermar	1526	btree_insert(&a->used_space, page, (void *) count,
		1527	leaf);
1387	jermar	1528	return 1;
		1529	}
		1530	} else if (page >= leaf->key[leaf->keys - 1]) {
1780	jermar	1531	uintptr_t left_pg = leaf->key[leaf->keys - 1];
1387	jermar	1532	count_t left_cnt = (count_t) leaf->value[leaf->keys - 1];
		1533
		1534	/*
2087	jermar	1535	* Investigate the border case in which the right neighbour
		1536	* does not exist but the interval fits from the right.
1387	jermar	1537	*/
		1538
2087	jermar	1539	if (overlaps(page, count * PAGE_SIZE, left_pg,
		1540	left_cnt * PAGE_SIZE)) {
1403	jermar	1541	/* The interval intersects with the left interval. */
1387	jermar	1542	return 0;
2087	jermar	1543	} else if (left_pg + left_cnt * PAGE_SIZE == page) {
		1544	/*
		1545	* The interval can be added by growing the left
		1546	* interval.
		1547	*/
1403	jermar	1548	leaf->value[leaf->keys - 1] += count;
1387	jermar	1549	return 1;
		1550	} else {
		1551	/*
		1552	* The interval doesn't adjoin with the left interval.
		1553	* It must be added individually.
		1554	*/
2087	jermar	1555	btree_insert(&a->used_space, page, (void *) count,
		1556	leaf);
1387	jermar	1557	return 1;
		1558	}
		1559	}
		1560
		1561	/*
2087	jermar	1562	* Note that if the algorithm made it thus far, the interval can fit
		1563	* only between two other intervals of the leaf. The two border cases
		1564	* were already resolved.
1387	jermar	1565	*/
		1566	for (i = 1; i < leaf->keys; i++) {
		1567	if (page < leaf->key[i]) {
2087	jermar	1568	uintptr_t left_pg = leaf->key[i - 1];
		1569	uintptr_t right_pg = leaf->key[i];
		1570	count_t left_cnt = (count_t) leaf->value[i - 1];
		1571	count_t right_cnt = (count_t) leaf->value[i];
1387	jermar	1572
		1573	/*
		1574	* The interval fits between left_pg and right_pg.
		1575	*/
		1576
2087	jermar	1577	if (overlaps(page, count * PAGE_SIZE, left_pg,
		1578	left_cnt * PAGE_SIZE)) {
		1579	/*
		1580	* The interval intersects with the left
		1581	* interval.
		1582	*/
1387	jermar	1583	return 0;
2087	jermar	1584	} else if (overlaps(page, count * PAGE_SIZE, right_pg,
		1585	right_cnt * PAGE_SIZE)) {
		1586	/*
		1587	* The interval intersects with the right
		1588	* interval.
		1589	*/
1387	jermar	1590	return 0;
2087	jermar	1591	} else if ((page == left_pg + left_cnt * PAGE_SIZE) &&
		1592	(page + count * PAGE_SIZE == right_pg)) {
		1593	/*
		1594	* The interval can be added by merging the two
		1595	* already present intervals.
		1596	*/
1403	jermar	1597	leaf->value[i - 1] += count + right_cnt;
1387	jermar	1598	btree_remove(&a->used_space, right_pg, leaf);
		1599	return 1;
2087	jermar	1600	} else if (page == left_pg + left_cnt * PAGE_SIZE) {
		1601	/*
		1602	* The interval can be added by simply growing
		1603	* the left interval.
		1604	*/
1403	jermar	1605	leaf->value[i - 1] += count;
1387	jermar	1606	return 1;
2087	jermar	1607	} else if (page + count * PAGE_SIZE == right_pg) {
1387	jermar	1608	/*
2087	jermar	1609	* The interval can be addded by simply moving
		1610	* base of the right interval down and
		1611	* increasing its size accordingly.
1387	jermar	1612	*/
1403	jermar	1613	leaf->value[i] += count;
1387	jermar	1614	leaf->key[i] = page;
		1615	return 1;
		1616	} else {
		1617	/*
2087	jermar	1618	* The interval is between both neigbouring
		1619	* intervals, but cannot be merged with any of
		1620	* them.
1387	jermar	1621	*/
2087	jermar	1622	btree_insert(&a->used_space, page,
		1623	(void *) count, leaf);
1387	jermar	1624	return 1;
		1625	}
		1626	}
		1627	}
		1628
3149	svoboda	1629	panic("Inconsistency detected while adding %" PRIc " pages of used space at "
2087	jermar	1630	"%p.\n", count, page);
1387	jermar	1631	}
		1632
		1633	/** Mark portion of address space area as unused.
		1634	*
		1635	* The address space area must be already locked.
		1636	*
		1637	* @param a Address space area.
		1638	* @param page First page to be marked.
		1639	* @param count Number of page to be marked.
		1640	*
		1641	* @return 0 on failure and 1 on success.
		1642	*/
1780	jermar	1643	int used_space_remove(as_area_t *a, uintptr_t page, count_t count)
1387	jermar	1644	{
		1645	btree_node_t leaf, node;
		1646	count_t pages;
2745	decky	1647	unsigned int i;
1387	jermar	1648
		1649	ASSERT(page == ALIGN_DOWN(page, PAGE_SIZE));
		1650	ASSERT(count);
		1651
		1652	pages = (count_t) btree_search(&a->used_space, page, &leaf);
		1653	if (pages) {
		1654	/*
		1655	* We are lucky, page is the beginning of some interval.
		1656	*/
		1657	if (count > pages) {
		1658	return 0;
		1659	} else if (count == pages) {
		1660	btree_remove(&a->used_space, page, leaf);
1403	jermar	1661	return 1;
1387	jermar	1662	} else {
		1663	/*
		1664	* Find the respective interval.
		1665	* Decrease its size and relocate its start address.
		1666	*/
		1667	for (i = 0; i < leaf->keys; i++) {
		1668	if (leaf->key[i] == page) {
2087	jermar	1669	leaf->key[i] += count * PAGE_SIZE;
1403	jermar	1670	leaf->value[i] -= count;
1387	jermar	1671	return 1;
		1672	}
		1673	}
		1674	goto error;
		1675	}
		1676	}
		1677
		1678	node = btree_leaf_node_left_neighbour(&a->used_space, leaf);
		1679	if (node && page < leaf->key[0]) {
1780	jermar	1680	uintptr_t left_pg = node->key[node->keys - 1];
1387	jermar	1681	count_t left_cnt = (count_t) node->value[node->keys - 1];
		1682
2087	jermar	1683	if (overlaps(left_pg, left_cnt * PAGE_SIZE, page,
		1684	count * PAGE_SIZE)) {
		1685	if (page + count * PAGE_SIZE ==
		1686	left_pg + left_cnt * PAGE_SIZE) {
1387	jermar	1687	/*
2087	jermar	1688	* The interval is contained in the rightmost
		1689	* interval of the left neighbour and can be
		1690	* removed by updating the size of the bigger
		1691	* interval.
1387	jermar	1692	*/
1403	jermar	1693	node->value[node->keys - 1] -= count;
1387	jermar	1694	return 1;
2087	jermar	1695	} else if (page + count * PAGE_SIZE <
		1696	left_pg + left_cnt*PAGE_SIZE) {
1403	jermar	1697	count_t new_cnt;
1387	jermar	1698
		1699	/*
2087	jermar	1700	* The interval is contained in the rightmost
		1701	* interval of the left neighbour but its
		1702	* removal requires both updating the size of
		1703	* the original interval and also inserting a
		1704	* new interval.
1387	jermar	1705	*/
2087	jermar	1706	new_cnt = ((left_pg + left_cnt * PAGE_SIZE) -
		1707	(page + count*PAGE_SIZE)) >> PAGE_WIDTH;
1403	jermar	1708	node->value[node->keys - 1] -= count + new_cnt;
2087	jermar	1709	btree_insert(&a->used_space, page +
		1710	count * PAGE_SIZE, (void *) new_cnt, leaf);
1387	jermar	1711	return 1;
		1712	}
		1713	}
		1714	return 0;
		1715	} else if (page < leaf->key[0]) {
		1716	return 0;
		1717	}
		1718
		1719	if (page > leaf->key[leaf->keys - 1]) {
1780	jermar	1720	uintptr_t left_pg = leaf->key[leaf->keys - 1];
1387	jermar	1721	count_t left_cnt = (count_t) leaf->value[leaf->keys - 1];
		1722
2087	jermar	1723	if (overlaps(left_pg, left_cnt * PAGE_SIZE, page,
		1724	count * PAGE_SIZE)) {
		1725	if (page + count * PAGE_SIZE ==
		1726	left_pg + left_cnt * PAGE_SIZE) {
1387	jermar	1727	/*
2087	jermar	1728	* The interval is contained in the rightmost
		1729	* interval of the leaf and can be removed by
		1730	* updating the size of the bigger interval.
1387	jermar	1731	*/
1403	jermar	1732	leaf->value[leaf->keys - 1] -= count;
1387	jermar	1733	return 1;
2087	jermar	1734	} else if (page + count * PAGE_SIZE < left_pg +
		1735	left_cnt * PAGE_SIZE) {
1403	jermar	1736	count_t new_cnt;
1387	jermar	1737
		1738	/*
2087	jermar	1739	* The interval is contained in the rightmost
		1740	* interval of the leaf but its removal
		1741	* requires both updating the size of the
		1742	* original interval and also inserting a new
		1743	* interval.
1387	jermar	1744	*/
2087	jermar	1745	new_cnt = ((left_pg + left_cnt * PAGE_SIZE) -
		1746	(page + count * PAGE_SIZE)) >> PAGE_WIDTH;
1403	jermar	1747	leaf->value[leaf->keys - 1] -= count + new_cnt;
2087	jermar	1748	btree_insert(&a->used_space, page +
		1749	count * PAGE_SIZE, (void *) new_cnt, leaf);
1387	jermar	1750	return 1;
		1751	}
		1752	}
		1753	return 0;
		1754	}
		1755
		1756	/*
		1757	* The border cases have been already resolved.
		1758	* Now the interval can be only between intervals of the leaf.
		1759	*/
		1760	for (i = 1; i < leaf->keys - 1; i++) {
		1761	if (page < leaf->key[i]) {
1780	jermar	1762	uintptr_t left_pg = leaf->key[i - 1];
1387	jermar	1763	count_t left_cnt = (count_t) leaf->value[i - 1];
		1764
		1765	/*
2087	jermar	1766	* Now the interval is between intervals corresponding
		1767	* to (i - 1) and i.
1387	jermar	1768	*/
2087	jermar	1769	if (overlaps(left_pg, left_cnt * PAGE_SIZE, page,
		1770	count * PAGE_SIZE)) {
		1771	if (page + count * PAGE_SIZE ==
		1772	left_pg + left_cnt*PAGE_SIZE) {
1387	jermar	1773	/*
2087	jermar	1774	* The interval is contained in the
		1775	* interval (i - 1) of the leaf and can
		1776	* be removed by updating the size of
		1777	* the bigger interval.
1387	jermar	1778	*/
1403	jermar	1779	leaf->value[i - 1] -= count;
1387	jermar	1780	return 1;
2087	jermar	1781	} else if (page + count * PAGE_SIZE <
		1782	left_pg + left_cnt * PAGE_SIZE) {
1403	jermar	1783	count_t new_cnt;
1387	jermar	1784
		1785	/*
2087	jermar	1786	* The interval is contained in the
		1787	* interval (i - 1) of the leaf but its
		1788	* removal requires both updating the
		1789	* size of the original interval and
1387	jermar	1790	* also inserting a new interval.
		1791	*/
2087	jermar	1792	new_cnt = ((left_pg +
		1793	left_cnt * PAGE_SIZE) -
		1794	(page + count * PAGE_SIZE)) >>
		1795	PAGE_WIDTH;
1403	jermar	1796	leaf->value[i - 1] -= count + new_cnt;
2087	jermar	1797	btree_insert(&a->used_space, page +
		1798	count * PAGE_SIZE, (void *) new_cnt,
		1799	leaf);
1387	jermar	1800	return 1;
		1801	}
		1802	}
		1803	return 0;
		1804	}
		1805	}
		1806
		1807	error:
3149	svoboda	1808	panic("Inconsistency detected while removing %" PRIc " pages of used space "
2087	jermar	1809	"from %p.\n", count, page);
1387	jermar	1810	}
		1811
1409	jermar	1812	/** Remove reference to address space area share info.
		1813	*
		1814	* If the reference count drops to 0, the sh_info is deallocated.
		1815	*
		1816	* @param sh_info Pointer to address space area share info.
		1817	*/
		1818	void sh_info_remove_reference(share_info_t *sh_info)
		1819	{
		1820	bool dealloc = false;
		1821
		1822	mutex_lock(&sh_info->lock);
		1823	ASSERT(sh_info->refcount);
		1824	if (--sh_info->refcount == 0) {
		1825	dealloc = true;
1495	jermar	1826	link_t *cur;
1409	jermar	1827
		1828	/*
		1829	* Now walk carefully the pagemap B+tree and free/remove
		1830	* reference from all frames found there.
		1831	*/
2087	jermar	1832	for (cur = sh_info->pagemap.leaf_head.next;
		1833	cur != &sh_info->pagemap.leaf_head; cur = cur->next) {
1409	jermar	1834	btree_node_t *node;
2745	decky	1835	unsigned int i;
1409	jermar	1836
1495	jermar	1837	node = list_get_instance(cur, btree_node_t, leaf_link);
		1838	for (i = 0; i < node->keys; i++)
1780	jermar	1839	frame_free((uintptr_t) node->value[i]);
1409	jermar	1840	}
		1841
		1842	}
		1843	mutex_unlock(&sh_info->lock);
		1844
		1845	if (dealloc) {
		1846	btree_destroy(&sh_info->pagemap);
		1847	free(sh_info);
		1848	}
		1849	}
		1850
1235	jermar	1851	/*
		1852	* Address space related syscalls.
		1853	*/
		1854
		1855	/** Wrapper for as_area_create(). */
1780	jermar	1856	unative_t sys_as_area_create(uintptr_t address, size_t size, int flags)
1235	jermar	1857	{
2087	jermar	1858	if (as_area_create(AS, flags \| AS_AREA_CACHEABLE, size, address,
		1859	AS_AREA_ATTR_NONE, &anon_backend, NULL))
1780	jermar	1860	return (unative_t) address;
1235	jermar	1861	else
1780	jermar	1862	return (unative_t) -1;
1235	jermar	1863	}
		1864
1793	jermar	1865	/** Wrapper for as_area_resize(). */
1780	jermar	1866	unative_t sys_as_area_resize(uintptr_t address, size_t size, int flags)
1235	jermar	1867	{
1780	jermar	1868	return (unative_t) as_area_resize(AS, address, size, 0);
1235	jermar	1869	}
		1870
2984	svoboda	1871	/** Wrapper for as_area_change_flags(). */
		1872	unative_t sys_as_area_change_flags(uintptr_t address, int flags)
		1873	{
		1874	return (unative_t) as_area_change_flags(AS, flags, address);
		1875	}
		1876
1793	jermar	1877	/** Wrapper for as_area_destroy(). */
1780	jermar	1878	unative_t sys_as_area_destroy(uintptr_t address)
1306	jermar	1879	{
1780	jermar	1880	return (unative_t) as_area_destroy(AS, address);
1306	jermar	1881	}
1702	cejka	1882
1914	jermar	1883	/** Print out information about address space.
		1884	*
		1885	* @param as Address space.
		1886	*/
		1887	void as_print(as_t *as)
		1888	{
		1889	ipl_t ipl;
		1890
		1891	ipl = interrupts_disable();
		1892	mutex_lock(&as->lock);
		1893
		1894	/* print out info about address space areas */
		1895	link_t *cur;
2087	jermar	1896	for (cur = as->as_area_btree.leaf_head.next;
		1897	cur != &as->as_area_btree.leaf_head; cur = cur->next) {
		1898	btree_node_t *node;
1914	jermar	1899
2087	jermar	1900	node = list_get_instance(cur, btree_node_t, leaf_link);
		1901
2745	decky	1902	unsigned int i;
1914	jermar	1903	for (i = 0; i < node->keys; i++) {
1915	jermar	1904	as_area_t *area = node->value[i];
1914	jermar	1905
		1906	mutex_lock(&area->lock);
3149	svoboda	1907	printf("as_area: %p, base=%p, pages=%" PRIc " (%p - %p)\n",
2087	jermar	1908	area, area->base, area->pages, area->base,
3149	svoboda	1909	area->base + FRAMES2SIZE(area->pages));
1914	jermar	1910	mutex_unlock(&area->lock);
		1911	}
		1912	}
		1913
		1914	mutex_unlock(&as->lock);
		1915	interrupts_restore(ipl);
		1916	}
		1917
1757	jermar	1918	/** @}
1702	cejka	1919	*/

Subversion Repositories HelenOS

(root)/branches/dynload/kernel/generic/src/mm/as.c – Rev 3153