1 /*
2 * Copyright (c) 1997, 2016, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
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_ASM_CODEBUFFER_HPP
26 #define SHARE_VM_ASM_CODEBUFFER_HPP
27
28 #include "code/oopRecorder.hpp"
29 #include "code/relocInfo.hpp"
30 #include "utilities/debug.hpp"
31 #include "utilities/macros.hpp"
32
33 class CodeStrings;
34 class PhaseCFG;
35 class Compile;
36 class BufferBlob;
37 class CodeBuffer;
38 class Label;
39
40 class CodeOffsets: public StackObj {
41 public:
42 enum Entries { Entry,
43 Verified_Entry,
44 Frame_Complete, // Offset in the code where the frame setup is (for forte stackwalks) is complete
45 OSR_Entry,
46 Exceptions, // Offset where exception handler lives
47 Deopt, // Offset where deopt handler lives
48 DeoptMH, // Offset where MethodHandle deopt handler lives
49 UnwindHandler, // Offset to default unwind handler
50 max_Entries };
51
52 // special value to note codeBlobs where profile (forte) stack walking is
53 // always dangerous and suspect.
54
55 enum { frame_never_safe = -1 };
56
57 private:
58 int _values[max_Entries];
59
60 public:
61 CodeOffsets() {
62 _values[Entry ] = 0;
63 _values[Verified_Entry] = 0;
64 _values[Frame_Complete] = frame_never_safe;
65 _values[OSR_Entry ] = 0;
66 _values[Exceptions ] = -1;
67 _values[Deopt ] = -1;
68 _values[DeoptMH ] = -1;
69 _values[UnwindHandler ] = -1;
70 }
71
72 int value(Entries e) { return _values[e]; }
73 void set_value(Entries e, int val) { _values[e] = val; }
74 };
75
76 // This class represents a stream of code and associated relocations.
77 // There are a few in each CodeBuffer.
78 // They are filled concurrently, and concatenated at the end.
79 class CodeSection VALUE_OBJ_CLASS_SPEC {
80 friend class CodeBuffer;
81 public:
82 typedef int csize_t; // code size type; would be size_t except for history
83
84 private:
85 address _start; // first byte of contents (instructions)
86 address _mark; // user mark, usually an instruction beginning
87 address _end; // current end address
88 address _limit; // last possible (allocated) end address
89 relocInfo* _locs_start; // first byte of relocation information
90 relocInfo* _locs_end; // first byte after relocation information
91 relocInfo* _locs_limit; // first byte after relocation information buf
92 address _locs_point; // last relocated position (grows upward)
93 bool _locs_own; // did I allocate the locs myself?
94 bool _frozen; // no more expansion of this section
95 char _index; // my section number (SECT_INST, etc.)
96 CodeBuffer* _outer; // enclosing CodeBuffer
97
98 // (Note: _locs_point used to be called _last_reloc_offset.)
99
100 CodeSection() {
101 _start = NULL;
102 _mark = NULL;
103 _end = NULL;
104 _limit = NULL;
105 _locs_start = NULL;
106 _locs_end = NULL;
107 _locs_limit = NULL;
108 _locs_point = NULL;
109 _locs_own = false;
110 _frozen = false;
111 debug_only(_index = (char)-1);
112 debug_only(_outer = (CodeBuffer*)badAddress);
113 }
114
115 void initialize_outer(CodeBuffer* outer, int index) {
116 _outer = outer;
117 _index = index;
118 }
119
120 void initialize(address start, csize_t size = 0) {
121 assert(_start == NULL, "only one init step, please");
122 _start = start;
123 _mark = NULL;
124 _end = start;
125
126 _limit = start + size;
127 _locs_point = start;
128 }
129
130 void initialize_locs(int locs_capacity);
131 void expand_locs(int new_capacity);
132 void initialize_locs_from(const CodeSection* source_cs);
133
134 // helper for CodeBuffer::expand()
135 void take_over_code_from(CodeSection* cs) {
136 _start = cs->_start;
137 _mark = cs->_mark;
138 _end = cs->_end;
139 _limit = cs->_limit;
140 _locs_point = cs->_locs_point;
141 }
142
143 public:
144 address start() const { return _start; }
145 address mark() const { return _mark; }
146 address end() const { return _end; }
147 address limit() const { return _limit; }
148 csize_t size() const { return (csize_t)(_end - _start); }
149 csize_t mark_off() const { assert(_mark != NULL, "not an offset");
150 return (csize_t)(_mark - _start); }
151 csize_t capacity() const { return (csize_t)(_limit - _start); }
152 csize_t remaining() const { return (csize_t)(_limit - _end); }
153
154 relocInfo* locs_start() const { return _locs_start; }
155 relocInfo* locs_end() const { return _locs_end; }
156 int locs_count() const { return (int)(_locs_end - _locs_start); }
157 relocInfo* locs_limit() const { return _locs_limit; }
158 address locs_point() const { return _locs_point; }
159 csize_t locs_point_off() const{ return (csize_t)(_locs_point - _start); }
160 csize_t locs_capacity() const { return (csize_t)(_locs_limit - _locs_start); }
161 csize_t locs_remaining()const { return (csize_t)(_locs_limit - _locs_end); }
162
163 int index() const { return _index; }
164 bool is_allocated() const { return _start != NULL; }
165 bool is_empty() const { return _start == _end; }
166 bool is_frozen() const { return _frozen; }
167 bool has_locs() const { return _locs_end != NULL; }
168
169 CodeBuffer* outer() const { return _outer; }
170
171 // is a given address in this section? (2nd version is end-inclusive)
172 bool contains(address pc) const { return pc >= _start && pc < _end; }
173 bool contains2(address pc) const { return pc >= _start && pc <= _end; }
174 bool allocates(address pc) const { return pc >= _start && pc < _limit; }
175 bool allocates2(address pc) const { return pc >= _start && pc <= _limit; }
176
177 void set_end(address pc) { assert(allocates2(pc), "not in CodeBuffer memory: " INTPTR_FORMAT " <= " INTPTR_FORMAT " <= " INTPTR_FORMAT, p2i(_start), p2i(pc), p2i(_limit)); _end = pc; }
178 void set_mark(address pc) { assert(contains2(pc), "not in codeBuffer");
179 _mark = pc; }
180 void set_mark_off(int offset) { assert(contains2(offset+_start),"not in codeBuffer");
181 _mark = offset + _start; }
182 void set_mark() { _mark = _end; }
183 void clear_mark() { _mark = NULL; }
184
185 void set_locs_end(relocInfo* p) {
186 assert(p <= locs_limit(), "locs data fits in allocated buffer");
187 _locs_end = p;
188 }
189 void set_locs_point(address pc) {
190 assert(pc >= locs_point(), "relocation addr may not decrease");
191 assert(allocates2(pc), "relocation addr must be in this section");
192 _locs_point = pc;
193 }
194
195 // Code emission
196 void emit_int8 ( int8_t x) { *((int8_t*) end()) = x; set_end(end() + sizeof(int8_t)); }
197 void emit_int16( int16_t x) { *((int16_t*) end()) = x; set_end(end() + sizeof(int16_t)); }
198 void emit_int32( int32_t x) { *((int32_t*) end()) = x; set_end(end() + sizeof(int32_t)); }
199 void emit_int64( int64_t x) { *((int64_t*) end()) = x; set_end(end() + sizeof(int64_t)); }
200
201 void emit_float( jfloat x) { *((jfloat*) end()) = x; set_end(end() + sizeof(jfloat)); }
202 void emit_double(jdouble x) { *((jdouble*) end()) = x; set_end(end() + sizeof(jdouble)); }
203 void emit_address(address x) { *((address*) end()) = x; set_end(end() + sizeof(address)); }
204
205 // Share a scratch buffer for relocinfo. (Hacky; saves a resource allocation.)
206 void initialize_shared_locs(relocInfo* buf, int length);
207
208 // Manage labels and their addresses.
209 address target(Label& L, address branch_pc);
210
211 // Emit a relocation.
212 void relocate(address at, RelocationHolder const& rspec, int format = 0);
213 void relocate(address at, relocInfo::relocType rtype, int format = 0, jint method_index = 0);
214
215 // alignment requirement for starting offset
216 // Requirements are that the instruction area and the
217 // stubs area must start on CodeEntryAlignment, and
218 // the ctable on sizeof(jdouble)
219 int alignment() const { return MAX2((int)sizeof(jdouble), (int)CodeEntryAlignment); }
220
221 // Slop between sections, used only when allocating temporary BufferBlob buffers.
222 static csize_t end_slop() { return MAX2((int)sizeof(jdouble), (int)CodeEntryAlignment); }
223
224 csize_t align_at_start(csize_t off) const { return (csize_t) align_size_up(off, alignment()); }
225
226 // Mark a section frozen. Assign its remaining space to
227 // the following section. It will never expand after this point.
228 inline void freeze(); // { _outer->freeze_section(this); }
229
230 // Ensure there's enough space left in the current section.
231 // Return true if there was an expansion.
232 bool maybe_expand_to_ensure_remaining(csize_t amount);
233
234 #ifndef PRODUCT
235 void decode();
236 void dump();
237 void print(const char* name);
238 #endif //PRODUCT
239 };
240
241 class CodeString;
242 class CodeStrings VALUE_OBJ_CLASS_SPEC {
243 private:
244 #ifndef PRODUCT
245 CodeString* _strings;
246 #ifdef ASSERT
247 // Becomes true after copy-out, forbids further use.
248 bool _defunct; // Zero bit pattern is "valid", see memset call in decode_env::decode_env
249 #endif
250 static const char* _prefix; // defaults to " ;; "
251 #endif
252
253 CodeString* find(intptr_t offset) const;
254 CodeString* find_last(intptr_t offset) const;
255
256 void set_null_and_invalidate() {
257 #ifndef PRODUCT
258 _strings = NULL;
259 #ifdef ASSERT
260 _defunct = true;
261 #endif
262 #endif
263 }
264
265 public:
266 CodeStrings() {
267 #ifndef PRODUCT
268 _strings = NULL;
269 #ifdef ASSERT
270 _defunct = false;
271 #endif
272 #endif
273 }
274
275 bool is_null() {
276 #ifdef ASSERT
277 return _strings == NULL;
278 #else
279 return true;
280 #endif
281 }
282
283 const char* add_string(const char * string) PRODUCT_RETURN_(return NULL;);
284
285 void add_comment(intptr_t offset, const char * comment) PRODUCT_RETURN;
286 void print_block_comment(outputStream* stream, intptr_t offset) const PRODUCT_RETURN;
287 // MOVE strings from other to this; invalidate other.
288 void assign(CodeStrings& other) PRODUCT_RETURN;
289 // COPY strings from other to this; leave other valid.
290 void copy(CodeStrings& other) PRODUCT_RETURN;
291 // FREE strings; invalidate this.
292 void free() PRODUCT_RETURN;
293 // Guarantee that _strings are used at most once; assign and free invalidate a buffer.
294 inline void check_valid() const {
295 #ifdef ASSERT
296 assert(!_defunct, "Use of invalid CodeStrings");
297 #endif
298 }
299
300 static void set_prefix(const char *prefix) {
301 #ifndef PRODUCT
302 _prefix = prefix;
303 #endif
304 }
305 };
306
307 // A CodeBuffer describes a memory space into which assembly
308 // code is generated. This memory space usually occupies the
309 // interior of a single BufferBlob, but in some cases it may be
310 // an arbitrary span of memory, even outside the code cache.
311 //
312 // A code buffer comes in two variants:
313 //
314 // (1) A CodeBuffer referring to an already allocated piece of memory:
315 // This is used to direct 'static' code generation (e.g. for interpreter
316 // or stubroutine generation, etc.). This code comes with NO relocation
317 // information.
318 //
319 // (2) A CodeBuffer referring to a piece of memory allocated when the
320 // CodeBuffer is allocated. This is used for nmethod generation.
321 //
322 // The memory can be divided up into several parts called sections.
323 // Each section independently accumulates code (or data) an relocations.
324 // Sections can grow (at the expense of a reallocation of the BufferBlob
325 // and recopying of all active sections). When the buffered code is finally
326 // written to an nmethod (or other CodeBlob), the contents (code, data,
327 // and relocations) of the sections are padded to an alignment and concatenated.
328 // Instructions and data in one section can contain relocatable references to
329 // addresses in a sibling section.
330
331 class CodeBuffer: public StackObj {
332 friend class CodeSection;
333
334 private:
335 // CodeBuffers must be allocated on the stack except for a single
336 // special case during expansion which is handled internally. This
337 // is done to guarantee proper cleanup of resources.
338 void* operator new(size_t size) throw() { return ResourceObj::operator new(size); }
339 void operator delete(void* p) { ShouldNotCallThis(); }
340
341 public:
342 typedef int csize_t; // code size type; would be size_t except for history
343 enum {
344 // Here is the list of all possible sections. The order reflects
345 // the final layout.
346 SECT_FIRST = 0,
347 SECT_CONSTS = SECT_FIRST, // Non-instruction data: Floats, jump tables, etc.
348 SECT_INSTS, // Executable instructions.
349 SECT_STUBS, // Outbound trampolines for supporting call sites.
350 SECT_LIMIT, SECT_NONE = -1
351 };
352
353 private:
354 enum {
355 sect_bits = 2, // assert (SECT_LIMIT <= (1<<sect_bits))
356 sect_mask = (1<<sect_bits)-1
357 };
358
359 const char* _name;
360
361 CodeSection _consts; // constants, jump tables
362 CodeSection _insts; // instructions (the main section)
363 CodeSection _stubs; // stubs (call site support), deopt, exception handling
364
365 CodeBuffer* _before_expand; // dead buffer, from before the last expansion
366
367 BufferBlob* _blob; // optional buffer in CodeCache for generated code
368 address _total_start; // first address of combined memory buffer
369 csize_t _total_size; // size in bytes of combined memory buffer
370
371 OopRecorder* _oop_recorder;
372 CodeStrings _code_strings;
373 OopRecorder _default_oop_recorder; // override with initialize_oop_recorder
374 Arena* _overflow_arena;
375
376 address _last_membar; // used to merge consecutive memory barriers
377
378 address _decode_begin; // start address for decode
379 address decode_begin();
380
381 void initialize_misc(const char * name) {
382 // all pointers other than code_start/end and those inside the sections
383 assert(name != NULL, "must have a name");
384 _name = name;
385 _before_expand = NULL;
386 _blob = NULL;
387 _oop_recorder = NULL;
388 _decode_begin = NULL;
389 _overflow_arena = NULL;
390 _code_strings = CodeStrings();
391 _last_membar = NULL;
392 }
393
394 void initialize(address code_start, csize_t code_size) {
395 _consts.initialize_outer(this, SECT_CONSTS);
396 _insts.initialize_outer(this, SECT_INSTS);
397 _stubs.initialize_outer(this, SECT_STUBS);
398 _total_start = code_start;
399 _total_size = code_size;
400 // Initialize the main section:
401 _insts.initialize(code_start, code_size);
402 assert(!_stubs.is_allocated(), "no garbage here");
403 assert(!_consts.is_allocated(), "no garbage here");
404 _oop_recorder = &_default_oop_recorder;
405 }
406
407 void initialize_section_size(CodeSection* cs, csize_t size);
408
409 void freeze_section(CodeSection* cs);
410
411 // helper for CodeBuffer::expand()
412 void take_over_code_from(CodeBuffer* cs);
413
414 // ensure sections are disjoint, ordered, and contained in the blob
415 void verify_section_allocation();
416
417 // copies combined relocations to the blob, returns bytes copied
418 // (if target is null, it is a dry run only, just for sizing)
419 csize_t copy_relocations_to(CodeBlob* blob) const;
420
421 // copies combined code to the blob (assumes relocs are already in there)
422 void copy_code_to(CodeBlob* blob);
423
424 // moves code sections to new buffer (assumes relocs are already in there)
425 void relocate_code_to(CodeBuffer* cb) const;
426
427 // set up a model of the final layout of my contents
428 void compute_final_layout(CodeBuffer* dest) const;
429
430 // Expand the given section so at least 'amount' is remaining.
431 // Creates a new, larger BufferBlob, and rewrites the code & relocs.
432 void expand(CodeSection* which_cs, csize_t amount);
433
434 // Helper for expand.
435 csize_t figure_expanded_capacities(CodeSection* which_cs, csize_t amount, csize_t* new_capacity);
436
437 public:
438 // (1) code buffer referring to pre-allocated instruction memory
439 CodeBuffer(address code_start, csize_t code_size) {
440 assert(code_start != NULL, "sanity");
441 initialize_misc("static buffer");
442 initialize(code_start, code_size);
443 verify_section_allocation();
444 }
445
446 // (2) CodeBuffer referring to pre-allocated CodeBlob.
447 CodeBuffer(CodeBlob* blob);
448
449 // (3) code buffer allocating codeBlob memory for code & relocation
450 // info but with lazy initialization. The name must be something
451 // informative.
452 CodeBuffer(const char* name) {
453 initialize_misc(name);
454 }
455
456 // (4) code buffer allocating codeBlob memory for code & relocation
457 // info. The name must be something informative and code_size must
458 // include both code and stubs sizes.
459 CodeBuffer(const char* name, csize_t code_size, csize_t locs_size) {
460 initialize_misc(name);
461 initialize(code_size, locs_size);
462 }
463
464 ~CodeBuffer();
465
466 // Initialize a CodeBuffer constructed using constructor 3. Using
467 // constructor 4 is equivalent to calling constructor 3 and then
468 // calling this method. It's been factored out for convenience of
469 // construction.
470 void initialize(csize_t code_size, csize_t locs_size);
471
472 CodeSection* consts() { return &_consts; }
473 CodeSection* insts() { return &_insts; }
474 CodeSection* stubs() { return &_stubs; }
475
476 const CodeSection* insts() const { return &_insts; }
477
478 // present sections in order; return NULL at end; consts is #0, etc.
479 CodeSection* code_section(int n) {
480 // This makes the slightly questionable but portable assumption
481 // that the various members (_consts, _insts, _stubs, etc.) are
482 // adjacent in the layout of CodeBuffer.
483 CodeSection* cs = &_consts + n;
484 assert(cs->index() == n || !cs->is_allocated(), "sanity");
485 return cs;
486 }
487 const CodeSection* code_section(int n) const { // yucky const stuff
488 return ((CodeBuffer*)this)->code_section(n);
489 }
490 static const char* code_section_name(int n);
491 int section_index_of(address addr) const;
492 bool contains(address addr) const {
493 // handy for debugging
494 return section_index_of(addr) > SECT_NONE;
495 }
496
497 // A stable mapping between 'locators' (small ints) and addresses.
498 static int locator_pos(int locator) { return locator >> sect_bits; }
499 static int locator_sect(int locator) { return locator & sect_mask; }
500 static int locator(int pos, int sect) { return (pos << sect_bits) | sect; }
501 int locator(address addr) const;
502 address locator_address(int locator) const;
503
504 // Heuristic for pre-packing the taken/not-taken bit of a predicted branch.
505 bool is_backward_branch(Label& L);
506
507 // Properties
508 const char* name() const { return _name; }
509 void set_name(const char* name) { _name = name; }
510 CodeBuffer* before_expand() const { return _before_expand; }
511 BufferBlob* blob() const { return _blob; }
512 void set_blob(BufferBlob* blob);
513 void free_blob(); // Free the blob, if we own one.
514
515 // Properties relative to the insts section:
516 address insts_begin() const { return _insts.start(); }
517 address insts_end() const { return _insts.end(); }
518 void set_insts_end(address end) { _insts.set_end(end); }
519 address insts_limit() const { return _insts.limit(); }
520 address insts_mark() const { return _insts.mark(); }
521 void set_insts_mark() { _insts.set_mark(); }
522 void clear_insts_mark() { _insts.clear_mark(); }
523
524 // is there anything in the buffer other than the current section?
525 bool is_pure() const { return insts_size() == total_content_size(); }
526
527 // size in bytes of output so far in the insts sections
528 csize_t insts_size() const { return _insts.size(); }
529
530 // same as insts_size(), except that it asserts there is no non-code here
531 csize_t pure_insts_size() const { assert(is_pure(), "no non-code");
532 return insts_size(); }
533 // capacity in bytes of the insts sections
534 csize_t insts_capacity() const { return _insts.capacity(); }
535
536 // number of bytes remaining in the insts section
537 csize_t insts_remaining() const { return _insts.remaining(); }
538
539 // is a given address in the insts section? (2nd version is end-inclusive)
540 bool insts_contains(address pc) const { return _insts.contains(pc); }
541 bool insts_contains2(address pc) const { return _insts.contains2(pc); }
542
543 // Record any extra oops required to keep embedded metadata alive
544 void finalize_oop_references(const methodHandle& method);
545
546 // Allocated size in all sections, when aligned and concatenated
547 // (this is the eventual state of the content in its final
548 // CodeBlob).
549 csize_t total_content_size() const;
550
551 // Combined offset (relative to start of first section) of given
552 // section, as eventually found in the final CodeBlob.
553 csize_t total_offset_of(const CodeSection* cs) const;
554
555 // allocated size of all relocation data, including index, rounded up
556 csize_t total_relocation_size() const;
557
558 csize_t copy_relocations_to(address buf, csize_t buf_limit, bool only_inst) const;
559
560 // allocated size of any and all recorded oops
561 csize_t total_oop_size() const {
562 OopRecorder* recorder = oop_recorder();
563 return (recorder == NULL)? 0: recorder->oop_size();
564 }
565
566 // allocated size of any and all recorded metadata
567 csize_t total_metadata_size() const {
568 OopRecorder* recorder = oop_recorder();
569 return (recorder == NULL)? 0: recorder->metadata_size();
570 }
571
572 // Configuration functions, called immediately after the CB is constructed.
573 // The section sizes are subtracted from the original insts section.
574 // Note: Call them in reverse section order, because each steals from insts.
575 void initialize_consts_size(csize_t size) { initialize_section_size(&_consts, size); }
576 void initialize_stubs_size(csize_t size) { initialize_section_size(&_stubs, size); }
577 // Override default oop recorder.
578 void initialize_oop_recorder(OopRecorder* r);
579
580 OopRecorder* oop_recorder() const { return _oop_recorder; }
581 CodeStrings& strings() { return _code_strings; }
582
583 address last_membar() const { return _last_membar; }
584 void set_last_membar(address a) { _last_membar = a; }
585 void clear_last_membar() { set_last_membar(NULL); }
586
587 void free_strings() {
588 if (!_code_strings.is_null()) {
589 _code_strings.free(); // sets _strings Null as a side-effect.
590 }
591 }
592
593 // Code generation
594 void relocate(address at, RelocationHolder const& rspec, int format = 0) {
595 _insts.relocate(at, rspec, format);
596 }
597 void relocate(address at, relocInfo::relocType rtype, int format = 0) {
598 _insts.relocate(at, rtype, format);
599 }
600
601 // Management of overflow storage for binding of Labels.
602 GrowableArray<int>* create_patch_overflow();
603
604 // NMethod generation
605 void copy_code_and_locs_to(CodeBlob* blob) {
606 assert(blob != NULL, "sane");
607 copy_relocations_to(blob);
608 copy_code_to(blob);
609 }
610 void copy_values_to(nmethod* nm) {
611 if (!oop_recorder()->is_unused()) {
612 oop_recorder()->copy_values_to(nm);
613 }
614 }
615
616 // Transform an address from the code in this code buffer to a specified code buffer
617 address transform_address(const CodeBuffer &cb, address addr) const;
618
619 void block_comment(intptr_t offset, const char * comment) PRODUCT_RETURN;
620 const char* code_string(const char* str) PRODUCT_RETURN_(return NULL;);
621
622 // Log a little info about section usage in the CodeBuffer
623 void log_section_sizes(const char* name);
624
625 #ifndef PRODUCT
626 public:
627 // Printing / Decoding
628 // decodes from decode_begin() to code_end() and sets decode_begin to end
629 void decode();
630 void decode_all(); // decodes all the code
631 void skip_decode(); // sets decode_begin to code_end();
632 void print();
633 #endif
634
635
636 // The following header contains architecture-specific implementations
637 #include CPU_HEADER(codeBuffer)
638
639 };
640
641
642 inline void CodeSection::freeze() {
643 _outer->freeze_section(this);
644 }
645
646 inline bool CodeSection::maybe_expand_to_ensure_remaining(csize_t amount) {
647 if (remaining() < amount) { _outer->expand(this, amount); return true; }
648 return false;
649 }
650
651 #endif // SHARE_VM_ASM_CODEBUFFER_HPP