comparison src/share/vm/c1/c1_LIRGenerator.hpp @ 0:a61af66fc99e

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