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