Tue, 30 Nov 2010 23:23:40 -0800
6985015: C1 needs to support compressed oops
Summary: This change implements compressed oops for C1 for x64 and sparc. The changes are mostly on the codegen level, with a few exceptions when we do access things outside of the heap that are uncompressed from the IR. Compressed oops are now also enabled with tiered.
Reviewed-by: twisti, kvn, never, phh
duke@435 | 1 | /* |
trims@1907 | 2 | * Copyright (c) 1999, 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_C1_C1_INSTRUCTION_HPP |
stefank@2314 | 26 | #define SHARE_VM_C1_C1_INSTRUCTION_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "c1/c1_Compilation.hpp" |
stefank@2314 | 29 | #include "c1/c1_LIR.hpp" |
stefank@2314 | 30 | #include "c1/c1_ValueType.hpp" |
stefank@2314 | 31 | #include "ci/ciField.hpp" |
stefank@2314 | 32 | |
duke@435 | 33 | // Predefined classes |
duke@435 | 34 | class ciField; |
duke@435 | 35 | class ValueStack; |
duke@435 | 36 | class InstructionPrinter; |
duke@435 | 37 | class IRScope; |
duke@435 | 38 | class LIR_OprDesc; |
duke@435 | 39 | typedef LIR_OprDesc* LIR_Opr; |
duke@435 | 40 | |
duke@435 | 41 | |
duke@435 | 42 | // Instruction class hierarchy |
duke@435 | 43 | // |
duke@435 | 44 | // All leaf classes in the class hierarchy are concrete classes |
duke@435 | 45 | // (i.e., are instantiated). All other classes are abstract and |
duke@435 | 46 | // serve factoring. |
duke@435 | 47 | |
duke@435 | 48 | class Instruction; |
duke@435 | 49 | class Phi; |
duke@435 | 50 | class Local; |
duke@435 | 51 | class Constant; |
duke@435 | 52 | class AccessField; |
duke@435 | 53 | class LoadField; |
duke@435 | 54 | class StoreField; |
duke@435 | 55 | class AccessArray; |
duke@435 | 56 | class ArrayLength; |
duke@435 | 57 | class AccessIndexed; |
duke@435 | 58 | class LoadIndexed; |
duke@435 | 59 | class StoreIndexed; |
duke@435 | 60 | class NegateOp; |
duke@435 | 61 | class Op2; |
duke@435 | 62 | class ArithmeticOp; |
duke@435 | 63 | class ShiftOp; |
duke@435 | 64 | class LogicOp; |
duke@435 | 65 | class CompareOp; |
duke@435 | 66 | class IfOp; |
duke@435 | 67 | class Convert; |
duke@435 | 68 | class NullCheck; |
duke@435 | 69 | class OsrEntry; |
duke@435 | 70 | class ExceptionObject; |
duke@435 | 71 | class StateSplit; |
duke@435 | 72 | class Invoke; |
duke@435 | 73 | class NewInstance; |
duke@435 | 74 | class NewArray; |
duke@435 | 75 | class NewTypeArray; |
duke@435 | 76 | class NewObjectArray; |
duke@435 | 77 | class NewMultiArray; |
duke@435 | 78 | class TypeCheck; |
duke@435 | 79 | class CheckCast; |
duke@435 | 80 | class InstanceOf; |
duke@435 | 81 | class AccessMonitor; |
duke@435 | 82 | class MonitorEnter; |
duke@435 | 83 | class MonitorExit; |
duke@435 | 84 | class Intrinsic; |
duke@435 | 85 | class BlockBegin; |
duke@435 | 86 | class BlockEnd; |
duke@435 | 87 | class Goto; |
duke@435 | 88 | class If; |
duke@435 | 89 | class IfInstanceOf; |
duke@435 | 90 | class Switch; |
duke@435 | 91 | class TableSwitch; |
duke@435 | 92 | class LookupSwitch; |
duke@435 | 93 | class Return; |
duke@435 | 94 | class Throw; |
duke@435 | 95 | class Base; |
duke@435 | 96 | class RoundFP; |
duke@435 | 97 | class UnsafeOp; |
duke@435 | 98 | class UnsafeRawOp; |
duke@435 | 99 | class UnsafeGetRaw; |
duke@435 | 100 | class UnsafePutRaw; |
duke@435 | 101 | class UnsafeObjectOp; |
duke@435 | 102 | class UnsafeGetObject; |
duke@435 | 103 | class UnsafePutObject; |
duke@435 | 104 | class UnsafePrefetch; |
duke@435 | 105 | class UnsafePrefetchRead; |
duke@435 | 106 | class UnsafePrefetchWrite; |
duke@435 | 107 | class ProfileCall; |
iveresov@2138 | 108 | class ProfileInvoke; |
duke@435 | 109 | |
duke@435 | 110 | // A Value is a reference to the instruction creating the value |
duke@435 | 111 | typedef Instruction* Value; |
duke@435 | 112 | define_array(ValueArray, Value) |
duke@435 | 113 | define_stack(Values, ValueArray) |
duke@435 | 114 | |
duke@435 | 115 | define_array(ValueStackArray, ValueStack*) |
duke@435 | 116 | define_stack(ValueStackStack, ValueStackArray) |
duke@435 | 117 | |
duke@435 | 118 | // BlockClosure is the base class for block traversal/iteration. |
duke@435 | 119 | |
duke@435 | 120 | class BlockClosure: public CompilationResourceObj { |
duke@435 | 121 | public: |
duke@435 | 122 | virtual void block_do(BlockBegin* block) = 0; |
duke@435 | 123 | }; |
duke@435 | 124 | |
duke@435 | 125 | |
iveresov@1939 | 126 | // A simple closure class for visiting the values of an Instruction |
iveresov@1939 | 127 | class ValueVisitor: public StackObj { |
iveresov@1939 | 128 | public: |
iveresov@1939 | 129 | virtual void visit(Value* v) = 0; |
iveresov@1939 | 130 | }; |
iveresov@1939 | 131 | |
iveresov@1939 | 132 | |
duke@435 | 133 | // Some array and list classes |
duke@435 | 134 | define_array(BlockBeginArray, BlockBegin*) |
duke@435 | 135 | define_stack(_BlockList, BlockBeginArray) |
duke@435 | 136 | |
duke@435 | 137 | class BlockList: public _BlockList { |
duke@435 | 138 | public: |
duke@435 | 139 | BlockList(): _BlockList() {} |
duke@435 | 140 | BlockList(const int size): _BlockList(size) {} |
duke@435 | 141 | BlockList(const int size, BlockBegin* init): _BlockList(size, init) {} |
duke@435 | 142 | |
duke@435 | 143 | void iterate_forward(BlockClosure* closure); |
duke@435 | 144 | void iterate_backward(BlockClosure* closure); |
duke@435 | 145 | void blocks_do(void f(BlockBegin*)); |
iveresov@1939 | 146 | void values_do(ValueVisitor* f); |
duke@435 | 147 | void print(bool cfg_only = false, bool live_only = false) PRODUCT_RETURN; |
duke@435 | 148 | }; |
duke@435 | 149 | |
duke@435 | 150 | |
duke@435 | 151 | // InstructionVisitors provide type-based dispatch for instructions. |
duke@435 | 152 | // For each concrete Instruction class X, a virtual function do_X is |
duke@435 | 153 | // provided. Functionality that needs to be implemented for all classes |
duke@435 | 154 | // (e.g., printing, code generation) is factored out into a specialised |
duke@435 | 155 | // visitor instead of added to the Instruction classes itself. |
duke@435 | 156 | |
duke@435 | 157 | class InstructionVisitor: public StackObj { |
duke@435 | 158 | public: |
duke@435 | 159 | virtual void do_Phi (Phi* x) = 0; |
duke@435 | 160 | virtual void do_Local (Local* x) = 0; |
duke@435 | 161 | virtual void do_Constant (Constant* x) = 0; |
duke@435 | 162 | virtual void do_LoadField (LoadField* x) = 0; |
duke@435 | 163 | virtual void do_StoreField (StoreField* x) = 0; |
duke@435 | 164 | virtual void do_ArrayLength (ArrayLength* x) = 0; |
duke@435 | 165 | virtual void do_LoadIndexed (LoadIndexed* x) = 0; |
duke@435 | 166 | virtual void do_StoreIndexed (StoreIndexed* x) = 0; |
duke@435 | 167 | virtual void do_NegateOp (NegateOp* x) = 0; |
duke@435 | 168 | virtual void do_ArithmeticOp (ArithmeticOp* x) = 0; |
duke@435 | 169 | virtual void do_ShiftOp (ShiftOp* x) = 0; |
duke@435 | 170 | virtual void do_LogicOp (LogicOp* x) = 0; |
duke@435 | 171 | virtual void do_CompareOp (CompareOp* x) = 0; |
duke@435 | 172 | virtual void do_IfOp (IfOp* x) = 0; |
duke@435 | 173 | virtual void do_Convert (Convert* x) = 0; |
duke@435 | 174 | virtual void do_NullCheck (NullCheck* x) = 0; |
duke@435 | 175 | virtual void do_Invoke (Invoke* x) = 0; |
duke@435 | 176 | virtual void do_NewInstance (NewInstance* x) = 0; |
duke@435 | 177 | virtual void do_NewTypeArray (NewTypeArray* x) = 0; |
duke@435 | 178 | virtual void do_NewObjectArray (NewObjectArray* x) = 0; |
duke@435 | 179 | virtual void do_NewMultiArray (NewMultiArray* x) = 0; |
duke@435 | 180 | virtual void do_CheckCast (CheckCast* x) = 0; |
duke@435 | 181 | virtual void do_InstanceOf (InstanceOf* x) = 0; |
duke@435 | 182 | virtual void do_MonitorEnter (MonitorEnter* x) = 0; |
duke@435 | 183 | virtual void do_MonitorExit (MonitorExit* x) = 0; |
duke@435 | 184 | virtual void do_Intrinsic (Intrinsic* x) = 0; |
duke@435 | 185 | virtual void do_BlockBegin (BlockBegin* x) = 0; |
duke@435 | 186 | virtual void do_Goto (Goto* x) = 0; |
duke@435 | 187 | virtual void do_If (If* x) = 0; |
duke@435 | 188 | virtual void do_IfInstanceOf (IfInstanceOf* x) = 0; |
duke@435 | 189 | virtual void do_TableSwitch (TableSwitch* x) = 0; |
duke@435 | 190 | virtual void do_LookupSwitch (LookupSwitch* x) = 0; |
duke@435 | 191 | virtual void do_Return (Return* x) = 0; |
duke@435 | 192 | virtual void do_Throw (Throw* x) = 0; |
duke@435 | 193 | virtual void do_Base (Base* x) = 0; |
duke@435 | 194 | virtual void do_OsrEntry (OsrEntry* x) = 0; |
duke@435 | 195 | virtual void do_ExceptionObject(ExceptionObject* x) = 0; |
duke@435 | 196 | virtual void do_RoundFP (RoundFP* x) = 0; |
duke@435 | 197 | virtual void do_UnsafeGetRaw (UnsafeGetRaw* x) = 0; |
duke@435 | 198 | virtual void do_UnsafePutRaw (UnsafePutRaw* x) = 0; |
duke@435 | 199 | virtual void do_UnsafeGetObject(UnsafeGetObject* x) = 0; |
duke@435 | 200 | virtual void do_UnsafePutObject(UnsafePutObject* x) = 0; |
duke@435 | 201 | virtual void do_UnsafePrefetchRead (UnsafePrefetchRead* x) = 0; |
duke@435 | 202 | virtual void do_UnsafePrefetchWrite(UnsafePrefetchWrite* x) = 0; |
duke@435 | 203 | virtual void do_ProfileCall (ProfileCall* x) = 0; |
iveresov@2138 | 204 | virtual void do_ProfileInvoke (ProfileInvoke* x) = 0; |
duke@435 | 205 | }; |
duke@435 | 206 | |
duke@435 | 207 | |
duke@435 | 208 | // Hashing support |
duke@435 | 209 | // |
duke@435 | 210 | // Note: This hash functions affect the performance |
duke@435 | 211 | // of ValueMap - make changes carefully! |
duke@435 | 212 | |
duke@435 | 213 | #define HASH1(x1 ) ((intx)(x1)) |
duke@435 | 214 | #define HASH2(x1, x2 ) ((HASH1(x1 ) << 7) ^ HASH1(x2)) |
duke@435 | 215 | #define HASH3(x1, x2, x3 ) ((HASH2(x1, x2 ) << 7) ^ HASH1(x3)) |
duke@435 | 216 | #define HASH4(x1, x2, x3, x4) ((HASH3(x1, x2, x3) << 7) ^ HASH1(x4)) |
duke@435 | 217 | |
duke@435 | 218 | |
duke@435 | 219 | // The following macros are used to implement instruction-specific hashing. |
duke@435 | 220 | // By default, each instruction implements hash() and is_equal(Value), used |
duke@435 | 221 | // for value numbering/common subexpression elimination. The default imple- |
duke@435 | 222 | // mentation disables value numbering. Each instruction which can be value- |
duke@435 | 223 | // numbered, should define corresponding hash() and is_equal(Value) functions |
duke@435 | 224 | // via the macros below. The f arguments specify all the values/op codes, etc. |
duke@435 | 225 | // that need to be identical for two instructions to be identical. |
duke@435 | 226 | // |
duke@435 | 227 | // Note: The default implementation of hash() returns 0 in order to indicate |
duke@435 | 228 | // that the instruction should not be considered for value numbering. |
duke@435 | 229 | // The currently used hash functions do not guarantee that never a 0 |
duke@435 | 230 | // is produced. While this is still correct, it may be a performance |
duke@435 | 231 | // bug (no value numbering for that node). However, this situation is |
duke@435 | 232 | // so unlikely, that we are not going to handle it specially. |
duke@435 | 233 | |
duke@435 | 234 | #define HASHING1(class_name, enabled, f1) \ |
duke@435 | 235 | virtual intx hash() const { \ |
duke@435 | 236 | return (enabled) ? HASH2(name(), f1) : 0; \ |
duke@435 | 237 | } \ |
duke@435 | 238 | virtual bool is_equal(Value v) const { \ |
duke@435 | 239 | if (!(enabled) ) return false; \ |
duke@435 | 240 | class_name* _v = v->as_##class_name(); \ |
duke@435 | 241 | if (_v == NULL ) return false; \ |
duke@435 | 242 | if (f1 != _v->f1) return false; \ |
duke@435 | 243 | return true; \ |
duke@435 | 244 | } \ |
duke@435 | 245 | |
duke@435 | 246 | |
duke@435 | 247 | #define HASHING2(class_name, enabled, f1, f2) \ |
duke@435 | 248 | virtual intx hash() const { \ |
duke@435 | 249 | return (enabled) ? HASH3(name(), f1, f2) : 0; \ |
duke@435 | 250 | } \ |
duke@435 | 251 | virtual bool is_equal(Value v) const { \ |
duke@435 | 252 | if (!(enabled) ) return false; \ |
duke@435 | 253 | class_name* _v = v->as_##class_name(); \ |
duke@435 | 254 | if (_v == NULL ) return false; \ |
duke@435 | 255 | if (f1 != _v->f1) return false; \ |
duke@435 | 256 | if (f2 != _v->f2) return false; \ |
duke@435 | 257 | return true; \ |
duke@435 | 258 | } \ |
duke@435 | 259 | |
duke@435 | 260 | |
duke@435 | 261 | #define HASHING3(class_name, enabled, f1, f2, f3) \ |
duke@435 | 262 | virtual intx hash() const { \ |
duke@435 | 263 | return (enabled) ? HASH4(name(), f1, f2, f3) : 0; \ |
duke@435 | 264 | } \ |
duke@435 | 265 | virtual bool is_equal(Value v) const { \ |
duke@435 | 266 | if (!(enabled) ) return false; \ |
duke@435 | 267 | class_name* _v = v->as_##class_name(); \ |
duke@435 | 268 | if (_v == NULL ) return false; \ |
duke@435 | 269 | if (f1 != _v->f1) return false; \ |
duke@435 | 270 | if (f2 != _v->f2) return false; \ |
duke@435 | 271 | if (f3 != _v->f3) return false; \ |
duke@435 | 272 | return true; \ |
duke@435 | 273 | } \ |
duke@435 | 274 | |
duke@435 | 275 | |
duke@435 | 276 | // The mother of all instructions... |
duke@435 | 277 | |
duke@435 | 278 | class Instruction: public CompilationResourceObj { |
duke@435 | 279 | private: |
duke@435 | 280 | int _id; // the unique instruction id |
roland@2174 | 281 | #ifndef PRODUCT |
roland@2174 | 282 | int _printable_bci; // the bci of the instruction for printing |
roland@2174 | 283 | #endif |
duke@435 | 284 | int _use_count; // the number of instructions refering to this value (w/o prev/next); only roots can have use count = 0 or > 1 |
duke@435 | 285 | int _pin_state; // set of PinReason describing the reason for pinning |
duke@435 | 286 | ValueType* _type; // the instruction value type |
duke@435 | 287 | Instruction* _next; // the next instruction if any (NULL for BlockEnd instructions) |
duke@435 | 288 | Instruction* _subst; // the substitution instruction if any |
duke@435 | 289 | LIR_Opr _operand; // LIR specific information |
duke@435 | 290 | unsigned int _flags; // Flag bits |
duke@435 | 291 | |
roland@2174 | 292 | ValueStack* _state_before; // Copy of state with input operands still on stack (or NULL) |
roland@2174 | 293 | ValueStack* _exception_state; // Copy of state for exception handling |
duke@435 | 294 | XHandlers* _exception_handlers; // Flat list of exception handlers covering this instruction |
duke@435 | 295 | |
duke@435 | 296 | friend class UseCountComputer; |
iveresov@1939 | 297 | friend class BlockBegin; |
duke@435 | 298 | |
roland@2174 | 299 | void update_exception_state(ValueStack* state); |
roland@2174 | 300 | |
roland@2174 | 301 | bool has_printable_bci() const { return NOT_PRODUCT(_printable_bci != -99) PRODUCT_ONLY(false); } |
roland@2174 | 302 | |
duke@435 | 303 | protected: |
duke@435 | 304 | void set_type(ValueType* type) { |
duke@435 | 305 | assert(type != NULL, "type must exist"); |
duke@435 | 306 | _type = type; |
duke@435 | 307 | } |
duke@435 | 308 | |
duke@435 | 309 | public: |
iveresov@1939 | 310 | void* operator new(size_t size) { |
iveresov@1939 | 311 | Compilation* c = Compilation::current(); |
iveresov@1939 | 312 | void* res = c->arena()->Amalloc(size); |
iveresov@1939 | 313 | ((Instruction*)res)->_id = c->get_next_id(); |
iveresov@1939 | 314 | return res; |
iveresov@1939 | 315 | } |
iveresov@1939 | 316 | |
duke@435 | 317 | enum InstructionFlag { |
duke@435 | 318 | NeedsNullCheckFlag = 0, |
duke@435 | 319 | CanTrapFlag, |
duke@435 | 320 | DirectCompareFlag, |
duke@435 | 321 | IsEliminatedFlag, |
duke@435 | 322 | IsInitializedFlag, |
duke@435 | 323 | IsLoadedFlag, |
duke@435 | 324 | IsSafepointFlag, |
duke@435 | 325 | IsStaticFlag, |
duke@435 | 326 | IsStrictfpFlag, |
duke@435 | 327 | NeedsStoreCheckFlag, |
duke@435 | 328 | NeedsWriteBarrierFlag, |
duke@435 | 329 | PreservesStateFlag, |
duke@435 | 330 | TargetIsFinalFlag, |
duke@435 | 331 | TargetIsLoadedFlag, |
duke@435 | 332 | TargetIsStrictfpFlag, |
duke@435 | 333 | UnorderedIsTrueFlag, |
duke@435 | 334 | NeedsPatchingFlag, |
duke@435 | 335 | ThrowIncompatibleClassChangeErrorFlag, |
duke@435 | 336 | ProfileMDOFlag, |
roland@2174 | 337 | IsLinkedInBlockFlag, |
duke@435 | 338 | InstructionLastFlag |
duke@435 | 339 | }; |
duke@435 | 340 | |
duke@435 | 341 | public: |
duke@435 | 342 | bool check_flag(InstructionFlag id) const { return (_flags & (1 << id)) != 0; } |
duke@435 | 343 | void set_flag(InstructionFlag id, bool f) { _flags = f ? (_flags | (1 << id)) : (_flags & ~(1 << id)); }; |
duke@435 | 344 | |
duke@435 | 345 | // 'globally' used condition values |
duke@435 | 346 | enum Condition { |
duke@435 | 347 | eql, neq, lss, leq, gtr, geq |
duke@435 | 348 | }; |
duke@435 | 349 | |
duke@435 | 350 | // Instructions may be pinned for many reasons and under certain conditions |
duke@435 | 351 | // with enough knowledge it's possible to safely unpin them. |
duke@435 | 352 | enum PinReason { |
duke@435 | 353 | PinUnknown = 1 << 0 |
duke@435 | 354 | , PinExplicitNullCheck = 1 << 3 |
duke@435 | 355 | , PinStackForStateSplit= 1 << 12 |
duke@435 | 356 | , PinStateSplitConstructor= 1 << 13 |
duke@435 | 357 | , PinGlobalValueNumbering= 1 << 14 |
duke@435 | 358 | }; |
duke@435 | 359 | |
duke@435 | 360 | static Condition mirror(Condition cond); |
duke@435 | 361 | static Condition negate(Condition cond); |
duke@435 | 362 | |
duke@435 | 363 | // initialization |
iveresov@1939 | 364 | static int number_of_instructions() { |
iveresov@1939 | 365 | return Compilation::current()->number_of_instructions(); |
iveresov@1939 | 366 | } |
duke@435 | 367 | |
duke@435 | 368 | // creation |
roland@2179 | 369 | Instruction(ValueType* type, ValueStack* state_before = NULL, bool type_is_constant = false) |
roland@2174 | 370 | : _use_count(0) |
roland@2174 | 371 | #ifndef PRODUCT |
roland@2174 | 372 | , _printable_bci(-99) |
roland@2174 | 373 | #endif |
duke@435 | 374 | , _pin_state(0) |
duke@435 | 375 | , _type(type) |
duke@435 | 376 | , _next(NULL) |
duke@435 | 377 | , _subst(NULL) |
duke@435 | 378 | , _flags(0) |
duke@435 | 379 | , _operand(LIR_OprFact::illegalOpr) |
roland@2174 | 380 | , _state_before(state_before) |
duke@435 | 381 | , _exception_handlers(NULL) |
duke@435 | 382 | { |
roland@2174 | 383 | check_state(state_before); |
duke@435 | 384 | assert(type != NULL && (!type->is_constant() || type_is_constant), "type must exist"); |
roland@2174 | 385 | update_exception_state(_state_before); |
duke@435 | 386 | } |
duke@435 | 387 | |
duke@435 | 388 | // accessors |
duke@435 | 389 | int id() const { return _id; } |
roland@2174 | 390 | #ifndef PRODUCT |
roland@2174 | 391 | int printable_bci() const { assert(has_printable_bci(), "_printable_bci should have been set"); return _printable_bci; } |
roland@2174 | 392 | void set_printable_bci(int bci) { NOT_PRODUCT(_printable_bci = bci;) } |
roland@2174 | 393 | #endif |
duke@435 | 394 | int use_count() const { return _use_count; } |
duke@435 | 395 | int pin_state() const { return _pin_state; } |
duke@435 | 396 | bool is_pinned() const { return _pin_state != 0 || PinAllInstructions; } |
duke@435 | 397 | ValueType* type() const { return _type; } |
duke@435 | 398 | Instruction* prev(BlockBegin* block); // use carefully, expensive operation |
duke@435 | 399 | Instruction* next() const { return _next; } |
duke@435 | 400 | bool has_subst() const { return _subst != NULL; } |
duke@435 | 401 | Instruction* subst() { return _subst == NULL ? this : _subst->subst(); } |
duke@435 | 402 | LIR_Opr operand() const { return _operand; } |
duke@435 | 403 | |
duke@435 | 404 | void set_needs_null_check(bool f) { set_flag(NeedsNullCheckFlag, f); } |
duke@435 | 405 | bool needs_null_check() const { return check_flag(NeedsNullCheckFlag); } |
roland@2174 | 406 | bool is_linked() const { return check_flag(IsLinkedInBlockFlag); } |
roland@2174 | 407 | bool can_be_linked() { return as_Local() == NULL && as_Phi() == NULL; } |
duke@435 | 408 | |
duke@435 | 409 | bool has_uses() const { return use_count() > 0; } |
roland@2174 | 410 | ValueStack* state_before() const { return _state_before; } |
roland@2174 | 411 | ValueStack* exception_state() const { return _exception_state; } |
roland@2174 | 412 | virtual bool needs_exception_state() const { return true; } |
duke@435 | 413 | XHandlers* exception_handlers() const { return _exception_handlers; } |
duke@435 | 414 | |
duke@435 | 415 | // manipulation |
duke@435 | 416 | void pin(PinReason reason) { _pin_state |= reason; } |
duke@435 | 417 | void pin() { _pin_state |= PinUnknown; } |
duke@435 | 418 | // DANGEROUS: only used by EliminateStores |
duke@435 | 419 | void unpin(PinReason reason) { assert((reason & PinUnknown) == 0, "can't unpin unknown state"); _pin_state &= ~reason; } |
roland@2174 | 420 | |
roland@2174 | 421 | Instruction* set_next(Instruction* next) { |
roland@2174 | 422 | assert(next->has_printable_bci(), "_printable_bci should have been set"); |
roland@2174 | 423 | assert(next != NULL, "must not be NULL"); |
roland@2174 | 424 | assert(as_BlockEnd() == NULL, "BlockEnd instructions must have no next"); |
roland@2174 | 425 | assert(next->can_be_linked(), "shouldn't link these instructions into list"); |
roland@2174 | 426 | |
roland@2174 | 427 | next->set_flag(Instruction::IsLinkedInBlockFlag, true); |
roland@2174 | 428 | _next = next; |
roland@2174 | 429 | return next; |
roland@2174 | 430 | } |
duke@435 | 431 | |
duke@435 | 432 | Instruction* set_next(Instruction* next, int bci) { |
roland@2174 | 433 | #ifndef PRODUCT |
roland@2174 | 434 | next->set_printable_bci(bci); |
roland@2174 | 435 | #endif |
roland@2174 | 436 | return set_next(next); |
duke@435 | 437 | } |
duke@435 | 438 | |
duke@435 | 439 | void set_subst(Instruction* subst) { |
duke@435 | 440 | assert(subst == NULL || |
duke@435 | 441 | type()->base() == subst->type()->base() || |
duke@435 | 442 | subst->type()->base() == illegalType, "type can't change"); |
duke@435 | 443 | _subst = subst; |
duke@435 | 444 | } |
duke@435 | 445 | void set_exception_handlers(XHandlers *xhandlers) { _exception_handlers = xhandlers; } |
roland@2174 | 446 | void set_exception_state(ValueStack* s) { check_state(s); _exception_state = s; } |
duke@435 | 447 | |
duke@435 | 448 | // machine-specifics |
duke@435 | 449 | void set_operand(LIR_Opr operand) { assert(operand != LIR_OprFact::illegalOpr, "operand must exist"); _operand = operand; } |
duke@435 | 450 | void clear_operand() { _operand = LIR_OprFact::illegalOpr; } |
duke@435 | 451 | |
duke@435 | 452 | // generic |
duke@435 | 453 | virtual Instruction* as_Instruction() { return this; } // to satisfy HASHING1 macro |
roland@2254 | 454 | virtual Phi* as_Phi() { return NULL; } |
duke@435 | 455 | virtual Local* as_Local() { return NULL; } |
duke@435 | 456 | virtual Constant* as_Constant() { return NULL; } |
duke@435 | 457 | virtual AccessField* as_AccessField() { return NULL; } |
duke@435 | 458 | virtual LoadField* as_LoadField() { return NULL; } |
duke@435 | 459 | virtual StoreField* as_StoreField() { return NULL; } |
duke@435 | 460 | virtual AccessArray* as_AccessArray() { return NULL; } |
duke@435 | 461 | virtual ArrayLength* as_ArrayLength() { return NULL; } |
duke@435 | 462 | virtual AccessIndexed* as_AccessIndexed() { return NULL; } |
duke@435 | 463 | virtual LoadIndexed* as_LoadIndexed() { return NULL; } |
duke@435 | 464 | virtual StoreIndexed* as_StoreIndexed() { return NULL; } |
duke@435 | 465 | virtual NegateOp* as_NegateOp() { return NULL; } |
duke@435 | 466 | virtual Op2* as_Op2() { return NULL; } |
duke@435 | 467 | virtual ArithmeticOp* as_ArithmeticOp() { return NULL; } |
duke@435 | 468 | virtual ShiftOp* as_ShiftOp() { return NULL; } |
duke@435 | 469 | virtual LogicOp* as_LogicOp() { return NULL; } |
duke@435 | 470 | virtual CompareOp* as_CompareOp() { return NULL; } |
duke@435 | 471 | virtual IfOp* as_IfOp() { return NULL; } |
duke@435 | 472 | virtual Convert* as_Convert() { return NULL; } |
duke@435 | 473 | virtual NullCheck* as_NullCheck() { return NULL; } |
duke@435 | 474 | virtual OsrEntry* as_OsrEntry() { return NULL; } |
duke@435 | 475 | virtual StateSplit* as_StateSplit() { return NULL; } |
duke@435 | 476 | virtual Invoke* as_Invoke() { return NULL; } |
duke@435 | 477 | virtual NewInstance* as_NewInstance() { return NULL; } |
duke@435 | 478 | virtual NewArray* as_NewArray() { return NULL; } |
duke@435 | 479 | virtual NewTypeArray* as_NewTypeArray() { return NULL; } |
duke@435 | 480 | virtual NewObjectArray* as_NewObjectArray() { return NULL; } |
duke@435 | 481 | virtual NewMultiArray* as_NewMultiArray() { return NULL; } |
duke@435 | 482 | virtual TypeCheck* as_TypeCheck() { return NULL; } |
duke@435 | 483 | virtual CheckCast* as_CheckCast() { return NULL; } |
duke@435 | 484 | virtual InstanceOf* as_InstanceOf() { return NULL; } |
duke@435 | 485 | virtual AccessMonitor* as_AccessMonitor() { return NULL; } |
duke@435 | 486 | virtual MonitorEnter* as_MonitorEnter() { return NULL; } |
duke@435 | 487 | virtual MonitorExit* as_MonitorExit() { return NULL; } |
duke@435 | 488 | virtual Intrinsic* as_Intrinsic() { return NULL; } |
duke@435 | 489 | virtual BlockBegin* as_BlockBegin() { return NULL; } |
duke@435 | 490 | virtual BlockEnd* as_BlockEnd() { return NULL; } |
duke@435 | 491 | virtual Goto* as_Goto() { return NULL; } |
duke@435 | 492 | virtual If* as_If() { return NULL; } |
duke@435 | 493 | virtual IfInstanceOf* as_IfInstanceOf() { return NULL; } |
duke@435 | 494 | virtual TableSwitch* as_TableSwitch() { return NULL; } |
duke@435 | 495 | virtual LookupSwitch* as_LookupSwitch() { return NULL; } |
duke@435 | 496 | virtual Return* as_Return() { return NULL; } |
duke@435 | 497 | virtual Throw* as_Throw() { return NULL; } |
duke@435 | 498 | virtual Base* as_Base() { return NULL; } |
duke@435 | 499 | virtual RoundFP* as_RoundFP() { return NULL; } |
duke@435 | 500 | virtual ExceptionObject* as_ExceptionObject() { return NULL; } |
duke@435 | 501 | virtual UnsafeOp* as_UnsafeOp() { return NULL; } |
duke@435 | 502 | |
duke@435 | 503 | virtual void visit(InstructionVisitor* v) = 0; |
duke@435 | 504 | |
duke@435 | 505 | virtual bool can_trap() const { return false; } |
duke@435 | 506 | |
iveresov@1939 | 507 | virtual void input_values_do(ValueVisitor* f) = 0; |
roland@2174 | 508 | virtual void state_values_do(ValueVisitor* f); |
iveresov@1939 | 509 | virtual void other_values_do(ValueVisitor* f) { /* usually no other - override on demand */ } |
iveresov@1939 | 510 | void values_do(ValueVisitor* f) { input_values_do(f); state_values_do(f); other_values_do(f); } |
duke@435 | 511 | |
duke@435 | 512 | virtual ciType* exact_type() const { return NULL; } |
duke@435 | 513 | virtual ciType* declared_type() const { return NULL; } |
duke@435 | 514 | |
duke@435 | 515 | // hashing |
duke@435 | 516 | virtual const char* name() const = 0; |
duke@435 | 517 | HASHING1(Instruction, false, id()) // hashing disabled by default |
duke@435 | 518 | |
duke@435 | 519 | // debugging |
roland@2174 | 520 | static void check_state(ValueStack* state) PRODUCT_RETURN; |
duke@435 | 521 | void print() PRODUCT_RETURN; |
duke@435 | 522 | void print_line() PRODUCT_RETURN; |
duke@435 | 523 | void print(InstructionPrinter& ip) PRODUCT_RETURN; |
duke@435 | 524 | }; |
duke@435 | 525 | |
duke@435 | 526 | |
duke@435 | 527 | // The following macros are used to define base (i.e., non-leaf) |
duke@435 | 528 | // and leaf instruction classes. They define class-name related |
duke@435 | 529 | // generic functionality in one place. |
duke@435 | 530 | |
duke@435 | 531 | #define BASE(class_name, super_class_name) \ |
duke@435 | 532 | class class_name: public super_class_name { \ |
duke@435 | 533 | public: \ |
duke@435 | 534 | virtual class_name* as_##class_name() { return this; } \ |
duke@435 | 535 | |
duke@435 | 536 | |
duke@435 | 537 | #define LEAF(class_name, super_class_name) \ |
duke@435 | 538 | BASE(class_name, super_class_name) \ |
duke@435 | 539 | public: \ |
duke@435 | 540 | virtual const char* name() const { return #class_name; } \ |
duke@435 | 541 | virtual void visit(InstructionVisitor* v) { v->do_##class_name(this); } \ |
duke@435 | 542 | |
duke@435 | 543 | |
duke@435 | 544 | // Debugging support |
duke@435 | 545 | |
iveresov@1939 | 546 | |
duke@435 | 547 | #ifdef ASSERT |
iveresov@1939 | 548 | class AssertValues: public ValueVisitor { |
iveresov@1939 | 549 | void visit(Value* x) { assert((*x) != NULL, "value must exist"); } |
iveresov@1939 | 550 | }; |
iveresov@1939 | 551 | #define ASSERT_VALUES { AssertValues assert_value; values_do(&assert_value); } |
duke@435 | 552 | #else |
duke@435 | 553 | #define ASSERT_VALUES |
duke@435 | 554 | #endif // ASSERT |
duke@435 | 555 | |
duke@435 | 556 | |
duke@435 | 557 | // A Phi is a phi function in the sense of SSA form. It stands for |
duke@435 | 558 | // the value of a local variable at the beginning of a join block. |
duke@435 | 559 | // A Phi consists of n operands, one for every incoming branch. |
duke@435 | 560 | |
duke@435 | 561 | LEAF(Phi, Instruction) |
duke@435 | 562 | private: |
duke@435 | 563 | BlockBegin* _block; // the block to which the phi function belongs |
duke@435 | 564 | int _pf_flags; // the flags of the phi function |
duke@435 | 565 | int _index; // to value on operand stack (index < 0) or to local |
duke@435 | 566 | public: |
duke@435 | 567 | // creation |
duke@435 | 568 | Phi(ValueType* type, BlockBegin* b, int index) |
duke@435 | 569 | : Instruction(type->base()) |
duke@435 | 570 | , _pf_flags(0) |
duke@435 | 571 | , _block(b) |
duke@435 | 572 | , _index(index) |
duke@435 | 573 | { |
duke@435 | 574 | if (type->is_illegal()) { |
duke@435 | 575 | make_illegal(); |
duke@435 | 576 | } |
duke@435 | 577 | } |
duke@435 | 578 | |
duke@435 | 579 | // flags |
duke@435 | 580 | enum Flag { |
duke@435 | 581 | no_flag = 0, |
duke@435 | 582 | visited = 1 << 0, |
duke@435 | 583 | cannot_simplify = 1 << 1 |
duke@435 | 584 | }; |
duke@435 | 585 | |
duke@435 | 586 | // accessors |
duke@435 | 587 | bool is_local() const { return _index >= 0; } |
duke@435 | 588 | bool is_on_stack() const { return !is_local(); } |
duke@435 | 589 | int local_index() const { assert(is_local(), ""); return _index; } |
duke@435 | 590 | int stack_index() const { assert(is_on_stack(), ""); return -(_index+1); } |
duke@435 | 591 | |
duke@435 | 592 | Value operand_at(int i) const; |
duke@435 | 593 | int operand_count() const; |
duke@435 | 594 | |
duke@435 | 595 | BlockBegin* block() const { return _block; } |
duke@435 | 596 | |
duke@435 | 597 | void set(Flag f) { _pf_flags |= f; } |
duke@435 | 598 | void clear(Flag f) { _pf_flags &= ~f; } |
duke@435 | 599 | bool is_set(Flag f) const { return (_pf_flags & f) != 0; } |
duke@435 | 600 | |
duke@435 | 601 | // Invalidates phis corresponding to merges of locals of two different types |
duke@435 | 602 | // (these should never be referenced, otherwise the bytecodes are illegal) |
duke@435 | 603 | void make_illegal() { |
duke@435 | 604 | set(cannot_simplify); |
duke@435 | 605 | set_type(illegalType); |
duke@435 | 606 | } |
duke@435 | 607 | |
duke@435 | 608 | bool is_illegal() const { |
duke@435 | 609 | return type()->is_illegal(); |
duke@435 | 610 | } |
duke@435 | 611 | |
duke@435 | 612 | // generic |
iveresov@1939 | 613 | virtual void input_values_do(ValueVisitor* f) { |
duke@435 | 614 | } |
duke@435 | 615 | }; |
duke@435 | 616 | |
duke@435 | 617 | |
duke@435 | 618 | // A local is a placeholder for an incoming argument to a function call. |
duke@435 | 619 | LEAF(Local, Instruction) |
duke@435 | 620 | private: |
duke@435 | 621 | int _java_index; // the local index within the method to which the local belongs |
duke@435 | 622 | public: |
duke@435 | 623 | // creation |
duke@435 | 624 | Local(ValueType* type, int index) |
duke@435 | 625 | : Instruction(type) |
duke@435 | 626 | , _java_index(index) |
duke@435 | 627 | {} |
duke@435 | 628 | |
duke@435 | 629 | // accessors |
duke@435 | 630 | int java_index() const { return _java_index; } |
duke@435 | 631 | |
duke@435 | 632 | // generic |
iveresov@1939 | 633 | virtual void input_values_do(ValueVisitor* f) { /* no values */ } |
duke@435 | 634 | }; |
duke@435 | 635 | |
duke@435 | 636 | |
duke@435 | 637 | LEAF(Constant, Instruction) |
duke@435 | 638 | public: |
duke@435 | 639 | // creation |
duke@435 | 640 | Constant(ValueType* type): |
roland@2174 | 641 | Instruction(type, NULL, true) |
roland@2174 | 642 | { |
duke@435 | 643 | assert(type->is_constant(), "must be a constant"); |
duke@435 | 644 | } |
duke@435 | 645 | |
roland@2174 | 646 | Constant(ValueType* type, ValueStack* state_before): |
roland@2174 | 647 | Instruction(type, state_before, true) |
roland@2174 | 648 | { |
roland@2174 | 649 | assert(state_before != NULL, "only used for constants which need patching"); |
duke@435 | 650 | assert(type->is_constant(), "must be a constant"); |
duke@435 | 651 | // since it's patching it needs to be pinned |
duke@435 | 652 | pin(); |
duke@435 | 653 | } |
duke@435 | 654 | |
roland@2174 | 655 | virtual bool can_trap() const { return state_before() != NULL; } |
iveresov@1939 | 656 | virtual void input_values_do(ValueVisitor* f) { /* no values */ } |
duke@435 | 657 | |
duke@435 | 658 | virtual intx hash() const; |
duke@435 | 659 | virtual bool is_equal(Value v) const; |
duke@435 | 660 | |
roland@2254 | 661 | |
roland@2254 | 662 | enum CompareResult { not_comparable = -1, cond_false, cond_true }; |
roland@2254 | 663 | |
roland@2254 | 664 | virtual CompareResult compare(Instruction::Condition condition, Value right) const; |
roland@2254 | 665 | BlockBegin* compare(Instruction::Condition cond, Value right, |
roland@2254 | 666 | BlockBegin* true_sux, BlockBegin* false_sux) const { |
roland@2254 | 667 | switch (compare(cond, right)) { |
roland@2254 | 668 | case not_comparable: |
roland@2254 | 669 | return NULL; |
roland@2254 | 670 | case cond_false: |
roland@2254 | 671 | return false_sux; |
roland@2254 | 672 | case cond_true: |
roland@2254 | 673 | return true_sux; |
roland@2254 | 674 | default: |
roland@2254 | 675 | ShouldNotReachHere(); |
roland@2254 | 676 | return NULL; |
roland@2254 | 677 | } |
roland@2254 | 678 | } |
duke@435 | 679 | }; |
duke@435 | 680 | |
duke@435 | 681 | |
duke@435 | 682 | BASE(AccessField, Instruction) |
duke@435 | 683 | private: |
duke@435 | 684 | Value _obj; |
duke@435 | 685 | int _offset; |
duke@435 | 686 | ciField* _field; |
duke@435 | 687 | NullCheck* _explicit_null_check; // For explicit null check elimination |
duke@435 | 688 | |
duke@435 | 689 | public: |
duke@435 | 690 | // creation |
roland@2174 | 691 | AccessField(Value obj, int offset, ciField* field, bool is_static, |
duke@435 | 692 | ValueStack* state_before, bool is_loaded, bool is_initialized) |
roland@2174 | 693 | : Instruction(as_ValueType(field->type()->basic_type()), state_before) |
duke@435 | 694 | , _obj(obj) |
duke@435 | 695 | , _offset(offset) |
duke@435 | 696 | , _field(field) |
duke@435 | 697 | , _explicit_null_check(NULL) |
duke@435 | 698 | { |
duke@435 | 699 | set_needs_null_check(!is_static); |
duke@435 | 700 | set_flag(IsLoadedFlag, is_loaded); |
duke@435 | 701 | set_flag(IsInitializedFlag, is_initialized); |
duke@435 | 702 | set_flag(IsStaticFlag, is_static); |
duke@435 | 703 | ASSERT_VALUES |
duke@435 | 704 | if (!is_loaded || (PatchALot && !field->is_volatile())) { |
duke@435 | 705 | // need to patch if the holder wasn't loaded or we're testing |
duke@435 | 706 | // using PatchALot. Don't allow PatchALot for fields which are |
duke@435 | 707 | // known to be volatile they aren't patchable. |
duke@435 | 708 | set_flag(NeedsPatchingFlag, true); |
duke@435 | 709 | } |
duke@435 | 710 | // pin of all instructions with memory access |
duke@435 | 711 | pin(); |
duke@435 | 712 | } |
duke@435 | 713 | |
duke@435 | 714 | // accessors |
duke@435 | 715 | Value obj() const { return _obj; } |
duke@435 | 716 | int offset() const { return _offset; } |
duke@435 | 717 | ciField* field() const { return _field; } |
duke@435 | 718 | BasicType field_type() const { return _field->type()->basic_type(); } |
duke@435 | 719 | bool is_static() const { return check_flag(IsStaticFlag); } |
duke@435 | 720 | bool is_loaded() const { return check_flag(IsLoadedFlag); } |
duke@435 | 721 | bool is_initialized() const { return check_flag(IsInitializedFlag); } |
duke@435 | 722 | NullCheck* explicit_null_check() const { return _explicit_null_check; } |
duke@435 | 723 | bool needs_patching() const { return check_flag(NeedsPatchingFlag); } |
duke@435 | 724 | |
duke@435 | 725 | // manipulation |
roland@2174 | 726 | |
duke@435 | 727 | // Under certain circumstances, if a previous NullCheck instruction |
duke@435 | 728 | // proved the target object non-null, we can eliminate the explicit |
duke@435 | 729 | // null check and do an implicit one, simply specifying the debug |
duke@435 | 730 | // information from the NullCheck. This field should only be consulted |
duke@435 | 731 | // if needs_null_check() is true. |
duke@435 | 732 | void set_explicit_null_check(NullCheck* check) { _explicit_null_check = check; } |
duke@435 | 733 | |
duke@435 | 734 | // generic |
duke@435 | 735 | virtual bool can_trap() const { return needs_null_check() || needs_patching(); } |
iveresov@1939 | 736 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_obj); } |
duke@435 | 737 | }; |
duke@435 | 738 | |
duke@435 | 739 | |
duke@435 | 740 | LEAF(LoadField, AccessField) |
duke@435 | 741 | public: |
duke@435 | 742 | // creation |
roland@2174 | 743 | LoadField(Value obj, int offset, ciField* field, bool is_static, |
duke@435 | 744 | ValueStack* state_before, bool is_loaded, bool is_initialized) |
roland@2174 | 745 | : AccessField(obj, offset, field, is_static, state_before, is_loaded, is_initialized) |
duke@435 | 746 | {} |
duke@435 | 747 | |
duke@435 | 748 | ciType* declared_type() const; |
duke@435 | 749 | ciType* exact_type() const; |
duke@435 | 750 | |
duke@435 | 751 | // generic |
duke@435 | 752 | HASHING2(LoadField, is_loaded() && !field()->is_volatile(), obj()->subst(), offset()) // cannot be eliminated if not yet loaded or if volatile |
duke@435 | 753 | }; |
duke@435 | 754 | |
duke@435 | 755 | |
duke@435 | 756 | LEAF(StoreField, AccessField) |
duke@435 | 757 | private: |
duke@435 | 758 | Value _value; |
duke@435 | 759 | |
duke@435 | 760 | public: |
duke@435 | 761 | // creation |
roland@2174 | 762 | StoreField(Value obj, int offset, ciField* field, Value value, bool is_static, |
duke@435 | 763 | ValueStack* state_before, bool is_loaded, bool is_initialized) |
roland@2174 | 764 | : AccessField(obj, offset, field, is_static, state_before, is_loaded, is_initialized) |
duke@435 | 765 | , _value(value) |
duke@435 | 766 | { |
duke@435 | 767 | set_flag(NeedsWriteBarrierFlag, as_ValueType(field_type())->is_object()); |
duke@435 | 768 | ASSERT_VALUES |
duke@435 | 769 | pin(); |
duke@435 | 770 | } |
duke@435 | 771 | |
duke@435 | 772 | // accessors |
duke@435 | 773 | Value value() const { return _value; } |
duke@435 | 774 | bool needs_write_barrier() const { return check_flag(NeedsWriteBarrierFlag); } |
duke@435 | 775 | |
duke@435 | 776 | // generic |
iveresov@1939 | 777 | virtual void input_values_do(ValueVisitor* f) { AccessField::input_values_do(f); f->visit(&_value); } |
duke@435 | 778 | }; |
duke@435 | 779 | |
duke@435 | 780 | |
duke@435 | 781 | BASE(AccessArray, Instruction) |
duke@435 | 782 | private: |
duke@435 | 783 | Value _array; |
duke@435 | 784 | |
duke@435 | 785 | public: |
duke@435 | 786 | // creation |
roland@2174 | 787 | AccessArray(ValueType* type, Value array, ValueStack* state_before) |
roland@2174 | 788 | : Instruction(type, state_before) |
duke@435 | 789 | , _array(array) |
roland@2174 | 790 | { |
duke@435 | 791 | set_needs_null_check(true); |
duke@435 | 792 | ASSERT_VALUES |
duke@435 | 793 | pin(); // instruction with side effect (null exception or range check throwing) |
duke@435 | 794 | } |
duke@435 | 795 | |
duke@435 | 796 | Value array() const { return _array; } |
duke@435 | 797 | |
duke@435 | 798 | // generic |
duke@435 | 799 | virtual bool can_trap() const { return needs_null_check(); } |
iveresov@1939 | 800 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_array); } |
duke@435 | 801 | }; |
duke@435 | 802 | |
duke@435 | 803 | |
duke@435 | 804 | LEAF(ArrayLength, AccessArray) |
duke@435 | 805 | private: |
duke@435 | 806 | NullCheck* _explicit_null_check; // For explicit null check elimination |
duke@435 | 807 | |
duke@435 | 808 | public: |
duke@435 | 809 | // creation |
roland@2174 | 810 | ArrayLength(Value array, ValueStack* state_before) |
roland@2174 | 811 | : AccessArray(intType, array, state_before) |
duke@435 | 812 | , _explicit_null_check(NULL) {} |
duke@435 | 813 | |
duke@435 | 814 | // accessors |
duke@435 | 815 | NullCheck* explicit_null_check() const { return _explicit_null_check; } |
duke@435 | 816 | |
duke@435 | 817 | // setters |
duke@435 | 818 | // See LoadField::set_explicit_null_check for documentation |
duke@435 | 819 | void set_explicit_null_check(NullCheck* check) { _explicit_null_check = check; } |
duke@435 | 820 | |
duke@435 | 821 | // generic |
duke@435 | 822 | HASHING1(ArrayLength, true, array()->subst()) |
duke@435 | 823 | }; |
duke@435 | 824 | |
duke@435 | 825 | |
duke@435 | 826 | BASE(AccessIndexed, AccessArray) |
duke@435 | 827 | private: |
duke@435 | 828 | Value _index; |
duke@435 | 829 | Value _length; |
duke@435 | 830 | BasicType _elt_type; |
duke@435 | 831 | |
duke@435 | 832 | public: |
duke@435 | 833 | // creation |
roland@2174 | 834 | AccessIndexed(Value array, Value index, Value length, BasicType elt_type, ValueStack* state_before) |
roland@2174 | 835 | : AccessArray(as_ValueType(elt_type), array, state_before) |
duke@435 | 836 | , _index(index) |
duke@435 | 837 | , _length(length) |
duke@435 | 838 | , _elt_type(elt_type) |
duke@435 | 839 | { |
duke@435 | 840 | ASSERT_VALUES |
duke@435 | 841 | } |
duke@435 | 842 | |
duke@435 | 843 | // accessors |
duke@435 | 844 | Value index() const { return _index; } |
duke@435 | 845 | Value length() const { return _length; } |
duke@435 | 846 | BasicType elt_type() const { return _elt_type; } |
duke@435 | 847 | |
duke@435 | 848 | // perform elimination of range checks involving constants |
duke@435 | 849 | bool compute_needs_range_check(); |
duke@435 | 850 | |
duke@435 | 851 | // generic |
iveresov@1939 | 852 | virtual void input_values_do(ValueVisitor* f) { AccessArray::input_values_do(f); f->visit(&_index); if (_length != NULL) f->visit(&_length); } |
duke@435 | 853 | }; |
duke@435 | 854 | |
duke@435 | 855 | |
duke@435 | 856 | LEAF(LoadIndexed, AccessIndexed) |
duke@435 | 857 | private: |
duke@435 | 858 | NullCheck* _explicit_null_check; // For explicit null check elimination |
duke@435 | 859 | |
duke@435 | 860 | public: |
duke@435 | 861 | // creation |
roland@2174 | 862 | LoadIndexed(Value array, Value index, Value length, BasicType elt_type, ValueStack* state_before) |
roland@2174 | 863 | : AccessIndexed(array, index, length, elt_type, state_before) |
duke@435 | 864 | , _explicit_null_check(NULL) {} |
duke@435 | 865 | |
duke@435 | 866 | // accessors |
duke@435 | 867 | NullCheck* explicit_null_check() const { return _explicit_null_check; } |
duke@435 | 868 | |
duke@435 | 869 | // setters |
duke@435 | 870 | // See LoadField::set_explicit_null_check for documentation |
duke@435 | 871 | void set_explicit_null_check(NullCheck* check) { _explicit_null_check = check; } |
duke@435 | 872 | |
duke@435 | 873 | ciType* exact_type() const; |
duke@435 | 874 | ciType* declared_type() const; |
duke@435 | 875 | |
duke@435 | 876 | // generic |
duke@435 | 877 | HASHING2(LoadIndexed, true, array()->subst(), index()->subst()) |
duke@435 | 878 | }; |
duke@435 | 879 | |
duke@435 | 880 | |
duke@435 | 881 | LEAF(StoreIndexed, AccessIndexed) |
duke@435 | 882 | private: |
duke@435 | 883 | Value _value; |
duke@435 | 884 | |
iveresov@2146 | 885 | ciMethod* _profiled_method; |
iveresov@2146 | 886 | int _profiled_bci; |
duke@435 | 887 | public: |
duke@435 | 888 | // creation |
roland@2174 | 889 | StoreIndexed(Value array, Value index, Value length, BasicType elt_type, Value value, ValueStack* state_before) |
roland@2174 | 890 | : AccessIndexed(array, index, length, elt_type, state_before) |
iveresov@2146 | 891 | , _value(value), _profiled_method(NULL), _profiled_bci(0) |
duke@435 | 892 | { |
duke@435 | 893 | set_flag(NeedsWriteBarrierFlag, (as_ValueType(elt_type)->is_object())); |
duke@435 | 894 | set_flag(NeedsStoreCheckFlag, (as_ValueType(elt_type)->is_object())); |
duke@435 | 895 | ASSERT_VALUES |
duke@435 | 896 | pin(); |
duke@435 | 897 | } |
duke@435 | 898 | |
duke@435 | 899 | // accessors |
duke@435 | 900 | Value value() const { return _value; } |
duke@435 | 901 | bool needs_write_barrier() const { return check_flag(NeedsWriteBarrierFlag); } |
duke@435 | 902 | bool needs_store_check() const { return check_flag(NeedsStoreCheckFlag); } |
iveresov@2146 | 903 | // Helpers for methodDataOop profiling |
iveresov@2146 | 904 | void set_should_profile(bool value) { set_flag(ProfileMDOFlag, value); } |
iveresov@2146 | 905 | void set_profiled_method(ciMethod* method) { _profiled_method = method; } |
iveresov@2146 | 906 | void set_profiled_bci(int bci) { _profiled_bci = bci; } |
iveresov@2146 | 907 | bool should_profile() const { return check_flag(ProfileMDOFlag); } |
iveresov@2146 | 908 | ciMethod* profiled_method() const { return _profiled_method; } |
iveresov@2146 | 909 | int profiled_bci() const { return _profiled_bci; } |
duke@435 | 910 | // generic |
iveresov@1939 | 911 | virtual void input_values_do(ValueVisitor* f) { AccessIndexed::input_values_do(f); f->visit(&_value); } |
duke@435 | 912 | }; |
duke@435 | 913 | |
duke@435 | 914 | |
duke@435 | 915 | LEAF(NegateOp, Instruction) |
duke@435 | 916 | private: |
duke@435 | 917 | Value _x; |
duke@435 | 918 | |
duke@435 | 919 | public: |
duke@435 | 920 | // creation |
duke@435 | 921 | NegateOp(Value x) : Instruction(x->type()->base()), _x(x) { |
duke@435 | 922 | ASSERT_VALUES |
duke@435 | 923 | } |
duke@435 | 924 | |
duke@435 | 925 | // accessors |
duke@435 | 926 | Value x() const { return _x; } |
duke@435 | 927 | |
duke@435 | 928 | // generic |
iveresov@1939 | 929 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_x); } |
duke@435 | 930 | }; |
duke@435 | 931 | |
duke@435 | 932 | |
duke@435 | 933 | BASE(Op2, Instruction) |
duke@435 | 934 | private: |
duke@435 | 935 | Bytecodes::Code _op; |
duke@435 | 936 | Value _x; |
duke@435 | 937 | Value _y; |
duke@435 | 938 | |
duke@435 | 939 | public: |
duke@435 | 940 | // creation |
roland@2174 | 941 | Op2(ValueType* type, Bytecodes::Code op, Value x, Value y, ValueStack* state_before = NULL) |
roland@2174 | 942 | : Instruction(type, state_before) |
roland@2174 | 943 | , _op(op) |
roland@2174 | 944 | , _x(x) |
roland@2174 | 945 | , _y(y) |
roland@2174 | 946 | { |
duke@435 | 947 | ASSERT_VALUES |
duke@435 | 948 | } |
duke@435 | 949 | |
duke@435 | 950 | // accessors |
duke@435 | 951 | Bytecodes::Code op() const { return _op; } |
duke@435 | 952 | Value x() const { return _x; } |
duke@435 | 953 | Value y() const { return _y; } |
duke@435 | 954 | |
duke@435 | 955 | // manipulators |
duke@435 | 956 | void swap_operands() { |
duke@435 | 957 | assert(is_commutative(), "operation must be commutative"); |
duke@435 | 958 | Value t = _x; _x = _y; _y = t; |
duke@435 | 959 | } |
duke@435 | 960 | |
duke@435 | 961 | // generic |
duke@435 | 962 | virtual bool is_commutative() const { return false; } |
iveresov@1939 | 963 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_x); f->visit(&_y); } |
duke@435 | 964 | }; |
duke@435 | 965 | |
duke@435 | 966 | |
duke@435 | 967 | LEAF(ArithmeticOp, Op2) |
duke@435 | 968 | public: |
duke@435 | 969 | // creation |
roland@2174 | 970 | ArithmeticOp(Bytecodes::Code op, Value x, Value y, bool is_strictfp, ValueStack* state_before) |
roland@2174 | 971 | : Op2(x->type()->meet(y->type()), op, x, y, state_before) |
roland@2174 | 972 | { |
duke@435 | 973 | set_flag(IsStrictfpFlag, is_strictfp); |
duke@435 | 974 | if (can_trap()) pin(); |
duke@435 | 975 | } |
duke@435 | 976 | |
duke@435 | 977 | // accessors |
duke@435 | 978 | bool is_strictfp() const { return check_flag(IsStrictfpFlag); } |
duke@435 | 979 | |
duke@435 | 980 | // generic |
duke@435 | 981 | virtual bool is_commutative() const; |
duke@435 | 982 | virtual bool can_trap() const; |
duke@435 | 983 | HASHING3(Op2, true, op(), x()->subst(), y()->subst()) |
duke@435 | 984 | }; |
duke@435 | 985 | |
duke@435 | 986 | |
duke@435 | 987 | LEAF(ShiftOp, Op2) |
duke@435 | 988 | public: |
duke@435 | 989 | // creation |
duke@435 | 990 | ShiftOp(Bytecodes::Code op, Value x, Value s) : Op2(x->type()->base(), op, x, s) {} |
duke@435 | 991 | |
duke@435 | 992 | // generic |
duke@435 | 993 | HASHING3(Op2, true, op(), x()->subst(), y()->subst()) |
duke@435 | 994 | }; |
duke@435 | 995 | |
duke@435 | 996 | |
duke@435 | 997 | LEAF(LogicOp, Op2) |
duke@435 | 998 | public: |
duke@435 | 999 | // creation |
duke@435 | 1000 | LogicOp(Bytecodes::Code op, Value x, Value y) : Op2(x->type()->meet(y->type()), op, x, y) {} |
duke@435 | 1001 | |
duke@435 | 1002 | // generic |
duke@435 | 1003 | virtual bool is_commutative() const; |
duke@435 | 1004 | HASHING3(Op2, true, op(), x()->subst(), y()->subst()) |
duke@435 | 1005 | }; |
duke@435 | 1006 | |
duke@435 | 1007 | |
duke@435 | 1008 | LEAF(CompareOp, Op2) |
duke@435 | 1009 | public: |
duke@435 | 1010 | // creation |
duke@435 | 1011 | CompareOp(Bytecodes::Code op, Value x, Value y, ValueStack* state_before) |
roland@2174 | 1012 | : Op2(intType, op, x, y, state_before) |
duke@435 | 1013 | {} |
duke@435 | 1014 | |
duke@435 | 1015 | // generic |
duke@435 | 1016 | HASHING3(Op2, true, op(), x()->subst(), y()->subst()) |
duke@435 | 1017 | }; |
duke@435 | 1018 | |
duke@435 | 1019 | |
duke@435 | 1020 | LEAF(IfOp, Op2) |
duke@435 | 1021 | private: |
duke@435 | 1022 | Value _tval; |
duke@435 | 1023 | Value _fval; |
duke@435 | 1024 | |
duke@435 | 1025 | public: |
duke@435 | 1026 | // creation |
duke@435 | 1027 | IfOp(Value x, Condition cond, Value y, Value tval, Value fval) |
duke@435 | 1028 | : Op2(tval->type()->meet(fval->type()), (Bytecodes::Code)cond, x, y) |
duke@435 | 1029 | , _tval(tval) |
duke@435 | 1030 | , _fval(fval) |
duke@435 | 1031 | { |
duke@435 | 1032 | ASSERT_VALUES |
duke@435 | 1033 | assert(tval->type()->tag() == fval->type()->tag(), "types must match"); |
duke@435 | 1034 | } |
duke@435 | 1035 | |
duke@435 | 1036 | // accessors |
duke@435 | 1037 | virtual bool is_commutative() const; |
duke@435 | 1038 | Bytecodes::Code op() const { ShouldNotCallThis(); return Bytecodes::_illegal; } |
duke@435 | 1039 | Condition cond() const { return (Condition)Op2::op(); } |
duke@435 | 1040 | Value tval() const { return _tval; } |
duke@435 | 1041 | Value fval() const { return _fval; } |
duke@435 | 1042 | |
duke@435 | 1043 | // generic |
iveresov@1939 | 1044 | virtual void input_values_do(ValueVisitor* f) { Op2::input_values_do(f); f->visit(&_tval); f->visit(&_fval); } |
duke@435 | 1045 | }; |
duke@435 | 1046 | |
duke@435 | 1047 | |
duke@435 | 1048 | LEAF(Convert, Instruction) |
duke@435 | 1049 | private: |
duke@435 | 1050 | Bytecodes::Code _op; |
duke@435 | 1051 | Value _value; |
duke@435 | 1052 | |
duke@435 | 1053 | public: |
duke@435 | 1054 | // creation |
duke@435 | 1055 | Convert(Bytecodes::Code op, Value value, ValueType* to_type) : Instruction(to_type), _op(op), _value(value) { |
duke@435 | 1056 | ASSERT_VALUES |
duke@435 | 1057 | } |
duke@435 | 1058 | |
duke@435 | 1059 | // accessors |
duke@435 | 1060 | Bytecodes::Code op() const { return _op; } |
duke@435 | 1061 | Value value() const { return _value; } |
duke@435 | 1062 | |
duke@435 | 1063 | // generic |
iveresov@1939 | 1064 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_value); } |
duke@435 | 1065 | HASHING2(Convert, true, op(), value()->subst()) |
duke@435 | 1066 | }; |
duke@435 | 1067 | |
duke@435 | 1068 | |
duke@435 | 1069 | LEAF(NullCheck, Instruction) |
duke@435 | 1070 | private: |
duke@435 | 1071 | Value _obj; |
duke@435 | 1072 | |
duke@435 | 1073 | public: |
duke@435 | 1074 | // creation |
roland@2174 | 1075 | NullCheck(Value obj, ValueStack* state_before) |
roland@2174 | 1076 | : Instruction(obj->type()->base(), state_before) |
roland@2174 | 1077 | , _obj(obj) |
roland@2174 | 1078 | { |
duke@435 | 1079 | ASSERT_VALUES |
duke@435 | 1080 | set_can_trap(true); |
duke@435 | 1081 | assert(_obj->type()->is_object(), "null check must be applied to objects only"); |
duke@435 | 1082 | pin(Instruction::PinExplicitNullCheck); |
duke@435 | 1083 | } |
duke@435 | 1084 | |
duke@435 | 1085 | // accessors |
duke@435 | 1086 | Value obj() const { return _obj; } |
duke@435 | 1087 | |
duke@435 | 1088 | // setters |
duke@435 | 1089 | void set_can_trap(bool can_trap) { set_flag(CanTrapFlag, can_trap); } |
duke@435 | 1090 | |
duke@435 | 1091 | // generic |
duke@435 | 1092 | virtual bool can_trap() const { return check_flag(CanTrapFlag); /* null-check elimination sets to false */ } |
iveresov@1939 | 1093 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_obj); } |
duke@435 | 1094 | HASHING1(NullCheck, true, obj()->subst()) |
duke@435 | 1095 | }; |
duke@435 | 1096 | |
duke@435 | 1097 | |
duke@435 | 1098 | BASE(StateSplit, Instruction) |
duke@435 | 1099 | private: |
duke@435 | 1100 | ValueStack* _state; |
duke@435 | 1101 | |
duke@435 | 1102 | protected: |
duke@435 | 1103 | static void substitute(BlockList& list, BlockBegin* old_block, BlockBegin* new_block); |
duke@435 | 1104 | |
duke@435 | 1105 | public: |
duke@435 | 1106 | // creation |
roland@2174 | 1107 | StateSplit(ValueType* type, ValueStack* state_before = NULL) |
roland@2174 | 1108 | : Instruction(type, state_before) |
roland@2174 | 1109 | , _state(NULL) |
roland@2174 | 1110 | { |
duke@435 | 1111 | pin(PinStateSplitConstructor); |
duke@435 | 1112 | } |
duke@435 | 1113 | |
duke@435 | 1114 | // accessors |
duke@435 | 1115 | ValueStack* state() const { return _state; } |
duke@435 | 1116 | IRScope* scope() const; // the state's scope |
duke@435 | 1117 | |
duke@435 | 1118 | // manipulation |
roland@2174 | 1119 | void set_state(ValueStack* state) { assert(_state == NULL, "overwriting existing state"); check_state(state); _state = state; } |
duke@435 | 1120 | |
duke@435 | 1121 | // generic |
iveresov@1939 | 1122 | virtual void input_values_do(ValueVisitor* f) { /* no values */ } |
iveresov@1939 | 1123 | virtual void state_values_do(ValueVisitor* f); |
duke@435 | 1124 | }; |
duke@435 | 1125 | |
duke@435 | 1126 | |
duke@435 | 1127 | LEAF(Invoke, StateSplit) |
duke@435 | 1128 | private: |
twisti@1730 | 1129 | Bytecodes::Code _code; |
twisti@1730 | 1130 | Value _recv; |
twisti@1730 | 1131 | Values* _args; |
twisti@1730 | 1132 | BasicTypeList* _signature; |
twisti@1730 | 1133 | int _vtable_index; |
twisti@1730 | 1134 | ciMethod* _target; |
duke@435 | 1135 | |
duke@435 | 1136 | public: |
duke@435 | 1137 | // creation |
duke@435 | 1138 | Invoke(Bytecodes::Code code, ValueType* result_type, Value recv, Values* args, |
twisti@1730 | 1139 | int vtable_index, ciMethod* target, ValueStack* state_before); |
duke@435 | 1140 | |
duke@435 | 1141 | // accessors |
duke@435 | 1142 | Bytecodes::Code code() const { return _code; } |
duke@435 | 1143 | Value receiver() const { return _recv; } |
duke@435 | 1144 | bool has_receiver() const { return receiver() != NULL; } |
duke@435 | 1145 | int number_of_arguments() const { return _args->length(); } |
duke@435 | 1146 | Value argument_at(int i) const { return _args->at(i); } |
duke@435 | 1147 | int vtable_index() const { return _vtable_index; } |
duke@435 | 1148 | BasicTypeList* signature() const { return _signature; } |
duke@435 | 1149 | ciMethod* target() const { return _target; } |
duke@435 | 1150 | |
duke@435 | 1151 | // Returns false if target is not loaded |
duke@435 | 1152 | bool target_is_final() const { return check_flag(TargetIsFinalFlag); } |
duke@435 | 1153 | bool target_is_loaded() const { return check_flag(TargetIsLoadedFlag); } |
duke@435 | 1154 | // Returns false if target is not loaded |
duke@435 | 1155 | bool target_is_strictfp() const { return check_flag(TargetIsStrictfpFlag); } |
duke@435 | 1156 | |
twisti@1730 | 1157 | // JSR 292 support |
twisti@1730 | 1158 | bool is_invokedynamic() const { return code() == Bytecodes::_invokedynamic; } |
twisti@1730 | 1159 | |
roland@2174 | 1160 | virtual bool needs_exception_state() const { return false; } |
roland@2174 | 1161 | |
duke@435 | 1162 | // generic |
duke@435 | 1163 | virtual bool can_trap() const { return true; } |
iveresov@1939 | 1164 | virtual void input_values_do(ValueVisitor* f) { |
duke@435 | 1165 | StateSplit::input_values_do(f); |
iveresov@1939 | 1166 | if (has_receiver()) f->visit(&_recv); |
iveresov@1939 | 1167 | for (int i = 0; i < _args->length(); i++) f->visit(_args->adr_at(i)); |
duke@435 | 1168 | } |
iveresov@1939 | 1169 | virtual void state_values_do(ValueVisitor *f); |
duke@435 | 1170 | }; |
duke@435 | 1171 | |
duke@435 | 1172 | |
duke@435 | 1173 | LEAF(NewInstance, StateSplit) |
duke@435 | 1174 | private: |
duke@435 | 1175 | ciInstanceKlass* _klass; |
duke@435 | 1176 | |
duke@435 | 1177 | public: |
duke@435 | 1178 | // creation |
roland@2174 | 1179 | NewInstance(ciInstanceKlass* klass, ValueStack* state_before) |
roland@2174 | 1180 | : StateSplit(instanceType, state_before) |
roland@2174 | 1181 | , _klass(klass) |
roland@2174 | 1182 | {} |
duke@435 | 1183 | |
duke@435 | 1184 | // accessors |
duke@435 | 1185 | ciInstanceKlass* klass() const { return _klass; } |
duke@435 | 1186 | |
roland@2174 | 1187 | virtual bool needs_exception_state() const { return false; } |
roland@2174 | 1188 | |
duke@435 | 1189 | // generic |
duke@435 | 1190 | virtual bool can_trap() const { return true; } |
duke@435 | 1191 | ciType* exact_type() const; |
duke@435 | 1192 | }; |
duke@435 | 1193 | |
duke@435 | 1194 | |
duke@435 | 1195 | BASE(NewArray, StateSplit) |
duke@435 | 1196 | private: |
duke@435 | 1197 | Value _length; |
duke@435 | 1198 | |
duke@435 | 1199 | public: |
duke@435 | 1200 | // creation |
roland@2174 | 1201 | NewArray(Value length, ValueStack* state_before) |
roland@2174 | 1202 | : StateSplit(objectType, state_before) |
roland@2174 | 1203 | , _length(length) |
roland@2174 | 1204 | { |
duke@435 | 1205 | // Do not ASSERT_VALUES since length is NULL for NewMultiArray |
duke@435 | 1206 | } |
duke@435 | 1207 | |
duke@435 | 1208 | // accessors |
duke@435 | 1209 | Value length() const { return _length; } |
duke@435 | 1210 | |
roland@2174 | 1211 | virtual bool needs_exception_state() const { return false; } |
roland@2174 | 1212 | |
duke@435 | 1213 | // generic |
duke@435 | 1214 | virtual bool can_trap() const { return true; } |
iveresov@1939 | 1215 | virtual void input_values_do(ValueVisitor* f) { StateSplit::input_values_do(f); f->visit(&_length); } |
duke@435 | 1216 | }; |
duke@435 | 1217 | |
duke@435 | 1218 | |
duke@435 | 1219 | LEAF(NewTypeArray, NewArray) |
duke@435 | 1220 | private: |
duke@435 | 1221 | BasicType _elt_type; |
duke@435 | 1222 | |
duke@435 | 1223 | public: |
duke@435 | 1224 | // creation |
roland@2174 | 1225 | NewTypeArray(Value length, BasicType elt_type, ValueStack* state_before) |
roland@2174 | 1226 | : NewArray(length, state_before) |
roland@2174 | 1227 | , _elt_type(elt_type) |
roland@2174 | 1228 | {} |
duke@435 | 1229 | |
duke@435 | 1230 | // accessors |
duke@435 | 1231 | BasicType elt_type() const { return _elt_type; } |
duke@435 | 1232 | ciType* exact_type() const; |
duke@435 | 1233 | }; |
duke@435 | 1234 | |
duke@435 | 1235 | |
duke@435 | 1236 | LEAF(NewObjectArray, NewArray) |
duke@435 | 1237 | private: |
duke@435 | 1238 | ciKlass* _klass; |
duke@435 | 1239 | |
duke@435 | 1240 | public: |
duke@435 | 1241 | // creation |
duke@435 | 1242 | NewObjectArray(ciKlass* klass, Value length, ValueStack* state_before) : NewArray(length, state_before), _klass(klass) {} |
duke@435 | 1243 | |
duke@435 | 1244 | // accessors |
duke@435 | 1245 | ciKlass* klass() const { return _klass; } |
duke@435 | 1246 | ciType* exact_type() const; |
duke@435 | 1247 | }; |
duke@435 | 1248 | |
duke@435 | 1249 | |
duke@435 | 1250 | LEAF(NewMultiArray, NewArray) |
duke@435 | 1251 | private: |
duke@435 | 1252 | ciKlass* _klass; |
duke@435 | 1253 | Values* _dims; |
duke@435 | 1254 | |
duke@435 | 1255 | public: |
duke@435 | 1256 | // creation |
duke@435 | 1257 | NewMultiArray(ciKlass* klass, Values* dims, ValueStack* state_before) : NewArray(NULL, state_before), _klass(klass), _dims(dims) { |
duke@435 | 1258 | ASSERT_VALUES |
duke@435 | 1259 | } |
duke@435 | 1260 | |
duke@435 | 1261 | // accessors |
duke@435 | 1262 | ciKlass* klass() const { return _klass; } |
duke@435 | 1263 | Values* dims() const { return _dims; } |
duke@435 | 1264 | int rank() const { return dims()->length(); } |
duke@435 | 1265 | |
duke@435 | 1266 | // generic |
iveresov@1939 | 1267 | virtual void input_values_do(ValueVisitor* f) { |
duke@435 | 1268 | // NOTE: we do not call NewArray::input_values_do since "length" |
duke@435 | 1269 | // is meaningless for a multi-dimensional array; passing the |
duke@435 | 1270 | // zeroth element down to NewArray as its length is a bad idea |
duke@435 | 1271 | // since there will be a copy in the "dims" array which doesn't |
duke@435 | 1272 | // get updated, and the value must not be traversed twice. Was bug |
duke@435 | 1273 | // - kbr 4/10/2001 |
duke@435 | 1274 | StateSplit::input_values_do(f); |
iveresov@1939 | 1275 | for (int i = 0; i < _dims->length(); i++) f->visit(_dims->adr_at(i)); |
duke@435 | 1276 | } |
duke@435 | 1277 | }; |
duke@435 | 1278 | |
duke@435 | 1279 | |
duke@435 | 1280 | BASE(TypeCheck, StateSplit) |
duke@435 | 1281 | private: |
duke@435 | 1282 | ciKlass* _klass; |
duke@435 | 1283 | Value _obj; |
duke@435 | 1284 | |
iveresov@2146 | 1285 | ciMethod* _profiled_method; |
iveresov@2146 | 1286 | int _profiled_bci; |
iveresov@2146 | 1287 | |
duke@435 | 1288 | public: |
duke@435 | 1289 | // creation |
iveresov@2146 | 1290 | TypeCheck(ciKlass* klass, Value obj, ValueType* type, ValueStack* state_before) |
roland@2174 | 1291 | : StateSplit(type, state_before), _klass(klass), _obj(obj), |
iveresov@2146 | 1292 | _profiled_method(NULL), _profiled_bci(0) { |
duke@435 | 1293 | ASSERT_VALUES |
duke@435 | 1294 | set_direct_compare(false); |
duke@435 | 1295 | } |
duke@435 | 1296 | |
duke@435 | 1297 | // accessors |
duke@435 | 1298 | ciKlass* klass() const { return _klass; } |
duke@435 | 1299 | Value obj() const { return _obj; } |
duke@435 | 1300 | bool is_loaded() const { return klass() != NULL; } |
duke@435 | 1301 | bool direct_compare() const { return check_flag(DirectCompareFlag); } |
duke@435 | 1302 | |
duke@435 | 1303 | // manipulation |
duke@435 | 1304 | void set_direct_compare(bool flag) { set_flag(DirectCompareFlag, flag); } |
duke@435 | 1305 | |
duke@435 | 1306 | // generic |
duke@435 | 1307 | virtual bool can_trap() const { return true; } |
iveresov@1939 | 1308 | virtual void input_values_do(ValueVisitor* f) { StateSplit::input_values_do(f); f->visit(&_obj); } |
iveresov@2146 | 1309 | |
iveresov@2146 | 1310 | // Helpers for methodDataOop profiling |
iveresov@2146 | 1311 | void set_should_profile(bool value) { set_flag(ProfileMDOFlag, value); } |
iveresov@2146 | 1312 | void set_profiled_method(ciMethod* method) { _profiled_method = method; } |
iveresov@2146 | 1313 | void set_profiled_bci(int bci) { _profiled_bci = bci; } |
iveresov@2146 | 1314 | bool should_profile() const { return check_flag(ProfileMDOFlag); } |
iveresov@2146 | 1315 | ciMethod* profiled_method() const { return _profiled_method; } |
iveresov@2146 | 1316 | int profiled_bci() const { return _profiled_bci; } |
duke@435 | 1317 | }; |
duke@435 | 1318 | |
duke@435 | 1319 | |
duke@435 | 1320 | LEAF(CheckCast, TypeCheck) |
duke@435 | 1321 | public: |
duke@435 | 1322 | // creation |
duke@435 | 1323 | CheckCast(ciKlass* klass, Value obj, ValueStack* state_before) |
iveresov@2146 | 1324 | : TypeCheck(klass, obj, objectType, state_before) {} |
duke@435 | 1325 | |
duke@435 | 1326 | void set_incompatible_class_change_check() { |
duke@435 | 1327 | set_flag(ThrowIncompatibleClassChangeErrorFlag, true); |
duke@435 | 1328 | } |
duke@435 | 1329 | bool is_incompatible_class_change_check() const { |
duke@435 | 1330 | return check_flag(ThrowIncompatibleClassChangeErrorFlag); |
duke@435 | 1331 | } |
duke@435 | 1332 | |
duke@435 | 1333 | ciType* declared_type() const; |
duke@435 | 1334 | ciType* exact_type() const; |
duke@435 | 1335 | }; |
duke@435 | 1336 | |
duke@435 | 1337 | |
duke@435 | 1338 | LEAF(InstanceOf, TypeCheck) |
duke@435 | 1339 | public: |
duke@435 | 1340 | // creation |
duke@435 | 1341 | InstanceOf(ciKlass* klass, Value obj, ValueStack* state_before) : TypeCheck(klass, obj, intType, state_before) {} |
roland@2174 | 1342 | |
roland@2174 | 1343 | virtual bool needs_exception_state() const { return false; } |
duke@435 | 1344 | }; |
duke@435 | 1345 | |
duke@435 | 1346 | |
duke@435 | 1347 | BASE(AccessMonitor, StateSplit) |
duke@435 | 1348 | private: |
duke@435 | 1349 | Value _obj; |
duke@435 | 1350 | int _monitor_no; |
duke@435 | 1351 | |
duke@435 | 1352 | public: |
duke@435 | 1353 | // creation |
roland@2174 | 1354 | AccessMonitor(Value obj, int monitor_no, ValueStack* state_before = NULL) |
roland@2174 | 1355 | : StateSplit(illegalType, state_before) |
duke@435 | 1356 | , _obj(obj) |
duke@435 | 1357 | , _monitor_no(monitor_no) |
duke@435 | 1358 | { |
duke@435 | 1359 | set_needs_null_check(true); |
duke@435 | 1360 | ASSERT_VALUES |
duke@435 | 1361 | } |
duke@435 | 1362 | |
duke@435 | 1363 | // accessors |
duke@435 | 1364 | Value obj() const { return _obj; } |
duke@435 | 1365 | int monitor_no() const { return _monitor_no; } |
duke@435 | 1366 | |
duke@435 | 1367 | // generic |
iveresov@1939 | 1368 | virtual void input_values_do(ValueVisitor* f) { StateSplit::input_values_do(f); f->visit(&_obj); } |
duke@435 | 1369 | }; |
duke@435 | 1370 | |
duke@435 | 1371 | |
duke@435 | 1372 | LEAF(MonitorEnter, AccessMonitor) |
duke@435 | 1373 | public: |
duke@435 | 1374 | // creation |
roland@2174 | 1375 | MonitorEnter(Value obj, int monitor_no, ValueStack* state_before) |
roland@2174 | 1376 | : AccessMonitor(obj, monitor_no, state_before) |
duke@435 | 1377 | { |
duke@435 | 1378 | ASSERT_VALUES |
duke@435 | 1379 | } |
duke@435 | 1380 | |
duke@435 | 1381 | // generic |
duke@435 | 1382 | virtual bool can_trap() const { return true; } |
duke@435 | 1383 | }; |
duke@435 | 1384 | |
duke@435 | 1385 | |
duke@435 | 1386 | LEAF(MonitorExit, AccessMonitor) |
duke@435 | 1387 | public: |
duke@435 | 1388 | // creation |
roland@2174 | 1389 | MonitorExit(Value obj, int monitor_no) |
roland@2174 | 1390 | : AccessMonitor(obj, monitor_no, NULL) |
roland@2174 | 1391 | { |
roland@2174 | 1392 | ASSERT_VALUES |
roland@2174 | 1393 | } |
duke@435 | 1394 | }; |
duke@435 | 1395 | |
duke@435 | 1396 | |
duke@435 | 1397 | LEAF(Intrinsic, StateSplit) |
duke@435 | 1398 | private: |
duke@435 | 1399 | vmIntrinsics::ID _id; |
duke@435 | 1400 | Values* _args; |
duke@435 | 1401 | Value _recv; |
duke@435 | 1402 | |
duke@435 | 1403 | public: |
duke@435 | 1404 | // preserves_state can be set to true for Intrinsics |
duke@435 | 1405 | // which are guaranteed to preserve register state across any slow |
duke@435 | 1406 | // cases; setting it to true does not mean that the Intrinsic can |
duke@435 | 1407 | // not trap, only that if we continue execution in the same basic |
duke@435 | 1408 | // block after the Intrinsic, all of the registers are intact. This |
duke@435 | 1409 | // allows load elimination and common expression elimination to be |
duke@435 | 1410 | // performed across the Intrinsic. The default value is false. |
duke@435 | 1411 | Intrinsic(ValueType* type, |
duke@435 | 1412 | vmIntrinsics::ID id, |
duke@435 | 1413 | Values* args, |
duke@435 | 1414 | bool has_receiver, |
roland@2174 | 1415 | ValueStack* state_before, |
duke@435 | 1416 | bool preserves_state, |
duke@435 | 1417 | bool cantrap = true) |
roland@2174 | 1418 | : StateSplit(type, state_before) |
duke@435 | 1419 | , _id(id) |
duke@435 | 1420 | , _args(args) |
duke@435 | 1421 | , _recv(NULL) |
duke@435 | 1422 | { |
duke@435 | 1423 | assert(args != NULL, "args must exist"); |
duke@435 | 1424 | ASSERT_VALUES |
duke@435 | 1425 | set_flag(PreservesStateFlag, preserves_state); |
duke@435 | 1426 | set_flag(CanTrapFlag, cantrap); |
duke@435 | 1427 | if (has_receiver) { |
duke@435 | 1428 | _recv = argument_at(0); |
duke@435 | 1429 | } |
duke@435 | 1430 | set_needs_null_check(has_receiver); |
duke@435 | 1431 | |
duke@435 | 1432 | // some intrinsics can't trap, so don't force them to be pinned |
duke@435 | 1433 | if (!can_trap()) { |
duke@435 | 1434 | unpin(PinStateSplitConstructor); |
duke@435 | 1435 | } |
duke@435 | 1436 | } |
duke@435 | 1437 | |
duke@435 | 1438 | // accessors |
duke@435 | 1439 | vmIntrinsics::ID id() const { return _id; } |
duke@435 | 1440 | int number_of_arguments() const { return _args->length(); } |
duke@435 | 1441 | Value argument_at(int i) const { return _args->at(i); } |
duke@435 | 1442 | |
duke@435 | 1443 | bool has_receiver() const { return (_recv != NULL); } |
duke@435 | 1444 | Value receiver() const { assert(has_receiver(), "must have receiver"); return _recv; } |
duke@435 | 1445 | bool preserves_state() const { return check_flag(PreservesStateFlag); } |
duke@435 | 1446 | |
duke@435 | 1447 | // generic |
duke@435 | 1448 | virtual bool can_trap() const { return check_flag(CanTrapFlag); } |
iveresov@1939 | 1449 | virtual void input_values_do(ValueVisitor* f) { |
duke@435 | 1450 | StateSplit::input_values_do(f); |
iveresov@1939 | 1451 | for (int i = 0; i < _args->length(); i++) f->visit(_args->adr_at(i)); |
duke@435 | 1452 | } |
duke@435 | 1453 | }; |
duke@435 | 1454 | |
duke@435 | 1455 | |
duke@435 | 1456 | class LIR_List; |
duke@435 | 1457 | |
duke@435 | 1458 | LEAF(BlockBegin, StateSplit) |
duke@435 | 1459 | private: |
duke@435 | 1460 | int _block_id; // the unique block id |
roland@2174 | 1461 | int _bci; // start-bci of block |
duke@435 | 1462 | int _depth_first_number; // number of this block in a depth-first ordering |
duke@435 | 1463 | int _linear_scan_number; // number of this block in linear-scan ordering |
duke@435 | 1464 | int _loop_depth; // the loop nesting level of this block |
duke@435 | 1465 | int _loop_index; // number of the innermost loop of this block |
duke@435 | 1466 | int _flags; // the flags associated with this block |
duke@435 | 1467 | |
duke@435 | 1468 | // fields used by BlockListBuilder |
duke@435 | 1469 | int _total_preds; // number of predecessors found by BlockListBuilder |
duke@435 | 1470 | BitMap _stores_to_locals; // bit is set when a local variable is stored in the block |
duke@435 | 1471 | |
duke@435 | 1472 | // SSA specific fields: (factor out later) |
duke@435 | 1473 | BlockList _successors; // the successors of this block |
duke@435 | 1474 | BlockList _predecessors; // the predecessors of this block |
duke@435 | 1475 | BlockBegin* _dominator; // the dominator of this block |
duke@435 | 1476 | // SSA specific ends |
duke@435 | 1477 | BlockEnd* _end; // the last instruction of this block |
duke@435 | 1478 | BlockList _exception_handlers; // the exception handlers potentially invoked by this block |
duke@435 | 1479 | ValueStackStack* _exception_states; // only for xhandler entries: states of all instructions that have an edge to this xhandler |
duke@435 | 1480 | int _exception_handler_pco; // if this block is the start of an exception handler, |
duke@435 | 1481 | // this records the PC offset in the assembly code of the |
duke@435 | 1482 | // first instruction in this block |
duke@435 | 1483 | Label _label; // the label associated with this block |
duke@435 | 1484 | LIR_List* _lir; // the low level intermediate representation for this block |
duke@435 | 1485 | |
duke@435 | 1486 | BitMap _live_in; // set of live LIR_Opr registers at entry to this block |
duke@435 | 1487 | BitMap _live_out; // set of live LIR_Opr registers at exit from this block |
duke@435 | 1488 | BitMap _live_gen; // set of registers used before any redefinition in this block |
duke@435 | 1489 | BitMap _live_kill; // set of registers defined in this block |
duke@435 | 1490 | |
duke@435 | 1491 | BitMap _fpu_register_usage; |
duke@435 | 1492 | intArray* _fpu_stack_state; // For x86 FPU code generation with UseLinearScan |
duke@435 | 1493 | int _first_lir_instruction_id; // ID of first LIR instruction in this block |
duke@435 | 1494 | int _last_lir_instruction_id; // ID of last LIR instruction in this block |
duke@435 | 1495 | |
duke@435 | 1496 | void iterate_preorder (boolArray& mark, BlockClosure* closure); |
duke@435 | 1497 | void iterate_postorder(boolArray& mark, BlockClosure* closure); |
duke@435 | 1498 | |
duke@435 | 1499 | friend class SuxAndWeightAdjuster; |
duke@435 | 1500 | |
duke@435 | 1501 | public: |
iveresov@1939 | 1502 | void* operator new(size_t size) { |
iveresov@1939 | 1503 | Compilation* c = Compilation::current(); |
iveresov@1939 | 1504 | void* res = c->arena()->Amalloc(size); |
iveresov@1939 | 1505 | ((BlockBegin*)res)->_id = c->get_next_id(); |
iveresov@1939 | 1506 | ((BlockBegin*)res)->_block_id = c->get_next_block_id(); |
iveresov@1939 | 1507 | return res; |
iveresov@1939 | 1508 | } |
iveresov@1939 | 1509 | |
duke@435 | 1510 | // initialization/counting |
iveresov@1939 | 1511 | static int number_of_blocks() { |
iveresov@1939 | 1512 | return Compilation::current()->number_of_blocks(); |
iveresov@1939 | 1513 | } |
duke@435 | 1514 | |
duke@435 | 1515 | // creation |
duke@435 | 1516 | BlockBegin(int bci) |
duke@435 | 1517 | : StateSplit(illegalType) |
roland@2174 | 1518 | , _bci(bci) |
duke@435 | 1519 | , _depth_first_number(-1) |
duke@435 | 1520 | , _linear_scan_number(-1) |
duke@435 | 1521 | , _loop_depth(0) |
duke@435 | 1522 | , _flags(0) |
duke@435 | 1523 | , _dominator(NULL) |
duke@435 | 1524 | , _end(NULL) |
duke@435 | 1525 | , _predecessors(2) |
duke@435 | 1526 | , _successors(2) |
duke@435 | 1527 | , _exception_handlers(1) |
duke@435 | 1528 | , _exception_states(NULL) |
duke@435 | 1529 | , _exception_handler_pco(-1) |
duke@435 | 1530 | , _lir(NULL) |
duke@435 | 1531 | , _loop_index(-1) |
duke@435 | 1532 | , _live_in() |
duke@435 | 1533 | , _live_out() |
duke@435 | 1534 | , _live_gen() |
duke@435 | 1535 | , _live_kill() |
duke@435 | 1536 | , _fpu_register_usage() |
duke@435 | 1537 | , _fpu_stack_state(NULL) |
duke@435 | 1538 | , _first_lir_instruction_id(-1) |
duke@435 | 1539 | , _last_lir_instruction_id(-1) |
duke@435 | 1540 | , _total_preds(0) |
duke@435 | 1541 | , _stores_to_locals() |
duke@435 | 1542 | { |
roland@2174 | 1543 | #ifndef PRODUCT |
roland@2174 | 1544 | set_printable_bci(bci); |
roland@2174 | 1545 | #endif |
duke@435 | 1546 | } |
duke@435 | 1547 | |
duke@435 | 1548 | // accessors |
duke@435 | 1549 | int block_id() const { return _block_id; } |
roland@2174 | 1550 | int bci() const { return _bci; } |
duke@435 | 1551 | BlockList* successors() { return &_successors; } |
duke@435 | 1552 | BlockBegin* dominator() const { return _dominator; } |
duke@435 | 1553 | int loop_depth() const { return _loop_depth; } |
duke@435 | 1554 | int depth_first_number() const { return _depth_first_number; } |
duke@435 | 1555 | int linear_scan_number() const { return _linear_scan_number; } |
duke@435 | 1556 | BlockEnd* end() const { return _end; } |
duke@435 | 1557 | Label* label() { return &_label; } |
duke@435 | 1558 | LIR_List* lir() const { return _lir; } |
duke@435 | 1559 | int exception_handler_pco() const { return _exception_handler_pco; } |
duke@435 | 1560 | BitMap& live_in() { return _live_in; } |
duke@435 | 1561 | BitMap& live_out() { return _live_out; } |
duke@435 | 1562 | BitMap& live_gen() { return _live_gen; } |
duke@435 | 1563 | BitMap& live_kill() { return _live_kill; } |
duke@435 | 1564 | BitMap& fpu_register_usage() { return _fpu_register_usage; } |
duke@435 | 1565 | intArray* fpu_stack_state() const { return _fpu_stack_state; } |
duke@435 | 1566 | int first_lir_instruction_id() const { return _first_lir_instruction_id; } |
duke@435 | 1567 | int last_lir_instruction_id() const { return _last_lir_instruction_id; } |
duke@435 | 1568 | int total_preds() const { return _total_preds; } |
duke@435 | 1569 | BitMap& stores_to_locals() { return _stores_to_locals; } |
duke@435 | 1570 | |
duke@435 | 1571 | // manipulation |
duke@435 | 1572 | void set_dominator(BlockBegin* dom) { _dominator = dom; } |
duke@435 | 1573 | void set_loop_depth(int d) { _loop_depth = d; } |
duke@435 | 1574 | void set_depth_first_number(int dfn) { _depth_first_number = dfn; } |
duke@435 | 1575 | void set_linear_scan_number(int lsn) { _linear_scan_number = lsn; } |
duke@435 | 1576 | void set_end(BlockEnd* end); |
duke@435 | 1577 | void disconnect_from_graph(); |
duke@435 | 1578 | static void disconnect_edge(BlockBegin* from, BlockBegin* to); |
duke@435 | 1579 | BlockBegin* insert_block_between(BlockBegin* sux); |
duke@435 | 1580 | void substitute_sux(BlockBegin* old_sux, BlockBegin* new_sux); |
duke@435 | 1581 | void set_lir(LIR_List* lir) { _lir = lir; } |
duke@435 | 1582 | void set_exception_handler_pco(int pco) { _exception_handler_pco = pco; } |
duke@435 | 1583 | void set_live_in (BitMap map) { _live_in = map; } |
duke@435 | 1584 | void set_live_out (BitMap map) { _live_out = map; } |
duke@435 | 1585 | void set_live_gen (BitMap map) { _live_gen = map; } |
duke@435 | 1586 | void set_live_kill (BitMap map) { _live_kill = map; } |
duke@435 | 1587 | void set_fpu_register_usage(BitMap map) { _fpu_register_usage = map; } |
duke@435 | 1588 | void set_fpu_stack_state(intArray* state) { _fpu_stack_state = state; } |
duke@435 | 1589 | void set_first_lir_instruction_id(int id) { _first_lir_instruction_id = id; } |
duke@435 | 1590 | void set_last_lir_instruction_id(int id) { _last_lir_instruction_id = id; } |
duke@435 | 1591 | void increment_total_preds(int n = 1) { _total_preds += n; } |
duke@435 | 1592 | void init_stores_to_locals(int locals_count) { _stores_to_locals = BitMap(locals_count); _stores_to_locals.clear(); } |
duke@435 | 1593 | |
duke@435 | 1594 | // generic |
iveresov@1939 | 1595 | virtual void state_values_do(ValueVisitor* f); |
duke@435 | 1596 | |
duke@435 | 1597 | // successors and predecessors |
duke@435 | 1598 | int number_of_sux() const; |
duke@435 | 1599 | BlockBegin* sux_at(int i) const; |
duke@435 | 1600 | void add_successor(BlockBegin* sux); |
duke@435 | 1601 | void remove_successor(BlockBegin* pred); |
duke@435 | 1602 | bool is_successor(BlockBegin* sux) const { return _successors.contains(sux); } |
duke@435 | 1603 | |
duke@435 | 1604 | void add_predecessor(BlockBegin* pred); |
duke@435 | 1605 | void remove_predecessor(BlockBegin* pred); |
duke@435 | 1606 | bool is_predecessor(BlockBegin* pred) const { return _predecessors.contains(pred); } |
duke@435 | 1607 | int number_of_preds() const { return _predecessors.length(); } |
duke@435 | 1608 | BlockBegin* pred_at(int i) const { return _predecessors[i]; } |
duke@435 | 1609 | |
duke@435 | 1610 | // exception handlers potentially invoked by this block |
duke@435 | 1611 | void add_exception_handler(BlockBegin* b); |
duke@435 | 1612 | bool is_exception_handler(BlockBegin* b) const { return _exception_handlers.contains(b); } |
duke@435 | 1613 | int number_of_exception_handlers() const { return _exception_handlers.length(); } |
duke@435 | 1614 | BlockBegin* exception_handler_at(int i) const { return _exception_handlers.at(i); } |
duke@435 | 1615 | |
duke@435 | 1616 | // states of the instructions that have an edge to this exception handler |
duke@435 | 1617 | int number_of_exception_states() { assert(is_set(exception_entry_flag), "only for xhandlers"); return _exception_states == NULL ? 0 : _exception_states->length(); } |
duke@435 | 1618 | ValueStack* exception_state_at(int idx) const { assert(is_set(exception_entry_flag), "only for xhandlers"); return _exception_states->at(idx); } |
duke@435 | 1619 | int add_exception_state(ValueStack* state); |
duke@435 | 1620 | |
duke@435 | 1621 | // flags |
duke@435 | 1622 | enum Flag { |
duke@435 | 1623 | no_flag = 0, |
duke@435 | 1624 | std_entry_flag = 1 << 0, |
duke@435 | 1625 | osr_entry_flag = 1 << 1, |
duke@435 | 1626 | exception_entry_flag = 1 << 2, |
duke@435 | 1627 | subroutine_entry_flag = 1 << 3, |
duke@435 | 1628 | backward_branch_target_flag = 1 << 4, |
duke@435 | 1629 | is_on_work_list_flag = 1 << 5, |
duke@435 | 1630 | was_visited_flag = 1 << 6, |
never@1813 | 1631 | parser_loop_header_flag = 1 << 7, // set by parser to identify blocks where phi functions can not be created on demand |
never@1813 | 1632 | critical_edge_split_flag = 1 << 8, // set for all blocks that are introduced when critical edges are split |
never@1813 | 1633 | linear_scan_loop_header_flag = 1 << 9, // set during loop-detection for LinearScan |
never@1813 | 1634 | linear_scan_loop_end_flag = 1 << 10 // set during loop-detection for LinearScan |
duke@435 | 1635 | }; |
duke@435 | 1636 | |
duke@435 | 1637 | void set(Flag f) { _flags |= f; } |
duke@435 | 1638 | void clear(Flag f) { _flags &= ~f; } |
duke@435 | 1639 | bool is_set(Flag f) const { return (_flags & f) != 0; } |
duke@435 | 1640 | bool is_entry_block() const { |
duke@435 | 1641 | const int entry_mask = std_entry_flag | osr_entry_flag | exception_entry_flag; |
duke@435 | 1642 | return (_flags & entry_mask) != 0; |
duke@435 | 1643 | } |
duke@435 | 1644 | |
duke@435 | 1645 | // iteration |
duke@435 | 1646 | void iterate_preorder (BlockClosure* closure); |
duke@435 | 1647 | void iterate_postorder (BlockClosure* closure); |
duke@435 | 1648 | |
iveresov@1939 | 1649 | void block_values_do(ValueVisitor* f); |
duke@435 | 1650 | |
duke@435 | 1651 | // loops |
duke@435 | 1652 | void set_loop_index(int ix) { _loop_index = ix; } |
duke@435 | 1653 | int loop_index() const { return _loop_index; } |
duke@435 | 1654 | |
duke@435 | 1655 | // merging |
duke@435 | 1656 | bool try_merge(ValueStack* state); // try to merge states at block begin |
duke@435 | 1657 | void merge(ValueStack* state) { bool b = try_merge(state); assert(b, "merge failed"); } |
duke@435 | 1658 | |
duke@435 | 1659 | // debugging |
duke@435 | 1660 | void print_block() PRODUCT_RETURN; |
duke@435 | 1661 | void print_block(InstructionPrinter& ip, bool live_only = false) PRODUCT_RETURN; |
duke@435 | 1662 | }; |
duke@435 | 1663 | |
duke@435 | 1664 | |
duke@435 | 1665 | BASE(BlockEnd, StateSplit) |
duke@435 | 1666 | private: |
duke@435 | 1667 | BlockBegin* _begin; |
duke@435 | 1668 | BlockList* _sux; |
duke@435 | 1669 | |
duke@435 | 1670 | protected: |
duke@435 | 1671 | BlockList* sux() const { return _sux; } |
duke@435 | 1672 | |
duke@435 | 1673 | void set_sux(BlockList* sux) { |
duke@435 | 1674 | #ifdef ASSERT |
duke@435 | 1675 | assert(sux != NULL, "sux must exist"); |
duke@435 | 1676 | for (int i = sux->length() - 1; i >= 0; i--) assert(sux->at(i) != NULL, "sux must exist"); |
duke@435 | 1677 | #endif |
duke@435 | 1678 | _sux = sux; |
duke@435 | 1679 | } |
duke@435 | 1680 | |
duke@435 | 1681 | public: |
duke@435 | 1682 | // creation |
duke@435 | 1683 | BlockEnd(ValueType* type, ValueStack* state_before, bool is_safepoint) |
roland@2174 | 1684 | : StateSplit(type, state_before) |
duke@435 | 1685 | , _begin(NULL) |
duke@435 | 1686 | , _sux(NULL) |
roland@2174 | 1687 | { |
duke@435 | 1688 | set_flag(IsSafepointFlag, is_safepoint); |
duke@435 | 1689 | } |
duke@435 | 1690 | |
duke@435 | 1691 | // accessors |
duke@435 | 1692 | bool is_safepoint() const { return check_flag(IsSafepointFlag); } |
duke@435 | 1693 | BlockBegin* begin() const { return _begin; } |
duke@435 | 1694 | |
duke@435 | 1695 | // manipulation |
duke@435 | 1696 | void set_begin(BlockBegin* begin); |
duke@435 | 1697 | |
duke@435 | 1698 | // successors |
duke@435 | 1699 | int number_of_sux() const { return _sux != NULL ? _sux->length() : 0; } |
duke@435 | 1700 | BlockBegin* sux_at(int i) const { return _sux->at(i); } |
duke@435 | 1701 | BlockBegin* default_sux() const { return sux_at(number_of_sux() - 1); } |
duke@435 | 1702 | BlockBegin** addr_sux_at(int i) const { return _sux->adr_at(i); } |
duke@435 | 1703 | int sux_index(BlockBegin* sux) const { return _sux->find(sux); } |
duke@435 | 1704 | void substitute_sux(BlockBegin* old_sux, BlockBegin* new_sux); |
duke@435 | 1705 | }; |
duke@435 | 1706 | |
duke@435 | 1707 | |
duke@435 | 1708 | LEAF(Goto, BlockEnd) |
duke@435 | 1709 | public: |
iveresov@2138 | 1710 | enum Direction { |
iveresov@2138 | 1711 | none, // Just a regular goto |
iveresov@2138 | 1712 | taken, not_taken // Goto produced from If |
iveresov@2138 | 1713 | }; |
iveresov@2138 | 1714 | private: |
iveresov@2138 | 1715 | ciMethod* _profiled_method; |
iveresov@2138 | 1716 | int _profiled_bci; |
iveresov@2138 | 1717 | Direction _direction; |
iveresov@2138 | 1718 | public: |
duke@435 | 1719 | // creation |
iveresov@2138 | 1720 | Goto(BlockBegin* sux, ValueStack* state_before, bool is_safepoint = false) |
iveresov@2138 | 1721 | : BlockEnd(illegalType, state_before, is_safepoint) |
iveresov@2138 | 1722 | , _direction(none) |
iveresov@2138 | 1723 | , _profiled_method(NULL) |
iveresov@2138 | 1724 | , _profiled_bci(0) { |
duke@435 | 1725 | BlockList* s = new BlockList(1); |
duke@435 | 1726 | s->append(sux); |
duke@435 | 1727 | set_sux(s); |
duke@435 | 1728 | } |
duke@435 | 1729 | |
iveresov@2138 | 1730 | Goto(BlockBegin* sux, bool is_safepoint) : BlockEnd(illegalType, NULL, is_safepoint) |
iveresov@2138 | 1731 | , _direction(none) |
iveresov@2138 | 1732 | , _profiled_method(NULL) |
iveresov@2138 | 1733 | , _profiled_bci(0) { |
duke@435 | 1734 | BlockList* s = new BlockList(1); |
duke@435 | 1735 | s->append(sux); |
duke@435 | 1736 | set_sux(s); |
duke@435 | 1737 | } |
duke@435 | 1738 | |
iveresov@2138 | 1739 | bool should_profile() const { return check_flag(ProfileMDOFlag); } |
iveresov@2138 | 1740 | ciMethod* profiled_method() const { return _profiled_method; } // set only for profiled branches |
iveresov@2138 | 1741 | int profiled_bci() const { return _profiled_bci; } |
iveresov@2138 | 1742 | Direction direction() const { return _direction; } |
iveresov@2138 | 1743 | |
iveresov@2138 | 1744 | void set_should_profile(bool value) { set_flag(ProfileMDOFlag, value); } |
iveresov@2138 | 1745 | void set_profiled_method(ciMethod* method) { _profiled_method = method; } |
iveresov@2138 | 1746 | void set_profiled_bci(int bci) { _profiled_bci = bci; } |
iveresov@2138 | 1747 | void set_direction(Direction d) { _direction = d; } |
duke@435 | 1748 | }; |
duke@435 | 1749 | |
duke@435 | 1750 | |
duke@435 | 1751 | LEAF(If, BlockEnd) |
duke@435 | 1752 | private: |
duke@435 | 1753 | Value _x; |
duke@435 | 1754 | Condition _cond; |
duke@435 | 1755 | Value _y; |
duke@435 | 1756 | ciMethod* _profiled_method; |
duke@435 | 1757 | int _profiled_bci; // Canonicalizer may alter bci of If node |
iveresov@2138 | 1758 | bool _swapped; // Is the order reversed with respect to the original If in the |
iveresov@2138 | 1759 | // bytecode stream? |
duke@435 | 1760 | public: |
duke@435 | 1761 | // creation |
duke@435 | 1762 | // unordered_is_true is valid for float/double compares only |
duke@435 | 1763 | If(Value x, Condition cond, bool unordered_is_true, Value y, BlockBegin* tsux, BlockBegin* fsux, ValueStack* state_before, bool is_safepoint) |
duke@435 | 1764 | : BlockEnd(illegalType, state_before, is_safepoint) |
duke@435 | 1765 | , _x(x) |
duke@435 | 1766 | , _cond(cond) |
duke@435 | 1767 | , _y(y) |
duke@435 | 1768 | , _profiled_method(NULL) |
duke@435 | 1769 | , _profiled_bci(0) |
iveresov@2138 | 1770 | , _swapped(false) |
duke@435 | 1771 | { |
duke@435 | 1772 | ASSERT_VALUES |
duke@435 | 1773 | set_flag(UnorderedIsTrueFlag, unordered_is_true); |
duke@435 | 1774 | assert(x->type()->tag() == y->type()->tag(), "types must match"); |
duke@435 | 1775 | BlockList* s = new BlockList(2); |
duke@435 | 1776 | s->append(tsux); |
duke@435 | 1777 | s->append(fsux); |
duke@435 | 1778 | set_sux(s); |
duke@435 | 1779 | } |
duke@435 | 1780 | |
duke@435 | 1781 | // accessors |
duke@435 | 1782 | Value x() const { return _x; } |
duke@435 | 1783 | Condition cond() const { return _cond; } |
duke@435 | 1784 | bool unordered_is_true() const { return check_flag(UnorderedIsTrueFlag); } |
duke@435 | 1785 | Value y() const { return _y; } |
duke@435 | 1786 | BlockBegin* sux_for(bool is_true) const { return sux_at(is_true ? 0 : 1); } |
duke@435 | 1787 | BlockBegin* tsux() const { return sux_for(true); } |
duke@435 | 1788 | BlockBegin* fsux() const { return sux_for(false); } |
duke@435 | 1789 | BlockBegin* usux() const { return sux_for(unordered_is_true()); } |
duke@435 | 1790 | bool should_profile() const { return check_flag(ProfileMDOFlag); } |
duke@435 | 1791 | ciMethod* profiled_method() const { return _profiled_method; } // set only for profiled branches |
iveresov@2138 | 1792 | int profiled_bci() const { return _profiled_bci; } // set for profiled branches and tiered |
iveresov@2138 | 1793 | bool is_swapped() const { return _swapped; } |
duke@435 | 1794 | |
duke@435 | 1795 | // manipulation |
duke@435 | 1796 | void swap_operands() { |
duke@435 | 1797 | Value t = _x; _x = _y; _y = t; |
duke@435 | 1798 | _cond = mirror(_cond); |
duke@435 | 1799 | } |
duke@435 | 1800 | |
duke@435 | 1801 | void swap_sux() { |
duke@435 | 1802 | assert(number_of_sux() == 2, "wrong number of successors"); |
duke@435 | 1803 | BlockList* s = sux(); |
duke@435 | 1804 | BlockBegin* t = s->at(0); s->at_put(0, s->at(1)); s->at_put(1, t); |
duke@435 | 1805 | _cond = negate(_cond); |
duke@435 | 1806 | set_flag(UnorderedIsTrueFlag, !check_flag(UnorderedIsTrueFlag)); |
duke@435 | 1807 | } |
duke@435 | 1808 | |
duke@435 | 1809 | void set_should_profile(bool value) { set_flag(ProfileMDOFlag, value); } |
duke@435 | 1810 | void set_profiled_method(ciMethod* method) { _profiled_method = method; } |
duke@435 | 1811 | void set_profiled_bci(int bci) { _profiled_bci = bci; } |
iveresov@2138 | 1812 | void set_swapped(bool value) { _swapped = value; } |
duke@435 | 1813 | // generic |
iveresov@1939 | 1814 | virtual void input_values_do(ValueVisitor* f) { BlockEnd::input_values_do(f); f->visit(&_x); f->visit(&_y); } |
duke@435 | 1815 | }; |
duke@435 | 1816 | |
duke@435 | 1817 | |
duke@435 | 1818 | LEAF(IfInstanceOf, BlockEnd) |
duke@435 | 1819 | private: |
duke@435 | 1820 | ciKlass* _klass; |
duke@435 | 1821 | Value _obj; |
duke@435 | 1822 | bool _test_is_instance; // jump if instance |
duke@435 | 1823 | int _instanceof_bci; |
duke@435 | 1824 | |
duke@435 | 1825 | public: |
duke@435 | 1826 | IfInstanceOf(ciKlass* klass, Value obj, bool test_is_instance, int instanceof_bci, BlockBegin* tsux, BlockBegin* fsux) |
duke@435 | 1827 | : BlockEnd(illegalType, NULL, false) // temporary set to false |
duke@435 | 1828 | , _klass(klass) |
duke@435 | 1829 | , _obj(obj) |
duke@435 | 1830 | , _test_is_instance(test_is_instance) |
duke@435 | 1831 | , _instanceof_bci(instanceof_bci) |
duke@435 | 1832 | { |
duke@435 | 1833 | ASSERT_VALUES |
duke@435 | 1834 | assert(instanceof_bci >= 0, "illegal bci"); |
duke@435 | 1835 | BlockList* s = new BlockList(2); |
duke@435 | 1836 | s->append(tsux); |
duke@435 | 1837 | s->append(fsux); |
duke@435 | 1838 | set_sux(s); |
duke@435 | 1839 | } |
duke@435 | 1840 | |
duke@435 | 1841 | // accessors |
duke@435 | 1842 | // |
duke@435 | 1843 | // Note 1: If test_is_instance() is true, IfInstanceOf tests if obj *is* an |
duke@435 | 1844 | // instance of klass; otherwise it tests if it is *not* and instance |
duke@435 | 1845 | // of klass. |
duke@435 | 1846 | // |
duke@435 | 1847 | // Note 2: IfInstanceOf instructions are created by combining an InstanceOf |
duke@435 | 1848 | // and an If instruction. The IfInstanceOf bci() corresponds to the |
duke@435 | 1849 | // bci that the If would have had; the (this->) instanceof_bci() is |
duke@435 | 1850 | // the bci of the original InstanceOf instruction. |
duke@435 | 1851 | ciKlass* klass() const { return _klass; } |
duke@435 | 1852 | Value obj() const { return _obj; } |
duke@435 | 1853 | int instanceof_bci() const { return _instanceof_bci; } |
duke@435 | 1854 | bool test_is_instance() const { return _test_is_instance; } |
duke@435 | 1855 | BlockBegin* sux_for(bool is_true) const { return sux_at(is_true ? 0 : 1); } |
duke@435 | 1856 | BlockBegin* tsux() const { return sux_for(true); } |
duke@435 | 1857 | BlockBegin* fsux() const { return sux_for(false); } |
duke@435 | 1858 | |
duke@435 | 1859 | // manipulation |
duke@435 | 1860 | void swap_sux() { |
duke@435 | 1861 | assert(number_of_sux() == 2, "wrong number of successors"); |
duke@435 | 1862 | BlockList* s = sux(); |
duke@435 | 1863 | BlockBegin* t = s->at(0); s->at_put(0, s->at(1)); s->at_put(1, t); |
duke@435 | 1864 | _test_is_instance = !_test_is_instance; |
duke@435 | 1865 | } |
duke@435 | 1866 | |
duke@435 | 1867 | // generic |
iveresov@1939 | 1868 | virtual void input_values_do(ValueVisitor* f) { BlockEnd::input_values_do(f); f->visit(&_obj); } |
duke@435 | 1869 | }; |
duke@435 | 1870 | |
duke@435 | 1871 | |
duke@435 | 1872 | BASE(Switch, BlockEnd) |
duke@435 | 1873 | private: |
duke@435 | 1874 | Value _tag; |
duke@435 | 1875 | |
duke@435 | 1876 | public: |
duke@435 | 1877 | // creation |
duke@435 | 1878 | Switch(Value tag, BlockList* sux, ValueStack* state_before, bool is_safepoint) |
duke@435 | 1879 | : BlockEnd(illegalType, state_before, is_safepoint) |
duke@435 | 1880 | , _tag(tag) { |
duke@435 | 1881 | ASSERT_VALUES |
duke@435 | 1882 | set_sux(sux); |
duke@435 | 1883 | } |
duke@435 | 1884 | |
duke@435 | 1885 | // accessors |
duke@435 | 1886 | Value tag() const { return _tag; } |
duke@435 | 1887 | int length() const { return number_of_sux() - 1; } |
duke@435 | 1888 | |
roland@2174 | 1889 | virtual bool needs_exception_state() const { return false; } |
roland@2174 | 1890 | |
duke@435 | 1891 | // generic |
iveresov@1939 | 1892 | virtual void input_values_do(ValueVisitor* f) { BlockEnd::input_values_do(f); f->visit(&_tag); } |
duke@435 | 1893 | }; |
duke@435 | 1894 | |
duke@435 | 1895 | |
duke@435 | 1896 | LEAF(TableSwitch, Switch) |
duke@435 | 1897 | private: |
duke@435 | 1898 | int _lo_key; |
duke@435 | 1899 | |
duke@435 | 1900 | public: |
duke@435 | 1901 | // creation |
duke@435 | 1902 | TableSwitch(Value tag, BlockList* sux, int lo_key, ValueStack* state_before, bool is_safepoint) |
duke@435 | 1903 | : Switch(tag, sux, state_before, is_safepoint) |
duke@435 | 1904 | , _lo_key(lo_key) {} |
duke@435 | 1905 | |
duke@435 | 1906 | // accessors |
duke@435 | 1907 | int lo_key() const { return _lo_key; } |
duke@435 | 1908 | int hi_key() const { return _lo_key + length() - 1; } |
duke@435 | 1909 | }; |
duke@435 | 1910 | |
duke@435 | 1911 | |
duke@435 | 1912 | LEAF(LookupSwitch, Switch) |
duke@435 | 1913 | private: |
duke@435 | 1914 | intArray* _keys; |
duke@435 | 1915 | |
duke@435 | 1916 | public: |
duke@435 | 1917 | // creation |
duke@435 | 1918 | LookupSwitch(Value tag, BlockList* sux, intArray* keys, ValueStack* state_before, bool is_safepoint) |
duke@435 | 1919 | : Switch(tag, sux, state_before, is_safepoint) |
duke@435 | 1920 | , _keys(keys) { |
duke@435 | 1921 | assert(keys != NULL, "keys must exist"); |
duke@435 | 1922 | assert(keys->length() == length(), "sux & keys have incompatible lengths"); |
duke@435 | 1923 | } |
duke@435 | 1924 | |
duke@435 | 1925 | // accessors |
duke@435 | 1926 | int key_at(int i) const { return _keys->at(i); } |
duke@435 | 1927 | }; |
duke@435 | 1928 | |
duke@435 | 1929 | |
duke@435 | 1930 | LEAF(Return, BlockEnd) |
duke@435 | 1931 | private: |
duke@435 | 1932 | Value _result; |
duke@435 | 1933 | |
duke@435 | 1934 | public: |
duke@435 | 1935 | // creation |
duke@435 | 1936 | Return(Value result) : |
duke@435 | 1937 | BlockEnd(result == NULL ? voidType : result->type()->base(), NULL, true), |
duke@435 | 1938 | _result(result) {} |
duke@435 | 1939 | |
duke@435 | 1940 | // accessors |
duke@435 | 1941 | Value result() const { return _result; } |
duke@435 | 1942 | bool has_result() const { return result() != NULL; } |
duke@435 | 1943 | |
duke@435 | 1944 | // generic |
iveresov@1939 | 1945 | virtual void input_values_do(ValueVisitor* f) { |
duke@435 | 1946 | BlockEnd::input_values_do(f); |
iveresov@1939 | 1947 | if (has_result()) f->visit(&_result); |
duke@435 | 1948 | } |
duke@435 | 1949 | }; |
duke@435 | 1950 | |
duke@435 | 1951 | |
duke@435 | 1952 | LEAF(Throw, BlockEnd) |
duke@435 | 1953 | private: |
duke@435 | 1954 | Value _exception; |
duke@435 | 1955 | |
duke@435 | 1956 | public: |
duke@435 | 1957 | // creation |
duke@435 | 1958 | Throw(Value exception, ValueStack* state_before) : BlockEnd(illegalType, state_before, true), _exception(exception) { |
duke@435 | 1959 | ASSERT_VALUES |
duke@435 | 1960 | } |
duke@435 | 1961 | |
duke@435 | 1962 | // accessors |
duke@435 | 1963 | Value exception() const { return _exception; } |
duke@435 | 1964 | |
duke@435 | 1965 | // generic |
duke@435 | 1966 | virtual bool can_trap() const { return true; } |
iveresov@1939 | 1967 | virtual void input_values_do(ValueVisitor* f) { BlockEnd::input_values_do(f); f->visit(&_exception); } |
duke@435 | 1968 | }; |
duke@435 | 1969 | |
duke@435 | 1970 | |
duke@435 | 1971 | LEAF(Base, BlockEnd) |
duke@435 | 1972 | public: |
duke@435 | 1973 | // creation |
duke@435 | 1974 | Base(BlockBegin* std_entry, BlockBegin* osr_entry) : BlockEnd(illegalType, NULL, false) { |
duke@435 | 1975 | assert(std_entry->is_set(BlockBegin::std_entry_flag), "std entry must be flagged"); |
duke@435 | 1976 | assert(osr_entry == NULL || osr_entry->is_set(BlockBegin::osr_entry_flag), "osr entry must be flagged"); |
duke@435 | 1977 | BlockList* s = new BlockList(2); |
duke@435 | 1978 | if (osr_entry != NULL) s->append(osr_entry); |
duke@435 | 1979 | s->append(std_entry); // must be default sux! |
duke@435 | 1980 | set_sux(s); |
duke@435 | 1981 | } |
duke@435 | 1982 | |
duke@435 | 1983 | // accessors |
duke@435 | 1984 | BlockBegin* std_entry() const { return default_sux(); } |
duke@435 | 1985 | BlockBegin* osr_entry() const { return number_of_sux() < 2 ? NULL : sux_at(0); } |
duke@435 | 1986 | }; |
duke@435 | 1987 | |
duke@435 | 1988 | |
duke@435 | 1989 | LEAF(OsrEntry, Instruction) |
duke@435 | 1990 | public: |
duke@435 | 1991 | // creation |
duke@435 | 1992 | #ifdef _LP64 |
roland@2179 | 1993 | OsrEntry() : Instruction(longType) { pin(); } |
duke@435 | 1994 | #else |
roland@2179 | 1995 | OsrEntry() : Instruction(intType) { pin(); } |
duke@435 | 1996 | #endif |
duke@435 | 1997 | |
duke@435 | 1998 | // generic |
iveresov@1939 | 1999 | virtual void input_values_do(ValueVisitor* f) { } |
duke@435 | 2000 | }; |
duke@435 | 2001 | |
duke@435 | 2002 | |
duke@435 | 2003 | // Models the incoming exception at a catch site |
duke@435 | 2004 | LEAF(ExceptionObject, Instruction) |
duke@435 | 2005 | public: |
duke@435 | 2006 | // creation |
roland@2179 | 2007 | ExceptionObject() : Instruction(objectType) { |
duke@435 | 2008 | pin(); |
duke@435 | 2009 | } |
duke@435 | 2010 | |
duke@435 | 2011 | // generic |
iveresov@1939 | 2012 | virtual void input_values_do(ValueVisitor* f) { } |
duke@435 | 2013 | }; |
duke@435 | 2014 | |
duke@435 | 2015 | |
duke@435 | 2016 | // Models needed rounding for floating-point values on Intel. |
duke@435 | 2017 | // Currently only used to represent rounding of double-precision |
duke@435 | 2018 | // values stored into local variables, but could be used to model |
duke@435 | 2019 | // intermediate rounding of single-precision values as well. |
duke@435 | 2020 | LEAF(RoundFP, Instruction) |
duke@435 | 2021 | private: |
duke@435 | 2022 | Value _input; // floating-point value to be rounded |
duke@435 | 2023 | |
duke@435 | 2024 | public: |
duke@435 | 2025 | RoundFP(Value input) |
duke@435 | 2026 | : Instruction(input->type()) // Note: should not be used for constants |
duke@435 | 2027 | , _input(input) |
duke@435 | 2028 | { |
duke@435 | 2029 | ASSERT_VALUES |
duke@435 | 2030 | } |
duke@435 | 2031 | |
duke@435 | 2032 | // accessors |
duke@435 | 2033 | Value input() const { return _input; } |
duke@435 | 2034 | |
duke@435 | 2035 | // generic |
iveresov@1939 | 2036 | virtual void input_values_do(ValueVisitor* f) { f->visit(&_input); } |
duke@435 | 2037 | }; |
duke@435 | 2038 | |
duke@435 | 2039 | |
duke@435 | 2040 | BASE(UnsafeOp, Instruction) |
duke@435 | 2041 | private: |
duke@435 | 2042 | BasicType _basic_type; // ValueType can not express byte-sized integers |
duke@435 | 2043 | |
duke@435 | 2044 | protected: |
duke@435 | 2045 | // creation |
duke@435 | 2046 | UnsafeOp(BasicType basic_type, bool is_put) |
duke@435 | 2047 | : Instruction(is_put ? voidType : as_ValueType(basic_type)) |
duke@435 | 2048 | , _basic_type(basic_type) |
duke@435 | 2049 | { |
duke@435 | 2050 | //Note: Unsafe ops are not not guaranteed to throw NPE. |
duke@435 | 2051 | // Convservatively, Unsafe operations must be pinned though we could be |
duke@435 | 2052 | // looser about this if we wanted to.. |
duke@435 | 2053 | pin(); |
duke@435 | 2054 | } |
duke@435 | 2055 | |
duke@435 | 2056 | public: |
duke@435 | 2057 | // accessors |
duke@435 | 2058 | BasicType basic_type() { return _basic_type; } |
duke@435 | 2059 | |
duke@435 | 2060 | // generic |
iveresov@1939 | 2061 | virtual void input_values_do(ValueVisitor* f) { } |
duke@435 | 2062 | }; |
duke@435 | 2063 | |
duke@435 | 2064 | |
duke@435 | 2065 | BASE(UnsafeRawOp, UnsafeOp) |
duke@435 | 2066 | private: |
duke@435 | 2067 | Value _base; // Base address (a Java long) |
duke@435 | 2068 | Value _index; // Index if computed by optimizer; initialized to NULL |
duke@435 | 2069 | int _log2_scale; // Scale factor: 0, 1, 2, or 3. |
duke@435 | 2070 | // Indicates log2 of number of bytes (1, 2, 4, or 8) |
duke@435 | 2071 | // to scale index by. |
duke@435 | 2072 | |
duke@435 | 2073 | protected: |
duke@435 | 2074 | UnsafeRawOp(BasicType basic_type, Value addr, bool is_put) |
duke@435 | 2075 | : UnsafeOp(basic_type, is_put) |
duke@435 | 2076 | , _base(addr) |
duke@435 | 2077 | , _index(NULL) |
duke@435 | 2078 | , _log2_scale(0) |
duke@435 | 2079 | { |
duke@435 | 2080 | // Can not use ASSERT_VALUES because index may be NULL |
duke@435 | 2081 | assert(addr != NULL && addr->type()->is_long(), "just checking"); |
duke@435 | 2082 | } |
duke@435 | 2083 | |
duke@435 | 2084 | UnsafeRawOp(BasicType basic_type, Value base, Value index, int log2_scale, bool is_put) |
duke@435 | 2085 | : UnsafeOp(basic_type, is_put) |
duke@435 | 2086 | , _base(base) |
duke@435 | 2087 | , _index(index) |
duke@435 | 2088 | , _log2_scale(log2_scale) |
duke@435 | 2089 | { |
duke@435 | 2090 | } |
duke@435 | 2091 | |
duke@435 | 2092 | public: |
duke@435 | 2093 | // accessors |
duke@435 | 2094 | Value base() { return _base; } |
duke@435 | 2095 | Value index() { return _index; } |
duke@435 | 2096 | bool has_index() { return (_index != NULL); } |
duke@435 | 2097 | int log2_scale() { return _log2_scale; } |
duke@435 | 2098 | |
duke@435 | 2099 | // setters |
duke@435 | 2100 | void set_base (Value base) { _base = base; } |
duke@435 | 2101 | void set_index(Value index) { _index = index; } |
duke@435 | 2102 | void set_log2_scale(int log2_scale) { _log2_scale = log2_scale; } |
duke@435 | 2103 | |
duke@435 | 2104 | // generic |
iveresov@1939 | 2105 | virtual void input_values_do(ValueVisitor* f) { UnsafeOp::input_values_do(f); |
iveresov@1939 | 2106 | f->visit(&_base); |
iveresov@1939 | 2107 | if (has_index()) f->visit(&_index); } |
duke@435 | 2108 | }; |
duke@435 | 2109 | |
duke@435 | 2110 | |
duke@435 | 2111 | LEAF(UnsafeGetRaw, UnsafeRawOp) |
duke@435 | 2112 | private: |
iveresov@2344 | 2113 | bool _may_be_unaligned, _is_wide; // For OSREntry |
duke@435 | 2114 | |
duke@435 | 2115 | public: |
iveresov@2344 | 2116 | UnsafeGetRaw(BasicType basic_type, Value addr, bool may_be_unaligned, bool is_wide = false) |
duke@435 | 2117 | : UnsafeRawOp(basic_type, addr, false) { |
duke@435 | 2118 | _may_be_unaligned = may_be_unaligned; |
iveresov@2344 | 2119 | _is_wide = is_wide; |
duke@435 | 2120 | } |
duke@435 | 2121 | |
iveresov@2344 | 2122 | UnsafeGetRaw(BasicType basic_type, Value base, Value index, int log2_scale, bool may_be_unaligned, bool is_wide = false) |
duke@435 | 2123 | : UnsafeRawOp(basic_type, base, index, log2_scale, false) { |
duke@435 | 2124 | _may_be_unaligned = may_be_unaligned; |
iveresov@2344 | 2125 | _is_wide = is_wide; |
duke@435 | 2126 | } |
duke@435 | 2127 | |
iveresov@2344 | 2128 | bool may_be_unaligned() { return _may_be_unaligned; } |
iveresov@2344 | 2129 | bool is_wide() { return _is_wide; } |
duke@435 | 2130 | }; |
duke@435 | 2131 | |
duke@435 | 2132 | |
duke@435 | 2133 | LEAF(UnsafePutRaw, UnsafeRawOp) |
duke@435 | 2134 | private: |
duke@435 | 2135 | Value _value; // Value to be stored |
duke@435 | 2136 | |
duke@435 | 2137 | public: |
duke@435 | 2138 | UnsafePutRaw(BasicType basic_type, Value addr, Value value) |
duke@435 | 2139 | : UnsafeRawOp(basic_type, addr, true) |
duke@435 | 2140 | , _value(value) |
duke@435 | 2141 | { |
duke@435 | 2142 | assert(value != NULL, "just checking"); |
duke@435 | 2143 | ASSERT_VALUES |
duke@435 | 2144 | } |
duke@435 | 2145 | |
duke@435 | 2146 | UnsafePutRaw(BasicType basic_type, Value base, Value index, int log2_scale, Value value) |
duke@435 | 2147 | : UnsafeRawOp(basic_type, base, index, log2_scale, true) |
duke@435 | 2148 | , _value(value) |
duke@435 | 2149 | { |
duke@435 | 2150 | assert(value != NULL, "just checking"); |
duke@435 | 2151 | ASSERT_VALUES |
duke@435 | 2152 | } |
duke@435 | 2153 | |
duke@435 | 2154 | // accessors |
duke@435 | 2155 | Value value() { return _value; } |
duke@435 | 2156 | |
duke@435 | 2157 | // generic |
iveresov@1939 | 2158 | virtual void input_values_do(ValueVisitor* f) { UnsafeRawOp::input_values_do(f); |
iveresov@1939 | 2159 | f->visit(&_value); } |
duke@435 | 2160 | }; |
duke@435 | 2161 | |
duke@435 | 2162 | |
duke@435 | 2163 | BASE(UnsafeObjectOp, UnsafeOp) |
duke@435 | 2164 | private: |
duke@435 | 2165 | Value _object; // Object to be fetched from or mutated |
duke@435 | 2166 | Value _offset; // Offset within object |
duke@435 | 2167 | bool _is_volatile; // true if volatile - dl/JSR166 |
duke@435 | 2168 | public: |
duke@435 | 2169 | UnsafeObjectOp(BasicType basic_type, Value object, Value offset, bool is_put, bool is_volatile) |
duke@435 | 2170 | : UnsafeOp(basic_type, is_put), _object(object), _offset(offset), _is_volatile(is_volatile) |
duke@435 | 2171 | { |
duke@435 | 2172 | } |
duke@435 | 2173 | |
duke@435 | 2174 | // accessors |
duke@435 | 2175 | Value object() { return _object; } |
duke@435 | 2176 | Value offset() { return _offset; } |
duke@435 | 2177 | bool is_volatile() { return _is_volatile; } |
duke@435 | 2178 | // generic |
iveresov@1939 | 2179 | virtual void input_values_do(ValueVisitor* f) { UnsafeOp::input_values_do(f); |
iveresov@1939 | 2180 | f->visit(&_object); |
iveresov@1939 | 2181 | f->visit(&_offset); } |
duke@435 | 2182 | }; |
duke@435 | 2183 | |
duke@435 | 2184 | |
duke@435 | 2185 | LEAF(UnsafeGetObject, UnsafeObjectOp) |
duke@435 | 2186 | public: |
duke@435 | 2187 | UnsafeGetObject(BasicType basic_type, Value object, Value offset, bool is_volatile) |
duke@435 | 2188 | : UnsafeObjectOp(basic_type, object, offset, false, is_volatile) |
duke@435 | 2189 | { |
duke@435 | 2190 | ASSERT_VALUES |
duke@435 | 2191 | } |
duke@435 | 2192 | }; |
duke@435 | 2193 | |
duke@435 | 2194 | |
duke@435 | 2195 | LEAF(UnsafePutObject, UnsafeObjectOp) |
duke@435 | 2196 | private: |
duke@435 | 2197 | Value _value; // Value to be stored |
duke@435 | 2198 | public: |
duke@435 | 2199 | UnsafePutObject(BasicType basic_type, Value object, Value offset, Value value, bool is_volatile) |
duke@435 | 2200 | : UnsafeObjectOp(basic_type, object, offset, true, is_volatile) |
duke@435 | 2201 | , _value(value) |
duke@435 | 2202 | { |
duke@435 | 2203 | ASSERT_VALUES |
duke@435 | 2204 | } |
duke@435 | 2205 | |
duke@435 | 2206 | // accessors |
duke@435 | 2207 | Value value() { return _value; } |
duke@435 | 2208 | |
duke@435 | 2209 | // generic |
iveresov@1939 | 2210 | virtual void input_values_do(ValueVisitor* f) { UnsafeObjectOp::input_values_do(f); |
iveresov@1939 | 2211 | f->visit(&_value); } |
duke@435 | 2212 | }; |
duke@435 | 2213 | |
duke@435 | 2214 | |
duke@435 | 2215 | BASE(UnsafePrefetch, UnsafeObjectOp) |
duke@435 | 2216 | public: |
duke@435 | 2217 | UnsafePrefetch(Value object, Value offset) |
duke@435 | 2218 | : UnsafeObjectOp(T_VOID, object, offset, false, false) |
duke@435 | 2219 | { |
duke@435 | 2220 | } |
duke@435 | 2221 | }; |
duke@435 | 2222 | |
duke@435 | 2223 | |
duke@435 | 2224 | LEAF(UnsafePrefetchRead, UnsafePrefetch) |
duke@435 | 2225 | public: |
duke@435 | 2226 | UnsafePrefetchRead(Value object, Value offset) |
duke@435 | 2227 | : UnsafePrefetch(object, offset) |
duke@435 | 2228 | { |
duke@435 | 2229 | ASSERT_VALUES |
duke@435 | 2230 | } |
duke@435 | 2231 | }; |
duke@435 | 2232 | |
duke@435 | 2233 | |
duke@435 | 2234 | LEAF(UnsafePrefetchWrite, UnsafePrefetch) |
duke@435 | 2235 | public: |
duke@435 | 2236 | UnsafePrefetchWrite(Value object, Value offset) |
duke@435 | 2237 | : UnsafePrefetch(object, offset) |
duke@435 | 2238 | { |
duke@435 | 2239 | ASSERT_VALUES |
duke@435 | 2240 | } |
duke@435 | 2241 | }; |
duke@435 | 2242 | |
duke@435 | 2243 | LEAF(ProfileCall, Instruction) |
duke@435 | 2244 | private: |
duke@435 | 2245 | ciMethod* _method; |
duke@435 | 2246 | int _bci_of_invoke; |
duke@435 | 2247 | Value _recv; |
duke@435 | 2248 | ciKlass* _known_holder; |
duke@435 | 2249 | |
duke@435 | 2250 | public: |
duke@435 | 2251 | ProfileCall(ciMethod* method, int bci, Value recv, ciKlass* known_holder) |
duke@435 | 2252 | : Instruction(voidType) |
duke@435 | 2253 | , _method(method) |
duke@435 | 2254 | , _bci_of_invoke(bci) |
duke@435 | 2255 | , _recv(recv) |
duke@435 | 2256 | , _known_holder(known_holder) |
duke@435 | 2257 | { |
duke@435 | 2258 | // The ProfileCall has side-effects and must occur precisely where located |
duke@435 | 2259 | pin(); |
duke@435 | 2260 | } |
duke@435 | 2261 | |
duke@435 | 2262 | ciMethod* method() { return _method; } |
duke@435 | 2263 | int bci_of_invoke() { return _bci_of_invoke; } |
duke@435 | 2264 | Value recv() { return _recv; } |
duke@435 | 2265 | ciKlass* known_holder() { return _known_holder; } |
duke@435 | 2266 | |
iveresov@1939 | 2267 | virtual void input_values_do(ValueVisitor* f) { if (_recv != NULL) f->visit(&_recv); } |
duke@435 | 2268 | }; |
duke@435 | 2269 | |
iveresov@2138 | 2270 | // Use to trip invocation counter of an inlined method |
duke@435 | 2271 | |
iveresov@2138 | 2272 | LEAF(ProfileInvoke, Instruction) |
duke@435 | 2273 | private: |
iveresov@2138 | 2274 | ciMethod* _inlinee; |
iveresov@2138 | 2275 | ValueStack* _state; |
duke@435 | 2276 | |
duke@435 | 2277 | public: |
iveresov@2180 | 2278 | ProfileInvoke(ciMethod* inlinee, ValueStack* state) |
duke@435 | 2279 | : Instruction(voidType) |
iveresov@2138 | 2280 | , _inlinee(inlinee) |
iveresov@2138 | 2281 | , _state(state) |
duke@435 | 2282 | { |
iveresov@2138 | 2283 | // The ProfileInvoke has side-effects and must occur precisely where located QQQ??? |
duke@435 | 2284 | pin(); |
duke@435 | 2285 | } |
duke@435 | 2286 | |
iveresov@2138 | 2287 | ciMethod* inlinee() { return _inlinee; } |
iveresov@2138 | 2288 | ValueStack* state() { return _state; } |
iveresov@2138 | 2289 | virtual void input_values_do(ValueVisitor*) {} |
iveresov@2138 | 2290 | virtual void state_values_do(ValueVisitor*); |
duke@435 | 2291 | }; |
duke@435 | 2292 | |
duke@435 | 2293 | class BlockPair: public CompilationResourceObj { |
duke@435 | 2294 | private: |
duke@435 | 2295 | BlockBegin* _from; |
duke@435 | 2296 | BlockBegin* _to; |
duke@435 | 2297 | public: |
duke@435 | 2298 | BlockPair(BlockBegin* from, BlockBegin* to): _from(from), _to(to) {} |
duke@435 | 2299 | BlockBegin* from() const { return _from; } |
duke@435 | 2300 | BlockBegin* to() const { return _to; } |
duke@435 | 2301 | bool is_same(BlockBegin* from, BlockBegin* to) const { return _from == from && _to == to; } |
duke@435 | 2302 | bool is_same(BlockPair* p) const { return _from == p->from() && _to == p->to(); } |
duke@435 | 2303 | void set_to(BlockBegin* b) { _to = b; } |
duke@435 | 2304 | void set_from(BlockBegin* b) { _from = b; } |
duke@435 | 2305 | }; |
duke@435 | 2306 | |
duke@435 | 2307 | |
duke@435 | 2308 | define_array(BlockPairArray, BlockPair*) |
duke@435 | 2309 | define_stack(BlockPairList, BlockPairArray) |
duke@435 | 2310 | |
duke@435 | 2311 | |
duke@435 | 2312 | inline int BlockBegin::number_of_sux() const { assert(_end == NULL || _end->number_of_sux() == _successors.length(), "mismatch"); return _successors.length(); } |
duke@435 | 2313 | inline BlockBegin* BlockBegin::sux_at(int i) const { assert(_end == NULL || _end->sux_at(i) == _successors.at(i), "mismatch"); return _successors.at(i); } |
duke@435 | 2314 | inline void BlockBegin::add_successor(BlockBegin* sux) { assert(_end == NULL, "Would create mismatch with successors of BlockEnd"); _successors.append(sux); } |
duke@435 | 2315 | |
duke@435 | 2316 | #undef ASSERT_VALUES |
stefank@2314 | 2317 | |
stefank@2314 | 2318 | #endif // SHARE_VM_C1_C1_INSTRUCTION_HPP |