Print this page
rev 3709 : imported patch reuse-old-marking-stack
| Split |
Close |
| Expand all |
| Collapse all |
--- old/src/share/vm/runtime/virtualspace.hpp
+++ new/src/share/vm/runtime/virtualspace.hpp
1 1 /*
2 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
3 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 4 *
5 5 * This code is free software; you can redistribute it and/or modify it
6 6 * under the terms of the GNU General Public License version 2 only, as
7 7 * published by the Free Software Foundation.
8 8 *
9 9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 12 * version 2 for more details (a copy is included in the LICENSE file that
13 13 * accompanied this code).
14 14 *
15 15 * You should have received a copy of the GNU General Public License version
16 16 * 2 along with this work; if not, write to the Free Software Foundation,
17 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 18 *
19 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 20 * or visit www.oracle.com if you need additional information or have any
21 21 * questions.
22 22 *
23 23 */
24 24
25 25 #ifndef SHARE_VM_RUNTIME_VIRTUALSPACE_HPP
26 26 #define SHARE_VM_RUNTIME_VIRTUALSPACE_HPP
27 27
28 28 #include "memory/allocation.hpp"
29 29
30 30 // ReservedSpace is a data structure for reserving a contiguous address range.
31 31
32 32 class ReservedSpace VALUE_OBJ_CLASS_SPEC {
33 33 friend class VMStructs;
34 34 private:
35 35 char* _base;
36 36 size_t _size;
37 37 size_t _noaccess_prefix;
38 38 size_t _alignment;
39 39 bool _special;
40 40 bool _executable;
41 41
42 42 // ReservedSpace
43 43 ReservedSpace(char* base, size_t size, size_t alignment, bool special,
44 44 bool executable);
45 45 void initialize(size_t size, size_t alignment, bool large,
46 46 char* requested_address,
47 47 const size_t noaccess_prefix,
48 48 bool executable);
49 49
50 50 // Release parts of an already-reserved memory region [addr, addr + len) to
51 51 // get a new region that has "compound alignment." Return the start of the
52 52 // resulting region, or NULL on failure.
53 53 //
54 54 // The region is logically divided into a prefix and a suffix. The prefix
55 55 // starts at the result address, which is aligned to prefix_align. The suffix
56 56 // starts at result address + prefix_size, which is aligned to suffix_align.
57 57 // The total size of the result region is size prefix_size + suffix_size.
58 58 char* align_reserved_region(char* addr, const size_t len,
59 59 const size_t prefix_size,
60 60 const size_t prefix_align,
61 61 const size_t suffix_size,
62 62 const size_t suffix_align);
63 63
64 64 // Reserve memory, call align_reserved_region() to alignment it and return the
65 65 // result.
66 66 char* reserve_and_align(const size_t reserve_size,
67 67 const size_t prefix_size,
|
↓ open down ↓ |
67 lines elided |
↑ open up ↑ |
68 68 const size_t prefix_align,
69 69 const size_t suffix_size,
70 70 const size_t suffix_align);
71 71
72 72 protected:
73 73 // Create protection page at the beginning of the space.
74 74 void protect_noaccess_prefix(const size_t size);
75 75
76 76 public:
77 77 // Constructor
78 + ReservedSpace() :
79 + _base(NULL), _size(0), _noaccess_prefix(0), _alignment(0),
80 + _special(false), _executable(false) {}
81 +
78 82 ReservedSpace(size_t size);
79 83 ReservedSpace(size_t size, size_t alignment, bool large,
80 84 char* requested_address = NULL,
81 85 const size_t noaccess_prefix = 0);
82 86 ReservedSpace(const size_t suffix_size, const size_t suffix_align,
83 87 char* requested_address,
84 88 const size_t noaccess_prefix = 0);
85 89 ReservedSpace(size_t size, size_t alignment, bool large, bool executable);
86 90
87 91 // Accessors
88 92 char* base() const { return _base; }
89 93 size_t size() const { return _size; }
90 94 size_t alignment() const { return _alignment; }
91 95 bool special() const { return _special; }
92 96 bool executable() const { return _executable; }
93 97 size_t noaccess_prefix() const { return _noaccess_prefix; }
94 98 bool is_reserved() const { return _base != NULL; }
95 99 void release();
96 100
97 101 // Splitting
98 102 ReservedSpace first_part(size_t partition_size, size_t alignment,
99 103 bool split = false, bool realloc = true);
100 104 ReservedSpace last_part (size_t partition_size, size_t alignment);
101 105
102 106 // These simply call the above using the default alignment.
103 107 inline ReservedSpace first_part(size_t partition_size,
104 108 bool split = false, bool realloc = true);
105 109 inline ReservedSpace last_part (size_t partition_size);
106 110
107 111 // Alignment
108 112 static size_t page_align_size_up(size_t size);
109 113 static size_t page_align_size_down(size_t size);
110 114 static size_t allocation_align_size_up(size_t size);
111 115 static size_t allocation_align_size_down(size_t size);
112 116 };
113 117
114 118 ReservedSpace
115 119 ReservedSpace::first_part(size_t partition_size, bool split, bool realloc)
116 120 {
117 121 return first_part(partition_size, alignment(), split, realloc);
118 122 }
119 123
120 124 ReservedSpace ReservedSpace::last_part(size_t partition_size)
121 125 {
122 126 return last_part(partition_size, alignment());
123 127 }
124 128
125 129 // Class encapsulating behavior specific of memory space reserved for Java heap
126 130 class ReservedHeapSpace : public ReservedSpace {
127 131 public:
128 132 // Constructor
129 133 ReservedHeapSpace(size_t size, size_t forced_base_alignment,
130 134 bool large, char* requested_address);
131 135 ReservedHeapSpace(const size_t prefix_size, const size_t prefix_align,
132 136 char* requested_address);
133 137 };
134 138
135 139 // Class encapsulating behavior specific memory space for Code
136 140 class ReservedCodeSpace : public ReservedSpace {
137 141 public:
138 142 // Constructor
139 143 ReservedCodeSpace(size_t r_size, size_t rs_align, bool large);
140 144 };
141 145
142 146 // VirtualSpace is data structure for committing a previously reserved address range in smaller chunks.
143 147
144 148 class VirtualSpace VALUE_OBJ_CLASS_SPEC {
145 149 friend class VMStructs;
146 150 private:
147 151 // Reserved area
148 152 char* _low_boundary;
149 153 char* _high_boundary;
150 154
151 155 // Committed area
152 156 char* _low;
153 157 char* _high;
154 158
155 159 // The entire space has been committed and pinned in memory, no
156 160 // os::commit_memory() or os::uncommit_memory().
157 161 bool _special;
158 162
159 163 // Need to know if commit should be executable.
160 164 bool _executable;
161 165
162 166 // MPSS Support
163 167 // Each virtualspace region has a lower, middle, and upper region.
164 168 // Each region has an end boundary and a high pointer which is the
165 169 // high water mark for the last allocated byte.
166 170 // The lower and upper unaligned to LargePageSizeInBytes uses default page.
167 171 // size. The middle region uses large page size.
168 172 char* _lower_high;
169 173 char* _middle_high;
170 174 char* _upper_high;
171 175
172 176 char* _lower_high_boundary;
173 177 char* _middle_high_boundary;
174 178 char* _upper_high_boundary;
175 179
176 180 size_t _lower_alignment;
177 181 size_t _middle_alignment;
178 182 size_t _upper_alignment;
179 183
180 184 // MPSS Accessors
181 185 char* lower_high() const { return _lower_high; }
182 186 char* middle_high() const { return _middle_high; }
183 187 char* upper_high() const { return _upper_high; }
184 188
185 189 char* lower_high_boundary() const { return _lower_high_boundary; }
186 190 char* middle_high_boundary() const { return _middle_high_boundary; }
187 191 char* upper_high_boundary() const { return _upper_high_boundary; }
188 192
189 193 size_t lower_alignment() const { return _lower_alignment; }
190 194 size_t middle_alignment() const { return _middle_alignment; }
191 195 size_t upper_alignment() const { return _upper_alignment; }
192 196
193 197 public:
194 198 // Committed area
195 199 char* low() const { return _low; }
196 200 char* high() const { return _high; }
197 201
198 202 // Reserved area
199 203 char* low_boundary() const { return _low_boundary; }
200 204 char* high_boundary() const { return _high_boundary; }
201 205
202 206 bool special() const { return _special; }
203 207
204 208 public:
205 209 // Initialization
206 210 VirtualSpace();
207 211 bool initialize(ReservedSpace rs, size_t committed_byte_size);
208 212
209 213 // Destruction
210 214 ~VirtualSpace();
211 215
212 216 // Testers (all sizes are byte sizes)
213 217 size_t committed_size() const;
214 218 size_t reserved_size() const;
215 219 size_t uncommitted_size() const;
216 220 bool contains(const void* p) const;
217 221
218 222 // Operations
219 223 // returns true on success, false otherwise
220 224 bool expand_by(size_t bytes, bool pre_touch = false);
221 225 void shrink_by(size_t bytes);
222 226 void release();
223 227
224 228 void check_for_contiguity() PRODUCT_RETURN;
225 229
226 230 // Debugging
227 231 void print() PRODUCT_RETURN;
228 232 };
229 233
230 234 #endif // SHARE_VM_RUNTIME_VIRTUALSPACE_HPP
|
↓ open down ↓ |
143 lines elided |
↑ open up ↑ |
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX