Lines Matching full:deoptimization
415 // Lower bound isn't useful. Leave it to deoptimization.
466 deoptimization.
496 // the deoptimization technique.
500 // bother to apply the deoptimization technique since it's likely, or sometimes certain,
552 // code dominated by the deoptimization.
1231 * preheader or, in combination with dynamic bce, the deoptimization block.
1239 * Note: this optimization is no longer applied after dominator-based dynamic deoptimization
1241 * unsafe to hoist array references across their deoptimization instruction inside a loop.
1267 // Construct deoptimization on single or double bounds on range [base-min_c,base+max_c],
1291 // Flag that this kind of deoptimization has occurred.
1359 // Perform dominator-based deoptimization if it seems profitable, where we eliminate
1470 // Perform loop-based deoptimization if it seems profitable, where we eliminate bounds
1559 // code dominated by the deoptimization.
1569 // at runtime and testing the range may apply deoptimization unnecessarily.
1624 * by generating a deoptimization test.
1649 * Since deoptimization would be a bad choice, and there is no other version
1685 // Use preheader unless there is an earlier generated deoptimization block since
1686 // hoisted expressions may depend on and/or used by the deoptimization tests.
1702 /** Inserts a deoptimization test in a loop preheader. */
1720 /** Inserts a deoptimization test right before a bounds check. */
1733 /** Hoists instruction out of the loop to preheader or deoptimization block. */
1743 * deoptimization caused by incorrect trip-count evaluation in non-taken loops.
1747 * if_block <- taken-test protects deoptimization block
1797 // loop isn't entered at all, it jumps around the deoptimization block.
1810 * All uses of instructions in the deoptimization block that reach the loop need
1823 // Scan all new deoptimization blocks.
1827 // Scan all instructions in a new deoptimization block.
