Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/c1/c1_LIRGenerator.hpp@a61af66fc99e (annotated)

src/share/vm/c1/c1_LIRGenerator.hpp

Sat, 01 Dec 2007 00:00:00 +0000

author
duke
date
Sat, 01 Dec 2007 00:00:00 +0000
changeset 435
a61af66fc99e
child 777
37f87013dfd8
permissions
-rw-r--r--

Initial load

duke@435 1 /*
duke@435 2 * Copyright 2005-2006 Sun Microsystems, Inc. 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 *
duke@435 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435 21 * have any questions.
duke@435 22 *
duke@435 23 */
duke@435 24
duke@435 25 // The classes responsible for code emission and register allocation
duke@435 26
duke@435 27
duke@435 28 class LIRGenerator;
duke@435 29 class LIREmitter;
duke@435 30 class Invoke;
duke@435 31 class SwitchRange;
duke@435 32 class LIRItem;
duke@435 33
duke@435 34 define_array(LIRItemArray, LIRItem*)
duke@435 35 define_stack(LIRItemList, LIRItemArray)
duke@435 36
duke@435 37 class SwitchRange: public CompilationResourceObj {
duke@435 38 private:
duke@435 39 int _low_key;
duke@435 40 int _high_key;
duke@435 41 BlockBegin* _sux;
duke@435 42 public:
duke@435 43 SwitchRange(int start_key, BlockBegin* sux): _low_key(start_key), _high_key(start_key), _sux(sux) {}
duke@435 44 void set_high_key(int key) { _high_key = key; }
duke@435 45
duke@435 46 int high_key() const { return _high_key; }
duke@435 47 int low_key() const { return _low_key; }
duke@435 48 BlockBegin* sux() const { return _sux; }
duke@435 49 };
duke@435 50
duke@435 51 define_array(SwitchRangeArray, SwitchRange*)
duke@435 52 define_stack(SwitchRangeList, SwitchRangeArray)
duke@435 53
duke@435 54
duke@435 55 class ResolveNode;
duke@435 56
duke@435 57 define_array(NodeArray, ResolveNode*);
duke@435 58 define_stack(NodeList, NodeArray);
duke@435 59
duke@435 60
duke@435 61 // Node objects form a directed graph of LIR_Opr
duke@435 62 // Edges between Nodes represent moves from one Node to its destinations
duke@435 63 class ResolveNode: public CompilationResourceObj {
duke@435 64 private:
duke@435 65 LIR_Opr _operand; // the source or destinaton
duke@435 66 NodeList _destinations; // for the operand
duke@435 67 bool _assigned; // Value assigned to this Node?
duke@435 68 bool _visited; // Node already visited?
duke@435 69 bool _start_node; // Start node already visited?
duke@435 70
duke@435 71 public:
duke@435 72 ResolveNode(LIR_Opr operand)
duke@435 73 : _operand(operand)
duke@435 74 , _assigned(false)
duke@435 75 , _visited(false)
duke@435 76 , _start_node(false) {};
duke@435 77
duke@435 78 // accessors
duke@435 79 LIR_Opr operand() const { return _operand; }
duke@435 80 int no_of_destinations() const { return _destinations.length(); }
duke@435 81 ResolveNode* destination_at(int i) { return _destinations[i]; }
duke@435 82 bool assigned() const { return _assigned; }
duke@435 83 bool visited() const { return _visited; }
duke@435 84 bool start_node() const { return _start_node; }
duke@435 85
duke@435 86 // modifiers
duke@435 87 void append(ResolveNode* dest) { _destinations.append(dest); }
duke@435 88 void set_assigned() { _assigned = true; }
duke@435 89 void set_visited() { _visited = true; }
duke@435 90 void set_start_node() { _start_node = true; }
duke@435 91 };
duke@435 92
duke@435 93
duke@435 94 // This is shared state to be used by the PhiResolver so the operand
duke@435 95 // arrays don't have to be reallocated for reach resolution.
duke@435 96 class PhiResolverState: public CompilationResourceObj {
duke@435 97 friend class PhiResolver;
duke@435 98
duke@435 99 private:
duke@435 100 NodeList _virtual_operands; // Nodes where the operand is a virtual register
duke@435 101 NodeList _other_operands; // Nodes where the operand is not a virtual register
duke@435 102 NodeList _vreg_table; // Mapping from virtual register to Node
duke@435 103
duke@435 104 public:
duke@435 105 PhiResolverState() {}
duke@435 106
duke@435 107 void reset(int max_vregs);
duke@435 108 };
duke@435 109
duke@435 110
duke@435 111 // class used to move value of phi operand to phi function
duke@435 112 class PhiResolver: public CompilationResourceObj {
duke@435 113 private:
duke@435 114 LIRGenerator* _gen;
duke@435 115 PhiResolverState& _state; // temporary state cached by LIRGenerator
duke@435 116
duke@435 117 ResolveNode* _loop;
duke@435 118 LIR_Opr _temp;
duke@435 119
duke@435 120 // access to shared state arrays
duke@435 121 NodeList& virtual_operands() { return _state._virtual_operands; }
duke@435 122 NodeList& other_operands() { return _state._other_operands; }
duke@435 123 NodeList& vreg_table() { return _state._vreg_table; }
duke@435 124
duke@435 125 ResolveNode* create_node(LIR_Opr opr, bool source);
duke@435 126 ResolveNode* source_node(LIR_Opr opr) { return create_node(opr, true); }
duke@435 127 ResolveNode* destination_node(LIR_Opr opr) { return create_node(opr, false); }
duke@435 128
duke@435 129 void emit_move(LIR_Opr src, LIR_Opr dest);
duke@435 130 void move_to_temp(LIR_Opr src);
duke@435 131 void move_temp_to(LIR_Opr dest);
duke@435 132 void move(ResolveNode* src, ResolveNode* dest);
duke@435 133
duke@435 134 LIRGenerator* gen() {
duke@435 135 return _gen;
duke@435 136 }
duke@435 137
duke@435 138 public:
duke@435 139 PhiResolver(LIRGenerator* _lir_gen, int max_vregs);
duke@435 140 ~PhiResolver();
duke@435 141
duke@435 142 void move(LIR_Opr src, LIR_Opr dest);
duke@435 143 };
duke@435 144
duke@435 145
duke@435 146 // only the classes below belong in the same file
duke@435 147 class LIRGenerator: public InstructionVisitor, public BlockClosure {
duke@435 148 private:
duke@435 149 Compilation* _compilation;
duke@435 150 ciMethod* _method; // method that we are compiling
duke@435 151 PhiResolverState _resolver_state;
duke@435 152 BlockBegin* _block;
duke@435 153 int _virtual_register_number;
duke@435 154 Values _instruction_for_operand;
duke@435 155 BitMap2D _vreg_flags; // flags which can be set on a per-vreg basis
duke@435 156 LIR_List* _lir;
duke@435 157
duke@435 158 LIRGenerator* gen() {
duke@435 159 return this;
duke@435 160 }
duke@435 161
duke@435 162 #ifdef ASSERT
duke@435 163 LIR_List* lir(const char * file, int line) const {
duke@435 164 _lir->set_file_and_line(file, line);
duke@435 165 return _lir;
duke@435 166 }
duke@435 167 #endif
duke@435 168 LIR_List* lir() const {
duke@435 169 return _lir;
duke@435 170 }
duke@435 171
duke@435 172 // a simple cache of constants used within a block
duke@435 173 GrowableArray<LIR_Const*> _constants;
duke@435 174 LIR_OprList _reg_for_constants;
duke@435 175 Values _unpinned_constants;
duke@435 176
duke@435 177 LIR_Const* _card_table_base;
duke@435 178
duke@435 179 friend class PhiResolver;
duke@435 180
duke@435 181 // unified bailout support
duke@435 182 void bailout(const char* msg) const { compilation()->bailout(msg); }
duke@435 183 bool bailed_out() const { return compilation()->bailed_out(); }
duke@435 184
duke@435 185 void block_do_prolog(BlockBegin* block);
duke@435 186 void block_do_epilog(BlockBegin* block);
duke@435 187
duke@435 188 // register allocation
duke@435 189 LIR_Opr rlock(Value instr); // lock a free register
duke@435 190 LIR_Opr rlock_result(Value instr);
duke@435 191 LIR_Opr rlock_result(Value instr, BasicType type);
duke@435 192 LIR_Opr rlock_byte(BasicType type);
duke@435 193 LIR_Opr rlock_callee_saved(BasicType type);
duke@435 194
duke@435 195 // get a constant into a register and get track of what register was used
duke@435 196 LIR_Opr load_constant(Constant* x);
duke@435 197 LIR_Opr load_constant(LIR_Const* constant);
duke@435 198
duke@435 199 LIR_Const* card_table_base() const { return _card_table_base; }
duke@435 200
duke@435 201 void set_result(Value x, LIR_Opr opr) {
duke@435 202 assert(opr->is_valid(), "must set to valid value");
duke@435 203 assert(x->operand()->is_illegal(), "operand should never change");
duke@435 204 assert(!opr->is_register() || opr->is_virtual(), "should never set result to a physical register");
duke@435 205 x->set_operand(opr);
duke@435 206 assert(opr == x->operand(), "must be");
duke@435 207 if (opr->is_virtual()) {
duke@435 208 _instruction_for_operand.at_put_grow(opr->vreg_number(), x, NULL);
duke@435 209 }
duke@435 210 }
duke@435 211 void set_no_result(Value x) { assert(!x->has_uses(), "can't have use"); x->clear_operand(); }
duke@435 212
duke@435 213 friend class LIRItem;
duke@435 214
duke@435 215 LIR_Opr round_item(LIR_Opr opr);
duke@435 216 LIR_Opr force_to_spill(LIR_Opr value, BasicType t);
duke@435 217
duke@435 218 void profile_branch(If* if_instr, If::Condition cond);
duke@435 219
duke@435 220 PhiResolverState& resolver_state() { return _resolver_state; }
duke@435 221
duke@435 222 void move_to_phi(PhiResolver* resolver, Value cur_val, Value sux_val);
duke@435 223 void move_to_phi(ValueStack* cur_state);
duke@435 224
duke@435 225 // code emission
duke@435 226 void do_ArithmeticOp_Long (ArithmeticOp* x);
duke@435 227 void do_ArithmeticOp_Int (ArithmeticOp* x);
duke@435 228 void do_ArithmeticOp_FPU (ArithmeticOp* x);
duke@435 229
duke@435 230 // platform dependent
duke@435 231 LIR_Opr getThreadPointer();
duke@435 232
duke@435 233 void do_RegisterFinalizer(Intrinsic* x);
duke@435 234 void do_getClass(Intrinsic* x);
duke@435 235 void do_currentThread(Intrinsic* x);
duke@435 236 void do_MathIntrinsic(Intrinsic* x);
duke@435 237 void do_ArrayCopy(Intrinsic* x);
duke@435 238 void do_CompareAndSwap(Intrinsic* x, ValueType* type);
duke@435 239 void do_AttemptUpdate(Intrinsic* x);
duke@435 240 void do_NIOCheckIndex(Intrinsic* x);
duke@435 241 void do_FPIntrinsics(Intrinsic* x);
duke@435 242
duke@435 243 void do_UnsafePrefetch(UnsafePrefetch* x, bool is_store);
duke@435 244
duke@435 245 LIR_Opr call_runtime(BasicTypeArray* signature, LIRItemList* args, address entry, ValueType* result_type, CodeEmitInfo* info);
duke@435 246 LIR_Opr call_runtime(BasicTypeArray* signature, LIR_OprList* args, address entry, ValueType* result_type, CodeEmitInfo* info);
duke@435 247
duke@435 248 // convenience functions
duke@435 249 LIR_Opr call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info);
duke@435 250 LIR_Opr call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info);
duke@435 251
duke@435 252 // GC Barriers
duke@435 253
duke@435 254 // generic interface
duke@435 255
duke@435 256 void post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val);
duke@435 257
duke@435 258 // specific implementations
duke@435 259
duke@435 260 // post barriers
duke@435 261
duke@435 262 void CardTableModRef_post_barrier(LIR_OprDesc* addr, LIR_OprDesc* new_val);
duke@435 263
duke@435 264
duke@435 265 static LIR_Opr result_register_for(ValueType* type, bool callee = false);
duke@435 266
duke@435 267 ciObject* get_jobject_constant(Value value);
duke@435 268
duke@435 269 LIRItemList* invoke_visit_arguments(Invoke* x);
duke@435 270 void invoke_load_arguments(Invoke* x, LIRItemList* args, const LIR_OprList* arg_list);
duke@435 271
duke@435 272 void trace_block_entry(BlockBegin* block);
duke@435 273
duke@435 274 // volatile field operations are never patchable because a klass
duke@435 275 // must be loaded to know it's volatile which means that the offset
duke@435 276 // it always known as well.
duke@435 277 void volatile_field_store(LIR_Opr value, LIR_Address* address, CodeEmitInfo* info);
duke@435 278 void volatile_field_load(LIR_Address* address, LIR_Opr result, CodeEmitInfo* info);
duke@435 279
duke@435 280 void put_Object_unsafe(LIR_Opr src, LIR_Opr offset, LIR_Opr data, BasicType type, bool is_volatile);
duke@435 281 void get_Object_unsafe(LIR_Opr dest, LIR_Opr src, LIR_Opr offset, BasicType type, bool is_volatile);
duke@435 282
duke@435 283 void arithmetic_call_op (Bytecodes::Code code, LIR_Opr result, LIR_OprList* args);
duke@435 284
duke@435 285 void increment_counter(address counter, int step = 1);
duke@435 286 void increment_counter(LIR_Address* addr, int step = 1);
duke@435 287
duke@435 288 // increment a counter returning the incremented value
duke@435 289 LIR_Opr increment_and_return_counter(LIR_Opr base, int offset, int increment);
duke@435 290
duke@435 291 // is_strictfp is only needed for mul and div (and only generates different code on i486)
duke@435 292 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 293 // machine dependent. returns true if it emitted code for the multiply
duke@435 294 bool strength_reduce_multiply(LIR_Opr left, int constant, LIR_Opr result, LIR_Opr tmp);
duke@435 295
duke@435 296 void store_stack_parameter (LIR_Opr opr, ByteSize offset_from_sp_in_bytes);
duke@435 297
duke@435 298 void jobject2reg_with_patching(LIR_Opr r, ciObject* obj, CodeEmitInfo* info);
duke@435 299
duke@435 300 // this loads the length and compares against the index
duke@435 301 void array_range_check (LIR_Opr array, LIR_Opr index, CodeEmitInfo* null_check_info, CodeEmitInfo* range_check_info);
duke@435 302 // For java.nio.Buffer.checkIndex
duke@435 303 void nio_range_check (LIR_Opr buffer, LIR_Opr index, LIR_Opr result, CodeEmitInfo* info);
duke@435 304
duke@435 305 void arithmetic_op_int (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, LIR_Opr tmp);
duke@435 306 void arithmetic_op_long (Bytecodes::Code code, LIR_Opr result, LIR_Opr left, LIR_Opr right, CodeEmitInfo* info = NULL);
duke@435 307 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 308
duke@435 309 void shift_op (Bytecodes::Code code, LIR_Opr dst_reg, LIR_Opr value, LIR_Opr count, LIR_Opr tmp);
duke@435 310
duke@435 311 void logic_op (Bytecodes::Code code, LIR_Opr dst_reg, LIR_Opr left, LIR_Opr right);
duke@435 312
duke@435 313 void monitor_enter (LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, LIR_Opr scratch, int monitor_no, CodeEmitInfo* info_for_exception, CodeEmitInfo* info);
duke@435 314 void monitor_exit (LIR_Opr object, LIR_Opr lock, LIR_Opr hdr, int monitor_no);
duke@435 315
duke@435 316 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 317
duke@435 318 // machine dependent
duke@435 319 void cmp_mem_int(LIR_Condition condition, LIR_Opr base, int disp, int c, CodeEmitInfo* info);
duke@435 320 void cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, int disp, BasicType type, CodeEmitInfo* info);
duke@435 321 void cmp_reg_mem(LIR_Condition condition, LIR_Opr reg, LIR_Opr base, LIR_Opr disp, BasicType type, CodeEmitInfo* info);
duke@435 322
duke@435 323 void arraycopy_helper(Intrinsic* x, int* flags, ciArrayKlass** expected_type);
duke@435 324
duke@435 325 // returns a LIR_Address to address an array location. May also
duke@435 326 // emit some code as part of address calculation. If
duke@435 327 // needs_card_mark is true then compute the full address for use by
duke@435 328 // both the store and the card mark.
duke@435 329 LIR_Address* generate_address(LIR_Opr base,
duke@435 330 LIR_Opr index, int shift,
duke@435 331 int disp,
duke@435 332 BasicType type);
duke@435 333 LIR_Address* generate_address(LIR_Opr base, int disp, BasicType type) {
duke@435 334 return generate_address(base, LIR_OprFact::illegalOpr, 0, disp, type);
duke@435 335 }
duke@435 336 LIR_Address* emit_array_address(LIR_Opr array_opr, LIR_Opr index_opr, BasicType type, bool needs_card_mark);
duke@435 337
duke@435 338 // machine preferences and characteristics
duke@435 339 bool can_inline_as_constant(Value i) const;
duke@435 340 bool can_inline_as_constant(LIR_Const* c) const;
duke@435 341 bool can_store_as_constant(Value i, BasicType type) const;
duke@435 342
duke@435 343 LIR_Opr safepoint_poll_register();
duke@435 344 void increment_invocation_counter(CodeEmitInfo* info, bool backedge = false);
duke@435 345 void increment_backedge_counter(CodeEmitInfo* info) {
duke@435 346 increment_invocation_counter(info, true);
duke@435 347 }
duke@435 348
duke@435 349 CodeEmitInfo* state_for(Instruction* x, ValueStack* state, bool ignore_xhandler = false);
duke@435 350 CodeEmitInfo* state_for(Instruction* x);
duke@435 351
duke@435 352 // allocates a virtual register for this instruction if
duke@435 353 // one isn't already allocated. Only for Phi and Local.
duke@435 354 LIR_Opr operand_for_instruction(Instruction *x);
duke@435 355
duke@435 356 void set_block(BlockBegin* block) { _block = block; }
duke@435 357
duke@435 358 void block_prolog(BlockBegin* block);
duke@435 359 void block_epilog(BlockBegin* block);
duke@435 360
duke@435 361 void do_root (Instruction* instr);
duke@435 362 void walk (Instruction* instr);
duke@435 363
duke@435 364 void bind_block_entry(BlockBegin* block);
duke@435 365 void start_block(BlockBegin* block);
duke@435 366
duke@435 367 LIR_Opr new_register(BasicType type);
duke@435 368 LIR_Opr new_register(Value value) { return new_register(as_BasicType(value->type())); }
duke@435 369 LIR_Opr new_register(ValueType* type) { return new_register(as_BasicType(type)); }
duke@435 370
duke@435 371 // returns a register suitable for doing pointer math
duke@435 372 LIR_Opr new_pointer_register() {
duke@435 373 #ifdef _LP64
duke@435 374 return new_register(T_LONG);
duke@435 375 #else
duke@435 376 return new_register(T_INT);
duke@435 377 #endif
duke@435 378 }
duke@435 379
duke@435 380 static LIR_Condition lir_cond(If::Condition cond) {
duke@435 381 LIR_Condition l;
duke@435 382 switch (cond) {
duke@435 383 case If::eql: l = lir_cond_equal; break;
duke@435 384 case If::neq: l = lir_cond_notEqual; break;
duke@435 385 case If::lss: l = lir_cond_less; break;
duke@435 386 case If::leq: l = lir_cond_lessEqual; break;
duke@435 387 case If::geq: l = lir_cond_greaterEqual; break;
duke@435 388 case If::gtr: l = lir_cond_greater; break;
duke@435 389 };
duke@435 390 return l;
duke@435 391 }
duke@435 392
duke@435 393 void init();
duke@435 394
duke@435 395 SwitchRangeArray* create_lookup_ranges(TableSwitch* x);
duke@435 396 SwitchRangeArray* create_lookup_ranges(LookupSwitch* x);
duke@435 397 void do_SwitchRanges(SwitchRangeArray* x, LIR_Opr value, BlockBegin* default_sux);
duke@435 398
duke@435 399 public:
duke@435 400 Compilation* compilation() const { return _compilation; }
duke@435 401 FrameMap* frame_map() const { return _compilation->frame_map(); }
duke@435 402 ciMethod* method() const { return _method; }
duke@435 403 BlockBegin* block() const { return _block; }
duke@435 404 IRScope* scope() const { return block()->scope(); }
duke@435 405
duke@435 406 int max_virtual_register_number() const { return _virtual_register_number; }
duke@435 407
duke@435 408 void block_do(BlockBegin* block);
duke@435 409
duke@435 410 // Flags that can be set on vregs
duke@435 411 enum VregFlag {
duke@435 412 must_start_in_memory = 0 // needs to be assigned a memory location at beginning, but may then be loaded in a register
duke@435 413 , callee_saved = 1 // must be in a callee saved register
duke@435 414 , byte_reg = 2 // must be in a byte register
duke@435 415 , num_vreg_flags
duke@435 416
duke@435 417 };
duke@435 418
duke@435 419 LIRGenerator(Compilation* compilation, ciMethod* method)
duke@435 420 : _compilation(compilation)
duke@435 421 , _method(method)
duke@435 422 , _virtual_register_number(LIR_OprDesc::vreg_base)
duke@435 423 , _vreg_flags(NULL, 0, num_vreg_flags) {
duke@435 424 init();
duke@435 425 }
duke@435 426
duke@435 427 // for virtual registers, maps them back to Phi's or Local's
duke@435 428 Instruction* instruction_for_opr(LIR_Opr opr);
duke@435 429 Instruction* instruction_for_vreg(int reg_num);
duke@435 430
duke@435 431 void set_vreg_flag (int vreg_num, VregFlag f);
duke@435 432 bool is_vreg_flag_set(int vreg_num, VregFlag f);
duke@435 433 void set_vreg_flag (LIR_Opr opr, VregFlag f) { set_vreg_flag(opr->vreg_number(), f); }
duke@435 434 bool is_vreg_flag_set(LIR_Opr opr, VregFlag f) { return is_vreg_flag_set(opr->vreg_number(), f); }
duke@435 435
duke@435 436 // statics
duke@435 437 static LIR_Opr exceptionOopOpr();
duke@435 438 static LIR_Opr exceptionPcOpr();
duke@435 439 static LIR_Opr divInOpr();
duke@435 440 static LIR_Opr divOutOpr();
duke@435 441 static LIR_Opr remOutOpr();
duke@435 442 static LIR_Opr shiftCountOpr();
duke@435 443 LIR_Opr syncTempOpr();
duke@435 444
duke@435 445 // returns a register suitable for saving the thread in a
duke@435 446 // call_runtime_leaf if one is needed.
duke@435 447 LIR_Opr getThreadTemp();
duke@435 448
duke@435 449 // visitor functionality
duke@435 450 virtual void do_Phi (Phi* x);
duke@435 451 virtual void do_Local (Local* x);
duke@435 452 virtual void do_Constant (Constant* x);
duke@435 453 virtual void do_LoadField (LoadField* x);
duke@435 454 virtual void do_StoreField (StoreField* x);
duke@435 455 virtual void do_ArrayLength (ArrayLength* x);
duke@435 456 virtual void do_LoadIndexed (LoadIndexed* x);
duke@435 457 virtual void do_StoreIndexed (StoreIndexed* x);
duke@435 458 virtual void do_NegateOp (NegateOp* x);
duke@435 459 virtual void do_ArithmeticOp (ArithmeticOp* x);
duke@435 460 virtual void do_ShiftOp (ShiftOp* x);
duke@435 461 virtual void do_LogicOp (LogicOp* x);
duke@435 462 virtual void do_CompareOp (CompareOp* x);
duke@435 463 virtual void do_IfOp (IfOp* x);
duke@435 464 virtual void do_Convert (Convert* x);
duke@435 465 virtual void do_NullCheck (NullCheck* x);
duke@435 466 virtual void do_Invoke (Invoke* x);
duke@435 467 virtual void do_NewInstance (NewInstance* x);
duke@435 468 virtual void do_NewTypeArray (NewTypeArray* x);
duke@435 469 virtual void do_NewObjectArray (NewObjectArray* x);
duke@435 470 virtual void do_NewMultiArray (NewMultiArray* x);
duke@435 471 virtual void do_CheckCast (CheckCast* x);
duke@435 472 virtual void do_InstanceOf (InstanceOf* x);
duke@435 473 virtual void do_MonitorEnter (MonitorEnter* x);
duke@435 474 virtual void do_MonitorExit (MonitorExit* x);
duke@435 475 virtual void do_Intrinsic (Intrinsic* x);
duke@435 476 virtual void do_BlockBegin (BlockBegin* x);
duke@435 477 virtual void do_Goto (Goto* x);
duke@435 478 virtual void do_If (If* x);
duke@435 479 virtual void do_IfInstanceOf (IfInstanceOf* x);
duke@435 480 virtual void do_TableSwitch (TableSwitch* x);
duke@435 481 virtual void do_LookupSwitch (LookupSwitch* x);
duke@435 482 virtual void do_Return (Return* x);
duke@435 483 virtual void do_Throw (Throw* x);
duke@435 484 virtual void do_Base (Base* x);
duke@435 485 virtual void do_OsrEntry (OsrEntry* x);
duke@435 486 virtual void do_ExceptionObject(ExceptionObject* x);
duke@435 487 virtual void do_RoundFP (RoundFP* x);
duke@435 488 virtual void do_UnsafeGetRaw (UnsafeGetRaw* x);
duke@435 489 virtual void do_UnsafePutRaw (UnsafePutRaw* x);
duke@435 490 virtual void do_UnsafeGetObject(UnsafeGetObject* x);
duke@435 491 virtual void do_UnsafePutObject(UnsafePutObject* x);
duke@435 492 virtual void do_UnsafePrefetchRead (UnsafePrefetchRead* x);
duke@435 493 virtual void do_UnsafePrefetchWrite(UnsafePrefetchWrite* x);
duke@435 494 virtual void do_ProfileCall (ProfileCall* x);
duke@435 495 virtual void do_ProfileCounter (ProfileCounter* x);
duke@435 496 };
duke@435 497
duke@435 498
duke@435 499 class LIRItem: public CompilationResourceObj {
duke@435 500 private:
duke@435 501 Value _value;
duke@435 502 LIRGenerator* _gen;
duke@435 503 LIR_Opr _result;
duke@435 504 bool _destroys_register;
duke@435 505 LIR_Opr _new_result;
duke@435 506
duke@435 507 LIRGenerator* gen() const { return _gen; }
duke@435 508
duke@435 509 public:
duke@435 510 LIRItem(Value value, LIRGenerator* gen) {
duke@435 511 _destroys_register = false;
duke@435 512 _gen = gen;
duke@435 513 set_instruction(value);
duke@435 514 }
duke@435 515
duke@435 516 LIRItem(LIRGenerator* gen) {
duke@435 517 _destroys_register = false;
duke@435 518 _gen = gen;
duke@435 519 _result = LIR_OprFact::illegalOpr;
duke@435 520 set_instruction(NULL);
duke@435 521 }
duke@435 522
duke@435 523 void set_instruction(Value value) {
duke@435 524 _value = value;
duke@435 525 _result = LIR_OprFact::illegalOpr;
duke@435 526 if (_value != NULL) {
duke@435 527 _gen->walk(_value);
duke@435 528 _result = _value->operand();
duke@435 529 }
duke@435 530 _new_result = LIR_OprFact::illegalOpr;
duke@435 531 }
duke@435 532
duke@435 533 Value value() const { return _value; }
duke@435 534 ValueType* type() const { return value()->type(); }
duke@435 535 LIR_Opr result() {
duke@435 536 assert(!_destroys_register || (!_result->is_register() || _result->is_virtual()),
duke@435 537 "shouldn't use set_destroys_register with physical regsiters");
duke@435 538 if (_destroys_register && _result->is_register()) {
duke@435 539 if (_new_result->is_illegal()) {
duke@435 540 _new_result = _gen->new_register(type());
duke@435 541 gen()->lir()->move(_result, _new_result);
duke@435 542 }
duke@435 543 return _new_result;
duke@435 544 } else {
duke@435 545 return _result;
duke@435 546 }
duke@435 547 return _result;
duke@435 548 }
duke@435 549
duke@435 550 void set_result(LIR_Opr opr);
duke@435 551
duke@435 552 void load_item();
duke@435 553 void load_byte_item();
duke@435 554 void load_nonconstant();
duke@435 555 // load any values which can't be expressed as part of a single store instruction
duke@435 556 void load_for_store(BasicType store_type);
duke@435 557 void load_item_force(LIR_Opr reg);
duke@435 558
duke@435 559 void dont_load_item() {
duke@435 560 // do nothing
duke@435 561 }
duke@435 562
duke@435 563 void set_destroys_register() {
duke@435 564 _destroys_register = true;
duke@435 565 }
duke@435 566
duke@435 567 bool is_constant() const { return value()->as_Constant() != NULL; }
duke@435 568 bool is_stack() { return result()->is_stack(); }
duke@435 569 bool is_register() { return result()->is_register(); }
duke@435 570
duke@435 571 ciObject* get_jobject_constant() const;
duke@435 572 jint get_jint_constant() const;
duke@435 573 jlong get_jlong_constant() const;
duke@435 574 jfloat get_jfloat_constant() const;
duke@435 575 jdouble get_jdouble_constant() const;
duke@435 576 jint get_address_constant() const;
duke@435 577 };

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial