/[pcre]/code/trunk/sljit/sljitUtils.c
ViewVC logotype

Contents of /code/trunk/sljit/sljitUtils.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1175 - (show annotations)
Fri Oct 26 04:47:29 2012 UTC (6 years, 10 months ago) by zherczeg
File MIME type: text/plain
File size: 8120 byte(s)
JIT compiler update.
1 /*
2 * Stack-less Just-In-Time compiler
3 *
4 * Copyright 2009-2012 Zoltan Herczeg (hzmester@freemail.hu). All rights reserved.
5 *
6 * Redistribution and use in source and binary forms, with or without modification, are
7 * permitted provided that the following conditions are met:
8 *
9 * 1. Redistributions of source code must retain the above copyright notice, this list of
10 * conditions and the following disclaimer.
11 *
12 * 2. Redistributions in binary form must reproduce the above copyright notice, this list
13 * of conditions and the following disclaimer in the documentation and/or other materials
14 * provided with the distribution.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDER(S) AND CONTRIBUTORS ``AS IS'' AND ANY
17 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
19 * SHALL THE COPYRIGHT HOLDER(S) OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
21 * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
22 * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
23 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
24 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27 /* ------------------------------------------------------------------------ */
28 /* Locks */
29 /* ------------------------------------------------------------------------ */
30
31 #if (defined SLJIT_EXECUTABLE_ALLOCATOR && SLJIT_EXECUTABLE_ALLOCATOR) || (defined SLJIT_UTIL_GLOBAL_LOCK && SLJIT_UTIL_GLOBAL_LOCK)
32
33 #if (defined SLJIT_SINGLE_THREADED && SLJIT_SINGLE_THREADED)
34
35 #if (defined SLJIT_EXECUTABLE_ALLOCATOR && SLJIT_EXECUTABLE_ALLOCATOR)
36
37 static SLJIT_INLINE void allocator_grab_lock(void)
38 {
39 /* Always successful. */
40 }
41
42 static SLJIT_INLINE void allocator_release_lock(void)
43 {
44 /* Always successful. */
45 }
46
47 #endif /* SLJIT_EXECUTABLE_ALLOCATOR */
48
49 #if (defined SLJIT_UTIL_GLOBAL_LOCK && SLJIT_UTIL_GLOBAL_LOCK)
50
51 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_grab_lock(void)
52 {
53 /* Always successful. */
54 }
55
56 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_release_lock(void)
57 {
58 /* Always successful. */
59 }
60
61 #endif /* SLJIT_UTIL_GLOBAL_LOCK */
62
63 #elif defined(_WIN32) /* SLJIT_SINGLE_THREADED */
64
65 #include "windows.h"
66
67 #if (defined SLJIT_EXECUTABLE_ALLOCATOR && SLJIT_EXECUTABLE_ALLOCATOR)
68
69 static HANDLE allocator_mutex = 0;
70
71 static SLJIT_INLINE void allocator_grab_lock(void)
72 {
73 /* No idea what to do if an error occures. Static mutexes should never fail... */
74 if (!allocator_mutex)
75 allocator_mutex = CreateMutex(NULL, TRUE, NULL);
76 else
77 WaitForSingleObject(allocator_mutex, INFINITE);
78 }
79
80 static SLJIT_INLINE void allocator_release_lock(void)
81 {
82 ReleaseMutex(allocator_mutex);
83 }
84
85 #endif /* SLJIT_EXECUTABLE_ALLOCATOR */
86
87 #if (defined SLJIT_UTIL_GLOBAL_LOCK && SLJIT_UTIL_GLOBAL_LOCK)
88
89 static HANDLE global_mutex = 0;
90
91 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_grab_lock(void)
92 {
93 /* No idea what to do if an error occures. Static mutexes should never fail... */
94 if (!global_mutex)
95 global_mutex = CreateMutex(NULL, TRUE, NULL);
96 else
97 WaitForSingleObject(global_mutex, INFINITE);
98 }
99
100 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_release_lock(void)
101 {
102 ReleaseMutex(global_mutex);
103 }
104
105 #endif /* SLJIT_UTIL_GLOBAL_LOCK */
106
107 #else /* _WIN32 */
108
109 #if (defined SLJIT_EXECUTABLE_ALLOCATOR && SLJIT_EXECUTABLE_ALLOCATOR)
110
111 #include <pthread.h>
112
113 static pthread_mutex_t allocator_mutex = PTHREAD_MUTEX_INITIALIZER;
114
115 static SLJIT_INLINE void allocator_grab_lock(void)
116 {
117 pthread_mutex_lock(&allocator_mutex);
118 }
119
120 static SLJIT_INLINE void allocator_release_lock(void)
121 {
122 pthread_mutex_unlock(&allocator_mutex);
123 }
124
125 #endif /* SLJIT_EXECUTABLE_ALLOCATOR */
126
127 #if (defined SLJIT_UTIL_GLOBAL_LOCK && SLJIT_UTIL_GLOBAL_LOCK)
128
129 #include <pthread.h>
130
131 static pthread_mutex_t global_mutex = PTHREAD_MUTEX_INITIALIZER;
132
133 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_grab_lock(void)
134 {
135 pthread_mutex_lock(&global_mutex);
136 }
137
138 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_release_lock(void)
139 {
140 pthread_mutex_unlock(&global_mutex);
141 }
142
143 #endif /* SLJIT_UTIL_GLOBAL_LOCK */
144
145 #endif /* _WIN32 */
146
147 /* ------------------------------------------------------------------------ */
148 /* Stack */
149 /* ------------------------------------------------------------------------ */
150
151 #if (defined SLJIT_UTIL_STACK && SLJIT_UTIL_STACK)
152
153 #ifdef _WIN32
154 #include "windows.h"
155 #else
156 #include <sys/mman.h>
157 #include <unistd.h>
158 #endif
159
160 /* Planning to make it even more clever in the future. */
161 static sljit_w sljit_page_align = 0;
162
163 SLJIT_API_FUNC_ATTRIBUTE struct sljit_stack* SLJIT_CALL sljit_allocate_stack(sljit_uw limit, sljit_uw max_limit)
164 {
165 struct sljit_stack *stack;
166 union {
167 void *ptr;
168 sljit_uw uw;
169 } base;
170 #ifdef _WIN32
171 SYSTEM_INFO si;
172 #endif
173
174 if (limit > max_limit || limit < 1)
175 return NULL;
176
177 #ifdef _WIN32
178 if (!sljit_page_align) {
179 GetSystemInfo(&si);
180 sljit_page_align = si.dwPageSize - 1;
181 }
182 #else
183 if (!sljit_page_align) {
184 sljit_page_align = sysconf(_SC_PAGESIZE);
185 /* Should never happen. */
186 if (sljit_page_align < 0)
187 sljit_page_align = 4096;
188 sljit_page_align--;
189 }
190 #endif
191
192 /* Align limit and max_limit. */
193 max_limit = (max_limit + sljit_page_align) & ~sljit_page_align;
194
195 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack));
196 if (!stack)
197 return NULL;
198
199 #ifdef _WIN32
200 base.ptr = VirtualAlloc(0, max_limit, MEM_RESERVE, PAGE_READWRITE);
201 if (!base.ptr) {
202 SLJIT_FREE(stack);
203 return NULL;
204 }
205 stack->base = base.uw;
206 stack->limit = stack->base;
207 stack->max_limit = stack->base + max_limit;
208 if (sljit_stack_resize(stack, stack->base + limit)) {
209 sljit_free_stack(stack);
210 return NULL;
211 }
212 #else
213 base.ptr = mmap(0, max_limit, PROT_READ | PROT_WRITE, MAP_PRIVATE | MAP_ANON, -1, 0);
214 if (base.ptr == MAP_FAILED) {
215 SLJIT_FREE(stack);
216 return NULL;
217 }
218 stack->base = base.uw;
219 stack->limit = stack->base + limit;
220 stack->max_limit = stack->base + max_limit;
221 #endif
222 stack->top = stack->base;
223 return stack;
224 }
225
226 #undef PAGE_ALIGN
227
228 SLJIT_API_FUNC_ATTRIBUTE void SLJIT_CALL sljit_free_stack(struct sljit_stack* stack)
229 {
230 #ifdef _WIN32
231 VirtualFree((void*)stack->base, 0, MEM_RELEASE);
232 #else
233 munmap((void*)stack->base, stack->max_limit - stack->base);
234 #endif
235 SLJIT_FREE(stack);
236 }
237
238 SLJIT_API_FUNC_ATTRIBUTE sljit_w SLJIT_CALL sljit_stack_resize(struct sljit_stack* stack, sljit_uw new_limit)
239 {
240 sljit_uw aligned_old_limit;
241 sljit_uw aligned_new_limit;
242
243 if ((new_limit > stack->max_limit) || (new_limit < stack->base))
244 return -1;
245 #ifdef _WIN32
246 aligned_new_limit = (new_limit + sljit_page_align) & ~sljit_page_align;
247 aligned_old_limit = (stack->limit + sljit_page_align) & ~sljit_page_align;
248 if (aligned_new_limit != aligned_old_limit) {
249 if (aligned_new_limit > aligned_old_limit) {
250 if (!VirtualAlloc((void*)aligned_old_limit, aligned_new_limit - aligned_old_limit, MEM_COMMIT, PAGE_READWRITE))
251 return -1;
252 }
253 else {
254 if (!VirtualFree((void*)aligned_new_limit, aligned_old_limit - aligned_new_limit, MEM_DECOMMIT))
255 return -1;
256 }
257 }
258 stack->limit = new_limit;
259 return 0;
260 #else
261 if (new_limit >= stack->limit) {
262 stack->limit = new_limit;
263 return 0;
264 }
265 aligned_new_limit = (new_limit + sljit_page_align) & ~sljit_page_align;
266 aligned_old_limit = (stack->limit + sljit_page_align) & ~sljit_page_align;
267 /* If madvise is available, we release the unnecessary space. */
268 #if defined(POSIX_MADV_DONTNEED)
269 if (aligned_new_limit < aligned_old_limit)
270 posix_madvise((void*)aligned_new_limit, aligned_old_limit - aligned_new_limit, POSIX_MADV_DONTNEED);
271 #elif defined(MADV_DONTNEED)
272 if (aligned_new_limit < aligned_old_limit)
273 madvise((void*)aligned_new_limit, aligned_old_limit - aligned_new_limit, MADV_DONTNEED);
274 #endif
275 stack->limit = new_limit;
276 return 0;
277 #endif
278 }
279
280 #endif /* SLJIT_UTIL_STACK */
281
282 #endif

  ViewVC Help
Powered by ViewVC 1.1.5