src/share/vm/opto/machnode.hpp

Fri, 27 Feb 2009 13:27:09 -0800

author
twisti
date
Fri, 27 Feb 2009 13:27:09 -0800
changeset 1040
98cb887364d3
parent 435
a61af66fc99e
child 1572
97125851f396
permissions
-rw-r--r--

6810672: Comment typos
Summary: I have collected some typos I have found while looking at the code.
Reviewed-by: kvn, never

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

mercurial