Commit | Line | Data |
---|---|---|
e9e23e23 | 1 | /* Heap management routines for GNU Emacs on the Microsoft W32 API. |
73b0cd50 | 2 | Copyright (C) 1994, 2001-2011 Free Software Foundation, Inc. |
95ed0025 | 3 | |
3b7ad313 | 4 | This file is part of GNU Emacs. |
95ed0025 | 5 | |
9ec0b715 | 6 | GNU Emacs is free software: you can redistribute it and/or modify |
3b7ad313 | 7 | it under the terms of the GNU General Public License as published by |
9ec0b715 GM |
8 | the Free Software Foundation, either version 3 of the License, or |
9 | (at your option) any later version. | |
95ed0025 | 10 | |
3b7ad313 EN |
11 | GNU Emacs is distributed in the hope that it will be useful, |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
95ed0025 | 15 | |
3b7ad313 | 16 | You should have received a copy of the GNU General Public License |
9ec0b715 | 17 | along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */ |
95ed0025 | 18 | |
9ec0b715 | 19 | /* |
95ed0025 RS |
20 | Geoff Voelker (voelker@cs.washington.edu) 7-29-94 |
21 | */ | |
22 | ||
4838e624 | 23 | #include <config.h> |
95ed0025 | 24 | #include <stdio.h> |
d7306fe6 | 25 | #include <setjmp.h> |
95ed0025 | 26 | |
489f9371 | 27 | #include "w32heap.h" |
8dfdd41f | 28 | #include "lisp.h" /* for VALMASK */ |
95ed0025 | 29 | |
2e4f6477 | 30 | #define RVA_TO_PTR(rva) ((unsigned char *)((DWORD)(rva) + (DWORD)GetModuleHandle (NULL))) |
30d2b1c2 | 31 | |
95ed0025 RS |
32 | /* This gives us the page size and the size of the allocation unit on NT. */ |
33 | SYSTEM_INFO sysinfo_cache; | |
b9cad9c1 GV |
34 | |
35 | /* This gives us version, build, and platform identification. */ | |
36 | OSVERSIONINFO osinfo_cache; | |
37 | ||
3bbabc43 | 38 | unsigned long syspage_mask = 0; |
95ed0025 | 39 | |
95ed0025 | 40 | /* The major and minor versions of NT. */ |
fbd6baed GV |
41 | int w32_major_version; |
42 | int w32_minor_version; | |
39f1f652 | 43 | int w32_build_number; |
95ed0025 | 44 | |
801f68b9 GV |
45 | /* Distinguish between Windows NT and Windows 95. */ |
46 | int os_subtype; | |
47 | ||
95ed0025 RS |
48 | /* Cache information describing the NT system for later use. */ |
49 | void | |
50 | cache_system_info (void) | |
51 | { | |
ce20e03e | 52 | union |
95ed0025 | 53 | { |
ce20e03e | 54 | struct info |
95ed0025 RS |
55 | { |
56 | char major; | |
57 | char minor; | |
58 | short platform; | |
59 | } info; | |
60 | DWORD data; | |
61 | } version; | |
62 | ||
63 | /* Cache the version of the operating system. */ | |
64 | version.data = GetVersion (); | |
fbd6baed GV |
65 | w32_major_version = version.info.major; |
66 | w32_minor_version = version.info.minor; | |
95ed0025 | 67 | |
801f68b9 GV |
68 | if (version.info.platform & 0x8000) |
69 | os_subtype = OS_WIN95; | |
70 | else | |
71 | os_subtype = OS_NT; | |
72 | ||
95ed0025 RS |
73 | /* Cache page size, allocation unit, processor type, etc. */ |
74 | GetSystemInfo (&sysinfo_cache); | |
3bbabc43 | 75 | syspage_mask = sysinfo_cache.dwPageSize - 1; |
b9cad9c1 GV |
76 | |
77 | /* Cache os info. */ | |
78 | osinfo_cache.dwOSVersionInfoSize = sizeof (OSVERSIONINFO); | |
79 | GetVersionEx (&osinfo_cache); | |
39f1f652 AI |
80 | |
81 | w32_build_number = osinfo_cache.dwBuildNumber; | |
82 | if (os_subtype == OS_WIN95) | |
83 | w32_build_number &= 0xffff; | |
95ed0025 RS |
84 | } |
85 | ||
e54c8cd1 GV |
86 | /* Emulate getpagesize. */ |
87 | int | |
88 | getpagesize (void) | |
89 | { | |
90 | return sysinfo_cache.dwPageSize; | |
91 | } | |
92 | ||
30d2b1c2 AI |
93 | /* Info for managing our preload heap, which is essentially a fixed size |
94 | data area in the executable. */ | |
95 | PIMAGE_SECTION_HEADER preload_heap_section; | |
95ed0025 RS |
96 | |
97 | /* Info for keeping track of our heap. */ | |
98 | unsigned char *data_region_base = NULL; | |
99 | unsigned char *data_region_end = NULL; | |
3bbabc43 | 100 | unsigned char *real_data_region_end = NULL; |
011db670 | 101 | unsigned long reserved_heap_size = 0; |
95ed0025 RS |
102 | |
103 | /* The start of the data segment. */ | |
104 | unsigned char * | |
105 | get_data_start (void) | |
106 | { | |
107 | return data_region_base; | |
108 | } | |
109 | ||
110 | /* The end of the data segment. */ | |
111 | unsigned char * | |
112 | get_data_end (void) | |
113 | { | |
114 | return data_region_end; | |
115 | } | |
116 | ||
011db670 GV |
117 | static char * |
118 | allocate_heap (void) | |
119 | { | |
30d2b1c2 AI |
120 | /* Try to get as much as possible of the address range from the end of |
121 | the preload heap section up to the usable address limit. Since GNU | |
122 | malloc can handle gaps in the memory it gets from sbrk, we can | |
123 | simply set the sbrk pointer to the base of the new heap region. */ | |
124 | unsigned long base = | |
125 | ROUND_UP ((RVA_TO_PTR (preload_heap_section->VirtualAddress) | |
126 | + preload_heap_section->Misc.VirtualSize), | |
127 | get_allocation_unit ()); | |
8dfdd41f | 128 | unsigned long end = 1 << VALBITS; /* 256MB */ |
709fd16b | 129 | void *ptr = NULL; |
011db670 | 130 | |
709fd16b GV |
131 | while (!ptr && (base < end)) |
132 | { | |
709fd16b GV |
133 | reserved_heap_size = end - base; |
134 | ptr = VirtualAlloc ((void *) base, | |
135 | get_reserved_heap_size (), | |
136 | MEM_RESERVE, | |
137 | PAGE_NOACCESS); | |
709fd16b GV |
138 | base += 0x00100000; /* 1MB increment */ |
139 | } | |
0d05360d | 140 | |
709fd16b | 141 | return ptr; |
011db670 | 142 | } |
011db670 GV |
143 | |
144 | ||
95ed0025 RS |
145 | /* Emulate Unix sbrk. */ |
146 | void * | |
147 | sbrk (unsigned long increment) | |
148 | { | |
149 | void *result; | |
150 | long size = (long) increment; | |
ce20e03e | 151 | |
95ed0025 | 152 | result = data_region_end; |
ce20e03e | 153 | |
95ed0025 | 154 | /* If size is negative, shrink the heap by decommitting pages. */ |
ce20e03e | 155 | if (size < 0) |
95ed0025 | 156 | { |
3bbabc43 GV |
157 | int new_size; |
158 | unsigned char *new_data_region_end; | |
159 | ||
95ed0025 RS |
160 | size = -size; |
161 | ||
162 | /* Sanity checks. */ | |
95ed0025 RS |
163 | if ((data_region_end - size) < data_region_base) |
164 | return NULL; | |
165 | ||
ce20e03e | 166 | /* We can only decommit full pages, so allow for |
3bbabc43 GV |
167 | partial deallocation [cga]. */ |
168 | new_data_region_end = (data_region_end - size); | |
169 | new_data_region_end = (unsigned char *) | |
170 | ((long) (new_data_region_end + syspage_mask) & ~syspage_mask); | |
171 | new_size = real_data_region_end - new_data_region_end; | |
172 | real_data_region_end = new_data_region_end; | |
30d2b1c2 | 173 | if (new_size > 0) |
3bbabc43 GV |
174 | { |
175 | /* Decommit size bytes from the end of the heap. */ | |
30d2b1c2 AI |
176 | if (using_dynamic_heap |
177 | && !VirtualFree (real_data_region_end, new_size, MEM_DECOMMIT)) | |
3bbabc43 GV |
178 | return NULL; |
179 | } | |
95ed0025 RS |
180 | |
181 | data_region_end -= size; | |
ce20e03e | 182 | } |
95ed0025 | 183 | /* If size is positive, grow the heap by committing reserved pages. */ |
ce20e03e | 184 | else if (size > 0) |
95ed0025 RS |
185 | { |
186 | /* Sanity checks. */ | |
95ed0025 RS |
187 | if ((data_region_end + size) > |
188 | (data_region_base + get_reserved_heap_size ())) | |
189 | return NULL; | |
190 | ||
191 | /* Commit more of our heap. */ | |
30d2b1c2 AI |
192 | if (using_dynamic_heap |
193 | && VirtualAlloc (data_region_end, size, MEM_COMMIT, | |
194 | PAGE_READWRITE) == NULL) | |
95ed0025 RS |
195 | return NULL; |
196 | data_region_end += size; | |
3bbabc43 GV |
197 | |
198 | /* We really only commit full pages, so record where | |
199 | the real end of committed memory is [cga]. */ | |
200 | real_data_region_end = (unsigned char *) | |
201 | ((long) (data_region_end + syspage_mask) & ~syspage_mask); | |
95ed0025 | 202 | } |
ce20e03e | 203 | |
95ed0025 RS |
204 | return result; |
205 | } | |
206 | ||
30d2b1c2 AI |
207 | /* Initialize the internal heap variables used by sbrk. When running in |
208 | preload phase (ie. in the undumped executable), we rely entirely on a | |
209 | fixed size heap section included in the .exe itself; this is | |
210 | preserved during dumping, and truncated to the size actually used. | |
211 | ||
212 | When running in the dumped executable, we reserve as much as possible | |
213 | of the address range that is addressable by Lisp object pointers, to | |
214 | supplement what is left of the preload heap. Although we cannot rely | |
215 | on the dynamically allocated arena being contiguous with the static | |
216 | heap area, it is not a problem because sbrk can pretend that the gap | |
217 | was allocated by something else; GNU malloc detects when there is a | |
218 | jump in the sbrk values, and starts a new heap block. */ | |
95ed0025 | 219 | void |
b56ceb92 | 220 | init_heap (void) |
95ed0025 | 221 | { |
30d2b1c2 AI |
222 | PIMAGE_DOS_HEADER dos_header; |
223 | PIMAGE_NT_HEADERS nt_header; | |
224 | ||
225 | dos_header = (PIMAGE_DOS_HEADER) RVA_TO_PTR (0); | |
ce20e03e | 226 | nt_header = (PIMAGE_NT_HEADERS) (((unsigned long) dos_header) + |
30d2b1c2 AI |
227 | dos_header->e_lfanew); |
228 | preload_heap_section = find_section ("EMHEAP", nt_header); | |
229 | ||
230 | if (using_dynamic_heap) | |
231 | { | |
232 | data_region_base = allocate_heap (); | |
233 | if (!data_region_base) | |
234 | { | |
235 | printf ("Error: Could not reserve dynamic heap area.\n"); | |
236 | exit (1); | |
237 | } | |
238 | ||
6e5cb96f | 239 | #if !defined (USE_LISP_UNION_TYPE) && !defined (USE_LSB_TAG) |
30d2b1c2 AI |
240 | /* Ensure that the addresses don't use the upper tag bits since |
241 | the Lisp type goes there. */ | |
ce20e03e | 242 | if (((unsigned long) data_region_base & ~VALMASK) != 0) |
30d2b1c2 AI |
243 | { |
244 | printf ("Error: The heap was allocated in upper memory.\n"); | |
245 | exit (1); | |
246 | } | |
3ae12c8d | 247 | #endif |
30d2b1c2 AI |
248 | data_region_end = data_region_base; |
249 | real_data_region_end = data_region_end; | |
250 | } | |
251 | else | |
252 | { | |
253 | data_region_base = RVA_TO_PTR (preload_heap_section->VirtualAddress); | |
254 | data_region_end = data_region_base; | |
255 | real_data_region_end = data_region_end; | |
256 | reserved_heap_size = preload_heap_section->Misc.VirtualSize; | |
257 | } | |
801f68b9 GV |
258 | |
259 | /* Update system version information to match current system. */ | |
260 | cache_system_info (); | |
95ed0025 RS |
261 | } |
262 | ||
263 | /* Round the heap up to the given alignment. */ | |
264 | void | |
265 | round_heap (unsigned long align) | |
266 | { | |
267 | unsigned long needs_to_be; | |
268 | unsigned long need_to_alloc; | |
ce20e03e | 269 | |
30d2b1c2 | 270 | needs_to_be = (unsigned long) ROUND_UP (get_heap_end (), align); |
95ed0025 | 271 | need_to_alloc = needs_to_be - (unsigned long) get_heap_end (); |
ce20e03e JB |
272 | |
273 | if (need_to_alloc) | |
95ed0025 RS |
274 | sbrk (need_to_alloc); |
275 | } | |
801f68b9 | 276 | |
9d4f32e8 | 277 | #if (_MSC_VER >= 1000 && _MSC_VER < 1300 && !defined (USE_CRT_DLL)) |
801f68b9 GV |
278 | |
279 | /* MSVC 4.2 invokes these functions from mainCRTStartup to initialize | |
280 | a heap via HeapCreate. They are normally defined by the runtime, | |
281 | but we override them here so that the unnecessary HeapCreate call | |
282 | is not performed. */ | |
283 | ||
284 | int __cdecl | |
285 | _heap_init (void) | |
286 | { | |
287 | /* Stepping through the assembly indicates that mainCRTStartup is | |
288 | expecting a nonzero success return value. */ | |
289 | return 1; | |
290 | } | |
291 | ||
292 | void __cdecl | |
293 | _heap_term (void) | |
294 | { | |
295 | return; | |
296 | } | |
297 | ||
298 | #endif | |
ab5796a9 | 299 |