Mercurial > jdk8-mips64-public > hotspot / annotate

src/share/vm/c1/c1_IR.hpp@b9a9ed0f8eeb (annotated)

src/share/vm/c1/c1_IR.hpp

Tue, 09 Oct 2012 10:09:34 -0700

author
mikael
date
Tue, 09 Oct 2012 10:09:34 -0700
changeset 4153
b9a9ed0f8eeb
parent 3592
701a83c86f28
child 4860
46f6f063b272
permissions
-rw-r--r--

7197424: update copyright year to match last edit in jdk8 hotspot repository
Summary: Update copyright year to 2012 for relevant files
Reviewed-by: dholmes, coleenp

duke@435 1 /*
mikael@4153 2 * Copyright (c) 1999, 2012, Oracle and/or its affiliates. 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 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #ifndef SHARE_VM_C1_C1_IR_HPP
stefank@2314 26 #define SHARE_VM_C1_C1_IR_HPP
stefank@2314 27
stefank@2314 28 #include "c1/c1_Instruction.hpp"
stefank@2314 29 #include "ci/ciExceptionHandler.hpp"
stefank@2314 30 #include "ci/ciMethod.hpp"
stefank@2314 31 #include "ci/ciStreams.hpp"
stefank@2314 32 #include "memory/allocation.hpp"
stefank@2314 33
duke@435 34 // An XHandler is a C1 internal description for an exception handler
duke@435 35
duke@435 36 class XHandler: public CompilationResourceObj {
duke@435 37 private:
duke@435 38 ciExceptionHandler* _desc;
duke@435 39
duke@435 40 BlockBegin* _entry_block; // Entry block of xhandler
duke@435 41 LIR_List* _entry_code; // LIR-operations that must be executed before jumping to entry_block
duke@435 42 int _entry_pco; // pco where entry_code (or entry_block if no entry_code) starts
duke@435 43 int _phi_operand; // For resolving of phi functions at begin of entry_block
duke@435 44 int _scope_count; // for filling ExceptionRangeEntry::scope_count
duke@435 45
duke@435 46 #ifdef ASSERT
duke@435 47 int _lir_op_id; // op_id of the LIR-operation throwing to this handler
duke@435 48 #endif
duke@435 49
duke@435 50 public:
duke@435 51 // creation
duke@435 52 XHandler(ciExceptionHandler* desc)
duke@435 53 : _desc(desc)
duke@435 54 , _entry_block(NULL)
duke@435 55 , _entry_code(NULL)
duke@435 56 , _entry_pco(-1)
duke@435 57 , _phi_operand(-1)
duke@435 58 , _scope_count(-1)
duke@435 59 #ifdef ASSERT
duke@435 60 , _lir_op_id(-1)
duke@435 61 #endif
duke@435 62 { }
duke@435 63
duke@435 64 XHandler(XHandler* other)
duke@435 65 : _desc(other->_desc)
duke@435 66 , _entry_block(other->_entry_block)
duke@435 67 , _entry_code(other->_entry_code)
duke@435 68 , _entry_pco(other->_entry_pco)
duke@435 69 , _phi_operand(other->_phi_operand)
duke@435 70 , _scope_count(other->_scope_count)
duke@435 71 #ifdef ASSERT
duke@435 72 , _lir_op_id(other->_lir_op_id)
duke@435 73 #endif
duke@435 74 { }
duke@435 75
duke@435 76 // accessors for data of ciExceptionHandler
duke@435 77 int beg_bci() const { return _desc->start(); }
duke@435 78 int end_bci() const { return _desc->limit(); }
duke@435 79 int handler_bci() const { return _desc->handler_bci(); }
duke@435 80 bool is_catch_all() const { return _desc->is_catch_all(); }
duke@435 81 int catch_type() const { return _desc->catch_klass_index(); }
duke@435 82 ciInstanceKlass* catch_klass() const { return _desc->catch_klass(); }
duke@435 83 bool covers(int bci) const { return beg_bci() <= bci && bci < end_bci(); }
duke@435 84
duke@435 85 // accessors for additional fields
duke@435 86 BlockBegin* entry_block() const { return _entry_block; }
duke@435 87 LIR_List* entry_code() const { return _entry_code; }
duke@435 88 int entry_pco() const { return _entry_pco; }
duke@435 89 int phi_operand() const { assert(_phi_operand != -1, "not set"); return _phi_operand; }
duke@435 90 int scope_count() const { assert(_scope_count != -1, "not set"); return _scope_count; }
duke@435 91 DEBUG_ONLY(int lir_op_id() const { return _lir_op_id; });
duke@435 92
duke@435 93 void set_entry_block(BlockBegin* entry_block) {
duke@435 94 assert(entry_block->is_set(BlockBegin::exception_entry_flag), "must be an exception handler entry");
duke@435 95 assert(entry_block->bci() == handler_bci(), "bci's must correspond");
duke@435 96 _entry_block = entry_block;
duke@435 97 }
duke@435 98 void set_entry_code(LIR_List* entry_code) { _entry_code = entry_code; }
duke@435 99 void set_entry_pco(int entry_pco) { _entry_pco = entry_pco; }
duke@435 100 void set_phi_operand(int phi_operand) { _phi_operand = phi_operand; }
duke@435 101 void set_scope_count(int scope_count) { _scope_count = scope_count; }
duke@435 102 DEBUG_ONLY(void set_lir_op_id(int lir_op_id) { _lir_op_id = lir_op_id; });
duke@435 103
duke@435 104 bool equals(XHandler* other) const;
duke@435 105 };
duke@435 106
duke@435 107 define_array(_XHandlerArray, XHandler*)
duke@435 108 define_stack(_XHandlerList, _XHandlerArray)
duke@435 109
duke@435 110
duke@435 111 // XHandlers is the C1 internal list of exception handlers for a method
duke@435 112 class XHandlers: public CompilationResourceObj {
duke@435 113 private:
duke@435 114 _XHandlerList _list;
duke@435 115
duke@435 116 public:
duke@435 117 // creation
duke@435 118 XHandlers() : _list() { }
duke@435 119 XHandlers(ciMethod* method);
duke@435 120 XHandlers(XHandlers* other);
duke@435 121
duke@435 122 // accessors
duke@435 123 int length() const { return _list.length(); }
duke@435 124 XHandler* handler_at(int i) const { return _list.at(i); }
duke@435 125 bool has_handlers() const { return _list.length() > 0; }
duke@435 126 void append(XHandler* h) { _list.append(h); }
duke@435 127 XHandler* remove_last() { return _list.pop(); }
duke@435 128
duke@435 129 bool could_catch(ciInstanceKlass* klass, bool type_is_exact) const;
duke@435 130 bool equals(XHandlers* others) const;
duke@435 131 };
duke@435 132
duke@435 133
duke@435 134 class IRScope;
duke@435 135 define_array(IRScopeArray, IRScope*)
duke@435 136 define_stack(IRScopeList, IRScopeArray)
duke@435 137
duke@435 138 class Compilation;
duke@435 139 class IRScope: public CompilationResourceObj {
duke@435 140 private:
duke@435 141 // hierarchy
duke@435 142 Compilation* _compilation; // the current compilation
duke@435 143 IRScope* _caller; // the caller scope, or NULL
duke@435 144 int _level; // the inlining level
duke@435 145 ciMethod* _method; // the corresponding method
duke@435 146 IRScopeList _callees; // the inlined method scopes
duke@435 147
duke@435 148 // graph
duke@435 149 XHandlers* _xhandlers; // the exception handlers
duke@435 150 int _number_of_locks; // the number of monitor lock slots needed
duke@435 151 bool _monitor_pairing_ok; // the monitor pairing info
jiangli@3592 152 bool _wrote_final; // has written final field
duke@435 153 BlockBegin* _start; // the start block, successsors are method entries
duke@435 154
duke@435 155 BitMap _requires_phi_function; // bit is set if phi functions at loop headers are necessary for a local variable
duke@435 156
duke@435 157 // helper functions
duke@435 158 BlockBegin* build_graph(Compilation* compilation, int osr_bci);
duke@435 159
duke@435 160 public:
duke@435 161 // creation
duke@435 162 IRScope(Compilation* compilation, IRScope* caller, int caller_bci, ciMethod* method, int osr_bci, bool create_graph = false);
duke@435 163
duke@435 164 // accessors
duke@435 165 Compilation* compilation() const { return _compilation; }
duke@435 166 IRScope* caller() const { return _caller; }
duke@435 167 int level() const { return _level; }
duke@435 168 ciMethod* method() const { return _method; }
duke@435 169 int max_stack() const; // NOTE: expensive
duke@435 170 BitMap& requires_phi_function() { return _requires_phi_function; }
duke@435 171
duke@435 172 // hierarchy
duke@435 173 bool is_top_scope() const { return _caller == NULL; }
duke@435 174 void add_callee(IRScope* callee) { _callees.append(callee); }
duke@435 175 int number_of_callees() const { return _callees.length(); }
duke@435 176 IRScope* callee_no(int i) const { return _callees.at(i); }
duke@435 177
duke@435 178 // accessors, graph
duke@435 179 bool is_valid() const { return start() != NULL; }
duke@435 180 XHandlers* xhandlers() const { return _xhandlers; }
duke@435 181 int number_of_locks() const { return _number_of_locks; }
duke@435 182 void set_min_number_of_locks(int n) { if (n > _number_of_locks) _number_of_locks = n; }
duke@435 183 bool monitor_pairing_ok() const { return _monitor_pairing_ok; }
duke@435 184 BlockBegin* start() const { return _start; }
jiangli@3592 185 void set_wrote_final() { _wrote_final = true; }
jiangli@3592 186 bool wrote_final () const { return _wrote_final; }
duke@435 187 };
duke@435 188
duke@435 189
duke@435 190 //
duke@435 191 // IRScopeDebugInfo records the debug information for a particular IRScope
duke@435 192 // in a particular CodeEmitInfo. This allows the information to be computed
duke@435 193 // once early enough for the OopMap to be available to the LIR and also to be
duke@435 194 // reemited for different pcs using the same CodeEmitInfo without recomputing
duke@435 195 // everything.
duke@435 196 //
duke@435 197
duke@435 198 class IRScopeDebugInfo: public CompilationResourceObj {
duke@435 199 private:
duke@435 200 IRScope* _scope;
duke@435 201 int _bci;
duke@435 202 GrowableArray<ScopeValue*>* _locals;
duke@435 203 GrowableArray<ScopeValue*>* _expressions;
duke@435 204 GrowableArray<MonitorValue*>* _monitors;
duke@435 205 IRScopeDebugInfo* _caller;
duke@435 206
duke@435 207 public:
duke@435 208 IRScopeDebugInfo(IRScope* scope,
duke@435 209 int bci,
duke@435 210 GrowableArray<ScopeValue*>* locals,
duke@435 211 GrowableArray<ScopeValue*>* expressions,
duke@435 212 GrowableArray<MonitorValue*>* monitors,
duke@435 213 IRScopeDebugInfo* caller):
duke@435 214 _scope(scope)
duke@435 215 , _locals(locals)
duke@435 216 , _bci(bci)
duke@435 217 , _expressions(expressions)
duke@435 218 , _monitors(monitors)
duke@435 219 , _caller(caller) {}
duke@435 220
duke@435 221
duke@435 222 IRScope* scope() { return _scope; }
duke@435 223 int bci() { return _bci; }
duke@435 224 GrowableArray<ScopeValue*>* locals() { return _locals; }
duke@435 225 GrowableArray<ScopeValue*>* expressions() { return _expressions; }
duke@435 226 GrowableArray<MonitorValue*>* monitors() { return _monitors; }
duke@435 227 IRScopeDebugInfo* caller() { return _caller; }
duke@435 228
cfang@1335 229 //Whether we should reexecute this bytecode for deopt
cfang@1335 230 bool should_reexecute();
cfang@1335 231
twisti@1730 232 void record_debug_info(DebugInformationRecorder* recorder, int pc_offset, bool topmost, bool is_method_handle_invoke = false) {
duke@435 233 if (caller() != NULL) {
duke@435 234 // Order is significant: Must record caller first.
cfang@1335 235 caller()->record_debug_info(recorder, pc_offset, false/*topmost*/);
duke@435 236 }
duke@435 237 DebugToken* locvals = recorder->create_scope_values(locals());
duke@435 238 DebugToken* expvals = recorder->create_scope_values(expressions());
duke@435 239 DebugToken* monvals = recorder->create_monitor_values(monitors());
cfang@1335 240 // reexecute allowed only for the topmost frame
twisti@1570 241 bool reexecute = topmost ? should_reexecute() : false;
kvn@1688 242 bool return_oop = false; // This flag will be ignored since it used only for C2 with escape analysis.
kvn@1688 243 recorder->describe_scope(pc_offset, scope()->method(), bci(), reexecute, is_method_handle_invoke, return_oop, locvals, expvals, monvals);
duke@435 244 }
duke@435 245 };
duke@435 246
duke@435 247
duke@435 248 class CodeEmitInfo: public CompilationResourceObj {
duke@435 249 friend class LinearScan;
duke@435 250 private:
duke@435 251 IRScopeDebugInfo* _scope_debug_info;
duke@435 252 IRScope* _scope;
duke@435 253 XHandlers* _exception_handlers;
duke@435 254 OopMap* _oop_map;
duke@435 255 ValueStack* _stack; // used by deoptimization (contains also monitors
twisti@1919 256 bool _is_method_handle_invoke; // true if the associated call site is a MethodHandle call site.
duke@435 257
duke@435 258 FrameMap* frame_map() const { return scope()->compilation()->frame_map(); }
duke@435 259 Compilation* compilation() const { return scope()->compilation(); }
duke@435 260
duke@435 261 public:
duke@435 262
duke@435 263 // use scope from ValueStack
roland@2174 264 CodeEmitInfo(ValueStack* stack, XHandlers* exception_handlers);
duke@435 265
duke@435 266 // make a copy
roland@2174 267 CodeEmitInfo(CodeEmitInfo* info, ValueStack* stack = NULL);
duke@435 268
duke@435 269 // accessors
duke@435 270 OopMap* oop_map() { return _oop_map; }
duke@435 271 ciMethod* method() const { return _scope->method(); }
duke@435 272 IRScope* scope() const { return _scope; }
duke@435 273 XHandlers* exception_handlers() const { return _exception_handlers; }
duke@435 274 ValueStack* stack() const { return _stack; }
duke@435 275
duke@435 276 void add_register_oop(LIR_Opr opr);
twisti@1919 277 void record_debug_info(DebugInformationRecorder* recorder, int pc_offset);
duke@435 278
twisti@1919 279 bool is_method_handle_invoke() const { return _is_method_handle_invoke; }
twisti@1919 280 void set_is_method_handle_invoke(bool x) { _is_method_handle_invoke = x; }
duke@435 281 };
duke@435 282
duke@435 283
duke@435 284 class IR: public CompilationResourceObj {
duke@435 285 private:
duke@435 286 Compilation* _compilation; // the current compilation
duke@435 287 IRScope* _top_scope; // the root of the scope hierarchy
duke@435 288 WordSize _locals_size; // the space required for all locals
duke@435 289 int _num_loops; // Total number of loops
duke@435 290 BlockList* _code; // the blocks in code generation order w/ use counts
duke@435 291
duke@435 292 public:
duke@435 293 // creation
duke@435 294 IR(Compilation* compilation, ciMethod* method, int osr_bci);
duke@435 295
duke@435 296 // accessors
duke@435 297 bool is_valid() const { return top_scope()->is_valid(); }
duke@435 298 Compilation* compilation() const { return _compilation; }
duke@435 299 IRScope* top_scope() const { return _top_scope; }
duke@435 300 int number_of_locks() const { return top_scope()->number_of_locks(); }
duke@435 301 ciMethod* method() const { return top_scope()->method(); }
duke@435 302 BlockBegin* start() const { return top_scope()->start(); }
duke@435 303 BlockBegin* std_entry() const { return start()->end()->as_Base()->std_entry(); }
duke@435 304 BlockBegin* osr_entry() const { return start()->end()->as_Base()->osr_entry(); }
duke@435 305 WordSize locals_size() const { return _locals_size; }
duke@435 306 int locals_size_in_words() const { return in_words(_locals_size); }
duke@435 307 BlockList* code() const { return _code; }
duke@435 308 int num_loops() const { return _num_loops; }
duke@435 309 int max_stack() const { return top_scope()->max_stack(); } // expensive
duke@435 310
duke@435 311 // ir manipulation
duke@435 312 void optimize();
duke@435 313 void compute_predecessors();
duke@435 314 void split_critical_edges();
duke@435 315 void compute_code();
duke@435 316 void compute_use_counts();
duke@435 317
duke@435 318 // The linear-scan order and the code emission order are equal, but
duke@435 319 // this may change in future
duke@435 320 BlockList* linear_scan_order() { assert(_code != NULL, "not computed"); return _code; }
duke@435 321
duke@435 322 // iteration
duke@435 323 void iterate_preorder (BlockClosure* closure);
duke@435 324 void iterate_postorder (BlockClosure* closure);
duke@435 325 void iterate_linear_scan_order(BlockClosure* closure);
duke@435 326
duke@435 327 // debugging
duke@435 328 static void print(BlockBegin* start, bool cfg_only, bool live_only = false) PRODUCT_RETURN;
duke@435 329 void print(bool cfg_only, bool live_only = false) PRODUCT_RETURN;
duke@435 330 void verify() PRODUCT_RETURN;
duke@435 331 };
duke@435 332
duke@435 333
duke@435 334 // Globally do instruction substitution and remove substituted
duke@435 335 // instructions from the instruction list.
duke@435 336 //
duke@435 337
iveresov@1939 338 class SubstitutionResolver: public BlockClosure, ValueVisitor {
iveresov@1939 339 virtual void visit(Value* v);
duke@435 340
duke@435 341 public:
duke@435 342 SubstitutionResolver(IR* hir) {
duke@435 343 hir->iterate_preorder(this);
duke@435 344 }
duke@435 345
duke@435 346 SubstitutionResolver(BlockBegin* block) {
duke@435 347 block->iterate_preorder(this);
duke@435 348 }
duke@435 349
duke@435 350 virtual void block_do(BlockBegin* block);
duke@435 351 };
stefank@2314 352
stefank@2314 353 #endif // SHARE_VM_C1_C1_IR_HPP

Mercurial Repository: jdk8-mips64-public/hotspot

mercurial