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>
#include <bitops.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
 *
 * @param sz Requested size of the allocation.
 * @param color Requested virtual color of the allocation.
 *
 * @return Pointer to the beginning
 *
 * TODO: make some first_fit/... algorithm, we are now just incrementing
 *       the pointer to last area
 */
#include <stdio.h>
void *as_get_mappable_page(size_t sz, int color)
{
    void *res;
    uint64_t asz;
    int i;
   
    if (!sz)
        return NULL;   
 
    asz = 1 << (fnzb64(sz - 1) + 1);
 
    /* Set heapsize to some meaningful value */
    if (maxheapsize == -1)
        set_maxheapsize(MAX_HEAP_SIZE);
   
    /*
     * Make sure we allocate from naturally aligned address and a page of
     * appropriate color.
     */
    i = 0;
    do {
        if (!last_allocated) {
            last_allocated = (void *) ALIGN_UP((void *) &_heap +
                maxheapsize, asz);
        } else {
            last_allocated = (void *) ALIGN_UP(((uintptr_t)
                last_allocated) + (int) (i > 0), asz);
        }
    } while ((asz < (1 << (PAGE_COLOR_BITS + PAGE_WIDTH))) &&
        (PAGE_COLOR((uintptr_t) last_allocated) != color) &&
        (++i < (1 << PAGE_COLOR_BITS)));
 
    res = last_allocated;
    last_allocated += ALIGN_UP(sz, PAGE_SIZE);
 
    return res;
}
 
/** @}
 */
 

Subversion Repositories HelenOS

(root)/trunk/uspace/libc/generic/as.c – Rev 2015 → 2071

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