1 /* 2 * Copyright (c) 2005, 2018, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_C1_C1_LIRGENERATOR_HPP 26 #define SHARE_VM_C1_C1_LIRGENERATOR_HPP 27 28 #include "c1/c1_Decorators.hpp" 29 #include "c1/c1_Instruction.hpp" 30 #include "c1/c1_LIR.hpp" 31 #include "ci/ciMethodData.hpp" 32 #include "gc/shared/barrierSet.hpp" 33 #include "jfr/support/jfrIntrinsics.hpp" 34 #include "utilities/macros.hpp" 35 #include "utilities/sizes.hpp" 36 37 class BarrierSetC1; 38 39 // The classes responsible for code emission and register allocation 40 41 42 class LIRGenerator; 43 class LIREmitter; 44 class Invoke; 45 class SwitchRange; 46 class LIRItem; 47 48 typedef GrowableArray<LIRItem*> LIRItemList; 49 50 class SwitchRange: public CompilationResourceObj { 51 private: 52 int _low_key; 53 int _high_key; 54 BlockBegin* _sux; 55 public: 56 SwitchRange(int start_key, BlockBegin* sux): _low_key(start_key), _high_key(start_key), _sux(sux) {} 57 void set_high_key(int key) { _high_key = key; } 58 59 int high_key() const { return _high_key; } 60 int low_key() const { return _low_key; } 61 BlockBegin* sux() const { return _sux; } 62 }; 63 64 typedef GrowableArray<SwitchRange*> SwitchRangeArray; 65 typedef GrowableArray<SwitchRange*> SwitchRangeList; 66 67 class ResolveNode; 68 69 typedef GrowableArray<ResolveNode*> NodeList; 70 71 // Node objects form a directed graph of LIR_Opr 72 // Edges between Nodes represent moves from one Node to its destinations 73 class ResolveNode: public CompilationResourceObj { 74 private: 75 LIR_Opr _operand; // the source or destinaton 76 NodeList _destinations; // for the operand 77 bool _assigned; // Value assigned to this Node? 78 bool _visited; // Node already visited? 79 bool _start_node; // Start node already visited? 80 81 public: 82 ResolveNode(LIR_Opr operand) 83 : _operand(operand) 84 , _assigned(false) 85 , _visited(false) 86 , _start_node(false) {}; 87 88 // accessors 89 LIR_Opr operand() const { return _operand; } 90 int no_of_destinations() const { return _destinations.length(); } 91 ResolveNode* destination_at(int i) { return _destinations.at(i); } 92 bool assigned() const { return _assigned; } 93 bool visited() const { return _visited; } 94 bool start_node() const { return _start_node; } 95 96 // modifiers 97 void append(ResolveNode* dest) { _destinations.append(dest); } 98 void set_assigned() { _assigned = true; } 99 void set_visited() { _visited = true; } 100 void set_start_node() { _start_node = true; } 101 }; 102 103 104 // This is shared state to be used by the PhiResolver so the operand 105 // arrays don't have to be reallocated for reach resolution. 106 class PhiResolverState: public CompilationResourceObj { 107 friend class PhiResolver; 108 109 private: 110 NodeList _virtual_operands; // Nodes where the operand is a virtual register 111 NodeList _other_operands; // Nodes where the operand is not a virtual register 112 NodeList _vreg_table; // Mapping from virtual register to Node 113 114 public: 115 PhiResolverState() {} 116 117 void reset(int max_vregs); 118 }; 119 120 121 // class used to move value of phi operand to phi function 122 class PhiResolver: public CompilationResourceObj { 123 private: 124 LIRGenerator* _gen; 125 PhiResolverState& _state; // temporary state cached by LIRGenerator 126 127 ResolveNode* _loop; 128 LIR_Opr _temp; 129 130 // access to shared state arrays 131 NodeList& virtual_operands() { return _state._virtual_operands; } 132 NodeList& other_operands() { return _state._other_operands; } 133 NodeList& vreg_table() { return _state._vreg_table; } 134 135 ResolveNode* create_node(LIR_Opr opr, bool source); 136 ResolveNode* source_node(LIR_Opr opr) { return create_node(opr, true); } 137 ResolveNode* destination_node(LIR_Opr opr) { return create_node(opr, false); } 138 139 void emit_move(LIR_Opr src, LIR_Opr dest); 140 void move_to_temp(LIR_Opr src); 141 void move_temp_to(LIR_Opr dest); 142 void move(ResolveNode* src, ResolveNode* dest); 143 144 LIRGenerator* gen() { 145 return _gen; 146 } 147 148 public: 149 PhiResolver(LIRGenerator* _lir_gen, int max_vregs); 150 ~PhiResolver(); 151 152 void move(LIR_Opr src, LIR_Opr dest); 153 }; 154 155 156 // only the classes below belong in the same file 157 class LIRGenerator: public InstructionVisitor, public BlockClosure { 158 // LIRGenerator should never get instatiated on the heap. 159 private: 160 void* operator new(size_t size) throw(); 161 void* operator new[](size_t size) throw(); 162 void operator delete(void* p) { ShouldNotReachHere(); } 163 void operator delete[](void* p) { ShouldNotReachHere(); } 164 165 Compilation* _compilation; 166 ciMethod* _method; // method that we are compiling 167 PhiResolverState _resolver_state; 168 BlockBegin* _block; 169 int _virtual_register_number; 170 Values _instruction_for_operand; 171 BitMap2D _vreg_flags; // flags which can be set on a per-vreg basis 172 LIR_List* _lir; 173 174 LIRGenerator* gen() { 175 return this; 176 } 177 178 void print_if_not_loaded(const NewInstance* new_instance) PRODUCT_RETURN; 179 180 public: 181 #ifdef ASSERT 182 LIR_List* lir(const char * file, int line) const { 183 _lir->set_file_and_line(file, line); 184 return _lir; 185 } 186 #endif 187 LIR_List* lir() const { 188 return _lir; 189 } 190 191 private: 192 // a simple cache of constants used within a block 193 GrowableArray<LIR_Const*> _constants; 194 LIR_OprList _reg_for_constants; 195 Values _unpinned_constants; 196 197 friend class PhiResolver; 198 199 public: 200 // unified bailout support 201 void bailout(const char* msg) const { compilation()->bailout(msg); } 202 bool bailed_out() const { return compilation()->bailed_out(); } 203 204 void block_do_prolog(BlockBegin* block); 205 void block_do_epilog(BlockBegin* block); 206 207 // register allocation 208 LIR_Opr rlock(Value instr); // lock a free register 209 LIR_Opr rlock_result(Value instr); 210 LIR_Opr rlock_result(Value instr, BasicType type); 211 LIR_Opr rlock_byte(BasicType type); 212 LIR_Opr rlock_callee_saved(BasicType type); 213 214 // get a constant into a register and get track of what register was used 215 LIR_Opr load_constant(Constant* x); 216 LIR_Opr load_constant(LIR_Const* constant); 217 218 // Given an immediate value, return an operand usable in logical ops. 219 LIR_Opr load_immediate(int x, BasicType type); 220 221 void set_result(Value x, LIR_Opr opr) { 222 assert(opr->is_valid(), "must set to valid value"); 223 assert(x->operand()->is_illegal(), "operand should never change"); 224 assert(!opr->is_register() || opr->is_virtual(), "should never set result to a physical register"); 225 x->set_operand(opr); 226 assert(opr == x->operand(), "must be"); 227 if (opr->is_virtual()) { 228 _instruction_for_operand.at_put_grow(opr->vreg_number(), x, NULL); 229 } 230 } 231 void set_no_result(Value x) { assert(!x->has_uses(), "can't have use"); x->clear_operand(); } 232 233 friend class LIRItem; 234 235 LIR_Opr round_item(LIR_Opr opr); 236 LIR_Opr force_to_spill(LIR_Opr value, BasicType t); 237 238 PhiResolverState& resolver_state() { return _resolver_state; } 239 240 void move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val); 241 void move_to_phi(ValueStack* cur_state); 242 243 // platform dependent 244 LIR_Opr getThreadPointer(); 245 246 private: 247 // code emission 248 void do_ArithmeticOp_Long(ArithmeticOp* x); 249 void do_ArithmeticOp_Int (ArithmeticOp* x); 250 void do_ArithmeticOp_FPU (ArithmeticOp* x); 251 252 void do_RegisterFinalizer(Intrinsic* x); 253 void do_isInstance(Intrinsic* x); 254 void do_isPrimitive(Intrinsic* x); 255 void do_getClass(Intrinsic* x); 256 void do_currentThread(Intrinsic* x); 257 void do_FmaIntrinsic(Intrinsic* x); 258 void do_MathIntrinsic(Intrinsic* x); 259 void do_LibmIntrinsic(Intrinsic* x); 260 void do_ArrayCopy(Intrinsic* x); 261 void do_CompareAndSwap(Intrinsic* x, ValueType* type); 262 void do_NIOCheckIndex(Intrinsic* x); 263 void do_FPIntrinsics(Intrinsic* x); 264 void do_Reference_get(Intrinsic* x); 265 void do_update_CRC32(Intrinsic* x); 266 void do_update_CRC32C(Intrinsic* x); 267 void do_vectorizedMismatch(Intrinsic* x); 268 269 public: 270 LIR_Opr call_runtime(BasicTypeArray* signature, LIRItemList* args, address entry, ValueType* result_type, CodeEmitInfo* info); 271 LIR_Opr call_runtime(BasicTypeArray* signature, LIR_OprList* args, address entry, ValueType* result_type, CodeEmitInfo* info); 272 273 // convenience functions 274 LIR_Opr call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info); 275 LIR_Opr call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info); 276 277 // Access API 278 279 private: 280 BarrierSetC1 *_barrier_set; 281 282 public: 283 void access_store_at(DecoratorSet decorators, BasicType type, 284 LIRItem& base, LIR_Opr offset, LIR_Opr value, 285 CodeEmitInfo* patch_info = NULL, CodeEmitInfo* store_emit_info = NULL); 286 287 void access_load_at(DecoratorSet decorators, BasicType type, 288 LIRItem& base, LIR_Opr offset, LIR_Opr result, 289 CodeEmitInfo* patch_info = NULL, CodeEmitInfo* load_emit_info = NULL); 290 291 void access_load(DecoratorSet decorators, BasicType type, 292 LIR_Opr addr, LIR_Opr result); 293 294 LIR_Opr access_atomic_cmpxchg_at(DecoratorSet decorators, BasicType type, 295 LIRItem& base, LIRItem& offset, LIRItem& cmp_value, LIRItem& new_value); 296 297 LIR_Opr access_atomic_xchg_at(DecoratorSet decorators, BasicType type, 298 LIRItem& base, LIRItem& offset, LIRItem& value); 299 300 LIR_Opr access_atomic_add_at(DecoratorSet decorators, BasicType type, 301 LIRItem& base, LIRItem& offset, LIRItem& value); 302 303 // These need to guarantee JMM volatile semantics are preserved on each platform 304 // and requires one implementation per architecture. 305 LIR_Opr atomic_cmpxchg(BasicType type, LIR_Opr addr, LIRItem& cmp_value, LIRItem& new_value); 306 LIR_Opr atomic_xchg(BasicType type, LIR_Opr addr, LIRItem& new_value); 307 LIR_Opr atomic_add(BasicType type, LIR_Opr addr, LIRItem& new_value); 308 309 #ifdef CARDTABLEBARRIERSET_POST_BARRIER_HELPER 310 virtual void CardTableBarrierSet_post_barrier_helper(LIR_OprDesc* addr, LIR_Const* card_table_base); 311 #endif 312 313 // specific implementations 314 void array_store_check(LIR_Opr value, LIR_Opr array, CodeEmitInfo* store_check_info, ciMethod* profiled_method, int profiled_bci); 315 316 static LIR_Opr result_register_for(ValueType* type, bool callee = false); 317 318 ciObject* get_jobject_constant(Value value); 319 320 LIRItemList* invoke_visit_arguments(Invoke* x); 321 void invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list); 322 323 void trace_block_entry(BlockBegin* block); 324 325 // volatile field operations are never patchable because a klass 326 // must be loaded to know it's volatile which means that the offset 327 // it always known as well. 328 void volatile_field_store(LIR_Opr value, LIR_Address* address, CodeEmitInfo* info); 329 void volatile_field_load(LIR_Address* address, LIR_Opr result, CodeEmitInfo* info); 330 331 void put_Object_unsafe(LIR_Opr src, LIR_Opr offset, LIR_Opr data, BasicType type, bool is_volatile); 332 void get_Object_unsafe(LIR_Opr dest, LIR_Opr src, LIR_Opr offset, BasicType type, bool is_volatile); 333 334 void arithmetic_call_op (Bytecodes::Code code, LIR_Opr result, LIR_OprList* args); 335 336 void increment_counter(address counter, BasicType type, int step = 1); 337 void increment_counter(LIR_Address* addr, int step = 1); 338 339 // is_strictfp is only needed for mul and div (and only generates different code on i486) 340 void arithmetic_op(Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, bool is_strictfp, LIR_Opr tmp, CodeEmitInfo* info = NULL); 341 // machine dependent. returns true if it emitted code for the multiply 342 bool strength_reduce_multiply(LIR_Opr left, jint constant, LIR_Opr result, LIR_Opr tmp); 343 344 void store_stack_parameter (LIR_Opr opr, ByteSize offset_from_sp_in_bytes); 345 346 void klass2reg_with_patching(LIR_Opr r, ciMetadata* obj, CodeEmitInfo* info, bool need_resolve = false); 347 348 // this loads the length and compares against the index 349 void array_range_check (LIR_Opr array, LIR_Opr index, CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info); 350 // For java.nio.Buffer.checkIndex 351 void nio_range_check (LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info); 352 353 void arithmetic_op_int (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp); 354 void arithmetic_op_long (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info = NULL); 355 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); 356 357 void shift_op (Bytecodes::Code code, LIR_Opr dst_reg, LIR_Opr value, LIR_Opr count, LIR_Opr tmp); 358 359 void logic_op (Bytecodes::Code code, LIR_Opr dst_reg, LIR_Opr left, LIR_Opr right); 360 361 void monitor_enter (LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no, CodeEmitInfo* info_for_exception, CodeEmitInfo* info); 362 void monitor_exit (LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no); 363 364 void new_instance (LIR_Opr dst, ciInstanceKlass* klass, bool is_unresolved, LIR_Opr scratch1, LIR_Opr scratch2, LIR_Opr scratch3, LIR_Opr scratch4, LIR_Opr klass_reg, CodeEmitInfo* info); 365 366 // machine dependent 367 void cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info); 368 void cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, int disp, BasicType type, CodeEmitInfo* info); 369 370 void arraycopy_helper(Intrinsic* x, int* flags, ciArrayKlass** expected_type); 371 372 // returns a LIR_Address to address an array location. May also 373 // emit some code as part of address calculation. If 374 // needs_card_mark is true then compute the full address for use by 375 // both the store and the card mark. 376 LIR_Address* generate_address(LIR_Opr base, 377 LIR_Opr index, int shift, 378 int disp, 379 BasicType type); 380 LIR_Address* generate_address(LIR_Opr base, int disp, BasicType type) { 381 return generate_address(base, LIR_OprFact::illegalOpr, 0, disp, type); 382 } 383 LIR_Address* emit_array_address(LIR_Opr array_opr, LIR_Opr index_opr, BasicType type); 384 385 // the helper for generate_address 386 void add_large_constant(LIR_Opr src, int c, LIR_Opr dest); 387 388 // machine preferences and characteristics 389 bool can_inline_as_constant(Value i S390_ONLY(COMMA int bits = 20)) const; 390 bool can_inline_as_constant(LIR_Const* c) const; 391 bool can_store_as_constant(Value i, BasicType type) const; 392 393 LIR_Opr safepoint_poll_register(); 394 395 void profile_branch(If* if_instr, If::Condition cond); 396 void increment_event_counter_impl(CodeEmitInfo* info, 397 ciMethod *method, LIR_Opr step, int frequency, 398 int bci, bool backedge, bool notify); 399 void increment_event_counter(CodeEmitInfo* info, LIR_Opr step, int bci, bool backedge); 400 void increment_invocation_counter(CodeEmitInfo *info) { 401 if (compilation()->count_invocations()) { 402 increment_event_counter(info, LIR_OprFact::intConst(InvocationCounter::count_increment), InvocationEntryBci, false); 403 } 404 } 405 void increment_backedge_counter(CodeEmitInfo* info, int bci) { 406 if (compilation()->count_backedges()) { 407 increment_event_counter(info, LIR_OprFact::intConst(InvocationCounter::count_increment), bci, true); 408 } 409 } 410 void increment_backedge_counter_conditionally(LIR_Condition cond, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info, int left_bci, int right_bci, int bci); 411 void increment_backedge_counter(CodeEmitInfo* info, LIR_Opr step, int bci) { 412 if (compilation()->count_backedges()) { 413 increment_event_counter(info, step, bci, true); 414 } 415 } 416 void decrement_age(CodeEmitInfo* info); 417 CodeEmitInfo* state_for(Instruction* x, ValueStack* state, bool ignore_xhandler = false); 418 CodeEmitInfo* state_for(Instruction* x); 419 420 // allocates a virtual register for this instruction if 421 // one isn't already allocated. Only for Phi and Local. 422 LIR_Opr operand_for_instruction(Instruction *x); 423 424 void set_block(BlockBegin* block) { _block = block; } 425 426 void block_prolog(BlockBegin* block); 427 void block_epilog(BlockBegin* block); 428 429 void do_root (Instruction* instr); 430 void walk (Instruction* instr); 431 432 void bind_block_entry(BlockBegin* block); 433 void start_block(BlockBegin* block); 434 435 LIR_Opr new_register(BasicType type); 436 LIR_Opr new_register(Value value) { return new_register(as_BasicType(value->type())); } 437 LIR_Opr new_register(ValueType* type) { return new_register(as_BasicType(type)); } 438 439 // returns a register suitable for doing pointer math 440 LIR_Opr new_pointer_register() { 441 #ifdef _LP64 442 return new_register(T_LONG); 443 #else 444 return new_register(T_INT); 445 #endif 446 } 447 448 static LIR_Condition lir_cond(If::Condition cond) { 449 LIR_Condition l = lir_cond_unknown; 450 switch (cond) { 451 case If::eql: l = lir_cond_equal; break; 452 case If::neq: l = lir_cond_notEqual; break; 453 case If::lss: l = lir_cond_less; break; 454 case If::leq: l = lir_cond_lessEqual; break; 455 case If::geq: l = lir_cond_greaterEqual; break; 456 case If::gtr: l = lir_cond_greater; break; 457 case If::aeq: l = lir_cond_aboveEqual; break; 458 case If::beq: l = lir_cond_belowEqual; break; 459 default: fatal("You must pass valid If::Condition"); 460 }; 461 return l; 462 } 463 464 #ifdef __SOFTFP__ 465 void do_soft_float_compare(If *x); 466 #endif // __SOFTFP__ 467 468 SwitchRangeArray* create_lookup_ranges(TableSwitch* x); 469 SwitchRangeArray* create_lookup_ranges(LookupSwitch* x); 470 void do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux); 471 472 #ifdef JFR_HAVE_INTRINSICS 473 void do_ClassIDIntrinsic(Intrinsic* x); 474 void do_getEventWriter(Intrinsic* x); 475 #endif 476 477 void do_RuntimeCall(address routine, Intrinsic* x); 478 479 ciKlass* profile_type(ciMethodData* md, int md_first_offset, int md_offset, intptr_t profiled_k, 480 Value arg, LIR_Opr& mdp, bool not_null, ciKlass* signature_at_call_k, 481 ciKlass* callee_signature_k); 482 void profile_arguments(ProfileCall* x); 483 void profile_parameters(Base* x); 484 void profile_parameters_at_call(ProfileCall* x); 485 LIR_Opr mask_boolean(LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info); 486 LIR_Opr maybe_mask_boolean(StoreIndexed* x, LIR_Opr array, LIR_Opr value, CodeEmitInfo*& null_check_info); 487 488 public: 489 Compilation* compilation() const { return _compilation; } 490 FrameMap* frame_map() const { return _compilation->frame_map(); } 491 ciMethod* method() const { return _method; } 492 BlockBegin* block() const { return _block; } 493 IRScope* scope() const { return block()->scope(); } 494 495 int max_virtual_register_number() const { return _virtual_register_number; } 496 497 void block_do(BlockBegin* block); 498 499 // Flags that can be set on vregs 500 enum VregFlag { 501 must_start_in_memory = 0 // needs to be assigned a memory location at beginning, but may then be loaded in a register 502 , callee_saved = 1 // must be in a callee saved register 503 , byte_reg = 2 // must be in a byte register 504 , num_vreg_flags 505 506 }; 507 508 LIRGenerator(Compilation* compilation, ciMethod* method) 509 : _compilation(compilation) 510 , _method(method) 511 , _virtual_register_number(LIR_OprDesc::vreg_base) 512 , _vreg_flags(num_vreg_flags) 513 , _barrier_set(BarrierSet::barrier_set()->barrier_set_c1()) { 514 } 515 516 // for virtual registers, maps them back to Phi's or Local's 517 Instruction* instruction_for_opr(LIR_Opr opr); 518 Instruction* instruction_for_vreg(int reg_num); 519 520 void set_vreg_flag (int vreg_num, VregFlag f); 521 bool is_vreg_flag_set(int vreg_num, VregFlag f); 522 void set_vreg_flag (LIR_Opr opr, VregFlag f) { set_vreg_flag(opr->vreg_number(), f); } 523 bool is_vreg_flag_set(LIR_Opr opr, VregFlag f) { return is_vreg_flag_set(opr->vreg_number(), f); } 524 525 // statics 526 static LIR_Opr exceptionOopOpr(); 527 static LIR_Opr exceptionPcOpr(); 528 static LIR_Opr divInOpr(); 529 static LIR_Opr divOutOpr(); 530 static LIR_Opr remOutOpr(); 531 #ifdef S390 532 // On S390 we can do ldiv, lrem without RT call. 533 static LIR_Opr ldivInOpr(); 534 static LIR_Opr ldivOutOpr(); 535 static LIR_Opr lremOutOpr(); 536 #endif 537 static LIR_Opr shiftCountOpr(); 538 LIR_Opr syncLockOpr(); 539 LIR_Opr syncTempOpr(); 540 LIR_Opr atomicLockOpr(); 541 542 // returns a register suitable for saving the thread in a 543 // call_runtime_leaf if one is needed. 544 LIR_Opr getThreadTemp(); 545 546 // visitor functionality 547 virtual void do_Phi (Phi* x); 548 virtual void do_Local (Local* x); 549 virtual void do_Constant (Constant* x); 550 virtual void do_LoadField (LoadField* x); 551 virtual void do_StoreField (StoreField* x); 552 virtual void do_ArrayLength (ArrayLength* x); 553 virtual void do_LoadIndexed (LoadIndexed* x); 554 virtual void do_StoreIndexed (StoreIndexed* x); 555 virtual void do_NegateOp (NegateOp* x); 556 virtual void do_ArithmeticOp (ArithmeticOp* x); 557 virtual void do_ShiftOp (ShiftOp* x); 558 virtual void do_LogicOp (LogicOp* x); 559 virtual void do_CompareOp (CompareOp* x); 560 virtual void do_IfOp (IfOp* x); 561 virtual void do_Convert (Convert* x); 562 virtual void do_NullCheck (NullCheck* x); 563 virtual void do_TypeCast (TypeCast* x); 564 virtual void do_Invoke (Invoke* x); 565 virtual void do_NewInstance (NewInstance* x); 566 virtual void do_NewTypeArray (NewTypeArray* x); 567 virtual void do_NewObjectArray (NewObjectArray* x); 568 virtual void do_NewMultiArray (NewMultiArray* x); 569 virtual void do_CheckCast (CheckCast* x); 570 virtual void do_InstanceOf (InstanceOf* x); 571 virtual void do_MonitorEnter (MonitorEnter* x); 572 virtual void do_MonitorExit (MonitorExit* x); 573 virtual void do_Intrinsic (Intrinsic* x); 574 virtual void do_BlockBegin (BlockBegin* x); 575 virtual void do_Goto (Goto* x); 576 virtual void do_If (If* x); 577 virtual void do_IfInstanceOf (IfInstanceOf* x); 578 virtual void do_TableSwitch (TableSwitch* x); 579 virtual void do_LookupSwitch (LookupSwitch* x); 580 virtual void do_Return (Return* x); 581 virtual void do_Throw (Throw* x); 582 virtual void do_Base (Base* x); 583 virtual void do_OsrEntry (OsrEntry* x); 584 virtual void do_ExceptionObject(ExceptionObject* x); 585 virtual void do_RoundFP (RoundFP* x); 586 virtual void do_UnsafeGetRaw (UnsafeGetRaw* x); 587 virtual void do_UnsafePutRaw (UnsafePutRaw* x); 588 virtual void do_UnsafeGetObject(UnsafeGetObject* x); 589 virtual void do_UnsafePutObject(UnsafePutObject* x); 590 virtual void do_UnsafeGetAndSetObject(UnsafeGetAndSetObject* x); 591 virtual void do_ProfileCall (ProfileCall* x); 592 virtual void do_ProfileReturnType (ProfileReturnType* x); 593 virtual void do_ProfileInvoke (ProfileInvoke* x); 594 virtual void do_RuntimeCall (RuntimeCall* x); 595 virtual void do_MemBar (MemBar* x); 596 virtual void do_RangeCheckPredicate(RangeCheckPredicate* x); 597 #ifdef ASSERT 598 virtual void do_Assert (Assert* x); 599 #endif 600 601 #ifdef C1_LIRGENERATOR_MD_HPP 602 #include C1_LIRGENERATOR_MD_HPP 603 #endif 604 }; 605 606 607 class LIRItem: public CompilationResourceObj { 608 private: 609 Value _value; 610 LIRGenerator* _gen; 611 LIR_Opr _result; 612 bool _destroys_register; 613 LIR_Opr _new_result; 614 615 LIRGenerator* gen() const { return _gen; } 616 617 public: 618 LIRItem(Value value, LIRGenerator* gen) { 619 _destroys_register = false; 620 _gen = gen; 621 set_instruction(value); 622 } 623 624 LIRItem(LIRGenerator* gen) { 625 _destroys_register = false; 626 _gen = gen; 627 _result = LIR_OprFact::illegalOpr; 628 set_instruction(NULL); 629 } 630 631 void set_instruction(Value value) { 632 _value = value; 633 _result = LIR_OprFact::illegalOpr; 634 if (_value != NULL) { 635 _gen->walk(_value); 636 _result = _value->operand(); 637 } 638 _new_result = LIR_OprFact::illegalOpr; 639 } 640 641 Value value() const { return _value; } 642 ValueType* type() const { return value()->type(); } 643 LIR_Opr result() { 644 assert(!_destroys_register || (!_result->is_register() || _result->is_virtual()), 645 "shouldn't use set_destroys_register with physical regsiters"); 646 if (_destroys_register && _result->is_register()) { 647 if (_new_result->is_illegal()) { 648 _new_result = _gen->new_register(type()); 649 gen()->lir()->move(_result, _new_result); 650 } 651 return _new_result; 652 } else { 653 return _result; 654 } 655 return _result; 656 } 657 658 void set_result(LIR_Opr opr); 659 660 void load_item(); 661 void load_byte_item(); 662 void load_nonconstant(S390_ONLY(int bits = 20)); 663 // load any values which can't be expressed as part of a single store instruction 664 void load_for_store(BasicType store_type); 665 void load_item_force(LIR_Opr reg); 666 667 void dont_load_item() { 668 // do nothing 669 } 670 671 void set_destroys_register() { 672 _destroys_register = true; 673 } 674 675 bool is_constant() const { return value()->as_Constant() != NULL; } 676 bool is_stack() { return result()->is_stack(); } 677 bool is_register() { return result()->is_register(); } 678 679 ciObject* get_jobject_constant() const; 680 jint get_jint_constant() const; 681 jlong get_jlong_constant() const; 682 jfloat get_jfloat_constant() const; 683 jdouble get_jdouble_constant() const; 684 jint get_address_constant() const; 685 }; 686 687 #endif // SHARE_VM_C1_C1_LIRGENERATOR_HPP