1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/asm/codeBuffer.hpp Sat Dec 01 00:00:00 2007 +0000
1.3 @@ -0,0 +1,542 @@
1.4 +/*
1.5 + * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
1.24 + * have any questions.
1.25 + *
1.26 + */
1.27 +
1.28 +class CodeComments;
1.29 +class AbstractAssembler;
1.30 +class MacroAssembler;
1.31 +class PhaseCFG;
1.32 +class Compile;
1.33 +class BufferBlob;
1.34 +class CodeBuffer;
1.35 +
1.36 +class CodeOffsets: public StackObj {
1.37 +public:
1.38 + enum Entries { Entry,
1.39 + Verified_Entry,
1.40 + Frame_Complete, // Offset in the code where the frame setup is (for forte stackwalks) is complete
1.41 + OSR_Entry,
1.42 + Exceptions, // Offset where exception handler lives
1.43 + Deopt, // Offset where deopt handler lives
1.44 + max_Entries };
1.45 +
1.46 + // special value to note codeBlobs where profile (forte) stack walking is
1.47 + // always dangerous and suspect.
1.48 +
1.49 + enum { frame_never_safe = -1 };
1.50 +
1.51 +private:
1.52 + int _values[max_Entries];
1.53 +
1.54 +public:
1.55 + CodeOffsets() {
1.56 + _values[Entry] = 0;
1.57 + _values[Verified_Entry] = 0;
1.58 + _values[Frame_Complete] = frame_never_safe;
1.59 + _values[OSR_Entry] = 0;
1.60 + _values[Exceptions] = -1;
1.61 + _values[Deopt] = -1;
1.62 + }
1.63 +
1.64 + int value(Entries e) { return _values[e]; }
1.65 + void set_value(Entries e, int val) { _values[e] = val; }
1.66 +};
1.67 +
1.68 +// This class represents a stream of code and associated relocations.
1.69 +// There are a few in each CodeBuffer.
1.70 +// They are filled concurrently, and concatenated at the end.
1.71 +class CodeSection VALUE_OBJ_CLASS_SPEC {
1.72 + friend class CodeBuffer;
1.73 + public:
1.74 + typedef int csize_t; // code size type; would be size_t except for history
1.75 +
1.76 + private:
1.77 + address _start; // first byte of contents (instructions)
1.78 + address _mark; // user mark, usually an instruction beginning
1.79 + address _end; // current end address
1.80 + address _limit; // last possible (allocated) end address
1.81 + relocInfo* _locs_start; // first byte of relocation information
1.82 + relocInfo* _locs_end; // first byte after relocation information
1.83 + relocInfo* _locs_limit; // first byte after relocation information buf
1.84 + address _locs_point; // last relocated position (grows upward)
1.85 + bool _locs_own; // did I allocate the locs myself?
1.86 + bool _frozen; // no more expansion of this section
1.87 + char _index; // my section number (SECT_INST, etc.)
1.88 + CodeBuffer* _outer; // enclosing CodeBuffer
1.89 +
1.90 + // (Note: _locs_point used to be called _last_reloc_offset.)
1.91 +
1.92 + CodeSection() {
1.93 + _start = NULL;
1.94 + _mark = NULL;
1.95 + _end = NULL;
1.96 + _limit = NULL;
1.97 + _locs_start = NULL;
1.98 + _locs_end = NULL;
1.99 + _locs_limit = NULL;
1.100 + _locs_point = NULL;
1.101 + _locs_own = false;
1.102 + _frozen = false;
1.103 + debug_only(_index = -1);
1.104 + debug_only(_outer = (CodeBuffer*)badAddress);
1.105 + }
1.106 +
1.107 + void initialize_outer(CodeBuffer* outer, int index) {
1.108 + _outer = outer;
1.109 + _index = index;
1.110 + }
1.111 +
1.112 + void initialize(address start, csize_t size = 0) {
1.113 + assert(_start == NULL, "only one init step, please");
1.114 + _start = start;
1.115 + _mark = NULL;
1.116 + _end = start;
1.117 +
1.118 + _limit = start + size;
1.119 + _locs_point = start;
1.120 + }
1.121 +
1.122 + void initialize_locs(int locs_capacity);
1.123 + void expand_locs(int new_capacity);
1.124 + void initialize_locs_from(const CodeSection* source_cs);
1.125 +
1.126 + // helper for CodeBuffer::expand()
1.127 + void take_over_code_from(CodeSection* cs) {
1.128 + _start = cs->_start;
1.129 + _mark = cs->_mark;
1.130 + _end = cs->_end;
1.131 + _limit = cs->_limit;
1.132 + _locs_point = cs->_locs_point;
1.133 + }
1.134 +
1.135 + public:
1.136 + address start() const { return _start; }
1.137 + address mark() const { return _mark; }
1.138 + address end() const { return _end; }
1.139 + address limit() const { return _limit; }
1.140 + csize_t size() const { return (csize_t)(_end - _start); }
1.141 + csize_t mark_off() const { assert(_mark != NULL, "not an offset");
1.142 + return (csize_t)(_mark - _start); }
1.143 + csize_t capacity() const { return (csize_t)(_limit - _start); }
1.144 + csize_t remaining() const { return (csize_t)(_limit - _end); }
1.145 +
1.146 + relocInfo* locs_start() const { return _locs_start; }
1.147 + relocInfo* locs_end() const { return _locs_end; }
1.148 + int locs_count() const { return (int)(_locs_end - _locs_start); }
1.149 + relocInfo* locs_limit() const { return _locs_limit; }
1.150 + address locs_point() const { return _locs_point; }
1.151 + csize_t locs_point_off() const{ return (csize_t)(_locs_point - _start); }
1.152 + csize_t locs_capacity() const { return (csize_t)(_locs_limit - _locs_start); }
1.153 + csize_t locs_remaining()const { return (csize_t)(_locs_limit - _locs_end); }
1.154 +
1.155 + int index() const { return _index; }
1.156 + bool is_allocated() const { return _start != NULL; }
1.157 + bool is_empty() const { return _start == _end; }
1.158 + bool is_frozen() const { return _frozen; }
1.159 + bool has_locs() const { return _locs_end != NULL; }
1.160 +
1.161 + CodeBuffer* outer() const { return _outer; }
1.162 +
1.163 + // is a given address in this section? (2nd version is end-inclusive)
1.164 + bool contains(address pc) const { return pc >= _start && pc < _end; }
1.165 + bool contains2(address pc) const { return pc >= _start && pc <= _end; }
1.166 + bool allocates(address pc) const { return pc >= _start && pc < _limit; }
1.167 + bool allocates2(address pc) const { return pc >= _start && pc <= _limit; }
1.168 +
1.169 + void set_end(address pc) { assert(allocates2(pc),""); _end = pc; }
1.170 + void set_mark(address pc) { assert(contains2(pc),"not in codeBuffer");
1.171 + _mark = pc; }
1.172 + void set_mark_off(int offset) { assert(contains2(offset+_start),"not in codeBuffer");
1.173 + _mark = offset + _start; }
1.174 + void set_mark() { _mark = _end; }
1.175 + void clear_mark() { _mark = NULL; }
1.176 +
1.177 + void set_locs_end(relocInfo* p) {
1.178 + assert(p <= locs_limit(), "locs data fits in allocated buffer");
1.179 + _locs_end = p;
1.180 + }
1.181 + void set_locs_point(address pc) {
1.182 + assert(pc >= locs_point(), "relocation addr may not decrease");
1.183 + assert(allocates2(pc), "relocation addr must be in this section");
1.184 + _locs_point = pc;
1.185 + }
1.186 +
1.187 + // Share a scratch buffer for relocinfo. (Hacky; saves a resource allocation.)
1.188 + void initialize_shared_locs(relocInfo* buf, int length);
1.189 +
1.190 + // Manage labels and their addresses.
1.191 + address target(Label& L, address branch_pc);
1.192 +
1.193 + // Emit a relocation.
1.194 + void relocate(address at, RelocationHolder const& rspec, int format = 0);
1.195 + void relocate(address at, relocInfo::relocType rtype, int format = 0) {
1.196 + if (rtype != relocInfo::none)
1.197 + relocate(at, Relocation::spec_simple(rtype), format);
1.198 + }
1.199 +
1.200 + // alignment requirement for starting offset
1.201 + // Requirements are that the instruction area and the
1.202 + // stubs area must start on CodeEntryAlignment, and
1.203 + // the ctable on sizeof(jdouble)
1.204 + int alignment() const { return MAX2((int)sizeof(jdouble), (int)CodeEntryAlignment); }
1.205 +
1.206 + // Slop between sections, used only when allocating temporary BufferBlob buffers.
1.207 + static csize_t end_slop() { return MAX2((int)sizeof(jdouble), (int)CodeEntryAlignment); }
1.208 +
1.209 + csize_t align_at_start(csize_t off) const { return (csize_t) align_size_up(off, alignment()); }
1.210 +
1.211 + // Mark a section frozen. Assign its remaining space to
1.212 + // the following section. It will never expand after this point.
1.213 + inline void freeze(); // { _outer->freeze_section(this); }
1.214 +
1.215 + // Ensure there's enough space left in the current section.
1.216 + // Return true if there was an expansion.
1.217 + bool maybe_expand_to_ensure_remaining(csize_t amount);
1.218 +
1.219 +#ifndef PRODUCT
1.220 + void decode();
1.221 + void dump();
1.222 + void print(const char* name);
1.223 +#endif //PRODUCT
1.224 +};
1.225 +
1.226 +class CodeComment;
1.227 +class CodeComments VALUE_OBJ_CLASS_SPEC {
1.228 +private:
1.229 +#ifndef PRODUCT
1.230 + CodeComment* _comments;
1.231 +#endif
1.232 +
1.233 +public:
1.234 + CodeComments() {
1.235 +#ifndef PRODUCT
1.236 + _comments = NULL;
1.237 +#endif
1.238 + }
1.239 +
1.240 + void add_comment(intptr_t offset, const char * comment) PRODUCT_RETURN;
1.241 + void print_block_comment(outputStream* stream, intptr_t offset) PRODUCT_RETURN;
1.242 + void assign(CodeComments& other) PRODUCT_RETURN;
1.243 + void free() PRODUCT_RETURN;
1.244 +};
1.245 +
1.246 +
1.247 +// A CodeBuffer describes a memory space into which assembly
1.248 +// code is generated. This memory space usually occupies the
1.249 +// interior of a single BufferBlob, but in some cases it may be
1.250 +// an arbitrary span of memory, even outside the code cache.
1.251 +//
1.252 +// A code buffer comes in two variants:
1.253 +//
1.254 +// (1) A CodeBuffer referring to an already allocated piece of memory:
1.255 +// This is used to direct 'static' code generation (e.g. for interpreter
1.256 +// or stubroutine generation, etc.). This code comes with NO relocation
1.257 +// information.
1.258 +//
1.259 +// (2) A CodeBuffer referring to a piece of memory allocated when the
1.260 +// CodeBuffer is allocated. This is used for nmethod generation.
1.261 +//
1.262 +// The memory can be divided up into several parts called sections.
1.263 +// Each section independently accumulates code (or data) an relocations.
1.264 +// Sections can grow (at the expense of a reallocation of the BufferBlob
1.265 +// and recopying of all active sections). When the buffered code is finally
1.266 +// written to an nmethod (or other CodeBlob), the contents (code, data,
1.267 +// and relocations) of the sections are padded to an alignment and concatenated.
1.268 +// Instructions and data in one section can contain relocatable references to
1.269 +// addresses in a sibling section.
1.270 +
1.271 +class CodeBuffer: public StackObj {
1.272 + friend class CodeSection;
1.273 +
1.274 + private:
1.275 + // CodeBuffers must be allocated on the stack except for a single
1.276 + // special case during expansion which is handled internally. This
1.277 + // is done to guarantee proper cleanup of resources.
1.278 + void* operator new(size_t size) { return ResourceObj::operator new(size); }
1.279 + void operator delete(void* p) { ResourceObj::operator delete(p); }
1.280 +
1.281 + public:
1.282 + typedef int csize_t; // code size type; would be size_t except for history
1.283 + enum {
1.284 + // Here is the list of all possible sections, in order of ascending address.
1.285 + SECT_INSTS, // Executable instructions.
1.286 + SECT_STUBS, // Outbound trampolines for supporting call sites.
1.287 + SECT_CONSTS, // Non-instruction data: Floats, jump tables, etc.
1.288 + SECT_LIMIT, SECT_NONE = -1
1.289 + };
1.290 +
1.291 + private:
1.292 + enum {
1.293 + sect_bits = 2, // assert (SECT_LIMIT <= (1<<sect_bits))
1.294 + sect_mask = (1<<sect_bits)-1
1.295 + };
1.296 +
1.297 + const char* _name;
1.298 +
1.299 + CodeSection _insts; // instructions (the main section)
1.300 + CodeSection _stubs; // stubs (call site support), deopt, exception handling
1.301 + CodeSection _consts; // constants, jump tables
1.302 +
1.303 + CodeBuffer* _before_expand; // dead buffer, from before the last expansion
1.304 +
1.305 + BufferBlob* _blob; // optional buffer in CodeCache for generated code
1.306 + address _total_start; // first address of combined memory buffer
1.307 + csize_t _total_size; // size in bytes of combined memory buffer
1.308 +
1.309 + OopRecorder* _oop_recorder;
1.310 + CodeComments _comments;
1.311 + OopRecorder _default_oop_recorder; // override with initialize_oop_recorder
1.312 + Arena* _overflow_arena;
1.313 +
1.314 + address _decode_begin; // start address for decode
1.315 + address decode_begin();
1.316 +
1.317 + void initialize_misc(const char * name) {
1.318 + // all pointers other than code_start/end and those inside the sections
1.319 + assert(name != NULL, "must have a name");
1.320 + _name = name;
1.321 + _before_expand = NULL;
1.322 + _blob = NULL;
1.323 + _oop_recorder = NULL;
1.324 + _decode_begin = NULL;
1.325 + _overflow_arena = NULL;
1.326 + }
1.327 +
1.328 + void initialize(address code_start, csize_t code_size) {
1.329 + _insts.initialize_outer(this, SECT_INSTS);
1.330 + _stubs.initialize_outer(this, SECT_STUBS);
1.331 + _consts.initialize_outer(this, SECT_CONSTS);
1.332 + _total_start = code_start;
1.333 + _total_size = code_size;
1.334 + // Initialize the main section:
1.335 + _insts.initialize(code_start, code_size);
1.336 + assert(!_stubs.is_allocated(), "no garbage here");
1.337 + assert(!_consts.is_allocated(), "no garbage here");
1.338 + _oop_recorder = &_default_oop_recorder;
1.339 + }
1.340 +
1.341 + void initialize_section_size(CodeSection* cs, csize_t size);
1.342 +
1.343 + void freeze_section(CodeSection* cs);
1.344 +
1.345 + // helper for CodeBuffer::expand()
1.346 + void take_over_code_from(CodeBuffer* cs);
1.347 +
1.348 +#ifdef ASSERT
1.349 + // ensure sections are disjoint, ordered, and contained in the blob
1.350 + bool verify_section_allocation();
1.351 +#endif
1.352 +
1.353 + // copies combined relocations to the blob, returns bytes copied
1.354 + // (if target is null, it is a dry run only, just for sizing)
1.355 + csize_t copy_relocations_to(CodeBlob* blob) const;
1.356 +
1.357 + // copies combined code to the blob (assumes relocs are already in there)
1.358 + void copy_code_to(CodeBlob* blob);
1.359 +
1.360 + // moves code sections to new buffer (assumes relocs are already in there)
1.361 + void relocate_code_to(CodeBuffer* cb) const;
1.362 +
1.363 + // set up a model of the final layout of my contents
1.364 + void compute_final_layout(CodeBuffer* dest) const;
1.365 +
1.366 + // Expand the given section so at least 'amount' is remaining.
1.367 + // Creates a new, larger BufferBlob, and rewrites the code & relocs.
1.368 + void expand(CodeSection* which_cs, csize_t amount);
1.369 +
1.370 + // Helper for expand.
1.371 + csize_t figure_expanded_capacities(CodeSection* which_cs, csize_t amount, csize_t* new_capacity);
1.372 +
1.373 + public:
1.374 + // (1) code buffer referring to pre-allocated instruction memory
1.375 + CodeBuffer(address code_start, csize_t code_size);
1.376 +
1.377 + // (2) code buffer allocating codeBlob memory for code & relocation
1.378 + // info but with lazy initialization. The name must be something
1.379 + // informative.
1.380 + CodeBuffer(const char* name) {
1.381 + initialize_misc(name);
1.382 + }
1.383 +
1.384 +
1.385 + // (3) code buffer allocating codeBlob memory for code & relocation
1.386 + // info. The name must be something informative and code_size must
1.387 + // include both code and stubs sizes.
1.388 + CodeBuffer(const char* name, csize_t code_size, csize_t locs_size) {
1.389 + initialize_misc(name);
1.390 + initialize(code_size, locs_size);
1.391 + }
1.392 +
1.393 + ~CodeBuffer();
1.394 +
1.395 + // Initialize a CodeBuffer constructed using constructor 2. Using
1.396 + // constructor 3 is equivalent to calling constructor 2 and then
1.397 + // calling this method. It's been factored out for convenience of
1.398 + // construction.
1.399 + void initialize(csize_t code_size, csize_t locs_size);
1.400 +
1.401 + CodeSection* insts() { return &_insts; }
1.402 + CodeSection* stubs() { return &_stubs; }
1.403 + CodeSection* consts() { return &_consts; }
1.404 +
1.405 + // present sections in order; return NULL at end; insts is #0, etc.
1.406 + CodeSection* code_section(int n) {
1.407 + // This makes the slightly questionable but portable assumption that
1.408 + // the various members (_insts, _stubs, etc.) are adjacent in the
1.409 + // layout of CodeBuffer.
1.410 + CodeSection* cs = &_insts + n;
1.411 + assert(cs->index() == n || !cs->is_allocated(), "sanity");
1.412 + return cs;
1.413 + }
1.414 + const CodeSection* code_section(int n) const { // yucky const stuff
1.415 + return ((CodeBuffer*)this)->code_section(n);
1.416 + }
1.417 + static const char* code_section_name(int n);
1.418 + int section_index_of(address addr) const;
1.419 + bool contains(address addr) const {
1.420 + // handy for debugging
1.421 + return section_index_of(addr) > SECT_NONE;
1.422 + }
1.423 +
1.424 + // A stable mapping between 'locators' (small ints) and addresses.
1.425 + static int locator_pos(int locator) { return locator >> sect_bits; }
1.426 + static int locator_sect(int locator) { return locator & sect_mask; }
1.427 + static int locator(int pos, int sect) { return (pos << sect_bits) | sect; }
1.428 + int locator(address addr) const;
1.429 + address locator_address(int locator) const;
1.430 +
1.431 + // Properties
1.432 + const char* name() const { return _name; }
1.433 + CodeBuffer* before_expand() const { return _before_expand; }
1.434 + BufferBlob* blob() const { return _blob; }
1.435 + void set_blob(BufferBlob* blob);
1.436 + void free_blob(); // Free the blob, if we own one.
1.437 +
1.438 + // Properties relative to the insts section:
1.439 + address code_begin() const { return _insts.start(); }
1.440 + address code_end() const { return _insts.end(); }
1.441 + void set_code_end(address end) { _insts.set_end(end); }
1.442 + address code_limit() const { return _insts.limit(); }
1.443 + address inst_mark() const { return _insts.mark(); }
1.444 + void set_inst_mark() { _insts.set_mark(); }
1.445 + void clear_inst_mark() { _insts.clear_mark(); }
1.446 +
1.447 + // is there anything in the buffer other than the current section?
1.448 + bool is_pure() const { return code_size() == total_code_size(); }
1.449 +
1.450 + // size in bytes of output so far in the insts sections
1.451 + csize_t code_size() const { return _insts.size(); }
1.452 +
1.453 + // same as code_size(), except that it asserts there is no non-code here
1.454 + csize_t pure_code_size() const { assert(is_pure(), "no non-code");
1.455 + return code_size(); }
1.456 + // capacity in bytes of the insts sections
1.457 + csize_t code_capacity() const { return _insts.capacity(); }
1.458 +
1.459 + // number of bytes remaining in the insts section
1.460 + csize_t code_remaining() const { return _insts.remaining(); }
1.461 +
1.462 + // is a given address in the insts section? (2nd version is end-inclusive)
1.463 + bool code_contains(address pc) const { return _insts.contains(pc); }
1.464 + bool code_contains2(address pc) const { return _insts.contains2(pc); }
1.465 +
1.466 + // allocated size of code in all sections, when aligned and concatenated
1.467 + // (this is the eventual state of the code in its final CodeBlob)
1.468 + csize_t total_code_size() const;
1.469 +
1.470 + // combined offset (relative to start of insts) of given address,
1.471 + // as eventually found in the final CodeBlob
1.472 + csize_t total_offset_of(address addr) const;
1.473 +
1.474 + // allocated size of all relocation data, including index, rounded up
1.475 + csize_t total_relocation_size() const;
1.476 +
1.477 + // allocated size of any and all recorded oops
1.478 + csize_t total_oop_size() const {
1.479 + OopRecorder* recorder = oop_recorder();
1.480 + return (recorder == NULL)? 0: recorder->oop_size();
1.481 + }
1.482 +
1.483 + // Configuration functions, called immediately after the CB is constructed.
1.484 + // The section sizes are subtracted from the original insts section.
1.485 + // Note: Call them in reverse section order, because each steals from insts.
1.486 + void initialize_consts_size(csize_t size) { initialize_section_size(&_consts, size); }
1.487 + void initialize_stubs_size(csize_t size) { initialize_section_size(&_stubs, size); }
1.488 + // Override default oop recorder.
1.489 + void initialize_oop_recorder(OopRecorder* r);
1.490 +
1.491 + OopRecorder* oop_recorder() const { return _oop_recorder; }
1.492 + CodeComments& comments() { return _comments; }
1.493 +
1.494 + // Code generation
1.495 + void relocate(address at, RelocationHolder const& rspec, int format = 0) {
1.496 + _insts.relocate(at, rspec, format);
1.497 + }
1.498 + void relocate(address at, relocInfo::relocType rtype, int format = 0) {
1.499 + _insts.relocate(at, rtype, format);
1.500 + }
1.501 +
1.502 + // Management of overflow storage for binding of Labels.
1.503 + GrowableArray<int>* create_patch_overflow();
1.504 +
1.505 + // NMethod generation
1.506 + void copy_code_and_locs_to(CodeBlob* blob) {
1.507 + assert(blob != NULL, "sane");
1.508 + copy_relocations_to(blob);
1.509 + copy_code_to(blob);
1.510 + }
1.511 + void copy_oops_to(CodeBlob* blob) {
1.512 + if (!oop_recorder()->is_unused()) {
1.513 + oop_recorder()->copy_to(blob);
1.514 + }
1.515 + }
1.516 +
1.517 + // Transform an address from the code in this code buffer to a specified code buffer
1.518 + address transform_address(const CodeBuffer &cb, address addr) const;
1.519 +
1.520 + void block_comment(intptr_t offset, const char * comment) PRODUCT_RETURN;
1.521 +
1.522 +#ifndef PRODUCT
1.523 + public:
1.524 + // Printing / Decoding
1.525 + // decodes from decode_begin() to code_end() and sets decode_begin to end
1.526 + void decode();
1.527 + void decode_all(); // decodes all the code
1.528 + void skip_decode(); // sets decode_begin to code_end();
1.529 + void print();
1.530 +#endif
1.531 +
1.532 +
1.533 + // The following header contains architecture-specific implementations
1.534 + #include "incls/_codeBuffer_pd.hpp.incl"
1.535 +};
1.536 +
1.537 +
1.538 +inline void CodeSection::freeze() {
1.539 + _outer->freeze_section(this);
1.540 +}
1.541 +
1.542 +inline bool CodeSection::maybe_expand_to_ensure_remaining(csize_t amount) {
1.543 + if (remaining() < amount) { _outer->expand(this, amount); return true; }
1.544 + return false;
1.545 +}
