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