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