roland@4860: /* roland@4860: * Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved. roland@4860: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. roland@4860: * roland@4860: * This code is free software; you can redistribute it and/or modify it roland@4860: * under the terms of the GNU General Public License version 2 only, as roland@4860: * published by the Free Software Foundation. roland@4860: * roland@4860: * This code is distributed in the hope that it will be useful, but WITHOUT roland@4860: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or roland@4860: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License roland@4860: * version 2 for more details (a copy is included in the LICENSE file that roland@4860: * accompanied this code). roland@4860: * roland@4860: * You should have received a copy of the GNU General Public License version roland@4860: * 2 along with this work; if not, write to the Free Software Foundation, roland@4860: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. roland@4860: * roland@4860: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA roland@4860: * or visit www.oracle.com if you need additional information or have any roland@4860: * questions. roland@4860: * roland@4860: */ roland@4860: roland@4860: #ifndef SHARE_VM_C1_C1_RANGECHECKELIMINATION_HPP roland@4860: #define SHARE_VM_C1_C1_RANGECHECKELIMINATION_HPP roland@4860: roland@4860: #include "c1/c1_Instruction.hpp" roland@4860: roland@4860: // Base class for range check elimination roland@4860: class RangeCheckElimination : AllStatic { roland@4860: public: roland@4860: static void eliminate(IR *ir); roland@4860: }; roland@4860: roland@4860: // Implementation roland@4860: class RangeCheckEliminator VALUE_OBJ_CLASS_SPEC { roland@4860: private: roland@4860: int _number_of_instructions; roland@4860: bool _optimistic; // Insert predicates and deoptimize when they fail roland@4860: IR *_ir; roland@4860: roland@4860: define_array(BlockBeginArray, BlockBegin*) roland@4860: define_stack(BlockBeginList, BlockBeginArray) roland@4860: define_stack(IntegerStack, intArray) roland@4860: define_array(IntegerMap, IntegerStack*) roland@4860: roland@4860: class Verification : public _ValueObj /*VALUE_OBJ_CLASS_SPEC*/, public BlockClosure { roland@4860: private: roland@4860: IR *_ir; roland@4860: boolArray _used; roland@4860: BlockBeginList _current; roland@4860: BlockBeginList _successors; roland@4860: roland@4860: public: roland@4860: Verification(IR *ir); roland@4860: virtual void block_do(BlockBegin *block); roland@4860: bool can_reach(BlockBegin *start, BlockBegin *end, BlockBegin *dont_use = NULL); roland@4860: bool dominates(BlockBegin *dominator, BlockBegin *block); roland@4860: }; roland@4860: roland@4860: public: roland@4860: // Bounds for an instruction in the form x + c which c integer roland@4860: // constant and x another instruction roland@4860: class Bound : public CompilationResourceObj { roland@4860: private: roland@4860: int _upper; roland@4860: Value _upper_instr; roland@4860: int _lower; roland@4860: Value _lower_instr; roland@4860: roland@4860: public: roland@4860: Bound(); roland@4860: Bound(Value v); roland@4860: Bound(Instruction::Condition cond, Value v, int constant = 0); roland@4860: Bound(int lower, Value lower_instr, int upper, Value upper_instr); roland@4860: ~Bound(); roland@4860: roland@4860: #ifdef ASSERT roland@4860: void add_assertion(Instruction *instruction, Instruction *position, int i, Value instr, Instruction::Condition cond); roland@4860: #endif roland@4860: int upper(); roland@4860: Value upper_instr(); roland@4860: int lower(); roland@4860: Value lower_instr(); roland@4860: void print(); roland@4860: bool check_no_overflow(int const_value); roland@4860: void or_op(Bound *b); roland@4860: void and_op(Bound *b); roland@4860: bool has_upper(); roland@4860: bool has_lower(); roland@4860: void set_upper(int upper, Value upper_instr); roland@4860: void set_lower(int lower, Value lower_instr); roland@4860: bool is_smaller(Bound *b); roland@4860: void remove_upper(); roland@4860: void remove_lower(); roland@4860: void add_constant(int value); roland@4860: Bound *copy(); roland@4860: roland@4860: private: roland@4860: void init(); roland@4860: }; roland@4860: roland@4860: roland@4860: class Visitor : public InstructionVisitor { roland@4860: private: roland@4860: Bound *_bound; roland@4860: RangeCheckEliminator *_rce; roland@4860: roland@4860: public: roland@4860: void set_range_check_eliminator(RangeCheckEliminator *rce) { _rce = rce; } roland@4860: Bound *bound() const { return _bound; } roland@4860: void clear_bound() { _bound = NULL; } roland@4860: roland@4860: protected: roland@4860: // visitor functions roland@4860: void do_Constant (Constant* x); roland@4860: void do_IfOp (IfOp* x); roland@4860: void do_LogicOp (LogicOp* x); roland@4860: void do_ArithmeticOp (ArithmeticOp* x); roland@4860: void do_Phi (Phi* x); roland@4860: roland@4860: void do_StoreField (StoreField* x) { /* nothing to do */ }; roland@4860: void do_StoreIndexed (StoreIndexed* x) { /* nothing to do */ }; roland@4860: void do_MonitorEnter (MonitorEnter* x) { /* nothing to do */ }; roland@4860: void do_MonitorExit (MonitorExit* x) { /* nothing to do */ }; roland@4860: void do_Invoke (Invoke* x) { /* nothing to do */ }; roland@4860: void do_UnsafePutRaw (UnsafePutRaw* x) { /* nothing to do */ }; roland@4860: void do_UnsafePutObject(UnsafePutObject* x) { /* nothing to do */ }; roland@4860: void do_Intrinsic (Intrinsic* x) { /* nothing to do */ }; roland@4860: void do_Local (Local* x) { /* nothing to do */ }; roland@4860: void do_LoadField (LoadField* x) { /* nothing to do */ }; roland@4860: void do_ArrayLength (ArrayLength* x) { /* nothing to do */ }; roland@4860: void do_LoadIndexed (LoadIndexed* x) { /* nothing to do */ }; roland@4860: void do_NegateOp (NegateOp* x) { /* nothing to do */ }; roland@4860: void do_ShiftOp (ShiftOp* x) { /* nothing to do */ }; roland@4860: void do_CompareOp (CompareOp* x) { /* nothing to do */ }; roland@4860: void do_Convert (Convert* x) { /* nothing to do */ }; roland@4860: void do_NullCheck (NullCheck* x) { /* nothing to do */ }; roland@4860: void do_TypeCast (TypeCast* x) { /* nothing to do */ }; roland@4860: void do_NewInstance (NewInstance* x) { /* nothing to do */ }; roland@4860: void do_NewTypeArray (NewTypeArray* x) { /* nothing to do */ }; roland@4860: void do_NewObjectArray (NewObjectArray* x) { /* nothing to do */ }; roland@4860: void do_NewMultiArray (NewMultiArray* x) { /* nothing to do */ }; roland@4860: void do_CheckCast (CheckCast* x) { /* nothing to do */ }; roland@4860: void do_InstanceOf (InstanceOf* x) { /* nothing to do */ }; roland@4860: void do_BlockBegin (BlockBegin* x) { /* nothing to do */ }; roland@4860: void do_Goto (Goto* x) { /* nothing to do */ }; roland@4860: void do_If (If* x) { /* nothing to do */ }; roland@4860: void do_IfInstanceOf (IfInstanceOf* x) { /* nothing to do */ }; roland@4860: void do_TableSwitch (TableSwitch* x) { /* nothing to do */ }; roland@4860: void do_LookupSwitch (LookupSwitch* x) { /* nothing to do */ }; roland@4860: void do_Return (Return* x) { /* nothing to do */ }; roland@4860: void do_Throw (Throw* x) { /* nothing to do */ }; roland@4860: void do_Base (Base* x) { /* nothing to do */ }; roland@4860: void do_OsrEntry (OsrEntry* x) { /* nothing to do */ }; roland@4860: void do_ExceptionObject(ExceptionObject* x) { /* nothing to do */ }; roland@4860: void do_RoundFP (RoundFP* x) { /* nothing to do */ }; roland@4860: void do_UnsafeGetRaw (UnsafeGetRaw* x) { /* nothing to do */ }; roland@4860: void do_UnsafeGetObject(UnsafeGetObject* x) { /* nothing to do */ }; roland@4860: void do_UnsafeGetAndSetObject(UnsafeGetAndSetObject* x) { /* nothing to do */ }; roland@4860: void do_UnsafePrefetchRead (UnsafePrefetchRead* x) { /* nothing to do */ }; roland@4860: void do_UnsafePrefetchWrite(UnsafePrefetchWrite* x) { /* nothing to do */ }; roland@4860: void do_ProfileCall (ProfileCall* x) { /* nothing to do */ }; roland@4860: void do_ProfileInvoke (ProfileInvoke* x) { /* nothing to do */ }; roland@4860: void do_RuntimeCall (RuntimeCall* x) { /* nothing to do */ }; roland@4860: void do_MemBar (MemBar* x) { /* nothing to do */ }; roland@4860: void do_RangeCheckPredicate(RangeCheckPredicate* x) { /* nothing to do */ }; roland@4947: #ifdef ASSERT roland@4860: void do_Assert (Assert* x) { /* nothing to do */ }; roland@4947: #endif roland@4860: }; roland@4860: roland@4860: #ifdef ASSERT roland@4860: void add_assertions(Bound *bound, Instruction *instruction, Instruction *position); roland@4860: #endif roland@4860: roland@4860: define_array(BoundArray, Bound *) roland@4860: define_stack(BoundStack, BoundArray) roland@4860: define_array(BoundMap, BoundStack *) roland@4860: define_array(AccessIndexedArray, AccessIndexed *) roland@4860: define_stack(AccessIndexedList, AccessIndexedArray) roland@4860: define_array(InstructionArray, Instruction *) roland@4860: define_stack(InstructionList, InstructionArray) roland@4860: roland@4860: class AccessIndexedInfo : public CompilationResourceObj { roland@4860: public: roland@4860: AccessIndexedList *_list; roland@4860: int _min; roland@4860: int _max; roland@4860: }; roland@4860: roland@4860: define_array(AccessIndexedInfoArray, AccessIndexedInfo *) roland@4860: BoundMap _bounds; // Mapping from Instruction's id to current bound roland@4860: AccessIndexedInfoArray _access_indexed_info; // Mapping from Instruction's id to AccessIndexedInfo for in block motion roland@4860: Visitor _visitor; roland@4860: roland@4860: public: roland@4860: RangeCheckEliminator(IR *ir); roland@4860: roland@4860: IR *ir() const { return _ir; } roland@4860: roland@4860: // Pass over the dominator tree to identify blocks where there's an oppportunity for optimization roland@4860: bool set_process_block_flags(BlockBegin *block); roland@4860: // The core of the optimization work: pass over the dominator tree roland@4860: // to propagate bound information, insert predicate out of loops, roland@4860: // eliminate bound checks when possible and perform in block motion roland@4860: void calc_bounds(BlockBegin *block, BlockBegin *loop_header); roland@4860: // reorder bound checks within a block in order to eliminate some of them roland@4860: void in_block_motion(BlockBegin *block, AccessIndexedList &accessIndexed, InstructionList &arrays); roland@4860: roland@4860: // update/access current bound roland@4860: void update_bound(IntegerStack &pushed, Value v, Instruction::Condition cond, Value value, int constant); roland@4860: void update_bound(IntegerStack &pushed, Value v, Bound *bound); roland@4860: Bound *get_bound(Value v); roland@4860: roland@4860: bool loop_invariant(BlockBegin *loop_header, Instruction *instruction); // check for loop invariance roland@4860: void add_access_indexed_info(InstructionList &indices, int i, Value instruction, AccessIndexed *ai); // record indexed access for in block motion roland@4860: void remove_range_check(AccessIndexed *ai); // Mark this instructions as not needing a range check roland@4860: void add_if_condition(IntegerStack &pushed, Value x, Value y, Instruction::Condition condition); // Update bound for an If roland@4860: bool in_array_bound(Bound *bound, Value array); // Check whether bound is known to fall within array roland@4860: roland@4860: // helper functions to work with predicates roland@4860: Instruction* insert_after(Instruction* insert_position, Instruction* instr, int bci); roland@4860: Instruction* predicate(Instruction* left, Instruction::Condition cond, Instruction* right, ValueStack* state, Instruction *insert_position, int bci=-1); roland@4860: Instruction* predicate_cmp_with_const(Instruction* instr, Instruction::Condition cond, int constant, ValueStack* state, Instruction *insert_position, int bci=1); roland@4860: Instruction* predicate_add(Instruction* left, int left_const, Instruction::Condition cond, Instruction* right, ValueStack* state, Instruction *insert_position, int bci=-1); roland@4860: Instruction* predicate_add_cmp_with_const(Instruction* left, int left_const, Instruction::Condition cond, int constant, ValueStack* state, Instruction *insert_position, int bci=-1); roland@4860: roland@4860: void insert_deoptimization(ValueStack *state, Instruction *insert_position, Instruction *array_instr, // Add predicate roland@4860: Instruction *length_instruction, Instruction *lower_instr, int lower, roland@4860: Instruction *upper_instr, int upper, AccessIndexed *ai); roland@4860: bool is_ok_for_deoptimization(Instruction *insert_position, Instruction *array_instr, // Can we safely add a predicate? roland@4860: Instruction *length_instr, Instruction *lower_instr, roland@4860: int lower, Instruction *upper_instr, int upper); roland@4860: void process_if(IntegerStack &pushed, BlockBegin *block, If *cond); // process If Instruction roland@4860: void process_access_indexed(BlockBegin *loop_header, BlockBegin *block, AccessIndexed *ai); // process indexed access roland@4860: roland@4860: void dump_condition_stack(BlockBegin *cur_block); roland@4860: static void print_statistics(); roland@4860: }; roland@4860: roland@4860: #endif // SHARE_VM_C1_C1_RANGECHECKELIMINATION_HPP