1 /*
   2  * Copyright (c) 1999, 2016, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "precompiled.hpp"
  26 #include "asm/macroAssembler.hpp"
  27 #include "classfile/systemDictionary.hpp"
  28 #include "classfile/vmSymbols.hpp"
  29 #include "compiler/compileBroker.hpp"
  30 #include "compiler/compileLog.hpp"
  31 #include "memory/resourceArea.hpp"
  32 #include "oops/objArrayKlass.hpp"
  33 #include "opto/addnode.hpp"
  34 #include "opto/arraycopynode.hpp"
  35 #include "opto/c2compiler.hpp"
  36 #include "opto/callGenerator.hpp"
  37 #include "opto/castnode.hpp"
  38 #include "opto/cfgnode.hpp"
  39 #include "opto/convertnode.hpp"
  40 #include "opto/countbitsnode.hpp"
  41 #include "opto/intrinsicnode.hpp"
  42 #include "opto/idealKit.hpp"
  43 #include "opto/mathexactnode.hpp"
  44 #include "opto/movenode.hpp"
  45 #include "opto/mulnode.hpp"
  46 #include "opto/narrowptrnode.hpp"
  47 #include "opto/opaquenode.hpp"
  48 #include "opto/parse.hpp"
  49 #include "opto/runtime.hpp"
  50 #include "opto/subnode.hpp"
  51 #include "prims/nativeLookup.hpp"
  52 #include "prims/unsafe.hpp"
  53 #include "runtime/sharedRuntime.hpp"
  54 #ifdef TRACE_HAVE_INTRINSICS
  55 #include "trace/traceMacros.hpp"
  56 #endif
  57 
  58 class LibraryIntrinsic : public InlineCallGenerator {
  59   // Extend the set of intrinsics known to the runtime:
  60  public:
  61  private:
  62   bool             _is_virtual;
  63   bool             _does_virtual_dispatch;
  64   int8_t           _predicates_count;  // Intrinsic is predicated by several conditions
  65   int8_t           _last_predicate; // Last generated predicate
  66   vmIntrinsics::ID _intrinsic_id;
  67 
  68  public:
  69   LibraryIntrinsic(ciMethod* m, bool is_virtual, int predicates_count, bool does_virtual_dispatch, vmIntrinsics::ID id)
  70     : InlineCallGenerator(m),
  71       _is_virtual(is_virtual),
  72       _does_virtual_dispatch(does_virtual_dispatch),
  73       _predicates_count((int8_t)predicates_count),
  74       _last_predicate((int8_t)-1),
  75       _intrinsic_id(id)
  76   {
  77   }
  78   virtual bool is_intrinsic() const { return true; }
  79   virtual bool is_virtual()   const { return _is_virtual; }
  80   virtual bool is_predicated() const { return _predicates_count > 0; }
  81   virtual int  predicates_count() const { return _predicates_count; }
  82   virtual bool does_virtual_dispatch()   const { return _does_virtual_dispatch; }
  83   virtual JVMState* generate(JVMState* jvms);
  84   virtual Node* generate_predicate(JVMState* jvms, int predicate);
  85   vmIntrinsics::ID intrinsic_id() const { return _intrinsic_id; }
  86 };
  87 
  88 
  89 // Local helper class for LibraryIntrinsic:
  90 class LibraryCallKit : public GraphKit {
  91  private:
  92   LibraryIntrinsic* _intrinsic;     // the library intrinsic being called
  93   Node*             _result;        // the result node, if any
  94   int               _reexecute_sp;  // the stack pointer when bytecode needs to be reexecuted
  95 
  96   const TypeOopPtr* sharpen_unsafe_type(Compile::AliasType* alias_type, const TypePtr *adr_type);
  97 
  98  public:
  99   LibraryCallKit(JVMState* jvms, LibraryIntrinsic* intrinsic)
 100     : GraphKit(jvms),
 101       _intrinsic(intrinsic),
 102       _result(NULL)
 103   {
 104     // Check if this is a root compile.  In that case we don't have a caller.
 105     if (!jvms->has_method()) {
 106       _reexecute_sp = sp();
 107     } else {
 108       // Find out how many arguments the interpreter needs when deoptimizing
 109       // and save the stack pointer value so it can used by uncommon_trap.
 110       // We find the argument count by looking at the declared signature.
 111       bool ignored_will_link;
 112       ciSignature* declared_signature = NULL;
 113       ciMethod* ignored_callee = caller()->get_method_at_bci(bci(), ignored_will_link, &declared_signature);
 114       const int nargs = declared_signature->arg_size_for_bc(caller()->java_code_at_bci(bci()));
 115       _reexecute_sp = sp() + nargs;  // "push" arguments back on stack
 116     }
 117   }
 118 
 119   virtual LibraryCallKit* is_LibraryCallKit() const { return (LibraryCallKit*)this; }
 120 
 121   ciMethod*         caller()    const    { return jvms()->method(); }
 122   int               bci()       const    { return jvms()->bci(); }
 123   LibraryIntrinsic* intrinsic() const    { return _intrinsic; }
 124   vmIntrinsics::ID  intrinsic_id() const { return _intrinsic->intrinsic_id(); }
 125   ciMethod*         callee()    const    { return _intrinsic->method(); }
 126 
 127   bool  try_to_inline(int predicate);
 128   Node* try_to_predicate(int predicate);
 129 
 130   void push_result() {
 131     // Push the result onto the stack.
 132     if (!stopped() && result() != NULL) {
 133       BasicType bt = result()->bottom_type()->basic_type();
 134       push_node(bt, result());
 135     }
 136   }
 137 
 138  private:
 139   void fatal_unexpected_iid(vmIntrinsics::ID iid) {
 140     fatal("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid));
 141   }
 142 
 143   void  set_result(Node* n) { assert(_result == NULL, "only set once"); _result = n; }
 144   void  set_result(RegionNode* region, PhiNode* value);
 145   Node*     result() { return _result; }
 146 
 147   virtual int reexecute_sp() { return _reexecute_sp; }
 148 
 149   // Helper functions to inline natives
 150   Node* generate_guard(Node* test, RegionNode* region, float true_prob);
 151   Node* generate_slow_guard(Node* test, RegionNode* region);
 152   Node* generate_fair_guard(Node* test, RegionNode* region);
 153   Node* generate_negative_guard(Node* index, RegionNode* region,
 154                                 // resulting CastII of index:
 155                                 Node* *pos_index = NULL);
 156   Node* generate_limit_guard(Node* offset, Node* subseq_length,
 157                              Node* array_length,
 158                              RegionNode* region);
 159   void  generate_string_range_check(Node* array, Node* offset,
 160                                     Node* length, bool char_count);
 161   Node* generate_current_thread(Node* &tls_output);
 162   Node* load_mirror_from_klass(Node* klass);
 163   Node* load_klass_from_mirror_common(Node* mirror, bool never_see_null,
 164                                       RegionNode* region, int null_path,
 165                                       int offset);
 166   Node* load_klass_from_mirror(Node* mirror, bool never_see_null,
 167                                RegionNode* region, int null_path) {
 168     int offset = java_lang_Class::klass_offset_in_bytes();
 169     return load_klass_from_mirror_common(mirror, never_see_null,
 170                                          region, null_path,
 171                                          offset);
 172   }
 173   Node* load_array_klass_from_mirror(Node* mirror, bool never_see_null,
 174                                      RegionNode* region, int null_path) {
 175     int offset = java_lang_Class::array_klass_offset_in_bytes();
 176     return load_klass_from_mirror_common(mirror, never_see_null,
 177                                          region, null_path,
 178                                          offset);
 179   }
 180   Node* generate_access_flags_guard(Node* kls,
 181                                     int modifier_mask, int modifier_bits,
 182                                     RegionNode* region);
 183   Node* generate_interface_guard(Node* kls, RegionNode* region);
 184   Node* generate_array_guard(Node* kls, RegionNode* region) {
 185     return generate_array_guard_common(kls, region, false, false);
 186   }
 187   Node* generate_non_array_guard(Node* kls, RegionNode* region) {
 188     return generate_array_guard_common(kls, region, false, true);
 189   }
 190   Node* generate_objArray_guard(Node* kls, RegionNode* region) {
 191     return generate_array_guard_common(kls, region, true, false);
 192   }
 193   Node* generate_non_objArray_guard(Node* kls, RegionNode* region) {
 194     return generate_array_guard_common(kls, region, true, true);
 195   }
 196   Node* generate_array_guard_common(Node* kls, RegionNode* region,
 197                                     bool obj_array, bool not_array);
 198   Node* generate_virtual_guard(Node* obj_klass, RegionNode* slow_region);
 199   CallJavaNode* generate_method_call(vmIntrinsics::ID method_id,
 200                                      bool is_virtual = false, bool is_static = false);
 201   CallJavaNode* generate_method_call_static(vmIntrinsics::ID method_id) {
 202     return generate_method_call(method_id, false, true);
 203   }
 204   CallJavaNode* generate_method_call_virtual(vmIntrinsics::ID method_id) {
 205     return generate_method_call(method_id, true, false);
 206   }
 207   Node * load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, bool is_exact, bool is_static, ciInstanceKlass * fromKls);
 208   Node * field_address_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString, bool is_exact, bool is_static, ciInstanceKlass * fromKls);
 209 
 210   Node* make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2, StrIntrinsicNode::ArgEnc ae);
 211   bool inline_string_compareTo(StrIntrinsicNode::ArgEnc ae);
 212   bool inline_string_indexOf(StrIntrinsicNode::ArgEnc ae);
 213   bool inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae);
 214   Node* make_indexOf_node(Node* src_start, Node* src_count, Node* tgt_start, Node* tgt_count,
 215                           RegionNode* region, Node* phi, StrIntrinsicNode::ArgEnc ae);
 216   bool inline_string_indexOfChar();
 217   bool inline_string_equals(StrIntrinsicNode::ArgEnc ae);
 218   bool inline_string_toBytesU();
 219   bool inline_string_getCharsU();
 220   bool inline_string_copy(bool compress);
 221   bool inline_string_char_access(bool is_store);
 222   Node* round_double_node(Node* n);
 223   bool runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName);
 224   bool inline_math_native(vmIntrinsics::ID id);
 225   bool inline_trig(vmIntrinsics::ID id);
 226   bool inline_math(vmIntrinsics::ID id);
 227   template <typename OverflowOp>
 228   bool inline_math_overflow(Node* arg1, Node* arg2);
 229   void inline_math_mathExact(Node* math, Node* test);
 230   bool inline_math_addExactI(bool is_increment);
 231   bool inline_math_addExactL(bool is_increment);
 232   bool inline_math_multiplyExactI();
 233   bool inline_math_multiplyExactL();
 234   bool inline_math_negateExactI();
 235   bool inline_math_negateExactL();
 236   bool inline_math_subtractExactI(bool is_decrement);
 237   bool inline_math_subtractExactL(bool is_decrement);
 238   bool inline_min_max(vmIntrinsics::ID id);
 239   bool inline_notify(vmIntrinsics::ID id);
 240   Node* generate_min_max(vmIntrinsics::ID id, Node* x, Node* y);
 241   // This returns Type::AnyPtr, RawPtr, or OopPtr.
 242   int classify_unsafe_addr(Node* &base, Node* &offset);
 243   Node* make_unsafe_address(Node* base, Node* offset);
 244   // Helper for inline_unsafe_access.
 245   // Generates the guards that check whether the result of
 246   // Unsafe.getObject should be recorded in an SATB log buffer.
 247   void insert_pre_barrier(Node* base_oop, Node* offset, Node* pre_val, bool need_mem_bar);
 248 
 249   typedef enum { Relaxed, Opaque, Volatile, Acquire, Release } AccessKind;
 250   bool inline_unsafe_access(bool is_store, BasicType type, AccessKind kind, bool is_unaligned);
 251   static bool klass_needs_init_guard(Node* kls);
 252   bool inline_unsafe_allocate();
 253   bool inline_unsafe_newArray(bool uninitialized);
 254   bool inline_unsafe_copyMemory();
 255   bool inline_native_currentThread();
 256 
 257   bool inline_native_time_funcs(address method, const char* funcName);
 258   bool inline_native_isInterrupted();
 259   bool inline_native_Class_query(vmIntrinsics::ID id);
 260   bool inline_native_subtype_check();
 261   bool inline_native_getLength();
 262   bool inline_array_copyOf(bool is_copyOfRange);
 263   bool inline_array_equals(StrIntrinsicNode::ArgEnc ae);
 264   bool inline_preconditions_checkIndex();
 265   void copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark);
 266   bool inline_native_clone(bool is_virtual);
 267   bool inline_native_Reflection_getCallerClass();
 268   // Helper function for inlining native object hash method
 269   bool inline_native_hashcode(bool is_virtual, bool is_static);
 270   bool inline_native_getClass();
 271 
 272   // Helper functions for inlining arraycopy
 273   bool inline_arraycopy();
 274   AllocateArrayNode* tightly_coupled_allocation(Node* ptr,
 275                                                 RegionNode* slow_region);
 276   JVMState* arraycopy_restore_alloc_state(AllocateArrayNode* alloc, int& saved_reexecute_sp);
 277   void arraycopy_move_allocation_here(AllocateArrayNode* alloc, Node* dest, JVMState* saved_jvms, int saved_reexecute_sp);
 278 
 279   typedef enum { LS_get_add, LS_get_set, LS_cmp_swap, LS_cmp_swap_weak, LS_cmp_exchange } LoadStoreKind;
 280   MemNode::MemOrd access_kind_to_memord_LS(AccessKind access_kind, bool is_store);
 281   MemNode::MemOrd access_kind_to_memord(AccessKind access_kind);
 282   bool inline_unsafe_load_store(BasicType type,  LoadStoreKind kind, AccessKind access_kind);
 283   bool inline_unsafe_fence(vmIntrinsics::ID id);
 284   bool inline_onspinwait();
 285   bool inline_fp_conversions(vmIntrinsics::ID id);
 286   bool inline_number_methods(vmIntrinsics::ID id);
 287   bool inline_reference_get();
 288   bool inline_Class_cast();
 289   bool inline_aescrypt_Block(vmIntrinsics::ID id);
 290   bool inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id);
 291   bool inline_counterMode_AESCrypt(vmIntrinsics::ID id);
 292   Node* inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting);
 293   Node* inline_counterMode_AESCrypt_predicate();
 294   Node* get_key_start_from_aescrypt_object(Node* aescrypt_object);
 295   Node* get_original_key_start_from_aescrypt_object(Node* aescrypt_object);
 296   bool inline_ghash_processBlocks();
 297   bool inline_sha_implCompress(vmIntrinsics::ID id);
 298   bool inline_digestBase_implCompressMB(int predicate);
 299   bool inline_sha_implCompressMB(Node* digestBaseObj, ciInstanceKlass* instklass_SHA,
 300                                  bool long_state, address stubAddr, const char *stubName,
 301                                  Node* src_start, Node* ofs, Node* limit);
 302   Node* get_state_from_sha_object(Node *sha_object);
 303   Node* get_state_from_sha5_object(Node *sha_object);
 304   Node* inline_digestBase_implCompressMB_predicate(int predicate);
 305   bool inline_encodeISOArray();
 306   bool inline_updateCRC32();
 307   bool inline_updateBytesCRC32();
 308   bool inline_updateByteBufferCRC32();
 309   Node* get_table_from_crc32c_class(ciInstanceKlass *crc32c_class);
 310   bool inline_updateBytesCRC32C();
 311   bool inline_updateDirectByteBufferCRC32C();
 312   bool inline_updateBytesAdler32();
 313   bool inline_updateByteBufferAdler32();
 314   bool inline_multiplyToLen();
 315   bool inline_hasNegatives();
 316   bool inline_squareToLen();
 317   bool inline_mulAdd();
 318   bool inline_montgomeryMultiply();
 319   bool inline_montgomerySquare();
 320   bool inline_vectorizedMismatch();
 321 
 322   bool inline_profileBoolean();
 323   bool inline_isCompileConstant();
 324 };
 325 
 326 //---------------------------make_vm_intrinsic----------------------------
 327 CallGenerator* Compile::make_vm_intrinsic(ciMethod* m, bool is_virtual) {
 328   vmIntrinsics::ID id = m->intrinsic_id();
 329   assert(id != vmIntrinsics::_none, "must be a VM intrinsic");
 330 
 331   if (!m->is_loaded()) {
 332     // Do not attempt to inline unloaded methods.
 333     return NULL;
 334   }
 335 
 336   C2Compiler* compiler = (C2Compiler*)CompileBroker::compiler(CompLevel_full_optimization);
 337   bool is_available = false;
 338 
 339   {
 340     // For calling is_intrinsic_supported and is_intrinsic_disabled_by_flag
 341     // the compiler must transition to '_thread_in_vm' state because both
 342     // methods access VM-internal data.
 343     VM_ENTRY_MARK;
 344     methodHandle mh(THREAD, m->get_Method());
 345     is_available = compiler->is_intrinsic_supported(mh, is_virtual) &&
 346                    !C->directive()->is_intrinsic_disabled(mh) &&
 347                    !vmIntrinsics::is_disabled_by_flags(mh);
 348 
 349   }
 350 
 351   if (is_available) {
 352     assert(id <= vmIntrinsics::LAST_COMPILER_INLINE, "caller responsibility");
 353     assert(id != vmIntrinsics::_Object_init && id != vmIntrinsics::_invoke, "enum out of order?");
 354     return new LibraryIntrinsic(m, is_virtual,
 355                                 vmIntrinsics::predicates_needed(id),
 356                                 vmIntrinsics::does_virtual_dispatch(id),
 357                                 (vmIntrinsics::ID) id);
 358   } else {
 359     return NULL;
 360   }
 361 }
 362 
 363 //----------------------register_library_intrinsics-----------------------
 364 // Initialize this file's data structures, for each Compile instance.
 365 void Compile::register_library_intrinsics() {
 366   // Nothing to do here.
 367 }
 368 
 369 JVMState* LibraryIntrinsic::generate(JVMState* jvms) {
 370   LibraryCallKit kit(jvms, this);
 371   Compile* C = kit.C;
 372   int nodes = C->unique();
 373 #ifndef PRODUCT
 374   if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
 375     char buf[1000];
 376     const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf));
 377     tty->print_cr("Intrinsic %s", str);
 378   }
 379 #endif
 380   ciMethod* callee = kit.callee();
 381   const int bci    = kit.bci();
 382 
 383   // Try to inline the intrinsic.
 384   if ((CheckIntrinsics ? callee->intrinsic_candidate() : true) &&
 385       kit.try_to_inline(_last_predicate)) {
 386     if (C->print_intrinsics() || C->print_inlining()) {
 387       C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual)" : "(intrinsic)");
 388     }
 389     C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked);
 390     if (C->log()) {
 391       C->log()->elem("intrinsic id='%s'%s nodes='%d'",
 392                      vmIntrinsics::name_at(intrinsic_id()),
 393                      (is_virtual() ? " virtual='1'" : ""),
 394                      C->unique() - nodes);
 395     }
 396     // Push the result from the inlined method onto the stack.
 397     kit.push_result();
 398     C->print_inlining_update(this);
 399     return kit.transfer_exceptions_into_jvms();
 400   }
 401 
 402   // The intrinsic bailed out
 403   if (C->print_intrinsics() || C->print_inlining()) {
 404     if (jvms->has_method()) {
 405       // Not a root compile.
 406       const char* msg;
 407       if (callee->intrinsic_candidate()) {
 408         msg = is_virtual() ? "failed to inline (intrinsic, virtual)" : "failed to inline (intrinsic)";
 409       } else {
 410         msg = is_virtual() ? "failed to inline (intrinsic, virtual), method not annotated"
 411                            : "failed to inline (intrinsic), method not annotated";
 412       }
 413       C->print_inlining(callee, jvms->depth() - 1, bci, msg);
 414     } else {
 415       // Root compile
 416       tty->print("Did not generate intrinsic %s%s at bci:%d in",
 417                vmIntrinsics::name_at(intrinsic_id()),
 418                (is_virtual() ? " (virtual)" : ""), bci);
 419     }
 420   }
 421   C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed);
 422   C->print_inlining_update(this);
 423   return NULL;
 424 }
 425 
 426 Node* LibraryIntrinsic::generate_predicate(JVMState* jvms, int predicate) {
 427   LibraryCallKit kit(jvms, this);
 428   Compile* C = kit.C;
 429   int nodes = C->unique();
 430   _last_predicate = predicate;
 431 #ifndef PRODUCT
 432   assert(is_predicated() && predicate < predicates_count(), "sanity");
 433   if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
 434     char buf[1000];
 435     const char* str = vmIntrinsics::short_name_as_C_string(intrinsic_id(), buf, sizeof(buf));
 436     tty->print_cr("Predicate for intrinsic %s", str);
 437   }
 438 #endif
 439   ciMethod* callee = kit.callee();
 440   const int bci    = kit.bci();
 441 
 442   Node* slow_ctl = kit.try_to_predicate(predicate);
 443   if (!kit.failing()) {
 444     if (C->print_intrinsics() || C->print_inlining()) {
 445       C->print_inlining(callee, jvms->depth() - 1, bci, is_virtual() ? "(intrinsic, virtual, predicate)" : "(intrinsic, predicate)");
 446     }
 447     C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_worked);
 448     if (C->log()) {
 449       C->log()->elem("predicate_intrinsic id='%s'%s nodes='%d'",
 450                      vmIntrinsics::name_at(intrinsic_id()),
 451                      (is_virtual() ? " virtual='1'" : ""),
 452                      C->unique() - nodes);
 453     }
 454     return slow_ctl; // Could be NULL if the check folds.
 455   }
 456 
 457   // The intrinsic bailed out
 458   if (C->print_intrinsics() || C->print_inlining()) {
 459     if (jvms->has_method()) {
 460       // Not a root compile.
 461       const char* msg = "failed to generate predicate for intrinsic";
 462       C->print_inlining(kit.callee(), jvms->depth() - 1, bci, msg);
 463     } else {
 464       // Root compile
 465       C->print_inlining_stream()->print("Did not generate predicate for intrinsic %s%s at bci:%d in",
 466                                         vmIntrinsics::name_at(intrinsic_id()),
 467                                         (is_virtual() ? " (virtual)" : ""), bci);
 468     }
 469   }
 470   C->gather_intrinsic_statistics(intrinsic_id(), is_virtual(), Compile::_intrinsic_failed);
 471   return NULL;
 472 }
 473 
 474 bool LibraryCallKit::try_to_inline(int predicate) {
 475   // Handle symbolic names for otherwise undistinguished boolean switches:
 476   const bool is_store       = true;
 477   const bool is_compress    = true;
 478   const bool is_static      = true;
 479   const bool is_volatile    = true;
 480 
 481   if (!jvms()->has_method()) {
 482     // Root JVMState has a null method.
 483     assert(map()->memory()->Opcode() == Op_Parm, "");
 484     // Insert the memory aliasing node
 485     set_all_memory(reset_memory());
 486   }
 487   assert(merged_memory(), "");
 488 
 489 
 490   switch (intrinsic_id()) {
 491   case vmIntrinsics::_hashCode:                 return inline_native_hashcode(intrinsic()->is_virtual(), !is_static);
 492   case vmIntrinsics::_identityHashCode:         return inline_native_hashcode(/*!virtual*/ false,         is_static);
 493   case vmIntrinsics::_getClass:                 return inline_native_getClass();
 494 
 495   case vmIntrinsics::_dsin:
 496   case vmIntrinsics::_dcos:
 497   case vmIntrinsics::_dtan:
 498   case vmIntrinsics::_dabs:
 499   case vmIntrinsics::_datan2:
 500   case vmIntrinsics::_dsqrt:
 501   case vmIntrinsics::_dexp:
 502   case vmIntrinsics::_dlog:
 503   case vmIntrinsics::_dlog10:
 504   case vmIntrinsics::_dpow:                     return inline_math_native(intrinsic_id());
 505 
 506   case vmIntrinsics::_min:
 507   case vmIntrinsics::_max:                      return inline_min_max(intrinsic_id());
 508 
 509   case vmIntrinsics::_notify:
 510   case vmIntrinsics::_notifyAll:
 511     if (InlineNotify) {
 512       return inline_notify(intrinsic_id());
 513     }
 514     return false;
 515 
 516   case vmIntrinsics::_addExactI:                return inline_math_addExactI(false /* add */);
 517   case vmIntrinsics::_addExactL:                return inline_math_addExactL(false /* add */);
 518   case vmIntrinsics::_decrementExactI:          return inline_math_subtractExactI(true /* decrement */);
 519   case vmIntrinsics::_decrementExactL:          return inline_math_subtractExactL(true /* decrement */);
 520   case vmIntrinsics::_incrementExactI:          return inline_math_addExactI(true /* increment */);
 521   case vmIntrinsics::_incrementExactL:          return inline_math_addExactL(true /* increment */);
 522   case vmIntrinsics::_multiplyExactI:           return inline_math_multiplyExactI();
 523   case vmIntrinsics::_multiplyExactL:           return inline_math_multiplyExactL();
 524   case vmIntrinsics::_negateExactI:             return inline_math_negateExactI();
 525   case vmIntrinsics::_negateExactL:             return inline_math_negateExactL();
 526   case vmIntrinsics::_subtractExactI:           return inline_math_subtractExactI(false /* subtract */);
 527   case vmIntrinsics::_subtractExactL:           return inline_math_subtractExactL(false /* subtract */);
 528 
 529   case vmIntrinsics::_arraycopy:                return inline_arraycopy();
 530 
 531   case vmIntrinsics::_compareToL:               return inline_string_compareTo(StrIntrinsicNode::LL);
 532   case vmIntrinsics::_compareToU:               return inline_string_compareTo(StrIntrinsicNode::UU);
 533   case vmIntrinsics::_compareToLU:              return inline_string_compareTo(StrIntrinsicNode::LU);
 534   case vmIntrinsics::_compareToUL:              return inline_string_compareTo(StrIntrinsicNode::UL);
 535 
 536   case vmIntrinsics::_indexOfL:                 return inline_string_indexOf(StrIntrinsicNode::LL);
 537   case vmIntrinsics::_indexOfU:                 return inline_string_indexOf(StrIntrinsicNode::UU);
 538   case vmIntrinsics::_indexOfUL:                return inline_string_indexOf(StrIntrinsicNode::UL);
 539   case vmIntrinsics::_indexOfIL:                return inline_string_indexOfI(StrIntrinsicNode::LL);
 540   case vmIntrinsics::_indexOfIU:                return inline_string_indexOfI(StrIntrinsicNode::UU);
 541   case vmIntrinsics::_indexOfIUL:               return inline_string_indexOfI(StrIntrinsicNode::UL);
 542   case vmIntrinsics::_indexOfU_char:            return inline_string_indexOfChar();
 543 
 544   case vmIntrinsics::_equalsL:                  return inline_string_equals(StrIntrinsicNode::LL);
 545   case vmIntrinsics::_equalsU:                  return inline_string_equals(StrIntrinsicNode::UU);
 546 
 547   case vmIntrinsics::_toBytesStringU:           return inline_string_toBytesU();
 548   case vmIntrinsics::_getCharsStringU:          return inline_string_getCharsU();
 549   case vmIntrinsics::_getCharStringU:           return inline_string_char_access(!is_store);
 550   case vmIntrinsics::_putCharStringU:           return inline_string_char_access( is_store);
 551 
 552   case vmIntrinsics::_compressStringC:
 553   case vmIntrinsics::_compressStringB:          return inline_string_copy( is_compress);
 554   case vmIntrinsics::_inflateStringC:
 555   case vmIntrinsics::_inflateStringB:           return inline_string_copy(!is_compress);
 556 
 557   case vmIntrinsics::_getObject:                return inline_unsafe_access(!is_store, T_OBJECT,   Relaxed, false);
 558   case vmIntrinsics::_getBoolean:               return inline_unsafe_access(!is_store, T_BOOLEAN,  Relaxed, false);
 559   case vmIntrinsics::_getByte:                  return inline_unsafe_access(!is_store, T_BYTE,     Relaxed, false);
 560   case vmIntrinsics::_getShort:                 return inline_unsafe_access(!is_store, T_SHORT,    Relaxed, false);
 561   case vmIntrinsics::_getChar:                  return inline_unsafe_access(!is_store, T_CHAR,     Relaxed, false);
 562   case vmIntrinsics::_getInt:                   return inline_unsafe_access(!is_store, T_INT,      Relaxed, false);
 563   case vmIntrinsics::_getLong:                  return inline_unsafe_access(!is_store, T_LONG,     Relaxed, false);
 564   case vmIntrinsics::_getFloat:                 return inline_unsafe_access(!is_store, T_FLOAT,    Relaxed, false);
 565   case vmIntrinsics::_getDouble:                return inline_unsafe_access(!is_store, T_DOUBLE,   Relaxed, false);
 566 
 567   case vmIntrinsics::_putObject:                return inline_unsafe_access( is_store, T_OBJECT,   Relaxed, false);
 568   case vmIntrinsics::_putBoolean:               return inline_unsafe_access( is_store, T_BOOLEAN,  Relaxed, false);
 569   case vmIntrinsics::_putByte:                  return inline_unsafe_access( is_store, T_BYTE,     Relaxed, false);
 570   case vmIntrinsics::_putShort:                 return inline_unsafe_access( is_store, T_SHORT,    Relaxed, false);
 571   case vmIntrinsics::_putChar:                  return inline_unsafe_access( is_store, T_CHAR,     Relaxed, false);
 572   case vmIntrinsics::_putInt:                   return inline_unsafe_access( is_store, T_INT,      Relaxed, false);
 573   case vmIntrinsics::_putLong:                  return inline_unsafe_access( is_store, T_LONG,     Relaxed, false);
 574   case vmIntrinsics::_putFloat:                 return inline_unsafe_access( is_store, T_FLOAT,    Relaxed, false);
 575   case vmIntrinsics::_putDouble:                return inline_unsafe_access( is_store, T_DOUBLE,   Relaxed, false);
 576 
 577   case vmIntrinsics::_getObjectVolatile:        return inline_unsafe_access(!is_store, T_OBJECT,   Volatile, false);
 578   case vmIntrinsics::_getBooleanVolatile:       return inline_unsafe_access(!is_store, T_BOOLEAN,  Volatile, false);
 579   case vmIntrinsics::_getByteVolatile:          return inline_unsafe_access(!is_store, T_BYTE,     Volatile, false);
 580   case vmIntrinsics::_getShortVolatile:         return inline_unsafe_access(!is_store, T_SHORT,    Volatile, false);
 581   case vmIntrinsics::_getCharVolatile:          return inline_unsafe_access(!is_store, T_CHAR,     Volatile, false);
 582   case vmIntrinsics::_getIntVolatile:           return inline_unsafe_access(!is_store, T_INT,      Volatile, false);
 583   case vmIntrinsics::_getLongVolatile:          return inline_unsafe_access(!is_store, T_LONG,     Volatile, false);
 584   case vmIntrinsics::_getFloatVolatile:         return inline_unsafe_access(!is_store, T_FLOAT,    Volatile, false);
 585   case vmIntrinsics::_getDoubleVolatile:        return inline_unsafe_access(!is_store, T_DOUBLE,   Volatile, false);
 586 
 587   case vmIntrinsics::_putObjectVolatile:        return inline_unsafe_access( is_store, T_OBJECT,   Volatile, false);
 588   case vmIntrinsics::_putBooleanVolatile:       return inline_unsafe_access( is_store, T_BOOLEAN,  Volatile, false);
 589   case vmIntrinsics::_putByteVolatile:          return inline_unsafe_access( is_store, T_BYTE,     Volatile, false);
 590   case vmIntrinsics::_putShortVolatile:         return inline_unsafe_access( is_store, T_SHORT,    Volatile, false);
 591   case vmIntrinsics::_putCharVolatile:          return inline_unsafe_access( is_store, T_CHAR,     Volatile, false);
 592   case vmIntrinsics::_putIntVolatile:           return inline_unsafe_access( is_store, T_INT,      Volatile, false);
 593   case vmIntrinsics::_putLongVolatile:          return inline_unsafe_access( is_store, T_LONG,     Volatile, false);
 594   case vmIntrinsics::_putFloatVolatile:         return inline_unsafe_access( is_store, T_FLOAT,    Volatile, false);
 595   case vmIntrinsics::_putDoubleVolatile:        return inline_unsafe_access( is_store, T_DOUBLE,   Volatile, false);
 596 
 597   case vmIntrinsics::_getShortUnaligned:        return inline_unsafe_access(!is_store, T_SHORT,    Relaxed, true);
 598   case vmIntrinsics::_getCharUnaligned:         return inline_unsafe_access(!is_store, T_CHAR,     Relaxed, true);
 599   case vmIntrinsics::_getIntUnaligned:          return inline_unsafe_access(!is_store, T_INT,      Relaxed, true);
 600   case vmIntrinsics::_getLongUnaligned:         return inline_unsafe_access(!is_store, T_LONG,     Relaxed, true);
 601 
 602   case vmIntrinsics::_putShortUnaligned:        return inline_unsafe_access( is_store, T_SHORT,    Relaxed, true);
 603   case vmIntrinsics::_putCharUnaligned:         return inline_unsafe_access( is_store, T_CHAR,     Relaxed, true);
 604   case vmIntrinsics::_putIntUnaligned:          return inline_unsafe_access( is_store, T_INT,      Relaxed, true);
 605   case vmIntrinsics::_putLongUnaligned:         return inline_unsafe_access( is_store, T_LONG,     Relaxed, true);
 606 
 607   case vmIntrinsics::_getObjectAcquire:         return inline_unsafe_access(!is_store, T_OBJECT,   Acquire, false);
 608   case vmIntrinsics::_getBooleanAcquire:        return inline_unsafe_access(!is_store, T_BOOLEAN,  Acquire, false);
 609   case vmIntrinsics::_getByteAcquire:           return inline_unsafe_access(!is_store, T_BYTE,     Acquire, false);
 610   case vmIntrinsics::_getShortAcquire:          return inline_unsafe_access(!is_store, T_SHORT,    Acquire, false);
 611   case vmIntrinsics::_getCharAcquire:           return inline_unsafe_access(!is_store, T_CHAR,     Acquire, false);
 612   case vmIntrinsics::_getIntAcquire:            return inline_unsafe_access(!is_store, T_INT,      Acquire, false);
 613   case vmIntrinsics::_getLongAcquire:           return inline_unsafe_access(!is_store, T_LONG,     Acquire, false);
 614   case vmIntrinsics::_getFloatAcquire:          return inline_unsafe_access(!is_store, T_FLOAT,    Acquire, false);
 615   case vmIntrinsics::_getDoubleAcquire:         return inline_unsafe_access(!is_store, T_DOUBLE,   Acquire, false);
 616 
 617   case vmIntrinsics::_putObjectRelease:         return inline_unsafe_access( is_store, T_OBJECT,   Release, false);
 618   case vmIntrinsics::_putBooleanRelease:        return inline_unsafe_access( is_store, T_BOOLEAN,  Release, false);
 619   case vmIntrinsics::_putByteRelease:           return inline_unsafe_access( is_store, T_BYTE,     Release, false);
 620   case vmIntrinsics::_putShortRelease:          return inline_unsafe_access( is_store, T_SHORT,    Release, false);
 621   case vmIntrinsics::_putCharRelease:           return inline_unsafe_access( is_store, T_CHAR,     Release, false);
 622   case vmIntrinsics::_putIntRelease:            return inline_unsafe_access( is_store, T_INT,      Release, false);
 623   case vmIntrinsics::_putLongRelease:           return inline_unsafe_access( is_store, T_LONG,     Release, false);
 624   case vmIntrinsics::_putFloatRelease:          return inline_unsafe_access( is_store, T_FLOAT,    Release, false);
 625   case vmIntrinsics::_putDoubleRelease:         return inline_unsafe_access( is_store, T_DOUBLE,   Release, false);
 626 
 627   case vmIntrinsics::_getObjectOpaque:          return inline_unsafe_access(!is_store, T_OBJECT,   Opaque, false);
 628   case vmIntrinsics::_getBooleanOpaque:         return inline_unsafe_access(!is_store, T_BOOLEAN,  Opaque, false);
 629   case vmIntrinsics::_getByteOpaque:            return inline_unsafe_access(!is_store, T_BYTE,     Opaque, false);
 630   case vmIntrinsics::_getShortOpaque:           return inline_unsafe_access(!is_store, T_SHORT,    Opaque, false);
 631   case vmIntrinsics::_getCharOpaque:            return inline_unsafe_access(!is_store, T_CHAR,     Opaque, false);
 632   case vmIntrinsics::_getIntOpaque:             return inline_unsafe_access(!is_store, T_INT,      Opaque, false);
 633   case vmIntrinsics::_getLongOpaque:            return inline_unsafe_access(!is_store, T_LONG,     Opaque, false);
 634   case vmIntrinsics::_getFloatOpaque:           return inline_unsafe_access(!is_store, T_FLOAT,    Opaque, false);
 635   case vmIntrinsics::_getDoubleOpaque:          return inline_unsafe_access(!is_store, T_DOUBLE,   Opaque, false);
 636 
 637   case vmIntrinsics::_putObjectOpaque:          return inline_unsafe_access( is_store, T_OBJECT,   Opaque, false);
 638   case vmIntrinsics::_putBooleanOpaque:         return inline_unsafe_access( is_store, T_BOOLEAN,  Opaque, false);
 639   case vmIntrinsics::_putByteOpaque:            return inline_unsafe_access( is_store, T_BYTE,     Opaque, false);
 640   case vmIntrinsics::_putShortOpaque:           return inline_unsafe_access( is_store, T_SHORT,    Opaque, false);
 641   case vmIntrinsics::_putCharOpaque:            return inline_unsafe_access( is_store, T_CHAR,     Opaque, false);
 642   case vmIntrinsics::_putIntOpaque:             return inline_unsafe_access( is_store, T_INT,      Opaque, false);
 643   case vmIntrinsics::_putLongOpaque:            return inline_unsafe_access( is_store, T_LONG,     Opaque, false);
 644   case vmIntrinsics::_putFloatOpaque:           return inline_unsafe_access( is_store, T_FLOAT,    Opaque, false);
 645   case vmIntrinsics::_putDoubleOpaque:          return inline_unsafe_access( is_store, T_DOUBLE,   Opaque, false);
 646 
 647   case vmIntrinsics::_compareAndSwapObject:             return inline_unsafe_load_store(T_OBJECT, LS_cmp_swap,      Volatile);
 648   case vmIntrinsics::_compareAndSwapByte:               return inline_unsafe_load_store(T_BYTE,   LS_cmp_swap,      Volatile);
 649   case vmIntrinsics::_compareAndSwapShort:              return inline_unsafe_load_store(T_SHORT,  LS_cmp_swap,      Volatile);
 650   case vmIntrinsics::_compareAndSwapInt:                return inline_unsafe_load_store(T_INT,    LS_cmp_swap,      Volatile);
 651   case vmIntrinsics::_compareAndSwapLong:               return inline_unsafe_load_store(T_LONG,   LS_cmp_swap,      Volatile);
 652 
 653   case vmIntrinsics::_weakCompareAndSwapObject:         return inline_unsafe_load_store(T_OBJECT, LS_cmp_swap_weak, Relaxed);
 654   case vmIntrinsics::_weakCompareAndSwapObjectAcquire:  return inline_unsafe_load_store(T_OBJECT, LS_cmp_swap_weak, Acquire);
 655   case vmIntrinsics::_weakCompareAndSwapObjectRelease:  return inline_unsafe_load_store(T_OBJECT, LS_cmp_swap_weak, Release);
 656   case vmIntrinsics::_weakCompareAndSwapObjectVolatile: return inline_unsafe_load_store(T_OBJECT, LS_cmp_swap_weak, Volatile);
 657   case vmIntrinsics::_weakCompareAndSwapByte:           return inline_unsafe_load_store(T_BYTE,   LS_cmp_swap_weak, Relaxed);
 658   case vmIntrinsics::_weakCompareAndSwapByteAcquire:    return inline_unsafe_load_store(T_BYTE,   LS_cmp_swap_weak, Acquire);
 659   case vmIntrinsics::_weakCompareAndSwapByteRelease:    return inline_unsafe_load_store(T_BYTE,   LS_cmp_swap_weak, Release);
 660   case vmIntrinsics::_weakCompareAndSwapByteVolatile:   return inline_unsafe_load_store(T_BYTE,   LS_cmp_swap_weak, Volatile);
 661   case vmIntrinsics::_weakCompareAndSwapShort:          return inline_unsafe_load_store(T_SHORT,  LS_cmp_swap_weak, Relaxed);
 662   case vmIntrinsics::_weakCompareAndSwapShortAcquire:   return inline_unsafe_load_store(T_SHORT,  LS_cmp_swap_weak, Acquire);
 663   case vmIntrinsics::_weakCompareAndSwapShortRelease:   return inline_unsafe_load_store(T_SHORT,  LS_cmp_swap_weak, Release);
 664   case vmIntrinsics::_weakCompareAndSwapShortVolatile:  return inline_unsafe_load_store(T_SHORT,  LS_cmp_swap_weak, Volatile);
 665   case vmIntrinsics::_weakCompareAndSwapInt:            return inline_unsafe_load_store(T_INT,    LS_cmp_swap_weak, Relaxed);
 666   case vmIntrinsics::_weakCompareAndSwapIntAcquire:     return inline_unsafe_load_store(T_INT,    LS_cmp_swap_weak, Acquire);
 667   case vmIntrinsics::_weakCompareAndSwapIntRelease:     return inline_unsafe_load_store(T_INT,    LS_cmp_swap_weak, Release);
 668   case vmIntrinsics::_weakCompareAndSwapIntVolatile:    return inline_unsafe_load_store(T_INT,    LS_cmp_swap_weak, Volatile);
 669   case vmIntrinsics::_weakCompareAndSwapLong:           return inline_unsafe_load_store(T_LONG,   LS_cmp_swap_weak, Relaxed);
 670   case vmIntrinsics::_weakCompareAndSwapLongAcquire:    return inline_unsafe_load_store(T_LONG,   LS_cmp_swap_weak, Acquire);
 671   case vmIntrinsics::_weakCompareAndSwapLongRelease:    return inline_unsafe_load_store(T_LONG,   LS_cmp_swap_weak, Release);
 672   case vmIntrinsics::_weakCompareAndSwapLongVolatile:   return inline_unsafe_load_store(T_LONG,   LS_cmp_swap_weak, Volatile);
 673 
 674   case vmIntrinsics::_compareAndExchangeObjectVolatile: return inline_unsafe_load_store(T_OBJECT, LS_cmp_exchange,  Volatile);
 675   case vmIntrinsics::_compareAndExchangeObjectAcquire:  return inline_unsafe_load_store(T_OBJECT, LS_cmp_exchange,  Acquire);
 676   case vmIntrinsics::_compareAndExchangeObjectRelease:  return inline_unsafe_load_store(T_OBJECT, LS_cmp_exchange,  Release);
 677   case vmIntrinsics::_compareAndExchangeByteVolatile:   return inline_unsafe_load_store(T_BYTE,   LS_cmp_exchange,  Volatile);
 678   case vmIntrinsics::_compareAndExchangeByteAcquire:    return inline_unsafe_load_store(T_BYTE,   LS_cmp_exchange,  Acquire);
 679   case vmIntrinsics::_compareAndExchangeByteRelease:    return inline_unsafe_load_store(T_BYTE,   LS_cmp_exchange,  Release);
 680   case vmIntrinsics::_compareAndExchangeShortVolatile:  return inline_unsafe_load_store(T_SHORT,  LS_cmp_exchange,  Volatile);
 681   case vmIntrinsics::_compareAndExchangeShortAcquire:   return inline_unsafe_load_store(T_SHORT,  LS_cmp_exchange,  Acquire);
 682   case vmIntrinsics::_compareAndExchangeShortRelease:   return inline_unsafe_load_store(T_SHORT,  LS_cmp_exchange,  Release);
 683   case vmIntrinsics::_compareAndExchangeIntVolatile:    return inline_unsafe_load_store(T_INT,    LS_cmp_exchange,  Volatile);
 684   case vmIntrinsics::_compareAndExchangeIntAcquire:     return inline_unsafe_load_store(T_INT,    LS_cmp_exchange,  Acquire);
 685   case vmIntrinsics::_compareAndExchangeIntRelease:     return inline_unsafe_load_store(T_INT,    LS_cmp_exchange,  Release);
 686   case vmIntrinsics::_compareAndExchangeLongVolatile:   return inline_unsafe_load_store(T_LONG,   LS_cmp_exchange,  Volatile);
 687   case vmIntrinsics::_compareAndExchangeLongAcquire:    return inline_unsafe_load_store(T_LONG,   LS_cmp_exchange,  Acquire);
 688   case vmIntrinsics::_compareAndExchangeLongRelease:    return inline_unsafe_load_store(T_LONG,   LS_cmp_exchange,  Release);
 689 
 690   case vmIntrinsics::_getAndAddByte:                    return inline_unsafe_load_store(T_BYTE,   LS_get_add,       Volatile);
 691   case vmIntrinsics::_getAndAddShort:                   return inline_unsafe_load_store(T_SHORT,  LS_get_add,       Volatile);
 692   case vmIntrinsics::_getAndAddInt:                     return inline_unsafe_load_store(T_INT,    LS_get_add,       Volatile);
 693   case vmIntrinsics::_getAndAddLong:                    return inline_unsafe_load_store(T_LONG,   LS_get_add,       Volatile);
 694 
 695   case vmIntrinsics::_getAndSetByte:                    return inline_unsafe_load_store(T_BYTE,   LS_get_set,       Volatile);
 696   case vmIntrinsics::_getAndSetShort:                   return inline_unsafe_load_store(T_SHORT,  LS_get_set,       Volatile);
 697   case vmIntrinsics::_getAndSetInt:                     return inline_unsafe_load_store(T_INT,    LS_get_set,       Volatile);
 698   case vmIntrinsics::_getAndSetLong:                    return inline_unsafe_load_store(T_LONG,   LS_get_set,       Volatile);
 699   case vmIntrinsics::_getAndSetObject:                  return inline_unsafe_load_store(T_OBJECT, LS_get_set,       Volatile);
 700 
 701   case vmIntrinsics::_loadFence:
 702   case vmIntrinsics::_storeFence:
 703   case vmIntrinsics::_fullFence:                return inline_unsafe_fence(intrinsic_id());
 704 
 705   case vmIntrinsics::_onSpinWait:               return inline_onspinwait();
 706 
 707   case vmIntrinsics::_currentThread:            return inline_native_currentThread();
 708   case vmIntrinsics::_isInterrupted:            return inline_native_isInterrupted();
 709 
 710 #ifdef TRACE_HAVE_INTRINSICS
 711   case vmIntrinsics::_counterTime:              return inline_native_time_funcs(CAST_FROM_FN_PTR(address, TRACE_TIME_METHOD), "counterTime");
 712 #endif
 713   case vmIntrinsics::_currentTimeMillis:        return inline_native_time_funcs(CAST_FROM_FN_PTR(address, os::javaTimeMillis), "currentTimeMillis");
 714   case vmIntrinsics::_nanoTime:                 return inline_native_time_funcs(CAST_FROM_FN_PTR(address, os::javaTimeNanos), "nanoTime");
 715   case vmIntrinsics::_allocateInstance:         return inline_unsafe_allocate();
 716   case vmIntrinsics::_copyMemory:               return inline_unsafe_copyMemory();
 717   case vmIntrinsics::_getLength:                return inline_native_getLength();
 718   case vmIntrinsics::_copyOf:                   return inline_array_copyOf(false);
 719   case vmIntrinsics::_copyOfRange:              return inline_array_copyOf(true);
 720   case vmIntrinsics::_equalsB:                  return inline_array_equals(StrIntrinsicNode::LL);
 721   case vmIntrinsics::_equalsC:                  return inline_array_equals(StrIntrinsicNode::UU);
 722   case vmIntrinsics::_Preconditions_checkIndex: return inline_preconditions_checkIndex();
 723   case vmIntrinsics::_clone:                    return inline_native_clone(intrinsic()->is_virtual());
 724 
 725   case vmIntrinsics::_allocateUninitializedArray: return inline_unsafe_newArray(true);
 726   case vmIntrinsics::_newArray:                   return inline_unsafe_newArray(false);
 727 
 728   case vmIntrinsics::_isAssignableFrom:         return inline_native_subtype_check();
 729 
 730   case vmIntrinsics::_isInstance:
 731   case vmIntrinsics::_getModifiers:
 732   case vmIntrinsics::_isInterface:
 733   case vmIntrinsics::_isArray:
 734   case vmIntrinsics::_isPrimitive:
 735   case vmIntrinsics::_getSuperclass:
 736   case vmIntrinsics::_getClassAccessFlags:      return inline_native_Class_query(intrinsic_id());
 737 
 738   case vmIntrinsics::_floatToRawIntBits:
 739   case vmIntrinsics::_floatToIntBits:
 740   case vmIntrinsics::_intBitsToFloat:
 741   case vmIntrinsics::_doubleToRawLongBits:
 742   case vmIntrinsics::_doubleToLongBits:
 743   case vmIntrinsics::_longBitsToDouble:         return inline_fp_conversions(intrinsic_id());
 744 
 745   case vmIntrinsics::_numberOfLeadingZeros_i:
 746   case vmIntrinsics::_numberOfLeadingZeros_l:
 747   case vmIntrinsics::_numberOfTrailingZeros_i:
 748   case vmIntrinsics::_numberOfTrailingZeros_l:
 749   case vmIntrinsics::_bitCount_i:
 750   case vmIntrinsics::_bitCount_l:
 751   case vmIntrinsics::_reverseBytes_i:
 752   case vmIntrinsics::_reverseBytes_l:
 753   case vmIntrinsics::_reverseBytes_s:
 754   case vmIntrinsics::_reverseBytes_c:           return inline_number_methods(intrinsic_id());
 755 
 756   case vmIntrinsics::_getCallerClass:           return inline_native_Reflection_getCallerClass();
 757 
 758   case vmIntrinsics::_Reference_get:            return inline_reference_get();
 759 
 760   case vmIntrinsics::_Class_cast:               return inline_Class_cast();
 761 
 762   case vmIntrinsics::_aescrypt_encryptBlock:
 763   case vmIntrinsics::_aescrypt_decryptBlock:    return inline_aescrypt_Block(intrinsic_id());
 764 
 765   case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
 766   case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
 767     return inline_cipherBlockChaining_AESCrypt(intrinsic_id());
 768 
 769   case vmIntrinsics::_counterMode_AESCrypt:
 770     return inline_counterMode_AESCrypt(intrinsic_id());
 771 
 772   case vmIntrinsics::_sha_implCompress:
 773   case vmIntrinsics::_sha2_implCompress:
 774   case vmIntrinsics::_sha5_implCompress:
 775     return inline_sha_implCompress(intrinsic_id());
 776 
 777   case vmIntrinsics::_digestBase_implCompressMB:
 778     return inline_digestBase_implCompressMB(predicate);
 779 
 780   case vmIntrinsics::_multiplyToLen:
 781     return inline_multiplyToLen();
 782 
 783   case vmIntrinsics::_squareToLen:
 784     return inline_squareToLen();
 785 
 786   case vmIntrinsics::_mulAdd:
 787     return inline_mulAdd();
 788 
 789   case vmIntrinsics::_montgomeryMultiply:
 790     return inline_montgomeryMultiply();
 791   case vmIntrinsics::_montgomerySquare:
 792     return inline_montgomerySquare();
 793 
 794   case vmIntrinsics::_vectorizedMismatch:
 795     return inline_vectorizedMismatch();
 796 
 797   case vmIntrinsics::_ghash_processBlocks:
 798     return inline_ghash_processBlocks();
 799 
 800   case vmIntrinsics::_encodeISOArray:
 801   case vmIntrinsics::_encodeByteISOArray:
 802     return inline_encodeISOArray();
 803 
 804   case vmIntrinsics::_updateCRC32:
 805     return inline_updateCRC32();
 806   case vmIntrinsics::_updateBytesCRC32:
 807     return inline_updateBytesCRC32();
 808   case vmIntrinsics::_updateByteBufferCRC32:
 809     return inline_updateByteBufferCRC32();
 810 
 811   case vmIntrinsics::_updateBytesCRC32C:
 812     return inline_updateBytesCRC32C();
 813   case vmIntrinsics::_updateDirectByteBufferCRC32C:
 814     return inline_updateDirectByteBufferCRC32C();
 815 
 816   case vmIntrinsics::_updateBytesAdler32:
 817     return inline_updateBytesAdler32();
 818   case vmIntrinsics::_updateByteBufferAdler32:
 819     return inline_updateByteBufferAdler32();
 820 
 821   case vmIntrinsics::_profileBoolean:
 822     return inline_profileBoolean();
 823   case vmIntrinsics::_isCompileConstant:
 824     return inline_isCompileConstant();
 825 
 826   case vmIntrinsics::_hasNegatives:
 827     return inline_hasNegatives();
 828 
 829   default:
 830     // If you get here, it may be that someone has added a new intrinsic
 831     // to the list in vmSymbols.hpp without implementing it here.
 832 #ifndef PRODUCT
 833     if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) {
 834       tty->print_cr("*** Warning: Unimplemented intrinsic %s(%d)",
 835                     vmIntrinsics::name_at(intrinsic_id()), intrinsic_id());
 836     }
 837 #endif
 838     return false;
 839   }
 840 }
 841 
 842 Node* LibraryCallKit::try_to_predicate(int predicate) {
 843   if (!jvms()->has_method()) {
 844     // Root JVMState has a null method.
 845     assert(map()->memory()->Opcode() == Op_Parm, "");
 846     // Insert the memory aliasing node
 847     set_all_memory(reset_memory());
 848   }
 849   assert(merged_memory(), "");
 850 
 851   switch (intrinsic_id()) {
 852   case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
 853     return inline_cipherBlockChaining_AESCrypt_predicate(false);
 854   case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
 855     return inline_cipherBlockChaining_AESCrypt_predicate(true);
 856   case vmIntrinsics::_counterMode_AESCrypt:
 857     return inline_counterMode_AESCrypt_predicate();
 858   case vmIntrinsics::_digestBase_implCompressMB:
 859     return inline_digestBase_implCompressMB_predicate(predicate);
 860 
 861   default:
 862     // If you get here, it may be that someone has added a new intrinsic
 863     // to the list in vmSymbols.hpp without implementing it here.
 864 #ifndef PRODUCT
 865     if ((PrintMiscellaneous && (Verbose || WizardMode)) || PrintOpto) {
 866       tty->print_cr("*** Warning: Unimplemented predicate for intrinsic %s(%d)",
 867                     vmIntrinsics::name_at(intrinsic_id()), intrinsic_id());
 868     }
 869 #endif
 870     Node* slow_ctl = control();
 871     set_control(top()); // No fast path instrinsic
 872     return slow_ctl;
 873   }
 874 }
 875 
 876 //------------------------------set_result-------------------------------
 877 // Helper function for finishing intrinsics.
 878 void LibraryCallKit::set_result(RegionNode* region, PhiNode* value) {
 879   record_for_igvn(region);
 880   set_control(_gvn.transform(region));
 881   set_result( _gvn.transform(value));
 882   assert(value->type()->basic_type() == result()->bottom_type()->basic_type(), "sanity");
 883 }
 884 
 885 //------------------------------generate_guard---------------------------
 886 // Helper function for generating guarded fast-slow graph structures.
 887 // The given 'test', if true, guards a slow path.  If the test fails
 888 // then a fast path can be taken.  (We generally hope it fails.)
 889 // In all cases, GraphKit::control() is updated to the fast path.
 890 // The returned value represents the control for the slow path.
 891 // The return value is never 'top'; it is either a valid control
 892 // or NULL if it is obvious that the slow path can never be taken.
 893 // Also, if region and the slow control are not NULL, the slow edge
 894 // is appended to the region.
 895 Node* LibraryCallKit::generate_guard(Node* test, RegionNode* region, float true_prob) {
 896   if (stopped()) {
 897     // Already short circuited.
 898     return NULL;
 899   }
 900 
 901   // Build an if node and its projections.
 902   // If test is true we take the slow path, which we assume is uncommon.
 903   if (_gvn.type(test) == TypeInt::ZERO) {
 904     // The slow branch is never taken.  No need to build this guard.
 905     return NULL;
 906   }
 907 
 908   IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN);
 909 
 910   Node* if_slow = _gvn.transform(new IfTrueNode(iff));
 911   if (if_slow == top()) {
 912     // The slow branch is never taken.  No need to build this guard.
 913     return NULL;
 914   }
 915 
 916   if (region != NULL)
 917     region->add_req(if_slow);
 918 
 919   Node* if_fast = _gvn.transform(new IfFalseNode(iff));
 920   set_control(if_fast);
 921 
 922   return if_slow;
 923 }
 924 
 925 inline Node* LibraryCallKit::generate_slow_guard(Node* test, RegionNode* region) {
 926   return generate_guard(test, region, PROB_UNLIKELY_MAG(3));
 927 }
 928 inline Node* LibraryCallKit::generate_fair_guard(Node* test, RegionNode* region) {
 929   return generate_guard(test, region, PROB_FAIR);
 930 }
 931 
 932 inline Node* LibraryCallKit::generate_negative_guard(Node* index, RegionNode* region,
 933                                                      Node* *pos_index) {
 934   if (stopped())
 935     return NULL;                // already stopped
 936   if (_gvn.type(index)->higher_equal(TypeInt::POS)) // [0,maxint]
 937     return NULL;                // index is already adequately typed
 938   Node* cmp_lt = _gvn.transform(new CmpINode(index, intcon(0)));
 939   Node* bol_lt = _gvn.transform(new BoolNode(cmp_lt, BoolTest::lt));
 940   Node* is_neg = generate_guard(bol_lt, region, PROB_MIN);
 941   if (is_neg != NULL && pos_index != NULL) {
 942     // Emulate effect of Parse::adjust_map_after_if.
 943     Node* ccast = new CastIINode(index, TypeInt::POS);
 944     ccast->set_req(0, control());
 945     (*pos_index) = _gvn.transform(ccast);
 946   }
 947   return is_neg;
 948 }
 949 
 950 // Make sure that 'position' is a valid limit index, in [0..length].
 951 // There are two equivalent plans for checking this:
 952 //   A. (offset + copyLength)  unsigned<=  arrayLength
 953 //   B. offset  <=  (arrayLength - copyLength)
 954 // We require that all of the values above, except for the sum and
 955 // difference, are already known to be non-negative.
 956 // Plan A is robust in the face of overflow, if offset and copyLength
 957 // are both hugely positive.
 958 //
 959 // Plan B is less direct and intuitive, but it does not overflow at
 960 // all, since the difference of two non-negatives is always
 961 // representable.  Whenever Java methods must perform the equivalent
 962 // check they generally use Plan B instead of Plan A.
 963 // For the moment we use Plan A.
 964 inline Node* LibraryCallKit::generate_limit_guard(Node* offset,
 965                                                   Node* subseq_length,
 966                                                   Node* array_length,
 967                                                   RegionNode* region) {
 968   if (stopped())
 969     return NULL;                // already stopped
 970   bool zero_offset = _gvn.type(offset) == TypeInt::ZERO;
 971   if (zero_offset && subseq_length->eqv_uncast(array_length))
 972     return NULL;                // common case of whole-array copy
 973   Node* last = subseq_length;
 974   if (!zero_offset)             // last += offset
 975     last = _gvn.transform(new AddINode(last, offset));
 976   Node* cmp_lt = _gvn.transform(new CmpUNode(array_length, last));
 977   Node* bol_lt = _gvn.transform(new BoolNode(cmp_lt, BoolTest::lt));
 978   Node* is_over = generate_guard(bol_lt, region, PROB_MIN);
 979   return is_over;
 980 }
 981 
 982 // Emit range checks for the given String.value byte array
 983 void LibraryCallKit::generate_string_range_check(Node* array, Node* offset, Node* count, bool char_count) {
 984   if (stopped()) {
 985     return; // already stopped
 986   }
 987   RegionNode* bailout = new RegionNode(1);
 988   record_for_igvn(bailout);
 989   if (char_count) {
 990     // Convert char count to byte count
 991     count = _gvn.transform(new LShiftINode(count, intcon(1)));
 992   }
 993 
 994   // Offset and count must not be negative
 995   generate_negative_guard(offset, bailout);
 996   generate_negative_guard(count, bailout);
 997   // Offset + count must not exceed length of array
 998   generate_limit_guard(offset, count, load_array_length(array), bailout);
 999 
1000   if (bailout->req() > 1) {
1001     PreserveJVMState pjvms(this);
1002     set_control(_gvn.transform(bailout));
1003     uncommon_trap(Deoptimization::Reason_intrinsic,
1004                   Deoptimization::Action_maybe_recompile);
1005   }
1006 }
1007 
1008 //--------------------------generate_current_thread--------------------
1009 Node* LibraryCallKit::generate_current_thread(Node* &tls_output) {
1010   ciKlass*    thread_klass = env()->Thread_klass();
1011   const Type* thread_type  = TypeOopPtr::make_from_klass(thread_klass)->cast_to_ptr_type(TypePtr::NotNull);
1012   Node* thread = _gvn.transform(new ThreadLocalNode());
1013   Node* p = basic_plus_adr(top()/*!oop*/, thread, in_bytes(JavaThread::threadObj_offset()));
1014   Node* threadObj = make_load(NULL, p, thread_type, T_OBJECT, MemNode::unordered);
1015   tls_output = thread;
1016   return threadObj;
1017 }
1018 
1019 
1020 //------------------------------make_string_method_node------------------------
1021 // Helper method for String intrinsic functions. This version is called with
1022 // str1 and str2 pointing to byte[] nodes containing Latin1 or UTF16 encoded
1023 // characters (depending on 'is_byte'). cnt1 and cnt2 are pointing to Int nodes
1024 // containing the lengths of str1 and str2.
1025 Node* LibraryCallKit::make_string_method_node(int opcode, Node* str1_start, Node* cnt1, Node* str2_start, Node* cnt2, StrIntrinsicNode::ArgEnc ae) {
1026   Node* result = NULL;
1027   switch (opcode) {
1028   case Op_StrIndexOf:
1029     result = new StrIndexOfNode(control(), memory(TypeAryPtr::BYTES),
1030                                 str1_start, cnt1, str2_start, cnt2, ae);
1031     break;
1032   case Op_StrComp:
1033     result = new StrCompNode(control(), memory(TypeAryPtr::BYTES),
1034                              str1_start, cnt1, str2_start, cnt2, ae);
1035     break;
1036   case Op_StrEquals:
1037     // We already know that cnt1 == cnt2 here (checked in 'inline_string_equals').
1038     // Use the constant length if there is one because optimized match rule may exist.
1039     result = new StrEqualsNode(control(), memory(TypeAryPtr::BYTES),
1040                                str1_start, str2_start, cnt2->is_Con() ? cnt2 : cnt1, ae);
1041     break;
1042   default:
1043     ShouldNotReachHere();
1044     return NULL;
1045   }
1046 
1047   // All these intrinsics have checks.
1048   C->set_has_split_ifs(true); // Has chance for split-if optimization
1049 
1050   return _gvn.transform(result);
1051 }
1052 
1053 //------------------------------inline_string_compareTo------------------------
1054 bool LibraryCallKit::inline_string_compareTo(StrIntrinsicNode::ArgEnc ae) {
1055   Node* arg1 = argument(0);
1056   Node* arg2 = argument(1);
1057 
1058   // Get start addr and length of first argument
1059   Node* arg1_start  = array_element_address(arg1, intcon(0), T_BYTE);
1060   Node* arg1_cnt    = load_array_length(arg1);
1061 
1062   // Get start addr and length of second argument
1063   Node* arg2_start  = array_element_address(arg2, intcon(0), T_BYTE);
1064   Node* arg2_cnt    = load_array_length(arg2);
1065 
1066   Node* result = make_string_method_node(Op_StrComp, arg1_start, arg1_cnt, arg2_start, arg2_cnt, ae);
1067   set_result(result);
1068   return true;
1069 }
1070 
1071 //------------------------------inline_string_equals------------------------
1072 bool LibraryCallKit::inline_string_equals(StrIntrinsicNode::ArgEnc ae) {
1073   Node* arg1 = argument(0);
1074   Node* arg2 = argument(1);
1075 
1076   // paths (plus control) merge
1077   RegionNode* region = new RegionNode(3);
1078   Node* phi = new PhiNode(region, TypeInt::BOOL);
1079 
1080   if (!stopped()) {
1081     // Get start addr and length of first argument
1082     Node* arg1_start  = array_element_address(arg1, intcon(0), T_BYTE);
1083     Node* arg1_cnt    = load_array_length(arg1);
1084 
1085     // Get start addr and length of second argument
1086     Node* arg2_start  = array_element_address(arg2, intcon(0), T_BYTE);
1087     Node* arg2_cnt    = load_array_length(arg2);
1088 
1089     // Check for arg1_cnt != arg2_cnt
1090     Node* cmp = _gvn.transform(new CmpINode(arg1_cnt, arg2_cnt));
1091     Node* bol = _gvn.transform(new BoolNode(cmp, BoolTest::ne));
1092     Node* if_ne = generate_slow_guard(bol, NULL);
1093     if (if_ne != NULL) {
1094       phi->init_req(2, intcon(0));
1095       region->init_req(2, if_ne);
1096     }
1097 
1098     // Check for count == 0 is done by assembler code for StrEquals.
1099 
1100     if (!stopped()) {
1101       Node* equals = make_string_method_node(Op_StrEquals, arg1_start, arg1_cnt, arg2_start, arg2_cnt, ae);
1102       phi->init_req(1, equals);
1103       region->init_req(1, control());
1104     }
1105   }
1106 
1107   // post merge
1108   set_control(_gvn.transform(region));
1109   record_for_igvn(region);
1110 
1111   set_result(_gvn.transform(phi));
1112   return true;
1113 }
1114 
1115 //------------------------------inline_array_equals----------------------------
1116 bool LibraryCallKit::inline_array_equals(StrIntrinsicNode::ArgEnc ae) {
1117   assert(ae == StrIntrinsicNode::UU || ae == StrIntrinsicNode::LL, "unsupported array types");
1118   Node* arg1 = argument(0);
1119   Node* arg2 = argument(1);
1120 
1121   const TypeAryPtr* mtype = (ae == StrIntrinsicNode::UU) ? TypeAryPtr::CHARS : TypeAryPtr::BYTES;
1122   set_result(_gvn.transform(new AryEqNode(control(), memory(mtype), arg1, arg2, ae)));
1123   return true;
1124 }
1125 
1126 //------------------------------inline_hasNegatives------------------------------
1127 bool LibraryCallKit::inline_hasNegatives() {
1128   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
1129     return false;
1130   }
1131 
1132   assert(callee()->signature()->size() == 3, "hasNegatives has 3 parameters");
1133   // no receiver since it is static method
1134   Node* ba         = argument(0);
1135   Node* offset     = argument(1);
1136   Node* len        = argument(2);
1137 
1138   // Range checks
1139   generate_string_range_check(ba, offset, len, false);
1140   if (stopped()) {
1141     return true;
1142   }
1143   Node* ba_start = array_element_address(ba, offset, T_BYTE);
1144   Node* result = new HasNegativesNode(control(), memory(TypeAryPtr::BYTES), ba_start, len);
1145   set_result(_gvn.transform(result));
1146   return true;
1147 }
1148 
1149 bool LibraryCallKit::inline_preconditions_checkIndex() {
1150   Node* index = argument(0);
1151   Node* length = argument(1);
1152   if (too_many_traps(Deoptimization::Reason_intrinsic) || too_many_traps(Deoptimization::Reason_range_check)) {
1153     return false;
1154   }
1155 
1156   Node* len_pos_cmp = _gvn.transform(new CmpINode(length, intcon(0)));
1157   Node* len_pos_bol = _gvn.transform(new BoolNode(len_pos_cmp, BoolTest::ge));
1158 
1159   {
1160     BuildCutout unless(this, len_pos_bol, PROB_MAX);
1161     uncommon_trap(Deoptimization::Reason_intrinsic,
1162                   Deoptimization::Action_make_not_entrant);
1163   }
1164 
1165   if (stopped()) {
1166     return false;
1167   }
1168 
1169   Node* rc_cmp = _gvn.transform(new CmpUNode(index, length));
1170   BoolTest::mask btest = BoolTest::lt;
1171   Node* rc_bool = _gvn.transform(new BoolNode(rc_cmp, btest));
1172   RangeCheckNode* rc = new RangeCheckNode(control(), rc_bool, PROB_MAX, COUNT_UNKNOWN);
1173   _gvn.set_type(rc, rc->Value(&_gvn));
1174   if (!rc_bool->is_Con()) {
1175     record_for_igvn(rc);
1176   }
1177   set_control(_gvn.transform(new IfTrueNode(rc)));
1178   {
1179     PreserveJVMState pjvms(this);
1180     set_control(_gvn.transform(new IfFalseNode(rc)));
1181     uncommon_trap(Deoptimization::Reason_range_check,
1182                   Deoptimization::Action_make_not_entrant);
1183   }
1184 
1185   if (stopped()) {
1186     return false;
1187   }
1188 
1189   Node* result = new CastIINode(index, TypeInt::make(0, _gvn.type(length)->is_int()->_hi, Type::WidenMax));
1190   result->set_req(0, control());
1191   result = _gvn.transform(result);
1192   set_result(result);
1193   replace_in_map(index, result);
1194   return true;
1195 }
1196 
1197 //------------------------------inline_string_indexOf------------------------
1198 bool LibraryCallKit::inline_string_indexOf(StrIntrinsicNode::ArgEnc ae) {
1199   if (!Matcher::match_rule_supported(Op_StrIndexOf)) {
1200     return false;
1201   }
1202   Node* src = argument(0);
1203   Node* tgt = argument(1);
1204 
1205   // Make the merge point
1206   RegionNode* result_rgn = new RegionNode(4);
1207   Node*       result_phi = new PhiNode(result_rgn, TypeInt::INT);
1208 
1209   // Get start addr and length of source string
1210   Node* src_start = array_element_address(src, intcon(0), T_BYTE);
1211   Node* src_count = load_array_length(src);
1212 
1213   // Get start addr and length of substring
1214   Node* tgt_start = array_element_address(tgt, intcon(0), T_BYTE);
1215   Node* tgt_count = load_array_length(tgt);
1216 
1217   if (ae == StrIntrinsicNode::UU || ae == StrIntrinsicNode::UL) {
1218     // Divide src size by 2 if String is UTF16 encoded
1219     src_count = _gvn.transform(new RShiftINode(src_count, intcon(1)));
1220   }
1221   if (ae == StrIntrinsicNode::UU) {
1222     // Divide substring size by 2 if String is UTF16 encoded
1223     tgt_count = _gvn.transform(new RShiftINode(tgt_count, intcon(1)));
1224   }
1225 
1226   Node* result = make_indexOf_node(src_start, src_count, tgt_start, tgt_count, result_rgn, result_phi, ae);
1227   if (result != NULL) {
1228     result_phi->init_req(3, result);
1229     result_rgn->init_req(3, control());
1230   }
1231   set_control(_gvn.transform(result_rgn));
1232   record_for_igvn(result_rgn);
1233   set_result(_gvn.transform(result_phi));
1234 
1235   return true;
1236 }
1237 
1238 //-----------------------------inline_string_indexOf-----------------------
1239 bool LibraryCallKit::inline_string_indexOfI(StrIntrinsicNode::ArgEnc ae) {
1240   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
1241     return false;
1242   }
1243   if (!Matcher::match_rule_supported(Op_StrIndexOf)) {
1244     return false;
1245   }
1246   assert(callee()->signature()->size() == 5, "String.indexOf() has 5 arguments");
1247   Node* src         = argument(0); // byte[]
1248   Node* src_count   = argument(1); // char count
1249   Node* tgt         = argument(2); // byte[]
1250   Node* tgt_count   = argument(3); // char count
1251   Node* from_index  = argument(4); // char index
1252 
1253   // Multiply byte array index by 2 if String is UTF16 encoded
1254   Node* src_offset = (ae == StrIntrinsicNode::LL) ? from_index : _gvn.transform(new LShiftINode(from_index, intcon(1)));
1255   src_count = _gvn.transform(new SubINode(src_count, from_index));
1256   Node* src_start = array_element_address(src, src_offset, T_BYTE);
1257   Node* tgt_start = array_element_address(tgt, intcon(0), T_BYTE);
1258 
1259   // Range checks
1260   generate_string_range_check(src, src_offset, src_count, ae != StrIntrinsicNode::LL);
1261   generate_string_range_check(tgt, intcon(0), tgt_count, ae == StrIntrinsicNode::UU);
1262   if (stopped()) {
1263     return true;
1264   }
1265 
1266   RegionNode* region = new RegionNode(5);
1267   Node* phi = new PhiNode(region, TypeInt::INT);
1268 
1269   Node* result = make_indexOf_node(src_start, src_count, tgt_start, tgt_count, region, phi, ae);
1270   if (result != NULL) {
1271     // The result is index relative to from_index if substring was found, -1 otherwise.
1272     // Generate code which will fold into cmove.
1273     Node* cmp = _gvn.transform(new CmpINode(result, intcon(0)));
1274     Node* bol = _gvn.transform(new BoolNode(cmp, BoolTest::lt));
1275 
1276     Node* if_lt = generate_slow_guard(bol, NULL);
1277     if (if_lt != NULL) {
1278       // result == -1
1279       phi->init_req(3, result);
1280       region->init_req(3, if_lt);
1281     }
1282     if (!stopped()) {
1283       result = _gvn.transform(new AddINode(result, from_index));
1284       phi->init_req(4, result);
1285       region->init_req(4, control());
1286     }
1287   }
1288 
1289   set_control(_gvn.transform(region));
1290   record_for_igvn(region);
1291   set_result(_gvn.transform(phi));
1292 
1293   return true;
1294 }
1295 
1296 // Create StrIndexOfNode with fast path checks
1297 Node* LibraryCallKit::make_indexOf_node(Node* src_start, Node* src_count, Node* tgt_start, Node* tgt_count,
1298                                         RegionNode* region, Node* phi, StrIntrinsicNode::ArgEnc ae) {
1299   // Check for substr count > string count
1300   Node* cmp = _gvn.transform(new CmpINode(tgt_count, src_count));
1301   Node* bol = _gvn.transform(new BoolNode(cmp, BoolTest::gt));
1302   Node* if_gt = generate_slow_guard(bol, NULL);
1303   if (if_gt != NULL) {
1304     phi->init_req(1, intcon(-1));
1305     region->init_req(1, if_gt);
1306   }
1307   if (!stopped()) {
1308     // Check for substr count == 0
1309     cmp = _gvn.transform(new CmpINode(tgt_count, intcon(0)));
1310     bol = _gvn.transform(new BoolNode(cmp, BoolTest::eq));
1311     Node* if_zero = generate_slow_guard(bol, NULL);
1312     if (if_zero != NULL) {
1313       phi->init_req(2, intcon(0));
1314       region->init_req(2, if_zero);
1315     }
1316   }
1317   if (!stopped()) {
1318     return make_string_method_node(Op_StrIndexOf, src_start, src_count, tgt_start, tgt_count, ae);
1319   }
1320   return NULL;
1321 }
1322 
1323 //-----------------------------inline_string_indexOfChar-----------------------
1324 bool LibraryCallKit::inline_string_indexOfChar() {
1325   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
1326     return false;
1327   }
1328   if (!Matcher::match_rule_supported(Op_StrIndexOfChar)) {
1329     return false;
1330   }
1331   assert(callee()->signature()->size() == 4, "String.indexOfChar() has 4 arguments");
1332   Node* src         = argument(0); // byte[]
1333   Node* tgt         = argument(1); // tgt is int ch
1334   Node* from_index  = argument(2);
1335   Node* max         = argument(3);
1336 
1337   Node* src_offset = _gvn.transform(new LShiftINode(from_index, intcon(1)));
1338   Node* src_start = array_element_address(src, src_offset, T_BYTE);
1339   Node* src_count = _gvn.transform(new SubINode(max, from_index));
1340 
1341   // Range checks
1342   generate_string_range_check(src, src_offset, src_count, true);
1343   if (stopped()) {
1344     return true;
1345   }
1346 
1347   RegionNode* region = new RegionNode(3);
1348   Node* phi = new PhiNode(region, TypeInt::INT);
1349 
1350   Node* result = new StrIndexOfCharNode(control(), memory(TypeAryPtr::BYTES), src_start, src_count, tgt, StrIntrinsicNode::none);
1351   C->set_has_split_ifs(true); // Has chance for split-if optimization
1352   _gvn.transform(result);
1353 
1354   Node* cmp = _gvn.transform(new CmpINode(result, intcon(0)));
1355   Node* bol = _gvn.transform(new BoolNode(cmp, BoolTest::lt));
1356 
1357   Node* if_lt = generate_slow_guard(bol, NULL);
1358   if (if_lt != NULL) {
1359     // result == -1
1360     phi->init_req(2, result);
1361     region->init_req(2, if_lt);
1362   }
1363   if (!stopped()) {
1364     result = _gvn.transform(new AddINode(result, from_index));
1365     phi->init_req(1, result);
1366     region->init_req(1, control());
1367   }
1368   set_control(_gvn.transform(region));
1369   record_for_igvn(region);
1370   set_result(_gvn.transform(phi));
1371 
1372   return true;
1373 }
1374 //---------------------------inline_string_copy---------------------
1375 // compressIt == true --> generate a compressed copy operation (compress char[]/byte[] to byte[])
1376 //   int StringUTF16.compress(char[] src, int srcOff, byte[] dst, int dstOff, int len)
1377 //   int StringUTF16.compress(byte[] src, int srcOff, byte[] dst, int dstOff, int len)
1378 // compressIt == false --> generate an inflated copy operation (inflate byte[] to char[]/byte[])
1379 //   void StringLatin1.inflate(byte[] src, int srcOff, char[] dst, int dstOff, int len)
1380 //   void StringLatin1.inflate(byte[] src, int srcOff, byte[] dst, int dstOff, int len)
1381 bool LibraryCallKit::inline_string_copy(bool compress) {
1382   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
1383     return false;
1384   }
1385   int nargs = 5;  // 2 oops, 3 ints
1386   assert(callee()->signature()->size() == nargs, "string copy has 5 arguments");
1387 
1388   Node* src         = argument(0);
1389   Node* src_offset  = argument(1);
1390   Node* dst         = argument(2);
1391   Node* dst_offset  = argument(3);
1392   Node* length      = argument(4);
1393 
1394   // Check for allocation before we add nodes that would confuse
1395   // tightly_coupled_allocation()
1396   AllocateArrayNode* alloc = tightly_coupled_allocation(dst, NULL);
1397 
1398   // Figure out the size and type of the elements we will be copying.
1399   const Type* src_type = src->Value(&_gvn);
1400   const Type* dst_type = dst->Value(&_gvn);
1401   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
1402   BasicType dst_elem = dst_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
1403   assert((compress && dst_elem == T_BYTE && (src_elem == T_BYTE || src_elem == T_CHAR)) ||
1404          (!compress && src_elem == T_BYTE && (dst_elem == T_BYTE || dst_elem == T_CHAR)),
1405          "Unsupported array types for inline_string_copy");
1406 
1407   // Range checks
1408   generate_string_range_check(src, src_offset, length, compress && src_elem == T_BYTE);
1409   generate_string_range_check(dst, dst_offset, length, !compress && dst_elem == T_BYTE);
1410   if (stopped()) {
1411     return true;
1412   }
1413 
1414   // Convert char[] offsets to byte[] offsets
1415   if (compress && src_elem == T_BYTE) {
1416     src_offset = _gvn.transform(new LShiftINode(src_offset, intcon(1)));
1417   } else if (!compress && dst_elem == T_BYTE) {
1418     dst_offset = _gvn.transform(new LShiftINode(dst_offset, intcon(1)));
1419   }
1420 
1421   Node* src_start = array_element_address(src, src_offset, src_elem);
1422   Node* dst_start = array_element_address(dst, dst_offset, dst_elem);
1423   // 'src_start' points to src array + scaled offset
1424   // 'dst_start' points to dst array + scaled offset
1425   Node* count = NULL;
1426   if (compress) {
1427     count = compress_string(src_start, TypeAryPtr::get_array_body_type(src_elem), dst_start, length);
1428   } else {
1429     inflate_string(src_start, dst_start, TypeAryPtr::get_array_body_type(dst_elem), length);
1430   }
1431 
1432   if (alloc != NULL) {
1433     if (alloc->maybe_set_complete(&_gvn)) {
1434       // "You break it, you buy it."
1435       InitializeNode* init = alloc->initialization();
1436       assert(init->is_complete(), "we just did this");
1437       init->set_complete_with_arraycopy();
1438       assert(dst->is_CheckCastPP(), "sanity");
1439       assert(dst->in(0)->in(0) == init, "dest pinned");
1440     }
1441     // Do not let stores that initialize this object be reordered with
1442     // a subsequent store that would make this object accessible by
1443     // other threads.
1444     // Record what AllocateNode this StoreStore protects so that
1445     // escape analysis can go from the MemBarStoreStoreNode to the
1446     // AllocateNode and eliminate the MemBarStoreStoreNode if possible
1447     // based on the escape status of the AllocateNode.
1448     insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
1449   }
1450   if (compress) {
1451     set_result(_gvn.transform(count));
1452   }
1453   return true;
1454 }
1455 
1456 #ifdef _LP64
1457 #define XTOP ,top() /*additional argument*/
1458 #else  //_LP64
1459 #define XTOP        /*no additional argument*/
1460 #endif //_LP64
1461 
1462 //------------------------inline_string_toBytesU--------------------------
1463 // public static byte[] StringUTF16.toBytes(char[] value, int off, int len)
1464 bool LibraryCallKit::inline_string_toBytesU() {
1465   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
1466     return false;
1467   }
1468   // Get the arguments.
1469   Node* value     = argument(0);
1470   Node* offset    = argument(1);
1471   Node* length    = argument(2);
1472 
1473   Node* newcopy = NULL;
1474 
1475   // Set the original stack and the reexecute bit for the interpreter to reexecute
1476   // the bytecode that invokes StringUTF16.toBytes() if deoptimization happens.
1477   { PreserveReexecuteState preexecs(this);
1478     jvms()->set_should_reexecute(true);
1479 
1480     // Check if a null path was taken unconditionally.
1481     value = null_check(value);
1482 
1483     RegionNode* bailout = new RegionNode(1);
1484     record_for_igvn(bailout);
1485 
1486     // Range checks
1487     generate_negative_guard(offset, bailout);
1488     generate_negative_guard(length, bailout);
1489     generate_limit_guard(offset, length, load_array_length(value), bailout);
1490     // Make sure that resulting byte[] length does not overflow Integer.MAX_VALUE
1491     generate_limit_guard(length, intcon(0), intcon(max_jint/2), bailout);
1492 
1493     if (bailout->req() > 1) {
1494       PreserveJVMState pjvms(this);
1495       set_control(_gvn.transform(bailout));
1496       uncommon_trap(Deoptimization::Reason_intrinsic,
1497                     Deoptimization::Action_maybe_recompile);
1498     }
1499     if (stopped()) {
1500       return true;
1501     }
1502 
1503     Node* size = _gvn.transform(new LShiftINode(length, intcon(1)));
1504     Node* klass_node = makecon(TypeKlassPtr::make(ciTypeArrayKlass::make(T_BYTE)));
1505     newcopy = new_array(klass_node, size, 0);  // no arguments to push
1506     AllocateArrayNode* alloc = tightly_coupled_allocation(newcopy, NULL);
1507 
1508     // Calculate starting addresses.
1509     Node* src_start = array_element_address(value, offset, T_CHAR);
1510     Node* dst_start = basic_plus_adr(newcopy, arrayOopDesc::base_offset_in_bytes(T_BYTE));
1511 
1512     // Check if src array address is aligned to HeapWordSize (dst is always aligned)
1513     const TypeInt* toffset = gvn().type(offset)->is_int();
1514     bool aligned = toffset->is_con() && ((toffset->get_con() * type2aelembytes(T_CHAR)) % HeapWordSize == 0);
1515 
1516     // Figure out which arraycopy runtime method to call (disjoint, uninitialized).
1517     const char* copyfunc_name = "arraycopy";
1518     address     copyfunc_addr = StubRoutines::select_arraycopy_function(T_CHAR, aligned, true, copyfunc_name, true);
1519     Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
1520                       OptoRuntime::fast_arraycopy_Type(),
1521                       copyfunc_addr, copyfunc_name, TypeRawPtr::BOTTOM,
1522                       src_start, dst_start, ConvI2X(length) XTOP);
1523     // Do not let reads from the cloned object float above the arraycopy.
1524     if (alloc != NULL) {
1525       if (alloc->maybe_set_complete(&_gvn)) {
1526         // "You break it, you buy it."
1527         InitializeNode* init = alloc->initialization();
1528         assert(init->is_complete(), "we just did this");
1529         init->set_complete_with_arraycopy();
1530         assert(newcopy->is_CheckCastPP(), "sanity");
1531         assert(newcopy->in(0)->in(0) == init, "dest pinned");
1532       }
1533       // Do not let stores that initialize this object be reordered with
1534       // a subsequent store that would make this object accessible by
1535       // other threads.
1536       // Record what AllocateNode this StoreStore protects so that
1537       // escape analysis can go from the MemBarStoreStoreNode to the
1538       // AllocateNode and eliminate the MemBarStoreStoreNode if possible
1539       // based on the escape status of the AllocateNode.
1540       insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
1541     } else {
1542       insert_mem_bar(Op_MemBarCPUOrder);
1543     }
1544   } // original reexecute is set back here
1545 
1546   C->set_has_split_ifs(true); // Has chance for split-if optimization
1547   if (!stopped()) {
1548     set_result(newcopy);
1549   }
1550   return true;
1551 }
1552 
1553 //------------------------inline_string_getCharsU--------------------------
1554 // public void StringUTF16.getChars(byte[] src, int srcBegin, int srcEnd, char dst[], int dstBegin)
1555 bool LibraryCallKit::inline_string_getCharsU() {
1556   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
1557     return false;
1558   }
1559 
1560   // Get the arguments.
1561   Node* src       = argument(0);
1562   Node* src_begin = argument(1);
1563   Node* src_end   = argument(2); // exclusive offset (i < src_end)
1564   Node* dst       = argument(3);
1565   Node* dst_begin = argument(4);
1566 
1567   // Check for allocation before we add nodes that would confuse
1568   // tightly_coupled_allocation()
1569   AllocateArrayNode* alloc = tightly_coupled_allocation(dst, NULL);
1570 
1571   // Check if a null path was taken unconditionally.
1572   src = null_check(src);
1573   dst = null_check(dst);
1574   if (stopped()) {
1575     return true;
1576   }
1577 
1578   // Get length and convert char[] offset to byte[] offset
1579   Node* length = _gvn.transform(new SubINode(src_end, src_begin));
1580   src_begin = _gvn.transform(new LShiftINode(src_begin, intcon(1)));
1581 
1582   // Range checks
1583   generate_string_range_check(src, src_begin, length, true);
1584   generate_string_range_check(dst, dst_begin, length, false);
1585   if (stopped()) {
1586     return true;
1587   }
1588 
1589   if (!stopped()) {
1590     // Calculate starting addresses.
1591     Node* src_start = array_element_address(src, src_begin, T_BYTE);
1592     Node* dst_start = array_element_address(dst, dst_begin, T_CHAR);
1593 
1594     // Check if array addresses are aligned to HeapWordSize
1595     const TypeInt* tsrc = gvn().type(src_begin)->is_int();
1596     const TypeInt* tdst = gvn().type(dst_begin)->is_int();
1597     bool aligned = tsrc->is_con() && ((tsrc->get_con() * type2aelembytes(T_BYTE)) % HeapWordSize == 0) &&
1598                    tdst->is_con() && ((tdst->get_con() * type2aelembytes(T_CHAR)) % HeapWordSize == 0);
1599 
1600     // Figure out which arraycopy runtime method to call (disjoint, uninitialized).
1601     const char* copyfunc_name = "arraycopy";
1602     address     copyfunc_addr = StubRoutines::select_arraycopy_function(T_CHAR, aligned, true, copyfunc_name, true);
1603     Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
1604                       OptoRuntime::fast_arraycopy_Type(),
1605                       copyfunc_addr, copyfunc_name, TypeRawPtr::BOTTOM,
1606                       src_start, dst_start, ConvI2X(length) XTOP);
1607     // Do not let reads from the cloned object float above the arraycopy.
1608     if (alloc != NULL) {
1609       if (alloc->maybe_set_complete(&_gvn)) {
1610         // "You break it, you buy it."
1611         InitializeNode* init = alloc->initialization();
1612         assert(init->is_complete(), "we just did this");
1613         init->set_complete_with_arraycopy();
1614         assert(dst->is_CheckCastPP(), "sanity");
1615         assert(dst->in(0)->in(0) == init, "dest pinned");
1616       }
1617       // Do not let stores that initialize this object be reordered with
1618       // a subsequent store that would make this object accessible by
1619       // other threads.
1620       // Record what AllocateNode this StoreStore protects so that
1621       // escape analysis can go from the MemBarStoreStoreNode to the
1622       // AllocateNode and eliminate the MemBarStoreStoreNode if possible
1623       // based on the escape status of the AllocateNode.
1624       insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
1625     } else {
1626       insert_mem_bar(Op_MemBarCPUOrder);
1627     }
1628   }
1629 
1630   C->set_has_split_ifs(true); // Has chance for split-if optimization
1631   return true;
1632 }
1633 
1634 //----------------------inline_string_char_access----------------------------
1635 // Store/Load char to/from byte[] array.
1636 // static void StringUTF16.putChar(byte[] val, int index, int c)
1637 // static char StringUTF16.getChar(byte[] val, int index)
1638 bool LibraryCallKit::inline_string_char_access(bool is_store) {
1639   Node* value  = argument(0);
1640   Node* index  = argument(1);
1641   Node* ch = is_store ? argument(2) : NULL;
1642 
1643   // This intrinsic accesses byte[] array as char[] array. Computing the offsets
1644   // correctly requires matched array shapes.
1645   assert (arrayOopDesc::base_offset_in_bytes(T_CHAR) == arrayOopDesc::base_offset_in_bytes(T_BYTE),
1646           "sanity: byte[] and char[] bases agree");
1647   assert (type2aelembytes(T_CHAR) == type2aelembytes(T_BYTE)*2,
1648           "sanity: byte[] and char[] scales agree");
1649 
1650   // Bail when getChar over constants is requested: constant folding would
1651   // reject folding mismatched char access over byte[]. A normal inlining for getChar
1652   // Java method would constant fold nicely instead.
1653   if (!is_store && value->is_Con() && index->is_Con()) {
1654     return false;
1655   }
1656 
1657   Node* adr = array_element_address(value, index, T_CHAR);
1658   if (is_store) {
1659     (void) store_to_memory(control(), adr, ch, T_CHAR, TypeAryPtr::BYTES, MemNode::unordered,
1660                            false, false, true /* mismatched */);
1661   } else {
1662     ch = make_load(control(), adr, TypeInt::CHAR, T_CHAR, TypeAryPtr::BYTES, MemNode::unordered,
1663                    LoadNode::DependsOnlyOnTest, false, false, true /* mismatched */);
1664     set_result(ch);
1665   }
1666   return true;
1667 }
1668 
1669 //--------------------------round_double_node--------------------------------
1670 // Round a double node if necessary.
1671 Node* LibraryCallKit::round_double_node(Node* n) {
1672   if (Matcher::strict_fp_requires_explicit_rounding && UseSSE <= 1)
1673     n = _gvn.transform(new RoundDoubleNode(0, n));
1674   return n;
1675 }
1676 
1677 //------------------------------inline_math-----------------------------------
1678 // public static double Math.abs(double)
1679 // public static double Math.sqrt(double)
1680 // public static double Math.log(double)
1681 // public static double Math.log10(double)
1682 bool LibraryCallKit::inline_math(vmIntrinsics::ID id) {
1683   Node* arg = round_double_node(argument(0));
1684   Node* n = NULL;
1685   switch (id) {
1686   case vmIntrinsics::_dabs:   n = new AbsDNode(                arg);  break;
1687   case vmIntrinsics::_dsqrt:  n = new SqrtDNode(C, control(),  arg);  break;
1688   default:  fatal_unexpected_iid(id);  break;
1689   }
1690   set_result(_gvn.transform(n));
1691   return true;
1692 }
1693 
1694 //------------------------------inline_trig----------------------------------
1695 // Inline sin/cos/tan instructions, if possible.  If rounding is required, do
1696 // argument reduction which will turn into a fast/slow diamond.
1697 bool LibraryCallKit::inline_trig(vmIntrinsics::ID id) {
1698   Node* arg = round_double_node(argument(0));
1699   Node* n = NULL;
1700 
1701   n = _gvn.transform(n);
1702 
1703   // Rounding required?  Check for argument reduction!
1704   if (Matcher::strict_fp_requires_explicit_rounding) {
1705     static const double     pi_4 =  0.7853981633974483;
1706     static const double neg_pi_4 = -0.7853981633974483;
1707     // pi/2 in 80-bit extended precision
1708     // static const unsigned char pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0x3f,0x00,0x00,0x00,0x00,0x00,0x00};
1709     // -pi/2 in 80-bit extended precision
1710     // static const unsigned char neg_pi_2_bits_x[] = {0x35,0xc2,0x68,0x21,0xa2,0xda,0x0f,0xc9,0xff,0xbf,0x00,0x00,0x00,0x00,0x00,0x00};
1711     // Cutoff value for using this argument reduction technique
1712     //static const double    pi_2_minus_epsilon =  1.564660403643354;
1713     //static const double neg_pi_2_plus_epsilon = -1.564660403643354;
1714 
1715     // Pseudocode for sin:
1716     // if (x <= Math.PI / 4.0) {
1717     //   if (x >= -Math.PI / 4.0) return  fsin(x);
1718     //   if (x >= -Math.PI / 2.0) return -fcos(x + Math.PI / 2.0);
1719     // } else {
1720     //   if (x <=  Math.PI / 2.0) return  fcos(x - Math.PI / 2.0);
1721     // }
1722     // return StrictMath.sin(x);
1723 
1724     // Pseudocode for cos:
1725     // if (x <= Math.PI / 4.0) {
1726     //   if (x >= -Math.PI / 4.0) return  fcos(x);
1727     //   if (x >= -Math.PI / 2.0) return  fsin(x + Math.PI / 2.0);
1728     // } else {
1729     //   if (x <=  Math.PI / 2.0) return -fsin(x - Math.PI / 2.0);
1730     // }
1731     // return StrictMath.cos(x);
1732 
1733     // Actually, sticking in an 80-bit Intel value into C2 will be tough; it
1734     // requires a special machine instruction to load it.  Instead we'll try
1735     // the 'easy' case.  If we really need the extra range +/- PI/2 we'll
1736     // probably do the math inside the SIN encoding.
1737 
1738     // Make the merge point
1739     RegionNode* r = new RegionNode(3);
1740     Node* phi = new PhiNode(r, Type::DOUBLE);
1741 
1742     // Flatten arg so we need only 1 test
1743     Node *abs = _gvn.transform(new AbsDNode(arg));
1744     // Node for PI/4 constant
1745     Node *pi4 = makecon(TypeD::make(pi_4));
1746     // Check PI/4 : abs(arg)
1747     Node *cmp = _gvn.transform(new CmpDNode(pi4,abs));
1748     // Check: If PI/4 < abs(arg) then go slow
1749     Node *bol = _gvn.transform(new BoolNode( cmp, BoolTest::lt ));
1750     // Branch either way
1751     IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
1752     set_control(opt_iff(r,iff));
1753 
1754     // Set fast path result
1755     phi->init_req(2, n);
1756 
1757     // Slow path - non-blocking leaf call
1758     Node* call = NULL;
1759     switch (id) {
1760     case vmIntrinsics::_dtan:
1761       call = make_runtime_call(RC_LEAF, OptoRuntime::Math_D_D_Type(),
1762                                CAST_FROM_FN_PTR(address, SharedRuntime::dtan),
1763                                "Tan", NULL, arg, top());
1764       break;
1765     }
1766     assert(control()->in(0) == call, "");
1767     Node* slow_result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
1768     r->init_req(1, control());
1769     phi->init_req(1, slow_result);
1770 
1771     // Post-merge
1772     set_control(_gvn.transform(r));
1773     record_for_igvn(r);
1774     n = _gvn.transform(phi);
1775 
1776     C->set_has_split_ifs(true); // Has chance for split-if optimization
1777   }
1778   set_result(n);
1779   return true;
1780 }
1781 
1782 //------------------------------runtime_math-----------------------------
1783 bool LibraryCallKit::runtime_math(const TypeFunc* call_type, address funcAddr, const char* funcName) {
1784   assert(call_type == OptoRuntime::Math_DD_D_Type() || call_type == OptoRuntime::Math_D_D_Type(),
1785          "must be (DD)D or (D)D type");
1786 
1787   // Inputs
1788   Node* a = round_double_node(argument(0));
1789   Node* b = (call_type == OptoRuntime::Math_DD_D_Type()) ? round_double_node(argument(2)) : NULL;
1790 
1791   const TypePtr* no_memory_effects = NULL;
1792   Node* trig = make_runtime_call(RC_LEAF, call_type, funcAddr, funcName,
1793                                  no_memory_effects,
1794                                  a, top(), b, b ? top() : NULL);
1795   Node* value = _gvn.transform(new ProjNode(trig, TypeFunc::Parms+0));
1796 #ifdef ASSERT
1797   Node* value_top = _gvn.transform(new ProjNode(trig, TypeFunc::Parms+1));
1798   assert(value_top == top(), "second value must be top");
1799 #endif
1800 
1801   set_result(value);
1802   return true;
1803 }
1804 
1805 //------------------------------inline_math_native-----------------------------
1806 bool LibraryCallKit::inline_math_native(vmIntrinsics::ID id) {
1807 #define FN_PTR(f) CAST_FROM_FN_PTR(address, f)
1808   switch (id) {
1809     // These intrinsics are not properly supported on all hardware
1810   case vmIntrinsics::_dsin:
1811     return StubRoutines::dsin() != NULL ?
1812       runtime_math(OptoRuntime::Math_D_D_Type(), StubRoutines::dsin(), "dsin") :
1813       runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dsin),   "SIN");
1814   case vmIntrinsics::_dcos:
1815     return StubRoutines::dcos() != NULL ?
1816       runtime_math(OptoRuntime::Math_D_D_Type(), StubRoutines::dcos(), "dcos") :
1817       runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dcos),   "COS");
1818   case vmIntrinsics::_dtan:
1819     return StubRoutines::dtan() != NULL ?
1820       runtime_math(OptoRuntime::Math_D_D_Type(), StubRoutines::dtan(), "dtan") :
1821       runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dtan), "TAN");
1822   case vmIntrinsics::_dlog:
1823     return StubRoutines::dlog() != NULL ?
1824       runtime_math(OptoRuntime::Math_D_D_Type(), StubRoutines::dlog(), "dlog") :
1825       runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog),   "LOG");
1826   case vmIntrinsics::_dlog10:
1827     return StubRoutines::dlog10() != NULL ?
1828       runtime_math(OptoRuntime::Math_D_D_Type(), StubRoutines::dlog10(), "dlog10") :
1829       runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dlog10), "LOG10");
1830 
1831     // These intrinsics are supported on all hardware
1832   case vmIntrinsics::_dsqrt:  return Matcher::match_rule_supported(Op_SqrtD) ? inline_math(id) : false;
1833   case vmIntrinsics::_dabs:   return Matcher::has_match_rule(Op_AbsD)   ? inline_math(id) : false;
1834 
1835   case vmIntrinsics::_dexp:
1836     return StubRoutines::dexp() != NULL ?
1837       runtime_math(OptoRuntime::Math_D_D_Type(), StubRoutines::dexp(),  "dexp") :
1838       runtime_math(OptoRuntime::Math_D_D_Type(), FN_PTR(SharedRuntime::dexp),  "EXP");
1839   case vmIntrinsics::_dpow:
1840     return StubRoutines::dpow() != NULL ?
1841       runtime_math(OptoRuntime::Math_DD_D_Type(), StubRoutines::dpow(), "dpow") :
1842       runtime_math(OptoRuntime::Math_DD_D_Type(), FN_PTR(SharedRuntime::dpow),  "POW");
1843 #undef FN_PTR
1844 
1845    // These intrinsics are not yet correctly implemented
1846   case vmIntrinsics::_datan2:
1847     return false;
1848 
1849   default:
1850     fatal_unexpected_iid(id);
1851     return false;
1852   }
1853 }
1854 
1855 static bool is_simple_name(Node* n) {
1856   return (n->req() == 1         // constant
1857           || (n->is_Type() && n->as_Type()->type()->singleton())
1858           || n->is_Proj()       // parameter or return value
1859           || n->is_Phi()        // local of some sort
1860           );
1861 }
1862 
1863 //----------------------------inline_notify-----------------------------------*
1864 bool LibraryCallKit::inline_notify(vmIntrinsics::ID id) {
1865   const TypeFunc* ftype = OptoRuntime::monitor_notify_Type();
1866   address func;
1867   if (id == vmIntrinsics::_notify) {
1868     func = OptoRuntime::monitor_notify_Java();
1869   } else {
1870     func = OptoRuntime::monitor_notifyAll_Java();
1871   }
1872   Node* call = make_runtime_call(RC_NO_LEAF, ftype, func, NULL, TypeRawPtr::BOTTOM, argument(0));
1873   make_slow_call_ex(call, env()->Throwable_klass(), false);
1874   return true;
1875 }
1876 
1877 
1878 //----------------------------inline_min_max-----------------------------------
1879 bool LibraryCallKit::inline_min_max(vmIntrinsics::ID id) {
1880   set_result(generate_min_max(id, argument(0), argument(1)));
1881   return true;
1882 }
1883 
1884 void LibraryCallKit::inline_math_mathExact(Node* math, Node *test) {
1885   Node* bol = _gvn.transform( new BoolNode(test, BoolTest::overflow) );
1886   IfNode* check = create_and_map_if(control(), bol, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN);
1887   Node* fast_path = _gvn.transform( new IfFalseNode(check));
1888   Node* slow_path = _gvn.transform( new IfTrueNode(check) );
1889 
1890   {
1891     PreserveJVMState pjvms(this);
1892     PreserveReexecuteState preexecs(this);
1893     jvms()->set_should_reexecute(true);
1894 
1895     set_control(slow_path);
1896     set_i_o(i_o());
1897 
1898     uncommon_trap(Deoptimization::Reason_intrinsic,
1899                   Deoptimization::Action_none);
1900   }
1901 
1902   set_control(fast_path);
1903   set_result(math);
1904 }
1905 
1906 template <typename OverflowOp>
1907 bool LibraryCallKit::inline_math_overflow(Node* arg1, Node* arg2) {
1908   typedef typename OverflowOp::MathOp MathOp;
1909 
1910   MathOp* mathOp = new MathOp(arg1, arg2);
1911   Node* operation = _gvn.transform( mathOp );
1912   Node* ofcheck = _gvn.transform( new OverflowOp(arg1, arg2) );
1913   inline_math_mathExact(operation, ofcheck);
1914   return true;
1915 }
1916 
1917 bool LibraryCallKit::inline_math_addExactI(bool is_increment) {
1918   return inline_math_overflow<OverflowAddINode>(argument(0), is_increment ? intcon(1) : argument(1));
1919 }
1920 
1921 bool LibraryCallKit::inline_math_addExactL(bool is_increment) {
1922   return inline_math_overflow<OverflowAddLNode>(argument(0), is_increment ? longcon(1) : argument(2));
1923 }
1924 
1925 bool LibraryCallKit::inline_math_subtractExactI(bool is_decrement) {
1926   return inline_math_overflow<OverflowSubINode>(argument(0), is_decrement ? intcon(1) : argument(1));
1927 }
1928 
1929 bool LibraryCallKit::inline_math_subtractExactL(bool is_decrement) {
1930   return inline_math_overflow<OverflowSubLNode>(argument(0), is_decrement ? longcon(1) : argument(2));
1931 }
1932 
1933 bool LibraryCallKit::inline_math_negateExactI() {
1934   return inline_math_overflow<OverflowSubINode>(intcon(0), argument(0));
1935 }
1936 
1937 bool LibraryCallKit::inline_math_negateExactL() {
1938   return inline_math_overflow<OverflowSubLNode>(longcon(0), argument(0));
1939 }
1940 
1941 bool LibraryCallKit::inline_math_multiplyExactI() {
1942   return inline_math_overflow<OverflowMulINode>(argument(0), argument(1));
1943 }
1944 
1945 bool LibraryCallKit::inline_math_multiplyExactL() {
1946   return inline_math_overflow<OverflowMulLNode>(argument(0), argument(2));
1947 }
1948 
1949 Node*
1950 LibraryCallKit::generate_min_max(vmIntrinsics::ID id, Node* x0, Node* y0) {
1951   // These are the candidate return value:
1952   Node* xvalue = x0;
1953   Node* yvalue = y0;
1954 
1955   if (xvalue == yvalue) {
1956     return xvalue;
1957   }
1958 
1959   bool want_max = (id == vmIntrinsics::_max);
1960 
1961   const TypeInt* txvalue = _gvn.type(xvalue)->isa_int();
1962   const TypeInt* tyvalue = _gvn.type(yvalue)->isa_int();
1963   if (txvalue == NULL || tyvalue == NULL)  return top();
1964   // This is not really necessary, but it is consistent with a
1965   // hypothetical MaxINode::Value method:
1966   int widen = MAX2(txvalue->_widen, tyvalue->_widen);
1967 
1968   // %%% This folding logic should (ideally) be in a different place.
1969   // Some should be inside IfNode, and there to be a more reliable
1970   // transformation of ?: style patterns into cmoves.  We also want
1971   // more powerful optimizations around cmove and min/max.
1972 
1973   // Try to find a dominating comparison of these guys.
1974   // It can simplify the index computation for Arrays.copyOf
1975   // and similar uses of System.arraycopy.
1976   // First, compute the normalized version of CmpI(x, y).
1977   int   cmp_op = Op_CmpI;
1978   Node* xkey = xvalue;
1979   Node* ykey = yvalue;
1980   Node* ideal_cmpxy = _gvn.transform(new CmpINode(xkey, ykey));
1981   if (ideal_cmpxy->is_Cmp()) {
1982     // E.g., if we have CmpI(length - offset, count),
1983     // it might idealize to CmpI(length, count + offset)
1984     cmp_op = ideal_cmpxy->Opcode();
1985     xkey = ideal_cmpxy->in(1);
1986     ykey = ideal_cmpxy->in(2);
1987   }
1988 
1989   // Start by locating any relevant comparisons.
1990   Node* start_from = (xkey->outcnt() < ykey->outcnt()) ? xkey : ykey;
1991   Node* cmpxy = NULL;
1992   Node* cmpyx = NULL;
1993   for (DUIterator_Fast kmax, k = start_from->fast_outs(kmax); k < kmax; k++) {
1994     Node* cmp = start_from->fast_out(k);
1995     if (cmp->outcnt() > 0 &&            // must have prior uses
1996         cmp->in(0) == NULL &&           // must be context-independent
1997         cmp->Opcode() == cmp_op) {      // right kind of compare
1998       if (cmp->in(1) == xkey && cmp->in(2) == ykey)  cmpxy = cmp;
1999       if (cmp->in(1) == ykey && cmp->in(2) == xkey)  cmpyx = cmp;
2000     }
2001   }
2002 
2003   const int NCMPS = 2;
2004   Node* cmps[NCMPS] = { cmpxy, cmpyx };
2005   int cmpn;
2006   for (cmpn = 0; cmpn < NCMPS; cmpn++) {
2007     if (cmps[cmpn] != NULL)  break;     // find a result
2008   }
2009   if (cmpn < NCMPS) {
2010     // Look for a dominating test that tells us the min and max.
2011     int depth = 0;                // Limit search depth for speed
2012     Node* dom = control();
2013     for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) {
2014       if (++depth >= 100)  break;
2015       Node* ifproj = dom;
2016       if (!ifproj->is_Proj())  continue;
2017       Node* iff = ifproj->in(0);
2018       if (!iff->is_If())  continue;
2019       Node* bol = iff->in(1);
2020       if (!bol->is_Bool())  continue;
2021       Node* cmp = bol->in(1);
2022       if (cmp == NULL)  continue;
2023       for (cmpn = 0; cmpn < NCMPS; cmpn++)
2024         if (cmps[cmpn] == cmp)  break;
2025       if (cmpn == NCMPS)  continue;
2026       BoolTest::mask btest = bol->as_Bool()->_test._test;
2027       if (ifproj->is_IfFalse())  btest = BoolTest(btest).negate();
2028       if (cmp->in(1) == ykey)    btest = BoolTest(btest).commute();
2029       // At this point, we know that 'x btest y' is true.
2030       switch (btest) {
2031       case BoolTest::eq:
2032         // They are proven equal, so we can collapse the min/max.
2033         // Either value is the answer.  Choose the simpler.
2034         if (is_simple_name(yvalue) && !is_simple_name(xvalue))
2035           return yvalue;
2036         return xvalue;
2037       case BoolTest::lt:          // x < y
2038       case BoolTest::le:          // x <= y
2039         return (want_max ? yvalue : xvalue);
2040       case BoolTest::gt:          // x > y
2041       case BoolTest::ge:          // x >= y
2042         return (want_max ? xvalue : yvalue);
2043       }
2044     }
2045   }
2046 
2047   // We failed to find a dominating test.
2048   // Let's pick a test that might GVN with prior tests.
2049   Node*          best_bol   = NULL;
2050   BoolTest::mask best_btest = BoolTest::illegal;
2051   for (cmpn = 0; cmpn < NCMPS; cmpn++) {
2052     Node* cmp = cmps[cmpn];
2053     if (cmp == NULL)  continue;
2054     for (DUIterator_Fast jmax, j = cmp->fast_outs(jmax); j < jmax; j++) {
2055       Node* bol = cmp->fast_out(j);
2056       if (!bol->is_Bool())  continue;
2057       BoolTest::mask btest = bol->as_Bool()->_test._test;
2058       if (btest == BoolTest::eq || btest == BoolTest::ne)  continue;
2059       if (cmp->in(1) == ykey)   btest = BoolTest(btest).commute();
2060       if (bol->outcnt() > (best_bol == NULL ? 0 : best_bol->outcnt())) {
2061         best_bol   = bol->as_Bool();
2062         best_btest = btest;
2063       }
2064     }
2065   }
2066 
2067   Node* answer_if_true  = NULL;
2068   Node* answer_if_false = NULL;
2069   switch (best_btest) {
2070   default:
2071     if (cmpxy == NULL)
2072       cmpxy = ideal_cmpxy;
2073     best_bol = _gvn.transform(new BoolNode(cmpxy, BoolTest::lt));
2074     // and fall through:
2075   case BoolTest::lt:          // x < y
2076   case BoolTest::le:          // x <= y
2077     answer_if_true  = (want_max ? yvalue : xvalue);
2078     answer_if_false = (want_max ? xvalue : yvalue);
2079     break;
2080   case BoolTest::gt:          // x > y
2081   case BoolTest::ge:          // x >= y
2082     answer_if_true  = (want_max ? xvalue : yvalue);
2083     answer_if_false = (want_max ? yvalue : xvalue);
2084     break;
2085   }
2086 
2087   jint hi, lo;
2088   if (want_max) {
2089     // We can sharpen the minimum.
2090     hi = MAX2(txvalue->_hi, tyvalue->_hi);
2091     lo = MAX2(txvalue->_lo, tyvalue->_lo);
2092   } else {
2093     // We can sharpen the maximum.
2094     hi = MIN2(txvalue->_hi, tyvalue->_hi);
2095     lo = MIN2(txvalue->_lo, tyvalue->_lo);
2096   }
2097 
2098   // Use a flow-free graph structure, to avoid creating excess control edges
2099   // which could hinder other optimizations.
2100   // Since Math.min/max is often used with arraycopy, we want
2101   // tightly_coupled_allocation to be able to see beyond min/max expressions.
2102   Node* cmov = CMoveNode::make(NULL, best_bol,
2103                                answer_if_false, answer_if_true,
2104                                TypeInt::make(lo, hi, widen));
2105 
2106   return _gvn.transform(cmov);
2107 
2108   /*
2109   // This is not as desirable as it may seem, since Min and Max
2110   // nodes do not have a full set of optimizations.
2111   // And they would interfere, anyway, with 'if' optimizations
2112   // and with CMoveI canonical forms.
2113   switch (id) {
2114   case vmIntrinsics::_min:
2115     result_val = _gvn.transform(new (C, 3) MinINode(x,y)); break;
2116   case vmIntrinsics::_max:
2117     result_val = _gvn.transform(new (C, 3) MaxINode(x,y)); break;
2118   default:
2119     ShouldNotReachHere();
2120   }
2121   */
2122 }
2123 
2124 inline int
2125 LibraryCallKit::classify_unsafe_addr(Node* &base, Node* &offset) {
2126   const TypePtr* base_type = TypePtr::NULL_PTR;
2127   if (base != NULL)  base_type = _gvn.type(base)->isa_ptr();
2128   if (base_type == NULL) {
2129     // Unknown type.
2130     return Type::AnyPtr;
2131   } else if (base_type == TypePtr::NULL_PTR) {
2132     // Since this is a NULL+long form, we have to switch to a rawptr.
2133     base   = _gvn.transform(new CastX2PNode(offset));
2134     offset = MakeConX(0);
2135     return Type::RawPtr;
2136   } else if (base_type->base() == Type::RawPtr) {
2137     return Type::RawPtr;
2138   } else if (base_type->isa_oopptr()) {
2139     // Base is never null => always a heap address.
2140     if (base_type->ptr() == TypePtr::NotNull) {
2141       return Type::OopPtr;
2142     }
2143     // Offset is small => always a heap address.
2144     const TypeX* offset_type = _gvn.type(offset)->isa_intptr_t();
2145     if (offset_type != NULL &&
2146         base_type->offset() == 0 &&     // (should always be?)
2147         offset_type->_lo >= 0 &&
2148         !MacroAssembler::needs_explicit_null_check(offset_type->_hi)) {
2149       return Type::OopPtr;
2150     }
2151     // Otherwise, it might either be oop+off or NULL+addr.
2152     return Type::AnyPtr;
2153   } else {
2154     // No information:
2155     return Type::AnyPtr;
2156   }
2157 }
2158 
2159 inline Node* LibraryCallKit::make_unsafe_address(Node* base, Node* offset) {
2160   int kind = classify_unsafe_addr(base, offset);
2161   if (kind == Type::RawPtr) {
2162     return basic_plus_adr(top(), base, offset);
2163   } else {
2164     return basic_plus_adr(base, offset);
2165   }
2166 }
2167 
2168 //--------------------------inline_number_methods-----------------------------
2169 // inline int     Integer.numberOfLeadingZeros(int)
2170 // inline int        Long.numberOfLeadingZeros(long)
2171 //
2172 // inline int     Integer.numberOfTrailingZeros(int)
2173 // inline int        Long.numberOfTrailingZeros(long)
2174 //
2175 // inline int     Integer.bitCount(int)
2176 // inline int        Long.bitCount(long)
2177 //
2178 // inline char  Character.reverseBytes(char)
2179 // inline short     Short.reverseBytes(short)
2180 // inline int     Integer.reverseBytes(int)
2181 // inline long       Long.reverseBytes(long)
2182 bool LibraryCallKit::inline_number_methods(vmIntrinsics::ID id) {
2183   Node* arg = argument(0);
2184   Node* n = NULL;
2185   switch (id) {
2186   case vmIntrinsics::_numberOfLeadingZeros_i:   n = new CountLeadingZerosINode( arg);  break;
2187   case vmIntrinsics::_numberOfLeadingZeros_l:   n = new CountLeadingZerosLNode( arg);  break;
2188   case vmIntrinsics::_numberOfTrailingZeros_i:  n = new CountTrailingZerosINode(arg);  break;
2189   case vmIntrinsics::_numberOfTrailingZeros_l:  n = new CountTrailingZerosLNode(arg);  break;
2190   case vmIntrinsics::_bitCount_i:               n = new PopCountINode(          arg);  break;
2191   case vmIntrinsics::_bitCount_l:               n = new PopCountLNode(          arg);  break;
2192   case vmIntrinsics::_reverseBytes_c:           n = new ReverseBytesUSNode(0,   arg);  break;
2193   case vmIntrinsics::_reverseBytes_s:           n = new ReverseBytesSNode( 0,   arg);  break;
2194   case vmIntrinsics::_reverseBytes_i:           n = new ReverseBytesINode( 0,   arg);  break;
2195   case vmIntrinsics::_reverseBytes_l:           n = new ReverseBytesLNode( 0,   arg);  break;
2196   default:  fatal_unexpected_iid(id);  break;
2197   }
2198   set_result(_gvn.transform(n));
2199   return true;
2200 }
2201 
2202 //----------------------------inline_unsafe_access----------------------------
2203 
2204 // Helper that guards and inserts a pre-barrier.
2205 void LibraryCallKit::insert_pre_barrier(Node* base_oop, Node* offset,
2206                                         Node* pre_val, bool need_mem_bar) {
2207   // We could be accessing the referent field of a reference object. If so, when G1
2208   // is enabled, we need to log the value in the referent field in an SATB buffer.
2209   // This routine performs some compile time filters and generates suitable
2210   // runtime filters that guard the pre-barrier code.
2211   // Also add memory barrier for non volatile load from the referent field
2212   // to prevent commoning of loads across safepoint.
2213   if (!UseG1GC && !need_mem_bar)
2214     return;
2215 
2216   // Some compile time checks.
2217 
2218   // If offset is a constant, is it java_lang_ref_Reference::_reference_offset?
2219   const TypeX* otype = offset->find_intptr_t_type();
2220   if (otype != NULL && otype->is_con() &&
2221       otype->get_con() != java_lang_ref_Reference::referent_offset) {
2222     // Constant offset but not the reference_offset so just return
2223     return;
2224   }
2225 
2226   // We only need to generate the runtime guards for instances.
2227   const TypeOopPtr* btype = base_oop->bottom_type()->isa_oopptr();
2228   if (btype != NULL) {
2229     if (btype->isa_aryptr()) {
2230       // Array type so nothing to do
2231       return;
2232     }
2233 
2234     const TypeInstPtr* itype = btype->isa_instptr();
2235     if (itype != NULL) {
2236       // Can the klass of base_oop be statically determined to be
2237       // _not_ a sub-class of Reference and _not_ Object?
2238       ciKlass* klass = itype->klass();
2239       if ( klass->is_loaded() &&
2240           !klass->is_subtype_of(env()->Reference_klass()) &&
2241           !env()->Object_klass()->is_subtype_of(klass)) {
2242         return;
2243       }
2244     }
2245   }
2246 
2247   // The compile time filters did not reject base_oop/offset so
2248   // we need to generate the following runtime filters
2249   //
2250   // if (offset == java_lang_ref_Reference::_reference_offset) {
2251   //   if (instance_of(base, java.lang.ref.Reference)) {
2252   //     pre_barrier(_, pre_val, ...);
2253   //   }
2254   // }
2255 
2256   float likely   = PROB_LIKELY(  0.999);
2257   float unlikely = PROB_UNLIKELY(0.999);
2258 
2259   IdealKit ideal(this);
2260 #define __ ideal.
2261 
2262   Node* referent_off = __ ConX(java_lang_ref_Reference::referent_offset);
2263 
2264   __ if_then(offset, BoolTest::eq, referent_off, unlikely); {
2265       // Update graphKit memory and control from IdealKit.
2266       sync_kit(ideal);
2267 
2268       Node* ref_klass_con = makecon(TypeKlassPtr::make(env()->Reference_klass()));
2269       Node* is_instof = gen_instanceof(base_oop, ref_klass_con);
2270 
2271       // Update IdealKit memory and control from graphKit.
2272       __ sync_kit(this);
2273 
2274       Node* one = __ ConI(1);
2275       // is_instof == 0 if base_oop == NULL
2276       __ if_then(is_instof, BoolTest::eq, one, unlikely); {
2277 
2278         // Update graphKit from IdeakKit.
2279         sync_kit(ideal);
2280 
2281         // Use the pre-barrier to record the value in the referent field
2282         pre_barrier(false /* do_load */,
2283                     __ ctrl(),
2284                     NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */,
2285                     pre_val /* pre_val */,
2286                     T_OBJECT);
2287         if (need_mem_bar) {
2288           // Add memory barrier to prevent commoning reads from this field
2289           // across safepoint since GC can change its value.
2290           insert_mem_bar(Op_MemBarCPUOrder);
2291         }
2292         // Update IdealKit from graphKit.
2293         __ sync_kit(this);
2294 
2295       } __ end_if(); // _ref_type != ref_none
2296   } __ end_if(); // offset == referent_offset
2297 
2298   // Final sync IdealKit and GraphKit.
2299   final_sync(ideal);
2300 #undef __
2301 }
2302 
2303 
2304 const TypeOopPtr* LibraryCallKit::sharpen_unsafe_type(Compile::AliasType* alias_type, const TypePtr *adr_type) {
2305   // Attempt to infer a sharper value type from the offset and base type.
2306   ciKlass* sharpened_klass = NULL;
2307 
2308   // See if it is an instance field, with an object type.
2309   if (alias_type->field() != NULL) {
2310     if (alias_type->field()->type()->is_klass()) {
2311       sharpened_klass = alias_type->field()->type()->as_klass();
2312     }
2313   }
2314 
2315   // See if it is a narrow oop array.
2316   if (adr_type->isa_aryptr()) {
2317     if (adr_type->offset() >= objArrayOopDesc::base_offset_in_bytes()) {
2318       const TypeOopPtr *elem_type = adr_type->is_aryptr()->elem()->isa_oopptr();
2319       if (elem_type != NULL) {
2320         sharpened_klass = elem_type->klass();
2321       }
2322     }
2323   }
2324 
2325   // The sharpened class might be unloaded if there is no class loader
2326   // contraint in place.
2327   if (sharpened_klass != NULL && sharpened_klass->is_loaded()) {
2328     const TypeOopPtr* tjp = TypeOopPtr::make_from_klass(sharpened_klass);
2329 
2330 #ifndef PRODUCT
2331     if (C->print_intrinsics() || C->print_inlining()) {
2332       tty->print("  from base type: ");  adr_type->dump();
2333       tty->print("  sharpened value: ");  tjp->dump();
2334     }
2335 #endif
2336     // Sharpen the value type.
2337     return tjp;
2338   }
2339   return NULL;
2340 }
2341 
2342 bool LibraryCallKit::inline_unsafe_access(bool is_store, const BasicType type, const AccessKind kind, const bool unaligned) {
2343   if (callee()->is_static())  return false;  // caller must have the capability!
2344   guarantee(!is_store || kind != Acquire, "Acquire accesses can be produced only for loads");
2345   guarantee( is_store || kind != Release, "Release accesses can be produced only for stores");
2346   assert(type != T_OBJECT || !unaligned, "unaligned access not supported with object type");
2347 
2348 #ifndef PRODUCT
2349   {
2350     ResourceMark rm;
2351     // Check the signatures.
2352     ciSignature* sig = callee()->signature();
2353 #ifdef ASSERT
2354     if (!is_store) {
2355       // Object getObject(Object base, int/long offset), etc.
2356       BasicType rtype = sig->return_type()->basic_type();
2357       assert(rtype == type, "getter must return the expected value");
2358       assert(sig->count() == 2, "oop getter has 2 arguments");
2359       assert(sig->type_at(0)->basic_type() == T_OBJECT, "getter base is object");
2360       assert(sig->type_at(1)->basic_type() == T_LONG, "getter offset is correct");
2361     } else {
2362       // void putObject(Object base, int/long offset, Object x), etc.
2363       assert(sig->return_type()->basic_type() == T_VOID, "putter must not return a value");
2364       assert(sig->count() == 3, "oop putter has 3 arguments");
2365       assert(sig->type_at(0)->basic_type() == T_OBJECT, "putter base is object");
2366       assert(sig->type_at(1)->basic_type() == T_LONG, "putter offset is correct");
2367       BasicType vtype = sig->type_at(sig->count()-1)->basic_type();
2368       assert(vtype == type, "putter must accept the expected value");
2369     }
2370 #endif // ASSERT
2371  }
2372 #endif //PRODUCT
2373 
2374   C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
2375 
2376   Node* receiver = argument(0);  // type: oop
2377 
2378   // Build address expression.
2379   Node* adr;
2380   Node* heap_base_oop = top();
2381   Node* offset = top();
2382   Node* val;
2383 
2384   // The base is either a Java object or a value produced by Unsafe.staticFieldBase
2385   Node* base = argument(1);  // type: oop
2386   // The offset is a value produced by Unsafe.staticFieldOffset or Unsafe.objectFieldOffset
2387   offset = argument(2);  // type: long
2388   // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
2389   // to be plain byte offsets, which are also the same as those accepted
2390   // by oopDesc::field_base.
2391   assert(Unsafe_field_offset_to_byte_offset(11) == 11,
2392          "fieldOffset must be byte-scaled");
2393   // 32-bit machines ignore the high half!
2394   offset = ConvL2X(offset);
2395   adr = make_unsafe_address(base, offset);
2396   if (_gvn.type(base)->isa_ptr() != TypePtr::NULL_PTR) {
2397     heap_base_oop = base;
2398   }
2399   val = is_store ? argument(4) : NULL;
2400 
2401   const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
2402 
2403   // Try to categorize the address.  If it comes up as TypeJavaPtr::BOTTOM,
2404   // there was not enough information to nail it down.
2405   Compile::AliasType* alias_type = C->alias_type(adr_type);
2406   assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here");
2407 
2408   // Only field, array element or unknown locations are supported.
2409   if (alias_type->adr_type() != TypeRawPtr::BOTTOM &&
2410       alias_type->adr_type() != TypeOopPtr::BOTTOM &&
2411       alias_type->basic_type() == T_ILLEGAL) {
2412     return false;
2413   }
2414 
2415   bool mismatched = false;
2416   BasicType bt = alias_type->basic_type();
2417   if (bt != T_ILLEGAL) {
2418     if (bt == T_BYTE && adr_type->isa_aryptr()) {
2419       // Alias type doesn't differentiate between byte[] and boolean[]).
2420       // Use address type to get the element type.
2421       bt = adr_type->is_aryptr()->elem()->array_element_basic_type();
2422     }
2423     if (bt == T_ARRAY || bt == T_NARROWOOP) {
2424       // accessing an array field with getObject is not a mismatch
2425       bt = T_OBJECT;
2426     }
2427     if ((bt == T_OBJECT) != (type == T_OBJECT)) {
2428       // Don't intrinsify mismatched object accesses
2429       return false;
2430     }
2431     mismatched = (bt != type);
2432   }
2433 
2434   // First guess at the value type.
2435   const Type *value_type = Type::get_const_basic_type(type);
2436 
2437   // We will need memory barriers unless we can determine a unique
2438   // alias category for this reference.  (Note:  If for some reason
2439   // the barriers get omitted and the unsafe reference begins to "pollute"
2440   // the alias analysis of the rest of the graph, either Compile::can_alias
2441   // or Compile::must_alias will throw a diagnostic assert.)
2442   bool need_mem_bar;
2443   switch (kind) {
2444       case Relaxed:
2445           need_mem_bar = (alias_type->adr_type() == TypeOopPtr::BOTTOM);
2446           break;
2447       case Opaque:
2448           // Opaque uses CPUOrder membars for protection against code movement.
2449       case Acquire:
2450       case Release:
2451       case Volatile:
2452           need_mem_bar = true;
2453           break;
2454       default:
2455           ShouldNotReachHere();
2456   }
2457 
2458   // Some accesses require access atomicity for all types, notably longs and doubles.
2459   // When AlwaysAtomicAccesses is enabled, all accesses are atomic.
2460   bool requires_atomic_access = false;
2461   switch (kind) {
2462       case Relaxed:
2463           requires_atomic_access = AlwaysAtomicAccesses;
2464           break;
2465       case Opaque:
2466           // Opaque accesses are atomic.
2467       case Acquire:
2468       case Release:
2469       case Volatile:
2470           requires_atomic_access = true;
2471           break;
2472       default:
2473           ShouldNotReachHere();
2474   }
2475 
2476   // Figure out the memory ordering.
2477   // Acquire/Release/Volatile accesses require marking the loads/stores with MemOrd
2478   MemNode::MemOrd mo = access_kind_to_memord_LS(kind, is_store);
2479 
2480   // If we are reading the value of the referent field of a Reference
2481   // object (either by using Unsafe directly or through reflection)
2482   // then, if G1 is enabled, we need to record the referent in an
2483   // SATB log buffer using the pre-barrier mechanism.
2484   // Also we need to add memory barrier to prevent commoning reads
2485   // from this field across safepoint since GC can change its value.
2486   bool need_read_barrier = !is_store &&
2487                            offset != top() && heap_base_oop != top();
2488 
2489   if (!is_store && type == T_OBJECT) {
2490     const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type);
2491     if (tjp != NULL) {
2492       value_type = tjp;
2493     }
2494   }
2495 
2496   receiver = null_check(receiver);
2497   if (stopped()) {
2498     return true;
2499   }
2500   // Heap pointers get a null-check from the interpreter,
2501   // as a courtesy.  However, this is not guaranteed by Unsafe,
2502   // and it is not possible to fully distinguish unintended nulls
2503   // from intended ones in this API.
2504 
2505   // We need to emit leading and trailing CPU membars (see below) in
2506   // addition to memory membars for special access modes. This is a little
2507   // too strong, but avoids the need to insert per-alias-type
2508   // volatile membars (for stores; compare Parse::do_put_xxx), which
2509   // we cannot do effectively here because we probably only have a
2510   // rough approximation of type.
2511 
2512   switch(kind) {
2513     case Relaxed:
2514     case Opaque:
2515     case Acquire:
2516       break;
2517     case Release:
2518     case Volatile:
2519       if (is_store) {
2520         insert_mem_bar(Op_MemBarRelease);
2521       } else {
2522         if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2523           insert_mem_bar(Op_MemBarVolatile);
2524         }
2525       }
2526       break;
2527     default:
2528       ShouldNotReachHere();
2529   }
2530 
2531   // Memory barrier to prevent normal and 'unsafe' accesses from
2532   // bypassing each other.  Happens after null checks, so the
2533   // exception paths do not take memory state from the memory barrier,
2534   // so there's no problems making a strong assert about mixing users
2535   // of safe & unsafe memory.
2536   if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder);
2537 
2538   if (!is_store) {
2539     Node* p = NULL;
2540     // Try to constant fold a load from a constant field
2541     ciField* field = alias_type->field();
2542     if (heap_base_oop != top() && field != NULL && field->is_constant() && !mismatched) {
2543       // final or stable field
2544       p = make_constant_from_field(field, heap_base_oop);
2545     }
2546     if (p == NULL) {
2547       // To be valid, unsafe loads may depend on other conditions than
2548       // the one that guards them: pin the Load node
2549       p = make_load(control(), adr, value_type, type, adr_type, mo, LoadNode::Pinned, requires_atomic_access, unaligned, mismatched);
2550       // load value
2551       switch (type) {
2552       case T_BOOLEAN:
2553       case T_CHAR:
2554       case T_BYTE:
2555       case T_SHORT:
2556       case T_INT:
2557       case T_LONG:
2558       case T_FLOAT:
2559       case T_DOUBLE:
2560         break;
2561       case T_OBJECT:
2562         if (need_read_barrier) {
2563           // We do not require a mem bar inside pre_barrier if need_mem_bar
2564           // is set: the barriers would be emitted by us.
2565           insert_pre_barrier(heap_base_oop, offset, p, !need_mem_bar);
2566         }
2567         break;
2568       case T_ADDRESS:
2569         // Cast to an int type.
2570         p = _gvn.transform(new CastP2XNode(NULL, p));
2571         p = ConvX2UL(p);
2572         break;
2573       default:
2574         fatal("unexpected type %d: %s", type, type2name(type));
2575         break;
2576       }
2577     }
2578     // The load node has the control of the preceding MemBarCPUOrder.  All
2579     // following nodes will have the control of the MemBarCPUOrder inserted at
2580     // the end of this method.  So, pushing the load onto the stack at a later
2581     // point is fine.
2582     set_result(p);
2583   } else {
2584     // place effect of store into memory
2585     switch (type) {
2586     case T_DOUBLE:
2587       val = dstore_rounding(val);
2588       break;
2589     case T_ADDRESS:
2590       // Repackage the long as a pointer.
2591       val = ConvL2X(val);
2592       val = _gvn.transform(new CastX2PNode(val));
2593       break;
2594     }
2595 
2596     if (type != T_OBJECT) {
2597       (void) store_to_memory(control(), adr, val, type, adr_type, mo, requires_atomic_access, unaligned, mismatched);
2598     } else {
2599       // Possibly an oop being stored to Java heap or native memory
2600       if (!TypePtr::NULL_PTR->higher_equal(_gvn.type(heap_base_oop))) {
2601         // oop to Java heap.
2602         (void) store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo, mismatched);
2603       } else {
2604         // We can't tell at compile time if we are storing in the Java heap or outside
2605         // of it. So we need to emit code to conditionally do the proper type of
2606         // store.
2607 
2608         IdealKit ideal(this);
2609 #define __ ideal.
2610         // QQQ who knows what probability is here??
2611         __ if_then(heap_base_oop, BoolTest::ne, null(), PROB_UNLIKELY(0.999)); {
2612           // Sync IdealKit and graphKit.
2613           sync_kit(ideal);
2614           Node* st = store_oop_to_unknown(control(), heap_base_oop, adr, adr_type, val, type, mo, mismatched);
2615           // Update IdealKit memory.
2616           __ sync_kit(this);
2617         } __ else_(); {
2618           __ store(__ ctrl(), adr, val, type, alias_type->index(), mo, requires_atomic_access, mismatched);
2619         } __ end_if();
2620         // Final sync IdealKit and GraphKit.
2621         final_sync(ideal);
2622 #undef __
2623       }
2624     }
2625   }
2626 
2627   switch(kind) {
2628     case Relaxed:
2629     case Opaque:
2630     case Release:
2631       break;
2632     case Acquire:
2633     case Volatile:
2634       if (!is_store) {
2635         insert_mem_bar(Op_MemBarAcquire);
2636       } else {
2637         if (!support_IRIW_for_not_multiple_copy_atomic_cpu) {
2638           insert_mem_bar(Op_MemBarVolatile);
2639         }
2640       }
2641       break;
2642     default:
2643       ShouldNotReachHere();
2644   }
2645 
2646   if (need_mem_bar) insert_mem_bar(Op_MemBarCPUOrder);
2647 
2648   return true;
2649 }
2650 
2651 //----------------------------inline_unsafe_load_store----------------------------
2652 // This method serves a couple of different customers (depending on LoadStoreKind):
2653 //
2654 // LS_cmp_swap:
2655 //
2656 //   boolean compareAndSwapObject(Object o, long offset, Object expected, Object x);
2657 //   boolean compareAndSwapInt(   Object o, long offset, int    expected, int    x);
2658 //   boolean compareAndSwapLong(  Object o, long offset, long   expected, long   x);
2659 //
2660 // LS_cmp_swap_weak:
2661 //
2662 //   boolean weakCompareAndSwapObject(       Object o, long offset, Object expected, Object x);
2663 //   boolean weakCompareAndSwapObjectAcquire(Object o, long offset, Object expected, Object x);
2664 //   boolean weakCompareAndSwapObjectRelease(Object o, long offset, Object expected, Object x);
2665 //
2666 //   boolean weakCompareAndSwapInt(          Object o, long offset, int    expected, int    x);
2667 //   boolean weakCompareAndSwapIntAcquire(   Object o, long offset, int    expected, int    x);
2668 //   boolean weakCompareAndSwapIntRelease(   Object o, long offset, int    expected, int    x);
2669 //
2670 //   boolean weakCompareAndSwapLong(         Object o, long offset, long   expected, long   x);
2671 //   boolean weakCompareAndSwapLongAcquire(  Object o, long offset, long   expected, long   x);
2672 //   boolean weakCompareAndSwapLongRelease(  Object o, long offset, long   expected, long   x);
2673 //
2674 // LS_cmp_exchange:
2675 //
2676 //   Object compareAndExchangeObjectVolatile(Object o, long offset, Object expected, Object x);
2677 //   Object compareAndExchangeObjectAcquire( Object o, long offset, Object expected, Object x);
2678 //   Object compareAndExchangeObjectRelease( Object o, long offset, Object expected, Object x);
2679 //
2680 //   Object compareAndExchangeIntVolatile(   Object o, long offset, Object expected, Object x);
2681 //   Object compareAndExchangeIntAcquire(    Object o, long offset, Object expected, Object x);
2682 //   Object compareAndExchangeIntRelease(    Object o, long offset, Object expected, Object x);
2683 //
2684 //   Object compareAndExchangeLongVolatile(  Object o, long offset, Object expected, Object x);
2685 //   Object compareAndExchangeLongAcquire(   Object o, long offset, Object expected, Object x);
2686 //   Object compareAndExchangeLongRelease(   Object o, long offset, Object expected, Object x);
2687 //
2688 // LS_get_add:
2689 //
2690 //   int  getAndAddInt( Object o, long offset, int  delta)
2691 //   long getAndAddLong(Object o, long offset, long delta)
2692 //
2693 // LS_get_set:
2694 //
2695 //   int    getAndSet(Object o, long offset, int    newValue)
2696 //   long   getAndSet(Object o, long offset, long   newValue)
2697 //   Object getAndSet(Object o, long offset, Object newValue)
2698 //
2699 bool LibraryCallKit::inline_unsafe_load_store(const BasicType type, const LoadStoreKind kind, const AccessKind access_kind) {
2700   // This basic scheme here is the same as inline_unsafe_access, but
2701   // differs in enough details that combining them would make the code
2702   // overly confusing.  (This is a true fact! I originally combined
2703   // them, but even I was confused by it!) As much code/comments as
2704   // possible are retained from inline_unsafe_access though to make
2705   // the correspondences clearer. - dl
2706 
2707   if (callee()->is_static())  return false;  // caller must have the capability!
2708 
2709 #ifndef PRODUCT
2710   BasicType rtype;
2711   {
2712     ResourceMark rm;
2713     // Check the signatures.
2714     ciSignature* sig = callee()->signature();
2715     rtype = sig->return_type()->basic_type();
2716     switch(kind) {
2717       case LS_get_add:
2718       case LS_get_set: {
2719       // Check the signatures.
2720 #ifdef ASSERT
2721       assert(rtype == type, "get and set must return the expected type");
2722       assert(sig->count() == 3, "get and set has 3 arguments");
2723       assert(sig->type_at(0)->basic_type() == T_OBJECT, "get and set base is object");
2724       assert(sig->type_at(1)->basic_type() == T_LONG, "get and set offset is long");
2725       assert(sig->type_at(2)->basic_type() == type, "get and set must take expected type as new value/delta");
2726       assert(access_kind == Volatile, "mo is not passed to intrinsic nodes in current implementation");
2727 #endif // ASSERT
2728         break;
2729       }
2730       case LS_cmp_swap:
2731       case LS_cmp_swap_weak: {
2732       // Check the signatures.
2733 #ifdef ASSERT
2734       assert(rtype == T_BOOLEAN, "CAS must return boolean");
2735       assert(sig->count() == 4, "CAS has 4 arguments");
2736       assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object");
2737       assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long");
2738 #endif // ASSERT
2739         break;
2740       }
2741       case LS_cmp_exchange: {
2742       // Check the signatures.
2743 #ifdef ASSERT
2744       assert(rtype == type, "CAS must return the expected type");
2745       assert(sig->count() == 4, "CAS has 4 arguments");
2746       assert(sig->type_at(0)->basic_type() == T_OBJECT, "CAS base is object");
2747       assert(sig->type_at(1)->basic_type() == T_LONG, "CAS offset is long");
2748 #endif // ASSERT
2749         break;
2750       }
2751       default:
2752         ShouldNotReachHere();
2753     }
2754   }
2755 #endif //PRODUCT
2756 
2757   C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
2758 
2759   // Get arguments:
2760   Node* receiver = NULL;
2761   Node* base     = NULL;
2762   Node* offset   = NULL;
2763   Node* oldval   = NULL;
2764   Node* newval   = NULL;
2765   switch(kind) {
2766     case LS_cmp_swap:
2767     case LS_cmp_swap_weak:
2768     case LS_cmp_exchange: {
2769       const bool two_slot_type = type2size[type] == 2;
2770       receiver = argument(0);  // type: oop
2771       base     = argument(1);  // type: oop
2772       offset   = argument(2);  // type: long
2773       oldval   = argument(4);  // type: oop, int, or long
2774       newval   = argument(two_slot_type ? 6 : 5);  // type: oop, int, or long
2775       break;
2776     }
2777     case LS_get_add:
2778     case LS_get_set: {
2779       receiver = argument(0);  // type: oop
2780       base     = argument(1);  // type: oop
2781       offset   = argument(2);  // type: long
2782       oldval   = NULL;
2783       newval   = argument(4);  // type: oop, int, or long
2784       break;
2785     }
2786     default:
2787       ShouldNotReachHere();
2788   }
2789 
2790   // Build field offset expression.
2791   // We currently rely on the cookies produced by Unsafe.xxxFieldOffset
2792   // to be plain byte offsets, which are also the same as those accepted
2793   // by oopDesc::field_base.
2794   assert(Unsafe_field_offset_to_byte_offset(11) == 11, "fieldOffset must be byte-scaled");
2795   // 32-bit machines ignore the high half of long offsets
2796   offset = ConvL2X(offset);
2797   Node* adr = make_unsafe_address(base, offset);
2798   const TypePtr *adr_type = _gvn.type(adr)->isa_ptr();
2799 
2800   Compile::AliasType* alias_type = C->alias_type(adr_type);
2801   BasicType bt = alias_type->basic_type();
2802   if (bt != T_ILLEGAL &&
2803       ((bt == T_OBJECT || bt == T_ARRAY) != (type == T_OBJECT))) {
2804     // Don't intrinsify mismatched object accesses.
2805     return false;
2806   }
2807 
2808   // For CAS, unlike inline_unsafe_access, there seems no point in
2809   // trying to refine types. Just use the coarse types here.
2810   assert(alias_type->index() != Compile::AliasIdxBot, "no bare pointers here");
2811   const Type *value_type = Type::get_const_basic_type(type);
2812 
2813   switch (kind) {
2814     case LS_get_set:
2815     case LS_cmp_exchange: {
2816       if (type == T_OBJECT) {
2817         const TypeOopPtr* tjp = sharpen_unsafe_type(alias_type, adr_type);
2818         if (tjp != NULL) {
2819           value_type = tjp;
2820         }
2821       }
2822       break;
2823     }
2824     case LS_cmp_swap:
2825     case LS_cmp_swap_weak:
2826     case LS_get_add:
2827       break;
2828     default:
2829       ShouldNotReachHere();
2830   }
2831 
2832   // Null check receiver.
2833   receiver = null_check(receiver);
2834   if (stopped()) {
2835     return true;
2836   }
2837 
2838   int alias_idx = C->get_alias_index(adr_type);
2839 
2840   // Memory-model-wise, a LoadStore acts like a little synchronized
2841   // block, so needs barriers on each side.  These don't translate
2842   // into actual barriers on most machines, but we still need rest of
2843   // compiler to respect ordering.
2844 
2845   switch (access_kind) {
2846     case Relaxed:
2847     case Acquire:
2848       break;
2849     case Release:
2850       insert_mem_bar(Op_MemBarRelease);
2851       break;
2852     case Volatile:
2853       if (support_IRIW_for_not_multiple_copy_atomic_cpu) {
2854         insert_mem_bar(Op_MemBarVolatile);
2855       } else {
2856         insert_mem_bar(Op_MemBarRelease);
2857       }
2858       break;
2859     default:
2860       ShouldNotReachHere();
2861   }
2862   insert_mem_bar(Op_MemBarCPUOrder);
2863 
2864   // Figure out the memory ordering.
2865   MemNode::MemOrd mo = access_kind_to_memord(access_kind);
2866 
2867   // 4984716: MemBars must be inserted before this
2868   //          memory node in order to avoid a false
2869   //          dependency which will confuse the scheduler.
2870   Node *mem = memory(alias_idx);
2871 
2872   // For now, we handle only those cases that actually exist: ints,
2873   // longs, and Object. Adding others should be straightforward.
2874   Node* load_store = NULL;
2875   switch(type) {
2876   case T_BYTE:
2877     switch(kind) {
2878       case LS_get_add:
2879         load_store = _gvn.transform(new GetAndAddBNode(control(), mem, adr, newval, adr_type));
2880         break;
2881       case LS_get_set:
2882         load_store = _gvn.transform(new GetAndSetBNode(control(), mem, adr, newval, adr_type));
2883         break;
2884       case LS_cmp_swap_weak:
2885         load_store = _gvn.transform(new WeakCompareAndSwapBNode(control(), mem, adr, newval, oldval, mo));
2886         break;
2887       case LS_cmp_swap:
2888         load_store = _gvn.transform(new CompareAndSwapBNode(control(), mem, adr, newval, oldval, mo));
2889         break;
2890       case LS_cmp_exchange:
2891         load_store = _gvn.transform(new CompareAndExchangeBNode(control(), mem, adr, newval, oldval, adr_type, mo));
2892         break;
2893       default:
2894         ShouldNotReachHere();
2895     }
2896     break;
2897   case T_SHORT:
2898     switch(kind) {
2899       case LS_get_add:
2900         load_store = _gvn.transform(new GetAndAddSNode(control(), mem, adr, newval, adr_type));
2901         break;
2902       case LS_get_set:
2903         load_store = _gvn.transform(new GetAndSetSNode(control(), mem, adr, newval, adr_type));
2904         break;
2905       case LS_cmp_swap_weak:
2906         load_store = _gvn.transform(new WeakCompareAndSwapSNode(control(), mem, adr, newval, oldval, mo));
2907         break;
2908       case LS_cmp_swap:
2909         load_store = _gvn.transform(new CompareAndSwapSNode(control(), mem, adr, newval, oldval, mo));
2910         break;
2911       case LS_cmp_exchange:
2912         load_store = _gvn.transform(new CompareAndExchangeSNode(control(), mem, adr, newval, oldval, adr_type, mo));
2913         break;
2914       default:
2915         ShouldNotReachHere();
2916     }
2917     break;
2918   case T_INT:
2919     switch(kind) {
2920       case LS_get_add:
2921         load_store = _gvn.transform(new GetAndAddINode(control(), mem, adr, newval, adr_type));
2922         break;
2923       case LS_get_set:
2924         load_store = _gvn.transform(new GetAndSetINode(control(), mem, adr, newval, adr_type));
2925         break;
2926       case LS_cmp_swap_weak:
2927         load_store = _gvn.transform(new WeakCompareAndSwapINode(control(), mem, adr, newval, oldval, mo));
2928         break;
2929       case LS_cmp_swap:
2930         load_store = _gvn.transform(new CompareAndSwapINode(control(), mem, adr, newval, oldval, mo));
2931         break;
2932       case LS_cmp_exchange:
2933         load_store = _gvn.transform(new CompareAndExchangeINode(control(), mem, adr, newval, oldval, adr_type, mo));
2934         break;
2935       default:
2936         ShouldNotReachHere();
2937     }
2938     break;
2939   case T_LONG:
2940     switch(kind) {
2941       case LS_get_add:
2942         load_store = _gvn.transform(new GetAndAddLNode(control(), mem, adr, newval, adr_type));
2943         break;
2944       case LS_get_set:
2945         load_store = _gvn.transform(new GetAndSetLNode(control(), mem, adr, newval, adr_type));
2946         break;
2947       case LS_cmp_swap_weak:
2948         load_store = _gvn.transform(new WeakCompareAndSwapLNode(control(), mem, adr, newval, oldval, mo));
2949         break;
2950       case LS_cmp_swap:
2951         load_store = _gvn.transform(new CompareAndSwapLNode(control(), mem, adr, newval, oldval, mo));
2952         break;
2953       case LS_cmp_exchange:
2954         load_store = _gvn.transform(new CompareAndExchangeLNode(control(), mem, adr, newval, oldval, adr_type, mo));
2955         break;
2956       default:
2957         ShouldNotReachHere();
2958     }
2959     break;
2960   case T_OBJECT:
2961     // Transformation of a value which could be NULL pointer (CastPP #NULL)
2962     // could be delayed during Parse (for example, in adjust_map_after_if()).
2963     // Execute transformation here to avoid barrier generation in such case.
2964     if (_gvn.type(newval) == TypePtr::NULL_PTR)
2965       newval = _gvn.makecon(TypePtr::NULL_PTR);
2966 
2967     // Reference stores need a store barrier.
2968     switch(kind) {
2969       case LS_get_set: {
2970         // If pre-barrier must execute before the oop store, old value will require do_load here.
2971         if (!can_move_pre_barrier()) {
2972           pre_barrier(true /* do_load*/,
2973                       control(), base, adr, alias_idx, newval, value_type->make_oopptr(),
2974                       NULL /* pre_val*/,
2975                       T_OBJECT);
2976         } // Else move pre_barrier to use load_store value, see below.
2977         break;
2978       }
2979       case LS_cmp_swap_weak:
2980       case LS_cmp_swap:
2981       case LS_cmp_exchange: {
2982         // Same as for newval above:
2983         if (_gvn.type(oldval) == TypePtr::NULL_PTR) {
2984           oldval = _gvn.makecon(TypePtr::NULL_PTR);
2985         }
2986         // The only known value which might get overwritten is oldval.
2987         pre_barrier(false /* do_load */,
2988                     control(), NULL, NULL, max_juint, NULL, NULL,
2989                     oldval /* pre_val */,
2990                     T_OBJECT);
2991         break;
2992       }
2993       default:
2994         ShouldNotReachHere();
2995     }
2996 
2997 #ifdef _LP64
2998     if (adr->bottom_type()->is_ptr_to_narrowoop()) {
2999       Node *newval_enc = _gvn.transform(new EncodePNode(newval, newval->bottom_type()->make_narrowoop()));
3000 
3001       switch(kind) {
3002         case LS_get_set:
3003           load_store = _gvn.transform(new GetAndSetNNode(control(), mem, adr, newval_enc, adr_type, value_type->make_narrowoop()));
3004           break;
3005         case LS_cmp_swap_weak: {
3006           Node *oldval_enc = _gvn.transform(new EncodePNode(oldval, oldval->bottom_type()->make_narrowoop()));
3007           load_store = _gvn.transform(new WeakCompareAndSwapNNode(control(), mem, adr, newval_enc, oldval_enc, mo));
3008           break;
3009         }
3010         case LS_cmp_swap: {
3011           Node *oldval_enc = _gvn.transform(new EncodePNode(oldval, oldval->bottom_type()->make_narrowoop()));
3012           load_store = _gvn.transform(new CompareAndSwapNNode(control(), mem, adr, newval_enc, oldval_enc, mo));
3013           break;
3014         }
3015         case LS_cmp_exchange: {
3016           Node *oldval_enc = _gvn.transform(new EncodePNode(oldval, oldval->bottom_type()->make_narrowoop()));
3017           load_store = _gvn.transform(new CompareAndExchangeNNode(control(), mem, adr, newval_enc, oldval_enc, adr_type, value_type->make_narrowoop(), mo));
3018           break;
3019         }
3020         default:
3021           ShouldNotReachHere();
3022       }
3023     } else
3024 #endif
3025     switch (kind) {
3026       case LS_get_set:
3027         load_store = _gvn.transform(new GetAndSetPNode(control(), mem, adr, newval, adr_type, value_type->is_oopptr()));
3028         break;
3029       case LS_cmp_swap_weak:
3030         load_store = _gvn.transform(new WeakCompareAndSwapPNode(control(), mem, adr, newval, oldval, mo));
3031         break;
3032       case LS_cmp_swap:
3033         load_store = _gvn.transform(new CompareAndSwapPNode(control(), mem, adr, newval, oldval, mo));
3034         break;
3035       case LS_cmp_exchange:
3036         load_store = _gvn.transform(new CompareAndExchangePNode(control(), mem, adr, newval, oldval, adr_type, value_type->is_oopptr(), mo));
3037         break;
3038       default:
3039         ShouldNotReachHere();
3040     }
3041 
3042     // Emit the post barrier only when the actual store happened. This makes sense
3043     // to check only for LS_cmp_* that can fail to set the value.
3044     // LS_cmp_exchange does not produce any branches by default, so there is no
3045     // boolean result to piggyback on. TODO: When we merge CompareAndSwap with
3046     // CompareAndExchange and move branches here, it would make sense to conditionalize
3047     // post_barriers for LS_cmp_exchange as well.
3048     //
3049     // CAS success path is marked more likely since we anticipate this is a performance
3050     // critical path, while CAS failure path can use the penalty for going through unlikely
3051     // path as backoff. Which is still better than doing a store barrier there.
3052     switch (kind) {
3053       case LS_get_set:
3054       case LS_cmp_exchange: {
3055         post_barrier(control(), load_store, base, adr, alias_idx, newval, T_OBJECT, true);
3056         break;
3057       }
3058       case LS_cmp_swap_weak:
3059       case LS_cmp_swap: {
3060         IdealKit ideal(this);
3061         ideal.if_then(load_store, BoolTest::ne, ideal.ConI(0), PROB_STATIC_FREQUENT); {
3062           sync_kit(ideal);
3063           post_barrier(ideal.ctrl(), load_store, base, adr, alias_idx, newval, T_OBJECT, true);
3064           ideal.sync_kit(this);
3065         } ideal.end_if();
3066         final_sync(ideal);
3067         break;
3068       }
3069       default:
3070         ShouldNotReachHere();
3071     }
3072     break;
3073   default:
3074     fatal("unexpected type %d: %s", type, type2name(type));
3075     break;
3076   }
3077 
3078   // SCMemProjNodes represent the memory state of a LoadStore. Their
3079   // main role is to prevent LoadStore nodes from being optimized away
3080   // when their results aren't used.
3081   Node* proj = _gvn.transform(new SCMemProjNode(load_store));
3082   set_memory(proj, alias_idx);
3083 
3084   if (type == T_OBJECT && (kind == LS_get_set || kind == LS_cmp_exchange)) {
3085 #ifdef _LP64
3086     if (adr->bottom_type()->is_ptr_to_narrowoop()) {
3087       load_store = _gvn.transform(new DecodeNNode(load_store, load_store->get_ptr_type()));
3088     }
3089 #endif
3090     if (can_move_pre_barrier()) {
3091       // Don't need to load pre_val. The old value is returned by load_store.
3092       // The pre_barrier can execute after the xchg as long as no safepoint
3093       // gets inserted between them.
3094       pre_barrier(false /* do_load */,
3095                   control(), NULL, NULL, max_juint, NULL, NULL,
3096                   load_store /* pre_val */,
3097                   T_OBJECT);
3098     }
3099   }
3100 
3101   // Add the trailing membar surrounding the access
3102   insert_mem_bar(Op_MemBarCPUOrder);
3103 
3104   switch (access_kind) {
3105     case Relaxed:
3106     case Release:
3107       break; // do nothing
3108     case Acquire:
3109     case Volatile:
3110       insert_mem_bar(Op_MemBarAcquire);
3111       // !support_IRIW_for_not_multiple_copy_atomic_cpu handled in platform code
3112       break;
3113     default:
3114       ShouldNotReachHere();
3115   }
3116 
3117   assert(type2size[load_store->bottom_type()->basic_type()] == type2size[rtype], "result type should match");
3118   set_result(load_store);
3119   return true;
3120 }
3121 
3122 MemNode::MemOrd LibraryCallKit::access_kind_to_memord_LS(AccessKind kind, bool is_store) {
3123   MemNode::MemOrd mo = MemNode::unset;
3124   switch(kind) {
3125     case Opaque:
3126     case Relaxed:  mo = MemNode::unordered; break;
3127     case Acquire:  mo = MemNode::acquire;   break;
3128     case Release:  mo = MemNode::release;   break;
3129     case Volatile: mo = is_store ? MemNode::release : MemNode::acquire; break;
3130     default:
3131       ShouldNotReachHere();
3132   }
3133   guarantee(mo != MemNode::unset, "Should select memory ordering");
3134   return mo;
3135 }
3136 
3137 MemNode::MemOrd LibraryCallKit::access_kind_to_memord(AccessKind kind) {
3138   MemNode::MemOrd mo = MemNode::unset;
3139   switch(kind) {
3140     case Opaque:
3141     case Relaxed:  mo = MemNode::unordered; break;
3142     case Acquire:  mo = MemNode::acquire;   break;
3143     case Release:  mo = MemNode::release;   break;
3144     case Volatile: mo = MemNode::seqcst;    break;
3145     default:
3146       ShouldNotReachHere();
3147   }
3148   guarantee(mo != MemNode::unset, "Should select memory ordering");
3149   return mo;
3150 }
3151 
3152 bool LibraryCallKit::inline_unsafe_fence(vmIntrinsics::ID id) {
3153   // Regardless of form, don't allow previous ld/st to move down,
3154   // then issue acquire, release, or volatile mem_bar.
3155   insert_mem_bar(Op_MemBarCPUOrder);
3156   switch(id) {
3157     case vmIntrinsics::_loadFence:
3158       insert_mem_bar(Op_LoadFence);
3159       return true;
3160     case vmIntrinsics::_storeFence:
3161       insert_mem_bar(Op_StoreFence);
3162       return true;
3163     case vmIntrinsics::_fullFence:
3164       insert_mem_bar(Op_MemBarVolatile);
3165       return true;
3166     default:
3167       fatal_unexpected_iid(id);
3168       return false;
3169   }
3170 }
3171 
3172 bool LibraryCallKit::inline_onspinwait() {
3173   insert_mem_bar(Op_OnSpinWait);
3174   return true;
3175 }
3176 
3177 bool LibraryCallKit::klass_needs_init_guard(Node* kls) {
3178   if (!kls->is_Con()) {
3179     return true;
3180   }
3181   const TypeKlassPtr* klsptr = kls->bottom_type()->isa_klassptr();
3182   if (klsptr == NULL) {
3183     return true;
3184   }
3185   ciInstanceKlass* ik = klsptr->klass()->as_instance_klass();
3186   // don't need a guard for a klass that is already initialized
3187   return !ik->is_initialized();
3188 }
3189 
3190 //----------------------------inline_unsafe_allocate---------------------------
3191 // public native Object Unsafe.allocateInstance(Class<?> cls);
3192 bool LibraryCallKit::inline_unsafe_allocate() {
3193   if (callee()->is_static())  return false;  // caller must have the capability!
3194 
3195   null_check_receiver();  // null-check, then ignore
3196   Node* cls = null_check(argument(1));
3197   if (stopped())  return true;
3198 
3199   Node* kls = load_klass_from_mirror(cls, false, NULL, 0);
3200   kls = null_check(kls);
3201   if (stopped())  return true;  // argument was like int.class
3202 
3203   Node* test = NULL;
3204   if (LibraryCallKit::klass_needs_init_guard(kls)) {
3205     // Note:  The argument might still be an illegal value like
3206     // Serializable.class or Object[].class.   The runtime will handle it.
3207     // But we must make an explicit check for initialization.
3208     Node* insp = basic_plus_adr(kls, in_bytes(InstanceKlass::init_state_offset()));
3209     // Use T_BOOLEAN for InstanceKlass::_init_state so the compiler
3210     // can generate code to load it as unsigned byte.
3211     Node* inst = make_load(NULL, insp, TypeInt::UBYTE, T_BOOLEAN, MemNode::unordered);
3212     Node* bits = intcon(InstanceKlass::fully_initialized);
3213     test = _gvn.transform(new SubINode(inst, bits));
3214     // The 'test' is non-zero if we need to take a slow path.
3215   }
3216 
3217   Node* obj = new_instance(kls, test);
3218   set_result(obj);
3219   return true;
3220 }
3221 
3222 //------------------------inline_native_time_funcs--------------
3223 // inline code for System.currentTimeMillis() and System.nanoTime()
3224 // these have the same type and signature
3225 bool LibraryCallKit::inline_native_time_funcs(address funcAddr, const char* funcName) {
3226   const TypeFunc* tf = OptoRuntime::void_long_Type();
3227   const TypePtr* no_memory_effects = NULL;
3228   Node* time = make_runtime_call(RC_LEAF, tf, funcAddr, funcName, no_memory_effects);
3229   Node* value = _gvn.transform(new ProjNode(time, TypeFunc::Parms+0));
3230 #ifdef ASSERT
3231   Node* value_top = _gvn.transform(new ProjNode(time, TypeFunc::Parms+1));
3232   assert(value_top == top(), "second value must be top");
3233 #endif
3234   set_result(value);
3235   return true;
3236 }
3237 
3238 //------------------------inline_native_currentThread------------------
3239 bool LibraryCallKit::inline_native_currentThread() {
3240   Node* junk = NULL;
3241   set_result(generate_current_thread(junk));
3242   return true;
3243 }
3244 
3245 //------------------------inline_native_isInterrupted------------------
3246 // private native boolean java.lang.Thread.isInterrupted(boolean ClearInterrupted);
3247 bool LibraryCallKit::inline_native_isInterrupted() {
3248   // Add a fast path to t.isInterrupted(clear_int):
3249   //   (t == Thread.current() &&
3250   //    (!TLS._osthread._interrupted || WINDOWS_ONLY(false) NOT_WINDOWS(!clear_int)))
3251   //   ? TLS._osthread._interrupted : /*slow path:*/ t.isInterrupted(clear_int)
3252   // So, in the common case that the interrupt bit is false,
3253   // we avoid making a call into the VM.  Even if the interrupt bit
3254   // is true, if the clear_int argument is false, we avoid the VM call.
3255   // However, if the receiver is not currentThread, we must call the VM,
3256   // because there must be some locking done around the operation.
3257 
3258   // We only go to the fast case code if we pass two guards.
3259   // Paths which do not pass are accumulated in the slow_region.
3260 
3261   enum {
3262     no_int_result_path   = 1, // t == Thread.current() && !TLS._osthread._interrupted
3263     no_clear_result_path = 2, // t == Thread.current() &&  TLS._osthread._interrupted && !clear_int
3264     slow_result_path     = 3, // slow path: t.isInterrupted(clear_int)
3265     PATH_LIMIT
3266   };
3267 
3268   // Ensure that it's not possible to move the load of TLS._osthread._interrupted flag
3269   // out of the function.
3270   insert_mem_bar(Op_MemBarCPUOrder);
3271 
3272   RegionNode* result_rgn = new RegionNode(PATH_LIMIT);
3273   PhiNode*    result_val = new PhiNode(result_rgn, TypeInt::BOOL);
3274 
3275   RegionNode* slow_region = new RegionNode(1);
3276   record_for_igvn(slow_region);
3277 
3278   // (a) Receiving thread must be the current thread.
3279   Node* rec_thr = argument(0);
3280   Node* tls_ptr = NULL;
3281   Node* cur_thr = generate_current_thread(tls_ptr);
3282   Node* cmp_thr = _gvn.transform(new CmpPNode(cur_thr, rec_thr));
3283   Node* bol_thr = _gvn.transform(new BoolNode(cmp_thr, BoolTest::ne));
3284 
3285   generate_slow_guard(bol_thr, slow_region);
3286 
3287   // (b) Interrupt bit on TLS must be false.
3288   Node* p = basic_plus_adr(top()/*!oop*/, tls_ptr, in_bytes(JavaThread::osthread_offset()));
3289   Node* osthread = make_load(NULL, p, TypeRawPtr::NOTNULL, T_ADDRESS, MemNode::unordered);
3290   p = basic_plus_adr(top()/*!oop*/, osthread, in_bytes(OSThread::interrupted_offset()));
3291 
3292   // Set the control input on the field _interrupted read to prevent it floating up.
3293   Node* int_bit = make_load(control(), p, TypeInt::BOOL, T_INT, MemNode::unordered);
3294   Node* cmp_bit = _gvn.transform(new CmpINode(int_bit, intcon(0)));
3295   Node* bol_bit = _gvn.transform(new BoolNode(cmp_bit, BoolTest::ne));
3296 
3297   IfNode* iff_bit = create_and_map_if(control(), bol_bit, PROB_UNLIKELY_MAG(3), COUNT_UNKNOWN);
3298 
3299   // First fast path:  if (!TLS._interrupted) return false;
3300   Node* false_bit = _gvn.transform(new IfFalseNode(iff_bit));
3301   result_rgn->init_req(no_int_result_path, false_bit);
3302   result_val->init_req(no_int_result_path, intcon(0));
3303 
3304   // drop through to next case
3305   set_control( _gvn.transform(new IfTrueNode(iff_bit)));
3306 
3307 #ifndef _WINDOWS
3308   // (c) Or, if interrupt bit is set and clear_int is false, use 2nd fast path.
3309   Node* clr_arg = argument(1);
3310   Node* cmp_arg = _gvn.transform(new CmpINode(clr_arg, intcon(0)));
3311   Node* bol_arg = _gvn.transform(new BoolNode(cmp_arg, BoolTest::ne));
3312   IfNode* iff_arg = create_and_map_if(control(), bol_arg, PROB_FAIR, COUNT_UNKNOWN);
3313 
3314   // Second fast path:  ... else if (!clear_int) return true;
3315   Node* false_arg = _gvn.transform(new IfFalseNode(iff_arg));
3316   result_rgn->init_req(no_clear_result_path, false_arg);
3317   result_val->init_req(no_clear_result_path, intcon(1));
3318 
3319   // drop through to next case
3320   set_control( _gvn.transform(new IfTrueNode(iff_arg)));
3321 #else
3322   // To return true on Windows you must read the _interrupted field
3323   // and check the event state i.e. take the slow path.
3324 #endif // _WINDOWS
3325 
3326   // (d) Otherwise, go to the slow path.
3327   slow_region->add_req(control());
3328   set_control( _gvn.transform(slow_region));
3329 
3330   if (stopped()) {
3331     // There is no slow path.
3332     result_rgn->init_req(slow_result_path, top());
3333     result_val->init_req(slow_result_path, top());
3334   } else {
3335     // non-virtual because it is a private non-static
3336     CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_isInterrupted);
3337 
3338     Node* slow_val = set_results_for_java_call(slow_call);
3339     // this->control() comes from set_results_for_java_call
3340 
3341     Node* fast_io  = slow_call->in(TypeFunc::I_O);
3342     Node* fast_mem = slow_call->in(TypeFunc::Memory);
3343 
3344     // These two phis are pre-filled with copies of of the fast IO and Memory
3345     PhiNode* result_mem  = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
3346     PhiNode* result_io   = PhiNode::make(result_rgn, fast_io,  Type::ABIO);
3347 
3348     result_rgn->init_req(slow_result_path, control());
3349     result_io ->init_req(slow_result_path, i_o());
3350     result_mem->init_req(slow_result_path, reset_memory());
3351     result_val->init_req(slow_result_path, slow_val);
3352 
3353     set_all_memory(_gvn.transform(result_mem));
3354     set_i_o(       _gvn.transform(result_io));
3355   }
3356 
3357   C->set_has_split_ifs(true); // Has chance for split-if optimization
3358   set_result(result_rgn, result_val);
3359   return true;
3360 }
3361 
3362 //---------------------------load_mirror_from_klass----------------------------
3363 // Given a klass oop, load its java mirror (a java.lang.Class oop).
3364 Node* LibraryCallKit::load_mirror_from_klass(Node* klass) {
3365   Node* p = basic_plus_adr(klass, in_bytes(Klass::java_mirror_offset()));
3366   return make_load(NULL, p, TypeInstPtr::MIRROR, T_OBJECT, MemNode::unordered);
3367 }
3368 
3369 //-----------------------load_klass_from_mirror_common-------------------------
3370 // Given a java mirror (a java.lang.Class oop), load its corresponding klass oop.
3371 // Test the klass oop for null (signifying a primitive Class like Integer.TYPE),
3372 // and branch to the given path on the region.
3373 // If never_see_null, take an uncommon trap on null, so we can optimistically
3374 // compile for the non-null case.
3375 // If the region is NULL, force never_see_null = true.
3376 Node* LibraryCallKit::load_klass_from_mirror_common(Node* mirror,
3377                                                     bool never_see_null,
3378                                                     RegionNode* region,
3379                                                     int null_path,
3380                                                     int offset) {
3381   if (region == NULL)  never_see_null = true;
3382   Node* p = basic_plus_adr(mirror, offset);
3383   const TypeKlassPtr*  kls_type = TypeKlassPtr::OBJECT_OR_NULL;
3384   Node* kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, kls_type));
3385   Node* null_ctl = top();
3386   kls = null_check_oop(kls, &null_ctl, never_see_null);
3387   if (region != NULL) {
3388     // Set region->in(null_path) if the mirror is a primitive (e.g, int.class).
3389     region->init_req(null_path, null_ctl);
3390   } else {
3391     assert(null_ctl == top(), "no loose ends");
3392   }
3393   return kls;
3394 }
3395 
3396 //--------------------(inline_native_Class_query helpers)---------------------
3397 // Use this for JVM_ACC_INTERFACE, JVM_ACC_IS_CLONEABLE_FAST, JVM_ACC_HAS_FINALIZER.
3398 // Fall through if (mods & mask) == bits, take the guard otherwise.
3399 Node* LibraryCallKit::generate_access_flags_guard(Node* kls, int modifier_mask, int modifier_bits, RegionNode* region) {
3400   // Branch around if the given klass has the given modifier bit set.
3401   // Like generate_guard, adds a new path onto the region.
3402   Node* modp = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset()));
3403   Node* mods = make_load(NULL, modp, TypeInt::INT, T_INT, MemNode::unordered);
3404   Node* mask = intcon(modifier_mask);
3405   Node* bits = intcon(modifier_bits);
3406   Node* mbit = _gvn.transform(new AndINode(mods, mask));
3407   Node* cmp  = _gvn.transform(new CmpINode(mbit, bits));
3408   Node* bol  = _gvn.transform(new BoolNode(cmp, BoolTest::ne));
3409   return generate_fair_guard(bol, region);
3410 }
3411 Node* LibraryCallKit::generate_interface_guard(Node* kls, RegionNode* region) {
3412   return generate_access_flags_guard(kls, JVM_ACC_INTERFACE, 0, region);
3413 }
3414 
3415 //-------------------------inline_native_Class_query-------------------
3416 bool LibraryCallKit::inline_native_Class_query(vmIntrinsics::ID id) {
3417   const Type* return_type = TypeInt::BOOL;
3418   Node* prim_return_value = top();  // what happens if it's a primitive class?
3419   bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
3420   bool expect_prim = false;     // most of these guys expect to work on refs
3421 
3422   enum { _normal_path = 1, _prim_path = 2, PATH_LIMIT };
3423 
3424   Node* mirror = argument(0);
3425   Node* obj    = top();
3426 
3427   switch (id) {
3428   case vmIntrinsics::_isInstance:
3429     // nothing is an instance of a primitive type
3430     prim_return_value = intcon(0);
3431     obj = argument(1);
3432     break;
3433   case vmIntrinsics::_getModifiers:
3434     prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC);
3435     assert(is_power_of_2((int)JVM_ACC_WRITTEN_FLAGS+1), "change next line");
3436     return_type = TypeInt::make(0, JVM_ACC_WRITTEN_FLAGS, Type::WidenMin);
3437     break;
3438   case vmIntrinsics::_isInterface:
3439     prim_return_value = intcon(0);
3440     break;
3441   case vmIntrinsics::_isArray:
3442     prim_return_value = intcon(0);
3443     expect_prim = true;  // cf. ObjectStreamClass.getClassSignature
3444     break;
3445   case vmIntrinsics::_isPrimitive:
3446     prim_return_value = intcon(1);
3447     expect_prim = true;  // obviously
3448     break;
3449   case vmIntrinsics::_getSuperclass:
3450     prim_return_value = null();
3451     return_type = TypeInstPtr::MIRROR->cast_to_ptr_type(TypePtr::BotPTR);
3452     break;
3453   case vmIntrinsics::_getClassAccessFlags:
3454     prim_return_value = intcon(JVM_ACC_ABSTRACT | JVM_ACC_FINAL | JVM_ACC_PUBLIC);
3455     return_type = TypeInt::INT;  // not bool!  6297094
3456     break;
3457   default:
3458     fatal_unexpected_iid(id);
3459     break;
3460   }
3461 
3462   const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr();
3463   if (mirror_con == NULL)  return false;  // cannot happen?
3464 
3465 #ifndef PRODUCT
3466   if (C->print_intrinsics() || C->print_inlining()) {
3467     ciType* k = mirror_con->java_mirror_type();
3468     if (k) {
3469       tty->print("Inlining %s on constant Class ", vmIntrinsics::name_at(intrinsic_id()));
3470       k->print_name();
3471       tty->cr();
3472     }
3473   }
3474 #endif
3475 
3476   // Null-check the mirror, and the mirror's klass ptr (in case it is a primitive).
3477   RegionNode* region = new RegionNode(PATH_LIMIT);
3478   record_for_igvn(region);
3479   PhiNode* phi = new PhiNode(region, return_type);
3480 
3481   // The mirror will never be null of Reflection.getClassAccessFlags, however
3482   // it may be null for Class.isInstance or Class.getModifiers. Throw a NPE
3483   // if it is. See bug 4774291.
3484 
3485   // For Reflection.getClassAccessFlags(), the null check occurs in
3486   // the wrong place; see inline_unsafe_access(), above, for a similar
3487   // situation.
3488   mirror = null_check(mirror);
3489   // If mirror or obj is dead, only null-path is taken.
3490   if (stopped())  return true;
3491 
3492   if (expect_prim)  never_see_null = false;  // expect nulls (meaning prims)
3493 
3494   // Now load the mirror's klass metaobject, and null-check it.
3495   // Side-effects region with the control path if the klass is null.
3496   Node* kls = load_klass_from_mirror(mirror, never_see_null, region, _prim_path);
3497   // If kls is null, we have a primitive mirror.
3498   phi->init_req(_prim_path, prim_return_value);
3499   if (stopped()) { set_result(region, phi); return true; }
3500   bool safe_for_replace = (region->in(_prim_path) == top());
3501 
3502   Node* p;  // handy temp
3503   Node* null_ctl;
3504 
3505   // Now that we have the non-null klass, we can perform the real query.
3506   // For constant classes, the query will constant-fold in LoadNode::Value.
3507   Node* query_value = top();
3508   switch (id) {
3509   case vmIntrinsics::_isInstance:
3510     // nothing is an instance of a primitive type
3511     query_value = gen_instanceof(obj, kls, safe_for_replace);
3512     break;
3513 
3514   case vmIntrinsics::_getModifiers:
3515     p = basic_plus_adr(kls, in_bytes(Klass::modifier_flags_offset()));
3516     query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered);
3517     break;
3518 
3519   case vmIntrinsics::_isInterface:
3520     // (To verify this code sequence, check the asserts in JVM_IsInterface.)
3521     if (generate_interface_guard(kls, region) != NULL)
3522       // A guard was added.  If the guard is taken, it was an interface.
3523       phi->add_req(intcon(1));
3524     // If we fall through, it's a plain class.
3525     query_value = intcon(0);
3526     break;
3527 
3528   case vmIntrinsics::_isArray:
3529     // (To verify this code sequence, check the asserts in JVM_IsArrayClass.)
3530     if (generate_array_guard(kls, region) != NULL)
3531       // A guard was added.  If the guard is taken, it was an array.
3532       phi->add_req(intcon(1));
3533     // If we fall through, it's a plain class.
3534     query_value = intcon(0);
3535     break;
3536 
3537   case vmIntrinsics::_isPrimitive:
3538     query_value = intcon(0); // "normal" path produces false
3539     break;
3540 
3541   case vmIntrinsics::_getSuperclass:
3542     // The rules here are somewhat unfortunate, but we can still do better
3543     // with random logic than with a JNI call.
3544     // Interfaces store null or Object as _super, but must report null.
3545     // Arrays store an intermediate super as _super, but must report Object.
3546     // Other types can report the actual _super.
3547     // (To verify this code sequence, check the asserts in JVM_IsInterface.)
3548     if (generate_interface_guard(kls, region) != NULL)
3549       // A guard was added.  If the guard is taken, it was an interface.
3550       phi->add_req(null());
3551     if (generate_array_guard(kls, region) != NULL)
3552       // A guard was added.  If the guard is taken, it was an array.
3553       phi->add_req(makecon(TypeInstPtr::make(env()->Object_klass()->java_mirror())));
3554     // If we fall through, it's a plain class.  Get its _super.
3555     p = basic_plus_adr(kls, in_bytes(Klass::super_offset()));
3556     kls = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeRawPtr::BOTTOM, TypeKlassPtr::OBJECT_OR_NULL));
3557     null_ctl = top();
3558     kls = null_check_oop(kls, &null_ctl);
3559     if (null_ctl != top()) {
3560       // If the guard is taken, Object.superClass is null (both klass and mirror).
3561       region->add_req(null_ctl);
3562       phi   ->add_req(null());
3563     }
3564     if (!stopped()) {
3565       query_value = load_mirror_from_klass(kls);
3566     }
3567     break;
3568 
3569   case vmIntrinsics::_getClassAccessFlags:
3570     p = basic_plus_adr(kls, in_bytes(Klass::access_flags_offset()));
3571     query_value = make_load(NULL, p, TypeInt::INT, T_INT, MemNode::unordered);
3572     break;
3573 
3574   default:
3575     fatal_unexpected_iid(id);
3576     break;
3577   }
3578 
3579   // Fall-through is the normal case of a query to a real class.
3580   phi->init_req(1, query_value);
3581   region->init_req(1, control());
3582 
3583   C->set_has_split_ifs(true); // Has chance for split-if optimization
3584   set_result(region, phi);
3585   return true;
3586 }
3587 
3588 //-------------------------inline_Class_cast-------------------
3589 bool LibraryCallKit::inline_Class_cast() {
3590   Node* mirror = argument(0); // Class
3591   Node* obj    = argument(1);
3592   const TypeInstPtr* mirror_con = _gvn.type(mirror)->isa_instptr();
3593   if (mirror_con == NULL) {
3594     return false;  // dead path (mirror->is_top()).
3595   }
3596   if (obj == NULL || obj->is_top()) {
3597     return false;  // dead path
3598   }
3599   const TypeOopPtr* tp = _gvn.type(obj)->isa_oopptr();
3600 
3601   // First, see if Class.cast() can be folded statically.
3602   // java_mirror_type() returns non-null for compile-time Class constants.
3603   ciType* tm = mirror_con->java_mirror_type();
3604   if (tm != NULL && tm->is_klass() &&
3605       tp != NULL && tp->klass() != NULL) {
3606     if (!tp->klass()->is_loaded()) {
3607       // Don't use intrinsic when class is not loaded.
3608       return false;
3609     } else {
3610       int static_res = C->static_subtype_check(tm->as_klass(), tp->klass());
3611       if (static_res == Compile::SSC_always_true) {
3612         // isInstance() is true - fold the code.
3613         set_result(obj);
3614         return true;
3615       } else if (static_res == Compile::SSC_always_false) {
3616         // Don't use intrinsic, have to throw ClassCastException.
3617         // If the reference is null, the non-intrinsic bytecode will
3618         // be optimized appropriately.
3619         return false;
3620       }
3621     }
3622   }
3623 
3624   // Bailout intrinsic and do normal inlining if exception path is frequent.
3625   if (too_many_traps(Deoptimization::Reason_intrinsic)) {
3626     return false;
3627   }
3628 
3629   // Generate dynamic checks.
3630   // Class.cast() is java implementation of _checkcast bytecode.
3631   // Do checkcast (Parse::do_checkcast()) optimizations here.
3632 
3633   mirror = null_check(mirror);
3634   // If mirror is dead, only null-path is taken.
3635   if (stopped()) {
3636     return true;
3637   }
3638 
3639   // Not-subtype or the mirror's klass ptr is NULL (in case it is a primitive).
3640   enum { _bad_type_path = 1, _prim_path = 2, PATH_LIMIT };
3641   RegionNode* region = new RegionNode(PATH_LIMIT);
3642   record_for_igvn(region);
3643 
3644   // Now load the mirror's klass metaobject, and null-check it.
3645   // If kls is null, we have a primitive mirror and
3646   // nothing is an instance of a primitive type.
3647   Node* kls = load_klass_from_mirror(mirror, false, region, _prim_path);
3648 
3649   Node* res = top();
3650   if (!stopped()) {
3651     Node* bad_type_ctrl = top();
3652     // Do checkcast optimizations.
3653     res = gen_checkcast(obj, kls, &bad_type_ctrl);
3654     region->init_req(_bad_type_path, bad_type_ctrl);
3655   }
3656   if (region->in(_prim_path) != top() ||
3657       region->in(_bad_type_path) != top()) {
3658     // Let Interpreter throw ClassCastException.
3659     PreserveJVMState pjvms(this);
3660     set_control(_gvn.transform(region));
3661     uncommon_trap(Deoptimization::Reason_intrinsic,
3662                   Deoptimization::Action_maybe_recompile);
3663   }
3664   if (!stopped()) {
3665     set_result(res);
3666   }
3667   return true;
3668 }
3669 
3670 
3671 //--------------------------inline_native_subtype_check------------------------
3672 // This intrinsic takes the JNI calls out of the heart of
3673 // UnsafeFieldAccessorImpl.set, which improves Field.set, readObject, etc.
3674 bool LibraryCallKit::inline_native_subtype_check() {
3675   // Pull both arguments off the stack.
3676   Node* args[2];                // two java.lang.Class mirrors: superc, subc
3677   args[0] = argument(0);
3678   args[1] = argument(1);
3679   Node* klasses[2];             // corresponding Klasses: superk, subk
3680   klasses[0] = klasses[1] = top();
3681 
3682   enum {
3683     // A full decision tree on {superc is prim, subc is prim}:
3684     _prim_0_path = 1,           // {P,N} => false
3685                                 // {P,P} & superc!=subc => false
3686     _prim_same_path,            // {P,P} & superc==subc => true
3687     _prim_1_path,               // {N,P} => false
3688     _ref_subtype_path,          // {N,N} & subtype check wins => true
3689     _both_ref_path,             // {N,N} & subtype check loses => false
3690     PATH_LIMIT
3691   };
3692 
3693   RegionNode* region = new RegionNode(PATH_LIMIT);
3694   Node*       phi    = new PhiNode(region, TypeInt::BOOL);
3695   record_for_igvn(region);
3696 
3697   const TypePtr* adr_type = TypeRawPtr::BOTTOM;   // memory type of loads
3698   const TypeKlassPtr* kls_type = TypeKlassPtr::OBJECT_OR_NULL;
3699   int class_klass_offset = java_lang_Class::klass_offset_in_bytes();
3700 
3701   // First null-check both mirrors and load each mirror's klass metaobject.
3702   int which_arg;
3703   for (which_arg = 0; which_arg <= 1; which_arg++) {
3704     Node* arg = args[which_arg];
3705     arg = null_check(arg);
3706     if (stopped())  break;
3707     args[which_arg] = arg;
3708 
3709     Node* p = basic_plus_adr(arg, class_klass_offset);
3710     Node* kls = LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, adr_type, kls_type);
3711     klasses[which_arg] = _gvn.transform(kls);
3712   }
3713 
3714   // Having loaded both klasses, test each for null.
3715   bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
3716   for (which_arg = 0; which_arg <= 1; which_arg++) {
3717     Node* kls = klasses[which_arg];
3718     Node* null_ctl = top();
3719     kls = null_check_oop(kls, &null_ctl, never_see_null);
3720     int prim_path = (which_arg == 0 ? _prim_0_path : _prim_1_path);
3721     region->init_req(prim_path, null_ctl);
3722     if (stopped())  break;
3723     klasses[which_arg] = kls;
3724   }
3725 
3726   if (!stopped()) {
3727     // now we have two reference types, in klasses[0..1]
3728     Node* subk   = klasses[1];  // the argument to isAssignableFrom
3729     Node* superk = klasses[0];  // the receiver
3730     region->set_req(_both_ref_path, gen_subtype_check(subk, superk));
3731     // now we have a successful reference subtype check
3732     region->set_req(_ref_subtype_path, control());
3733   }
3734 
3735   // If both operands are primitive (both klasses null), then
3736   // we must return true when they are identical primitives.
3737   // It is convenient to test this after the first null klass check.
3738   set_control(region->in(_prim_0_path)); // go back to first null check
3739   if (!stopped()) {
3740     // Since superc is primitive, make a guard for the superc==subc case.
3741     Node* cmp_eq = _gvn.transform(new CmpPNode(args[0], args[1]));
3742     Node* bol_eq = _gvn.transform(new BoolNode(cmp_eq, BoolTest::eq));
3743     generate_guard(bol_eq, region, PROB_FAIR);
3744     if (region->req() == PATH_LIMIT+1) {
3745       // A guard was added.  If the added guard is taken, superc==subc.
3746       region->swap_edges(PATH_LIMIT, _prim_same_path);
3747       region->del_req(PATH_LIMIT);
3748     }
3749     region->set_req(_prim_0_path, control()); // Not equal after all.
3750   }
3751 
3752   // these are the only paths that produce 'true':
3753   phi->set_req(_prim_same_path,   intcon(1));
3754   phi->set_req(_ref_subtype_path, intcon(1));
3755 
3756   // pull together the cases:
3757   assert(region->req() == PATH_LIMIT, "sane region");
3758   for (uint i = 1; i < region->req(); i++) {
3759     Node* ctl = region->in(i);
3760     if (ctl == NULL || ctl == top()) {
3761       region->set_req(i, top());
3762       phi   ->set_req(i, top());
3763     } else if (phi->in(i) == NULL) {
3764       phi->set_req(i, intcon(0)); // all other paths produce 'false'
3765     }
3766   }
3767 
3768   set_control(_gvn.transform(region));
3769   set_result(_gvn.transform(phi));
3770   return true;
3771 }
3772 
3773 //---------------------generate_array_guard_common------------------------
3774 Node* LibraryCallKit::generate_array_guard_common(Node* kls, RegionNode* region,
3775                                                   bool obj_array, bool not_array) {
3776 
3777   if (stopped()) {
3778     return NULL;
3779   }
3780 
3781   // If obj_array/non_array==false/false:
3782   // Branch around if the given klass is in fact an array (either obj or prim).
3783   // If obj_array/non_array==false/true:
3784   // Branch around if the given klass is not an array klass of any kind.
3785   // If obj_array/non_array==true/true:
3786   // Branch around if the kls is not an oop array (kls is int[], String, etc.)
3787   // If obj_array/non_array==true/false:
3788   // Branch around if the kls is an oop array (Object[] or subtype)
3789   //
3790   // Like generate_guard, adds a new path onto the region.
3791   jint  layout_con = 0;
3792   Node* layout_val = get_layout_helper(kls, layout_con);
3793   if (layout_val == NULL) {
3794     bool query = (obj_array
3795                   ? Klass::layout_helper_is_objArray(layout_con)
3796                   : Klass::layout_helper_is_array(layout_con));
3797     if (query == not_array) {
3798       return NULL;                       // never a branch
3799     } else {                             // always a branch
3800       Node* always_branch = control();
3801       if (region != NULL)
3802         region->add_req(always_branch);
3803       set_control(top());
3804       return always_branch;
3805     }
3806   }
3807   // Now test the correct condition.
3808   jint  nval = (obj_array
3809                 ? (jint)(Klass::_lh_array_tag_type_value
3810                    <<    Klass::_lh_array_tag_shift)
3811                 : Klass::_lh_neutral_value);
3812   Node* cmp = _gvn.transform(new CmpINode(layout_val, intcon(nval)));
3813   BoolTest::mask btest = BoolTest::lt;  // correct for testing is_[obj]array
3814   // invert the test if we are looking for a non-array
3815   if (not_array)  btest = BoolTest(btest).negate();
3816   Node* bol = _gvn.transform(new BoolNode(cmp, btest));
3817   return generate_fair_guard(bol, region);
3818 }
3819 
3820 
3821 //-----------------------inline_native_newArray--------------------------
3822 // private static native Object java.lang.reflect.newArray(Class<?> componentType, int length);
3823 // private        native Object Unsafe.allocateUninitializedArray0(Class<?> cls, int size);
3824 bool LibraryCallKit::inline_unsafe_newArray(bool uninitialized) {
3825   Node* mirror;
3826   Node* count_val;
3827   if (uninitialized) {
3828     mirror    = argument(1);
3829     count_val = argument(2);
3830   } else {
3831     mirror    = argument(0);
3832     count_val = argument(1);
3833   }
3834 
3835   mirror = null_check(mirror);
3836   // If mirror or obj is dead, only null-path is taken.
3837   if (stopped())  return true;
3838 
3839   enum { _normal_path = 1, _slow_path = 2, PATH_LIMIT };
3840   RegionNode* result_reg = new RegionNode(PATH_LIMIT);
3841   PhiNode*    result_val = new PhiNode(result_reg, TypeInstPtr::NOTNULL);
3842   PhiNode*    result_io  = new PhiNode(result_reg, Type::ABIO);
3843   PhiNode*    result_mem = new PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM);
3844 
3845   bool never_see_null = !too_many_traps(Deoptimization::Reason_null_check);
3846   Node* klass_node = load_array_klass_from_mirror(mirror, never_see_null,
3847                                                   result_reg, _slow_path);
3848   Node* normal_ctl   = control();
3849   Node* no_array_ctl = result_reg->in(_slow_path);
3850 
3851   // Generate code for the slow case.  We make a call to newArray().
3852   set_control(no_array_ctl);
3853   if (!stopped()) {
3854     // Either the input type is void.class, or else the
3855     // array klass has not yet been cached.  Either the
3856     // ensuing call will throw an exception, or else it
3857     // will cache the array klass for next time.
3858     PreserveJVMState pjvms(this);
3859     CallJavaNode* slow_call = generate_method_call_static(vmIntrinsics::_newArray);
3860     Node* slow_result = set_results_for_java_call(slow_call);
3861     // this->control() comes from set_results_for_java_call
3862     result_reg->set_req(_slow_path, control());
3863     result_val->set_req(_slow_path, slow_result);
3864     result_io ->set_req(_slow_path, i_o());
3865     result_mem->set_req(_slow_path, reset_memory());
3866   }
3867 
3868   set_control(normal_ctl);
3869   if (!stopped()) {
3870     // Normal case:  The array type has been cached in the java.lang.Class.
3871     // The following call works fine even if the array type is polymorphic.
3872     // It could be a dynamic mix of int[], boolean[], Object[], etc.
3873     Node* obj = new_array(klass_node, count_val, 0);  // no arguments to push
3874     result_reg->init_req(_normal_path, control());
3875     result_val->init_req(_normal_path, obj);
3876     result_io ->init_req(_normal_path, i_o());
3877     result_mem->init_req(_normal_path, reset_memory());
3878 
3879     if (uninitialized) {
3880       // Mark the allocation so that zeroing is skipped
3881       AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(obj, &_gvn);
3882       alloc->maybe_set_complete(&_gvn);
3883     }
3884   }
3885 
3886   // Return the combined state.
3887   set_i_o(        _gvn.transform(result_io)  );
3888   set_all_memory( _gvn.transform(result_mem));
3889 
3890   C->set_has_split_ifs(true); // Has chance for split-if optimization
3891   set_result(result_reg, result_val);
3892   return true;
3893 }
3894 
3895 //----------------------inline_native_getLength--------------------------
3896 // public static native int java.lang.reflect.Array.getLength(Object array);
3897 bool LibraryCallKit::inline_native_getLength() {
3898   if (too_many_traps(Deoptimization::Reason_intrinsic))  return false;
3899 
3900   Node* array = null_check(argument(0));
3901   // If array is dead, only null-path is taken.
3902   if (stopped())  return true;
3903 
3904   // Deoptimize if it is a non-array.
3905   Node* non_array = generate_non_array_guard(load_object_klass(array), NULL);
3906 
3907   if (non_array != NULL) {
3908     PreserveJVMState pjvms(this);
3909     set_control(non_array);
3910     uncommon_trap(Deoptimization::Reason_intrinsic,
3911                   Deoptimization::Action_maybe_recompile);
3912   }
3913 
3914   // If control is dead, only non-array-path is taken.
3915   if (stopped())  return true;
3916 
3917   // The works fine even if the array type is polymorphic.
3918   // It could be a dynamic mix of int[], boolean[], Object[], etc.
3919   Node* result = load_array_length(array);
3920 
3921   C->set_has_split_ifs(true);  // Has chance for split-if optimization
3922   set_result(result);
3923   return true;
3924 }
3925 
3926 //------------------------inline_array_copyOf----------------------------
3927 // public static <T,U> T[] java.util.Arrays.copyOf(     U[] original, int newLength,         Class<? extends T[]> newType);
3928 // public static <T,U> T[] java.util.Arrays.copyOfRange(U[] original, int from,      int to, Class<? extends T[]> newType);
3929 bool LibraryCallKit::inline_array_copyOf(bool is_copyOfRange) {
3930   if (too_many_traps(Deoptimization::Reason_intrinsic))  return false;
3931 
3932   // Get the arguments.
3933   Node* original          = argument(0);
3934   Node* start             = is_copyOfRange? argument(1): intcon(0);
3935   Node* end               = is_copyOfRange? argument(2): argument(1);
3936   Node* array_type_mirror = is_copyOfRange? argument(3): argument(2);
3937 
3938   Node* newcopy = NULL;
3939 
3940   // Set the original stack and the reexecute bit for the interpreter to reexecute
3941   // the bytecode that invokes Arrays.copyOf if deoptimization happens.
3942   { PreserveReexecuteState preexecs(this);
3943     jvms()->set_should_reexecute(true);
3944 
3945     array_type_mirror = null_check(array_type_mirror);
3946     original          = null_check(original);
3947 
3948     // Check if a null path was taken unconditionally.
3949     if (stopped())  return true;
3950 
3951     Node* orig_length = load_array_length(original);
3952 
3953     Node* klass_node = load_klass_from_mirror(array_type_mirror, false, NULL, 0);
3954     klass_node = null_check(klass_node);
3955 
3956     RegionNode* bailout = new RegionNode(1);
3957     record_for_igvn(bailout);
3958 
3959     // Despite the generic type of Arrays.copyOf, the mirror might be int, int[], etc.
3960     // Bail out if that is so.
3961     Node* not_objArray = generate_non_objArray_guard(klass_node, bailout);
3962     if (not_objArray != NULL) {
3963       // Improve the klass node's type from the new optimistic assumption:
3964       ciKlass* ak = ciArrayKlass::make(env()->Object_klass());
3965       const Type* akls = TypeKlassPtr::make(TypePtr::NotNull, ak, 0/*offset*/);
3966       Node* cast = new CastPPNode(klass_node, akls);
3967       cast->init_req(0, control());
3968       klass_node = _gvn.transform(cast);
3969     }
3970 
3971     // Bail out if either start or end is negative.
3972     generate_negative_guard(start, bailout, &start);
3973     generate_negative_guard(end,   bailout, &end);
3974 
3975     Node* length = end;
3976     if (_gvn.type(start) != TypeInt::ZERO) {
3977       length = _gvn.transform(new SubINode(end, start));
3978     }
3979 
3980     // Bail out if length is negative.
3981     // Without this the new_array would throw
3982     // NegativeArraySizeException but IllegalArgumentException is what
3983     // should be thrown
3984     generate_negative_guard(length, bailout, &length);
3985 
3986     if (bailout->req() > 1) {
3987       PreserveJVMState pjvms(this);
3988       set_control(_gvn.transform(bailout));
3989       uncommon_trap(Deoptimization::Reason_intrinsic,
3990                     Deoptimization::Action_maybe_recompile);
3991     }
3992 
3993     if (!stopped()) {
3994       // How many elements will we copy from the original?
3995       // The answer is MinI(orig_length - start, length).
3996       Node* orig_tail = _gvn.transform(new SubINode(orig_length, start));
3997       Node* moved = generate_min_max(vmIntrinsics::_min, orig_tail, length);
3998 
3999       // Generate a direct call to the right arraycopy function(s).
4000       // We know the copy is disjoint but we might not know if the
4001       // oop stores need checking.
4002       // Extreme case:  Arrays.copyOf((Integer[])x, 10, String[].class).
4003       // This will fail a store-check if x contains any non-nulls.
4004 
4005       // ArrayCopyNode:Ideal may transform the ArrayCopyNode to
4006       // loads/stores but it is legal only if we're sure the
4007       // Arrays.copyOf would succeed. So we need all input arguments
4008       // to the copyOf to be validated, including that the copy to the
4009       // new array won't trigger an ArrayStoreException. That subtype
4010       // check can be optimized if we know something on the type of
4011       // the input array from type speculation.
4012       if (_gvn.type(klass_node)->singleton()) {
4013         ciKlass* subk   = _gvn.type(load_object_klass(original))->is_klassptr()->klass();
4014         ciKlass* superk = _gvn.type(klass_node)->is_klassptr()->klass();
4015 
4016         int test = C->static_subtype_check(superk, subk);
4017         if (test != Compile::SSC_always_true && test != Compile::SSC_always_false) {
4018           const TypeOopPtr* t_original = _gvn.type(original)->is_oopptr();
4019           if (t_original->speculative_type() != NULL) {
4020             original = maybe_cast_profiled_obj(original, t_original->speculative_type(), true);
4021           }
4022         }
4023       }
4024 
4025       bool validated = false;
4026       // Reason_class_check rather than Reason_intrinsic because we
4027       // want to intrinsify even if this traps.
4028       if (!too_many_traps(Deoptimization::Reason_class_check)) {
4029         Node* not_subtype_ctrl = gen_subtype_check(load_object_klass(original),
4030                                                    klass_node);
4031 
4032         if (not_subtype_ctrl != top()) {
4033           PreserveJVMState pjvms(this);
4034           set_control(not_subtype_ctrl);
4035           uncommon_trap(Deoptimization::Reason_class_check,
4036                         Deoptimization::Action_make_not_entrant);
4037           assert(stopped(), "Should be stopped");
4038         }
4039         validated = true;
4040       }
4041 
4042       if (!stopped()) {
4043         newcopy = new_array(klass_node, length, 0);  // no arguments to push
4044 
4045         ArrayCopyNode* ac = ArrayCopyNode::make(this, true, original, start, newcopy, intcon(0), moved, true,
4046                                                 load_object_klass(original), klass_node);
4047         if (!is_copyOfRange) {
4048           ac->set_copyof(validated);
4049         } else {
4050           ac->set_copyofrange(validated);
4051         }
4052         Node* n = _gvn.transform(ac);
4053         if (n == ac) {
4054           ac->connect_outputs(this);
4055         } else {
4056           assert(validated, "shouldn't transform if all arguments not validated");
4057           set_all_memory(n);
4058         }
4059       }
4060     }
4061   } // original reexecute is set back here
4062 
4063   C->set_has_split_ifs(true); // Has chance for split-if optimization
4064   if (!stopped()) {
4065     set_result(newcopy);
4066   }
4067   return true;
4068 }
4069 
4070 
4071 //----------------------generate_virtual_guard---------------------------
4072 // Helper for hashCode and clone.  Peeks inside the vtable to avoid a call.
4073 Node* LibraryCallKit::generate_virtual_guard(Node* obj_klass,
4074                                              RegionNode* slow_region) {
4075   ciMethod* method = callee();
4076   int vtable_index = method->vtable_index();
4077   assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index,
4078          "bad index %d", vtable_index);
4079   // Get the Method* out of the appropriate vtable entry.
4080   int entry_offset  = in_bytes(Klass::vtable_start_offset()) +
4081                      vtable_index*vtableEntry::size_in_bytes() +
4082                      vtableEntry::method_offset_in_bytes();
4083   Node* entry_addr  = basic_plus_adr(obj_klass, entry_offset);
4084   Node* target_call = make_load(NULL, entry_addr, TypePtr::NOTNULL, T_ADDRESS, MemNode::unordered);
4085 
4086   // Compare the target method with the expected method (e.g., Object.hashCode).
4087   const TypePtr* native_call_addr = TypeMetadataPtr::make(method);
4088 
4089   Node* native_call = makecon(native_call_addr);
4090   Node* chk_native  = _gvn.transform(new CmpPNode(target_call, native_call));
4091   Node* test_native = _gvn.transform(new BoolNode(chk_native, BoolTest::ne));
4092 
4093   return generate_slow_guard(test_native, slow_region);
4094 }
4095 
4096 //-----------------------generate_method_call----------------------------
4097 // Use generate_method_call to make a slow-call to the real
4098 // method if the fast path fails.  An alternative would be to
4099 // use a stub like OptoRuntime::slow_arraycopy_Java.
4100 // This only works for expanding the current library call,
4101 // not another intrinsic.  (E.g., don't use this for making an
4102 // arraycopy call inside of the copyOf intrinsic.)
4103 CallJavaNode*
4104 LibraryCallKit::generate_method_call(vmIntrinsics::ID method_id, bool is_virtual, bool is_static) {
4105   // When compiling the intrinsic method itself, do not use this technique.
4106   guarantee(callee() != C->method(), "cannot make slow-call to self");
4107 
4108   ciMethod* method = callee();
4109   // ensure the JVMS we have will be correct for this call
4110   guarantee(method_id == method->intrinsic_id(), "must match");
4111 
4112   const TypeFunc* tf = TypeFunc::make(method);
4113   CallJavaNode* slow_call;
4114   if (is_static) {
4115     assert(!is_virtual, "");
4116     slow_call = new CallStaticJavaNode(C, tf,
4117                            SharedRuntime::get_resolve_static_call_stub(),
4118                            method, bci());
4119   } else if (is_virtual) {
4120     null_check_receiver();
4121     int vtable_index = Method::invalid_vtable_index;
4122     if (UseInlineCaches) {
4123       // Suppress the vtable call
4124     } else {
4125       // hashCode and clone are not a miranda methods,
4126       // so the vtable index is fixed.
4127       // No need to use the linkResolver to get it.
4128        vtable_index = method->vtable_index();
4129        assert(vtable_index >= 0 || vtable_index == Method::nonvirtual_vtable_index,
4130               "bad index %d", vtable_index);
4131     }
4132     slow_call = new CallDynamicJavaNode(tf,
4133                           SharedRuntime::get_resolve_virtual_call_stub(),
4134                           method, vtable_index, bci());
4135   } else {  // neither virtual nor static:  opt_virtual
4136     null_check_receiver();
4137     slow_call = new CallStaticJavaNode(C, tf,
4138                                 SharedRuntime::get_resolve_opt_virtual_call_stub(),
4139                                 method, bci());
4140     slow_call->set_optimized_virtual(true);
4141   }
4142   set_arguments_for_java_call(slow_call);
4143   set_edges_for_java_call(slow_call);
4144   return slow_call;
4145 }
4146 
4147 
4148 /**
4149  * Build special case code for calls to hashCode on an object. This call may
4150  * be virtual (invokevirtual) or bound (invokespecial). For each case we generate
4151  * slightly different code.
4152  */
4153 bool LibraryCallKit::inline_native_hashcode(bool is_virtual, bool is_static) {
4154   assert(is_static == callee()->is_static(), "correct intrinsic selection");
4155   assert(!(is_virtual && is_static), "either virtual, special, or static");
4156 
4157   enum { _slow_path = 1, _fast_path, _null_path, PATH_LIMIT };
4158 
4159   RegionNode* result_reg = new RegionNode(PATH_LIMIT);
4160   PhiNode*    result_val = new PhiNode(result_reg, TypeInt::INT);
4161   PhiNode*    result_io  = new PhiNode(result_reg, Type::ABIO);
4162   PhiNode*    result_mem = new PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM);
4163   Node* obj = NULL;
4164   if (!is_static) {
4165     // Check for hashing null object
4166     obj = null_check_receiver();
4167     if (stopped())  return true;        // unconditionally null
4168     result_reg->init_req(_null_path, top());
4169     result_val->init_req(_null_path, top());
4170   } else {
4171     // Do a null check, and return zero if null.
4172     // System.identityHashCode(null) == 0
4173     obj = argument(0);
4174     Node* null_ctl = top();
4175     obj = null_check_oop(obj, &null_ctl);
4176     result_reg->init_req(_null_path, null_ctl);
4177     result_val->init_req(_null_path, _gvn.intcon(0));
4178   }
4179 
4180   // Unconditionally null?  Then return right away.
4181   if (stopped()) {
4182     set_control( result_reg->in(_null_path));
4183     if (!stopped())
4184       set_result(result_val->in(_null_path));
4185     return true;
4186   }
4187 
4188   // We only go to the fast case code if we pass a number of guards.  The
4189   // paths which do not pass are accumulated in the slow_region.
4190   RegionNode* slow_region = new RegionNode(1);
4191   record_for_igvn(slow_region);
4192 
4193   // If this is a virtual call, we generate a funny guard.  We pull out
4194   // the vtable entry corresponding to hashCode() from the target object.
4195   // If the target method which we are calling happens to be the native
4196   // Object hashCode() method, we pass the guard.  We do not need this
4197   // guard for non-virtual calls -- the caller is known to be the native
4198   // Object hashCode().
4199   if (is_virtual) {
4200     // After null check, get the object's klass.
4201     Node* obj_klass = load_object_klass(obj);
4202     generate_virtual_guard(obj_klass, slow_region);
4203   }
4204 
4205   // Get the header out of the object, use LoadMarkNode when available
4206   Node* header_addr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes());
4207   // The control of the load must be NULL. Otherwise, the load can move before
4208   // the null check after castPP removal.
4209   Node* no_ctrl = NULL;
4210   Node* header = make_load(no_ctrl, header_addr, TypeX_X, TypeX_X->basic_type(), MemNode::unordered);
4211 
4212   // Test the header to see if it is unlocked.
4213   Node *lock_mask      = _gvn.MakeConX(markOopDesc::biased_lock_mask_in_place);
4214   Node *lmasked_header = _gvn.transform(new AndXNode(header, lock_mask));
4215   Node *unlocked_val   = _gvn.MakeConX(markOopDesc::unlocked_value);
4216   Node *chk_unlocked   = _gvn.transform(new CmpXNode( lmasked_header, unlocked_val));
4217   Node *test_unlocked  = _gvn.transform(new BoolNode( chk_unlocked, BoolTest::ne));
4218 
4219   generate_slow_guard(test_unlocked, slow_region);
4220 
4221   // Get the hash value and check to see that it has been properly assigned.
4222   // We depend on hash_mask being at most 32 bits and avoid the use of
4223   // hash_mask_in_place because it could be larger than 32 bits in a 64-bit
4224   // vm: see markOop.hpp.
4225   Node *hash_mask      = _gvn.intcon(markOopDesc::hash_mask);
4226   Node *hash_shift     = _gvn.intcon(markOopDesc::hash_shift);
4227   Node *hshifted_header= _gvn.transform(new URShiftXNode(header, hash_shift));
4228   // This hack lets the hash bits live anywhere in the mark object now, as long
4229   // as the shift drops the relevant bits into the low 32 bits.  Note that
4230   // Java spec says that HashCode is an int so there's no point in capturing
4231   // an 'X'-sized hashcode (32 in 32-bit build or 64 in 64-bit build).
4232   hshifted_header      = ConvX2I(hshifted_header);
4233   Node *hash_val       = _gvn.transform(new AndINode(hshifted_header, hash_mask));
4234 
4235   Node *no_hash_val    = _gvn.intcon(markOopDesc::no_hash);
4236   Node *chk_assigned   = _gvn.transform(new CmpINode( hash_val, no_hash_val));
4237   Node *test_assigned  = _gvn.transform(new BoolNode( chk_assigned, BoolTest::eq));
4238 
4239   generate_slow_guard(test_assigned, slow_region);
4240 
4241   Node* init_mem = reset_memory();
4242   // fill in the rest of the null path:
4243   result_io ->init_req(_null_path, i_o());
4244   result_mem->init_req(_null_path, init_mem);
4245 
4246   result_val->init_req(_fast_path, hash_val);
4247   result_reg->init_req(_fast_path, control());
4248   result_io ->init_req(_fast_path, i_o());
4249   result_mem->init_req(_fast_path, init_mem);
4250 
4251   // Generate code for the slow case.  We make a call to hashCode().
4252   set_control(_gvn.transform(slow_region));
4253   if (!stopped()) {
4254     // No need for PreserveJVMState, because we're using up the present state.
4255     set_all_memory(init_mem);
4256     vmIntrinsics::ID hashCode_id = is_static ? vmIntrinsics::_identityHashCode : vmIntrinsics::_hashCode;
4257     CallJavaNode* slow_call = generate_method_call(hashCode_id, is_virtual, is_static);
4258     Node* slow_result = set_results_for_java_call(slow_call);
4259     // this->control() comes from set_results_for_java_call
4260     result_reg->init_req(_slow_path, control());
4261     result_val->init_req(_slow_path, slow_result);
4262     result_io  ->set_req(_slow_path, i_o());
4263     result_mem ->set_req(_slow_path, reset_memory());
4264   }
4265 
4266   // Return the combined state.
4267   set_i_o(        _gvn.transform(result_io)  );
4268   set_all_memory( _gvn.transform(result_mem));
4269 
4270   set_result(result_reg, result_val);
4271   return true;
4272 }
4273 
4274 //---------------------------inline_native_getClass----------------------------
4275 // public final native Class<?> java.lang.Object.getClass();
4276 //
4277 // Build special case code for calls to getClass on an object.
4278 bool LibraryCallKit::inline_native_getClass() {
4279   Node* obj = null_check_receiver();
4280   if (stopped())  return true;
4281   set_result(load_mirror_from_klass(load_object_klass(obj)));
4282   return true;
4283 }
4284 
4285 //-----------------inline_native_Reflection_getCallerClass---------------------
4286 // public static native Class<?> sun.reflect.Reflection.getCallerClass();
4287 //
4288 // In the presence of deep enough inlining, getCallerClass() becomes a no-op.
4289 //
4290 // NOTE: This code must perform the same logic as JVM_GetCallerClass
4291 // in that it must skip particular security frames and checks for
4292 // caller sensitive methods.
4293 bool LibraryCallKit::inline_native_Reflection_getCallerClass() {
4294 #ifndef PRODUCT
4295   if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4296     tty->print_cr("Attempting to inline sun.reflect.Reflection.getCallerClass");
4297   }
4298 #endif
4299 
4300   if (!jvms()->has_method()) {
4301 #ifndef PRODUCT
4302     if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4303       tty->print_cr("  Bailing out because intrinsic was inlined at top level");
4304     }
4305 #endif
4306     return false;
4307   }
4308 
4309   // Walk back up the JVM state to find the caller at the required
4310   // depth.
4311   JVMState* caller_jvms = jvms();
4312 
4313   // Cf. JVM_GetCallerClass
4314   // NOTE: Start the loop at depth 1 because the current JVM state does
4315   // not include the Reflection.getCallerClass() frame.
4316   for (int n = 1; caller_jvms != NULL; caller_jvms = caller_jvms->caller(), n++) {
4317     ciMethod* m = caller_jvms->method();
4318     switch (n) {
4319     case 0:
4320       fatal("current JVM state does not include the Reflection.getCallerClass frame");
4321       break;
4322     case 1:
4323       // Frame 0 and 1 must be caller sensitive (see JVM_GetCallerClass).
4324       if (!m->caller_sensitive()) {
4325 #ifndef PRODUCT
4326         if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4327           tty->print_cr("  Bailing out: CallerSensitive annotation expected at frame %d", n);
4328         }
4329 #endif
4330         return false;  // bail-out; let JVM_GetCallerClass do the work
4331       }
4332       break;
4333     default:
4334       if (!m->is_ignored_by_security_stack_walk()) {
4335         // We have reached the desired frame; return the holder class.
4336         // Acquire method holder as java.lang.Class and push as constant.
4337         ciInstanceKlass* caller_klass = caller_jvms->method()->holder();
4338         ciInstance* caller_mirror = caller_klass->java_mirror();
4339         set_result(makecon(TypeInstPtr::make(caller_mirror)));
4340 
4341 #ifndef PRODUCT
4342         if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4343           tty->print_cr("  Succeeded: caller = %d) %s.%s, JVMS depth = %d", n, caller_klass->name()->as_utf8(), caller_jvms->method()->name()->as_utf8(), jvms()->depth());
4344           tty->print_cr("  JVM state at this point:");
4345           for (int i = jvms()->depth(), n = 1; i >= 1; i--, n++) {
4346             ciMethod* m = jvms()->of_depth(i)->method();
4347             tty->print_cr("   %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8());
4348           }
4349         }
4350 #endif
4351         return true;
4352       }
4353       break;
4354     }
4355   }
4356 
4357 #ifndef PRODUCT
4358   if ((C->print_intrinsics() || C->print_inlining()) && Verbose) {
4359     tty->print_cr("  Bailing out because caller depth exceeded inlining depth = %d", jvms()->depth());
4360     tty->print_cr("  JVM state at this point:");
4361     for (int i = jvms()->depth(), n = 1; i >= 1; i--, n++) {
4362       ciMethod* m = jvms()->of_depth(i)->method();
4363       tty->print_cr("   %d) %s.%s", n, m->holder()->name()->as_utf8(), m->name()->as_utf8());
4364     }
4365   }
4366 #endif
4367 
4368   return false;  // bail-out; let JVM_GetCallerClass do the work
4369 }
4370 
4371 bool LibraryCallKit::inline_fp_conversions(vmIntrinsics::ID id) {
4372   Node* arg = argument(0);
4373   Node* result = NULL;
4374 
4375   switch (id) {
4376   case vmIntrinsics::_floatToRawIntBits:    result = new MoveF2INode(arg);  break;
4377   case vmIntrinsics::_intBitsToFloat:       result = new MoveI2FNode(arg);  break;
4378   case vmIntrinsics::_doubleToRawLongBits:  result = new MoveD2LNode(arg);  break;
4379   case vmIntrinsics::_longBitsToDouble:     result = new MoveL2DNode(arg);  break;
4380 
4381   case vmIntrinsics::_doubleToLongBits: {
4382     // two paths (plus control) merge in a wood
4383     RegionNode *r = new RegionNode(3);
4384     Node *phi = new PhiNode(r, TypeLong::LONG);
4385 
4386     Node *cmpisnan = _gvn.transform(new CmpDNode(arg, arg));
4387     // Build the boolean node
4388     Node *bolisnan = _gvn.transform(new BoolNode(cmpisnan, BoolTest::ne));
4389 
4390     // Branch either way.
4391     // NaN case is less traveled, which makes all the difference.
4392     IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
4393     Node *opt_isnan = _gvn.transform(ifisnan);
4394     assert( opt_isnan->is_If(), "Expect an IfNode");
4395     IfNode *opt_ifisnan = (IfNode*)opt_isnan;
4396     Node *iftrue = _gvn.transform(new IfTrueNode(opt_ifisnan));
4397 
4398     set_control(iftrue);
4399 
4400     static const jlong nan_bits = CONST64(0x7ff8000000000000);
4401     Node *slow_result = longcon(nan_bits); // return NaN
4402     phi->init_req(1, _gvn.transform( slow_result ));
4403     r->init_req(1, iftrue);
4404 
4405     // Else fall through
4406     Node *iffalse = _gvn.transform(new IfFalseNode(opt_ifisnan));
4407     set_control(iffalse);
4408 
4409     phi->init_req(2, _gvn.transform(new MoveD2LNode(arg)));
4410     r->init_req(2, iffalse);
4411 
4412     // Post merge
4413     set_control(_gvn.transform(r));
4414     record_for_igvn(r);
4415 
4416     C->set_has_split_ifs(true); // Has chance for split-if optimization
4417     result = phi;
4418     assert(result->bottom_type()->isa_long(), "must be");
4419     break;
4420   }
4421 
4422   case vmIntrinsics::_floatToIntBits: {
4423     // two paths (plus control) merge in a wood
4424     RegionNode *r = new RegionNode(3);
4425     Node *phi = new PhiNode(r, TypeInt::INT);
4426 
4427     Node *cmpisnan = _gvn.transform(new CmpFNode(arg, arg));
4428     // Build the boolean node
4429     Node *bolisnan = _gvn.transform(new BoolNode(cmpisnan, BoolTest::ne));
4430 
4431     // Branch either way.
4432     // NaN case is less traveled, which makes all the difference.
4433     IfNode *ifisnan = create_and_xform_if(control(), bolisnan, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
4434     Node *opt_isnan = _gvn.transform(ifisnan);
4435     assert( opt_isnan->is_If(), "Expect an IfNode");
4436     IfNode *opt_ifisnan = (IfNode*)opt_isnan;
4437     Node *iftrue = _gvn.transform(new IfTrueNode(opt_ifisnan));
4438 
4439     set_control(iftrue);
4440 
4441     static const jint nan_bits = 0x7fc00000;
4442     Node *slow_result = makecon(TypeInt::make(nan_bits)); // return NaN
4443     phi->init_req(1, _gvn.transform( slow_result ));
4444     r->init_req(1, iftrue);
4445 
4446     // Else fall through
4447     Node *iffalse = _gvn.transform(new IfFalseNode(opt_ifisnan));
4448     set_control(iffalse);
4449 
4450     phi->init_req(2, _gvn.transform(new MoveF2INode(arg)));
4451     r->init_req(2, iffalse);
4452 
4453     // Post merge
4454     set_control(_gvn.transform(r));
4455     record_for_igvn(r);
4456 
4457     C->set_has_split_ifs(true); // Has chance for split-if optimization
4458     result = phi;
4459     assert(result->bottom_type()->isa_int(), "must be");
4460     break;
4461   }
4462 
4463   default:
4464     fatal_unexpected_iid(id);
4465     break;
4466   }
4467   set_result(_gvn.transform(result));
4468   return true;
4469 }
4470 
4471 //----------------------inline_unsafe_copyMemory-------------------------
4472 // public native void Unsafe.copyMemory0(Object srcBase, long srcOffset, Object destBase, long destOffset, long bytes);
4473 bool LibraryCallKit::inline_unsafe_copyMemory() {
4474   if (callee()->is_static())  return false;  // caller must have the capability!
4475   null_check_receiver();  // null-check receiver
4476   if (stopped())  return true;
4477 
4478   C->set_has_unsafe_access(true);  // Mark eventual nmethod as "unsafe".
4479 
4480   Node* src_ptr =         argument(1);   // type: oop
4481   Node* src_off = ConvL2X(argument(2));  // type: long
4482   Node* dst_ptr =         argument(4);   // type: oop
4483   Node* dst_off = ConvL2X(argument(5));  // type: long
4484   Node* size    = ConvL2X(argument(7));  // type: long
4485 
4486   assert(Unsafe_field_offset_to_byte_offset(11) == 11,
4487          "fieldOffset must be byte-scaled");
4488 
4489   Node* src = make_unsafe_address(src_ptr, src_off);
4490   Node* dst = make_unsafe_address(dst_ptr, dst_off);
4491 
4492   // Conservatively insert a memory barrier on all memory slices.
4493   // Do not let writes of the copy source or destination float below the copy.
4494   insert_mem_bar(Op_MemBarCPUOrder);
4495 
4496   // Call it.  Note that the length argument is not scaled.
4497   make_runtime_call(RC_LEAF|RC_NO_FP,
4498                     OptoRuntime::fast_arraycopy_Type(),
4499                     StubRoutines::unsafe_arraycopy(),
4500                     "unsafe_arraycopy",
4501                     TypeRawPtr::BOTTOM,
4502                     src, dst, size XTOP);
4503 
4504   // Do not let reads of the copy destination float above the copy.
4505   insert_mem_bar(Op_MemBarCPUOrder);
4506 
4507   return true;
4508 }
4509 
4510 //------------------------clone_coping-----------------------------------
4511 // Helper function for inline_native_clone.
4512 void LibraryCallKit::copy_to_clone(Node* obj, Node* alloc_obj, Node* obj_size, bool is_array, bool card_mark) {
4513   assert(obj_size != NULL, "");
4514   Node* raw_obj = alloc_obj->in(1);
4515   assert(alloc_obj->is_CheckCastPP() && raw_obj->is_Proj() && raw_obj->in(0)->is_Allocate(), "");
4516 
4517   AllocateNode* alloc = NULL;
4518   if (ReduceBulkZeroing) {
4519     // We will be completely responsible for initializing this object -
4520     // mark Initialize node as complete.
4521     alloc = AllocateNode::Ideal_allocation(alloc_obj, &_gvn);
4522     // The object was just allocated - there should be no any stores!
4523     guarantee(alloc != NULL && alloc->maybe_set_complete(&_gvn), "");
4524     // Mark as complete_with_arraycopy so that on AllocateNode
4525     // expansion, we know this AllocateNode is initialized by an array
4526     // copy and a StoreStore barrier exists after the array copy.
4527     alloc->initialization()->set_complete_with_arraycopy();
4528   }
4529 
4530   // Copy the fastest available way.
4531   // TODO: generate fields copies for small objects instead.
4532   Node* src  = obj;
4533   Node* dest = alloc_obj;
4534   Node* size = _gvn.transform(obj_size);
4535 
4536   // Exclude the header but include array length to copy by 8 bytes words.
4537   // Can't use base_offset_in_bytes(bt) since basic type is unknown.
4538   int base_off = is_array ? arrayOopDesc::length_offset_in_bytes() :
4539                             instanceOopDesc::base_offset_in_bytes();
4540   // base_off:
4541   // 8  - 32-bit VM
4542   // 12 - 64-bit VM, compressed klass
4543   // 16 - 64-bit VM, normal klass
4544   if (base_off % BytesPerLong != 0) {
4545     assert(UseCompressedClassPointers, "");
4546     if (is_array) {
4547       // Exclude length to copy by 8 bytes words.
4548       base_off += sizeof(int);
4549     } else {
4550       // Include klass to copy by 8 bytes words.
4551       base_off = instanceOopDesc::klass_offset_in_bytes();
4552     }
4553     assert(base_off % BytesPerLong == 0, "expect 8 bytes alignment");
4554   }
4555   src  = basic_plus_adr(src,  base_off);
4556   dest = basic_plus_adr(dest, base_off);
4557 
4558   // Compute the length also, if needed:
4559   Node* countx = size;
4560   countx = _gvn.transform(new SubXNode(countx, MakeConX(base_off)));
4561   countx = _gvn.transform(new URShiftXNode(countx, intcon(LogBytesPerLong) ));
4562 
4563   const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
4564 
4565   ArrayCopyNode* ac = ArrayCopyNode::make(this, false, src, NULL, dest, NULL, countx, false);
4566   ac->set_clonebasic();
4567   Node* n = _gvn.transform(ac);
4568   if (n == ac) {
4569     set_predefined_output_for_runtime_call(ac, ac->in(TypeFunc::Memory), raw_adr_type);
4570   } else {
4571     set_all_memory(n);
4572   }
4573 
4574   // If necessary, emit some card marks afterwards.  (Non-arrays only.)
4575   if (card_mark) {
4576     assert(!is_array, "");
4577     // Put in store barrier for any and all oops we are sticking
4578     // into this object.  (We could avoid this if we could prove
4579     // that the object type contains no oop fields at all.)
4580     Node* no_particular_value = NULL;
4581     Node* no_particular_field = NULL;
4582     int raw_adr_idx = Compile::AliasIdxRaw;
4583     post_barrier(control(),
4584                  memory(raw_adr_type),
4585                  alloc_obj,
4586                  no_particular_field,
4587                  raw_adr_idx,
4588                  no_particular_value,
4589                  T_OBJECT,
4590                  false);
4591   }
4592 
4593   // Do not let reads from the cloned object float above the arraycopy.
4594   if (alloc != NULL) {
4595     // Do not let stores that initialize this object be reordered with
4596     // a subsequent store that would make this object accessible by
4597     // other threads.
4598     // Record what AllocateNode this StoreStore protects so that
4599     // escape analysis can go from the MemBarStoreStoreNode to the
4600     // AllocateNode and eliminate the MemBarStoreStoreNode if possible
4601     // based on the escape status of the AllocateNode.
4602     insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
4603   } else {
4604     insert_mem_bar(Op_MemBarCPUOrder);
4605   }
4606 }
4607 
4608 //------------------------inline_native_clone----------------------------
4609 // protected native Object java.lang.Object.clone();
4610 //
4611 // Here are the simple edge cases:
4612 //  null receiver => normal trap
4613 //  virtual and clone was overridden => slow path to out-of-line clone
4614 //  not cloneable or finalizer => slow path to out-of-line Object.clone
4615 //
4616 // The general case has two steps, allocation and copying.
4617 // Allocation has two cases, and uses GraphKit::new_instance or new_array.
4618 //
4619 // Copying also has two cases, oop arrays and everything else.
4620 // Oop arrays use arrayof_oop_arraycopy (same as System.arraycopy).
4621 // Everything else uses the tight inline loop supplied by CopyArrayNode.
4622 //
4623 // These steps fold up nicely if and when the cloned object's klass
4624 // can be sharply typed as an object array, a type array, or an instance.
4625 //
4626 bool LibraryCallKit::inline_native_clone(bool is_virtual) {
4627   PhiNode* result_val;
4628 
4629   // Set the reexecute bit for the interpreter to reexecute
4630   // the bytecode that invokes Object.clone if deoptimization happens.
4631   { PreserveReexecuteState preexecs(this);
4632     jvms()->set_should_reexecute(true);
4633 
4634     Node* obj = null_check_receiver();
4635     if (stopped())  return true;
4636 
4637     const TypeOopPtr* obj_type = _gvn.type(obj)->is_oopptr();
4638 
4639     // If we are going to clone an instance, we need its exact type to
4640     // know the number and types of fields to convert the clone to
4641     // loads/stores. Maybe a speculative type can help us.
4642     if (!obj_type->klass_is_exact() &&
4643         obj_type->speculative_type() != NULL &&
4644         obj_type->speculative_type()->is_instance_klass()) {
4645       ciInstanceKlass* spec_ik = obj_type->speculative_type()->as_instance_klass();
4646       if (spec_ik->nof_nonstatic_fields() <= ArrayCopyLoadStoreMaxElem &&
4647           !spec_ik->has_injected_fields()) {
4648         ciKlass* k = obj_type->klass();
4649         if (!k->is_instance_klass() ||
4650             k->as_instance_klass()->is_interface() ||
4651             k->as_instance_klass()->has_subklass()) {
4652           obj = maybe_cast_profiled_obj(obj, obj_type->speculative_type(), false);
4653         }
4654       }
4655     }
4656 
4657     Node* obj_klass = load_object_klass(obj);
4658     const TypeKlassPtr* tklass = _gvn.type(obj_klass)->isa_klassptr();
4659     const TypeOopPtr*   toop   = ((tklass != NULL)
4660                                 ? tklass->as_instance_type()
4661                                 : TypeInstPtr::NOTNULL);
4662 
4663     // Conservatively insert a memory barrier on all memory slices.
4664     // Do not let writes into the original float below the clone.
4665     insert_mem_bar(Op_MemBarCPUOrder);
4666 
4667     // paths into result_reg:
4668     enum {
4669       _slow_path = 1,     // out-of-line call to clone method (virtual or not)
4670       _objArray_path,     // plain array allocation, plus arrayof_oop_arraycopy
4671       _array_path,        // plain array allocation, plus arrayof_long_arraycopy
4672       _instance_path,     // plain instance allocation, plus arrayof_long_arraycopy
4673       PATH_LIMIT
4674     };
4675     RegionNode* result_reg = new RegionNode(PATH_LIMIT);
4676     result_val             = new PhiNode(result_reg, TypeInstPtr::NOTNULL);
4677     PhiNode*    result_i_o = new PhiNode(result_reg, Type::ABIO);
4678     PhiNode*    result_mem = new PhiNode(result_reg, Type::MEMORY, TypePtr::BOTTOM);
4679     record_for_igvn(result_reg);
4680 
4681     const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
4682     int raw_adr_idx = Compile::AliasIdxRaw;
4683 
4684     Node* array_ctl = generate_array_guard(obj_klass, (RegionNode*)NULL);
4685     if (array_ctl != NULL) {
4686       // It's an array.
4687       PreserveJVMState pjvms(this);
4688       set_control(array_ctl);
4689       Node* obj_length = load_array_length(obj);
4690       Node* obj_size  = NULL;
4691       Node* alloc_obj = new_array(obj_klass, obj_length, 0, &obj_size);  // no arguments to push
4692 
4693       if (!use_ReduceInitialCardMarks()) {
4694         // If it is an oop array, it requires very special treatment,
4695         // because card marking is required on each card of the array.
4696         Node* is_obja = generate_objArray_guard(obj_klass, (RegionNode*)NULL);
4697         if (is_obja != NULL) {
4698           PreserveJVMState pjvms2(this);
4699           set_control(is_obja);
4700           // Generate a direct call to the right arraycopy function(s).
4701           Node* alloc = tightly_coupled_allocation(alloc_obj, NULL);
4702           ArrayCopyNode* ac = ArrayCopyNode::make(this, true, obj, intcon(0), alloc_obj, intcon(0), obj_length, alloc != NULL);
4703           ac->set_cloneoop();
4704           Node* n = _gvn.transform(ac);
4705           assert(n == ac, "cannot disappear");
4706           ac->connect_outputs(this);
4707 
4708           result_reg->init_req(_objArray_path, control());
4709           result_val->init_req(_objArray_path, alloc_obj);
4710           result_i_o ->set_req(_objArray_path, i_o());
4711           result_mem ->set_req(_objArray_path, reset_memory());
4712         }
4713       }
4714       // Otherwise, there are no card marks to worry about.
4715       // (We can dispense with card marks if we know the allocation
4716       //  comes out of eden (TLAB)...  In fact, ReduceInitialCardMarks
4717       //  causes the non-eden paths to take compensating steps to
4718       //  simulate a fresh allocation, so that no further
4719       //  card marks are required in compiled code to initialize
4720       //  the object.)
4721 
4722       if (!stopped()) {
4723         copy_to_clone(obj, alloc_obj, obj_size, true, false);
4724 
4725         // Present the results of the copy.
4726         result_reg->init_req(_array_path, control());
4727         result_val->init_req(_array_path, alloc_obj);
4728         result_i_o ->set_req(_array_path, i_o());
4729         result_mem ->set_req(_array_path, reset_memory());
4730       }
4731     }
4732 
4733     // We only go to the instance fast case code if we pass a number of guards.
4734     // The paths which do not pass are accumulated in the slow_region.
4735     RegionNode* slow_region = new RegionNode(1);
4736     record_for_igvn(slow_region);
4737     if (!stopped()) {
4738       // It's an instance (we did array above).  Make the slow-path tests.
4739       // If this is a virtual call, we generate a funny guard.  We grab
4740       // the vtable entry corresponding to clone() from the target object.
4741       // If the target method which we are calling happens to be the
4742       // Object clone() method, we pass the guard.  We do not need this
4743       // guard for non-virtual calls; the caller is known to be the native
4744       // Object clone().
4745       if (is_virtual) {
4746         generate_virtual_guard(obj_klass, slow_region);
4747       }
4748 
4749       // The object must be easily cloneable and must not have a finalizer.
4750       // Both of these conditions may be checked in a single test.
4751       // We could optimize the test further, but we don't care.
4752       generate_access_flags_guard(obj_klass,
4753                                   // Test both conditions:
4754                                   JVM_ACC_IS_CLONEABLE_FAST | JVM_ACC_HAS_FINALIZER,
4755                                   // Must be cloneable but not finalizer:
4756                                   JVM_ACC_IS_CLONEABLE_FAST,
4757                                   slow_region);
4758     }
4759 
4760     if (!stopped()) {
4761       // It's an instance, and it passed the slow-path tests.
4762       PreserveJVMState pjvms(this);
4763       Node* obj_size  = NULL;
4764       // Need to deoptimize on exception from allocation since Object.clone intrinsic
4765       // is reexecuted if deoptimization occurs and there could be problems when merging
4766       // exception state between multiple Object.clone versions (reexecute=true vs reexecute=false).
4767       Node* alloc_obj = new_instance(obj_klass, NULL, &obj_size, /*deoptimize_on_exception=*/true);
4768 
4769       copy_to_clone(obj, alloc_obj, obj_size, false, !use_ReduceInitialCardMarks());
4770 
4771       // Present the results of the slow call.
4772       result_reg->init_req(_instance_path, control());
4773       result_val->init_req(_instance_path, alloc_obj);
4774       result_i_o ->set_req(_instance_path, i_o());
4775       result_mem ->set_req(_instance_path, reset_memory());
4776     }
4777 
4778     // Generate code for the slow case.  We make a call to clone().
4779     set_control(_gvn.transform(slow_region));
4780     if (!stopped()) {
4781       PreserveJVMState pjvms(this);
4782       CallJavaNode* slow_call = generate_method_call(vmIntrinsics::_clone, is_virtual);
4783       Node* slow_result = set_results_for_java_call(slow_call);
4784       // this->control() comes from set_results_for_java_call
4785       result_reg->init_req(_slow_path, control());
4786       result_val->init_req(_slow_path, slow_result);
4787       result_i_o ->set_req(_slow_path, i_o());
4788       result_mem ->set_req(_slow_path, reset_memory());
4789     }
4790 
4791     // Return the combined state.
4792     set_control(    _gvn.transform(result_reg));
4793     set_i_o(        _gvn.transform(result_i_o));
4794     set_all_memory( _gvn.transform(result_mem));
4795   } // original reexecute is set back here
4796 
4797   set_result(_gvn.transform(result_val));
4798   return true;
4799 }
4800 
4801 // If we have a tighly coupled allocation, the arraycopy may take care
4802 // of the array initialization. If one of the guards we insert between
4803 // the allocation and the arraycopy causes a deoptimization, an
4804 // unitialized array will escape the compiled method. To prevent that
4805 // we set the JVM state for uncommon traps between the allocation and
4806 // the arraycopy to the state before the allocation so, in case of
4807 // deoptimization, we'll reexecute the allocation and the
4808 // initialization.
4809 JVMState* LibraryCallKit::arraycopy_restore_alloc_state(AllocateArrayNode* alloc, int& saved_reexecute_sp) {
4810   if (alloc != NULL) {
4811     ciMethod* trap_method = alloc->jvms()->method();
4812     int trap_bci = alloc->jvms()->bci();
4813 
4814     if (!C->too_many_traps(trap_method, trap_bci, Deoptimization::Reason_intrinsic) &
4815           !C->too_many_traps(trap_method, trap_bci, Deoptimization::Reason_null_check)) {
4816       // Make sure there's no store between the allocation and the
4817       // arraycopy otherwise visible side effects could be rexecuted
4818       // in case of deoptimization and cause incorrect execution.
4819       bool no_interfering_store = true;
4820       Node* mem = alloc->in(TypeFunc::Memory);
4821       if (mem->is_MergeMem()) {
4822         for (MergeMemStream mms(merged_memory(), mem->as_MergeMem()); mms.next_non_empty2(); ) {
4823           Node* n = mms.memory();
4824           if (n != mms.memory2() && !(n->is_Proj() && n->in(0) == alloc->initialization())) {
4825             assert(n->is_Store(), "what else?");
4826             no_interfering_store = false;
4827             break;
4828           }
4829         }
4830       } else {
4831         for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) {
4832           Node* n = mms.memory();
4833           if (n != mem && !(n->is_Proj() && n->in(0) == alloc->initialization())) {
4834             assert(n->is_Store(), "what else?");
4835             no_interfering_store = false;
4836             break;
4837           }
4838         }
4839       }
4840 
4841       if (no_interfering_store) {
4842         JVMState* old_jvms = alloc->jvms()->clone_shallow(C);
4843         uint size = alloc->req();
4844         SafePointNode* sfpt = new SafePointNode(size, old_jvms);
4845         old_jvms->set_map(sfpt);
4846         for (uint i = 0; i < size; i++) {
4847           sfpt->init_req(i, alloc->in(i));
4848         }
4849         // re-push array length for deoptimization
4850         sfpt->ins_req(old_jvms->stkoff() + old_jvms->sp(), alloc->in(AllocateNode::ALength));
4851         old_jvms->set_sp(old_jvms->sp()+1);
4852         old_jvms->set_monoff(old_jvms->monoff()+1);
4853         old_jvms->set_scloff(old_jvms->scloff()+1);
4854         old_jvms->set_endoff(old_jvms->endoff()+1);
4855         old_jvms->set_should_reexecute(true);
4856 
4857         sfpt->set_i_o(map()->i_o());
4858         sfpt->set_memory(map()->memory());
4859         sfpt->set_control(map()->control());
4860 
4861         JVMState* saved_jvms = jvms();
4862         saved_reexecute_sp = _reexecute_sp;
4863 
4864         set_jvms(sfpt->jvms());
4865         _reexecute_sp = jvms()->sp();
4866 
4867         return saved_jvms;
4868       }
4869     }
4870   }
4871   return NULL;
4872 }
4873 
4874 // In case of a deoptimization, we restart execution at the
4875 // allocation, allocating a new array. We would leave an uninitialized
4876 // array in the heap that GCs wouldn't expect. Move the allocation
4877 // after the traps so we don't allocate the array if we
4878 // deoptimize. This is possible because tightly_coupled_allocation()
4879 // guarantees there's no observer of the allocated array at this point
4880 // and the control flow is simple enough.
4881 void LibraryCallKit::arraycopy_move_allocation_here(AllocateArrayNode* alloc, Node* dest, JVMState* saved_jvms, int saved_reexecute_sp) {
4882   if (saved_jvms != NULL && !stopped()) {
4883     assert(alloc != NULL, "only with a tightly coupled allocation");
4884     // restore JVM state to the state at the arraycopy
4885     saved_jvms->map()->set_control(map()->control());
4886     assert(saved_jvms->map()->memory() == map()->memory(), "memory state changed?");
4887     assert(saved_jvms->map()->i_o() == map()->i_o(), "IO state changed?");
4888     // If we've improved the types of some nodes (null check) while
4889     // emitting the guards, propagate them to the current state
4890     map()->replaced_nodes().apply(saved_jvms->map());
4891     set_jvms(saved_jvms);
4892     _reexecute_sp = saved_reexecute_sp;
4893 
4894     // Remove the allocation from above the guards
4895     CallProjections callprojs;
4896     alloc->extract_projections(&callprojs, true);
4897     InitializeNode* init = alloc->initialization();
4898     Node* alloc_mem = alloc->in(TypeFunc::Memory);
4899     C->gvn_replace_by(callprojs.fallthrough_ioproj, alloc->in(TypeFunc::I_O));
4900     C->gvn_replace_by(init->proj_out(TypeFunc::Memory), alloc_mem);
4901     C->gvn_replace_by(init->proj_out(TypeFunc::Control), alloc->in(0));
4902 
4903     // move the allocation here (after the guards)
4904     _gvn.hash_delete(alloc);
4905     alloc->set_req(TypeFunc::Control, control());
4906     alloc->set_req(TypeFunc::I_O, i_o());
4907     Node *mem = reset_memory();
4908     set_all_memory(mem);
4909     alloc->set_req(TypeFunc::Memory, mem);
4910     set_control(init->proj_out(TypeFunc::Control));
4911     set_i_o(callprojs.fallthrough_ioproj);
4912 
4913     // Update memory as done in GraphKit::set_output_for_allocation()
4914     const TypeInt* length_type = _gvn.find_int_type(alloc->in(AllocateNode::ALength));
4915     const TypeOopPtr* ary_type = _gvn.type(alloc->in(AllocateNode::KlassNode))->is_klassptr()->as_instance_type();
4916     if (ary_type->isa_aryptr() && length_type != NULL) {
4917       ary_type = ary_type->is_aryptr()->cast_to_size(length_type);
4918     }
4919     const TypePtr* telemref = ary_type->add_offset(Type::OffsetBot);
4920     int            elemidx  = C->get_alias_index(telemref);
4921     set_memory(init->proj_out(TypeFunc::Memory), Compile::AliasIdxRaw);
4922     set_memory(init->proj_out(TypeFunc::Memory), elemidx);
4923 
4924     Node* allocx = _gvn.transform(alloc);
4925     assert(allocx == alloc, "where has the allocation gone?");
4926     assert(dest->is_CheckCastPP(), "not an allocation result?");
4927 
4928     _gvn.hash_delete(dest);
4929     dest->set_req(0, control());
4930     Node* destx = _gvn.transform(dest);
4931     assert(destx == dest, "where has the allocation result gone?");
4932   }
4933 }
4934 
4935 
4936 //------------------------------inline_arraycopy-----------------------
4937 // public static native void java.lang.System.arraycopy(Object src,  int  srcPos,
4938 //                                                      Object dest, int destPos,
4939 //                                                      int length);
4940 bool LibraryCallKit::inline_arraycopy() {
4941   // Get the arguments.
4942   Node* src         = argument(0);  // type: oop
4943   Node* src_offset  = argument(1);  // type: int
4944   Node* dest        = argument(2);  // type: oop
4945   Node* dest_offset = argument(3);  // type: int
4946   Node* length      = argument(4);  // type: int
4947 
4948 
4949   // Check for allocation before we add nodes that would confuse
4950   // tightly_coupled_allocation()
4951   AllocateArrayNode* alloc = tightly_coupled_allocation(dest, NULL);
4952 
4953   int saved_reexecute_sp = -1;
4954   JVMState* saved_jvms = arraycopy_restore_alloc_state(alloc, saved_reexecute_sp);
4955   // See arraycopy_restore_alloc_state() comment
4956   // if alloc == NULL we don't have to worry about a tightly coupled allocation so we can emit all needed guards
4957   // if saved_jvms != NULL (then alloc != NULL) then we can handle guards and a tightly coupled allocation
4958   // if saved_jvms == NULL and alloc != NULL, we can’t emit any guards
4959   bool can_emit_guards = (alloc == NULL || saved_jvms != NULL);
4960 
4961   // The following tests must be performed
4962   // (1) src and dest are arrays.
4963   // (2) src and dest arrays must have elements of the same BasicType
4964   // (3) src and dest must not be null.
4965   // (4) src_offset must not be negative.
4966   // (5) dest_offset must not be negative.
4967   // (6) length must not be negative.
4968   // (7) src_offset + length must not exceed length of src.
4969   // (8) dest_offset + length must not exceed length of dest.
4970   // (9) each element of an oop array must be assignable
4971 
4972   // (3) src and dest must not be null.
4973   // always do this here because we need the JVM state for uncommon traps
4974   Node* null_ctl = top();
4975   src  = saved_jvms != NULL ? null_check_oop(src, &null_ctl, true, true) : null_check(src,  T_ARRAY);
4976   assert(null_ctl->is_top(), "no null control here");
4977   dest = null_check(dest, T_ARRAY);
4978 
4979   if (!can_emit_guards) {
4980     // if saved_jvms == NULL and alloc != NULL, we don't emit any
4981     // guards but the arraycopy node could still take advantage of a
4982     // tightly allocated allocation. tightly_coupled_allocation() is
4983     // called again to make sure it takes the null check above into
4984     // account: the null check is mandatory and if it caused an
4985     // uncommon trap to be emitted then the allocation can't be
4986     // considered tightly coupled in this context.
4987     alloc = tightly_coupled_allocation(dest, NULL);
4988   }
4989 
4990   bool validated = false;
4991 
4992   const Type* src_type  = _gvn.type(src);
4993   const Type* dest_type = _gvn.type(dest);
4994   const TypeAryPtr* top_src  = src_type->isa_aryptr();
4995   const TypeAryPtr* top_dest = dest_type->isa_aryptr();
4996 
4997   // Do we have the type of src?
4998   bool has_src = (top_src != NULL && top_src->klass() != NULL);
4999   // Do we have the type of dest?
5000   bool has_dest = (top_dest != NULL && top_dest->klass() != NULL);
5001   // Is the type for src from speculation?
5002   bool src_spec = false;
5003   // Is the type for dest from speculation?
5004   bool dest_spec = false;
5005 
5006   if ((!has_src || !has_dest) && can_emit_guards) {
5007     // We don't have sufficient type information, let's see if
5008     // speculative types can help. We need to have types for both src
5009     // and dest so that it pays off.
5010 
5011     // Do we already have or could we have type information for src
5012     bool could_have_src = has_src;
5013     // Do we already have or could we have type information for dest
5014     bool could_have_dest = has_dest;
5015 
5016     ciKlass* src_k = NULL;
5017     if (!has_src) {
5018       src_k = src_type->speculative_type_not_null();
5019       if (src_k != NULL && src_k->is_array_klass()) {
5020         could_have_src = true;
5021       }
5022     }
5023 
5024     ciKlass* dest_k = NULL;
5025     if (!has_dest) {
5026       dest_k = dest_type->speculative_type_not_null();
5027       if (dest_k != NULL && dest_k->is_array_klass()) {
5028         could_have_dest = true;
5029       }
5030     }
5031 
5032     if (could_have_src && could_have_dest) {
5033       // This is going to pay off so emit the required guards
5034       if (!has_src) {
5035         src = maybe_cast_profiled_obj(src, src_k, true);
5036         src_type  = _gvn.type(src);
5037         top_src  = src_type->isa_aryptr();
5038         has_src = (top_src != NULL && top_src->klass() != NULL);
5039         src_spec = true;
5040       }
5041       if (!has_dest) {
5042         dest = maybe_cast_profiled_obj(dest, dest_k, true);
5043         dest_type  = _gvn.type(dest);
5044         top_dest  = dest_type->isa_aryptr();
5045         has_dest = (top_dest != NULL && top_dest->klass() != NULL);
5046         dest_spec = true;
5047       }
5048     }
5049   }
5050 
5051   if (has_src && has_dest && can_emit_guards) {
5052     BasicType src_elem  = top_src->klass()->as_array_klass()->element_type()->basic_type();
5053     BasicType dest_elem = top_dest->klass()->as_array_klass()->element_type()->basic_type();
5054     if (src_elem  == T_ARRAY)  src_elem  = T_OBJECT;
5055     if (dest_elem == T_ARRAY)  dest_elem = T_OBJECT;
5056 
5057     if (src_elem == dest_elem && src_elem == T_OBJECT) {
5058       // If both arrays are object arrays then having the exact types
5059       // for both will remove the need for a subtype check at runtime
5060       // before the call and may make it possible to pick a faster copy
5061       // routine (without a subtype check on every element)
5062       // Do we have the exact type of src?
5063       bool could_have_src = src_spec;
5064       // Do we have the exact type of dest?
5065       bool could_have_dest = dest_spec;
5066       ciKlass* src_k = top_src->klass();
5067       ciKlass* dest_k = top_dest->klass();
5068       if (!src_spec) {
5069         src_k = src_type->speculative_type_not_null();
5070         if (src_k != NULL && src_k->is_array_klass()) {
5071           could_have_src = true;
5072         }
5073       }
5074       if (!dest_spec) {
5075         dest_k = dest_type->speculative_type_not_null();
5076         if (dest_k != NULL && dest_k->is_array_klass()) {
5077           could_have_dest = true;
5078         }
5079       }
5080       if (could_have_src && could_have_dest) {
5081         // If we can have both exact types, emit the missing guards
5082         if (could_have_src && !src_spec) {
5083           src = maybe_cast_profiled_obj(src, src_k, true);
5084         }
5085         if (could_have_dest && !dest_spec) {
5086           dest = maybe_cast_profiled_obj(dest, dest_k, true);
5087         }
5088       }
5089     }
5090   }
5091 
5092   ciMethod* trap_method = method();
5093   int trap_bci = bci();
5094   if (saved_jvms != NULL) {
5095     trap_method = alloc->jvms()->method();
5096     trap_bci = alloc->jvms()->bci();
5097   }
5098 
5099   if (!C->too_many_traps(trap_method, trap_bci, Deoptimization::Reason_intrinsic) &&
5100       can_emit_guards &&
5101       !src->is_top() && !dest->is_top()) {
5102     // validate arguments: enables transformation the ArrayCopyNode
5103     validated = true;
5104 
5105     RegionNode* slow_region = new RegionNode(1);
5106     record_for_igvn(slow_region);
5107 
5108     // (1) src and dest are arrays.
5109     generate_non_array_guard(load_object_klass(src), slow_region);
5110     generate_non_array_guard(load_object_klass(dest), slow_region);
5111 
5112     // (2) src and dest arrays must have elements of the same BasicType
5113     // done at macro expansion or at Ideal transformation time
5114 
5115     // (4) src_offset must not be negative.
5116     generate_negative_guard(src_offset, slow_region);
5117 
5118     // (5) dest_offset must not be negative.
5119     generate_negative_guard(dest_offset, slow_region);
5120 
5121     // (7) src_offset + length must not exceed length of src.
5122     generate_limit_guard(src_offset, length,
5123                          load_array_length(src),
5124                          slow_region);
5125 
5126     // (8) dest_offset + length must not exceed length of dest.
5127     generate_limit_guard(dest_offset, length,
5128                          load_array_length(dest),
5129                          slow_region);
5130 
5131     // (9) each element of an oop array must be assignable
5132     Node* src_klass  = load_object_klass(src);
5133     Node* dest_klass = load_object_klass(dest);
5134     Node* not_subtype_ctrl = gen_subtype_check(src_klass, dest_klass);
5135 
5136     if (not_subtype_ctrl != top()) {
5137       PreserveJVMState pjvms(this);
5138       set_control(not_subtype_ctrl);
5139       uncommon_trap(Deoptimization::Reason_intrinsic,
5140                     Deoptimization::Action_make_not_entrant);
5141       assert(stopped(), "Should be stopped");
5142     }
5143     {
5144       PreserveJVMState pjvms(this);
5145       set_control(_gvn.transform(slow_region));
5146       uncommon_trap(Deoptimization::Reason_intrinsic,
5147                     Deoptimization::Action_make_not_entrant);
5148       assert(stopped(), "Should be stopped");
5149     }
5150   }
5151 
5152   arraycopy_move_allocation_here(alloc, dest, saved_jvms, saved_reexecute_sp);
5153 
5154   if (stopped()) {
5155     return true;
5156   }
5157 
5158   ArrayCopyNode* ac = ArrayCopyNode::make(this, true, src, src_offset, dest, dest_offset, length, alloc != NULL,
5159                                           // Create LoadRange and LoadKlass nodes for use during macro expansion here
5160                                           // so the compiler has a chance to eliminate them: during macro expansion,
5161                                           // we have to set their control (CastPP nodes are eliminated).
5162                                           load_object_klass(src), load_object_klass(dest),
5163                                           load_array_length(src), load_array_length(dest));
5164 
5165   ac->set_arraycopy(validated);
5166 
5167   Node* n = _gvn.transform(ac);
5168   if (n == ac) {
5169     ac->connect_outputs(this);
5170   } else {
5171     assert(validated, "shouldn't transform if all arguments not validated");
5172     set_all_memory(n);
5173   }
5174 
5175   return true;
5176 }
5177 
5178 
5179 // Helper function which determines if an arraycopy immediately follows
5180 // an allocation, with no intervening tests or other escapes for the object.
5181 AllocateArrayNode*
5182 LibraryCallKit::tightly_coupled_allocation(Node* ptr,
5183                                            RegionNode* slow_region) {
5184   if (stopped())             return NULL;  // no fast path
5185   if (C->AliasLevel() == 0)  return NULL;  // no MergeMems around
5186 
5187   AllocateArrayNode* alloc = AllocateArrayNode::Ideal_array_allocation(ptr, &_gvn);
5188   if (alloc == NULL)  return NULL;
5189 
5190   Node* rawmem = memory(Compile::AliasIdxRaw);
5191   // Is the allocation's memory state untouched?
5192   if (!(rawmem->is_Proj() && rawmem->in(0)->is_Initialize())) {
5193     // Bail out if there have been raw-memory effects since the allocation.
5194     // (Example:  There might have been a call or safepoint.)
5195     return NULL;
5196   }
5197   rawmem = rawmem->in(0)->as_Initialize()->memory(Compile::AliasIdxRaw);
5198   if (!(rawmem->is_Proj() && rawmem->in(0) == alloc)) {
5199     return NULL;
5200   }
5201 
5202   // There must be no unexpected observers of this allocation.
5203   for (DUIterator_Fast imax, i = ptr->fast_outs(imax); i < imax; i++) {
5204     Node* obs = ptr->fast_out(i);
5205     if (obs != this->map()) {
5206       return NULL;
5207     }
5208   }
5209 
5210   // This arraycopy must unconditionally follow the allocation of the ptr.
5211   Node* alloc_ctl = ptr->in(0);
5212   assert(just_allocated_object(alloc_ctl) == ptr, "most recent allo");
5213 
5214   Node* ctl = control();
5215   while (ctl != alloc_ctl) {
5216     // There may be guards which feed into the slow_region.
5217     // Any other control flow means that we might not get a chance
5218     // to finish initializing the allocated object.
5219     if ((ctl->is_IfFalse() || ctl->is_IfTrue()) && ctl->in(0)->is_If()) {
5220       IfNode* iff = ctl->in(0)->as_If();
5221       Node* not_ctl = iff->proj_out(1 - ctl->as_Proj()->_con);
5222       assert(not_ctl != NULL && not_ctl != ctl, "found alternate");
5223       if (slow_region != NULL && slow_region->find_edge(not_ctl) >= 1) {
5224         ctl = iff->in(0);       // This test feeds the known slow_region.
5225         continue;
5226       }
5227       // One more try:  Various low-level checks bottom out in
5228       // uncommon traps.  If the debug-info of the trap omits
5229       // any reference to the allocation, as we've already
5230       // observed, then there can be no objection to the trap.
5231       bool found_trap = false;
5232       for (DUIterator_Fast jmax, j = not_ctl->fast_outs(jmax); j < jmax; j++) {
5233         Node* obs = not_ctl->fast_out(j);
5234         if (obs->in(0) == not_ctl && obs->is_Call() &&
5235             (obs->as_Call()->entry_point() == SharedRuntime::uncommon_trap_blob()->entry_point())) {
5236           found_trap = true; break;
5237         }
5238       }
5239       if (found_trap) {
5240         ctl = iff->in(0);       // This test feeds a harmless uncommon trap.
5241         continue;
5242       }
5243     }
5244     return NULL;
5245   }
5246 
5247   // If we get this far, we have an allocation which immediately
5248   // precedes the arraycopy, and we can take over zeroing the new object.
5249   // The arraycopy will finish the initialization, and provide
5250   // a new control state to which we will anchor the destination pointer.
5251 
5252   return alloc;
5253 }
5254 
5255 //-------------inline_encodeISOArray-----------------------------------
5256 // encode char[] to byte[] in ISO_8859_1
5257 bool LibraryCallKit::inline_encodeISOArray() {
5258   assert(callee()->signature()->size() == 5, "encodeISOArray has 5 parameters");
5259   // no receiver since it is static method
5260   Node *src         = argument(0);
5261   Node *src_offset  = argument(1);
5262   Node *dst         = argument(2);
5263   Node *dst_offset  = argument(3);
5264   Node *length      = argument(4);
5265 
5266   const Type* src_type = src->Value(&_gvn);
5267   const Type* dst_type = dst->Value(&_gvn);
5268   const TypeAryPtr* top_src = src_type->isa_aryptr();
5269   const TypeAryPtr* top_dest = dst_type->isa_aryptr();
5270   if (top_src  == NULL || top_src->klass()  == NULL ||
5271       top_dest == NULL || top_dest->klass() == NULL) {
5272     // failed array check
5273     return false;
5274   }
5275 
5276   // Figure out the size and type of the elements we will be copying.
5277   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5278   BasicType dst_elem = dst_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5279   if (!((src_elem == T_CHAR) || (src_elem== T_BYTE)) || dst_elem != T_BYTE) {
5280     return false;
5281   }
5282 
5283   Node* src_start = array_element_address(src, src_offset, T_CHAR);
5284   Node* dst_start = array_element_address(dst, dst_offset, dst_elem);
5285   // 'src_start' points to src array + scaled offset
5286   // 'dst_start' points to dst array + scaled offset
5287 
5288   const TypeAryPtr* mtype = TypeAryPtr::BYTES;
5289   Node* enc = new EncodeISOArrayNode(control(), memory(mtype), src_start, dst_start, length);
5290   enc = _gvn.transform(enc);
5291   Node* res_mem = _gvn.transform(new SCMemProjNode(enc));
5292   set_memory(res_mem, mtype);
5293   set_result(enc);
5294   return true;
5295 }
5296 
5297 //-------------inline_multiplyToLen-----------------------------------
5298 bool LibraryCallKit::inline_multiplyToLen() {
5299   assert(UseMultiplyToLenIntrinsic, "not implemented on this platform");
5300 
5301   address stubAddr = StubRoutines::multiplyToLen();
5302   if (stubAddr == NULL) {
5303     return false; // Intrinsic's stub is not implemented on this platform
5304   }
5305   const char* stubName = "multiplyToLen";
5306 
5307   assert(callee()->signature()->size() == 5, "multiplyToLen has 5 parameters");
5308 
5309   // no receiver because it is a static method
5310   Node* x    = argument(0);
5311   Node* xlen = argument(1);
5312   Node* y    = argument(2);
5313   Node* ylen = argument(3);
5314   Node* z    = argument(4);
5315 
5316   const Type* x_type = x->Value(&_gvn);
5317   const Type* y_type = y->Value(&_gvn);
5318   const TypeAryPtr* top_x = x_type->isa_aryptr();
5319   const TypeAryPtr* top_y = y_type->isa_aryptr();
5320   if (top_x  == NULL || top_x->klass()  == NULL ||
5321       top_y == NULL || top_y->klass() == NULL) {
5322     // failed array check
5323     return false;
5324   }
5325 
5326   BasicType x_elem = x_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5327   BasicType y_elem = y_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5328   if (x_elem != T_INT || y_elem != T_INT) {
5329     return false;
5330   }
5331 
5332   // Set the original stack and the reexecute bit for the interpreter to reexecute
5333   // the bytecode that invokes BigInteger.multiplyToLen() if deoptimization happens
5334   // on the return from z array allocation in runtime.
5335   { PreserveReexecuteState preexecs(this);
5336     jvms()->set_should_reexecute(true);
5337 
5338     Node* x_start = array_element_address(x, intcon(0), x_elem);
5339     Node* y_start = array_element_address(y, intcon(0), y_elem);
5340     // 'x_start' points to x array + scaled xlen
5341     // 'y_start' points to y array + scaled ylen
5342 
5343     // Allocate the result array
5344     Node* zlen = _gvn.transform(new AddINode(xlen, ylen));
5345     ciKlass* klass = ciTypeArrayKlass::make(T_INT);
5346     Node* klass_node = makecon(TypeKlassPtr::make(klass));
5347 
5348     IdealKit ideal(this);
5349 
5350 #define __ ideal.
5351      Node* one = __ ConI(1);
5352      Node* zero = __ ConI(0);
5353      IdealVariable need_alloc(ideal), z_alloc(ideal);  __ declarations_done();
5354      __ set(need_alloc, zero);
5355      __ set(z_alloc, z);
5356      __ if_then(z, BoolTest::eq, null()); {
5357        __ increment (need_alloc, one);
5358      } __ else_(); {
5359        // Update graphKit memory and control from IdealKit.
5360        sync_kit(ideal);
5361        Node* zlen_arg = load_array_length(z);
5362        // Update IdealKit memory and control from graphKit.
5363        __ sync_kit(this);
5364        __ if_then(zlen_arg, BoolTest::lt, zlen); {
5365          __ increment (need_alloc, one);
5366        } __ end_if();
5367      } __ end_if();
5368 
5369      __ if_then(__ value(need_alloc), BoolTest::ne, zero); {
5370        // Update graphKit memory and control from IdealKit.
5371        sync_kit(ideal);
5372        Node * narr = new_array(klass_node, zlen, 1);
5373        // Update IdealKit memory and control from graphKit.
5374        __ sync_kit(this);
5375        __ set(z_alloc, narr);
5376      } __ end_if();
5377 
5378      sync_kit(ideal);
5379      z = __ value(z_alloc);
5380      // Can't use TypeAryPtr::INTS which uses Bottom offset.
5381      _gvn.set_type(z, TypeOopPtr::make_from_klass(klass));
5382      // Final sync IdealKit and GraphKit.
5383      final_sync(ideal);
5384 #undef __
5385 
5386     Node* z_start = array_element_address(z, intcon(0), T_INT);
5387 
5388     Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
5389                                    OptoRuntime::multiplyToLen_Type(),
5390                                    stubAddr, stubName, TypePtr::BOTTOM,
5391                                    x_start, xlen, y_start, ylen, z_start, zlen);
5392   } // original reexecute is set back here
5393 
5394   C->set_has_split_ifs(true); // Has chance for split-if optimization
5395   set_result(z);
5396   return true;
5397 }
5398 
5399 //-------------inline_squareToLen------------------------------------
5400 bool LibraryCallKit::inline_squareToLen() {
5401   assert(UseSquareToLenIntrinsic, "not implemented on this platform");
5402 
5403   address stubAddr = StubRoutines::squareToLen();
5404   if (stubAddr == NULL) {
5405     return false; // Intrinsic's stub is not implemented on this platform
5406   }
5407   const char* stubName = "squareToLen";
5408 
5409   assert(callee()->signature()->size() == 4, "implSquareToLen has 4 parameters");
5410 
5411   Node* x    = argument(0);
5412   Node* len  = argument(1);
5413   Node* z    = argument(2);
5414   Node* zlen = argument(3);
5415 
5416   const Type* x_type = x->Value(&_gvn);
5417   const Type* z_type = z->Value(&_gvn);
5418   const TypeAryPtr* top_x = x_type->isa_aryptr();
5419   const TypeAryPtr* top_z = z_type->isa_aryptr();
5420   if (top_x  == NULL || top_x->klass()  == NULL ||
5421       top_z  == NULL || top_z->klass()  == NULL) {
5422     // failed array check
5423     return false;
5424   }
5425 
5426   BasicType x_elem = x_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5427   BasicType z_elem = z_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5428   if (x_elem != T_INT || z_elem != T_INT) {
5429     return false;
5430   }
5431 
5432 
5433   Node* x_start = array_element_address(x, intcon(0), x_elem);
5434   Node* z_start = array_element_address(z, intcon(0), z_elem);
5435 
5436   Node*  call = make_runtime_call(RC_LEAF|RC_NO_FP,
5437                                   OptoRuntime::squareToLen_Type(),
5438                                   stubAddr, stubName, TypePtr::BOTTOM,
5439                                   x_start, len, z_start, zlen);
5440 
5441   set_result(z);
5442   return true;
5443 }
5444 
5445 //-------------inline_mulAdd------------------------------------------
5446 bool LibraryCallKit::inline_mulAdd() {
5447   assert(UseMulAddIntrinsic, "not implemented on this platform");
5448 
5449   address stubAddr = StubRoutines::mulAdd();
5450   if (stubAddr == NULL) {
5451     return false; // Intrinsic's stub is not implemented on this platform
5452   }
5453   const char* stubName = "mulAdd";
5454 
5455   assert(callee()->signature()->size() == 5, "mulAdd has 5 parameters");
5456 
5457   Node* out      = argument(0);
5458   Node* in       = argument(1);
5459   Node* offset   = argument(2);
5460   Node* len      = argument(3);
5461   Node* k        = argument(4);
5462 
5463   const Type* out_type = out->Value(&_gvn);
5464   const Type* in_type = in->Value(&_gvn);
5465   const TypeAryPtr* top_out = out_type->isa_aryptr();
5466   const TypeAryPtr* top_in = in_type->isa_aryptr();
5467   if (top_out  == NULL || top_out->klass()  == NULL ||
5468       top_in == NULL || top_in->klass() == NULL) {
5469     // failed array check
5470     return false;
5471   }
5472 
5473   BasicType out_elem = out_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5474   BasicType in_elem = in_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5475   if (out_elem != T_INT || in_elem != T_INT) {
5476     return false;
5477   }
5478 
5479   Node* outlen = load_array_length(out);
5480   Node* new_offset = _gvn.transform(new SubINode(outlen, offset));
5481   Node* out_start = array_element_address(out, intcon(0), out_elem);
5482   Node* in_start = array_element_address(in, intcon(0), in_elem);
5483 
5484   Node*  call = make_runtime_call(RC_LEAF|RC_NO_FP,
5485                                   OptoRuntime::mulAdd_Type(),
5486                                   stubAddr, stubName, TypePtr::BOTTOM,
5487                                   out_start,in_start, new_offset, len, k);
5488   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5489   set_result(result);
5490   return true;
5491 }
5492 
5493 //-------------inline_montgomeryMultiply-----------------------------------
5494 bool LibraryCallKit::inline_montgomeryMultiply() {
5495   address stubAddr = StubRoutines::montgomeryMultiply();
5496   if (stubAddr == NULL) {
5497     return false; // Intrinsic's stub is not implemented on this platform
5498   }
5499 
5500   assert(UseMontgomeryMultiplyIntrinsic, "not implemented on this platform");
5501   const char* stubName = "montgomery_square";
5502 
5503   assert(callee()->signature()->size() == 7, "montgomeryMultiply has 7 parameters");
5504 
5505   Node* a    = argument(0);
5506   Node* b    = argument(1);
5507   Node* n    = argument(2);
5508   Node* len  = argument(3);
5509   Node* inv  = argument(4);
5510   Node* m    = argument(6);
5511 
5512   const Type* a_type = a->Value(&_gvn);
5513   const TypeAryPtr* top_a = a_type->isa_aryptr();
5514   const Type* b_type = b->Value(&_gvn);
5515   const TypeAryPtr* top_b = b_type->isa_aryptr();
5516   const Type* n_type = a->Value(&_gvn);
5517   const TypeAryPtr* top_n = n_type->isa_aryptr();
5518   const Type* m_type = a->Value(&_gvn);
5519   const TypeAryPtr* top_m = m_type->isa_aryptr();
5520   if (top_a  == NULL || top_a->klass()  == NULL ||
5521       top_b == NULL || top_b->klass()  == NULL ||
5522       top_n == NULL || top_n->klass()  == NULL ||
5523       top_m == NULL || top_m->klass()  == NULL) {
5524     // failed array check
5525     return false;
5526   }
5527 
5528   BasicType a_elem = a_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5529   BasicType b_elem = b_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5530   BasicType n_elem = n_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5531   BasicType m_elem = m_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5532   if (a_elem != T_INT || b_elem != T_INT || n_elem != T_INT || m_elem != T_INT) {
5533     return false;
5534   }
5535 
5536   // Make the call
5537   {
5538     Node* a_start = array_element_address(a, intcon(0), a_elem);
5539     Node* b_start = array_element_address(b, intcon(0), b_elem);
5540     Node* n_start = array_element_address(n, intcon(0), n_elem);
5541     Node* m_start = array_element_address(m, intcon(0), m_elem);
5542 
5543     Node* call = make_runtime_call(RC_LEAF,
5544                                    OptoRuntime::montgomeryMultiply_Type(),
5545                                    stubAddr, stubName, TypePtr::BOTTOM,
5546                                    a_start, b_start, n_start, len, inv, top(),
5547                                    m_start);
5548     set_result(m);
5549   }
5550 
5551   return true;
5552 }
5553 
5554 bool LibraryCallKit::inline_montgomerySquare() {
5555   address stubAddr = StubRoutines::montgomerySquare();
5556   if (stubAddr == NULL) {
5557     return false; // Intrinsic's stub is not implemented on this platform
5558   }
5559 
5560   assert(UseMontgomerySquareIntrinsic, "not implemented on this platform");
5561   const char* stubName = "montgomery_square";
5562 
5563   assert(callee()->signature()->size() == 6, "montgomerySquare has 6 parameters");
5564 
5565   Node* a    = argument(0);
5566   Node* n    = argument(1);
5567   Node* len  = argument(2);
5568   Node* inv  = argument(3);
5569   Node* m    = argument(5);
5570 
5571   const Type* a_type = a->Value(&_gvn);
5572   const TypeAryPtr* top_a = a_type->isa_aryptr();
5573   const Type* n_type = a->Value(&_gvn);
5574   const TypeAryPtr* top_n = n_type->isa_aryptr();
5575   const Type* m_type = a->Value(&_gvn);
5576   const TypeAryPtr* top_m = m_type->isa_aryptr();
5577   if (top_a  == NULL || top_a->klass()  == NULL ||
5578       top_n == NULL || top_n->klass()  == NULL ||
5579       top_m == NULL || top_m->klass()  == NULL) {
5580     // failed array check
5581     return false;
5582   }
5583 
5584   BasicType a_elem = a_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5585   BasicType n_elem = n_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5586   BasicType m_elem = m_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5587   if (a_elem != T_INT || n_elem != T_INT || m_elem != T_INT) {
5588     return false;
5589   }
5590 
5591   // Make the call
5592   {
5593     Node* a_start = array_element_address(a, intcon(0), a_elem);
5594     Node* n_start = array_element_address(n, intcon(0), n_elem);
5595     Node* m_start = array_element_address(m, intcon(0), m_elem);
5596 
5597     Node* call = make_runtime_call(RC_LEAF,
5598                                    OptoRuntime::montgomerySquare_Type(),
5599                                    stubAddr, stubName, TypePtr::BOTTOM,
5600                                    a_start, n_start, len, inv, top(),
5601                                    m_start);
5602     set_result(m);
5603   }
5604 
5605   return true;
5606 }
5607 
5608 //-------------inline_vectorizedMismatch------------------------------
5609 bool LibraryCallKit::inline_vectorizedMismatch() {
5610   assert(UseVectorizedMismatchIntrinsic, "not implementated on this platform");
5611 
5612   address stubAddr = StubRoutines::vectorizedMismatch();
5613   if (stubAddr == NULL) {
5614     return false; // Intrinsic's stub is not implemented on this platform
5615   }
5616   const char* stubName = "vectorizedMismatch";
5617   int size_l = callee()->signature()->size();
5618   assert(callee()->signature()->size() == 8, "vectorizedMismatch has 6 parameters");
5619 
5620   Node* obja = argument(0);
5621   Node* aoffset = argument(1);
5622   Node* objb = argument(3);
5623   Node* boffset = argument(4);
5624   Node* length = argument(6);
5625   Node* scale = argument(7);
5626 
5627   const Type* a_type = obja->Value(&_gvn);
5628   const Type* b_type = objb->Value(&_gvn);
5629   const TypeAryPtr* top_a = a_type->isa_aryptr();
5630   const TypeAryPtr* top_b = b_type->isa_aryptr();
5631   if (top_a == NULL || top_a->klass() == NULL ||
5632     top_b == NULL || top_b->klass() == NULL) {
5633     // failed array check
5634     return false;
5635   }
5636 
5637   Node* call;
5638   jvms()->set_should_reexecute(true);
5639 
5640   Node* obja_adr = make_unsafe_address(obja, aoffset);
5641   Node* objb_adr = make_unsafe_address(objb, boffset);
5642 
5643   call = make_runtime_call(RC_LEAF,
5644     OptoRuntime::vectorizedMismatch_Type(),
5645     stubAddr, stubName, TypePtr::BOTTOM,
5646     obja_adr, objb_adr, length, scale);
5647 
5648   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5649   set_result(result);
5650   return true;
5651 }
5652 
5653 /**
5654  * Calculate CRC32 for byte.
5655  * int java.util.zip.CRC32.update(int crc, int b)
5656  */
5657 bool LibraryCallKit::inline_updateCRC32() {
5658   assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
5659   assert(callee()->signature()->size() == 2, "update has 2 parameters");
5660   // no receiver since it is static method
5661   Node* crc  = argument(0); // type: int
5662   Node* b    = argument(1); // type: int
5663 
5664   /*
5665    *    int c = ~ crc;
5666    *    b = timesXtoThe32[(b ^ c) & 0xFF];
5667    *    b = b ^ (c >>> 8);
5668    *    crc = ~b;
5669    */
5670 
5671   Node* M1 = intcon(-1);
5672   crc = _gvn.transform(new XorINode(crc, M1));
5673   Node* result = _gvn.transform(new XorINode(crc, b));
5674   result = _gvn.transform(new AndINode(result, intcon(0xFF)));
5675 
5676   Node* base = makecon(TypeRawPtr::make(StubRoutines::crc_table_addr()));
5677   Node* offset = _gvn.transform(new LShiftINode(result, intcon(0x2)));
5678   Node* adr = basic_plus_adr(top(), base, ConvI2X(offset));
5679   result = make_load(control(), adr, TypeInt::INT, T_INT, MemNode::unordered);
5680 
5681   crc = _gvn.transform(new URShiftINode(crc, intcon(8)));
5682   result = _gvn.transform(new XorINode(crc, result));
5683   result = _gvn.transform(new XorINode(result, M1));
5684   set_result(result);
5685   return true;
5686 }
5687 
5688 /**
5689  * Calculate CRC32 for byte[] array.
5690  * int java.util.zip.CRC32.updateBytes(int crc, byte[] buf, int off, int len)
5691  */
5692 bool LibraryCallKit::inline_updateBytesCRC32() {
5693   assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
5694   assert(callee()->signature()->size() == 4, "updateBytes has 4 parameters");
5695   // no receiver since it is static method
5696   Node* crc     = argument(0); // type: int
5697   Node* src     = argument(1); // type: oop
5698   Node* offset  = argument(2); // type: int
5699   Node* length  = argument(3); // type: int
5700 
5701   const Type* src_type = src->Value(&_gvn);
5702   const TypeAryPtr* top_src = src_type->isa_aryptr();
5703   if (top_src  == NULL || top_src->klass()  == NULL) {
5704     // failed array check
5705     return false;
5706   }
5707 
5708   // Figure out the size and type of the elements we will be copying.
5709   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5710   if (src_elem != T_BYTE) {
5711     return false;
5712   }
5713 
5714   // 'src_start' points to src array + scaled offset
5715   Node* src_start = array_element_address(src, offset, src_elem);
5716 
5717   // We assume that range check is done by caller.
5718   // TODO: generate range check (offset+length < src.length) in debug VM.
5719 
5720   // Call the stub.
5721   address stubAddr = StubRoutines::updateBytesCRC32();
5722   const char *stubName = "updateBytesCRC32";
5723 
5724   Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::updateBytesCRC32_Type(),
5725                                  stubAddr, stubName, TypePtr::BOTTOM,
5726                                  crc, src_start, length);
5727   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5728   set_result(result);
5729   return true;
5730 }
5731 
5732 /**
5733  * Calculate CRC32 for ByteBuffer.
5734  * int java.util.zip.CRC32.updateByteBuffer(int crc, long buf, int off, int len)
5735  */
5736 bool LibraryCallKit::inline_updateByteBufferCRC32() {
5737   assert(UseCRC32Intrinsics, "need AVX and LCMUL instructions support");
5738   assert(callee()->signature()->size() == 5, "updateByteBuffer has 4 parameters and one is long");
5739   // no receiver since it is static method
5740   Node* crc     = argument(0); // type: int
5741   Node* src     = argument(1); // type: long
5742   Node* offset  = argument(3); // type: int
5743   Node* length  = argument(4); // type: int
5744 
5745   src = ConvL2X(src);  // adjust Java long to machine word
5746   Node* base = _gvn.transform(new CastX2PNode(src));
5747   offset = ConvI2X(offset);
5748 
5749   // 'src_start' points to src array + scaled offset
5750   Node* src_start = basic_plus_adr(top(), base, offset);
5751 
5752   // Call the stub.
5753   address stubAddr = StubRoutines::updateBytesCRC32();
5754   const char *stubName = "updateBytesCRC32";
5755 
5756   Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::updateBytesCRC32_Type(),
5757                                  stubAddr, stubName, TypePtr::BOTTOM,
5758                                  crc, src_start, length);
5759   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5760   set_result(result);
5761   return true;
5762 }
5763 
5764 //------------------------------get_table_from_crc32c_class-----------------------
5765 Node * LibraryCallKit::get_table_from_crc32c_class(ciInstanceKlass *crc32c_class) {
5766   Node* table = load_field_from_object(NULL, "byteTable", "[I", /*is_exact*/ false, /*is_static*/ true, crc32c_class);
5767   assert (table != NULL, "wrong version of java.util.zip.CRC32C");
5768 
5769   return table;
5770 }
5771 
5772 //------------------------------inline_updateBytesCRC32C-----------------------
5773 //
5774 // Calculate CRC32C for byte[] array.
5775 // int java.util.zip.CRC32C.updateBytes(int crc, byte[] buf, int off, int end)
5776 //
5777 bool LibraryCallKit::inline_updateBytesCRC32C() {
5778   assert(UseCRC32CIntrinsics, "need CRC32C instruction support");
5779   assert(callee()->signature()->size() == 4, "updateBytes has 4 parameters");
5780   assert(callee()->holder()->is_loaded(), "CRC32C class must be loaded");
5781   // no receiver since it is a static method
5782   Node* crc     = argument(0); // type: int
5783   Node* src     = argument(1); // type: oop
5784   Node* offset  = argument(2); // type: int
5785   Node* end     = argument(3); // type: int
5786 
5787   Node* length = _gvn.transform(new SubINode(end, offset));
5788 
5789   const Type* src_type = src->Value(&_gvn);
5790   const TypeAryPtr* top_src = src_type->isa_aryptr();
5791   if (top_src  == NULL || top_src->klass()  == NULL) {
5792     // failed array check
5793     return false;
5794   }
5795 
5796   // Figure out the size and type of the elements we will be copying.
5797   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5798   if (src_elem != T_BYTE) {
5799     return false;
5800   }
5801 
5802   // 'src_start' points to src array + scaled offset
5803   Node* src_start = array_element_address(src, offset, src_elem);
5804 
5805   // static final int[] byteTable in class CRC32C
5806   Node* table = get_table_from_crc32c_class(callee()->holder());
5807   Node* table_start = array_element_address(table, intcon(0), T_INT);
5808 
5809   // We assume that range check is done by caller.
5810   // TODO: generate range check (offset+length < src.length) in debug VM.
5811 
5812   // Call the stub.
5813   address stubAddr = StubRoutines::updateBytesCRC32C();
5814   const char *stubName = "updateBytesCRC32C";
5815 
5816   Node* call = make_runtime_call(RC_LEAF, OptoRuntime::updateBytesCRC32C_Type(),
5817                                  stubAddr, stubName, TypePtr::BOTTOM,
5818                                  crc, src_start, length, table_start);
5819   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5820   set_result(result);
5821   return true;
5822 }
5823 
5824 //------------------------------inline_updateDirectByteBufferCRC32C-----------------------
5825 //
5826 // Calculate CRC32C for DirectByteBuffer.
5827 // int java.util.zip.CRC32C.updateDirectByteBuffer(int crc, long buf, int off, int end)
5828 //
5829 bool LibraryCallKit::inline_updateDirectByteBufferCRC32C() {
5830   assert(UseCRC32CIntrinsics, "need CRC32C instruction support");
5831   assert(callee()->signature()->size() == 5, "updateDirectByteBuffer has 4 parameters and one is long");
5832   assert(callee()->holder()->is_loaded(), "CRC32C class must be loaded");
5833   // no receiver since it is a static method
5834   Node* crc     = argument(0); // type: int
5835   Node* src     = argument(1); // type: long
5836   Node* offset  = argument(3); // type: int
5837   Node* end     = argument(4); // type: int
5838 
5839   Node* length = _gvn.transform(new SubINode(end, offset));
5840 
5841   src = ConvL2X(src);  // adjust Java long to machine word
5842   Node* base = _gvn.transform(new CastX2PNode(src));
5843   offset = ConvI2X(offset);
5844 
5845   // 'src_start' points to src array + scaled offset
5846   Node* src_start = basic_plus_adr(top(), base, offset);
5847 
5848   // static final int[] byteTable in class CRC32C
5849   Node* table = get_table_from_crc32c_class(callee()->holder());
5850   Node* table_start = array_element_address(table, intcon(0), T_INT);
5851 
5852   // Call the stub.
5853   address stubAddr = StubRoutines::updateBytesCRC32C();
5854   const char *stubName = "updateBytesCRC32C";
5855 
5856   Node* call = make_runtime_call(RC_LEAF, OptoRuntime::updateBytesCRC32C_Type(),
5857                                  stubAddr, stubName, TypePtr::BOTTOM,
5858                                  crc, src_start, length, table_start);
5859   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5860   set_result(result);
5861   return true;
5862 }
5863 
5864 //------------------------------inline_updateBytesAdler32----------------------
5865 //
5866 // Calculate Adler32 checksum for byte[] array.
5867 // int java.util.zip.Adler32.updateBytes(int crc, byte[] buf, int off, int len)
5868 //
5869 bool LibraryCallKit::inline_updateBytesAdler32() {
5870   assert(UseAdler32Intrinsics, "Adler32 Instrinsic support need"); // check if we actually need to check this flag or check a different one
5871   assert(callee()->signature()->size() == 4, "updateBytes has 4 parameters");
5872   assert(callee()->holder()->is_loaded(), "Adler32 class must be loaded");
5873   // no receiver since it is static method
5874   Node* crc     = argument(0); // type: int
5875   Node* src     = argument(1); // type: oop
5876   Node* offset  = argument(2); // type: int
5877   Node* length  = argument(3); // type: int
5878 
5879   const Type* src_type = src->Value(&_gvn);
5880   const TypeAryPtr* top_src = src_type->isa_aryptr();
5881   if (top_src  == NULL || top_src->klass()  == NULL) {
5882     // failed array check
5883     return false;
5884   }
5885 
5886   // Figure out the size and type of the elements we will be copying.
5887   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
5888   if (src_elem != T_BYTE) {
5889     return false;
5890   }
5891 
5892   // 'src_start' points to src array + scaled offset
5893   Node* src_start = array_element_address(src, offset, src_elem);
5894 
5895   // We assume that range check is done by caller.
5896   // TODO: generate range check (offset+length < src.length) in debug VM.
5897 
5898   // Call the stub.
5899   address stubAddr = StubRoutines::updateBytesAdler32();
5900   const char *stubName = "updateBytesAdler32";
5901 
5902   Node* call = make_runtime_call(RC_LEAF, OptoRuntime::updateBytesAdler32_Type(),
5903                                  stubAddr, stubName, TypePtr::BOTTOM,
5904                                  crc, src_start, length);
5905   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5906   set_result(result);
5907   return true;
5908 }
5909 
5910 //------------------------------inline_updateByteBufferAdler32---------------
5911 //
5912 // Calculate Adler32 checksum for DirectByteBuffer.
5913 // int java.util.zip.Adler32.updateByteBuffer(int crc, long buf, int off, int len)
5914 //
5915 bool LibraryCallKit::inline_updateByteBufferAdler32() {
5916   assert(UseAdler32Intrinsics, "Adler32 Instrinsic support need"); // check if we actually need to check this flag or check a different one
5917   assert(callee()->signature()->size() == 5, "updateByteBuffer has 4 parameters and one is long");
5918   assert(callee()->holder()->is_loaded(), "Adler32 class must be loaded");
5919   // no receiver since it is static method
5920   Node* crc     = argument(0); // type: int
5921   Node* src     = argument(1); // type: long
5922   Node* offset  = argument(3); // type: int
5923   Node* length  = argument(4); // type: int
5924 
5925   src = ConvL2X(src);  // adjust Java long to machine word
5926   Node* base = _gvn.transform(new CastX2PNode(src));
5927   offset = ConvI2X(offset);
5928 
5929   // 'src_start' points to src array + scaled offset
5930   Node* src_start = basic_plus_adr(top(), base, offset);
5931 
5932   // Call the stub.
5933   address stubAddr = StubRoutines::updateBytesAdler32();
5934   const char *stubName = "updateBytesAdler32";
5935 
5936   Node* call = make_runtime_call(RC_LEAF, OptoRuntime::updateBytesAdler32_Type(),
5937                                  stubAddr, stubName, TypePtr::BOTTOM,
5938                                  crc, src_start, length);
5939 
5940   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
5941   set_result(result);
5942   return true;
5943 }
5944 
5945 //----------------------------inline_reference_get----------------------------
5946 // public T java.lang.ref.Reference.get();
5947 bool LibraryCallKit::inline_reference_get() {
5948   const int referent_offset = java_lang_ref_Reference::referent_offset;
5949   guarantee(referent_offset > 0, "should have already been set");
5950 
5951   // Get the argument:
5952   Node* reference_obj = null_check_receiver();
5953   if (stopped()) return true;
5954 
5955   Node* adr = basic_plus_adr(reference_obj, reference_obj, referent_offset);
5956 
5957   ciInstanceKlass* klass = env()->Object_klass();
5958   const TypeOopPtr* object_type = TypeOopPtr::make_from_klass(klass);
5959 
5960   Node* no_ctrl = NULL;
5961   Node* result = make_load(no_ctrl, adr, object_type, T_OBJECT, MemNode::unordered);
5962 
5963   // Use the pre-barrier to record the value in the referent field
5964   pre_barrier(false /* do_load */,
5965               control(),
5966               NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */,
5967               result /* pre_val */,
5968               T_OBJECT);
5969 
5970   // Add memory barrier to prevent commoning reads from this field
5971   // across safepoint since GC can change its value.
5972   insert_mem_bar(Op_MemBarCPUOrder);
5973 
5974   set_result(result);
5975   return true;
5976 }
5977 
5978 
5979 Node * LibraryCallKit::load_field_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString,
5980                                               bool is_exact=true, bool is_static=false,
5981                                               ciInstanceKlass * fromKls=NULL) {
5982   if (fromKls == NULL) {
5983     const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr();
5984     assert(tinst != NULL, "obj is null");
5985     assert(tinst->klass()->is_loaded(), "obj is not loaded");
5986     assert(!is_exact || tinst->klass_is_exact(), "klass not exact");
5987     fromKls = tinst->klass()->as_instance_klass();
5988   } else {
5989     assert(is_static, "only for static field access");
5990   }
5991   ciField* field = fromKls->get_field_by_name(ciSymbol::make(fieldName),
5992                                               ciSymbol::make(fieldTypeString),
5993                                               is_static);
5994 
5995   assert (field != NULL, "undefined field");
5996   if (field == NULL) return (Node *) NULL;
5997 
5998   if (is_static) {
5999     const TypeInstPtr* tip = TypeInstPtr::make(fromKls->java_mirror());
6000     fromObj = makecon(tip);
6001   }
6002 
6003   // Next code  copied from Parse::do_get_xxx():
6004 
6005   // Compute address and memory type.
6006   int offset  = field->offset_in_bytes();
6007   bool is_vol = field->is_volatile();
6008   ciType* field_klass = field->type();
6009   assert(field_klass->is_loaded(), "should be loaded");
6010   const TypePtr* adr_type = C->alias_type(field)->adr_type();
6011   Node *adr = basic_plus_adr(fromObj, fromObj, offset);
6012   BasicType bt = field->layout_type();
6013 
6014   // Build the resultant type of the load
6015   const Type *type;
6016   if (bt == T_OBJECT) {
6017     type = TypeOopPtr::make_from_klass(field_klass->as_klass());
6018   } else {
6019     type = Type::get_const_basic_type(bt);
6020   }
6021 
6022   if (support_IRIW_for_not_multiple_copy_atomic_cpu && is_vol) {
6023     insert_mem_bar(Op_MemBarVolatile);   // StoreLoad barrier
6024   }
6025   // Build the load.
6026   MemNode::MemOrd mo = is_vol ? MemNode::acquire : MemNode::unordered;
6027   Node* loadedField = make_load(NULL, adr, type, bt, adr_type, mo, LoadNode::DependsOnlyOnTest, is_vol);
6028   // If reference is volatile, prevent following memory ops from
6029   // floating up past the volatile read.  Also prevents commoning
6030   // another volatile read.
6031   if (is_vol) {
6032     // Memory barrier includes bogus read of value to force load BEFORE membar
6033     insert_mem_bar(Op_MemBarAcquire, loadedField);
6034   }
6035   return loadedField;
6036 }
6037 
6038 Node * LibraryCallKit::field_address_from_object(Node * fromObj, const char * fieldName, const char * fieldTypeString,
6039                                                  bool is_exact = true, bool is_static = false,
6040                                                  ciInstanceKlass * fromKls = NULL) {
6041   if (fromKls == NULL) {
6042     const TypeInstPtr* tinst = _gvn.type(fromObj)->isa_instptr();
6043     assert(tinst != NULL, "obj is null");
6044     assert(tinst->klass()->is_loaded(), "obj is not loaded");
6045     assert(!is_exact || tinst->klass_is_exact(), "klass not exact");
6046     fromKls = tinst->klass()->as_instance_klass();
6047   }
6048   else {
6049     assert(is_static, "only for static field access");
6050   }
6051   ciField* field = fromKls->get_field_by_name(ciSymbol::make(fieldName),
6052     ciSymbol::make(fieldTypeString),
6053     is_static);
6054 
6055   assert(field != NULL, "undefined field");
6056   assert(!field->is_volatile(), "not defined for volatile fields");
6057 
6058   if (is_static) {
6059     const TypeInstPtr* tip = TypeInstPtr::make(fromKls->java_mirror());
6060     fromObj = makecon(tip);
6061   }
6062 
6063   // Next code  copied from Parse::do_get_xxx():
6064 
6065   // Compute address and memory type.
6066   int offset = field->offset_in_bytes();
6067   Node *adr = basic_plus_adr(fromObj, fromObj, offset);
6068 
6069   return adr;
6070 }
6071 
6072 //------------------------------inline_aescrypt_Block-----------------------
6073 bool LibraryCallKit::inline_aescrypt_Block(vmIntrinsics::ID id) {
6074   address stubAddr = NULL;
6075   const char *stubName;
6076   assert(UseAES, "need AES instruction support");
6077 
6078   switch(id) {
6079   case vmIntrinsics::_aescrypt_encryptBlock:
6080     stubAddr = StubRoutines::aescrypt_encryptBlock();
6081     stubName = "aescrypt_encryptBlock";
6082     break;
6083   case vmIntrinsics::_aescrypt_decryptBlock:
6084     stubAddr = StubRoutines::aescrypt_decryptBlock();
6085     stubName = "aescrypt_decryptBlock";
6086     break;
6087   }
6088   if (stubAddr == NULL) return false;
6089 
6090   Node* aescrypt_object = argument(0);
6091   Node* src             = argument(1);
6092   Node* src_offset      = argument(2);
6093   Node* dest            = argument(3);
6094   Node* dest_offset     = argument(4);
6095 
6096   // (1) src and dest are arrays.
6097   const Type* src_type = src->Value(&_gvn);
6098   const Type* dest_type = dest->Value(&_gvn);
6099   const TypeAryPtr* top_src = src_type->isa_aryptr();
6100   const TypeAryPtr* top_dest = dest_type->isa_aryptr();
6101   assert (top_src  != NULL && top_src->klass()  != NULL &&  top_dest != NULL && top_dest->klass() != NULL, "args are strange");
6102 
6103   // for the quick and dirty code we will skip all the checks.
6104   // we are just trying to get the call to be generated.
6105   Node* src_start  = src;
6106   Node* dest_start = dest;
6107   if (src_offset != NULL || dest_offset != NULL) {
6108     assert(src_offset != NULL && dest_offset != NULL, "");
6109     src_start  = array_element_address(src,  src_offset,  T_BYTE);
6110     dest_start = array_element_address(dest, dest_offset, T_BYTE);
6111   }
6112 
6113   // now need to get the start of its expanded key array
6114   // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java
6115   Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object);
6116   if (k_start == NULL) return false;
6117 
6118   if (Matcher::pass_original_key_for_aes()) {
6119     // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to
6120     // compatibility issues between Java key expansion and SPARC crypto instructions
6121     Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object);
6122     if (original_k_start == NULL) return false;
6123 
6124     // Call the stub.
6125     make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(),
6126                       stubAddr, stubName, TypePtr::BOTTOM,
6127                       src_start, dest_start, k_start, original_k_start);
6128   } else {
6129     // Call the stub.
6130     make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::aescrypt_block_Type(),
6131                       stubAddr, stubName, TypePtr::BOTTOM,
6132                       src_start, dest_start, k_start);
6133   }
6134 
6135   return true;
6136 }
6137 
6138 //------------------------------inline_cipherBlockChaining_AESCrypt-----------------------
6139 bool LibraryCallKit::inline_cipherBlockChaining_AESCrypt(vmIntrinsics::ID id) {
6140   address stubAddr = NULL;
6141   const char *stubName = NULL;
6142 
6143   assert(UseAES, "need AES instruction support");
6144 
6145   switch(id) {
6146   case vmIntrinsics::_cipherBlockChaining_encryptAESCrypt:
6147     stubAddr = StubRoutines::cipherBlockChaining_encryptAESCrypt();
6148     stubName = "cipherBlockChaining_encryptAESCrypt";
6149     break;
6150   case vmIntrinsics::_cipherBlockChaining_decryptAESCrypt:
6151     stubAddr = StubRoutines::cipherBlockChaining_decryptAESCrypt();
6152     stubName = "cipherBlockChaining_decryptAESCrypt";
6153     break;
6154   }
6155   if (stubAddr == NULL) return false;
6156 
6157   Node* cipherBlockChaining_object = argument(0);
6158   Node* src                        = argument(1);
6159   Node* src_offset                 = argument(2);
6160   Node* len                        = argument(3);
6161   Node* dest                       = argument(4);
6162   Node* dest_offset                = argument(5);
6163 
6164   // (1) src and dest are arrays.
6165   const Type* src_type = src->Value(&_gvn);
6166   const Type* dest_type = dest->Value(&_gvn);
6167   const TypeAryPtr* top_src = src_type->isa_aryptr();
6168   const TypeAryPtr* top_dest = dest_type->isa_aryptr();
6169   assert (top_src  != NULL && top_src->klass()  != NULL
6170           &&  top_dest != NULL && top_dest->klass() != NULL, "args are strange");
6171 
6172   // checks are the responsibility of the caller
6173   Node* src_start  = src;
6174   Node* dest_start = dest;
6175   if (src_offset != NULL || dest_offset != NULL) {
6176     assert(src_offset != NULL && dest_offset != NULL, "");
6177     src_start  = array_element_address(src,  src_offset,  T_BYTE);
6178     dest_start = array_element_address(dest, dest_offset, T_BYTE);
6179   }
6180 
6181   // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object
6182   // (because of the predicated logic executed earlier).
6183   // so we cast it here safely.
6184   // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java
6185 
6186   Node* embeddedCipherObj = load_field_from_object(cipherBlockChaining_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false);
6187   if (embeddedCipherObj == NULL) return false;
6188 
6189   // cast it to what we know it will be at runtime
6190   const TypeInstPtr* tinst = _gvn.type(cipherBlockChaining_object)->isa_instptr();
6191   assert(tinst != NULL, "CBC obj is null");
6192   assert(tinst->klass()->is_loaded(), "CBC obj is not loaded");
6193   ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt"));
6194   assert(klass_AESCrypt->is_loaded(), "predicate checks that this class is loaded");
6195 
6196   ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass();
6197   const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt);
6198   const TypeOopPtr* xtype = aklass->as_instance_type();
6199   Node* aescrypt_object = new CheckCastPPNode(control(), embeddedCipherObj, xtype);
6200   aescrypt_object = _gvn.transform(aescrypt_object);
6201 
6202   // we need to get the start of the aescrypt_object's expanded key array
6203   Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object);
6204   if (k_start == NULL) return false;
6205 
6206   // similarly, get the start address of the r vector
6207   Node* objRvec = load_field_from_object(cipherBlockChaining_object, "r", "[B", /*is_exact*/ false);
6208   if (objRvec == NULL) return false;
6209   Node* r_start = array_element_address(objRvec, intcon(0), T_BYTE);
6210 
6211   Node* cbcCrypt;
6212   if (Matcher::pass_original_key_for_aes()) {
6213     // on SPARC we need to pass the original key since key expansion needs to happen in intrinsics due to
6214     // compatibility issues between Java key expansion and SPARC crypto instructions
6215     Node* original_k_start = get_original_key_start_from_aescrypt_object(aescrypt_object);
6216     if (original_k_start == NULL) return false;
6217 
6218     // Call the stub, passing src_start, dest_start, k_start, r_start, src_len and original_k_start
6219     cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP,
6220                                  OptoRuntime::cipherBlockChaining_aescrypt_Type(),
6221                                  stubAddr, stubName, TypePtr::BOTTOM,
6222                                  src_start, dest_start, k_start, r_start, len, original_k_start);
6223   } else {
6224     // Call the stub, passing src_start, dest_start, k_start, r_start and src_len
6225     cbcCrypt = make_runtime_call(RC_LEAF|RC_NO_FP,
6226                                  OptoRuntime::cipherBlockChaining_aescrypt_Type(),
6227                                  stubAddr, stubName, TypePtr::BOTTOM,
6228                                  src_start, dest_start, k_start, r_start, len);
6229   }
6230 
6231   // return cipher length (int)
6232   Node* retvalue = _gvn.transform(new ProjNode(cbcCrypt, TypeFunc::Parms));
6233   set_result(retvalue);
6234   return true;
6235 }
6236 
6237 //------------------------------inline_counterMode_AESCrypt-----------------------
6238 bool LibraryCallKit::inline_counterMode_AESCrypt(vmIntrinsics::ID id) {
6239   assert(UseAES, "need AES instruction support");
6240   if (!UseAESCTRIntrinsics) return false;
6241 
6242   address stubAddr = NULL;
6243   const char *stubName = NULL;
6244   if (id == vmIntrinsics::_counterMode_AESCrypt) {
6245     stubAddr = StubRoutines::counterMode_AESCrypt();
6246     stubName = "counterMode_AESCrypt";
6247   }
6248   if (stubAddr == NULL) return false;
6249 
6250   Node* counterMode_object = argument(0);
6251   Node* src = argument(1);
6252   Node* src_offset = argument(2);
6253   Node* len = argument(3);
6254   Node* dest = argument(4);
6255   Node* dest_offset = argument(5);
6256 
6257   // (1) src and dest are arrays.
6258   const Type* src_type = src->Value(&_gvn);
6259   const Type* dest_type = dest->Value(&_gvn);
6260   const TypeAryPtr* top_src = src_type->isa_aryptr();
6261   const TypeAryPtr* top_dest = dest_type->isa_aryptr();
6262   assert(top_src != NULL && top_src->klass() != NULL &&
6263          top_dest != NULL && top_dest->klass() != NULL, "args are strange");
6264 
6265   // checks are the responsibility of the caller
6266   Node* src_start = src;
6267   Node* dest_start = dest;
6268   if (src_offset != NULL || dest_offset != NULL) {
6269     assert(src_offset != NULL && dest_offset != NULL, "");
6270     src_start = array_element_address(src, src_offset, T_BYTE);
6271     dest_start = array_element_address(dest, dest_offset, T_BYTE);
6272   }
6273 
6274   // if we are in this set of code, we "know" the embeddedCipher is an AESCrypt object
6275   // (because of the predicated logic executed earlier).
6276   // so we cast it here safely.
6277   // this requires a newer class file that has this array as littleEndian ints, otherwise we revert to java
6278   Node* embeddedCipherObj = load_field_from_object(counterMode_object, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false);
6279   if (embeddedCipherObj == NULL) return false;
6280   // cast it to what we know it will be at runtime
6281   const TypeInstPtr* tinst = _gvn.type(counterMode_object)->isa_instptr();
6282   assert(tinst != NULL, "CTR obj is null");
6283   assert(tinst->klass()->is_loaded(), "CTR obj is not loaded");
6284   ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt"));
6285   assert(klass_AESCrypt->is_loaded(), "predicate checks that this class is loaded");
6286   ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass();
6287   const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_AESCrypt);
6288   const TypeOopPtr* xtype = aklass->as_instance_type();
6289   Node* aescrypt_object = new CheckCastPPNode(control(), embeddedCipherObj, xtype);
6290   aescrypt_object = _gvn.transform(aescrypt_object);
6291   // we need to get the start of the aescrypt_object's expanded key array
6292   Node* k_start = get_key_start_from_aescrypt_object(aescrypt_object);
6293   if (k_start == NULL) return false;
6294   // similarly, get the start address of the r vector
6295   Node* obj_counter = load_field_from_object(counterMode_object, "counter", "[B", /*is_exact*/ false);
6296   if (obj_counter == NULL) return false;
6297   Node* cnt_start = array_element_address(obj_counter, intcon(0), T_BYTE);
6298 
6299   Node* saved_encCounter = load_field_from_object(counterMode_object, "encryptedCounter", "[B", /*is_exact*/ false);
6300   if (saved_encCounter == NULL) return false;
6301   Node* saved_encCounter_start = array_element_address(saved_encCounter, intcon(0), T_BYTE);
6302   Node* used = field_address_from_object(counterMode_object, "used", "I", /*is_exact*/ false);
6303 
6304   Node* ctrCrypt;
6305   if (Matcher::pass_original_key_for_aes()) {
6306     // no SPARC version for AES/CTR intrinsics now.
6307     return false;
6308   }
6309   // Call the stub, passing src_start, dest_start, k_start, r_start and src_len
6310   ctrCrypt = make_runtime_call(RC_LEAF|RC_NO_FP,
6311                                OptoRuntime::counterMode_aescrypt_Type(),
6312                                stubAddr, stubName, TypePtr::BOTTOM,
6313                                src_start, dest_start, k_start, cnt_start, len, saved_encCounter_start, used);
6314 
6315   // return cipher length (int)
6316   Node* retvalue = _gvn.transform(new ProjNode(ctrCrypt, TypeFunc::Parms));
6317   set_result(retvalue);
6318   return true;
6319 }
6320 
6321 //------------------------------get_key_start_from_aescrypt_object-----------------------
6322 Node * LibraryCallKit::get_key_start_from_aescrypt_object(Node *aescrypt_object) {
6323 #ifdef PPC64
6324   // MixColumns for decryption can be reduced by preprocessing MixColumns with round keys.
6325   // Intel's extention is based on this optimization and AESCrypt generates round keys by preprocessing MixColumns.
6326   // However, ppc64 vncipher processes MixColumns and requires the same round keys with encryption.
6327   // The ppc64 stubs of encryption and decryption use the same round keys (sessionK[0]).
6328   Node* objSessionK = load_field_from_object(aescrypt_object, "sessionK", "[[I", /*is_exact*/ false);
6329   assert (objSessionK != NULL, "wrong version of com.sun.crypto.provider.AESCrypt");
6330   if (objSessionK == NULL) {
6331     return (Node *) NULL;
6332   }
6333   Node* objAESCryptKey = load_array_element(control(), objSessionK, intcon(0), TypeAryPtr::OOPS);
6334 #else
6335   Node* objAESCryptKey = load_field_from_object(aescrypt_object, "K", "[I", /*is_exact*/ false);
6336 #endif // PPC64
6337   assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt");
6338   if (objAESCryptKey == NULL) return (Node *) NULL;
6339 
6340   // now have the array, need to get the start address of the K array
6341   Node* k_start = array_element_address(objAESCryptKey, intcon(0), T_INT);
6342   return k_start;
6343 }
6344 
6345 //------------------------------get_original_key_start_from_aescrypt_object-----------------------
6346 Node * LibraryCallKit::get_original_key_start_from_aescrypt_object(Node *aescrypt_object) {
6347   Node* objAESCryptKey = load_field_from_object(aescrypt_object, "lastKey", "[B", /*is_exact*/ false);
6348   assert (objAESCryptKey != NULL, "wrong version of com.sun.crypto.provider.AESCrypt");
6349   if (objAESCryptKey == NULL) return (Node *) NULL;
6350 
6351   // now have the array, need to get the start address of the lastKey array
6352   Node* original_k_start = array_element_address(objAESCryptKey, intcon(0), T_BYTE);
6353   return original_k_start;
6354 }
6355 
6356 //----------------------------inline_cipherBlockChaining_AESCrypt_predicate----------------------------
6357 // Return node representing slow path of predicate check.
6358 // the pseudo code we want to emulate with this predicate is:
6359 // for encryption:
6360 //    if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath
6361 // for decryption:
6362 //    if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath
6363 //    note cipher==plain is more conservative than the original java code but that's OK
6364 //
6365 Node* LibraryCallKit::inline_cipherBlockChaining_AESCrypt_predicate(bool decrypting) {
6366   // The receiver was checked for NULL already.
6367   Node* objCBC = argument(0);
6368 
6369   // Load embeddedCipher field of CipherBlockChaining object.
6370   Node* embeddedCipherObj = load_field_from_object(objCBC, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false);
6371 
6372   // get AESCrypt klass for instanceOf check
6373   // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point
6374   // will have same classloader as CipherBlockChaining object
6375   const TypeInstPtr* tinst = _gvn.type(objCBC)->isa_instptr();
6376   assert(tinst != NULL, "CBCobj is null");
6377   assert(tinst->klass()->is_loaded(), "CBCobj is not loaded");
6378 
6379   // we want to do an instanceof comparison against the AESCrypt class
6380   ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt"));
6381   if (!klass_AESCrypt->is_loaded()) {
6382     // if AESCrypt is not even loaded, we never take the intrinsic fast path
6383     Node* ctrl = control();
6384     set_control(top()); // no regular fast path
6385     return ctrl;
6386   }
6387   ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass();
6388 
6389   Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt)));
6390   Node* cmp_instof  = _gvn.transform(new CmpINode(instof, intcon(1)));
6391   Node* bool_instof  = _gvn.transform(new BoolNode(cmp_instof, BoolTest::ne));
6392 
6393   Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN);
6394 
6395   // for encryption, we are done
6396   if (!decrypting)
6397     return instof_false;  // even if it is NULL
6398 
6399   // for decryption, we need to add a further check to avoid
6400   // taking the intrinsic path when cipher and plain are the same
6401   // see the original java code for why.
6402   RegionNode* region = new RegionNode(3);
6403   region->init_req(1, instof_false);
6404   Node* src = argument(1);
6405   Node* dest = argument(4);
6406   Node* cmp_src_dest = _gvn.transform(new CmpPNode(src, dest));
6407   Node* bool_src_dest = _gvn.transform(new BoolNode(cmp_src_dest, BoolTest::eq));
6408   Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN);
6409   region->init_req(2, src_dest_conjoint);
6410 
6411   record_for_igvn(region);
6412   return _gvn.transform(region);
6413 }
6414 
6415 //----------------------------inline_counterMode_AESCrypt_predicate----------------------------
6416 // Return node representing slow path of predicate check.
6417 // the pseudo code we want to emulate with this predicate is:
6418 // for encryption:
6419 //    if (embeddedCipherObj instanceof AESCrypt) do_intrinsic, else do_javapath
6420 // for decryption:
6421 //    if ((embeddedCipherObj instanceof AESCrypt) && (cipher!=plain)) do_intrinsic, else do_javapath
6422 //    note cipher==plain is more conservative than the original java code but that's OK
6423 //
6424 
6425 Node* LibraryCallKit::inline_counterMode_AESCrypt_predicate() {
6426   // The receiver was checked for NULL already.
6427   Node* objCTR = argument(0);
6428 
6429   // Load embeddedCipher field of CipherBlockChaining object.
6430   Node* embeddedCipherObj = load_field_from_object(objCTR, "embeddedCipher", "Lcom/sun/crypto/provider/SymmetricCipher;", /*is_exact*/ false);
6431 
6432   // get AESCrypt klass for instanceOf check
6433   // AESCrypt might not be loaded yet if some other SymmetricCipher got us to this compile point
6434   // will have same classloader as CipherBlockChaining object
6435   const TypeInstPtr* tinst = _gvn.type(objCTR)->isa_instptr();
6436   assert(tinst != NULL, "CTRobj is null");
6437   assert(tinst->klass()->is_loaded(), "CTRobj is not loaded");
6438 
6439   // we want to do an instanceof comparison against the AESCrypt class
6440   ciKlass* klass_AESCrypt = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make("com/sun/crypto/provider/AESCrypt"));
6441   if (!klass_AESCrypt->is_loaded()) {
6442     // if AESCrypt is not even loaded, we never take the intrinsic fast path
6443     Node* ctrl = control();
6444     set_control(top()); // no regular fast path
6445     return ctrl;
6446   }
6447 
6448   ciInstanceKlass* instklass_AESCrypt = klass_AESCrypt->as_instance_klass();
6449   Node* instof = gen_instanceof(embeddedCipherObj, makecon(TypeKlassPtr::make(instklass_AESCrypt)));
6450   Node* cmp_instof = _gvn.transform(new CmpINode(instof, intcon(1)));
6451   Node* bool_instof = _gvn.transform(new BoolNode(cmp_instof, BoolTest::ne));
6452   Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN);
6453 
6454   return instof_false; // even if it is NULL
6455 }
6456 
6457 //------------------------------inline_ghash_processBlocks
6458 bool LibraryCallKit::inline_ghash_processBlocks() {
6459   address stubAddr;
6460   const char *stubName;
6461   assert(UseGHASHIntrinsics, "need GHASH intrinsics support");
6462 
6463   stubAddr = StubRoutines::ghash_processBlocks();
6464   stubName = "ghash_processBlocks";
6465 
6466   Node* data           = argument(0);
6467   Node* offset         = argument(1);
6468   Node* len            = argument(2);
6469   Node* state          = argument(3);
6470   Node* subkeyH        = argument(4);
6471 
6472   Node* state_start  = array_element_address(state, intcon(0), T_LONG);
6473   assert(state_start, "state is NULL");
6474   Node* subkeyH_start  = array_element_address(subkeyH, intcon(0), T_LONG);
6475   assert(subkeyH_start, "subkeyH is NULL");
6476   Node* data_start  = array_element_address(data, offset, T_BYTE);
6477   assert(data_start, "data is NULL");
6478 
6479   Node* ghash = make_runtime_call(RC_LEAF|RC_NO_FP,
6480                                   OptoRuntime::ghash_processBlocks_Type(),
6481                                   stubAddr, stubName, TypePtr::BOTTOM,
6482                                   state_start, subkeyH_start, data_start, len);
6483   return true;
6484 }
6485 
6486 //------------------------------inline_sha_implCompress-----------------------
6487 //
6488 // Calculate SHA (i.e., SHA-1) for single-block byte[] array.
6489 // void com.sun.security.provider.SHA.implCompress(byte[] buf, int ofs)
6490 //
6491 // Calculate SHA2 (i.e., SHA-244 or SHA-256) for single-block byte[] array.
6492 // void com.sun.security.provider.SHA2.implCompress(byte[] buf, int ofs)
6493 //
6494 // Calculate SHA5 (i.e., SHA-384 or SHA-512) for single-block byte[] array.
6495 // void com.sun.security.provider.SHA5.implCompress(byte[] buf, int ofs)
6496 //
6497 bool LibraryCallKit::inline_sha_implCompress(vmIntrinsics::ID id) {
6498   assert(callee()->signature()->size() == 2, "sha_implCompress has 2 parameters");
6499 
6500   Node* sha_obj = argument(0);
6501   Node* src     = argument(1); // type oop
6502   Node* ofs     = argument(2); // type int
6503 
6504   const Type* src_type = src->Value(&_gvn);
6505   const TypeAryPtr* top_src = src_type->isa_aryptr();
6506   if (top_src  == NULL || top_src->klass()  == NULL) {
6507     // failed array check
6508     return false;
6509   }
6510   // Figure out the size and type of the elements we will be copying.
6511   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6512   if (src_elem != T_BYTE) {
6513     return false;
6514   }
6515   // 'src_start' points to src array + offset
6516   Node* src_start = array_element_address(src, ofs, src_elem);
6517   Node* state = NULL;
6518   address stubAddr;
6519   const char *stubName;
6520 
6521   switch(id) {
6522   case vmIntrinsics::_sha_implCompress:
6523     assert(UseSHA1Intrinsics, "need SHA1 instruction support");
6524     state = get_state_from_sha_object(sha_obj);
6525     stubAddr = StubRoutines::sha1_implCompress();
6526     stubName = "sha1_implCompress";
6527     break;
6528   case vmIntrinsics::_sha2_implCompress:
6529     assert(UseSHA256Intrinsics, "need SHA256 instruction support");
6530     state = get_state_from_sha_object(sha_obj);
6531     stubAddr = StubRoutines::sha256_implCompress();
6532     stubName = "sha256_implCompress";
6533     break;
6534   case vmIntrinsics::_sha5_implCompress:
6535     assert(UseSHA512Intrinsics, "need SHA512 instruction support");
6536     state = get_state_from_sha5_object(sha_obj);
6537     stubAddr = StubRoutines::sha512_implCompress();
6538     stubName = "sha512_implCompress";
6539     break;
6540   default:
6541     fatal_unexpected_iid(id);
6542     return false;
6543   }
6544   if (state == NULL) return false;
6545 
6546   // Call the stub.
6547   Node* call = make_runtime_call(RC_LEAF|RC_NO_FP, OptoRuntime::sha_implCompress_Type(),
6548                                  stubAddr, stubName, TypePtr::BOTTOM,
6549                                  src_start, state);
6550 
6551   return true;
6552 }
6553 
6554 //------------------------------inline_digestBase_implCompressMB-----------------------
6555 //
6556 // Calculate SHA/SHA2/SHA5 for multi-block byte[] array.
6557 // int com.sun.security.provider.DigestBase.implCompressMultiBlock(byte[] b, int ofs, int limit)
6558 //
6559 bool LibraryCallKit::inline_digestBase_implCompressMB(int predicate) {
6560   assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics,
6561          "need SHA1/SHA256/SHA512 instruction support");
6562   assert((uint)predicate < 3, "sanity");
6563   assert(callee()->signature()->size() == 3, "digestBase_implCompressMB has 3 parameters");
6564 
6565   Node* digestBase_obj = argument(0); // The receiver was checked for NULL already.
6566   Node* src            = argument(1); // byte[] array
6567   Node* ofs            = argument(2); // type int
6568   Node* limit          = argument(3); // type int
6569 
6570   const Type* src_type = src->Value(&_gvn);
6571   const TypeAryPtr* top_src = src_type->isa_aryptr();
6572   if (top_src  == NULL || top_src->klass()  == NULL) {
6573     // failed array check
6574     return false;
6575   }
6576   // Figure out the size and type of the elements we will be copying.
6577   BasicType src_elem = src_type->isa_aryptr()->klass()->as_array_klass()->element_type()->basic_type();
6578   if (src_elem != T_BYTE) {
6579     return false;
6580   }
6581   // 'src_start' points to src array + offset
6582   Node* src_start = array_element_address(src, ofs, src_elem);
6583 
6584   const char* klass_SHA_name = NULL;
6585   const char* stub_name = NULL;
6586   address     stub_addr = NULL;
6587   bool        long_state = false;
6588 
6589   switch (predicate) {
6590   case 0:
6591     if (UseSHA1Intrinsics) {
6592       klass_SHA_name = "sun/security/provider/SHA";
6593       stub_name = "sha1_implCompressMB";
6594       stub_addr = StubRoutines::sha1_implCompressMB();
6595     }
6596     break;
6597   case 1:
6598     if (UseSHA256Intrinsics) {
6599       klass_SHA_name = "sun/security/provider/SHA2";
6600       stub_name = "sha256_implCompressMB";
6601       stub_addr = StubRoutines::sha256_implCompressMB();
6602     }
6603     break;
6604   case 2:
6605     if (UseSHA512Intrinsics) {
6606       klass_SHA_name = "sun/security/provider/SHA5";
6607       stub_name = "sha512_implCompressMB";
6608       stub_addr = StubRoutines::sha512_implCompressMB();
6609       long_state = true;
6610     }
6611     break;
6612   default:
6613     fatal("unknown SHA intrinsic predicate: %d", predicate);
6614   }
6615   if (klass_SHA_name != NULL) {
6616     // get DigestBase klass to lookup for SHA klass
6617     const TypeInstPtr* tinst = _gvn.type(digestBase_obj)->isa_instptr();
6618     assert(tinst != NULL, "digestBase_obj is not instance???");
6619     assert(tinst->klass()->is_loaded(), "DigestBase is not loaded");
6620 
6621     ciKlass* klass_SHA = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make(klass_SHA_name));
6622     assert(klass_SHA->is_loaded(), "predicate checks that this class is loaded");
6623     ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass();
6624     return inline_sha_implCompressMB(digestBase_obj, instklass_SHA, long_state, stub_addr, stub_name, src_start, ofs, limit);
6625   }
6626   return false;
6627 }
6628 //------------------------------inline_sha_implCompressMB-----------------------
6629 bool LibraryCallKit::inline_sha_implCompressMB(Node* digestBase_obj, ciInstanceKlass* instklass_SHA,
6630                                                bool long_state, address stubAddr, const char *stubName,
6631                                                Node* src_start, Node* ofs, Node* limit) {
6632   const TypeKlassPtr* aklass = TypeKlassPtr::make(instklass_SHA);
6633   const TypeOopPtr* xtype = aklass->as_instance_type();
6634   Node* sha_obj = new CheckCastPPNode(control(), digestBase_obj, xtype);
6635   sha_obj = _gvn.transform(sha_obj);
6636 
6637   Node* state;
6638   if (long_state) {
6639     state = get_state_from_sha5_object(sha_obj);
6640   } else {
6641     state = get_state_from_sha_object(sha_obj);
6642   }
6643   if (state == NULL) return false;
6644 
6645   // Call the stub.
6646   Node* call = make_runtime_call(RC_LEAF|RC_NO_FP,
6647                                  OptoRuntime::digestBase_implCompressMB_Type(),
6648                                  stubAddr, stubName, TypePtr::BOTTOM,
6649                                  src_start, state, ofs, limit);
6650   // return ofs (int)
6651   Node* result = _gvn.transform(new ProjNode(call, TypeFunc::Parms));
6652   set_result(result);
6653 
6654   return true;
6655 }
6656 
6657 //------------------------------get_state_from_sha_object-----------------------
6658 Node * LibraryCallKit::get_state_from_sha_object(Node *sha_object) {
6659   Node* sha_state = load_field_from_object(sha_object, "state", "[I", /*is_exact*/ false);
6660   assert (sha_state != NULL, "wrong version of sun.security.provider.SHA/SHA2");
6661   if (sha_state == NULL) return (Node *) NULL;
6662 
6663   // now have the array, need to get the start address of the state array
6664   Node* state = array_element_address(sha_state, intcon(0), T_INT);
6665   return state;
6666 }
6667 
6668 //------------------------------get_state_from_sha5_object-----------------------
6669 Node * LibraryCallKit::get_state_from_sha5_object(Node *sha_object) {
6670   Node* sha_state = load_field_from_object(sha_object, "state", "[J", /*is_exact*/ false);
6671   assert (sha_state != NULL, "wrong version of sun.security.provider.SHA5");
6672   if (sha_state == NULL) return (Node *) NULL;
6673 
6674   // now have the array, need to get the start address of the state array
6675   Node* state = array_element_address(sha_state, intcon(0), T_LONG);
6676   return state;
6677 }
6678 
6679 //----------------------------inline_digestBase_implCompressMB_predicate----------------------------
6680 // Return node representing slow path of predicate check.
6681 // the pseudo code we want to emulate with this predicate is:
6682 //    if (digestBaseObj instanceof SHA/SHA2/SHA5) do_intrinsic, else do_javapath
6683 //
6684 Node* LibraryCallKit::inline_digestBase_implCompressMB_predicate(int predicate) {
6685   assert(UseSHA1Intrinsics || UseSHA256Intrinsics || UseSHA512Intrinsics,
6686          "need SHA1/SHA256/SHA512 instruction support");
6687   assert((uint)predicate < 3, "sanity");
6688 
6689   // The receiver was checked for NULL already.
6690   Node* digestBaseObj = argument(0);
6691 
6692   // get DigestBase klass for instanceOf check
6693   const TypeInstPtr* tinst = _gvn.type(digestBaseObj)->isa_instptr();
6694   assert(tinst != NULL, "digestBaseObj is null");
6695   assert(tinst->klass()->is_loaded(), "DigestBase is not loaded");
6696 
6697   const char* klass_SHA_name = NULL;
6698   switch (predicate) {
6699   case 0:
6700     if (UseSHA1Intrinsics) {
6701       // we want to do an instanceof comparison against the SHA class
6702       klass_SHA_name = "sun/security/provider/SHA";
6703     }
6704     break;
6705   case 1:
6706     if (UseSHA256Intrinsics) {
6707       // we want to do an instanceof comparison against the SHA2 class
6708       klass_SHA_name = "sun/security/provider/SHA2";
6709     }
6710     break;
6711   case 2:
6712     if (UseSHA512Intrinsics) {
6713       // we want to do an instanceof comparison against the SHA5 class
6714       klass_SHA_name = "sun/security/provider/SHA5";
6715     }
6716     break;
6717   default:
6718     fatal("unknown SHA intrinsic predicate: %d", predicate);
6719   }
6720 
6721   ciKlass* klass_SHA = NULL;
6722   if (klass_SHA_name != NULL) {
6723     klass_SHA = tinst->klass()->as_instance_klass()->find_klass(ciSymbol::make(klass_SHA_name));
6724   }
6725   if ((klass_SHA == NULL) || !klass_SHA->is_loaded()) {
6726     // if none of SHA/SHA2/SHA5 is loaded, we never take the intrinsic fast path
6727     Node* ctrl = control();
6728     set_control(top()); // no intrinsic path
6729     return ctrl;
6730   }
6731   ciInstanceKlass* instklass_SHA = klass_SHA->as_instance_klass();
6732 
6733   Node* instofSHA = gen_instanceof(digestBaseObj, makecon(TypeKlassPtr::make(instklass_SHA)));
6734   Node* cmp_instof = _gvn.transform(new CmpINode(instofSHA, intcon(1)));
6735   Node* bool_instof = _gvn.transform(new BoolNode(cmp_instof, BoolTest::ne));
6736   Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN);
6737 
6738   return instof_false;  // even if it is NULL
6739 }
6740 
6741 bool LibraryCallKit::inline_profileBoolean() {
6742   Node* counts = argument(1);
6743   const TypeAryPtr* ary = NULL;
6744   ciArray* aobj = NULL;
6745   if (counts->is_Con()
6746       && (ary = counts->bottom_type()->isa_aryptr()) != NULL
6747       && (aobj = ary->const_oop()->as_array()) != NULL
6748       && (aobj->length() == 2)) {
6749     // Profile is int[2] where [0] and [1] correspond to false and true value occurrences respectively.
6750     jint false_cnt = aobj->element_value(0).as_int();
6751     jint  true_cnt = aobj->element_value(1).as_int();
6752 
6753     if (C->log() != NULL) {
6754       C->log()->elem("observe source='profileBoolean' false='%d' true='%d'",
6755                      false_cnt, true_cnt);
6756     }
6757 
6758     if (false_cnt + true_cnt == 0) {
6759       // According to profile, never executed.
6760       uncommon_trap_exact(Deoptimization::Reason_intrinsic,
6761                           Deoptimization::Action_reinterpret);
6762       return true;
6763     }
6764 
6765     // result is a boolean (0 or 1) and its profile (false_cnt & true_cnt)
6766     // is a number of each value occurrences.
6767     Node* result = argument(0);
6768     if (false_cnt == 0 || true_cnt == 0) {
6769       // According to profile, one value has been never seen.
6770       int expected_val = (false_cnt == 0) ? 1 : 0;
6771 
6772       Node* cmp  = _gvn.transform(new CmpINode(result, intcon(expected_val)));
6773       Node* test = _gvn.transform(new BoolNode(cmp, BoolTest::eq));
6774 
6775       IfNode* check = create_and_map_if(control(), test, PROB_ALWAYS, COUNT_UNKNOWN);
6776       Node* fast_path = _gvn.transform(new IfTrueNode(check));
6777       Node* slow_path = _gvn.transform(new IfFalseNode(check));
6778 
6779       { // Slow path: uncommon trap for never seen value and then reexecute
6780         // MethodHandleImpl::profileBoolean() to bump the count, so JIT knows
6781         // the value has been seen at least once.
6782         PreserveJVMState pjvms(this);
6783         PreserveReexecuteState preexecs(this);
6784         jvms()->set_should_reexecute(true);
6785 
6786         set_control(slow_path);
6787         set_i_o(i_o());
6788 
6789         uncommon_trap_exact(Deoptimization::Reason_intrinsic,
6790                             Deoptimization::Action_reinterpret);
6791       }
6792       // The guard for never seen value enables sharpening of the result and
6793       // returning a constant. It allows to eliminate branches on the same value
6794       // later on.
6795       set_control(fast_path);
6796       result = intcon(expected_val);
6797     }
6798     // Stop profiling.
6799     // MethodHandleImpl::profileBoolean() has profiling logic in its bytecode.
6800     // By replacing method body with profile data (represented as ProfileBooleanNode
6801     // on IR level) we effectively disable profiling.
6802     // It enables full speed execution once optimized code is generated.
6803     Node* profile = _gvn.transform(new ProfileBooleanNode(result, false_cnt, true_cnt));
6804     C->record_for_igvn(profile);
6805     set_result(profile);
6806     return true;
6807   } else {
6808     // Continue profiling.
6809     // Profile data isn't available at the moment. So, execute method's bytecode version.
6810     // Usually, when GWT LambdaForms are profiled it means that a stand-alone nmethod
6811     // is compiled and counters aren't available since corresponding MethodHandle
6812     // isn't a compile-time constant.
6813     return false;
6814   }
6815 }
6816 
6817 bool LibraryCallKit::inline_isCompileConstant() {
6818   Node* n = argument(0);
6819   set_result(n->is_Con() ? intcon(1) : intcon(0));
6820   return true;
6821 }