1 /*
   2  * Copyright (c) 2018, 2019, Red Hat, Inc. All rights reserved.
   3  *
   4  * This code is free software; you can redistribute it and/or modify it
   5  * under the terms of the GNU General Public License version 2 only, as
   6  * published by the Free Software Foundation.
   7  *
   8  * This code is distributed in the hope that it will be useful, but WITHOUT
   9  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  10  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  11  * version 2 for more details (a copy is included in the LICENSE file that
  12  * accompanied this code).
  13  *
  14  * You should have received a copy of the GNU General Public License version
  15  * 2 along with this work; if not, write to the Free Software Foundation,
  16  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  17  *
  18  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  19  * or visit www.oracle.com if you need additional information or have any
  20  * questions.
  21  *
  22  */
  23 
  24 #include "precompiled.hpp"
  25 #include "gc/shared/barrierSet.hpp"
  26 #include "gc/shenandoah/shenandoahForwarding.hpp"
  27 #include "gc/shenandoah/shenandoahHeap.hpp"
  28 #include "gc/shenandoah/shenandoahHeuristics.hpp"
  29 #include "gc/shenandoah/shenandoahRuntime.hpp"
  30 #include "gc/shenandoah/shenandoahThreadLocalData.hpp"
  31 #include "gc/shenandoah/c2/shenandoahBarrierSetC2.hpp"
  32 #include "gc/shenandoah/c2/shenandoahSupport.hpp"
  33 #include "opto/arraycopynode.hpp"
  34 #include "opto/escape.hpp"
  35 #include "opto/graphKit.hpp"
  36 #include "opto/idealKit.hpp"
  37 #include "opto/macro.hpp"
  38 #include "opto/movenode.hpp"
  39 #include "opto/narrowptrnode.hpp"
  40 #include "opto/rootnode.hpp"
  41 
  42 ShenandoahBarrierSetC2* ShenandoahBarrierSetC2::bsc2() {
  43   return reinterpret_cast<ShenandoahBarrierSetC2*>(BarrierSet::barrier_set()->barrier_set_c2());
  44 }
  45 
  46 ShenandoahBarrierSetC2State::ShenandoahBarrierSetC2State(Arena* comp_arena)
  47   : _enqueue_barriers(new (comp_arena) GrowableArray<ShenandoahEnqueueBarrierNode*>(comp_arena, 8,  0, NULL)),
  48     _load_reference_barriers(new (comp_arena) GrowableArray<ShenandoahLoadReferenceBarrierNode*>(comp_arena, 8,  0, NULL)) {
  49 }
  50 
  51 int ShenandoahBarrierSetC2State::enqueue_barriers_count() const {
  52   return _enqueue_barriers->length();
  53 }
  54 
  55 ShenandoahEnqueueBarrierNode* ShenandoahBarrierSetC2State::enqueue_barrier(int idx) const {
  56   return _enqueue_barriers->at(idx);
  57 }
  58 
  59 void ShenandoahBarrierSetC2State::add_enqueue_barrier(ShenandoahEnqueueBarrierNode * n) {
  60   assert(!_enqueue_barriers->contains(n), "duplicate entry in barrier list");
  61   _enqueue_barriers->append(n);
  62 }
  63 
  64 void ShenandoahBarrierSetC2State::remove_enqueue_barrier(ShenandoahEnqueueBarrierNode * n) {
  65   if (_enqueue_barriers->contains(n)) {
  66     _enqueue_barriers->remove(n);
  67   }
  68 }
  69 
  70 int ShenandoahBarrierSetC2State::load_reference_barriers_count() const {
  71   return _load_reference_barriers->length();
  72 }
  73 
  74 ShenandoahLoadReferenceBarrierNode* ShenandoahBarrierSetC2State::load_reference_barrier(int idx) const {
  75   return _load_reference_barriers->at(idx);
  76 }
  77 
  78 void ShenandoahBarrierSetC2State::add_load_reference_barrier(ShenandoahLoadReferenceBarrierNode * n) {
  79   assert(!_load_reference_barriers->contains(n), "duplicate entry in barrier list");
  80   _load_reference_barriers->append(n);
  81 }
  82 
  83 void ShenandoahBarrierSetC2State::remove_load_reference_barrier(ShenandoahLoadReferenceBarrierNode * n) {
  84   if (_load_reference_barriers->contains(n)) {
  85     _load_reference_barriers->remove(n);
  86   }
  87 }
  88 
  89 Node* ShenandoahBarrierSetC2::shenandoah_storeval_barrier(GraphKit* kit, Node* obj) const {
  90   if (ShenandoahStoreValEnqueueBarrier) {
  91     obj = shenandoah_enqueue_barrier(kit, obj);
  92   }
  93   return obj;
  94 }
  95 
  96 #define __ kit->
  97 
  98 bool ShenandoahBarrierSetC2::satb_can_remove_pre_barrier(GraphKit* kit, PhaseTransform* phase, Node* adr,
  99                                                          BasicType bt, uint adr_idx) const {
 100   intptr_t offset = 0;
 101   Node* base = AddPNode::Ideal_base_and_offset(adr, phase, offset);
 102   AllocateNode* alloc = AllocateNode::Ideal_allocation(base, phase);
 103 
 104   if (offset == Type::OffsetBot) {
 105     return false; // cannot unalias unless there are precise offsets
 106   }
 107 
 108   if (alloc == NULL) {
 109     return false; // No allocation found
 110   }
 111 
 112   intptr_t size_in_bytes = type2aelembytes(bt);
 113 
 114   Node* mem = __ memory(adr_idx); // start searching here...
 115 
 116   for (int cnt = 0; cnt < 50; cnt++) {
 117 
 118     if (mem->is_Store()) {
 119 
 120       Node* st_adr = mem->in(MemNode::Address);
 121       intptr_t st_offset = 0;
 122       Node* st_base = AddPNode::Ideal_base_and_offset(st_adr, phase, st_offset);
 123 
 124       if (st_base == NULL) {
 125         break; // inscrutable pointer
 126       }
 127 
 128       // Break we have found a store with same base and offset as ours so break
 129       if (st_base == base && st_offset == offset) {
 130         break;
 131       }
 132 
 133       if (st_offset != offset && st_offset != Type::OffsetBot) {
 134         const int MAX_STORE = BytesPerLong;
 135         if (st_offset >= offset + size_in_bytes ||
 136             st_offset <= offset - MAX_STORE ||
 137             st_offset <= offset - mem->as_Store()->memory_size()) {
 138           // Success:  The offsets are provably independent.
 139           // (You may ask, why not just test st_offset != offset and be done?
 140           // The answer is that stores of different sizes can co-exist
 141           // in the same sequence of RawMem effects.  We sometimes initialize
 142           // a whole 'tile' of array elements with a single jint or jlong.)
 143           mem = mem->in(MemNode::Memory);
 144           continue; // advance through independent store memory
 145         }
 146       }
 147 
 148       if (st_base != base
 149           && MemNode::detect_ptr_independence(base, alloc, st_base,
 150                                               AllocateNode::Ideal_allocation(st_base, phase),
 151                                               phase)) {
 152         // Success:  The bases are provably independent.
 153         mem = mem->in(MemNode::Memory);
 154         continue; // advance through independent store memory
 155       }
 156     } else if (mem->is_Proj() && mem->in(0)->is_Initialize()) {
 157 
 158       InitializeNode* st_init = mem->in(0)->as_Initialize();
 159       AllocateNode* st_alloc = st_init->allocation();
 160 
 161       // Make sure that we are looking at the same allocation site.
 162       // The alloc variable is guaranteed to not be null here from earlier check.
 163       if (alloc == st_alloc) {
 164         // Check that the initialization is storing NULL so that no previous store
 165         // has been moved up and directly write a reference
 166         Node* captured_store = st_init->find_captured_store(offset,
 167                                                             type2aelembytes(T_OBJECT),
 168                                                             phase);
 169         if (captured_store == NULL || captured_store == st_init->zero_memory()) {
 170           return true;
 171         }
 172       }
 173     }
 174 
 175     // Unless there is an explicit 'continue', we must bail out here,
 176     // because 'mem' is an inscrutable memory state (e.g., a call).
 177     break;
 178   }
 179 
 180   return false;
 181 }
 182 
 183 #undef __
 184 #define __ ideal.
 185 
 186 void ShenandoahBarrierSetC2::satb_write_barrier_pre(GraphKit* kit,
 187                                                     bool do_load,
 188                                                     Node* obj,
 189                                                     Node* adr,
 190                                                     uint alias_idx,
 191                                                     Node* val,
 192                                                     const TypeOopPtr* val_type,
 193                                                     Node* pre_val,
 194                                                     BasicType bt) const {
 195   // Some sanity checks
 196   // Note: val is unused in this routine.
 197 
 198   if (do_load) {
 199     // We need to generate the load of the previous value
 200     assert(obj != NULL, "must have a base");
 201     assert(adr != NULL, "where are loading from?");
 202     assert(pre_val == NULL, "loaded already?");
 203     assert(val_type != NULL, "need a type");
 204 
 205     if (ReduceInitialCardMarks
 206         && satb_can_remove_pre_barrier(kit, &kit->gvn(), adr, bt, alias_idx)) {
 207       return;
 208     }
 209 
 210   } else {
 211     // In this case both val_type and alias_idx are unused.
 212     assert(pre_val != NULL, "must be loaded already");
 213     // Nothing to be done if pre_val is null.
 214     if (pre_val->bottom_type() == TypePtr::NULL_PTR) return;
 215     assert(pre_val->bottom_type()->basic_type() == T_OBJECT, "or we shouldn't be here");
 216   }
 217   assert(bt == T_OBJECT, "or we shouldn't be here");
 218 
 219   IdealKit ideal(kit, true);
 220 
 221   Node* tls = __ thread(); // ThreadLocalStorage
 222 
 223   Node* no_base = __ top();
 224   Node* zero  = __ ConI(0);
 225   Node* zeroX = __ ConX(0);
 226 
 227   float likely  = PROB_LIKELY(0.999);
 228   float unlikely  = PROB_UNLIKELY(0.999);
 229 
 230   // Offsets into the thread
 231   const int index_offset   = in_bytes(ShenandoahThreadLocalData::satb_mark_queue_index_offset());
 232   const int buffer_offset  = in_bytes(ShenandoahThreadLocalData::satb_mark_queue_buffer_offset());
 233 
 234   // Now the actual pointers into the thread
 235   Node* buffer_adr  = __ AddP(no_base, tls, __ ConX(buffer_offset));
 236   Node* index_adr   = __ AddP(no_base, tls, __ ConX(index_offset));
 237 
 238   // Now some of the values
 239   Node* marking;
 240   Node* gc_state = __ AddP(no_base, tls, __ ConX(in_bytes(ShenandoahThreadLocalData::gc_state_offset())));
 241   Node* ld = __ load(__ ctrl(), gc_state, TypeInt::BYTE, T_BYTE, Compile::AliasIdxRaw);
 242   marking = __ AndI(ld, __ ConI(ShenandoahHeap::MARKING));
 243   assert(ShenandoahBarrierC2Support::is_gc_state_load(ld), "Should match the shape");
 244 
 245   // if (!marking)
 246   __ if_then(marking, BoolTest::ne, zero, unlikely); {
 247     BasicType index_bt = TypeX_X->basic_type();
 248     assert(sizeof(size_t) == type2aelembytes(index_bt), "Loading G1 SATBMarkQueue::_index with wrong size.");
 249     Node* index   = __ load(__ ctrl(), index_adr, TypeX_X, index_bt, Compile::AliasIdxRaw);
 250 
 251     if (do_load) {
 252       // load original value
 253       // alias_idx correct??
 254       pre_val = __ load(__ ctrl(), adr, val_type, bt, alias_idx);
 255     }
 256 
 257     // if (pre_val != NULL)
 258     __ if_then(pre_val, BoolTest::ne, kit->null()); {
 259       Node* buffer  = __ load(__ ctrl(), buffer_adr, TypeRawPtr::NOTNULL, T_ADDRESS, Compile::AliasIdxRaw);
 260 
 261       // is the queue for this thread full?
 262       __ if_then(index, BoolTest::ne, zeroX, likely); {
 263 
 264         // decrement the index
 265         Node* next_index = kit->gvn().transform(new SubXNode(index, __ ConX(sizeof(intptr_t))));
 266 
 267         // Now get the buffer location we will log the previous value into and store it
 268         Node *log_addr = __ AddP(no_base, buffer, next_index);
 269         __ store(__ ctrl(), log_addr, pre_val, T_OBJECT, Compile::AliasIdxRaw, MemNode::unordered);
 270         // update the index
 271         __ store(__ ctrl(), index_adr, next_index, index_bt, Compile::AliasIdxRaw, MemNode::unordered);
 272 
 273       } __ else_(); {
 274 
 275         // logging buffer is full, call the runtime
 276         const TypeFunc *tf = ShenandoahBarrierSetC2::write_ref_field_pre_entry_Type();
 277         __ make_leaf_call(tf, CAST_FROM_FN_PTR(address, ShenandoahRuntime::write_ref_field_pre_entry), "shenandoah_wb_pre", pre_val, tls);
 278       } __ end_if();  // (!index)
 279     } __ end_if();  // (pre_val != NULL)
 280   } __ end_if();  // (!marking)
 281 
 282   // Final sync IdealKit and GraphKit.
 283   kit->final_sync(ideal);
 284 
 285   if (ShenandoahSATBBarrier && adr != NULL) {
 286     Node* c = kit->control();
 287     Node* call = c->in(1)->in(1)->in(1)->in(0);
 288     assert(is_shenandoah_wb_pre_call(call), "shenandoah_wb_pre call expected");
 289     call->add_req(adr);
 290   }
 291 }
 292 
 293 bool ShenandoahBarrierSetC2::is_shenandoah_wb_pre_call(Node* call) {
 294   return call->is_CallLeaf() &&
 295          call->as_CallLeaf()->entry_point() == CAST_FROM_FN_PTR(address, ShenandoahRuntime::write_ref_field_pre_entry);
 296 }
 297 
 298 bool ShenandoahBarrierSetC2::is_shenandoah_lrb_call(Node* call) {
 299   return call->is_CallLeaf() &&
 300          call->as_CallLeaf()->entry_point() == CAST_FROM_FN_PTR(address, ShenandoahRuntime::load_reference_barrier_JRT);
 301 }
 302 
 303 bool ShenandoahBarrierSetC2::is_shenandoah_marking_if(PhaseTransform *phase, Node* n) {
 304   if (n->Opcode() != Op_If) {
 305     return false;
 306   }
 307 
 308   Node* bol = n->in(1);
 309   assert(bol->is_Bool(), "");
 310   Node* cmpx = bol->in(1);
 311   if (bol->as_Bool()->_test._test == BoolTest::ne &&
 312       cmpx->is_Cmp() && cmpx->in(2) == phase->intcon(0) &&
 313       is_shenandoah_state_load(cmpx->in(1)->in(1)) &&
 314       cmpx->in(1)->in(2)->is_Con() &&
 315       cmpx->in(1)->in(2) == phase->intcon(ShenandoahHeap::MARKING)) {
 316     return true;
 317   }
 318 
 319   return false;
 320 }
 321 
 322 bool ShenandoahBarrierSetC2::is_shenandoah_state_load(Node* n) {
 323   if (!n->is_Load()) return false;
 324   const int state_offset = in_bytes(ShenandoahThreadLocalData::gc_state_offset());
 325   return n->in(2)->is_AddP() && n->in(2)->in(2)->Opcode() == Op_ThreadLocal
 326          && n->in(2)->in(3)->is_Con()
 327          && n->in(2)->in(3)->bottom_type()->is_intptr_t()->get_con() == state_offset;
 328 }
 329 
 330 void ShenandoahBarrierSetC2::shenandoah_write_barrier_pre(GraphKit* kit,
 331                                                           bool do_load,
 332                                                           Node* obj,
 333                                                           Node* adr,
 334                                                           uint alias_idx,
 335                                                           Node* val,
 336                                                           const TypeOopPtr* val_type,
 337                                                           Node* pre_val,
 338                                                           BasicType bt) const {
 339   if (ShenandoahSATBBarrier) {
 340     IdealKit ideal(kit);
 341     kit->sync_kit(ideal);
 342 
 343     satb_write_barrier_pre(kit, do_load, obj, adr, alias_idx, val, val_type, pre_val, bt);
 344 
 345     ideal.sync_kit(kit);
 346     kit->final_sync(ideal);
 347   }
 348 }
 349 
 350 Node* ShenandoahBarrierSetC2::shenandoah_enqueue_barrier(GraphKit* kit, Node* pre_val) const {
 351   return kit->gvn().transform(new ShenandoahEnqueueBarrierNode(pre_val));
 352 }
 353 
 354 // Helper that guards and inserts a pre-barrier.
 355 void ShenandoahBarrierSetC2::insert_pre_barrier(GraphKit* kit, Node* base_oop, Node* offset,
 356                                                 Node* pre_val, bool need_mem_bar) const {
 357   // We could be accessing the referent field of a reference object. If so, when G1
 358   // is enabled, we need to log the value in the referent field in an SATB buffer.
 359   // This routine performs some compile time filters and generates suitable
 360   // runtime filters that guard the pre-barrier code.
 361   // Also add memory barrier for non volatile load from the referent field
 362   // to prevent commoning of loads across safepoint.
 363 
 364   // Some compile time checks.
 365 
 366   // If offset is a constant, is it java_lang_ref_Reference::_reference_offset?
 367   const TypeX* otype = offset->find_intptr_t_type();
 368   if (otype != NULL && otype->is_con() &&
 369       otype->get_con() != java_lang_ref_Reference::referent_offset) {
 370     // Constant offset but not the reference_offset so just return
 371     return;
 372   }
 373 
 374   // We only need to generate the runtime guards for instances.
 375   const TypeOopPtr* btype = base_oop->bottom_type()->isa_oopptr();
 376   if (btype != NULL) {
 377     if (btype->isa_aryptr()) {
 378       // Array type so nothing to do
 379       return;
 380     }
 381 
 382     const TypeInstPtr* itype = btype->isa_instptr();
 383     if (itype != NULL) {
 384       // Can the klass of base_oop be statically determined to be
 385       // _not_ a sub-class of Reference and _not_ Object?
 386       ciKlass* klass = itype->klass();
 387       if ( klass->is_loaded() &&
 388           !klass->is_subtype_of(kit->env()->Reference_klass()) &&
 389           !kit->env()->Object_klass()->is_subtype_of(klass)) {
 390         return;
 391       }
 392     }
 393   }
 394 
 395   // The compile time filters did not reject base_oop/offset so
 396   // we need to generate the following runtime filters
 397   //
 398   // if (offset == java_lang_ref_Reference::_reference_offset) {
 399   //   if (instance_of(base, java.lang.ref.Reference)) {
 400   //     pre_barrier(_, pre_val, ...);
 401   //   }
 402   // }
 403 
 404   float likely   = PROB_LIKELY(  0.999);
 405   float unlikely = PROB_UNLIKELY(0.999);
 406 
 407   IdealKit ideal(kit);
 408 
 409   Node* referent_off = __ ConX(java_lang_ref_Reference::referent_offset);
 410 
 411   __ if_then(offset, BoolTest::eq, referent_off, unlikely); {
 412       // Update graphKit memory and control from IdealKit.
 413       kit->sync_kit(ideal);
 414 
 415       Node* ref_klass_con = kit->makecon(TypeKlassPtr::make(kit->env()->Reference_klass()));
 416       Node* is_instof = kit->gen_instanceof(base_oop, ref_klass_con);
 417 
 418       // Update IdealKit memory and control from graphKit.
 419       __ sync_kit(kit);
 420 
 421       Node* one = __ ConI(1);
 422       // is_instof == 0 if base_oop == NULL
 423       __ if_then(is_instof, BoolTest::eq, one, unlikely); {
 424 
 425         // Update graphKit from IdeakKit.
 426         kit->sync_kit(ideal);
 427 
 428         // Use the pre-barrier to record the value in the referent field
 429         satb_write_barrier_pre(kit, false /* do_load */,
 430                                NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */,
 431                                pre_val /* pre_val */,
 432                                T_OBJECT);
 433         if (need_mem_bar) {
 434           // Add memory barrier to prevent commoning reads from this field
 435           // across safepoint since GC can change its value.
 436           kit->insert_mem_bar(Op_MemBarCPUOrder);
 437         }
 438         // Update IdealKit from graphKit.
 439         __ sync_kit(kit);
 440 
 441       } __ end_if(); // _ref_type != ref_none
 442   } __ end_if(); // offset == referent_offset
 443 
 444   // Final sync IdealKit and GraphKit.
 445   kit->final_sync(ideal);
 446 }
 447 
 448 #undef __
 449 
 450 const TypeFunc* ShenandoahBarrierSetC2::write_ref_field_pre_entry_Type() {
 451   const Type **fields = TypeTuple::fields(2);
 452   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // original field value
 453   fields[TypeFunc::Parms+1] = TypeRawPtr::NOTNULL; // thread
 454   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 455 
 456   // create result type (range)
 457   fields = TypeTuple::fields(0);
 458   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 459 
 460   return TypeFunc::make(domain, range);
 461 }
 462 
 463 const TypeFunc* ShenandoahBarrierSetC2::shenandoah_clone_barrier_Type() {
 464   const Type **fields = TypeTuple::fields(1);
 465   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // original field value
 466   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+1, fields);
 467 
 468   // create result type (range)
 469   fields = TypeTuple::fields(0);
 470   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+0, fields);
 471 
 472   return TypeFunc::make(domain, range);
 473 }
 474 
 475 const TypeFunc* ShenandoahBarrierSetC2::shenandoah_load_reference_barrier_Type() {
 476   const Type **fields = TypeTuple::fields(2);
 477   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL; // original field value
 478   fields[TypeFunc::Parms+1] = TypeRawPtr::BOTTOM;   // original load address
 479 
 480   const TypeTuple *domain = TypeTuple::make(TypeFunc::Parms+2, fields);
 481 
 482   // create result type (range)
 483   fields = TypeTuple::fields(1);
 484   fields[TypeFunc::Parms+0] = TypeInstPtr::NOTNULL;
 485   const TypeTuple *range = TypeTuple::make(TypeFunc::Parms+1, fields);
 486 
 487   return TypeFunc::make(domain, range);
 488 }
 489 
 490 Node* ShenandoahBarrierSetC2::store_at_resolved(C2Access& access, C2AccessValue& val) const {
 491   DecoratorSet decorators = access.decorators();
 492 
 493   const TypePtr* adr_type = access.addr().type();
 494   Node* adr = access.addr().node();
 495 
 496   bool anonymous = (decorators & ON_UNKNOWN_OOP_REF) != 0;
 497   bool on_heap = (decorators & IN_HEAP) != 0;
 498 
 499   if (!access.is_oop() || (!on_heap && !anonymous)) {
 500     return BarrierSetC2::store_at_resolved(access, val);
 501   }
 502 
 503   if (access.is_parse_access()) {
 504     C2ParseAccess& parse_access = static_cast<C2ParseAccess&>(access);
 505     GraphKit* kit = parse_access.kit();
 506 
 507     uint adr_idx = kit->C->get_alias_index(adr_type);
 508     assert(adr_idx != Compile::AliasIdxTop, "use other store_to_memory factory" );
 509     Node* value = val.node();
 510     value = shenandoah_storeval_barrier(kit, value);
 511     val.set_node(value);
 512     shenandoah_write_barrier_pre(kit, true /* do_load */, /*kit->control(),*/ access.base(), adr, adr_idx, val.node(),
 513                                  static_cast<const TypeOopPtr*>(val.type()), NULL /* pre_val */, access.type());
 514   } else {
 515     assert(access.is_opt_access(), "only for optimization passes");
 516     assert(((decorators & C2_TIGHTLY_COUPLED_ALLOC) != 0 || !ShenandoahSATBBarrier) && (decorators & C2_ARRAY_COPY) != 0, "unexpected caller of this code");
 517     C2OptAccess& opt_access = static_cast<C2OptAccess&>(access);
 518     PhaseGVN& gvn =  opt_access.gvn();
 519     MergeMemNode* mm = opt_access.mem();
 520 
 521     if (ShenandoahStoreValEnqueueBarrier) {
 522       Node* enqueue = gvn.transform(new ShenandoahEnqueueBarrierNode(val.node()));
 523       val.set_node(enqueue);
 524     }
 525   }
 526   return BarrierSetC2::store_at_resolved(access, val);
 527 }
 528 
 529 Node* ShenandoahBarrierSetC2::load_at_resolved(C2Access& access, const Type* val_type) const {
 530   DecoratorSet decorators = access.decorators();
 531 
 532   Node* adr = access.addr().node();
 533   Node* obj = access.base();
 534 
 535   bool mismatched = (decorators & C2_MISMATCHED) != 0;
 536   bool unknown = (decorators & ON_UNKNOWN_OOP_REF) != 0;
 537   bool on_heap = (decorators & IN_HEAP) != 0;
 538   bool on_weak = (decorators & ON_WEAK_OOP_REF) != 0;
 539   bool is_unordered = (decorators & MO_UNORDERED) != 0;
 540   bool need_cpu_mem_bar = !is_unordered || mismatched || !on_heap;
 541 
 542   Node* top = Compile::current()->top();
 543 
 544   Node* offset = adr->is_AddP() ? adr->in(AddPNode::Offset) : top;
 545   Node* load = BarrierSetC2::load_at_resolved(access, val_type);
 546 
 547   if (access.is_oop()) {
 548     if (ShenandoahLoadRefBarrier) {
 549       load = new ShenandoahLoadReferenceBarrierNode(NULL, load, adr);
 550       if (access.is_parse_access()) {
 551         load = static_cast<C2ParseAccess &>(access).kit()->gvn().transform(load);
 552       } else {
 553         load = static_cast<C2OptAccess &>(access).gvn().transform(load);
 554       }
 555     }
 556   }
 557 
 558   // If we are reading the value of the referent field of a Reference
 559   // object (either by using Unsafe directly or through reflection)
 560   // then, if SATB is enabled, we need to record the referent in an
 561   // SATB log buffer using the pre-barrier mechanism.
 562   // Also we need to add memory barrier to prevent commoning reads
 563   // from this field across safepoint since GC can change its value.
 564   bool need_read_barrier = ShenandoahKeepAliveBarrier &&
 565     (on_heap && (on_weak || (unknown && offset != top && obj != top)));
 566 
 567   if (!access.is_oop() || !need_read_barrier) {
 568     return load;
 569   }
 570 
 571   assert(access.is_parse_access(), "entry not supported at optimization time");
 572   C2ParseAccess& parse_access = static_cast<C2ParseAccess&>(access);
 573   GraphKit* kit = parse_access.kit();
 574 
 575   if (on_weak) {
 576     // Use the pre-barrier to record the value in the referent field
 577     satb_write_barrier_pre(kit, false /* do_load */,
 578                            NULL /* obj */, NULL /* adr */, max_juint /* alias_idx */, NULL /* val */, NULL /* val_type */,
 579                            load /* pre_val */, T_OBJECT);
 580     // Add memory barrier to prevent commoning reads from this field
 581     // across safepoint since GC can change its value.
 582     kit->insert_mem_bar(Op_MemBarCPUOrder);
 583   } else if (unknown) {
 584     // We do not require a mem bar inside pre_barrier if need_mem_bar
 585     // is set: the barriers would be emitted by us.
 586     insert_pre_barrier(kit, obj, offset, load, !need_cpu_mem_bar);
 587   }
 588 
 589   return load;
 590 }
 591 
 592 Node* ShenandoahBarrierSetC2::atomic_cmpxchg_val_at_resolved(C2AtomicParseAccess& access, Node* expected_val,
 593                                                    Node* new_val, const Type* value_type) const {
 594   GraphKit* kit = access.kit();
 595   if (access.is_oop()) {
 596     new_val = shenandoah_storeval_barrier(kit, new_val);
 597     shenandoah_write_barrier_pre(kit, false /* do_load */,
 598                                  NULL, NULL, max_juint, NULL, NULL,
 599                                  expected_val /* pre_val */, T_OBJECT);
 600 
 601     MemNode::MemOrd mo = access.mem_node_mo();
 602     Node* mem = access.memory();
 603     Node* adr = access.addr().node();
 604     const TypePtr* adr_type = access.addr().type();
 605     Node* load_store = NULL;
 606 
 607 #ifdef _LP64
 608     if (adr->bottom_type()->is_ptr_to_narrowoop()) {
 609       Node *newval_enc = kit->gvn().transform(new EncodePNode(new_val, new_val->bottom_type()->make_narrowoop()));
 610       Node *oldval_enc = kit->gvn().transform(new EncodePNode(expected_val, expected_val->bottom_type()->make_narrowoop()));
 611       if (ShenandoahCASBarrier) {
 612         load_store = kit->gvn().transform(new ShenandoahCompareAndExchangeNNode(kit->control(), mem, adr, newval_enc, oldval_enc, adr_type, value_type->make_narrowoop(), mo));
 613       } else {
 614         load_store = kit->gvn().transform(new CompareAndExchangeNNode(kit->control(), mem, adr, newval_enc, oldval_enc, adr_type, value_type->make_narrowoop(), mo));
 615       }
 616     } else
 617 #endif
 618     {
 619       if (ShenandoahCASBarrier) {
 620         load_store = kit->gvn().transform(new ShenandoahCompareAndExchangePNode(kit->control(), mem, adr, new_val, expected_val, adr_type, value_type->is_oopptr(), mo));
 621       } else {
 622         load_store = kit->gvn().transform(new CompareAndExchangePNode(kit->control(), mem, adr, new_val, expected_val, adr_type, value_type->is_oopptr(), mo));
 623       }
 624     }
 625 
 626     access.set_raw_access(load_store);
 627     pin_atomic_op(access);
 628 
 629 #ifdef _LP64
 630     if (adr->bottom_type()->is_ptr_to_narrowoop()) {
 631       load_store = kit->gvn().transform(new DecodeNNode(load_store, load_store->get_ptr_type()));
 632     }
 633 #endif
 634     load_store = kit->gvn().transform(new ShenandoahLoadReferenceBarrierNode(NULL, load_store, kit->null()));
 635     return load_store;
 636   }
 637   return BarrierSetC2::atomic_cmpxchg_val_at_resolved(access, expected_val, new_val, value_type);
 638 }
 639 
 640 Node* ShenandoahBarrierSetC2::atomic_cmpxchg_bool_at_resolved(C2AtomicParseAccess& access, Node* expected_val,
 641                                                               Node* new_val, const Type* value_type) const {
 642   GraphKit* kit = access.kit();
 643   if (access.is_oop()) {
 644     new_val = shenandoah_storeval_barrier(kit, new_val);
 645     shenandoah_write_barrier_pre(kit, false /* do_load */,
 646                                  NULL, NULL, max_juint, NULL, NULL,
 647                                  expected_val /* pre_val */, T_OBJECT);
 648     DecoratorSet decorators = access.decorators();
 649     MemNode::MemOrd mo = access.mem_node_mo();
 650     Node* mem = access.memory();
 651     bool is_weak_cas = (decorators & C2_WEAK_CMPXCHG) != 0;
 652     Node* load_store = NULL;
 653     Node* adr = access.addr().node();
 654 #ifdef _LP64
 655     if (adr->bottom_type()->is_ptr_to_narrowoop()) {
 656       Node *newval_enc = kit->gvn().transform(new EncodePNode(new_val, new_val->bottom_type()->make_narrowoop()));
 657       Node *oldval_enc = kit->gvn().transform(new EncodePNode(expected_val, expected_val->bottom_type()->make_narrowoop()));
 658       if (ShenandoahCASBarrier) {
 659         if (is_weak_cas) {
 660           load_store = kit->gvn().transform(new ShenandoahWeakCompareAndSwapNNode(kit->control(), mem, adr, newval_enc, oldval_enc, mo));
 661         } else {
 662           load_store = kit->gvn().transform(new ShenandoahCompareAndSwapNNode(kit->control(), mem, adr, newval_enc, oldval_enc, mo));
 663         }
 664       } else {
 665         if (is_weak_cas) {
 666           load_store = kit->gvn().transform(new WeakCompareAndSwapNNode(kit->control(), mem, adr, newval_enc, oldval_enc, mo));
 667         } else {
 668           load_store = kit->gvn().transform(new CompareAndSwapNNode(kit->control(), mem, adr, newval_enc, oldval_enc, mo));
 669         }
 670       }
 671     } else
 672 #endif
 673     {
 674       if (ShenandoahCASBarrier) {
 675         if (is_weak_cas) {
 676           load_store = kit->gvn().transform(new ShenandoahWeakCompareAndSwapPNode(kit->control(), mem, adr, new_val, expected_val, mo));
 677         } else {
 678           load_store = kit->gvn().transform(new ShenandoahCompareAndSwapPNode(kit->control(), mem, adr, new_val, expected_val, mo));
 679         }
 680       } else {
 681         if (is_weak_cas) {
 682           load_store = kit->gvn().transform(new WeakCompareAndSwapPNode(kit->control(), mem, adr, new_val, expected_val, mo));
 683         } else {
 684           load_store = kit->gvn().transform(new CompareAndSwapPNode(kit->control(), mem, adr, new_val, expected_val, mo));
 685         }
 686       }
 687     }
 688     access.set_raw_access(load_store);
 689     pin_atomic_op(access);
 690     return load_store;
 691   }
 692   return BarrierSetC2::atomic_cmpxchg_bool_at_resolved(access, expected_val, new_val, value_type);
 693 }
 694 
 695 Node* ShenandoahBarrierSetC2::atomic_xchg_at_resolved(C2AtomicParseAccess& access, Node* val, const Type* value_type) const {
 696   GraphKit* kit = access.kit();
 697   if (access.is_oop()) {
 698     val = shenandoah_storeval_barrier(kit, val);
 699   }
 700   Node* result = BarrierSetC2::atomic_xchg_at_resolved(access, val, value_type);
 701   if (access.is_oop()) {
 702     result = kit->gvn().transform(new ShenandoahLoadReferenceBarrierNode(NULL, result, kit->null()));
 703     shenandoah_write_barrier_pre(kit, false /* do_load */,
 704                                  NULL, NULL, max_juint, NULL, NULL,
 705                                  result /* pre_val */, T_OBJECT);
 706   }
 707   return result;
 708 }
 709 
 710 void ShenandoahBarrierSetC2::clone(GraphKit* kit, Node* src, Node* dst, Node* size, bool is_array) const {
 711   assert(!src->is_AddP(), "unexpected input");
 712   BarrierSetC2::clone(kit, src, dst, size, is_array);
 713 }
 714 
 715 // Support for GC barriers emitted during parsing
 716 bool ShenandoahBarrierSetC2::is_gc_barrier_node(Node* node) const {
 717   if (node->Opcode() == Op_ShenandoahLoadReferenceBarrier) return true;
 718   if (node->Opcode() != Op_CallLeaf && node->Opcode() != Op_CallLeafNoFP) {
 719     return false;
 720   }
 721   CallLeafNode *call = node->as_CallLeaf();
 722   if (call->_name == NULL) {
 723     return false;
 724   }
 725 
 726   return strcmp(call->_name, "shenandoah_clone_barrier") == 0 ||
 727          strcmp(call->_name, "shenandoah_cas_obj") == 0 ||
 728          strcmp(call->_name, "shenandoah_wb_pre") == 0;
 729 }
 730 
 731 Node* ShenandoahBarrierSetC2::step_over_gc_barrier(Node* c) const {
 732   if (c->Opcode() == Op_ShenandoahLoadReferenceBarrier) {
 733     return c->in(ShenandoahLoadReferenceBarrierNode::ValueIn);
 734   }
 735   if (c->Opcode() == Op_ShenandoahEnqueueBarrier) {
 736     c = c->in(1);
 737   }
 738   return c;
 739 }
 740 
 741 bool ShenandoahBarrierSetC2::expand_barriers(Compile* C, PhaseIterGVN& igvn) const {
 742   return !ShenandoahBarrierC2Support::expand(C, igvn);
 743 }
 744 
 745 bool ShenandoahBarrierSetC2::optimize_loops(PhaseIdealLoop* phase, LoopOptsMode mode, VectorSet& visited, Node_Stack& nstack, Node_List& worklist) const {
 746   if (mode == LoopOptsShenandoahExpand) {
 747     assert(UseShenandoahGC, "only for shenandoah");
 748     ShenandoahBarrierC2Support::pin_and_expand(phase);
 749     return true;
 750   } else if (mode == LoopOptsShenandoahPostExpand) {
 751     assert(UseShenandoahGC, "only for shenandoah");
 752     visited.Clear();
 753     ShenandoahBarrierC2Support::optimize_after_expansion(visited, nstack, worklist, phase);
 754     return true;
 755   }
 756   return false;
 757 }
 758 
 759 bool ShenandoahBarrierSetC2::array_copy_requires_gc_barriers(bool tightly_coupled_alloc, BasicType type, bool is_clone, ArrayCopyPhase phase) const {
 760   bool is_oop = type == T_OBJECT || type == T_ARRAY;
 761   if (!is_oop) {
 762     return false;
 763   }
 764   if (tightly_coupled_alloc) {
 765     if (phase == Optimization) {
 766       return false;
 767     }
 768     return !is_clone;
 769   }
 770   if (phase == Optimization) {
 771     return !ShenandoahStoreValEnqueueBarrier;
 772   }
 773   return true;
 774 }
 775 
 776 bool ShenandoahBarrierSetC2::clone_needs_postbarrier(ArrayCopyNode *ac, PhaseIterGVN& igvn) {
 777   Node* src = ac->in(ArrayCopyNode::Src);
 778   const TypeOopPtr* src_type = igvn.type(src)->is_oopptr();
 779   if (src_type->isa_instptr() != NULL) {
 780     ciInstanceKlass* ik = src_type->klass()->as_instance_klass();
 781     if ((src_type->klass_is_exact() || (!ik->is_interface() && !ik->has_subklass())) && !ik->has_injected_fields()) {
 782       if (ik->has_object_fields()) {
 783         return true;
 784       } else {
 785         if (!src_type->klass_is_exact()) {
 786           igvn.C->dependencies()->assert_leaf_type(ik);
 787         }
 788       }
 789     } else {
 790       return true;
 791         }
 792   } else if (src_type->isa_aryptr()) {
 793     BasicType src_elem  = src_type->klass()->as_array_klass()->element_type()->basic_type();
 794     if (src_elem == T_OBJECT || src_elem == T_ARRAY) {
 795       return true;
 796     }
 797   } else {
 798     return true;
 799   }
 800   return false;
 801 }
 802 
 803 void ShenandoahBarrierSetC2::clone_barrier_at_expansion(ArrayCopyNode* ac, Node* call, PhaseIterGVN& igvn) const {
 804   assert(ac->is_clonebasic(), "no other kind of arraycopy here");
 805 
 806   if (!clone_needs_postbarrier(ac, igvn)) {
 807     BarrierSetC2::clone_barrier_at_expansion(ac, call, igvn);
 808     return;
 809   }
 810 
 811   const TypePtr* raw_adr_type = TypeRawPtr::BOTTOM;
 812   Node* c = new ProjNode(call,TypeFunc::Control);
 813   c = igvn.transform(c);
 814   Node* m = new ProjNode(call, TypeFunc::Memory);
 815   m = igvn.transform(m);
 816 
 817   Node* dest = ac->in(ArrayCopyNode::Dest);
 818   assert(dest->is_AddP(), "bad input");
 819   Node* barrier_call = new CallLeafNode(ShenandoahBarrierSetC2::shenandoah_clone_barrier_Type(),
 820                                         CAST_FROM_FN_PTR(address, ShenandoahRuntime::shenandoah_clone_barrier),
 821                                         "shenandoah_clone_barrier", raw_adr_type);
 822   barrier_call->init_req(TypeFunc::Control, c);
 823   barrier_call->init_req(TypeFunc::I_O    , igvn.C->top());
 824   barrier_call->init_req(TypeFunc::Memory , m);
 825   barrier_call->init_req(TypeFunc::ReturnAdr, igvn.C->top());
 826   barrier_call->init_req(TypeFunc::FramePtr, igvn.C->top());
 827   barrier_call->init_req(TypeFunc::Parms+0, dest->in(AddPNode::Base));
 828 
 829   barrier_call = igvn.transform(barrier_call);
 830   c = new ProjNode(barrier_call,TypeFunc::Control);
 831   c = igvn.transform(c);
 832   m = new ProjNode(barrier_call, TypeFunc::Memory);
 833   m = igvn.transform(m);
 834 
 835   Node* out_c = ac->proj_out(TypeFunc::Control);
 836   Node* out_m = ac->proj_out(TypeFunc::Memory);
 837   igvn.replace_node(out_c, c);
 838   igvn.replace_node(out_m, m);
 839 }
 840 
 841 
 842 // Support for macro expanded GC barriers
 843 void ShenandoahBarrierSetC2::register_potential_barrier_node(Node* node) const {
 844   if (node->Opcode() == Op_ShenandoahEnqueueBarrier) {
 845     state()->add_enqueue_barrier((ShenandoahEnqueueBarrierNode*) node);
 846   }
 847   if (node->Opcode() == Op_ShenandoahLoadReferenceBarrier) {
 848     state()->add_load_reference_barrier((ShenandoahLoadReferenceBarrierNode*) node);
 849   }
 850 }
 851 
 852 void ShenandoahBarrierSetC2::unregister_potential_barrier_node(Node* node) const {
 853   if (node->Opcode() == Op_ShenandoahEnqueueBarrier) {
 854     state()->remove_enqueue_barrier((ShenandoahEnqueueBarrierNode*) node);
 855   }
 856   if (node->Opcode() == Op_ShenandoahLoadReferenceBarrier) {
 857     state()->remove_load_reference_barrier((ShenandoahLoadReferenceBarrierNode*) node);
 858   }
 859 }
 860 
 861 void ShenandoahBarrierSetC2::eliminate_gc_barrier(PhaseMacroExpand* macro, Node* n) const {
 862   if (is_shenandoah_wb_pre_call(n)) {
 863     shenandoah_eliminate_wb_pre(n, &macro->igvn());
 864   }
 865 }
 866 
 867 void ShenandoahBarrierSetC2::shenandoah_eliminate_wb_pre(Node* call, PhaseIterGVN* igvn) const {
 868   assert(UseShenandoahGC && is_shenandoah_wb_pre_call(call), "");
 869   Node* c = call->as_Call()->proj_out(TypeFunc::Control);
 870   c = c->unique_ctrl_out();
 871   assert(c->is_Region() && c->req() == 3, "where's the pre barrier control flow?");
 872   c = c->unique_ctrl_out();
 873   assert(c->is_Region() && c->req() == 3, "where's the pre barrier control flow?");
 874   Node* iff = c->in(1)->is_IfProj() ? c->in(1)->in(0) : c->in(2)->in(0);
 875   assert(iff->is_If(), "expect test");
 876   if (!is_shenandoah_marking_if(igvn, iff)) {
 877     c = c->unique_ctrl_out();
 878     assert(c->is_Region() && c->req() == 3, "where's the pre barrier control flow?");
 879     iff = c->in(1)->is_IfProj() ? c->in(1)->in(0) : c->in(2)->in(0);
 880     assert(is_shenandoah_marking_if(igvn, iff), "expect marking test");
 881   }
 882   Node* cmpx = iff->in(1)->in(1);
 883   igvn->replace_node(cmpx, igvn->makecon(TypeInt::CC_EQ));
 884   igvn->rehash_node_delayed(call);
 885   call->del_req(call->req()-1);
 886 }
 887 
 888 void ShenandoahBarrierSetC2::enqueue_useful_gc_barrier(PhaseIterGVN* igvn, Node* node) const {
 889   if (node->Opcode() == Op_AddP && ShenandoahBarrierSetC2::has_only_shenandoah_wb_pre_uses(node)) {
 890     igvn->add_users_to_worklist(node);
 891   }
 892 }
 893 
 894 void ShenandoahBarrierSetC2::eliminate_useless_gc_barriers(Unique_Node_List &useful, Compile* C) const {
 895   for (uint i = 0; i < useful.size(); i++) {
 896     Node* n = useful.at(i);
 897     if (n->Opcode() == Op_AddP && ShenandoahBarrierSetC2::has_only_shenandoah_wb_pre_uses(n)) {
 898       for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
 899         C->record_for_igvn(n->fast_out(i));
 900       }
 901     }
 902   }
 903   for (int i = state()->enqueue_barriers_count() - 1; i >= 0; i--) {
 904     ShenandoahEnqueueBarrierNode* n = state()->enqueue_barrier(i);
 905     if (!useful.member(n)) {
 906       state()->remove_enqueue_barrier(n);
 907     }
 908   }
 909   for (int i = state()->load_reference_barriers_count() - 1; i >= 0; i--) {
 910     ShenandoahLoadReferenceBarrierNode* n = state()->load_reference_barrier(i);
 911     if (!useful.member(n)) {
 912       state()->remove_load_reference_barrier(n);
 913     }
 914   }
 915 }
 916 
 917 void ShenandoahBarrierSetC2::add_users_to_worklist(Unique_Node_List* worklist) const {}
 918 
 919 void* ShenandoahBarrierSetC2::create_barrier_state(Arena* comp_arena) const {
 920   return new(comp_arena) ShenandoahBarrierSetC2State(comp_arena);
 921 }
 922 
 923 ShenandoahBarrierSetC2State* ShenandoahBarrierSetC2::state() const {
 924   return reinterpret_cast<ShenandoahBarrierSetC2State*>(Compile::current()->barrier_set_state());
 925 }
 926 
 927 // If the BarrierSetC2 state has kept macro nodes in its compilation unit state to be
 928 // expanded later, then now is the time to do so.
 929 bool ShenandoahBarrierSetC2::expand_macro_nodes(PhaseMacroExpand* macro) const { return false; }
 930 
 931 #ifdef ASSERT
 932 void ShenandoahBarrierSetC2::verify_gc_barriers(Compile* compile, CompilePhase phase) const {
 933   if (ShenandoahVerifyOptoBarriers && phase == BarrierSetC2::BeforeExpand) {
 934     ShenandoahBarrierC2Support::verify(Compile::current()->root());
 935   } else if (phase == BarrierSetC2::BeforeCodeGen) {
 936     // Verify G1 pre-barriers
 937     const int marking_offset = in_bytes(ShenandoahThreadLocalData::satb_mark_queue_active_offset());
 938 
 939     ResourceArea *area = Thread::current()->resource_area();
 940     Unique_Node_List visited(area);
 941     Node_List worklist(area);
 942     // We're going to walk control flow backwards starting from the Root
 943     worklist.push(compile->root());
 944     while (worklist.size() > 0) {
 945       Node *x = worklist.pop();
 946       if (x == NULL || x == compile->top()) continue;
 947       if (visited.member(x)) {
 948         continue;
 949       } else {
 950         visited.push(x);
 951       }
 952 
 953       if (x->is_Region()) {
 954         for (uint i = 1; i < x->req(); i++) {
 955           worklist.push(x->in(i));
 956         }
 957       } else {
 958         worklist.push(x->in(0));
 959         // We are looking for the pattern:
 960         //                            /->ThreadLocal
 961         // If->Bool->CmpI->LoadB->AddP->ConL(marking_offset)
 962         //              \->ConI(0)
 963         // We want to verify that the If and the LoadB have the same control
 964         // See GraphKit::g1_write_barrier_pre()
 965         if (x->is_If()) {
 966           IfNode *iff = x->as_If();
 967           if (iff->in(1)->is_Bool() && iff->in(1)->in(1)->is_Cmp()) {
 968             CmpNode *cmp = iff->in(1)->in(1)->as_Cmp();
 969             if (cmp->Opcode() == Op_CmpI && cmp->in(2)->is_Con() && cmp->in(2)->bottom_type()->is_int()->get_con() == 0
 970                 && cmp->in(1)->is_Load()) {
 971               LoadNode *load = cmp->in(1)->as_Load();
 972               if (load->Opcode() == Op_LoadB && load->in(2)->is_AddP() && load->in(2)->in(2)->Opcode() == Op_ThreadLocal
 973                   && load->in(2)->in(3)->is_Con()
 974                   && load->in(2)->in(3)->bottom_type()->is_intptr_t()->get_con() == marking_offset) {
 975 
 976                 Node *if_ctrl = iff->in(0);
 977                 Node *load_ctrl = load->in(0);
 978 
 979                 if (if_ctrl != load_ctrl) {
 980                   // Skip possible CProj->NeverBranch in infinite loops
 981                   if ((if_ctrl->is_Proj() && if_ctrl->Opcode() == Op_CProj)
 982                       && (if_ctrl->in(0)->is_MultiBranch() && if_ctrl->in(0)->Opcode() == Op_NeverBranch)) {
 983                     if_ctrl = if_ctrl->in(0)->in(0);
 984                   }
 985                 }
 986                 assert(load_ctrl != NULL && if_ctrl == load_ctrl, "controls must match");
 987               }
 988             }
 989           }
 990         }
 991       }
 992     }
 993   }
 994 }
 995 #endif
 996 
 997 Node* ShenandoahBarrierSetC2::ideal_node(PhaseGVN* phase, Node* n, bool can_reshape) const {
 998   if (is_shenandoah_wb_pre_call(n)) {
 999     uint cnt = ShenandoahBarrierSetC2::write_ref_field_pre_entry_Type()->domain()->cnt();
1000     if (n->req() > cnt) {
1001       Node* addp = n->in(cnt);
1002       if (has_only_shenandoah_wb_pre_uses(addp)) {
1003         n->del_req(cnt);
1004         if (can_reshape) {
1005           phase->is_IterGVN()->_worklist.push(addp);
1006         }
1007         return n;
1008       }
1009     }
1010   }
1011   if (n->Opcode() == Op_CmpP) {
1012     Node* in1 = n->in(1);
1013     Node* in2 = n->in(2);
1014     if (in1->bottom_type() == TypePtr::NULL_PTR) {
1015       in2 = step_over_gc_barrier(in2);
1016     }
1017     if (in2->bottom_type() == TypePtr::NULL_PTR) {
1018       in1 = step_over_gc_barrier(in1);
1019     }
1020     PhaseIterGVN* igvn = phase->is_IterGVN();
1021     if (in1 != n->in(1)) {
1022       if (igvn != NULL) {
1023         n->set_req_X(1, in1, igvn);
1024       } else {
1025         n->set_req(1, in1);
1026       }
1027       assert(in2 == n->in(2), "only one change");
1028       return n;
1029     }
1030     if (in2 != n->in(2)) {
1031       if (igvn != NULL) {
1032         n->set_req_X(2, in2, igvn);
1033       } else {
1034         n->set_req(2, in2);
1035       }
1036       return n;
1037     }
1038   } else if (can_reshape &&
1039              n->Opcode() == Op_If &&
1040              ShenandoahBarrierC2Support::is_heap_stable_test(n) &&
1041              n->in(0) != NULL) {
1042     Node* dom = n->in(0);
1043     Node* prev_dom = n;
1044     int op = n->Opcode();
1045     int dist = 16;
1046     // Search up the dominator tree for another heap stable test
1047     while (dom->Opcode() != op    ||  // Not same opcode?
1048            !ShenandoahBarrierC2Support::is_heap_stable_test(dom) ||  // Not same input 1?
1049            prev_dom->in(0) != dom) {  // One path of test does not dominate?
1050       if (dist < 0) return NULL;
1051 
1052       dist--;
1053       prev_dom = dom;
1054       dom = IfNode::up_one_dom(dom);
1055       if (!dom) return NULL;
1056     }
1057 
1058     // Check that we did not follow a loop back to ourselves
1059     if (n == dom) {
1060       return NULL;
1061     }
1062 
1063     return n->as_If()->dominated_by(prev_dom, phase->is_IterGVN());
1064   }
1065 
1066   return NULL;
1067 }
1068 
1069 bool ShenandoahBarrierSetC2::has_only_shenandoah_wb_pre_uses(Node* n) {
1070   for (DUIterator_Fast imax, i = n->fast_outs(imax); i < imax; i++) {
1071     Node* u = n->fast_out(i);
1072     if (!is_shenandoah_wb_pre_call(u)) {
1073       return false;
1074     }
1075   }
1076   return n->outcnt() > 0;
1077 }
1078 
1079 bool ShenandoahBarrierSetC2::final_graph_reshaping(Compile* compile, Node* n, uint opcode) const {
1080   switch (opcode) {
1081     case Op_CallLeaf:
1082     case Op_CallLeafNoFP: {
1083       assert (n->is_Call(), "");
1084       CallNode *call = n->as_Call();
1085       if (ShenandoahBarrierSetC2::is_shenandoah_wb_pre_call(call)) {
1086         uint cnt = ShenandoahBarrierSetC2::write_ref_field_pre_entry_Type()->domain()->cnt();
1087         if (call->req() > cnt) {
1088           assert(call->req() == cnt + 1, "only one extra input");
1089           Node *addp = call->in(cnt);
1090           assert(!ShenandoahBarrierSetC2::has_only_shenandoah_wb_pre_uses(addp), "useless address computation?");
1091           call->del_req(cnt);
1092         }
1093       }
1094       return false;
1095     }
1096     case Op_ShenandoahCompareAndSwapP:
1097     case Op_ShenandoahCompareAndSwapN:
1098     case Op_ShenandoahWeakCompareAndSwapN:
1099     case Op_ShenandoahWeakCompareAndSwapP:
1100     case Op_ShenandoahCompareAndExchangeP:
1101     case Op_ShenandoahCompareAndExchangeN:
1102 #ifdef ASSERT
1103       if( VerifyOptoOopOffsets ) {
1104         MemNode* mem  = n->as_Mem();
1105         // Check to see if address types have grounded out somehow.
1106         const TypeInstPtr *tp = mem->in(MemNode::Address)->bottom_type()->isa_instptr();
1107         ciInstanceKlass *k = tp->klass()->as_instance_klass();
1108         bool oop_offset_is_sane = k->contains_field_offset(tp->offset());
1109         assert( !tp || oop_offset_is_sane, "" );
1110       }
1111 #endif
1112       return true;
1113     case Op_ShenandoahLoadReferenceBarrier:
1114       assert(false, "should have been expanded already");
1115       return true;
1116     default:
1117       return false;
1118   }
1119 }
1120 
1121 bool ShenandoahBarrierSetC2::escape_add_to_con_graph(ConnectionGraph* conn_graph, PhaseGVN* gvn, Unique_Node_List* delayed_worklist, Node* n, uint opcode) const {
1122   switch (opcode) {
1123     case Op_ShenandoahCompareAndExchangeP:
1124     case Op_ShenandoahCompareAndExchangeN:
1125       conn_graph->add_objload_to_connection_graph(n, delayed_worklist);
1126       // fallthrough
1127     case Op_ShenandoahWeakCompareAndSwapP:
1128     case Op_ShenandoahWeakCompareAndSwapN:
1129     case Op_ShenandoahCompareAndSwapP:
1130     case Op_ShenandoahCompareAndSwapN:
1131       conn_graph->add_to_congraph_unsafe_access(n, opcode, delayed_worklist);
1132       return true;
1133     case Op_StoreP: {
1134       Node* adr = n->in(MemNode::Address);
1135       const Type* adr_type = gvn->type(adr);
1136       // Pointer stores in G1 barriers looks like unsafe access.
1137       // Ignore such stores to be able scalar replace non-escaping
1138       // allocations.
1139       if (adr_type->isa_rawptr() && adr->is_AddP()) {
1140         Node* base = conn_graph->get_addp_base(adr);
1141         if (base->Opcode() == Op_LoadP &&
1142           base->in(MemNode::Address)->is_AddP()) {
1143           adr = base->in(MemNode::Address);
1144           Node* tls = conn_graph->get_addp_base(adr);
1145           if (tls->Opcode() == Op_ThreadLocal) {
1146              int offs = (int) gvn->find_intptr_t_con(adr->in(AddPNode::Offset), Type::OffsetBot);
1147              const int buf_offset = in_bytes(ShenandoahThreadLocalData::satb_mark_queue_buffer_offset());
1148              if (offs == buf_offset) {
1149                return true; // Pre barrier previous oop value store.
1150              }
1151           }
1152         }
1153       }
1154       return false;
1155     }
1156     case Op_ShenandoahEnqueueBarrier:
1157       conn_graph->add_local_var_and_edge(n, PointsToNode::NoEscape, n->in(1), delayed_worklist);
1158       break;
1159     case Op_ShenandoahLoadReferenceBarrier:
1160       conn_graph->add_local_var_and_edge(n, PointsToNode::NoEscape, n->in(ShenandoahLoadReferenceBarrierNode::ValueIn), delayed_worklist);
1161       return true;
1162     default:
1163       // Nothing
1164       break;
1165   }
1166   return false;
1167 }
1168 
1169 bool ShenandoahBarrierSetC2::escape_add_final_edges(ConnectionGraph* conn_graph, PhaseGVN* gvn, Node* n, uint opcode) const {
1170   switch (opcode) {
1171     case Op_ShenandoahCompareAndExchangeP:
1172     case Op_ShenandoahCompareAndExchangeN: {
1173       Node *adr = n->in(MemNode::Address);
1174       conn_graph->add_local_var_and_edge(n, PointsToNode::NoEscape, adr, NULL);
1175       // fallthrough
1176     }
1177     case Op_ShenandoahCompareAndSwapP:
1178     case Op_ShenandoahCompareAndSwapN:
1179     case Op_ShenandoahWeakCompareAndSwapP:
1180     case Op_ShenandoahWeakCompareAndSwapN:
1181       return conn_graph->add_final_edges_unsafe_access(n, opcode);
1182     case Op_ShenandoahEnqueueBarrier:
1183       conn_graph->add_local_var_and_edge(n, PointsToNode::NoEscape, n->in(1), NULL);
1184       return true;
1185     case Op_ShenandoahLoadReferenceBarrier:
1186       conn_graph->add_local_var_and_edge(n, PointsToNode::NoEscape, n->in(ShenandoahLoadReferenceBarrierNode::ValueIn), NULL);
1187       return true;
1188     default:
1189       // Nothing
1190       break;
1191   }
1192   return false;
1193 }
1194 
1195 bool ShenandoahBarrierSetC2::escape_has_out_with_unsafe_object(Node* n) const {
1196   return n->has_out_with(Op_ShenandoahCompareAndExchangeP) || n->has_out_with(Op_ShenandoahCompareAndExchangeN) ||
1197          n->has_out_with(Op_ShenandoahCompareAndSwapP, Op_ShenandoahCompareAndSwapN, Op_ShenandoahWeakCompareAndSwapP, Op_ShenandoahWeakCompareAndSwapN);
1198 
1199 }
1200 
1201 bool ShenandoahBarrierSetC2::escape_is_barrier_node(Node* n) const {
1202   return false;
1203 }
1204 
1205 bool ShenandoahBarrierSetC2::matcher_find_shared_post_visit(Matcher* matcher, Node* n, uint opcode) const {
1206   switch (opcode) {
1207     case Op_ShenandoahCompareAndExchangeP:
1208     case Op_ShenandoahCompareAndExchangeN:
1209     case Op_ShenandoahWeakCompareAndSwapP:
1210     case Op_ShenandoahWeakCompareAndSwapN:
1211     case Op_ShenandoahCompareAndSwapP:
1212     case Op_ShenandoahCompareAndSwapN: {   // Convert trinary to binary-tree
1213       Node* newval = n->in(MemNode::ValueIn);
1214       Node* oldval = n->in(LoadStoreConditionalNode::ExpectedIn);
1215       Node* pair = new BinaryNode(oldval, newval);
1216       n->set_req(MemNode::ValueIn,pair);
1217       n->del_req(LoadStoreConditionalNode::ExpectedIn);
1218       return true;
1219     }
1220     default:
1221       break;
1222   }
1223   return false;
1224 }
1225 
1226 bool ShenandoahBarrierSetC2::matcher_is_store_load_barrier(Node* x, uint xop) const {
1227   return xop == Op_ShenandoahCompareAndExchangeP ||
1228          xop == Op_ShenandoahCompareAndExchangeN ||
1229          xop == Op_ShenandoahWeakCompareAndSwapP ||
1230          xop == Op_ShenandoahWeakCompareAndSwapN ||
1231          xop == Op_ShenandoahCompareAndSwapN ||
1232          xop == Op_ShenandoahCompareAndSwapP;
1233 }