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 "ci/ciMethodData.hpp"
26 #include "classfile/vmSymbols.hpp"
27 #include "compiler/compileLog.hpp"
28 #include "interpreter/linkResolver.hpp"
29 #include "jvm_io.h"
30 #include "memory/resourceArea.hpp"
31 #include "memory/universe.hpp"
32 #include "oops/oop.inline.hpp"
33 #include "opto/addnode.hpp"
34 #include "opto/castnode.hpp"
35 #include "opto/convertnode.hpp"
36 #include "opto/divnode.hpp"
37 #include "opto/idealGraphPrinter.hpp"
38 #include "opto/matcher.hpp"
39 #include "opto/memnode.hpp"
40 #include "opto/mulnode.hpp"
41 #include "opto/opaquenode.hpp"
42 #include "opto/parse.hpp"
43 #include "opto/runtime.hpp"
44 #include "opto/subtypenode.hpp"
45 #include "runtime/deoptimization.hpp"
46 #include "runtime/sharedRuntime.hpp"
47
48 #ifndef PRODUCT
49 extern uint explicit_null_checks_inserted,
50 explicit_null_checks_elided;
51 #endif
52
53 //---------------------------------array_load----------------------------------
54 void Parse::array_load(BasicType bt) {
55 const Type* elemtype = Type::TOP;
56 bool big_val = bt == T_DOUBLE || bt == T_LONG;
57 Node* adr = array_addressing(bt, 0, elemtype);
58 if (stopped()) return; // guaranteed null or range check
59
60 pop(); // index (already used)
61 Node* array = pop(); // the array itself
62
63 if (elemtype == TypeInt::BOOL) {
64 bt = T_BOOLEAN;
65 }
66 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(bt);
67
68 Node* ld = access_load_at(array, adr, adr_type, elemtype, bt,
69 IN_HEAP | IS_ARRAY | C2_CONTROL_DEPENDENT_LOAD);
70 if (big_val) {
71 push_pair(ld);
72 } else {
73 push(ld);
74 }
75 }
76
77
78 //--------------------------------array_store----------------------------------
79 void Parse::array_store(BasicType bt) {
80 const Type* elemtype = Type::TOP;
81 bool big_val = bt == T_DOUBLE || bt == T_LONG;
82 Node* adr = array_addressing(bt, big_val ? 2 : 1, elemtype);
83 if (stopped()) return; // guaranteed null or range check
84 if (bt == T_OBJECT) {
85 array_store_check();
86 if (stopped()) {
87 return;
88 }
89 }
90 Node* val; // Oop to store
91 if (big_val) {
92 val = pop_pair();
93 } else {
94 val = pop();
95 }
96 pop(); // index (already used)
97 Node* array = pop(); // the array itself
98
99 if (elemtype == TypeInt::BOOL) {
100 bt = T_BOOLEAN;
101 }
102 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(bt);
103
104 access_store_at(array, adr, adr_type, val, elemtype, bt, MO_UNORDERED | IN_HEAP | IS_ARRAY);
105 }
106
107
108 //------------------------------array_addressing-------------------------------
109 // Pull array and index from the stack. Compute pointer-to-element.
110 Node* Parse::array_addressing(BasicType type, int vals, const Type*& elemtype) {
111 Node *idx = peek(0+vals); // Get from stack without popping
112 Node *ary = peek(1+vals); // in case of exception
113
114 // Null check the array base, with correct stack contents
115 ary = null_check(ary, T_ARRAY);
116 // Compile-time detect of null-exception?
117 if (stopped()) return top();
118
119 const TypeAryPtr* arytype = _gvn.type(ary)->is_aryptr();
120 const TypeInt* sizetype = arytype->size();
121 elemtype = arytype->elem();
122
123 if (UseUniqueSubclasses) {
124 const Type* el = elemtype->make_ptr();
125 if (el && el->isa_instptr()) {
126 const TypeInstPtr* toop = el->is_instptr();
127 if (toop->instance_klass()->unique_concrete_subklass()) {
128 // If we load from "AbstractClass[]" we must see "ConcreteSubClass".
129 const Type* subklass = Type::get_const_type(toop->instance_klass());
130 elemtype = subklass->join_speculative(el);
131 }
132 }
133 }
134
135 // Check for big class initializers with all constant offsets
136 // feeding into a known-size array.
137 const TypeInt* idxtype = _gvn.type(idx)->is_int();
138 // See if the highest idx value is less than the lowest array bound,
139 // and if the idx value cannot be negative:
140 bool need_range_check = true;
141 if (idxtype->_hi < sizetype->_lo && idxtype->_lo >= 0) {
142 need_range_check = false;
143 if (C->log() != nullptr) C->log()->elem("observe that='!need_range_check'");
144 }
145
146 if (!arytype->is_loaded()) {
147 // Only fails for some -Xcomp runs
148 // The class is unloaded. We have to run this bytecode in the interpreter.
149 ciKlass* klass = arytype->unloaded_klass();
150
151 uncommon_trap(Deoptimization::Reason_unloaded,
152 Deoptimization::Action_reinterpret,
153 klass, "!loaded array");
154 return top();
155 }
156
157 // Do the range check
158 if (need_range_check) {
159 Node* tst;
160 if (sizetype->_hi <= 0) {
161 // The greatest array bound is negative, so we can conclude that we're
162 // compiling unreachable code, but the unsigned compare trick used below
163 // only works with non-negative lengths. Instead, hack "tst" to be zero so
164 // the uncommon_trap path will always be taken.
165 tst = _gvn.intcon(0);
166 } else {
167 // Range is constant in array-oop, so we can use the original state of mem
168 Node* len = load_array_length(ary);
169
170 // Test length vs index (standard trick using unsigned compare)
171 Node* chk = _gvn.transform( new CmpUNode(idx, len) );
172 BoolTest::mask btest = BoolTest::lt;
173 tst = _gvn.transform( new BoolNode(chk, btest) );
174 }
175 RangeCheckNode* rc = new RangeCheckNode(control(), tst, PROB_MAX, COUNT_UNKNOWN);
176 _gvn.set_type(rc, rc->Value(&_gvn));
177 if (!tst->is_Con()) {
178 record_for_igvn(rc);
179 }
180 set_control(_gvn.transform(new IfTrueNode(rc)));
181 // Branch to failure if out of bounds
182 {
183 PreserveJVMState pjvms(this);
184 set_control(_gvn.transform(new IfFalseNode(rc)));
185 if (C->allow_range_check_smearing()) {
186 // Do not use builtin_throw, since range checks are sometimes
187 // made more stringent by an optimistic transformation.
188 // This creates "tentative" range checks at this point,
189 // which are not guaranteed to throw exceptions.
190 // See IfNode::Ideal, is_range_check, adjust_check.
191 uncommon_trap(Deoptimization::Reason_range_check,
192 Deoptimization::Action_make_not_entrant,
193 nullptr, "range_check");
194 } else {
195 // If we have already recompiled with the range-check-widening
196 // heroic optimization turned off, then we must really be throwing
197 // range check exceptions.
198 builtin_throw(Deoptimization::Reason_range_check);
199 }
200 }
201 }
202 // Check for always knowing you are throwing a range-check exception
203 if (stopped()) return top();
204
205 // Make array address computation control dependent to prevent it
206 // from floating above the range check during loop optimizations.
207 Node* ptr = array_element_address(ary, idx, type, sizetype, control());
208 assert(ptr != top(), "top should go hand-in-hand with stopped");
209
210 return ptr;
211 }
212
213
214 // returns IfNode
215 IfNode* Parse::jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask, float prob, float cnt) {
216 Node *cmp = _gvn.transform(new CmpINode(a, b)); // two cases: shiftcount > 32 and shiftcount <= 32
217 Node *tst = _gvn.transform(new BoolNode(cmp, mask));
218 IfNode *iff = create_and_map_if(control(), tst, prob, cnt);
219 return iff;
220 }
221
222
223 // sentinel value for the target bci to mark never taken branches
224 // (according to profiling)
225 static const int never_reached = INT_MAX;
226
227 //------------------------------helper for tableswitch-------------------------
228 void Parse::jump_if_true_fork(IfNode *iff, int dest_bci_if_true, bool unc) {
229 // True branch, use existing map info
230 { PreserveJVMState pjvms(this);
231 Node *iftrue = _gvn.transform( new IfTrueNode (iff) );
232 set_control( iftrue );
1450 // False branch
1451 Node* iffalse = _gvn.transform( new IfFalseNode(iff) );
1452 set_control(iffalse);
1453
1454 if (stopped()) { // Path is dead?
1455 NOT_PRODUCT(explicit_null_checks_elided++);
1456 if (C->eliminate_boxing()) {
1457 // Mark the successor block as parsed
1458 next_block->next_path_num();
1459 }
1460 } else { // Path is live.
1461 adjust_map_after_if(BoolTest(btest).negate(), c, 1.0-prob, next_block);
1462 }
1463
1464 if (do_stress_trap) {
1465 stress_trap(iff, counter, incr_store);
1466 }
1467 }
1468
1469 //------------------------------------do_if------------------------------------
1470 void Parse::do_if(BoolTest::mask btest, Node* c) {
1471 int target_bci = iter().get_dest();
1472
1473 Block* branch_block = successor_for_bci(target_bci);
1474 Block* next_block = successor_for_bci(iter().next_bci());
1475
1476 float cnt;
1477 float prob = branch_prediction(cnt, btest, target_bci, c);
1478 float untaken_prob = 1.0 - prob;
1479
1480 if (prob == PROB_UNKNOWN) {
1481 if (PrintOpto && Verbose) {
1482 tty->print_cr("Never-taken edge stops compilation at bci %d", bci());
1483 }
1484 repush_if_args(); // to gather stats on loop
1485 uncommon_trap(Deoptimization::Reason_unreached,
1486 Deoptimization::Action_reinterpret,
1487 nullptr, "cold");
1488 if (C->eliminate_boxing()) {
1489 // Mark the successor blocks as parsed
1490 branch_block->next_path_num();
1541 }
1542
1543 // Generate real control flow
1544 float true_prob = (taken_if_true ? prob : untaken_prob);
1545 IfNode* iff = create_and_map_if(control(), tst, true_prob, cnt);
1546 assert(iff->_prob > 0.0f,"Optimizer made bad probability in parser");
1547 Node* taken_branch = new IfTrueNode(iff);
1548 Node* untaken_branch = new IfFalseNode(iff);
1549 if (!taken_if_true) { // Finish conversion to canonical form
1550 Node* tmp = taken_branch;
1551 taken_branch = untaken_branch;
1552 untaken_branch = tmp;
1553 }
1554
1555 // Branch is taken:
1556 { PreserveJVMState pjvms(this);
1557 taken_branch = _gvn.transform(taken_branch);
1558 set_control(taken_branch);
1559
1560 if (stopped()) {
1561 if (C->eliminate_boxing()) {
1562 // Mark the successor block as parsed
1563 branch_block->next_path_num();
1564 }
1565 } else {
1566 adjust_map_after_if(taken_btest, c, prob, branch_block);
1567 if (!stopped()) {
1568 merge(target_bci);
1569 }
1570 }
1571 }
1572
1573 untaken_branch = _gvn.transform(untaken_branch);
1574 set_control(untaken_branch);
1575
1576 // Branch not taken.
1577 if (stopped()) {
1578 if (C->eliminate_boxing()) {
1579 // Mark the successor block as parsed
1580 next_block->next_path_num();
1581 }
1582 } else {
1583 adjust_map_after_if(untaken_btest, c, untaken_prob, next_block);
1584 }
1585
1586 if (do_stress_trap) {
1587 stress_trap(iff, counter, incr_store);
1588 }
1589 }
1590
1591 // Force unstable if traps to be taken randomly to trigger intermittent bugs such as incorrect debug information.
1592 // Add another if before the unstable if that checks a "random" condition at runtime (a simple shared counter) and
1593 // then either takes the trap or executes the original, unstable if.
1594 void Parse::stress_trap(IfNode* orig_iff, Node* counter, Node* incr_store) {
1595 // Search for an unstable if trap
1596 CallStaticJavaNode* trap = nullptr;
1597 assert(orig_iff->Opcode() == Op_If && orig_iff->outcnt() == 2, "malformed if");
1598 ProjNode* trap_proj = orig_iff->uncommon_trap_proj(trap, Deoptimization::Reason_unstable_if);
1599 if (trap == nullptr || !trap->jvms()->should_reexecute()) {
1600 // No suitable trap found. Remove unused counter load and increment.
1601 C->gvn_replace_by(incr_store, incr_store->in(MemNode::Memory));
1602 return;
1603 }
1604
1605 // Remove trap from optimization list since we add another path to the trap.
1606 bool success = C->remove_unstable_if_trap(trap, true);
1607 assert(success, "Trap already modified");
1608
1609 // Add a check before the original if that will trap with a certain frequency and execute the original if otherwise
1610 int freq_log = (C->random() % 31) + 1; // Random logarithmic frequency in [1, 31]
1643 }
1644
1645 void Parse::maybe_add_predicate_after_if(Block* path) {
1646 if (path->is_SEL_head() && path->preds_parsed() == 0) {
1647 // Add predicates at bci of if dominating the loop so traps can be
1648 // recorded on the if's profile data
1649 int bc_depth = repush_if_args();
1650 add_parse_predicates();
1651 dec_sp(bc_depth);
1652 path->set_has_predicates();
1653 }
1654 }
1655
1656
1657 //----------------------------adjust_map_after_if------------------------------
1658 // Adjust the JVM state to reflect the result of taking this path.
1659 // Basically, it means inspecting the CmpNode controlling this
1660 // branch, seeing how it constrains a tested value, and then
1661 // deciding if it's worth our while to encode this constraint
1662 // as graph nodes in the current abstract interpretation map.
1663 void Parse::adjust_map_after_if(BoolTest::mask btest, Node* c, float prob, Block* path) {
1664 if (!c->is_Cmp()) {
1665 maybe_add_predicate_after_if(path);
1666 return;
1667 }
1668
1669 if (stopped() || btest == BoolTest::illegal) {
1670 return; // nothing to do
1671 }
1672
1673 bool is_fallthrough = (path == successor_for_bci(iter().next_bci()));
1674
1675 if (path_is_suitable_for_uncommon_trap(prob)) {
1676 repush_if_args();
1677 Node* call = uncommon_trap(Deoptimization::Reason_unstable_if,
1678 Deoptimization::Action_reinterpret,
1679 nullptr,
1680 (is_fallthrough ? "taken always" : "taken never"));
1681
1682 if (call != nullptr) {
1683 C->record_unstable_if_trap(new UnstableIfTrap(call->as_CallStaticJava(), path));
1684 }
1685 return;
1686 }
1687
1688 Node* val = c->in(1);
1689 Node* con = c->in(2);
1690 const Type* tcon = _gvn.type(con);
1691 const Type* tval = _gvn.type(val);
1692 bool have_con = tcon->singleton();
1693 if (tval->singleton()) {
1694 if (!have_con) {
1695 // Swap, so constant is in con.
1696 con = val;
1697 tcon = tval;
1698 val = c->in(2);
1699 tval = _gvn.type(val);
1700 btest = BoolTest(btest).commute();
1701 have_con = true;
1702 } else {
1703 // Do we have two constants? Then leave well enough alone.
1704 have_con = false;
1705 }
1706 }
1707 if (!have_con) { // remaining adjustments need a con
1833 &obj, &cast_type)) {
1834 assert(obj != nullptr && cast_type != nullptr, "missing type check info");
1835 const Type* obj_type = _gvn.type(obj);
1836 const Type* tboth = obj_type->filter_speculative(cast_type);
1837 assert(tboth->higher_equal(obj_type) && tboth->higher_equal(cast_type), "sanity");
1838 if (tboth == Type::TOP && KillPathsReachableByDeadTypeNode) {
1839 // Let dead type node cleaning logic prune effectively dead path for us.
1840 // CheckCastPP::Value() == TOP and it will trigger the cleanup during GVN.
1841 // Don't materialize the cast when cleanup is disabled, because
1842 // it kills data and control leaving IR in broken state.
1843 tboth = cast_type;
1844 }
1845 if (tboth != Type::TOP && tboth != obj_type) {
1846 int obj_in_map = map()->find_edge(obj);
1847 if (obj_in_map >= 0 &&
1848 (jvms()->is_loc(obj_in_map) || jvms()->is_stk(obj_in_map))) {
1849 TypeNode* ccast = new CheckCastPPNode(control(), obj, tboth);
1850 // Delay transform() call to allow recovery of pre-cast value at the control merge.
1851 _gvn.set_type_bottom(ccast);
1852 record_for_igvn(ccast);
1853 // Here's the payoff.
1854 replace_in_map(obj, ccast);
1855 }
1856 }
1857 }
1858
1859 int val_in_map = map()->find_edge(val);
1860 if (val_in_map < 0) return; // replace_in_map would be useless
1861 {
1862 JVMState* jvms = this->jvms();
1863 if (!(jvms->is_loc(val_in_map) ||
1864 jvms->is_stk(val_in_map)))
1865 return; // again, it would be useless
1866 }
1867
1868 // Check for a comparison to a constant, and "know" that the compared
1869 // value is constrained on this path.
1870 assert(tcon->singleton(), "");
1871 ConstraintCastNode* ccast = nullptr;
1872 Node* cast = nullptr;
1936 if (c->Opcode() == Op_CmpP &&
1937 (c->in(1)->Opcode() == Op_LoadKlass || c->in(1)->Opcode() == Op_DecodeNKlass) &&
1938 c->in(2)->is_Con()) {
1939 Node* load_klass = nullptr;
1940 Node* decode = nullptr;
1941 if (c->in(1)->Opcode() == Op_DecodeNKlass) {
1942 decode = c->in(1);
1943 load_klass = c->in(1)->in(1);
1944 } else {
1945 load_klass = c->in(1);
1946 }
1947 if (load_klass->in(2)->is_AddP()) {
1948 Node* addp = load_klass->in(2);
1949 Node* obj = addp->in(AddPNode::Address);
1950 const TypeOopPtr* obj_type = _gvn.type(obj)->is_oopptr();
1951 if (obj_type->speculative_type_not_null() != nullptr) {
1952 ciKlass* k = obj_type->speculative_type();
1953 inc_sp(2);
1954 obj = maybe_cast_profiled_obj(obj, k);
1955 dec_sp(2);
1956 // Make the CmpP use the casted obj
1957 addp = basic_plus_adr(obj, addp->in(AddPNode::Offset));
1958 load_klass = load_klass->clone();
1959 load_klass->set_req(2, addp);
1960 load_klass = _gvn.transform(load_klass);
1961 if (decode != nullptr) {
1962 decode = decode->clone();
1963 decode->set_req(1, load_klass);
1964 load_klass = _gvn.transform(decode);
1965 }
1966 c = c->clone();
1967 c->set_req(1, load_klass);
1968 c = _gvn.transform(c);
1969 }
1970 }
1971 }
1972 return c;
1973 }
1974
1975 //------------------------------do_one_bytecode--------------------------------
2678 b = _gvn.transform( new ConvI2DNode(a));
2679 push_pair(b);
2680 break;
2681
2682 case Bytecodes::_iinc: // Increment local
2683 i = iter().get_index(); // Get local index
2684 set_local( i, _gvn.transform( new AddINode( _gvn.intcon(iter().get_iinc_con()), local(i) ) ) );
2685 break;
2686
2687 // Exit points of synchronized methods must have an unlock node
2688 case Bytecodes::_return:
2689 return_current(nullptr);
2690 break;
2691
2692 case Bytecodes::_ireturn:
2693 case Bytecodes::_areturn:
2694 case Bytecodes::_freturn:
2695 return_current(pop());
2696 break;
2697 case Bytecodes::_lreturn:
2698 return_current(pop_pair());
2699 break;
2700 case Bytecodes::_dreturn:
2701 return_current(pop_pair());
2702 break;
2703
2704 case Bytecodes::_athrow:
2705 // null exception oop throws null pointer exception
2706 null_check(peek());
2707 if (stopped()) return;
2708 // Hook the thrown exception directly to subsequent handlers.
2709 if (BailoutToInterpreterForThrows) {
2710 // Keep method interpreted from now on.
2711 uncommon_trap(Deoptimization::Reason_unhandled,
2712 Deoptimization::Action_make_not_compilable);
2713 return;
2714 }
2715 if (env()->jvmti_can_post_on_exceptions()) {
2716 // check if we must post exception events, take uncommon trap if so (with must_throw = false)
2717 uncommon_trap_if_should_post_on_exceptions(Deoptimization::Reason_unhandled, false);
2718 }
2719 // Here if either can_post_on_exceptions or should_post_on_exceptions is false
2733 // See if we can get some profile data and hand it off to the next block
2734 Block *target_block = block()->successor_for_bci(target_bci);
2735 if (target_block->pred_count() != 1) break;
2736 ciMethodData* methodData = method()->method_data();
2737 if (!methodData->is_mature()) break;
2738 ciProfileData* data = methodData->bci_to_data(bci());
2739 assert(data != nullptr && data->is_JumpData(), "need JumpData for taken branch");
2740 int taken = ((ciJumpData*)data)->taken();
2741 taken = method()->scale_count(taken);
2742 target_block->set_count(taken);
2743 break;
2744 }
2745
2746 case Bytecodes::_ifnull: btest = BoolTest::eq; goto handle_if_null;
2747 case Bytecodes::_ifnonnull: btest = BoolTest::ne; goto handle_if_null;
2748 handle_if_null:
2749 // If this is a backwards branch in the bytecodes, add Safepoint
2750 maybe_add_safepoint(iter().get_dest());
2751 a = null();
2752 b = pop();
2753 if (!_gvn.type(b)->speculative_maybe_null() &&
2754 !too_many_traps(Deoptimization::Reason_speculate_null_check)) {
2755 inc_sp(1);
2756 Node* null_ctl = top();
2757 b = null_check_oop(b, &null_ctl, true, true, true);
2758 assert(null_ctl->is_top(), "no null control here");
2759 dec_sp(1);
2760 } else if (_gvn.type(b)->speculative_always_null() &&
2761 !too_many_traps(Deoptimization::Reason_speculate_null_assert)) {
2762 inc_sp(1);
2763 b = null_assert(b);
2764 dec_sp(1);
2765 }
2766 c = _gvn.transform( new CmpPNode(b, a) );
2767 do_ifnull(btest, c);
2768 break;
2769
2770 case Bytecodes::_if_acmpeq: btest = BoolTest::eq; goto handle_if_acmp;
2771 case Bytecodes::_if_acmpne: btest = BoolTest::ne; goto handle_if_acmp;
2772 handle_if_acmp:
2773 // If this is a backwards branch in the bytecodes, add Safepoint
2774 maybe_add_safepoint(iter().get_dest());
2775 a = pop();
2776 b = pop();
2777 c = _gvn.transform( new CmpPNode(b, a) );
2778 c = optimize_cmp_with_klass(c);
2779 do_if(btest, c);
2780 break;
2781
2782 case Bytecodes::_ifeq: btest = BoolTest::eq; goto handle_ifxx;
2783 case Bytecodes::_ifne: btest = BoolTest::ne; goto handle_ifxx;
2784 case Bytecodes::_iflt: btest = BoolTest::lt; goto handle_ifxx;
2785 case Bytecodes::_ifle: btest = BoolTest::le; goto handle_ifxx;
2786 case Bytecodes::_ifgt: btest = BoolTest::gt; goto handle_ifxx;
2787 case Bytecodes::_ifge: btest = BoolTest::ge; goto handle_ifxx;
2788 handle_ifxx:
2789 // If this is a backwards branch in the bytecodes, add Safepoint
2790 maybe_add_safepoint(iter().get_dest());
2791 a = _gvn.intcon(0);
2792 b = pop();
2793 c = _gvn.transform( new CmpINode(b, a) );
2794 do_if(btest, c);
2795 break;
2796
2797 case Bytecodes::_if_icmpeq: btest = BoolTest::eq; goto handle_if_icmp;
2798 case Bytecodes::_if_icmpne: btest = BoolTest::ne; goto handle_if_icmp;
2799 case Bytecodes::_if_icmplt: btest = BoolTest::lt; goto handle_if_icmp;
2814 break;
2815
2816 case Bytecodes::_lookupswitch:
2817 do_lookupswitch();
2818 break;
2819
2820 case Bytecodes::_invokestatic:
2821 case Bytecodes::_invokedynamic:
2822 case Bytecodes::_invokespecial:
2823 case Bytecodes::_invokevirtual:
2824 case Bytecodes::_invokeinterface:
2825 do_call();
2826 break;
2827 case Bytecodes::_checkcast:
2828 do_checkcast();
2829 break;
2830 case Bytecodes::_instanceof:
2831 do_instanceof();
2832 break;
2833 case Bytecodes::_anewarray:
2834 do_anewarray();
2835 break;
2836 case Bytecodes::_newarray:
2837 do_newarray((BasicType)iter().get_index());
2838 break;
2839 case Bytecodes::_multianewarray:
2840 do_multianewarray();
2841 break;
2842 case Bytecodes::_new:
2843 do_new();
2844 break;
2845
2846 case Bytecodes::_jsr:
2847 case Bytecodes::_jsr_w:
2848 do_jsr();
2849 break;
2850
2851 case Bytecodes::_ret:
2852 do_ret();
2853 break;
2854
|
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 "ci/ciInlineKlass.hpp"
26 #include "ci/ciMethodData.hpp"
27 #include "ci/ciSymbols.hpp"
28 #include "classfile/vmSymbols.hpp"
29 #include "compiler/compileLog.hpp"
30 #include "interpreter/linkResolver.hpp"
31 #include "jvm_io.h"
32 #include "memory/resourceArea.hpp"
33 #include "memory/universe.hpp"
34 #include "oops/oop.inline.hpp"
35 #include "opto/addnode.hpp"
36 #include "opto/castnode.hpp"
37 #include "opto/convertnode.hpp"
38 #include "opto/divnode.hpp"
39 #include "opto/idealGraphPrinter.hpp"
40 #include "opto/idealKit.hpp"
41 #include "opto/inlinetypenode.hpp"
42 #include "opto/matcher.hpp"
43 #include "opto/memnode.hpp"
44 #include "opto/mulnode.hpp"
45 #include "opto/opaquenode.hpp"
46 #include "opto/parse.hpp"
47 #include "opto/runtime.hpp"
48 #include "opto/subtypenode.hpp"
49 #include "runtime/arguments.hpp"
50 #include "runtime/deoptimization.hpp"
51 #include "runtime/globals.hpp"
52 #include "runtime/sharedRuntime.hpp"
53
54 #ifndef PRODUCT
55 extern uint explicit_null_checks_inserted,
56 explicit_null_checks_elided;
57 #endif
58
59 Node* Parse::record_profile_for_speculation_at_array_load(Node* ld) {
60 // Feed unused profile data to type speculation
61 if (UseTypeSpeculation && UseArrayLoadStoreProfile) {
62 ciKlass* array_type = nullptr;
63 ciKlass* element_type = nullptr;
64 ProfilePtrKind element_ptr = ProfileMaybeNull;
65 bool flat_array = true;
66 bool null_free_array = true;
67 method()->array_access_profiled_type(bci(), array_type, element_type, element_ptr, flat_array, null_free_array);
68 if (element_type != nullptr || element_ptr != ProfileMaybeNull) {
69 ld = record_profile_for_speculation(ld, element_type, element_ptr);
70 }
71 }
72 return ld;
73 }
74
75
76 //---------------------------------array_load----------------------------------
77 void Parse::array_load(BasicType bt) {
78 const Type* elemtype = Type::TOP;
79 Node* adr = array_addressing(bt, 0, elemtype);
80 if (stopped()) return; // guaranteed null or range check
81
82 Node* array_index = pop();
83 Node* array = pop();
84
85 // Handle inline type arrays
86 const TypeOopPtr* element_ptr = elemtype->make_oopptr();
87 const TypeAryPtr* array_type = _gvn.type(array)->is_aryptr();
88
89 if (!array_type->is_not_flat()) {
90 // Cannot statically determine if array is a flat array, emit runtime check
91 assert(UseArrayFlattening && is_reference_type(bt) && element_ptr->can_be_inline_type() &&
92 (!element_ptr->is_inlinetypeptr() || element_ptr->inline_klass()->maybe_flat_in_array()), "array can't be flat");
93 IdealKit ideal(this);
94 IdealVariable res(ideal);
95 ideal.declarations_done();
96 ideal.if_then(flat_array_test(array, /* flat = */ false)); {
97 // Non-flat array
98 sync_kit(ideal);
99 if (!array_type->is_flat()) {
100 assert(array_type->is_flat() || control()->in(0)->as_If()->is_flat_array_check(&_gvn), "Should be found");
101 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(bt);
102 DecoratorSet decorator_set = IN_HEAP | IS_ARRAY | C2_CONTROL_DEPENDENT_LOAD;
103 if (needs_range_check(array_type->size(), array_index)) {
104 // We've emitted a RangeCheck but now insert an additional check between the range check and the actual load.
105 // We cannot pin the load to two separate nodes. Instead, we pin it conservatively here such that it cannot
106 // possibly float above the range check at any point.
107 decorator_set |= C2_UNKNOWN_CONTROL_LOAD;
108 }
109 Node* ld = access_load_at(array, adr, adr_type, element_ptr, bt, decorator_set);
110 if (element_ptr->is_inlinetypeptr()) {
111 ld = InlineTypeNode::make_from_oop(this, ld, element_ptr->inline_klass());
112 }
113 ideal.set(res, ld);
114 }
115 ideal.sync_kit(this);
116 } ideal.else_(); {
117 // Flat array
118 sync_kit(ideal);
119 if (!array_type->is_not_flat()) {
120 if (element_ptr->is_inlinetypeptr()) {
121 ciInlineKlass* vk = element_ptr->inline_klass();
122 Node* flat_array = cast_to_flat_array(array, vk);
123 Node* vt = InlineTypeNode::make_from_flat_array(this, vk, flat_array, array_index);
124 ideal.set(res, vt);
125 } else {
126 // Element type is unknown, and thus we cannot statically determine the exact flat array layout. Emit a
127 // runtime call to correctly load the inline type element from the flat array.
128 Node* inline_type = load_from_unknown_flat_array(array, array_index, element_ptr);
129 bool is_null_free = array_type->is_null_free() ||
130 (!UseNullableAtomicValueFlattening && !UseNullableNonAtomicValueFlattening);
131 if (is_null_free) {
132 inline_type = cast_not_null(inline_type);
133 }
134 ideal.set(res, inline_type);
135 }
136 }
137 ideal.sync_kit(this);
138 } ideal.end_if();
139 sync_kit(ideal);
140 Node* ld = _gvn.transform(ideal.value(res));
141 ld = record_profile_for_speculation_at_array_load(ld);
142 push_node(bt, ld);
143 return;
144 }
145
146 if (elemtype == TypeInt::BOOL) {
147 bt = T_BOOLEAN;
148 }
149 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(bt);
150 Node* ld = access_load_at(array, adr, adr_type, elemtype, bt,
151 IN_HEAP | IS_ARRAY | C2_CONTROL_DEPENDENT_LOAD);
152 ld = record_profile_for_speculation_at_array_load(ld);
153 // Loading an inline type from a non-flat array
154 if (element_ptr != nullptr && element_ptr->is_inlinetypeptr()) {
155 assert(!array_type->is_null_free() || !element_ptr->maybe_null(), "inline type array elements should never be null");
156 ld = InlineTypeNode::make_from_oop(this, ld, element_ptr->inline_klass());
157 }
158 push_node(bt, ld);
159 }
160
161 Node* Parse::load_from_unknown_flat_array(Node* array, Node* array_index, const TypeOopPtr* element_ptr) {
162 // Below membars keep this access to an unknown flat array correctly
163 // ordered with other unknown and known flat array accesses.
164 insert_mem_bar_volatile(Op_MemBarCPUOrder, C->get_alias_index(TypeAryPtr::INLINES));
165
166 Node* call = nullptr;
167 {
168 // Re-execute flat array load if runtime call triggers deoptimization
169 PreserveReexecuteState preexecs(this);
170 jvms()->set_bci(_bci);
171 jvms()->set_should_reexecute(true);
172 inc_sp(2);
173 kill_dead_locals();
174 call = make_runtime_call(RC_NO_LEAF | RC_NO_IO,
175 OptoRuntime::load_unknown_inline_Type(),
176 OptoRuntime::load_unknown_inline_Java(),
177 nullptr, TypeRawPtr::BOTTOM,
178 array, array_index);
179 }
180 make_slow_call_ex(call, env()->Throwable_klass(), false);
181 Node* buffer = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
182
183 insert_mem_bar_volatile(Op_MemBarCPUOrder, C->get_alias_index(TypeAryPtr::INLINES));
184
185 // Keep track of the information that the inline type is in flat arrays
186 const Type* unknown_value = element_ptr->is_instptr()->cast_to_flat_in_array();
187 return _gvn.transform(new CheckCastPPNode(control(), buffer, unknown_value));
188 }
189
190 //--------------------------------array_store----------------------------------
191 void Parse::array_store(BasicType bt) {
192 const Type* elemtype = Type::TOP;
193 Node* adr = array_addressing(bt, type2size[bt], elemtype);
194 if (stopped()) return; // guaranteed null or range check
195 Node* stored_value_casted = nullptr;
196 if (bt == T_OBJECT) {
197 stored_value_casted = array_store_check(adr, elemtype);
198 if (stopped()) {
199 return;
200 }
201 }
202 Node* const stored_value = pop_node(bt); // Value to store
203 Node* const array_index = pop(); // Index in the array
204 Node* array = pop(); // The array itself
205
206 const TypeAryPtr* array_type = _gvn.type(array)->is_aryptr();
207 const TypeAryPtr* adr_type = TypeAryPtr::get_array_body_type(bt);
208
209 if (elemtype == TypeInt::BOOL) {
210 bt = T_BOOLEAN;
211 } else if (bt == T_OBJECT) {
212 elemtype = elemtype->make_oopptr();
213 const Type* stored_value_casted_type = _gvn.type(stored_value_casted);
214 // Based on the value to be stored, try to determine if the array is not null-free and/or not flat.
215 // This is only legal for non-null stores because the array_store_check always passes for null, even
216 // if the array is null-free. Null stores are handled in GraphKit::inline_array_null_guard().
217 bool not_inline = !stored_value_casted_type->maybe_null() && !stored_value_casted_type->is_oopptr()->can_be_inline_type();
218 bool not_null_free = not_inline;
219 bool not_flat = not_inline || ( stored_value_casted_type->is_inlinetypeptr() &&
220 !stored_value_casted_type->inline_klass()->maybe_flat_in_array());
221 if (!array_type->is_not_null_free() && not_null_free) {
222 // Storing a non-inline type, mark array as not null-free.
223 array_type = array_type->cast_to_not_null_free();
224 Node* cast = _gvn.transform(new CheckCastPPNode(control(), array, array_type));
225 replace_in_map(array, cast);
226 array = cast;
227 }
228 if (!array_type->is_not_flat() && not_flat) {
229 // Storing to a non-flat array, mark array as not flat.
230 array_type = array_type->cast_to_not_flat();
231 Node* cast = _gvn.transform(new CheckCastPPNode(control(), array, array_type));
232 replace_in_map(array, cast);
233 array = cast;
234 }
235
236 if (array_type->is_null_free() && elemtype->is_inlinetypeptr() && elemtype->inline_klass()->is_empty()) {
237 // Array of null-free empty inline type, there is only 1 state for the elements
238 assert(!stored_value_casted_type->maybe_null(), "should be guaranteed by array store check");
239 return;
240 }
241
242 if (!array_type->is_not_flat()) {
243 // Array might be a flat array, emit runtime checks (for null, a simple inline_array_null_guard is sufficient).
244 assert(UseArrayFlattening && !not_flat && elemtype->is_oopptr()->can_be_inline_type() &&
245 (!array_type->klass_is_exact() || array_type->is_flat()), "array can't be a flat array");
246 // TODO 8350865 Depending on the available layouts, we can avoid this check in below flat/not-flat branches. Also the safe_for_replace arg is now always true.
247 array = inline_array_null_guard(array, stored_value_casted, 3, true);
248 IdealKit ideal(this);
249 ideal.if_then(flat_array_test(array, /* flat = */ false)); {
250 // Non-flat array
251 if (!array_type->is_flat()) {
252 sync_kit(ideal);
253 assert(array_type->is_flat() || ideal.ctrl()->in(0)->as_If()->is_flat_array_check(&_gvn), "Should be found");
254 inc_sp(3);
255 access_store_at(array, adr, adr_type, stored_value_casted, elemtype, bt, MO_UNORDERED | IN_HEAP | IS_ARRAY, false);
256 dec_sp(3);
257 ideal.sync_kit(this);
258 }
259 } ideal.else_(); {
260 // Flat array
261 sync_kit(ideal);
262 if (!array_type->is_not_flat()) {
263 // Try to determine the inline klass type of the stored value
264 ciInlineKlass* vk = nullptr;
265 if (stored_value_casted_type->is_inlinetypeptr()) {
266 vk = stored_value_casted_type->inline_klass();
267 } else if (elemtype->is_inlinetypeptr()) {
268 vk = elemtype->inline_klass();
269 }
270
271 if (vk != nullptr) {
272 // Element type is known, cast and store to flat array layout.
273 Node* flat_array = cast_to_flat_array(array, vk);
274
275 // Re-execute flat array store if buffering triggers deoptimization
276 PreserveReexecuteState preexecs(this);
277 jvms()->set_should_reexecute(true);
278 inc_sp(3);
279
280 if (!stored_value_casted->is_InlineType()) {
281 assert(_gvn.type(stored_value_casted) == TypePtr::NULL_PTR, "Unexpected value");
282 stored_value_casted = InlineTypeNode::make_null(_gvn, vk);
283 }
284
285 stored_value_casted->as_InlineType()->store_flat_array(this, flat_array, array_index);
286 } else {
287 // Element type is unknown, emit a runtime call since the flat array layout is not statically known.
288 store_to_unknown_flat_array(array, array_index, stored_value_casted);
289 }
290 }
291 ideal.sync_kit(this);
292 }
293 ideal.end_if();
294 sync_kit(ideal);
295 return;
296 } else if (!array_type->is_not_null_free()) {
297 // Array is not flat but may be null free
298 assert(elemtype->is_oopptr()->can_be_inline_type(), "array can't be null-free");
299 array = inline_array_null_guard(array, stored_value_casted, 3, true);
300 }
301 }
302 inc_sp(3);
303 access_store_at(array, adr, adr_type, stored_value, elemtype, bt, MO_UNORDERED | IN_HEAP | IS_ARRAY);
304 dec_sp(3);
305 }
306
307 // Emit a runtime call to store to a flat array whose element type is either unknown (i.e. we do not know the flat
308 // array layout) or not exact (could have different flat array layouts at runtime).
309 void Parse::store_to_unknown_flat_array(Node* array, Node* const idx, Node* non_null_stored_value) {
310 // Below membars keep this access to an unknown flat array correctly
311 // ordered with other unknown and known flat array accesses.
312 insert_mem_bar_volatile(Op_MemBarCPUOrder, C->get_alias_index(TypeAryPtr::INLINES));
313
314 Node* call = nullptr;
315 {
316 // Re-execute flat array store if runtime call triggers deoptimization
317 PreserveReexecuteState preexecs(this);
318 jvms()->set_bci(_bci);
319 jvms()->set_should_reexecute(true);
320 inc_sp(3);
321 kill_dead_locals();
322 call = make_runtime_call(RC_NO_LEAF | RC_NO_IO,
323 OptoRuntime::store_unknown_inline_Type(),
324 OptoRuntime::store_unknown_inline_Java(),
325 nullptr, TypeRawPtr::BOTTOM,
326 non_null_stored_value, array, idx);
327 }
328 make_slow_call_ex(call, env()->Throwable_klass(), false);
329
330 insert_mem_bar_volatile(Op_MemBarCPUOrder, C->get_alias_index(TypeAryPtr::INLINES));
331 }
332
333 //------------------------------array_addressing-------------------------------
334 // Pull array and index from the stack. Compute pointer-to-element.
335 Node* Parse::array_addressing(BasicType type, int vals, const Type*& elemtype) {
336 Node *idx = peek(0+vals); // Get from stack without popping
337 Node *ary = peek(1+vals); // in case of exception
338
339 // Null check the array base, with correct stack contents
340 ary = null_check(ary, T_ARRAY);
341 // Compile-time detect of null-exception?
342 if (stopped()) return top();
343
344 const TypeAryPtr* arytype = _gvn.type(ary)->is_aryptr();
345 const TypeInt* sizetype = arytype->size();
346 elemtype = arytype->elem();
347
348 if (UseUniqueSubclasses) {
349 const Type* el = elemtype->make_ptr();
350 if (el && el->isa_instptr()) {
351 const TypeInstPtr* toop = el->is_instptr();
352 if (toop->instance_klass()->unique_concrete_subklass()) {
353 // If we load from "AbstractClass[]" we must see "ConcreteSubClass".
354 const Type* subklass = Type::get_const_type(toop->instance_klass());
355 elemtype = subklass->join_speculative(el);
356 }
357 }
358 }
359
360 if (!arytype->is_loaded()) {
361 // Only fails for some -Xcomp runs
362 // The class is unloaded. We have to run this bytecode in the interpreter.
363 ciKlass* klass = arytype->unloaded_klass();
364
365 uncommon_trap(Deoptimization::Reason_unloaded,
366 Deoptimization::Action_reinterpret,
367 klass, "!loaded array");
368 return top();
369 }
370
371 ary = create_speculative_inline_type_array_checks(ary, arytype, elemtype);
372
373 if (needs_range_check(sizetype, idx)) {
374 create_range_check(idx, ary, sizetype);
375 } else if (C->log() != nullptr) {
376 C->log()->elem("observe that='!need_range_check'");
377 }
378
379 // Check for always knowing you are throwing a range-check exception
380 if (stopped()) return top();
381
382 // Make array address computation control dependent to prevent it
383 // from floating above the range check during loop optimizations.
384 Node* ptr = array_element_address(ary, idx, type, sizetype, control());
385 assert(ptr != top(), "top should go hand-in-hand with stopped");
386
387 return ptr;
388 }
389
390 // Check if we need a range check for an array access. This is the case if the index is either negative or if it could
391 // be greater or equal the smallest possible array size (i.e. out-of-bounds).
392 bool Parse::needs_range_check(const TypeInt* size_type, const Node* index) const {
393 const TypeInt* index_type = _gvn.type(index)->is_int();
394 return index_type->_hi >= size_type->_lo || index_type->_lo < 0;
395 }
396
397 void Parse::create_range_check(Node* idx, Node* ary, const TypeInt* sizetype) {
398 Node* tst;
399 if (sizetype->_hi <= 0) {
400 // The greatest array bound is negative, so we can conclude that we're
401 // compiling unreachable code, but the unsigned compare trick used below
402 // only works with non-negative lengths. Instead, hack "tst" to be zero so
403 // the uncommon_trap path will always be taken.
404 tst = _gvn.intcon(0);
405 } else {
406 // Range is constant in array-oop, so we can use the original state of mem
407 Node* len = load_array_length(ary);
408
409 // Test length vs index (standard trick using unsigned compare)
410 Node* chk = _gvn.transform(new CmpUNode(idx, len) );
411 BoolTest::mask btest = BoolTest::lt;
412 tst = _gvn.transform(new BoolNode(chk, btest) );
413 }
414 RangeCheckNode* rc = new RangeCheckNode(control(), tst, PROB_MAX, COUNT_UNKNOWN);
415 _gvn.set_type(rc, rc->Value(&_gvn));
416 if (!tst->is_Con()) {
417 record_for_igvn(rc);
418 }
419 set_control(_gvn.transform(new IfTrueNode(rc)));
420 // Branch to failure if out of bounds
421 {
422 PreserveJVMState pjvms(this);
423 set_control(_gvn.transform(new IfFalseNode(rc)));
424 if (C->allow_range_check_smearing()) {
425 // Do not use builtin_throw, since range checks are sometimes
426 // made more stringent by an optimistic transformation.
427 // This creates "tentative" range checks at this point,
428 // which are not guaranteed to throw exceptions.
429 // See IfNode::Ideal, is_range_check, adjust_check.
430 uncommon_trap(Deoptimization::Reason_range_check,
431 Deoptimization::Action_make_not_entrant,
432 nullptr, "range_check");
433 } else {
434 // If we have already recompiled with the range-check-widening
435 // heroic optimization turned off, then we must really be throwing
436 // range check exceptions.
437 builtin_throw(Deoptimization::Reason_range_check);
438 }
439 }
440 }
441
442 // For inline type arrays, we can use the profiling information for array accesses to speculate on the type, flatness,
443 // and null-freeness. We can either prepare the speculative type for later uses or emit explicit speculative checks with
444 // traps now. In the latter case, the speculative type guarantees can avoid additional runtime checks later (e.g.
445 // non-null-free implies non-flat which allows us to remove flatness checks). This makes the graph simpler.
446 Node* Parse::create_speculative_inline_type_array_checks(Node* array, const TypeAryPtr* array_type,
447 const Type*& element_type) {
448 if (!array_type->is_flat() && !array_type->is_not_flat()) {
449 // For arrays that might be flat, speculate that the array has the exact type reported in the profile data such that
450 // we can rely on a fixed memory layout (i.e. either a flat layout or not).
451 array = cast_to_speculative_array_type(array, array_type, element_type);
452 } else if (UseTypeSpeculation && UseArrayLoadStoreProfile) {
453 // Array is known to be either flat or not flat. If possible, update the speculative type by using the profile data
454 // at this bci.
455 array = cast_to_profiled_array_type(array);
456 }
457
458 // Even though the type does not tell us whether we have an inline type array or not, we can still check the profile data
459 // whether we have a non-null-free or non-flat array. Speculating on a non-null-free array doesn't help aaload but could
460 // be profitable for a subsequent aastore.
461 if (!array_type->is_null_free() && !array_type->is_not_null_free()) {
462 array = speculate_non_null_free_array(array, array_type);
463 }
464 if (!array_type->is_flat() && !array_type->is_not_flat()) {
465 array = speculate_non_flat_array(array, array_type);
466 }
467 return array;
468 }
469
470 // Speculate that the array has the exact type reported in the profile data. We emit a trap when this turns out to be
471 // wrong. On the fast path, we add a CheckCastPP to use the exact type.
472 Node* Parse::cast_to_speculative_array_type(Node* const array, const TypeAryPtr*& array_type, const Type*& element_type) {
473 Deoptimization::DeoptReason reason = Deoptimization::Reason_speculate_class_check;
474 ciKlass* speculative_array_type = array_type->speculative_type();
475 if (too_many_traps_or_recompiles(reason) || speculative_array_type == nullptr) {
476 // No speculative type, check profile data at this bci
477 speculative_array_type = nullptr;
478 reason = Deoptimization::Reason_class_check;
479 if (UseArrayLoadStoreProfile && !too_many_traps_or_recompiles(reason)) {
480 ciKlass* profiled_element_type = nullptr;
481 ProfilePtrKind element_ptr = ProfileMaybeNull;
482 bool flat_array = true;
483 bool null_free_array = true;
484 method()->array_access_profiled_type(bci(), speculative_array_type, profiled_element_type, element_ptr, flat_array,
485 null_free_array);
486 }
487 }
488 if (speculative_array_type != nullptr) {
489 // Speculate that this array has the exact type reported by profile data
490 Node* casted_array = nullptr;
491 DEBUG_ONLY(Node* old_control = control();)
492 Node* slow_ctl = type_check_receiver(array, speculative_array_type, 1.0, &casted_array);
493 if (stopped()) {
494 // The check always fails and therefore profile information is incorrect. Don't use it.
495 assert(old_control == slow_ctl, "type check should have been removed");
496 set_control(slow_ctl);
497 } else if (!slow_ctl->is_top()) {
498 { PreserveJVMState pjvms(this);
499 set_control(slow_ctl);
500 uncommon_trap_exact(reason, Deoptimization::Action_maybe_recompile);
501 }
502 replace_in_map(array, casted_array);
503 array_type = _gvn.type(casted_array)->is_aryptr();
504 element_type = array_type->elem();
505 return casted_array;
506 }
507 }
508 return array;
509 }
510
511 // Create a CheckCastPP when the speculative type can improve the current type.
512 Node* Parse::cast_to_profiled_array_type(Node* const array) {
513 ciKlass* array_type = nullptr;
514 ciKlass* element_type = nullptr;
515 ProfilePtrKind element_ptr = ProfileMaybeNull;
516 bool flat_array = true;
517 bool null_free_array = true;
518 method()->array_access_profiled_type(bci(), array_type, element_type, element_ptr, flat_array, null_free_array);
519 if (array_type != nullptr) {
520 return record_profile_for_speculation(array, array_type, ProfileMaybeNull);
521 }
522 return array;
523 }
524
525 // Speculate that the array is non-null-free. We emit a trap when this turns out to be
526 // wrong. On the fast path, we add a CheckCastPP to use the non-null-free type.
527 Node* Parse::speculate_non_null_free_array(Node* const array, const TypeAryPtr*& array_type) {
528 bool null_free_array = true;
529 Deoptimization::DeoptReason reason = Deoptimization::Reason_none;
530 if (array_type->speculative() != nullptr &&
531 array_type->speculative()->is_aryptr()->is_not_null_free() &&
532 !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_class_check)) {
533 null_free_array = false;
534 reason = Deoptimization::Reason_speculate_class_check;
535 } else if (UseArrayLoadStoreProfile && !too_many_traps_or_recompiles(Deoptimization::Reason_class_check)) {
536 ciKlass* profiled_array_type = nullptr;
537 ciKlass* profiled_element_type = nullptr;
538 ProfilePtrKind element_ptr = ProfileMaybeNull;
539 bool flat_array = true;
540 method()->array_access_profiled_type(bci(), profiled_array_type, profiled_element_type, element_ptr, flat_array,
541 null_free_array);
542 reason = Deoptimization::Reason_class_check;
543 }
544 if (!null_free_array) {
545 { // Deoptimize if null-free array
546 BuildCutout unless(this, null_free_array_test(array, /* null_free = */ false), PROB_MAX);
547 uncommon_trap_exact(reason, Deoptimization::Action_maybe_recompile);
548 }
549 assert(!stopped(), "null-free array should have been caught earlier");
550 Node* casted_array = _gvn.transform(new CheckCastPPNode(control(), array, array_type->cast_to_not_null_free()));
551 replace_in_map(array, casted_array);
552 array_type = _gvn.type(casted_array)->is_aryptr();
553 return casted_array;
554 }
555 return array;
556 }
557
558 // Speculate that the array is non-flat. We emit a trap when this turns out to be wrong.
559 // On the fast path, we add a CheckCastPP to use the non-flat type.
560 Node* Parse::speculate_non_flat_array(Node* const array, const TypeAryPtr* const array_type) {
561 bool flat_array = true;
562 Deoptimization::DeoptReason reason = Deoptimization::Reason_none;
563 if (array_type->speculative() != nullptr &&
564 array_type->speculative()->is_aryptr()->is_not_flat() &&
565 !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_class_check)) {
566 flat_array = false;
567 reason = Deoptimization::Reason_speculate_class_check;
568 } else if (UseArrayLoadStoreProfile && !too_many_traps_or_recompiles(reason)) {
569 ciKlass* profiled_array_type = nullptr;
570 ciKlass* profiled_element_type = nullptr;
571 ProfilePtrKind element_ptr = ProfileMaybeNull;
572 bool null_free_array = true;
573 method()->array_access_profiled_type(bci(), profiled_array_type, profiled_element_type, element_ptr, flat_array,
574 null_free_array);
575 reason = Deoptimization::Reason_class_check;
576 }
577 if (!flat_array) {
578 { // Deoptimize if flat array
579 BuildCutout unless(this, flat_array_test(array, /* flat = */ false), PROB_MAX);
580 uncommon_trap_exact(reason, Deoptimization::Action_maybe_recompile);
581 }
582 assert(!stopped(), "flat array should have been caught earlier");
583 Node* casted_array = _gvn.transform(new CheckCastPPNode(control(), array, array_type->cast_to_not_flat()));
584 replace_in_map(array, casted_array);
585 return casted_array;
586 }
587 return array;
588 }
589
590 // returns IfNode
591 IfNode* Parse::jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask, float prob, float cnt) {
592 Node *cmp = _gvn.transform(new CmpINode(a, b)); // two cases: shiftcount > 32 and shiftcount <= 32
593 Node *tst = _gvn.transform(new BoolNode(cmp, mask));
594 IfNode *iff = create_and_map_if(control(), tst, prob, cnt);
595 return iff;
596 }
597
598
599 // sentinel value for the target bci to mark never taken branches
600 // (according to profiling)
601 static const int never_reached = INT_MAX;
602
603 //------------------------------helper for tableswitch-------------------------
604 void Parse::jump_if_true_fork(IfNode *iff, int dest_bci_if_true, bool unc) {
605 // True branch, use existing map info
606 { PreserveJVMState pjvms(this);
607 Node *iftrue = _gvn.transform( new IfTrueNode (iff) );
608 set_control( iftrue );
1826 // False branch
1827 Node* iffalse = _gvn.transform( new IfFalseNode(iff) );
1828 set_control(iffalse);
1829
1830 if (stopped()) { // Path is dead?
1831 NOT_PRODUCT(explicit_null_checks_elided++);
1832 if (C->eliminate_boxing()) {
1833 // Mark the successor block as parsed
1834 next_block->next_path_num();
1835 }
1836 } else { // Path is live.
1837 adjust_map_after_if(BoolTest(btest).negate(), c, 1.0-prob, next_block);
1838 }
1839
1840 if (do_stress_trap) {
1841 stress_trap(iff, counter, incr_store);
1842 }
1843 }
1844
1845 //------------------------------------do_if------------------------------------
1846 void Parse::do_if(BoolTest::mask btest, Node* c, bool can_trap, bool new_path, Node** ctrl_taken, Node** mem_taken, Node** io_taken) {
1847 int target_bci = iter().get_dest();
1848
1849 Block* branch_block = successor_for_bci(target_bci);
1850 Block* next_block = successor_for_bci(iter().next_bci());
1851
1852 float cnt;
1853 float prob = branch_prediction(cnt, btest, target_bci, c);
1854 float untaken_prob = 1.0 - prob;
1855
1856 if (prob == PROB_UNKNOWN) {
1857 if (PrintOpto && Verbose) {
1858 tty->print_cr("Never-taken edge stops compilation at bci %d", bci());
1859 }
1860 repush_if_args(); // to gather stats on loop
1861 uncommon_trap(Deoptimization::Reason_unreached,
1862 Deoptimization::Action_reinterpret,
1863 nullptr, "cold");
1864 if (C->eliminate_boxing()) {
1865 // Mark the successor blocks as parsed
1866 branch_block->next_path_num();
1917 }
1918
1919 // Generate real control flow
1920 float true_prob = (taken_if_true ? prob : untaken_prob);
1921 IfNode* iff = create_and_map_if(control(), tst, true_prob, cnt);
1922 assert(iff->_prob > 0.0f,"Optimizer made bad probability in parser");
1923 Node* taken_branch = new IfTrueNode(iff);
1924 Node* untaken_branch = new IfFalseNode(iff);
1925 if (!taken_if_true) { // Finish conversion to canonical form
1926 Node* tmp = taken_branch;
1927 taken_branch = untaken_branch;
1928 untaken_branch = tmp;
1929 }
1930
1931 // Branch is taken:
1932 { PreserveJVMState pjvms(this);
1933 taken_branch = _gvn.transform(taken_branch);
1934 set_control(taken_branch);
1935
1936 if (stopped()) {
1937 if (C->eliminate_boxing() && !new_path) {
1938 // Mark the successor block as parsed (if we haven't created a new path)
1939 branch_block->next_path_num();
1940 }
1941 } else {
1942 adjust_map_after_if(taken_btest, c, prob, branch_block, can_trap);
1943 if (!stopped()) {
1944 if (new_path) {
1945 // Merge by using a new path
1946 merge_new_path(target_bci);
1947 } else if (ctrl_taken != nullptr) {
1948 // Don't merge but save taken branch to be wired by caller
1949 *ctrl_taken = control();
1950 if (mem_taken != nullptr) {
1951 *mem_taken = reset_memory();
1952 }
1953 if (io_taken != nullptr) {
1954 *io_taken = i_o();
1955 }
1956 } else {
1957 merge(target_bci);
1958 }
1959 }
1960 }
1961 }
1962
1963 untaken_branch = _gvn.transform(untaken_branch);
1964 set_control(untaken_branch);
1965
1966 // Branch not taken.
1967 if (stopped() && ctrl_taken == nullptr) {
1968 if (C->eliminate_boxing()) {
1969 // Mark the successor block as parsed (if caller does not re-wire control flow)
1970 next_block->next_path_num();
1971 }
1972 } else {
1973 adjust_map_after_if(untaken_btest, c, untaken_prob, next_block, can_trap);
1974 }
1975
1976 if (do_stress_trap) {
1977 stress_trap(iff, counter, incr_store);
1978 }
1979 }
1980
1981
1982 static ProfilePtrKind speculative_ptr_kind(const TypeOopPtr* t) {
1983 if (t->speculative() == nullptr) {
1984 return ProfileUnknownNull;
1985 }
1986 if (t->speculative_always_null()) {
1987 return ProfileAlwaysNull;
1988 }
1989 if (t->speculative_maybe_null()) {
1990 return ProfileMaybeNull;
1991 }
1992 return ProfileNeverNull;
1993 }
1994
1995 void Parse::acmp_always_null_input(Node* input, const TypeOopPtr* tinput, BoolTest::mask btest, Node* eq_region) {
1996 if (btest == BoolTest::ne) {
1997 {
1998 PreserveJVMState pjvms(this);
1999 inc_sp(2);
2000 null_check_common(input, T_OBJECT, true, nullptr,
2001 !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_check) &&
2002 speculative_ptr_kind(tinput) == ProfileAlwaysNull);
2003 dec_sp(2);
2004 int target_bci = iter().get_dest();
2005 merge(target_bci);
2006 }
2007 record_for_igvn(eq_region);
2008 set_control(_gvn.transform(eq_region));
2009 } else {
2010 inc_sp(2);
2011 null_check_common(input, T_OBJECT, true, nullptr,
2012 !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_check) &&
2013 speculative_ptr_kind(tinput) == ProfileAlwaysNull);
2014 dec_sp(2);
2015 }
2016 }
2017
2018 Node* Parse::acmp_null_check(Node* input, const TypeOopPtr* tinput, ProfilePtrKind input_ptr, Node*& null_ctl) {
2019 inc_sp(2);
2020 null_ctl = top();
2021 Node* cast = null_check_oop(input, &null_ctl,
2022 input_ptr == ProfileNeverNull || (input_ptr == ProfileUnknownNull && !too_many_traps_or_recompiles(Deoptimization::Reason_null_check)),
2023 false,
2024 speculative_ptr_kind(tinput) == ProfileNeverNull &&
2025 !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_check));
2026 dec_sp(2);
2027 return cast;
2028 }
2029
2030 void Parse::acmp_type_check_or_trap(Node** non_null_input, ciKlass* input_type, Deoptimization::DeoptReason reason) {
2031 Node* slow_ctl = type_check_receiver(*non_null_input, input_type, 1.0, non_null_input);
2032 {
2033 PreserveJVMState pjvms(this);
2034 inc_sp(2);
2035 set_control(slow_ctl);
2036 uncommon_trap_exact(reason, Deoptimization::Action_maybe_recompile);
2037 }
2038 }
2039
2040 void Parse::acmp_type_check(Node* input, const TypeOopPtr* tinput, ProfilePtrKind input_ptr, ciKlass* input_type, BoolTest::mask btest, Node* eq_region) {
2041 Node* null_ctl;
2042 Node* cast = acmp_null_check(input, tinput, input_ptr, null_ctl);
2043
2044 if (input_type != nullptr) {
2045 Deoptimization::DeoptReason reason;
2046 if (tinput->speculative_type() != nullptr && !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_class_check)) {
2047 reason = Deoptimization::Reason_speculate_class_check;
2048 } else {
2049 reason = Deoptimization::Reason_class_check;
2050 }
2051 acmp_type_check_or_trap(&cast, input_type, reason);
2052 } else {
2053 // No specific type, check for inline type
2054 BuildCutout unless(this, inline_type_test(cast, /* is_inline = */ false), PROB_MAX);
2055 inc_sp(2);
2056 uncommon_trap_exact(Deoptimization::Reason_class_check, Deoptimization::Action_maybe_recompile);
2057 }
2058
2059 Node* ne_region = new RegionNode(2);
2060 ne_region->add_req(null_ctl);
2061 ne_region->add_req(control());
2062
2063 record_for_igvn(ne_region);
2064 set_control(_gvn.transform(ne_region));
2065 if (btest == BoolTest::ne) {
2066 {
2067 PreserveJVMState pjvms(this);
2068 if (null_ctl == top()) {
2069 replace_in_map(input, cast);
2070 }
2071 int target_bci = iter().get_dest();
2072 merge(target_bci);
2073 }
2074 record_for_igvn(eq_region);
2075 set_control(_gvn.transform(eq_region));
2076 } else {
2077 if (null_ctl == top()) {
2078 replace_in_map(input, cast);
2079 }
2080 set_control(_gvn.transform(ne_region));
2081 }
2082 }
2083
2084 void Parse::do_acmp(BoolTest::mask btest, Node* left, Node* right) {
2085 ciKlass* left_type = nullptr;
2086 ciKlass* right_type = nullptr;
2087 ProfilePtrKind left_ptr = ProfileUnknownNull;
2088 ProfilePtrKind right_ptr = ProfileUnknownNull;
2089 bool left_inline_type = true;
2090 bool right_inline_type = true;
2091
2092 // Leverage profiling at acmp
2093 if (UseACmpProfile) {
2094 method()->acmp_profiled_type(bci(), left_type, right_type, left_ptr, right_ptr, left_inline_type, right_inline_type);
2095 if (too_many_traps_or_recompiles(Deoptimization::Reason_class_check)) {
2096 left_type = nullptr;
2097 right_type = nullptr;
2098 left_inline_type = true;
2099 right_inline_type = true;
2100 }
2101 if (too_many_traps_or_recompiles(Deoptimization::Reason_null_check)) {
2102 left_ptr = ProfileUnknownNull;
2103 right_ptr = ProfileUnknownNull;
2104 }
2105 }
2106
2107 if (UseTypeSpeculation) {
2108 record_profile_for_speculation(left, left_type, left_ptr);
2109 record_profile_for_speculation(right, right_type, right_ptr);
2110 }
2111
2112 if (!Arguments::is_valhalla_enabled()) {
2113 Node* cmp = CmpP(left, right);
2114 cmp = optimize_cmp_with_klass(cmp);
2115 do_if(btest, cmp);
2116 return;
2117 }
2118
2119 // Check for equality before potentially allocating
2120 if (left == right) {
2121 do_if(btest, makecon(TypeInt::CC_EQ));
2122 return;
2123 }
2124
2125 // Allocate inline type operands and re-execute on deoptimization
2126 if (left->is_InlineType()) {
2127 PreserveReexecuteState preexecs(this);
2128 inc_sp(2);
2129 jvms()->set_should_reexecute(true);
2130 left = left->as_InlineType()->buffer(this);
2131 }
2132 if (right->is_InlineType()) {
2133 PreserveReexecuteState preexecs(this);
2134 inc_sp(2);
2135 jvms()->set_should_reexecute(true);
2136 right = right->as_InlineType()->buffer(this);
2137 }
2138
2139 // First, do a normal pointer comparison
2140 const TypeOopPtr* tleft = _gvn.type(left)->isa_oopptr();
2141 const TypeOopPtr* tright = _gvn.type(right)->isa_oopptr();
2142 Node* cmp = CmpP(left, right);
2143 record_for_igvn(cmp);
2144 cmp = optimize_cmp_with_klass(cmp);
2145 if (tleft == nullptr || !tleft->can_be_inline_type() ||
2146 tright == nullptr || !tright->can_be_inline_type()) {
2147 // This is sufficient, if one of the operands can't be an inline type
2148 do_if(btest, cmp);
2149 return;
2150 }
2151
2152 // Don't add traps to unstable if branches because additional checks are required to
2153 // decide if the operands are equal/substitutable and we therefore shouldn't prune
2154 // branches for one if based on the profiling of the acmp branches.
2155 // Also, OptimizeUnstableIf would set an incorrect re-rexecution state because it
2156 // assumes that there is a 1-1 mapping between the if and the acmp branches and that
2157 // hitting a trap means that we will take the corresponding acmp branch on re-execution.
2158 const bool can_trap = true;
2159
2160 Node* eq_region = nullptr;
2161 if (btest == BoolTest::eq) {
2162 do_if(btest, cmp, !can_trap, true);
2163 if (stopped()) {
2164 // Pointers are equal, operands must be equal
2165 return;
2166 }
2167 } else {
2168 assert(btest == BoolTest::ne, "only eq or ne");
2169 Node* is_not_equal = nullptr;
2170 eq_region = new RegionNode(4);
2171 {
2172 PreserveJVMState pjvms(this);
2173 // Pointers are not equal, but more checks are needed to determine if the operands are (not) substitutable
2174 do_if(btest, cmp, !can_trap, false, &is_not_equal);
2175 if (!stopped()) {
2176 eq_region->init_req(1, control());
2177 }
2178 }
2179 if (is_not_equal == nullptr || is_not_equal->is_top()) {
2180 record_for_igvn(eq_region);
2181 set_control(_gvn.transform(eq_region));
2182 return;
2183 }
2184 set_control(is_not_equal);
2185 }
2186
2187 // Prefer speculative types if available
2188 if (!too_many_traps_or_recompiles(Deoptimization::Reason_speculate_class_check)) {
2189 if (tleft->speculative_type() != nullptr) {
2190 left_type = tleft->speculative_type();
2191 }
2192 if (tright->speculative_type() != nullptr) {
2193 right_type = tright->speculative_type();
2194 }
2195 }
2196
2197 if (speculative_ptr_kind(tleft) != ProfileMaybeNull && speculative_ptr_kind(tleft) != ProfileUnknownNull) {
2198 ProfilePtrKind speculative_left_ptr = speculative_ptr_kind(tleft);
2199 if (speculative_left_ptr == ProfileAlwaysNull && !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_assert)) {
2200 left_ptr = speculative_left_ptr;
2201 } else if (speculative_left_ptr == ProfileNeverNull && !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_check)) {
2202 left_ptr = speculative_left_ptr;
2203 }
2204 }
2205 if (speculative_ptr_kind(tright) != ProfileMaybeNull && speculative_ptr_kind(tright) != ProfileUnknownNull) {
2206 ProfilePtrKind speculative_right_ptr = speculative_ptr_kind(tright);
2207 if (speculative_right_ptr == ProfileAlwaysNull && !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_assert)) {
2208 right_ptr = speculative_right_ptr;
2209 } else if (speculative_right_ptr == ProfileNeverNull && !too_many_traps_or_recompiles(Deoptimization::Reason_speculate_null_check)) {
2210 right_ptr = speculative_right_ptr;
2211 }
2212 }
2213
2214 if (left_ptr == ProfileAlwaysNull) {
2215 // Comparison with null. Assert the input is indeed null and we're done.
2216 acmp_always_null_input(left, tleft, btest, eq_region);
2217 return;
2218 }
2219 if (right_ptr == ProfileAlwaysNull) {
2220 // Comparison with null. Assert the input is indeed null and we're done.
2221 acmp_always_null_input(right, tright, btest, eq_region);
2222 return;
2223 }
2224 if (left_type != nullptr && !left_type->is_inlinetype()) {
2225 // Comparison with an object of known type
2226 acmp_type_check(left, tleft, left_ptr, left_type, btest, eq_region);
2227 return;
2228 }
2229 if (right_type != nullptr && !right_type->is_inlinetype()) {
2230 // Comparison with an object of known type
2231 acmp_type_check(right, tright, right_ptr, right_type, btest, eq_region);
2232 return;
2233 }
2234 if (!left_inline_type) {
2235 // Comparison with an object known not to be an inline type
2236 acmp_type_check(left, tleft, left_ptr, nullptr, btest, eq_region);
2237 return;
2238 }
2239 if (!right_inline_type) {
2240 // Comparison with an object known not to be an inline type
2241 acmp_type_check(right, tright, right_ptr, nullptr, btest, eq_region);
2242 return;
2243 }
2244
2245 // Pointers are not equal, check if first operand is non-null
2246 Node* ne_region = new RegionNode(7);
2247 Node* null_ctl = nullptr;
2248 Node* not_null_left = nullptr;
2249 Node* not_null_right = acmp_null_check(right, tright, right_ptr, null_ctl);
2250 ne_region->init_req(1, null_ctl);
2251
2252 Node* kls_right = nullptr;
2253 if (!stopped()) {
2254 // First operand is non-null, check if it is the speculative inline type if possible
2255 // (which later allows isSubstitutable to be intrinsified), or any inline type if no
2256 // speculation is available.
2257 if (right_type != nullptr && right_type->is_inlinetype()) {
2258 acmp_type_check_or_trap(¬_null_right, right_type, Deoptimization::Reason_speculate_class_check);
2259 } else {
2260 Node* is_value = inline_type_test(not_null_right);
2261 IfNode* is_value_iff = create_and_map_if(control(), is_value, PROB_FAIR, COUNT_UNKNOWN);
2262 Node* not_value = _gvn.transform(new IfFalseNode(is_value_iff));
2263 ne_region->init_req(2, not_value);
2264 set_control(_gvn.transform(new IfTrueNode(is_value_iff)));
2265 }
2266
2267 // The first operand is an inline type, check if the second operand is non-null
2268 not_null_left = acmp_null_check(left, tleft, left_ptr, null_ctl);
2269 ne_region->init_req(3, null_ctl);
2270 if (!stopped()) {
2271 // Check if lhs operand is of a specific speculative inline type (see above).
2272 // If not, we don't need to enforce that the lhs is a value object since we know
2273 // it already for the rhs, and must enforce that they have the same type.
2274 if (left_type != nullptr && left_type->is_inlinetype()) {
2275 acmp_type_check_or_trap(¬_null_left, left_type, Deoptimization::Reason_speculate_class_check);
2276 }
2277 if (!stopped()) {
2278 // Check if both operands are of the same class.
2279 Node* kls_left = load_object_klass(not_null_left);
2280 kls_right = load_object_klass(not_null_right);
2281 Node* kls_cmp = CmpP(kls_left, kls_right);
2282 Node* kls_bol = _gvn.transform(new BoolNode(kls_cmp, BoolTest::ne));
2283 IfNode* kls_iff = create_and_map_if(control(), kls_bol, PROB_FAIR, COUNT_UNKNOWN);
2284 Node* kls_ne = _gvn.transform(new IfTrueNode(kls_iff));
2285 set_control(_gvn.transform(new IfFalseNode(kls_iff)));
2286 ne_region->init_req(4, kls_ne);
2287 }
2288 }
2289 }
2290
2291 if (stopped()) {
2292 record_for_igvn(ne_region);
2293 set_control(_gvn.transform(ne_region));
2294 if (btest == BoolTest::ne) {
2295 {
2296 PreserveJVMState pjvms(this);
2297 int target_bci = iter().get_dest();
2298 merge(target_bci);
2299 }
2300 record_for_igvn(eq_region);
2301 set_control(_gvn.transform(eq_region));
2302 }
2303 return;
2304 }
2305 assert(kls_right != nullptr, "");
2306
2307 IfNode* mask_iff = nullptr;
2308 // If any operand has a precisely known type, isSubstitutable will be intrinsified, so we don't need the fast path
2309 if (UseAcmpFastPath && !_gvn.type(not_null_left)->is_inlinetypeptr() && !_gvn.type(not_null_right)->is_inlinetypeptr()) {
2310 /* Here, we are generating the fast path (the slow path being the call to isSubstitutable)
2311 * See the declarations of _fast_acmp_offset and _fast_acmp_mask in InlineKlass::Members
2312 * for details about the fast path logic, and the meaning of these values.
2313 */
2314 Node* members_addr = off_heap_plus_addr(kls_right, in_bytes(InlineKlass::adr_members_offset()));
2315 Node* members = make_load(control(), members_addr, TypeRawPtr::BOTTOM, T_ADDRESS, MemNode::unordered);
2316 Node* offset_addr = off_heap_plus_addr(members, in_bytes(InlineKlass::fast_acmp_offset_offset()));
2317 Node* offset = make_load(control(), offset_addr, TypeInt::INT, T_INT, MemNode::unordered);
2318
2319 Node* offset_cmp = CmpI(offset, zerocon(T_INT));
2320 Node* offset_bol = _gvn.transform(new BoolNode(offset_cmp, BoolTest::lt));
2321 mask_iff = create_and_map_if(control(), offset_bol, PROB_FAIR, COUNT_UNKNOWN);
2322 Node* slow_path_ctl = _gvn.transform(new IfTrueNode(mask_iff));
2323 Node* fast_path_ctl = _gvn.transform(new IfFalseNode(mask_iff));
2324 set_control(slow_path_ctl);
2325
2326 {
2327 PreserveJVMState jvms(this);
2328 set_control(fast_path_ctl);
2329
2330 Node* offset_l = ConvI2L(offset);
2331 Node* fast_acmp_mask_addr = off_heap_plus_addr(members, in_bytes(InlineKlass::fast_acmp_mask_offset()));
2332 Node* fast_acmp_mask = make_load(control(), fast_acmp_mask_addr, TypeLong::LONG, T_LONG, MemNode::unordered);
2333
2334 // *(left + offset) & mask == *(right + offset) & mask
2335 Node* left_payload_addr = basic_plus_adr(not_null_left, offset_l);
2336 Node* left_payload = make_load(control(), left_payload_addr, TypeLong::LONG, T_LONG, MemNode::unordered, LoadNNode::DependsOnlyOnTest, false, true, true, true);
2337 Node* left_masked = _gvn.transform(new AndLNode(left_payload, fast_acmp_mask));
2338
2339 Node* right_payload_addr = basic_plus_adr(not_null_right, offset_l);
2340 Node* right_payload = make_load(control(), right_payload_addr, TypeLong::LONG, T_LONG, MemNode::unordered, LoadNNode::DependsOnlyOnTest, false, true, true, true);
2341 Node* right_masked = _gvn.transform(new AndLNode(right_payload, fast_acmp_mask));
2342
2343 Node* masked_cmp = CmpL(left_masked, right_masked);
2344
2345 Node* ctl = C->top();
2346 if (btest == BoolTest::eq) {
2347 PreserveJVMState pjvms(this);
2348 do_if(btest, masked_cmp, !can_trap, true, nullptr);
2349 if (!stopped()) {
2350 ctl = control();
2351 }
2352 } else {
2353 assert(btest == BoolTest::ne, "only eq or ne");
2354 PreserveJVMState pjvms(this);
2355 do_if(btest, masked_cmp, !can_trap, false, &ctl);
2356 if (!stopped()) {
2357 eq_region->init_req(3, control());
2358 }
2359 }
2360 ne_region->init_req(6, ctl);
2361 }
2362 }
2363
2364 // Both operands are values types of the same class, we need to perform a
2365 // substitutability test. Delegate to ValueObjectMethods::isSubstitutable().
2366 Node* ne_io_phi = PhiNode::make(ne_region, i_o());
2367 Node* mem = reset_memory();
2368 Node* ne_mem_phi = PhiNode::make(ne_region, mem);
2369
2370 Node* eq_io_phi = nullptr;
2371 Node* eq_mem_phi = nullptr;
2372 if (eq_region != nullptr) {
2373 eq_io_phi = PhiNode::make(eq_region, i_o());
2374 eq_mem_phi = PhiNode::make(eq_region, mem);
2375 }
2376
2377 set_all_memory(mem);
2378
2379 kill_dead_locals();
2380 ciSymbol* subst_method_name = ciSymbols::isSubstitutable_name();
2381 ciMethod* subst_method = ciEnv::current()->ValueObjectMethods_klass()->find_method(subst_method_name, ciSymbols::object_object_boolean_signature());
2382 CallStaticJavaNode* call = new CallStaticJavaNode(C, TypeFunc::make(subst_method), SharedRuntime::get_resolve_static_call_stub(), subst_method);
2383 call->set_override_symbolic_info(true);
2384 call->init_req(TypeFunc::Parms, not_null_left);
2385 call->init_req(TypeFunc::Parms+1, not_null_right);
2386 inc_sp(2);
2387 set_edges_for_java_call(call, false, false);
2388 Node* ret = set_results_for_java_call(call, false, true);
2389 dec_sp(2);
2390
2391 assert(acmp_fast_path_if_from_substitutable_call(&_gvn, call) == mask_iff, "");
2392
2393 // Test the return value of ValueObjectMethods::isSubstitutable()
2394 // This is the last check, do_if can emit traps now.
2395 Node* subst_cmp = _gvn.transform(new CmpINode(ret, intcon(1)));
2396 Node* ctl = C->top();
2397 Node* mem_taken = nullptr;
2398 Node* io_taken = nullptr;
2399 if (btest == BoolTest::eq) {
2400 PreserveJVMState pjvms(this);
2401 do_if(btest, subst_cmp, can_trap, false, nullptr, &mem_taken, &io_taken);
2402 if (!stopped()) {
2403 ctl = control();
2404 mem_taken = reset_memory();
2405 io_taken = i_o();
2406 }
2407 } else {
2408 assert(btest == BoolTest::ne, "only eq or ne");
2409 PreserveJVMState pjvms(this);
2410 do_if(btest, subst_cmp, can_trap, false, &ctl, &mem_taken, &io_taken);
2411 if (!stopped()) {
2412 eq_region->init_req(2, control());
2413 eq_io_phi->init_req(2, i_o());
2414 eq_mem_phi->init_req(2, reset_memory());
2415 }
2416 }
2417 ne_region->init_req(5, ctl);
2418 ne_io_phi->init_req(5, io_taken);
2419 ne_mem_phi->init_req(5, mem_taken);
2420
2421 record_for_igvn(ne_region);
2422 set_control(_gvn.transform(ne_region));
2423 set_i_o(_gvn.transform(ne_io_phi));
2424 set_all_memory(_gvn.transform(ne_mem_phi));
2425
2426 if (btest == BoolTest::ne) {
2427 {
2428 PreserveJVMState pjvms(this);
2429 int target_bci = iter().get_dest();
2430 merge(target_bci);
2431 }
2432
2433 record_for_igvn(eq_region);
2434 set_control(_gvn.transform(eq_region));
2435 set_i_o(_gvn.transform(eq_io_phi));
2436 set_all_memory(_gvn.transform(eq_mem_phi));
2437 }
2438 }
2439
2440 /* Detects whether a call to isSubstitutable is under an IfNode guarding the fast path for acmp.
2441 * If so, returns the IfNode branching between the call and the fast path. Returns null otherwise.
2442 *
2443 * The fast path is a LOT easier to generate at parsing time, but can be later proven useless if further
2444 * optimization narrows down the type of operands and allows intrinsification of the substitutability
2445 * check. In this case, the fast path might still apply, but it comes with various downsides, such as
2446 * mismatch access that may hinder optimizations, or buffering requirement. So, when intrinsifying the call,
2447 * we try to remove the fast path.
2448 *
2449 * This test isn't so bad. Loading the fast acmp offset is pretty unique to the fast acmp path.
2450 *
2451 * Clearly, this is only a step before a proper solution for acmp, such as a macro node.
2452 */
2453 IfNode* Parse::acmp_fast_path_if_from_substitutable_call(PhaseGVN* phase, CallStaticJavaNode* call) {
2454 auto is_con_offset = [](Node* node, ByteSize n) -> bool {
2455 if (!node->is_Con()) return false;
2456 TypeNode* con = node->as_Type();
2457 assert(con->type()->is_intptr_t(), "");
2458 return con->type()->is_intptr_t()->is_con(in_bytes(n));
2459 };
2460
2461 assert(call->in(TypeFunc::Control) != nullptr, "");
2462 if (!call->in(TypeFunc::Control)->is_IfProj()) return nullptr;
2463 IfProjNode* if_proj = call->in(TypeFunc::Control)->as_IfProj();
2464 if (if_proj->_con != 1) return nullptr;
2465
2466 assert(if_proj->in(0) != nullptr, "");
2467 assert(if_proj->in(0)->is_If(), "");
2468 IfNode* iff = if_proj->in(0)->as_If();
2469
2470 assert(iff->in(1) != nullptr, "");
2471 if (!iff->in(1)->is_Bool()) return nullptr;
2472 BoolNode* lt = iff->in(1)->as_Bool();
2473 if (lt->_test._test != BoolTest::lt) return nullptr;
2474
2475 assert(lt->in(1) != nullptr, "");
2476 if (lt->in(1)->Opcode() != Op_CmpI) return nullptr;
2477 CmpNode* cmp_i = lt->in(1)->as_Cmp();
2478
2479 assert(cmp_i->in(1) != nullptr, "");
2480 assert(cmp_i->in(2) != nullptr, "");
2481
2482 if (cmp_i->in(1)->Opcode() != Op_LoadI) return nullptr;
2483 LoadNode* load_offset = cmp_i->in(1)->as_Load();
2484 if (!cmp_i->in(2)->is_ConI()) return nullptr;
2485 ConINode* zero_i = cmp_i->in(2)->as_ConI();
2486 assert(zero_i->type()->is_int() != nullptr, "");
2487 if (!zero_i->type()->is_int()->is_con(0)) return nullptr;
2488
2489 assert(load_offset->in(2) != nullptr, "");
2490 if (!load_offset->in(2)->is_AddP()) return nullptr;
2491 AddPNode* offset_addr_add = load_offset->in(2)->as_AddP();
2492
2493 assert(offset_addr_add->in(AddPNode::Base) != nullptr, "");
2494 assert(offset_addr_add->in(AddPNode::Address) != nullptr, "");
2495 assert(offset_addr_add->in(AddPNode::Offset) != nullptr, "");
2496 if (!offset_addr_add->in(AddPNode::Base)->is_top()) return nullptr;
2497 if (offset_addr_add->in(AddPNode::Address)->Opcode() != Op_LoadP) return nullptr;
2498 LoadNode* load_members = offset_addr_add->in(AddPNode::Address)->as_Load();
2499 if (!is_con_offset(offset_addr_add->in(AddPNode::Offset), InlineKlass::fast_acmp_offset_offset())) return nullptr;
2500
2501 assert(load_members->in(2) != nullptr, "");
2502 if (!load_members->in(2)->is_AddP()) return nullptr;
2503 AddPNode* members_addr_add = load_members->in(2)->as_AddP();
2504
2505 assert(members_addr_add->in(AddPNode::Base) != nullptr, "");
2506 assert(members_addr_add->in(AddPNode::Address) != nullptr, "");
2507 assert(members_addr_add->in(AddPNode::Offset) != nullptr, "");
2508 if (!members_addr_add->in(AddPNode::Base)->is_top()) return nullptr;
2509 if (!phase->type(members_addr_add->in(AddPNode::Address))->isa_instklassptr()) return nullptr;
2510 if (!is_con_offset(members_addr_add->in(AddPNode::Offset), InlineKlass::adr_members_offset())) return nullptr;
2511
2512 return iff;
2513 }
2514
2515 // Force unstable if traps to be taken randomly to trigger intermittent bugs such as incorrect debug information.
2516 // Add another if before the unstable if that checks a "random" condition at runtime (a simple shared counter) and
2517 // then either takes the trap or executes the original, unstable if.
2518 void Parse::stress_trap(IfNode* orig_iff, Node* counter, Node* incr_store) {
2519 // Search for an unstable if trap
2520 CallStaticJavaNode* trap = nullptr;
2521 assert(orig_iff->Opcode() == Op_If && orig_iff->outcnt() == 2, "malformed if");
2522 ProjNode* trap_proj = orig_iff->uncommon_trap_proj(trap, Deoptimization::Reason_unstable_if);
2523 if (trap == nullptr || !trap->jvms()->should_reexecute()) {
2524 // No suitable trap found. Remove unused counter load and increment.
2525 C->gvn_replace_by(incr_store, incr_store->in(MemNode::Memory));
2526 return;
2527 }
2528
2529 // Remove trap from optimization list since we add another path to the trap.
2530 bool success = C->remove_unstable_if_trap(trap, true);
2531 assert(success, "Trap already modified");
2532
2533 // Add a check before the original if that will trap with a certain frequency and execute the original if otherwise
2534 int freq_log = (C->random() % 31) + 1; // Random logarithmic frequency in [1, 31]
2567 }
2568
2569 void Parse::maybe_add_predicate_after_if(Block* path) {
2570 if (path->is_SEL_head() && path->preds_parsed() == 0) {
2571 // Add predicates at bci of if dominating the loop so traps can be
2572 // recorded on the if's profile data
2573 int bc_depth = repush_if_args();
2574 add_parse_predicates();
2575 dec_sp(bc_depth);
2576 path->set_has_predicates();
2577 }
2578 }
2579
2580
2581 //----------------------------adjust_map_after_if------------------------------
2582 // Adjust the JVM state to reflect the result of taking this path.
2583 // Basically, it means inspecting the CmpNode controlling this
2584 // branch, seeing how it constrains a tested value, and then
2585 // deciding if it's worth our while to encode this constraint
2586 // as graph nodes in the current abstract interpretation map.
2587 void Parse::adjust_map_after_if(BoolTest::mask btest, Node* c, float prob, Block* path, bool can_trap) {
2588 if (!c->is_Cmp()) {
2589 maybe_add_predicate_after_if(path);
2590 return;
2591 }
2592
2593 if (stopped() || btest == BoolTest::illegal) {
2594 return; // nothing to do
2595 }
2596
2597 bool is_fallthrough = (path == successor_for_bci(iter().next_bci()));
2598
2599 if (can_trap && path_is_suitable_for_uncommon_trap(prob)) {
2600 repush_if_args();
2601 Node* call = uncommon_trap(Deoptimization::Reason_unstable_if,
2602 Deoptimization::Action_reinterpret,
2603 nullptr,
2604 (is_fallthrough ? "taken always" : "taken never"));
2605
2606 if (call != nullptr) {
2607 C->record_unstable_if_trap(new UnstableIfTrap(call->as_CallStaticJava(), path));
2608 }
2609 return;
2610 }
2611
2612 if (c->is_FlatArrayCheck()) {
2613 maybe_add_predicate_after_if(path);
2614 return;
2615 }
2616
2617 Node* val = c->in(1);
2618 Node* con = c->in(2);
2619 const Type* tcon = _gvn.type(con);
2620 const Type* tval = _gvn.type(val);
2621 bool have_con = tcon->singleton();
2622 if (tval->singleton()) {
2623 if (!have_con) {
2624 // Swap, so constant is in con.
2625 con = val;
2626 tcon = tval;
2627 val = c->in(2);
2628 tval = _gvn.type(val);
2629 btest = BoolTest(btest).commute();
2630 have_con = true;
2631 } else {
2632 // Do we have two constants? Then leave well enough alone.
2633 have_con = false;
2634 }
2635 }
2636 if (!have_con) { // remaining adjustments need a con
2762 &obj, &cast_type)) {
2763 assert(obj != nullptr && cast_type != nullptr, "missing type check info");
2764 const Type* obj_type = _gvn.type(obj);
2765 const Type* tboth = obj_type->filter_speculative(cast_type);
2766 assert(tboth->higher_equal(obj_type) && tboth->higher_equal(cast_type), "sanity");
2767 if (tboth == Type::TOP && KillPathsReachableByDeadTypeNode) {
2768 // Let dead type node cleaning logic prune effectively dead path for us.
2769 // CheckCastPP::Value() == TOP and it will trigger the cleanup during GVN.
2770 // Don't materialize the cast when cleanup is disabled, because
2771 // it kills data and control leaving IR in broken state.
2772 tboth = cast_type;
2773 }
2774 if (tboth != Type::TOP && tboth != obj_type) {
2775 int obj_in_map = map()->find_edge(obj);
2776 if (obj_in_map >= 0 &&
2777 (jvms()->is_loc(obj_in_map) || jvms()->is_stk(obj_in_map))) {
2778 TypeNode* ccast = new CheckCastPPNode(control(), obj, tboth);
2779 // Delay transform() call to allow recovery of pre-cast value at the control merge.
2780 _gvn.set_type_bottom(ccast);
2781 record_for_igvn(ccast);
2782 if (tboth->is_inlinetypeptr()) {
2783 ccast = InlineTypeNode::make_from_oop(this, ccast, tboth->isa_oopptr()->exact_klass(true)->as_inline_klass());
2784 }
2785 // Here's the payoff.
2786 replace_in_map(obj, ccast);
2787 }
2788 }
2789 }
2790
2791 int val_in_map = map()->find_edge(val);
2792 if (val_in_map < 0) return; // replace_in_map would be useless
2793 {
2794 JVMState* jvms = this->jvms();
2795 if (!(jvms->is_loc(val_in_map) ||
2796 jvms->is_stk(val_in_map)))
2797 return; // again, it would be useless
2798 }
2799
2800 // Check for a comparison to a constant, and "know" that the compared
2801 // value is constrained on this path.
2802 assert(tcon->singleton(), "");
2803 ConstraintCastNode* ccast = nullptr;
2804 Node* cast = nullptr;
2868 if (c->Opcode() == Op_CmpP &&
2869 (c->in(1)->Opcode() == Op_LoadKlass || c->in(1)->Opcode() == Op_DecodeNKlass) &&
2870 c->in(2)->is_Con()) {
2871 Node* load_klass = nullptr;
2872 Node* decode = nullptr;
2873 if (c->in(1)->Opcode() == Op_DecodeNKlass) {
2874 decode = c->in(1);
2875 load_klass = c->in(1)->in(1);
2876 } else {
2877 load_klass = c->in(1);
2878 }
2879 if (load_klass->in(2)->is_AddP()) {
2880 Node* addp = load_klass->in(2);
2881 Node* obj = addp->in(AddPNode::Address);
2882 const TypeOopPtr* obj_type = _gvn.type(obj)->is_oopptr();
2883 if (obj_type->speculative_type_not_null() != nullptr) {
2884 ciKlass* k = obj_type->speculative_type();
2885 inc_sp(2);
2886 obj = maybe_cast_profiled_obj(obj, k);
2887 dec_sp(2);
2888 if (obj->is_InlineType()) {
2889 assert(obj->as_InlineType()->is_allocated(&_gvn), "must be allocated");
2890 obj = obj->as_InlineType()->get_oop();
2891 }
2892 // Make the CmpP use the casted obj
2893 addp = basic_plus_adr(obj, addp->in(AddPNode::Offset));
2894 load_klass = load_klass->clone();
2895 load_klass->set_req(2, addp);
2896 load_klass = _gvn.transform(load_klass);
2897 if (decode != nullptr) {
2898 decode = decode->clone();
2899 decode->set_req(1, load_klass);
2900 load_klass = _gvn.transform(decode);
2901 }
2902 c = c->clone();
2903 c->set_req(1, load_klass);
2904 c = _gvn.transform(c);
2905 }
2906 }
2907 }
2908 return c;
2909 }
2910
2911 //------------------------------do_one_bytecode--------------------------------
3614 b = _gvn.transform( new ConvI2DNode(a));
3615 push_pair(b);
3616 break;
3617
3618 case Bytecodes::_iinc: // Increment local
3619 i = iter().get_index(); // Get local index
3620 set_local( i, _gvn.transform( new AddINode( _gvn.intcon(iter().get_iinc_con()), local(i) ) ) );
3621 break;
3622
3623 // Exit points of synchronized methods must have an unlock node
3624 case Bytecodes::_return:
3625 return_current(nullptr);
3626 break;
3627
3628 case Bytecodes::_ireturn:
3629 case Bytecodes::_areturn:
3630 case Bytecodes::_freturn:
3631 return_current(pop());
3632 break;
3633 case Bytecodes::_lreturn:
3634 case Bytecodes::_dreturn:
3635 return_current(pop_pair());
3636 break;
3637
3638 case Bytecodes::_athrow:
3639 // null exception oop throws null pointer exception
3640 null_check(peek());
3641 if (stopped()) return;
3642 // Hook the thrown exception directly to subsequent handlers.
3643 if (BailoutToInterpreterForThrows) {
3644 // Keep method interpreted from now on.
3645 uncommon_trap(Deoptimization::Reason_unhandled,
3646 Deoptimization::Action_make_not_compilable);
3647 return;
3648 }
3649 if (env()->jvmti_can_post_on_exceptions()) {
3650 // check if we must post exception events, take uncommon trap if so (with must_throw = false)
3651 uncommon_trap_if_should_post_on_exceptions(Deoptimization::Reason_unhandled, false);
3652 }
3653 // Here if either can_post_on_exceptions or should_post_on_exceptions is false
3667 // See if we can get some profile data and hand it off to the next block
3668 Block *target_block = block()->successor_for_bci(target_bci);
3669 if (target_block->pred_count() != 1) break;
3670 ciMethodData* methodData = method()->method_data();
3671 if (!methodData->is_mature()) break;
3672 ciProfileData* data = methodData->bci_to_data(bci());
3673 assert(data != nullptr && data->is_JumpData(), "need JumpData for taken branch");
3674 int taken = ((ciJumpData*)data)->taken();
3675 taken = method()->scale_count(taken);
3676 target_block->set_count(taken);
3677 break;
3678 }
3679
3680 case Bytecodes::_ifnull: btest = BoolTest::eq; goto handle_if_null;
3681 case Bytecodes::_ifnonnull: btest = BoolTest::ne; goto handle_if_null;
3682 handle_if_null:
3683 // If this is a backwards branch in the bytecodes, add Safepoint
3684 maybe_add_safepoint(iter().get_dest());
3685 a = null();
3686 b = pop();
3687 if (b->is_InlineType()) {
3688 // Null checking a scalarized but nullable inline type. Check the null marker
3689 // input instead of the oop input to avoid keeping buffer allocations alive
3690 c = _gvn.transform(new CmpINode(b->as_InlineType()->get_null_marker(), zerocon(T_INT)));
3691 } else {
3692 if (!_gvn.type(b)->speculative_maybe_null() &&
3693 !too_many_traps(Deoptimization::Reason_speculate_null_check)) {
3694 inc_sp(1);
3695 Node* null_ctl = top();
3696 b = null_check_oop(b, &null_ctl, true, true, true);
3697 assert(null_ctl->is_top(), "no null control here");
3698 dec_sp(1);
3699 } else if (_gvn.type(b)->speculative_always_null() &&
3700 !too_many_traps(Deoptimization::Reason_speculate_null_assert)) {
3701 inc_sp(1);
3702 b = null_assert(b);
3703 dec_sp(1);
3704 }
3705 c = _gvn.transform( new CmpPNode(b, a) );
3706 }
3707 do_ifnull(btest, c);
3708 break;
3709
3710 case Bytecodes::_if_acmpeq: btest = BoolTest::eq; goto handle_if_acmp;
3711 case Bytecodes::_if_acmpne: btest = BoolTest::ne; goto handle_if_acmp;
3712 handle_if_acmp:
3713 // If this is a backwards branch in the bytecodes, add Safepoint
3714 maybe_add_safepoint(iter().get_dest());
3715 a = pop();
3716 b = pop();
3717 do_acmp(btest, b, a);
3718 break;
3719
3720 case Bytecodes::_ifeq: btest = BoolTest::eq; goto handle_ifxx;
3721 case Bytecodes::_ifne: btest = BoolTest::ne; goto handle_ifxx;
3722 case Bytecodes::_iflt: btest = BoolTest::lt; goto handle_ifxx;
3723 case Bytecodes::_ifle: btest = BoolTest::le; goto handle_ifxx;
3724 case Bytecodes::_ifgt: btest = BoolTest::gt; goto handle_ifxx;
3725 case Bytecodes::_ifge: btest = BoolTest::ge; goto handle_ifxx;
3726 handle_ifxx:
3727 // If this is a backwards branch in the bytecodes, add Safepoint
3728 maybe_add_safepoint(iter().get_dest());
3729 a = _gvn.intcon(0);
3730 b = pop();
3731 c = _gvn.transform( new CmpINode(b, a) );
3732 do_if(btest, c);
3733 break;
3734
3735 case Bytecodes::_if_icmpeq: btest = BoolTest::eq; goto handle_if_icmp;
3736 case Bytecodes::_if_icmpne: btest = BoolTest::ne; goto handle_if_icmp;
3737 case Bytecodes::_if_icmplt: btest = BoolTest::lt; goto handle_if_icmp;
3752 break;
3753
3754 case Bytecodes::_lookupswitch:
3755 do_lookupswitch();
3756 break;
3757
3758 case Bytecodes::_invokestatic:
3759 case Bytecodes::_invokedynamic:
3760 case Bytecodes::_invokespecial:
3761 case Bytecodes::_invokevirtual:
3762 case Bytecodes::_invokeinterface:
3763 do_call();
3764 break;
3765 case Bytecodes::_checkcast:
3766 do_checkcast();
3767 break;
3768 case Bytecodes::_instanceof:
3769 do_instanceof();
3770 break;
3771 case Bytecodes::_anewarray:
3772 do_newarray();
3773 break;
3774 case Bytecodes::_newarray:
3775 do_newarray((BasicType)iter().get_index());
3776 break;
3777 case Bytecodes::_multianewarray:
3778 do_multianewarray();
3779 break;
3780 case Bytecodes::_new:
3781 do_new();
3782 break;
3783
3784 case Bytecodes::_jsr:
3785 case Bytecodes::_jsr_w:
3786 do_jsr();
3787 break;
3788
3789 case Bytecodes::_ret:
3790 do_ret();
3791 break;
3792
|