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