Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/opto/mulnode.hpp@2a1a77d3458f (annotated)

src/share/vm/opto/mulnode.hpp

Tue, 24 Jun 2008 16:00:14 -0700

author
never
date
Tue, 24 Jun 2008 16:00:14 -0700
changeset 657
2a1a77d3458f
parent 580
f3de1255b035
child 631
d1605aabd0a1
permissions
-rw-r--r--

6718676: putback for 6604014 is incomplete
Reviewed-by: kvn, jrose

duke@435 1 /*
duke@435 2 * Copyright 1997-2005 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 //------------------------------MulNode----------------------------------------
duke@435 30 // Classic MULTIPLY functionality. This covers all the usual 'multiply'
duke@435 31 // behaviors for an algebraic ring. Multiply-integer, multiply-float,
duke@435 32 // multiply-double, and binary-and are all inherited from this class. The
duke@435 33 // various identity values are supplied by virtual functions.
duke@435 34 class MulNode : public Node {
duke@435 35 virtual uint hash() const;
duke@435 36 public:
duke@435 37 MulNode( Node *in1, Node *in2 ): Node(0,in1,in2) {
duke@435 38 init_class_id(Class_Mul);
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 // Supplied function returns the product of the inputs.
duke@435 54 // This also type-checks the inputs for sanity. Guaranteed never to
duke@435 55 // be passed a TOP or BOTTOM type, these are filtered out by a pre-check.
duke@435 56 // This call recognizes the multiplicative zero type.
duke@435 57 virtual const Type *mul_ring( const Type *, const Type * ) const = 0;
duke@435 58
duke@435 59 // Supplied function to return the multiplicative identity type
duke@435 60 virtual const Type *mul_id() const = 0;
duke@435 61
duke@435 62 // Supplied function to return the additive identity type
duke@435 63 virtual const Type *add_id() const = 0;
duke@435 64
duke@435 65 // Supplied function to return the additive opcode
duke@435 66 virtual int add_opcode() const = 0;
duke@435 67
duke@435 68 // Supplied function to return the multiplicative opcode
duke@435 69 virtual int mul_opcode() const = 0;
duke@435 70
duke@435 71 };
duke@435 72
duke@435 73 //------------------------------MulINode---------------------------------------
duke@435 74 // Multiply 2 integers
duke@435 75 class MulINode : public MulNode {
duke@435 76 public:
duke@435 77 MulINode( Node *in1, Node *in2 ) : MulNode(in1,in2) {}
duke@435 78 virtual int Opcode() const;
duke@435 79 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 80 virtual const Type *mul_ring( const Type *, const Type * ) const;
duke@435 81 const Type *mul_id() const { return TypeInt::ONE; }
duke@435 82 const Type *add_id() const { return TypeInt::ZERO; }
duke@435 83 int add_opcode() const { return Op_AddI; }
duke@435 84 int mul_opcode() const { return Op_MulI; }
duke@435 85 const Type *bottom_type() const { return TypeInt::INT; }
duke@435 86 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 87 };
duke@435 88
duke@435 89 //------------------------------MulLNode---------------------------------------
duke@435 90 // Multiply 2 longs
duke@435 91 class MulLNode : public MulNode {
duke@435 92 public:
duke@435 93 MulLNode( Node *in1, Node *in2 ) : MulNode(in1,in2) {}
duke@435 94 virtual int Opcode() const;
duke@435 95 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 96 virtual const Type *mul_ring( const Type *, const Type * ) const;
duke@435 97 const Type *mul_id() const { return TypeLong::ONE; }
duke@435 98 const Type *add_id() const { return TypeLong::ZERO; }
duke@435 99 int add_opcode() const { return Op_AddL; }
duke@435 100 int mul_opcode() const { return Op_MulL; }
duke@435 101 const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 102 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 103 };
duke@435 104
duke@435 105
duke@435 106 //------------------------------MulFNode---------------------------------------
duke@435 107 // Multiply 2 floats
duke@435 108 class MulFNode : public MulNode {
duke@435 109 public:
duke@435 110 MulFNode( Node *in1, Node *in2 ) : MulNode(in1,in2) {}
duke@435 111 virtual int Opcode() const;
duke@435 112 virtual const Type *mul_ring( const Type *, const Type * ) const;
duke@435 113 const Type *mul_id() const { return TypeF::ONE; }
duke@435 114 const Type *add_id() const { return TypeF::ZERO; }
duke@435 115 int add_opcode() const { return Op_AddF; }
duke@435 116 int mul_opcode() const { return Op_MulF; }
duke@435 117 const Type *bottom_type() const { return Type::FLOAT; }
duke@435 118 virtual uint ideal_reg() const { return Op_RegF; }
duke@435 119 };
duke@435 120
duke@435 121 //------------------------------MulDNode---------------------------------------
duke@435 122 // Multiply 2 doubles
duke@435 123 class MulDNode : public MulNode {
duke@435 124 public:
duke@435 125 MulDNode( Node *in1, Node *in2 ) : MulNode(in1,in2) {}
duke@435 126 virtual int Opcode() const;
duke@435 127 virtual const Type *mul_ring( const Type *, const Type * ) const;
duke@435 128 const Type *mul_id() const { return TypeD::ONE; }
duke@435 129 const Type *add_id() const { return TypeD::ZERO; }
duke@435 130 int add_opcode() const { return Op_AddD; }
duke@435 131 int mul_opcode() const { return Op_MulD; }
duke@435 132 const Type *bottom_type() const { return Type::DOUBLE; }
duke@435 133 virtual uint ideal_reg() const { return Op_RegD; }
duke@435 134 };
duke@435 135
rasbold@580 136 //-------------------------------MulHiLNode------------------------------------
rasbold@580 137 // Upper 64 bits of a 64 bit by 64 bit multiply
rasbold@580 138 class MulHiLNode : public Node {
rasbold@580 139 public:
rasbold@580 140 MulHiLNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
rasbold@580 141 virtual int Opcode() const;
rasbold@580 142 virtual const Type *Value( PhaseTransform *phase ) const;
rasbold@580 143 const Type *bottom_type() const { return TypeLong::LONG; }
rasbold@580 144 virtual uint ideal_reg() const { return Op_RegL; }
rasbold@580 145 };
duke@435 146
duke@435 147 //------------------------------AndINode---------------------------------------
duke@435 148 // Logically AND 2 integers. Included with the MUL nodes because it inherits
duke@435 149 // all the behavior of multiplication on a ring.
duke@435 150 class AndINode : public MulINode {
duke@435 151 public:
duke@435 152 AndINode( Node *in1, Node *in2 ) : MulINode(in1,in2) {}
duke@435 153 virtual int Opcode() const;
duke@435 154 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 155 virtual Node *Identity( PhaseTransform *phase );
duke@435 156 virtual const Type *mul_ring( const Type *, const Type * ) const;
duke@435 157 const Type *mul_id() const { return TypeInt::MINUS_1; }
duke@435 158 const Type *add_id() const { return TypeInt::ZERO; }
duke@435 159 int add_opcode() const { return Op_OrI; }
duke@435 160 int mul_opcode() const { return Op_AndI; }
duke@435 161 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 162 };
duke@435 163
duke@435 164 //------------------------------AndINode---------------------------------------
duke@435 165 // Logically AND 2 longs. Included with the MUL nodes because it inherits
duke@435 166 // all the behavior of multiplication on a ring.
duke@435 167 class AndLNode : public MulLNode {
duke@435 168 public:
duke@435 169 AndLNode( Node *in1, Node *in2 ) : MulLNode(in1,in2) {}
duke@435 170 virtual int Opcode() const;
duke@435 171 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 172 virtual Node *Identity( PhaseTransform *phase );
duke@435 173 virtual const Type *mul_ring( const Type *, const Type * ) const;
duke@435 174 const Type *mul_id() const { return TypeLong::MINUS_1; }
duke@435 175 const Type *add_id() const { return TypeLong::ZERO; }
duke@435 176 int add_opcode() const { return Op_OrL; }
duke@435 177 int mul_opcode() const { return Op_AndL; }
duke@435 178 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 179 };
duke@435 180
duke@435 181 //------------------------------LShiftINode------------------------------------
duke@435 182 // Logical shift left
duke@435 183 class LShiftINode : public Node {
duke@435 184 public:
duke@435 185 LShiftINode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
duke@435 186 virtual int Opcode() const;
duke@435 187 virtual Node *Identity( PhaseTransform *phase );
duke@435 188 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 189 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 190 const Type *bottom_type() const { return TypeInt::INT; }
duke@435 191 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 192 };
duke@435 193
duke@435 194 //------------------------------LShiftLNode------------------------------------
duke@435 195 // Logical shift left
duke@435 196 class LShiftLNode : public Node {
duke@435 197 public:
duke@435 198 LShiftLNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
duke@435 199 virtual int Opcode() const;
duke@435 200 virtual Node *Identity( PhaseTransform *phase );
duke@435 201 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 202 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 203 const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 204 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 205 };
duke@435 206
duke@435 207 //------------------------------RShiftINode------------------------------------
duke@435 208 // Signed shift right
duke@435 209 class RShiftINode : public Node {
duke@435 210 public:
duke@435 211 RShiftINode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
duke@435 212 virtual int Opcode() const;
duke@435 213 virtual Node *Identity( PhaseTransform *phase );
duke@435 214 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 215 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 216 const Type *bottom_type() const { return TypeInt::INT; }
duke@435 217 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 218 };
duke@435 219
duke@435 220 //------------------------------RShiftLNode------------------------------------
duke@435 221 // Signed shift right
duke@435 222 class RShiftLNode : public Node {
duke@435 223 public:
duke@435 224 RShiftLNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
duke@435 225 virtual int Opcode() const;
duke@435 226 virtual Node *Identity( PhaseTransform *phase );
duke@435 227 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 228 const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 229 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 230 };
duke@435 231
duke@435 232
duke@435 233 //------------------------------URShiftINode-----------------------------------
duke@435 234 // Logical shift right
duke@435 235 class URShiftINode : public Node {
duke@435 236 public:
duke@435 237 URShiftINode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
duke@435 238 virtual int Opcode() const;
duke@435 239 virtual Node *Identity( PhaseTransform *phase );
duke@435 240 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 241 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 242 const Type *bottom_type() const { return TypeInt::INT; }
duke@435 243 virtual uint ideal_reg() const { return Op_RegI; }
duke@435 244 };
duke@435 245
duke@435 246 //------------------------------URShiftLNode-----------------------------------
duke@435 247 // Logical shift right
duke@435 248 class URShiftLNode : public Node {
duke@435 249 public:
duke@435 250 URShiftLNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {}
duke@435 251 virtual int Opcode() const;
duke@435 252 virtual Node *Identity( PhaseTransform *phase );
duke@435 253 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
duke@435 254 virtual const Type *Value( PhaseTransform *phase ) const;
duke@435 255 const Type *bottom_type() const { return TypeLong::LONG; }
duke@435 256 virtual uint ideal_reg() const { return Op_RegL; }
duke@435 257 };

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial