src/share/vm/opto/machnode.hpp

Tue, 16 Apr 2013 10:08:41 +0200

author
neliasso
date
Tue, 16 Apr 2013 10:08:41 +0200
changeset 4949
8373c19be854
parent 4037
da91efe96a93
child 5614
9758d9f36299
permissions
-rw-r--r--

8011621: live_ranges_in_separate_class.patch
Reviewed-by: kvn, roland
Contributed-by: niclas.adlertz@oracle.com

duke@435 1 /*
kvn@3882 2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #ifndef SHARE_VM_OPTO_MACHNODE_HPP
stefank@2314 26 #define SHARE_VM_OPTO_MACHNODE_HPP
stefank@2314 27
stefank@2314 28 #include "opto/callnode.hpp"
stefank@2314 29 #include "opto/matcher.hpp"
stefank@2314 30 #include "opto/multnode.hpp"
stefank@2314 31 #include "opto/node.hpp"
stefank@2314 32 #include "opto/regmask.hpp"
stefank@2314 33
duke@435 34 class BufferBlob;
duke@435 35 class CodeBuffer;
duke@435 36 class JVMState;
duke@435 37 class MachCallDynamicJavaNode;
duke@435 38 class MachCallJavaNode;
duke@435 39 class MachCallLeafNode;
duke@435 40 class MachCallNode;
duke@435 41 class MachCallRuntimeNode;
duke@435 42 class MachCallStaticJavaNode;
duke@435 43 class MachEpilogNode;
duke@435 44 class MachIfNode;
duke@435 45 class MachNullCheckNode;
duke@435 46 class MachOper;
duke@435 47 class MachProjNode;
duke@435 48 class MachPrologNode;
duke@435 49 class MachReturnNode;
duke@435 50 class MachSafePointNode;
duke@435 51 class MachSpillCopyNode;
duke@435 52 class Matcher;
duke@435 53 class PhaseRegAlloc;
duke@435 54 class RegMask;
duke@435 55 class State;
duke@435 56
duke@435 57 //---------------------------MachOper------------------------------------------
duke@435 58 class MachOper : public ResourceObj {
duke@435 59 public:
duke@435 60 // Allocate right next to the MachNodes in the same arena
duke@435 61 void *operator new( size_t x, Compile* C ) { return C->node_arena()->Amalloc_D(x); }
duke@435 62
duke@435 63 // Opcode
duke@435 64 virtual uint opcode() const = 0;
duke@435 65
duke@435 66 // Number of input edges.
duke@435 67 // Generally at least 1
duke@435 68 virtual uint num_edges() const { return 1; }
duke@435 69 // Array of Register masks
duke@435 70 virtual const RegMask *in_RegMask(int index) const;
duke@435 71
duke@435 72 // Methods to output the encoding of the operand
duke@435 73
duke@435 74 // Negate conditional branches. Error for non-branch Nodes
duke@435 75 virtual void negate();
duke@435 76
duke@435 77 // Return the value requested
duke@435 78 // result register lookup, corresponding to int_format
duke@435 79 virtual int reg(PhaseRegAlloc *ra_, const Node *node) const;
duke@435 80 // input register lookup, corresponding to ext_format
duke@435 81 virtual int reg(PhaseRegAlloc *ra_, const Node *node, int idx) const;
duke@435 82
duke@435 83 // helpers for MacroAssembler generation from ADLC
duke@435 84 Register as_Register(PhaseRegAlloc *ra_, const Node *node) const {
duke@435 85 return ::as_Register(reg(ra_, node));
duke@435 86 }
duke@435 87 Register as_Register(PhaseRegAlloc *ra_, const Node *node, int idx) const {
duke@435 88 return ::as_Register(reg(ra_, node, idx));
duke@435 89 }
duke@435 90 FloatRegister as_FloatRegister(PhaseRegAlloc *ra_, const Node *node) const {
duke@435 91 return ::as_FloatRegister(reg(ra_, node));
duke@435 92 }
duke@435 93 FloatRegister as_FloatRegister(PhaseRegAlloc *ra_, const Node *node, int idx) const {
duke@435 94 return ::as_FloatRegister(reg(ra_, node, idx));
duke@435 95 }
duke@435 96
duke@435 97 #if defined(IA32) || defined(AMD64)
duke@435 98 XMMRegister as_XMMRegister(PhaseRegAlloc *ra_, const Node *node) const {
duke@435 99 return ::as_XMMRegister(reg(ra_, node));
duke@435 100 }
duke@435 101 XMMRegister as_XMMRegister(PhaseRegAlloc *ra_, const Node *node, int idx) const {
duke@435 102 return ::as_XMMRegister(reg(ra_, node, idx));
duke@435 103 }
duke@435 104 #endif
duke@435 105
duke@435 106 virtual intptr_t constant() const;
coleenp@4037 107 virtual relocInfo::relocType constant_reloc() const;
duke@435 108 virtual jdouble constantD() const;
duke@435 109 virtual jfloat constantF() const;
duke@435 110 virtual jlong constantL() const;
duke@435 111 virtual TypeOopPtr *oop() const;
duke@435 112 virtual int ccode() const;
duke@435 113 // A zero, default, indicates this value is not needed.
duke@435 114 // May need to lookup the base register, as done in int_ and ext_format
duke@435 115 virtual int base (PhaseRegAlloc *ra_, const Node *node, int idx) const;
duke@435 116 virtual int index(PhaseRegAlloc *ra_, const Node *node, int idx) const;
duke@435 117 virtual int scale() const;
duke@435 118 // Parameters needed to support MEMORY_INTERFACE access to stackSlot
duke@435 119 virtual int disp (PhaseRegAlloc *ra_, const Node *node, int idx) const;
duke@435 120 // Check for PC-Relative displacement
coleenp@4037 121 virtual relocInfo::relocType disp_reloc() const;
duke@435 122 virtual int constant_disp() const; // usu. 0, may return Type::OffsetBot
duke@435 123 virtual int base_position() const; // base edge position, or -1
duke@435 124 virtual int index_position() const; // index edge position, or -1
duke@435 125
duke@435 126 // Access the TypeKlassPtr of operands with a base==RegI and disp==RegP
duke@435 127 // Only returns non-null value for i486.ad's indOffset32X
duke@435 128 virtual const TypePtr *disp_as_type() const { return NULL; }
duke@435 129
duke@435 130 // Return the label
duke@435 131 virtual Label *label() const;
duke@435 132
duke@435 133 // Return the method's address
duke@435 134 virtual intptr_t method() const;
duke@435 135
duke@435 136 // Hash and compare over operands are currently identical
duke@435 137 virtual uint hash() const;
duke@435 138 virtual uint cmp( const MachOper &oper ) const;
duke@435 139
duke@435 140 // Virtual clone, since I do not know how big the MachOper is.
duke@435 141 virtual MachOper *clone(Compile* C) const = 0;
duke@435 142
duke@435 143 // Return ideal Type from simple operands. Fail for complex operands.
duke@435 144 virtual const Type *type() const;
duke@435 145
duke@435 146 // Set an integer offset if we have one, or error otherwise
duke@435 147 virtual void set_con( jint c0 ) { ShouldNotReachHere(); }
duke@435 148
duke@435 149 #ifndef PRODUCT
duke@435 150 // Return name of operand
duke@435 151 virtual const char *Name() const { return "???";}
duke@435 152
duke@435 153 // Methods to output the text version of the operand
duke@435 154 virtual void int_format(PhaseRegAlloc *,const MachNode *node, outputStream *st) const = 0;
duke@435 155 virtual void ext_format(PhaseRegAlloc *,const MachNode *node,int idx, outputStream *st) const=0;
duke@435 156
duke@435 157 virtual void dump_spec(outputStream *st) const; // Print per-operand info
duke@435 158 #endif
duke@435 159 };
duke@435 160
duke@435 161 //------------------------------MachNode---------------------------------------
duke@435 162 // Base type for all machine specific nodes. All node classes generated by the
duke@435 163 // ADLC inherit from this class.
duke@435 164 class MachNode : public Node {
duke@435 165 public:
duke@435 166 MachNode() : Node((uint)0), _num_opnds(0), _opnds(NULL) {
duke@435 167 init_class_id(Class_Mach);
duke@435 168 }
duke@435 169 // Required boilerplate
duke@435 170 virtual uint size_of() const { return sizeof(MachNode); }
duke@435 171 virtual int Opcode() const; // Always equal to MachNode
duke@435 172 virtual uint rule() const = 0; // Machine-specific opcode
duke@435 173 // Number of inputs which come before the first operand.
duke@435 174 // Generally at least 1, to skip the Control input
duke@435 175 virtual uint oper_input_base() const { return 1; }
duke@435 176
duke@435 177 // Copy inputs and operands to new node of instruction.
duke@435 178 // Called from cisc_version() and short_branch_version().
duke@435 179 // !!!! The method's body is defined in ad_<arch>.cpp file.
duke@435 180 void fill_new_machnode(MachNode *n, Compile* C) const;
duke@435 181
duke@435 182 // Return an equivalent instruction using memory for cisc_operand position
duke@435 183 virtual MachNode *cisc_version(int offset, Compile* C);
duke@435 184 // Modify this instruction's register mask to use stack version for cisc_operand
duke@435 185 virtual void use_cisc_RegMask();
duke@435 186
duke@435 187 // Support for short branches
duke@435 188 bool may_be_short_branch() const { return (flags() & Flag_may_be_short_branch) != 0; }
duke@435 189
kvn@3049 190 // Avoid back to back some instructions on some CPUs.
kvn@3049 191 bool avoid_back_to_back() const { return (flags() & Flag_avoid_back_to_back) != 0; }
kvn@3049 192
roland@3316 193 // instruction implemented with a call
roland@3316 194 bool has_call() const { return (flags() & Flag_has_call) != 0; }
roland@3316 195
duke@435 196 // First index in _in[] corresponding to operand, or -1 if there is none
duke@435 197 int operand_index(uint operand) const;
duke@435 198
duke@435 199 // Register class input is expected in
duke@435 200 virtual const RegMask &in_RegMask(uint) const;
duke@435 201
duke@435 202 // cisc-spillable instructions redefine for use by in_RegMask
duke@435 203 virtual const RegMask *cisc_RegMask() const { return NULL; }
duke@435 204
duke@435 205 // If this instruction is a 2-address instruction, then return the
duke@435 206 // index of the input which must match the output. Not nessecary
duke@435 207 // for instructions which bind the input and output register to the
duke@435 208 // same singleton regiser (e.g., Intel IDIV which binds AX to be
duke@435 209 // both an input and an output). It is nessecary when the input and
duke@435 210 // output have choices - but they must use the same choice.
duke@435 211 virtual uint two_adr( ) const { return 0; }
duke@435 212
duke@435 213 // Array of complex operand pointers. Each corresponds to zero or
duke@435 214 // more leafs. Must be set by MachNode constructor to point to an
duke@435 215 // internal array of MachOpers. The MachOper array is sized by
duke@435 216 // specific MachNodes described in the ADL.
duke@435 217 uint _num_opnds;
duke@435 218 MachOper **_opnds;
duke@435 219 uint num_opnds() const { return _num_opnds; }
duke@435 220
duke@435 221 // Emit bytes into cbuf
duke@435 222 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 223 // Size of instruction in bytes
duke@435 224 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 225 // Helper function that computes size by emitting code
duke@435 226 virtual uint emit_size(PhaseRegAlloc *ra_) const;
duke@435 227
duke@435 228 // Return the alignment required (in units of relocInfo::addr_unit())
duke@435 229 // for this instruction (must be a power of 2)
duke@435 230 virtual int alignment_required() const { return 1; }
duke@435 231
duke@435 232 // Return the padding (in bytes) to be emitted before this
duke@435 233 // instruction to properly align it.
duke@435 234 virtual int compute_padding(int current_offset) const { return 0; }
duke@435 235
duke@435 236 // Return number of relocatable values contained in this instruction
duke@435 237 virtual int reloc() const { return 0; }
duke@435 238
duke@435 239 // Hash and compare over operands. Used to do GVN on machine Nodes.
duke@435 240 virtual uint hash() const;
duke@435 241 virtual uint cmp( const Node &n ) const;
duke@435 242
duke@435 243 // Expand method for MachNode, replaces nodes representing pseudo
duke@435 244 // instructions with a set of nodes which represent real machine
duke@435 245 // instructions and compute the same value.
never@1638 246 virtual MachNode *Expand( State *, Node_List &proj_list, Node* mem ) { return this; }
duke@435 247
duke@435 248 // Bottom_type call; value comes from operand0
duke@435 249 virtual const class Type *bottom_type() const { return _opnds[0]->type(); }
coleenp@4037 250 virtual uint ideal_reg() const { const Type *t = _opnds[0]->type(); return t == TypeInt::CC ? Op_RegFlags : t->ideal_reg(); }
duke@435 251
duke@435 252 // If this is a memory op, return the base pointer and fixed offset.
duke@435 253 // If there are no such, return NULL. If there are multiple addresses
duke@435 254 // or the address is indeterminate (rare cases) then return (Node*)-1,
duke@435 255 // which serves as node bottom.
duke@435 256 // If the offset is not statically determined, set it to Type::OffsetBot.
duke@435 257 // This method is free to ignore stack slots if that helps.
duke@435 258 #define TYPE_PTR_SENTINAL ((const TypePtr*)-1)
duke@435 259 // Passing TYPE_PTR_SENTINAL as adr_type asks for computation of the adr_type if possible
duke@435 260 const Node* get_base_and_disp(intptr_t &offset, const TypePtr* &adr_type) const;
duke@435 261
duke@435 262 // Helper for get_base_and_disp: find the base and index input nodes.
duke@435 263 // Returns the MachOper as determined by memory_operand(), for use, if
duke@435 264 // needed by the caller. If (MachOper *)-1 is returned, base and index
duke@435 265 // are set to NodeSentinel. If (MachOper *) NULL is returned, base and
duke@435 266 // index are set to NULL.
duke@435 267 const MachOper* memory_inputs(Node* &base, Node* &index) const;
duke@435 268
duke@435 269 // Helper for memory_inputs: Which operand carries the necessary info?
duke@435 270 // By default, returns NULL, which means there is no such operand.
duke@435 271 // If it returns (MachOper*)-1, this means there are multiple memories.
duke@435 272 virtual const MachOper* memory_operand() const { return NULL; }
duke@435 273
duke@435 274 // Call "get_base_and_disp" to decide which category of memory is used here.
duke@435 275 virtual const class TypePtr *adr_type() const;
duke@435 276
duke@435 277 // Apply peephole rule(s) to this instruction
duke@435 278 virtual MachNode *peephole( Block *block, int block_index, PhaseRegAlloc *ra_, int &deleted, Compile* C );
duke@435 279
duke@435 280 // Top-level ideal Opcode matched
duke@435 281 virtual int ideal_Opcode() const { return Op_Node; }
duke@435 282
duke@435 283 // Adds the label for the case
duke@435 284 virtual void add_case_label( int switch_val, Label* blockLabel);
duke@435 285
duke@435 286 // Set the absolute address for methods
duke@435 287 virtual void method_set( intptr_t addr );
duke@435 288
duke@435 289 // Should we clone rather than spill this instruction?
duke@435 290 bool rematerialize() const;
duke@435 291
duke@435 292 // Get the pipeline info
duke@435 293 static const Pipeline *pipeline_class();
duke@435 294 virtual const Pipeline *pipeline() const;
duke@435 295
duke@435 296 #ifndef PRODUCT
duke@435 297 virtual const char *Name() const = 0; // Machine-specific name
duke@435 298 virtual void dump_spec(outputStream *st) const; // Print per-node info
duke@435 299 void dump_format(PhaseRegAlloc *ra, outputStream *st) const; // access to virtual
duke@435 300 #endif
duke@435 301 };
duke@435 302
duke@435 303 //------------------------------MachIdealNode----------------------------
duke@435 304 // Machine specific versions of nodes that must be defined by user.
duke@435 305 // These are not converted by matcher from ideal nodes to machine nodes
duke@435 306 // but are inserted into the code by the compiler.
duke@435 307 class MachIdealNode : public MachNode {
duke@435 308 public:
duke@435 309 MachIdealNode( ) {}
duke@435 310
duke@435 311 // Define the following defaults for non-matched machine nodes
duke@435 312 virtual uint oper_input_base() const { return 0; }
duke@435 313 virtual uint rule() const { return 9999999; }
duke@435 314 virtual const class Type *bottom_type() const { return _opnds == NULL ? Type::CONTROL : MachNode::bottom_type(); }
duke@435 315 };
duke@435 316
duke@435 317 //------------------------------MachTypeNode----------------------------
duke@435 318 // Machine Nodes that need to retain a known Type.
duke@435 319 class MachTypeNode : public MachNode {
duke@435 320 virtual uint size_of() const { return sizeof(*this); } // Size is bigger
duke@435 321 public:
kvn@3882 322 MachTypeNode( ) {}
duke@435 323 const Type *_bottom_type;
duke@435 324
duke@435 325 virtual const class Type *bottom_type() const { return _bottom_type; }
duke@435 326 #ifndef PRODUCT
duke@435 327 virtual void dump_spec(outputStream *st) const;
duke@435 328 #endif
duke@435 329 };
duke@435 330
duke@435 331 //------------------------------MachBreakpointNode----------------------------
duke@435 332 // Machine breakpoint or interrupt Node
duke@435 333 class MachBreakpointNode : public MachIdealNode {
duke@435 334 public:
duke@435 335 MachBreakpointNode( ) {}
duke@435 336 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 337 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 338
duke@435 339 #ifndef PRODUCT
duke@435 340 virtual const char *Name() const { return "Breakpoint"; }
duke@435 341 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 342 #endif
duke@435 343 };
duke@435 344
twisti@2350 345 //------------------------------MachConstantBaseNode--------------------------
twisti@2350 346 // Machine node that represents the base address of the constant table.
twisti@2350 347 class MachConstantBaseNode : public MachIdealNode {
twisti@2350 348 public:
twisti@2350 349 static const RegMask& _out_RegMask; // We need the out_RegMask statically in MachConstantNode::in_RegMask().
twisti@2350 350
twisti@2350 351 public:
twisti@2350 352 MachConstantBaseNode() : MachIdealNode() {
twisti@2350 353 init_class_id(Class_MachConstantBase);
twisti@2350 354 }
twisti@2350 355 virtual const class Type* bottom_type() const { return TypeRawPtr::NOTNULL; }
twisti@2350 356 virtual uint ideal_reg() const { return Op_RegP; }
twisti@2350 357 virtual uint oper_input_base() const { return 1; }
twisti@2350 358
twisti@2350 359 virtual void emit(CodeBuffer& cbuf, PhaseRegAlloc* ra_) const;
twisti@2350 360 virtual uint size(PhaseRegAlloc* ra_) const;
twisti@2350 361 virtual bool pinned() const { return UseRDPCForConstantTableBase; }
twisti@2350 362
twisti@2350 363 static const RegMask& static_out_RegMask() { return _out_RegMask; }
twisti@2350 364 virtual const RegMask& out_RegMask() const { return static_out_RegMask(); }
twisti@2350 365
twisti@2350 366 #ifndef PRODUCT
twisti@2350 367 virtual const char* Name() const { return "MachConstantBaseNode"; }
twisti@2350 368 virtual void format(PhaseRegAlloc*, outputStream* st) const;
twisti@2350 369 #endif
twisti@2350 370 };
twisti@2350 371
twisti@2350 372 //------------------------------MachConstantNode-------------------------------
twisti@2350 373 // Machine node that holds a constant which is stored in the constant table.
kvn@3882 374 class MachConstantNode : public MachTypeNode {
twisti@2350 375 protected:
twisti@2350 376 Compile::Constant _constant; // This node's constant.
twisti@2350 377
twisti@2350 378 public:
kvn@3882 379 MachConstantNode() : MachTypeNode() {
twisti@2350 380 init_class_id(Class_MachConstant);
twisti@2350 381 }
twisti@2350 382
twisti@2350 383 virtual void eval_constant(Compile* C) {
twisti@2350 384 #ifdef ASSERT
twisti@2350 385 tty->print("missing MachConstantNode eval_constant function: ");
twisti@2350 386 dump();
twisti@2350 387 #endif
twisti@2350 388 ShouldNotCallThis();
twisti@2350 389 }
twisti@2350 390
twisti@2350 391 virtual const RegMask &in_RegMask(uint idx) const {
twisti@2350 392 if (idx == mach_constant_base_node_input())
twisti@2350 393 return MachConstantBaseNode::static_out_RegMask();
twisti@2350 394 return MachNode::in_RegMask(idx);
twisti@2350 395 }
twisti@2350 396
twisti@2350 397 // Input edge of MachConstantBaseNode.
twisti@2350 398 uint mach_constant_base_node_input() const { return req() - 1; }
twisti@2350 399
twisti@2350 400 int constant_offset();
twisti@2350 401 int constant_offset() const { return ((MachConstantNode*) this)->constant_offset(); }
twisti@2350 402 };
twisti@2350 403
duke@435 404 //------------------------------MachUEPNode-----------------------------------
duke@435 405 // Machine Unvalidated Entry Point Node
duke@435 406 class MachUEPNode : public MachIdealNode {
duke@435 407 public:
duke@435 408 MachUEPNode( ) {}
duke@435 409 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 410 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 411
duke@435 412 #ifndef PRODUCT
duke@435 413 virtual const char *Name() const { return "Unvalidated-Entry-Point"; }
duke@435 414 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 415 #endif
duke@435 416 };
duke@435 417
duke@435 418 //------------------------------MachPrologNode--------------------------------
duke@435 419 // Machine function Prolog Node
duke@435 420 class MachPrologNode : public MachIdealNode {
duke@435 421 public:
duke@435 422 MachPrologNode( ) {}
duke@435 423 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 424 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 425 virtual int reloc() const;
duke@435 426
duke@435 427 #ifndef PRODUCT
duke@435 428 virtual const char *Name() const { return "Prolog"; }
duke@435 429 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 430 #endif
duke@435 431 };
duke@435 432
duke@435 433 //------------------------------MachEpilogNode--------------------------------
duke@435 434 // Machine function Epilog Node
duke@435 435 class MachEpilogNode : public MachIdealNode {
duke@435 436 public:
duke@435 437 MachEpilogNode(bool do_poll = false) : _do_polling(do_poll) {}
duke@435 438 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 439 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 440 virtual int reloc() const;
duke@435 441 virtual const Pipeline *pipeline() const;
duke@435 442
duke@435 443 private:
duke@435 444 bool _do_polling;
duke@435 445
duke@435 446 public:
duke@435 447 bool do_polling() const { return _do_polling; }
duke@435 448
duke@435 449 // Offset of safepoint from the beginning of the node
duke@435 450 int safepoint_offset() const;
duke@435 451
duke@435 452 #ifndef PRODUCT
duke@435 453 virtual const char *Name() const { return "Epilog"; }
duke@435 454 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 455 #endif
duke@435 456 };
duke@435 457
duke@435 458 //------------------------------MachNopNode-----------------------------------
duke@435 459 // Machine function Nop Node
duke@435 460 class MachNopNode : public MachIdealNode {
duke@435 461 private:
duke@435 462 int _count;
duke@435 463 public:
duke@435 464 MachNopNode( ) : _count(1) {}
duke@435 465 MachNopNode( int count ) : _count(count) {}
duke@435 466 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 467 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 468
duke@435 469 virtual const class Type *bottom_type() const { return Type::CONTROL; }
duke@435 470
duke@435 471 virtual int ideal_Opcode() const { return Op_Con; } // bogus; see output.cpp
duke@435 472 virtual const Pipeline *pipeline() const;
duke@435 473 #ifndef PRODUCT
duke@435 474 virtual const char *Name() const { return "Nop"; }
duke@435 475 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 476 virtual void dump_spec(outputStream *st) const { } // No per-operand info
duke@435 477 #endif
duke@435 478 };
duke@435 479
duke@435 480 //------------------------------MachSpillCopyNode------------------------------
duke@435 481 // Machine SpillCopy Node. Copies 1 or 2 words from any location to any
duke@435 482 // location (stack or register).
duke@435 483 class MachSpillCopyNode : public MachIdealNode {
duke@435 484 const RegMask *_in; // RegMask for input
duke@435 485 const RegMask *_out; // RegMask for output
duke@435 486 const Type *_type;
duke@435 487 public:
duke@435 488 MachSpillCopyNode( Node *n, const RegMask &in, const RegMask &out ) :
duke@435 489 MachIdealNode(), _in(&in), _out(&out), _type(n->bottom_type()) {
duke@435 490 init_class_id(Class_MachSpillCopy);
duke@435 491 init_flags(Flag_is_Copy);
duke@435 492 add_req(NULL);
duke@435 493 add_req(n);
duke@435 494 }
duke@435 495 virtual uint size_of() const { return sizeof(*this); }
duke@435 496 void set_out_RegMask(const RegMask &out) { _out = &out; }
duke@435 497 void set_in_RegMask(const RegMask &in) { _in = &in; }
duke@435 498 virtual const RegMask &out_RegMask() const { return *_out; }
duke@435 499 virtual const RegMask &in_RegMask(uint) const { return *_in; }
duke@435 500 virtual const class Type *bottom_type() const { return _type; }
coleenp@4037 501 virtual uint ideal_reg() const { return _type->ideal_reg(); }
duke@435 502 virtual uint oper_input_base() const { return 1; }
duke@435 503 uint implementation( CodeBuffer *cbuf, PhaseRegAlloc *ra_, bool do_size, outputStream* st ) const;
duke@435 504
duke@435 505 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
duke@435 506 virtual uint size(PhaseRegAlloc *ra_) const;
duke@435 507
duke@435 508 #ifndef PRODUCT
duke@435 509 virtual const char *Name() const { return "MachSpillCopy"; }
duke@435 510 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 511 #endif
duke@435 512 };
duke@435 513
kvn@3051 514 //------------------------------MachBranchNode--------------------------------
kvn@3051 515 // Abstract machine branch Node
kvn@3051 516 class MachBranchNode : public MachIdealNode {
kvn@3051 517 public:
kvn@3051 518 MachBranchNode() : MachIdealNode() {
kvn@3051 519 init_class_id(Class_MachBranch);
kvn@3051 520 }
kvn@3051 521 virtual void label_set(Label* label, uint block_num) = 0;
kvn@3051 522 virtual void save_label(Label** label, uint* block_num) = 0;
kvn@3051 523
kvn@3051 524 // Support for short branches
kvn@3051 525 virtual MachNode *short_branch_version(Compile* C) { return NULL; }
kvn@3051 526
kvn@3051 527 virtual bool pinned() const { return true; };
kvn@3051 528 };
kvn@3051 529
duke@435 530 //------------------------------MachNullChkNode--------------------------------
duke@435 531 // Machine-dependent null-pointer-check Node. Points a real MachNode that is
duke@435 532 // also some kind of memory op. Turns the indicated MachNode into a
duke@435 533 // conditional branch with good latency on the ptr-not-null path and awful
duke@435 534 // latency on the pointer-is-null path.
duke@435 535
kvn@3051 536 class MachNullCheckNode : public MachBranchNode {
duke@435 537 public:
duke@435 538 const uint _vidx; // Index of memop being tested
kvn@3051 539 MachNullCheckNode( Node *ctrl, Node *memop, uint vidx ) : MachBranchNode(), _vidx(vidx) {
duke@435 540 init_class_id(Class_MachNullCheck);
duke@435 541 add_req(ctrl);
duke@435 542 add_req(memop);
duke@435 543 }
kvn@3051 544 virtual uint size_of() const { return sizeof(*this); }
duke@435 545
duke@435 546 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const;
kvn@3037 547 virtual void label_set(Label* label, uint block_num);
kvn@3051 548 virtual void save_label(Label** label, uint* block_num);
duke@435 549 virtual void negate() { }
duke@435 550 virtual const class Type *bottom_type() const { return TypeTuple::IFBOTH; }
duke@435 551 virtual uint ideal_reg() const { return NotAMachineReg; }
duke@435 552 virtual const RegMask &in_RegMask(uint) const;
duke@435 553 virtual const RegMask &out_RegMask() const { return RegMask::Empty; }
duke@435 554 #ifndef PRODUCT
duke@435 555 virtual const char *Name() const { return "NullCheck"; }
duke@435 556 virtual void format( PhaseRegAlloc *, outputStream *st ) const;
duke@435 557 #endif
duke@435 558 };
duke@435 559
duke@435 560 //------------------------------MachProjNode----------------------------------
duke@435 561 // Machine-dependent Ideal projections (how is that for an oxymoron). Really
duke@435 562 // just MachNodes made by the Ideal world that replicate simple projections
duke@435 563 // but with machine-dependent input & output register masks. Generally
duke@435 564 // produced as part of calling conventions. Normally I make MachNodes as part
duke@435 565 // of the Matcher process, but the Matcher is ill suited to issues involving
duke@435 566 // frame handling, so frame handling is all done in the Ideal world with
duke@435 567 // occasional callbacks to the machine model for important info.
duke@435 568 class MachProjNode : public ProjNode {
duke@435 569 public:
kvn@3040 570 MachProjNode( Node *multi, uint con, const RegMask &out, uint ideal_reg ) : ProjNode(multi,con), _rout(out), _ideal_reg(ideal_reg) {
kvn@3040 571 init_class_id(Class_MachProj);
kvn@3040 572 }
duke@435 573 RegMask _rout;
duke@435 574 const uint _ideal_reg;
duke@435 575 enum projType {
duke@435 576 unmatched_proj = 0, // Projs for Control, I/O, memory not matched
duke@435 577 fat_proj = 999 // Projs killing many regs, defined by _rout
duke@435 578 };
duke@435 579 virtual int Opcode() const;
duke@435 580 virtual const Type *bottom_type() const;
duke@435 581 virtual const TypePtr *adr_type() const;
duke@435 582 virtual const RegMask &in_RegMask(uint) const { return RegMask::Empty; }
duke@435 583 virtual const RegMask &out_RegMask() const { return _rout; }
duke@435 584 virtual uint ideal_reg() const { return _ideal_reg; }
duke@435 585 // Need size_of() for virtual ProjNode::clone()
duke@435 586 virtual uint size_of() const { return sizeof(MachProjNode); }
duke@435 587 #ifndef PRODUCT
duke@435 588 virtual void dump_spec(outputStream *st) const;
duke@435 589 #endif
duke@435 590 };
duke@435 591
duke@435 592 //------------------------------MachIfNode-------------------------------------
duke@435 593 // Machine-specific versions of IfNodes
kvn@3051 594 class MachIfNode : public MachBranchNode {
duke@435 595 virtual uint size_of() const { return sizeof(*this); } // Size is bigger
duke@435 596 public:
duke@435 597 float _prob; // Probability branch goes either way
duke@435 598 float _fcnt; // Frequency counter
kvn@3051 599 MachIfNode() : MachBranchNode() {
duke@435 600 init_class_id(Class_MachIf);
duke@435 601 }
kvn@3051 602 // Negate conditional branches.
kvn@3051 603 virtual void negate() = 0;
duke@435 604 #ifndef PRODUCT
duke@435 605 virtual void dump_spec(outputStream *st) const;
duke@435 606 #endif
duke@435 607 };
duke@435 608
kvn@3040 609 //------------------------------MachGotoNode-----------------------------------
kvn@3040 610 // Machine-specific versions of GotoNodes
kvn@3051 611 class MachGotoNode : public MachBranchNode {
kvn@3040 612 public:
kvn@3051 613 MachGotoNode() : MachBranchNode() {
kvn@3040 614 init_class_id(Class_MachGoto);
kvn@3040 615 }
kvn@3040 616 };
kvn@3040 617
duke@435 618 //------------------------------MachFastLockNode-------------------------------------
duke@435 619 // Machine-specific versions of FastLockNodes
duke@435 620 class MachFastLockNode : public MachNode {
duke@435 621 virtual uint size_of() const { return sizeof(*this); } // Size is bigger
duke@435 622 public:
duke@435 623 BiasedLockingCounters* _counters;
duke@435 624
duke@435 625 MachFastLockNode() : MachNode() {}
duke@435 626 };
duke@435 627
duke@435 628 //------------------------------MachReturnNode--------------------------------
duke@435 629 // Machine-specific versions of subroutine returns
duke@435 630 class MachReturnNode : public MachNode {
duke@435 631 virtual uint size_of() const; // Size is bigger
duke@435 632 public:
duke@435 633 RegMask *_in_rms; // Input register masks, set during allocation
duke@435 634 ReallocMark _nesting; // assertion check for reallocations
duke@435 635 const TypePtr* _adr_type; // memory effects of call or return
duke@435 636 MachReturnNode() : MachNode() {
duke@435 637 init_class_id(Class_MachReturn);
duke@435 638 _adr_type = TypePtr::BOTTOM; // the default: all of memory
duke@435 639 }
duke@435 640
duke@435 641 void set_adr_type(const TypePtr* atp) { _adr_type = atp; }
duke@435 642
duke@435 643 virtual const RegMask &in_RegMask(uint) const;
duke@435 644 virtual bool pinned() const { return true; };
duke@435 645 virtual const TypePtr *adr_type() const;
duke@435 646 };
duke@435 647
duke@435 648 //------------------------------MachSafePointNode-----------------------------
duke@435 649 // Machine-specific versions of safepoints
duke@435 650 class MachSafePointNode : public MachReturnNode {
duke@435 651 public:
duke@435 652 OopMap* _oop_map; // Array of OopMap info (8-bit char) for GC
duke@435 653 JVMState* _jvms; // Pointer to list of JVM State Objects
duke@435 654 uint _jvmadj; // Extra delta to jvms indexes (mach. args)
duke@435 655 OopMap* oop_map() const { return _oop_map; }
duke@435 656 void set_oop_map(OopMap* om) { _oop_map = om; }
duke@435 657
duke@435 658 MachSafePointNode() : MachReturnNode(), _oop_map(NULL), _jvms(NULL), _jvmadj(0) {
duke@435 659 init_class_id(Class_MachSafePoint);
duke@435 660 }
duke@435 661
duke@435 662 virtual JVMState* jvms() const { return _jvms; }
duke@435 663 void set_jvms(JVMState* s) {
duke@435 664 _jvms = s;
duke@435 665 }
duke@435 666 virtual const Type *bottom_type() const;
duke@435 667
duke@435 668 virtual const RegMask &in_RegMask(uint) const;
duke@435 669
duke@435 670 // Functionality from old debug nodes
duke@435 671 Node *returnadr() const { return in(TypeFunc::ReturnAdr); }
duke@435 672 Node *frameptr () const { return in(TypeFunc::FramePtr); }
duke@435 673
duke@435 674 Node *local(const JVMState* jvms, uint idx) const {
duke@435 675 assert(verify_jvms(jvms), "jvms must match");
duke@435 676 return in(_jvmadj + jvms->locoff() + idx);
duke@435 677 }
duke@435 678 Node *stack(const JVMState* jvms, uint idx) const {
duke@435 679 assert(verify_jvms(jvms), "jvms must match");
duke@435 680 return in(_jvmadj + jvms->stkoff() + idx);
duke@435 681 }
duke@435 682 Node *monitor_obj(const JVMState* jvms, uint idx) const {
duke@435 683 assert(verify_jvms(jvms), "jvms must match");
duke@435 684 return in(_jvmadj + jvms->monitor_obj_offset(idx));
duke@435 685 }
duke@435 686 Node *monitor_box(const JVMState* jvms, uint idx) const {
duke@435 687 assert(verify_jvms(jvms), "jvms must match");
duke@435 688 return in(_jvmadj + jvms->monitor_box_offset(idx));
duke@435 689 }
duke@435 690 void set_local(const JVMState* jvms, uint idx, Node *c) {
duke@435 691 assert(verify_jvms(jvms), "jvms must match");
duke@435 692 set_req(_jvmadj + jvms->locoff() + idx, c);
duke@435 693 }
duke@435 694 void set_stack(const JVMState* jvms, uint idx, Node *c) {
duke@435 695 assert(verify_jvms(jvms), "jvms must match");
duke@435 696 set_req(_jvmadj + jvms->stkoff() + idx, c);
duke@435 697 }
duke@435 698 void set_monitor(const JVMState* jvms, uint idx, Node *c) {
duke@435 699 assert(verify_jvms(jvms), "jvms must match");
duke@435 700 set_req(_jvmadj + jvms->monoff() + idx, c);
duke@435 701 }
duke@435 702 };
duke@435 703
duke@435 704 //------------------------------MachCallNode----------------------------------
duke@435 705 // Machine-specific versions of subroutine calls
duke@435 706 class MachCallNode : public MachSafePointNode {
duke@435 707 protected:
duke@435 708 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash
duke@435 709 virtual uint cmp( const Node &n ) const;
duke@435 710 virtual uint size_of() const = 0; // Size is bigger
duke@435 711 public:
duke@435 712 const TypeFunc *_tf; // Function type
duke@435 713 address _entry_point; // Address of the method being called
duke@435 714 float _cnt; // Estimate of number of times called
duke@435 715 uint _argsize; // Size of argument block on stack
duke@435 716
duke@435 717 const TypeFunc* tf() const { return _tf; }
duke@435 718 const address entry_point() const { return _entry_point; }
duke@435 719 const float cnt() const { return _cnt; }
duke@435 720 uint argsize() const { return _argsize; }
duke@435 721
duke@435 722 void set_tf(const TypeFunc* tf) { _tf = tf; }
duke@435 723 void set_entry_point(address p) { _entry_point = p; }
duke@435 724 void set_cnt(float c) { _cnt = c; }
duke@435 725 void set_argsize(int s) { _argsize = s; }
duke@435 726
duke@435 727 MachCallNode() : MachSafePointNode() {
duke@435 728 init_class_id(Class_MachCall);
duke@435 729 }
duke@435 730
duke@435 731 virtual const Type *bottom_type() const;
duke@435 732 virtual bool pinned() const { return false; }
duke@435 733 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 734 virtual const RegMask &in_RegMask(uint) const;
duke@435 735 virtual int ret_addr_offset() { return 0; }
duke@435 736
duke@435 737 bool returns_long() const { return tf()->return_type() == T_LONG; }
duke@435 738 bool return_value_is_used() const;
duke@435 739 #ifndef PRODUCT
duke@435 740 virtual void dump_spec(outputStream *st) const;
duke@435 741 #endif
duke@435 742 };
duke@435 743
duke@435 744 //------------------------------MachCallJavaNode------------------------------
duke@435 745 // "Base" class for machine-specific versions of subroutine calls
duke@435 746 class MachCallJavaNode : public MachCallNode {
duke@435 747 protected:
duke@435 748 virtual uint cmp( const Node &n ) const;
duke@435 749 virtual uint size_of() const; // Size is bigger
duke@435 750 public:
duke@435 751 ciMethod* _method; // Method being direct called
duke@435 752 int _bci; // Byte Code index of call byte code
duke@435 753 bool _optimized_virtual; // Tells if node is a static call or an optimized virtual
twisti@1572 754 bool _method_handle_invoke; // Tells if the call has to preserve SP
duke@435 755 MachCallJavaNode() : MachCallNode() {
duke@435 756 init_class_id(Class_MachCallJava);
duke@435 757 }
twisti@1572 758
twisti@1572 759 virtual const RegMask &in_RegMask(uint) const;
twisti@1572 760
duke@435 761 #ifndef PRODUCT
duke@435 762 virtual void dump_spec(outputStream *st) const;
duke@435 763 #endif
duke@435 764 };
duke@435 765
duke@435 766 //------------------------------MachCallStaticJavaNode------------------------
duke@435 767 // Machine-specific versions of monomorphic subroutine calls
duke@435 768 class MachCallStaticJavaNode : public MachCallJavaNode {
duke@435 769 virtual uint cmp( const Node &n ) const;
duke@435 770 virtual uint size_of() const; // Size is bigger
duke@435 771 public:
duke@435 772 const char *_name; // Runtime wrapper name
duke@435 773 MachCallStaticJavaNode() : MachCallJavaNode() {
duke@435 774 init_class_id(Class_MachCallStaticJava);
duke@435 775 }
duke@435 776
duke@435 777 // If this is an uncommon trap, return the request code, else zero.
duke@435 778 int uncommon_trap_request() const;
duke@435 779
duke@435 780 virtual int ret_addr_offset();
duke@435 781 #ifndef PRODUCT
duke@435 782 virtual void dump_spec(outputStream *st) const;
duke@435 783 void dump_trap_args(outputStream *st) const;
duke@435 784 #endif
duke@435 785 };
duke@435 786
duke@435 787 //------------------------------MachCallDynamicJavaNode------------------------
duke@435 788 // Machine-specific versions of possibly megamorphic subroutine calls
duke@435 789 class MachCallDynamicJavaNode : public MachCallJavaNode {
duke@435 790 public:
duke@435 791 int _vtable_index;
duke@435 792 MachCallDynamicJavaNode() : MachCallJavaNode() {
duke@435 793 init_class_id(Class_MachCallDynamicJava);
duke@435 794 DEBUG_ONLY(_vtable_index = -99); // throw an assert if uninitialized
duke@435 795 }
duke@435 796 virtual int ret_addr_offset();
duke@435 797 #ifndef PRODUCT
duke@435 798 virtual void dump_spec(outputStream *st) const;
duke@435 799 #endif
duke@435 800 };
duke@435 801
duke@435 802 //------------------------------MachCallRuntimeNode----------------------------
duke@435 803 // Machine-specific versions of subroutine calls
duke@435 804 class MachCallRuntimeNode : public MachCallNode {
duke@435 805 virtual uint cmp( const Node &n ) const;
duke@435 806 virtual uint size_of() const; // Size is bigger
duke@435 807 public:
duke@435 808 const char *_name; // Printable name, if _method is NULL
duke@435 809 MachCallRuntimeNode() : MachCallNode() {
duke@435 810 init_class_id(Class_MachCallRuntime);
duke@435 811 }
duke@435 812 virtual int ret_addr_offset();
duke@435 813 #ifndef PRODUCT
duke@435 814 virtual void dump_spec(outputStream *st) const;
duke@435 815 #endif
duke@435 816 };
duke@435 817
duke@435 818 class MachCallLeafNode: public MachCallRuntimeNode {
duke@435 819 public:
duke@435 820 MachCallLeafNode() : MachCallRuntimeNode() {
duke@435 821 init_class_id(Class_MachCallLeaf);
duke@435 822 }
duke@435 823 };
duke@435 824
duke@435 825 //------------------------------MachHaltNode-----------------------------------
duke@435 826 // Machine-specific versions of halt nodes
duke@435 827 class MachHaltNode : public MachReturnNode {
duke@435 828 public:
duke@435 829 virtual JVMState* jvms() const;
duke@435 830 };
duke@435 831
duke@435 832
duke@435 833 //------------------------------MachTempNode-----------------------------------
duke@435 834 // Node used by the adlc to construct inputs to represent temporary registers
duke@435 835 class MachTempNode : public MachNode {
duke@435 836 private:
duke@435 837 MachOper *_opnd_array[1];
duke@435 838
duke@435 839 public:
duke@435 840 virtual const RegMask &out_RegMask() const { return *_opnds[0]->in_RegMask(0); }
duke@435 841 virtual uint rule() const { return 9999999; }
duke@435 842 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const {}
duke@435 843
duke@435 844 MachTempNode(MachOper* oper) {
duke@435 845 init_class_id(Class_MachTemp);
duke@435 846 _num_opnds = 1;
duke@435 847 _opnds = _opnd_array;
duke@435 848 add_req(NULL);
duke@435 849 _opnds[0] = oper;
duke@435 850 }
duke@435 851 virtual uint size_of() const { return sizeof(MachTempNode); }
duke@435 852
duke@435 853 #ifndef PRODUCT
duke@435 854 virtual void format(PhaseRegAlloc *, outputStream *st ) const {}
duke@435 855 virtual const char *Name() const { return "MachTemp";}
duke@435 856 #endif
duke@435 857 };
duke@435 858
duke@435 859
duke@435 860
duke@435 861 //------------------------------labelOper--------------------------------------
duke@435 862 // Machine-independent version of label operand
duke@435 863 class labelOper : public MachOper {
duke@435 864 private:
duke@435 865 virtual uint num_edges() const { return 0; }
duke@435 866 public:
duke@435 867 // Supported for fixed size branches
duke@435 868 Label* _label; // Label for branch(es)
duke@435 869
duke@435 870 uint _block_num;
duke@435 871
duke@435 872 labelOper() : _block_num(0), _label(0) {}
duke@435 873
duke@435 874 labelOper(Label* label, uint block_num) : _label(label), _block_num(block_num) {}
duke@435 875
duke@435 876 labelOper(labelOper* l) : _label(l->_label) , _block_num(l->_block_num) {}
duke@435 877
duke@435 878 virtual MachOper *clone(Compile* C) const;
duke@435 879
kvn@3037 880 virtual Label *label() const { assert(_label != NULL, "need Label"); return _label; }
duke@435 881
duke@435 882 virtual uint opcode() const;
duke@435 883
duke@435 884 virtual uint hash() const;
duke@435 885 virtual uint cmp( const MachOper &oper ) const;
duke@435 886 #ifndef PRODUCT
duke@435 887 virtual const char *Name() const { return "Label";}
duke@435 888
duke@435 889 virtual void int_format(PhaseRegAlloc *ra, const MachNode *node, outputStream *st) const;
duke@435 890 virtual void ext_format(PhaseRegAlloc *ra, const MachNode *node, int idx, outputStream *st) const { int_format( ra, node, st ); }
duke@435 891 #endif
duke@435 892 };
duke@435 893
duke@435 894
duke@435 895 //------------------------------methodOper--------------------------------------
duke@435 896 // Machine-independent version of method operand
duke@435 897 class methodOper : public MachOper {
duke@435 898 private:
duke@435 899 virtual uint num_edges() const { return 0; }
duke@435 900 public:
duke@435 901 intptr_t _method; // Address of method
duke@435 902 methodOper() : _method(0) {}
duke@435 903 methodOper(intptr_t method) : _method(method) {}
duke@435 904
duke@435 905 virtual MachOper *clone(Compile* C) const;
duke@435 906
duke@435 907 virtual intptr_t method() const { return _method; }
duke@435 908
duke@435 909 virtual uint opcode() const;
duke@435 910
duke@435 911 virtual uint hash() const;
duke@435 912 virtual uint cmp( const MachOper &oper ) const;
duke@435 913 #ifndef PRODUCT
duke@435 914 virtual const char *Name() const { return "Method";}
duke@435 915
duke@435 916 virtual void int_format(PhaseRegAlloc *ra, const MachNode *node, outputStream *st) const;
duke@435 917 virtual void ext_format(PhaseRegAlloc *ra, const MachNode *node, int idx, outputStream *st) const { int_format( ra, node, st ); }
duke@435 918 #endif
duke@435 919 };
stefank@2314 920
stefank@2314 921 #endif // SHARE_VM_OPTO_MACHNODE_HPP

mercurial