1 /* Heap management routines for GNU Emacs on Windows NT.
2 Copyright (C) 1994 Free Software Foundation, Inc.
4 This file is part of GNU Emacs.
6 GNU Emacs is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 2, or (at your option) any later
11 GNU Emacs is distributed in the hope that it will be useful, but WITHOUT
12 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
16 You should have received a copy of the GNU General Public License along
17 with GNU Emacs; see the file COPYING. If not, write to the Free Software
18 Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
20 Geoff Voelker (voelker@cs.washington.edu) 7-29-94
28 /* This gives us the page size and the size of the allocation unit on NT. */
29 SYSTEM_INFO sysinfo_cache
;
31 /* These are defined to get Emacs to compile, but are not used. */
35 /* The major and minor versions of NT. */
39 /* Cache information describing the NT system for later use. */
41 cache_system_info (void)
54 /* Cache the version of the operating system. */
55 version
.data
= GetVersion ();
56 nt_major_version
= version
.info
.major
;
57 nt_minor_version
= version
.info
.minor
;
59 /* Cache page size, allocation unit, processor type, etc. */
60 GetSystemInfo (&sysinfo_cache
);
63 /* Round ADDRESS up to be aligned with ALIGN. */
65 round_to_next (unsigned char *address
, unsigned long align
)
69 tmp
= (unsigned long) address
;
70 tmp
= (tmp
+ align
- 1) / align
;
72 return (unsigned char *) (tmp
* align
);
75 /* Info for keeping track of our heap. */
76 unsigned char *data_region_base
= NULL
;
77 unsigned char *data_region_end
= NULL
;
78 unsigned long data_region_size
= 0;
80 /* The start of the data segment. */
84 return data_region_base
;
87 /* The end of the data segment. */
91 return data_region_end
;
94 /* Emulate Unix sbrk. */
96 sbrk (unsigned long increment
)
99 long size
= (long) increment
;
101 /* Allocate our heap if we haven't done so already. */
102 if (!data_region_base
)
104 data_region_base
= VirtualAlloc ((void *) get_data_region_base (),
105 get_reserved_heap_size (),
108 if (!data_region_base
)
111 /* Ensure that the addresses don't use the upper 8 bits since
112 the Lisp type goes there (yucko). */
113 if (((unsigned long) data_region_base
& 0xFF000000) != 0)
115 printf ("Error: The heap was allocated in upper memory.\n");
119 data_region_end
= data_region_base
;
120 data_region_size
= get_reserved_heap_size ();
123 result
= data_region_end
;
125 /* If size is negative, shrink the heap by decommitting pages. */
131 if (size
% get_page_size () != 0)
133 if ((data_region_end
- size
) < data_region_base
)
136 /* Decommit size bytes from the end of the heap. */
137 if (!VirtualFree (data_region_end
- size
, size
, MEM_DECOMMIT
))
140 data_region_end
-= size
;
142 /* If size is positive, grow the heap by committing reserved pages. */
146 if ((data_region_end
+ size
) >
147 (data_region_base
+ get_reserved_heap_size ()))
150 /* Commit more of our heap. */
151 if (VirtualAlloc (data_region_end
, size
, MEM_COMMIT
,
152 PAGE_READWRITE
) == NULL
)
154 data_region_end
+= size
;
160 /* Recreate the heap from the data that was dumped to the executable.
161 EXECUTABLE_PATH tells us where to find the executable. */
163 recreate_heap (char *executable_path
)
167 /* First reserve the upper part of our heap. (We reserve first
168 because there have been problems in the past where doing the
169 mapping first has loaded DLLs into the VA space of our heap.) */
170 tmp
= VirtualAlloc ((void *) get_heap_end (),
171 get_reserved_heap_size () - get_committed_heap_size (),
177 /* We read in the data for the .bss section from the executable
178 first and map in the heap from the executable second to prevent
179 any funny interactions between file I/O and file mapping. */
180 read_in_bss (executable_path
);
181 map_in_heap (executable_path
);
184 /* Round the heap up to the given alignment. */
186 round_heap (unsigned long align
)
188 unsigned long needs_to_be
;
189 unsigned long need_to_alloc
;
191 needs_to_be
= (unsigned long) round_to_next (get_heap_end (), align
);
192 need_to_alloc
= needs_to_be
- (unsigned long) get_heap_end ();
195 sbrk (need_to_alloc
);