Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/opto/addnode.hpp@98cb887364d3 (annotated)

src/share/vm/opto/addnode.hpp

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

author
twisti
date
Fri, 27 Feb 2009 13:27:09 -0800
changeset 1040
98cb887364d3
parent 452
ff5961f4c095
child 1896
b5fdf39b9749
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-2006 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 // Portions of code courtesy of Clifford Click
duke@435 26
duke@435 27 class PhaseTransform;
duke@435 28
duke@435 29 //------------------------------AddNode----------------------------------------
duke@435 30 // Classic Add functionality. This covers all the usual 'add' behaviors for
duke@435 31 // an algebraic ring. Add-integer, add-float, add-double, and binary-or are
duke@435 32 // all inherited from this class. The various identity values are supplied
duke@435 33 // by virtual functions.
duke@435 34 class AddNode : public Node {
duke@435 35 virtual uint hash() const;
duke@435 36 public:
duke@435 37 AddNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {
duke@435 38 init_class_id(Class_Add);
duke@435 39 }
duke@435 40
duke@435 41 // Handle algebraic identities here. If we have an identity, return the Node
duke@435 42 // we are equivalent to. We look for "add of zero" as an identity.
duke@435 43 virtual Node *Identity( PhaseTransform *phase );
duke@435 44
duke@435 45 // We also canonicalize the Node, moving constants to the right input,
duke@435 46 // and flatten expressions (so that 1+x+2 becomes x+3).
duke@435 47 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 48
duke@435 49 // Compute a new Type for this node. Basically we just do the pre-check,
duke@435 50 // then call the virtual add() to set the type.
duke@435 51 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 52
duke@435 53 // Check if this addition involves the additive identity
duke@435 54 virtual const Type *add_of_identity( const Type *t1, const Type *t2 ) const;
duke@435 55
duke@435 56 // Supplied function returns the sum of the inputs.
duke@435 57 // This also type-checks the inputs for sanity. Guaranteed never to
duke@435 58 // be passed a TOP or BOTTOM type, these are filtered out by a pre-check.
duke@435 59 virtual const Type *add_ring( const Type *, const Type * ) const = 0;
duke@435 60
duke@435 61 // Supplied function to return the additive identity type
duke@435 62 virtual const Type *add_id() const = 0;
duke@435 63
duke@435 64 };
duke@435 65
duke@435 66 //------------------------------AddINode---------------------------------------
duke@435 67 // Add 2 integers
duke@435 68 class AddINode : public AddNode {
duke@435 69 public:
duke@435 70 AddINode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 71 virtual int Opcode() const;
duke@435 72 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 73 virtual const Type *add_id() const { return TypeInt::ZERO; }
duke@435 74 virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435 75 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 76 virtual Node *Identity( PhaseTransform *phase );
duke@435 77 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 78 };
duke@435 79
duke@435 80 //------------------------------AddLNode---------------------------------------
duke@435 81 // Add 2 longs
duke@435 82 class AddLNode : public AddNode {
duke@435 83 public:
duke@435 84 AddLNode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 85 virtual int Opcode() const;
duke@435 86 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 87 virtual const Type *add_id() const { return TypeLong::ZERO; }
duke@435 88 virtual const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 89 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 90 virtual Node *Identity( PhaseTransform *phase );
duke@435 91 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 92 };
duke@435 93
duke@435 94 //------------------------------AddFNode---------------------------------------
duke@435 95 // Add 2 floats
duke@435 96 class AddFNode : public AddNode {
duke@435 97 public:
duke@435 98 AddFNode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 99 virtual int Opcode() const;
duke@435 100 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 101 virtual const Type *add_of_identity( const Type *t1, const Type *t2 ) const;
duke@435 102 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 103 virtual const Type *add_id() const { return TypeF::ZERO; }
duke@435 104 virtual const Type *bottom_type() const { return Type::FLOAT; }
duke@435 105 virtual Node *Identity( PhaseTransform *phase ) { return this; }
duke@435 106 virtual uint ideal_reg() const { return Op_RegF; }
duke@435 107 };
duke@435 108
duke@435 109 //------------------------------AddDNode---------------------------------------
duke@435 110 // Add 2 doubles
duke@435 111 class AddDNode : public AddNode {
duke@435 112 public:
duke@435 113 AddDNode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 114 virtual int Opcode() const;
duke@435 115 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 116 virtual const Type *add_of_identity( const Type *t1, const Type *t2 ) const;
duke@435 117 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 118 virtual const Type *add_id() const { return TypeD::ZERO; }
duke@435 119 virtual const Type *bottom_type() const { return Type::DOUBLE; }
duke@435 120 virtual Node *Identity( PhaseTransform *phase ) { return this; }
duke@435 121 virtual uint ideal_reg() const { return Op_RegD; }
duke@435 122 };
duke@435 123
duke@435 124 //------------------------------AddPNode---------------------------------------
duke@435 125 // Add pointer plus integer to get pointer. NOT commutative, really.
duke@435 126 // So not really an AddNode. Lives here, because people associate it with
duke@435 127 // an add.
duke@435 128 class AddPNode : public Node {
duke@435 129 public:
duke@435 130 enum { Control, // When is it safe to do this add?
duke@435 131 Base, // Base oop, for GC purposes
duke@435 132 Address, // Actually address, derived from base
duke@435 133 Offset } ; // Offset added to address
duke@435 134 AddPNode( Node *base, Node *ptr, Node *off ) : Node(0,base,ptr,off) {
duke@435 135 init_class_id(Class_AddP);
duke@435 136 }
duke@435 137 virtual int Opcode() const;
duke@435 138 virtual Node *Identity( PhaseTransform *phase );
duke@435 139 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 140 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 141 virtual const Type *bottom_type() const;
duke@435 142 virtual uint ideal_reg() const { return Op_RegP; }
duke@435 143 Node *base_node() { assert( req() > Base, "Missing base"); return in(Base); }
duke@435 144 static Node* Ideal_base_and_offset(Node* ptr, PhaseTransform* phase,
duke@435 145 // second return value:
duke@435 146 intptr_t& offset);
never@452 147
never@452 148 // Collect the AddP offset values into the elements array, giving up
never@452 149 // if there are more than length.
never@452 150 int unpack_offsets(Node* elements[], int length);
never@452 151
duke@435 152 // Do not match base-ptr edge
duke@435 153 virtual uint match_edge(uint idx) const;
duke@435 154 static const Type *mach_bottom_type(const MachNode* n); // used by ad_<arch>.hpp
duke@435 155 };
duke@435 156
duke@435 157 //------------------------------OrINode----------------------------------------
duke@435 158 // Logically OR 2 integers. Included with the ADD nodes because it inherits
duke@435 159 // all the behavior of addition on a ring.
duke@435 160 class OrINode : public AddNode {
duke@435 161 public:
duke@435 162 OrINode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 163 virtual int Opcode() const;
duke@435 164 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 165 virtual const Type *add_id() const { return TypeInt::ZERO; }
duke@435 166 virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435 167 virtual Node *Identity( PhaseTransform *phase );
duke@435 168 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 169 };
duke@435 170
duke@435 171 //------------------------------OrLNode----------------------------------------
duke@435 172 // Logically OR 2 longs. Included with the ADD nodes because it inherits
duke@435 173 // all the behavior of addition on a ring.
duke@435 174 class OrLNode : public AddNode {
duke@435 175 public:
duke@435 176 OrLNode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 177 virtual int Opcode() const;
duke@435 178 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 179 virtual const Type *add_id() const { return TypeLong::ZERO; }
duke@435 180 virtual const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 181 virtual Node *Identity( PhaseTransform *phase );
duke@435 182 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 183 };
duke@435 184
duke@435 185 //------------------------------XorINode---------------------------------------
duke@435 186 // XOR'ing 2 integers
duke@435 187 class XorINode : public AddNode {
duke@435 188 public:
duke@435 189 XorINode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 190 virtual int Opcode() const;
duke@435 191 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 192 virtual const Type *add_id() const { return TypeInt::ZERO; }
duke@435 193 virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435 194 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 195 };
duke@435 196
duke@435 197 //------------------------------XorINode---------------------------------------
duke@435 198 // XOR'ing 2 longs
duke@435 199 class XorLNode : public AddNode {
duke@435 200 public:
duke@435 201 XorLNode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 202 virtual int Opcode() const;
duke@435 203 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 204 virtual const Type *add_id() const { return TypeLong::ZERO; }
duke@435 205 virtual const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 206 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 207 };
duke@435 208
duke@435 209 //------------------------------MaxNode----------------------------------------
duke@435 210 // Max (or min) of 2 values. Included with the ADD nodes because it inherits
duke@435 211 // all the behavior of addition on a ring. Only new thing is that we allow
duke@435 212 // 2 equal inputs to be equal.
duke@435 213 class MaxNode : public AddNode {
duke@435 214 public:
duke@435 215 MaxNode( Node *in1, Node *in2 ) : AddNode(in1,in2) {}
duke@435 216 virtual int Opcode() const = 0;
duke@435 217 };
duke@435 218
duke@435 219 //------------------------------MaxINode---------------------------------------
duke@435 220 // Maximum of 2 integers. Included with the ADD nodes because it inherits
duke@435 221 // all the behavior of addition on a ring.
duke@435 222 class MaxINode : public MaxNode {
duke@435 223 public:
duke@435 224 MaxINode( Node *in1, Node *in2 ) : MaxNode(in1,in2) {}
duke@435 225 virtual int Opcode() const;
duke@435 226 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 227 virtual const Type *add_id() const { return TypeInt::make(min_jint); }
duke@435 228 virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435 229 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 230 };
duke@435 231
duke@435 232 //------------------------------MinINode---------------------------------------
duke@435 233 // MINimum of 2 integers. Included with the ADD nodes because it inherits
duke@435 234 // all the behavior of addition on a ring.
duke@435 235 class MinINode : public MaxNode {
duke@435 236 public:
duke@435 237 MinINode( Node *in1, Node *in2 ) : MaxNode(in1,in2) {}
duke@435 238 virtual int Opcode() const;
duke@435 239 virtual const Type *add_ring( const Type *, const Type * ) const;
duke@435 240 virtual const Type *add_id() const { return TypeInt::make(max_jint); }
duke@435 241 virtual const Type *bottom_type() const { return TypeInt::INT; }
duke@435 242 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 243 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 244 };

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial