WebSVN – HelenOS-historic – Diff – /uspace/trunk/libc/generic/as.c


/*
 * Copyright (C) 2006 Jakub Jermar
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * - Redistributions of source code must retain the above copyright
 *   notice, this list of conditions and the following disclaimer.
 * - Redistributions in binary form must reproduce the above copyright
 *   notice, this list of conditions and the following disclaimer in the
 *   documentation and/or other materials provided with the distribution.
 * - The name of the author may not be used to endorse or promote products
 *   derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
/** @addtogroup libc
 * @{
 */
/** @file
 */
 
#include <as.h>
#include <libc.h>
#include <unistd.h>
#include <align.h>
 
/** Create address space area.
 *
 * @param address Virtual address where to place new address space area.
 * @param size Size of the area.
 * @param flags Flags describing type of the area.
 *
 * @return address on success, (void *) -1 otherwise.
 */
void *as_area_create(void *address, size_t size, int flags)
{
    return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
}
 
/** Resize address space area.
 *
 * @param address Virtual address pointing into already existing address space area.
 * @param size New requested size of the area.
 * @param flags Currently unused.
 *
 * @return Zero on success or a code from @ref errno.h on failure.
 */
int as_area_resize(void *address, size_t size, int flags)
{
    return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
}
 
/** Destroy address space area.
 *
 * @param address Virtual address pointing into the address space area being destroyed.
 *
 * @return Zero on success or a code from @ref errno.h on failure.
 */
int as_area_destroy(void *address)
{
    return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
}
 
static size_t heapsize = 0;
static size_t maxheapsize = (size_t) (-1);
 
static void * last_allocated = 0;
 
/* Start of heap linker symbol */
extern char _heap;
 
/** Sbrk emulation
 *
 * @param incr New area that should be allocated or negative,
               if it should be shrinked
 * @return Pointer to newly allocated area
 */
void *sbrk(ssize_t incr)
{
    int rc;
    void *res;
   
    /* Check for invalid values */
    if (incr < 0 && -incr > heapsize)
        return NULL;
   
    /* Check for too large value */
    if (incr > 0 && incr+heapsize < heapsize)
        return NULL;
   
    /* Check for too small values */
    if (incr < 0 && incr+heapsize > heapsize)
        return NULL;
   
    /* Check for user limit */
    if ((maxheapsize != (size_t) (-1)) && (heapsize + incr) > maxheapsize)
        return NULL;
   
    rc = as_area_resize(&_heap, heapsize + incr, 0);
    if (rc != 0)
        return NULL;
   
    /* Compute start of new area */
    res = (void *) &_heap + heapsize;
 
    heapsize += incr;
 
    return res;
}
 
/** Set maximum heap size and return pointer just after the heap */
void *set_maxheapsize(size_t mhs)
{
    maxheapsize = mhs;
    /* Return pointer to area not managed by sbrk */
    return ((void *) &_heap + maxheapsize);
 
}
 
/** Return pointer to some unmapped area, where fits new as_area
 *
 * TODO: make some first_fit/... algorithm, we are now just incrementing
 *       the pointer to last area
 */
void * as_get_mappable_page(size_t sz)
{
    void *res;
 
    /* Set heapsize to some meaningful value */
    if (maxheapsize == -1)
        set_maxheapsize(ALIGN_UP(USER_ADDRESS_SPACE_SIZE_ARCH >> 1, PAGE_SIZE));
   
    if (!last_allocated)
        last_allocated = (void *) ALIGN_UP((void *) &_heap + maxheapsize, PAGE_SIZE);
   
    sz = ALIGN_UP(sz, PAGE_SIZE);
    res = last_allocated;
    last_allocated += sz;
 
    return res;
}
 
 
/** @}
 */
 
 
 

Rev 1653	Rev 1719
1	/*	1	/*
2	* Copyright (C) 2006 Jakub Jermar	2	* Copyright (C) 2006 Jakub Jermar
3	* All rights reserved.	3	* All rights reserved.
4	*	4	*
5	* Redistribution and use in source and binary forms, with or without	5	* Redistribution and use in source and binary forms, with or without
6	* modification, are permitted provided that the following conditions	6	* modification, are permitted provided that the following conditions
7	* are met:	7	* are met:
8	*	8	*
9	* - Redistributions of source code must retain the above copyright	9	* - Redistributions of source code must retain the above copyright
10	* notice, this list of conditions and the following disclaimer.	10	* notice, this list of conditions and the following disclaimer.
11	* - Redistributions in binary form must reproduce the above copyright	11	* - Redistributions in binary form must reproduce the above copyright
12	* notice, this list of conditions and the following disclaimer in the	12	* notice, this list of conditions and the following disclaimer in the
13	* documentation and/or other materials provided with the distribution.	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	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.	15	* derived from this software without specific prior written permission.
16	*	16	*
17	* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR	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	18	* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.	19	* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,	20	* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT	21	* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,	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	23	* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24	* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT	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	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.	26	* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27	*/	27	*/
28		28
29	/** @addtogroup libc	29	/** @addtogroup libc
30	* @{	30	* @{
31	*/	31	*/
32	/** @file	32	/** @file
33	*/	33	*/
34		34
35	#include <as.h>	35	#include <as.h>
36	#include <libc.h>	36	#include <libc.h>
37	#include <unistd.h>	37	#include <unistd.h>
38	#include <align.h>	38	#include <align.h>
39		39
40	/** Create address space area.	40	/** Create address space area.
41	*	41	*
42	* @param address Virtual address where to place new address space area.	42	* @param address Virtual address where to place new address space area.
43	* @param size Size of the area.	43	* @param size Size of the area.
44	* @param flags Flags describing type of the area.	44	* @param flags Flags describing type of the area.
45	*	45	*
46	* @return address on success, (void *) -1 otherwise.	46	* @return address on success, (void *) -1 otherwise.
47	*/	47	*/
48	void as_area_create(void address, size_t size, int flags)	48	void as_area_create(void address, size_t size, int flags)
49	{	49	{
50	return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);	50	return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
51	}	51	}
52		52
53	/** Resize address space area.	53	/** Resize address space area.
54	*	54	*
55	* @param address Virtual address pointing into already existing address space area.	55	* @param address Virtual address pointing into already existing address space area.
56	* @param size New requested size of the area.	56	* @param size New requested size of the area.
57	* @param flags Currently unused.	57	* @param flags Currently unused.
58	*	58	*
59	* @return Zero on success or a code from @ref errno.h on failure.	59	* @return Zero on success or a code from @ref errno.h on failure.
60	*/	60	*/
61	int as_area_resize(void *address, size_t size, int flags)	61	int as_area_resize(void *address, size_t size, int flags)
62	{	62	{
63	return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);	63	return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
64	}	64	}
65		65
66	/** Destroy address space area.	66	/** Destroy address space area.
67	*	67	*
68	* @param address Virtual address pointing into the address space area being destroyed.	68	* @param address Virtual address pointing into the address space area being destroyed.
69	*	69	*
70	* @return Zero on success or a code from @ref errno.h on failure.	70	* @return Zero on success or a code from @ref errno.h on failure.
71	*/	71	*/
72	int as_area_destroy(void *address)	72	int as_area_destroy(void *address)
73	{	73	{
74	return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);	74	return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
75	}	75	}
76		76
77	static size_t heapsize = 0;	77	static size_t heapsize = 0;
78	static size_t maxheapsize = (size_t)(-1);	78	static size_t maxheapsize = (size_t) (-1);
79		79
80	static void * last_allocated = 0;	80	static void * last_allocated = 0;
81		81
82	/* Start of heap linker symbol */	82	/* Start of heap linker symbol */
83	extern char _heap;	83	extern char _heap;
84		84
85	/** Sbrk emulation	85	/** Sbrk emulation
86	*	86	*
87	* @param incr New area that should be allocated or negative,	87	* @param incr New area that should be allocated or negative,
88	if it should be shrinked	88	if it should be shrinked
89	* @return Pointer to newly allocated area	89	* @return Pointer to newly allocated area
90	*/	90	*/
91	void *sbrk(ssize_t incr)	91	void *sbrk(ssize_t incr)
92	{	92	{
93	int rc;	93	int rc;
94	void *res;	94	void *res;
-		95
95	/* Check for invalid values */	96	/* Check for invalid values */
96	if (incr < 0 && -incr > heapsize)	97	if (incr < 0 && -incr > heapsize)
97	return NULL;	98	return NULL;
-		99
98	/* Check for too large value */	100	/* Check for too large value */
99	if (incr > 0 && incr+heapsize < heapsize)	101	if (incr > 0 && incr+heapsize < heapsize)
100	return NULL;	102	return NULL;
-		103
101	/* Check for too small values */	104	/* Check for too small values */
102	if (incr < 0 && incr+heapsize > heapsize)	105	if (incr < 0 && incr+heapsize > heapsize)
103	return NULL;	106	return NULL;
-		107
104	/* Check for user limit */	108	/* Check for user limit */
105	if ((maxheapsize!=(size_t)(-1)) && (heapsize + incr)>maxheapsize) return NULL;	109	if ((maxheapsize != (size_t) (-1)) && (heapsize + incr) > maxheapsize)
-		110	return NULL;
106		111
107	rc = as_area_resize(&_heap, heapsize + incr,0);	112	rc = as_area_resize(&_heap, heapsize + incr, 0);
108	if (rc != 0)	113	if (rc != 0)
109	return NULL;	114	return NULL;
110		115
111	/* Compute start of new area */	116	/* Compute start of new area */
112	res = (void *)&_heap + heapsize;	117	res = (void *) &_heap + heapsize;
113		118
114	heapsize += incr;	119	heapsize += incr;
115		120
116	return res;	121	return res;
117	}	122	}
118		123
119	/** Set maximum heap size and return pointer just after the heap */	124	/** Set maximum heap size and return pointer just after the heap */
120	void *set_maxheapsize(size_t mhs)	125	void *set_maxheapsize(size_t mhs)
121	{	126	{
122	maxheapsize=mhs;	127	maxheapsize = mhs;
123	/* Return pointer to area not managed by sbrk */	128	/* Return pointer to area not managed by sbrk */
124	return (void *)&_heap + maxheapsize;	129	return ((void *) &_heap + maxheapsize);
125		130
126	}	131	}
127		132
128	/** Return pointer to some unmapped area, where fits new as_area	133	/** Return pointer to some unmapped area, where fits new as_area
129	*	134	*
130	* TODO: make some first_fit/... algorithm, we are now just incrementing	135	* TODO: make some first_fit/... algorithm, we are now just incrementing
131	* the pointer to last area	136	* the pointer to last area
132	*/	137	*/
133	void * as_get_mappable_page(size_t sz)	138	void * as_get_mappable_page(size_t sz)
134	{	139	{
135	void *res;	140	void *res;
136		141
137	/* Set heapsize to some meaningful value */	142	/* Set heapsize to some meaningful value */
138	if (maxheapsize == -1)	143	if (maxheapsize == -1)
139	set_maxheapsize(ALIGN_UP(USER_ADDRESS_SPACE_SIZE_ARCH>>1,PAGE_SIZE));	144	set_maxheapsize(ALIGN_UP(USER_ADDRESS_SPACE_SIZE_ARCH >> 1, PAGE_SIZE));
-		145
140	if (!last_allocated)	146	if (!last_allocated)
141	last_allocated = ALIGN_UP((void *)&_heap + maxheapsize, PAGE_SIZE);	147	last_allocated = (void ) ALIGN_UP((void ) &_heap + maxheapsize, PAGE_SIZE);
142		148
143	sz = ALIGN_UP(sz, PAGE_SIZE);	149	sz = ALIGN_UP(sz, PAGE_SIZE);
144	res = last_allocated;	150	res = last_allocated;
145	last_allocated += sz;	151	last_allocated += sz;
146		152
147	return res;	153	return res;
148	}	154	}
149		155
150		-
151	/** @}	156	/** @}
152	*/	157	*/
153		-
154		-
155		158

Subversion Repositories HelenOS-historic

(root)/uspace/trunk/libc/generic/as.c – Rev 1653 → 1719