1 /*
2 * Copyright (c) 1997, 2025, 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 "compiler/compiler_globals.hpp"
31 #include "runtime/os.hpp"
32 #include "utilities/align.hpp"
33 #include "utilities/debug.hpp"
34 #include "utilities/growableArray.hpp"
35 #include "utilities/linkedlist.hpp"
36 #include "utilities/resizeableResourceHash.hpp"
37 #include "utilities/macros.hpp"
38
39 template <typename T>
40 static inline void put_native(address p, T x) {
41 memcpy((void*)p, &x, sizeof x);
42 }
43
44 class PhaseCFG;
45 class Compile;
46 class BufferBlob;
47 class CodeBuffer;
48 class Label;
49 class ciMethod;
50 class SharedStubToInterpRequest;
51
52 class CodeOffsets: public StackObj {
53 public:
54 enum Entries { Entry,
55 Verified_Entry,
56 Frame_Complete, // Offset in the code where the frame setup is (for forte stackwalks) is complete
57 OSR_Entry,
58 Exceptions, // Offset where exception handler lives
59 Deopt, // Offset where deopt handler lives
60 DeoptMH, // Offset where MethodHandle deopt handler lives
61 UnwindHandler, // Offset to default unwind handler
62 max_Entries };
63
64 // special value to note codeBlobs where profile (forte) stack walking is
65 // always dangerous and suspect.
66
67 enum { frame_never_safe = -1 };
68
69 private:
70 int _values[max_Entries];
71
72 public:
73 CodeOffsets() {
74 _values[Entry ] = 0;
75 _values[Verified_Entry] = 0;
76 _values[Frame_Complete] = frame_never_safe;
77 _values[OSR_Entry ] = 0;
78 _values[Exceptions ] = -1;
79 _values[Deopt ] = -1;
80 _values[DeoptMH ] = -1;
81 _values[UnwindHandler ] = -1;
82 }
83
84 int value(Entries e) { return _values[e]; }
85 void set_value(Entries e, int val) { _values[e] = val; }
86 };
87
88 // This class represents a stream of code and associated relocations.
89 // There are a few in each CodeBuffer.
90 // They are filled concurrently, and concatenated at the end.
91 class CodeSection {
92 friend class CodeBuffer;
93 friend class SCCReader;
94 public:
95 typedef int csize_t; // code size type; would be size_t except for history
96
97 private:
98 address _start; // first byte of contents (instructions)
99 address _mark; // user mark, usually an instruction beginning
100 address _end; // current end address
101 address _limit; // last possible (allocated) end address
102 relocInfo* _locs_start; // first byte of relocation information
103 relocInfo* _locs_end; // first byte after relocation information
104 relocInfo* _locs_limit; // first byte after relocation information buf
105 address _locs_point; // last relocated position (grows upward)
106 bool _locs_own; // did I allocate the locs myself?
107 bool _scratch_emit; // Buffer is used for scratch emit, don't relocate.
108 int _skipped_instructions_size;
109 int8_t _index; // my section number (SECT_INST, etc.)
110 CodeBuffer* _outer; // enclosing CodeBuffer
111
112 // (Note: _locs_point used to be called _last_reloc_offset.)
113
114 CodeSection() {
115 _start = nullptr;
116 _mark = nullptr;
117 _end = nullptr;
118 _limit = nullptr;
119 _locs_start = nullptr;
120 _locs_end = nullptr;
121 _locs_limit = nullptr;
122 _locs_point = nullptr;
123 _locs_own = false;
124 _scratch_emit = false;
125 _skipped_instructions_size = 0;
126 debug_only(_index = -1);
127 debug_only(_outer = (CodeBuffer*)badAddress);
128 }
129
130 void initialize_outer(CodeBuffer* outer, int8_t index) {
131 _outer = outer;
132 _index = index;
133 }
134
135 void initialize(address start, csize_t size = 0) {
136 assert(_start == nullptr, "only one init step, please");
137 _start = start;
138 _mark = nullptr;
139 _end = start;
140
141 _limit = start + size;
142 _locs_point = start;
143 }
144
145 void initialize_locs(int locs_capacity);
146 void expand_locs(int new_capacity);
147 void initialize_locs_from(const CodeSection* source_cs);
148
149 // helper for CodeBuffer::expand()
150 void take_over_code_from(CodeSection* cs) {
151 _start = cs->_start;
152 _mark = cs->_mark;
153 _end = cs->_end;
154 _limit = cs->_limit;
155 _locs_point = cs->_locs_point;
156 _skipped_instructions_size = cs->_skipped_instructions_size;
157 }
158
159 public:
160 address start() const { return _start; }
161 address mark() const { return _mark; }
162 address end() const { return _end; }
163 address limit() const { return _limit; }
164 csize_t size() const { return (csize_t)(_end - _start); }
165 csize_t mark_off() const { assert(_mark != nullptr, "not an offset");
166 return (csize_t)(_mark - _start); }
167 csize_t capacity() const { return (csize_t)(_limit - _start); }
168 csize_t remaining() const { return (csize_t)(_limit - _end); }
169
170 relocInfo* locs_start() const { return _locs_start; }
171 relocInfo* locs_end() const { return _locs_end; }
172 int locs_count() const { return (int)(_locs_end - _locs_start); }
173 relocInfo* locs_limit() const { return _locs_limit; }
174 address locs_point() const { return _locs_point; }
175 csize_t locs_point_off() const{ return (csize_t)(_locs_point - _start); }
176 csize_t locs_capacity() const { return (csize_t)(_locs_limit - _locs_start); }
177
178 int8_t index() const { return _index; }
179 bool is_allocated() const { return _start != nullptr; }
180 bool is_empty() const { return _start == _end; }
181 bool has_locs() const { return _locs_end != nullptr; }
182
183 // Mark scratch buffer.
184 void set_scratch_emit() { _scratch_emit = true; }
185 void clear_scratch_emit() { _scratch_emit = false; }
186 bool scratch_emit() { return _scratch_emit; }
187
188 CodeBuffer* outer() const { return _outer; }
189
190 // is a given address in this section? (2nd version is end-inclusive)
191 bool contains(address pc) const { return pc >= _start && pc < _end; }
192 bool contains2(address pc) const { return pc >= _start && pc <= _end; }
193 bool allocates(address pc) const { return pc >= _start && pc < _limit; }
194 bool allocates2(address pc) const { return pc >= _start && pc <= _limit; }
195
196 // checks if two CodeSections are disjoint
197 //
198 // limit is an exclusive address and can be the start of another
199 // section.
200 bool disjoint(CodeSection* cs) const { return cs->_limit <= _start || cs->_start >= _limit; }
201
202 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; }
203 void set_mark(address pc) { assert(contains2(pc), "not in codeBuffer");
204 _mark = pc; }
205 void set_mark() { _mark = _end; }
206 void clear_mark() { _mark = nullptr; }
207
208 void set_locs_end(relocInfo* p) {
209 assert(p <= locs_limit(), "locs data fits in allocated buffer");
210 _locs_end = p;
211 }
212 void set_locs_point(address pc) {
213 assert(pc >= locs_point(), "relocation addr may not decrease");
214 assert(allocates2(pc), "relocation addr " INTPTR_FORMAT " must be in this section from " INTPTR_FORMAT " to " INTPTR_FORMAT, p2i(pc), p2i(_start), p2i(_limit));
215 _locs_point = pc;
216 }
217
218 void register_skipped(int size) {
219 _skipped_instructions_size += size;
220 }
221
222 // Code emission
223 void emit_int8(uint8_t x1) {
224 address curr = end();
225 *((uint8_t*) curr++) = x1;
226 set_end(curr);
227 }
228
229 template <typename T>
230 void emit_native(T x) { put_native(end(), x); set_end(end() + sizeof x); }
231
232 void emit_int16(uint16_t x) { emit_native(x); }
233 void emit_int16(uint8_t x1, uint8_t x2) {
234 address curr = end();
235 *((uint8_t*) curr++) = x1;
236 *((uint8_t*) curr++) = x2;
237 set_end(curr);
238 }
239
240 void emit_int24(uint8_t x1, uint8_t x2, uint8_t x3) {
241 address curr = end();
242 *((uint8_t*) curr++) = x1;
243 *((uint8_t*) curr++) = x2;
244 *((uint8_t*) curr++) = x3;
245 set_end(curr);
246 }
247
248 void emit_int32(uint32_t x) { emit_native(x); }
249 void emit_int32(uint8_t x1, uint8_t x2, uint8_t x3, uint8_t x4) {
250 address curr = end();
251 *((uint8_t*) curr++) = x1;
252 *((uint8_t*) curr++) = x2;
253 *((uint8_t*) curr++) = x3;
254 *((uint8_t*) curr++) = x4;
255 set_end(curr);
256 }
257
258 void emit_int64(uint64_t x) { emit_native(x); }
259 void emit_float(jfloat x) { emit_native(x); }
260 void emit_double(jdouble x) { emit_native(x); }
261 void emit_address(address x) { emit_native(x); }
262
263 // Share a scratch buffer for relocinfo. (Hacky; saves a resource allocation.)
264 void initialize_shared_locs(relocInfo* buf, int length);
265
266 // Manage labels and their addresses.
267 address target(Label& L, address branch_pc);
268
269 // Emit a relocation.
270 void relocate(address at, RelocationHolder const& rspec, int format = 0);
271 void relocate(address at, relocInfo::relocType rtype, int format = 0, jint method_index = 0);
272
273 int alignment() const;
274
275 // Slop between sections, used only when allocating temporary BufferBlob buffers.
276 static csize_t end_slop() { return MAX2((int)sizeof(jdouble), (int)CodeEntryAlignment); }
277
278 csize_t align_at_start(csize_t off) const {
279 return (csize_t) align_up(off, alignment());
280 }
281
282 // Ensure there's enough space left in the current section.
283 // Return true if there was an expansion.
284 bool maybe_expand_to_ensure_remaining(csize_t amount);
285
286 #ifndef PRODUCT
287 void decode();
288 void print_on(outputStream* st, const char* name);
289 #endif //PRODUCT
290 };
291
292
293 #ifndef PRODUCT
294
295 class CHeapString : public CHeapObj<mtCode> {
296 public:
297 CHeapString(const char* str) : _string(os::strdup(str)) {}
298 ~CHeapString() {
299 os::free((void*)_string);
300 _string = nullptr;
301 }
302 const char* string() const { return _string; }
303
304 private:
305 const char* _string;
306 };
307
308 class AsmRemarkCollection : public CHeapObj<mtCode> {
309 public:
310 AsmRemarkCollection() : _ref_cnt(1), _remarks(nullptr), _next(nullptr) {}
311 ~AsmRemarkCollection() {
312 assert(is_empty(), "Must 'clear()' before deleting!");
313 assert(_ref_cnt == 0, "No uses must remain when deleting!");
314 }
315 AsmRemarkCollection* reuse() {
316 precond(_ref_cnt > 0);
317 return _ref_cnt++, this;
318 }
319
320 const char* insert(uint offset, const char* remark);
321 const char* lookup(uint offset) const;
322 const char* next(uint offset) const;
323
324 bool is_empty() const { return _remarks == nullptr; }
325 uint clear();
326
327 template<typename Function>
328 bool iterate(Function function) const { // lambda enabled API
329 if (_remarks != nullptr) {
330 Cell* tmp = _remarks;
331 do {
332 if(!function(tmp->offset, tmp->string())) {
333 return false;
334 }
335 tmp = tmp->next;
336 } while (tmp != _remarks);
337 }
338 return true;
339 }
340
341 private:
342 struct Cell : CHeapString {
343 Cell(const char* remark, uint offset) :
344 CHeapString(remark), offset(offset), prev(nullptr), next(nullptr) {}
345 void push_back(Cell* cell) {
346 Cell* head = this;
347 Cell* tail = prev;
348 tail->next = cell;
349 cell->next = head;
350 cell->prev = tail;
351 prev = cell;
352 }
353 uint offset;
354 Cell* prev;
355 Cell* next;
356 };
357 uint _ref_cnt;
358 Cell* _remarks;
359 // Using a 'mutable' iteration pointer to allow 'const' on lookup/next (that
360 // does not change the state of the list per se), supportig a simplistic
361 // iteration scheme.
362 mutable Cell* _next;
363 };
364
365 // The assumption made here is that most code remarks (or comments) added to
366 // the generated assembly code are unique, i.e. there is very little gain in
367 // trying to share the strings between the different offsets tracked in a
368 // buffer (or blob).
369
370 class AsmRemarks {
371 public:
372 AsmRemarks();
373 ~AsmRemarks();
374
375 static void init(AsmRemarks& asm_remarks);
376
377 const char* insert(uint offset, const char* remstr);
378
379 bool is_empty() const;
380
381 void share(const AsmRemarks &src);
382 void clear();
383 uint print(uint offset, outputStream* strm = tty) const;
384
385 // For testing purposes only.
386 const AsmRemarkCollection* ref() const { return _remarks; }
387
388 template<typename Function>
389 bool iterate(Function function) const { return _remarks->iterate(function); }
390
391 private:
392 AsmRemarkCollection* _remarks;
393 };
394
395 class DbgStringCollection : public CHeapObj<mtCode> {
396 public:
397 DbgStringCollection() : _ref_cnt(1), _strings(nullptr) {}
398 ~DbgStringCollection() {
399 assert(is_empty(), "Must 'clear()' before deleting!");
400 assert(_ref_cnt == 0, "No uses must remain when deleting!");
401 }
402 DbgStringCollection* reuse() {
403 precond(_ref_cnt > 0);
404 return _ref_cnt++, this;
405 }
406
407 const char* insert(const char* str);
408 const char* lookup(const char* str) const;
409
410 bool is_empty() const { return _strings == nullptr; }
411 uint clear();
412
413 template<typename Function>
414 bool iterate(Function function) const { // lambda enabled API
415 if (_strings != nullptr) {
416 Cell* tmp = _strings;
417 do {
418 if (!function(tmp->string())) {
419 return false;
420 }
421 tmp = tmp->next;
422 } while (tmp != _strings);
423 }
424 return true;
425 }
426
427 private:
428 struct Cell : CHeapString {
429 Cell(const char* dbgstr) :
430 CHeapString(dbgstr), prev(nullptr), next(nullptr) {}
431 void push_back(Cell* cell) {
432 Cell* head = this;
433 Cell* tail = prev;
434 tail->next = cell;
435 cell->next = head;
436 cell->prev = tail;
437 prev = cell;
438 }
439 Cell* prev;
440 Cell* next;
441 };
442 uint _ref_cnt;
443 Cell* _strings;
444 };
445
446 // The assumption made here is that the number of debug strings (with a fixed
447 // address requirement) is a rather small set per compilation unit.
448
449 class DbgStrings {
450 public:
451 DbgStrings();
452 ~DbgStrings();
453
454 static void init(DbgStrings& dbg_strings);
455
456 const char* insert(const char* dbgstr);
457
458 bool is_empty() const;
459
460 void share(const DbgStrings &src);
461 void clear();
462
463 // For testing purposes only.
464 const DbgStringCollection* ref() const { return _strings; }
465
466 template<typename Function>
467 bool iterate(Function function) const { return _strings->iterate(function); }
468
469 private:
470 DbgStringCollection* _strings;
471 };
472 #endif // not PRODUCT
473
474
475 #ifdef ASSERT
476 #include "utilities/copy.hpp"
477
478 class Scrubber {
479 public:
480 Scrubber(void* addr, size_t size) : _addr(addr), _size(size) {}
481 ~Scrubber() {
482 Copy::fill_to_bytes(_addr, _size, badResourceValue);
483 }
484 private:
485 void* _addr;
486 size_t _size;
487 };
488 #endif // ASSERT
489
490 typedef GrowableArray<SharedStubToInterpRequest> SharedStubToInterpRequests;
491
492 // A CodeBuffer describes a memory space into which assembly
493 // code is generated. This memory space usually occupies the
494 // interior of a single BufferBlob, but in some cases it may be
495 // an arbitrary span of memory, even outside the code cache.
496 //
497 // A code buffer comes in two variants:
498 //
499 // (1) A CodeBuffer referring to an already allocated piece of memory:
500 // This is used to direct 'static' code generation (e.g. for interpreter
501 // or stubroutine generation, etc.). This code comes with NO relocation
502 // information.
503 //
504 // (2) A CodeBuffer referring to a piece of memory allocated when the
505 // CodeBuffer is allocated. This is used for nmethod generation.
506 //
507 // The memory can be divided up into several parts called sections.
508 // Each section independently accumulates code (or data) an relocations.
509 // Sections can grow (at the expense of a reallocation of the BufferBlob
510 // and recopying of all active sections). When the buffered code is finally
511 // written to an nmethod (or other CodeBlob), the contents (code, data,
512 // and relocations) of the sections are padded to an alignment and concatenated.
513 // Instructions and data in one section can contain relocatable references to
514 // addresses in a sibling section.
515
516 class CodeBuffer: public StackObj DEBUG_ONLY(COMMA private Scrubber) {
517 friend class CodeSection;
518 friend class StubCodeGenerator;
519 friend class SCCReader;
520
521 private:
522 // CodeBuffers must be allocated on the stack except for a single
523 // special case during expansion which is handled internally. This
524 // is done to guarantee proper cleanup of resources.
525 void* operator new(size_t size) throw() { return resource_allocate_bytes(size); }
526 void operator delete(void* p) { ShouldNotCallThis(); }
527
528 public:
529 typedef int csize_t; // code size type; would be size_t except for history
530 enum : int8_t {
531 // Here is the list of all possible sections. The order reflects
532 // the final layout.
533 SECT_FIRST = 0,
534 SECT_CONSTS = SECT_FIRST, // Non-instruction data: Floats, jump tables, etc.
535 SECT_INSTS, // Executable instructions.
536 SECT_STUBS, // Outbound trampolines for supporting call sites.
537 SECT_LIMIT, SECT_NONE = -1
538 };
539
540 typedef LinkedListImpl<int> Offsets;
541 typedef ResizeableResourceHashtable<address, Offsets, AnyObj::C_HEAP, mtCompiler> SharedTrampolineRequests;
542
543 private:
544 enum {
545 sect_bits = 2, // assert (SECT_LIMIT <= (1<<sect_bits))
546 sect_mask = (1<<sect_bits)-1
547 };
548
549 const char* _name;
550
551 CodeSection _consts; // constants, jump tables
552 CodeSection _insts; // instructions (the main section)
553 CodeSection _stubs; // stubs (call site support), deopt, exception handling
554
555 CodeBuffer* _before_expand; // dead buffer, from before the last expansion
556
557 BufferBlob* _blob; // optional buffer in CodeCache for generated code
558 address _total_start; // first address of combined memory buffer
559 csize_t _total_size; // size in bytes of combined memory buffer
560
561 OopRecorder* _oop_recorder;
562
563 OopRecorder _default_oop_recorder; // override with initialize_oop_recorder
564 Arena* _overflow_arena;
565
566 address _last_insn; // used to merge consecutive memory barriers, loads or stores.
567 address _last_label; // record last bind label address, it's also the start of current bb.
568
569 SharedStubToInterpRequests* _shared_stub_to_interp_requests; // used to collect requests for shared iterpreter stubs
570 SharedTrampolineRequests* _shared_trampoline_requests; // used to collect requests for shared trampolines
571 bool _finalize_stubs; // Indicate if we need to finalize stubs to make CodeBuffer final.
572
573 int _const_section_alignment;
574
575 #ifndef PRODUCT
576 AsmRemarks _asm_remarks;
577 DbgStrings _dbg_strings;
578 bool _collect_comments; // Indicate if we need to collect block comments at all.
579 address _decode_begin; // start address for decode
580 address decode_begin();
581 #endif
582
583 void initialize_misc(const char * name) {
584 // all pointers other than code_start/end and those inside the sections
585 assert(name != nullptr, "must have a name");
586 _name = name;
587 _before_expand = nullptr;
588 _blob = nullptr;
589 _total_start = nullptr;
590 _total_size = 0;
591 _oop_recorder = nullptr;
592 _overflow_arena = nullptr;
593 _last_insn = nullptr;
594 _last_label = nullptr;
595 _finalize_stubs = false;
596 _shared_stub_to_interp_requests = nullptr;
597 _shared_trampoline_requests = nullptr;
598
599 _consts.initialize_outer(this, SECT_CONSTS);
600 _insts.initialize_outer(this, SECT_INSTS);
601 _stubs.initialize_outer(this, SECT_STUBS);
602
603 // Default is to align on 8 bytes. A compiler can change this
604 // if larger alignment (e.g., 32-byte vector masks) is required.
605 _const_section_alignment = (int) sizeof(jdouble);
606
607 #ifndef PRODUCT
608 _decode_begin = nullptr;
609 // Collect block comments, but restrict collection to cases where a disassembly is output.
610 _collect_comments = ( PrintAssembly
611 || PrintStubCode
612 || PrintMethodHandleStubs
613 || PrintInterpreter
614 || PrintSignatureHandlers
615 || UnlockDiagnosticVMOptions
616 );
617 #endif
618 }
619
620 void initialize(address code_start, csize_t code_size) {
621 _total_start = code_start;
622 _total_size = code_size;
623 // Initialize the main section:
624 _insts.initialize(code_start, code_size);
625 assert(!_stubs.is_allocated(), "no garbage here");
626 assert(!_consts.is_allocated(), "no garbage here");
627 _oop_recorder = &_default_oop_recorder;
628 }
629
630 void initialize_section_size(CodeSection* cs, csize_t size);
631
632 // helper for CodeBuffer::expand()
633 void take_over_code_from(CodeBuffer* cs);
634
635 // ensure sections are disjoint, ordered, and contained in the blob
636 void verify_section_allocation();
637
638 // copies combined relocations to the blob, returns bytes copied
639 // (if target is null, it is a dry run only, just for sizing)
640 csize_t copy_relocations_to(CodeBlob* blob) const;
641
642 // copies combined code to the blob (assumes relocs are already in there)
643 void copy_code_to(CodeBlob* blob);
644
645 // moves code sections to new buffer (assumes relocs are already in there)
646 void relocate_code_to(CodeBuffer* cb) const;
647
648 // adjust some internal address during expand
649 void adjust_internal_address(address from, address to);
650
651 // set up a model of the final layout of my contents
652 void compute_final_layout(CodeBuffer* dest) const;
653
654 // Expand the given section so at least 'amount' is remaining.
655 // Creates a new, larger BufferBlob, and rewrites the code & relocs.
656 void expand(CodeSection* which_cs, csize_t amount);
657
658 // Helper for expand.
659 csize_t figure_expanded_capacities(CodeSection* which_cs, csize_t amount, csize_t* new_capacity);
660
661 public:
662 // (1) code buffer referring to pre-allocated instruction memory
663 CodeBuffer(address code_start, csize_t code_size)
664 DEBUG_ONLY(: Scrubber(this, sizeof(*this)))
665 {
666 assert(code_start != nullptr, "sanity");
667 initialize_misc("static buffer");
668 initialize(code_start, code_size);
669 debug_only(verify_section_allocation();)
670 }
671
672 // (2) CodeBuffer referring to pre-allocated CodeBlob.
673 CodeBuffer(CodeBlob* blob);
674
675 // (3) code buffer allocating codeBlob memory for code & relocation
676 // info but with lazy initialization. The name must be something
677 // informative.
678 CodeBuffer(const char* name)
679 DEBUG_ONLY(: Scrubber(this, sizeof(*this)))
680 {
681 initialize_misc(name);
682 }
683
684 // (4) code buffer allocating codeBlob memory for code & relocation
685 // info. The name must be something informative and code_size must
686 // include both code and stubs sizes.
687 CodeBuffer(const char* name, csize_t code_size, csize_t locs_size)
688 DEBUG_ONLY(: Scrubber(this, sizeof(*this)))
689 {
690 initialize_misc(name);
691 initialize(code_size, locs_size);
692 }
693
694 ~CodeBuffer();
695
696 // Initialize a CodeBuffer constructed using constructor 3. Using
697 // constructor 4 is equivalent to calling constructor 3 and then
698 // calling this method. It's been factored out for convenience of
699 // construction.
700 void initialize(csize_t code_size, csize_t locs_size);
701
702 CodeSection* consts() { return &_consts; }
703 CodeSection* insts() { return &_insts; }
704 CodeSection* stubs() { return &_stubs; }
705
706 const CodeSection* insts() const { return &_insts; }
707
708 // present sections in order; return null at end; consts is #0, etc.
709 CodeSection* code_section(int n) {
710 // This makes the slightly questionable but portable assumption
711 // that the various members (_consts, _insts, _stubs, etc.) are
712 // adjacent in the layout of CodeBuffer.
713 CodeSection* cs = &_consts + n;
714 assert(cs->index() == n || !cs->is_allocated(), "sanity");
715 return cs;
716 }
717 const CodeSection* code_section(int n) const { // yucky const stuff
718 return ((CodeBuffer*)this)->code_section(n);
719 }
720 static const char* code_section_name(int n);
721 int section_index_of(address addr) const;
722 bool contains(address addr) const {
723 // handy for debugging
724 return section_index_of(addr) > SECT_NONE;
725 }
726
727 // A stable mapping between 'locators' (small ints) and addresses.
728 static int locator_pos(int locator) { return locator >> sect_bits; }
729 static int locator_sect(int locator) { return locator & sect_mask; }
730 static int locator(int pos, int sect) { return (pos << sect_bits) | sect; }
731 int locator(address addr) const;
732 address locator_address(int locator) const {
733 if (locator < 0) return nullptr;
734 address start = code_section(locator_sect(locator))->start();
735 return start + locator_pos(locator);
736 }
737
738 // Heuristic for pre-packing the taken/not-taken bit of a predicted branch.
739 bool is_backward_branch(Label& L);
740
741 // Properties
742 const char* name() const { return _name; }
743 CodeBuffer* before_expand() const { return _before_expand; }
744 BufferBlob* blob() const { return _blob; }
745 void set_blob(BufferBlob* blob);
746 void free_blob(); // Free the blob, if we own one.
747
748 // Properties relative to the insts section:
749 address insts_begin() const { return _insts.start(); }
750 address insts_end() const { return _insts.end(); }
751 void set_insts_end(address end) { _insts.set_end(end); }
752 address insts_mark() const { return _insts.mark(); }
753 void set_insts_mark() { _insts.set_mark(); }
754
755 // is there anything in the buffer other than the current section?
756 bool is_pure() const { return insts_size() == total_content_size(); }
757
758 // size in bytes of output so far in the insts sections
759 csize_t insts_size() const { return _insts.size(); }
760
761 // same as insts_size(), except that it asserts there is no non-code here
762 csize_t pure_insts_size() const { assert(is_pure(), "no non-code");
763 return insts_size(); }
764 // capacity in bytes of the insts sections
765 csize_t insts_capacity() const { return _insts.capacity(); }
766
767 // number of bytes remaining in the insts section
768 csize_t insts_remaining() const { return _insts.remaining(); }
769
770 // is a given address in the insts section? (2nd version is end-inclusive)
771 bool insts_contains(address pc) const { return _insts.contains(pc); }
772 bool insts_contains2(address pc) const { return _insts.contains2(pc); }
773
774 // Record any extra oops required to keep embedded metadata alive
775 void finalize_oop_references(const methodHandle& method);
776
777 // Allocated size in all sections, when aligned and concatenated
778 // (this is the eventual state of the content in its final
779 // CodeBlob).
780 csize_t total_content_size() const;
781
782 // Combined offset (relative to start of first section) of given
783 // section, as eventually found in the final CodeBlob.
784 csize_t total_offset_of(const CodeSection* cs) const;
785
786 // allocated size of all relocation data, including index, rounded up
787 csize_t total_relocation_size() const;
788
789 int total_skipped_instructions_size() const;
790
791 csize_t copy_relocations_to(address buf, csize_t buf_limit, bool only_inst) const;
792
793 // allocated size of any and all recorded oops
794 csize_t total_oop_size() const {
795 OopRecorder* recorder = oop_recorder();
796 return (recorder == nullptr)? 0: recorder->oop_size();
797 }
798
799 // allocated size of any and all recorded metadata
800 csize_t total_metadata_size() const {
801 OopRecorder* recorder = oop_recorder();
802 return (recorder == nullptr)? 0: recorder->metadata_size();
803 }
804
805 // Configuration functions, called immediately after the CB is constructed.
806 // The section sizes are subtracted from the original insts section.
807 // Note: Call them in reverse section order, because each steals from insts.
808 void initialize_consts_size(csize_t size) { initialize_section_size(&_consts, size); }
809 void initialize_stubs_size(csize_t size) { initialize_section_size(&_stubs, size); }
810 // Override default oop recorder.
811 void initialize_oop_recorder(OopRecorder* r);
812
813 OopRecorder* oop_recorder() const { return _oop_recorder; }
814
815 address last_insn() const { return _last_insn; }
816 void set_last_insn(address a) { _last_insn = a; }
817 void clear_last_insn() { set_last_insn(nullptr); }
818
819 address last_label() const { return _last_label; }
820 void set_last_label(address a) { _last_label = a; }
821
822 #ifndef PRODUCT
823 AsmRemarks &asm_remarks() { return _asm_remarks; }
824 DbgStrings &dbg_strings() { return _dbg_strings; }
825
826 void clear_strings() {
827 _asm_remarks.clear();
828 _dbg_strings.clear();
829 }
830 #endif
831
832 // Code generation
833 void relocate(address at, RelocationHolder const& rspec, int format = 0) {
834 _insts.relocate(at, rspec, format);
835 }
836 void relocate(address at, relocInfo::relocType rtype, int format = 0) {
837 _insts.relocate(at, rtype, format);
838 }
839
840 // Management of overflow storage for binding of Labels.
841 GrowableArray<int>* create_patch_overflow();
842
843 // NMethod generation
844 void copy_code_and_locs_to(CodeBlob* blob) {
845 assert(blob != nullptr, "sane");
846 copy_relocations_to(blob);
847 copy_code_to(blob);
848 }
849 void copy_values_to(nmethod* nm) {
850 if (!oop_recorder()->is_unused()) {
851 oop_recorder()->copy_values_to(nm);
852 }
853 }
854
855 void block_comment(ptrdiff_t offset, const char* comment) PRODUCT_RETURN;
856 const char* code_string(const char* str) PRODUCT_RETURN_(return nullptr;);
857
858 // Log a little info about section usage in the CodeBuffer
859 void log_section_sizes(const char* name);
860
861 // Make a set of stubs final. It can create/optimize stubs.
862 bool finalize_stubs();
863
864 // Request for a shared stub to the interpreter
865 void shared_stub_to_interp_for(ciMethod* callee, csize_t call_offset);
866
867 void set_const_section_alignment(int align) {
868 _const_section_alignment = align_up(align, HeapWordSize);
869 }
870
871 #ifndef PRODUCT
872 public:
873 // Printing / Decoding
874 // decodes from decode_begin() to code_end() and sets decode_begin to end
875 void decode();
876 void print_on(outputStream* st);
877 #endif
878 // Directly disassemble code buffer.
879 void decode(address start, address end);
880
881 // The following header contains architecture-specific implementations
882 #include CPU_HEADER(codeBuffer)
883
884 };
885
886 // A Java method can have calls of Java methods which can be statically bound.
887 // Calls of Java methods need stubs to the interpreter. Calls sharing the same Java method
888 // can share a stub to the interpreter.
889 // A SharedStubToInterpRequest is a request for a shared stub to the interpreter.
890 class SharedStubToInterpRequest : public ResourceObj {
891 private:
892 ciMethod* _shared_method;
893 CodeBuffer::csize_t _call_offset; // The offset of the call in CodeBuffer
894
895 public:
896 SharedStubToInterpRequest(ciMethod* method = nullptr, CodeBuffer::csize_t call_offset = -1) : _shared_method(method),
897 _call_offset(call_offset) {}
898
899 ciMethod* shared_method() const { return _shared_method; }
900 CodeBuffer::csize_t call_offset() const { return _call_offset; }
901 };
902
903 inline bool CodeSection::maybe_expand_to_ensure_remaining(csize_t amount) {
904 if (remaining() < amount) { _outer->expand(this, amount); return true; }
905 return false;
906 }
907
908 #endif // SHARE_ASM_CODEBUFFER_HPP