8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_MEMORY_HEAP_HPP
26 #define SHARE_VM_MEMORY_HEAP_HPP
27
28 #include "memory/allocation.hpp"
29 #include "runtime/virtualspace.hpp"
30
31 // Blocks
32
33 class HeapBlock VALUE_OBJ_CLASS_SPEC {
34 friend class VMStructs;
35
36 public:
37 struct Header {
38 size_t _length; // the length in segments
39 bool _used; // Used bit
40 };
41
42 protected:
43 union {
44 Header _header;
45 int64_t _padding[ (sizeof(Header) + sizeof(int64_t)-1) / sizeof(int64_t) ];
46 // pad to 0 mod 8
47 };
75 // Accessors
76 FreeBlock* link() const { return _link; }
77 void set_link(FreeBlock* link) { _link = link; }
78 };
79
80 class CodeHeap : public CHeapObj<mtCode> {
81 friend class VMStructs;
82 private:
83 VirtualSpace _memory; // the memory holding the blocks
84 VirtualSpace _segmap; // the memory holding the segment map
85
86 size_t _number_of_committed_segments;
87 size_t _number_of_reserved_segments;
88 size_t _segment_size;
89 int _log2_segment_size;
90
91 size_t _next_segment;
92
93 FreeBlock* _freelist;
94 size_t _freelist_segments; // No. of segments in freelist
95
96 // Helper functions
97 size_t size_to_segments(size_t size) const { return (size + _segment_size - 1) >> _log2_segment_size; }
98 size_t segments_to_size(size_t number_of_segments) const { return number_of_segments << _log2_segment_size; }
99
100 size_t segment_for(void* p) const { return ((char*)p - _memory.low()) >> _log2_segment_size; }
101 HeapBlock* block_at(size_t i) const { return (HeapBlock*)(_memory.low() + (i << _log2_segment_size)); }
102
103 void mark_segmap_as_free(size_t beg, size_t end);
104 void mark_segmap_as_used(size_t beg, size_t end);
105
106 // Freelist management helpers
107 FreeBlock* following_block(FreeBlock *b);
108 void insert_after(FreeBlock* a, FreeBlock* b);
109 void merge_right (FreeBlock* a);
110
111 // Toplevel freelist management
112 void add_to_freelist(HeapBlock *b);
113 FreeBlock* search_freelist(size_t length, bool is_critical);
114
115 // Iteration helpers
116 void* next_free(HeapBlock* b) const;
117 HeapBlock* first_block() const;
118 HeapBlock* next_block(HeapBlock* b) const;
119 HeapBlock* block_start(void* p) const;
120
121 // to perform additional actions on creation of executable code
122 void on_code_mapping(char* base, size_t size);
123
124 public:
125 CodeHeap();
126
127 // Heap extents
128 bool reserve(size_t reserved_size, size_t committed_size, size_t segment_size);
129 void release(); // releases all allocated memory
130 bool expand_by(size_t size); // expands commited memory by size
131 void shrink_by(size_t size); // shrinks commited memory by size
132 void clear(); // clears all heap contents
133
134 // Memory allocation
135 void* allocate (size_t size, bool is_critical); // allocates a block of size or returns NULL
136 void deallocate(void* p); // deallocates a block
137
138 // Attributes
139 char* low_boundary() const { return _memory.low_boundary (); }
140 char* high() const { return _memory.high(); }
141 char* high_boundary() const { return _memory.high_boundary(); }
142
143 bool contains(const void* p) const { return low_boundary() <= p && p < high(); }
144 void* find_start(void* p) const; // returns the block containing p or NULL
145 size_t alignment_unit() const; // alignment of any block
146 size_t alignment_offset() const; // offset of first byte of any block, within the enclosing alignment unit
147 static size_t header_size(); // returns the header size for each heap block
148
149 // Iteration
150
151 // returns the first block or NULL
152 void* first() const { return next_free(first_block()); }
153 // returns the next block given a block p or NULL
154 void* next(void* p) const { return next_free(next_block(block_start(p))); }
155
156 // Statistics
157 size_t capacity() const;
158 size_t max_capacity() const;
159 size_t allocated_capacity() const;
160 size_t unallocated_capacity() const { return max_capacity() - allocated_capacity(); }
161
162 private:
163 size_t heap_unallocated_capacity() const;
164
165 public:
166 // Debugging
167 void verify();
168 void print() PRODUCT_RETURN;
169 };
170
171 #endif // SHARE_VM_MEMORY_HEAP_HPP
|
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #ifndef SHARE_VM_MEMORY_HEAP_HPP
26 #define SHARE_VM_MEMORY_HEAP_HPP
27
28 #include "code/codeBlob.hpp"
29 #include "memory/allocation.hpp"
30 #include "runtime/virtualspace.hpp"
31
32 // Blocks
33
34 class HeapBlock VALUE_OBJ_CLASS_SPEC {
35 friend class VMStructs;
36
37 public:
38 struct Header {
39 size_t _length; // the length in segments
40 bool _used; // Used bit
41 };
42
43 protected:
44 union {
45 Header _header;
46 int64_t _padding[ (sizeof(Header) + sizeof(int64_t)-1) / sizeof(int64_t) ];
47 // pad to 0 mod 8
48 };
76 // Accessors
77 FreeBlock* link() const { return _link; }
78 void set_link(FreeBlock* link) { _link = link; }
79 };
80
81 class CodeHeap : public CHeapObj<mtCode> {
82 friend class VMStructs;
83 private:
84 VirtualSpace _memory; // the memory holding the blocks
85 VirtualSpace _segmap; // the memory holding the segment map
86
87 size_t _number_of_committed_segments;
88 size_t _number_of_reserved_segments;
89 size_t _segment_size;
90 int _log2_segment_size;
91
92 size_t _next_segment;
93
94 FreeBlock* _freelist;
95 size_t _freelist_segments; // No. of segments in freelist
96 size_t _max_allocated_capacity; // Peak capacity that was allocated during lifetime of the heap
97
98 const char* _name; // Name of the CodeHeap
99 const int _code_blob_type; // CodeBlobType it contains
100 bool _was_full; // True if CodeHeap was full during runtime
101
102 // Helper functions
103 size_t size_to_segments(size_t size) const { return (size + _segment_size - 1) >> _log2_segment_size; }
104 size_t segments_to_size(size_t number_of_segments) const { return number_of_segments << _log2_segment_size; }
105
106 size_t segment_for(void* p) const { return ((char*)p - _memory.low()) >> _log2_segment_size; }
107 HeapBlock* block_at(size_t i) const { return (HeapBlock*)(_memory.low() + (i << _log2_segment_size)); }
108
109 void mark_segmap_as_free(size_t beg, size_t end);
110 void mark_segmap_as_used(size_t beg, size_t end);
111
112 // Freelist management helpers
113 FreeBlock* following_block(FreeBlock *b);
114 void insert_after(FreeBlock* a, FreeBlock* b);
115 void merge_right (FreeBlock* a);
116
117 // Toplevel freelist management
118 void add_to_freelist(HeapBlock *b);
119 FreeBlock* search_freelist(size_t length, bool is_critical);
120
121 // Iteration helpers
122 void* next_free(HeapBlock* b) const;
123 HeapBlock* first_block() const;
124 HeapBlock* next_block(HeapBlock* b) const;
125 HeapBlock* block_start(void* p) const;
126
127 // to perform additional actions on creation of executable code
128 void on_code_mapping(char* base, size_t size);
129
130 public:
131 CodeHeap(const char* name, const int code_blob_type);
132
133 // Heap extents
134 bool reserve(ReservedSpace rs, size_t committed_size, size_t segment_size);
135 void release(); // releases all allocated memory
136 bool expand_by(size_t size); // expands commited memory by size
137 void shrink_by(size_t size); // shrinks commited memory by size
138 void clear(); // clears all heap contents
139
140 // Memory allocation
141 void* allocate (size_t size, bool is_critical); // allocates a block of size or returns NULL
142 void deallocate(void* p); // deallocates a block
143
144 // Attributes
145 char* low_boundary() const { return _memory.low_boundary (); }
146 char* high() const { return _memory.high(); }
147 char* high_boundary() const { return _memory.high_boundary(); }
148
149 bool contains(const void* p) const { return low_boundary() <= p && p < high(); }
150 void* find_start(void* p) const; // returns the block containing p or NULL
151 size_t alignment_unit() const; // alignment of any block
152 size_t alignment_offset() const; // offset of first byte of any block, within the enclosing alignment unit
153 static size_t header_size(); // returns the header size for each heap block
154
155 // Iteration
156
157 // returns the first block or NULL
158 void* first() const { return next_free(first_block()); }
159 // returns the next block given a block p or NULL
160 void* next(void* p) const { return next_free(next_block(block_start(p))); }
161
162 // Statistics
163 size_t capacity() const;
164 size_t max_capacity() const;
165 size_t allocated_capacity() const;
166 size_t max_allocated_capacity() const { return _max_allocated_capacity; }
167 size_t unallocated_capacity() const { return max_capacity() - allocated_capacity(); }
168
169 // Returns true if the CodeHeap contains CodeBlobs of the given type
170 bool accepts(int code_blob_type) const { return (_code_blob_type == code_blob_type); }
171
172 // Debugging / Profiling
173 const char* name() const { return _name; }
174 bool was_full() { return _was_full; }
175 void report_full() { _was_full = true; }
176
177 private:
178 size_t heap_unallocated_capacity() const;
179
180 public:
181 // Debugging
182 void verify();
183 void print() PRODUCT_RETURN;
184 };
185
186 #endif // SHARE_VM_MEMORY_HEAP_HPP
|