WebSVN – HelenOS – Diff – /trunk/uspace/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>
#include <types.h>
 
/**
 * Either 4*256M on 32-bit architecures or 16*256M on 64-bit architectures.
 */
#define MAX_HEAP_SIZE   (sizeof(uintptr_t)<<28)
 
/** 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(MAX_HEAP_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;
}
 
/** @}
 */
 

Subversion Repositories HelenOS

(root)/trunk/uspace/libc/generic/as.c – Rev 1787 → 1868

Rev 1787		Rev 1868
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	#include <types.h>
-		40
-		41	/**
-		42	* Either 4256M on 32-bit architecures or 16256M on 64-bit architectures.
-		43	*/
-		44	#define MAX_HEAP_SIZE (sizeof(uintptr_t)<<28)
39		45
40	/** Create address space area.	46	/** Create address space area.
41	*	47	*
42	* @param address Virtual address where to place new address space area.	48	* @param address Virtual address where to place new address space area.
43	* @param size Size of the area.	49	* @param size Size of the area.
44	* @param flags Flags describing type of the area.	50	* @param flags Flags describing type of the area.
45	*	51	*
46	* @return address on success, (void *) -1 otherwise.	52	* @return address on success, (void *) -1 otherwise.
47	*/	53	*/
48	void as_area_create(void address, size_t size, int flags)	54	void as_area_create(void address, size_t size, int flags)
49	{	55	{
50	return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);	56	return (void *) __SYSCALL3(SYS_AS_AREA_CREATE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
51	}	57	}
52		58
53	/** Resize address space area.	59	/** Resize address space area.
54	*	60	*
55	* @param address Virtual address pointing into already existing address space area.	61	* @param address Virtual address pointing into already existing address space area.
56	* @param size New requested size of the area.	62	* @param size New requested size of the area.
57	* @param flags Currently unused.	63	* @param flags Currently unused.
58	*	64	*
59	* @return Zero on success or a code from @ref errno.h on failure.	65	* @return Zero on success or a code from @ref errno.h on failure.
60	*/	66	*/
61	int as_area_resize(void *address, size_t size, int flags)	67	int as_area_resize(void *address, size_t size, int flags)
62	{	68	{
63	return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);	69	return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, (sysarg_t) size, (sysarg_t) flags);
64	}	70	}
65		71
66	/** Destroy address space area.	72	/** Destroy address space area.
67	*	73	*
68	* @param address Virtual address pointing into the address space area being destroyed.	74	* @param address Virtual address pointing into the address space area being destroyed.
69	*	75	*
70	* @return Zero on success or a code from @ref errno.h on failure.	76	* @return Zero on success or a code from @ref errno.h on failure.
71	*/	77	*/
72	int as_area_destroy(void *address)	78	int as_area_destroy(void *address)
73	{	79	{
74	return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);	80	return __SYSCALL1(SYS_AS_AREA_DESTROY, (sysarg_t ) address);
75	}	81	}
76		82
77	static size_t heapsize = 0;	83	static size_t heapsize = 0;
78	static size_t maxheapsize = (size_t) (-1);	84	static size_t maxheapsize = (size_t) (-1);
79		85
80	static void * last_allocated = 0;	86	static void * last_allocated = 0;
81		87
82	/* Start of heap linker symbol */	88	/* Start of heap linker symbol */
83	extern char _heap;	89	extern char _heap;
84		90
85	/** Sbrk emulation	91	/** Sbrk emulation
86	*	92	*
87	* @param incr New area that should be allocated or negative,	93	* @param incr New area that should be allocated or negative,
88	if it should be shrinked	94	if it should be shrinked
89	* @return Pointer to newly allocated area	95	* @return Pointer to newly allocated area
90	*/	96	*/
91	void *sbrk(ssize_t incr)	97	void *sbrk(ssize_t incr)
92	{	98	{
93	int rc;	99	int rc;
94	void *res;	100	void *res;
95		101
96	/* Check for invalid values */	102	/* Check for invalid values */
97	if (incr < 0 && -incr > heapsize)	103	if (incr < 0 && -incr > heapsize)
98	return NULL;	104	return NULL;
99		105
100	/* Check for too large value */	106	/* Check for too large value */
101	if (incr > 0 && incr+heapsize < heapsize)	107	if (incr > 0 && incr+heapsize < heapsize)
102	return NULL;	108	return NULL;
103		109
104	/* Check for too small values */	110	/* Check for too small values */
105	if (incr < 0 && incr+heapsize > heapsize)	111	if (incr < 0 && incr+heapsize > heapsize)
106	return NULL;	112	return NULL;
107		113
108	/* Check for user limit */	114	/* Check for user limit */
109	if ((maxheapsize != (size_t) (-1)) && (heapsize + incr) > maxheapsize)	115	if ((maxheapsize != (size_t) (-1)) && (heapsize + incr) > maxheapsize)
110	return NULL;	116	return NULL;
111		117
112	rc = as_area_resize(&_heap, heapsize + incr, 0);	118	rc = as_area_resize(&_heap, heapsize + incr, 0);
113	if (rc != 0)	119	if (rc != 0)
114	return NULL;	120	return NULL;
115		121
116	/* Compute start of new area */	122	/* Compute start of new area */
117	res = (void *) &_heap + heapsize;	123	res = (void *) &_heap + heapsize;
118		124
119	heapsize += incr;	125	heapsize += incr;
120		126
121	return res;	127	return res;
122	}	128	}
123		129
124	/** Set maximum heap size and return pointer just after the heap */	130	/** Set maximum heap size and return pointer just after the heap */
125	void *set_maxheapsize(size_t mhs)	131	void *set_maxheapsize(size_t mhs)
126	{	132	{
127	maxheapsize = mhs;	133	maxheapsize = mhs;
128	/* Return pointer to area not managed by sbrk */	134	/* Return pointer to area not managed by sbrk */
129	return ((void *) &_heap + maxheapsize);	135	return ((void *) &_heap + maxheapsize);
130		136
131	}	137	}
132		138
133	/** Return pointer to some unmapped area, where fits new as_area	139	/** Return pointer to some unmapped area, where fits new as_area
134	*	140	*
135	* TODO: make some first_fit/... algorithm, we are now just incrementing	141	* TODO: make some first_fit/... algorithm, we are now just incrementing
136	* the pointer to last area	142	* the pointer to last area
137	*/	143	*/
138	void * as_get_mappable_page(size_t sz)	144	void * as_get_mappable_page(size_t sz)
139	{	145	{
140	void *res;	146	void *res;
141		147
142	/* Set heapsize to some meaningful value */	148	/* Set heapsize to some meaningful value */
143	if (maxheapsize == -1)	149	if (maxheapsize == -1)
144	set_maxheapsize(ALIGN_UP(USER_ADDRESS_SPACE_SIZE_ARCH >> 1, PAGE_SIZE));	150	set_maxheapsize(MAX_HEAP_SIZE);
145		151
146	if (!last_allocated)	152	if (!last_allocated)
147	last_allocated = (void ) ALIGN_UP((void ) &_heap + maxheapsize, PAGE_SIZE);	153	last_allocated = (void ) ALIGN_UP((void ) &_heap + maxheapsize, PAGE_SIZE);
148		154
149	sz = ALIGN_UP(sz, PAGE_SIZE);	155	sz = ALIGN_UP(sz, PAGE_SIZE);
150	res = last_allocated;	156	res = last_allocated;
151	last_allocated += sz;	157	last_allocated += sz;
152		158
153	return res;	159	return res;
154	}	160	}
155		161
156	/** @}	162	/** @}
157	*/	163	*/
158		164