< prev index next >

src/hotspot/share/c1/c1_GraphBuilder.cpp

Print this page

  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 "c1/c1_Canonicalizer.hpp"
  26 #include "c1/c1_CFGPrinter.hpp"
  27 #include "c1/c1_Compilation.hpp"
  28 #include "c1/c1_GraphBuilder.hpp"
  29 #include "c1/c1_InstructionPrinter.hpp"
  30 #include "ci/ciCallSite.hpp"
  31 #include "ci/ciField.hpp"


  32 #include "ci/ciKlass.hpp"
  33 #include "ci/ciMemberName.hpp"
  34 #include "ci/ciSymbols.hpp"
  35 #include "ci/ciUtilities.inline.hpp"
  36 #include "classfile/javaClasses.hpp"
  37 #include "compiler/compilationPolicy.hpp"
  38 #include "compiler/compileBroker.hpp"
  39 #include "compiler/compilerEvent.hpp"
  40 #include "interpreter/bytecode.hpp"
  41 #include "jfr/jfrEvents.hpp"
  42 #include "memory/resourceArea.hpp"
  43 #include "runtime/sharedRuntime.hpp"
  44 #include "utilities/checkedCast.hpp"
  45 #include "utilities/macros.hpp"
  46 #if INCLUDE_JFR
  47 #include "jfr/jfr.hpp"
  48 #endif
  49 
  50 class BlockListBuilder {
  51  private:

1030       // they are using this local. We don't handle skipping over a
1031       // ret.
1032       for (ScopeData* cur_scope_data = scope_data()->parent();
1033            cur_scope_data != nullptr && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1034            cur_scope_data = cur_scope_data->parent()) {
1035         if (cur_scope_data->jsr_return_address_local() == index) {
1036           BAILOUT("subroutine overwrites return address from previous subroutine");
1037         }
1038       }
1039     } else if (index == scope_data()->jsr_return_address_local()) {
1040       scope_data()->set_jsr_return_address_local(-1);
1041     }
1042   }
1043 
1044   state->store_local(index, x);
1045 }
1046 
1047 
1048 void GraphBuilder::load_indexed(BasicType type) {
1049   // In case of in block code motion in range check elimination
1050   ValueStack* state_before = copy_state_indexed_access();








1051   compilation()->set_has_access_indexed(true);
1052   Value index = ipop();
1053   Value array = apop();
1054   Value length = nullptr;
1055   if (CSEArrayLength ||
1056       (array->as_Constant() != nullptr) ||
1057       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1058       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1059       (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1060     length = append(new ArrayLength(array, state_before));
1061   }
1062   push(as_ValueType(type), append(new LoadIndexed(array, index, length, type, state_before)));























































1063 }
1064 
1065 
1066 void GraphBuilder::store_indexed(BasicType type) {
1067   // In case of in block code motion in range check elimination
1068   ValueStack* state_before = copy_state_indexed_access();








1069   compilation()->set_has_access_indexed(true);
1070   Value value = pop(as_ValueType(type));
1071   Value index = ipop();
1072   Value array = apop();
1073   Value length = nullptr;
1074   if (CSEArrayLength ||
1075       (array->as_Constant() != nullptr) ||
1076       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1077       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1078       (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1079     length = append(new ArrayLength(array, state_before));
1080   }
1081   ciType* array_type = array->declared_type();
1082   bool check_boolean = false;
1083   if (array_type != nullptr) {
1084     if (array_type->is_loaded() &&
1085       array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
1086       assert(type == T_BYTE, "boolean store uses bastore");
1087       Value mask = append(new Constant(new IntConstant(1)));
1088       value = append(new LogicOp(Bytecodes::_iand, value, mask));
1089     }
1090   } else if (type == T_BYTE) {
1091     check_boolean = true;
1092   }
1093   StoreIndexed* result = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1094   append(result);
1095   _memory->store_value(value);
1096 
1097   if (type == T_OBJECT && is_profiling()) {
1098     // Note that we'd collect profile data in this method if we wanted it.
1099     compilation()->set_would_profile(true);
1100 
1101     if (profile_checkcasts()) {
1102       result->set_profiled_method(method());
1103       result->set_profiled_bci(bci());
1104       result->set_should_profile(true);
1105     }
1106   }



1107 }
1108 
1109 
1110 void GraphBuilder::stack_op(Bytecodes::Code code) {
1111   switch (code) {
1112     case Bytecodes::_pop:
1113       { state()->raw_pop();
1114       }
1115       break;
1116     case Bytecodes::_pop2:
1117       { state()->raw_pop();
1118         state()->raw_pop();
1119       }
1120       break;
1121     case Bytecodes::_dup:
1122       { Value w = state()->raw_pop();
1123         state()->raw_push(w);
1124         state()->raw_push(w);
1125       }
1126       break;
1127     case Bytecodes::_dup_x1:
1128       { Value w1 = state()->raw_pop();
1129         Value w2 = state()->raw_pop();
1130         state()->raw_push(w1);
1131         state()->raw_push(w2);
1132         state()->raw_push(w1);
1133       }
1134       break;
1135     case Bytecodes::_dup_x2:
1136       { Value w1 = state()->raw_pop();
1137         Value w2 = state()->raw_pop();
1138         Value w3 = state()->raw_pop();

1274 
1275 
1276 void GraphBuilder::_goto(int from_bci, int to_bci) {
1277   Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1278   if (is_profiling()) {
1279     compilation()->set_would_profile(true);
1280     x->set_profiled_bci(bci());
1281     if (profile_branches()) {
1282       x->set_profiled_method(method());
1283       x->set_should_profile(true);
1284     }
1285   }
1286   append(x);
1287 }
1288 
1289 
1290 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1291   BlockBegin* tsux = block_at(stream()->get_dest());
1292   BlockBegin* fsux = block_at(stream()->next_bci());
1293   bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();



























1294   // In case of loop invariant code motion or predicate insertion
1295   // before the body of a loop the state is needed
1296   Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic()) ? state_before : nullptr, is_bb));
1297 
1298   assert(i->as_Goto() == nullptr ||
1299          (i->as_Goto()->sux_at(0) == tsux  && i->as_Goto()->is_safepoint() == (tsux->bci() < stream()->cur_bci())) ||
1300          (i->as_Goto()->sux_at(0) == fsux  && i->as_Goto()->is_safepoint() == (fsux->bci() < stream()->cur_bci())),
1301          "safepoint state of Goto returned by canonicalizer incorrect");
1302 
1303   if (is_profiling()) {
1304     If* if_node = i->as_If();
1305     if (if_node != nullptr) {
1306       // Note that we'd collect profile data in this method if we wanted it.
1307       compilation()->set_would_profile(true);
1308       // At level 2 we need the proper bci to count backedges
1309       if_node->set_profiled_bci(bci());
1310       if (profile_branches()) {
1311         // Successors can be rotated by the canonicalizer, check for this case.
1312         if_node->set_profiled_method(method());
1313         if_node->set_should_profile(true);
1314         if (if_node->tsux() == fsux) {
1315           if_node->set_swapped(true);
1316         }

1531   }
1532 
1533   if (needs_check) {
1534     // Perform the registration of finalizable objects.
1535     ValueStack* state_before = copy_state_for_exception();
1536     load_local(objectType, 0);
1537     append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1538                                state()->pop_arguments(1),
1539                                true, state_before, true));
1540   }
1541 }
1542 
1543 
1544 void GraphBuilder::method_return(Value x, bool ignore_return) {
1545   if (method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1546     call_register_finalizer();
1547   }
1548 
1549   // The conditions for a memory barrier are described in Parse::do_exits().
1550   bool need_mem_bar = false;
1551   if (method()->name() == ciSymbols::object_initializer_name() &&
1552        (scope()->wrote_final() || scope()->wrote_stable() ||
1553          (AlwaysSafeConstructors && scope()->wrote_fields()) ||
1554          (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile()))) {
1555     need_mem_bar = true;
1556   }
1557 
1558   BasicType bt = method()->return_type()->basic_type();
1559   switch (bt) {
1560     case T_BYTE:
1561     {
1562       Value shift = append(new Constant(new IntConstant(24)));
1563       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1564       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1565       break;
1566     }
1567     case T_SHORT:
1568     {
1569       Value shift = append(new Constant(new IntConstant(16)));
1570       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1571       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));

1682   // Attach dimension info to stable arrays.
1683   if (FoldStableValues &&
1684       field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1685     ciArray* array = field_value.as_object()->as_array();
1686     jint dimension = field->type()->as_array_klass()->dimension();
1687     value = new StableArrayConstant(array, dimension);
1688   }
1689 
1690   switch (field_type) {
1691     case T_ARRAY:
1692     case T_OBJECT:
1693       if (field_value.as_object()->should_be_constant()) {
1694         return new Constant(value);
1695       }
1696       return nullptr; // Not a constant.
1697     default:
1698       return new Constant(value);
1699   }
1700 }
1701 























1702 void GraphBuilder::access_field(Bytecodes::Code code) {
1703   bool will_link;
1704   ciField* field = stream()->get_field(will_link);
1705   ciInstanceKlass* holder = field->holder();
1706   BasicType field_type = field->type()->basic_type();
1707   ValueType* type = as_ValueType(field_type);

1708   // call will_link again to determine if the field is valid.
1709   const bool needs_patching = !holder->is_loaded() ||
1710                               !field->will_link(method(), code) ||
1711                               PatchALot;
1712 
1713   ValueStack* state_before = nullptr;
1714   if (!holder->is_initialized() || needs_patching) {
1715     // save state before instruction for debug info when
1716     // deoptimization happens during patching
1717     state_before = copy_state_before();
1718   }
1719 
1720   Value obj = nullptr;
1721   if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1722     if (state_before != nullptr) {
1723       // build a patching constant
1724       obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1725     } else {
1726       obj = new Constant(new InstanceConstant(holder->java_mirror()));
1727     }
1728   }
1729 
1730   if (code == Bytecodes::_putfield) {
1731     scope()->set_wrote_fields();
1732     if (field->is_volatile()) {
1733       scope()->set_wrote_volatile();
1734     }
1735     if (field->is_final()) {
1736       scope()->set_wrote_final();
1737     }
1738     if (field->is_stable()) {
1739       scope()->set_wrote_stable();
1740     }
1741   }
1742 
1743   const int offset = !needs_patching ? field->offset_in_bytes() : -1;
1744   switch (code) {
1745     case Bytecodes::_getstatic: {
1746       // check for compile-time constants, i.e., initialized static final fields
1747       Value constant = nullptr;
1748       if (field->is_static_constant() && !PatchALot) {
1749         ciConstant field_value = field->constant_value();
1750         assert(!field->is_stable() || !field_value.is_null_or_zero(),
1751                "stable static w/ default value shouldn't be a constant");
1752         constant = make_constant(field_value, field);
1753       }
1754       if (constant != nullptr) {
1755         push(type, append(constant));
1756       } else {
1757         if (state_before == nullptr) {
1758           state_before = copy_state_for_exception();
1759         }
1760         push(type, append(new LoadField(append(obj), offset, field, true,
1761                                         state_before, needs_patching)));

1762       }
1763       break;
1764     }
1765     case Bytecodes::_putstatic: {
1766       Value val = pop(type);
1767       if (state_before == nullptr) {
1768         state_before = copy_state_for_exception();
1769       }
1770       if (field->type()->basic_type() == T_BOOLEAN) {
1771         Value mask = append(new Constant(new IntConstant(1)));
1772         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1773       }







1774       append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1775       break;
1776     }
1777     case Bytecodes::_getfield: {
1778       // Check for compile-time constants, i.e., trusted final non-static fields.
1779       Value constant = nullptr;
1780       obj = apop();
1781       ObjectType* obj_type = obj->type()->as_ObjectType();
1782       if (field->is_constant() && obj_type->is_constant() && !PatchALot) {
1783         ciObject* const_oop = obj_type->constant_value();
1784         if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1785           ciConstant field_value = field->constant_value_of(const_oop);
1786           if (field_value.is_valid()) {
1787             constant = make_constant(field_value, field);
1788             // For CallSite objects add a dependency for invalidation of the optimization.
1789             if (field->is_call_site_target()) {
1790               ciCallSite* call_site = const_oop->as_call_site();
1791               if (!call_site->is_fully_initialized_constant_call_site()) {
1792                 ciMethodHandle* target = field_value.as_object()->as_method_handle();
1793                 dependency_recorder()->assert_call_site_target_value(call_site, target);







1794               }
1795             }
1796           }
1797         }
1798       }
1799       if (constant != nullptr) {
1800         push(type, append(constant));
1801       } else {
1802         if (state_before == nullptr) {
1803           state_before = copy_state_for_exception();
1804         }
1805         LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1806         Value replacement = !needs_patching ? _memory->load(load) : load;
1807         if (replacement != load) {
1808           assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1809           // Writing an (integer) value to a boolean, byte, char or short field includes an implicit narrowing
1810           // conversion. Emit an explicit conversion here to get the correct field value after the write.
1811           BasicType bt = field->type()->basic_type();
1812           switch (bt) {
1813           case T_BOOLEAN:
1814           case T_BYTE:
1815             replacement = append(new Convert(Bytecodes::_i2b, replacement, as_ValueType(bt)));
1816             break;
1817           case T_CHAR:
1818             replacement = append(new Convert(Bytecodes::_i2c, replacement, as_ValueType(bt)));
1819             break;
1820           case T_SHORT:
1821             replacement = append(new Convert(Bytecodes::_i2s, replacement, as_ValueType(bt)));
1822             break;
1823           default:
1824             break;
1825           }
1826           push(type, replacement);























1827         } else {
1828           push(type, append(load));













































































1829         }
1830       }
1831       break;
1832     }
1833     case Bytecodes::_putfield: {
1834       Value val = pop(type);
1835       obj = apop();
1836       if (state_before == nullptr) {
1837         state_before = copy_state_for_exception();
1838       }
1839       if (field->type()->basic_type() == T_BOOLEAN) {
1840         Value mask = append(new Constant(new IntConstant(1)));
1841         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1842       }
1843       StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
1844       if (!needs_patching) store = _memory->store(store);
1845       if (store != nullptr) {
1846         append(store);

























1847       }
1848       break;
1849     }
1850     default:
1851       ShouldNotReachHere();
1852       break;
1853   }
1854 }
1855 
1856 
1857 Dependencies* GraphBuilder::dependency_recorder() const {
1858   return compilation()->dependency_recorder();
1859 }
1860 
1861 // How many arguments do we want to profile?
1862 Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {
1863   int n = 0;
1864   bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
1865   start = has_receiver ? 1 : 0;
1866   if (profile_arguments()) {
1867     ciProfileData* data = method()->method_data()->bci_to_data(bci());
1868     if (data != nullptr && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
1869       n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
1870     }
1871   }
1872   // If we are inlining then we need to collect arguments to profile parameters for the target
1873   if (profile_parameters() && target != nullptr) {
1874     if (target->method_data() != nullptr && target->method_data()->parameters_type_data() != nullptr) {
1875       // The receiver is profiled on method entry so it's included in
1876       // the number of parameters but here we're only interested in

1952       break;
1953     case Bytecodes::_invokehandle:
1954       code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
1955       break;
1956     default:
1957       break;
1958     }
1959   } else {
1960     if (bc_raw == Bytecodes::_invokehandle) {
1961       assert(!will_link, "should come here only for unlinked call");
1962       code = Bytecodes::_invokespecial;
1963     }
1964   }
1965 
1966   if (code == Bytecodes::_invokespecial) {
1967     // Additional receiver subtype checks for interface calls via invokespecial or invokeinterface.
1968     ciKlass* receiver_constraint = nullptr;
1969 
1970     if (bc_raw == Bytecodes::_invokeinterface) {
1971       receiver_constraint = holder;
1972     } else if (bc_raw == Bytecodes::_invokespecial && !target->is_object_initializer() && calling_klass->is_interface()) {
1973       receiver_constraint = calling_klass;
1974     }
1975 
1976     if (receiver_constraint != nullptr) {
1977       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
1978       Value receiver = state()->stack_at(index);
1979       CheckCast* c = new CheckCast(receiver_constraint, receiver, copy_state_before());
1980       // go to uncommon_trap when checkcast fails
1981       c->set_invokespecial_receiver_check();
1982       state()->stack_at_put(index, append_split(c));
1983     }
1984   }
1985 
1986   // Push appendix argument (MethodType, CallSite, etc.), if one.
1987   bool patch_for_appendix = false;
1988   int patching_appendix_arg = 0;
1989   if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {
1990     Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
1991     apush(arg);
1992     patch_for_appendix = true;

2208     }
2209   }
2210 
2211   Invoke* result = new Invoke(code, result_type, recv, args, target, state_before);
2212   // push result
2213   append_split(result);
2214 
2215   if (result_type != voidType) {
2216     push(result_type, result);
2217   }
2218   if (profile_return() && result_type->is_object_kind()) {
2219     profile_return_type(result, target);
2220   }
2221 }
2222 
2223 
2224 void GraphBuilder::new_instance(int klass_index) {
2225   ValueStack* state_before = copy_state_exhandling();
2226   ciKlass* klass = stream()->get_klass();
2227   assert(klass->is_instance_klass(), "must be an instance klass");
2228   NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass());
2229   _memory->new_instance(new_instance);
2230   apush(append_split(new_instance));
2231 }
2232 
2233 
2234 void GraphBuilder::new_type_array() {
2235   ValueStack* state_before = copy_state_exhandling();
2236   apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before, true)));
2237 }
2238 
2239 
2240 void GraphBuilder::new_object_array() {
2241   ciKlass* klass = stream()->get_klass();
2242   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2243   NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2244   apush(append_split(n));
2245 }
2246 
2247 
2248 bool GraphBuilder::direct_compare(ciKlass* k) {
2249   if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
2250     ciInstanceKlass* ik = k->as_instance_klass();
2251     if (ik->is_final()) {
2252       return true;
2253     } else {

2286   ciKlass* klass = stream()->get_klass();
2287   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2288   InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2289   ipush(append_split(i));
2290   i->set_direct_compare(direct_compare(klass));
2291 
2292   if (is_profiling()) {
2293     // Note that we'd collect profile data in this method if we wanted it.
2294     compilation()->set_would_profile(true);
2295 
2296     if (profile_checkcasts()) {
2297       i->set_profiled_method(method());
2298       i->set_profiled_bci(bci());
2299       i->set_should_profile(true);
2300     }
2301   }
2302 }
2303 
2304 
2305 void GraphBuilder::monitorenter(Value x, int bci) {



















2306   // save state before locking in case of deoptimization after a NullPointerException
2307   ValueStack* state_before = copy_state_for_exception_with_bci(bci);
2308   append_with_bci(new MonitorEnter(x, state()->lock(x), state_before), bci);
2309   kill_all();
2310 }
2311 
2312 
2313 void GraphBuilder::monitorexit(Value x, int bci) {
2314   append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2315   kill_all();
2316 }
2317 
2318 
2319 void GraphBuilder::new_multi_array(int dimensions) {
2320   ciKlass* klass = stream()->get_klass();
2321   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2322 
2323   Values* dims = new Values(dimensions, dimensions, nullptr);
2324   // fill in all dimensions
2325   int i = dimensions;
2326   while (i-- > 0) dims->at_put(i, ipop());
2327   // create array
2328   NewArray* n = new NewMultiArray(klass, dims, state_before);

2413 
2414 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2415   return append_with_bci(instr, bci());
2416 }
2417 
2418 
2419 void GraphBuilder::null_check(Value value) {
2420   if (value->as_NewArray() != nullptr || value->as_NewInstance() != nullptr) {
2421     return;
2422   } else {
2423     Constant* con = value->as_Constant();
2424     if (con) {
2425       ObjectType* c = con->type()->as_ObjectType();
2426       if (c && c->is_loaded()) {
2427         ObjectConstant* oc = c->as_ObjectConstant();
2428         if (!oc || !oc->value()->is_null_object()) {
2429           return;
2430         }
2431       }
2432     }

2433   }
2434   append(new NullCheck(value, copy_state_for_exception()));
2435 }
2436 
2437 
2438 
2439 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2440   if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != nullptr)) {
2441     assert(instruction->exception_state() == nullptr
2442            || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2443            || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2444            "exception_state should be of exception kind");
2445     return new XHandlers();
2446   }
2447 
2448   XHandlers*  exception_handlers = new XHandlers();
2449   ScopeData*  cur_scope_data = scope_data();
2450   ValueStack* cur_state = instruction->state_before();
2451   ValueStack* prev_state = nullptr;
2452   int scope_count = 0;
2453 
2454   assert(cur_state != nullptr, "state_before must be set");
2455   do {
2456     int cur_bci = cur_state->bci();
2457     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2458     assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci(), "invalid bci");


2459 
2460     // join with all potential exception handlers
2461     XHandlers* list = cur_scope_data->xhandlers();
2462     const int n = list->length();
2463     for (int i = 0; i < n; i++) {
2464       XHandler* h = list->handler_at(i);
2465       if (h->covers(cur_bci)) {
2466         // h is a potential exception handler => join it
2467         compilation()->set_has_exception_handlers(true);
2468 
2469         BlockBegin* entry = h->entry_block();
2470         if (entry == block()) {
2471           // It's acceptable for an exception handler to cover itself
2472           // but we don't handle that in the parser currently.  It's
2473           // very rare so we bailout instead of trying to handle it.
2474           BAILOUT_("exception handler covers itself", exception_handlers);
2475         }
2476         assert(entry->bci() == h->handler_bci(), "must match");
2477         assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2478 

3252     state->store_local(idx, new Local(type, vt, idx, false));
3253     idx += type->size();
3254   }
3255 
3256   // lock synchronized method
3257   if (method()->is_synchronized()) {
3258     state->lock(nullptr);
3259   }
3260 
3261   return state;
3262 }
3263 
3264 
3265 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3266   : _scope_data(nullptr)
3267   , _compilation(compilation)
3268   , _memory(new MemoryBuffer())
3269   , _inline_bailout_msg(nullptr)
3270   , _instruction_count(0)
3271   , _osr_entry(nullptr)


3272 {
3273   int osr_bci = compilation->osr_bci();
3274 
3275   // determine entry points and bci2block mapping
3276   BlockListBuilder blm(compilation, scope, osr_bci);
3277   CHECK_BAILOUT();
3278 
3279   BlockList* bci2block = blm.bci2block();
3280   BlockBegin* start_block = bci2block->at(0);
3281 
3282   push_root_scope(scope, bci2block, start_block);
3283 
3284   // setup state for std entry
3285   _initial_state = state_at_entry();
3286   start_block->merge(_initial_state, compilation->has_irreducible_loops());
3287 
3288   // End nulls still exist here
3289 
3290   // complete graph
3291   _vmap        = new ValueMap();

  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 "c1/c1_Canonicalizer.hpp"
  26 #include "c1/c1_CFGPrinter.hpp"
  27 #include "c1/c1_Compilation.hpp"
  28 #include "c1/c1_GraphBuilder.hpp"
  29 #include "c1/c1_InstructionPrinter.hpp"
  30 #include "ci/ciCallSite.hpp"
  31 #include "ci/ciField.hpp"
  32 #include "ci/ciFlatArrayKlass.hpp"
  33 #include "ci/ciInlineKlass.hpp"
  34 #include "ci/ciKlass.hpp"
  35 #include "ci/ciMemberName.hpp"
  36 #include "ci/ciSymbols.hpp"
  37 #include "ci/ciUtilities.inline.hpp"
  38 #include "classfile/javaClasses.hpp"
  39 #include "compiler/compilationPolicy.hpp"
  40 #include "compiler/compileBroker.hpp"
  41 #include "compiler/compilerEvent.hpp"
  42 #include "interpreter/bytecode.hpp"
  43 #include "jfr/jfrEvents.hpp"
  44 #include "memory/resourceArea.hpp"
  45 #include "runtime/sharedRuntime.hpp"
  46 #include "utilities/checkedCast.hpp"
  47 #include "utilities/macros.hpp"
  48 #if INCLUDE_JFR
  49 #include "jfr/jfr.hpp"
  50 #endif
  51 
  52 class BlockListBuilder {
  53  private:

1032       // they are using this local. We don't handle skipping over a
1033       // ret.
1034       for (ScopeData* cur_scope_data = scope_data()->parent();
1035            cur_scope_data != nullptr && cur_scope_data->parsing_jsr() && cur_scope_data->scope() == scope();
1036            cur_scope_data = cur_scope_data->parent()) {
1037         if (cur_scope_data->jsr_return_address_local() == index) {
1038           BAILOUT("subroutine overwrites return address from previous subroutine");
1039         }
1040       }
1041     } else if (index == scope_data()->jsr_return_address_local()) {
1042       scope_data()->set_jsr_return_address_local(-1);
1043     }
1044   }
1045 
1046   state->store_local(index, x);
1047 }
1048 
1049 
1050 void GraphBuilder::load_indexed(BasicType type) {
1051   // In case of in block code motion in range check elimination
1052   ValueStack* state_before = nullptr;
1053   int array_idx = state()->stack_size() - 2;
1054   if (type == T_OBJECT && state()->stack_at(array_idx)->maybe_flat_array()) {
1055     // Save the entire state and re-execute on deopt when accessing flat arrays
1056     state_before = copy_state_before();
1057     state_before->set_should_reexecute(true);
1058   } else {
1059     state_before = copy_state_indexed_access();
1060   }
1061   compilation()->set_has_access_indexed(true);
1062   Value index = ipop();
1063   Value array = apop();
1064   Value length = nullptr;
1065   if (CSEArrayLength ||
1066       (array->as_Constant() != nullptr) ||
1067       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1068       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1069       (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1070     length = append(new ArrayLength(array, state_before));
1071   }
1072 
1073   bool need_membar = false;
1074   LoadIndexed* load_indexed = nullptr;
1075   Instruction* result = nullptr;
1076   if (array->is_loaded_flat_array()) {
1077     // TODO 8350865 This is currently dead code. Can we use set_null_free on the result here if the array is null-free?
1078     ciType* array_type = array->declared_type();
1079     ciInlineKlass* elem_klass = array_type->as_flat_array_klass()->element_klass()->as_inline_klass();
1080 
1081     bool can_delay_access = false;
1082     ciBytecodeStream s(method());
1083     s.force_bci(bci());
1084     s.next();
1085     if (s.cur_bc() == Bytecodes::_getfield) {
1086       bool will_link;
1087       ciField* next_field = s.get_field(will_link);
1088       bool next_needs_patching = !next_field->holder()->is_initialized() ||
1089                                  !next_field->will_link(method(), Bytecodes::_getfield) ||
1090                                  PatchALot;
1091       can_delay_access = C1UseDelayedFlattenedFieldReads && !next_needs_patching;
1092     }
1093     if (can_delay_access) {
1094       // potentially optimizable array access, storing information for delayed decision
1095       LoadIndexed* li = new LoadIndexed(array, index, length, type, state_before);
1096       DelayedLoadIndexed* dli = new DelayedLoadIndexed(li, state_before);
1097       li->set_delayed(dli);
1098       set_pending_load_indexed(dli);
1099       return; // Nothing else to do for now
1100     } else {
1101       NewInstance* new_instance = new NewInstance(elem_klass, state_before, false, true);
1102       _memory->new_instance(new_instance);
1103       apush(append_split(new_instance));
1104       load_indexed = new LoadIndexed(array, index, length, type, state_before);
1105       load_indexed->set_vt(new_instance);
1106       // The LoadIndexed node will initialise this instance by copying from
1107       // the flat field.  Ensure these stores are visible before any
1108       // subsequent store that publishes this reference.
1109       need_membar = true;
1110     }
1111   } else {
1112     load_indexed = new LoadIndexed(array, index, length, type, state_before);
1113     if (profile_array_accesses() && is_reference_type(type)) {
1114       compilation()->set_would_profile(true);
1115       load_indexed->set_should_profile(true);
1116       load_indexed->set_profiled_method(method());
1117       load_indexed->set_profiled_bci(bci());
1118     }
1119   }
1120   result = append(load_indexed);
1121   if (need_membar) {
1122     append(new MemBar(lir_membar_storestore));
1123   }
1124   assert(!load_indexed->should_profile() || load_indexed == result, "should not be optimized out");
1125   if (!array->is_loaded_flat_array()) {
1126     push(as_ValueType(type), result);
1127   }
1128 }
1129 
1130 
1131 void GraphBuilder::store_indexed(BasicType type) {
1132   // In case of in block code motion in range check elimination
1133   ValueStack* state_before = nullptr;
1134   int array_idx = state()->stack_size() - 3;
1135   if (type == T_OBJECT && state()->stack_at(array_idx)->maybe_flat_array()) {
1136     // Save the entire state and re-execute on deopt when accessing flat arrays
1137     state_before = copy_state_before();
1138     state_before->set_should_reexecute(true);
1139   } else {
1140     state_before = copy_state_indexed_access();
1141   }
1142   compilation()->set_has_access_indexed(true);
1143   Value value = pop(as_ValueType(type));
1144   Value index = ipop();
1145   Value array = apop();
1146   Value length = nullptr;
1147   if (CSEArrayLength ||
1148       (array->as_Constant() != nullptr) ||
1149       (array->as_AccessField() && array->as_AccessField()->field()->is_constant()) ||
1150       (array->as_NewArray() && array->as_NewArray()->length() && array->as_NewArray()->length()->type()->is_constant()) ||
1151       (array->as_NewMultiArray() && array->as_NewMultiArray()->dims()->at(0)->type()->is_constant())) {
1152     length = append(new ArrayLength(array, state_before));
1153   }
1154   ciType* array_type = array->declared_type();
1155   bool check_boolean = false;
1156   if (array_type != nullptr) {
1157     if (array_type->is_loaded() &&
1158       array_type->as_array_klass()->element_type()->basic_type() == T_BOOLEAN) {
1159       assert(type == T_BYTE, "boolean store uses bastore");
1160       Value mask = append(new Constant(new IntConstant(1)));
1161       value = append(new LogicOp(Bytecodes::_iand, value, mask));
1162     }
1163   } else if (type == T_BYTE) {
1164     check_boolean = true;
1165   }



1166 
1167   StoreIndexed* store_indexed = new StoreIndexed(array, index, length, type, value, state_before, check_boolean);
1168   if (profile_array_accesses() && is_reference_type(type) && !array->is_loaded_flat_array()) {
1169     compilation()->set_would_profile(true);
1170     store_indexed->set_should_profile(true);
1171     store_indexed->set_profiled_method(method());
1172     store_indexed->set_profiled_bci(bci());



1173   }
1174   Instruction* result = append(store_indexed);
1175   assert(!store_indexed->should_profile() || store_indexed == result, "should not be optimized out");
1176   _memory->store_value(value);
1177 }
1178 

1179 void GraphBuilder::stack_op(Bytecodes::Code code) {
1180   switch (code) {
1181     case Bytecodes::_pop:
1182       { Value w = state()->raw_pop();
1183       }
1184       break;
1185     case Bytecodes::_pop2:
1186       { Value w1 = state()->raw_pop();
1187         Value w2 = state()->raw_pop();
1188       }
1189       break;
1190     case Bytecodes::_dup:
1191       { Value w = state()->raw_pop();
1192         state()->raw_push(w);
1193         state()->raw_push(w);
1194       }
1195       break;
1196     case Bytecodes::_dup_x1:
1197       { Value w1 = state()->raw_pop();
1198         Value w2 = state()->raw_pop();
1199         state()->raw_push(w1);
1200         state()->raw_push(w2);
1201         state()->raw_push(w1);
1202       }
1203       break;
1204     case Bytecodes::_dup_x2:
1205       { Value w1 = state()->raw_pop();
1206         Value w2 = state()->raw_pop();
1207         Value w3 = state()->raw_pop();

1343 
1344 
1345 void GraphBuilder::_goto(int from_bci, int to_bci) {
1346   Goto *x = new Goto(block_at(to_bci), to_bci <= from_bci);
1347   if (is_profiling()) {
1348     compilation()->set_would_profile(true);
1349     x->set_profiled_bci(bci());
1350     if (profile_branches()) {
1351       x->set_profiled_method(method());
1352       x->set_should_profile(true);
1353     }
1354   }
1355   append(x);
1356 }
1357 
1358 
1359 void GraphBuilder::if_node(Value x, If::Condition cond, Value y, ValueStack* state_before) {
1360   BlockBegin* tsux = block_at(stream()->get_dest());
1361   BlockBegin* fsux = block_at(stream()->next_bci());
1362   bool is_bb = tsux->bci() < stream()->cur_bci() || fsux->bci() < stream()->cur_bci();
1363 
1364   bool subst_check = false;
1365   if (EnableValhalla && (stream()->cur_bc() == Bytecodes::_if_acmpeq || stream()->cur_bc() == Bytecodes::_if_acmpne)) {
1366     ValueType* left_vt = x->type();
1367     ValueType* right_vt = y->type();
1368     if (left_vt->is_object()) {
1369       assert(right_vt->is_object(), "must be");
1370       ciKlass* left_klass = x->as_loaded_klass_or_null();
1371       ciKlass* right_klass = y->as_loaded_klass_or_null();
1372 
1373       if (left_klass == nullptr || right_klass == nullptr) {
1374         // The klass is still unloaded, or came from a Phi node. Go slow case;
1375         subst_check = true;
1376       } else if (left_klass->can_be_inline_klass() || right_klass->can_be_inline_klass()) {
1377         // Either operand may be a value object, but we're not sure. Go slow case;
1378         subst_check = true;
1379       } else {
1380         // No need to do substitutability check
1381       }
1382     }
1383   }
1384   if ((stream()->cur_bc() == Bytecodes::_if_acmpeq || stream()->cur_bc() == Bytecodes::_if_acmpne) &&
1385       is_profiling() && profile_branches()) {
1386     compilation()->set_would_profile(true);
1387     append(new ProfileACmpTypes(method(), bci(), x, y));
1388   }
1389 
1390   // In case of loop invariant code motion or predicate insertion
1391   // before the body of a loop the state is needed
1392   Instruction *i = append(new If(x, cond, false, y, tsux, fsux, (is_bb || compilation()->is_optimistic() || subst_check) ? state_before : nullptr, is_bb, subst_check));
1393 
1394   assert(i->as_Goto() == nullptr ||
1395          (i->as_Goto()->sux_at(0) == tsux  && i->as_Goto()->is_safepoint() == (tsux->bci() < stream()->cur_bci())) ||
1396          (i->as_Goto()->sux_at(0) == fsux  && i->as_Goto()->is_safepoint() == (fsux->bci() < stream()->cur_bci())),
1397          "safepoint state of Goto returned by canonicalizer incorrect");
1398 
1399   if (is_profiling()) {
1400     If* if_node = i->as_If();
1401     if (if_node != nullptr) {
1402       // Note that we'd collect profile data in this method if we wanted it.
1403       compilation()->set_would_profile(true);
1404       // At level 2 we need the proper bci to count backedges
1405       if_node->set_profiled_bci(bci());
1406       if (profile_branches()) {
1407         // Successors can be rotated by the canonicalizer, check for this case.
1408         if_node->set_profiled_method(method());
1409         if_node->set_should_profile(true);
1410         if (if_node->tsux() == fsux) {
1411           if_node->set_swapped(true);
1412         }

1627   }
1628 
1629   if (needs_check) {
1630     // Perform the registration of finalizable objects.
1631     ValueStack* state_before = copy_state_for_exception();
1632     load_local(objectType, 0);
1633     append_split(new Intrinsic(voidType, vmIntrinsics::_Object_init,
1634                                state()->pop_arguments(1),
1635                                true, state_before, true));
1636   }
1637 }
1638 
1639 
1640 void GraphBuilder::method_return(Value x, bool ignore_return) {
1641   if (method()->intrinsic_id() == vmIntrinsics::_Object_init) {
1642     call_register_finalizer();
1643   }
1644 
1645   // The conditions for a memory barrier are described in Parse::do_exits().
1646   bool need_mem_bar = false;
1647   if (method()->is_object_constructor() &&
1648        (scope()->wrote_final() || scope()->wrote_stable() ||
1649          (AlwaysSafeConstructors && scope()->wrote_fields()) ||
1650          (support_IRIW_for_not_multiple_copy_atomic_cpu && scope()->wrote_volatile()))) {
1651     need_mem_bar = true;
1652   }
1653 
1654   BasicType bt = method()->return_type()->basic_type();
1655   switch (bt) {
1656     case T_BYTE:
1657     {
1658       Value shift = append(new Constant(new IntConstant(24)));
1659       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1660       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));
1661       break;
1662     }
1663     case T_SHORT:
1664     {
1665       Value shift = append(new Constant(new IntConstant(16)));
1666       x = append(new ShiftOp(Bytecodes::_ishl, x, shift));
1667       x = append(new ShiftOp(Bytecodes::_ishr, x, shift));

1778   // Attach dimension info to stable arrays.
1779   if (FoldStableValues &&
1780       field->is_stable() && field_type == T_ARRAY && !field_value.is_null_or_zero()) {
1781     ciArray* array = field_value.as_object()->as_array();
1782     jint dimension = field->type()->as_array_klass()->dimension();
1783     value = new StableArrayConstant(array, dimension);
1784   }
1785 
1786   switch (field_type) {
1787     case T_ARRAY:
1788     case T_OBJECT:
1789       if (field_value.as_object()->should_be_constant()) {
1790         return new Constant(value);
1791       }
1792       return nullptr; // Not a constant.
1793     default:
1794       return new Constant(value);
1795   }
1796 }
1797 
1798 void GraphBuilder::copy_inline_content(ciInlineKlass* vk, Value src, int src_off, Value dest, int dest_off, ValueStack* state_before, ciField* enclosing_field) {
1799   for (int i = 0; i < vk->nof_declared_nonstatic_fields(); i++) {
1800     ciField* field = vk->declared_nonstatic_field_at(i);
1801     int offset = field->offset_in_bytes() - vk->payload_offset();
1802     if (field->is_flat()) {
1803       copy_inline_content(field->type()->as_inline_klass(), src, src_off + offset, dest, dest_off + offset, state_before, enclosing_field);
1804       if (!field->is_null_free()) {
1805         // Nullable, copy the null marker using Unsafe because null markers are no real fields
1806         int null_marker_offset = field->null_marker_offset() - vk->payload_offset();
1807         Value offset = append(new Constant(new LongConstant(src_off + null_marker_offset)));
1808         Value nm = append(new UnsafeGet(T_BOOLEAN, src, offset, false));
1809         offset = append(new Constant(new LongConstant(dest_off + null_marker_offset)));
1810         append(new UnsafePut(T_BOOLEAN, dest, offset, nm, false));
1811       }
1812     } else {
1813       Value value = append(new LoadField(src, src_off + offset, field, false, state_before, false));
1814       StoreField* store = new StoreField(dest, dest_off + offset, field, value, false, state_before, false);
1815       store->set_enclosing_field(enclosing_field);
1816       append(store);
1817     }
1818   }
1819 }
1820 
1821 void GraphBuilder::access_field(Bytecodes::Code code) {
1822   bool will_link;
1823   ciField* field = stream()->get_field(will_link);
1824   ciInstanceKlass* holder = field->holder();
1825   BasicType field_type = field->type()->basic_type();
1826   ValueType* type = as_ValueType(field_type);
1827 
1828   // call will_link again to determine if the field is valid.
1829   const bool needs_patching = !holder->is_loaded() ||
1830                               !field->will_link(method(), code) ||
1831                               (!field->is_flat() && PatchALot);
1832 
1833   ValueStack* state_before = nullptr;
1834   if (!holder->is_initialized() || needs_patching) {
1835     // save state before instruction for debug info when
1836     // deoptimization happens during patching
1837     state_before = copy_state_before();
1838   }
1839 
1840   Value obj = nullptr;
1841   if (code == Bytecodes::_getstatic || code == Bytecodes::_putstatic) {
1842     if (state_before != nullptr) {
1843       // build a patching constant
1844       obj = new Constant(new InstanceConstant(holder->java_mirror()), state_before);
1845     } else {
1846       obj = new Constant(new InstanceConstant(holder->java_mirror()));
1847     }
1848   }
1849 
1850   if (code == Bytecodes::_putfield) {
1851     scope()->set_wrote_fields();
1852     if (field->is_volatile()) {
1853       scope()->set_wrote_volatile();
1854     }
1855     if (field->is_final()) {
1856       scope()->set_wrote_final();
1857     }
1858     if (field->is_stable()) {
1859       scope()->set_wrote_stable();
1860     }
1861   }
1862 
1863   int offset = !needs_patching ? field->offset_in_bytes() : -1;
1864   switch (code) {
1865     case Bytecodes::_getstatic: {
1866       // check for compile-time constants, i.e., initialized static final fields
1867       Value constant = nullptr;
1868       if (field->is_static_constant() && !PatchALot) {
1869         ciConstant field_value = field->constant_value();
1870         assert(!field->is_stable() || !field_value.is_null_or_zero(),
1871                "stable static w/ default value shouldn't be a constant");
1872         constant = make_constant(field_value, field);
1873       }
1874       if (constant != nullptr) {
1875         push(type, append(constant));
1876       } else {
1877         if (state_before == nullptr) {
1878           state_before = copy_state_for_exception();
1879         }
1880         LoadField* load_field = new LoadField(append(obj), offset, field, true,
1881                                         state_before, needs_patching);
1882         push(type, append(load_field));
1883       }
1884       break;
1885     }
1886     case Bytecodes::_putstatic: {
1887       Value val = pop(type);
1888       if (state_before == nullptr) {
1889         state_before = copy_state_for_exception();
1890       }
1891       if (field_type == T_BOOLEAN) {
1892         Value mask = append(new Constant(new IntConstant(1)));
1893         val = append(new LogicOp(Bytecodes::_iand, val, mask));
1894       }
1895       if (field->is_null_free()) {
1896         null_check(val);
1897       }
1898       if (field->is_null_free() && field->type()->is_loaded() && field->type()->as_inline_klass()->is_empty() && (!method()->is_class_initializer() || field->is_flat())) {
1899         // Storing to a field of an empty, null-free inline type that is already initialized. Ignore.
1900         break;
1901       }
1902       append(new StoreField(append(obj), offset, field, val, true, state_before, needs_patching));
1903       break;
1904     }
1905     case Bytecodes::_getfield: {
1906       // Check for compile-time constants, i.e., trusted final non-static fields.
1907       Value constant = nullptr;
1908       if (state_before == nullptr && field->is_flat()) {
1909         // Save the entire state and re-execute on deopt when accessing flat fields
1910         assert(Interpreter::bytecode_should_reexecute(code), "should reexecute");
1911         state_before = copy_state_before();
1912       }
1913       if (!has_pending_field_access() && !has_pending_load_indexed()) {
1914         obj = apop();
1915         ObjectType* obj_type = obj->type()->as_ObjectType();
1916         if (field->is_constant() && !field->is_flat() && obj_type->is_constant() && !PatchALot) {
1917           ciObject* const_oop = obj_type->constant_value();
1918           if (!const_oop->is_null_object() && const_oop->is_loaded()) {
1919             ciConstant field_value = field->constant_value_of(const_oop);
1920             if (field_value.is_valid()) {
1921               constant = make_constant(field_value, field);
1922               // For CallSite objects add a dependency for invalidation of the optimization.
1923               if (field->is_call_site_target()) {
1924                 ciCallSite* call_site = const_oop->as_call_site();
1925                 if (!call_site->is_fully_initialized_constant_call_site()) {
1926                   ciMethodHandle* target = field_value.as_object()->as_method_handle();
1927                   dependency_recorder()->assert_call_site_target_value(call_site, target);
1928                 }
1929               }
1930             }
1931           }
1932         }
1933       }
1934       if (constant != nullptr) {
1935         push(type, append(constant));
1936       } else {
1937         if (state_before == nullptr) {
1938           state_before = copy_state_for_exception();
1939         }
1940         if (!field->is_flat()) {
1941           if (has_pending_field_access()) {
1942             assert(!needs_patching, "Can't patch delayed field access");
1943             obj = pending_field_access()->obj();
1944             offset += pending_field_access()->offset() - field->holder()->as_inline_klass()->payload_offset();
1945             field = pending_field_access()->holder()->get_field_by_offset(offset, false);
1946             assert(field != nullptr, "field not found");
1947             set_pending_field_access(nullptr);
1948           } else if (has_pending_load_indexed()) {
1949             assert(!needs_patching, "Can't patch delayed field access");
1950             pending_load_indexed()->update(field, offset - field->holder()->as_inline_klass()->payload_offset());
1951             LoadIndexed* li = pending_load_indexed()->load_instr();
1952             li->set_type(type);
1953             push(type, append(li));
1954             set_pending_load_indexed(nullptr);




1955             break;
1956           }
1957           LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1958           Value replacement = !needs_patching ? _memory->load(load) : load;
1959           if (replacement != load) {
1960             assert(replacement->is_linked() || !replacement->can_be_linked(), "should already by linked");
1961             // Writing an (integer) value to a boolean, byte, char or short field includes an implicit narrowing
1962             // conversion. Emit an explicit conversion here to get the correct field value after the write.
1963             switch (field_type) {
1964             case T_BOOLEAN:
1965             case T_BYTE:
1966               replacement = append(new Convert(Bytecodes::_i2b, replacement, type));
1967               break;
1968             case T_CHAR:
1969               replacement = append(new Convert(Bytecodes::_i2c, replacement, type));
1970               break;
1971             case T_SHORT:
1972               replacement = append(new Convert(Bytecodes::_i2s, replacement, type));
1973               break;
1974             default:
1975               break;
1976             }
1977             push(type, replacement);
1978           } else {
1979             push(type, append(load));
1980           }
1981         } else {
1982           // Flat field
1983           assert(!needs_patching, "Can't patch flat inline type field access");
1984           ciInlineKlass* inline_klass = field->type()->as_inline_klass();
1985           bool is_naturally_atomic = inline_klass->nof_declared_nonstatic_fields() <= 1;
1986           bool needs_atomic_access = !field->is_null_free() || (field->is_volatile() && !is_naturally_atomic);
1987           if (needs_atomic_access) {
1988             assert(!has_pending_field_access(), "Pending field accesses are not supported");
1989             LoadField* load = new LoadField(obj, offset, field, false, state_before, needs_patching);
1990             push(type, append(load));
1991           } else {
1992             assert(field->is_null_free(), "must be null-free");
1993             // Look at the next bytecode to check if we can delay the field access
1994             bool can_delay_access = false;
1995             ciBytecodeStream s(method());
1996             s.force_bci(bci());
1997             s.next();
1998             if (s.cur_bc() == Bytecodes::_getfield && !needs_patching) {
1999               ciField* next_field = s.get_field(will_link);
2000               bool next_needs_patching = !next_field->holder()->is_loaded() ||
2001                                          !next_field->will_link(method(), Bytecodes::_getfield) ||
2002                                          PatchALot;
2003               // We can't update the offset for atomic accesses
2004               bool next_needs_atomic_access = !next_field->is_null_free() || next_field->is_volatile();
2005               can_delay_access = C1UseDelayedFlattenedFieldReads && !next_needs_patching && !next_needs_atomic_access;
2006             }
2007             if (can_delay_access) {
2008               if (has_pending_load_indexed()) {
2009                 pending_load_indexed()->update(field, offset - field->holder()->as_inline_klass()->payload_offset());
2010               } else if (has_pending_field_access()) {
2011                 pending_field_access()->inc_offset(offset - field->holder()->as_inline_klass()->payload_offset());
2012               } else {
2013                 null_check(obj);
2014                 DelayedFieldAccess* dfa = new DelayedFieldAccess(obj, field->holder(), field->offset_in_bytes(), state_before);
2015                 set_pending_field_access(dfa);
2016               }
2017             } else {
2018               scope()->set_wrote_final();
2019               scope()->set_wrote_fields();
2020               bool need_membar = false;
2021               if (has_pending_load_indexed()) {
2022                 assert(!needs_patching, "Can't patch delayed field access");
2023                 pending_load_indexed()->update(field, offset - field->holder()->as_inline_klass()->payload_offset());
2024                 NewInstance* vt = new NewInstance(inline_klass, pending_load_indexed()->state_before(), false, true);
2025                 _memory->new_instance(vt);
2026                 pending_load_indexed()->load_instr()->set_vt(vt);
2027                 apush(append_split(vt));
2028                 append(pending_load_indexed()->load_instr());
2029                 set_pending_load_indexed(nullptr);
2030                 need_membar = true;
2031               } else {
2032                 if (has_pending_field_access()) {
2033                   state_before = pending_field_access()->state_before();
2034                 }
2035                 NewInstance* new_instance = new NewInstance(inline_klass, state_before, false, true);
2036                 _memory->new_instance(new_instance);
2037                 apush(append_split(new_instance));
2038                 if (has_pending_field_access()) {
2039                   copy_inline_content(inline_klass, pending_field_access()->obj(),
2040                                       pending_field_access()->offset() + field->offset_in_bytes() - field->holder()->as_inline_klass()->payload_offset(),
2041                                       new_instance, inline_klass->payload_offset(), state_before);
2042                   set_pending_field_access(nullptr);
2043                 } else {
2044                   if (field->type()->as_instance_klass()->is_initialized() && field->type()->as_inline_klass()->is_empty()) {
2045                     // Needs an explicit null check because below code does not perform any actual load if there are no fields
2046                     null_check(obj);
2047                   }
2048                   copy_inline_content(inline_klass, obj, field->offset_in_bytes(), new_instance, inline_klass->payload_offset(), state_before);
2049                 }
2050                 need_membar = true;
2051               }
2052               if (need_membar) {
2053                 // If we allocated a new instance ensure the stores to copy the
2054                 // field contents are visible before any subsequent store that
2055                 // publishes this reference.
2056                 append(new MemBar(lir_membar_storestore));
2057               }
2058             }
2059           }
2060         }
2061       }
2062       break;
2063     }
2064     case Bytecodes::_putfield: {
2065       Value val = pop(type);
2066       obj = apop();
2067       if (state_before == nullptr) {
2068         state_before = copy_state_for_exception();
2069       }
2070       if (field_type == T_BOOLEAN) {
2071         Value mask = append(new Constant(new IntConstant(1)));
2072         val = append(new LogicOp(Bytecodes::_iand, val, mask));
2073       }
2074 
2075       if (field->is_null_free() && field->type()->is_loaded() && field->type()->as_inline_klass()->is_empty() && (!method()->is_object_constructor() || field->is_flat())) {
2076         // Storing to a field of an empty, null-free inline type that is already initialized. Ignore.
2077         null_check(obj);
2078         null_check(val);
2079       } else if (!field->is_flat()) {
2080         if (field->is_null_free()) {
2081           null_check(val);
2082         }
2083         StoreField* store = new StoreField(obj, offset, field, val, false, state_before, needs_patching);
2084         if (!needs_patching) store = _memory->store(store);
2085         if (store != nullptr) {
2086           append(store);
2087         }
2088       } else {
2089         // Flat field
2090         assert(!needs_patching, "Can't patch flat inline type field access");
2091         ciInlineKlass* inline_klass = field->type()->as_inline_klass();
2092         bool is_naturally_atomic = inline_klass->nof_declared_nonstatic_fields() <= 1;
2093         bool needs_atomic_access = !field->is_null_free() || (field->is_volatile() && !is_naturally_atomic);
2094         if (needs_atomic_access) {
2095           if (field->is_null_free()) {
2096             null_check(val);
2097           }
2098           append(new StoreField(obj, offset, field, val, false, state_before, needs_patching));
2099         } else {
2100           assert(field->is_null_free(), "must be null-free");
2101           copy_inline_content(inline_klass, val, inline_klass->payload_offset(), obj, offset, state_before, field);
2102         }
2103       }
2104       break;
2105     }
2106     default:
2107       ShouldNotReachHere();
2108       break;
2109   }
2110 }
2111 

2112 Dependencies* GraphBuilder::dependency_recorder() const {
2113   return compilation()->dependency_recorder();
2114 }
2115 
2116 // How many arguments do we want to profile?
2117 Values* GraphBuilder::args_list_for_profiling(ciMethod* target, int& start, bool may_have_receiver) {
2118   int n = 0;
2119   bool has_receiver = may_have_receiver && Bytecodes::has_receiver(method()->java_code_at_bci(bci()));
2120   start = has_receiver ? 1 : 0;
2121   if (profile_arguments()) {
2122     ciProfileData* data = method()->method_data()->bci_to_data(bci());
2123     if (data != nullptr && (data->is_CallTypeData() || data->is_VirtualCallTypeData())) {
2124       n = data->is_CallTypeData() ? data->as_CallTypeData()->number_of_arguments() : data->as_VirtualCallTypeData()->number_of_arguments();
2125     }
2126   }
2127   // If we are inlining then we need to collect arguments to profile parameters for the target
2128   if (profile_parameters() && target != nullptr) {
2129     if (target->method_data() != nullptr && target->method_data()->parameters_type_data() != nullptr) {
2130       // The receiver is profiled on method entry so it's included in
2131       // the number of parameters but here we're only interested in

2207       break;
2208     case Bytecodes::_invokehandle:
2209       code = target->is_static() ? Bytecodes::_invokestatic : Bytecodes::_invokespecial;
2210       break;
2211     default:
2212       break;
2213     }
2214   } else {
2215     if (bc_raw == Bytecodes::_invokehandle) {
2216       assert(!will_link, "should come here only for unlinked call");
2217       code = Bytecodes::_invokespecial;
2218     }
2219   }
2220 
2221   if (code == Bytecodes::_invokespecial) {
2222     // Additional receiver subtype checks for interface calls via invokespecial or invokeinterface.
2223     ciKlass* receiver_constraint = nullptr;
2224 
2225     if (bc_raw == Bytecodes::_invokeinterface) {
2226       receiver_constraint = holder;
2227     } else if (bc_raw == Bytecodes::_invokespecial && !target->is_object_constructor() && calling_klass->is_interface()) {
2228       receiver_constraint = calling_klass;
2229     }
2230 
2231     if (receiver_constraint != nullptr) {
2232       int index = state()->stack_size() - (target->arg_size_no_receiver() + 1);
2233       Value receiver = state()->stack_at(index);
2234       CheckCast* c = new CheckCast(receiver_constraint, receiver, copy_state_before());
2235       // go to uncommon_trap when checkcast fails
2236       c->set_invokespecial_receiver_check();
2237       state()->stack_at_put(index, append_split(c));
2238     }
2239   }
2240 
2241   // Push appendix argument (MethodType, CallSite, etc.), if one.
2242   bool patch_for_appendix = false;
2243   int patching_appendix_arg = 0;
2244   if (Bytecodes::has_optional_appendix(bc_raw) && (!will_link || PatchALot)) {
2245     Value arg = append(new Constant(new ObjectConstant(compilation()->env()->unloaded_ciinstance()), copy_state_before()));
2246     apush(arg);
2247     patch_for_appendix = true;

2463     }
2464   }
2465 
2466   Invoke* result = new Invoke(code, result_type, recv, args, target, state_before);
2467   // push result
2468   append_split(result);
2469 
2470   if (result_type != voidType) {
2471     push(result_type, result);
2472   }
2473   if (profile_return() && result_type->is_object_kind()) {
2474     profile_return_type(result, target);
2475   }
2476 }
2477 
2478 
2479 void GraphBuilder::new_instance(int klass_index) {
2480   ValueStack* state_before = copy_state_exhandling();
2481   ciKlass* klass = stream()->get_klass();
2482   assert(klass->is_instance_klass(), "must be an instance klass");
2483   NewInstance* new_instance = new NewInstance(klass->as_instance_klass(), state_before, stream()->is_unresolved_klass(), false);
2484   _memory->new_instance(new_instance);
2485   apush(append_split(new_instance));
2486 }
2487 

2488 void GraphBuilder::new_type_array() {
2489   ValueStack* state_before = copy_state_exhandling();
2490   apush(append_split(new NewTypeArray(ipop(), (BasicType)stream()->get_index(), state_before, true)));
2491 }
2492 
2493 
2494 void GraphBuilder::new_object_array() {
2495   ciKlass* klass = stream()->get_klass();
2496   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2497   NewArray* n = new NewObjectArray(klass, ipop(), state_before);
2498   apush(append_split(n));
2499 }
2500 
2501 
2502 bool GraphBuilder::direct_compare(ciKlass* k) {
2503   if (k->is_loaded() && k->is_instance_klass() && !UseSlowPath) {
2504     ciInstanceKlass* ik = k->as_instance_klass();
2505     if (ik->is_final()) {
2506       return true;
2507     } else {

2540   ciKlass* klass = stream()->get_klass();
2541   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2542   InstanceOf* i = new InstanceOf(klass, apop(), state_before);
2543   ipush(append_split(i));
2544   i->set_direct_compare(direct_compare(klass));
2545 
2546   if (is_profiling()) {
2547     // Note that we'd collect profile data in this method if we wanted it.
2548     compilation()->set_would_profile(true);
2549 
2550     if (profile_checkcasts()) {
2551       i->set_profiled_method(method());
2552       i->set_profiled_bci(bci());
2553       i->set_should_profile(true);
2554     }
2555   }
2556 }
2557 
2558 
2559 void GraphBuilder::monitorenter(Value x, int bci) {
2560   bool maybe_inlinetype = false;
2561   if (bci == InvocationEntryBci) {
2562     // Called by GraphBuilder::inline_sync_entry.
2563 #ifdef ASSERT
2564     ciType* obj_type = x->declared_type();
2565     assert(obj_type == nullptr || !obj_type->is_inlinetype(), "inline types cannot have synchronized methods");
2566 #endif
2567   } else {
2568     // We are compiling a monitorenter bytecode
2569     if (EnableValhalla) {
2570       ciType* obj_type = x->declared_type();
2571       if (obj_type == nullptr || obj_type->as_klass()->can_be_inline_klass()) {
2572         // If we're (possibly) locking on an inline type, check for markWord::always_locked_pattern
2573         // and throw IMSE. (obj_type is null for Phi nodes, so let's just be conservative).
2574         maybe_inlinetype = true;
2575       }
2576     }
2577   }
2578 
2579   // save state before locking in case of deoptimization after a NullPointerException
2580   ValueStack* state_before = copy_state_for_exception_with_bci(bci);
2581   append_with_bci(new MonitorEnter(x, state()->lock(x), state_before, maybe_inlinetype), bci);
2582   kill_all();
2583 }
2584 
2585 
2586 void GraphBuilder::monitorexit(Value x, int bci) {
2587   append_with_bci(new MonitorExit(x, state()->unlock()), bci);
2588   kill_all();
2589 }
2590 
2591 
2592 void GraphBuilder::new_multi_array(int dimensions) {
2593   ciKlass* klass = stream()->get_klass();
2594   ValueStack* state_before = !klass->is_loaded() || PatchALot ? copy_state_before() : copy_state_exhandling();
2595 
2596   Values* dims = new Values(dimensions, dimensions, nullptr);
2597   // fill in all dimensions
2598   int i = dimensions;
2599   while (i-- > 0) dims->at_put(i, ipop());
2600   // create array
2601   NewArray* n = new NewMultiArray(klass, dims, state_before);

2686 
2687 Instruction* GraphBuilder::append_split(StateSplit* instr) {
2688   return append_with_bci(instr, bci());
2689 }
2690 
2691 
2692 void GraphBuilder::null_check(Value value) {
2693   if (value->as_NewArray() != nullptr || value->as_NewInstance() != nullptr) {
2694     return;
2695   } else {
2696     Constant* con = value->as_Constant();
2697     if (con) {
2698       ObjectType* c = con->type()->as_ObjectType();
2699       if (c && c->is_loaded()) {
2700         ObjectConstant* oc = c->as_ObjectConstant();
2701         if (!oc || !oc->value()->is_null_object()) {
2702           return;
2703         }
2704       }
2705     }
2706     if (value->is_null_free()) return;
2707   }
2708   append(new NullCheck(value, copy_state_for_exception()));
2709 }
2710 
2711 
2712 
2713 XHandlers* GraphBuilder::handle_exception(Instruction* instruction) {
2714   if (!has_handler() && (!instruction->needs_exception_state() || instruction->exception_state() != nullptr)) {
2715     assert(instruction->exception_state() == nullptr
2716            || instruction->exception_state()->kind() == ValueStack::EmptyExceptionState
2717            || (instruction->exception_state()->kind() == ValueStack::ExceptionState && _compilation->env()->should_retain_local_variables()),
2718            "exception_state should be of exception kind");
2719     return new XHandlers();
2720   }
2721 
2722   XHandlers*  exception_handlers = new XHandlers();
2723   ScopeData*  cur_scope_data = scope_data();
2724   ValueStack* cur_state = instruction->state_before();
2725   ValueStack* prev_state = nullptr;
2726   int scope_count = 0;
2727 
2728   assert(cur_state != nullptr, "state_before must be set");
2729   do {
2730     int cur_bci = cur_state->bci();
2731     assert(cur_scope_data->scope() == cur_state->scope(), "scopes do not match");
2732     assert(cur_bci == SynchronizationEntryBCI || cur_bci == cur_scope_data->stream()->cur_bci()
2733            || has_pending_field_access() || has_pending_load_indexed(), "invalid bci");
2734 
2735 
2736     // join with all potential exception handlers
2737     XHandlers* list = cur_scope_data->xhandlers();
2738     const int n = list->length();
2739     for (int i = 0; i < n; i++) {
2740       XHandler* h = list->handler_at(i);
2741       if (h->covers(cur_bci)) {
2742         // h is a potential exception handler => join it
2743         compilation()->set_has_exception_handlers(true);
2744 
2745         BlockBegin* entry = h->entry_block();
2746         if (entry == block()) {
2747           // It's acceptable for an exception handler to cover itself
2748           // but we don't handle that in the parser currently.  It's
2749           // very rare so we bailout instead of trying to handle it.
2750           BAILOUT_("exception handler covers itself", exception_handlers);
2751         }
2752         assert(entry->bci() == h->handler_bci(), "must match");
2753         assert(entry->bci() == -1 || entry == cur_scope_data->block_at(entry->bci()), "blocks must correspond");
2754 

3528     state->store_local(idx, new Local(type, vt, idx, false));
3529     idx += type->size();
3530   }
3531 
3532   // lock synchronized method
3533   if (method()->is_synchronized()) {
3534     state->lock(nullptr);
3535   }
3536 
3537   return state;
3538 }
3539 
3540 
3541 GraphBuilder::GraphBuilder(Compilation* compilation, IRScope* scope)
3542   : _scope_data(nullptr)
3543   , _compilation(compilation)
3544   , _memory(new MemoryBuffer())
3545   , _inline_bailout_msg(nullptr)
3546   , _instruction_count(0)
3547   , _osr_entry(nullptr)
3548   , _pending_field_access(nullptr)
3549   , _pending_load_indexed(nullptr)
3550 {
3551   int osr_bci = compilation->osr_bci();
3552 
3553   // determine entry points and bci2block mapping
3554   BlockListBuilder blm(compilation, scope, osr_bci);
3555   CHECK_BAILOUT();
3556 
3557   BlockList* bci2block = blm.bci2block();
3558   BlockBegin* start_block = bci2block->at(0);
3559 
3560   push_root_scope(scope, bci2block, start_block);
3561 
3562   // setup state for std entry
3563   _initial_state = state_at_entry();
3564   start_block->merge(_initial_state, compilation->has_irreducible_loops());
3565 
3566   // End nulls still exist here
3567 
3568   // complete graph
3569   _vmap        = new ValueMap();
< prev index next >