duke@435: /* never@2486: * Copyright (c) 2005, 2011, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #ifndef SHARE_VM_C1_C1_LIRGENERATOR_HPP stefank@2314: #define SHARE_VM_C1_C1_LIRGENERATOR_HPP stefank@2314: stefank@2314: #include "c1/c1_Instruction.hpp" stefank@2314: #include "c1/c1_LIR.hpp" stefank@2314: #include "ci/ciMethodData.hpp" stefank@2314: #include "utilities/sizes.hpp" stefank@2314: duke@435: // The classes responsible for code emission and register allocation duke@435: duke@435: duke@435: class LIRGenerator; duke@435: class LIREmitter; duke@435: class Invoke; duke@435: class SwitchRange; duke@435: class LIRItem; duke@435: duke@435: define_array(LIRItemArray, LIRItem*) duke@435: define_stack(LIRItemList, LIRItemArray) duke@435: duke@435: class SwitchRange: public CompilationResourceObj { duke@435: private: duke@435: int _low_key; duke@435: int _high_key; duke@435: BlockBegin* _sux; duke@435: public: duke@435: SwitchRange(int start_key, BlockBegin* sux): _low_key(start_key), _high_key(start_key), _sux(sux) {} duke@435: void set_high_key(int key) { _high_key = key; } duke@435: duke@435: int high_key() const { return _high_key; } duke@435: int low_key() const { return _low_key; } duke@435: BlockBegin* sux() const { return _sux; } duke@435: }; duke@435: duke@435: define_array(SwitchRangeArray, SwitchRange*) duke@435: define_stack(SwitchRangeList, SwitchRangeArray) duke@435: duke@435: duke@435: class ResolveNode; duke@435: duke@435: define_array(NodeArray, ResolveNode*); duke@435: define_stack(NodeList, NodeArray); duke@435: duke@435: duke@435: // Node objects form a directed graph of LIR_Opr duke@435: // Edges between Nodes represent moves from one Node to its destinations duke@435: class ResolveNode: public CompilationResourceObj { duke@435: private: duke@435: LIR_Opr _operand; // the source or destinaton duke@435: NodeList _destinations; // for the operand duke@435: bool _assigned; // Value assigned to this Node? duke@435: bool _visited; // Node already visited? duke@435: bool _start_node; // Start node already visited? duke@435: duke@435: public: duke@435: ResolveNode(LIR_Opr operand) duke@435: : _operand(operand) duke@435: , _assigned(false) duke@435: , _visited(false) duke@435: , _start_node(false) {}; duke@435: duke@435: // accessors duke@435: LIR_Opr operand() const { return _operand; } duke@435: int no_of_destinations() const { return _destinations.length(); } duke@435: ResolveNode* destination_at(int i) { return _destinations[i]; } duke@435: bool assigned() const { return _assigned; } duke@435: bool visited() const { return _visited; } duke@435: bool start_node() const { return _start_node; } duke@435: duke@435: // modifiers duke@435: void append(ResolveNode* dest) { _destinations.append(dest); } duke@435: void set_assigned() { _assigned = true; } duke@435: void set_visited() { _visited = true; } duke@435: void set_start_node() { _start_node = true; } duke@435: }; duke@435: duke@435: duke@435: // This is shared state to be used by the PhiResolver so the operand duke@435: // arrays don't have to be reallocated for reach resolution. duke@435: class PhiResolverState: public CompilationResourceObj { duke@435: friend class PhiResolver; duke@435: duke@435: private: duke@435: NodeList _virtual_operands; // Nodes where the operand is a virtual register duke@435: NodeList _other_operands; // Nodes where the operand is not a virtual register duke@435: NodeList _vreg_table; // Mapping from virtual register to Node duke@435: duke@435: public: duke@435: PhiResolverState() {} duke@435: duke@435: void reset(int max_vregs); duke@435: }; duke@435: duke@435: duke@435: // class used to move value of phi operand to phi function duke@435: class PhiResolver: public CompilationResourceObj { duke@435: private: duke@435: LIRGenerator* _gen; duke@435: PhiResolverState& _state; // temporary state cached by LIRGenerator duke@435: duke@435: ResolveNode* _loop; duke@435: LIR_Opr _temp; duke@435: duke@435: // access to shared state arrays duke@435: NodeList& virtual_operands() { return _state._virtual_operands; } duke@435: NodeList& other_operands() { return _state._other_operands; } duke@435: NodeList& vreg_table() { return _state._vreg_table; } duke@435: duke@435: ResolveNode* create_node(LIR_Opr opr, bool source); duke@435: ResolveNode* source_node(LIR_Opr opr) { return create_node(opr, true); } duke@435: ResolveNode* destination_node(LIR_Opr opr) { return create_node(opr, false); } duke@435: duke@435: void emit_move(LIR_Opr src, LIR_Opr dest); duke@435: void move_to_temp(LIR_Opr src); duke@435: void move_temp_to(LIR_Opr dest); duke@435: void move(ResolveNode* src, ResolveNode* dest); duke@435: duke@435: LIRGenerator* gen() { duke@435: return _gen; duke@435: } duke@435: duke@435: public: duke@435: PhiResolver(LIRGenerator* _lir_gen, int max_vregs); duke@435: ~PhiResolver(); duke@435: duke@435: void move(LIR_Opr src, LIR_Opr dest); duke@435: }; duke@435: duke@435: duke@435: // only the classes below belong in the same file duke@435: class LIRGenerator: public InstructionVisitor, public BlockClosure { ysr@777: duke@435: private: duke@435: Compilation* _compilation; duke@435: ciMethod* _method; // method that we are compiling duke@435: PhiResolverState _resolver_state; duke@435: BlockBegin* _block; duke@435: int _virtual_register_number; duke@435: Values _instruction_for_operand; duke@435: BitMap2D _vreg_flags; // flags which can be set on a per-vreg basis duke@435: LIR_List* _lir; ysr@777: BarrierSet* _bs; duke@435: duke@435: LIRGenerator* gen() { duke@435: return this; duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: LIR_List* lir(const char * file, int line) const { duke@435: _lir->set_file_and_line(file, line); duke@435: return _lir; duke@435: } duke@435: #endif duke@435: LIR_List* lir() const { duke@435: return _lir; duke@435: } duke@435: duke@435: // a simple cache of constants used within a block duke@435: GrowableArray _constants; duke@435: LIR_OprList _reg_for_constants; duke@435: Values _unpinned_constants; duke@435: duke@435: friend class PhiResolver; duke@435: duke@435: // unified bailout support duke@435: void bailout(const char* msg) const { compilation()->bailout(msg); } duke@435: bool bailed_out() const { return compilation()->bailed_out(); } duke@435: duke@435: void block_do_prolog(BlockBegin* block); duke@435: void block_do_epilog(BlockBegin* block); duke@435: duke@435: // register allocation duke@435: LIR_Opr rlock(Value instr); // lock a free register duke@435: LIR_Opr rlock_result(Value instr); duke@435: LIR_Opr rlock_result(Value instr, BasicType type); duke@435: LIR_Opr rlock_byte(BasicType type); duke@435: LIR_Opr rlock_callee_saved(BasicType type); duke@435: duke@435: // get a constant into a register and get track of what register was used duke@435: LIR_Opr load_constant(Constant* x); duke@435: LIR_Opr load_constant(LIR_Const* constant); duke@435: iveresov@2138: // Given an immediate value, return an operand usable in logical ops. iveresov@2138: LIR_Opr load_immediate(int x, BasicType type); iveresov@2138: duke@435: void set_result(Value x, LIR_Opr opr) { duke@435: assert(opr->is_valid(), "must set to valid value"); duke@435: assert(x->operand()->is_illegal(), "operand should never change"); duke@435: assert(!opr->is_register() || opr->is_virtual(), "should never set result to a physical register"); duke@435: x->set_operand(opr); duke@435: assert(opr == x->operand(), "must be"); duke@435: if (opr->is_virtual()) { duke@435: _instruction_for_operand.at_put_grow(opr->vreg_number(), x, NULL); duke@435: } duke@435: } duke@435: void set_no_result(Value x) { assert(!x->has_uses(), "can't have use"); x->clear_operand(); } duke@435: duke@435: friend class LIRItem; duke@435: duke@435: LIR_Opr round_item(LIR_Opr opr); duke@435: LIR_Opr force_to_spill(LIR_Opr value, BasicType t); duke@435: duke@435: PhiResolverState& resolver_state() { return _resolver_state; } duke@435: duke@435: void move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val); duke@435: void move_to_phi(ValueStack* cur_state); duke@435: duke@435: // code emission duke@435: void do_ArithmeticOp_Long (ArithmeticOp* x); duke@435: void do_ArithmeticOp_Int (ArithmeticOp* x); duke@435: void do_ArithmeticOp_FPU (ArithmeticOp* x); duke@435: duke@435: // platform dependent duke@435: LIR_Opr getThreadPointer(); duke@435: duke@435: void do_RegisterFinalizer(Intrinsic* x); duke@435: void do_getClass(Intrinsic* x); duke@435: void do_currentThread(Intrinsic* x); duke@435: void do_MathIntrinsic(Intrinsic* x); duke@435: void do_ArrayCopy(Intrinsic* x); duke@435: void do_CompareAndSwap(Intrinsic* x, ValueType* type); duke@435: void do_AttemptUpdate(Intrinsic* x); duke@435: void do_NIOCheckIndex(Intrinsic* x); duke@435: void do_FPIntrinsics(Intrinsic* x); duke@435: duke@435: void do_UnsafePrefetch(UnsafePrefetch* x, bool is_store); duke@435: duke@435: LIR_Opr call_runtime(BasicTypeArray* signature, LIRItemList* args, address entry, ValueType* result_type, CodeEmitInfo* info); duke@435: LIR_Opr call_runtime(BasicTypeArray* signature, LIR_OprList* args, address entry, ValueType* result_type, CodeEmitInfo* info); duke@435: duke@435: // convenience functions duke@435: LIR_Opr call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info); duke@435: LIR_Opr call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info); duke@435: duke@435: // GC Barriers duke@435: duke@435: // generic interface duke@435: ysr@777: void pre_barrier(LIR_Opr addr_opr, bool patch, CodeEmitInfo* info); duke@435: void post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val); duke@435: duke@435: // specific implementations ysr@777: // pre barriers ysr@777: ysr@777: void G1SATBCardTableModRef_pre_barrier(LIR_Opr addr_opr, bool patch, CodeEmitInfo* info); duke@435: duke@435: // post barriers duke@435: ysr@777: void G1SATBCardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val); duke@435: void CardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val); duke@435: duke@435: duke@435: static LIR_Opr result_register_for(ValueType* type, bool callee = false); duke@435: duke@435: ciObject* get_jobject_constant(Value value); duke@435: duke@435: LIRItemList* invoke_visit_arguments(Invoke* x); duke@435: void invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list); duke@435: duke@435: void trace_block_entry(BlockBegin* block); duke@435: duke@435: // volatile field operations are never patchable because a klass duke@435: // must be loaded to know it's volatile which means that the offset duke@435: // it always known as well. duke@435: void volatile_field_store(LIR_Opr value, LIR_Address* address, CodeEmitInfo* info); duke@435: void volatile_field_load(LIR_Address* address, LIR_Opr result, CodeEmitInfo* info); duke@435: duke@435: void put_Object_unsafe(LIR_Opr src, LIR_Opr offset, LIR_Opr data, BasicType type, bool is_volatile); duke@435: void get_Object_unsafe(LIR_Opr dest, LIR_Opr src, LIR_Opr offset, BasicType type, bool is_volatile); duke@435: duke@435: void arithmetic_call_op (Bytecodes::Code code, LIR_Opr result, LIR_OprList* args); duke@435: iveresov@2138: void increment_counter(address counter, BasicType type, int step = 1); duke@435: void increment_counter(LIR_Address* addr, int step = 1); duke@435: duke@435: // is_strictfp is only needed for mul and div (and only generates different code on i486) duke@435: void arithmetic_op(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp, CodeEmitInfo* info = NULL); duke@435: // machine dependent. returns true if it emitted code for the multiply duke@435: bool strength_reduce_multiply(LIR_Opr left, int constant, LIR_Opr result, LIR_Opr tmp); duke@435: duke@435: void store_stack_parameter (LIR_Opr opr, ByteSize offset_from_sp_in_bytes); duke@435: duke@435: void jobject2reg_with_patching(LIR_Opr r, ciObject* obj, CodeEmitInfo* info); duke@435: duke@435: // this loads the length and compares against the index duke@435: void array_range_check (LIR_Opr array, LIR_Opr index, CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info); duke@435: // For java.nio.Buffer.checkIndex duke@435: void nio_range_check (LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info); duke@435: duke@435: void arithmetic_op_int (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp); duke@435: void arithmetic_op_long (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info = NULL); duke@435: void arithmetic_op_fpu (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp = LIR_OprFact::illegalOpr); duke@435: duke@435: void shift_op (Bytecodes::Code code, LIR_Opr dst_reg, LIR_Opr value, LIR_Opr count, LIR_Opr tmp); duke@435: duke@435: void logic_op (Bytecodes::Code code, LIR_Opr dst_reg, LIR_Opr left, LIR_Opr right); duke@435: duke@435: void monitor_enter (LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no, CodeEmitInfo* info_for_exception, CodeEmitInfo* info); bobv@2036: void monitor_exit (LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no); duke@435: duke@435: void new_instance (LIR_Opr dst, ciInstanceKlass* klass, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info); duke@435: duke@435: // machine dependent duke@435: void cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info); duke@435: void cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, int disp, BasicType type, CodeEmitInfo* info); duke@435: void cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, LIR_Opr disp, BasicType type, CodeEmitInfo* info); duke@435: duke@435: void arraycopy_helper(Intrinsic* x, int* flags, ciArrayKlass** expected_type); duke@435: duke@435: // returns a LIR_Address to address an array location. May also duke@435: // emit some code as part of address calculation. If duke@435: // needs_card_mark is true then compute the full address for use by duke@435: // both the store and the card mark. duke@435: LIR_Address* generate_address(LIR_Opr base, duke@435: LIR_Opr index, int shift, duke@435: int disp, duke@435: BasicType type); duke@435: LIR_Address* generate_address(LIR_Opr base, int disp, BasicType type) { duke@435: return generate_address(base, LIR_OprFact::illegalOpr, 0, disp, type); duke@435: } duke@435: LIR_Address* emit_array_address(LIR_Opr array_opr, LIR_Opr index_opr, BasicType type, bool needs_card_mark); duke@435: bobv@2036: // the helper for generate_address bobv@2036: void add_large_constant(LIR_Opr src, int c, LIR_Opr dest); bobv@2036: duke@435: // machine preferences and characteristics duke@435: bool can_inline_as_constant(Value i) const; duke@435: bool can_inline_as_constant(LIR_Const* c) const; duke@435: bool can_store_as_constant(Value i, BasicType type) const; duke@435: duke@435: LIR_Opr safepoint_poll_register(); iveresov@2138: iveresov@2138: void profile_branch(If* if_instr, If::Condition cond); iveresov@2138: void increment_event_counter_impl(CodeEmitInfo* info, iveresov@2138: ciMethod *method, int frequency, iveresov@2138: int bci, bool backedge, bool notify); iveresov@2138: void increment_event_counter(CodeEmitInfo* info, int bci, bool backedge); iveresov@2138: void increment_invocation_counter(CodeEmitInfo *info) { iveresov@2138: if (compilation()->count_invocations()) { iveresov@2138: increment_event_counter(info, InvocationEntryBci, false); iveresov@2138: } iveresov@2138: } iveresov@2138: void increment_backedge_counter(CodeEmitInfo* info, int bci) { iveresov@2138: if (compilation()->count_backedges()) { iveresov@2138: increment_event_counter(info, bci, true); iveresov@2138: } duke@435: } duke@435: duke@435: CodeEmitInfo* state_for(Instruction* x, ValueStack* state, bool ignore_xhandler = false); duke@435: CodeEmitInfo* state_for(Instruction* x); duke@435: duke@435: // allocates a virtual register for this instruction if duke@435: // one isn't already allocated. Only for Phi and Local. duke@435: LIR_Opr operand_for_instruction(Instruction *x); duke@435: duke@435: void set_block(BlockBegin* block) { _block = block; } duke@435: duke@435: void block_prolog(BlockBegin* block); duke@435: void block_epilog(BlockBegin* block); duke@435: duke@435: void do_root (Instruction* instr); duke@435: void walk (Instruction* instr); duke@435: duke@435: void bind_block_entry(BlockBegin* block); duke@435: void start_block(BlockBegin* block); duke@435: duke@435: LIR_Opr new_register(BasicType type); duke@435: LIR_Opr new_register(Value value) { return new_register(as_BasicType(value->type())); } duke@435: LIR_Opr new_register(ValueType* type) { return new_register(as_BasicType(type)); } duke@435: duke@435: // returns a register suitable for doing pointer math duke@435: LIR_Opr new_pointer_register() { duke@435: #ifdef _LP64 duke@435: return new_register(T_LONG); duke@435: #else duke@435: return new_register(T_INT); duke@435: #endif duke@435: } duke@435: duke@435: static LIR_Condition lir_cond(If::Condition cond) { duke@435: LIR_Condition l; duke@435: switch (cond) { duke@435: case If::eql: l = lir_cond_equal; break; duke@435: case If::neq: l = lir_cond_notEqual; break; duke@435: case If::lss: l = lir_cond_less; break; duke@435: case If::leq: l = lir_cond_lessEqual; break; duke@435: case If::geq: l = lir_cond_greaterEqual; break; duke@435: case If::gtr: l = lir_cond_greater; break; duke@435: }; duke@435: return l; duke@435: } duke@435: bobv@2036: #ifdef __SOFTFP__ bobv@2036: void do_soft_float_compare(If *x); bobv@2036: #endif // __SOFTFP__ bobv@2036: duke@435: void init(); duke@435: duke@435: SwitchRangeArray* create_lookup_ranges(TableSwitch* x); duke@435: SwitchRangeArray* create_lookup_ranges(LookupSwitch* x); duke@435: void do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux); duke@435: duke@435: public: duke@435: Compilation* compilation() const { return _compilation; } duke@435: FrameMap* frame_map() const { return _compilation->frame_map(); } duke@435: ciMethod* method() const { return _method; } duke@435: BlockBegin* block() const { return _block; } duke@435: IRScope* scope() const { return block()->scope(); } duke@435: duke@435: int max_virtual_register_number() const { return _virtual_register_number; } duke@435: duke@435: void block_do(BlockBegin* block); duke@435: duke@435: // Flags that can be set on vregs duke@435: enum VregFlag { duke@435: must_start_in_memory = 0 // needs to be assigned a memory location at beginning, but may then be loaded in a register duke@435: , callee_saved = 1 // must be in a callee saved register duke@435: , byte_reg = 2 // must be in a byte register duke@435: , num_vreg_flags duke@435: duke@435: }; duke@435: duke@435: LIRGenerator(Compilation* compilation, ciMethod* method) duke@435: : _compilation(compilation) duke@435: , _method(method) duke@435: , _virtual_register_number(LIR_OprDesc::vreg_base) duke@435: , _vreg_flags(NULL, 0, num_vreg_flags) { duke@435: init(); duke@435: } duke@435: duke@435: // for virtual registers, maps them back to Phi's or Local's duke@435: Instruction* instruction_for_opr(LIR_Opr opr); duke@435: Instruction* instruction_for_vreg(int reg_num); duke@435: duke@435: void set_vreg_flag (int vreg_num, VregFlag f); duke@435: bool is_vreg_flag_set(int vreg_num, VregFlag f); duke@435: void set_vreg_flag (LIR_Opr opr, VregFlag f) { set_vreg_flag(opr->vreg_number(), f); } duke@435: bool is_vreg_flag_set(LIR_Opr opr, VregFlag f) { return is_vreg_flag_set(opr->vreg_number(), f); } duke@435: duke@435: // statics duke@435: static LIR_Opr exceptionOopOpr(); duke@435: static LIR_Opr exceptionPcOpr(); duke@435: static LIR_Opr divInOpr(); duke@435: static LIR_Opr divOutOpr(); duke@435: static LIR_Opr remOutOpr(); duke@435: static LIR_Opr shiftCountOpr(); duke@435: LIR_Opr syncTempOpr(); bobv@2036: LIR_Opr atomicLockOpr(); duke@435: duke@435: // returns a register suitable for saving the thread in a duke@435: // call_runtime_leaf if one is needed. duke@435: LIR_Opr getThreadTemp(); duke@435: duke@435: // visitor functionality duke@435: virtual void do_Phi (Phi* x); duke@435: virtual void do_Local (Local* x); duke@435: virtual void do_Constant (Constant* x); duke@435: virtual void do_LoadField (LoadField* x); duke@435: virtual void do_StoreField (StoreField* x); duke@435: virtual void do_ArrayLength (ArrayLength* x); duke@435: virtual void do_LoadIndexed (LoadIndexed* x); duke@435: virtual void do_StoreIndexed (StoreIndexed* x); duke@435: virtual void do_NegateOp (NegateOp* x); duke@435: virtual void do_ArithmeticOp (ArithmeticOp* x); duke@435: virtual void do_ShiftOp (ShiftOp* x); duke@435: virtual void do_LogicOp (LogicOp* x); duke@435: virtual void do_CompareOp (CompareOp* x); duke@435: virtual void do_IfOp (IfOp* x); duke@435: virtual void do_Convert (Convert* x); duke@435: virtual void do_NullCheck (NullCheck* x); duke@435: virtual void do_Invoke (Invoke* x); duke@435: virtual void do_NewInstance (NewInstance* x); duke@435: virtual void do_NewTypeArray (NewTypeArray* x); duke@435: virtual void do_NewObjectArray (NewObjectArray* x); duke@435: virtual void do_NewMultiArray (NewMultiArray* x); duke@435: virtual void do_CheckCast (CheckCast* x); duke@435: virtual void do_InstanceOf (InstanceOf* x); duke@435: virtual void do_MonitorEnter (MonitorEnter* x); duke@435: virtual void do_MonitorExit (MonitorExit* x); duke@435: virtual void do_Intrinsic (Intrinsic* x); duke@435: virtual void do_BlockBegin (BlockBegin* x); duke@435: virtual void do_Goto (Goto* x); duke@435: virtual void do_If (If* x); duke@435: virtual void do_IfInstanceOf (IfInstanceOf* x); duke@435: virtual void do_TableSwitch (TableSwitch* x); duke@435: virtual void do_LookupSwitch (LookupSwitch* x); duke@435: virtual void do_Return (Return* x); duke@435: virtual void do_Throw (Throw* x); duke@435: virtual void do_Base (Base* x); duke@435: virtual void do_OsrEntry (OsrEntry* x); duke@435: virtual void do_ExceptionObject(ExceptionObject* x); duke@435: virtual void do_RoundFP (RoundFP* x); duke@435: virtual void do_UnsafeGetRaw (UnsafeGetRaw* x); duke@435: virtual void do_UnsafePutRaw (UnsafePutRaw* x); duke@435: virtual void do_UnsafeGetObject(UnsafeGetObject* x); duke@435: virtual void do_UnsafePutObject(UnsafePutObject* x); duke@435: virtual void do_UnsafePrefetchRead (UnsafePrefetchRead* x); duke@435: virtual void do_UnsafePrefetchWrite(UnsafePrefetchWrite* x); duke@435: virtual void do_ProfileCall (ProfileCall* x); iveresov@2138: virtual void do_ProfileInvoke (ProfileInvoke* x); never@2486: virtual void do_RuntimeCall (RuntimeCall* x); duke@435: }; duke@435: duke@435: duke@435: class LIRItem: public CompilationResourceObj { duke@435: private: duke@435: Value _value; duke@435: LIRGenerator* _gen; duke@435: LIR_Opr _result; duke@435: bool _destroys_register; duke@435: LIR_Opr _new_result; duke@435: duke@435: LIRGenerator* gen() const { return _gen; } duke@435: duke@435: public: duke@435: LIRItem(Value value, LIRGenerator* gen) { duke@435: _destroys_register = false; duke@435: _gen = gen; duke@435: set_instruction(value); duke@435: } duke@435: duke@435: LIRItem(LIRGenerator* gen) { duke@435: _destroys_register = false; duke@435: _gen = gen; duke@435: _result = LIR_OprFact::illegalOpr; duke@435: set_instruction(NULL); duke@435: } duke@435: duke@435: void set_instruction(Value value) { duke@435: _value = value; duke@435: _result = LIR_OprFact::illegalOpr; duke@435: if (_value != NULL) { duke@435: _gen->walk(_value); duke@435: _result = _value->operand(); duke@435: } duke@435: _new_result = LIR_OprFact::illegalOpr; duke@435: } duke@435: duke@435: Value value() const { return _value; } duke@435: ValueType* type() const { return value()->type(); } duke@435: LIR_Opr result() { duke@435: assert(!_destroys_register || (!_result->is_register() || _result->is_virtual()), duke@435: "shouldn't use set_destroys_register with physical regsiters"); duke@435: if (_destroys_register && _result->is_register()) { duke@435: if (_new_result->is_illegal()) { duke@435: _new_result = _gen->new_register(type()); duke@435: gen()->lir()->move(_result, _new_result); duke@435: } duke@435: return _new_result; duke@435: } else { duke@435: return _result; duke@435: } duke@435: return _result; duke@435: } duke@435: duke@435: void set_result(LIR_Opr opr); duke@435: duke@435: void load_item(); duke@435: void load_byte_item(); duke@435: void load_nonconstant(); duke@435: // load any values which can't be expressed as part of a single store instruction duke@435: void load_for_store(BasicType store_type); duke@435: void load_item_force(LIR_Opr reg); duke@435: duke@435: void dont_load_item() { duke@435: // do nothing duke@435: } duke@435: duke@435: void set_destroys_register() { duke@435: _destroys_register = true; duke@435: } duke@435: duke@435: bool is_constant() const { return value()->as_Constant() != NULL; } duke@435: bool is_stack() { return result()->is_stack(); } duke@435: bool is_register() { return result()->is_register(); } duke@435: duke@435: ciObject* get_jobject_constant() const; duke@435: jint get_jint_constant() const; duke@435: jlong get_jlong_constant() const; duke@435: jfloat get_jfloat_constant() const; duke@435: jdouble get_jdouble_constant() const; duke@435: jint get_address_constant() const; duke@435: }; stefank@2314: stefank@2314: #endif // SHARE_VM_C1_C1_LIRGENERATOR_HPP