truffle: src/share/vm/opto/memnode.cpp comparison

comparison src/share/vm/opto/memnode.cpp @ 12355:cefad50507d8

Merge with hs25-b53

author	Gilles Duboscq <duboscq@ssw.jku.at>
date	Fri, 11 Oct 2013 10:38:03 +0200
parents	884ed7a10f09
children	b87211e33ebb 2113136690bc

comparison

equal deleted inserted replaced

-:ccb4f2af2319
+:cefad50507d8
 uint LoadNode::hash() const {
 // unroll addition of interesting fields
 return (uintptr_t)in(Control) + (uintptr_t)in(Memory) + (uintptr_t)in(Address);
 }
+static bool skip_through_membars(Compile::AliasType* atp, const TypeInstPtr* tp, bool eliminate_boxing) {
+if ((atp != NULL) && (atp->index() >= Compile::AliasIdxRaw)) {
+bool non_volatile = (atp->field() != NULL) && !atp->field()->is_volatile();
+bool is_stable_ary = FoldStableValues &&
+(tp != NULL) && (tp->isa_aryptr() != NULL) &&
+tp->isa_aryptr()->is_stable();
+return (eliminate_boxing && non_volatile) || is_stable_ary;
+}
+return false;
+}
 //---------------------------can_see_stored_value------------------------------
 // This routine exists to make sure this set of tests is done the same
 // everywhere.  We need to make a coordinated change: first LoadNode::Ideal
 // will change the graph shape in a way which makes memory alive twice at the
 // same time (uses the Oracle model of aliasing), then some
 intptr_t ld_off = 0;
 AllocateNode* ld_alloc = AllocateNode::Ideal_allocation(ld_adr, phase, ld_off);
 const TypeInstPtr* tp = phase->type(ld_adr)->isa_instptr();
 Compile::AliasType* atp = (tp != NULL) ? phase->C->alias_type(tp) : NULL;
 // This is more general than load from boxing objects.
-if (phase->C->eliminate_boxing() && (atp != NULL) &&
+if (skip_through_membars(atp, tp, phase->C->eliminate_boxing())) {
-(atp->index() >= Compile::AliasIdxRaw) &&
-(atp->field() != NULL) && !atp->field()->is_volatile()) {
 uint alias_idx = atp->index();
-bool final = atp->field()->is_final();
+bool final = !atp->is_rewritable();
 Node* result = NULL;
 Node* current = st;
 // Skip through chains of MemBarNodes checking the MergeMems for
 // new states for the slice of this load.  Stop once any other
 // kind of node is encountered.  Loads from final memory can skip
 }
 if (result != NULL) {
 st = result;
 }
 }
 // Loop around twice in the case Load -> Initialize -> Store.
 // (See PhaseIterGVN::add_users_to_worklist, which knows about this case.)
 for (int trip = 0; trip <= 1; trip++) {
 // No match.
 return NULL;
 }
+// Try to constant-fold a stable array element.
+static const Type* fold_stable_ary_elem(const TypeAryPtr* ary, int off, BasicType loadbt) {
+assert(ary->is_stable(), "array should be stable");
+if (ary->const_oop() != NULL) {
+// Decode the results of GraphKit::array_element_address.
+ciArray* aobj = ary->const_oop()->as_array();
+ciConstant con = aobj->element_value_by_offset(off);
+if (con.basic_type() != T_ILLEGAL && !con.is_null_or_zero()) {
+const Type* con_type = Type::make_from_constant(con);
+if (con_type != NULL) {
+if (con_type->isa_aryptr()) {
+// Join with the array element type, in case it is also stable.
+int dim = ary->stable_dimension();
+con_type = con_type->is_aryptr()->cast_to_stable(true, dim-1);
+}
+if (loadbt == T_NARROWOOP && con_type->isa_oopptr()) {
+con_type = con_type->make_narrowoop();
+}
+#ifndef PRODUCT
+if (TraceIterativeGVN) {
+tty->print("FoldStableValues: array element [off=%d]: con_type=", off);
+con_type->dump(); tty->cr();
+}
+#endif //PRODUCT
+return con_type;
+}
+}
+}
+return NULL;
+}
 //------------------------------Value-----------------------------------------
 const Type *LoadNode::Value( PhaseTransform *phase ) const {
 // Either input is TOP ==> the result is TOP
 Node* mem = in(MemNode::Memory);
 const Type *t1 = phase->type(mem);
 int off = tp->offset();
 assert(off != Type::OffsetTop, "case covered by TypePtr::empty");
 Compile* C = phase->C;
 // Try to guess loaded type from pointer type
-if (tp->base() == Type::AryPtr) {
+if (tp->isa_aryptr()) {
-const Type *t = tp->is_aryptr()->elem();
+const TypeAryPtr* ary = tp->is_aryptr();
+const Type *t = ary->elem();
+// Determine whether the reference is beyond the header or not, by comparing
+// the offset against the offset of the start of the array's data.
+// Different array types begin at slightly different offsets (12 vs. 16).
+// We choose T_BYTE as an example base type that is least restrictive
+// as to alignment, which will therefore produce the smallest
+// possible base offset.
+const int min_base_off = arrayOopDesc::base_offset_in_bytes(T_BYTE);
+const bool off_beyond_header = ((uint)off >= (uint)min_base_off);
+// Try to constant-fold a stable array element.
+if (FoldStableValues && ary->is_stable()) {
+// Make sure the reference is not into the header
+if (off_beyond_header && off != Type::OffsetBot) {
+assert(adr->is_AddP() && adr->in(AddPNode::Offset)->is_Con(), "offset is a constant");
+const Type* con_type = fold_stable_ary_elem(ary, off, memory_type());
+if (con_type != NULL) {
+return con_type;
+}
+}
+}
 // Don't do this for integer types. There is only potential profit if
 // the element type t is lower than _type; that is, for int types, if _type is
 // more restrictive than t.  This only happens here if one is short and the other
 // char (both 16 bits), and in those cases we've made an intentional decision
 // to use one kind of load over the other. See AndINode::Ideal and 4965907.
 if ((t->isa_int() == NULL) && (t->isa_long() == NULL)
 && (_type->isa_vect() == NULL)
 && Opcode() != Op_LoadKlass && Opcode() != Op_LoadNKlass) {
 // t might actually be lower than _type, if _type is a unique
 // concrete subclass of abstract class t.
-// Make sure the reference is not into the header, by comparing
+if (off_beyond_header) {  // is the offset beyond the header?
-// the offset against the offset of the start of the array's data.
-// Different array types begin at slightly different offsets (12 vs. 16).
-// We choose T_BYTE as an example base type that is least restrictive
-// as to alignment, which will therefore produce the smallest
-// possible base offset.
-const int min_base_off = arrayOopDesc::base_offset_in_bytes(T_BYTE);
-if ((uint)off >= (uint)min_base_off) {  // is the offset beyond the header?
 const Type* jt = t->join(_type);
 // In any case, do not allow the join, per se, to empty out the type.
 if (jt->empty() && !t->empty()) {
 // This can happen if a interface-typed array narrows to a class type.
 jt = _type;
 // sanity check the alias category against the created node type
 const TypePtr *adr_type = adr->bottom_type()->isa_ptr();
 assert(adr_type != NULL, "expecting TypeKlassPtr");
 #ifdef _LP64
 if (adr_type->is_ptr_to_narrowklass()) {
-assert(UseCompressedKlassPointers, "no compressed klasses");
+assert(UseCompressedClassPointers, "no compressed klasses");
 Node* load_klass = gvn.transform(new (C) LoadNKlassNode(ctl, mem, adr, at, tk->make_narrowklass()));
 return new (C) DecodeNKlassNode(load_klass, load_klass->bottom_type()->make_ptr());
 }
 #endif
 assert(!adr_type->is_ptr_to_narrowklass() && !adr_type->is_ptr_to_narrowoop(), "should have got back a narrow oop");
 #ifdef _LP64
 if (adr->bottom_type()->is_ptr_to_narrowoop()) {
 val = gvn.transform(new (C) EncodePNode(val, val->bottom_type()->make_narrowoop()));
 return new (C) StoreNNode(ctl, mem, adr, adr_type, val);
 } else if (adr->bottom_type()->is_ptr_to_narrowklass() ||
-(UseCompressedKlassPointers && val->bottom_type()->isa_klassptr() &&
+(UseCompressedClassPointers && val->bottom_type()->isa_klassptr() &&
 adr->bottom_type()->isa_rawptr())) {
 val = gvn.transform(new (C) EncodePKlassNode(val, val->bottom_type()->make_narrowklass()));
 return new (C) StoreNKlassNode(ctl, mem, adr, adr_type, val);
 }
 #endif

Mercurial > hg > truffle

comparison src/share/vm/opto/memnode.cpp @ 12355:cefad50507d8