| File: | jdk/src/hotspot/share/c1/c1_LinearScan.cpp |
| Warning: | line 3459, column 7 Value stored to 'num_regs' during its initialization is never read |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | /* |
| 2 | * Copyright (c) 2005, 2021, 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 | #include "precompiled.hpp" |
| 26 | #include "c1/c1_CFGPrinter.hpp" |
| 27 | #include "c1/c1_CodeStubs.hpp" |
| 28 | #include "c1/c1_Compilation.hpp" |
| 29 | #include "c1/c1_FrameMap.hpp" |
| 30 | #include "c1/c1_IR.hpp" |
| 31 | #include "c1/c1_LIRGenerator.hpp" |
| 32 | #include "c1/c1_LinearScan.hpp" |
| 33 | #include "c1/c1_ValueStack.hpp" |
| 34 | #include "code/vmreg.inline.hpp" |
| 35 | #include "runtime/timerTrace.hpp" |
| 36 | #include "utilities/bitMap.inline.hpp" |
| 37 | |
| 38 | #ifndef PRODUCT |
| 39 | |
| 40 | static LinearScanStatistic _stat_before_alloc; |
| 41 | static LinearScanStatistic _stat_after_asign; |
| 42 | static LinearScanStatistic _stat_final; |
| 43 | |
| 44 | static LinearScanTimers _total_timer; |
| 45 | |
| 46 | // helper macro for short definition of timer |
| 47 | #define TIME_LINEAR_SCAN(timer_name)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_name), TimeLinearScan || TimeEachLinearScan, Verbose) ; TraceTime _block_timer("", _total_timer.timer(LinearScanTimers::timer_name), TimeLinearScan || TimeEachLinearScan, Verbose); |
| 48 | |
| 49 | #else |
| 50 | #define TIME_LINEAR_SCAN(timer_name)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_name), TimeLinearScan || TimeEachLinearScan, Verbose) ; |
| 51 | #endif |
| 52 | |
| 53 | #ifdef ASSERT1 |
| 54 | |
| 55 | // helper macro for short definition of trace-output inside code |
| 56 | #define TRACE_LINEAR_SCAN(level, code)if (TraceLinearScanLevel >= level) { code; } \ |
| 57 | if (TraceLinearScanLevel >= level) { \ |
| 58 | code; \ |
| 59 | } |
| 60 | #else |
| 61 | #define TRACE_LINEAR_SCAN(level, code)if (TraceLinearScanLevel >= level) { code; } |
| 62 | #endif |
| 63 | |
| 64 | // Map BasicType to spill size in 32-bit words, matching VMReg's notion of words |
| 65 | #ifdef _LP641 |
| 66 | static int type2spill_size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 0, 2, 1, 2, 1, -1}; |
| 67 | #else |
| 68 | static int type2spill_size[T_CONFLICT+1]={ -1, 0, 0, 0, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 0, 1, -1, 1, 1, -1}; |
| 69 | #endif |
| 70 | |
| 71 | |
| 72 | // Implementation of LinearScan |
| 73 | |
| 74 | LinearScan::LinearScan(IR* ir, LIRGenerator* gen, FrameMap* frame_map) |
| 75 | : _compilation(ir->compilation()) |
| 76 | , _ir(ir) |
| 77 | , _gen(gen) |
| 78 | , _frame_map(frame_map) |
| 79 | , _cached_blocks(*ir->linear_scan_order()) |
| 80 | , _num_virtual_regs(gen->max_virtual_register_number()) |
| 81 | , _has_fpu_registers(false) |
| 82 | , _num_calls(-1) |
| 83 | , _max_spills(0) |
| 84 | , _unused_spill_slot(-1) |
| 85 | , _intervals(0) // initialized later with correct length |
| 86 | , _new_intervals_from_allocation(NULL__null) |
| 87 | , _sorted_intervals(NULL__null) |
| 88 | , _needs_full_resort(false) |
| 89 | , _lir_ops(0) // initialized later with correct length |
| 90 | , _block_of_op(0) // initialized later with correct length |
| 91 | , _has_info(0) |
| 92 | , _has_call(0) |
| 93 | , _interval_in_loop(0) // initialized later with correct length |
| 94 | , _scope_value_cache(0) // initialized later with correct length |
| 95 | #ifdef IA32 |
| 96 | , _fpu_stack_allocator(NULL__null) |
| 97 | #endif |
| 98 | { |
| 99 | assert(this->ir() != NULL, "check if valid")do { if (!(this->ir() != __null)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 99, "assert(" "this->ir() != __null" ") failed", "check if valid" ); ::breakpoint(); } } while (0); |
| 100 | assert(this->compilation() != NULL, "check if valid")do { if (!(this->compilation() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 100, "assert(" "this->compilation() != __null" ") failed" , "check if valid"); ::breakpoint(); } } while (0); |
| 101 | assert(this->gen() != NULL, "check if valid")do { if (!(this->gen() != __null)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 101, "assert(" "this->gen() != __null" ") failed", "check if valid" ); ::breakpoint(); } } while (0); |
| 102 | assert(this->frame_map() != NULL, "check if valid")do { if (!(this->frame_map() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 102, "assert(" "this->frame_map() != __null" ") failed", "check if valid"); ::breakpoint(); } } while (0); |
| 103 | } |
| 104 | |
| 105 | |
| 106 | // ********** functions for converting LIR-Operands to register numbers |
| 107 | // |
| 108 | // Emulate a flat register file comprising physical integer registers, |
| 109 | // physical floating-point registers and virtual registers, in that order. |
| 110 | // Virtual registers already have appropriate numbers, since V0 is |
| 111 | // the number of physical registers. |
| 112 | // Returns -1 for hi word if opr is a single word operand. |
| 113 | // |
| 114 | // Note: the inverse operation (calculating an operand for register numbers) |
| 115 | // is done in calc_operand_for_interval() |
| 116 | |
| 117 | int LinearScan::reg_num(LIR_Opr opr) { |
| 118 | assert(opr->is_register(), "should not call this otherwise")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 118, "assert(" "opr->is_register()" ") failed", "should not call this otherwise" ); ::breakpoint(); } } while (0); |
| 119 | |
| 120 | if (opr->is_virtual_register()) { |
| 121 | assert(opr->vreg_number() >= nof_regs, "found a virtual register with a fixed-register number")do { if (!(opr->vreg_number() >= nof_regs)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 121, "assert(" "opr->vreg_number() >= nof_regs" ") failed" , "found a virtual register with a fixed-register number"); :: breakpoint(); } } while (0); |
| 122 | return opr->vreg_number(); |
| 123 | } else if (opr->is_single_cpu()) { |
| 124 | return opr->cpu_regnr(); |
| 125 | } else if (opr->is_double_cpu()) { |
| 126 | return opr->cpu_regnrLo(); |
| 127 | #ifdef X86 |
| 128 | } else if (opr->is_single_xmm()) { |
| 129 | return opr->fpu_regnr() + pd_first_xmm_reg; |
| 130 | } else if (opr->is_double_xmm()) { |
| 131 | return opr->fpu_regnrLo() + pd_first_xmm_reg; |
| 132 | #endif |
| 133 | } else if (opr->is_single_fpu()) { |
| 134 | return opr->fpu_regnr() + pd_first_fpu_reg; |
| 135 | } else if (opr->is_double_fpu()) { |
| 136 | return opr->fpu_regnrLo() + pd_first_fpu_reg; |
| 137 | } else { |
| 138 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 138); ::breakpoint(); } while (0); |
| 139 | return -1; |
| 140 | } |
| 141 | } |
| 142 | |
| 143 | int LinearScan::reg_numHi(LIR_Opr opr) { |
| 144 | assert(opr->is_register(), "should not call this otherwise")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 144, "assert(" "opr->is_register()" ") failed", "should not call this otherwise" ); ::breakpoint(); } } while (0); |
| 145 | |
| 146 | if (opr->is_virtual_register()) { |
| 147 | return -1; |
| 148 | } else if (opr->is_single_cpu()) { |
| 149 | return -1; |
| 150 | } else if (opr->is_double_cpu()) { |
| 151 | return opr->cpu_regnrHi(); |
| 152 | #ifdef X86 |
| 153 | } else if (opr->is_single_xmm()) { |
| 154 | return -1; |
| 155 | } else if (opr->is_double_xmm()) { |
| 156 | return -1; |
| 157 | #endif |
| 158 | } else if (opr->is_single_fpu()) { |
| 159 | return -1; |
| 160 | } else if (opr->is_double_fpu()) { |
| 161 | return opr->fpu_regnrHi() + pd_first_fpu_reg; |
| 162 | } else { |
| 163 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 163); ::breakpoint(); } while (0); |
| 164 | return -1; |
| 165 | } |
| 166 | } |
| 167 | |
| 168 | |
| 169 | // ********** functions for classification of intervals |
| 170 | |
| 171 | bool LinearScan::is_precolored_interval(const Interval* i) { |
| 172 | return i->reg_num() < LinearScan::nof_regs; |
| 173 | } |
| 174 | |
| 175 | bool LinearScan::is_virtual_interval(const Interval* i) { |
| 176 | return i->reg_num() >= LIR_Opr::vreg_base; |
| 177 | } |
| 178 | |
| 179 | bool LinearScan::is_precolored_cpu_interval(const Interval* i) { |
| 180 | return i->reg_num() < LinearScan::nof_cpu_regs; |
| 181 | } |
| 182 | |
| 183 | bool LinearScan::is_virtual_cpu_interval(const Interval* i) { |
| 184 | #if defined(__SOFTFP__) || defined(E500V2) |
| 185 | return i->reg_num() >= LIR_Opr::vreg_base; |
| 186 | #else |
| 187 | return i->reg_num() >= LIR_Opr::vreg_base && (i->type() != T_FLOAT && i->type() != T_DOUBLE); |
| 188 | #endif // __SOFTFP__ or E500V2 |
| 189 | } |
| 190 | |
| 191 | bool LinearScan::is_precolored_fpu_interval(const Interval* i) { |
| 192 | return i->reg_num() >= LinearScan::nof_cpu_regs && i->reg_num() < LinearScan::nof_regs; |
| 193 | } |
| 194 | |
| 195 | bool LinearScan::is_virtual_fpu_interval(const Interval* i) { |
| 196 | #if defined(__SOFTFP__) || defined(E500V2) |
| 197 | return false; |
| 198 | #else |
| 199 | return i->reg_num() >= LIR_Opr::vreg_base && (i->type() == T_FLOAT || i->type() == T_DOUBLE); |
| 200 | #endif // __SOFTFP__ or E500V2 |
| 201 | } |
| 202 | |
| 203 | bool LinearScan::is_in_fpu_register(const Interval* i) { |
| 204 | // fixed intervals not needed for FPU stack allocation |
| 205 | return i->reg_num() >= nof_regs && pd_first_fpu_reg <= i->assigned_reg() && i->assigned_reg() <= pd_last_fpu_reg; |
| 206 | } |
| 207 | |
| 208 | bool LinearScan::is_oop_interval(const Interval* i) { |
| 209 | // fixed intervals never contain oops |
| 210 | return i->reg_num() >= nof_regs && i->type() == T_OBJECT; |
| 211 | } |
| 212 | |
| 213 | |
| 214 | // ********** General helper functions |
| 215 | |
| 216 | // compute next unused stack index that can be used for spilling |
| 217 | int LinearScan::allocate_spill_slot(bool double_word) { |
| 218 | int spill_slot; |
| 219 | if (double_word) { |
| 220 | if ((_max_spills & 1) == 1) { |
| 221 | // alignment of double-word values |
| 222 | // the hole because of the alignment is filled with the next single-word value |
| 223 | assert(_unused_spill_slot == -1, "wasting a spill slot")do { if (!(_unused_spill_slot == -1)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 223, "assert(" "_unused_spill_slot == -1" ") failed", "wasting a spill slot" ); ::breakpoint(); } } while (0); |
| 224 | _unused_spill_slot = _max_spills; |
| 225 | _max_spills++; |
| 226 | } |
| 227 | spill_slot = _max_spills; |
| 228 | _max_spills += 2; |
| 229 | |
| 230 | } else if (_unused_spill_slot != -1) { |
| 231 | // re-use hole that was the result of a previous double-word alignment |
| 232 | spill_slot = _unused_spill_slot; |
| 233 | _unused_spill_slot = -1; |
| 234 | |
| 235 | } else { |
| 236 | spill_slot = _max_spills; |
| 237 | _max_spills++; |
| 238 | } |
| 239 | |
| 240 | int result = spill_slot + LinearScan::nof_regs + frame_map()->argcount(); |
| 241 | |
| 242 | // if too many slots used, bailout compilation. |
| 243 | if (result > 2000) { |
| 244 | bailout("too many stack slots used"); |
| 245 | } |
| 246 | |
| 247 | return result; |
| 248 | } |
| 249 | |
| 250 | void LinearScan::assign_spill_slot(Interval* it) { |
| 251 | // assign the canonical spill slot of the parent (if a part of the interval |
| 252 | // is already spilled) or allocate a new spill slot |
| 253 | if (it->canonical_spill_slot() >= 0) { |
| 254 | it->assign_reg(it->canonical_spill_slot()); |
| 255 | } else { |
| 256 | int spill = allocate_spill_slot(type2spill_size[it->type()] == 2); |
| 257 | it->set_canonical_spill_slot(spill); |
| 258 | it->assign_reg(spill); |
| 259 | } |
| 260 | } |
| 261 | |
| 262 | void LinearScan::propagate_spill_slots() { |
| 263 | if (!frame_map()->finalize_frame(max_spills())) { |
| 264 | bailout("frame too large"); |
| 265 | } |
| 266 | } |
| 267 | |
| 268 | // create a new interval with a predefined reg_num |
| 269 | // (only used for parent intervals that are created during the building phase) |
| 270 | Interval* LinearScan::create_interval(int reg_num) { |
| 271 | assert(_intervals.at(reg_num) == NULL, "overwriting exisiting interval")do { if (!(_intervals.at(reg_num) == __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 271, "assert(" "_intervals.at(reg_num) == __null" ") failed" , "overwriting exisiting interval"); ::breakpoint(); } } while (0); |
| 272 | |
| 273 | Interval* interval = new Interval(reg_num); |
| 274 | _intervals.at_put(reg_num, interval); |
| 275 | |
| 276 | // assign register number for precolored intervals |
| 277 | if (reg_num < LIR_Opr::vreg_base) { |
| 278 | interval->assign_reg(reg_num); |
| 279 | } |
| 280 | return interval; |
| 281 | } |
| 282 | |
| 283 | // assign a new reg_num to the interval and append it to the list of intervals |
| 284 | // (only used for child intervals that are created during register allocation) |
| 285 | void LinearScan::append_interval(Interval* it) { |
| 286 | it->set_reg_num(_intervals.length()); |
| 287 | _intervals.append(it); |
| 288 | IntervalList* new_intervals = _new_intervals_from_allocation; |
| 289 | if (new_intervals == NULL__null) { |
| 290 | new_intervals = _new_intervals_from_allocation = new IntervalList(); |
| 291 | } |
| 292 | new_intervals->append(it); |
| 293 | } |
| 294 | |
| 295 | // copy the vreg-flags if an interval is split |
| 296 | void LinearScan::copy_register_flags(Interval* from, Interval* to) { |
| 297 | if (gen()->is_vreg_flag_set(from->reg_num(), LIRGenerator::byte_reg)) { |
| 298 | gen()->set_vreg_flag(to->reg_num(), LIRGenerator::byte_reg); |
| 299 | } |
| 300 | if (gen()->is_vreg_flag_set(from->reg_num(), LIRGenerator::callee_saved)) { |
| 301 | gen()->set_vreg_flag(to->reg_num(), LIRGenerator::callee_saved); |
| 302 | } |
| 303 | |
| 304 | // Note: do not copy the must_start_in_memory flag because it is not necessary for child |
| 305 | // intervals (only the very beginning of the interval must be in memory) |
| 306 | } |
| 307 | |
| 308 | |
| 309 | // ********** spill move optimization |
| 310 | // eliminate moves from register to stack if stack slot is known to be correct |
| 311 | |
| 312 | // called during building of intervals |
| 313 | void LinearScan::change_spill_definition_pos(Interval* interval, int def_pos) { |
| 314 | assert(interval->is_split_parent(), "can only be called for split parents")do { if (!(interval->is_split_parent())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 314, "assert(" "interval->is_split_parent()" ") failed", "can only be called for split parents"); ::breakpoint(); } } while (0); |
| 315 | |
| 316 | switch (interval->spill_state()) { |
| 317 | case noDefinitionFound: |
| 318 | assert(interval->spill_definition_pos() == -1, "must no be set before")do { if (!(interval->spill_definition_pos() == -1)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 318, "assert(" "interval->spill_definition_pos() == -1" ") failed" , "must no be set before"); ::breakpoint(); } } while (0); |
| 319 | interval->set_spill_definition_pos(def_pos); |
| 320 | interval->set_spill_state(oneDefinitionFound); |
| 321 | break; |
| 322 | |
| 323 | case oneDefinitionFound: |
| 324 | assert(def_pos <= interval->spill_definition_pos(), "positions are processed in reverse order when intervals are created")do { if (!(def_pos <= interval->spill_definition_pos()) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 324, "assert(" "def_pos <= interval->spill_definition_pos()" ") failed", "positions are processed in reverse order when intervals are created" ); ::breakpoint(); } } while (0); |
| 325 | if (def_pos < interval->spill_definition_pos() - 2) { |
| 326 | // second definition found, so no spill optimization possible for this interval |
| 327 | interval->set_spill_state(noOptimization); |
| 328 | } else { |
| 329 | // two consecutive definitions (because of two-operand LIR form) |
| 330 | assert(block_of_op_with_id(def_pos) == block_of_op_with_id(interval->spill_definition_pos()), "block must be equal")do { if (!(block_of_op_with_id(def_pos) == block_of_op_with_id (interval->spill_definition_pos()))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 330, "assert(" "block_of_op_with_id(def_pos) == block_of_op_with_id(interval->spill_definition_pos())" ") failed", "block must be equal"); ::breakpoint(); } } while (0); |
| 331 | } |
| 332 | break; |
| 333 | |
| 334 | case noOptimization: |
| 335 | // nothing to do |
| 336 | break; |
| 337 | |
| 338 | default: |
| 339 | assert(false, "other states not allowed at this time")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 339, "assert(" "false" ") failed", "other states not allowed at this time" ); ::breakpoint(); } } while (0); |
| 340 | } |
| 341 | } |
| 342 | |
| 343 | // called during register allocation |
| 344 | void LinearScan::change_spill_state(Interval* interval, int spill_pos) { |
| 345 | switch (interval->spill_state()) { |
| 346 | case oneDefinitionFound: { |
| 347 | int def_loop_depth = block_of_op_with_id(interval->spill_definition_pos())->loop_depth(); |
| 348 | int spill_loop_depth = block_of_op_with_id(spill_pos)->loop_depth(); |
| 349 | |
| 350 | if (def_loop_depth < spill_loop_depth) { |
| 351 | // the loop depth of the spilling position is higher then the loop depth |
| 352 | // at the definition of the interval -> move write to memory out of loop |
| 353 | // by storing at definitin of the interval |
| 354 | interval->set_spill_state(storeAtDefinition); |
| 355 | } else { |
| 356 | // the interval is currently spilled only once, so for now there is no |
| 357 | // reason to store the interval at the definition |
| 358 | interval->set_spill_state(oneMoveInserted); |
| 359 | } |
| 360 | break; |
| 361 | } |
| 362 | |
| 363 | case oneMoveInserted: { |
| 364 | // the interval is spilled more then once, so it is better to store it to |
| 365 | // memory at the definition |
| 366 | interval->set_spill_state(storeAtDefinition); |
| 367 | break; |
| 368 | } |
| 369 | |
| 370 | case storeAtDefinition: |
| 371 | case startInMemory: |
| 372 | case noOptimization: |
| 373 | case noDefinitionFound: |
| 374 | // nothing to do |
| 375 | break; |
| 376 | |
| 377 | default: |
| 378 | assert(false, "other states not allowed at this time")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 378, "assert(" "false" ") failed", "other states not allowed at this time" ); ::breakpoint(); } } while (0); |
| 379 | } |
| 380 | } |
| 381 | |
| 382 | |
| 383 | bool LinearScan::must_store_at_definition(const Interval* i) { |
| 384 | return i->is_split_parent() && i->spill_state() == storeAtDefinition; |
| 385 | } |
| 386 | |
| 387 | // called once before asignment of register numbers |
| 388 | void LinearScan::eliminate_spill_moves() { |
| 389 | TIME_LINEAR_SCAN(timer_eliminate_spill_moves)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_eliminate_spill_moves), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 390 | TRACE_LINEAR_SCAN(3, tty->print_cr("***** Eliminating unnecessary spill moves"))if (TraceLinearScanLevel >= 3) { tty->print_cr("***** Eliminating unnecessary spill moves" ); }; |
| 391 | |
| 392 | // collect all intervals that must be stored after their definion. |
| 393 | // the list is sorted by Interval::spill_definition_pos |
| 394 | Interval* interval; |
| 395 | Interval* temp_list; |
| 396 | create_unhandled_lists(&interval, &temp_list, must_store_at_definition, NULL__null); |
| 397 | |
| 398 | #ifdef ASSERT1 |
| 399 | Interval* prev = NULL__null; |
| 400 | Interval* temp = interval; |
| 401 | while (temp != Interval::end()) { |
| 402 | assert(temp->spill_definition_pos() > 0, "invalid spill definition pos")do { if (!(temp->spill_definition_pos() > 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 402, "assert(" "temp->spill_definition_pos() > 0" ") failed" , "invalid spill definition pos"); ::breakpoint(); } } while ( 0); |
| 403 | if (prev != NULL__null) { |
| 404 | assert(temp->from() >= prev->from(), "intervals not sorted")do { if (!(temp->from() >= prev->from())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 404, "assert(" "temp->from() >= prev->from()" ") failed" , "intervals not sorted"); ::breakpoint(); } } while (0); |
| 405 | assert(temp->spill_definition_pos() >= prev->spill_definition_pos(), "when intervals are sorted by from, then they must also be sorted by spill_definition_pos")do { if (!(temp->spill_definition_pos() >= prev->spill_definition_pos ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 405, "assert(" "temp->spill_definition_pos() >= prev->spill_definition_pos()" ") failed", "when intervals are sorted by from, then they must also be sorted by spill_definition_pos" ); ::breakpoint(); } } while (0); |
| 406 | } |
| 407 | |
| 408 | assert(temp->canonical_spill_slot() >= LinearScan::nof_regs, "interval has no spill slot assigned")do { if (!(temp->canonical_spill_slot() >= LinearScan:: nof_regs)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 408, "assert(" "temp->canonical_spill_slot() >= LinearScan::nof_regs" ") failed", "interval has no spill slot assigned"); ::breakpoint (); } } while (0); |
| 409 | assert(temp->spill_definition_pos() >= temp->from(), "invalid order")do { if (!(temp->spill_definition_pos() >= temp->from ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 409, "assert(" "temp->spill_definition_pos() >= temp->from()" ") failed", "invalid order"); ::breakpoint(); } } while (0); |
| 410 | assert(temp->spill_definition_pos() <= temp->from() + 2, "only intervals defined once at their start-pos can be optimized")do { if (!(temp->spill_definition_pos() <= temp->from () + 2)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 410, "assert(" "temp->spill_definition_pos() <= temp->from() + 2" ") failed", "only intervals defined once at their start-pos can be optimized" ); ::breakpoint(); } } while (0); |
| 411 | |
| 412 | TRACE_LINEAR_SCAN(4, tty->print_cr("interval %d (from %d to %d) must be stored at %d", temp->reg_num(), temp->from(), temp->to(), temp->spill_definition_pos()))if (TraceLinearScanLevel >= 4) { tty->print_cr("interval %d (from %d to %d) must be stored at %d" , temp->reg_num(), temp->from(), temp->to(), temp-> spill_definition_pos()); }; |
| 413 | |
| 414 | temp = temp->next(); |
| 415 | } |
| 416 | #endif |
| 417 | |
| 418 | LIR_InsertionBuffer insertion_buffer; |
| 419 | int num_blocks = block_count(); |
| 420 | for (int i = 0; i < num_blocks; i++) { |
| 421 | BlockBegin* block = block_at(i); |
| 422 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 423 | int num_inst = instructions->length(); |
| 424 | bool has_new = false; |
| 425 | |
| 426 | // iterate all instructions of the block. skip the first because it is always a label |
| 427 | for (int j = 1; j < num_inst; j++) { |
| 428 | LIR_Op* op = instructions->at(j); |
| 429 | int op_id = op->id(); |
| 430 | |
| 431 | if (op_id == -1) { |
| 432 | // remove move from register to stack if the stack slot is guaranteed to be correct. |
| 433 | // only moves that have been inserted by LinearScan can be removed. |
| 434 | assert(op->code() == lir_move, "only moves can have a op_id of -1")do { if (!(op->code() == lir_move)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 434, "assert(" "op->code() == lir_move" ") failed", "only moves can have a op_id of -1" ); ::breakpoint(); } } while (0); |
| 435 | assert(op->as_Op1() != NULL, "move must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 435, "assert(" "op->as_Op1() != __null" ") failed", "move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 436 | assert(op->as_Op1()->result_opr()->is_virtual(), "LinearScan inserts only moves to virtual registers")do { if (!(op->as_Op1()->result_opr()->is_virtual()) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 436, "assert(" "op->as_Op1()->result_opr()->is_virtual()" ") failed", "LinearScan inserts only moves to virtual registers" ); ::breakpoint(); } } while (0); |
| 437 | |
| 438 | LIR_Op1* op1 = (LIR_Op1*)op; |
| 439 | Interval* interval = interval_at(op1->result_opr()->vreg_number()); |
| 440 | |
| 441 | if (interval->assigned_reg() >= LinearScan::nof_regs && interval->always_in_memory()) { |
| 442 | // move target is a stack slot that is always correct, so eliminate instruction |
| 443 | TRACE_LINEAR_SCAN(4, tty->print_cr("eliminating move from interval %d to %d", op1->in_opr()->vreg_number(), op1->result_opr()->vreg_number()))if (TraceLinearScanLevel >= 4) { tty->print_cr("eliminating move from interval %d to %d" , op1->in_opr()->vreg_number(), op1->result_opr()-> vreg_number()); }; |
| 444 | instructions->at_put(j, NULL__null); // NULL-instructions are deleted by assign_reg_num |
| 445 | } |
| 446 | |
| 447 | } else { |
| 448 | // insert move from register to stack just after the beginning of the interval |
| 449 | assert(interval == Interval::end() || interval->spill_definition_pos() >= op_id, "invalid order")do { if (!(interval == Interval::end() || interval->spill_definition_pos () >= op_id)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 449, "assert(" "interval == Interval::end() || interval->spill_definition_pos() >= op_id" ") failed", "invalid order"); ::breakpoint(); } } while (0); |
| 450 | assert(interval == Interval::end() || (interval->is_split_parent() && interval->spill_state() == storeAtDefinition), "invalid interval")do { if (!(interval == Interval::end() || (interval->is_split_parent () && interval->spill_state() == storeAtDefinition ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 450, "assert(" "interval == Interval::end() || (interval->is_split_parent() && interval->spill_state() == storeAtDefinition)" ") failed", "invalid interval"); ::breakpoint(); } } while ( 0); |
| 451 | |
| 452 | while (interval != Interval::end() && interval->spill_definition_pos() == op_id) { |
| 453 | if (!has_new) { |
| 454 | // prepare insertion buffer (appended when all instructions of the block are processed) |
| 455 | insertion_buffer.init(block->lir()); |
| 456 | has_new = true; |
| 457 | } |
| 458 | |
| 459 | LIR_Opr from_opr = operand_for_interval(interval); |
| 460 | LIR_Opr to_opr = canonical_spill_opr(interval); |
| 461 | assert(from_opr->is_fixed_cpu() || from_opr->is_fixed_fpu(), "from operand must be a register")do { if (!(from_opr->is_fixed_cpu() || from_opr->is_fixed_fpu ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 461, "assert(" "from_opr->is_fixed_cpu() || from_opr->is_fixed_fpu()" ") failed", "from operand must be a register"); ::breakpoint (); } } while (0); |
| 462 | assert(to_opr->is_stack(), "to operand must be a stack slot")do { if (!(to_opr->is_stack())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 462, "assert(" "to_opr->is_stack()" ") failed", "to operand must be a stack slot" ); ::breakpoint(); } } while (0); |
| 463 | |
| 464 | insertion_buffer.move(j, from_opr, to_opr); |
| 465 | TRACE_LINEAR_SCAN(4, tty->print_cr("inserting move after definition of interval %d to stack slot %d at op_id %d", interval->reg_num(), interval->canonical_spill_slot() - LinearScan::nof_regs, op_id))if (TraceLinearScanLevel >= 4) { tty->print_cr("inserting move after definition of interval %d to stack slot %d at op_id %d" , interval->reg_num(), interval->canonical_spill_slot() - LinearScan::nof_regs, op_id); }; |
| 466 | |
| 467 | interval = interval->next(); |
| 468 | } |
| 469 | } |
| 470 | } // end of instruction iteration |
| 471 | |
| 472 | if (has_new) { |
| 473 | block->lir()->append(&insertion_buffer); |
| 474 | } |
| 475 | } // end of block iteration |
| 476 | |
| 477 | assert(interval == Interval::end(), "missed an interval")do { if (!(interval == Interval::end())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 477, "assert(" "interval == Interval::end()" ") failed", "missed an interval" ); ::breakpoint(); } } while (0); |
| 478 | } |
| 479 | |
| 480 | |
| 481 | // ********** Phase 1: number all instructions in all blocks |
| 482 | // Compute depth-first and linear scan block orders, and number LIR_Op nodes for linear scan. |
| 483 | |
| 484 | void LinearScan::number_instructions() { |
| 485 | { |
| 486 | // dummy-timer to measure the cost of the timer itself |
| 487 | // (this time is then subtracted from all other timers to get the real value) |
| 488 | TIME_LINEAR_SCAN(timer_do_nothing)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_do_nothing), TimeLinearScan || TimeEachLinearScan, Verbose );; |
| 489 | } |
| 490 | TIME_LINEAR_SCAN(timer_number_instructions)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_number_instructions), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 491 | |
| 492 | // Assign IDs to LIR nodes and build a mapping, lir_ops, from ID to LIR_Op node. |
| 493 | int num_blocks = block_count(); |
| 494 | int num_instructions = 0; |
| 495 | int i; |
| 496 | for (i = 0; i < num_blocks; i++) { |
| 497 | num_instructions += block_at(i)->lir()->instructions_list()->length(); |
| 498 | } |
| 499 | |
| 500 | // initialize with correct length |
| 501 | _lir_ops = LIR_OpArray(num_instructions, num_instructions, NULL__null); |
| 502 | _block_of_op = BlockBeginArray(num_instructions, num_instructions, NULL__null); |
| 503 | |
| 504 | int op_id = 0; |
| 505 | int idx = 0; |
| 506 | |
| 507 | for (i = 0; i < num_blocks; i++) { |
| 508 | BlockBegin* block = block_at(i); |
| 509 | block->set_first_lir_instruction_id(op_id); |
| 510 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 511 | |
| 512 | int num_inst = instructions->length(); |
| 513 | for (int j = 0; j < num_inst; j++) { |
| 514 | LIR_Op* op = instructions->at(j); |
| 515 | op->set_id(op_id); |
| 516 | |
| 517 | _lir_ops.at_put(idx, op); |
| 518 | _block_of_op.at_put(idx, block); |
| 519 | assert(lir_op_with_id(op_id) == op, "must match")do { if (!(lir_op_with_id(op_id) == op)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 519, "assert(" "lir_op_with_id(op_id) == op" ") failed", "must match" ); ::breakpoint(); } } while (0); |
| 520 | |
| 521 | idx++; |
| 522 | op_id += 2; // numbering of lir_ops by two |
| 523 | } |
| 524 | block->set_last_lir_instruction_id(op_id - 2); |
| 525 | } |
| 526 | assert(idx == num_instructions, "must match")do { if (!(idx == num_instructions)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 526, "assert(" "idx == num_instructions" ") failed", "must match" ); ::breakpoint(); } } while (0); |
| 527 | assert(idx * 2 == op_id, "must match")do { if (!(idx * 2 == op_id)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 527, "assert(" "idx * 2 == op_id" ") failed", "must match") ; ::breakpoint(); } } while (0); |
| 528 | |
| 529 | _has_call.initialize(num_instructions); |
| 530 | _has_info.initialize(num_instructions); |
| 531 | } |
| 532 | |
| 533 | |
| 534 | // ********** Phase 2: compute local live sets separately for each block |
| 535 | // (sets live_gen and live_kill for each block) |
| 536 | |
| 537 | void LinearScan::set_live_gen_kill(Value value, LIR_Op* op, BitMap& live_gen, BitMap& live_kill) { |
| 538 | LIR_Opr opr = value->operand(); |
| 539 | Constant* con = value->as_Constant(); |
| 540 | |
| 541 | // check some asumptions about debug information |
| 542 | assert(!value->type()->is_illegal(), "if this local is used by the interpreter it shouldn't be of indeterminate type")do { if (!(!value->type()->is_illegal())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 542, "assert(" "!value->type()->is_illegal()" ") failed" , "if this local is used by the interpreter it shouldn't be of indeterminate type" ); ::breakpoint(); } } while (0); |
| 543 | assert(con == NULL || opr->is_virtual() || opr->is_constant() || opr->is_illegal(), "asumption: Constant instructions have only constant operands")do { if (!(con == __null || opr->is_virtual() || opr->is_constant () || opr->is_illegal())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 543, "assert(" "con == __null || opr->is_virtual() || opr->is_constant() || opr->is_illegal()" ") failed", "asumption: Constant instructions have only constant operands" ); ::breakpoint(); } } while (0); |
| 544 | assert(con != NULL || opr->is_virtual(), "asumption: non-Constant instructions have only virtual operands")do { if (!(con != __null || opr->is_virtual())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 544, "assert(" "con != __null || opr->is_virtual()" ") failed" , "asumption: non-Constant instructions have only virtual operands" ); ::breakpoint(); } } while (0); |
| 545 | |
| 546 | if ((con == NULL__null || con->is_pinned()) && opr->is_register()) { |
| 547 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 547, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 548 | int reg = opr->vreg_number(); |
| 549 | if (!live_kill.at(reg)) { |
| 550 | live_gen.set_bit(reg); |
| 551 | TRACE_LINEAR_SCAN(4, tty->print_cr(" Setting live_gen for value %c%d, LIR op_id %d, register number %d", value->type()->tchar(), value->id(), op->id(), reg))if (TraceLinearScanLevel >= 4) { tty->print_cr(" Setting live_gen for value %c%d, LIR op_id %d, register number %d" , value->type()->tchar(), value->id(), op->id(), reg ); }; |
| 552 | } |
| 553 | } |
| 554 | } |
| 555 | |
| 556 | |
| 557 | void LinearScan::compute_local_live_sets() { |
| 558 | TIME_LINEAR_SCAN(timer_compute_local_live_sets)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_compute_local_live_sets), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 559 | |
| 560 | int num_blocks = block_count(); |
| 561 | int live_size = live_set_size(); |
| 562 | bool local_has_fpu_registers = false; |
| 563 | int local_num_calls = 0; |
| 564 | LIR_OpVisitState visitor; |
| 565 | |
| 566 | BitMap2D local_interval_in_loop = BitMap2D(_num_virtual_regs, num_loops()); |
| 567 | |
| 568 | // iterate all blocks |
| 569 | for (int i = 0; i < num_blocks; i++) { |
| 570 | BlockBegin* block = block_at(i); |
| 571 | |
| 572 | ResourceBitMap live_gen(live_size); |
| 573 | ResourceBitMap live_kill(live_size); |
| 574 | |
| 575 | if (block->is_set(BlockBegin::exception_entry_flag)) { |
| 576 | // Phi functions at the begin of an exception handler are |
| 577 | // implicitly defined (= killed) at the beginning of the block. |
| 578 | for_each_phi_fun(block, phi,{ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__580 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__580 && (value = cur_state-> stack_at(cur_index), true); cur_index += value->type()-> size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal()) { live_kill .set_bit(phi->operand()->vreg_number()); }; } } } { int temp__580 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__580 && (value = cur_state->local_at (cur_index), true); cur_index += (value == __null || value-> type()->is_illegal() ? 1 : value->type()->size())) if (value != __null) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { live_kill.set_bit(phi->operand()->vreg_number()); }; } } } } |
| 579 | if (!phi->is_illegal()) { live_kill.set_bit(phi->operand()->vreg_number()); }{ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__580 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__580 && (value = cur_state-> stack_at(cur_index), true); cur_index += value->type()-> size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal()) { live_kill .set_bit(phi->operand()->vreg_number()); }; } } } { int temp__580 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__580 && (value = cur_state->local_at (cur_index), true); cur_index += (value == __null || value-> type()->is_illegal() ? 1 : value->type()->size())) if (value != __null) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { live_kill.set_bit(phi->operand()->vreg_number()); }; } } } } |
| 580 | ){ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__580 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__580 && (value = cur_state-> stack_at(cur_index), true); cur_index += value->type()-> size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal()) { live_kill .set_bit(phi->operand()->vreg_number()); }; } } } { int temp__580 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__580 && (value = cur_state->local_at (cur_index), true); cur_index += (value == __null || value-> type()->is_illegal() ? 1 : value->type()->size())) if (value != __null) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { live_kill.set_bit(phi->operand()->vreg_number()); }; } } } }; |
| 581 | } |
| 582 | |
| 583 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 584 | int num_inst = instructions->length(); |
| 585 | |
| 586 | // iterate all instructions of the block. skip the first because it is always a label |
| 587 | assert(visitor.no_operands(instructions->at(0)), "first operation must always be a label")do { if (!(visitor.no_operands(instructions->at(0)))) { (* g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 587, "assert(" "visitor.no_operands(instructions->at(0))" ") failed", "first operation must always be a label"); ::breakpoint (); } } while (0); |
| 588 | for (int j = 1; j < num_inst; j++) { |
| 589 | LIR_Op* op = instructions->at(j); |
| 590 | |
| 591 | // visit operation to collect all operands |
| 592 | visitor.visit(op); |
| 593 | |
| 594 | if (visitor.has_call()) { |
| 595 | _has_call.set_bit(op->id() >> 1); |
| 596 | local_num_calls++; |
| 597 | } |
| 598 | if (visitor.info_count() > 0) { |
| 599 | _has_info.set_bit(op->id() >> 1); |
| 600 | } |
| 601 | |
| 602 | // iterate input operands of instruction |
| 603 | int k, n, reg; |
| 604 | n = visitor.opr_count(LIR_OpVisitState::inputMode); |
| 605 | for (k = 0; k < n; k++) { |
| 606 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::inputMode, k); |
| 607 | assert(opr->is_register(), "visitor should only return register operands")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 607, "assert(" "opr->is_register()" ") failed", "visitor should only return register operands" ); ::breakpoint(); } } while (0); |
| 608 | |
| 609 | if (opr->is_virtual_register()) { |
| 610 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 610, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 611 | reg = opr->vreg_number(); |
| 612 | if (!live_kill.at(reg)) { |
| 613 | live_gen.set_bit(reg); |
| 614 | TRACE_LINEAR_SCAN(4, tty->print_cr(" Setting live_gen for register %d at instruction %d", reg, op->id()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" Setting live_gen for register %d at instruction %d" , reg, op->id()); }; |
| 615 | } |
| 616 | if (block->loop_index() >= 0) { |
| 617 | local_interval_in_loop.set_bit(reg, block->loop_index()); |
| 618 | } |
| 619 | local_has_fpu_registers = local_has_fpu_registers || opr->is_virtual_fpu(); |
| 620 | } |
| 621 | |
| 622 | #ifdef ASSERT1 |
| 623 | // fixed intervals are never live at block boundaries, so |
| 624 | // they need not be processed in live sets. |
| 625 | // this is checked by these assertions to be sure about it. |
| 626 | // the entry block may have incoming values in registers, which is ok. |
| 627 | if (!opr->is_virtual_register() && block != ir()->start()) { |
| 628 | reg = reg_num(opr); |
| 629 | if (is_processed_reg_num(reg)) { |
| 630 | assert(live_kill.at(reg), "using fixed register that is not defined in this block")do { if (!(live_kill.at(reg))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 630, "assert(" "live_kill.at(reg)" ") failed", "using fixed register that is not defined in this block" ); ::breakpoint(); } } while (0); |
| 631 | } |
| 632 | reg = reg_numHi(opr); |
| 633 | if (is_valid_reg_num(reg) && is_processed_reg_num(reg)) { |
| 634 | assert(live_kill.at(reg), "using fixed register that is not defined in this block")do { if (!(live_kill.at(reg))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 634, "assert(" "live_kill.at(reg)" ") failed", "using fixed register that is not defined in this block" ); ::breakpoint(); } } while (0); |
| 635 | } |
| 636 | } |
| 637 | #endif |
| 638 | } |
| 639 | |
| 640 | // Add uses of live locals from interpreter's point of view for proper debug information generation |
| 641 | n = visitor.info_count(); |
| 642 | for (k = 0; k < n; k++) { |
| 643 | CodeEmitInfo* info = visitor.info_at(k); |
| 644 | ValueStack* stack = info->stack(); |
| 645 | for_each_state_value(stack, value,{ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__648 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { set_live_gen_kill(value, op, live_gen , live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } { int temp__648 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state->stack_at(cur_index ), true); cur_index += value->type()->size()) { set_live_gen_kill (value, op, live_gen, live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } } } |
| 646 | set_live_gen_kill(value, op, live_gen, live_kill);{ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__648 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { set_live_gen_kill(value, op, live_gen , live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } { int temp__648 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state->stack_at(cur_index ), true); cur_index += value->type()->size()) { set_live_gen_kill (value, op, live_gen, live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } } } |
| 647 | local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();{ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__648 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { set_live_gen_kill(value, op, live_gen , live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } { int temp__648 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state->stack_at(cur_index ), true); cur_index += value->type()->size()) { set_live_gen_kill (value, op, live_gen, live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } } } |
| 648 | ){ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__648 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { set_live_gen_kill(value, op, live_gen , live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } { int temp__648 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__648 && (value = cur_state->stack_at(cur_index ), true); cur_index += value->type()->size()) { set_live_gen_kill (value, op, live_gen, live_kill); local_has_fpu_registers = local_has_fpu_registers || value->type()->is_float_kind();; } } } }; |
| 649 | } |
| 650 | |
| 651 | // iterate temp operands of instruction |
| 652 | n = visitor.opr_count(LIR_OpVisitState::tempMode); |
| 653 | for (k = 0; k < n; k++) { |
| 654 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::tempMode, k); |
| 655 | assert(opr->is_register(), "visitor should only return register operands")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 655, "assert(" "opr->is_register()" ") failed", "visitor should only return register operands" ); ::breakpoint(); } } while (0); |
| 656 | |
| 657 | if (opr->is_virtual_register()) { |
| 658 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 658, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 659 | reg = opr->vreg_number(); |
| 660 | live_kill.set_bit(reg); |
| 661 | if (block->loop_index() >= 0) { |
| 662 | local_interval_in_loop.set_bit(reg, block->loop_index()); |
| 663 | } |
| 664 | local_has_fpu_registers = local_has_fpu_registers || opr->is_virtual_fpu(); |
| 665 | } |
| 666 | |
| 667 | #ifdef ASSERT1 |
| 668 | // fixed intervals are never live at block boundaries, so |
| 669 | // they need not be processed in live sets |
| 670 | // process them only in debug mode so that this can be checked |
| 671 | if (!opr->is_virtual_register()) { |
| 672 | reg = reg_num(opr); |
| 673 | if (is_processed_reg_num(reg)) { |
| 674 | live_kill.set_bit(reg_num(opr)); |
| 675 | } |
| 676 | reg = reg_numHi(opr); |
| 677 | if (is_valid_reg_num(reg) && is_processed_reg_num(reg)) { |
| 678 | live_kill.set_bit(reg); |
| 679 | } |
| 680 | } |
| 681 | #endif |
| 682 | } |
| 683 | |
| 684 | // iterate output operands of instruction |
| 685 | n = visitor.opr_count(LIR_OpVisitState::outputMode); |
| 686 | for (k = 0; k < n; k++) { |
| 687 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::outputMode, k); |
| 688 | assert(opr->is_register(), "visitor should only return register operands")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 688, "assert(" "opr->is_register()" ") failed", "visitor should only return register operands" ); ::breakpoint(); } } while (0); |
| 689 | |
| 690 | if (opr->is_virtual_register()) { |
| 691 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 691, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 692 | reg = opr->vreg_number(); |
| 693 | live_kill.set_bit(reg); |
| 694 | if (block->loop_index() >= 0) { |
| 695 | local_interval_in_loop.set_bit(reg, block->loop_index()); |
| 696 | } |
| 697 | local_has_fpu_registers = local_has_fpu_registers || opr->is_virtual_fpu(); |
| 698 | } |
| 699 | |
| 700 | #ifdef ASSERT1 |
| 701 | // fixed intervals are never live at block boundaries, so |
| 702 | // they need not be processed in live sets |
| 703 | // process them only in debug mode so that this can be checked |
| 704 | if (!opr->is_virtual_register()) { |
| 705 | reg = reg_num(opr); |
| 706 | if (is_processed_reg_num(reg)) { |
| 707 | live_kill.set_bit(reg_num(opr)); |
| 708 | } |
| 709 | reg = reg_numHi(opr); |
| 710 | if (is_valid_reg_num(reg) && is_processed_reg_num(reg)) { |
| 711 | live_kill.set_bit(reg); |
| 712 | } |
| 713 | } |
| 714 | #endif |
| 715 | } |
| 716 | } // end of instruction iteration |
| 717 | |
| 718 | block->set_live_gen (live_gen); |
| 719 | block->set_live_kill(live_kill); |
| 720 | block->set_live_in (ResourceBitMap(live_size)); |
| 721 | block->set_live_out (ResourceBitMap(live_size)); |
| 722 | |
| 723 | TRACE_LINEAR_SCAN(4, tty->print("live_gen B%d ", block->block_id()); print_bitmap(block->live_gen()))if (TraceLinearScanLevel >= 4) { tty->print("live_gen B%d " , block->block_id()); print_bitmap(block->live_gen()); }; |
| 724 | TRACE_LINEAR_SCAN(4, tty->print("live_kill B%d ", block->block_id()); print_bitmap(block->live_kill()))if (TraceLinearScanLevel >= 4) { tty->print("live_kill B%d " , block->block_id()); print_bitmap(block->live_kill()); }; |
| 725 | } // end of block iteration |
| 726 | |
| 727 | // propagate local calculated information into LinearScan object |
| 728 | _has_fpu_registers = local_has_fpu_registers; |
| 729 | compilation()->set_has_fpu_code(local_has_fpu_registers); |
| 730 | |
| 731 | _num_calls = local_num_calls; |
| 732 | _interval_in_loop = local_interval_in_loop; |
| 733 | } |
| 734 | |
| 735 | |
| 736 | // ********** Phase 3: perform a backward dataflow analysis to compute global live sets |
| 737 | // (sets live_in and live_out for each block) |
| 738 | |
| 739 | void LinearScan::compute_global_live_sets() { |
| 740 | TIME_LINEAR_SCAN(timer_compute_global_live_sets)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_compute_global_live_sets), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 741 | |
| 742 | int num_blocks = block_count(); |
| 743 | bool change_occurred; |
| 744 | bool change_occurred_in_block; |
| 745 | int iteration_count = 0; |
| 746 | ResourceBitMap live_out(live_set_size()); // scratch set for calculations |
| 747 | |
| 748 | // Perform a backward dataflow analysis to compute live_out and live_in for each block. |
| 749 | // The loop is executed until a fixpoint is reached (no changes in an iteration) |
| 750 | // Exception handlers must be processed because not all live values are |
| 751 | // present in the state array, e.g. because of global value numbering |
| 752 | do { |
| 753 | change_occurred = false; |
| 754 | |
| 755 | // iterate all blocks in reverse order |
| 756 | for (int i = num_blocks - 1; i >= 0; i--) { |
| 757 | BlockBegin* block = block_at(i); |
| 758 | |
| 759 | change_occurred_in_block = false; |
| 760 | |
| 761 | // live_out(block) is the union of live_in(sux), for successors sux of block |
| 762 | int n = block->number_of_sux(); |
| 763 | int e = block->number_of_exception_handlers(); |
| 764 | if (n + e > 0) { |
| 765 | // block has successors |
| 766 | if (n > 0) { |
| 767 | live_out.set_from(block->sux_at(0)->live_in()); |
| 768 | for (int j = 1; j < n; j++) { |
| 769 | live_out.set_union(block->sux_at(j)->live_in()); |
| 770 | } |
| 771 | } else { |
| 772 | live_out.clear(); |
| 773 | } |
| 774 | for (int j = 0; j < e; j++) { |
| 775 | live_out.set_union(block->exception_handler_at(j)->live_in()); |
| 776 | } |
| 777 | |
| 778 | if (!block->live_out().is_same(live_out)) { |
| 779 | // A change occurred. Swap the old and new live out sets to avoid copying. |
| 780 | ResourceBitMap temp = block->live_out(); |
| 781 | block->set_live_out(live_out); |
| 782 | live_out = temp; |
| 783 | |
| 784 | change_occurred = true; |
| 785 | change_occurred_in_block = true; |
| 786 | } |
| 787 | } |
| 788 | |
| 789 | if (iteration_count == 0 || change_occurred_in_block) { |
| 790 | // live_in(block) is the union of live_gen(block) with (live_out(block) & !live_kill(block)) |
| 791 | // note: live_in has to be computed only in first iteration or if live_out has changed! |
| 792 | ResourceBitMap live_in = block->live_in(); |
| 793 | live_in.set_from(block->live_out()); |
| 794 | live_in.set_difference(block->live_kill()); |
| 795 | live_in.set_union(block->live_gen()); |
| 796 | } |
| 797 | |
| 798 | #ifdef ASSERT1 |
| 799 | if (TraceLinearScanLevel >= 4) { |
| 800 | char c = ' '; |
| 801 | if (iteration_count == 0 || change_occurred_in_block) { |
| 802 | c = '*'; |
| 803 | } |
| 804 | tty->print("(%d) live_in%c B%d ", iteration_count, c, block->block_id()); print_bitmap(block->live_in()); |
| 805 | tty->print("(%d) live_out%c B%d ", iteration_count, c, block->block_id()); print_bitmap(block->live_out()); |
| 806 | } |
| 807 | #endif |
| 808 | } |
| 809 | iteration_count++; |
| 810 | |
| 811 | if (change_occurred && iteration_count > 50) { |
| 812 | BAILOUT("too many iterations in compute_global_live_sets"){ bailout("too many iterations in compute_global_live_sets"); return; }; |
| 813 | } |
| 814 | } while (change_occurred); |
| 815 | |
| 816 | |
| 817 | #ifdef ASSERT1 |
| 818 | // check that fixed intervals are not live at block boundaries |
| 819 | // (live set must be empty at fixed intervals) |
| 820 | for (int i = 0; i < num_blocks; i++) { |
| 821 | BlockBegin* block = block_at(i); |
| 822 | for (int j = 0; j < LIR_Opr::vreg_base; j++) { |
| 823 | assert(block->live_in().at(j) == false, "live_in set of fixed register must be empty")do { if (!(block->live_in().at(j) == false)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 823, "assert(" "block->live_in().at(j) == false" ") failed" , "live_in set of fixed register must be empty"); ::breakpoint (); } } while (0); |
| 824 | assert(block->live_out().at(j) == false, "live_out set of fixed register must be empty")do { if (!(block->live_out().at(j) == false)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 824, "assert(" "block->live_out().at(j) == false" ") failed" , "live_out set of fixed register must be empty"); ::breakpoint (); } } while (0); |
| 825 | assert(block->live_gen().at(j) == false, "live_gen set of fixed register must be empty")do { if (!(block->live_gen().at(j) == false)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 825, "assert(" "block->live_gen().at(j) == false" ") failed" , "live_gen set of fixed register must be empty"); ::breakpoint (); } } while (0); |
| 826 | } |
| 827 | } |
| 828 | #endif |
| 829 | |
| 830 | // check that the live_in set of the first block is empty |
| 831 | ResourceBitMap live_in_args(ir()->start()->live_in().size()); |
| 832 | if (!ir()->start()->live_in().is_same(live_in_args)) { |
| 833 | #ifdef ASSERT1 |
| 834 | tty->print_cr("Error: live_in set of first block must be empty (when this fails, virtual registers are used before they are defined)"); |
| 835 | tty->print_cr("affected registers:"); |
| 836 | print_bitmap(ir()->start()->live_in()); |
| 837 | |
| 838 | // print some additional information to simplify debugging |
| 839 | for (unsigned int i = 0; i < ir()->start()->live_in().size(); i++) { |
| 840 | if (ir()->start()->live_in().at(i)) { |
| 841 | Instruction* instr = gen()->instruction_for_vreg(i); |
| 842 | tty->print_cr("* vreg %d (HIR instruction %c%d)", i, instr == NULL__null ? ' ' : instr->type()->tchar(), instr == NULL__null ? 0 : instr->id()); |
| 843 | |
| 844 | for (int j = 0; j < num_blocks; j++) { |
| 845 | BlockBegin* block = block_at(j); |
| 846 | if (block->live_gen().at(i)) { |
| 847 | tty->print_cr(" used in block B%d", block->block_id()); |
| 848 | } |
| 849 | if (block->live_kill().at(i)) { |
| 850 | tty->print_cr(" defined in block B%d", block->block_id()); |
| 851 | } |
| 852 | } |
| 853 | } |
| 854 | } |
| 855 | |
| 856 | #endif |
| 857 | // when this fails, virtual registers are used before they are defined. |
| 858 | assert(false, "live_in set of first block must be empty")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 858, "assert(" "false" ") failed", "live_in set of first block must be empty" ); ::breakpoint(); } } while (0); |
| 859 | // bailout of if this occurs in product mode. |
| 860 | bailout("live_in set of first block not empty"); |
| 861 | } |
| 862 | } |
| 863 | |
| 864 | |
| 865 | // ********** Phase 4: build intervals |
| 866 | // (fills the list _intervals) |
| 867 | |
| 868 | void LinearScan::add_use(Value value, int from, int to, IntervalUseKind use_kind) { |
| 869 | assert(!value->type()->is_illegal(), "if this value is used by the interpreter it shouldn't be of indeterminate type")do { if (!(!value->type()->is_illegal())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 869, "assert(" "!value->type()->is_illegal()" ") failed" , "if this value is used by the interpreter it shouldn't be of indeterminate type" ); ::breakpoint(); } } while (0); |
| 870 | LIR_Opr opr = value->operand(); |
| 871 | Constant* con = value->as_Constant(); |
| 872 | |
| 873 | if ((con == NULL__null || con->is_pinned()) && opr->is_register()) { |
| 874 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 874, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 875 | add_use(opr, from, to, use_kind); |
| 876 | } |
| 877 | } |
| 878 | |
| 879 | |
| 880 | void LinearScan::add_def(LIR_Opr opr, int def_pos, IntervalUseKind use_kind) { |
| 881 | TRACE_LINEAR_SCAN(2, tty->print(" def "); opr->print(tty); tty->print_cr(" def_pos %d (%d)", def_pos, use_kind))if (TraceLinearScanLevel >= 2) { tty->print(" def "); opr ->print(tty); tty->print_cr(" def_pos %d (%d)", def_pos , use_kind); }; |
| 882 | assert(opr->is_register(), "should not be called otherwise")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 882, "assert(" "opr->is_register()" ") failed", "should not be called otherwise" ); ::breakpoint(); } } while (0); |
| 883 | |
| 884 | if (opr->is_virtual_register()) { |
| 885 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 885, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 886 | add_def(opr->vreg_number(), def_pos, use_kind, opr->type_register()); |
| 887 | |
| 888 | } else { |
| 889 | int reg = reg_num(opr); |
| 890 | if (is_processed_reg_num(reg)) { |
| 891 | add_def(reg, def_pos, use_kind, opr->type_register()); |
| 892 | } |
| 893 | reg = reg_numHi(opr); |
| 894 | if (is_valid_reg_num(reg) && is_processed_reg_num(reg)) { |
| 895 | add_def(reg, def_pos, use_kind, opr->type_register()); |
| 896 | } |
| 897 | } |
| 898 | } |
| 899 | |
| 900 | void LinearScan::add_use(LIR_Opr opr, int from, int to, IntervalUseKind use_kind) { |
| 901 | TRACE_LINEAR_SCAN(2, tty->print(" use "); opr->print(tty); tty->print_cr(" from %d to %d (%d)", from, to, use_kind))if (TraceLinearScanLevel >= 2) { tty->print(" use "); opr ->print(tty); tty->print_cr(" from %d to %d (%d)", from , to, use_kind); }; |
| 902 | assert(opr->is_register(), "should not be called otherwise")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 902, "assert(" "opr->is_register()" ") failed", "should not be called otherwise" ); ::breakpoint(); } } while (0); |
| 903 | |
| 904 | if (opr->is_virtual_register()) { |
| 905 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 905, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 906 | add_use(opr->vreg_number(), from, to, use_kind, opr->type_register()); |
| 907 | |
| 908 | } else { |
| 909 | int reg = reg_num(opr); |
| 910 | if (is_processed_reg_num(reg)) { |
| 911 | add_use(reg, from, to, use_kind, opr->type_register()); |
| 912 | } |
| 913 | reg = reg_numHi(opr); |
| 914 | if (is_valid_reg_num(reg) && is_processed_reg_num(reg)) { |
| 915 | add_use(reg, from, to, use_kind, opr->type_register()); |
| 916 | } |
| 917 | } |
| 918 | } |
| 919 | |
| 920 | void LinearScan::add_temp(LIR_Opr opr, int temp_pos, IntervalUseKind use_kind) { |
| 921 | TRACE_LINEAR_SCAN(2, tty->print(" temp "); opr->print(tty); tty->print_cr(" temp_pos %d (%d)", temp_pos, use_kind))if (TraceLinearScanLevel >= 2) { tty->print(" temp "); opr ->print(tty); tty->print_cr(" temp_pos %d (%d)", temp_pos , use_kind); }; |
| 922 | assert(opr->is_register(), "should not be called otherwise")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 922, "assert(" "opr->is_register()" ") failed", "should not be called otherwise" ); ::breakpoint(); } } while (0); |
| 923 | |
| 924 | if (opr->is_virtual_register()) { |
| 925 | assert(reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr)), "invalid optimization below")do { if (!(reg_num(opr) == opr->vreg_number() && ! is_valid_reg_num(reg_numHi(opr)))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 925, "assert(" "reg_num(opr) == opr->vreg_number() && !is_valid_reg_num(reg_numHi(opr))" ") failed", "invalid optimization below"); ::breakpoint(); } } while (0); |
| 926 | add_temp(opr->vreg_number(), temp_pos, use_kind, opr->type_register()); |
| 927 | |
| 928 | } else { |
| 929 | int reg = reg_num(opr); |
| 930 | if (is_processed_reg_num(reg)) { |
| 931 | add_temp(reg, temp_pos, use_kind, opr->type_register()); |
| 932 | } |
| 933 | reg = reg_numHi(opr); |
| 934 | if (is_valid_reg_num(reg) && is_processed_reg_num(reg)) { |
| 935 | add_temp(reg, temp_pos, use_kind, opr->type_register()); |
| 936 | } |
| 937 | } |
| 938 | } |
| 939 | |
| 940 | |
| 941 | void LinearScan::add_def(int reg_num, int def_pos, IntervalUseKind use_kind, BasicType type) { |
| 942 | Interval* interval = interval_at(reg_num); |
| 943 | if (interval != NULL__null) { |
| 944 | assert(interval->reg_num() == reg_num, "wrong interval")do { if (!(interval->reg_num() == reg_num)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 944, "assert(" "interval->reg_num() == reg_num" ") failed" , "wrong interval"); ::breakpoint(); } } while (0); |
| 945 | |
| 946 | if (type != T_ILLEGAL) { |
| 947 | interval->set_type(type); |
| 948 | } |
| 949 | |
| 950 | Range* r = interval->first(); |
| 951 | if (r->from() <= def_pos) { |
| 952 | // Update the starting point (when a range is first created for a use, its |
| 953 | // start is the beginning of the current block until a def is encountered.) |
| 954 | r->set_from(def_pos); |
| 955 | interval->add_use_pos(def_pos, use_kind); |
| 956 | |
| 957 | } else { |
| 958 | // Dead value - make vacuous interval |
| 959 | // also add use_kind for dead intervals |
| 960 | interval->add_range(def_pos, def_pos + 1); |
| 961 | interval->add_use_pos(def_pos, use_kind); |
| 962 | TRACE_LINEAR_SCAN(2, tty->print_cr("Warning: def of reg %d at %d occurs without use", reg_num, def_pos))if (TraceLinearScanLevel >= 2) { tty->print_cr("Warning: def of reg %d at %d occurs without use" , reg_num, def_pos); }; |
| 963 | } |
| 964 | |
| 965 | } else { |
| 966 | // Dead value - make vacuous interval |
| 967 | // also add use_kind for dead intervals |
| 968 | interval = create_interval(reg_num); |
| 969 | if (type != T_ILLEGAL) { |
| 970 | interval->set_type(type); |
| 971 | } |
| 972 | |
| 973 | interval->add_range(def_pos, def_pos + 1); |
| 974 | interval->add_use_pos(def_pos, use_kind); |
| 975 | TRACE_LINEAR_SCAN(2, tty->print_cr("Warning: dead value %d at %d in live intervals", reg_num, def_pos))if (TraceLinearScanLevel >= 2) { tty->print_cr("Warning: dead value %d at %d in live intervals" , reg_num, def_pos); }; |
| 976 | } |
| 977 | |
| 978 | change_spill_definition_pos(interval, def_pos); |
| 979 | if (use_kind == noUse && interval->spill_state() <= startInMemory) { |
| 980 | // detection of method-parameters and roundfp-results |
| 981 | // TODO: move this directly to position where use-kind is computed |
| 982 | interval->set_spill_state(startInMemory); |
| 983 | } |
| 984 | } |
| 985 | |
| 986 | void LinearScan::add_use(int reg_num, int from, int to, IntervalUseKind use_kind, BasicType type) { |
| 987 | Interval* interval = interval_at(reg_num); |
| 988 | if (interval == NULL__null) { |
| 989 | interval = create_interval(reg_num); |
| 990 | } |
| 991 | assert(interval->reg_num() == reg_num, "wrong interval")do { if (!(interval->reg_num() == reg_num)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 991, "assert(" "interval->reg_num() == reg_num" ") failed" , "wrong interval"); ::breakpoint(); } } while (0); |
| 992 | |
| 993 | if (type != T_ILLEGAL) { |
| 994 | interval->set_type(type); |
| 995 | } |
| 996 | |
| 997 | interval->add_range(from, to); |
| 998 | interval->add_use_pos(to, use_kind); |
| 999 | } |
| 1000 | |
| 1001 | void LinearScan::add_temp(int reg_num, int temp_pos, IntervalUseKind use_kind, BasicType type) { |
| 1002 | Interval* interval = interval_at(reg_num); |
| 1003 | if (interval == NULL__null) { |
| 1004 | interval = create_interval(reg_num); |
| 1005 | } |
| 1006 | assert(interval->reg_num() == reg_num, "wrong interval")do { if (!(interval->reg_num() == reg_num)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1006, "assert(" "interval->reg_num() == reg_num" ") failed" , "wrong interval"); ::breakpoint(); } } while (0); |
| 1007 | |
| 1008 | if (type != T_ILLEGAL) { |
| 1009 | interval->set_type(type); |
| 1010 | } |
| 1011 | |
| 1012 | interval->add_range(temp_pos, temp_pos + 1); |
| 1013 | interval->add_use_pos(temp_pos, use_kind); |
| 1014 | } |
| 1015 | |
| 1016 | |
| 1017 | // the results of this functions are used for optimizing spilling and reloading |
| 1018 | // if the functions return shouldHaveRegister and the interval is spilled, |
| 1019 | // it is not reloaded to a register. |
| 1020 | IntervalUseKind LinearScan::use_kind_of_output_operand(LIR_Op* op, LIR_Opr opr) { |
| 1021 | if (op->code() == lir_move) { |
| 1022 | assert(op->as_Op1() != NULL, "lir_move must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1022, "assert(" "op->as_Op1() != __null" ") failed", "lir_move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 1023 | LIR_Op1* move = (LIR_Op1*)op; |
| 1024 | LIR_Opr res = move->result_opr(); |
| 1025 | bool result_in_memory = res->is_virtual() && gen()->is_vreg_flag_set(res->vreg_number(), LIRGenerator::must_start_in_memory); |
| 1026 | |
| 1027 | if (result_in_memory) { |
| 1028 | // Begin of an interval with must_start_in_memory set. |
| 1029 | // This interval will always get a stack slot first, so return noUse. |
| 1030 | return noUse; |
| 1031 | |
| 1032 | } else if (move->in_opr()->is_stack()) { |
| 1033 | // method argument (condition must be equal to handle_method_arguments) |
| 1034 | return noUse; |
| 1035 | |
| 1036 | } else if (move->in_opr()->is_register() && move->result_opr()->is_register()) { |
| 1037 | // Move from register to register |
| 1038 | if (block_of_op_with_id(op->id())->is_set(BlockBegin::osr_entry_flag)) { |
| 1039 | // special handling of phi-function moves inside osr-entry blocks |
| 1040 | // input operand must have a register instead of output operand (leads to better register allocation) |
| 1041 | return shouldHaveRegister; |
| 1042 | } |
| 1043 | } |
| 1044 | } |
| 1045 | |
| 1046 | if (opr->is_virtual() && |
| 1047 | gen()->is_vreg_flag_set(opr->vreg_number(), LIRGenerator::must_start_in_memory)) { |
| 1048 | // result is a stack-slot, so prevent immediate reloading |
| 1049 | return noUse; |
| 1050 | } |
| 1051 | |
| 1052 | // all other operands require a register |
| 1053 | return mustHaveRegister; |
| 1054 | } |
| 1055 | |
| 1056 | IntervalUseKind LinearScan::use_kind_of_input_operand(LIR_Op* op, LIR_Opr opr) { |
| 1057 | if (op->code() == lir_move) { |
| 1058 | assert(op->as_Op1() != NULL, "lir_move must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1058, "assert(" "op->as_Op1() != __null" ") failed", "lir_move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 1059 | LIR_Op1* move = (LIR_Op1*)op; |
| 1060 | LIR_Opr res = move->result_opr(); |
| 1061 | bool result_in_memory = res->is_virtual() && gen()->is_vreg_flag_set(res->vreg_number(), LIRGenerator::must_start_in_memory); |
| 1062 | |
| 1063 | if (result_in_memory) { |
| 1064 | // Move to an interval with must_start_in_memory set. |
| 1065 | // To avoid moves from stack to stack (not allowed) force the input operand to a register |
| 1066 | return mustHaveRegister; |
| 1067 | |
| 1068 | } else if (move->in_opr()->is_register() && move->result_opr()->is_register()) { |
| 1069 | // Move from register to register |
| 1070 | if (block_of_op_with_id(op->id())->is_set(BlockBegin::osr_entry_flag)) { |
| 1071 | // special handling of phi-function moves inside osr-entry blocks |
| 1072 | // input operand must have a register instead of output operand (leads to better register allocation) |
| 1073 | return mustHaveRegister; |
| 1074 | } |
| 1075 | |
| 1076 | // The input operand is not forced to a register (moves from stack to register are allowed), |
| 1077 | // but it is faster if the input operand is in a register |
| 1078 | return shouldHaveRegister; |
| 1079 | } |
| 1080 | } |
| 1081 | |
| 1082 | |
| 1083 | #if defined(X86) || defined(S390) |
| 1084 | if (op->code() == lir_cmove) { |
| 1085 | // conditional moves can handle stack operands |
| 1086 | assert(op->result_opr()->is_register(), "result must always be in a register")do { if (!(op->result_opr()->is_register())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1086, "assert(" "op->result_opr()->is_register()" ") failed" , "result must always be in a register"); ::breakpoint(); } } while (0); |
| 1087 | return shouldHaveRegister; |
| 1088 | } |
| 1089 | |
| 1090 | // optimizations for second input operand of arithmehtic operations on Intel |
| 1091 | // this operand is allowed to be on the stack in some cases |
| 1092 | BasicType opr_type = opr->type_register(); |
| 1093 | if (opr_type == T_FLOAT || opr_type == T_DOUBLE) { |
| 1094 | if (IA32_ONLY( (UseSSE == 1 && opr_type == T_FLOAT) || UseSSE >= 2 ) NOT_IA32( true )true) { |
| 1095 | // SSE float instruction (T_DOUBLE only supported with SSE2) |
| 1096 | switch (op->code()) { |
| 1097 | case lir_cmp: |
| 1098 | case lir_add: |
| 1099 | case lir_sub: |
| 1100 | case lir_mul: |
| 1101 | case lir_div: |
| 1102 | { |
| 1103 | assert(op->as_Op2() != NULL, "must be LIR_Op2")do { if (!(op->as_Op2() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1103, "assert(" "op->as_Op2() != __null" ") failed", "must be LIR_Op2" ); ::breakpoint(); } } while (0); |
| 1104 | LIR_Op2* op2 = (LIR_Op2*)op; |
| 1105 | if (op2->in_opr1() != op2->in_opr2() && op2->in_opr2() == opr) { |
| 1106 | assert((op2->result_opr()->is_register() || op->code() == lir_cmp) && op2->in_opr1()->is_register(), "cannot mark second operand as stack if others are not in register")do { if (!((op2->result_opr()->is_register() || op-> code() == lir_cmp) && op2->in_opr1()->is_register ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1106, "assert(" "(op2->result_opr()->is_register() || op->code() == lir_cmp) && op2->in_opr1()->is_register()" ") failed", "cannot mark second operand as stack if others are not in register" ); ::breakpoint(); } } while (0); |
| 1107 | return shouldHaveRegister; |
| 1108 | } |
| 1109 | } |
| 1110 | default: |
| 1111 | break; |
| 1112 | } |
| 1113 | } else { |
| 1114 | // FPU stack float instruction |
| 1115 | switch (op->code()) { |
| 1116 | case lir_add: |
| 1117 | case lir_sub: |
| 1118 | case lir_mul: |
| 1119 | case lir_div: |
| 1120 | { |
| 1121 | assert(op->as_Op2() != NULL, "must be LIR_Op2")do { if (!(op->as_Op2() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1121, "assert(" "op->as_Op2() != __null" ") failed", "must be LIR_Op2" ); ::breakpoint(); } } while (0); |
| 1122 | LIR_Op2* op2 = (LIR_Op2*)op; |
| 1123 | if (op2->in_opr1() != op2->in_opr2() && op2->in_opr2() == opr) { |
| 1124 | assert((op2->result_opr()->is_register() || op->code() == lir_cmp) && op2->in_opr1()->is_register(), "cannot mark second operand as stack if others are not in register")do { if (!((op2->result_opr()->is_register() || op-> code() == lir_cmp) && op2->in_opr1()->is_register ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1124, "assert(" "(op2->result_opr()->is_register() || op->code() == lir_cmp) && op2->in_opr1()->is_register()" ") failed", "cannot mark second operand as stack if others are not in register" ); ::breakpoint(); } } while (0); |
| 1125 | return shouldHaveRegister; |
| 1126 | } |
| 1127 | } |
| 1128 | default: |
| 1129 | break; |
| 1130 | } |
| 1131 | } |
| 1132 | // We want to sometimes use logical operations on pointers, in particular in GC barriers. |
| 1133 | // Since 64bit logical operations do not current support operands on stack, we have to make sure |
| 1134 | // T_OBJECT doesn't get spilled along with T_LONG. |
| 1135 | } else if (opr_type != T_LONG LP64_ONLY(&& opr_type != T_OBJECT)&& opr_type != T_OBJECT) { |
| 1136 | // integer instruction (note: long operands must always be in register) |
| 1137 | switch (op->code()) { |
| 1138 | case lir_cmp: |
| 1139 | case lir_add: |
| 1140 | case lir_sub: |
| 1141 | case lir_logic_and: |
| 1142 | case lir_logic_or: |
| 1143 | case lir_logic_xor: |
| 1144 | { |
| 1145 | assert(op->as_Op2() != NULL, "must be LIR_Op2")do { if (!(op->as_Op2() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1145, "assert(" "op->as_Op2() != __null" ") failed", "must be LIR_Op2" ); ::breakpoint(); } } while (0); |
| 1146 | LIR_Op2* op2 = (LIR_Op2*)op; |
| 1147 | if (op2->in_opr1() != op2->in_opr2() && op2->in_opr2() == opr) { |
| 1148 | assert((op2->result_opr()->is_register() || op->code() == lir_cmp) && op2->in_opr1()->is_register(), "cannot mark second operand as stack if others are not in register")do { if (!((op2->result_opr()->is_register() || op-> code() == lir_cmp) && op2->in_opr1()->is_register ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1148, "assert(" "(op2->result_opr()->is_register() || op->code() == lir_cmp) && op2->in_opr1()->is_register()" ") failed", "cannot mark second operand as stack if others are not in register" ); ::breakpoint(); } } while (0); |
| 1149 | return shouldHaveRegister; |
| 1150 | } |
| 1151 | } |
| 1152 | default: |
| 1153 | break; |
| 1154 | } |
| 1155 | } |
| 1156 | #endif // X86 || S390 |
| 1157 | |
| 1158 | // all other operands require a register |
| 1159 | return mustHaveRegister; |
| 1160 | } |
| 1161 | |
| 1162 | |
| 1163 | void LinearScan::handle_method_arguments(LIR_Op* op) { |
| 1164 | // special handling for method arguments (moves from stack to virtual register): |
| 1165 | // the interval gets no register assigned, but the stack slot. |
| 1166 | // it is split before the first use by the register allocator. |
| 1167 | |
| 1168 | if (op->code() == lir_move) { |
| 1169 | assert(op->as_Op1() != NULL, "must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1169, "assert(" "op->as_Op1() != __null" ") failed", "must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 1170 | LIR_Op1* move = (LIR_Op1*)op; |
| 1171 | |
| 1172 | if (move->in_opr()->is_stack()) { |
| 1173 | #ifdef ASSERT1 |
| 1174 | int arg_size = compilation()->method()->arg_size(); |
| 1175 | LIR_Opr o = move->in_opr(); |
| 1176 | if (o->is_single_stack()) { |
| 1177 | assert(o->single_stack_ix() >= 0 && o->single_stack_ix() < arg_size, "out of range")do { if (!(o->single_stack_ix() >= 0 && o->single_stack_ix () < arg_size)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1177, "assert(" "o->single_stack_ix() >= 0 && o->single_stack_ix() < arg_size" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 1178 | } else if (o->is_double_stack()) { |
| 1179 | assert(o->double_stack_ix() >= 0 && o->double_stack_ix() < arg_size, "out of range")do { if (!(o->double_stack_ix() >= 0 && o->double_stack_ix () < arg_size)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1179, "assert(" "o->double_stack_ix() >= 0 && o->double_stack_ix() < arg_size" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 1180 | } else { |
| 1181 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1181); ::breakpoint(); } while (0); |
| 1182 | } |
| 1183 | |
| 1184 | assert(move->id() > 0, "invalid id")do { if (!(move->id() > 0)) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1184, "assert(" "move->id() > 0" ") failed", "invalid id" ); ::breakpoint(); } } while (0); |
| 1185 | assert(block_of_op_with_id(move->id())->number_of_preds() == 0, "move from stack must be in first block")do { if (!(block_of_op_with_id(move->id())->number_of_preds () == 0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1185, "assert(" "block_of_op_with_id(move->id())->number_of_preds() == 0" ") failed", "move from stack must be in first block"); ::breakpoint (); } } while (0); |
| 1186 | assert(move->result_opr()->is_virtual(), "result of move must be a virtual register")do { if (!(move->result_opr()->is_virtual())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1186, "assert(" "move->result_opr()->is_virtual()" ") failed" , "result of move must be a virtual register"); ::breakpoint( ); } } while (0); |
| 1187 | |
| 1188 | TRACE_LINEAR_SCAN(4, tty->print_cr("found move from stack slot %d to vreg %d", o->is_single_stack() ? o->single_stack_ix() : o->double_stack_ix(), reg_num(move->result_opr())))if (TraceLinearScanLevel >= 4) { tty->print_cr("found move from stack slot %d to vreg %d" , o->is_single_stack() ? o->single_stack_ix() : o->double_stack_ix (), reg_num(move->result_opr())); }; |
| 1189 | #endif |
| 1190 | |
| 1191 | Interval* interval = interval_at(reg_num(move->result_opr())); |
| 1192 | |
| 1193 | int stack_slot = LinearScan::nof_regs + (move->in_opr()->is_single_stack() ? move->in_opr()->single_stack_ix() : move->in_opr()->double_stack_ix()); |
| 1194 | interval->set_canonical_spill_slot(stack_slot); |
| 1195 | interval->assign_reg(stack_slot); |
| 1196 | } |
| 1197 | } |
| 1198 | } |
| 1199 | |
| 1200 | void LinearScan::handle_doubleword_moves(LIR_Op* op) { |
| 1201 | // special handling for doubleword move from memory to register: |
| 1202 | // in this case the registers of the input address and the result |
| 1203 | // registers must not overlap -> add a temp range for the input registers |
| 1204 | if (op->code() == lir_move) { |
| 1205 | assert(op->as_Op1() != NULL, "must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1205, "assert(" "op->as_Op1() != __null" ") failed", "must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 1206 | LIR_Op1* move = (LIR_Op1*)op; |
| 1207 | |
| 1208 | if (move->result_opr()->is_double_cpu() && move->in_opr()->is_pointer()) { |
| 1209 | LIR_Address* address = move->in_opr()->as_address_ptr(); |
| 1210 | if (address != NULL__null) { |
| 1211 | if (address->base()->is_valid()) { |
| 1212 | add_temp(address->base(), op->id(), noUse); |
| 1213 | } |
| 1214 | if (address->index()->is_valid()) { |
| 1215 | add_temp(address->index(), op->id(), noUse); |
| 1216 | } |
| 1217 | } |
| 1218 | } |
| 1219 | } |
| 1220 | } |
| 1221 | |
| 1222 | void LinearScan::add_register_hints(LIR_Op* op) { |
| 1223 | switch (op->code()) { |
| 1224 | case lir_move: // fall through |
| 1225 | case lir_convert: { |
| 1226 | assert(op->as_Op1() != NULL, "lir_move, lir_convert must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1226, "assert(" "op->as_Op1() != __null" ") failed", "lir_move, lir_convert must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 1227 | LIR_Op1* move = (LIR_Op1*)op; |
| 1228 | |
| 1229 | LIR_Opr move_from = move->in_opr(); |
| 1230 | LIR_Opr move_to = move->result_opr(); |
| 1231 | |
| 1232 | if (move_to->is_register() && move_from->is_register()) { |
| 1233 | Interval* from = interval_at(reg_num(move_from)); |
| 1234 | Interval* to = interval_at(reg_num(move_to)); |
| 1235 | if (from != NULL__null && to != NULL__null) { |
| 1236 | to->set_register_hint(from); |
| 1237 | TRACE_LINEAR_SCAN(4, tty->print_cr("operation at op_id %d: added hint from interval %d to %d", move->id(), from->reg_num(), to->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr("operation at op_id %d: added hint from interval %d to %d" , move->id(), from->reg_num(), to->reg_num()); }; |
| 1238 | } |
| 1239 | } |
| 1240 | break; |
| 1241 | } |
| 1242 | case lir_cmove: { |
| 1243 | assert(op->as_Op2() != NULL, "lir_cmove must be LIR_Op2")do { if (!(op->as_Op2() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1243, "assert(" "op->as_Op2() != __null" ") failed", "lir_cmove must be LIR_Op2" ); ::breakpoint(); } } while (0); |
| 1244 | LIR_Op2* cmove = (LIR_Op2*)op; |
| 1245 | |
| 1246 | LIR_Opr move_from = cmove->in_opr1(); |
| 1247 | LIR_Opr move_to = cmove->result_opr(); |
| 1248 | |
| 1249 | if (move_to->is_register() && move_from->is_register()) { |
| 1250 | Interval* from = interval_at(reg_num(move_from)); |
| 1251 | Interval* to = interval_at(reg_num(move_to)); |
| 1252 | if (from != NULL__null && to != NULL__null) { |
| 1253 | to->set_register_hint(from); |
| 1254 | TRACE_LINEAR_SCAN(4, tty->print_cr("operation at op_id %d: added hint from interval %d to %d", cmove->id(), from->reg_num(), to->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr("operation at op_id %d: added hint from interval %d to %d" , cmove->id(), from->reg_num(), to->reg_num()); }; |
| 1255 | } |
| 1256 | } |
| 1257 | break; |
| 1258 | } |
| 1259 | default: |
| 1260 | break; |
| 1261 | } |
| 1262 | } |
| 1263 | |
| 1264 | |
| 1265 | void LinearScan::build_intervals() { |
| 1266 | TIME_LINEAR_SCAN(timer_build_intervals)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_build_intervals), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 1267 | |
| 1268 | // initialize interval list with expected number of intervals |
| 1269 | // (32 is added to have some space for split children without having to resize the list) |
| 1270 | _intervals = IntervalList(num_virtual_regs() + 32); |
| 1271 | // initialize all slots that are used by build_intervals |
| 1272 | _intervals.at_put_grow(num_virtual_regs() - 1, NULL__null, NULL__null); |
| 1273 | |
| 1274 | // create a list with all caller-save registers (cpu, fpu, xmm) |
| 1275 | // when an instruction is a call, a temp range is created for all these registers |
| 1276 | int num_caller_save_registers = 0; |
| 1277 | int caller_save_registers[LinearScan::nof_regs]; |
| 1278 | |
| 1279 | int i; |
| 1280 | for (i = 0; i < FrameMap::nof_caller_save_cpu_regs(); i++) { |
| 1281 | LIR_Opr opr = FrameMap::caller_save_cpu_reg_at(i); |
| 1282 | assert(opr->is_valid() && opr->is_register(), "FrameMap should not return invalid operands")do { if (!(opr->is_valid() && opr->is_register( ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1282, "assert(" "opr->is_valid() && opr->is_register()" ") failed", "FrameMap should not return invalid operands"); :: breakpoint(); } } while (0); |
| 1283 | assert(reg_numHi(opr) == -1, "missing addition of range for hi-register")do { if (!(reg_numHi(opr) == -1)) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1283, "assert(" "reg_numHi(opr) == -1" ") failed", "missing addition of range for hi-register" ); ::breakpoint(); } } while (0); |
| 1284 | caller_save_registers[num_caller_save_registers++] = reg_num(opr); |
| 1285 | } |
| 1286 | |
| 1287 | // temp ranges for fpu registers are only created when the method has |
| 1288 | // virtual fpu operands. Otherwise no allocation for fpu registers is |
| 1289 | // performed and so the temp ranges would be useless |
| 1290 | if (has_fpu_registers()) { |
| 1291 | #ifdef X86 |
| 1292 | if (UseSSE < 2) { |
| 1293 | #endif // X86 |
| 1294 | for (i = 0; i < FrameMap::nof_caller_save_fpu_regs; i++) { |
| 1295 | LIR_Opr opr = FrameMap::caller_save_fpu_reg_at(i); |
| 1296 | assert(opr->is_valid() && opr->is_register(), "FrameMap should not return invalid operands")do { if (!(opr->is_valid() && opr->is_register( ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1296, "assert(" "opr->is_valid() && opr->is_register()" ") failed", "FrameMap should not return invalid operands"); :: breakpoint(); } } while (0); |
| 1297 | assert(reg_numHi(opr) == -1, "missing addition of range for hi-register")do { if (!(reg_numHi(opr) == -1)) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1297, "assert(" "reg_numHi(opr) == -1" ") failed", "missing addition of range for hi-register" ); ::breakpoint(); } } while (0); |
| 1298 | caller_save_registers[num_caller_save_registers++] = reg_num(opr); |
| 1299 | } |
| 1300 | #ifdef X86 |
| 1301 | } |
| 1302 | #endif // X86 |
| 1303 | |
| 1304 | #ifdef X86 |
| 1305 | if (UseSSE > 0) { |
| 1306 | int num_caller_save_xmm_regs = FrameMap::get_num_caller_save_xmms(); |
| 1307 | for (i = 0; i < num_caller_save_xmm_regs; i ++) { |
| 1308 | LIR_Opr opr = FrameMap::caller_save_xmm_reg_at(i); |
| 1309 | assert(opr->is_valid() && opr->is_register(), "FrameMap should not return invalid operands")do { if (!(opr->is_valid() && opr->is_register( ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1309, "assert(" "opr->is_valid() && opr->is_register()" ") failed", "FrameMap should not return invalid operands"); :: breakpoint(); } } while (0); |
| 1310 | assert(reg_numHi(opr) == -1, "missing addition of range for hi-register")do { if (!(reg_numHi(opr) == -1)) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1310, "assert(" "reg_numHi(opr) == -1" ") failed", "missing addition of range for hi-register" ); ::breakpoint(); } } while (0); |
| 1311 | caller_save_registers[num_caller_save_registers++] = reg_num(opr); |
| 1312 | } |
| 1313 | } |
| 1314 | #endif // X86 |
| 1315 | } |
| 1316 | assert(num_caller_save_registers <= LinearScan::nof_regs, "out of bounds")do { if (!(num_caller_save_registers <= LinearScan::nof_regs )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1316, "assert(" "num_caller_save_registers <= LinearScan::nof_regs" ") failed", "out of bounds"); ::breakpoint(); } } while (0); |
| 1317 | |
| 1318 | |
| 1319 | LIR_OpVisitState visitor; |
| 1320 | |
| 1321 | // iterate all blocks in reverse order |
| 1322 | for (i = block_count() - 1; i >= 0; i--) { |
| 1323 | BlockBegin* block = block_at(i); |
| 1324 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 1325 | int block_from = block->first_lir_instruction_id(); |
| 1326 | int block_to = block->last_lir_instruction_id(); |
| 1327 | |
| 1328 | assert(block_from == instructions->at(0)->id(), "must be")do { if (!(block_from == instructions->at(0)->id())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1328, "assert(" "block_from == instructions->at(0)->id()" ") failed", "must be"); ::breakpoint(); } } while (0); |
| 1329 | assert(block_to == instructions->at(instructions->length() - 1)->id(), "must be")do { if (!(block_to == instructions->at(instructions->length () - 1)->id())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1329, "assert(" "block_to == instructions->at(instructions->length() - 1)->id()" ") failed", "must be"); ::breakpoint(); } } while (0); |
| 1330 | |
| 1331 | // Update intervals for registers live at the end of this block; |
| 1332 | ResourceBitMap live = block->live_out(); |
| 1333 | int size = (int)live.size(); |
| 1334 | for (int number = (int)live.get_next_one_offset(0, size); number < size; number = (int)live.get_next_one_offset(number + 1, size)) { |
| 1335 | assert(live.at(number), "should not stop here otherwise")do { if (!(live.at(number))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1335, "assert(" "live.at(number)" ") failed", "should not stop here otherwise" ); ::breakpoint(); } } while (0); |
| 1336 | assert(number >= LIR_Opr::vreg_base, "fixed intervals must not be live on block bounds")do { if (!(number >= LIR_Opr::vreg_base)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1336, "assert(" "number >= LIR_Opr::vreg_base" ") failed" , "fixed intervals must not be live on block bounds"); ::breakpoint (); } } while (0); |
| 1337 | TRACE_LINEAR_SCAN(2, tty->print_cr("live in %d to %d", number, block_to + 2))if (TraceLinearScanLevel >= 2) { tty->print_cr("live in %d to %d" , number, block_to + 2); }; |
| 1338 | |
| 1339 | add_use(number, block_from, block_to + 2, noUse, T_ILLEGAL); |
| 1340 | |
| 1341 | // add special use positions for loop-end blocks when the |
| 1342 | // interval is used anywhere inside this loop. It's possible |
| 1343 | // that the block was part of a non-natural loop, so it might |
| 1344 | // have an invalid loop index. |
| 1345 | if (block->is_set(BlockBegin::linear_scan_loop_end_flag) && |
| 1346 | block->loop_index() != -1 && |
| 1347 | is_interval_in_loop(number, block->loop_index())) { |
| 1348 | interval_at(number)->add_use_pos(block_to + 1, loopEndMarker); |
| 1349 | } |
| 1350 | } |
| 1351 | |
| 1352 | // iterate all instructions of the block in reverse order. |
| 1353 | // skip the first instruction because it is always a label |
| 1354 | // definitions of intervals are processed before uses |
| 1355 | assert(visitor.no_operands(instructions->at(0)), "first operation must always be a label")do { if (!(visitor.no_operands(instructions->at(0)))) { (* g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1355, "assert(" "visitor.no_operands(instructions->at(0))" ") failed", "first operation must always be a label"); ::breakpoint (); } } while (0); |
| 1356 | for (int j = instructions->length() - 1; j >= 1; j--) { |
| 1357 | LIR_Op* op = instructions->at(j); |
| 1358 | int op_id = op->id(); |
| 1359 | |
| 1360 | // visit operation to collect all operands |
| 1361 | visitor.visit(op); |
| 1362 | |
| 1363 | // add a temp range for each register if operation destroys caller-save registers |
| 1364 | if (visitor.has_call()) { |
| 1365 | for (int k = 0; k < num_caller_save_registers; k++) { |
| 1366 | add_temp(caller_save_registers[k], op_id, noUse, T_ILLEGAL); |
| 1367 | } |
| 1368 | TRACE_LINEAR_SCAN(4, tty->print_cr("operation destroys all caller-save registers"))if (TraceLinearScanLevel >= 4) { tty->print_cr("operation destroys all caller-save registers" ); }; |
| 1369 | } |
| 1370 | |
| 1371 | // Add any platform dependent temps |
| 1372 | pd_add_temps(op); |
| 1373 | |
| 1374 | // visit definitions (output and temp operands) |
| 1375 | int k, n; |
| 1376 | n = visitor.opr_count(LIR_OpVisitState::outputMode); |
| 1377 | for (k = 0; k < n; k++) { |
| 1378 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::outputMode, k); |
| 1379 | assert(opr->is_register(), "visitor should only return register operands")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1379, "assert(" "opr->is_register()" ") failed", "visitor should only return register operands" ); ::breakpoint(); } } while (0); |
| 1380 | add_def(opr, op_id, use_kind_of_output_operand(op, opr)); |
| 1381 | } |
| 1382 | |
| 1383 | n = visitor.opr_count(LIR_OpVisitState::tempMode); |
| 1384 | for (k = 0; k < n; k++) { |
| 1385 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::tempMode, k); |
| 1386 | assert(opr->is_register(), "visitor should only return register operands")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1386, "assert(" "opr->is_register()" ") failed", "visitor should only return register operands" ); ::breakpoint(); } } while (0); |
| 1387 | add_temp(opr, op_id, mustHaveRegister); |
| 1388 | } |
| 1389 | |
| 1390 | // visit uses (input operands) |
| 1391 | n = visitor.opr_count(LIR_OpVisitState::inputMode); |
| 1392 | for (k = 0; k < n; k++) { |
| 1393 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::inputMode, k); |
| 1394 | assert(opr->is_register(), "visitor should only return register operands")do { if (!(opr->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1394, "assert(" "opr->is_register()" ") failed", "visitor should only return register operands" ); ::breakpoint(); } } while (0); |
| 1395 | add_use(opr, block_from, op_id, use_kind_of_input_operand(op, opr)); |
| 1396 | } |
| 1397 | |
| 1398 | // Add uses of live locals from interpreter's point of view for proper |
| 1399 | // debug information generation |
| 1400 | // Treat these operands as temp values (if the life range is extended |
| 1401 | // to a call site, the value would be in a register at the call otherwise) |
| 1402 | n = visitor.info_count(); |
| 1403 | for (k = 0; k < n; k++) { |
| 1404 | CodeEmitInfo* info = visitor.info_at(k); |
| 1405 | ValueStack* stack = info->stack(); |
| 1406 | for_each_state_value(stack, value,{ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__1408 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__1408 && (value = cur_state ->local_at(cur_index), true); cur_index += (value == __null || value->type()->is_illegal() ? 1 : value->type()-> size())) if (value != __null) { add_use(value, block_from, op_id + 1, noUse);; } } { int temp__1408 = cur_state->stack_size (); for (cur_index = 0; cur_index < temp__1408 && ( value = cur_state->stack_at(cur_index), true); cur_index += value->type()->size()) { add_use(value, block_from, op_id + 1, noUse);; } } } } |
| 1407 | add_use(value, block_from, op_id + 1, noUse);{ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__1408 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__1408 && (value = cur_state ->local_at(cur_index), true); cur_index += (value == __null || value->type()->is_illegal() ? 1 : value->type()-> size())) if (value != __null) { add_use(value, block_from, op_id + 1, noUse);; } } { int temp__1408 = cur_state->stack_size (); for (cur_index = 0; cur_index < temp__1408 && ( value = cur_state->stack_at(cur_index), true); cur_index += value->type()->size()) { add_use(value, block_from, op_id + 1, noUse);; } } } } |
| 1408 | ){ int cur_index; ValueStack* cur_state = stack; Value value; for (; cur_state != __null; cur_state = cur_state->caller_state ()) { { int temp__1408 = cur_state->locals_size(); for (cur_index = 0; cur_index < temp__1408 && (value = cur_state ->local_at(cur_index), true); cur_index += (value == __null || value->type()->is_illegal() ? 1 : value->type()-> size())) if (value != __null) { add_use(value, block_from, op_id + 1, noUse);; } } { int temp__1408 = cur_state->stack_size (); for (cur_index = 0; cur_index < temp__1408 && ( value = cur_state->stack_at(cur_index), true); cur_index += value->type()->size()) { add_use(value, block_from, op_id + 1, noUse);; } } } }; |
| 1409 | } |
| 1410 | |
| 1411 | // special steps for some instructions (especially moves) |
| 1412 | handle_method_arguments(op); |
| 1413 | handle_doubleword_moves(op); |
| 1414 | add_register_hints(op); |
| 1415 | |
| 1416 | } // end of instruction iteration |
| 1417 | } // end of block iteration |
| 1418 | |
| 1419 | |
| 1420 | // add the range [0, 1[ to all fixed intervals |
| 1421 | // -> the register allocator need not handle unhandled fixed intervals |
| 1422 | for (int n = 0; n < LinearScan::nof_regs; n++) { |
| 1423 | Interval* interval = interval_at(n); |
| 1424 | if (interval != NULL__null) { |
| 1425 | interval->add_range(0, 1); |
| 1426 | } |
| 1427 | } |
| 1428 | } |
| 1429 | |
| 1430 | |
| 1431 | // ********** Phase 5: actual register allocation |
| 1432 | |
| 1433 | int LinearScan::interval_cmp(Interval** a, Interval** b) { |
| 1434 | if (*a != NULL__null) { |
| 1435 | if (*b != NULL__null) { |
| 1436 | return (*a)->from() - (*b)->from(); |
| 1437 | } else { |
| 1438 | return -1; |
| 1439 | } |
| 1440 | } else { |
| 1441 | if (*b != NULL__null) { |
| 1442 | return 1; |
| 1443 | } else { |
| 1444 | return 0; |
| 1445 | } |
| 1446 | } |
| 1447 | } |
| 1448 | |
| 1449 | #ifndef PRODUCT |
| 1450 | int interval_cmp(Interval* const& l, Interval* const& r) { |
| 1451 | return l->from() - r->from(); |
| 1452 | } |
| 1453 | |
| 1454 | bool find_interval(Interval* interval, IntervalArray* intervals) { |
| 1455 | bool found; |
| 1456 | int idx = intervals->find_sorted<Interval*, interval_cmp>(interval, found); |
| 1457 | |
| 1458 | if (!found) { |
| 1459 | return false; |
| 1460 | } |
| 1461 | |
| 1462 | int from = interval->from(); |
| 1463 | |
| 1464 | // The index we've found using binary search is pointing to an interval |
| 1465 | // that is defined in the same place as the interval we were looking for. |
| 1466 | // So now we have to look around that index and find exact interval. |
| 1467 | for (int i = idx; i >= 0; i--) { |
| 1468 | if (intervals->at(i) == interval) { |
| 1469 | return true; |
| 1470 | } |
| 1471 | if (intervals->at(i)->from() != from) { |
| 1472 | break; |
| 1473 | } |
| 1474 | } |
| 1475 | |
| 1476 | for (int i = idx + 1; i < intervals->length(); i++) { |
| 1477 | if (intervals->at(i) == interval) { |
| 1478 | return true; |
| 1479 | } |
| 1480 | if (intervals->at(i)->from() != from) { |
| 1481 | break; |
| 1482 | } |
| 1483 | } |
| 1484 | |
| 1485 | return false; |
| 1486 | } |
| 1487 | |
| 1488 | bool LinearScan::is_sorted(IntervalArray* intervals) { |
| 1489 | int from = -1; |
| 1490 | int null_count = 0; |
| 1491 | |
| 1492 | for (int i = 0; i < intervals->length(); i++) { |
| 1493 | Interval* it = intervals->at(i); |
| 1494 | if (it != NULL__null) { |
| 1495 | assert(from <= it->from(), "Intervals are unordered")do { if (!(from <= it->from())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1495, "assert(" "from <= it->from()" ") failed", "Intervals are unordered" ); ::breakpoint(); } } while (0); |
| 1496 | from = it->from(); |
| 1497 | } else { |
| 1498 | null_count++; |
| 1499 | } |
| 1500 | } |
| 1501 | |
| 1502 | assert(null_count == 0, "Sorted intervals should not contain nulls")do { if (!(null_count == 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1502, "assert(" "null_count == 0" ") failed", "Sorted intervals should not contain nulls" ); ::breakpoint(); } } while (0); |
| 1503 | |
| 1504 | null_count = 0; |
| 1505 | |
| 1506 | for (int i = 0; i < interval_count(); i++) { |
| 1507 | Interval* interval = interval_at(i); |
| 1508 | if (interval != NULL__null) { |
| 1509 | assert(find_interval(interval, intervals), "Lists do not contain same intervals")do { if (!(find_interval(interval, intervals))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1509, "assert(" "find_interval(interval, intervals)" ") failed" , "Lists do not contain same intervals"); ::breakpoint(); } } while (0); |
| 1510 | } else { |
| 1511 | null_count++; |
| 1512 | } |
| 1513 | } |
| 1514 | |
| 1515 | assert(interval_count() - null_count == intervals->length(),do { if (!(interval_count() - null_count == intervals->length ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1516, "assert(" "interval_count() - null_count == intervals->length()" ") failed", "Sorted list should contain the same amount of non-NULL intervals as unsorted list" ); ::breakpoint(); } } while (0) |
| 1516 | "Sorted list should contain the same amount of non-NULL intervals as unsorted list")do { if (!(interval_count() - null_count == intervals->length ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1516, "assert(" "interval_count() - null_count == intervals->length()" ") failed", "Sorted list should contain the same amount of non-NULL intervals as unsorted list" ); ::breakpoint(); } } while (0); |
| 1517 | |
| 1518 | return true; |
| 1519 | } |
| 1520 | #endif |
| 1521 | |
| 1522 | void LinearScan::add_to_list(Interval** first, Interval** prev, Interval* interval) { |
| 1523 | if (*prev != NULL__null) { |
| 1524 | (*prev)->set_next(interval); |
| 1525 | } else { |
| 1526 | *first = interval; |
| 1527 | } |
| 1528 | *prev = interval; |
| 1529 | } |
| 1530 | |
| 1531 | void LinearScan::create_unhandled_lists(Interval** list1, Interval** list2, bool (is_list1)(const Interval* i), bool (is_list2)(const Interval* i)) { |
| 1532 | assert(is_sorted(_sorted_intervals), "interval list is not sorted")do { if (!(is_sorted(_sorted_intervals))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1532, "assert(" "is_sorted(_sorted_intervals)" ") failed", "interval list is not sorted" ); ::breakpoint(); } } while (0); |
| 1533 | |
| 1534 | *list1 = *list2 = Interval::end(); |
| 1535 | |
| 1536 | Interval* list1_prev = NULL__null; |
| 1537 | Interval* list2_prev = NULL__null; |
| 1538 | Interval* v; |
| 1539 | |
| 1540 | const int n = _sorted_intervals->length(); |
| 1541 | for (int i = 0; i < n; i++) { |
| 1542 | v = _sorted_intervals->at(i); |
| 1543 | if (v == NULL__null) continue; |
| 1544 | |
| 1545 | if (is_list1(v)) { |
| 1546 | add_to_list(list1, &list1_prev, v); |
| 1547 | } else if (is_list2 == NULL__null || is_list2(v)) { |
| 1548 | add_to_list(list2, &list2_prev, v); |
| 1549 | } |
| 1550 | } |
| 1551 | |
| 1552 | if (list1_prev != NULL__null) list1_prev->set_next(Interval::end()); |
| 1553 | if (list2_prev != NULL__null) list2_prev->set_next(Interval::end()); |
| 1554 | |
| 1555 | assert(list1_prev == NULL || list1_prev->next() == Interval::end(), "linear list ends not with sentinel")do { if (!(list1_prev == __null || list1_prev->next() == Interval ::end())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1555, "assert(" "list1_prev == __null || list1_prev->next() == Interval::end()" ") failed", "linear list ends not with sentinel"); ::breakpoint (); } } while (0); |
| 1556 | assert(list2_prev == NULL || list2_prev->next() == Interval::end(), "linear list ends not with sentinel")do { if (!(list2_prev == __null || list2_prev->next() == Interval ::end())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1556, "assert(" "list2_prev == __null || list2_prev->next() == Interval::end()" ") failed", "linear list ends not with sentinel"); ::breakpoint (); } } while (0); |
| 1557 | } |
| 1558 | |
| 1559 | |
| 1560 | void LinearScan::sort_intervals_before_allocation() { |
| 1561 | TIME_LINEAR_SCAN(timer_sort_intervals_before)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_sort_intervals_before), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 1562 | |
| 1563 | if (_needs_full_resort) { |
| 1564 | // There is no known reason why this should occur but just in case... |
| 1565 | assert(false, "should never occur")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1565, "assert(" "false" ") failed", "should never occur"); :: breakpoint(); } } while (0); |
| 1566 | // Re-sort existing interval list because an Interval::from() has changed |
| 1567 | _sorted_intervals->sort(interval_cmp); |
| 1568 | _needs_full_resort = false; |
| 1569 | } |
| 1570 | |
| 1571 | IntervalList* unsorted_list = &_intervals; |
| 1572 | int unsorted_len = unsorted_list->length(); |
| 1573 | int sorted_len = 0; |
| 1574 | int unsorted_idx; |
| 1575 | int sorted_idx = 0; |
| 1576 | int sorted_from_max = -1; |
| 1577 | |
| 1578 | // calc number of items for sorted list (sorted list must not contain NULL values) |
| 1579 | for (unsorted_idx = 0; unsorted_idx < unsorted_len; unsorted_idx++) { |
| 1580 | if (unsorted_list->at(unsorted_idx) != NULL__null) { |
| 1581 | sorted_len++; |
| 1582 | } |
| 1583 | } |
| 1584 | IntervalArray* sorted_list = new IntervalArray(sorted_len, sorted_len, NULL__null); |
| 1585 | |
| 1586 | // special sorting algorithm: the original interval-list is almost sorted, |
| 1587 | // only some intervals are swapped. So this is much faster than a complete QuickSort |
| 1588 | for (unsorted_idx = 0; unsorted_idx < unsorted_len; unsorted_idx++) { |
| 1589 | Interval* cur_interval = unsorted_list->at(unsorted_idx); |
| 1590 | |
| 1591 | if (cur_interval != NULL__null) { |
| 1592 | int cur_from = cur_interval->from(); |
| 1593 | |
| 1594 | if (sorted_from_max <= cur_from) { |
| 1595 | sorted_list->at_put(sorted_idx++, cur_interval); |
| 1596 | sorted_from_max = cur_interval->from(); |
| 1597 | } else { |
| 1598 | // the asumption that the intervals are already sorted failed, |
| 1599 | // so this interval must be sorted in manually |
| 1600 | int j; |
| 1601 | for (j = sorted_idx - 1; j >= 0 && cur_from < sorted_list->at(j)->from(); j--) { |
| 1602 | sorted_list->at_put(j + 1, sorted_list->at(j)); |
| 1603 | } |
| 1604 | sorted_list->at_put(j + 1, cur_interval); |
| 1605 | sorted_idx++; |
| 1606 | } |
| 1607 | } |
| 1608 | } |
| 1609 | _sorted_intervals = sorted_list; |
| 1610 | assert(is_sorted(_sorted_intervals), "intervals unsorted")do { if (!(is_sorted(_sorted_intervals))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1610, "assert(" "is_sorted(_sorted_intervals)" ") failed", "intervals unsorted" ); ::breakpoint(); } } while (0); |
| 1611 | } |
| 1612 | |
| 1613 | void LinearScan::sort_intervals_after_allocation() { |
| 1614 | TIME_LINEAR_SCAN(timer_sort_intervals_after)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_sort_intervals_after), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 1615 | |
| 1616 | if (_needs_full_resort) { |
| 1617 | // Re-sort existing interval list because an Interval::from() has changed |
| 1618 | _sorted_intervals->sort(interval_cmp); |
| 1619 | _needs_full_resort = false; |
| 1620 | } |
| 1621 | |
| 1622 | IntervalArray* old_list = _sorted_intervals; |
| 1623 | IntervalList* new_list = _new_intervals_from_allocation; |
| 1624 | int old_len = old_list->length(); |
| 1625 | int new_len = new_list == NULL__null ? 0 : new_list->length(); |
| 1626 | |
| 1627 | if (new_len == 0) { |
| 1628 | // no intervals have been added during allocation, so sorted list is already up to date |
| 1629 | assert(is_sorted(_sorted_intervals), "intervals unsorted")do { if (!(is_sorted(_sorted_intervals))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1629, "assert(" "is_sorted(_sorted_intervals)" ") failed", "intervals unsorted" ); ::breakpoint(); } } while (0); |
| 1630 | return; |
| 1631 | } |
| 1632 | |
| 1633 | // conventional sort-algorithm for new intervals |
| 1634 | new_list->sort(interval_cmp); |
| 1635 | |
| 1636 | // merge old and new list (both already sorted) into one combined list |
| 1637 | int combined_list_len = old_len + new_len; |
| 1638 | IntervalArray* combined_list = new IntervalArray(combined_list_len, combined_list_len, NULL__null); |
| 1639 | int old_idx = 0; |
| 1640 | int new_idx = 0; |
| 1641 | |
| 1642 | while (old_idx + new_idx < old_len + new_len) { |
| 1643 | if (new_idx >= new_len || (old_idx < old_len && old_list->at(old_idx)->from() <= new_list->at(new_idx)->from())) { |
| 1644 | combined_list->at_put(old_idx + new_idx, old_list->at(old_idx)); |
| 1645 | old_idx++; |
| 1646 | } else { |
| 1647 | combined_list->at_put(old_idx + new_idx, new_list->at(new_idx)); |
| 1648 | new_idx++; |
| 1649 | } |
| 1650 | } |
| 1651 | |
| 1652 | _sorted_intervals = combined_list; |
| 1653 | assert(is_sorted(_sorted_intervals), "intervals unsorted")do { if (!(is_sorted(_sorted_intervals))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1653, "assert(" "is_sorted(_sorted_intervals)" ") failed", "intervals unsorted" ); ::breakpoint(); } } while (0); |
| 1654 | } |
| 1655 | |
| 1656 | |
| 1657 | void LinearScan::allocate_registers() { |
| 1658 | TIME_LINEAR_SCAN(timer_allocate_registers)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_allocate_registers), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 1659 | |
| 1660 | Interval* precolored_cpu_intervals, *not_precolored_cpu_intervals; |
| 1661 | Interval* precolored_fpu_intervals, *not_precolored_fpu_intervals; |
| 1662 | |
| 1663 | // collect cpu intervals |
| 1664 | create_unhandled_lists(&precolored_cpu_intervals, ¬_precolored_cpu_intervals, |
| 1665 | is_precolored_cpu_interval, is_virtual_cpu_interval); |
| 1666 | |
| 1667 | // collect fpu intervals |
| 1668 | create_unhandled_lists(&precolored_fpu_intervals, ¬_precolored_fpu_intervals, |
| 1669 | is_precolored_fpu_interval, is_virtual_fpu_interval); |
| 1670 | // this fpu interval collection cannot be moved down below with the allocation section as |
| 1671 | // the cpu_lsw.walk() changes interval positions. |
| 1672 | |
| 1673 | if (!has_fpu_registers()) { |
| 1674 | #ifdef ASSERT1 |
| 1675 | assert(not_precolored_fpu_intervals == Interval::end(), "missed an uncolored fpu interval")do { if (!(not_precolored_fpu_intervals == Interval::end())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1675, "assert(" "not_precolored_fpu_intervals == Interval::end()" ") failed", "missed an uncolored fpu interval"); ::breakpoint (); } } while (0); |
| 1676 | #else |
| 1677 | if (not_precolored_fpu_intervals != Interval::end()) { |
| 1678 | BAILOUT("missed an uncolored fpu interval"){ bailout("missed an uncolored fpu interval"); return; }; |
| 1679 | } |
| 1680 | #endif |
| 1681 | } |
| 1682 | |
| 1683 | // allocate cpu registers |
| 1684 | LinearScanWalker cpu_lsw(this, precolored_cpu_intervals, not_precolored_cpu_intervals); |
| 1685 | cpu_lsw.walk(); |
| 1686 | cpu_lsw.finish_allocation(); |
| 1687 | |
| 1688 | if (has_fpu_registers()) { |
| 1689 | // allocate fpu registers |
| 1690 | LinearScanWalker fpu_lsw(this, precolored_fpu_intervals, not_precolored_fpu_intervals); |
| 1691 | fpu_lsw.walk(); |
| 1692 | fpu_lsw.finish_allocation(); |
| 1693 | } |
| 1694 | } |
| 1695 | |
| 1696 | |
| 1697 | // ********** Phase 6: resolve data flow |
| 1698 | // (insert moves at edges between blocks if intervals have been split) |
| 1699 | |
| 1700 | // wrapper for Interval::split_child_at_op_id that performs a bailout in product mode |
| 1701 | // instead of returning NULL |
| 1702 | Interval* LinearScan::split_child_at_op_id(Interval* interval, int op_id, LIR_OpVisitState::OprMode mode) { |
| 1703 | Interval* result = interval->split_child_at_op_id(op_id, mode); |
| 1704 | if (result != NULL__null) { |
| 1705 | return result; |
| 1706 | } |
| 1707 | |
| 1708 | assert(false, "must find an interval, but do a clean bailout in product mode")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1708, "assert(" "false" ") failed", "must find an interval, but do a clean bailout in product mode" ); ::breakpoint(); } } while (0); |
| 1709 | result = new Interval(LIR_Opr::vreg_base); |
| 1710 | result->assign_reg(0); |
| 1711 | result->set_type(T_INT); |
| 1712 | BAILOUT_("LinearScan: interval is NULL", result){ bailout("LinearScan: interval is NULL"); return result; }; |
| 1713 | } |
| 1714 | |
| 1715 | |
| 1716 | Interval* LinearScan::interval_at_block_begin(BlockBegin* block, int reg_num) { |
| 1717 | assert(LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs(), "register number out of bounds")do { if (!(LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1717, "assert(" "LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs()" ") failed", "register number out of bounds"); ::breakpoint() ; } } while (0); |
| 1718 | assert(interval_at(reg_num) != NULL, "no interval found")do { if (!(interval_at(reg_num) != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1718, "assert(" "interval_at(reg_num) != __null" ") failed" , "no interval found"); ::breakpoint(); } } while (0); |
| 1719 | |
| 1720 | return split_child_at_op_id(interval_at(reg_num), block->first_lir_instruction_id(), LIR_OpVisitState::outputMode); |
| 1721 | } |
| 1722 | |
| 1723 | Interval* LinearScan::interval_at_block_end(BlockBegin* block, int reg_num) { |
| 1724 | assert(LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs(), "register number out of bounds")do { if (!(LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1724, "assert(" "LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs()" ") failed", "register number out of bounds"); ::breakpoint() ; } } while (0); |
| 1725 | assert(interval_at(reg_num) != NULL, "no interval found")do { if (!(interval_at(reg_num) != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1725, "assert(" "interval_at(reg_num) != __null" ") failed" , "no interval found"); ::breakpoint(); } } while (0); |
| 1726 | |
| 1727 | return split_child_at_op_id(interval_at(reg_num), block->last_lir_instruction_id() + 1, LIR_OpVisitState::outputMode); |
| 1728 | } |
| 1729 | |
| 1730 | Interval* LinearScan::interval_at_op_id(int reg_num, int op_id) { |
| 1731 | assert(LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs(), "register number out of bounds")do { if (!(LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1731, "assert(" "LinearScan::nof_regs <= reg_num && reg_num < num_virtual_regs()" ") failed", "register number out of bounds"); ::breakpoint() ; } } while (0); |
| 1732 | assert(interval_at(reg_num) != NULL, "no interval found")do { if (!(interval_at(reg_num) != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1732, "assert(" "interval_at(reg_num) != __null" ") failed" , "no interval found"); ::breakpoint(); } } while (0); |
| 1733 | |
| 1734 | return split_child_at_op_id(interval_at(reg_num), op_id, LIR_OpVisitState::inputMode); |
| 1735 | } |
| 1736 | |
| 1737 | |
| 1738 | void LinearScan::resolve_collect_mappings(BlockBegin* from_block, BlockBegin* to_block, MoveResolver &move_resolver) { |
| 1739 | DEBUG_ONLY(move_resolver.check_empty())move_resolver.check_empty(); |
| 1740 | |
| 1741 | const int size = live_set_size(); |
| 1742 | const ResourceBitMap live_at_edge = to_block->live_in(); |
| 1743 | |
| 1744 | // visit all registers where the live_at_edge bit is set |
| 1745 | for (int r = (int)live_at_edge.get_next_one_offset(0, size); r < size; r = (int)live_at_edge.get_next_one_offset(r + 1, size)) { |
| 1746 | assert(r < num_virtual_regs(), "live information set for not exisiting interval")do { if (!(r < num_virtual_regs())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1746, "assert(" "r < num_virtual_regs()" ") failed", "live information set for not exisiting interval" ); ::breakpoint(); } } while (0); |
| 1747 | assert(from_block->live_out().at(r) && to_block->live_in().at(r), "interval not live at this edge")do { if (!(from_block->live_out().at(r) && to_block ->live_in().at(r))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1747, "assert(" "from_block->live_out().at(r) && to_block->live_in().at(r)" ") failed", "interval not live at this edge"); ::breakpoint( ); } } while (0); |
| 1748 | |
| 1749 | Interval* from_interval = interval_at_block_end(from_block, r); |
| 1750 | Interval* to_interval = interval_at_block_begin(to_block, r); |
| 1751 | |
| 1752 | if (from_interval != to_interval && (from_interval->assigned_reg() != to_interval->assigned_reg() || from_interval->assigned_regHi() != to_interval->assigned_regHi())) { |
| 1753 | // need to insert move instruction |
| 1754 | move_resolver.add_mapping(from_interval, to_interval); |
| 1755 | } |
| 1756 | } |
| 1757 | } |
| 1758 | |
| 1759 | |
| 1760 | void LinearScan::resolve_find_insert_pos(BlockBegin* from_block, BlockBegin* to_block, MoveResolver &move_resolver) { |
| 1761 | if (from_block->number_of_sux() <= 1) { |
| 1762 | TRACE_LINEAR_SCAN(4, tty->print_cr("inserting moves at end of from_block B%d", from_block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print_cr("inserting moves at end of from_block B%d" , from_block->block_id()); }; |
| 1763 | |
| 1764 | LIR_OpList* instructions = from_block->lir()->instructions_list(); |
| 1765 | LIR_OpBranch* branch = instructions->last()->as_OpBranch(); |
| 1766 | if (branch != NULL__null) { |
| 1767 | // insert moves before branch |
| 1768 | assert(branch->cond() == lir_cond_always, "block does not end with an unconditional jump")do { if (!(branch->cond() == lir_cond_always)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1768, "assert(" "branch->cond() == lir_cond_always" ") failed" , "block does not end with an unconditional jump"); ::breakpoint (); } } while (0); |
| 1769 | move_resolver.set_insert_position(from_block->lir(), instructions->length() - 2); |
| 1770 | } else { |
| 1771 | move_resolver.set_insert_position(from_block->lir(), instructions->length() - 1); |
| 1772 | } |
| 1773 | |
| 1774 | } else { |
| 1775 | TRACE_LINEAR_SCAN(4, tty->print_cr("inserting moves at beginning of to_block B%d", to_block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print_cr("inserting moves at beginning of to_block B%d" , to_block->block_id()); }; |
| 1776 | #ifdef ASSERT1 |
| 1777 | assert(from_block->lir()->instructions_list()->at(0)->as_OpLabel() != NULL, "block does not start with a label")do { if (!(from_block->lir()->instructions_list()->at (0)->as_OpLabel() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1777, "assert(" "from_block->lir()->instructions_list()->at(0)->as_OpLabel() != __null" ") failed", "block does not start with a label"); ::breakpoint (); } } while (0); |
| 1778 | |
| 1779 | // because the number of predecessor edges matches the number of |
| 1780 | // successor edges, blocks which are reached by switch statements |
| 1781 | // may have be more than one predecessor but it will be guaranteed |
| 1782 | // that all predecessors will be the same. |
| 1783 | for (int i = 0; i < to_block->number_of_preds(); i++) { |
| 1784 | assert(from_block == to_block->pred_at(i), "all critical edges must be broken")do { if (!(from_block == to_block->pred_at(i))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1784, "assert(" "from_block == to_block->pred_at(i)" ") failed" , "all critical edges must be broken"); ::breakpoint(); } } while (0); |
| 1785 | } |
| 1786 | #endif |
| 1787 | |
| 1788 | move_resolver.set_insert_position(to_block->lir(), 0); |
| 1789 | } |
| 1790 | } |
| 1791 | |
| 1792 | |
| 1793 | // insert necessary moves (spilling or reloading) at edges between blocks if interval has been split |
| 1794 | void LinearScan::resolve_data_flow() { |
| 1795 | TIME_LINEAR_SCAN(timer_resolve_data_flow)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_resolve_data_flow), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 1796 | |
| 1797 | int num_blocks = block_count(); |
| 1798 | MoveResolver move_resolver(this); |
| 1799 | ResourceBitMap block_completed(num_blocks); |
| 1800 | ResourceBitMap already_resolved(num_blocks); |
| 1801 | |
| 1802 | int i; |
| 1803 | for (i = 0; i < num_blocks; i++) { |
| 1804 | BlockBegin* block = block_at(i); |
| 1805 | |
| 1806 | // check if block has only one predecessor and only one successor |
| 1807 | if (block->number_of_preds() == 1 && block->number_of_sux() == 1 && block->number_of_exception_handlers() == 0) { |
| 1808 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 1809 | assert(instructions->at(0)->code() == lir_label, "block must start with label")do { if (!(instructions->at(0)->code() == lir_label)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1809, "assert(" "instructions->at(0)->code() == lir_label" ") failed", "block must start with label"); ::breakpoint(); } } while (0); |
| 1810 | assert(instructions->last()->code() == lir_branch, "block with successors must end with branch")do { if (!(instructions->last()->code() == lir_branch)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1810, "assert(" "instructions->last()->code() == lir_branch" ") failed", "block with successors must end with branch"); :: breakpoint(); } } while (0); |
| 1811 | assert(instructions->last()->as_OpBranch()->cond() == lir_cond_always, "block with successor must end with unconditional branch")do { if (!(instructions->last()->as_OpBranch()->cond () == lir_cond_always)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1811, "assert(" "instructions->last()->as_OpBranch()->cond() == lir_cond_always" ") failed", "block with successor must end with unconditional branch" ); ::breakpoint(); } } while (0); |
| 1812 | |
| 1813 | // check if block is empty (only label and branch) |
| 1814 | if (instructions->length() == 2) { |
| 1815 | BlockBegin* pred = block->pred_at(0); |
| 1816 | BlockBegin* sux = block->sux_at(0); |
| 1817 | |
| 1818 | // prevent optimization of two consecutive blocks |
| 1819 | if (!block_completed.at(pred->linear_scan_number()) && !block_completed.at(sux->linear_scan_number())) { |
| 1820 | TRACE_LINEAR_SCAN(3, tty->print_cr("**** optimizing empty block B%d (pred: B%d, sux: B%d)", block->block_id(), pred->block_id(), sux->block_id()))if (TraceLinearScanLevel >= 3) { tty->print_cr("**** optimizing empty block B%d (pred: B%d, sux: B%d)" , block->block_id(), pred->block_id(), sux->block_id ()); }; |
| 1821 | block_completed.set_bit(block->linear_scan_number()); |
| 1822 | |
| 1823 | // directly resolve between pred and sux (without looking at the empty block between) |
| 1824 | resolve_collect_mappings(pred, sux, move_resolver); |
| 1825 | if (move_resolver.has_mappings()) { |
| 1826 | move_resolver.set_insert_position(block->lir(), 0); |
| 1827 | move_resolver.resolve_and_append_moves(); |
| 1828 | } |
| 1829 | } |
| 1830 | } |
| 1831 | } |
| 1832 | } |
| 1833 | |
| 1834 | |
| 1835 | for (i = 0; i < num_blocks; i++) { |
| 1836 | if (!block_completed.at(i)) { |
| 1837 | BlockBegin* from_block = block_at(i); |
| 1838 | already_resolved.set_from(block_completed); |
| 1839 | |
| 1840 | int num_sux = from_block->number_of_sux(); |
| 1841 | for (int s = 0; s < num_sux; s++) { |
| 1842 | BlockBegin* to_block = from_block->sux_at(s); |
| 1843 | |
| 1844 | // check for duplicate edges between the same blocks (can happen with switch blocks) |
| 1845 | if (!already_resolved.at(to_block->linear_scan_number())) { |
| 1846 | TRACE_LINEAR_SCAN(3, tty->print_cr("**** processing edge between B%d and B%d", from_block->block_id(), to_block->block_id()))if (TraceLinearScanLevel >= 3) { tty->print_cr("**** processing edge between B%d and B%d" , from_block->block_id(), to_block->block_id()); }; |
| 1847 | already_resolved.set_bit(to_block->linear_scan_number()); |
| 1848 | |
| 1849 | // collect all intervals that have been split between from_block and to_block |
| 1850 | resolve_collect_mappings(from_block, to_block, move_resolver); |
| 1851 | if (move_resolver.has_mappings()) { |
| 1852 | resolve_find_insert_pos(from_block, to_block, move_resolver); |
| 1853 | move_resolver.resolve_and_append_moves(); |
| 1854 | } |
| 1855 | } |
| 1856 | } |
| 1857 | } |
| 1858 | } |
| 1859 | } |
| 1860 | |
| 1861 | |
| 1862 | void LinearScan::resolve_exception_entry(BlockBegin* block, int reg_num, MoveResolver &move_resolver) { |
| 1863 | if (interval_at(reg_num) == NULL__null) { |
| 1864 | // if a phi function is never used, no interval is created -> ignore this |
| 1865 | return; |
| 1866 | } |
| 1867 | |
| 1868 | Interval* interval = interval_at_block_begin(block, reg_num); |
| 1869 | int reg = interval->assigned_reg(); |
| 1870 | int regHi = interval->assigned_regHi(); |
| 1871 | |
| 1872 | if ((reg < nof_regs && interval->always_in_memory()) || |
| 1873 | (use_fpu_stack_allocation() && reg >= pd_first_fpu_reg && reg <= pd_last_fpu_reg)) { |
| 1874 | // the interval is split to get a short range that is located on the stack |
| 1875 | // in the following two cases: |
| 1876 | // * the interval started in memory (e.g. method parameter), but is currently in a register |
| 1877 | // this is an optimization for exception handling that reduces the number of moves that |
| 1878 | // are necessary for resolving the states when an exception uses this exception handler |
| 1879 | // * the interval would be on the fpu stack at the begin of the exception handler |
| 1880 | // this is not allowed because of the complicated fpu stack handling on Intel |
| 1881 | |
| 1882 | // range that will be spilled to memory |
| 1883 | int from_op_id = block->first_lir_instruction_id(); |
| 1884 | int to_op_id = from_op_id + 1; // short live range of length 1 |
| 1885 | assert(interval->from() <= from_op_id && interval->to() >= to_op_id,do { if (!(interval->from() <= from_op_id && interval ->to() >= to_op_id)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1886, "assert(" "interval->from() <= from_op_id && interval->to() >= to_op_id" ") failed", "no split allowed between exception entry and first instruction" ); ::breakpoint(); } } while (0) |
| 1886 | "no split allowed between exception entry and first instruction")do { if (!(interval->from() <= from_op_id && interval ->to() >= to_op_id)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1886, "assert(" "interval->from() <= from_op_id && interval->to() >= to_op_id" ") failed", "no split allowed between exception entry and first instruction" ); ::breakpoint(); } } while (0); |
| 1887 | |
| 1888 | if (interval->from() != from_op_id) { |
| 1889 | // the part before from_op_id is unchanged |
| 1890 | interval = interval->split(from_op_id); |
| 1891 | interval->assign_reg(reg, regHi); |
| 1892 | append_interval(interval); |
| 1893 | } else { |
| 1894 | _needs_full_resort = true; |
| 1895 | } |
| 1896 | assert(interval->from() == from_op_id, "must be true now")do { if (!(interval->from() == from_op_id)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1896, "assert(" "interval->from() == from_op_id" ") failed" , "must be true now"); ::breakpoint(); } } while (0); |
| 1897 | |
| 1898 | Interval* spilled_part = interval; |
| 1899 | if (interval->to() != to_op_id) { |
| 1900 | // the part after to_op_id is unchanged |
| 1901 | spilled_part = interval->split_from_start(to_op_id); |
| 1902 | append_interval(spilled_part); |
| 1903 | move_resolver.add_mapping(spilled_part, interval); |
| 1904 | } |
| 1905 | assign_spill_slot(spilled_part); |
| 1906 | |
| 1907 | assert(spilled_part->from() == from_op_id && spilled_part->to() == to_op_id, "just checking")do { if (!(spilled_part->from() == from_op_id && spilled_part ->to() == to_op_id)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1907, "assert(" "spilled_part->from() == from_op_id && spilled_part->to() == to_op_id" ") failed", "just checking"); ::breakpoint(); } } while (0); |
| 1908 | } |
| 1909 | } |
| 1910 | |
| 1911 | void LinearScan::resolve_exception_entry(BlockBegin* block, MoveResolver &move_resolver) { |
| 1912 | assert(block->is_set(BlockBegin::exception_entry_flag), "should not call otherwise")do { if (!(block->is_set(BlockBegin::exception_entry_flag) )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1912, "assert(" "block->is_set(BlockBegin::exception_entry_flag)" ") failed", "should not call otherwise"); ::breakpoint(); } } while (0); |
| 1913 | DEBUG_ONLY(move_resolver.check_empty())move_resolver.check_empty(); |
| 1914 | |
| 1915 | // visit all registers where the live_in bit is set |
| 1916 | int size = live_set_size(); |
| 1917 | for (int r = (int)block->live_in().get_next_one_offset(0, size); r < size; r = (int)block->live_in().get_next_one_offset(r + 1, size)) { |
| 1918 | resolve_exception_entry(block, r, move_resolver); |
| 1919 | } |
| 1920 | |
| 1921 | // the live_in bits are not set for phi functions of the xhandler entry, so iterate them separately |
| 1922 | for_each_phi_fun(block, phi,{ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__1924 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__1924 && (value = cur_state ->stack_at(cur_index), true); cur_index += value->type( )->size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { resolve_exception_entry(block, phi->operand()->vreg_number (), move_resolver); }; } } } { int temp__1924 = cur_state-> locals_size(); for (cur_index = 0; cur_index < temp__1924 && (value = cur_state->local_at(cur_index), true); cur_index += (value == __null || value->type()->is_illegal() ? 1 : value->type()->size())) if (value != __null) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block () == block) { if (!phi->is_illegal()) { resolve_exception_entry (block, phi->operand()->vreg_number(), move_resolver); } ; } } } } |
| 1923 | if (!phi->is_illegal()) { resolve_exception_entry(block, phi->operand()->vreg_number(), move_resolver); }{ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__1924 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__1924 && (value = cur_state ->stack_at(cur_index), true); cur_index += value->type( )->size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { resolve_exception_entry(block, phi->operand()->vreg_number (), move_resolver); }; } } } { int temp__1924 = cur_state-> locals_size(); for (cur_index = 0; cur_index < temp__1924 && (value = cur_state->local_at(cur_index), true); cur_index += (value == __null || value->type()->is_illegal() ? 1 : value->type()->size())) if (value != __null) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block () == block) { if (!phi->is_illegal()) { resolve_exception_entry (block, phi->operand()->vreg_number(), move_resolver); } ; } } } } |
| 1924 | ){ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__1924 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__1924 && (value = cur_state ->stack_at(cur_index), true); cur_index += value->type( )->size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { resolve_exception_entry(block, phi->operand()->vreg_number (), move_resolver); }; } } } { int temp__1924 = cur_state-> locals_size(); for (cur_index = 0; cur_index < temp__1924 && (value = cur_state->local_at(cur_index), true); cur_index += (value == __null || value->type()->is_illegal() ? 1 : value->type()->size())) if (value != __null) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block () == block) { if (!phi->is_illegal()) { resolve_exception_entry (block, phi->operand()->vreg_number(), move_resolver); } ; } } } }; |
| 1925 | |
| 1926 | if (move_resolver.has_mappings()) { |
| 1927 | // insert moves after first instruction |
| 1928 | move_resolver.set_insert_position(block->lir(), 0); |
| 1929 | move_resolver.resolve_and_append_moves(); |
| 1930 | } |
| 1931 | } |
| 1932 | |
| 1933 | |
| 1934 | void LinearScan::resolve_exception_edge(XHandler* handler, int throwing_op_id, int reg_num, Phi* phi, MoveResolver &move_resolver) { |
| 1935 | if (interval_at(reg_num) == NULL__null) { |
| 1936 | // if a phi function is never used, no interval is created -> ignore this |
| 1937 | return; |
| 1938 | } |
| 1939 | |
| 1940 | // the computation of to_interval is equal to resolve_collect_mappings, |
| 1941 | // but from_interval is more complicated because of phi functions |
| 1942 | BlockBegin* to_block = handler->entry_block(); |
| 1943 | Interval* to_interval = interval_at_block_begin(to_block, reg_num); |
| 1944 | |
| 1945 | if (phi != NULL__null) { |
| 1946 | // phi function of the exception entry block |
| 1947 | // no moves are created for this phi function in the LIR_Generator, so the |
| 1948 | // interval at the throwing instruction must be searched using the operands |
| 1949 | // of the phi function |
| 1950 | Value from_value = phi->operand_at(handler->phi_operand()); |
| 1951 | |
| 1952 | // with phi functions it can happen that the same from_value is used in |
| 1953 | // multiple mappings, so notify move-resolver that this is allowed |
| 1954 | move_resolver.set_multiple_reads_allowed(); |
| 1955 | |
| 1956 | Constant* con = from_value->as_Constant(); |
| 1957 | if (con != NULL__null && (!con->is_pinned() || con->operand()->is_constant())) { |
| 1958 | // Need a mapping from constant to interval if unpinned (may have no register) or if the operand is a constant (no register). |
| 1959 | move_resolver.add_mapping(LIR_OprFact::value_type(con->type()), to_interval); |
| 1960 | } else { |
| 1961 | // search split child at the throwing op_id |
| 1962 | Interval* from_interval = interval_at_op_id(from_value->operand()->vreg_number(), throwing_op_id); |
| 1963 | move_resolver.add_mapping(from_interval, to_interval); |
| 1964 | } |
| 1965 | } else { |
| 1966 | // no phi function, so use reg_num also for from_interval |
| 1967 | // search split child at the throwing op_id |
| 1968 | Interval* from_interval = interval_at_op_id(reg_num, throwing_op_id); |
| 1969 | if (from_interval != to_interval) { |
| 1970 | // optimization to reduce number of moves: when to_interval is on stack and |
| 1971 | // the stack slot is known to be always correct, then no move is necessary |
| 1972 | if (!from_interval->always_in_memory() || from_interval->canonical_spill_slot() != to_interval->assigned_reg()) { |
| 1973 | move_resolver.add_mapping(from_interval, to_interval); |
| 1974 | } |
| 1975 | } |
| 1976 | } |
| 1977 | } |
| 1978 | |
| 1979 | void LinearScan::resolve_exception_edge(XHandler* handler, int throwing_op_id, MoveResolver &move_resolver) { |
| 1980 | TRACE_LINEAR_SCAN(4, tty->print_cr("resolving exception handler B%d: throwing_op_id=%d", handler->entry_block()->block_id(), throwing_op_id))if (TraceLinearScanLevel >= 4) { tty->print_cr("resolving exception handler B%d: throwing_op_id=%d" , handler->entry_block()->block_id(), throwing_op_id); }; |
| 1981 | |
| 1982 | DEBUG_ONLY(move_resolver.check_empty())move_resolver.check_empty(); |
| 1983 | assert(handler->lir_op_id() == -1, "already processed this xhandler")do { if (!(handler->lir_op_id() == -1)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1983, "assert(" "handler->lir_op_id() == -1" ") failed", "already processed this xhandler"); ::breakpoint(); } } while (0); |
| 1984 | DEBUG_ONLY(handler->set_lir_op_id(throwing_op_id))handler->set_lir_op_id(throwing_op_id); |
| 1985 | assert(handler->entry_code() == NULL, "code already present")do { if (!(handler->entry_code() == __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 1985, "assert(" "handler->entry_code() == __null" ") failed" , "code already present"); ::breakpoint(); } } while (0); |
| 1986 | |
| 1987 | // visit all registers where the live_in bit is set |
| 1988 | BlockBegin* block = handler->entry_block(); |
| 1989 | int size = live_set_size(); |
| 1990 | for (int r = (int)block->live_in().get_next_one_offset(0, size); r < size; r = (int)block->live_in().get_next_one_offset(r + 1, size)) { |
| 1991 | resolve_exception_edge(handler, throwing_op_id, r, NULL__null, move_resolver); |
| 1992 | } |
| 1993 | |
| 1994 | // the live_in bits are not set for phi functions of the xhandler entry, so iterate them separately |
| 1995 | for_each_phi_fun(block, phi,{ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__1997 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__1997 && (value = cur_state ->stack_at(cur_index), true); cur_index += value->type( )->size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { resolve_exception_edge(handler, throwing_op_id, phi-> operand()->vreg_number(), phi, move_resolver); }; } } } { int temp__1997 = cur_state->locals_size(); for (cur_index = 0 ; cur_index < temp__1997 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { Phi* phi = value->as_Phi(); if ( phi != __null && phi->block() == block) { if (!phi ->is_illegal()) { resolve_exception_edge(handler, throwing_op_id , phi->operand()->vreg_number(), phi, move_resolver); } ; } } } } |
| 1996 | if (!phi->is_illegal()) { resolve_exception_edge(handler, throwing_op_id, phi->operand()->vreg_number(), phi, move_resolver); }{ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__1997 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__1997 && (value = cur_state ->stack_at(cur_index), true); cur_index += value->type( )->size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { resolve_exception_edge(handler, throwing_op_id, phi-> operand()->vreg_number(), phi, move_resolver); }; } } } { int temp__1997 = cur_state->locals_size(); for (cur_index = 0 ; cur_index < temp__1997 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { Phi* phi = value->as_Phi(); if ( phi != __null && phi->block() == block) { if (!phi ->is_illegal()) { resolve_exception_edge(handler, throwing_op_id , phi->operand()->vreg_number(), phi, move_resolver); } ; } } } } |
| 1997 | ){ int cur_index; ValueStack* cur_state = block->state(); Value value; { int temp__1997 = cur_state->stack_size(); for (cur_index = 0; cur_index < temp__1997 && (value = cur_state ->stack_at(cur_index), true); cur_index += value->type( )->size()) { Phi* phi = value->as_Phi(); if (phi != __null && phi->block() == block) { if (!phi->is_illegal ()) { resolve_exception_edge(handler, throwing_op_id, phi-> operand()->vreg_number(), phi, move_resolver); }; } } } { int temp__1997 = cur_state->locals_size(); for (cur_index = 0 ; cur_index < temp__1997 && (value = cur_state-> local_at(cur_index), true); cur_index += (value == __null || value ->type()->is_illegal() ? 1 : value->type()->size( ))) if (value != __null) { Phi* phi = value->as_Phi(); if ( phi != __null && phi->block() == block) { if (!phi ->is_illegal()) { resolve_exception_edge(handler, throwing_op_id , phi->operand()->vreg_number(), phi, move_resolver); } ; } } } }; |
| 1998 | |
| 1999 | if (move_resolver.has_mappings()) { |
| 2000 | LIR_List* entry_code = new LIR_List(compilation()); |
| 2001 | move_resolver.set_insert_position(entry_code, 0); |
| 2002 | move_resolver.resolve_and_append_moves(); |
| 2003 | |
| 2004 | entry_code->jump(handler->entry_block()); |
| 2005 | handler->set_entry_code(entry_code); |
| 2006 | } |
| 2007 | } |
| 2008 | |
| 2009 | |
| 2010 | void LinearScan::resolve_exception_handlers() { |
| 2011 | MoveResolver move_resolver(this); |
| 2012 | LIR_OpVisitState visitor; |
| 2013 | int num_blocks = block_count(); |
| 2014 | |
| 2015 | int i; |
| 2016 | for (i = 0; i < num_blocks; i++) { |
| 2017 | BlockBegin* block = block_at(i); |
| 2018 | if (block->is_set(BlockBegin::exception_entry_flag)) { |
| 2019 | resolve_exception_entry(block, move_resolver); |
| 2020 | } |
| 2021 | } |
| 2022 | |
| 2023 | for (i = 0; i < num_blocks; i++) { |
| 2024 | BlockBegin* block = block_at(i); |
| 2025 | LIR_List* ops = block->lir(); |
| 2026 | int num_ops = ops->length(); |
| 2027 | |
| 2028 | // iterate all instructions of the block. skip the first because it is always a label |
| 2029 | assert(visitor.no_operands(ops->at(0)), "first operation must always be a label")do { if (!(visitor.no_operands(ops->at(0)))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2029, "assert(" "visitor.no_operands(ops->at(0))" ") failed" , "first operation must always be a label"); ::breakpoint(); } } while (0); |
| 2030 | for (int j = 1; j < num_ops; j++) { |
| 2031 | LIR_Op* op = ops->at(j); |
| 2032 | int op_id = op->id(); |
| 2033 | |
| 2034 | if (op_id != -1 && has_info(op_id)) { |
| 2035 | // visit operation to collect all operands |
| 2036 | visitor.visit(op); |
| 2037 | assert(visitor.info_count() > 0, "should not visit otherwise")do { if (!(visitor.info_count() > 0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2037, "assert(" "visitor.info_count() > 0" ") failed", "should not visit otherwise" ); ::breakpoint(); } } while (0); |
| 2038 | |
| 2039 | XHandlers* xhandlers = visitor.all_xhandler(); |
| 2040 | int n = xhandlers->length(); |
| 2041 | for (int k = 0; k < n; k++) { |
| 2042 | resolve_exception_edge(xhandlers->handler_at(k), op_id, move_resolver); |
| 2043 | } |
| 2044 | |
| 2045 | #ifdef ASSERT1 |
| 2046 | } else { |
| 2047 | visitor.visit(op); |
| 2048 | assert(visitor.all_xhandler()->length() == 0, "missed exception handler")do { if (!(visitor.all_xhandler()->length() == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2048, "assert(" "visitor.all_xhandler()->length() == 0" ") failed" , "missed exception handler"); ::breakpoint(); } } while (0); |
| 2049 | #endif |
| 2050 | } |
| 2051 | } |
| 2052 | } |
| 2053 | } |
| 2054 | |
| 2055 | |
| 2056 | // ********** Phase 7: assign register numbers back to LIR |
| 2057 | // (includes computation of debug information and oop maps) |
| 2058 | |
| 2059 | VMReg LinearScan::vm_reg_for_interval(Interval* interval) { |
| 2060 | VMReg reg = interval->cached_vm_reg(); |
| 2061 | if (!reg->is_valid() ) { |
| 2062 | reg = vm_reg_for_operand(operand_for_interval(interval)); |
| 2063 | interval->set_cached_vm_reg(reg); |
| 2064 | } |
| 2065 | assert(reg == vm_reg_for_operand(operand_for_interval(interval)), "wrong cached value")do { if (!(reg == vm_reg_for_operand(operand_for_interval(interval )))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2065, "assert(" "reg == vm_reg_for_operand(operand_for_interval(interval))" ") failed", "wrong cached value"); ::breakpoint(); } } while (0); |
| 2066 | return reg; |
| 2067 | } |
| 2068 | |
| 2069 | VMReg LinearScan::vm_reg_for_operand(LIR_Opr opr) { |
| 2070 | assert(opr->is_oop(), "currently only implemented for oop operands")do { if (!(opr->is_oop())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2070, "assert(" "opr->is_oop()" ") failed", "currently only implemented for oop operands" ); ::breakpoint(); } } while (0); |
| 2071 | return frame_map()->regname(opr); |
| 2072 | } |
| 2073 | |
| 2074 | |
| 2075 | LIR_Opr LinearScan::operand_for_interval(Interval* interval) { |
| 2076 | LIR_Opr opr = interval->cached_opr(); |
| 2077 | if (opr->is_illegal()) { |
| 2078 | opr = calc_operand_for_interval(interval); |
| 2079 | interval->set_cached_opr(opr); |
| 2080 | } |
| 2081 | |
| 2082 | assert(opr == calc_operand_for_interval(interval), "wrong cached value")do { if (!(opr == calc_operand_for_interval(interval))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2082, "assert(" "opr == calc_operand_for_interval(interval)" ") failed", "wrong cached value"); ::breakpoint(); } } while (0); |
| 2083 | return opr; |
| 2084 | } |
| 2085 | |
| 2086 | LIR_Opr LinearScan::calc_operand_for_interval(const Interval* interval) { |
| 2087 | int assigned_reg = interval->assigned_reg(); |
| 2088 | BasicType type = interval->type(); |
| 2089 | |
| 2090 | if (assigned_reg >= nof_regs) { |
| 2091 | // stack slot |
| 2092 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2092, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2093 | return LIR_OprFact::stack(assigned_reg - nof_regs, type); |
| 2094 | |
| 2095 | } else { |
| 2096 | // register |
| 2097 | switch (type) { |
| 2098 | case T_OBJECT: { |
| 2099 | assert(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg, "no cpu register")do { if (!(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2099, "assert(" "assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ); |
| 2100 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2100, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2101 | return LIR_OprFact::single_cpu_oop(assigned_reg); |
| 2102 | } |
| 2103 | |
| 2104 | case T_ADDRESS: { |
| 2105 | assert(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg, "no cpu register")do { if (!(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2105, "assert(" "assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ); |
| 2106 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2106, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2107 | return LIR_OprFact::single_cpu_address(assigned_reg); |
| 2108 | } |
| 2109 | |
| 2110 | case T_METADATA: { |
| 2111 | assert(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg, "no cpu register")do { if (!(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2111, "assert(" "assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ); |
| 2112 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2112, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2113 | return LIR_OprFact::single_cpu_metadata(assigned_reg); |
| 2114 | } |
| 2115 | |
| 2116 | #ifdef __SOFTFP__ |
| 2117 | case T_FLOAT: // fall through |
| 2118 | #endif // __SOFTFP__ |
| 2119 | case T_INT: { |
| 2120 | assert(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg, "no cpu register")do { if (!(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2120, "assert(" "assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ); |
| 2121 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2121, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2122 | return LIR_OprFact::single_cpu(assigned_reg); |
| 2123 | } |
| 2124 | |
| 2125 | #ifdef __SOFTFP__ |
| 2126 | case T_DOUBLE: // fall through |
| 2127 | #endif // __SOFTFP__ |
| 2128 | case T_LONG: { |
| 2129 | int assigned_regHi = interval->assigned_regHi(); |
| 2130 | assert(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg, "no cpu register")do { if (!(assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2130, "assert(" "assigned_reg >= pd_first_cpu_reg && assigned_reg <= pd_last_cpu_reg" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ); |
| 2131 | assert(num_physical_regs(T_LONG) == 1 ||do { if (!(num_physical_regs(T_LONG) == 1 || (assigned_regHi >= pd_first_cpu_reg && assigned_regHi <= pd_last_cpu_reg ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2132, "assert(" "num_physical_regs(T_LONG) == 1 || (assigned_regHi >= pd_first_cpu_reg && assigned_regHi <= pd_last_cpu_reg)" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ) |
| 2132 | (assigned_regHi >= pd_first_cpu_reg && assigned_regHi <= pd_last_cpu_reg), "no cpu register")do { if (!(num_physical_regs(T_LONG) == 1 || (assigned_regHi >= pd_first_cpu_reg && assigned_regHi <= pd_last_cpu_reg ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2132, "assert(" "num_physical_regs(T_LONG) == 1 || (assigned_regHi >= pd_first_cpu_reg && assigned_regHi <= pd_last_cpu_reg)" ") failed", "no cpu register"); ::breakpoint(); } } while (0 ); |
| 2133 | |
| 2134 | assert(assigned_reg != assigned_regHi, "invalid allocation")do { if (!(assigned_reg != assigned_regHi)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2134, "assert(" "assigned_reg != assigned_regHi" ") failed" , "invalid allocation"); ::breakpoint(); } } while (0); |
| 2135 | assert(num_physical_regs(T_LONG) == 1 || assigned_reg < assigned_regHi,do { if (!(num_physical_regs(T_LONG) == 1 || assigned_reg < assigned_regHi)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2136, "assert(" "num_physical_regs(T_LONG) == 1 || assigned_reg < assigned_regHi" ") failed", "register numbers must be sorted (ensure that e.g. a move from eax,ebx to ebx,eax can not occur)" ); ::breakpoint(); } } while (0) |
| 2136 | "register numbers must be sorted (ensure that e.g. a move from eax,ebx to ebx,eax can not occur)")do { if (!(num_physical_regs(T_LONG) == 1 || assigned_reg < assigned_regHi)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2136, "assert(" "num_physical_regs(T_LONG) == 1 || assigned_reg < assigned_regHi" ") failed", "register numbers must be sorted (ensure that e.g. a move from eax,ebx to ebx,eax can not occur)" ); ::breakpoint(); } } while (0); |
| 2137 | assert((assigned_regHi != any_reg) ^ (num_physical_regs(T_LONG) == 1), "must be match")do { if (!((assigned_regHi != any_reg) ^ (num_physical_regs(T_LONG ) == 1))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2137, "assert(" "(assigned_regHi != any_reg) ^ (num_physical_regs(T_LONG) == 1)" ") failed", "must be match"); ::breakpoint(); } } while (0); |
| 2138 | if (requires_adjacent_regs(T_LONG)) { |
| 2139 | assert(assigned_reg % 2 == 0 && assigned_reg + 1 == assigned_regHi, "must be sequential and even")do { if (!(assigned_reg % 2 == 0 && assigned_reg + 1 == assigned_regHi)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2139, "assert(" "assigned_reg % 2 == 0 && assigned_reg + 1 == assigned_regHi" ") failed", "must be sequential and even"); ::breakpoint(); } } while (0); |
| 2140 | } |
| 2141 | |
| 2142 | #ifdef _LP641 |
| 2143 | return LIR_OprFact::double_cpu(assigned_reg, assigned_reg); |
| 2144 | #else |
| 2145 | return LIR_OprFact::double_cpu(assigned_reg, assigned_regHi); |
| 2146 | #endif // LP64 |
| 2147 | } |
| 2148 | |
| 2149 | #ifndef __SOFTFP__ |
| 2150 | case T_FLOAT: { |
| 2151 | #ifdef X86 |
| 2152 | if (UseSSE >= 1) { |
| 2153 | int last_xmm_reg = pd_last_xmm_reg; |
| 2154 | #ifdef _LP641 |
| 2155 | if (UseAVX < 3) { |
| 2156 | last_xmm_reg = pd_first_xmm_reg + (pd_nof_xmm_regs_frame_map / 2) - 1; |
| 2157 | } |
| 2158 | #endif // LP64 |
| 2159 | assert(assigned_reg >= pd_first_xmm_reg && assigned_reg <= last_xmm_reg, "no xmm register")do { if (!(assigned_reg >= pd_first_xmm_reg && assigned_reg <= last_xmm_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2159, "assert(" "assigned_reg >= pd_first_xmm_reg && assigned_reg <= last_xmm_reg" ") failed", "no xmm register"); ::breakpoint(); } } while (0 ); |
| 2160 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2160, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2161 | return LIR_OprFact::single_xmm(assigned_reg - pd_first_xmm_reg); |
| 2162 | } |
| 2163 | #endif // X86 |
| 2164 | |
| 2165 | assert(assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg, "no fpu register")do { if (!(assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2165, "assert(" "assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg" ") failed", "no fpu register"); ::breakpoint(); } } while (0 ); |
| 2166 | assert(interval->assigned_regHi() == any_reg, "must not have hi register")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2166, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register"); ::breakpoint(); } } while (0); |
| 2167 | return LIR_OprFact::single_fpu(assigned_reg - pd_first_fpu_reg); |
| 2168 | } |
| 2169 | |
| 2170 | case T_DOUBLE: { |
| 2171 | #ifdef X86 |
| 2172 | if (UseSSE >= 2) { |
| 2173 | int last_xmm_reg = pd_last_xmm_reg; |
| 2174 | #ifdef _LP641 |
| 2175 | if (UseAVX < 3) { |
| 2176 | last_xmm_reg = pd_first_xmm_reg + (pd_nof_xmm_regs_frame_map / 2) - 1; |
| 2177 | } |
| 2178 | #endif // LP64 |
| 2179 | assert(assigned_reg >= pd_first_xmm_reg && assigned_reg <= last_xmm_reg, "no xmm register")do { if (!(assigned_reg >= pd_first_xmm_reg && assigned_reg <= last_xmm_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2179, "assert(" "assigned_reg >= pd_first_xmm_reg && assigned_reg <= last_xmm_reg" ") failed", "no xmm register"); ::breakpoint(); } } while (0 ); |
| 2180 | assert(interval->assigned_regHi() == any_reg, "must not have hi register (double xmm values are stored in one register)")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2180, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register (double xmm values are stored in one register)" ); ::breakpoint(); } } while (0); |
| 2181 | return LIR_OprFact::double_xmm(assigned_reg - pd_first_xmm_reg); |
| 2182 | } |
| 2183 | #endif // X86 |
| 2184 | |
| 2185 | #if defined(ARM32) |
| 2186 | assert(assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg, "no fpu register")do { if (!(assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2186, "assert(" "assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg" ") failed", "no fpu register"); ::breakpoint(); } } while (0 ); |
| 2187 | assert(interval->assigned_regHi() >= pd_first_fpu_reg && interval->assigned_regHi() <= pd_last_fpu_reg, "no fpu register")do { if (!(interval->assigned_regHi() >= pd_first_fpu_reg && interval->assigned_regHi() <= pd_last_fpu_reg )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2187, "assert(" "interval->assigned_regHi() >= pd_first_fpu_reg && interval->assigned_regHi() <= pd_last_fpu_reg" ") failed", "no fpu register"); ::breakpoint(); } } while (0 ); |
| 2188 | assert(assigned_reg % 2 == 0 && assigned_reg + 1 == interval->assigned_regHi(), "must be sequential and even")do { if (!(assigned_reg % 2 == 0 && assigned_reg + 1 == interval->assigned_regHi())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2188, "assert(" "assigned_reg % 2 == 0 && assigned_reg + 1 == interval->assigned_regHi()" ") failed", "must be sequential and even"); ::breakpoint(); } } while (0); |
| 2189 | LIR_Opr result = LIR_OprFact::double_fpu(assigned_reg - pd_first_fpu_reg, interval->assigned_regHi() - pd_first_fpu_reg); |
| 2190 | #else |
| 2191 | assert(assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg, "no fpu register")do { if (!(assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2191, "assert(" "assigned_reg >= pd_first_fpu_reg && assigned_reg <= pd_last_fpu_reg" ") failed", "no fpu register"); ::breakpoint(); } } while (0 ); |
| 2192 | assert(interval->assigned_regHi() == any_reg, "must not have hi register (double fpu values are stored in one register on Intel)")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2192, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "must not have hi register (double fpu values are stored in one register on Intel)" ); ::breakpoint(); } } while (0); |
| 2193 | LIR_Opr result = LIR_OprFact::double_fpu(assigned_reg - pd_first_fpu_reg); |
| 2194 | #endif |
| 2195 | return result; |
| 2196 | } |
| 2197 | #endif // __SOFTFP__ |
| 2198 | |
| 2199 | default: { |
| 2200 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2200); ::breakpoint(); } while (0); |
| 2201 | return LIR_OprFact::illegalOpr; |
| 2202 | } |
| 2203 | } |
| 2204 | } |
| 2205 | } |
| 2206 | |
| 2207 | LIR_Opr LinearScan::canonical_spill_opr(Interval* interval) { |
| 2208 | assert(interval->canonical_spill_slot() >= nof_regs, "canonical spill slot not set")do { if (!(interval->canonical_spill_slot() >= nof_regs )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2208, "assert(" "interval->canonical_spill_slot() >= nof_regs" ") failed", "canonical spill slot not set"); ::breakpoint(); } } while (0); |
| 2209 | return LIR_OprFact::stack(interval->canonical_spill_slot() - nof_regs, interval->type()); |
| 2210 | } |
| 2211 | |
| 2212 | LIR_Opr LinearScan::color_lir_opr(LIR_Opr opr, int op_id, LIR_OpVisitState::OprMode mode) { |
| 2213 | assert(opr->is_virtual(), "should not call this otherwise")do { if (!(opr->is_virtual())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2213, "assert(" "opr->is_virtual()" ") failed", "should not call this otherwise" ); ::breakpoint(); } } while (0); |
| 2214 | |
| 2215 | Interval* interval = interval_at(opr->vreg_number()); |
| 2216 | assert(interval != NULL, "interval must exist")do { if (!(interval != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2216, "assert(" "interval != __null" ") failed", "interval must exist" ); ::breakpoint(); } } while (0); |
| 2217 | |
| 2218 | if (op_id != -1) { |
| 2219 | #ifdef ASSERT1 |
| 2220 | BlockBegin* block = block_of_op_with_id(op_id); |
| 2221 | if (block->number_of_sux() <= 1 && op_id == block->last_lir_instruction_id()) { |
| 2222 | // check if spill moves could have been appended at the end of this block, but |
| 2223 | // before the branch instruction. So the split child information for this branch would |
| 2224 | // be incorrect. |
| 2225 | LIR_OpBranch* branch = block->lir()->instructions_list()->last()->as_OpBranch(); |
| 2226 | if (branch != NULL__null) { |
| 2227 | if (block->live_out().at(opr->vreg_number())) { |
| 2228 | assert(branch->cond() == lir_cond_always, "block does not end with an unconditional jump")do { if (!(branch->cond() == lir_cond_always)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2228, "assert(" "branch->cond() == lir_cond_always" ") failed" , "block does not end with an unconditional jump"); ::breakpoint (); } } while (0); |
| 2229 | assert(false, "can't get split child for the last branch of a block because the information would be incorrect (moves are inserted before the branch in resolve_data_flow)")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2229, "assert(" "false" ") failed", "can't get split child for the last branch of a block because the information would be incorrect (moves are inserted before the branch in resolve_data_flow)" ); ::breakpoint(); } } while (0); |
| 2230 | } |
| 2231 | } |
| 2232 | } |
| 2233 | #endif |
| 2234 | |
| 2235 | // operands are not changed when an interval is split during allocation, |
| 2236 | // so search the right interval here |
| 2237 | interval = split_child_at_op_id(interval, op_id, mode); |
| 2238 | } |
| 2239 | |
| 2240 | LIR_Opr res = operand_for_interval(interval); |
| 2241 | |
| 2242 | #ifdef X86 |
| 2243 | // new semantic for is_last_use: not only set on definite end of interval, |
| 2244 | // but also before hole |
| 2245 | // This may still miss some cases (e.g. for dead values), but it is not necessary that the |
| 2246 | // last use information is completely correct |
| 2247 | // information is only needed for fpu stack allocation |
| 2248 | if (res->is_fpu_register()) { |
| 2249 | if (opr->is_last_use() || op_id == interval->to() || (op_id != -1 && interval->has_hole_between(op_id, op_id + 1))) { |
| 2250 | assert(op_id == -1 || !is_block_begin(op_id), "holes at begin of block may also result from control flow")do { if (!(op_id == -1 || !is_block_begin(op_id))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2250, "assert(" "op_id == -1 || !is_block_begin(op_id)" ") failed" , "holes at begin of block may also result from control flow" ); ::breakpoint(); } } while (0); |
| 2251 | res = res->make_last_use(); |
| 2252 | } |
| 2253 | } |
| 2254 | #endif |
| 2255 | |
| 2256 | assert(!gen()->is_vreg_flag_set(opr->vreg_number(), LIRGenerator::callee_saved) || !FrameMap::is_caller_save_register(res), "bad allocation")do { if (!(!gen()->is_vreg_flag_set(opr->vreg_number(), LIRGenerator::callee_saved) || !FrameMap::is_caller_save_register (res))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2256, "assert(" "!gen()->is_vreg_flag_set(opr->vreg_number(), LIRGenerator::callee_saved) || !FrameMap::is_caller_save_register(res)" ") failed", "bad allocation"); ::breakpoint(); } } while (0); |
| 2257 | |
| 2258 | return res; |
| 2259 | } |
| 2260 | |
| 2261 | |
| 2262 | #ifdef ASSERT1 |
| 2263 | // some methods used to check correctness of debug information |
| 2264 | |
| 2265 | void assert_no_register_values(GrowableArray<ScopeValue*>* values) { |
| 2266 | if (values == NULL__null) { |
| 2267 | return; |
| 2268 | } |
| 2269 | |
| 2270 | for (int i = 0; i < values->length(); i++) { |
| 2271 | ScopeValue* value = values->at(i); |
| 2272 | |
| 2273 | if (value->is_location()) { |
| 2274 | Location location = ((LocationValue*)value)->location(); |
| 2275 | assert(location.where() == Location::on_stack, "value is in register")do { if (!(location.where() == Location::on_stack)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2275, "assert(" "location.where() == Location::on_stack" ") failed" , "value is in register"); ::breakpoint(); } } while (0); |
| 2276 | } |
| 2277 | } |
| 2278 | } |
| 2279 | |
| 2280 | void assert_no_register_values(GrowableArray<MonitorValue*>* values) { |
| 2281 | if (values == NULL__null) { |
| 2282 | return; |
| 2283 | } |
| 2284 | |
| 2285 | for (int i = 0; i < values->length(); i++) { |
| 2286 | MonitorValue* value = values->at(i); |
| 2287 | |
| 2288 | if (value->owner()->is_location()) { |
| 2289 | Location location = ((LocationValue*)value->owner())->location(); |
| 2290 | assert(location.where() == Location::on_stack, "owner is in register")do { if (!(location.where() == Location::on_stack)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2290, "assert(" "location.where() == Location::on_stack" ") failed" , "owner is in register"); ::breakpoint(); } } while (0); |
| 2291 | } |
| 2292 | assert(value->basic_lock().where() == Location::on_stack, "basic_lock is in register")do { if (!(value->basic_lock().where() == Location::on_stack )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2292, "assert(" "value->basic_lock().where() == Location::on_stack" ") failed", "basic_lock is in register"); ::breakpoint(); } } while (0); |
| 2293 | } |
| 2294 | } |
| 2295 | |
| 2296 | void assert_equal(Location l1, Location l2) { |
| 2297 | assert(l1.where() == l2.where() && l1.type() == l2.type() && l1.offset() == l2.offset(), "")do { if (!(l1.where() == l2.where() && l1.type() == l2 .type() && l1.offset() == l2.offset())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2297, "assert(" "l1.where() == l2.where() && l1.type() == l2.type() && l1.offset() == l2.offset()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2298 | } |
| 2299 | |
| 2300 | void assert_equal(ScopeValue* v1, ScopeValue* v2) { |
| 2301 | if (v1->is_location()) { |
| 2302 | assert(v2->is_location(), "")do { if (!(v2->is_location())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2302, "assert(" "v2->is_location()" ") failed", ""); ::breakpoint (); } } while (0); |
| 2303 | assert_equal(((LocationValue*)v1)->location(), ((LocationValue*)v2)->location()); |
| 2304 | } else if (v1->is_constant_int()) { |
| 2305 | assert(v2->is_constant_int(), "")do { if (!(v2->is_constant_int())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2305, "assert(" "v2->is_constant_int()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2306 | assert(((ConstantIntValue*)v1)->value() == ((ConstantIntValue*)v2)->value(), "")do { if (!(((ConstantIntValue*)v1)->value() == ((ConstantIntValue *)v2)->value())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2306, "assert(" "((ConstantIntValue*)v1)->value() == ((ConstantIntValue*)v2)->value()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2307 | } else if (v1->is_constant_double()) { |
| 2308 | assert(v2->is_constant_double(), "")do { if (!(v2->is_constant_double())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2308, "assert(" "v2->is_constant_double()" ") failed", "" ); ::breakpoint(); } } while (0); |
| 2309 | assert(((ConstantDoubleValue*)v1)->value() == ((ConstantDoubleValue*)v2)->value(), "")do { if (!(((ConstantDoubleValue*)v1)->value() == ((ConstantDoubleValue *)v2)->value())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2309, "assert(" "((ConstantDoubleValue*)v1)->value() == ((ConstantDoubleValue*)v2)->value()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2310 | } else if (v1->is_constant_long()) { |
| 2311 | assert(v2->is_constant_long(), "")do { if (!(v2->is_constant_long())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2311, "assert(" "v2->is_constant_long()" ") failed", "") ; ::breakpoint(); } } while (0); |
| 2312 | assert(((ConstantLongValue*)v1)->value() == ((ConstantLongValue*)v2)->value(), "")do { if (!(((ConstantLongValue*)v1)->value() == ((ConstantLongValue *)v2)->value())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2312, "assert(" "((ConstantLongValue*)v1)->value() == ((ConstantLongValue*)v2)->value()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2313 | } else if (v1->is_constant_oop()) { |
| 2314 | assert(v2->is_constant_oop(), "")do { if (!(v2->is_constant_oop())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2314, "assert(" "v2->is_constant_oop()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2315 | assert(((ConstantOopWriteValue*)v1)->value() == ((ConstantOopWriteValue*)v2)->value(), "")do { if (!(((ConstantOopWriteValue*)v1)->value() == ((ConstantOopWriteValue *)v2)->value())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2315, "assert(" "((ConstantOopWriteValue*)v1)->value() == ((ConstantOopWriteValue*)v2)->value()" ") failed", ""); ::breakpoint(); } } while (0); |
| 2316 | } else { |
| 2317 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2317); ::breakpoint(); } while (0); |
| 2318 | } |
| 2319 | } |
| 2320 | |
| 2321 | void assert_equal(MonitorValue* m1, MonitorValue* m2) { |
| 2322 | assert_equal(m1->owner(), m2->owner()); |
| 2323 | assert_equal(m1->basic_lock(), m2->basic_lock()); |
| 2324 | } |
| 2325 | |
| 2326 | void assert_equal(IRScopeDebugInfo* d1, IRScopeDebugInfo* d2) { |
| 2327 | assert(d1->scope() == d2->scope(), "not equal")do { if (!(d1->scope() == d2->scope())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2327, "assert(" "d1->scope() == d2->scope()" ") failed" , "not equal"); ::breakpoint(); } } while (0); |
| 2328 | assert(d1->bci() == d2->bci(), "not equal")do { if (!(d1->bci() == d2->bci())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2328, "assert(" "d1->bci() == d2->bci()" ") failed", "not equal" ); ::breakpoint(); } } while (0); |
| 2329 | |
| 2330 | if (d1->locals() != NULL__null) { |
| 2331 | assert(d1->locals() != NULL && d2->locals() != NULL, "not equal")do { if (!(d1->locals() != __null && d2->locals () != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2331, "assert(" "d1->locals() != __null && d2->locals() != __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2332 | assert(d1->locals()->length() == d2->locals()->length(), "not equal")do { if (!(d1->locals()->length() == d2->locals()-> length())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2332, "assert(" "d1->locals()->length() == d2->locals()->length()" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2333 | for (int i = 0; i < d1->locals()->length(); i++) { |
| 2334 | assert_equal(d1->locals()->at(i), d2->locals()->at(i)); |
| 2335 | } |
| 2336 | } else { |
| 2337 | assert(d1->locals() == NULL && d2->locals() == NULL, "not equal")do { if (!(d1->locals() == __null && d2->locals () == __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2337, "assert(" "d1->locals() == __null && d2->locals() == __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2338 | } |
| 2339 | |
| 2340 | if (d1->expressions() != NULL__null) { |
| 2341 | assert(d1->expressions() != NULL && d2->expressions() != NULL, "not equal")do { if (!(d1->expressions() != __null && d2->expressions () != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2341, "assert(" "d1->expressions() != __null && d2->expressions() != __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2342 | assert(d1->expressions()->length() == d2->expressions()->length(), "not equal")do { if (!(d1->expressions()->length() == d2->expressions ()->length())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2342, "assert(" "d1->expressions()->length() == d2->expressions()->length()" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2343 | for (int i = 0; i < d1->expressions()->length(); i++) { |
| 2344 | assert_equal(d1->expressions()->at(i), d2->expressions()->at(i)); |
| 2345 | } |
| 2346 | } else { |
| 2347 | assert(d1->expressions() == NULL && d2->expressions() == NULL, "not equal")do { if (!(d1->expressions() == __null && d2->expressions () == __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2347, "assert(" "d1->expressions() == __null && d2->expressions() == __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2348 | } |
| 2349 | |
| 2350 | if (d1->monitors() != NULL__null) { |
| 2351 | assert(d1->monitors() != NULL && d2->monitors() != NULL, "not equal")do { if (!(d1->monitors() != __null && d2->monitors () != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2351, "assert(" "d1->monitors() != __null && d2->monitors() != __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2352 | assert(d1->monitors()->length() == d2->monitors()->length(), "not equal")do { if (!(d1->monitors()->length() == d2->monitors( )->length())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2352, "assert(" "d1->monitors()->length() == d2->monitors()->length()" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2353 | for (int i = 0; i < d1->monitors()->length(); i++) { |
| 2354 | assert_equal(d1->monitors()->at(i), d2->monitors()->at(i)); |
| 2355 | } |
| 2356 | } else { |
| 2357 | assert(d1->monitors() == NULL && d2->monitors() == NULL, "not equal")do { if (!(d1->monitors() == __null && d2->monitors () == __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2357, "assert(" "d1->monitors() == __null && d2->monitors() == __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2358 | } |
| 2359 | |
| 2360 | if (d1->caller() != NULL__null) { |
| 2361 | assert(d1->caller() != NULL && d2->caller() != NULL, "not equal")do { if (!(d1->caller() != __null && d2->caller () != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2361, "assert(" "d1->caller() != __null && d2->caller() != __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2362 | assert_equal(d1->caller(), d2->caller()); |
| 2363 | } else { |
| 2364 | assert(d1->caller() == NULL && d2->caller() == NULL, "not equal")do { if (!(d1->caller() == __null && d2->caller () == __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2364, "assert(" "d1->caller() == __null && d2->caller() == __null" ") failed", "not equal"); ::breakpoint(); } } while (0); |
| 2365 | } |
| 2366 | } |
| 2367 | |
| 2368 | void check_stack_depth(CodeEmitInfo* info, int stack_end) { |
| 2369 | if (info->stack()->bci() != SynchronizationEntryBCI && !info->scope()->method()->is_native()) { |
| 2370 | Bytecodes::Code code = info->scope()->method()->java_code_at_bci(info->stack()->bci()); |
| 2371 | switch (code) { |
| 2372 | case Bytecodes::_ifnull : // fall through |
| 2373 | case Bytecodes::_ifnonnull : // fall through |
| 2374 | case Bytecodes::_ifeq : // fall through |
| 2375 | case Bytecodes::_ifne : // fall through |
| 2376 | case Bytecodes::_iflt : // fall through |
| 2377 | case Bytecodes::_ifge : // fall through |
| 2378 | case Bytecodes::_ifgt : // fall through |
| 2379 | case Bytecodes::_ifle : // fall through |
| 2380 | case Bytecodes::_if_icmpeq : // fall through |
| 2381 | case Bytecodes::_if_icmpne : // fall through |
| 2382 | case Bytecodes::_if_icmplt : // fall through |
| 2383 | case Bytecodes::_if_icmpge : // fall through |
| 2384 | case Bytecodes::_if_icmpgt : // fall through |
| 2385 | case Bytecodes::_if_icmple : // fall through |
| 2386 | case Bytecodes::_if_acmpeq : // fall through |
| 2387 | case Bytecodes::_if_acmpne : |
| 2388 | assert(stack_end >= -Bytecodes::depth(code), "must have non-empty expression stack at if bytecode")do { if (!(stack_end >= -Bytecodes::depth(code))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2388, "assert(" "stack_end >= -Bytecodes::depth(code)" ") failed" , "must have non-empty expression stack at if bytecode"); ::breakpoint (); } } while (0); |
| 2389 | break; |
| 2390 | default: |
| 2391 | break; |
| 2392 | } |
| 2393 | } |
| 2394 | } |
| 2395 | |
| 2396 | #endif // ASSERT |
| 2397 | |
| 2398 | |
| 2399 | IntervalWalker* LinearScan::init_compute_oop_maps() { |
| 2400 | // setup lists of potential oops for walking |
| 2401 | Interval* oop_intervals; |
| 2402 | Interval* non_oop_intervals; |
| 2403 | |
| 2404 | create_unhandled_lists(&oop_intervals, &non_oop_intervals, is_oop_interval, NULL__null); |
| 2405 | |
| 2406 | // intervals that have no oops inside need not to be processed |
| 2407 | // to ensure a walking until the last instruction id, add a dummy interval |
| 2408 | // with a high operation id |
| 2409 | non_oop_intervals = new Interval(any_reg); |
| 2410 | non_oop_intervals->add_range(max_jint - 2, max_jint - 1); |
| 2411 | |
| 2412 | return new IntervalWalker(this, oop_intervals, non_oop_intervals); |
| 2413 | } |
| 2414 | |
| 2415 | |
| 2416 | OopMap* LinearScan::compute_oop_map(IntervalWalker* iw, LIR_Op* op, CodeEmitInfo* info, bool is_call_site) { |
| 2417 | TRACE_LINEAR_SCAN(3, tty->print_cr("creating oop map at op_id %d", op->id()))if (TraceLinearScanLevel >= 3) { tty->print_cr("creating oop map at op_id %d" , op->id()); }; |
| 2418 | |
| 2419 | // walk before the current operation -> intervals that start at |
| 2420 | // the operation (= output operands of the operation) are not |
| 2421 | // included in the oop map |
| 2422 | iw->walk_before(op->id()); |
| 2423 | |
| 2424 | int frame_size = frame_map()->framesize(); |
| 2425 | int arg_count = frame_map()->oop_map_arg_count(); |
| 2426 | OopMap* map = new OopMap(frame_size, arg_count); |
| 2427 | |
| 2428 | // Iterate through active intervals |
| 2429 | for (Interval* interval = iw->active_first(fixedKind); interval != Interval::end(); interval = interval->next()) { |
| 2430 | int assigned_reg = interval->assigned_reg(); |
| 2431 | |
| 2432 | assert(interval->current_from() <= op->id() && op->id() <= interval->current_to(), "interval should not be active otherwise")do { if (!(interval->current_from() <= op->id() && op->id() <= interval->current_to())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2432, "assert(" "interval->current_from() <= op->id() && op->id() <= interval->current_to()" ") failed", "interval should not be active otherwise"); ::breakpoint (); } } while (0); |
| 2433 | assert(interval->assigned_regHi() == any_reg, "oop must be single word")do { if (!(interval->assigned_regHi() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2433, "assert(" "interval->assigned_regHi() == any_reg" ") failed" , "oop must be single word"); ::breakpoint(); } } while (0); |
| 2434 | assert(interval->reg_num() >= LIR_Opr::vreg_base, "fixed interval found")do { if (!(interval->reg_num() >= LIR_Opr::vreg_base)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2434, "assert(" "interval->reg_num() >= LIR_Opr::vreg_base" ") failed", "fixed interval found"); ::breakpoint(); } } while (0); |
| 2435 | |
| 2436 | // Check if this range covers the instruction. Intervals that |
| 2437 | // start or end at the current operation are not included in the |
| 2438 | // oop map, except in the case of patching moves. For patching |
| 2439 | // moves, any intervals which end at this instruction are included |
| 2440 | // in the oop map since we may safepoint while doing the patch |
| 2441 | // before we've consumed the inputs. |
| 2442 | if (op->is_patching() || op->id() < interval->current_to()) { |
| 2443 | |
| 2444 | // caller-save registers must not be included into oop-maps at calls |
| 2445 | assert(!is_call_site || assigned_reg >= nof_regs || !is_caller_save(assigned_reg), "interval is in a caller-save register at a call -> register will be overwritten")do { if (!(!is_call_site || assigned_reg >= nof_regs || !is_caller_save (assigned_reg))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2445, "assert(" "!is_call_site || assigned_reg >= nof_regs || !is_caller_save(assigned_reg)" ") failed", "interval is in a caller-save register at a call -> register will be overwritten" ); ::breakpoint(); } } while (0); |
| 2446 | |
| 2447 | VMReg name = vm_reg_for_interval(interval); |
| 2448 | set_oop(map, name); |
| 2449 | |
| 2450 | // Spill optimization: when the stack value is guaranteed to be always correct, |
| 2451 | // then it must be added to the oop map even if the interval is currently in a register |
| 2452 | if (interval->always_in_memory() && |
| 2453 | op->id() > interval->spill_definition_pos() && |
| 2454 | interval->assigned_reg() != interval->canonical_spill_slot()) { |
| 2455 | assert(interval->spill_definition_pos() > 0, "position not set correctly")do { if (!(interval->spill_definition_pos() > 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2455, "assert(" "interval->spill_definition_pos() > 0" ") failed", "position not set correctly"); ::breakpoint(); } } while (0); |
| 2456 | assert(interval->canonical_spill_slot() >= LinearScan::nof_regs, "no spill slot assigned")do { if (!(interval->canonical_spill_slot() >= LinearScan ::nof_regs)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2456, "assert(" "interval->canonical_spill_slot() >= LinearScan::nof_regs" ") failed", "no spill slot assigned"); ::breakpoint(); } } while (0); |
| 2457 | assert(interval->assigned_reg() < LinearScan::nof_regs, "interval is on stack, so stack slot is registered twice")do { if (!(interval->assigned_reg() < LinearScan::nof_regs )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2457, "assert(" "interval->assigned_reg() < LinearScan::nof_regs" ") failed", "interval is on stack, so stack slot is registered twice" ); ::breakpoint(); } } while (0); |
| 2458 | |
| 2459 | set_oop(map, frame_map()->slot_regname(interval->canonical_spill_slot() - LinearScan::nof_regs)); |
| 2460 | } |
| 2461 | } |
| 2462 | } |
| 2463 | |
| 2464 | // add oops from lock stack |
| 2465 | assert(info->stack() != NULL, "CodeEmitInfo must always have a stack")do { if (!(info->stack() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2465, "assert(" "info->stack() != __null" ") failed", "CodeEmitInfo must always have a stack" ); ::breakpoint(); } } while (0); |
| 2466 | int locks_count = info->stack()->total_locks_size(); |
| 2467 | for (int i = 0; i < locks_count; i++) { |
| 2468 | set_oop(map, frame_map()->monitor_object_regname(i)); |
| 2469 | } |
| 2470 | |
| 2471 | return map; |
| 2472 | } |
| 2473 | |
| 2474 | |
| 2475 | void LinearScan::compute_oop_map(IntervalWalker* iw, const LIR_OpVisitState &visitor, LIR_Op* op) { |
| 2476 | assert(visitor.info_count() > 0, "no oop map needed")do { if (!(visitor.info_count() > 0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2476, "assert(" "visitor.info_count() > 0" ") failed", "no oop map needed" ); ::breakpoint(); } } while (0); |
| 2477 | |
| 2478 | // compute oop_map only for first CodeEmitInfo |
| 2479 | // because it is (in most cases) equal for all other infos of the same operation |
| 2480 | CodeEmitInfo* first_info = visitor.info_at(0); |
| 2481 | OopMap* first_oop_map = compute_oop_map(iw, op, first_info, visitor.has_call()); |
| 2482 | |
| 2483 | for (int i = 0; i < visitor.info_count(); i++) { |
| 2484 | CodeEmitInfo* info = visitor.info_at(i); |
| 2485 | OopMap* oop_map = first_oop_map; |
| 2486 | |
| 2487 | // compute worst case interpreter size in case of a deoptimization |
| 2488 | _compilation->update_interpreter_frame_size(info->interpreter_frame_size()); |
| 2489 | |
| 2490 | if (info->stack()->locks_size() != first_info->stack()->locks_size()) { |
| 2491 | // this info has a different number of locks then the precomputed oop map |
| 2492 | // (possible for lock and unlock instructions) -> compute oop map with |
| 2493 | // correct lock information |
| 2494 | oop_map = compute_oop_map(iw, op, info, visitor.has_call()); |
| 2495 | } |
| 2496 | |
| 2497 | if (info->_oop_map == NULL__null) { |
| 2498 | info->_oop_map = oop_map; |
| 2499 | } else { |
| 2500 | // a CodeEmitInfo can not be shared between different LIR-instructions |
| 2501 | // because interval splitting can occur anywhere between two instructions |
| 2502 | // and so the oop maps must be different |
| 2503 | // -> check if the already set oop_map is exactly the one calculated for this operation |
| 2504 | assert(info->_oop_map == oop_map, "same CodeEmitInfo used for multiple LIR instructions")do { if (!(info->_oop_map == oop_map)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2504, "assert(" "info->_oop_map == oop_map" ") failed", "same CodeEmitInfo used for multiple LIR instructions" ); ::breakpoint(); } } while (0); |
| 2505 | } |
| 2506 | } |
| 2507 | } |
| 2508 | |
| 2509 | |
| 2510 | // frequently used constants |
| 2511 | // Allocate them with new so they are never destroyed (otherwise, a |
| 2512 | // forced exit could destroy these objects while they are still in |
| 2513 | // use). |
| 2514 | ConstantOopWriteValue* LinearScan::_oop_null_scope_value = new (ResourceObj::C_HEAP, mtCompiler) ConstantOopWriteValue(NULL__null); |
| 2515 | ConstantIntValue* LinearScan::_int_m1_scope_value = new (ResourceObj::C_HEAP, mtCompiler) ConstantIntValue(-1); |
| 2516 | ConstantIntValue* LinearScan::_int_0_scope_value = new (ResourceObj::C_HEAP, mtCompiler) ConstantIntValue((jint)0); |
| 2517 | ConstantIntValue* LinearScan::_int_1_scope_value = new (ResourceObj::C_HEAP, mtCompiler) ConstantIntValue(1); |
| 2518 | ConstantIntValue* LinearScan::_int_2_scope_value = new (ResourceObj::C_HEAP, mtCompiler) ConstantIntValue(2); |
| 2519 | LocationValue* _illegal_value = new (ResourceObj::C_HEAP, mtCompiler) LocationValue(Location()); |
| 2520 | |
| 2521 | void LinearScan::init_compute_debug_info() { |
| 2522 | // cache for frequently used scope values |
| 2523 | // (cpu registers and stack slots) |
| 2524 | int cache_size = (LinearScan::nof_cpu_regs + frame_map()->argcount() + max_spills()) * 2; |
| 2525 | _scope_value_cache = ScopeValueArray(cache_size, cache_size, NULL__null); |
| 2526 | } |
| 2527 | |
| 2528 | MonitorValue* LinearScan::location_for_monitor_index(int monitor_index) { |
| 2529 | Location loc; |
| 2530 | if (!frame_map()->location_for_monitor_object(monitor_index, &loc)) { |
| 2531 | bailout("too large frame"); |
| 2532 | } |
| 2533 | ScopeValue* object_scope_value = new LocationValue(loc); |
| 2534 | |
| 2535 | if (!frame_map()->location_for_monitor_lock(monitor_index, &loc)) { |
| 2536 | bailout("too large frame"); |
| 2537 | } |
| 2538 | return new MonitorValue(object_scope_value, loc); |
| 2539 | } |
| 2540 | |
| 2541 | LocationValue* LinearScan::location_for_name(int name, Location::Type loc_type) { |
| 2542 | Location loc; |
| 2543 | if (!frame_map()->locations_for_slot(name, loc_type, &loc)) { |
| 2544 | bailout("too large frame"); |
| 2545 | } |
| 2546 | return new LocationValue(loc); |
| 2547 | } |
| 2548 | |
| 2549 | |
| 2550 | int LinearScan::append_scope_value_for_constant(LIR_Opr opr, GrowableArray<ScopeValue*>* scope_values) { |
| 2551 | assert(opr->is_constant(), "should not be called otherwise")do { if (!(opr->is_constant())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2551, "assert(" "opr->is_constant()" ") failed", "should not be called otherwise" ); ::breakpoint(); } } while (0); |
| 2552 | |
| 2553 | LIR_Const* c = opr->as_constant_ptr(); |
| 2554 | BasicType t = c->type(); |
| 2555 | switch (t) { |
| 2556 | case T_OBJECT: { |
| 2557 | jobject value = c->as_jobject(); |
| 2558 | if (value == NULL__null) { |
| 2559 | scope_values->append(_oop_null_scope_value); |
| 2560 | } else { |
| 2561 | scope_values->append(new ConstantOopWriteValue(c->as_jobject())); |
| 2562 | } |
| 2563 | return 1; |
| 2564 | } |
| 2565 | |
| 2566 | case T_INT: // fall through |
| 2567 | case T_FLOAT: { |
| 2568 | int value = c->as_jint_bits(); |
| 2569 | switch (value) { |
| 2570 | case -1: scope_values->append(_int_m1_scope_value); break; |
| 2571 | case 0: scope_values->append(_int_0_scope_value); break; |
| 2572 | case 1: scope_values->append(_int_1_scope_value); break; |
| 2573 | case 2: scope_values->append(_int_2_scope_value); break; |
| 2574 | default: scope_values->append(new ConstantIntValue(c->as_jint_bits())); break; |
| 2575 | } |
| 2576 | return 1; |
| 2577 | } |
| 2578 | |
| 2579 | case T_LONG: // fall through |
| 2580 | case T_DOUBLE: { |
| 2581 | #ifdef _LP641 |
| 2582 | scope_values->append(_int_0_scope_value); |
| 2583 | scope_values->append(new ConstantLongValue(c->as_jlong_bits())); |
| 2584 | #else |
| 2585 | if (hi_word_offset_in_bytes > lo_word_offset_in_bytes) { |
| 2586 | scope_values->append(new ConstantIntValue(c->as_jint_hi_bits())); |
| 2587 | scope_values->append(new ConstantIntValue(c->as_jint_lo_bits())); |
| 2588 | } else { |
| 2589 | scope_values->append(new ConstantIntValue(c->as_jint_lo_bits())); |
| 2590 | scope_values->append(new ConstantIntValue(c->as_jint_hi_bits())); |
| 2591 | } |
| 2592 | #endif |
| 2593 | return 2; |
| 2594 | } |
| 2595 | |
| 2596 | case T_ADDRESS: { |
| 2597 | #ifdef _LP641 |
| 2598 | scope_values->append(new ConstantLongValue(c->as_jint())); |
| 2599 | #else |
| 2600 | scope_values->append(new ConstantIntValue(c->as_jint())); |
| 2601 | #endif |
| 2602 | return 1; |
| 2603 | } |
| 2604 | |
| 2605 | default: |
| 2606 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2606); ::breakpoint(); } while (0); |
| 2607 | return -1; |
| 2608 | } |
| 2609 | } |
| 2610 | |
| 2611 | int LinearScan::append_scope_value_for_operand(LIR_Opr opr, GrowableArray<ScopeValue*>* scope_values) { |
| 2612 | if (opr->is_single_stack()) { |
| 2613 | int stack_idx = opr->single_stack_ix(); |
| 2614 | bool is_oop = opr->is_oop_register(); |
| 2615 | int cache_idx = (stack_idx + LinearScan::nof_cpu_regs) * 2 + (is_oop ? 1 : 0); |
| 2616 | |
| 2617 | ScopeValue* sv = _scope_value_cache.at(cache_idx); |
| 2618 | if (sv == NULL__null) { |
| 2619 | Location::Type loc_type = is_oop ? Location::oop : Location::normal; |
| 2620 | sv = location_for_name(stack_idx, loc_type); |
| 2621 | _scope_value_cache.at_put(cache_idx, sv); |
| 2622 | } |
| 2623 | |
| 2624 | // check if cached value is correct |
| 2625 | DEBUG_ONLY(assert_equal(sv, location_for_name(stack_idx, is_oop ? Location::oop : Location::normal)))assert_equal(sv, location_for_name(stack_idx, is_oop ? Location ::oop : Location::normal)); |
| 2626 | |
| 2627 | scope_values->append(sv); |
| 2628 | return 1; |
| 2629 | |
| 2630 | } else if (opr->is_single_cpu()) { |
| 2631 | bool is_oop = opr->is_oop_register(); |
| 2632 | int cache_idx = opr->cpu_regnr() * 2 + (is_oop ? 1 : 0); |
| 2633 | Location::Type int_loc_type = NOT_LP64(Location::normal) LP64_ONLY(Location::int_in_long)Location::int_in_long; |
| 2634 | |
| 2635 | ScopeValue* sv = _scope_value_cache.at(cache_idx); |
| 2636 | if (sv == NULL__null) { |
| 2637 | Location::Type loc_type = is_oop ? Location::oop : int_loc_type; |
| 2638 | VMReg rname = frame_map()->regname(opr); |
| 2639 | sv = new LocationValue(Location::new_reg_loc(loc_type, rname)); |
| 2640 | _scope_value_cache.at_put(cache_idx, sv); |
| 2641 | } |
| 2642 | |
| 2643 | // check if cached value is correct |
| 2644 | DEBUG_ONLY(assert_equal(sv, new LocationValue(Location::new_reg_loc(is_oop ? Location::oop : int_loc_type, frame_map()->regname(opr)))))assert_equal(sv, new LocationValue(Location::new_reg_loc(is_oop ? Location::oop : int_loc_type, frame_map()->regname(opr) ))); |
| 2645 | |
| 2646 | scope_values->append(sv); |
| 2647 | return 1; |
| 2648 | |
| 2649 | #ifdef X86 |
| 2650 | } else if (opr->is_single_xmm()) { |
| 2651 | VMReg rname = opr->as_xmm_float_reg()->as_VMReg(); |
| 2652 | LocationValue* sv = new LocationValue(Location::new_reg_loc(Location::normal, rname)); |
| 2653 | |
| 2654 | scope_values->append(sv); |
| 2655 | return 1; |
| 2656 | #endif |
| 2657 | |
| 2658 | } else if (opr->is_single_fpu()) { |
| 2659 | #ifdef IA32 |
| 2660 | // the exact location of fpu stack values is only known |
| 2661 | // during fpu stack allocation, so the stack allocator object |
| 2662 | // must be present |
| 2663 | assert(use_fpu_stack_allocation(), "should not have float stack values without fpu stack allocation (all floats must be SSE2)")do { if (!(use_fpu_stack_allocation())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2663, "assert(" "use_fpu_stack_allocation()" ") failed", "should not have float stack values without fpu stack allocation (all floats must be SSE2)" ); ::breakpoint(); } } while (0); |
| 2664 | assert(_fpu_stack_allocator != NULL, "must be present")do { if (!(_fpu_stack_allocator != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2664, "assert(" "_fpu_stack_allocator != __null" ") failed" , "must be present"); ::breakpoint(); } } while (0); |
| 2665 | opr = _fpu_stack_allocator->to_fpu_stack(opr); |
| 2666 | #elif defined(AMD641) |
| 2667 | assert(false, "FPU not used on x86-64")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2667, "assert(" "false" ") failed", "FPU not used on x86-64" ); ::breakpoint(); } } while (0); |
| 2668 | #endif |
| 2669 | |
| 2670 | Location::Type loc_type = float_saved_as_double ? Location::float_in_dbl : Location::normal; |
| 2671 | VMReg rname = frame_map()->fpu_regname(opr->fpu_regnr()); |
| 2672 | #ifndef __SOFTFP__ |
| 2673 | #ifndef VM_LITTLE_ENDIAN1 |
| 2674 | // On S390 a (single precision) float value occupies only the high |
| 2675 | // word of the full double register. So when the double register is |
| 2676 | // stored to memory (e.g. by the RegisterSaver), then the float value |
| 2677 | // is found at offset 0. I.e. the code below is not needed on S390. |
| 2678 | #ifndef S390 |
| 2679 | if (! float_saved_as_double) { |
| 2680 | // On big endian system, we may have an issue if float registers use only |
| 2681 | // the low half of the (same) double registers. |
| 2682 | // Both the float and the double could have the same regnr but would correspond |
| 2683 | // to two different addresses once saved. |
| 2684 | |
| 2685 | // get next safely (no assertion checks) |
| 2686 | VMReg next = VMRegImpl::as_VMReg(1+rname->value()); |
| 2687 | if (next->is_reg() && |
| 2688 | (next->as_FloatRegister() == rname->as_FloatRegister())) { |
| 2689 | // the back-end does use the same numbering for the double and the float |
| 2690 | rname = next; // VMReg for the low bits, e.g. the real VMReg for the float |
| 2691 | } |
| 2692 | } |
| 2693 | #endif // !S390 |
| 2694 | #endif |
| 2695 | #endif |
| 2696 | LocationValue* sv = new LocationValue(Location::new_reg_loc(loc_type, rname)); |
| 2697 | |
| 2698 | scope_values->append(sv); |
| 2699 | return 1; |
| 2700 | |
| 2701 | } else { |
| 2702 | // double-size operands |
| 2703 | |
| 2704 | ScopeValue* first; |
| 2705 | ScopeValue* second; |
| 2706 | |
| 2707 | if (opr->is_double_stack()) { |
| 2708 | #ifdef _LP641 |
| 2709 | Location loc1; |
| 2710 | Location::Type loc_type = opr->type() == T_LONG ? Location::lng : Location::dbl; |
| 2711 | if (!frame_map()->locations_for_slot(opr->double_stack_ix(), loc_type, &loc1, NULL__null)) { |
| 2712 | bailout("too large frame"); |
| 2713 | } |
| 2714 | |
| 2715 | first = new LocationValue(loc1); |
| 2716 | second = _int_0_scope_value; |
| 2717 | #else |
| 2718 | Location loc1, loc2; |
| 2719 | if (!frame_map()->locations_for_slot(opr->double_stack_ix(), Location::normal, &loc1, &loc2)) { |
| 2720 | bailout("too large frame"); |
| 2721 | } |
| 2722 | first = new LocationValue(loc1); |
| 2723 | second = new LocationValue(loc2); |
| 2724 | #endif // _LP64 |
| 2725 | |
| 2726 | } else if (opr->is_double_cpu()) { |
| 2727 | #ifdef _LP641 |
| 2728 | VMReg rname_first = opr->as_register_lo()->as_VMReg(); |
| 2729 | first = new LocationValue(Location::new_reg_loc(Location::lng, rname_first)); |
| 2730 | second = _int_0_scope_value; |
| 2731 | #else |
| 2732 | VMReg rname_first = opr->as_register_lo()->as_VMReg(); |
| 2733 | VMReg rname_second = opr->as_register_hi()->as_VMReg(); |
| 2734 | |
| 2735 | if (hi_word_offset_in_bytes < lo_word_offset_in_bytes) { |
| 2736 | // lo/hi and swapped relative to first and second, so swap them |
| 2737 | VMReg tmp = rname_first; |
| 2738 | rname_first = rname_second; |
| 2739 | rname_second = tmp; |
| 2740 | } |
| 2741 | |
| 2742 | first = new LocationValue(Location::new_reg_loc(Location::normal, rname_first)); |
| 2743 | second = new LocationValue(Location::new_reg_loc(Location::normal, rname_second)); |
| 2744 | #endif //_LP64 |
| 2745 | |
| 2746 | |
| 2747 | #ifdef X86 |
| 2748 | } else if (opr->is_double_xmm()) { |
| 2749 | assert(opr->fpu_regnrLo() == opr->fpu_regnrHi(), "assumed in calculation")do { if (!(opr->fpu_regnrLo() == opr->fpu_regnrHi())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2749, "assert(" "opr->fpu_regnrLo() == opr->fpu_regnrHi()" ") failed", "assumed in calculation"); ::breakpoint(); } } while (0); |
| 2750 | VMReg rname_first = opr->as_xmm_double_reg()->as_VMReg(); |
| 2751 | # ifdef _LP641 |
| 2752 | first = new LocationValue(Location::new_reg_loc(Location::dbl, rname_first)); |
| 2753 | second = _int_0_scope_value; |
| 2754 | # else |
| 2755 | first = new LocationValue(Location::new_reg_loc(Location::normal, rname_first)); |
| 2756 | // %%% This is probably a waste but we'll keep things as they were for now |
| 2757 | if (true) { |
| 2758 | VMReg rname_second = rname_first->next(); |
| 2759 | second = new LocationValue(Location::new_reg_loc(Location::normal, rname_second)); |
| 2760 | } |
| 2761 | # endif |
| 2762 | #endif |
| 2763 | |
| 2764 | } else if (opr->is_double_fpu()) { |
| 2765 | // On SPARC, fpu_regnrLo/fpu_regnrHi represents the two halves of |
| 2766 | // the double as float registers in the native ordering. On X86, |
| 2767 | // fpu_regnrLo is a FPU stack slot whose VMReg represents |
| 2768 | // the low-order word of the double and fpu_regnrLo + 1 is the |
| 2769 | // name for the other half. *first and *second must represent the |
| 2770 | // least and most significant words, respectively. |
| 2771 | |
| 2772 | #ifdef IA32 |
| 2773 | // the exact location of fpu stack values is only known |
| 2774 | // during fpu stack allocation, so the stack allocator object |
| 2775 | // must be present |
| 2776 | assert(use_fpu_stack_allocation(), "should not have float stack values without fpu stack allocation (all floats must be SSE2)")do { if (!(use_fpu_stack_allocation())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2776, "assert(" "use_fpu_stack_allocation()" ") failed", "should not have float stack values without fpu stack allocation (all floats must be SSE2)" ); ::breakpoint(); } } while (0); |
| 2777 | assert(_fpu_stack_allocator != NULL, "must be present")do { if (!(_fpu_stack_allocator != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2777, "assert(" "_fpu_stack_allocator != __null" ") failed" , "must be present"); ::breakpoint(); } } while (0); |
| 2778 | opr = _fpu_stack_allocator->to_fpu_stack(opr); |
| 2779 | |
| 2780 | assert(opr->fpu_regnrLo() == opr->fpu_regnrHi(), "assumed in calculation (only fpu_regnrLo is used)")do { if (!(opr->fpu_regnrLo() == opr->fpu_regnrHi())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2780, "assert(" "opr->fpu_regnrLo() == opr->fpu_regnrHi()" ") failed", "assumed in calculation (only fpu_regnrLo is used)" ); ::breakpoint(); } } while (0); |
| 2781 | #endif |
| 2782 | #ifdef AMD641 |
| 2783 | assert(false, "FPU not used on x86-64")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2783, "assert(" "false" ") failed", "FPU not used on x86-64" ); ::breakpoint(); } } while (0); |
| 2784 | #endif |
| 2785 | #ifdef ARM32 |
| 2786 | assert(opr->fpu_regnrHi() == opr->fpu_regnrLo() + 1, "assumed in calculation (only fpu_regnrLo is used)")do { if (!(opr->fpu_regnrHi() == opr->fpu_regnrLo() + 1 )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2786, "assert(" "opr->fpu_regnrHi() == opr->fpu_regnrLo() + 1" ") failed", "assumed in calculation (only fpu_regnrLo is used)" ); ::breakpoint(); } } while (0); |
| 2787 | #endif |
| 2788 | |
| 2789 | #ifdef VM_LITTLE_ENDIAN1 |
| 2790 | VMReg rname_first = frame_map()->fpu_regname(opr->fpu_regnrLo()); |
| 2791 | #else |
| 2792 | VMReg rname_first = frame_map()->fpu_regname(opr->fpu_regnrHi()); |
| 2793 | #endif |
| 2794 | |
| 2795 | #ifdef _LP641 |
| 2796 | first = new LocationValue(Location::new_reg_loc(Location::dbl, rname_first)); |
| 2797 | second = _int_0_scope_value; |
| 2798 | #else |
| 2799 | first = new LocationValue(Location::new_reg_loc(Location::normal, rname_first)); |
| 2800 | // %%% This is probably a waste but we'll keep things as they were for now |
| 2801 | if (true) { |
| 2802 | VMReg rname_second = rname_first->next(); |
| 2803 | second = new LocationValue(Location::new_reg_loc(Location::normal, rname_second)); |
| 2804 | } |
| 2805 | #endif |
| 2806 | |
| 2807 | } else { |
| 2808 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2808); ::breakpoint(); } while (0); |
| 2809 | first = NULL__null; |
| 2810 | second = NULL__null; |
| 2811 | } |
| 2812 | |
| 2813 | assert(first != NULL && second != NULL, "must be set")do { if (!(first != __null && second != __null)) { (* g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2813, "assert(" "first != __null && second != __null" ") failed", "must be set"); ::breakpoint(); } } while (0); |
| 2814 | // The convention the interpreter uses is that the second local |
| 2815 | // holds the first raw word of the native double representation. |
| 2816 | // This is actually reasonable, since locals and stack arrays |
| 2817 | // grow downwards in all implementations. |
| 2818 | // (If, on some machine, the interpreter's Java locals or stack |
| 2819 | // were to grow upwards, the embedded doubles would be word-swapped.) |
| 2820 | scope_values->append(second); |
| 2821 | scope_values->append(first); |
| 2822 | return 2; |
| 2823 | } |
| 2824 | } |
| 2825 | |
| 2826 | |
| 2827 | int LinearScan::append_scope_value(int op_id, Value value, GrowableArray<ScopeValue*>* scope_values) { |
| 2828 | if (value != NULL__null) { |
| 2829 | LIR_Opr opr = value->operand(); |
| 2830 | Constant* con = value->as_Constant(); |
| 2831 | |
| 2832 | assert(con == NULL || opr->is_virtual() || opr->is_constant() || opr->is_illegal(), "asumption: Constant instructions have only constant operands (or illegal if constant is optimized away)")do { if (!(con == __null || opr->is_virtual() || opr->is_constant () || opr->is_illegal())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2832, "assert(" "con == __null || opr->is_virtual() || opr->is_constant() || opr->is_illegal()" ") failed", "asumption: Constant instructions have only constant operands (or illegal if constant is optimized away)" ); ::breakpoint(); } } while (0); |
| 2833 | assert(con != NULL || opr->is_virtual(), "asumption: non-Constant instructions have only virtual operands")do { if (!(con != __null || opr->is_virtual())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2833, "assert(" "con != __null || opr->is_virtual()" ") failed" , "asumption: non-Constant instructions have only virtual operands" ); ::breakpoint(); } } while (0); |
| 2834 | |
| 2835 | if (con != NULL__null && !con->is_pinned() && !opr->is_constant()) { |
| 2836 | // Unpinned constants may have a virtual operand for a part of the lifetime |
| 2837 | // or may be illegal when it was optimized away, |
| 2838 | // so always use a constant operand |
| 2839 | opr = LIR_OprFact::value_type(con->type()); |
| 2840 | } |
| 2841 | assert(opr->is_virtual() || opr->is_constant(), "other cases not allowed here")do { if (!(opr->is_virtual() || opr->is_constant())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2841, "assert(" "opr->is_virtual() || opr->is_constant()" ") failed", "other cases not allowed here"); ::breakpoint(); } } while (0); |
| 2842 | |
| 2843 | if (opr->is_virtual()) { |
| 2844 | LIR_OpVisitState::OprMode mode = LIR_OpVisitState::inputMode; |
| 2845 | |
| 2846 | BlockBegin* block = block_of_op_with_id(op_id); |
| 2847 | if (block->number_of_sux() == 1 && op_id == block->last_lir_instruction_id()) { |
| 2848 | // generating debug information for the last instruction of a block. |
| 2849 | // if this instruction is a branch, spill moves are inserted before this branch |
| 2850 | // and so the wrong operand would be returned (spill moves at block boundaries are not |
| 2851 | // considered in the live ranges of intervals) |
| 2852 | // Solution: use the first op_id of the branch target block instead. |
| 2853 | if (block->lir()->instructions_list()->last()->as_OpBranch() != NULL__null) { |
| 2854 | if (block->live_out().at(opr->vreg_number())) { |
| 2855 | op_id = block->sux_at(0)->first_lir_instruction_id(); |
| 2856 | mode = LIR_OpVisitState::outputMode; |
| 2857 | } |
| 2858 | } |
| 2859 | } |
| 2860 | |
| 2861 | // Get current location of operand |
| 2862 | // The operand must be live because debug information is considered when building the intervals |
| 2863 | // if the interval is not live, color_lir_opr will cause an assertion failure |
| 2864 | opr = color_lir_opr(opr, op_id, mode); |
| 2865 | assert(!has_call(op_id) || opr->is_stack() || !is_caller_save(reg_num(opr)), "can not have caller-save register operands at calls")do { if (!(!has_call(op_id) || opr->is_stack() || !is_caller_save (reg_num(opr)))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2865, "assert(" "!has_call(op_id) || opr->is_stack() || !is_caller_save(reg_num(opr))" ") failed", "can not have caller-save register operands at calls" ); ::breakpoint(); } } while (0); |
| 2866 | |
| 2867 | // Append to ScopeValue array |
| 2868 | return append_scope_value_for_operand(opr, scope_values); |
| 2869 | |
| 2870 | } else { |
| 2871 | assert(value->as_Constant() != NULL, "all other instructions have only virtual operands")do { if (!(value->as_Constant() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2871, "assert(" "value->as_Constant() != __null" ") failed" , "all other instructions have only virtual operands"); ::breakpoint (); } } while (0); |
| 2872 | assert(opr->is_constant(), "operand must be constant")do { if (!(opr->is_constant())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2872, "assert(" "opr->is_constant()" ") failed", "operand must be constant" ); ::breakpoint(); } } while (0); |
| 2873 | |
| 2874 | return append_scope_value_for_constant(opr, scope_values); |
| 2875 | } |
| 2876 | } else { |
| 2877 | // append a dummy value because real value not needed |
| 2878 | scope_values->append(_illegal_value); |
| 2879 | return 1; |
| 2880 | } |
| 2881 | } |
| 2882 | |
| 2883 | |
| 2884 | IRScopeDebugInfo* LinearScan::compute_debug_info_for_scope(int op_id, IRScope* cur_scope, ValueStack* cur_state, ValueStack* innermost_state) { |
| 2885 | IRScopeDebugInfo* caller_debug_info = NULL__null; |
| 2886 | |
| 2887 | ValueStack* caller_state = cur_state->caller_state(); |
| 2888 | if (caller_state != NULL__null) { |
| 2889 | // process recursively to compute outermost scope first |
| 2890 | caller_debug_info = compute_debug_info_for_scope(op_id, cur_scope->caller(), caller_state, innermost_state); |
| 2891 | } |
| 2892 | |
| 2893 | // initialize these to null. |
| 2894 | // If we don't need deopt info or there are no locals, expressions or monitors, |
| 2895 | // then these get recorded as no information and avoids the allocation of 0 length arrays. |
| 2896 | GrowableArray<ScopeValue*>* locals = NULL__null; |
| 2897 | GrowableArray<ScopeValue*>* expressions = NULL__null; |
| 2898 | GrowableArray<MonitorValue*>* monitors = NULL__null; |
| 2899 | |
| 2900 | // describe local variable values |
| 2901 | int nof_locals = cur_state->locals_size(); |
| 2902 | if (nof_locals > 0) { |
| 2903 | locals = new GrowableArray<ScopeValue*>(nof_locals); |
| 2904 | |
| 2905 | int pos = 0; |
| 2906 | while (pos < nof_locals) { |
| 2907 | assert(pos < cur_state->locals_size(), "why not?")do { if (!(pos < cur_state->locals_size())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2907, "assert(" "pos < cur_state->locals_size()" ") failed" , "why not?"); ::breakpoint(); } } while (0); |
| 2908 | |
| 2909 | Value local = cur_state->local_at(pos); |
| 2910 | pos += append_scope_value(op_id, local, locals); |
| 2911 | |
| 2912 | assert(locals->length() == pos, "must match")do { if (!(locals->length() == pos)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2912, "assert(" "locals->length() == pos" ") failed", "must match" ); ::breakpoint(); } } while (0); |
| 2913 | } |
| 2914 | assert(locals->length() == cur_scope->method()->max_locals(), "wrong number of locals")do { if (!(locals->length() == cur_scope->method()-> max_locals())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2914, "assert(" "locals->length() == cur_scope->method()->max_locals()" ") failed", "wrong number of locals"); ::breakpoint(); } } while (0); |
| 2915 | assert(locals->length() == cur_state->locals_size(), "wrong number of locals")do { if (!(locals->length() == cur_state->locals_size() )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2915, "assert(" "locals->length() == cur_state->locals_size()" ") failed", "wrong number of locals"); ::breakpoint(); } } while (0); |
| 2916 | } else if (cur_scope->method()->max_locals() > 0) { |
| 2917 | assert(cur_state->kind() == ValueStack::EmptyExceptionState, "should be")do { if (!(cur_state->kind() == ValueStack::EmptyExceptionState )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2917, "assert(" "cur_state->kind() == ValueStack::EmptyExceptionState" ") failed", "should be"); ::breakpoint(); } } while (0); |
| 2918 | nof_locals = cur_scope->method()->max_locals(); |
| 2919 | locals = new GrowableArray<ScopeValue*>(nof_locals); |
| 2920 | for(int i = 0; i < nof_locals; i++) { |
| 2921 | locals->append(_illegal_value); |
| 2922 | } |
| 2923 | } |
| 2924 | |
| 2925 | // describe expression stack |
| 2926 | int nof_stack = cur_state->stack_size(); |
| 2927 | if (nof_stack > 0) { |
| 2928 | expressions = new GrowableArray<ScopeValue*>(nof_stack); |
| 2929 | |
| 2930 | int pos = 0; |
| 2931 | while (pos < nof_stack) { |
| 2932 | Value expression = cur_state->stack_at_inc(pos); |
| 2933 | append_scope_value(op_id, expression, expressions); |
| 2934 | |
| 2935 | assert(expressions->length() == pos, "must match")do { if (!(expressions->length() == pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2935, "assert(" "expressions->length() == pos" ") failed" , "must match"); ::breakpoint(); } } while (0); |
| 2936 | } |
| 2937 | assert(expressions->length() == cur_state->stack_size(), "wrong number of stack entries")do { if (!(expressions->length() == cur_state->stack_size ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2937, "assert(" "expressions->length() == cur_state->stack_size()" ") failed", "wrong number of stack entries"); ::breakpoint() ; } } while (0); |
| 2938 | } |
| 2939 | |
| 2940 | // describe monitors |
| 2941 | int nof_locks = cur_state->locks_size(); |
| 2942 | if (nof_locks > 0) { |
| 2943 | int lock_offset = cur_state->caller_state() != NULL__null ? cur_state->caller_state()->total_locks_size() : 0; |
| 2944 | monitors = new GrowableArray<MonitorValue*>(nof_locks); |
| 2945 | for (int i = 0; i < nof_locks; i++) { |
| 2946 | monitors->append(location_for_monitor_index(lock_offset + i)); |
| 2947 | } |
| 2948 | } |
| 2949 | |
| 2950 | return new IRScopeDebugInfo(cur_scope, cur_state->bci(), locals, expressions, monitors, caller_debug_info); |
| 2951 | } |
| 2952 | |
| 2953 | |
| 2954 | void LinearScan::compute_debug_info(CodeEmitInfo* info, int op_id) { |
| 2955 | TRACE_LINEAR_SCAN(3, tty->print_cr("creating debug information at op_id %d", op_id))if (TraceLinearScanLevel >= 3) { tty->print_cr("creating debug information at op_id %d" , op_id); }; |
| 2956 | |
| 2957 | IRScope* innermost_scope = info->scope(); |
| 2958 | ValueStack* innermost_state = info->stack(); |
| 2959 | |
| 2960 | assert(innermost_scope != NULL && innermost_state != NULL, "why is it missing?")do { if (!(innermost_scope != __null && innermost_state != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 2960, "assert(" "innermost_scope != __null && innermost_state != __null" ") failed", "why is it missing?"); ::breakpoint(); } } while (0); |
| 2961 | |
| 2962 | DEBUG_ONLY(check_stack_depth(info, innermost_state->stack_size()))check_stack_depth(info, innermost_state->stack_size()); |
| 2963 | |
| 2964 | if (info->_scope_debug_info == NULL__null) { |
| 2965 | // compute debug information |
| 2966 | info->_scope_debug_info = compute_debug_info_for_scope(op_id, innermost_scope, innermost_state, innermost_state); |
| 2967 | } else { |
| 2968 | // debug information already set. Check that it is correct from the current point of view |
| 2969 | DEBUG_ONLY(assert_equal(info->_scope_debug_info, compute_debug_info_for_scope(op_id, innermost_scope, innermost_state, innermost_state)))assert_equal(info->_scope_debug_info, compute_debug_info_for_scope (op_id, innermost_scope, innermost_state, innermost_state)); |
| 2970 | } |
| 2971 | } |
| 2972 | |
| 2973 | |
| 2974 | void LinearScan::assign_reg_num(LIR_OpList* instructions, IntervalWalker* iw) { |
| 2975 | LIR_OpVisitState visitor; |
| 2976 | int num_inst = instructions->length(); |
| 2977 | bool has_dead = false; |
| 2978 | |
| 2979 | for (int j = 0; j < num_inst; j++) { |
| 2980 | LIR_Op* op = instructions->at(j); |
| 2981 | if (op == NULL__null) { // this can happen when spill-moves are removed in eliminate_spill_moves |
| 2982 | has_dead = true; |
| 2983 | continue; |
| 2984 | } |
| 2985 | int op_id = op->id(); |
| 2986 | |
| 2987 | // visit instruction to get list of operands |
| 2988 | visitor.visit(op); |
| 2989 | |
| 2990 | // iterate all modes of the visitor and process all virtual operands |
| 2991 | for_each_visitor_mode(mode)for (LIR_OpVisitState::OprMode mode = LIR_OpVisitState::firstMode ; mode < LIR_OpVisitState::numModes; mode = (LIR_OpVisitState ::OprMode)(mode + 1)) { |
| 2992 | int n = visitor.opr_count(mode); |
| 2993 | for (int k = 0; k < n; k++) { |
| 2994 | LIR_Opr opr = visitor.opr_at(mode, k); |
| 2995 | if (opr->is_virtual_register()) { |
| 2996 | visitor.set_opr_at(mode, k, color_lir_opr(opr, op_id, mode)); |
| 2997 | } |
| 2998 | } |
| 2999 | } |
| 3000 | |
| 3001 | if (visitor.info_count() > 0) { |
| 3002 | // exception handling |
| 3003 | if (compilation()->has_exception_handlers()) { |
| 3004 | XHandlers* xhandlers = visitor.all_xhandler(); |
| 3005 | int n = xhandlers->length(); |
| 3006 | for (int k = 0; k < n; k++) { |
| 3007 | XHandler* handler = xhandlers->handler_at(k); |
| 3008 | if (handler->entry_code() != NULL__null) { |
| 3009 | assign_reg_num(handler->entry_code()->instructions_list(), NULL__null); |
| 3010 | } |
| 3011 | } |
| 3012 | } else { |
| 3013 | assert(visitor.all_xhandler()->length() == 0, "missed exception handler")do { if (!(visitor.all_xhandler()->length() == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3013, "assert(" "visitor.all_xhandler()->length() == 0" ") failed" , "missed exception handler"); ::breakpoint(); } } while (0); |
| 3014 | } |
| 3015 | |
| 3016 | // compute oop map |
| 3017 | assert(iw != NULL, "needed for compute_oop_map")do { if (!(iw != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3017, "assert(" "iw != __null" ") failed", "needed for compute_oop_map" ); ::breakpoint(); } } while (0); |
| 3018 | compute_oop_map(iw, visitor, op); |
| 3019 | |
| 3020 | // compute debug information |
| 3021 | if (!use_fpu_stack_allocation()) { |
| 3022 | // compute debug information if fpu stack allocation is not needed. |
| 3023 | // when fpu stack allocation is needed, the debug information can not |
| 3024 | // be computed here because the exact location of fpu operands is not known |
| 3025 | // -> debug information is created inside the fpu stack allocator |
| 3026 | int n = visitor.info_count(); |
| 3027 | for (int k = 0; k < n; k++) { |
| 3028 | compute_debug_info(visitor.info_at(k), op_id); |
| 3029 | } |
| 3030 | } |
| 3031 | } |
| 3032 | |
| 3033 | #ifdef ASSERT1 |
| 3034 | // make sure we haven't made the op invalid. |
| 3035 | op->verify(); |
| 3036 | #endif |
| 3037 | |
| 3038 | // remove useless moves |
| 3039 | if (op->code() == lir_move) { |
| 3040 | assert(op->as_Op1() != NULL, "move must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3040, "assert(" "op->as_Op1() != __null" ") failed", "move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 3041 | LIR_Op1* move = (LIR_Op1*)op; |
| 3042 | LIR_Opr src = move->in_opr(); |
| 3043 | LIR_Opr dst = move->result_opr(); |
| 3044 | if (dst == src || |
| 3045 | (!dst->is_pointer() && !src->is_pointer() && |
| 3046 | src->is_same_register(dst))) { |
| 3047 | instructions->at_put(j, NULL__null); |
| 3048 | has_dead = true; |
| 3049 | } |
| 3050 | } |
| 3051 | } |
| 3052 | |
| 3053 | if (has_dead) { |
| 3054 | // iterate all instructions of the block and remove all null-values. |
| 3055 | int insert_point = 0; |
| 3056 | for (int j = 0; j < num_inst; j++) { |
| 3057 | LIR_Op* op = instructions->at(j); |
| 3058 | if (op != NULL__null) { |
| 3059 | if (insert_point != j) { |
| 3060 | instructions->at_put(insert_point, op); |
| 3061 | } |
| 3062 | insert_point++; |
| 3063 | } |
| 3064 | } |
| 3065 | instructions->trunc_to(insert_point); |
| 3066 | } |
| 3067 | } |
| 3068 | |
| 3069 | void LinearScan::assign_reg_num() { |
| 3070 | TIME_LINEAR_SCAN(timer_assign_reg_num)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_assign_reg_num), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 3071 | |
| 3072 | init_compute_debug_info(); |
| 3073 | IntervalWalker* iw = init_compute_oop_maps(); |
| 3074 | |
| 3075 | int num_blocks = block_count(); |
| 3076 | for (int i = 0; i < num_blocks; i++) { |
| 3077 | BlockBegin* block = block_at(i); |
| 3078 | assign_reg_num(block->lir()->instructions_list(), iw); |
| 3079 | } |
| 3080 | } |
| 3081 | |
| 3082 | |
| 3083 | void LinearScan::do_linear_scan() { |
| 3084 | NOT_PRODUCT(_total_timer.begin_method())_total_timer.begin_method(); |
| 3085 | |
| 3086 | number_instructions(); |
| 3087 | |
| 3088 | NOT_PRODUCT(print_lir(1, "Before Register Allocation"))print_lir(1, "Before Register Allocation"); |
| 3089 | |
| 3090 | compute_local_live_sets(); |
| 3091 | compute_global_live_sets(); |
| 3092 | CHECK_BAILOUT(){ if (bailed_out()) return; }; |
| 3093 | |
| 3094 | build_intervals(); |
| 3095 | CHECK_BAILOUT(){ if (bailed_out()) return; }; |
| 3096 | sort_intervals_before_allocation(); |
| 3097 | |
| 3098 | NOT_PRODUCT(print_intervals("Before Register Allocation"))print_intervals("Before Register Allocation"); |
| 3099 | NOT_PRODUCT(LinearScanStatistic::compute(this, _stat_before_alloc))LinearScanStatistic::compute(this, _stat_before_alloc); |
| 3100 | |
| 3101 | allocate_registers(); |
| 3102 | CHECK_BAILOUT(){ if (bailed_out()) return; }; |
| 3103 | |
| 3104 | resolve_data_flow(); |
| 3105 | if (compilation()->has_exception_handlers()) { |
| 3106 | resolve_exception_handlers(); |
| 3107 | } |
| 3108 | // fill in number of spill slots into frame_map |
| 3109 | propagate_spill_slots(); |
| 3110 | CHECK_BAILOUT(){ if (bailed_out()) return; }; |
| 3111 | |
| 3112 | NOT_PRODUCT(print_intervals("After Register Allocation"))print_intervals("After Register Allocation"); |
| 3113 | NOT_PRODUCT(print_lir(2, "LIR after register allocation:"))print_lir(2, "LIR after register allocation:"); |
| 3114 | |
| 3115 | sort_intervals_after_allocation(); |
| 3116 | |
| 3117 | DEBUG_ONLY(verify())verify(); |
| 3118 | |
| 3119 | eliminate_spill_moves(); |
| 3120 | assign_reg_num(); |
| 3121 | CHECK_BAILOUT(){ if (bailed_out()) return; }; |
| 3122 | |
| 3123 | NOT_PRODUCT(print_lir(2, "LIR after assignment of register numbers:"))print_lir(2, "LIR after assignment of register numbers:"); |
| 3124 | NOT_PRODUCT(LinearScanStatistic::compute(this, _stat_after_asign))LinearScanStatistic::compute(this, _stat_after_asign); |
| 3125 | |
| 3126 | { TIME_LINEAR_SCAN(timer_allocate_fpu_stack)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_allocate_fpu_stack), TimeLinearScan || TimeEachLinearScan , Verbose);; |
| 3127 | |
| 3128 | if (use_fpu_stack_allocation()) { |
| 3129 | allocate_fpu_stack(); // Only has effect on Intel |
| 3130 | NOT_PRODUCT(print_lir(2, "LIR after FPU stack allocation:"))print_lir(2, "LIR after FPU stack allocation:"); |
| 3131 | } |
| 3132 | } |
| 3133 | |
| 3134 | { TIME_LINEAR_SCAN(timer_optimize_lir)TraceTime _block_timer("", _total_timer.timer(LinearScanTimers ::timer_optimize_lir), TimeLinearScan || TimeEachLinearScan, Verbose );; |
| 3135 | |
| 3136 | EdgeMoveOptimizer::optimize(ir()->code()); |
| 3137 | ControlFlowOptimizer::optimize(ir()->code()); |
| 3138 | // check that cfg is still correct after optimizations |
| 3139 | ir()->verify(); |
| 3140 | } |
| 3141 | |
| 3142 | NOT_PRODUCT(print_lir(1, "Before Code Generation", false))print_lir(1, "Before Code Generation", false); |
| 3143 | NOT_PRODUCT(LinearScanStatistic::compute(this, _stat_final))LinearScanStatistic::compute(this, _stat_final); |
| 3144 | NOT_PRODUCT(_total_timer.end_method(this))_total_timer.end_method(this); |
| 3145 | } |
| 3146 | |
| 3147 | |
| 3148 | // ********** Printing functions |
| 3149 | |
| 3150 | #ifndef PRODUCT |
| 3151 | |
| 3152 | void LinearScan::print_timers(double total) { |
| 3153 | _total_timer.print(total); |
| 3154 | } |
| 3155 | |
| 3156 | void LinearScan::print_statistics() { |
| 3157 | _stat_before_alloc.print("before allocation"); |
| 3158 | _stat_after_asign.print("after assignment of register"); |
| 3159 | _stat_final.print("after optimization"); |
| 3160 | } |
| 3161 | |
| 3162 | void LinearScan::print_bitmap(BitMap& b) { |
| 3163 | for (unsigned int i = 0; i < b.size(); i++) { |
| 3164 | if (b.at(i)) tty->print("%d ", i); |
| 3165 | } |
| 3166 | tty->cr(); |
| 3167 | } |
| 3168 | |
| 3169 | void LinearScan::print_intervals(const char* label) { |
| 3170 | if (TraceLinearScanLevel >= 1) { |
| 3171 | int i; |
| 3172 | tty->cr(); |
| 3173 | tty->print_cr("%s", label); |
| 3174 | |
| 3175 | for (i = 0; i < interval_count(); i++) { |
| 3176 | Interval* interval = interval_at(i); |
| 3177 | if (interval != NULL__null) { |
| 3178 | interval->print(); |
| 3179 | } |
| 3180 | } |
| 3181 | |
| 3182 | tty->cr(); |
| 3183 | tty->print_cr("--- Basic Blocks ---"); |
| 3184 | for (i = 0; i < block_count(); i++) { |
| 3185 | BlockBegin* block = block_at(i); |
| 3186 | tty->print("B%d [%d, %d, %d, %d] ", block->block_id(), block->first_lir_instruction_id(), block->last_lir_instruction_id(), block->loop_index(), block->loop_depth()); |
| 3187 | } |
| 3188 | tty->cr(); |
| 3189 | tty->cr(); |
| 3190 | } |
| 3191 | |
| 3192 | if (PrintCFGToFile) { |
| 3193 | CFGPrinter::print_intervals(&_intervals, label); |
| 3194 | } |
| 3195 | } |
| 3196 | |
| 3197 | void LinearScan::print_lir(int level, const char* label, bool hir_valid) { |
| 3198 | if (TraceLinearScanLevel >= level) { |
| 3199 | tty->cr(); |
| 3200 | tty->print_cr("%s", label); |
| 3201 | print_LIR(ir()->linear_scan_order()); |
| 3202 | tty->cr(); |
| 3203 | } |
| 3204 | |
| 3205 | if (level == 1 && PrintCFGToFile) { |
| 3206 | CFGPrinter::print_cfg(ir()->linear_scan_order(), label, hir_valid, true); |
| 3207 | } |
| 3208 | } |
| 3209 | |
| 3210 | void LinearScan::print_reg_num(outputStream* out, int reg_num) { |
| 3211 | if (reg_num == -1) { |
| 3212 | out->print("[ANY]"); |
| 3213 | return; |
| 3214 | } else if (reg_num >= LIR_Opr::vreg_base) { |
| 3215 | out->print("[VREG %d]", reg_num); |
| 3216 | return; |
| 3217 | } |
| 3218 | |
| 3219 | LIR_Opr opr = get_operand(reg_num); |
| 3220 | assert(opr->is_valid(), "unknown register")do { if (!(opr->is_valid())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3220, "assert(" "opr->is_valid()" ") failed", "unknown register" ); ::breakpoint(); } } while (0); |
| 3221 | opr->print(out); |
| 3222 | } |
| 3223 | |
| 3224 | LIR_Opr LinearScan::get_operand(int reg_num) { |
| 3225 | LIR_Opr opr = LIR_OprFact::illegal(); |
| 3226 | |
| 3227 | #ifdef X86 |
| 3228 | int last_xmm_reg = pd_last_xmm_reg; |
| 3229 | #ifdef _LP641 |
| 3230 | if (UseAVX < 3) { |
| 3231 | last_xmm_reg = pd_first_xmm_reg + (pd_nof_xmm_regs_frame_map / 2) - 1; |
| 3232 | } |
| 3233 | #endif |
| 3234 | #endif |
| 3235 | if (reg_num >= pd_first_cpu_reg && reg_num <= pd_last_cpu_reg) { |
| 3236 | opr = LIR_OprFact::single_cpu(reg_num); |
| 3237 | } else if (reg_num >= pd_first_fpu_reg && reg_num <= pd_last_fpu_reg) { |
| 3238 | opr = LIR_OprFact::single_fpu(reg_num - pd_first_fpu_reg); |
| 3239 | #ifdef X86 |
| 3240 | } else if (reg_num >= pd_first_xmm_reg && reg_num <= last_xmm_reg) { |
| 3241 | opr = LIR_OprFact::single_xmm(reg_num - pd_first_xmm_reg); |
| 3242 | #endif |
| 3243 | } else { |
| 3244 | // reg_num == -1 or a virtual register, return the illegal operand |
| 3245 | } |
| 3246 | return opr; |
| 3247 | } |
| 3248 | |
| 3249 | Interval* LinearScan::find_interval_at(int reg_num) const { |
| 3250 | if (reg_num < 0 || reg_num >= _intervals.length()) { |
| 3251 | return NULL__null; |
| 3252 | } |
| 3253 | return interval_at(reg_num); |
| 3254 | } |
| 3255 | |
| 3256 | #endif // PRODUCT |
| 3257 | |
| 3258 | |
| 3259 | // ********** verification functions for allocation |
| 3260 | // (check that all intervals have a correct register and that no registers are overwritten) |
| 3261 | #ifdef ASSERT1 |
| 3262 | |
| 3263 | void LinearScan::verify() { |
| 3264 | TRACE_LINEAR_SCAN(2, tty->print_cr("********* verifying intervals ******************************************"))if (TraceLinearScanLevel >= 2) { tty->print_cr("********* verifying intervals ******************************************" ); }; |
| 3265 | verify_intervals(); |
| 3266 | |
| 3267 | TRACE_LINEAR_SCAN(2, tty->print_cr("********* verifying that no oops are in fixed intervals ****************"))if (TraceLinearScanLevel >= 2) { tty->print_cr("********* verifying that no oops are in fixed intervals ****************" ); }; |
| 3268 | verify_no_oops_in_fixed_intervals(); |
| 3269 | |
| 3270 | TRACE_LINEAR_SCAN(2, tty->print_cr("********* verifying that unpinned constants are not alive across block boundaries"))if (TraceLinearScanLevel >= 2) { tty->print_cr("********* verifying that unpinned constants are not alive across block boundaries" ); }; |
| 3271 | verify_constants(); |
| 3272 | |
| 3273 | TRACE_LINEAR_SCAN(2, tty->print_cr("********* verifying register allocation ********************************"))if (TraceLinearScanLevel >= 2) { tty->print_cr("********* verifying register allocation ********************************" ); }; |
| 3274 | verify_registers(); |
| 3275 | |
| 3276 | TRACE_LINEAR_SCAN(2, tty->print_cr("********* no errors found **********************************************"))if (TraceLinearScanLevel >= 2) { tty->print_cr("********* no errors found **********************************************" ); }; |
| 3277 | } |
| 3278 | |
| 3279 | void LinearScan::verify_intervals() { |
| 3280 | int len = interval_count(); |
| 3281 | bool has_error = false; |
| 3282 | |
| 3283 | for (int i = 0; i < len; i++) { |
| 3284 | Interval* i1 = interval_at(i); |
| 3285 | if (i1 == NULL__null) continue; |
| 3286 | |
| 3287 | i1->check_split_children(); |
| 3288 | |
| 3289 | if (i1->reg_num() != i) { |
| 3290 | tty->print_cr("Interval %d is on position %d in list", i1->reg_num(), i); i1->print(); tty->cr(); |
| 3291 | has_error = true; |
| 3292 | } |
| 3293 | |
| 3294 | if (i1->reg_num() >= LIR_Opr::vreg_base && i1->type() == T_ILLEGAL) { |
| 3295 | tty->print_cr("Interval %d has no type assigned", i1->reg_num()); i1->print(); tty->cr(); |
| 3296 | has_error = true; |
| 3297 | } |
| 3298 | |
| 3299 | if (i1->assigned_reg() == any_reg) { |
| 3300 | tty->print_cr("Interval %d has no register assigned", i1->reg_num()); i1->print(); tty->cr(); |
| 3301 | has_error = true; |
| 3302 | } |
| 3303 | |
| 3304 | if (i1->assigned_reg() == i1->assigned_regHi()) { |
| 3305 | tty->print_cr("Interval %d: low and high register equal", i1->reg_num()); i1->print(); tty->cr(); |
| 3306 | has_error = true; |
| 3307 | } |
| 3308 | |
| 3309 | if (!is_processed_reg_num(i1->assigned_reg())) { |
| 3310 | tty->print_cr("Can not have an Interval for an ignored register"); i1->print(); tty->cr(); |
| 3311 | has_error = true; |
| 3312 | } |
| 3313 | |
| 3314 | // special intervals that are created in MoveResolver |
| 3315 | // -> ignore them because the range information has no meaning there |
| 3316 | if (i1->from() == 1 && i1->to() == 2) continue; |
| 3317 | |
| 3318 | if (i1->first() == Range::end()) { |
| 3319 | tty->print_cr("Interval %d has no Range", i1->reg_num()); i1->print(); tty->cr(); |
| 3320 | has_error = true; |
| 3321 | } |
| 3322 | |
| 3323 | for (Range* r = i1->first(); r != Range::end(); r = r->next()) { |
| 3324 | if (r->from() >= r->to()) { |
| 3325 | tty->print_cr("Interval %d has zero length range", i1->reg_num()); i1->print(); tty->cr(); |
| 3326 | has_error = true; |
| 3327 | } |
| 3328 | } |
| 3329 | |
| 3330 | for (int j = i + 1; j < len; j++) { |
| 3331 | Interval* i2 = interval_at(j); |
| 3332 | if (i2 == NULL__null || (i2->from() == 1 && i2->to() == 2)) continue; |
| 3333 | |
| 3334 | int r1 = i1->assigned_reg(); |
| 3335 | int r1Hi = i1->assigned_regHi(); |
| 3336 | int r2 = i2->assigned_reg(); |
| 3337 | int r2Hi = i2->assigned_regHi(); |
| 3338 | if ((r1 == r2 || r1 == r2Hi || (r1Hi != any_reg && (r1Hi == r2 || r1Hi == r2Hi))) && i1->intersects(i2)) { |
| 3339 | tty->print_cr("Intervals %d and %d overlap and have the same register assigned", i1->reg_num(), i2->reg_num()); |
| 3340 | i1->print(); tty->cr(); |
| 3341 | i2->print(); tty->cr(); |
| 3342 | has_error = true; |
| 3343 | } |
| 3344 | } |
| 3345 | } |
| 3346 | |
| 3347 | assert(has_error == false, "register allocation invalid")do { if (!(has_error == false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3347, "assert(" "has_error == false" ") failed", "register allocation invalid" ); ::breakpoint(); } } while (0); |
| 3348 | } |
| 3349 | |
| 3350 | |
| 3351 | void LinearScan::verify_no_oops_in_fixed_intervals() { |
| 3352 | Interval* fixed_intervals; |
| 3353 | Interval* other_intervals; |
| 3354 | create_unhandled_lists(&fixed_intervals, &other_intervals, is_precolored_cpu_interval, NULL__null); |
| 3355 | |
| 3356 | // to ensure a walking until the last instruction id, add a dummy interval |
| 3357 | // with a high operation id |
| 3358 | other_intervals = new Interval(any_reg); |
| 3359 | other_intervals->add_range(max_jint - 2, max_jint - 1); |
| 3360 | IntervalWalker* iw = new IntervalWalker(this, fixed_intervals, other_intervals); |
| 3361 | |
| 3362 | LIR_OpVisitState visitor; |
| 3363 | for (int i = 0; i < block_count(); i++) { |
| 3364 | BlockBegin* block = block_at(i); |
| 3365 | |
| 3366 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 3367 | |
| 3368 | for (int j = 0; j < instructions->length(); j++) { |
| 3369 | LIR_Op* op = instructions->at(j); |
| 3370 | int op_id = op->id(); |
| 3371 | |
| 3372 | visitor.visit(op); |
| 3373 | |
| 3374 | if (visitor.info_count() > 0) { |
| 3375 | iw->walk_before(op->id()); |
| 3376 | bool check_live = true; |
| 3377 | if (op->code() == lir_move) { |
| 3378 | LIR_Op1* move = (LIR_Op1*)op; |
| 3379 | check_live = (move->patch_code() == lir_patch_none); |
| 3380 | } |
| 3381 | LIR_OpBranch* branch = op->as_OpBranch(); |
| 3382 | if (branch != NULL__null && branch->stub() != NULL__null && branch->stub()->is_exception_throw_stub()) { |
| 3383 | // Don't bother checking the stub in this case since the |
| 3384 | // exception stub will never return to normal control flow. |
| 3385 | check_live = false; |
| 3386 | } |
| 3387 | |
| 3388 | // Make sure none of the fixed registers is live across an |
| 3389 | // oopmap since we can't handle that correctly. |
| 3390 | if (check_live) { |
| 3391 | for (Interval* interval = iw->active_first(fixedKind); |
| 3392 | interval != Interval::end(); |
| 3393 | interval = interval->next()) { |
| 3394 | if (interval->current_to() > op->id() + 1) { |
| 3395 | // This interval is live out of this op so make sure |
| 3396 | // that this interval represents some value that's |
| 3397 | // referenced by this op either as an input or output. |
| 3398 | bool ok = false; |
| 3399 | for_each_visitor_mode(mode)for (LIR_OpVisitState::OprMode mode = LIR_OpVisitState::firstMode ; mode < LIR_OpVisitState::numModes; mode = (LIR_OpVisitState ::OprMode)(mode + 1)) { |
| 3400 | int n = visitor.opr_count(mode); |
| 3401 | for (int k = 0; k < n; k++) { |
| 3402 | LIR_Opr opr = visitor.opr_at(mode, k); |
| 3403 | if (opr->is_fixed_cpu()) { |
| 3404 | if (interval_at(reg_num(opr)) == interval) { |
| 3405 | ok = true; |
| 3406 | break; |
| 3407 | } |
| 3408 | int hi = reg_numHi(opr); |
| 3409 | if (hi != -1 && interval_at(hi) == interval) { |
| 3410 | ok = true; |
| 3411 | break; |
| 3412 | } |
| 3413 | } |
| 3414 | } |
| 3415 | } |
| 3416 | assert(ok, "fixed intervals should never be live across an oopmap point")do { if (!(ok)) { (*g_assert_poison) = 'X';; report_vm_error( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3416, "assert(" "ok" ") failed", "fixed intervals should never be live across an oopmap point" ); ::breakpoint(); } } while (0); |
| 3417 | } |
| 3418 | } |
| 3419 | } |
| 3420 | } |
| 3421 | |
| 3422 | // oop-maps at calls do not contain registers, so check is not needed |
| 3423 | if (!visitor.has_call()) { |
| 3424 | |
| 3425 | for_each_visitor_mode(mode)for (LIR_OpVisitState::OprMode mode = LIR_OpVisitState::firstMode ; mode < LIR_OpVisitState::numModes; mode = (LIR_OpVisitState ::OprMode)(mode + 1)) { |
| 3426 | int n = visitor.opr_count(mode); |
| 3427 | for (int k = 0; k < n; k++) { |
| 3428 | LIR_Opr opr = visitor.opr_at(mode, k); |
| 3429 | |
| 3430 | if (opr->is_fixed_cpu() && opr->is_oop()) { |
| 3431 | // operand is a non-virtual cpu register and contains an oop |
| 3432 | TRACE_LINEAR_SCAN(4, op->print_on(tty); tty->print("checking operand "); opr->print(); tty->cr())if (TraceLinearScanLevel >= 4) { op->print_on(tty); tty ->print("checking operand "); opr->print(); tty->cr( ); }; |
| 3433 | |
| 3434 | Interval* interval = interval_at(reg_num(opr)); |
| 3435 | assert(interval != NULL, "no interval")do { if (!(interval != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3435, "assert(" "interval != __null" ") failed", "no interval" ); ::breakpoint(); } } while (0); |
| 3436 | |
| 3437 | if (mode == LIR_OpVisitState::inputMode) { |
| 3438 | if (interval->to() >= op_id + 1) { |
| 3439 | assert(interval->to() < op_id + 2 ||do { if (!(interval->to() < op_id + 2 || interval->has_hole_between (op_id, op_id + 2))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3441, "assert(" "interval->to() < op_id + 2 || interval->has_hole_between(op_id, op_id + 2)" ") failed", "oop input operand live after instruction"); ::breakpoint (); } } while (0) |
| 3440 | interval->has_hole_between(op_id, op_id + 2),do { if (!(interval->to() < op_id + 2 || interval->has_hole_between (op_id, op_id + 2))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3441, "assert(" "interval->to() < op_id + 2 || interval->has_hole_between(op_id, op_id + 2)" ") failed", "oop input operand live after instruction"); ::breakpoint (); } } while (0) |
| 3441 | "oop input operand live after instruction")do { if (!(interval->to() < op_id + 2 || interval->has_hole_between (op_id, op_id + 2))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3441, "assert(" "interval->to() < op_id + 2 || interval->has_hole_between(op_id, op_id + 2)" ") failed", "oop input operand live after instruction"); ::breakpoint (); } } while (0); |
| 3442 | } |
| 3443 | } else if (mode == LIR_OpVisitState::outputMode) { |
| 3444 | if (interval->from() <= op_id - 1) { |
| 3445 | assert(interval->has_hole_between(op_id - 1, op_id),do { if (!(interval->has_hole_between(op_id - 1, op_id))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3446, "assert(" "interval->has_hole_between(op_id - 1, op_id)" ") failed", "oop input operand live after instruction"); ::breakpoint (); } } while (0) |
| 3446 | "oop input operand live after instruction")do { if (!(interval->has_hole_between(op_id - 1, op_id))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3446, "assert(" "interval->has_hole_between(op_id - 1, op_id)" ") failed", "oop input operand live after instruction"); ::breakpoint (); } } while (0); |
| 3447 | } |
| 3448 | } |
| 3449 | } |
| 3450 | } |
| 3451 | } |
| 3452 | } |
| 3453 | } |
| 3454 | } |
| 3455 | } |
| 3456 | |
| 3457 | |
| 3458 | void LinearScan::verify_constants() { |
| 3459 | int num_regs = num_virtual_regs(); |
Value stored to 'num_regs' during its initialization is never read | |
| 3460 | int size = live_set_size(); |
| 3461 | int num_blocks = block_count(); |
| 3462 | |
| 3463 | for (int i = 0; i < num_blocks; i++) { |
| 3464 | BlockBegin* block = block_at(i); |
| 3465 | ResourceBitMap live_at_edge = block->live_in(); |
| 3466 | |
| 3467 | // visit all registers where the live_at_edge bit is set |
| 3468 | for (int r = (int)live_at_edge.get_next_one_offset(0, size); r < size; r = (int)live_at_edge.get_next_one_offset(r + 1, size)) { |
| 3469 | TRACE_LINEAR_SCAN(4, tty->print("checking interval %d of block B%d", r, block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print("checking interval %d of block B%d" , r, block->block_id()); }; |
| 3470 | |
| 3471 | Value value = gen()->instruction_for_vreg(r); |
| 3472 | |
| 3473 | assert(value != NULL, "all intervals live across block boundaries must have Value")do { if (!(value != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3473, "assert(" "value != __null" ") failed", "all intervals live across block boundaries must have Value" ); ::breakpoint(); } } while (0); |
| 3474 | assert(value->operand()->is_register() && value->operand()->is_virtual(), "value must have virtual operand")do { if (!(value->operand()->is_register() && value ->operand()->is_virtual())) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3474, "assert(" "value->operand()->is_register() && value->operand()->is_virtual()" ") failed", "value must have virtual operand"); ::breakpoint (); } } while (0); |
| 3475 | assert(value->operand()->vreg_number() == r, "register number must match")do { if (!(value->operand()->vreg_number() == r)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3475, "assert(" "value->operand()->vreg_number() == r" ") failed", "register number must match"); ::breakpoint(); } } while (0); |
| 3476 | // TKR assert(value->as_Constant() == NULL || value->is_pinned(), "only pinned constants can be alive accross block boundaries"); |
| 3477 | } |
| 3478 | } |
| 3479 | } |
| 3480 | |
| 3481 | |
| 3482 | class RegisterVerifier: public StackObj { |
| 3483 | private: |
| 3484 | LinearScan* _allocator; |
| 3485 | BlockList _work_list; // all blocks that must be processed |
| 3486 | IntervalsList _saved_states; // saved information of previous check |
| 3487 | |
| 3488 | // simplified access to methods of LinearScan |
| 3489 | Compilation* compilation() const { return _allocator->compilation(); } |
| 3490 | Interval* interval_at(int reg_num) const { return _allocator->interval_at(reg_num); } |
| 3491 | int reg_num(LIR_Opr opr) const { return _allocator->reg_num(opr); } |
| 3492 | |
| 3493 | // currently, only registers are processed |
| 3494 | int state_size() { return LinearScan::nof_regs; } |
| 3495 | |
| 3496 | // accessors |
| 3497 | IntervalList* state_for_block(BlockBegin* block) { return _saved_states.at(block->block_id()); } |
| 3498 | void set_state_for_block(BlockBegin* block, IntervalList* saved_state) { _saved_states.at_put(block->block_id(), saved_state); } |
| 3499 | void add_to_work_list(BlockBegin* block) { if (!_work_list.contains(block)) _work_list.append(block); } |
| 3500 | |
| 3501 | // helper functions |
| 3502 | IntervalList* copy(IntervalList* input_state); |
| 3503 | void state_put(IntervalList* input_state, int reg, Interval* interval); |
| 3504 | bool check_state(IntervalList* input_state, int reg, Interval* interval); |
| 3505 | |
| 3506 | void process_block(BlockBegin* block); |
| 3507 | void process_xhandler(XHandler* xhandler, IntervalList* input_state); |
| 3508 | void process_successor(BlockBegin* block, IntervalList* input_state); |
| 3509 | void process_operations(LIR_List* ops, IntervalList* input_state); |
| 3510 | |
| 3511 | public: |
| 3512 | RegisterVerifier(LinearScan* allocator) |
| 3513 | : _allocator(allocator) |
| 3514 | , _work_list(16) |
| 3515 | , _saved_states(BlockBegin::number_of_blocks(), BlockBegin::number_of_blocks(), NULL__null) |
| 3516 | { } |
| 3517 | |
| 3518 | void verify(BlockBegin* start); |
| 3519 | }; |
| 3520 | |
| 3521 | |
| 3522 | // entry function from LinearScan that starts the verification |
| 3523 | void LinearScan::verify_registers() { |
| 3524 | RegisterVerifier verifier(this); |
| 3525 | verifier.verify(block_at(0)); |
| 3526 | } |
| 3527 | |
| 3528 | |
| 3529 | void RegisterVerifier::verify(BlockBegin* start) { |
| 3530 | // setup input registers (method arguments) for first block |
| 3531 | int input_state_len = state_size(); |
| 3532 | IntervalList* input_state = new IntervalList(input_state_len, input_state_len, NULL__null); |
| 3533 | CallingConvention* args = compilation()->frame_map()->incoming_arguments(); |
| 3534 | for (int n = 0; n < args->length(); n++) { |
| 3535 | LIR_Opr opr = args->at(n); |
| 3536 | if (opr->is_register()) { |
| 3537 | Interval* interval = interval_at(reg_num(opr)); |
| 3538 | |
| 3539 | if (interval->assigned_reg() < state_size()) { |
| 3540 | input_state->at_put(interval->assigned_reg(), interval); |
| 3541 | } |
| 3542 | if (interval->assigned_regHi() != LinearScan::any_reg && interval->assigned_regHi() < state_size()) { |
| 3543 | input_state->at_put(interval->assigned_regHi(), interval); |
| 3544 | } |
| 3545 | } |
| 3546 | } |
| 3547 | |
| 3548 | set_state_for_block(start, input_state); |
| 3549 | add_to_work_list(start); |
| 3550 | |
| 3551 | // main loop for verification |
| 3552 | do { |
| 3553 | BlockBegin* block = _work_list.at(0); |
| 3554 | _work_list.remove_at(0); |
| 3555 | |
| 3556 | process_block(block); |
| 3557 | } while (!_work_list.is_empty()); |
| 3558 | } |
| 3559 | |
| 3560 | void RegisterVerifier::process_block(BlockBegin* block) { |
| 3561 | TRACE_LINEAR_SCAN(2, tty->cr(); tty->print_cr("process_block B%d", block->block_id()))if (TraceLinearScanLevel >= 2) { tty->cr(); tty->print_cr ("process_block B%d", block->block_id()); }; |
| 3562 | |
| 3563 | // must copy state because it is modified |
| 3564 | IntervalList* input_state = copy(state_for_block(block)); |
| 3565 | |
| 3566 | if (TraceLinearScanLevel >= 4) { |
| 3567 | tty->print_cr("Input-State of intervals:"); |
| 3568 | tty->print(" "); |
| 3569 | for (int i = 0; i < state_size(); i++) { |
| 3570 | if (input_state->at(i) != NULL__null) { |
| 3571 | tty->print(" %4d", input_state->at(i)->reg_num()); |
| 3572 | } else { |
| 3573 | tty->print(" __"); |
| 3574 | } |
| 3575 | } |
| 3576 | tty->cr(); |
| 3577 | tty->cr(); |
| 3578 | } |
| 3579 | |
| 3580 | // process all operations of the block |
| 3581 | process_operations(block->lir(), input_state); |
| 3582 | |
| 3583 | // iterate all successors |
| 3584 | for (int i = 0; i < block->number_of_sux(); i++) { |
| 3585 | process_successor(block->sux_at(i), input_state); |
| 3586 | } |
| 3587 | } |
| 3588 | |
| 3589 | void RegisterVerifier::process_xhandler(XHandler* xhandler, IntervalList* input_state) { |
| 3590 | TRACE_LINEAR_SCAN(2, tty->print_cr("process_xhandler B%d", xhandler->entry_block()->block_id()))if (TraceLinearScanLevel >= 2) { tty->print_cr("process_xhandler B%d" , xhandler->entry_block()->block_id()); }; |
| 3591 | |
| 3592 | // must copy state because it is modified |
| 3593 | input_state = copy(input_state); |
| 3594 | |
| 3595 | if (xhandler->entry_code() != NULL__null) { |
| 3596 | process_operations(xhandler->entry_code(), input_state); |
| 3597 | } |
| 3598 | process_successor(xhandler->entry_block(), input_state); |
| 3599 | } |
| 3600 | |
| 3601 | void RegisterVerifier::process_successor(BlockBegin* block, IntervalList* input_state) { |
| 3602 | IntervalList* saved_state = state_for_block(block); |
| 3603 | |
| 3604 | if (saved_state != NULL__null) { |
| 3605 | // this block was already processed before. |
| 3606 | // check if new input_state is consistent with saved_state |
| 3607 | |
| 3608 | bool saved_state_correct = true; |
| 3609 | for (int i = 0; i < state_size(); i++) { |
| 3610 | if (input_state->at(i) != saved_state->at(i)) { |
| 3611 | // current input_state and previous saved_state assume a different |
| 3612 | // interval in this register -> assume that this register is invalid |
| 3613 | if (saved_state->at(i) != NULL__null) { |
| 3614 | // invalidate old calculation only if it assumed that |
| 3615 | // register was valid. when the register was already invalid, |
| 3616 | // then the old calculation was correct. |
| 3617 | saved_state_correct = false; |
| 3618 | saved_state->at_put(i, NULL__null); |
| 3619 | |
| 3620 | TRACE_LINEAR_SCAN(4, tty->print_cr("process_successor B%d: invalidating slot %d", block->block_id(), i))if (TraceLinearScanLevel >= 4) { tty->print_cr("process_successor B%d: invalidating slot %d" , block->block_id(), i); }; |
| 3621 | } |
| 3622 | } |
| 3623 | } |
| 3624 | |
| 3625 | if (saved_state_correct) { |
| 3626 | // already processed block with correct input_state |
| 3627 | TRACE_LINEAR_SCAN(2, tty->print_cr("process_successor B%d: previous visit already correct", block->block_id()))if (TraceLinearScanLevel >= 2) { tty->print_cr("process_successor B%d: previous visit already correct" , block->block_id()); }; |
| 3628 | } else { |
| 3629 | // must re-visit this block |
| 3630 | TRACE_LINEAR_SCAN(2, tty->print_cr("process_successor B%d: must re-visit because input state changed", block->block_id()))if (TraceLinearScanLevel >= 2) { tty->print_cr("process_successor B%d: must re-visit because input state changed" , block->block_id()); }; |
| 3631 | add_to_work_list(block); |
| 3632 | } |
| 3633 | |
| 3634 | } else { |
| 3635 | // block was not processed before, so set initial input_state |
| 3636 | TRACE_LINEAR_SCAN(2, tty->print_cr("process_successor B%d: initial visit", block->block_id()))if (TraceLinearScanLevel >= 2) { tty->print_cr("process_successor B%d: initial visit" , block->block_id()); }; |
| 3637 | |
| 3638 | set_state_for_block(block, copy(input_state)); |
| 3639 | add_to_work_list(block); |
| 3640 | } |
| 3641 | } |
| 3642 | |
| 3643 | |
| 3644 | IntervalList* RegisterVerifier::copy(IntervalList* input_state) { |
| 3645 | IntervalList* copy_state = new IntervalList(input_state->length()); |
| 3646 | copy_state->appendAll(input_state); |
| 3647 | return copy_state; |
| 3648 | } |
| 3649 | |
| 3650 | void RegisterVerifier::state_put(IntervalList* input_state, int reg, Interval* interval) { |
| 3651 | if (reg != LinearScan::any_reg && reg < state_size()) { |
| 3652 | if (interval != NULL__null) { |
| 3653 | TRACE_LINEAR_SCAN(4, tty->print_cr(" reg[%d] = %d", reg, interval->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" reg[%d] = %d" , reg, interval->reg_num()); }; |
| 3654 | } else if (input_state->at(reg) != NULL__null) { |
| 3655 | TRACE_LINEAR_SCAN(4, tty->print_cr(" reg[%d] = NULL", reg))if (TraceLinearScanLevel >= 4) { tty->print_cr(" reg[%d] = NULL" , reg); }; |
| 3656 | } |
| 3657 | |
| 3658 | input_state->at_put(reg, interval); |
| 3659 | } |
| 3660 | } |
| 3661 | |
| 3662 | bool RegisterVerifier::check_state(IntervalList* input_state, int reg, Interval* interval) { |
| 3663 | if (reg != LinearScan::any_reg && reg < state_size()) { |
| 3664 | if (input_state->at(reg) != interval) { |
| 3665 | tty->print_cr("!! Error in register allocation: register %d does not contain interval %d", reg, interval->reg_num()); |
| 3666 | return true; |
| 3667 | } |
| 3668 | } |
| 3669 | return false; |
| 3670 | } |
| 3671 | |
| 3672 | void RegisterVerifier::process_operations(LIR_List* ops, IntervalList* input_state) { |
| 3673 | // visit all instructions of the block |
| 3674 | LIR_OpVisitState visitor; |
| 3675 | bool has_error = false; |
| 3676 | |
| 3677 | for (int i = 0; i < ops->length(); i++) { |
| 3678 | LIR_Op* op = ops->at(i); |
| 3679 | visitor.visit(op); |
| 3680 | |
| 3681 | TRACE_LINEAR_SCAN(4, op->print_on(tty))if (TraceLinearScanLevel >= 4) { op->print_on(tty); }; |
| 3682 | |
| 3683 | // check if input operands are correct |
| 3684 | int j; |
| 3685 | int n = visitor.opr_count(LIR_OpVisitState::inputMode); |
| 3686 | for (j = 0; j < n; j++) { |
| 3687 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::inputMode, j); |
| 3688 | if (opr->is_register() && LinearScan::is_processed_reg_num(reg_num(opr))) { |
| 3689 | Interval* interval = interval_at(reg_num(opr)); |
| 3690 | if (op->id() != -1) { |
| 3691 | interval = interval->split_child_at_op_id(op->id(), LIR_OpVisitState::inputMode); |
| 3692 | } |
| 3693 | |
| 3694 | has_error |= check_state(input_state, interval->assigned_reg(), interval->split_parent()); |
| 3695 | has_error |= check_state(input_state, interval->assigned_regHi(), interval->split_parent()); |
| 3696 | |
| 3697 | // When an operand is marked with is_last_use, then the fpu stack allocator |
| 3698 | // removes the register from the fpu stack -> the register contains no value |
| 3699 | if (opr->is_last_use()) { |
| 3700 | state_put(input_state, interval->assigned_reg(), NULL__null); |
| 3701 | state_put(input_state, interval->assigned_regHi(), NULL__null); |
| 3702 | } |
| 3703 | } |
| 3704 | } |
| 3705 | |
| 3706 | // invalidate all caller save registers at calls |
| 3707 | if (visitor.has_call()) { |
| 3708 | for (j = 0; j < FrameMap::nof_caller_save_cpu_regs(); j++) { |
| 3709 | state_put(input_state, reg_num(FrameMap::caller_save_cpu_reg_at(j)), NULL__null); |
| 3710 | } |
| 3711 | for (j = 0; j < FrameMap::nof_caller_save_fpu_regs; j++) { |
| 3712 | state_put(input_state, reg_num(FrameMap::caller_save_fpu_reg_at(j)), NULL__null); |
| 3713 | } |
| 3714 | |
| 3715 | #ifdef X86 |
| 3716 | int num_caller_save_xmm_regs = FrameMap::get_num_caller_save_xmms(); |
| 3717 | for (j = 0; j < num_caller_save_xmm_regs; j++) { |
| 3718 | state_put(input_state, reg_num(FrameMap::caller_save_xmm_reg_at(j)), NULL__null); |
| 3719 | } |
| 3720 | #endif |
| 3721 | } |
| 3722 | |
| 3723 | // process xhandler before output and temp operands |
| 3724 | XHandlers* xhandlers = visitor.all_xhandler(); |
| 3725 | n = xhandlers->length(); |
| 3726 | for (int k = 0; k < n; k++) { |
| 3727 | process_xhandler(xhandlers->handler_at(k), input_state); |
| 3728 | } |
| 3729 | |
| 3730 | // set temp operands (some operations use temp operands also as output operands, so can't set them NULL) |
| 3731 | n = visitor.opr_count(LIR_OpVisitState::tempMode); |
| 3732 | for (j = 0; j < n; j++) { |
| 3733 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::tempMode, j); |
| 3734 | if (opr->is_register() && LinearScan::is_processed_reg_num(reg_num(opr))) { |
| 3735 | Interval* interval = interval_at(reg_num(opr)); |
| 3736 | if (op->id() != -1) { |
| 3737 | interval = interval->split_child_at_op_id(op->id(), LIR_OpVisitState::tempMode); |
| 3738 | } |
| 3739 | |
| 3740 | state_put(input_state, interval->assigned_reg(), interval->split_parent()); |
| 3741 | state_put(input_state, interval->assigned_regHi(), interval->split_parent()); |
| 3742 | } |
| 3743 | } |
| 3744 | |
| 3745 | // set output operands |
| 3746 | n = visitor.opr_count(LIR_OpVisitState::outputMode); |
| 3747 | for (j = 0; j < n; j++) { |
| 3748 | LIR_Opr opr = visitor.opr_at(LIR_OpVisitState::outputMode, j); |
| 3749 | if (opr->is_register() && LinearScan::is_processed_reg_num(reg_num(opr))) { |
| 3750 | Interval* interval = interval_at(reg_num(opr)); |
| 3751 | if (op->id() != -1) { |
| 3752 | interval = interval->split_child_at_op_id(op->id(), LIR_OpVisitState::outputMode); |
| 3753 | } |
| 3754 | |
| 3755 | state_put(input_state, interval->assigned_reg(), interval->split_parent()); |
| 3756 | state_put(input_state, interval->assigned_regHi(), interval->split_parent()); |
| 3757 | } |
| 3758 | } |
| 3759 | } |
| 3760 | assert(has_error == false, "Error in register allocation")do { if (!(has_error == false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3760, "assert(" "has_error == false" ") failed", "Error in register allocation" ); ::breakpoint(); } } while (0); |
| 3761 | } |
| 3762 | |
| 3763 | #endif // ASSERT |
| 3764 | |
| 3765 | |
| 3766 | |
| 3767 | // **** Implementation of MoveResolver ****************************** |
| 3768 | |
| 3769 | MoveResolver::MoveResolver(LinearScan* allocator) : |
| 3770 | _allocator(allocator), |
| 3771 | _insert_list(NULL__null), |
| 3772 | _insert_idx(-1), |
| 3773 | _insertion_buffer(), |
| 3774 | _mapping_from(8), |
| 3775 | _mapping_from_opr(8), |
| 3776 | _mapping_to(8), |
| 3777 | _multiple_reads_allowed(false) |
| 3778 | { |
| 3779 | for (int i = 0; i < LinearScan::nof_regs; i++) { |
| 3780 | _register_blocked[i] = 0; |
| 3781 | } |
| 3782 | DEBUG_ONLY(check_empty())check_empty(); |
| 3783 | } |
| 3784 | |
| 3785 | |
| 3786 | #ifdef ASSERT1 |
| 3787 | |
| 3788 | void MoveResolver::check_empty() { |
| 3789 | assert(_mapping_from.length() == 0 && _mapping_from_opr.length() == 0 && _mapping_to.length() == 0, "list must be empty before and after processing")do { if (!(_mapping_from.length() == 0 && _mapping_from_opr .length() == 0 && _mapping_to.length() == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3789, "assert(" "_mapping_from.length() == 0 && _mapping_from_opr.length() == 0 && _mapping_to.length() == 0" ") failed", "list must be empty before and after processing" ); ::breakpoint(); } } while (0); |
| 3790 | for (int i = 0; i < LinearScan::nof_regs; i++) { |
| 3791 | assert(register_blocked(i) == 0, "register map must be empty before and after processing")do { if (!(register_blocked(i) == 0)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3791, "assert(" "register_blocked(i) == 0" ") failed", "register map must be empty before and after processing" ); ::breakpoint(); } } while (0); |
| 3792 | } |
| 3793 | assert(_multiple_reads_allowed == false, "must have default value")do { if (!(_multiple_reads_allowed == false)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3793, "assert(" "_multiple_reads_allowed == false" ") failed" , "must have default value"); ::breakpoint(); } } while (0); |
| 3794 | } |
| 3795 | |
| 3796 | void MoveResolver::verify_before_resolve() { |
| 3797 | assert(_mapping_from.length() == _mapping_from_opr.length(), "length must be equal")do { if (!(_mapping_from.length() == _mapping_from_opr.length ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3797, "assert(" "_mapping_from.length() == _mapping_from_opr.length()" ") failed", "length must be equal"); ::breakpoint(); } } while (0); |
| 3798 | assert(_mapping_from.length() == _mapping_to.length(), "length must be equal")do { if (!(_mapping_from.length() == _mapping_to.length())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3798, "assert(" "_mapping_from.length() == _mapping_to.length()" ") failed", "length must be equal"); ::breakpoint(); } } while (0); |
| 3799 | assert(_insert_list != NULL && _insert_idx != -1, "insert position not set")do { if (!(_insert_list != __null && _insert_idx != - 1)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3799, "assert(" "_insert_list != __null && _insert_idx != -1" ") failed", "insert position not set"); ::breakpoint(); } } while (0); |
| 3800 | |
| 3801 | int i, j; |
| 3802 | if (!_multiple_reads_allowed) { |
| 3803 | for (i = 0; i < _mapping_from.length(); i++) { |
| 3804 | for (j = i + 1; j < _mapping_from.length(); j++) { |
| 3805 | assert(_mapping_from.at(i) == NULL || _mapping_from.at(i) != _mapping_from.at(j), "cannot read from same interval twice")do { if (!(_mapping_from.at(i) == __null || _mapping_from.at( i) != _mapping_from.at(j))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3805, "assert(" "_mapping_from.at(i) == __null || _mapping_from.at(i) != _mapping_from.at(j)" ") failed", "cannot read from same interval twice"); ::breakpoint (); } } while (0); |
| 3806 | } |
| 3807 | } |
| 3808 | } |
| 3809 | |
| 3810 | for (i = 0; i < _mapping_to.length(); i++) { |
| 3811 | for (j = i + 1; j < _mapping_to.length(); j++) { |
| 3812 | assert(_mapping_to.at(i) != _mapping_to.at(j), "cannot write to same interval twice")do { if (!(_mapping_to.at(i) != _mapping_to.at(j))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3812, "assert(" "_mapping_to.at(i) != _mapping_to.at(j)" ") failed" , "cannot write to same interval twice"); ::breakpoint(); } } while (0); |
| 3813 | } |
| 3814 | } |
| 3815 | |
| 3816 | |
| 3817 | ResourceBitMap used_regs(LinearScan::nof_regs + allocator()->frame_map()->argcount() + allocator()->max_spills()); |
| 3818 | if (!_multiple_reads_allowed) { |
| 3819 | for (i = 0; i < _mapping_from.length(); i++) { |
| 3820 | Interval* it = _mapping_from.at(i); |
| 3821 | if (it != NULL__null) { |
| 3822 | assert(!used_regs.at(it->assigned_reg()), "cannot read from same register twice")do { if (!(!used_regs.at(it->assigned_reg()))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3822, "assert(" "!used_regs.at(it->assigned_reg())" ") failed" , "cannot read from same register twice"); ::breakpoint(); } } while (0); |
| 3823 | used_regs.set_bit(it->assigned_reg()); |
| 3824 | |
| 3825 | if (it->assigned_regHi() != LinearScan::any_reg) { |
| 3826 | assert(!used_regs.at(it->assigned_regHi()), "cannot read from same register twice")do { if (!(!used_regs.at(it->assigned_regHi()))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3826, "assert(" "!used_regs.at(it->assigned_regHi())" ") failed" , "cannot read from same register twice"); ::breakpoint(); } } while (0); |
| 3827 | used_regs.set_bit(it->assigned_regHi()); |
| 3828 | } |
| 3829 | } |
| 3830 | } |
| 3831 | } |
| 3832 | |
| 3833 | used_regs.clear(); |
| 3834 | for (i = 0; i < _mapping_to.length(); i++) { |
| 3835 | Interval* it = _mapping_to.at(i); |
| 3836 | assert(!used_regs.at(it->assigned_reg()), "cannot write to same register twice")do { if (!(!used_regs.at(it->assigned_reg()))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3836, "assert(" "!used_regs.at(it->assigned_reg())" ") failed" , "cannot write to same register twice"); ::breakpoint(); } } while (0); |
| 3837 | used_regs.set_bit(it->assigned_reg()); |
| 3838 | |
| 3839 | if (it->assigned_regHi() != LinearScan::any_reg) { |
| 3840 | assert(!used_regs.at(it->assigned_regHi()), "cannot write to same register twice")do { if (!(!used_regs.at(it->assigned_regHi()))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3840, "assert(" "!used_regs.at(it->assigned_regHi())" ") failed" , "cannot write to same register twice"); ::breakpoint(); } } while (0); |
| 3841 | used_regs.set_bit(it->assigned_regHi()); |
| 3842 | } |
| 3843 | } |
| 3844 | |
| 3845 | used_regs.clear(); |
| 3846 | for (i = 0; i < _mapping_from.length(); i++) { |
| 3847 | Interval* it = _mapping_from.at(i); |
| 3848 | if (it != NULL__null && it->assigned_reg() >= LinearScan::nof_regs) { |
| 3849 | used_regs.set_bit(it->assigned_reg()); |
| 3850 | } |
| 3851 | } |
| 3852 | for (i = 0; i < _mapping_to.length(); i++) { |
| 3853 | Interval* it = _mapping_to.at(i); |
| 3854 | assert(!used_regs.at(it->assigned_reg()) || it->assigned_reg() == _mapping_from.at(i)->assigned_reg(), "stack slots used in _mapping_from must be disjoint to _mapping_to")do { if (!(!used_regs.at(it->assigned_reg()) || it->assigned_reg () == _mapping_from.at(i)->assigned_reg())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3854, "assert(" "!used_regs.at(it->assigned_reg()) || it->assigned_reg() == _mapping_from.at(i)->assigned_reg()" ") failed", "stack slots used in _mapping_from must be disjoint to _mapping_to" ); ::breakpoint(); } } while (0); |
| 3855 | } |
| 3856 | } |
| 3857 | |
| 3858 | #endif // ASSERT |
| 3859 | |
| 3860 | |
| 3861 | // mark assigned_reg and assigned_regHi of the interval as blocked |
| 3862 | void MoveResolver::block_registers(Interval* it) { |
| 3863 | int reg = it->assigned_reg(); |
| 3864 | if (reg < LinearScan::nof_regs) { |
| 3865 | assert(_multiple_reads_allowed || register_blocked(reg) == 0, "register already marked as used")do { if (!(_multiple_reads_allowed || register_blocked(reg) == 0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3865, "assert(" "_multiple_reads_allowed || register_blocked(reg) == 0" ") failed", "register already marked as used"); ::breakpoint (); } } while (0); |
| 3866 | set_register_blocked(reg, 1); |
| 3867 | } |
| 3868 | reg = it->assigned_regHi(); |
| 3869 | if (reg != LinearScan::any_reg && reg < LinearScan::nof_regs) { |
| 3870 | assert(_multiple_reads_allowed || register_blocked(reg) == 0, "register already marked as used")do { if (!(_multiple_reads_allowed || register_blocked(reg) == 0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3870, "assert(" "_multiple_reads_allowed || register_blocked(reg) == 0" ") failed", "register already marked as used"); ::breakpoint (); } } while (0); |
| 3871 | set_register_blocked(reg, 1); |
| 3872 | } |
| 3873 | } |
| 3874 | |
| 3875 | // mark assigned_reg and assigned_regHi of the interval as unblocked |
| 3876 | void MoveResolver::unblock_registers(Interval* it) { |
| 3877 | int reg = it->assigned_reg(); |
| 3878 | if (reg < LinearScan::nof_regs) { |
| 3879 | assert(register_blocked(reg) > 0, "register already marked as unused")do { if (!(register_blocked(reg) > 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3879, "assert(" "register_blocked(reg) > 0" ") failed", "register already marked as unused" ); ::breakpoint(); } } while (0); |
| 3880 | set_register_blocked(reg, -1); |
| 3881 | } |
| 3882 | reg = it->assigned_regHi(); |
| 3883 | if (reg != LinearScan::any_reg && reg < LinearScan::nof_regs) { |
| 3884 | assert(register_blocked(reg) > 0, "register already marked as unused")do { if (!(register_blocked(reg) > 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3884, "assert(" "register_blocked(reg) > 0" ") failed", "register already marked as unused" ); ::breakpoint(); } } while (0); |
| 3885 | set_register_blocked(reg, -1); |
| 3886 | } |
| 3887 | } |
| 3888 | |
| 3889 | // check if assigned_reg and assigned_regHi of the to-interval are not blocked (or only blocked by from) |
| 3890 | bool MoveResolver::save_to_process_move(Interval* from, Interval* to) { |
| 3891 | int from_reg = -1; |
| 3892 | int from_regHi = -1; |
| 3893 | if (from != NULL__null) { |
| 3894 | from_reg = from->assigned_reg(); |
| 3895 | from_regHi = from->assigned_regHi(); |
| 3896 | } |
| 3897 | |
| 3898 | int reg = to->assigned_reg(); |
| 3899 | if (reg < LinearScan::nof_regs) { |
| 3900 | if (register_blocked(reg) > 1 || (register_blocked(reg) == 1 && reg != from_reg && reg != from_regHi)) { |
| 3901 | return false; |
| 3902 | } |
| 3903 | } |
| 3904 | reg = to->assigned_regHi(); |
| 3905 | if (reg != LinearScan::any_reg && reg < LinearScan::nof_regs) { |
| 3906 | if (register_blocked(reg) > 1 || (register_blocked(reg) == 1 && reg != from_reg && reg != from_regHi)) { |
| 3907 | return false; |
| 3908 | } |
| 3909 | } |
| 3910 | |
| 3911 | return true; |
| 3912 | } |
| 3913 | |
| 3914 | |
| 3915 | void MoveResolver::create_insertion_buffer(LIR_List* list) { |
| 3916 | assert(!_insertion_buffer.initialized(), "overwriting existing buffer")do { if (!(!_insertion_buffer.initialized())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3916, "assert(" "!_insertion_buffer.initialized()" ") failed" , "overwriting existing buffer"); ::breakpoint(); } } while ( 0); |
| 3917 | _insertion_buffer.init(list); |
| 3918 | } |
| 3919 | |
| 3920 | void MoveResolver::append_insertion_buffer() { |
| 3921 | if (_insertion_buffer.initialized()) { |
| 3922 | _insertion_buffer.lir_list()->append(&_insertion_buffer); |
| 3923 | } |
| 3924 | assert(!_insertion_buffer.initialized(), "must be uninitialized now")do { if (!(!_insertion_buffer.initialized())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3924, "assert(" "!_insertion_buffer.initialized()" ") failed" , "must be uninitialized now"); ::breakpoint(); } } while (0); |
| 3925 | |
| 3926 | _insert_list = NULL__null; |
| 3927 | _insert_idx = -1; |
| 3928 | } |
| 3929 | |
| 3930 | void MoveResolver::insert_move(Interval* from_interval, Interval* to_interval) { |
| 3931 | assert(from_interval->reg_num() != to_interval->reg_num(), "from and to interval equal")do { if (!(from_interval->reg_num() != to_interval->reg_num ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3931, "assert(" "from_interval->reg_num() != to_interval->reg_num()" ") failed", "from and to interval equal"); ::breakpoint(); } } while (0); |
| 3932 | assert(from_interval->type() == to_interval->type(), "move between different types")do { if (!(from_interval->type() == to_interval->type() )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3932, "assert(" "from_interval->type() == to_interval->type()" ") failed", "move between different types"); ::breakpoint(); } } while (0); |
| 3933 | assert(_insert_list != NULL && _insert_idx != -1, "must setup insert position first")do { if (!(_insert_list != __null && _insert_idx != - 1)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3933, "assert(" "_insert_list != __null && _insert_idx != -1" ") failed", "must setup insert position first"); ::breakpoint (); } } while (0); |
| 3934 | assert(_insertion_buffer.lir_list() == _insert_list, "wrong insertion buffer")do { if (!(_insertion_buffer.lir_list() == _insert_list)) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3934, "assert(" "_insertion_buffer.lir_list() == _insert_list" ") failed", "wrong insertion buffer"); ::breakpoint(); } } while (0); |
| 3935 | |
| 3936 | LIR_Opr from_opr = get_virtual_register(from_interval); |
| 3937 | LIR_Opr to_opr = get_virtual_register(to_interval); |
| 3938 | |
| 3939 | if (!_multiple_reads_allowed) { |
| 3940 | // the last_use flag is an optimization for FPU stack allocation. When the same |
| 3941 | // input interval is used in more than one move, then it is too difficult to determine |
| 3942 | // if this move is really the last use. |
| 3943 | from_opr = from_opr->make_last_use(); |
| 3944 | } |
| 3945 | _insertion_buffer.move(_insert_idx, from_opr, to_opr); |
| 3946 | |
| 3947 | TRACE_LINEAR_SCAN(4, tty->print_cr("MoveResolver: inserted move from register %d (%d, %d) to %d (%d, %d)", from_interval->reg_num(), from_interval->assigned_reg(), from_interval->assigned_regHi(), to_interval->reg_num(), to_interval->assigned_reg(), to_interval->assigned_regHi()))if (TraceLinearScanLevel >= 4) { tty->print_cr("MoveResolver: inserted move from register %d (%d, %d) to %d (%d, %d)" , from_interval->reg_num(), from_interval->assigned_reg (), from_interval->assigned_regHi(), to_interval->reg_num (), to_interval->assigned_reg(), to_interval->assigned_regHi ()); }; |
| 3948 | } |
| 3949 | |
| 3950 | void MoveResolver::insert_move(LIR_Opr from_opr, Interval* to_interval) { |
| 3951 | assert(from_opr->type() == to_interval->type(), "move between different types")do { if (!(from_opr->type() == to_interval->type())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3951, "assert(" "from_opr->type() == to_interval->type()" ") failed", "move between different types"); ::breakpoint(); } } while (0); |
| 3952 | assert(_insert_list != NULL && _insert_idx != -1, "must setup insert position first")do { if (!(_insert_list != __null && _insert_idx != - 1)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3952, "assert(" "_insert_list != __null && _insert_idx != -1" ") failed", "must setup insert position first"); ::breakpoint (); } } while (0); |
| 3953 | assert(_insertion_buffer.lir_list() == _insert_list, "wrong insertion buffer")do { if (!(_insertion_buffer.lir_list() == _insert_list)) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3953, "assert(" "_insertion_buffer.lir_list() == _insert_list" ") failed", "wrong insertion buffer"); ::breakpoint(); } } while (0); |
| 3954 | |
| 3955 | LIR_Opr to_opr = get_virtual_register(to_interval); |
| 3956 | _insertion_buffer.move(_insert_idx, from_opr, to_opr); |
| 3957 | |
| 3958 | TRACE_LINEAR_SCAN(4, tty->print("MoveResolver: inserted move from constant "); from_opr->print(); tty->print_cr(" to %d (%d, %d)", to_interval->reg_num(), to_interval->assigned_reg(), to_interval->assigned_regHi()))if (TraceLinearScanLevel >= 4) { tty->print("MoveResolver: inserted move from constant " ); from_opr->print(); tty->print_cr(" to %d (%d, %d)", to_interval->reg_num(), to_interval->assigned_reg(), to_interval ->assigned_regHi()); }; |
| 3959 | } |
| 3960 | |
| 3961 | LIR_Opr MoveResolver::get_virtual_register(Interval* interval) { |
| 3962 | // Add a little fudge factor for the bailout since the bailout is only checked periodically. This allows us to hand out |
| 3963 | // a few extra registers before we really run out which helps to avoid to trip over assertions. |
| 3964 | int reg_num = interval->reg_num(); |
| 3965 | if (reg_num + 20 >= LIR_Opr::vreg_max) { |
| 3966 | _allocator->bailout("out of virtual registers in linear scan"); |
| 3967 | if (reg_num + 2 >= LIR_Opr::vreg_max) { |
| 3968 | // Wrap it around and continue until bailout really happens to avoid hitting assertions. |
| 3969 | reg_num = LIR_Opr::vreg_base; |
| 3970 | } |
| 3971 | } |
| 3972 | LIR_Opr vreg = LIR_OprFact::virtual_register(reg_num, interval->type()); |
| 3973 | assert(vreg != LIR_OprFact::illegal(), "ran out of virtual registers")do { if (!(vreg != LIR_OprFact::illegal())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 3973, "assert(" "vreg != LIR_OprFact::illegal()" ") failed" , "ran out of virtual registers"); ::breakpoint(); } } while ( 0); |
| 3974 | return vreg; |
| 3975 | } |
| 3976 | |
| 3977 | void MoveResolver::resolve_mappings() { |
| 3978 | TRACE_LINEAR_SCAN(4, tty->print_cr("MoveResolver: resolving mappings for Block B%d, index %d", _insert_list->block() != NULL ? _insert_list->block()->block_id() : -1, _insert_idx))if (TraceLinearScanLevel >= 4) { tty->print_cr("MoveResolver: resolving mappings for Block B%d, index %d" , _insert_list->block() != __null ? _insert_list->block ()->block_id() : -1, _insert_idx); }; |
| 3979 | DEBUG_ONLY(verify_before_resolve())verify_before_resolve(); |
| 3980 | |
| 3981 | // Block all registers that are used as input operands of a move. |
| 3982 | // When a register is blocked, no move to this register is emitted. |
| 3983 | // This is necessary for detecting cycles in moves. |
| 3984 | int i; |
| 3985 | for (i = _mapping_from.length() - 1; i >= 0; i--) { |
| 3986 | Interval* from_interval = _mapping_from.at(i); |
| 3987 | if (from_interval != NULL__null) { |
| 3988 | block_registers(from_interval); |
| 3989 | } |
| 3990 | } |
| 3991 | |
| 3992 | int spill_candidate = -1; |
| 3993 | while (_mapping_from.length() > 0) { |
| 3994 | bool processed_interval = false; |
| 3995 | |
| 3996 | for (i = _mapping_from.length() - 1; i >= 0; i--) { |
| 3997 | Interval* from_interval = _mapping_from.at(i); |
| 3998 | Interval* to_interval = _mapping_to.at(i); |
| 3999 | |
| 4000 | if (save_to_process_move(from_interval, to_interval)) { |
| 4001 | // this inverval can be processed because target is free |
| 4002 | if (from_interval != NULL__null) { |
| 4003 | insert_move(from_interval, to_interval); |
| 4004 | unblock_registers(from_interval); |
| 4005 | } else { |
| 4006 | insert_move(_mapping_from_opr.at(i), to_interval); |
| 4007 | } |
| 4008 | _mapping_from.remove_at(i); |
| 4009 | _mapping_from_opr.remove_at(i); |
| 4010 | _mapping_to.remove_at(i); |
| 4011 | |
| 4012 | processed_interval = true; |
| 4013 | } else if (from_interval != NULL__null && from_interval->assigned_reg() < LinearScan::nof_regs) { |
| 4014 | // this interval cannot be processed now because target is not free |
| 4015 | // it starts in a register, so it is a possible candidate for spilling |
| 4016 | spill_candidate = i; |
| 4017 | } |
| 4018 | } |
| 4019 | |
| 4020 | if (!processed_interval) { |
| 4021 | // no move could be processed because there is a cycle in the move list |
| 4022 | // (e.g. r1 -> r2, r2 -> r1), so one interval must be spilled to memory |
| 4023 | guarantee(spill_candidate != -1, "no interval in register for spilling found")do { if (!(spill_candidate != -1)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4023, "guarantee(" "spill_candidate != -1" ") failed", "no interval in register for spilling found" ); ::breakpoint(); } } while (0); |
| 4024 | |
| 4025 | // create a new spill interval and assign a stack slot to it |
| 4026 | Interval* from_interval = _mapping_from.at(spill_candidate); |
| 4027 | Interval* spill_interval = new Interval(-1); |
| 4028 | spill_interval->set_type(from_interval->type()); |
| 4029 | |
| 4030 | // add a dummy range because real position is difficult to calculate |
| 4031 | // Note: this range is a special case when the integrity of the allocation is checked |
| 4032 | spill_interval->add_range(1, 2); |
| 4033 | |
| 4034 | // do not allocate a new spill slot for temporary interval, but |
| 4035 | // use spill slot assigned to from_interval. Otherwise moves from |
| 4036 | // one stack slot to another can happen (not allowed by LIR_Assembler |
| 4037 | int spill_slot = from_interval->canonical_spill_slot(); |
| 4038 | if (spill_slot < 0) { |
| 4039 | spill_slot = allocator()->allocate_spill_slot(type2spill_size[spill_interval->type()] == 2); |
| 4040 | from_interval->set_canonical_spill_slot(spill_slot); |
| 4041 | } |
| 4042 | spill_interval->assign_reg(spill_slot); |
| 4043 | allocator()->append_interval(spill_interval); |
| 4044 | |
| 4045 | TRACE_LINEAR_SCAN(4, tty->print_cr("created new Interval %d for spilling", spill_interval->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr("created new Interval %d for spilling" , spill_interval->reg_num()); }; |
| 4046 | |
| 4047 | // insert a move from register to stack and update the mapping |
| 4048 | insert_move(from_interval, spill_interval); |
| 4049 | _mapping_from.at_put(spill_candidate, spill_interval); |
| 4050 | unblock_registers(from_interval); |
| 4051 | } |
| 4052 | } |
| 4053 | |
| 4054 | // reset to default value |
| 4055 | _multiple_reads_allowed = false; |
| 4056 | |
| 4057 | // check that all intervals have been processed |
| 4058 | DEBUG_ONLY(check_empty())check_empty(); |
| 4059 | } |
| 4060 | |
| 4061 | |
| 4062 | void MoveResolver::set_insert_position(LIR_List* insert_list, int insert_idx) { |
| 4063 | TRACE_LINEAR_SCAN(4, tty->print_cr("MoveResolver: setting insert position to Block B%d, index %d", insert_list->block() != NULL ? insert_list->block()->block_id() : -1, insert_idx))if (TraceLinearScanLevel >= 4) { tty->print_cr("MoveResolver: setting insert position to Block B%d, index %d" , insert_list->block() != __null ? insert_list->block() ->block_id() : -1, insert_idx); }; |
| 4064 | assert(_insert_list == NULL && _insert_idx == -1, "use move_insert_position instead of set_insert_position when data already set")do { if (!(_insert_list == __null && _insert_idx == - 1)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4064, "assert(" "_insert_list == __null && _insert_idx == -1" ") failed", "use move_insert_position instead of set_insert_position when data already set" ); ::breakpoint(); } } while (0); |
| 4065 | |
| 4066 | create_insertion_buffer(insert_list); |
| 4067 | _insert_list = insert_list; |
| 4068 | _insert_idx = insert_idx; |
| 4069 | } |
| 4070 | |
| 4071 | void MoveResolver::move_insert_position(LIR_List* insert_list, int insert_idx) { |
| 4072 | TRACE_LINEAR_SCAN(4, tty->print_cr("MoveResolver: moving insert position to Block B%d, index %d", insert_list->block() != NULL ? insert_list->block()->block_id() : -1, insert_idx))if (TraceLinearScanLevel >= 4) { tty->print_cr("MoveResolver: moving insert position to Block B%d, index %d" , insert_list->block() != __null ? insert_list->block() ->block_id() : -1, insert_idx); }; |
| 4073 | |
| 4074 | if (_insert_list != NULL__null && (insert_list != _insert_list || insert_idx != _insert_idx)) { |
| 4075 | // insert position changed -> resolve current mappings |
| 4076 | resolve_mappings(); |
| 4077 | } |
| 4078 | |
| 4079 | if (insert_list != _insert_list) { |
| 4080 | // block changed -> append insertion_buffer because it is |
| 4081 | // bound to a specific block and create a new insertion_buffer |
| 4082 | append_insertion_buffer(); |
| 4083 | create_insertion_buffer(insert_list); |
| 4084 | } |
| 4085 | |
| 4086 | _insert_list = insert_list; |
| 4087 | _insert_idx = insert_idx; |
| 4088 | } |
| 4089 | |
| 4090 | void MoveResolver::add_mapping(Interval* from_interval, Interval* to_interval) { |
| 4091 | TRACE_LINEAR_SCAN(4, tty->print_cr("MoveResolver: adding mapping from %d (%d, %d) to %d (%d, %d)", from_interval->reg_num(), from_interval->assigned_reg(), from_interval->assigned_regHi(), to_interval->reg_num(), to_interval->assigned_reg(), to_interval->assigned_regHi()))if (TraceLinearScanLevel >= 4) { tty->print_cr("MoveResolver: adding mapping from %d (%d, %d) to %d (%d, %d)" , from_interval->reg_num(), from_interval->assigned_reg (), from_interval->assigned_regHi(), to_interval->reg_num (), to_interval->assigned_reg(), to_interval->assigned_regHi ()); }; |
| 4092 | |
| 4093 | _mapping_from.append(from_interval); |
| 4094 | _mapping_from_opr.append(LIR_OprFact::illegalOpr); |
| 4095 | _mapping_to.append(to_interval); |
| 4096 | } |
| 4097 | |
| 4098 | |
| 4099 | void MoveResolver::add_mapping(LIR_Opr from_opr, Interval* to_interval) { |
| 4100 | TRACE_LINEAR_SCAN(4, tty->print("MoveResolver: adding mapping from "); from_opr->print(); tty->print_cr(" to %d (%d, %d)", to_interval->reg_num(), to_interval->assigned_reg(), to_interval->assigned_regHi()))if (TraceLinearScanLevel >= 4) { tty->print("MoveResolver: adding mapping from " ); from_opr->print(); tty->print_cr(" to %d (%d, %d)", to_interval ->reg_num(), to_interval->assigned_reg(), to_interval-> assigned_regHi()); }; |
| 4101 | assert(from_opr->is_constant(), "only for constants")do { if (!(from_opr->is_constant())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4101, "assert(" "from_opr->is_constant()" ") failed", "only for constants" ); ::breakpoint(); } } while (0); |
| 4102 | |
| 4103 | _mapping_from.append(NULL__null); |
| 4104 | _mapping_from_opr.append(from_opr); |
| 4105 | _mapping_to.append(to_interval); |
| 4106 | } |
| 4107 | |
| 4108 | void MoveResolver::resolve_and_append_moves() { |
| 4109 | if (has_mappings()) { |
| 4110 | resolve_mappings(); |
| 4111 | } |
| 4112 | append_insertion_buffer(); |
| 4113 | } |
| 4114 | |
| 4115 | |
| 4116 | |
| 4117 | // **** Implementation of Range ************************************* |
| 4118 | |
| 4119 | Range::Range(int from, int to, Range* next) : |
| 4120 | _from(from), |
| 4121 | _to(to), |
| 4122 | _next(next) |
| 4123 | { |
| 4124 | } |
| 4125 | |
| 4126 | // initialize sentinel |
| 4127 | Range* Range::_end = NULL__null; |
| 4128 | void Range::initialize(Arena* arena) { |
| 4129 | _end = new (arena) Range(max_jint, max_jint, NULL__null); |
| 4130 | } |
| 4131 | |
| 4132 | int Range::intersects_at(Range* r2) const { |
| 4133 | const Range* r1 = this; |
| 4134 | |
| 4135 | assert(r1 != NULL && r2 != NULL, "null ranges not allowed")do { if (!(r1 != __null && r2 != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4135, "assert(" "r1 != __null && r2 != __null" ") failed" , "null ranges not allowed"); ::breakpoint(); } } while (0); |
| 4136 | assert(r1 != _end && r2 != _end, "empty ranges not allowed")do { if (!(r1 != _end && r2 != _end)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4136, "assert(" "r1 != _end && r2 != _end" ") failed" , "empty ranges not allowed"); ::breakpoint(); } } while (0); |
| 4137 | |
| 4138 | do { |
| 4139 | if (r1->from() < r2->from()) { |
| 4140 | if (r1->to() <= r2->from()) { |
| 4141 | r1 = r1->next(); if (r1 == _end) return -1; |
| 4142 | } else { |
| 4143 | return r2->from(); |
| 4144 | } |
| 4145 | } else if (r2->from() < r1->from()) { |
| 4146 | if (r2->to() <= r1->from()) { |
| 4147 | r2 = r2->next(); if (r2 == _end) return -1; |
| 4148 | } else { |
| 4149 | return r1->from(); |
| 4150 | } |
| 4151 | } else { // r1->from() == r2->from() |
| 4152 | if (r1->from() == r1->to()) { |
| 4153 | r1 = r1->next(); if (r1 == _end) return -1; |
| 4154 | } else if (r2->from() == r2->to()) { |
| 4155 | r2 = r2->next(); if (r2 == _end) return -1; |
| 4156 | } else { |
| 4157 | return r1->from(); |
| 4158 | } |
| 4159 | } |
| 4160 | } while (true); |
| 4161 | } |
| 4162 | |
| 4163 | #ifndef PRODUCT |
| 4164 | void Range::print(outputStream* out) const { |
| 4165 | out->print("[%d, %d[ ", _from, _to); |
| 4166 | } |
| 4167 | #endif |
| 4168 | |
| 4169 | |
| 4170 | |
| 4171 | // **** Implementation of Interval ********************************** |
| 4172 | |
| 4173 | // initialize sentinel |
| 4174 | Interval* Interval::_end = NULL__null; |
| 4175 | void Interval::initialize(Arena* arena) { |
| 4176 | Range::initialize(arena); |
| 4177 | _end = new (arena) Interval(-1); |
| 4178 | } |
| 4179 | |
| 4180 | Interval::Interval(int reg_num) : |
| 4181 | _reg_num(reg_num), |
| 4182 | _type(T_ILLEGAL), |
| 4183 | _first(Range::end()), |
| 4184 | _use_pos_and_kinds(12), |
| 4185 | _current(Range::end()), |
| 4186 | _next(_end), |
| 4187 | _state(invalidState), |
| 4188 | _assigned_reg(LinearScan::any_reg), |
| 4189 | _assigned_regHi(LinearScan::any_reg), |
| 4190 | _cached_to(-1), |
| 4191 | _cached_opr(LIR_OprFact::illegalOpr), |
| 4192 | _cached_vm_reg(VMRegImpl::Bad()), |
| 4193 | _split_children(NULL__null), |
| 4194 | _canonical_spill_slot(-1), |
| 4195 | _insert_move_when_activated(false), |
| 4196 | _spill_state(noDefinitionFound), |
| 4197 | _spill_definition_pos(-1), |
| 4198 | _register_hint(NULL__null) |
| 4199 | { |
| 4200 | _split_parent = this; |
| 4201 | _current_split_child = this; |
| 4202 | } |
| 4203 | |
| 4204 | int Interval::calc_to() { |
| 4205 | assert(_first != Range::end(), "interval has no range")do { if (!(_first != Range::end())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4205, "assert(" "_first != Range::end()" ") failed", "interval has no range" ); ::breakpoint(); } } while (0); |
| 4206 | |
| 4207 | Range* r = _first; |
| 4208 | while (r->next() != Range::end()) { |
| 4209 | r = r->next(); |
| 4210 | } |
| 4211 | return r->to(); |
| 4212 | } |
| 4213 | |
| 4214 | |
| 4215 | #ifdef ASSERT1 |
| 4216 | // consistency check of split-children |
| 4217 | void Interval::check_split_children() { |
| 4218 | if (_split_children != NULL__null && _split_children->length() > 0) { |
| 4219 | assert(is_split_parent(), "only split parents can have children")do { if (!(is_split_parent())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4219, "assert(" "is_split_parent()" ") failed", "only split parents can have children" ); ::breakpoint(); } } while (0); |
| 4220 | |
| 4221 | for (int i = 0; i < _split_children->length(); i++) { |
| 4222 | Interval* i1 = _split_children->at(i); |
| 4223 | |
| 4224 | assert(i1->split_parent() == this, "not a split child of this interval")do { if (!(i1->split_parent() == this)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4224, "assert(" "i1->split_parent() == this" ") failed", "not a split child of this interval"); ::breakpoint(); } } while (0); |
| 4225 | assert(i1->type() == type(), "must be equal for all split children")do { if (!(i1->type() == type())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4225, "assert(" "i1->type() == type()" ") failed", "must be equal for all split children" ); ::breakpoint(); } } while (0); |
| 4226 | assert(i1->canonical_spill_slot() == canonical_spill_slot(), "must be equal for all split children")do { if (!(i1->canonical_spill_slot() == canonical_spill_slot ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4226, "assert(" "i1->canonical_spill_slot() == canonical_spill_slot()" ") failed", "must be equal for all split children"); ::breakpoint (); } } while (0); |
| 4227 | |
| 4228 | for (int j = i + 1; j < _split_children->length(); j++) { |
| 4229 | Interval* i2 = _split_children->at(j); |
| 4230 | |
| 4231 | assert(i1->reg_num() != i2->reg_num(), "same register number")do { if (!(i1->reg_num() != i2->reg_num())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4231, "assert(" "i1->reg_num() != i2->reg_num()" ") failed" , "same register number"); ::breakpoint(); } } while (0); |
| 4232 | |
| 4233 | if (i1->from() < i2->from()) { |
| 4234 | assert(i1->to() <= i2->from() && i1->to() < i2->to(), "intervals overlapping")do { if (!(i1->to() <= i2->from() && i1-> to() < i2->to())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4234, "assert(" "i1->to() <= i2->from() && i1->to() < i2->to()" ") failed", "intervals overlapping"); ::breakpoint(); } } while (0); |
| 4235 | } else { |
| 4236 | assert(i2->from() < i1->from(), "intervals start at same op_id")do { if (!(i2->from() < i1->from())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4236, "assert(" "i2->from() < i1->from()" ") failed" , "intervals start at same op_id"); ::breakpoint(); } } while (0); |
| 4237 | assert(i2->to() <= i1->from() && i2->to() < i1->to(), "intervals overlapping")do { if (!(i2->to() <= i1->from() && i2-> to() < i1->to())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4237, "assert(" "i2->to() <= i1->from() && i2->to() < i1->to()" ") failed", "intervals overlapping"); ::breakpoint(); } } while (0); |
| 4238 | } |
| 4239 | } |
| 4240 | } |
| 4241 | } |
| 4242 | } |
| 4243 | #endif // ASSERT |
| 4244 | |
| 4245 | Interval* Interval::register_hint(bool search_split_child) const { |
| 4246 | if (!search_split_child) { |
| 4247 | return _register_hint; |
| 4248 | } |
| 4249 | |
| 4250 | if (_register_hint != NULL__null) { |
| 4251 | assert(_register_hint->is_split_parent(), "ony split parents are valid hint registers")do { if (!(_register_hint->is_split_parent())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4251, "assert(" "_register_hint->is_split_parent()" ") failed" , "ony split parents are valid hint registers"); ::breakpoint (); } } while (0); |
| 4252 | |
| 4253 | if (_register_hint->assigned_reg() >= 0 && _register_hint->assigned_reg() < LinearScan::nof_regs) { |
| 4254 | return _register_hint; |
| 4255 | |
| 4256 | } else if (_register_hint->_split_children != NULL__null && _register_hint->_split_children->length() > 0) { |
| 4257 | // search the first split child that has a register assigned |
| 4258 | int len = _register_hint->_split_children->length(); |
| 4259 | for (int i = 0; i < len; i++) { |
| 4260 | Interval* cur = _register_hint->_split_children->at(i); |
| 4261 | |
| 4262 | if (cur->assigned_reg() >= 0 && cur->assigned_reg() < LinearScan::nof_regs) { |
| 4263 | return cur; |
| 4264 | } |
| 4265 | } |
| 4266 | } |
| 4267 | } |
| 4268 | |
| 4269 | // no hint interval found that has a register assigned |
| 4270 | return NULL__null; |
| 4271 | } |
| 4272 | |
| 4273 | |
| 4274 | Interval* Interval::split_child_at_op_id(int op_id, LIR_OpVisitState::OprMode mode) { |
| 4275 | assert(is_split_parent(), "can only be called for split parents")do { if (!(is_split_parent())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4275, "assert(" "is_split_parent()" ") failed", "can only be called for split parents" ); ::breakpoint(); } } while (0); |
| 4276 | assert(op_id >= 0, "invalid op_id (method can not be called for spill moves)")do { if (!(op_id >= 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4276, "assert(" "op_id >= 0" ") failed", "invalid op_id (method can not be called for spill moves)" ); ::breakpoint(); } } while (0); |
| 4277 | |
| 4278 | Interval* result; |
| 4279 | if (_split_children == NULL__null || _split_children->length() == 0) { |
| 4280 | result = this; |
| 4281 | } else { |
| 4282 | result = NULL__null; |
| 4283 | int len = _split_children->length(); |
| 4284 | |
| 4285 | // in outputMode, the end of the interval (op_id == cur->to()) is not valid |
| 4286 | int to_offset = (mode == LIR_OpVisitState::outputMode ? 0 : 1); |
| 4287 | |
| 4288 | int i; |
| 4289 | for (i = 0; i < len; i++) { |
| 4290 | Interval* cur = _split_children->at(i); |
| 4291 | if (cur->from() <= op_id && op_id < cur->to() + to_offset) { |
| 4292 | if (i > 0) { |
| 4293 | // exchange current split child to start of list (faster access for next call) |
| 4294 | _split_children->at_put(i, _split_children->at(0)); |
| 4295 | _split_children->at_put(0, cur); |
| 4296 | } |
| 4297 | |
| 4298 | // interval found |
| 4299 | result = cur; |
| 4300 | break; |
| 4301 | } |
| 4302 | } |
| 4303 | |
| 4304 | #ifdef ASSERT1 |
| 4305 | for (i = 0; i < len; i++) { |
| 4306 | Interval* tmp = _split_children->at(i); |
| 4307 | if (tmp != result && tmp->from() <= op_id && op_id < tmp->to() + to_offset) { |
| 4308 | tty->print_cr("two valid result intervals found for op_id %d: %d and %d", op_id, result->reg_num(), tmp->reg_num()); |
| 4309 | result->print(); |
| 4310 | tmp->print(); |
| 4311 | assert(false, "two valid result intervals found")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4311, "assert(" "false" ") failed", "two valid result intervals found" ); ::breakpoint(); } } while (0); |
| 4312 | } |
| 4313 | } |
| 4314 | #endif |
| 4315 | } |
| 4316 | |
| 4317 | assert(result != NULL, "no matching interval found")do { if (!(result != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4317, "assert(" "result != __null" ") failed", "no matching interval found" ); ::breakpoint(); } } while (0); |
| 4318 | assert(result->covers(op_id, mode), "op_id not covered by interval")do { if (!(result->covers(op_id, mode))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4318, "assert(" "result->covers(op_id, mode)" ") failed" , "op_id not covered by interval"); ::breakpoint(); } } while (0); |
| 4319 | |
| 4320 | return result; |
| 4321 | } |
| 4322 | |
| 4323 | |
| 4324 | // returns the last split child that ends before the given op_id |
| 4325 | Interval* Interval::split_child_before_op_id(int op_id) { |
| 4326 | assert(op_id >= 0, "invalid op_id")do { if (!(op_id >= 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4326, "assert(" "op_id >= 0" ") failed", "invalid op_id" ); ::breakpoint(); } } while (0); |
| 4327 | |
| 4328 | Interval* parent = split_parent(); |
| 4329 | Interval* result = NULL__null; |
| 4330 | |
| 4331 | assert(parent->_split_children != NULL, "no split children available")do { if (!(parent->_split_children != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4331, "assert(" "parent->_split_children != __null" ") failed" , "no split children available"); ::breakpoint(); } } while ( 0); |
| 4332 | int len = parent->_split_children->length(); |
| 4333 | assert(len > 0, "no split children available")do { if (!(len > 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4333, "assert(" "len > 0" ") failed", "no split children available" ); ::breakpoint(); } } while (0); |
| 4334 | |
| 4335 | for (int i = len - 1; i >= 0; i--) { |
| 4336 | Interval* cur = parent->_split_children->at(i); |
| 4337 | if (cur->to() <= op_id && (result == NULL__null || result->to() < cur->to())) { |
| 4338 | result = cur; |
| 4339 | } |
| 4340 | } |
| 4341 | |
| 4342 | assert(result != NULL, "no split child found")do { if (!(result != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4342, "assert(" "result != __null" ") failed", "no split child found" ); ::breakpoint(); } } while (0); |
| 4343 | return result; |
| 4344 | } |
| 4345 | |
| 4346 | |
| 4347 | // Note: use positions are sorted descending -> first use has highest index |
| 4348 | int Interval::first_usage(IntervalUseKind min_use_kind) const { |
| 4349 | assert(LinearScan::is_virtual_interval(this), "cannot access use positions for fixed intervals")do { if (!(LinearScan::is_virtual_interval(this))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4349, "assert(" "LinearScan::is_virtual_interval(this)" ") failed" , "cannot access use positions for fixed intervals"); ::breakpoint (); } } while (0); |
| 4350 | |
| 4351 | for (int i = _use_pos_and_kinds.length() - 2; i >= 0; i -= 2) { |
| 4352 | if (_use_pos_and_kinds.at(i + 1) >= min_use_kind) { |
| 4353 | return _use_pos_and_kinds.at(i); |
| 4354 | } |
| 4355 | } |
| 4356 | return max_jint; |
| 4357 | } |
| 4358 | |
| 4359 | int Interval::next_usage(IntervalUseKind min_use_kind, int from) const { |
| 4360 | assert(LinearScan::is_virtual_interval(this), "cannot access use positions for fixed intervals")do { if (!(LinearScan::is_virtual_interval(this))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4360, "assert(" "LinearScan::is_virtual_interval(this)" ") failed" , "cannot access use positions for fixed intervals"); ::breakpoint (); } } while (0); |
| 4361 | |
| 4362 | for (int i = _use_pos_and_kinds.length() - 2; i >= 0; i -= 2) { |
| 4363 | if (_use_pos_and_kinds.at(i) >= from && _use_pos_and_kinds.at(i + 1) >= min_use_kind) { |
| 4364 | return _use_pos_and_kinds.at(i); |
| 4365 | } |
| 4366 | } |
| 4367 | return max_jint; |
| 4368 | } |
| 4369 | |
| 4370 | int Interval::next_usage_exact(IntervalUseKind exact_use_kind, int from) const { |
| 4371 | assert(LinearScan::is_virtual_interval(this), "cannot access use positions for fixed intervals")do { if (!(LinearScan::is_virtual_interval(this))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4371, "assert(" "LinearScan::is_virtual_interval(this)" ") failed" , "cannot access use positions for fixed intervals"); ::breakpoint (); } } while (0); |
| 4372 | |
| 4373 | for (int i = _use_pos_and_kinds.length() - 2; i >= 0; i -= 2) { |
| 4374 | if (_use_pos_and_kinds.at(i) >= from && _use_pos_and_kinds.at(i + 1) == exact_use_kind) { |
| 4375 | return _use_pos_and_kinds.at(i); |
| 4376 | } |
| 4377 | } |
| 4378 | return max_jint; |
| 4379 | } |
| 4380 | |
| 4381 | int Interval::previous_usage(IntervalUseKind min_use_kind, int from) const { |
| 4382 | assert(LinearScan::is_virtual_interval(this), "cannot access use positions for fixed intervals")do { if (!(LinearScan::is_virtual_interval(this))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4382, "assert(" "LinearScan::is_virtual_interval(this)" ") failed" , "cannot access use positions for fixed intervals"); ::breakpoint (); } } while (0); |
| 4383 | |
| 4384 | int prev = 0; |
| 4385 | for (int i = _use_pos_and_kinds.length() - 2; i >= 0; i -= 2) { |
| 4386 | if (_use_pos_and_kinds.at(i) > from) { |
| 4387 | return prev; |
| 4388 | } |
| 4389 | if (_use_pos_and_kinds.at(i + 1) >= min_use_kind) { |
| 4390 | prev = _use_pos_and_kinds.at(i); |
| 4391 | } |
| 4392 | } |
| 4393 | return prev; |
| 4394 | } |
| 4395 | |
| 4396 | void Interval::add_use_pos(int pos, IntervalUseKind use_kind) { |
| 4397 | assert(covers(pos, LIR_OpVisitState::inputMode), "use position not covered by live range")do { if (!(covers(pos, LIR_OpVisitState::inputMode))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4397, "assert(" "covers(pos, LIR_OpVisitState::inputMode)" ") failed" , "use position not covered by live range"); ::breakpoint(); } } while (0); |
| 4398 | |
| 4399 | // do not add use positions for precolored intervals because |
| 4400 | // they are never used |
| 4401 | if (use_kind != noUse && reg_num() >= LIR_Opr::vreg_base) { |
| 4402 | #ifdef ASSERT1 |
| 4403 | assert(_use_pos_and_kinds.length() % 2 == 0, "must be")do { if (!(_use_pos_and_kinds.length() % 2 == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4403, "assert(" "_use_pos_and_kinds.length() % 2 == 0" ") failed" , "must be"); ::breakpoint(); } } while (0); |
| 4404 | for (int i = 0; i < _use_pos_and_kinds.length(); i += 2) { |
| 4405 | assert(pos <= _use_pos_and_kinds.at(i), "already added a use-position with lower position")do { if (!(pos <= _use_pos_and_kinds.at(i))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4405, "assert(" "pos <= _use_pos_and_kinds.at(i)" ") failed" , "already added a use-position with lower position"); ::breakpoint (); } } while (0); |
| 4406 | assert(_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind, "invalid use kind")do { if (!(_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4406, "assert(" "_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind" ") failed", "invalid use kind"); ::breakpoint(); } } while ( 0); |
| 4407 | if (i > 0) { |
| 4408 | assert(_use_pos_and_kinds.at(i) < _use_pos_and_kinds.at(i - 2), "not sorted descending")do { if (!(_use_pos_and_kinds.at(i) < _use_pos_and_kinds.at (i - 2))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4408, "assert(" "_use_pos_and_kinds.at(i) < _use_pos_and_kinds.at(i - 2)" ") failed", "not sorted descending"); ::breakpoint(); } } while (0); |
| 4409 | } |
| 4410 | } |
| 4411 | #endif |
| 4412 | |
| 4413 | // Note: add_use is called in descending order, so list gets sorted |
| 4414 | // automatically by just appending new use positions |
| 4415 | int len = _use_pos_and_kinds.length(); |
| 4416 | if (len == 0 || _use_pos_and_kinds.at(len - 2) > pos) { |
| 4417 | _use_pos_and_kinds.append(pos); |
| 4418 | _use_pos_and_kinds.append(use_kind); |
| 4419 | } else if (_use_pos_and_kinds.at(len - 1) < use_kind) { |
| 4420 | assert(_use_pos_and_kinds.at(len - 2) == pos, "list not sorted correctly")do { if (!(_use_pos_and_kinds.at(len - 2) == pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4420, "assert(" "_use_pos_and_kinds.at(len - 2) == pos" ") failed" , "list not sorted correctly"); ::breakpoint(); } } while (0); |
| 4421 | _use_pos_and_kinds.at_put(len - 1, use_kind); |
| 4422 | } |
| 4423 | } |
| 4424 | } |
| 4425 | |
| 4426 | void Interval::add_range(int from, int to) { |
| 4427 | assert(from < to, "invalid range")do { if (!(from < to)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4427, "assert(" "from < to" ") failed", "invalid range") ; ::breakpoint(); } } while (0); |
| 4428 | assert(first() == Range::end() || to < first()->next()->from(), "not inserting at begin of interval")do { if (!(first() == Range::end() || to < first()->next ()->from())) { (*g_assert_poison) = 'X';; report_vm_error( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4428, "assert(" "first() == Range::end() || to < first()->next()->from()" ") failed", "not inserting at begin of interval"); ::breakpoint (); } } while (0); |
| 4429 | assert(from <= first()->to(), "not inserting at begin of interval")do { if (!(from <= first()->to())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4429, "assert(" "from <= first()->to()" ") failed", "not inserting at begin of interval" ); ::breakpoint(); } } while (0); |
| 4430 | |
| 4431 | if (first()->from() <= to) { |
| 4432 | // join intersecting ranges |
| 4433 | first()->set_from(MIN2(from, first()->from())); |
| 4434 | first()->set_to (MAX2(to, first()->to())); |
| 4435 | } else { |
| 4436 | // insert new range |
| 4437 | _first = new Range(from, to, first()); |
| 4438 | } |
| 4439 | } |
| 4440 | |
| 4441 | Interval* Interval::new_split_child() { |
| 4442 | // allocate new interval |
| 4443 | Interval* result = new Interval(-1); |
| 4444 | result->set_type(type()); |
| 4445 | |
| 4446 | Interval* parent = split_parent(); |
| 4447 | result->_split_parent = parent; |
| 4448 | result->set_register_hint(parent); |
| 4449 | |
| 4450 | // insert new interval in children-list of parent |
| 4451 | if (parent->_split_children == NULL__null) { |
| 4452 | assert(is_split_parent(), "list must be initialized at first split")do { if (!(is_split_parent())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4452, "assert(" "is_split_parent()" ") failed", "list must be initialized at first split" ); ::breakpoint(); } } while (0); |
| 4453 | |
| 4454 | parent->_split_children = new IntervalList(4); |
| 4455 | parent->_split_children->append(this); |
| 4456 | } |
| 4457 | parent->_split_children->append(result); |
| 4458 | |
| 4459 | return result; |
| 4460 | } |
| 4461 | |
| 4462 | // split this interval at the specified position and return |
| 4463 | // the remainder as a new interval. |
| 4464 | // |
| 4465 | // when an interval is split, a bi-directional link is established between the original interval |
| 4466 | // (the split parent) and the intervals that are split off this interval (the split children) |
| 4467 | // When a split child is split again, the new created interval is also a direct child |
| 4468 | // of the original parent (there is no tree of split children stored, but a flat list) |
| 4469 | // All split children are spilled to the same stack slot (stored in _canonical_spill_slot) |
| 4470 | // |
| 4471 | // Note: The new interval has no valid reg_num |
| 4472 | Interval* Interval::split(int split_pos) { |
| 4473 | assert(LinearScan::is_virtual_interval(this), "cannot split fixed intervals")do { if (!(LinearScan::is_virtual_interval(this))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4473, "assert(" "LinearScan::is_virtual_interval(this)" ") failed" , "cannot split fixed intervals"); ::breakpoint(); } } while ( 0); |
| 4474 | |
| 4475 | // allocate new interval |
| 4476 | Interval* result = new_split_child(); |
| 4477 | |
| 4478 | // split the ranges |
| 4479 | Range* prev = NULL__null; |
| 4480 | Range* cur = _first; |
| 4481 | while (cur != Range::end() && cur->to() <= split_pos) { |
| 4482 | prev = cur; |
| 4483 | cur = cur->next(); |
| 4484 | } |
| 4485 | assert(cur != Range::end(), "split interval after end of last range")do { if (!(cur != Range::end())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4485, "assert(" "cur != Range::end()" ") failed", "split interval after end of last range" ); ::breakpoint(); } } while (0); |
| 4486 | |
| 4487 | if (cur->from() < split_pos) { |
| 4488 | result->_first = new Range(split_pos, cur->to(), cur->next()); |
| 4489 | cur->set_to(split_pos); |
| 4490 | cur->set_next(Range::end()); |
| 4491 | |
| 4492 | } else { |
| 4493 | assert(prev != NULL, "split before start of first range")do { if (!(prev != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4493, "assert(" "prev != __null" ") failed", "split before start of first range" ); ::breakpoint(); } } while (0); |
| 4494 | result->_first = cur; |
| 4495 | prev->set_next(Range::end()); |
| 4496 | } |
| 4497 | result->_current = result->_first; |
| 4498 | _cached_to = -1; // clear cached value |
| 4499 | |
| 4500 | // split list of use positions |
| 4501 | int total_len = _use_pos_and_kinds.length(); |
| 4502 | int start_idx = total_len - 2; |
| 4503 | while (start_idx >= 0 && _use_pos_and_kinds.at(start_idx) < split_pos) { |
| 4504 | start_idx -= 2; |
| 4505 | } |
| 4506 | |
| 4507 | intStack new_use_pos_and_kinds(total_len - start_idx); |
| 4508 | int i; |
| 4509 | for (i = start_idx + 2; i < total_len; i++) { |
| 4510 | new_use_pos_and_kinds.append(_use_pos_and_kinds.at(i)); |
| 4511 | } |
| 4512 | |
| 4513 | _use_pos_and_kinds.trunc_to(start_idx + 2); |
| 4514 | result->_use_pos_and_kinds = _use_pos_and_kinds; |
| 4515 | _use_pos_and_kinds = new_use_pos_and_kinds; |
| 4516 | |
| 4517 | #ifdef ASSERT1 |
| 4518 | assert(_use_pos_and_kinds.length() % 2 == 0, "must have use kind for each use pos")do { if (!(_use_pos_and_kinds.length() % 2 == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4518, "assert(" "_use_pos_and_kinds.length() % 2 == 0" ") failed" , "must have use kind for each use pos"); ::breakpoint(); } } while (0); |
| 4519 | assert(result->_use_pos_and_kinds.length() % 2 == 0, "must have use kind for each use pos")do { if (!(result->_use_pos_and_kinds.length() % 2 == 0)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4519, "assert(" "result->_use_pos_and_kinds.length() % 2 == 0" ") failed", "must have use kind for each use pos"); ::breakpoint (); } } while (0); |
| 4520 | assert(_use_pos_and_kinds.length() + result->_use_pos_and_kinds.length() == total_len, "missed some entries")do { if (!(_use_pos_and_kinds.length() + result->_use_pos_and_kinds .length() == total_len)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4520, "assert(" "_use_pos_and_kinds.length() + result->_use_pos_and_kinds.length() == total_len" ") failed", "missed some entries"); ::breakpoint(); } } while (0); |
| 4521 | |
| 4522 | for (i = 0; i < _use_pos_and_kinds.length(); i += 2) { |
| 4523 | assert(_use_pos_and_kinds.at(i) < split_pos, "must be")do { if (!(_use_pos_and_kinds.at(i) < split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4523, "assert(" "_use_pos_and_kinds.at(i) < split_pos" ") failed" , "must be"); ::breakpoint(); } } while (0); |
| 4524 | assert(_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind, "invalid use kind")do { if (!(_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4524, "assert(" "_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind" ") failed", "invalid use kind"); ::breakpoint(); } } while ( 0); |
| 4525 | } |
| 4526 | for (i = 0; i < result->_use_pos_and_kinds.length(); i += 2) { |
| 4527 | assert(result->_use_pos_and_kinds.at(i) >= split_pos, "must be")do { if (!(result->_use_pos_and_kinds.at(i) >= split_pos )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4527, "assert(" "result->_use_pos_and_kinds.at(i) >= split_pos" ") failed", "must be"); ::breakpoint(); } } while (0); |
| 4528 | assert(result->_use_pos_and_kinds.at(i + 1) >= firstValidKind && result->_use_pos_and_kinds.at(i + 1) <= lastValidKind, "invalid use kind")do { if (!(result->_use_pos_and_kinds.at(i + 1) >= firstValidKind && result->_use_pos_and_kinds.at(i + 1) <= lastValidKind )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4528, "assert(" "result->_use_pos_and_kinds.at(i + 1) >= firstValidKind && result->_use_pos_and_kinds.at(i + 1) <= lastValidKind" ") failed", "invalid use kind"); ::breakpoint(); } } while ( 0); |
| 4529 | } |
| 4530 | #endif |
| 4531 | |
| 4532 | return result; |
| 4533 | } |
| 4534 | |
| 4535 | // split this interval at the specified position and return |
| 4536 | // the head as a new interval (the original interval is the tail) |
| 4537 | // |
| 4538 | // Currently, only the first range can be split, and the new interval |
| 4539 | // must not have split positions |
| 4540 | Interval* Interval::split_from_start(int split_pos) { |
| 4541 | assert(LinearScan::is_virtual_interval(this), "cannot split fixed intervals")do { if (!(LinearScan::is_virtual_interval(this))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4541, "assert(" "LinearScan::is_virtual_interval(this)" ") failed" , "cannot split fixed intervals"); ::breakpoint(); } } while ( 0); |
| 4542 | assert(split_pos > from() && split_pos < to(), "can only split inside interval")do { if (!(split_pos > from() && split_pos < to ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4542, "assert(" "split_pos > from() && split_pos < to()" ") failed", "can only split inside interval"); ::breakpoint( ); } } while (0); |
| 4543 | assert(split_pos > _first->from() && split_pos <= _first->to(), "can only split inside first range")do { if (!(split_pos > _first->from() && split_pos <= _first->to())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4543, "assert(" "split_pos > _first->from() && split_pos <= _first->to()" ") failed", "can only split inside first range"); ::breakpoint (); } } while (0); |
| 4544 | assert(first_usage(noUse) > split_pos, "can not split when use positions are present")do { if (!(first_usage(noUse) > split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4544, "assert(" "first_usage(noUse) > split_pos" ") failed" , "can not split when use positions are present"); ::breakpoint (); } } while (0); |
| 4545 | |
| 4546 | // allocate new interval |
| 4547 | Interval* result = new_split_child(); |
| 4548 | |
| 4549 | // the new created interval has only one range (checked by assertion above), |
| 4550 | // so the splitting of the ranges is very simple |
| 4551 | result->add_range(_first->from(), split_pos); |
| 4552 | |
| 4553 | if (split_pos == _first->to()) { |
| 4554 | assert(_first->next() != Range::end(), "must not be at end")do { if (!(_first->next() != Range::end())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4554, "assert(" "_first->next() != Range::end()" ") failed" , "must not be at end"); ::breakpoint(); } } while (0); |
| 4555 | _first = _first->next(); |
| 4556 | } else { |
| 4557 | _first->set_from(split_pos); |
| 4558 | } |
| 4559 | |
| 4560 | return result; |
| 4561 | } |
| 4562 | |
| 4563 | |
| 4564 | // returns true if the op_id is inside the interval |
| 4565 | bool Interval::covers(int op_id, LIR_OpVisitState::OprMode mode) const { |
| 4566 | Range* cur = _first; |
| 4567 | |
| 4568 | while (cur != Range::end() && cur->to() < op_id) { |
| 4569 | cur = cur->next(); |
| 4570 | } |
| 4571 | if (cur != Range::end()) { |
| 4572 | assert(cur->to() != cur->next()->from(), "ranges not separated")do { if (!(cur->to() != cur->next()->from())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4572, "assert(" "cur->to() != cur->next()->from()" ") failed", "ranges not separated"); ::breakpoint(); } } while (0); |
| 4573 | |
| 4574 | if (mode == LIR_OpVisitState::outputMode) { |
| 4575 | return cur->from() <= op_id && op_id < cur->to(); |
| 4576 | } else { |
| 4577 | return cur->from() <= op_id && op_id <= cur->to(); |
| 4578 | } |
| 4579 | } |
| 4580 | return false; |
| 4581 | } |
| 4582 | |
| 4583 | // returns true if the interval has any hole between hole_from and hole_to |
| 4584 | // (even if the hole has only the length 1) |
| 4585 | bool Interval::has_hole_between(int hole_from, int hole_to) { |
| 4586 | assert(hole_from < hole_to, "check")do { if (!(hole_from < hole_to)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4586, "assert(" "hole_from < hole_to" ") failed", "check" ); ::breakpoint(); } } while (0); |
| 4587 | assert(from() <= hole_from && hole_to <= to(), "index out of interval")do { if (!(from() <= hole_from && hole_to <= to ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4587, "assert(" "from() <= hole_from && hole_to <= to()" ") failed", "index out of interval"); ::breakpoint(); } } while (0); |
| 4588 | |
| 4589 | Range* cur = _first; |
| 4590 | while (cur != Range::end()) { |
| 4591 | assert(cur->to() < cur->next()->from(), "no space between ranges")do { if (!(cur->to() < cur->next()->from())) { (* g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4591, "assert(" "cur->to() < cur->next()->from()" ") failed", "no space between ranges"); ::breakpoint(); } } while (0); |
| 4592 | |
| 4593 | // hole-range starts before this range -> hole |
| 4594 | if (hole_from < cur->from()) { |
| 4595 | return true; |
| 4596 | |
| 4597 | // hole-range completely inside this range -> no hole |
| 4598 | } else if (hole_to <= cur->to()) { |
| 4599 | return false; |
| 4600 | |
| 4601 | // overlapping of hole-range with this range -> hole |
| 4602 | } else if (hole_from <= cur->to()) { |
| 4603 | return true; |
| 4604 | } |
| 4605 | |
| 4606 | cur = cur->next(); |
| 4607 | } |
| 4608 | |
| 4609 | return false; |
| 4610 | } |
| 4611 | |
| 4612 | // Check if there is an intersection with any of the split children of 'interval' |
| 4613 | bool Interval::intersects_any_children_of(Interval* interval) const { |
| 4614 | if (interval->_split_children != NULL__null) { |
| 4615 | for (int i = 0; i < interval->_split_children->length(); i++) { |
| 4616 | if (intersects(interval->_split_children->at(i))) { |
| 4617 | return true; |
| 4618 | } |
| 4619 | } |
| 4620 | } |
| 4621 | return false; |
| 4622 | } |
| 4623 | |
| 4624 | |
| 4625 | #ifndef PRODUCT |
| 4626 | void Interval::print_on(outputStream* out, bool is_cfg_printer) const { |
| 4627 | const char* SpillState2Name[] = { "no definition", "no spill store", "one spill store", "store at definition", "start in memory", "no optimization" }; |
| 4628 | const char* UseKind2Name[] = { "N", "L", "S", "M" }; |
| 4629 | |
| 4630 | const char* type_name; |
| 4631 | if (reg_num() < LIR_Opr::vreg_base) { |
| 4632 | type_name = "fixed"; |
| 4633 | } else { |
| 4634 | type_name = type2name(type()); |
| 4635 | } |
| 4636 | out->print("%d %s ", reg_num(), type_name); |
| 4637 | |
| 4638 | if (is_cfg_printer) { |
| 4639 | // Special version for compatibility with C1 Visualizer. |
| 4640 | LIR_Opr opr = LinearScan::get_operand(reg_num()); |
| 4641 | if (opr->is_valid()) { |
| 4642 | out->print("\""); |
| 4643 | opr->print(out); |
| 4644 | out->print("\" "); |
| 4645 | } |
| 4646 | } else { |
| 4647 | // Improved output for normal debugging. |
| 4648 | if (reg_num() < LIR_Opr::vreg_base) { |
| 4649 | LinearScan::print_reg_num(out, assigned_reg()); |
| 4650 | } else if (assigned_reg() != -1 && (LinearScan::num_physical_regs(type()) == 1 || assigned_regHi() != -1)) { |
| 4651 | LinearScan::calc_operand_for_interval(this)->print(out); |
| 4652 | } else { |
| 4653 | // Virtual register that has no assigned register yet. |
| 4654 | out->print("[ANY]"); |
| 4655 | } |
| 4656 | out->print(" "); |
| 4657 | } |
| 4658 | out->print("%d %d ", split_parent()->reg_num(), (register_hint(false) != NULL__null ? register_hint(false)->reg_num() : -1)); |
| 4659 | |
| 4660 | // print ranges |
| 4661 | Range* cur = _first; |
| 4662 | while (cur != Range::end()) { |
| 4663 | cur->print(out); |
| 4664 | cur = cur->next(); |
| 4665 | assert(cur != NULL, "range list not closed with range sentinel")do { if (!(cur != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4665, "assert(" "cur != __null" ") failed", "range list not closed with range sentinel" ); ::breakpoint(); } } while (0); |
| 4666 | } |
| 4667 | |
| 4668 | // print use positions |
| 4669 | int prev = 0; |
| 4670 | assert(_use_pos_and_kinds.length() % 2 == 0, "must be")do { if (!(_use_pos_and_kinds.length() % 2 == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4670, "assert(" "_use_pos_and_kinds.length() % 2 == 0" ") failed" , "must be"); ::breakpoint(); } } while (0); |
| 4671 | for (int i =_use_pos_and_kinds.length() - 2; i >= 0; i -= 2) { |
| 4672 | assert(_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind, "invalid use kind")do { if (!(_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4672, "assert(" "_use_pos_and_kinds.at(i + 1) >= firstValidKind && _use_pos_and_kinds.at(i + 1) <= lastValidKind" ") failed", "invalid use kind"); ::breakpoint(); } } while ( 0); |
| 4673 | assert(prev < _use_pos_and_kinds.at(i), "use positions not sorted")do { if (!(prev < _use_pos_and_kinds.at(i))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4673, "assert(" "prev < _use_pos_and_kinds.at(i)" ") failed" , "use positions not sorted"); ::breakpoint(); } } while (0); |
| 4674 | |
| 4675 | out->print("%d %s ", _use_pos_and_kinds.at(i), UseKind2Name[_use_pos_and_kinds.at(i + 1)]); |
| 4676 | prev = _use_pos_and_kinds.at(i); |
| 4677 | } |
| 4678 | |
| 4679 | out->print(" \"%s\"", SpillState2Name[spill_state()]); |
| 4680 | out->cr(); |
| 4681 | } |
| 4682 | |
| 4683 | void Interval::print_parent() const { |
| 4684 | if (_split_parent != this) { |
| 4685 | _split_parent->print_on(tty); |
| 4686 | } else { |
| 4687 | tty->print_cr("Parent: this"); |
| 4688 | } |
| 4689 | } |
| 4690 | |
| 4691 | void Interval::print_children() const { |
| 4692 | if (_split_children == NULL__null) { |
| 4693 | tty->print_cr("Children: []"); |
| 4694 | } else { |
| 4695 | tty->print_cr("Children:"); |
| 4696 | for (int i = 0; i < _split_children->length(); i++) { |
| 4697 | tty->print("%d: ", i); |
| 4698 | _split_children->at(i)->print_on(tty); |
| 4699 | } |
| 4700 | } |
| 4701 | } |
| 4702 | #endif // NOT PRODUCT |
| 4703 | |
| 4704 | |
| 4705 | |
| 4706 | |
| 4707 | // **** Implementation of IntervalWalker **************************** |
| 4708 | |
| 4709 | IntervalWalker::IntervalWalker(LinearScan* allocator, Interval* unhandled_fixed_first, Interval* unhandled_any_first) |
| 4710 | : _compilation(allocator->compilation()) |
| 4711 | , _allocator(allocator) |
| 4712 | { |
| 4713 | _unhandled_first[fixedKind] = unhandled_fixed_first; |
| 4714 | _unhandled_first[anyKind] = unhandled_any_first; |
| 4715 | _active_first[fixedKind] = Interval::end(); |
| 4716 | _inactive_first[fixedKind] = Interval::end(); |
| 4717 | _active_first[anyKind] = Interval::end(); |
| 4718 | _inactive_first[anyKind] = Interval::end(); |
| 4719 | _current_position = -1; |
| 4720 | _current = NULL__null; |
| 4721 | next_interval(); |
| 4722 | } |
| 4723 | |
| 4724 | |
| 4725 | // append interval in order of current range from() |
| 4726 | void IntervalWalker::append_sorted(Interval** list, Interval* interval) { |
| 4727 | Interval* prev = NULL__null; |
| 4728 | Interval* cur = *list; |
| 4729 | while (cur->current_from() < interval->current_from()) { |
| 4730 | prev = cur; cur = cur->next(); |
| 4731 | } |
| 4732 | if (prev == NULL__null) { |
| 4733 | *list = interval; |
| 4734 | } else { |
| 4735 | prev->set_next(interval); |
| 4736 | } |
| 4737 | interval->set_next(cur); |
| 4738 | } |
| 4739 | |
| 4740 | void IntervalWalker::append_to_unhandled(Interval** list, Interval* interval) { |
| 4741 | assert(interval->from() >= current()->current_from(), "cannot append new interval before current walk position")do { if (!(interval->from() >= current()->current_from ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4741, "assert(" "interval->from() >= current()->current_from()" ") failed", "cannot append new interval before current walk position" ); ::breakpoint(); } } while (0); |
| 4742 | |
| 4743 | Interval* prev = NULL__null; |
| 4744 | Interval* cur = *list; |
| 4745 | while (cur->from() < interval->from() || (cur->from() == interval->from() && cur->first_usage(noUse) < interval->first_usage(noUse))) { |
| 4746 | prev = cur; cur = cur->next(); |
| 4747 | } |
| 4748 | if (prev == NULL__null) { |
| 4749 | *list = interval; |
| 4750 | } else { |
| 4751 | prev->set_next(interval); |
| 4752 | } |
| 4753 | interval->set_next(cur); |
| 4754 | } |
| 4755 | |
| 4756 | |
| 4757 | inline bool IntervalWalker::remove_from_list(Interval** list, Interval* i) { |
| 4758 | while (*list != Interval::end() && *list != i) { |
| 4759 | list = (*list)->next_addr(); |
| 4760 | } |
| 4761 | if (*list != Interval::end()) { |
| 4762 | assert(*list == i, "check")do { if (!(*list == i)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4762, "assert(" "*list == i" ") failed", "check"); ::breakpoint (); } } while (0); |
| 4763 | *list = (*list)->next(); |
| 4764 | return true; |
| 4765 | } else { |
| 4766 | return false; |
| 4767 | } |
| 4768 | } |
| 4769 | |
| 4770 | void IntervalWalker::remove_from_list(Interval* i) { |
| 4771 | bool deleted; |
| 4772 | |
| 4773 | if (i->state() == activeState) { |
| 4774 | deleted = remove_from_list(active_first_addr(anyKind), i); |
| 4775 | } else { |
| 4776 | assert(i->state() == inactiveState, "invalid state")do { if (!(i->state() == inactiveState)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4776, "assert(" "i->state() == inactiveState" ") failed" , "invalid state"); ::breakpoint(); } } while (0); |
| 4777 | deleted = remove_from_list(inactive_first_addr(anyKind), i); |
| 4778 | } |
| 4779 | |
| 4780 | assert(deleted, "interval has not been found in list")do { if (!(deleted)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4780, "assert(" "deleted" ") failed", "interval has not been found in list" ); ::breakpoint(); } } while (0); |
| 4781 | } |
| 4782 | |
| 4783 | |
| 4784 | void IntervalWalker::walk_to(IntervalState state, int from) { |
| 4785 | assert (state == activeState || state == inactiveState, "wrong state")do { if (!(state == activeState || state == inactiveState)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4785, "assert(" "state == activeState || state == inactiveState" ") failed", "wrong state"); ::breakpoint(); } } while (0); |
| 4786 | for_each_interval_kind(kind)for (IntervalKind kind = firstKind; kind < nofKinds; kind = (IntervalKind)(kind + 1)) { |
| 4787 | Interval** prev = state == activeState ? active_first_addr(kind) : inactive_first_addr(kind); |
| 4788 | Interval* next = *prev; |
| 4789 | while (next->current_from() <= from) { |
| 4790 | Interval* cur = next; |
| 4791 | next = cur->next(); |
| 4792 | |
| 4793 | bool range_has_changed = false; |
| 4794 | while (cur->current_to() <= from) { |
| 4795 | cur->next_range(); |
| 4796 | range_has_changed = true; |
| 4797 | } |
| 4798 | |
| 4799 | // also handle move from inactive list to active list |
| 4800 | range_has_changed = range_has_changed || (state == inactiveState && cur->current_from() <= from); |
| 4801 | |
| 4802 | if (range_has_changed) { |
| 4803 | // remove cur from list |
| 4804 | *prev = next; |
| 4805 | if (cur->current_at_end()) { |
| 4806 | // move to handled state (not maintained as a list) |
| 4807 | cur->set_state(handledState); |
| 4808 | DEBUG_ONLY(interval_moved(cur, kind, state, handledState);)interval_moved(cur, kind, state, handledState); |
| 4809 | } else if (cur->current_from() <= from){ |
| 4810 | // sort into active list |
| 4811 | append_sorted(active_first_addr(kind), cur); |
| 4812 | cur->set_state(activeState); |
| 4813 | if (*prev == cur) { |
| 4814 | assert(state == activeState, "check")do { if (!(state == activeState)) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4814, "assert(" "state == activeState" ") failed", "check") ; ::breakpoint(); } } while (0); |
| 4815 | prev = cur->next_addr(); |
| 4816 | } |
| 4817 | DEBUG_ONLY(interval_moved(cur, kind, state, activeState);)interval_moved(cur, kind, state, activeState); |
| 4818 | } else { |
| 4819 | // sort into inactive list |
| 4820 | append_sorted(inactive_first_addr(kind), cur); |
| 4821 | cur->set_state(inactiveState); |
| 4822 | if (*prev == cur) { |
| 4823 | assert(state == inactiveState, "check")do { if (!(state == inactiveState)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4823, "assert(" "state == inactiveState" ") failed", "check" ); ::breakpoint(); } } while (0); |
| 4824 | prev = cur->next_addr(); |
| 4825 | } |
| 4826 | DEBUG_ONLY(interval_moved(cur, kind, state, inactiveState);)interval_moved(cur, kind, state, inactiveState); |
| 4827 | } |
| 4828 | } else { |
| 4829 | prev = cur->next_addr(); |
| 4830 | continue; |
| 4831 | } |
| 4832 | } |
| 4833 | } |
| 4834 | } |
| 4835 | |
| 4836 | |
| 4837 | void IntervalWalker::next_interval() { |
| 4838 | IntervalKind kind; |
| 4839 | Interval* any = _unhandled_first[anyKind]; |
| 4840 | Interval* fixed = _unhandled_first[fixedKind]; |
| 4841 | |
| 4842 | if (any != Interval::end()) { |
| 4843 | // intervals may start at same position -> prefer fixed interval |
| 4844 | kind = fixed != Interval::end() && fixed->from() <= any->from() ? fixedKind : anyKind; |
| 4845 | |
| 4846 | assert (kind == fixedKind && fixed->from() <= any->from() ||do { if (!(kind == fixedKind && fixed->from() <= any->from() || kind == anyKind && any->from() <= fixed->from())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4847, "assert(" "kind == fixedKind && fixed->from() <= any->from() || kind == anyKind && any->from() <= fixed->from()" ") failed", "wrong interval!!!"); ::breakpoint(); } } while ( 0) |
| 4847 | kind == anyKind && any->from() <= fixed->from(), "wrong interval!!!")do { if (!(kind == fixedKind && fixed->from() <= any->from() || kind == anyKind && any->from() <= fixed->from())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4847, "assert(" "kind == fixedKind && fixed->from() <= any->from() || kind == anyKind && any->from() <= fixed->from()" ") failed", "wrong interval!!!"); ::breakpoint(); } } while ( 0); |
| 4848 | assert(any == Interval::end() || fixed == Interval::end() || any->from() != fixed->from() || kind == fixedKind, "if fixed and any-Interval start at same position, fixed must be processed first")do { if (!(any == Interval::end() || fixed == Interval::end() || any->from() != fixed->from() || kind == fixedKind)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4848, "assert(" "any == Interval::end() || fixed == Interval::end() || any->from() != fixed->from() || kind == fixedKind" ") failed", "if fixed and any-Interval start at same position, fixed must be processed first" ); ::breakpoint(); } } while (0); |
| 4849 | |
| 4850 | } else if (fixed != Interval::end()) { |
| 4851 | kind = fixedKind; |
| 4852 | } else { |
| 4853 | _current = NULL__null; return; |
| 4854 | } |
| 4855 | _current_kind = kind; |
| 4856 | _current = _unhandled_first[kind]; |
| 4857 | _unhandled_first[kind] = _current->next(); |
| 4858 | _current->set_next(Interval::end()); |
| 4859 | _current->rewind_range(); |
| 4860 | } |
| 4861 | |
| 4862 | |
| 4863 | void IntervalWalker::walk_to(int lir_op_id) { |
| 4864 | assert(_current_position <= lir_op_id, "can not walk backwards")do { if (!(_current_position <= lir_op_id)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4864, "assert(" "_current_position <= lir_op_id" ") failed" , "can not walk backwards"); ::breakpoint(); } } while (0); |
| 4865 | while (current() != NULL__null) { |
| 4866 | bool is_active = current()->from() <= lir_op_id; |
| 4867 | int id = is_active ? current()->from() : lir_op_id; |
| 4868 | |
| 4869 | TRACE_LINEAR_SCAN(2, if (_current_position < id) { tty->cr(); tty->print_cr("walk_to(%d) **************************************************************", id); })if (TraceLinearScanLevel >= 2) { if (_current_position < id) { tty->cr(); tty->print_cr("walk_to(%d) **************************************************************" , id); }; } |
| 4870 | |
| 4871 | // set _current_position prior to call of walk_to |
| 4872 | _current_position = id; |
| 4873 | |
| 4874 | // call walk_to even if _current_position == id |
| 4875 | walk_to(activeState, id); |
| 4876 | walk_to(inactiveState, id); |
| 4877 | |
| 4878 | if (is_active) { |
| 4879 | current()->set_state(activeState); |
| 4880 | if (activate_current()) { |
| 4881 | append_sorted(active_first_addr(current_kind()), current()); |
| 4882 | DEBUG_ONLY(interval_moved(current(), current_kind(), unhandledState, activeState);)interval_moved(current(), current_kind(), unhandledState, activeState ); |
| 4883 | } |
| 4884 | |
| 4885 | next_interval(); |
| 4886 | } else { |
| 4887 | return; |
| 4888 | } |
| 4889 | } |
| 4890 | } |
| 4891 | |
| 4892 | #ifdef ASSERT1 |
| 4893 | void IntervalWalker::interval_moved(Interval* interval, IntervalKind kind, IntervalState from, IntervalState to) { |
| 4894 | if (TraceLinearScanLevel >= 4) { |
| 4895 | #define print_state(state) \ |
| 4896 | switch(state) {\ |
| 4897 | case unhandledState: tty->print("unhandled"); break;\ |
| 4898 | case activeState: tty->print("active"); break;\ |
| 4899 | case inactiveState: tty->print("inactive"); break;\ |
| 4900 | case handledState: tty->print("handled"); break;\ |
| 4901 | default: ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4901); ::breakpoint(); } while (0); \ |
| 4902 | } |
| 4903 | |
| 4904 | print_state(from); tty->print(" to "); print_state(to); |
| 4905 | tty->fill_to(23); |
| 4906 | interval->print(); |
| 4907 | |
| 4908 | #undef print_state |
| 4909 | } |
| 4910 | } |
| 4911 | #endif // ASSERT |
| 4912 | |
| 4913 | // **** Implementation of LinearScanWalker ************************** |
| 4914 | |
| 4915 | LinearScanWalker::LinearScanWalker(LinearScan* allocator, Interval* unhandled_fixed_first, Interval* unhandled_any_first) |
| 4916 | : IntervalWalker(allocator, unhandled_fixed_first, unhandled_any_first) |
| 4917 | , _move_resolver(allocator) |
| 4918 | { |
| 4919 | for (int i = 0; i < LinearScan::nof_regs; i++) { |
| 4920 | _spill_intervals[i] = new IntervalList(2); |
| 4921 | } |
| 4922 | } |
| 4923 | |
| 4924 | |
| 4925 | inline void LinearScanWalker::init_use_lists(bool only_process_use_pos) { |
| 4926 | for (int i = _first_reg; i <= _last_reg; i++) { |
| 4927 | _use_pos[i] = max_jint; |
| 4928 | |
| 4929 | if (!only_process_use_pos) { |
| 4930 | _block_pos[i] = max_jint; |
| 4931 | _spill_intervals[i]->clear(); |
| 4932 | } |
| 4933 | } |
| 4934 | } |
| 4935 | |
| 4936 | inline void LinearScanWalker::exclude_from_use(int reg) { |
| 4937 | assert(reg < LinearScan::nof_regs, "interval must have a register assigned (stack slots not allowed)")do { if (!(reg < LinearScan::nof_regs)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4937, "assert(" "reg < LinearScan::nof_regs" ") failed", "interval must have a register assigned (stack slots not allowed)" ); ::breakpoint(); } } while (0); |
| 4938 | if (reg >= _first_reg && reg <= _last_reg) { |
| 4939 | _use_pos[reg] = 0; |
| 4940 | } |
| 4941 | } |
| 4942 | inline void LinearScanWalker::exclude_from_use(Interval* i) { |
| 4943 | assert(i->assigned_reg() != any_reg, "interval has no register assigned")do { if (!(i->assigned_reg() != any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4943, "assert(" "i->assigned_reg() != any_reg" ") failed" , "interval has no register assigned"); ::breakpoint(); } } while (0); |
| 4944 | |
| 4945 | exclude_from_use(i->assigned_reg()); |
| 4946 | exclude_from_use(i->assigned_regHi()); |
| 4947 | } |
| 4948 | |
| 4949 | inline void LinearScanWalker::set_use_pos(int reg, Interval* i, int use_pos, bool only_process_use_pos) { |
| 4950 | assert(use_pos != 0, "must use exclude_from_use to set use_pos to 0")do { if (!(use_pos != 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4950, "assert(" "use_pos != 0" ") failed", "must use exclude_from_use to set use_pos to 0" ); ::breakpoint(); } } while (0); |
| 4951 | |
| 4952 | if (reg >= _first_reg && reg <= _last_reg) { |
| 4953 | if (_use_pos[reg] > use_pos) { |
| 4954 | _use_pos[reg] = use_pos; |
| 4955 | } |
| 4956 | if (!only_process_use_pos) { |
| 4957 | _spill_intervals[reg]->append(i); |
| 4958 | } |
| 4959 | } |
| 4960 | } |
| 4961 | inline void LinearScanWalker::set_use_pos(Interval* i, int use_pos, bool only_process_use_pos) { |
| 4962 | assert(i->assigned_reg() != any_reg, "interval has no register assigned")do { if (!(i->assigned_reg() != any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4962, "assert(" "i->assigned_reg() != any_reg" ") failed" , "interval has no register assigned"); ::breakpoint(); } } while (0); |
| 4963 | if (use_pos != -1) { |
| 4964 | set_use_pos(i->assigned_reg(), i, use_pos, only_process_use_pos); |
| 4965 | set_use_pos(i->assigned_regHi(), i, use_pos, only_process_use_pos); |
| 4966 | } |
| 4967 | } |
| 4968 | |
| 4969 | inline void LinearScanWalker::set_block_pos(int reg, Interval* i, int block_pos) { |
| 4970 | if (reg >= _first_reg && reg <= _last_reg) { |
| 4971 | if (_block_pos[reg] > block_pos) { |
| 4972 | _block_pos[reg] = block_pos; |
| 4973 | } |
| 4974 | if (_use_pos[reg] > block_pos) { |
| 4975 | _use_pos[reg] = block_pos; |
| 4976 | } |
| 4977 | } |
| 4978 | } |
| 4979 | inline void LinearScanWalker::set_block_pos(Interval* i, int block_pos) { |
| 4980 | assert(i->assigned_reg() != any_reg, "interval has no register assigned")do { if (!(i->assigned_reg() != any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4980, "assert(" "i->assigned_reg() != any_reg" ") failed" , "interval has no register assigned"); ::breakpoint(); } } while (0); |
| 4981 | if (block_pos != -1) { |
| 4982 | set_block_pos(i->assigned_reg(), i, block_pos); |
| 4983 | set_block_pos(i->assigned_regHi(), i, block_pos); |
| 4984 | } |
| 4985 | } |
| 4986 | |
| 4987 | |
| 4988 | void LinearScanWalker::free_exclude_active_fixed() { |
| 4989 | Interval* list = active_first(fixedKind); |
| 4990 | while (list != Interval::end()) { |
| 4991 | assert(list->assigned_reg() < LinearScan::nof_regs, "active interval must have a register assigned")do { if (!(list->assigned_reg() < LinearScan::nof_regs) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 4991, "assert(" "list->assigned_reg() < LinearScan::nof_regs" ") failed", "active interval must have a register assigned") ; ::breakpoint(); } } while (0); |
| 4992 | exclude_from_use(list); |
| 4993 | list = list->next(); |
| 4994 | } |
| 4995 | } |
| 4996 | |
| 4997 | void LinearScanWalker::free_exclude_active_any() { |
| 4998 | Interval* list = active_first(anyKind); |
| 4999 | while (list != Interval::end()) { |
| 5000 | exclude_from_use(list); |
| 5001 | list = list->next(); |
| 5002 | } |
| 5003 | } |
| 5004 | |
| 5005 | void LinearScanWalker::free_collect_inactive_fixed(Interval* cur) { |
| 5006 | Interval* list = inactive_first(fixedKind); |
| 5007 | while (list != Interval::end()) { |
| 5008 | if (cur->to() <= list->current_from()) { |
| 5009 | assert(list->current_intersects_at(cur) == -1, "must not intersect")do { if (!(list->current_intersects_at(cur) == -1)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5009, "assert(" "list->current_intersects_at(cur) == -1" ") failed", "must not intersect"); ::breakpoint(); } } while (0); |
| 5010 | set_use_pos(list, list->current_from(), true); |
| 5011 | } else { |
| 5012 | set_use_pos(list, list->current_intersects_at(cur), true); |
| 5013 | } |
| 5014 | list = list->next(); |
| 5015 | } |
| 5016 | } |
| 5017 | |
| 5018 | void LinearScanWalker::free_collect_inactive_any(Interval* cur) { |
| 5019 | Interval* list = inactive_first(anyKind); |
| 5020 | while (list != Interval::end()) { |
| 5021 | set_use_pos(list, list->current_intersects_at(cur), true); |
| 5022 | list = list->next(); |
| 5023 | } |
| 5024 | } |
| 5025 | |
| 5026 | void LinearScanWalker::spill_exclude_active_fixed() { |
| 5027 | Interval* list = active_first(fixedKind); |
| 5028 | while (list != Interval::end()) { |
| 5029 | exclude_from_use(list); |
| 5030 | list = list->next(); |
| 5031 | } |
| 5032 | } |
| 5033 | |
| 5034 | void LinearScanWalker::spill_block_inactive_fixed(Interval* cur) { |
| 5035 | Interval* list = inactive_first(fixedKind); |
| 5036 | while (list != Interval::end()) { |
| 5037 | if (cur->to() > list->current_from()) { |
| 5038 | set_block_pos(list, list->current_intersects_at(cur)); |
| 5039 | } else { |
| 5040 | assert(list->current_intersects_at(cur) == -1, "invalid optimization: intervals intersect")do { if (!(list->current_intersects_at(cur) == -1)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5040, "assert(" "list->current_intersects_at(cur) == -1" ") failed", "invalid optimization: intervals intersect"); :: breakpoint(); } } while (0); |
| 5041 | } |
| 5042 | |
| 5043 | list = list->next(); |
| 5044 | } |
| 5045 | } |
| 5046 | |
| 5047 | void LinearScanWalker::spill_collect_active_any() { |
| 5048 | Interval* list = active_first(anyKind); |
| 5049 | while (list != Interval::end()) { |
| 5050 | set_use_pos(list, MIN2(list->next_usage(loopEndMarker, _current_position), list->to()), false); |
| 5051 | list = list->next(); |
| 5052 | } |
| 5053 | } |
| 5054 | |
| 5055 | void LinearScanWalker::spill_collect_inactive_any(Interval* cur) { |
| 5056 | Interval* list = inactive_first(anyKind); |
| 5057 | while (list != Interval::end()) { |
| 5058 | if (list->current_intersects(cur)) { |
| 5059 | set_use_pos(list, MIN2(list->next_usage(loopEndMarker, _current_position), list->to()), false); |
| 5060 | } |
| 5061 | list = list->next(); |
| 5062 | } |
| 5063 | } |
| 5064 | |
| 5065 | |
| 5066 | void LinearScanWalker::insert_move(int op_id, Interval* src_it, Interval* dst_it) { |
| 5067 | // output all moves here. When source and target are equal, the move is |
| 5068 | // optimized away later in assign_reg_nums |
| 5069 | |
| 5070 | op_id = (op_id + 1) & ~1; |
| 5071 | BlockBegin* op_block = allocator()->block_of_op_with_id(op_id); |
| 5072 | assert(op_id > 0 && allocator()->block_of_op_with_id(op_id - 2) == op_block, "cannot insert move at block boundary")do { if (!(op_id > 0 && allocator()->block_of_op_with_id (op_id - 2) == op_block)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5072, "assert(" "op_id > 0 && allocator()->block_of_op_with_id(op_id - 2) == op_block" ") failed", "cannot insert move at block boundary"); ::breakpoint (); } } while (0); |
| 5073 | |
| 5074 | // calculate index of instruction inside instruction list of current block |
| 5075 | // the minimal index (for a block with no spill moves) can be calculated because the |
| 5076 | // numbering of instructions is known. |
| 5077 | // When the block already contains spill moves, the index must be increased until the |
| 5078 | // correct index is reached. |
| 5079 | LIR_OpList* list = op_block->lir()->instructions_list(); |
| 5080 | int index = (op_id - list->at(0)->id()) / 2; |
| 5081 | assert(list->at(index)->id() <= op_id, "error in calculation")do { if (!(list->at(index)->id() <= op_id)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5081, "assert(" "list->at(index)->id() <= op_id" ") failed" , "error in calculation"); ::breakpoint(); } } while (0); |
| 5082 | |
| 5083 | while (list->at(index)->id() != op_id) { |
| 5084 | index++; |
| 5085 | assert(0 <= index && index < list->length(), "index out of bounds")do { if (!(0 <= index && index < list->length ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5085, "assert(" "0 <= index && index < list->length()" ") failed", "index out of bounds"); ::breakpoint(); } } while (0); |
| 5086 | } |
| 5087 | assert(1 <= index && index < list->length(), "index out of bounds")do { if (!(1 <= index && index < list->length ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5087, "assert(" "1 <= index && index < list->length()" ") failed", "index out of bounds"); ::breakpoint(); } } while (0); |
| 5088 | assert(list->at(index)->id() == op_id, "error in calculation")do { if (!(list->at(index)->id() == op_id)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5088, "assert(" "list->at(index)->id() == op_id" ") failed" , "error in calculation"); ::breakpoint(); } } while (0); |
| 5089 | |
| 5090 | // insert new instruction before instruction at position index |
| 5091 | _move_resolver.move_insert_position(op_block->lir(), index - 1); |
| 5092 | _move_resolver.add_mapping(src_it, dst_it); |
| 5093 | } |
| 5094 | |
| 5095 | |
| 5096 | int LinearScanWalker::find_optimal_split_pos(BlockBegin* min_block, BlockBegin* max_block, int max_split_pos) { |
| 5097 | int from_block_nr = min_block->linear_scan_number(); |
| 5098 | int to_block_nr = max_block->linear_scan_number(); |
| 5099 | |
| 5100 | assert(0 <= from_block_nr && from_block_nr < block_count(), "out of range")do { if (!(0 <= from_block_nr && from_block_nr < block_count())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5100, "assert(" "0 <= from_block_nr && from_block_nr < block_count()" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 5101 | assert(0 <= to_block_nr && to_block_nr < block_count(), "out of range")do { if (!(0 <= to_block_nr && to_block_nr < block_count ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5101, "assert(" "0 <= to_block_nr && to_block_nr < block_count()" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 5102 | assert(from_block_nr < to_block_nr, "must cross block boundary")do { if (!(from_block_nr < to_block_nr)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5102, "assert(" "from_block_nr < to_block_nr" ") failed" , "must cross block boundary"); ::breakpoint(); } } while (0); |
| 5103 | |
| 5104 | // Try to split at end of max_block. If this would be after |
| 5105 | // max_split_pos, then use the begin of max_block |
| 5106 | int optimal_split_pos = max_block->last_lir_instruction_id() + 2; |
| 5107 | if (optimal_split_pos > max_split_pos) { |
| 5108 | optimal_split_pos = max_block->first_lir_instruction_id(); |
| 5109 | } |
| 5110 | |
| 5111 | int min_loop_depth = max_block->loop_depth(); |
| 5112 | for (int i = to_block_nr - 1; i >= from_block_nr; i--) { |
| 5113 | BlockBegin* cur = block_at(i); |
| 5114 | |
| 5115 | if (cur->loop_depth() < min_loop_depth) { |
| 5116 | // block with lower loop-depth found -> split at the end of this block |
| 5117 | min_loop_depth = cur->loop_depth(); |
| 5118 | optimal_split_pos = cur->last_lir_instruction_id() + 2; |
| 5119 | } |
| 5120 | } |
| 5121 | assert(optimal_split_pos > allocator()->max_lir_op_id() || allocator()->is_block_begin(optimal_split_pos), "algorithm must move split pos to block boundary")do { if (!(optimal_split_pos > allocator()->max_lir_op_id () || allocator()->is_block_begin(optimal_split_pos))) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5121, "assert(" "optimal_split_pos > allocator()->max_lir_op_id() || allocator()->is_block_begin(optimal_split_pos)" ") failed", "algorithm must move split pos to block boundary" ); ::breakpoint(); } } while (0); |
| 5122 | |
| 5123 | return optimal_split_pos; |
| 5124 | } |
| 5125 | |
| 5126 | |
| 5127 | int LinearScanWalker::find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optimization) { |
| 5128 | int optimal_split_pos = -1; |
| 5129 | if (min_split_pos == max_split_pos) { |
| 5130 | // trivial case, no optimization of split position possible |
| 5131 | TRACE_LINEAR_SCAN(4, tty->print_cr(" min-pos and max-pos are equal, no optimization possible"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" min-pos and max-pos are equal, no optimization possible" ); }; |
| 5132 | optimal_split_pos = min_split_pos; |
| 5133 | |
| 5134 | } else { |
| 5135 | assert(min_split_pos < max_split_pos, "must be true then")do { if (!(min_split_pos < max_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5135, "assert(" "min_split_pos < max_split_pos" ") failed" , "must be true then"); ::breakpoint(); } } while (0); |
| 5136 | assert(min_split_pos > 0, "cannot access min_split_pos - 1 otherwise")do { if (!(min_split_pos > 0)) { (*g_assert_poison) = 'X'; ; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5136, "assert(" "min_split_pos > 0" ") failed", "cannot access min_split_pos - 1 otherwise" ); ::breakpoint(); } } while (0); |
| 5137 | |
| 5138 | // reason for using min_split_pos - 1: when the minimal split pos is exactly at the |
| 5139 | // beginning of a block, then min_split_pos is also a possible split position. |
| 5140 | // Use the block before as min_block, because then min_block->last_lir_instruction_id() + 2 == min_split_pos |
| 5141 | BlockBegin* min_block = allocator()->block_of_op_with_id(min_split_pos - 1); |
| 5142 | |
| 5143 | // reason for using max_split_pos - 1: otherwise there would be an assertion failure |
| 5144 | // when an interval ends at the end of the last block of the method |
| 5145 | // (in this case, max_split_pos == allocator()->max_lir_op_id() + 2, and there is no |
| 5146 | // block at this op_id) |
| 5147 | BlockBegin* max_block = allocator()->block_of_op_with_id(max_split_pos - 1); |
| 5148 | |
| 5149 | assert(min_block->linear_scan_number() <= max_block->linear_scan_number(), "invalid order")do { if (!(min_block->linear_scan_number() <= max_block ->linear_scan_number())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5149, "assert(" "min_block->linear_scan_number() <= max_block->linear_scan_number()" ") failed", "invalid order"); ::breakpoint(); } } while (0); |
| 5150 | if (min_block == max_block) { |
| 5151 | // split position cannot be moved to block boundary, so split as late as possible |
| 5152 | TRACE_LINEAR_SCAN(4, tty->print_cr(" cannot move split pos to block boundary because min_pos and max_pos are in same block"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" cannot move split pos to block boundary because min_pos and max_pos are in same block" ); }; |
| 5153 | optimal_split_pos = max_split_pos; |
| 5154 | |
| 5155 | } else if (it->has_hole_between(max_split_pos - 1, max_split_pos) && !allocator()->is_block_begin(max_split_pos)) { |
| 5156 | // Do not move split position if the interval has a hole before max_split_pos. |
| 5157 | // Intervals resulting from Phi-Functions have more than one definition (marked |
| 5158 | // as mustHaveRegister) with a hole before each definition. When the register is needed |
| 5159 | // for the second definition, an earlier reloading is unnecessary. |
| 5160 | TRACE_LINEAR_SCAN(4, tty->print_cr(" interval has hole just before max_split_pos, so splitting at max_split_pos"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" interval has hole just before max_split_pos, so splitting at max_split_pos" ); }; |
| 5161 | optimal_split_pos = max_split_pos; |
| 5162 | |
| 5163 | } else { |
| 5164 | // seach optimal block boundary between min_split_pos and max_split_pos |
| 5165 | TRACE_LINEAR_SCAN(4, tty->print_cr(" moving split pos to optimal block boundary between block B%d and B%d", min_block->block_id(), max_block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" moving split pos to optimal block boundary between block B%d and B%d" , min_block->block_id(), max_block->block_id()); }; |
| 5166 | |
| 5167 | if (do_loop_optimization) { |
| 5168 | // Loop optimization: if a loop-end marker is found between min- and max-position, |
| 5169 | // then split before this loop |
| 5170 | int loop_end_pos = it->next_usage_exact(loopEndMarker, min_block->last_lir_instruction_id() + 2); |
| 5171 | TRACE_LINEAR_SCAN(4, tty->print_cr(" loop optimization: loop end found at pos %d", loop_end_pos))if (TraceLinearScanLevel >= 4) { tty->print_cr(" loop optimization: loop end found at pos %d" , loop_end_pos); }; |
| 5172 | |
| 5173 | assert(loop_end_pos > min_split_pos, "invalid order")do { if (!(loop_end_pos > min_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5173, "assert(" "loop_end_pos > min_split_pos" ") failed" , "invalid order"); ::breakpoint(); } } while (0); |
| 5174 | if (loop_end_pos < max_split_pos) { |
| 5175 | // loop-end marker found between min- and max-position |
| 5176 | // if it is not the end marker for the same loop as the min-position, then move |
| 5177 | // the max-position to this loop block. |
| 5178 | // Desired result: uses tagged as shouldHaveRegister inside a loop cause a reloading |
| 5179 | // of the interval (normally, only mustHaveRegister causes a reloading) |
| 5180 | BlockBegin* loop_block = allocator()->block_of_op_with_id(loop_end_pos); |
| 5181 | |
| 5182 | TRACE_LINEAR_SCAN(4, tty->print_cr(" interval is used in loop that ends in block B%d, so trying to move max_block back from B%d to B%d", loop_block->block_id(), max_block->block_id(), loop_block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" interval is used in loop that ends in block B%d, so trying to move max_block back from B%d to B%d" , loop_block->block_id(), max_block->block_id(), loop_block ->block_id()); }; |
| 5183 | assert(loop_block != min_block, "loop_block and min_block must be different because block boundary is needed between")do { if (!(loop_block != min_block)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5183, "assert(" "loop_block != min_block" ") failed", "loop_block and min_block must be different because block boundary is needed between" ); ::breakpoint(); } } while (0); |
| 5184 | |
| 5185 | optimal_split_pos = find_optimal_split_pos(min_block, loop_block, loop_block->last_lir_instruction_id() + 2); |
| 5186 | if (optimal_split_pos == loop_block->last_lir_instruction_id() + 2) { |
| 5187 | optimal_split_pos = -1; |
| 5188 | TRACE_LINEAR_SCAN(4, tty->print_cr(" loop optimization not necessary"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" loop optimization not necessary" ); }; |
| 5189 | } else { |
| 5190 | TRACE_LINEAR_SCAN(4, tty->print_cr(" loop optimization successful"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" loop optimization successful" ); }; |
| 5191 | } |
| 5192 | } |
| 5193 | } |
| 5194 | |
| 5195 | if (optimal_split_pos == -1) { |
| 5196 | // not calculated by loop optimization |
| 5197 | optimal_split_pos = find_optimal_split_pos(min_block, max_block, max_split_pos); |
| 5198 | } |
| 5199 | } |
| 5200 | } |
| 5201 | TRACE_LINEAR_SCAN(4, tty->print_cr(" optimal split position: %d", optimal_split_pos))if (TraceLinearScanLevel >= 4) { tty->print_cr(" optimal split position: %d" , optimal_split_pos); }; |
| 5202 | |
| 5203 | return optimal_split_pos; |
| 5204 | } |
| 5205 | |
| 5206 | |
| 5207 | /* |
| 5208 | split an interval at the optimal position between min_split_pos and |
| 5209 | max_split_pos in two parts: |
| 5210 | 1) the left part has already a location assigned |
| 5211 | 2) the right part is sorted into to the unhandled-list |
| 5212 | */ |
| 5213 | void LinearScanWalker::split_before_usage(Interval* it, int min_split_pos, int max_split_pos) { |
| 5214 | TRACE_LINEAR_SCAN(2, tty->print ("----- splitting interval: "); it->print())if (TraceLinearScanLevel >= 2) { tty->print ("----- splitting interval: " ); it->print(); }; |
| 5215 | TRACE_LINEAR_SCAN(2, tty->print_cr(" between %d and %d", min_split_pos, max_split_pos))if (TraceLinearScanLevel >= 2) { tty->print_cr(" between %d and %d" , min_split_pos, max_split_pos); }; |
| 5216 | |
| 5217 | assert(it->from() < min_split_pos, "cannot split at start of interval")do { if (!(it->from() < min_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5217, "assert(" "it->from() < min_split_pos" ") failed" , "cannot split at start of interval"); ::breakpoint(); } } while (0); |
| 5218 | assert(current_position() < min_split_pos, "cannot split before current position")do { if (!(current_position() < min_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5218, "assert(" "current_position() < min_split_pos" ") failed" , "cannot split before current position"); ::breakpoint(); } } while (0); |
| 5219 | assert(min_split_pos <= max_split_pos, "invalid order")do { if (!(min_split_pos <= max_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5219, "assert(" "min_split_pos <= max_split_pos" ") failed" , "invalid order"); ::breakpoint(); } } while (0); |
| 5220 | assert(max_split_pos <= it->to(), "cannot split after end of interval")do { if (!(max_split_pos <= it->to())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5220, "assert(" "max_split_pos <= it->to()" ") failed" , "cannot split after end of interval"); ::breakpoint(); } } while (0); |
| 5221 | |
| 5222 | int optimal_split_pos = find_optimal_split_pos(it, min_split_pos, max_split_pos, true); |
| 5223 | |
| 5224 | assert(min_split_pos <= optimal_split_pos && optimal_split_pos <= max_split_pos, "out of range")do { if (!(min_split_pos <= optimal_split_pos && optimal_split_pos <= max_split_pos)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5224, "assert(" "min_split_pos <= optimal_split_pos && optimal_split_pos <= max_split_pos" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 5225 | assert(optimal_split_pos <= it->to(), "cannot split after end of interval")do { if (!(optimal_split_pos <= it->to())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5225, "assert(" "optimal_split_pos <= it->to()" ") failed" , "cannot split after end of interval"); ::breakpoint(); } } while (0); |
| 5226 | assert(optimal_split_pos > it->from(), "cannot split at start of interval")do { if (!(optimal_split_pos > it->from())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5226, "assert(" "optimal_split_pos > it->from()" ") failed" , "cannot split at start of interval"); ::breakpoint(); } } while (0); |
| 5227 | |
| 5228 | if (optimal_split_pos == it->to() && it->next_usage(mustHaveRegister, min_split_pos) == max_jint) { |
| 5229 | // the split position would be just before the end of the interval |
| 5230 | // -> no split at all necessary |
| 5231 | TRACE_LINEAR_SCAN(4, tty->print_cr(" no split necessary because optimal split position is at end of interval"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" no split necessary because optimal split position is at end of interval" ); }; |
| 5232 | return; |
| 5233 | } |
| 5234 | |
| 5235 | // must calculate this before the actual split is performed and before split position is moved to odd op_id |
| 5236 | bool move_necessary = !allocator()->is_block_begin(optimal_split_pos) && !it->has_hole_between(optimal_split_pos - 1, optimal_split_pos); |
| 5237 | |
| 5238 | if (!allocator()->is_block_begin(optimal_split_pos)) { |
| 5239 | // move position before actual instruction (odd op_id) |
| 5240 | optimal_split_pos = (optimal_split_pos - 1) | 1; |
| 5241 | } |
| 5242 | |
| 5243 | TRACE_LINEAR_SCAN(4, tty->print_cr(" splitting at position %d", optimal_split_pos))if (TraceLinearScanLevel >= 4) { tty->print_cr(" splitting at position %d" , optimal_split_pos); }; |
| 5244 | assert(allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 1), "split pos must be odd when not on block boundary")do { if (!(allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 1))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5244, "assert(" "allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 1)" ") failed", "split pos must be odd when not on block boundary" ); ::breakpoint(); } } while (0); |
| 5245 | assert(!allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 0), "split pos must be even on block boundary")do { if (!(!allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 0))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5245, "assert(" "!allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 0)" ") failed", "split pos must be even on block boundary"); ::breakpoint (); } } while (0); |
| 5246 | |
| 5247 | Interval* split_part = it->split(optimal_split_pos); |
| 5248 | |
| 5249 | allocator()->append_interval(split_part); |
| 5250 | allocator()->copy_register_flags(it, split_part); |
| 5251 | split_part->set_insert_move_when_activated(move_necessary); |
| 5252 | append_to_unhandled(unhandled_first_addr(anyKind), split_part); |
| 5253 | |
| 5254 | TRACE_LINEAR_SCAN(2, tty->print_cr(" split interval in two parts (insert_move_when_activated: %d)", move_necessary))if (TraceLinearScanLevel >= 2) { tty->print_cr(" split interval in two parts (insert_move_when_activated: %d)" , move_necessary); }; |
| 5255 | TRACE_LINEAR_SCAN(2, tty->print (" "); it->print())if (TraceLinearScanLevel >= 2) { tty->print (" "); it->print(); }; |
| 5256 | TRACE_LINEAR_SCAN(2, tty->print (" "); split_part->print())if (TraceLinearScanLevel >= 2) { tty->print (" "); split_part->print(); }; |
| 5257 | } |
| 5258 | |
| 5259 | /* |
| 5260 | split an interval at the optimal position between min_split_pos and |
| 5261 | max_split_pos in two parts: |
| 5262 | 1) the left part has already a location assigned |
| 5263 | 2) the right part is always on the stack and therefore ignored in further processing |
| 5264 | */ |
| 5265 | void LinearScanWalker::split_for_spilling(Interval* it) { |
| 5266 | // calculate allowed range of splitting position |
| 5267 | int max_split_pos = current_position(); |
| 5268 | int min_split_pos = MAX2(it->previous_usage(shouldHaveRegister, max_split_pos) + 1, it->from()); |
| 5269 | |
| 5270 | TRACE_LINEAR_SCAN(2, tty->print ("----- splitting and spilling interval: "); it->print())if (TraceLinearScanLevel >= 2) { tty->print ("----- splitting and spilling interval: " ); it->print(); }; |
| 5271 | TRACE_LINEAR_SCAN(2, tty->print_cr(" between %d and %d", min_split_pos, max_split_pos))if (TraceLinearScanLevel >= 2) { tty->print_cr(" between %d and %d" , min_split_pos, max_split_pos); }; |
| 5272 | |
| 5273 | assert(it->state() == activeState, "why spill interval that is not active?")do { if (!(it->state() == activeState)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5273, "assert(" "it->state() == activeState" ") failed", "why spill interval that is not active?"); ::breakpoint(); } } while (0); |
| 5274 | assert(it->from() <= min_split_pos, "cannot split before start of interval")do { if (!(it->from() <= min_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5274, "assert(" "it->from() <= min_split_pos" ") failed" , "cannot split before start of interval"); ::breakpoint(); } } while (0); |
| 5275 | assert(min_split_pos <= max_split_pos, "invalid order")do { if (!(min_split_pos <= max_split_pos)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5275, "assert(" "min_split_pos <= max_split_pos" ") failed" , "invalid order"); ::breakpoint(); } } while (0); |
| 5276 | assert(max_split_pos < it->to(), "cannot split at end end of interval")do { if (!(max_split_pos < it->to())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5276, "assert(" "max_split_pos < it->to()" ") failed" , "cannot split at end end of interval"); ::breakpoint(); } } while (0); |
| 5277 | assert(current_position() < it->to(), "interval must not end before current position")do { if (!(current_position() < it->to())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5277, "assert(" "current_position() < it->to()" ") failed" , "interval must not end before current position"); ::breakpoint (); } } while (0); |
| 5278 | |
| 5279 | if (min_split_pos == it->from()) { |
| 5280 | // the whole interval is never used, so spill it entirely to memory |
| 5281 | TRACE_LINEAR_SCAN(2, tty->print_cr(" spilling entire interval because split pos is at beginning of interval"))if (TraceLinearScanLevel >= 2) { tty->print_cr(" spilling entire interval because split pos is at beginning of interval" ); }; |
| 5282 | assert(it->first_usage(shouldHaveRegister) > current_position(), "interval must not have use position before current_position")do { if (!(it->first_usage(shouldHaveRegister) > current_position ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5282, "assert(" "it->first_usage(shouldHaveRegister) > current_position()" ") failed", "interval must not have use position before current_position" ); ::breakpoint(); } } while (0); |
| 5283 | |
| 5284 | allocator()->assign_spill_slot(it); |
| 5285 | allocator()->change_spill_state(it, min_split_pos); |
| 5286 | |
| 5287 | // Also kick parent intervals out of register to memory when they have no use |
| 5288 | // position. This avoids short interval in register surrounded by intervals in |
| 5289 | // memory -> avoid useless moves from memory to register and back |
| 5290 | Interval* parent = it; |
| 5291 | while (parent != NULL__null && parent->is_split_child()) { |
| 5292 | parent = parent->split_child_before_op_id(parent->from()); |
| 5293 | |
| 5294 | if (parent->assigned_reg() < LinearScan::nof_regs) { |
| 5295 | if (parent->first_usage(shouldHaveRegister) == max_jint) { |
| 5296 | // parent is never used, so kick it out of its assigned register |
| 5297 | TRACE_LINEAR_SCAN(4, tty->print_cr(" kicking out interval %d out of its register because it is never used", parent->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" kicking out interval %d out of its register because it is never used" , parent->reg_num()); }; |
| 5298 | allocator()->assign_spill_slot(parent); |
| 5299 | } else { |
| 5300 | // do not go further back because the register is actually used by the interval |
| 5301 | parent = NULL__null; |
| 5302 | } |
| 5303 | } |
| 5304 | } |
| 5305 | |
| 5306 | } else { |
| 5307 | // search optimal split pos, split interval and spill only the right hand part |
| 5308 | int optimal_split_pos = find_optimal_split_pos(it, min_split_pos, max_split_pos, false); |
| 5309 | |
| 5310 | assert(min_split_pos <= optimal_split_pos && optimal_split_pos <= max_split_pos, "out of range")do { if (!(min_split_pos <= optimal_split_pos && optimal_split_pos <= max_split_pos)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5310, "assert(" "min_split_pos <= optimal_split_pos && optimal_split_pos <= max_split_pos" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 5311 | assert(optimal_split_pos < it->to(), "cannot split at end of interval")do { if (!(optimal_split_pos < it->to())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5311, "assert(" "optimal_split_pos < it->to()" ") failed" , "cannot split at end of interval"); ::breakpoint(); } } while (0); |
| 5312 | assert(optimal_split_pos >= it->from(), "cannot split before start of interval")do { if (!(optimal_split_pos >= it->from())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5312, "assert(" "optimal_split_pos >= it->from()" ") failed" , "cannot split before start of interval"); ::breakpoint(); } } while (0); |
| 5313 | |
| 5314 | if (!allocator()->is_block_begin(optimal_split_pos)) { |
| 5315 | // move position before actual instruction (odd op_id) |
| 5316 | optimal_split_pos = (optimal_split_pos - 1) | 1; |
| 5317 | } |
| 5318 | |
| 5319 | TRACE_LINEAR_SCAN(4, tty->print_cr(" splitting at position %d", optimal_split_pos))if (TraceLinearScanLevel >= 4) { tty->print_cr(" splitting at position %d" , optimal_split_pos); }; |
| 5320 | assert(allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 1), "split pos must be odd when not on block boundary")do { if (!(allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 1))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5320, "assert(" "allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 1)" ") failed", "split pos must be odd when not on block boundary" ); ::breakpoint(); } } while (0); |
| 5321 | assert(!allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 0), "split pos must be even on block boundary")do { if (!(!allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 0))) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5321, "assert(" "!allocator()->is_block_begin(optimal_split_pos) || (optimal_split_pos % 2 == 0)" ") failed", "split pos must be even on block boundary"); ::breakpoint (); } } while (0); |
| 5322 | |
| 5323 | Interval* spilled_part = it->split(optimal_split_pos); |
| 5324 | allocator()->append_interval(spilled_part); |
| 5325 | allocator()->assign_spill_slot(spilled_part); |
| 5326 | allocator()->change_spill_state(spilled_part, optimal_split_pos); |
| 5327 | |
| 5328 | if (!allocator()->is_block_begin(optimal_split_pos)) { |
| 5329 | TRACE_LINEAR_SCAN(4, tty->print_cr(" inserting move from interval %d to %d", it->reg_num(), spilled_part->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" inserting move from interval %d to %d" , it->reg_num(), spilled_part->reg_num()); }; |
| 5330 | insert_move(optimal_split_pos, it, spilled_part); |
| 5331 | } |
| 5332 | |
| 5333 | // the current_split_child is needed later when moves are inserted for reloading |
| 5334 | assert(spilled_part->current_split_child() == it, "overwriting wrong current_split_child")do { if (!(spilled_part->current_split_child() == it)) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5334, "assert(" "spilled_part->current_split_child() == it" ") failed", "overwriting wrong current_split_child"); ::breakpoint (); } } while (0); |
| 5335 | spilled_part->make_current_split_child(); |
| 5336 | |
| 5337 | TRACE_LINEAR_SCAN(2, tty->print_cr(" split interval in two parts"))if (TraceLinearScanLevel >= 2) { tty->print_cr(" split interval in two parts" ); }; |
| 5338 | TRACE_LINEAR_SCAN(2, tty->print (" "); it->print())if (TraceLinearScanLevel >= 2) { tty->print (" "); it->print(); }; |
| 5339 | TRACE_LINEAR_SCAN(2, tty->print (" "); spilled_part->print())if (TraceLinearScanLevel >= 2) { tty->print (" "); spilled_part->print(); }; |
| 5340 | } |
| 5341 | } |
| 5342 | |
| 5343 | |
| 5344 | void LinearScanWalker::split_stack_interval(Interval* it) { |
| 5345 | int min_split_pos = current_position() + 1; |
| 5346 | int max_split_pos = MIN2(it->first_usage(shouldHaveRegister), it->to()); |
| 5347 | |
| 5348 | split_before_usage(it, min_split_pos, max_split_pos); |
| 5349 | } |
| 5350 | |
| 5351 | void LinearScanWalker::split_when_partial_register_available(Interval* it, int register_available_until) { |
| 5352 | int min_split_pos = MAX2(it->previous_usage(shouldHaveRegister, register_available_until), it->from() + 1); |
| 5353 | int max_split_pos = register_available_until; |
| 5354 | |
| 5355 | split_before_usage(it, min_split_pos, max_split_pos); |
| 5356 | } |
| 5357 | |
| 5358 | void LinearScanWalker::split_and_spill_interval(Interval* it) { |
| 5359 | assert(it->state() == activeState || it->state() == inactiveState, "other states not allowed")do { if (!(it->state() == activeState || it->state() == inactiveState)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5359, "assert(" "it->state() == activeState || it->state() == inactiveState" ") failed", "other states not allowed"); ::breakpoint(); } } while (0); |
| 5360 | |
| 5361 | int current_pos = current_position(); |
| 5362 | if (it->state() == inactiveState) { |
| 5363 | // the interval is currently inactive, so no spill slot is needed for now. |
| 5364 | // when the split part is activated, the interval has a new chance to get a register, |
| 5365 | // so in the best case no stack slot is necessary |
| 5366 | assert(it->has_hole_between(current_pos - 1, current_pos + 1), "interval can not be inactive otherwise")do { if (!(it->has_hole_between(current_pos - 1, current_pos + 1))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5366, "assert(" "it->has_hole_between(current_pos - 1, current_pos + 1)" ") failed", "interval can not be inactive otherwise"); ::breakpoint (); } } while (0); |
| 5367 | split_before_usage(it, current_pos + 1, current_pos + 1); |
| 5368 | |
| 5369 | } else { |
| 5370 | // search the position where the interval must have a register and split |
| 5371 | // at the optimal position before. |
| 5372 | // The new created part is added to the unhandled list and will get a register |
| 5373 | // when it is activated |
| 5374 | int min_split_pos = current_pos + 1; |
| 5375 | int max_split_pos = MIN2(it->next_usage(mustHaveRegister, min_split_pos), it->to()); |
| 5376 | |
| 5377 | split_before_usage(it, min_split_pos, max_split_pos); |
| 5378 | |
| 5379 | assert(it->next_usage(mustHaveRegister, current_pos) == max_jint, "the remaining part is spilled to stack and therefore has no register")do { if (!(it->next_usage(mustHaveRegister, current_pos) == max_jint)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5379, "assert(" "it->next_usage(mustHaveRegister, current_pos) == max_jint" ") failed", "the remaining part is spilled to stack and therefore has no register" ); ::breakpoint(); } } while (0); |
| 5380 | split_for_spilling(it); |
| 5381 | } |
| 5382 | } |
| 5383 | |
| 5384 | int LinearScanWalker::find_free_reg(int reg_needed_until, int interval_to, int hint_reg, int ignore_reg, bool* need_split) { |
| 5385 | int min_full_reg = any_reg; |
| 5386 | int max_partial_reg = any_reg; |
| 5387 | |
| 5388 | for (int i = _first_reg; i <= _last_reg; i++) { |
| 5389 | if (i == ignore_reg) { |
| 5390 | // this register must be ignored |
| 5391 | |
| 5392 | } else if (_use_pos[i] >= interval_to) { |
| 5393 | // this register is free for the full interval |
| 5394 | if (min_full_reg == any_reg || i == hint_reg || (_use_pos[i] < _use_pos[min_full_reg] && min_full_reg != hint_reg)) { |
| 5395 | min_full_reg = i; |
| 5396 | } |
| 5397 | } else if (_use_pos[i] > reg_needed_until) { |
| 5398 | // this register is at least free until reg_needed_until |
| 5399 | if (max_partial_reg == any_reg || i == hint_reg || (_use_pos[i] > _use_pos[max_partial_reg] && max_partial_reg != hint_reg)) { |
| 5400 | max_partial_reg = i; |
| 5401 | } |
| 5402 | } |
| 5403 | } |
| 5404 | |
| 5405 | if (min_full_reg != any_reg) { |
| 5406 | return min_full_reg; |
| 5407 | } else if (max_partial_reg != any_reg) { |
| 5408 | *need_split = true; |
| 5409 | return max_partial_reg; |
| 5410 | } else { |
| 5411 | return any_reg; |
| 5412 | } |
| 5413 | } |
| 5414 | |
| 5415 | int LinearScanWalker::find_free_double_reg(int reg_needed_until, int interval_to, int hint_reg, bool* need_split) { |
| 5416 | assert((_last_reg - _first_reg + 1) % 2 == 0, "adjust algorithm")do { if (!((_last_reg - _first_reg + 1) % 2 == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5416, "assert(" "(_last_reg - _first_reg + 1) % 2 == 0" ") failed" , "adjust algorithm"); ::breakpoint(); } } while (0); |
| 5417 | |
| 5418 | int min_full_reg = any_reg; |
| 5419 | int max_partial_reg = any_reg; |
| 5420 | |
| 5421 | for (int i = _first_reg; i < _last_reg; i+=2) { |
| 5422 | if (_use_pos[i] >= interval_to && _use_pos[i + 1] >= interval_to) { |
| 5423 | // this register is free for the full interval |
| 5424 | if (min_full_reg == any_reg || i == hint_reg || (_use_pos[i] < _use_pos[min_full_reg] && min_full_reg != hint_reg)) { |
| 5425 | min_full_reg = i; |
| 5426 | } |
| 5427 | } else if (_use_pos[i] > reg_needed_until && _use_pos[i + 1] > reg_needed_until) { |
| 5428 | // this register is at least free until reg_needed_until |
| 5429 | if (max_partial_reg == any_reg || i == hint_reg || (_use_pos[i] > _use_pos[max_partial_reg] && max_partial_reg != hint_reg)) { |
| 5430 | max_partial_reg = i; |
| 5431 | } |
| 5432 | } |
| 5433 | } |
| 5434 | |
| 5435 | if (min_full_reg != any_reg) { |
| 5436 | return min_full_reg; |
| 5437 | } else if (max_partial_reg != any_reg) { |
| 5438 | *need_split = true; |
| 5439 | return max_partial_reg; |
| 5440 | } else { |
| 5441 | return any_reg; |
| 5442 | } |
| 5443 | } |
| 5444 | |
| 5445 | bool LinearScanWalker::alloc_free_reg(Interval* cur) { |
| 5446 | TRACE_LINEAR_SCAN(2, tty->print("trying to find free register for "); cur->print())if (TraceLinearScanLevel >= 2) { tty->print("trying to find free register for " ); cur->print(); }; |
| 5447 | |
| 5448 | init_use_lists(true); |
| 5449 | free_exclude_active_fixed(); |
| 5450 | free_exclude_active_any(); |
| 5451 | free_collect_inactive_fixed(cur); |
| 5452 | free_collect_inactive_any(cur); |
| 5453 | assert(unhandled_first(fixedKind) == Interval::end(), "must not have unhandled fixed intervals because all fixed intervals have a use at position 0")do { if (!(unhandled_first(fixedKind) == Interval::end())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5453, "assert(" "unhandled_first(fixedKind) == Interval::end()" ") failed", "must not have unhandled fixed intervals because all fixed intervals have a use at position 0" ); ::breakpoint(); } } while (0); |
| 5454 | |
| 5455 | // _use_pos contains the start of the next interval that has this register assigned |
| 5456 | // (either as a fixed register or a normal allocated register in the past) |
| 5457 | // only intervals overlapping with cur are processed, non-overlapping invervals can be ignored safely |
| 5458 | #ifdef ASSERT1 |
| 5459 | if (TraceLinearScanLevel >= 4) { |
| 5460 | tty->print_cr(" state of registers:"); |
| 5461 | for (int i = _first_reg; i <= _last_reg; i++) { |
| 5462 | tty->print(" reg %d (", i); |
| 5463 | LinearScan::print_reg_num(i); |
| 5464 | tty->print_cr("): use_pos: %d", _use_pos[i]); |
| 5465 | } |
| 5466 | } |
| 5467 | #endif |
| 5468 | |
| 5469 | int hint_reg, hint_regHi; |
| 5470 | Interval* register_hint = cur->register_hint(); |
| 5471 | if (register_hint != NULL__null) { |
| 5472 | hint_reg = register_hint->assigned_reg(); |
| 5473 | hint_regHi = register_hint->assigned_regHi(); |
| 5474 | |
| 5475 | if (_num_phys_regs == 2 && allocator()->is_precolored_cpu_interval(register_hint)) { |
| 5476 | assert(hint_reg != any_reg && hint_regHi == any_reg, "must be for fixed intervals")do { if (!(hint_reg != any_reg && hint_regHi == any_reg )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5476, "assert(" "hint_reg != any_reg && hint_regHi == any_reg" ") failed", "must be for fixed intervals"); ::breakpoint(); } } while (0); |
| 5477 | hint_regHi = hint_reg + 1; // connect e.g. eax-edx |
| 5478 | } |
| 5479 | #ifdef ASSERT1 |
| 5480 | if (TraceLinearScanLevel >= 4) { |
| 5481 | tty->print(" hint registers %d (", hint_reg); |
| 5482 | LinearScan::print_reg_num(hint_reg); |
| 5483 | tty->print("), %d (", hint_regHi); |
| 5484 | LinearScan::print_reg_num(hint_regHi); |
| 5485 | tty->print(") from interval "); |
| 5486 | register_hint->print(); |
| 5487 | } |
| 5488 | #endif |
| 5489 | } else { |
| 5490 | hint_reg = any_reg; |
| 5491 | hint_regHi = any_reg; |
| 5492 | } |
| 5493 | assert(hint_reg == any_reg || hint_reg != hint_regHi, "hint reg and regHi equal")do { if (!(hint_reg == any_reg || hint_reg != hint_regHi)) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5493, "assert(" "hint_reg == any_reg || hint_reg != hint_regHi" ") failed", "hint reg and regHi equal"); ::breakpoint(); } } while (0); |
| 5494 | assert(cur->assigned_reg() == any_reg && cur->assigned_regHi() == any_reg, "register already assigned to interval")do { if (!(cur->assigned_reg() == any_reg && cur-> assigned_regHi() == any_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5494, "assert(" "cur->assigned_reg() == any_reg && cur->assigned_regHi() == any_reg" ") failed", "register already assigned to interval"); ::breakpoint (); } } while (0); |
| 5495 | |
| 5496 | // the register must be free at least until this position |
| 5497 | int reg_needed_until = cur->from() + 1; |
| 5498 | int interval_to = cur->to(); |
| 5499 | |
| 5500 | bool need_split = false; |
| 5501 | int split_pos; |
| 5502 | int reg; |
| 5503 | int regHi = any_reg; |
| 5504 | |
| 5505 | if (_adjacent_regs) { |
| 5506 | reg = find_free_double_reg(reg_needed_until, interval_to, hint_reg, &need_split); |
| 5507 | regHi = reg + 1; |
| 5508 | if (reg == any_reg) { |
| 5509 | return false; |
| 5510 | } |
| 5511 | split_pos = MIN2(_use_pos[reg], _use_pos[regHi]); |
| 5512 | |
| 5513 | } else { |
| 5514 | reg = find_free_reg(reg_needed_until, interval_to, hint_reg, any_reg, &need_split); |
| 5515 | if (reg == any_reg) { |
| 5516 | return false; |
| 5517 | } |
| 5518 | split_pos = _use_pos[reg]; |
| 5519 | |
| 5520 | if (_num_phys_regs == 2) { |
| 5521 | regHi = find_free_reg(reg_needed_until, interval_to, hint_regHi, reg, &need_split); |
| 5522 | |
| 5523 | if (_use_pos[reg] < interval_to && regHi == any_reg) { |
| 5524 | // do not split interval if only one register can be assigned until the split pos |
| 5525 | // (when one register is found for the whole interval, split&spill is only |
| 5526 | // performed for the hi register) |
| 5527 | return false; |
| 5528 | |
| 5529 | } else if (regHi != any_reg) { |
| 5530 | split_pos = MIN2(split_pos, _use_pos[regHi]); |
| 5531 | |
| 5532 | // sort register numbers to prevent e.g. a move from eax,ebx to ebx,eax |
| 5533 | if (reg > regHi) { |
| 5534 | int temp = reg; |
| 5535 | reg = regHi; |
| 5536 | regHi = temp; |
| 5537 | } |
| 5538 | } |
| 5539 | } |
| 5540 | } |
| 5541 | |
| 5542 | cur->assign_reg(reg, regHi); |
| 5543 | #ifdef ASSERT1 |
| 5544 | if (TraceLinearScanLevel >= 2) { |
| 5545 | tty->print(" selected registers %d (", reg); |
| 5546 | LinearScan::print_reg_num(reg); |
| 5547 | tty->print("), %d (", regHi); |
| 5548 | LinearScan::print_reg_num(regHi); |
| 5549 | tty->print_cr(")"); |
| 5550 | } |
| 5551 | #endif |
| 5552 | assert(split_pos > 0, "invalid split_pos")do { if (!(split_pos > 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5552, "assert(" "split_pos > 0" ") failed", "invalid split_pos" ); ::breakpoint(); } } while (0); |
| 5553 | if (need_split) { |
| 5554 | // register not available for full interval, so split it |
| 5555 | split_when_partial_register_available(cur, split_pos); |
| 5556 | } |
| 5557 | |
| 5558 | // only return true if interval is completely assigned |
| 5559 | return _num_phys_regs == 1 || regHi != any_reg; |
| 5560 | } |
| 5561 | |
| 5562 | |
| 5563 | int LinearScanWalker::find_locked_reg(int reg_needed_until, int interval_to, int ignore_reg, bool* need_split) { |
| 5564 | int max_reg = any_reg; |
| 5565 | |
| 5566 | for (int i = _first_reg; i <= _last_reg; i++) { |
| 5567 | if (i == ignore_reg) { |
| 5568 | // this register must be ignored |
| 5569 | |
| 5570 | } else if (_use_pos[i] > reg_needed_until) { |
| 5571 | if (max_reg == any_reg || _use_pos[i] > _use_pos[max_reg]) { |
| 5572 | max_reg = i; |
| 5573 | } |
| 5574 | } |
| 5575 | } |
| 5576 | |
| 5577 | if (max_reg != any_reg && _block_pos[max_reg] <= interval_to) { |
| 5578 | *need_split = true; |
| 5579 | } |
| 5580 | |
| 5581 | return max_reg; |
| 5582 | } |
| 5583 | |
| 5584 | int LinearScanWalker::find_locked_double_reg(int reg_needed_until, int interval_to, bool* need_split) { |
| 5585 | assert((_last_reg - _first_reg + 1) % 2 == 0, "adjust algorithm")do { if (!((_last_reg - _first_reg + 1) % 2 == 0)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5585, "assert(" "(_last_reg - _first_reg + 1) % 2 == 0" ") failed" , "adjust algorithm"); ::breakpoint(); } } while (0); |
| 5586 | |
| 5587 | int max_reg = any_reg; |
| 5588 | |
| 5589 | for (int i = _first_reg; i < _last_reg; i+=2) { |
| 5590 | if (_use_pos[i] > reg_needed_until && _use_pos[i + 1] > reg_needed_until) { |
| 5591 | if (max_reg == any_reg || _use_pos[i] > _use_pos[max_reg]) { |
| 5592 | max_reg = i; |
| 5593 | } |
| 5594 | } |
| 5595 | } |
| 5596 | |
| 5597 | if (max_reg != any_reg && |
| 5598 | (_block_pos[max_reg] <= interval_to || _block_pos[max_reg + 1] <= interval_to)) { |
| 5599 | *need_split = true; |
| 5600 | } |
| 5601 | |
| 5602 | return max_reg; |
| 5603 | } |
| 5604 | |
| 5605 | void LinearScanWalker::split_and_spill_intersecting_intervals(int reg, int regHi) { |
| 5606 | assert(reg != any_reg, "no register assigned")do { if (!(reg != any_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5606, "assert(" "reg != any_reg" ") failed", "no register assigned" ); ::breakpoint(); } } while (0); |
| 5607 | |
| 5608 | for (int i = 0; i < _spill_intervals[reg]->length(); i++) { |
| 5609 | Interval* it = _spill_intervals[reg]->at(i); |
| 5610 | remove_from_list(it); |
| 5611 | split_and_spill_interval(it); |
| 5612 | } |
| 5613 | |
| 5614 | if (regHi != any_reg) { |
| 5615 | IntervalList* processed = _spill_intervals[reg]; |
| 5616 | for (int i = 0; i < _spill_intervals[regHi]->length(); i++) { |
| 5617 | Interval* it = _spill_intervals[regHi]->at(i); |
| 5618 | if (processed->find(it) == -1) { |
| 5619 | remove_from_list(it); |
| 5620 | split_and_spill_interval(it); |
| 5621 | } |
| 5622 | } |
| 5623 | } |
| 5624 | } |
| 5625 | |
| 5626 | |
| 5627 | // Split an Interval and spill it to memory so that cur can be placed in a register |
| 5628 | void LinearScanWalker::alloc_locked_reg(Interval* cur) { |
| 5629 | TRACE_LINEAR_SCAN(2, tty->print("need to split and spill to get register for "); cur->print())if (TraceLinearScanLevel >= 2) { tty->print("need to split and spill to get register for " ); cur->print(); }; |
| 5630 | |
| 5631 | // collect current usage of registers |
| 5632 | init_use_lists(false); |
| 5633 | spill_exclude_active_fixed(); |
| 5634 | assert(unhandled_first(fixedKind) == Interval::end(), "must not have unhandled fixed intervals because all fixed intervals have a use at position 0")do { if (!(unhandled_first(fixedKind) == Interval::end())) { ( *g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5634, "assert(" "unhandled_first(fixedKind) == Interval::end()" ") failed", "must not have unhandled fixed intervals because all fixed intervals have a use at position 0" ); ::breakpoint(); } } while (0); |
| 5635 | spill_block_inactive_fixed(cur); |
| 5636 | spill_collect_active_any(); |
| 5637 | spill_collect_inactive_any(cur); |
| 5638 | |
| 5639 | #ifdef ASSERT1 |
| 5640 | if (TraceLinearScanLevel >= 4) { |
| 5641 | tty->print_cr(" state of registers:"); |
| 5642 | for (int i = _first_reg; i <= _last_reg; i++) { |
| 5643 | tty->print(" reg %d(", i); |
| 5644 | LinearScan::print_reg_num(i); |
| 5645 | tty->print("): use_pos: %d, block_pos: %d, intervals: ", _use_pos[i], _block_pos[i]); |
| 5646 | for (int j = 0; j < _spill_intervals[i]->length(); j++) { |
| 5647 | tty->print("%d ", _spill_intervals[i]->at(j)->reg_num()); |
| 5648 | } |
| 5649 | tty->cr(); |
| 5650 | } |
| 5651 | } |
| 5652 | #endif |
| 5653 | |
| 5654 | // the register must be free at least until this position |
| 5655 | int reg_needed_until = MIN2(cur->first_usage(mustHaveRegister), cur->from() + 1); |
| 5656 | int interval_to = cur->to(); |
| 5657 | assert (reg_needed_until > 0 && reg_needed_until < max_jint, "interval has no use")do { if (!(reg_needed_until > 0 && reg_needed_until < max_jint)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5657, "assert(" "reg_needed_until > 0 && reg_needed_until < max_jint" ") failed", "interval has no use"); ::breakpoint(); } } while (0); |
| 5658 | |
| 5659 | int split_pos = 0; |
| 5660 | int use_pos = 0; |
| 5661 | bool need_split = false; |
| 5662 | int reg, regHi; |
| 5663 | |
| 5664 | if (_adjacent_regs) { |
| 5665 | reg = find_locked_double_reg(reg_needed_until, interval_to, &need_split); |
| 5666 | regHi = reg + 1; |
| 5667 | |
| 5668 | if (reg != any_reg) { |
| 5669 | use_pos = MIN2(_use_pos[reg], _use_pos[regHi]); |
| 5670 | split_pos = MIN2(_block_pos[reg], _block_pos[regHi]); |
| 5671 | } |
| 5672 | } else { |
| 5673 | reg = find_locked_reg(reg_needed_until, interval_to, cur->assigned_reg(), &need_split); |
| 5674 | regHi = any_reg; |
| 5675 | |
| 5676 | if (reg != any_reg) { |
| 5677 | use_pos = _use_pos[reg]; |
| 5678 | split_pos = _block_pos[reg]; |
| 5679 | |
| 5680 | if (_num_phys_regs == 2) { |
| 5681 | if (cur->assigned_reg() != any_reg) { |
| 5682 | regHi = reg; |
| 5683 | reg = cur->assigned_reg(); |
| 5684 | } else { |
| 5685 | regHi = find_locked_reg(reg_needed_until, interval_to, reg, &need_split); |
| 5686 | if (regHi != any_reg) { |
| 5687 | use_pos = MIN2(use_pos, _use_pos[regHi]); |
| 5688 | split_pos = MIN2(split_pos, _block_pos[regHi]); |
| 5689 | } |
| 5690 | } |
| 5691 | |
| 5692 | if (regHi != any_reg && reg > regHi) { |
| 5693 | // sort register numbers to prevent e.g. a move from eax,ebx to ebx,eax |
| 5694 | int temp = reg; |
| 5695 | reg = regHi; |
| 5696 | regHi = temp; |
| 5697 | } |
| 5698 | } |
| 5699 | } |
| 5700 | } |
| 5701 | |
| 5702 | if (reg == any_reg || (_num_phys_regs == 2 && regHi == any_reg) || use_pos <= cur->first_usage(mustHaveRegister)) { |
| 5703 | // the first use of cur is later than the spilling position -> spill cur |
| 5704 | TRACE_LINEAR_SCAN(4, tty->print_cr("able to spill current interval. first_usage(register): %d, use_pos: %d", cur->first_usage(mustHaveRegister), use_pos))if (TraceLinearScanLevel >= 4) { tty->print_cr("able to spill current interval. first_usage(register): %d, use_pos: %d" , cur->first_usage(mustHaveRegister), use_pos); }; |
| 5705 | |
| 5706 | if (cur->first_usage(mustHaveRegister) <= cur->from() + 1) { |
| 5707 | assert(false, "cannot spill interval that is used in first instruction (possible reason: no register found)")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5707, "assert(" "false" ") failed", "cannot spill interval that is used in first instruction (possible reason: no register found)" ); ::breakpoint(); } } while (0); |
| 5708 | // assign a reasonable register and do a bailout in product mode to avoid errors |
| 5709 | allocator()->assign_spill_slot(cur); |
| 5710 | BAILOUT("LinearScan: no register found"){ bailout("LinearScan: no register found"); return; }; |
| 5711 | } |
| 5712 | |
| 5713 | split_and_spill_interval(cur); |
| 5714 | } else { |
| 5715 | #ifdef ASSERT1 |
| 5716 | if (TraceLinearScanLevel >= 4) { |
| 5717 | tty->print("decided to use register %d (", reg); |
| 5718 | LinearScan::print_reg_num(reg); |
| 5719 | tty->print("), %d (", regHi); |
| 5720 | LinearScan::print_reg_num(regHi); |
| 5721 | tty->print_cr(")"); |
| 5722 | } |
| 5723 | #endif |
| 5724 | assert(reg != any_reg && (_num_phys_regs == 1 || regHi != any_reg), "no register found")do { if (!(reg != any_reg && (_num_phys_regs == 1 || regHi != any_reg))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5724, "assert(" "reg != any_reg && (_num_phys_regs == 1 || regHi != any_reg)" ") failed", "no register found"); ::breakpoint(); } } while ( 0); |
| 5725 | assert(split_pos > 0, "invalid split_pos")do { if (!(split_pos > 0)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5725, "assert(" "split_pos > 0" ") failed", "invalid split_pos" ); ::breakpoint(); } } while (0); |
| 5726 | assert(need_split == false || split_pos > cur->from(), "splitting interval at from")do { if (!(need_split == false || split_pos > cur->from ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5726, "assert(" "need_split == false || split_pos > cur->from()" ") failed", "splitting interval at from"); ::breakpoint(); } } while (0); |
| 5727 | |
| 5728 | cur->assign_reg(reg, regHi); |
| 5729 | if (need_split) { |
| 5730 | // register not available for full interval, so split it |
| 5731 | split_when_partial_register_available(cur, split_pos); |
| 5732 | } |
| 5733 | |
| 5734 | // perform splitting and spilling for all affected intervalls |
| 5735 | split_and_spill_intersecting_intervals(reg, regHi); |
| 5736 | } |
| 5737 | } |
| 5738 | |
| 5739 | bool LinearScanWalker::no_allocation_possible(Interval* cur) { |
| 5740 | #ifdef X86 |
| 5741 | // fast calculation of intervals that can never get a register because the |
| 5742 | // the next instruction is a call that blocks all registers |
| 5743 | // Note: this does not work if callee-saved registers are available (e.g. on Sparc) |
| 5744 | |
| 5745 | // check if this interval is the result of a split operation |
| 5746 | // (an interval got a register until this position) |
| 5747 | int pos = cur->from(); |
| 5748 | if ((pos & 1) == 1) { |
| 5749 | // the current instruction is a call that blocks all registers |
| 5750 | if (pos < allocator()->max_lir_op_id() && allocator()->has_call(pos + 1)) { |
| 5751 | TRACE_LINEAR_SCAN(4, tty->print_cr(" free register cannot be available because all registers blocked by following call"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" free register cannot be available because all registers blocked by following call" ); }; |
| 5752 | |
| 5753 | // safety check that there is really no register available |
| 5754 | assert(alloc_free_reg(cur) == false, "found a register for this interval")do { if (!(alloc_free_reg(cur) == false)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5754, "assert(" "alloc_free_reg(cur) == false" ") failed", "found a register for this interval" ); ::breakpoint(); } } while (0); |
| 5755 | return true; |
| 5756 | } |
| 5757 | |
| 5758 | } |
| 5759 | #endif |
| 5760 | return false; |
| 5761 | } |
| 5762 | |
| 5763 | void LinearScanWalker::init_vars_for_alloc(Interval* cur) { |
| 5764 | BasicType type = cur->type(); |
| 5765 | _num_phys_regs = LinearScan::num_physical_regs(type); |
| 5766 | _adjacent_regs = LinearScan::requires_adjacent_regs(type); |
| 5767 | |
| 5768 | if (pd_init_regs_for_alloc(cur)) { |
| 5769 | // the appropriate register range was selected. |
| 5770 | } else if (type == T_FLOAT || type == T_DOUBLE) { |
| 5771 | _first_reg = pd_first_fpu_reg; |
| 5772 | _last_reg = pd_last_fpu_reg; |
| 5773 | } else { |
| 5774 | _first_reg = pd_first_cpu_reg; |
| 5775 | _last_reg = FrameMap::last_cpu_reg(); |
| 5776 | } |
| 5777 | |
| 5778 | assert(0 <= _first_reg && _first_reg < LinearScan::nof_regs, "out of range")do { if (!(0 <= _first_reg && _first_reg < LinearScan ::nof_regs)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5778, "assert(" "0 <= _first_reg && _first_reg < LinearScan::nof_regs" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 5779 | assert(0 <= _last_reg && _last_reg < LinearScan::nof_regs, "out of range")do { if (!(0 <= _last_reg && _last_reg < LinearScan ::nof_regs)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5779, "assert(" "0 <= _last_reg && _last_reg < LinearScan::nof_regs" ") failed", "out of range"); ::breakpoint(); } } while (0); |
| 5780 | } |
| 5781 | |
| 5782 | |
| 5783 | bool LinearScanWalker::is_move(LIR_Op* op, Interval* from, Interval* to) { |
| 5784 | if (op->code() != lir_move) { |
| 5785 | return false; |
| 5786 | } |
| 5787 | assert(op->as_Op1() != NULL, "move must be LIR_Op1")do { if (!(op->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5787, "assert(" "op->as_Op1() != __null" ") failed", "move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 5788 | |
| 5789 | LIR_Opr in = ((LIR_Op1*)op)->in_opr(); |
| 5790 | LIR_Opr res = ((LIR_Op1*)op)->result_opr(); |
| 5791 | return in->is_virtual() && res->is_virtual() && in->vreg_number() == from->reg_num() && res->vreg_number() == to->reg_num(); |
| 5792 | } |
| 5793 | |
| 5794 | // optimization (especially for phi functions of nested loops): |
| 5795 | // assign same spill slot to non-intersecting intervals |
| 5796 | void LinearScanWalker::combine_spilled_intervals(Interval* cur) { |
| 5797 | if (cur->is_split_child()) { |
| 5798 | // optimization is only suitable for split parents |
| 5799 | return; |
| 5800 | } |
| 5801 | |
| 5802 | Interval* register_hint = cur->register_hint(false); |
| 5803 | if (register_hint == NULL__null) { |
| 5804 | // cur is not the target of a move, otherwise register_hint would be set |
| 5805 | return; |
| 5806 | } |
| 5807 | assert(register_hint->is_split_parent(), "register hint must be split parent")do { if (!(register_hint->is_split_parent())) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5807, "assert(" "register_hint->is_split_parent()" ") failed" , "register hint must be split parent"); ::breakpoint(); } } while (0); |
| 5808 | |
| 5809 | if (cur->spill_state() != noOptimization || register_hint->spill_state() != noOptimization) { |
| 5810 | // combining the stack slots for intervals where spill move optimization is applied |
| 5811 | // is not benefitial and would cause problems |
| 5812 | return; |
| 5813 | } |
| 5814 | |
| 5815 | int begin_pos = cur->from(); |
| 5816 | int end_pos = cur->to(); |
| 5817 | if (end_pos > allocator()->max_lir_op_id() || (begin_pos & 1) != 0 || (end_pos & 1) != 0) { |
| 5818 | // safety check that lir_op_with_id is allowed |
| 5819 | return; |
| 5820 | } |
| 5821 | |
| 5822 | if (!is_move(allocator()->lir_op_with_id(begin_pos), register_hint, cur) || !is_move(allocator()->lir_op_with_id(end_pos), cur, register_hint)) { |
| 5823 | // cur and register_hint are not connected with two moves |
| 5824 | return; |
| 5825 | } |
| 5826 | |
| 5827 | Interval* begin_hint = register_hint->split_child_at_op_id(begin_pos, LIR_OpVisitState::inputMode); |
| 5828 | Interval* end_hint = register_hint->split_child_at_op_id(end_pos, LIR_OpVisitState::outputMode); |
| 5829 | if (begin_hint == end_hint || begin_hint->to() != begin_pos || end_hint->from() != end_pos) { |
| 5830 | // register_hint must be split, otherwise the re-writing of use positions does not work |
| 5831 | return; |
| 5832 | } |
| 5833 | |
| 5834 | assert(begin_hint->assigned_reg() != any_reg, "must have register assigned")do { if (!(begin_hint->assigned_reg() != any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5834, "assert(" "begin_hint->assigned_reg() != any_reg" ") failed" , "must have register assigned"); ::breakpoint(); } } while ( 0); |
| 5835 | assert(end_hint->assigned_reg() == any_reg, "must not have register assigned")do { if (!(end_hint->assigned_reg() == any_reg)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5835, "assert(" "end_hint->assigned_reg() == any_reg" ") failed" , "must not have register assigned"); ::breakpoint(); } } while (0); |
| 5836 | assert(cur->first_usage(mustHaveRegister) == begin_pos, "must have use position at begin of interval because of move")do { if (!(cur->first_usage(mustHaveRegister) == begin_pos )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5836, "assert(" "cur->first_usage(mustHaveRegister) == begin_pos" ") failed", "must have use position at begin of interval because of move" ); ::breakpoint(); } } while (0); |
| 5837 | assert(end_hint->first_usage(mustHaveRegister) == end_pos, "must have use position at begin of interval because of move")do { if (!(end_hint->first_usage(mustHaveRegister) == end_pos )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5837, "assert(" "end_hint->first_usage(mustHaveRegister) == end_pos" ") failed", "must have use position at begin of interval because of move" ); ::breakpoint(); } } while (0); |
| 5838 | |
| 5839 | if (begin_hint->assigned_reg() < LinearScan::nof_regs) { |
| 5840 | // register_hint is not spilled at begin_pos, so it would not be benefitial to immediately spill cur |
| 5841 | return; |
| 5842 | } |
| 5843 | assert(register_hint->canonical_spill_slot() != -1, "must be set when part of interval was spilled")do { if (!(register_hint->canonical_spill_slot() != -1)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5843, "assert(" "register_hint->canonical_spill_slot() != -1" ") failed", "must be set when part of interval was spilled") ; ::breakpoint(); } } while (0); |
| 5844 | assert(!cur->intersects(register_hint), "cur should not intersect register_hint")do { if (!(!cur->intersects(register_hint))) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5844, "assert(" "!cur->intersects(register_hint)" ") failed" , "cur should not intersect register_hint"); ::breakpoint(); } } while (0); |
| 5845 | |
| 5846 | if (cur->intersects_any_children_of(register_hint)) { |
| 5847 | // Bail out if cur intersects any split children of register_hint, which have the same spill slot as their parent. An overlap of two intervals with |
| 5848 | // the same spill slot could result in a situation where both intervals are spilled at the same time to the same stack location which is not correct. |
| 5849 | return; |
| 5850 | } |
| 5851 | |
| 5852 | // modify intervals such that cur gets the same stack slot as register_hint |
| 5853 | // delete use positions to prevent the intervals to get a register at beginning |
| 5854 | cur->set_canonical_spill_slot(register_hint->canonical_spill_slot()); |
| 5855 | cur->remove_first_use_pos(); |
| 5856 | end_hint->remove_first_use_pos(); |
| 5857 | } |
| 5858 | |
| 5859 | |
| 5860 | // allocate a physical register or memory location to an interval |
| 5861 | bool LinearScanWalker::activate_current() { |
| 5862 | Interval* cur = current(); |
| 5863 | bool result = true; |
| 5864 | |
| 5865 | TRACE_LINEAR_SCAN(2, tty->print ("+++++ activating interval "); cur->print())if (TraceLinearScanLevel >= 2) { tty->print ("+++++ activating interval " ); cur->print(); }; |
| 5866 | TRACE_LINEAR_SCAN(4, tty->print_cr(" split_parent: %d, insert_move_when_activated: %d", cur->split_parent()->reg_num(), cur->insert_move_when_activated()))if (TraceLinearScanLevel >= 4) { tty->print_cr(" split_parent: %d, insert_move_when_activated: %d" , cur->split_parent()->reg_num(), cur->insert_move_when_activated ()); }; |
| 5867 | |
| 5868 | if (cur->assigned_reg() >= LinearScan::nof_regs) { |
| 5869 | // activating an interval that has a stack slot assigned -> split it at first use position |
| 5870 | // used for method parameters |
| 5871 | TRACE_LINEAR_SCAN(4, tty->print_cr(" interval has spill slot assigned (method parameter) -> split it before first use"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" interval has spill slot assigned (method parameter) -> split it before first use" ); }; |
| 5872 | |
| 5873 | split_stack_interval(cur); |
| 5874 | result = false; |
| 5875 | |
| 5876 | } else if (allocator()->gen()->is_vreg_flag_set(cur->reg_num(), LIRGenerator::must_start_in_memory)) { |
| 5877 | // activating an interval that must start in a stack slot, but may get a register later |
| 5878 | // used for lir_roundfp: rounding is done by store to stack and reload later |
| 5879 | TRACE_LINEAR_SCAN(4, tty->print_cr(" interval must start in stack slot -> split it before first use"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" interval must start in stack slot -> split it before first use" ); }; |
| 5880 | assert(cur->assigned_reg() == any_reg && cur->assigned_regHi() == any_reg, "register already assigned")do { if (!(cur->assigned_reg() == any_reg && cur-> assigned_regHi() == any_reg)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5880, "assert(" "cur->assigned_reg() == any_reg && cur->assigned_regHi() == any_reg" ") failed", "register already assigned"); ::breakpoint(); } } while (0); |
| 5881 | |
| 5882 | allocator()->assign_spill_slot(cur); |
| 5883 | split_stack_interval(cur); |
| 5884 | result = false; |
| 5885 | |
| 5886 | } else if (cur->assigned_reg() == any_reg) { |
| 5887 | // interval has not assigned register -> normal allocation |
| 5888 | // (this is the normal case for most intervals) |
| 5889 | TRACE_LINEAR_SCAN(4, tty->print_cr(" normal allocation of register"))if (TraceLinearScanLevel >= 4) { tty->print_cr(" normal allocation of register" ); }; |
| 5890 | |
| 5891 | // assign same spill slot to non-intersecting intervals |
| 5892 | combine_spilled_intervals(cur); |
| 5893 | |
| 5894 | init_vars_for_alloc(cur); |
| 5895 | if (no_allocation_possible(cur) || !alloc_free_reg(cur)) { |
| 5896 | // no empty register available. |
| 5897 | // split and spill another interval so that this interval gets a register |
| 5898 | alloc_locked_reg(cur); |
| 5899 | } |
| 5900 | |
| 5901 | // spilled intervals need not be move to active-list |
| 5902 | if (cur->assigned_reg() >= LinearScan::nof_regs) { |
| 5903 | result = false; |
| 5904 | } |
| 5905 | } |
| 5906 | |
| 5907 | // load spilled values that become active from stack slot to register |
| 5908 | if (cur->insert_move_when_activated()) { |
| 5909 | assert(cur->is_split_child(), "must be")do { if (!(cur->is_split_child())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5909, "assert(" "cur->is_split_child()" ") failed", "must be" ); ::breakpoint(); } } while (0); |
| 5910 | assert(cur->current_split_child() != NULL, "must be")do { if (!(cur->current_split_child() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5910, "assert(" "cur->current_split_child() != __null" ") failed" , "must be"); ::breakpoint(); } } while (0); |
| 5911 | assert(cur->current_split_child()->reg_num() != cur->reg_num(), "cannot insert move between same interval")do { if (!(cur->current_split_child()->reg_num() != cur ->reg_num())) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5911, "assert(" "cur->current_split_child()->reg_num() != cur->reg_num()" ") failed", "cannot insert move between same interval"); ::breakpoint (); } } while (0); |
| 5912 | TRACE_LINEAR_SCAN(4, tty->print_cr("Inserting move from interval %d to %d because insert_move_when_activated is set", cur->current_split_child()->reg_num(), cur->reg_num()))if (TraceLinearScanLevel >= 4) { tty->print_cr("Inserting move from interval %d to %d because insert_move_when_activated is set" , cur->current_split_child()->reg_num(), cur->reg_num ()); }; |
| 5913 | |
| 5914 | insert_move(cur->from(), cur->current_split_child(), cur); |
| 5915 | } |
| 5916 | cur->make_current_split_child(); |
| 5917 | |
| 5918 | return result; // true = interval is moved to active list |
| 5919 | } |
| 5920 | |
| 5921 | |
| 5922 | // Implementation of EdgeMoveOptimizer |
| 5923 | |
| 5924 | EdgeMoveOptimizer::EdgeMoveOptimizer() : |
| 5925 | _edge_instructions(4), |
| 5926 | _edge_instructions_idx(4) |
| 5927 | { |
| 5928 | } |
| 5929 | |
| 5930 | void EdgeMoveOptimizer::optimize(BlockList* code) { |
| 5931 | EdgeMoveOptimizer optimizer = EdgeMoveOptimizer(); |
| 5932 | |
| 5933 | // ignore the first block in the list (index 0 is not processed) |
| 5934 | for (int i = code->length() - 1; i >= 1; i--) { |
| 5935 | BlockBegin* block = code->at(i); |
| 5936 | |
| 5937 | if (block->number_of_preds() > 1 && !block->is_set(BlockBegin::exception_entry_flag)) { |
| 5938 | optimizer.optimize_moves_at_block_end(block); |
| 5939 | } |
| 5940 | if (block->number_of_sux() == 2) { |
| 5941 | optimizer.optimize_moves_at_block_begin(block); |
| 5942 | } |
| 5943 | } |
| 5944 | } |
| 5945 | |
| 5946 | |
| 5947 | // clear all internal data structures |
| 5948 | void EdgeMoveOptimizer::init_instructions() { |
| 5949 | _edge_instructions.clear(); |
| 5950 | _edge_instructions_idx.clear(); |
| 5951 | } |
| 5952 | |
| 5953 | // append a lir-instruction-list and the index of the current operation in to the list |
| 5954 | void EdgeMoveOptimizer::append_instructions(LIR_OpList* instructions, int instructions_idx) { |
| 5955 | _edge_instructions.append(instructions); |
| 5956 | _edge_instructions_idx.append(instructions_idx); |
| 5957 | } |
| 5958 | |
| 5959 | // return the current operation of the given edge (predecessor or successor) |
| 5960 | LIR_Op* EdgeMoveOptimizer::instruction_at(int edge) { |
| 5961 | LIR_OpList* instructions = _edge_instructions.at(edge); |
| 5962 | int idx = _edge_instructions_idx.at(edge); |
| 5963 | |
| 5964 | if (idx < instructions->length()) { |
| 5965 | return instructions->at(idx); |
| 5966 | } else { |
| 5967 | return NULL__null; |
| 5968 | } |
| 5969 | } |
| 5970 | |
| 5971 | // removes the current operation of the given edge (predecessor or successor) |
| 5972 | void EdgeMoveOptimizer::remove_cur_instruction(int edge, bool decrement_index) { |
| 5973 | LIR_OpList* instructions = _edge_instructions.at(edge); |
| 5974 | int idx = _edge_instructions_idx.at(edge); |
| 5975 | instructions->remove_at(idx); |
| 5976 | |
| 5977 | if (decrement_index) { |
| 5978 | _edge_instructions_idx.at_put(edge, idx - 1); |
| 5979 | } |
| 5980 | } |
| 5981 | |
| 5982 | |
| 5983 | bool EdgeMoveOptimizer::operations_different(LIR_Op* op1, LIR_Op* op2) { |
| 5984 | if (op1 == NULL__null || op2 == NULL__null) { |
| 5985 | // at least one block is already empty -> no optimization possible |
| 5986 | return true; |
| 5987 | } |
| 5988 | |
| 5989 | if (op1->code() == lir_move && op2->code() == lir_move) { |
| 5990 | assert(op1->as_Op1() != NULL, "move must be LIR_Op1")do { if (!(op1->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5990, "assert(" "op1->as_Op1() != __null" ") failed", "move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 5991 | assert(op2->as_Op1() != NULL, "move must be LIR_Op1")do { if (!(op2->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 5991, "assert(" "op2->as_Op1() != __null" ") failed", "move must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 5992 | LIR_Op1* move1 = (LIR_Op1*)op1; |
| 5993 | LIR_Op1* move2 = (LIR_Op1*)op2; |
| 5994 | if (move1->info() == move2->info() && move1->in_opr() == move2->in_opr() && move1->result_opr() == move2->result_opr()) { |
| 5995 | // these moves are exactly equal and can be optimized |
| 5996 | return false; |
| 5997 | } |
| 5998 | |
| 5999 | } else if (op1->code() == lir_fxch && op2->code() == lir_fxch) { |
| 6000 | assert(op1->as_Op1() != NULL, "fxch must be LIR_Op1")do { if (!(op1->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6000, "assert(" "op1->as_Op1() != __null" ") failed", "fxch must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 6001 | assert(op2->as_Op1() != NULL, "fxch must be LIR_Op1")do { if (!(op2->as_Op1() != __null)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6001, "assert(" "op2->as_Op1() != __null" ") failed", "fxch must be LIR_Op1" ); ::breakpoint(); } } while (0); |
| 6002 | LIR_Op1* fxch1 = (LIR_Op1*)op1; |
| 6003 | LIR_Op1* fxch2 = (LIR_Op1*)op2; |
| 6004 | if (fxch1->in_opr()->as_jint() == fxch2->in_opr()->as_jint()) { |
| 6005 | // equal FPU stack operations can be optimized |
| 6006 | return false; |
| 6007 | } |
| 6008 | |
| 6009 | } else if (op1->code() == lir_fpop_raw && op2->code() == lir_fpop_raw) { |
| 6010 | // equal FPU stack operations can be optimized |
| 6011 | return false; |
| 6012 | } |
| 6013 | |
| 6014 | // no optimization possible |
| 6015 | return true; |
| 6016 | } |
| 6017 | |
| 6018 | void EdgeMoveOptimizer::optimize_moves_at_block_end(BlockBegin* block) { |
| 6019 | TRACE_LINEAR_SCAN(4, tty->print_cr("optimizing moves at end of block B%d", block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print_cr("optimizing moves at end of block B%d" , block->block_id()); }; |
| 6020 | |
| 6021 | if (block->is_predecessor(block)) { |
| 6022 | // currently we can't handle this correctly. |
| 6023 | return; |
| 6024 | } |
| 6025 | |
| 6026 | init_instructions(); |
| 6027 | int num_preds = block->number_of_preds(); |
| 6028 | assert(num_preds > 1, "do not call otherwise")do { if (!(num_preds > 1)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6028, "assert(" "num_preds > 1" ") failed", "do not call otherwise" ); ::breakpoint(); } } while (0); |
| 6029 | assert(!block->is_set(BlockBegin::exception_entry_flag), "exception handlers not allowed")do { if (!(!block->is_set(BlockBegin::exception_entry_flag ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6029, "assert(" "!block->is_set(BlockBegin::exception_entry_flag)" ") failed", "exception handlers not allowed"); ::breakpoint( ); } } while (0); |
| 6030 | |
| 6031 | // setup a list with the lir-instructions of all predecessors |
| 6032 | int i; |
| 6033 | for (i = 0; i < num_preds; i++) { |
| 6034 | BlockBegin* pred = block->pred_at(i); |
| 6035 | LIR_OpList* pred_instructions = pred->lir()->instructions_list(); |
| 6036 | |
| 6037 | if (pred->number_of_sux() != 1) { |
| 6038 | // this can happen with switch-statements where multiple edges are between |
| 6039 | // the same blocks. |
| 6040 | return; |
| 6041 | } |
| 6042 | |
| 6043 | assert(pred->number_of_sux() == 1, "can handle only one successor")do { if (!(pred->number_of_sux() == 1)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6043, "assert(" "pred->number_of_sux() == 1" ") failed", "can handle only one successor"); ::breakpoint(); } } while ( 0); |
| 6044 | assert(pred->sux_at(0) == block, "invalid control flow")do { if (!(pred->sux_at(0) == block)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6044, "assert(" "pred->sux_at(0) == block" ") failed", "invalid control flow" ); ::breakpoint(); } } while (0); |
| 6045 | assert(pred_instructions->last()->code() == lir_branch, "block with successor must end with branch")do { if (!(pred_instructions->last()->code() == lir_branch )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6045, "assert(" "pred_instructions->last()->code() == lir_branch" ") failed", "block with successor must end with branch"); :: breakpoint(); } } while (0); |
| 6046 | assert(pred_instructions->last()->as_OpBranch() != NULL, "branch must be LIR_OpBranch")do { if (!(pred_instructions->last()->as_OpBranch() != __null )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6046, "assert(" "pred_instructions->last()->as_OpBranch() != __null" ") failed", "branch must be LIR_OpBranch"); ::breakpoint(); } } while (0); |
| 6047 | assert(pred_instructions->last()->as_OpBranch()->cond() == lir_cond_always, "block must end with unconditional branch")do { if (!(pred_instructions->last()->as_OpBranch()-> cond() == lir_cond_always)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6047, "assert(" "pred_instructions->last()->as_OpBranch()->cond() == lir_cond_always" ") failed", "block must end with unconditional branch"); ::breakpoint (); } } while (0); |
| 6048 | |
| 6049 | if (pred_instructions->last()->info() != NULL__null) { |
| 6050 | // can not optimize instructions when debug info is needed |
| 6051 | return; |
| 6052 | } |
| 6053 | |
| 6054 | // ignore the unconditional branch at the end of the block |
| 6055 | append_instructions(pred_instructions, pred_instructions->length() - 2); |
| 6056 | } |
| 6057 | |
| 6058 | |
| 6059 | // process lir-instructions while all predecessors end with the same instruction |
| 6060 | while (true) { |
| 6061 | LIR_Op* op = instruction_at(0); |
| 6062 | for (i = 1; i < num_preds; i++) { |
| 6063 | if (operations_different(op, instruction_at(i))) { |
| 6064 | // these instructions are different and cannot be optimized -> |
| 6065 | // no further optimization possible |
| 6066 | return; |
| 6067 | } |
| 6068 | } |
| 6069 | |
| 6070 | TRACE_LINEAR_SCAN(4, tty->print("found instruction that is equal in all %d predecessors: ", num_preds); op->print())if (TraceLinearScanLevel >= 4) { tty->print("found instruction that is equal in all %d predecessors: " , num_preds); op->print(); }; |
| 6071 | |
| 6072 | // insert the instruction at the beginning of the current block |
| 6073 | block->lir()->insert_before(1, op); |
| 6074 | |
| 6075 | // delete the instruction at the end of all predecessors |
| 6076 | for (i = 0; i < num_preds; i++) { |
| 6077 | remove_cur_instruction(i, true); |
| 6078 | } |
| 6079 | } |
| 6080 | } |
| 6081 | |
| 6082 | |
| 6083 | void EdgeMoveOptimizer::optimize_moves_at_block_begin(BlockBegin* block) { |
| 6084 | TRACE_LINEAR_SCAN(4, tty->print_cr("optimization moves at begin of block B%d", block->block_id()))if (TraceLinearScanLevel >= 4) { tty->print_cr("optimization moves at begin of block B%d" , block->block_id()); }; |
| 6085 | |
| 6086 | init_instructions(); |
| 6087 | int num_sux = block->number_of_sux(); |
| 6088 | |
| 6089 | LIR_OpList* cur_instructions = block->lir()->instructions_list(); |
| 6090 | |
| 6091 | assert(num_sux == 2, "method should not be called otherwise")do { if (!(num_sux == 2)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6091, "assert(" "num_sux == 2" ") failed", "method should not be called otherwise" ); ::breakpoint(); } } while (0); |
| 6092 | assert(cur_instructions->last()->code() == lir_branch, "block with successor must end with branch")do { if (!(cur_instructions->last()->code() == lir_branch )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6092, "assert(" "cur_instructions->last()->code() == lir_branch" ") failed", "block with successor must end with branch"); :: breakpoint(); } } while (0); |
| 6093 | assert(cur_instructions->last()->as_OpBranch() != NULL, "branch must be LIR_OpBranch")do { if (!(cur_instructions->last()->as_OpBranch() != __null )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6093, "assert(" "cur_instructions->last()->as_OpBranch() != __null" ") failed", "branch must be LIR_OpBranch"); ::breakpoint(); } } while (0); |
| 6094 | assert(cur_instructions->last()->as_OpBranch()->cond() == lir_cond_always, "block must end with unconditional branch")do { if (!(cur_instructions->last()->as_OpBranch()-> cond() == lir_cond_always)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6094, "assert(" "cur_instructions->last()->as_OpBranch()->cond() == lir_cond_always" ") failed", "block must end with unconditional branch"); ::breakpoint (); } } while (0); |
| 6095 | |
| 6096 | if (cur_instructions->last()->info() != NULL__null) { |
| 6097 | // can no optimize instructions when debug info is needed |
| 6098 | return; |
| 6099 | } |
| 6100 | |
| 6101 | LIR_Op* branch = cur_instructions->at(cur_instructions->length() - 2); |
| 6102 | if (branch->info() != NULL__null || (branch->code() != lir_branch && branch->code() != lir_cond_float_branch)) { |
| 6103 | // not a valid case for optimization |
| 6104 | // currently, only blocks that end with two branches (conditional branch followed |
| 6105 | // by unconditional branch) are optimized |
| 6106 | return; |
| 6107 | } |
| 6108 | |
| 6109 | // now it is guaranteed that the block ends with two branch instructions. |
| 6110 | // the instructions are inserted at the end of the block before these two branches |
| 6111 | int insert_idx = cur_instructions->length() - 2; |
| 6112 | |
| 6113 | int i; |
| 6114 | #ifdef ASSERT1 |
| 6115 | for (i = insert_idx - 1; i >= 0; i--) { |
| 6116 | LIR_Op* op = cur_instructions->at(i); |
| 6117 | if ((op->code() == lir_branch || op->code() == lir_cond_float_branch) && ((LIR_OpBranch*)op)->block() != NULL__null) { |
| 6118 | assert(false, "block with two successors can have only two branch instructions")do { if (!(false)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6118, "assert(" "false" ") failed", "block with two successors can have only two branch instructions" ); ::breakpoint(); } } while (0); |
| 6119 | } |
| 6120 | } |
| 6121 | #endif |
| 6122 | |
| 6123 | // setup a list with the lir-instructions of all successors |
| 6124 | for (i = 0; i < num_sux; i++) { |
| 6125 | BlockBegin* sux = block->sux_at(i); |
| 6126 | LIR_OpList* sux_instructions = sux->lir()->instructions_list(); |
| 6127 | |
| 6128 | assert(sux_instructions->at(0)->code() == lir_label, "block must start with label")do { if (!(sux_instructions->at(0)->code() == lir_label )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6128, "assert(" "sux_instructions->at(0)->code() == lir_label" ") failed", "block must start with label"); ::breakpoint(); } } while (0); |
| 6129 | |
| 6130 | if (sux->number_of_preds() != 1) { |
| 6131 | // this can happen with switch-statements where multiple edges are between |
| 6132 | // the same blocks. |
| 6133 | return; |
| 6134 | } |
| 6135 | assert(sux->pred_at(0) == block, "invalid control flow")do { if (!(sux->pred_at(0) == block)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6135, "assert(" "sux->pred_at(0) == block" ") failed", "invalid control flow" ); ::breakpoint(); } } while (0); |
| 6136 | assert(!sux->is_set(BlockBegin::exception_entry_flag), "exception handlers not allowed")do { if (!(!sux->is_set(BlockBegin::exception_entry_flag)) ) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6136, "assert(" "!sux->is_set(BlockBegin::exception_entry_flag)" ") failed", "exception handlers not allowed"); ::breakpoint( ); } } while (0); |
| 6137 | |
| 6138 | // ignore the label at the beginning of the block |
| 6139 | append_instructions(sux_instructions, 1); |
| 6140 | } |
| 6141 | |
| 6142 | // process lir-instructions while all successors begin with the same instruction |
| 6143 | while (true) { |
| 6144 | LIR_Op* op = instruction_at(0); |
| 6145 | for (i = 1; i < num_sux; i++) { |
| 6146 | if (operations_different(op, instruction_at(i))) { |
| 6147 | // these instructions are different and cannot be optimized -> |
| 6148 | // no further optimization possible |
| 6149 | return; |
| 6150 | } |
| 6151 | } |
| 6152 | |
| 6153 | TRACE_LINEAR_SCAN(4, tty->print("----- found instruction that is equal in all %d successors: ", num_sux); op->print())if (TraceLinearScanLevel >= 4) { tty->print("----- found instruction that is equal in all %d successors: " , num_sux); op->print(); }; |
| 6154 | |
| 6155 | // insert instruction at end of current block |
| 6156 | block->lir()->insert_before(insert_idx, op); |
| 6157 | insert_idx++; |
| 6158 | |
| 6159 | // delete the instructions at the beginning of all successors |
| 6160 | for (i = 0; i < num_sux; i++) { |
| 6161 | remove_cur_instruction(i, false); |
| 6162 | } |
| 6163 | } |
| 6164 | } |
| 6165 | |
| 6166 | |
| 6167 | // Implementation of ControlFlowOptimizer |
| 6168 | |
| 6169 | ControlFlowOptimizer::ControlFlowOptimizer() : |
| 6170 | _original_preds(4) |
| 6171 | { |
| 6172 | } |
| 6173 | |
| 6174 | void ControlFlowOptimizer::optimize(BlockList* code) { |
| 6175 | ControlFlowOptimizer optimizer = ControlFlowOptimizer(); |
| 6176 | |
| 6177 | // push the OSR entry block to the end so that we're not jumping over it. |
| 6178 | BlockBegin* osr_entry = code->at(0)->end()->as_Base()->osr_entry(); |
| 6179 | if (osr_entry) { |
| 6180 | int index = osr_entry->linear_scan_number(); |
| 6181 | assert(code->at(index) == osr_entry, "wrong index")do { if (!(code->at(index) == osr_entry)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6181, "assert(" "code->at(index) == osr_entry" ") failed" , "wrong index"); ::breakpoint(); } } while (0); |
| 6182 | code->remove_at(index); |
| 6183 | code->append(osr_entry); |
| 6184 | } |
| 6185 | |
| 6186 | optimizer.reorder_short_loops(code); |
| 6187 | optimizer.delete_empty_blocks(code); |
| 6188 | optimizer.delete_unnecessary_jumps(code); |
| 6189 | optimizer.delete_jumps_to_return(code); |
| 6190 | } |
| 6191 | |
| 6192 | void ControlFlowOptimizer::reorder_short_loop(BlockList* code, BlockBegin* header_block, int header_idx) { |
| 6193 | int i = header_idx + 1; |
| 6194 | int max_end = MIN2(header_idx + ShortLoopSize, code->length()); |
| 6195 | while (i < max_end && code->at(i)->loop_depth() >= header_block->loop_depth()) { |
| 6196 | i++; |
| 6197 | } |
| 6198 | |
| 6199 | if (i == code->length() || code->at(i)->loop_depth() < header_block->loop_depth()) { |
| 6200 | int end_idx = i - 1; |
| 6201 | BlockBegin* end_block = code->at(end_idx); |
| 6202 | |
| 6203 | if (end_block->number_of_sux() == 1 && end_block->sux_at(0) == header_block) { |
| 6204 | // short loop from header_idx to end_idx found -> reorder blocks such that |
| 6205 | // the header_block is the last block instead of the first block of the loop |
| 6206 | TRACE_LINEAR_SCAN(1, tty->print_cr("Reordering short loop: length %d, header B%d, end B%d",if (TraceLinearScanLevel >= 1) { tty->print_cr("Reordering short loop: length %d, header B%d, end B%d" , end_idx - header_idx + 1, header_block->block_id(), end_block ->block_id()); } |
| 6207 | end_idx - header_idx + 1,if (TraceLinearScanLevel >= 1) { tty->print_cr("Reordering short loop: length %d, header B%d, end B%d" , end_idx - header_idx + 1, header_block->block_id(), end_block ->block_id()); } |
| 6208 | header_block->block_id(), end_block->block_id()))if (TraceLinearScanLevel >= 1) { tty->print_cr("Reordering short loop: length %d, header B%d, end B%d" , end_idx - header_idx + 1, header_block->block_id(), end_block ->block_id()); }; |
| 6209 | |
| 6210 | for (int j = header_idx; j < end_idx; j++) { |
| 6211 | code->at_put(j, code->at(j + 1)); |
| 6212 | } |
| 6213 | code->at_put(end_idx, header_block); |
| 6214 | |
| 6215 | // correct the flags so that any loop alignment occurs in the right place. |
| 6216 | assert(code->at(end_idx)->is_set(BlockBegin::backward_branch_target_flag), "must be backward branch target")do { if (!(code->at(end_idx)->is_set(BlockBegin::backward_branch_target_flag ))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6216, "assert(" "code->at(end_idx)->is_set(BlockBegin::backward_branch_target_flag)" ") failed", "must be backward branch target"); ::breakpoint( ); } } while (0); |
| 6217 | code->at(end_idx)->clear(BlockBegin::backward_branch_target_flag); |
| 6218 | code->at(header_idx)->set(BlockBegin::backward_branch_target_flag); |
| 6219 | } |
| 6220 | } |
| 6221 | } |
| 6222 | |
| 6223 | void ControlFlowOptimizer::reorder_short_loops(BlockList* code) { |
| 6224 | for (int i = code->length() - 1; i >= 0; i--) { |
| 6225 | BlockBegin* block = code->at(i); |
| 6226 | |
| 6227 | if (block->is_set(BlockBegin::linear_scan_loop_header_flag)) { |
| 6228 | reorder_short_loop(code, block, i); |
| 6229 | } |
| 6230 | } |
| 6231 | |
| 6232 | DEBUG_ONLY(verify(code))verify(code); |
| 6233 | } |
| 6234 | |
| 6235 | // only blocks with exactly one successor can be deleted. Such blocks |
| 6236 | // must always end with an unconditional branch to this successor |
| 6237 | bool ControlFlowOptimizer::can_delete_block(BlockBegin* block) { |
| 6238 | if (block->number_of_sux() != 1 || block->number_of_exception_handlers() != 0 || block->is_entry_block()) { |
| 6239 | return false; |
| 6240 | } |
| 6241 | |
| 6242 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 6243 | |
| 6244 | assert(instructions->length() >= 2, "block must have label and branch")do { if (!(instructions->length() >= 2)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6244, "assert(" "instructions->length() >= 2" ") failed" , "block must have label and branch"); ::breakpoint(); } } while (0); |
| 6245 | assert(instructions->at(0)->code() == lir_label, "first instruction must always be a label")do { if (!(instructions->at(0)->code() == lir_label)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6245, "assert(" "instructions->at(0)->code() == lir_label" ") failed", "first instruction must always be a label"); ::breakpoint (); } } while (0); |
| 6246 | assert(instructions->last()->as_OpBranch() != NULL, "last instrcution must always be a branch")do { if (!(instructions->last()->as_OpBranch() != __null )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6246, "assert(" "instructions->last()->as_OpBranch() != __null" ") failed", "last instrcution must always be a branch"); ::breakpoint (); } } while (0); |
| 6247 | assert(instructions->last()->as_OpBranch()->cond() == lir_cond_always, "branch must be unconditional")do { if (!(instructions->last()->as_OpBranch()->cond () == lir_cond_always)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6247, "assert(" "instructions->last()->as_OpBranch()->cond() == lir_cond_always" ") failed", "branch must be unconditional"); ::breakpoint(); } } while (0); |
| 6248 | assert(instructions->last()->as_OpBranch()->block() == block->sux_at(0), "branch target must be the successor")do { if (!(instructions->last()->as_OpBranch()->block () == block->sux_at(0))) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6248, "assert(" "instructions->last()->as_OpBranch()->block() == block->sux_at(0)" ") failed", "branch target must be the successor"); ::breakpoint (); } } while (0); |
| 6249 | |
| 6250 | // block must have exactly one successor |
| 6251 | |
| 6252 | if (instructions->length() == 2 && instructions->last()->info() == NULL__null) { |
| 6253 | return true; |
| 6254 | } |
| 6255 | return false; |
| 6256 | } |
| 6257 | |
| 6258 | // substitute branch targets in all branch-instructions of this blocks |
| 6259 | void ControlFlowOptimizer::substitute_branch_target(BlockBegin* block, BlockBegin* target_from, BlockBegin* target_to) { |
| 6260 | TRACE_LINEAR_SCAN(3, tty->print_cr("Deleting empty block: substituting from B%d to B%d inside B%d", target_from->block_id(), target_to->block_id(), block->block_id()))if (TraceLinearScanLevel >= 3) { tty->print_cr("Deleting empty block: substituting from B%d to B%d inside B%d" , target_from->block_id(), target_to->block_id(), block ->block_id()); }; |
| 6261 | |
| 6262 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 6263 | |
| 6264 | assert(instructions->at(0)->code() == lir_label, "first instruction must always be a label")do { if (!(instructions->at(0)->code() == lir_label)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6264, "assert(" "instructions->at(0)->code() == lir_label" ") failed", "first instruction must always be a label"); ::breakpoint (); } } while (0); |
| 6265 | for (int i = instructions->length() - 1; i >= 1; i--) { |
| 6266 | LIR_Op* op = instructions->at(i); |
| 6267 | |
| 6268 | if (op->code() == lir_branch || op->code() == lir_cond_float_branch) { |
| 6269 | assert(op->as_OpBranch() != NULL, "branch must be of type LIR_OpBranch")do { if (!(op->as_OpBranch() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6269, "assert(" "op->as_OpBranch() != __null" ") failed" , "branch must be of type LIR_OpBranch"); ::breakpoint(); } } while (0); |
| 6270 | LIR_OpBranch* branch = (LIR_OpBranch*)op; |
| 6271 | |
| 6272 | if (branch->block() == target_from) { |
| 6273 | branch->change_block(target_to); |
| 6274 | } |
| 6275 | if (branch->ublock() == target_from) { |
| 6276 | branch->change_ublock(target_to); |
| 6277 | } |
| 6278 | } |
| 6279 | } |
| 6280 | } |
| 6281 | |
| 6282 | void ControlFlowOptimizer::delete_empty_blocks(BlockList* code) { |
| 6283 | int old_pos = 0; |
| 6284 | int new_pos = 0; |
| 6285 | int num_blocks = code->length(); |
| 6286 | |
| 6287 | while (old_pos < num_blocks) { |
| 6288 | BlockBegin* block = code->at(old_pos); |
| 6289 | |
| 6290 | if (can_delete_block(block)) { |
| 6291 | BlockBegin* new_target = block->sux_at(0); |
| 6292 | |
| 6293 | // propagate backward branch target flag for correct code alignment |
| 6294 | if (block->is_set(BlockBegin::backward_branch_target_flag)) { |
| 6295 | new_target->set(BlockBegin::backward_branch_target_flag); |
| 6296 | } |
| 6297 | |
| 6298 | // collect a list with all predecessors that contains each predecessor only once |
| 6299 | // the predecessors of cur are changed during the substitution, so a copy of the |
| 6300 | // predecessor list is necessary |
| 6301 | int j; |
| 6302 | _original_preds.clear(); |
| 6303 | for (j = block->number_of_preds() - 1; j >= 0; j--) { |
| 6304 | BlockBegin* pred = block->pred_at(j); |
| 6305 | if (_original_preds.find(pred) == -1) { |
| 6306 | _original_preds.append(pred); |
| 6307 | } |
| 6308 | } |
| 6309 | |
| 6310 | for (j = _original_preds.length() - 1; j >= 0; j--) { |
| 6311 | BlockBegin* pred = _original_preds.at(j); |
| 6312 | substitute_branch_target(pred, block, new_target); |
| 6313 | pred->substitute_sux(block, new_target); |
| 6314 | } |
| 6315 | } else { |
| 6316 | // adjust position of this block in the block list if blocks before |
| 6317 | // have been deleted |
| 6318 | if (new_pos != old_pos) { |
| 6319 | code->at_put(new_pos, code->at(old_pos)); |
| 6320 | } |
| 6321 | new_pos++; |
| 6322 | } |
| 6323 | old_pos++; |
| 6324 | } |
| 6325 | code->trunc_to(new_pos); |
| 6326 | |
| 6327 | DEBUG_ONLY(verify(code))verify(code); |
| 6328 | } |
| 6329 | |
| 6330 | void ControlFlowOptimizer::delete_unnecessary_jumps(BlockList* code) { |
| 6331 | // skip the last block because there a branch is always necessary |
| 6332 | for (int i = code->length() - 2; i >= 0; i--) { |
| 6333 | BlockBegin* block = code->at(i); |
| 6334 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 6335 | |
| 6336 | LIR_Op* last_op = instructions->last(); |
| 6337 | if (last_op->code() == lir_branch) { |
| 6338 | assert(last_op->as_OpBranch() != NULL, "branch must be of type LIR_OpBranch")do { if (!(last_op->as_OpBranch() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6338, "assert(" "last_op->as_OpBranch() != __null" ") failed" , "branch must be of type LIR_OpBranch"); ::breakpoint(); } } while (0); |
| 6339 | LIR_OpBranch* last_branch = (LIR_OpBranch*)last_op; |
| 6340 | |
| 6341 | assert(last_branch->block() != NULL, "last branch must always have a block as target")do { if (!(last_branch->block() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6341, "assert(" "last_branch->block() != __null" ") failed" , "last branch must always have a block as target"); ::breakpoint (); } } while (0); |
| 6342 | assert(last_branch->label() == last_branch->block()->label(), "must be equal")do { if (!(last_branch->label() == last_branch->block() ->label())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6342, "assert(" "last_branch->label() == last_branch->block()->label()" ") failed", "must be equal"); ::breakpoint(); } } while (0); |
| 6343 | |
| 6344 | if (last_branch->info() == NULL__null) { |
| 6345 | if (last_branch->block() == code->at(i + 1)) { |
| 6346 | |
| 6347 | TRACE_LINEAR_SCAN(3, tty->print_cr("Deleting unconditional branch at end of block B%d", block->block_id()))if (TraceLinearScanLevel >= 3) { tty->print_cr("Deleting unconditional branch at end of block B%d" , block->block_id()); }; |
| 6348 | |
| 6349 | // delete last branch instruction |
| 6350 | instructions->trunc_to(instructions->length() - 1); |
| 6351 | |
| 6352 | } else { |
| 6353 | LIR_Op* prev_op = instructions->at(instructions->length() - 2); |
| 6354 | if (prev_op->code() == lir_branch || prev_op->code() == lir_cond_float_branch) { |
| 6355 | assert(prev_op->as_OpBranch() != NULL, "branch must be of type LIR_OpBranch")do { if (!(prev_op->as_OpBranch() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6355, "assert(" "prev_op->as_OpBranch() != __null" ") failed" , "branch must be of type LIR_OpBranch"); ::breakpoint(); } } while (0); |
| 6356 | LIR_OpBranch* prev_branch = (LIR_OpBranch*)prev_op; |
| 6357 | |
| 6358 | if (prev_branch->stub() == NULL__null) { |
| 6359 | |
| 6360 | LIR_Op2* prev_cmp = NULL__null; |
| 6361 | // There might be a cmove inserted for profiling which depends on the same |
| 6362 | // compare. If we change the condition of the respective compare, we have |
| 6363 | // to take care of this cmove as well. |
| 6364 | LIR_Op2* prev_cmove = NULL__null; |
| 6365 | |
| 6366 | for(int j = instructions->length() - 3; j >= 0 && prev_cmp == NULL__null; j--) { |
| 6367 | prev_op = instructions->at(j); |
| 6368 | // check for the cmove |
| 6369 | if (prev_op->code() == lir_cmove) { |
| 6370 | assert(prev_op->as_Op2() != NULL, "cmove must be of type LIR_Op2")do { if (!(prev_op->as_Op2() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6370, "assert(" "prev_op->as_Op2() != __null" ") failed" , "cmove must be of type LIR_Op2"); ::breakpoint(); } } while (0); |
| 6371 | prev_cmove = (LIR_Op2*)prev_op; |
| 6372 | assert(prev_branch->cond() == prev_cmove->condition(), "should be the same")do { if (!(prev_branch->cond() == prev_cmove->condition ())) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6372, "assert(" "prev_branch->cond() == prev_cmove->condition()" ") failed", "should be the same"); ::breakpoint(); } } while (0); |
| 6373 | } |
| 6374 | if (prev_op->code() == lir_cmp) { |
| 6375 | assert(prev_op->as_Op2() != NULL, "branch must be of type LIR_Op2")do { if (!(prev_op->as_Op2() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6375, "assert(" "prev_op->as_Op2() != __null" ") failed" , "branch must be of type LIR_Op2"); ::breakpoint(); } } while (0); |
| 6376 | prev_cmp = (LIR_Op2*)prev_op; |
| 6377 | assert(prev_branch->cond() == prev_cmp->condition(), "should be the same")do { if (!(prev_branch->cond() == prev_cmp->condition() )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6377, "assert(" "prev_branch->cond() == prev_cmp->condition()" ") failed", "should be the same"); ::breakpoint(); } } while (0); |
| 6378 | } |
| 6379 | } |
| 6380 | // Guarantee because it is dereferenced below. |
| 6381 | guarantee(prev_cmp != NULL, "should have found comp instruction for branch")do { if (!(prev_cmp != __null)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6381, "guarantee(" "prev_cmp != NULL" ") failed", "should have found comp instruction for branch" ); ::breakpoint(); } } while (0); |
| 6382 | if (prev_branch->block() == code->at(i + 1) && prev_branch->info() == NULL__null) { |
| 6383 | |
| 6384 | TRACE_LINEAR_SCAN(3, tty->print_cr("Negating conditional branch and deleting unconditional branch at end of block B%d", block->block_id()))if (TraceLinearScanLevel >= 3) { tty->print_cr("Negating conditional branch and deleting unconditional branch at end of block B%d" , block->block_id()); }; |
| 6385 | |
| 6386 | // eliminate a conditional branch to the immediate successor |
| 6387 | prev_branch->change_block(last_branch->block()); |
| 6388 | prev_branch->negate_cond(); |
| 6389 | prev_cmp->set_condition(prev_branch->cond()); |
| 6390 | instructions->trunc_to(instructions->length() - 1); |
| 6391 | // if we do change the condition, we have to change the cmove as well |
| 6392 | if (prev_cmove != NULL__null) { |
| 6393 | prev_cmove->set_condition(prev_branch->cond()); |
| 6394 | LIR_Opr t = prev_cmove->in_opr1(); |
| 6395 | prev_cmove->set_in_opr1(prev_cmove->in_opr2()); |
| 6396 | prev_cmove->set_in_opr2(t); |
| 6397 | } |
| 6398 | } |
| 6399 | } |
| 6400 | } |
| 6401 | } |
| 6402 | } |
| 6403 | } |
| 6404 | } |
| 6405 | |
| 6406 | DEBUG_ONLY(verify(code))verify(code); |
| 6407 | } |
| 6408 | |
| 6409 | void ControlFlowOptimizer::delete_jumps_to_return(BlockList* code) { |
| 6410 | #ifdef ASSERT1 |
| 6411 | ResourceBitMap return_converted(BlockBegin::number_of_blocks()); |
| 6412 | #endif |
| 6413 | |
| 6414 | for (int i = code->length() - 1; i >= 0; i--) { |
| 6415 | BlockBegin* block = code->at(i); |
| 6416 | LIR_OpList* cur_instructions = block->lir()->instructions_list(); |
| 6417 | LIR_Op* cur_last_op = cur_instructions->last(); |
| 6418 | |
| 6419 | assert(cur_instructions->at(0)->code() == lir_label, "first instruction must always be a label")do { if (!(cur_instructions->at(0)->code() == lir_label )) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6419, "assert(" "cur_instructions->at(0)->code() == lir_label" ") failed", "first instruction must always be a label"); ::breakpoint (); } } while (0); |
| 6420 | if (cur_instructions->length() == 2 && cur_last_op->code() == lir_return) { |
| 6421 | // the block contains only a label and a return |
| 6422 | // if a predecessor ends with an unconditional jump to this block, then the jump |
| 6423 | // can be replaced with a return instruction |
| 6424 | // |
| 6425 | // Note: the original block with only a return statement cannot be deleted completely |
| 6426 | // because the predecessors might have other (conditional) jumps to this block |
| 6427 | // -> this may lead to unnecesary return instructions in the final code |
| 6428 | |
| 6429 | assert(cur_last_op->info() == NULL, "return instructions do not have debug information")do { if (!(cur_last_op->info() == __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6429, "assert(" "cur_last_op->info() == __null" ") failed" , "return instructions do not have debug information"); ::breakpoint (); } } while (0); |
| 6430 | assert(block->number_of_sux() == 0 ||do { if (!(block->number_of_sux() == 0 || (return_converted .at(block->block_id()) && block->number_of_sux( ) == 1))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6432, "assert(" "block->number_of_sux() == 0 || (return_converted.at(block->block_id()) && block->number_of_sux() == 1)" ") failed", "blocks that end with return must not have successors" ); ::breakpoint(); } } while (0) |
| 6431 | (return_converted.at(block->block_id()) && block->number_of_sux() == 1),do { if (!(block->number_of_sux() == 0 || (return_converted .at(block->block_id()) && block->number_of_sux( ) == 1))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6432, "assert(" "block->number_of_sux() == 0 || (return_converted.at(block->block_id()) && block->number_of_sux() == 1)" ") failed", "blocks that end with return must not have successors" ); ::breakpoint(); } } while (0) |
| 6432 | "blocks that end with return must not have successors")do { if (!(block->number_of_sux() == 0 || (return_converted .at(block->block_id()) && block->number_of_sux( ) == 1))) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6432, "assert(" "block->number_of_sux() == 0 || (return_converted.at(block->block_id()) && block->number_of_sux() == 1)" ") failed", "blocks that end with return must not have successors" ); ::breakpoint(); } } while (0); |
| 6433 | |
| 6434 | assert(cur_last_op->as_Op1() != NULL, "return must be LIR_Op1")do { if (!(cur_last_op->as_Op1() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6434, "assert(" "cur_last_op->as_Op1() != __null" ") failed" , "return must be LIR_Op1"); ::breakpoint(); } } while (0); |
| 6435 | LIR_Opr return_opr = ((LIR_Op1*)cur_last_op)->in_opr(); |
| 6436 | |
| 6437 | for (int j = block->number_of_preds() - 1; j >= 0; j--) { |
| 6438 | BlockBegin* pred = block->pred_at(j); |
| 6439 | LIR_OpList* pred_instructions = pred->lir()->instructions_list(); |
| 6440 | LIR_Op* pred_last_op = pred_instructions->last(); |
| 6441 | |
| 6442 | if (pred_last_op->code() == lir_branch) { |
| 6443 | assert(pred_last_op->as_OpBranch() != NULL, "branch must be LIR_OpBranch")do { if (!(pred_last_op->as_OpBranch() != __null)) { (*g_assert_poison ) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6443, "assert(" "pred_last_op->as_OpBranch() != __null" ") failed" , "branch must be LIR_OpBranch"); ::breakpoint(); } } while ( 0); |
| 6444 | LIR_OpBranch* pred_last_branch = (LIR_OpBranch*)pred_last_op; |
| 6445 | |
| 6446 | if (pred_last_branch->block() == block && pred_last_branch->cond() == lir_cond_always && pred_last_branch->info() == NULL__null) { |
| 6447 | // replace the jump to a return with a direct return |
| 6448 | // Note: currently the edge between the blocks is not deleted |
| 6449 | pred_instructions->at_put(pred_instructions->length() - 1, new LIR_OpReturn(return_opr)); |
| 6450 | #ifdef ASSERT1 |
| 6451 | return_converted.set_bit(pred->block_id()); |
| 6452 | #endif |
| 6453 | } |
| 6454 | } |
| 6455 | } |
| 6456 | } |
| 6457 | } |
| 6458 | } |
| 6459 | |
| 6460 | |
| 6461 | #ifdef ASSERT1 |
| 6462 | void ControlFlowOptimizer::verify(BlockList* code) { |
| 6463 | for (int i = 0; i < code->length(); i++) { |
| 6464 | BlockBegin* block = code->at(i); |
| 6465 | LIR_OpList* instructions = block->lir()->instructions_list(); |
| 6466 | |
| 6467 | int j; |
| 6468 | for (j = 0; j < instructions->length(); j++) { |
| 6469 | LIR_OpBranch* op_branch = instructions->at(j)->as_OpBranch(); |
| 6470 | |
| 6471 | if (op_branch != NULL__null) { |
| 6472 | assert(op_branch->block() == NULL || code->find(op_branch->block()) != -1, "branch target not valid")do { if (!(op_branch->block() == __null || code->find(op_branch ->block()) != -1)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6472, "assert(" "op_branch->block() == __null || code->find(op_branch->block()) != -1" ") failed", "branch target not valid"); ::breakpoint(); } } while (0); |
| 6473 | assert(op_branch->ublock() == NULL || code->find(op_branch->ublock()) != -1, "branch target not valid")do { if (!(op_branch->ublock() == __null || code->find( op_branch->ublock()) != -1)) { (*g_assert_poison) = 'X';; report_vm_error ("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6473, "assert(" "op_branch->ublock() == __null || code->find(op_branch->ublock()) != -1" ") failed", "branch target not valid"); ::breakpoint(); } } while (0); |
| 6474 | } |
| 6475 | } |
| 6476 | |
| 6477 | for (j = 0; j < block->number_of_sux() - 1; j++) { |
| 6478 | BlockBegin* sux = block->sux_at(j); |
| 6479 | assert(code->find(sux) != -1, "successor not valid")do { if (!(code->find(sux) != -1)) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6479, "assert(" "code->find(sux) != -1" ") failed", "successor not valid" ); ::breakpoint(); } } while (0); |
| 6480 | } |
| 6481 | |
| 6482 | for (j = 0; j < block->number_of_preds() - 1; j++) { |
| 6483 | BlockBegin* pred = block->pred_at(j); |
| 6484 | assert(code->find(pred) != -1, "successor not valid")do { if (!(code->find(pred) != -1)) { (*g_assert_poison) = 'X';; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6484, "assert(" "code->find(pred) != -1" ") failed", "successor not valid" ); ::breakpoint(); } } while (0); |
| 6485 | } |
| 6486 | } |
| 6487 | } |
| 6488 | #endif |
| 6489 | |
| 6490 | |
| 6491 | #ifndef PRODUCT |
| 6492 | |
| 6493 | // Implementation of LinearStatistic |
| 6494 | |
| 6495 | const char* LinearScanStatistic::counter_name(int counter_idx) { |
| 6496 | switch (counter_idx) { |
| 6497 | case counter_method: return "compiled methods"; |
| 6498 | case counter_fpu_method: return "methods using fpu"; |
| 6499 | case counter_loop_method: return "methods with loops"; |
| 6500 | case counter_exception_method:return "methods with xhandler"; |
| 6501 | |
| 6502 | case counter_loop: return "loops"; |
| 6503 | case counter_block: return "blocks"; |
| 6504 | case counter_loop_block: return "blocks inside loop"; |
| 6505 | case counter_exception_block: return "exception handler entries"; |
| 6506 | case counter_interval: return "intervals"; |
| 6507 | case counter_fixed_interval: return "fixed intervals"; |
| 6508 | case counter_range: return "ranges"; |
| 6509 | case counter_fixed_range: return "fixed ranges"; |
| 6510 | case counter_use_pos: return "use positions"; |
| 6511 | case counter_fixed_use_pos: return "fixed use positions"; |
| 6512 | case counter_spill_slots: return "spill slots"; |
| 6513 | |
| 6514 | // counter for classes of lir instructions |
| 6515 | case counter_instruction: return "total instructions"; |
| 6516 | case counter_label: return "labels"; |
| 6517 | case counter_entry: return "method entries"; |
| 6518 | case counter_return: return "method returns"; |
| 6519 | case counter_call: return "method calls"; |
| 6520 | case counter_move: return "moves"; |
| 6521 | case counter_cmp: return "compare"; |
| 6522 | case counter_cond_branch: return "conditional branches"; |
| 6523 | case counter_uncond_branch: return "unconditional branches"; |
| 6524 | case counter_stub_branch: return "branches to stub"; |
| 6525 | case counter_alu: return "artithmetic + logic"; |
| 6526 | case counter_alloc: return "allocations"; |
| 6527 | case counter_sync: return "synchronisation"; |
| 6528 | case counter_throw: return "throw"; |
| 6529 | case counter_unwind: return "unwind"; |
| 6530 | case counter_typecheck: return "type+null-checks"; |
| 6531 | case counter_fpu_stack: return "fpu-stack"; |
| 6532 | case counter_misc_inst: return "other instructions"; |
| 6533 | case counter_other_inst: return "misc. instructions"; |
| 6534 | |
| 6535 | // counter for different types of moves |
| 6536 | case counter_move_total: return "total moves"; |
| 6537 | case counter_move_reg_reg: return "register->register"; |
| 6538 | case counter_move_reg_stack: return "register->stack"; |
| 6539 | case counter_move_stack_reg: return "stack->register"; |
| 6540 | case counter_move_stack_stack:return "stack->stack"; |
| 6541 | case counter_move_reg_mem: return "register->memory"; |
| 6542 | case counter_move_mem_reg: return "memory->register"; |
| 6543 | case counter_move_const_any: return "constant->any"; |
| 6544 | |
| 6545 | case blank_line_1: return ""; |
| 6546 | case blank_line_2: return ""; |
| 6547 | |
| 6548 | default: ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6548); ::breakpoint(); } while (0); return ""; |
| 6549 | } |
| 6550 | } |
| 6551 | |
| 6552 | LinearScanStatistic::Counter LinearScanStatistic::base_counter(int counter_idx) { |
| 6553 | if (counter_idx == counter_fpu_method || counter_idx == counter_loop_method || counter_idx == counter_exception_method) { |
| 6554 | return counter_method; |
| 6555 | } else if (counter_idx == counter_loop_block || counter_idx == counter_exception_block) { |
| 6556 | return counter_block; |
| 6557 | } else if (counter_idx >= counter_instruction && counter_idx <= counter_other_inst) { |
| 6558 | return counter_instruction; |
| 6559 | } else if (counter_idx >= counter_move_total && counter_idx <= counter_move_const_any) { |
| 6560 | return counter_move_total; |
| 6561 | } |
| 6562 | return invalid_counter; |
| 6563 | } |
| 6564 | |
| 6565 | LinearScanStatistic::LinearScanStatistic() { |
| 6566 | for (int i = 0; i < number_of_counters; i++) { |
| 6567 | _counters_sum[i] = 0; |
| 6568 | _counters_max[i] = -1; |
| 6569 | } |
| 6570 | |
| 6571 | } |
| 6572 | |
| 6573 | // add the method-local numbers to the total sum |
| 6574 | void LinearScanStatistic::sum_up(LinearScanStatistic &method_statistic) { |
| 6575 | for (int i = 0; i < number_of_counters; i++) { |
| 6576 | _counters_sum[i] += method_statistic._counters_sum[i]; |
| 6577 | _counters_max[i] = MAX2(_counters_max[i], method_statistic._counters_sum[i]); |
| 6578 | } |
| 6579 | } |
| 6580 | |
| 6581 | void LinearScanStatistic::print(const char* title) { |
| 6582 | if (CountLinearScan || TraceLinearScanLevel > 0) { |
| 6583 | tty->cr(); |
| 6584 | tty->print_cr("***** LinearScan statistic - %s *****", title); |
| 6585 | |
| 6586 | for (int i = 0; i < number_of_counters; i++) { |
| 6587 | if (_counters_sum[i] > 0 || _counters_max[i] >= 0) { |
| 6588 | tty->print("%25s: %8d", counter_name(i), _counters_sum[i]); |
| 6589 | |
| 6590 | LinearScanStatistic::Counter cntr = base_counter(i); |
| 6591 | if (cntr != invalid_counter) { |
| 6592 | tty->print(" (%5.1f%%) ", _counters_sum[i] * 100.0 / _counters_sum[cntr]); |
| 6593 | } else { |
| 6594 | tty->print(" "); |
| 6595 | } |
| 6596 | |
| 6597 | if (_counters_max[i] >= 0) { |
| 6598 | tty->print("%8d", _counters_max[i]); |
| 6599 | } |
| 6600 | } |
| 6601 | tty->cr(); |
| 6602 | } |
| 6603 | } |
| 6604 | } |
| 6605 | |
| 6606 | void LinearScanStatistic::collect(LinearScan* allocator) { |
| 6607 | inc_counter(counter_method); |
| 6608 | if (allocator->has_fpu_registers()) { |
| 6609 | inc_counter(counter_fpu_method); |
| 6610 | } |
| 6611 | if (allocator->num_loops() > 0) { |
| 6612 | inc_counter(counter_loop_method); |
| 6613 | } |
| 6614 | inc_counter(counter_loop, allocator->num_loops()); |
| 6615 | inc_counter(counter_spill_slots, allocator->max_spills()); |
| 6616 | |
| 6617 | int i; |
| 6618 | for (i = 0; i < allocator->interval_count(); i++) { |
| 6619 | Interval* cur = allocator->interval_at(i); |
| 6620 | |
| 6621 | if (cur != NULL__null) { |
| 6622 | inc_counter(counter_interval); |
| 6623 | inc_counter(counter_use_pos, cur->num_use_positions()); |
| 6624 | if (LinearScan::is_precolored_interval(cur)) { |
| 6625 | inc_counter(counter_fixed_interval); |
| 6626 | inc_counter(counter_fixed_use_pos, cur->num_use_positions()); |
| 6627 | } |
| 6628 | |
| 6629 | Range* range = cur->first(); |
| 6630 | while (range != Range::end()) { |
| 6631 | inc_counter(counter_range); |
| 6632 | if (LinearScan::is_precolored_interval(cur)) { |
| 6633 | inc_counter(counter_fixed_range); |
| 6634 | } |
| 6635 | range = range->next(); |
| 6636 | } |
| 6637 | } |
| 6638 | } |
| 6639 | |
| 6640 | bool has_xhandlers = false; |
| 6641 | // Note: only count blocks that are in code-emit order |
| 6642 | for (i = 0; i < allocator->ir()->code()->length(); i++) { |
| 6643 | BlockBegin* cur = allocator->ir()->code()->at(i); |
| 6644 | |
| 6645 | inc_counter(counter_block); |
| 6646 | if (cur->loop_depth() > 0) { |
| 6647 | inc_counter(counter_loop_block); |
| 6648 | } |
| 6649 | if (cur->is_set(BlockBegin::exception_entry_flag)) { |
| 6650 | inc_counter(counter_exception_block); |
| 6651 | has_xhandlers = true; |
| 6652 | } |
| 6653 | |
| 6654 | LIR_OpList* instructions = cur->lir()->instructions_list(); |
| 6655 | for (int j = 0; j < instructions->length(); j++) { |
| 6656 | LIR_Op* op = instructions->at(j); |
| 6657 | |
| 6658 | inc_counter(counter_instruction); |
| 6659 | |
| 6660 | switch (op->code()) { |
| 6661 | case lir_label: inc_counter(counter_label); break; |
| 6662 | case lir_std_entry: |
| 6663 | case lir_osr_entry: inc_counter(counter_entry); break; |
| 6664 | case lir_return: inc_counter(counter_return); break; |
| 6665 | |
| 6666 | case lir_rtcall: |
| 6667 | case lir_static_call: |
| 6668 | case lir_optvirtual_call: inc_counter(counter_call); break; |
| 6669 | |
| 6670 | case lir_move: { |
| 6671 | inc_counter(counter_move); |
| 6672 | inc_counter(counter_move_total); |
| 6673 | |
| 6674 | LIR_Opr in = op->as_Op1()->in_opr(); |
| 6675 | LIR_Opr res = op->as_Op1()->result_opr(); |
| 6676 | if (in->is_register()) { |
| 6677 | if (res->is_register()) { |
| 6678 | inc_counter(counter_move_reg_reg); |
| 6679 | } else if (res->is_stack()) { |
| 6680 | inc_counter(counter_move_reg_stack); |
| 6681 | } else if (res->is_address()) { |
| 6682 | inc_counter(counter_move_reg_mem); |
| 6683 | } else { |
| 6684 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6684); ::breakpoint(); } while (0); |
| 6685 | } |
| 6686 | } else if (in->is_stack()) { |
| 6687 | if (res->is_register()) { |
| 6688 | inc_counter(counter_move_stack_reg); |
| 6689 | } else { |
| 6690 | inc_counter(counter_move_stack_stack); |
| 6691 | } |
| 6692 | } else if (in->is_address()) { |
| 6693 | assert(res->is_register(), "must be")do { if (!(res->is_register())) { (*g_assert_poison) = 'X' ;; report_vm_error("/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6693, "assert(" "res->is_register()" ") failed", "must be" ); ::breakpoint(); } } while (0); |
| 6694 | inc_counter(counter_move_mem_reg); |
| 6695 | } else if (in->is_constant()) { |
| 6696 | inc_counter(counter_move_const_any); |
| 6697 | } else { |
| 6698 | ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6698); ::breakpoint(); } while (0); |
| 6699 | } |
| 6700 | break; |
| 6701 | } |
| 6702 | |
| 6703 | case lir_cmp: inc_counter(counter_cmp); break; |
| 6704 | |
| 6705 | case lir_branch: |
| 6706 | case lir_cond_float_branch: { |
| 6707 | LIR_OpBranch* branch = op->as_OpBranch(); |
| 6708 | if (branch->block() == NULL__null) { |
| 6709 | inc_counter(counter_stub_branch); |
| 6710 | } else if (branch->cond() == lir_cond_always) { |
| 6711 | inc_counter(counter_uncond_branch); |
| 6712 | } else { |
| 6713 | inc_counter(counter_cond_branch); |
| 6714 | } |
| 6715 | break; |
| 6716 | } |
| 6717 | |
| 6718 | case lir_neg: |
| 6719 | case lir_add: |
| 6720 | case lir_sub: |
| 6721 | case lir_mul: |
| 6722 | case lir_div: |
| 6723 | case lir_rem: |
| 6724 | case lir_sqrt: |
| 6725 | case lir_abs: |
| 6726 | case lir_log10: |
| 6727 | case lir_logic_and: |
| 6728 | case lir_logic_or: |
| 6729 | case lir_logic_xor: |
| 6730 | case lir_shl: |
| 6731 | case lir_shr: |
| 6732 | case lir_ushr: inc_counter(counter_alu); break; |
| 6733 | |
| 6734 | case lir_alloc_object: |
| 6735 | case lir_alloc_array: inc_counter(counter_alloc); break; |
| 6736 | |
| 6737 | case lir_monaddr: |
| 6738 | case lir_lock: |
| 6739 | case lir_unlock: inc_counter(counter_sync); break; |
| 6740 | |
| 6741 | case lir_throw: inc_counter(counter_throw); break; |
| 6742 | |
| 6743 | case lir_unwind: inc_counter(counter_unwind); break; |
| 6744 | |
| 6745 | case lir_null_check: |
| 6746 | case lir_leal: |
| 6747 | case lir_instanceof: |
| 6748 | case lir_checkcast: |
| 6749 | case lir_store_check: inc_counter(counter_typecheck); break; |
| 6750 | |
| 6751 | case lir_fpop_raw: |
| 6752 | case lir_fxch: |
| 6753 | case lir_fld: inc_counter(counter_fpu_stack); break; |
| 6754 | |
| 6755 | case lir_nop: |
| 6756 | case lir_push: |
| 6757 | case lir_pop: |
| 6758 | case lir_convert: |
| 6759 | case lir_roundfp: |
| 6760 | case lir_cmove: inc_counter(counter_misc_inst); break; |
| 6761 | |
| 6762 | default: inc_counter(counter_other_inst); break; |
| 6763 | } |
| 6764 | } |
| 6765 | } |
| 6766 | |
| 6767 | if (has_xhandlers) { |
| 6768 | inc_counter(counter_exception_method); |
| 6769 | } |
| 6770 | } |
| 6771 | |
| 6772 | void LinearScanStatistic::compute(LinearScan* allocator, LinearScanStatistic &global_statistic) { |
| 6773 | if (CountLinearScan || TraceLinearScanLevel > 0) { |
| 6774 | |
| 6775 | LinearScanStatistic local_statistic = LinearScanStatistic(); |
| 6776 | |
| 6777 | local_statistic.collect(allocator); |
| 6778 | global_statistic.sum_up(local_statistic); |
| 6779 | |
| 6780 | if (TraceLinearScanLevel > 2) { |
| 6781 | local_statistic.print("current local statistic"); |
| 6782 | } |
| 6783 | } |
| 6784 | } |
| 6785 | |
| 6786 | |
| 6787 | // Implementation of LinearTimers |
| 6788 | |
| 6789 | LinearScanTimers::LinearScanTimers() { |
| 6790 | for (int i = 0; i < number_of_timers; i++) { |
| 6791 | timer(i)->reset(); |
| 6792 | } |
| 6793 | } |
| 6794 | |
| 6795 | const char* LinearScanTimers::timer_name(int idx) { |
| 6796 | switch (idx) { |
| 6797 | case timer_do_nothing: return "Nothing (Time Check)"; |
| 6798 | case timer_number_instructions: return "Number Instructions"; |
| 6799 | case timer_compute_local_live_sets: return "Local Live Sets"; |
| 6800 | case timer_compute_global_live_sets: return "Global Live Sets"; |
| 6801 | case timer_build_intervals: return "Build Intervals"; |
| 6802 | case timer_sort_intervals_before: return "Sort Intervals Before"; |
| 6803 | case timer_allocate_registers: return "Allocate Registers"; |
| 6804 | case timer_resolve_data_flow: return "Resolve Data Flow"; |
| 6805 | case timer_sort_intervals_after: return "Sort Intervals After"; |
| 6806 | case timer_eliminate_spill_moves: return "Spill optimization"; |
| 6807 | case timer_assign_reg_num: return "Assign Reg Num"; |
| 6808 | case timer_allocate_fpu_stack: return "Allocate FPU Stack"; |
| 6809 | case timer_optimize_lir: return "Optimize LIR"; |
| 6810 | default: ShouldNotReachHere()do { (*g_assert_poison) = 'X';; report_should_not_reach_here( "/home/daniel/Projects/java/jdk/src/hotspot/share/c1/c1_LinearScan.cpp" , 6810); ::breakpoint(); } while (0); return ""; |
| 6811 | } |
| 6812 | } |
| 6813 | |
| 6814 | void LinearScanTimers::begin_method() { |
| 6815 | if (TimeEachLinearScan) { |
| 6816 | // reset all timers to measure only current method |
| 6817 | for (int i = 0; i < number_of_timers; i++) { |
| 6818 | timer(i)->reset(); |
| 6819 | } |
| 6820 | } |
| 6821 | } |
| 6822 | |
| 6823 | void LinearScanTimers::end_method(LinearScan* allocator) { |
| 6824 | if (TimeEachLinearScan) { |
| 6825 | |
| 6826 | double c = timer(timer_do_nothing)->seconds(); |
| 6827 | double total = 0; |
| 6828 | for (int i = 1; i < number_of_timers; i++) { |
| 6829 | total += timer(i)->seconds() - c; |
| 6830 | } |
| 6831 | |
| 6832 | if (total >= 0.0005) { |
| 6833 | // print all information in one line for automatic processing |
| 6834 | tty->print("@"); allocator->compilation()->method()->print_name(); |
| 6835 | |
| 6836 | tty->print("@ %d ", allocator->compilation()->method()->code_size()); |
| 6837 | tty->print("@ %d ", allocator->block_at(allocator->block_count() - 1)->last_lir_instruction_id() / 2); |
| 6838 | tty->print("@ %d ", allocator->block_count()); |
| 6839 | tty->print("@ %d ", allocator->num_virtual_regs()); |
| 6840 | tty->print("@ %d ", allocator->interval_count()); |
| 6841 | tty->print("@ %d ", allocator->_num_calls); |
| 6842 | tty->print("@ %d ", allocator->num_loops()); |
| 6843 | |
| 6844 | tty->print("@ %6.6f ", total); |
| 6845 | for (int i = 1; i < number_of_timers; i++) { |
| 6846 | tty->print("@ %4.1f ", ((timer(i)->seconds() - c) / total) * 100); |
| 6847 | } |
| 6848 | tty->cr(); |
| 6849 | } |
| 6850 | } |
| 6851 | } |
| 6852 | |
| 6853 | void LinearScanTimers::print(double total_time) { |
| 6854 | if (TimeLinearScan) { |
| 6855 | // correction value: sum of dummy-timer that only measures the time that |
| 6856 | // is necesary to start and stop itself |
| 6857 | double c = timer(timer_do_nothing)->seconds(); |
| 6858 | |
| 6859 | for (int i = 0; i < number_of_timers; i++) { |
| 6860 | double t = timer(i)->seconds(); |
| 6861 | tty->print_cr(" %25s: %6.3f s (%4.1f%%) corrected: %6.3f s (%4.1f%%)", timer_name(i), t, (t / total_time) * 100.0, t - c, (t - c) / (total_time - 2 * number_of_timers * c) * 100); |
| 6862 | } |
| 6863 | } |
| 6864 | } |
| 6865 | |
| 6866 | #endif // #ifndef PRODUCT |