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