Rev 2479 | Rev 3222 | Go to most recent revision | Only display areas with differences | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed
Rev 2479 | Rev 2541 | ||
---|---|---|---|
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 <sys/types.h> |
40 | #include <bitops.h> |
40 | #include <bitops.h> |
41 | 41 | ||
42 | /** |
42 | /** |
43 | * Either 4*256M on 32-bit architecures or 16*256M on 64-bit architectures. |
43 | * Either 4*256M on 32-bit architecures or 16*256M 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, |
72 | return __SYSCALL3(SYS_AS_AREA_RESIZE, (sysarg_t ) address, |
73 | (sysarg_t) size, (sysarg_t) flags); |
73 | (sysarg_t) 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 | * |
146 | * |
147 | * @return Pointer to the beginning |
147 | * @return Pointer to the beginning |
148 | * |
148 | * |
149 | * TODO: make some first_fit/... algorithm, we are now just incrementing |
149 | * TODO: make some first_fit/... algorithm, we are now just incrementing |
150 | * the pointer to last area |
150 | * the pointer to last area |
151 | */ |
151 | */ |
152 | void *as_get_mappable_page(size_t sz) |
152 | void *as_get_mappable_page(size_t sz) |
153 | { |
153 | { |
154 | void *res; |
154 | void *res; |
155 | uint64_t asz; |
155 | uint64_t asz; |
156 | int i; |
156 | int i; |
157 | 157 | ||
158 | if (!sz) |
158 | if (!sz) |
159 | return NULL; |
159 | return NULL; |
160 | 160 | ||
161 | asz = 1 << (fnzb64(sz - 1) + 1); |
161 | asz = 1 << (fnzb64(sz - 1) + 1); |
162 | 162 | ||
163 | /* Set heapsize to some meaningful value */ |
163 | /* Set heapsize to some meaningful value */ |
164 | if (maxheapsize == -1) |
164 | if (maxheapsize == -1) |
165 | set_maxheapsize(MAX_HEAP_SIZE); |
165 | set_maxheapsize(MAX_HEAP_SIZE); |
166 | 166 | ||
167 | /* |
167 | /* |
168 | * Make sure we allocate from naturally aligned address. |
168 | * Make sure we allocate from naturally aligned address. |
169 | */ |
169 | */ |
170 | i = 0; |
170 | i = 0; |
171 | if (!last_allocated) { |
171 | if (!last_allocated) { |
172 | last_allocated = (void *) ALIGN_UP((void *) &_heap + |
172 | last_allocated = (void *) ALIGN_UP((void *) &_heap + |
173 | maxheapsize, asz); |
173 | maxheapsize, asz); |
174 | } else { |
174 | } else { |
175 | last_allocated = (void *) ALIGN_UP(((uintptr_t) |
175 | last_allocated = (void *) ALIGN_UP(((uintptr_t) |
176 | last_allocated) + (int) (i > 0), asz); |
176 | last_allocated) + (int) (i > 0), asz); |
177 | } |
177 | } |
178 | 178 | ||
179 | res = last_allocated; |
179 | res = last_allocated; |
180 | last_allocated += ALIGN_UP(sz, PAGE_SIZE); |
180 | last_allocated += ALIGN_UP(sz, PAGE_SIZE); |
181 | 181 | ||
182 | return res; |
182 | return res; |
183 | } |
183 | } |
184 | 184 | ||
185 | /** @} |
185 | /** @} |
186 | */ |
186 | */ |
187 | 187 |