Mercurial > hg > truffle
annotate src/share/vm/opto/memnode.hpp @ 14429:2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
Summary: Add a field to C2 LoadNode and StoreNode classes which indicates whether the load/store should do an acquire/release on platforms which support it.
Reviewed-by: kvn
| author | goetz |
|---|---|
| date | Fri, 15 Nov 2013 11:05:32 -0800 |
| parents | 6f3fd5150b67 |
| children | da862781b584 |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
6842
b9a9ed0f8eeb
7197424: update copyright year to match last edit in jdk8 hotspot repository
mikael
parents:
6795
diff
changeset
|
2 * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
| 0 | 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 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1367
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1367
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1367
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 1972 | 25 #ifndef SHARE_VM_OPTO_MEMNODE_HPP |
| 26 #define SHARE_VM_OPTO_MEMNODE_HPP | |
| 27 | |
| 28 #include "opto/multnode.hpp" | |
| 29 #include "opto/node.hpp" | |
| 30 #include "opto/opcodes.hpp" | |
| 31 #include "opto/type.hpp" | |
| 32 | |
| 0 | 33 // Portions of code courtesy of Clifford Click |
| 34 | |
| 35 class MultiNode; | |
| 36 class PhaseCCP; | |
| 37 class PhaseTransform; | |
| 38 | |
| 39 //------------------------------MemNode---------------------------------------- | |
| 40 // Load or Store, possibly throwing a NULL pointer exception | |
| 41 class MemNode : public Node { | |
| 42 protected: | |
| 43 #ifdef ASSERT | |
| 44 const TypePtr* _adr_type; // What kind of memory is being addressed? | |
| 45 #endif | |
| 46 virtual uint size_of() const; // Size is bigger (ASSERT only) | |
| 47 public: | |
| 48 enum { Control, // When is it safe to do this load? | |
| 49 Memory, // Chunk of memory is being loaded from | |
| 50 Address, // Actually address, derived from base | |
| 51 ValueIn, // Value to store | |
| 52 OopStore // Preceeding oop store, only in StoreCM | |
| 53 }; | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
54 typedef enum { unordered = 0, |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
55 acquire, // Load has to acquire or be succeeded by MemBarAcquire. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
56 release // Store has to release or be preceded by MemBarRelease. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
57 } MemOrd; |
| 0 | 58 protected: |
| 59 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at ) | |
| 60 : Node(c0,c1,c2 ) { | |
| 61 init_class_id(Class_Mem); | |
| 62 debug_only(_adr_type=at; adr_type();) | |
| 63 } | |
| 64 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at, Node *c3 ) | |
| 65 : Node(c0,c1,c2,c3) { | |
| 66 init_class_id(Class_Mem); | |
| 67 debug_only(_adr_type=at; adr_type();) | |
| 68 } | |
| 69 MemNode( Node *c0, Node *c1, Node *c2, const TypePtr* at, Node *c3, Node *c4) | |
| 70 : Node(c0,c1,c2,c3,c4) { | |
| 71 init_class_id(Class_Mem); | |
| 72 debug_only(_adr_type=at; adr_type();) | |
| 73 } | |
| 74 | |
| 33 | 75 public: |
| 0 | 76 // Helpers for the optimizer. Documented in memnode.cpp. |
| 77 static bool detect_ptr_independence(Node* p1, AllocateNode* a1, | |
| 78 Node* p2, AllocateNode* a2, | |
| 79 PhaseTransform* phase); | |
| 80 static bool adr_phi_is_loop_invariant(Node* adr_phi, Node* cast); | |
| 81 | |
| 10278 | 82 static Node *optimize_simple_memory_chain(Node *mchain, const TypeOopPtr *t_oop, Node *load, PhaseGVN *phase); |
| 83 static Node *optimize_memory_chain(Node *mchain, const TypePtr *t_adr, Node *load, PhaseGVN *phase); | |
| 0 | 84 // This one should probably be a phase-specific function: |
|
85
f3b3fe64f59f
6692301: Side effect in NumberFormat tests with -server -Xcomp
kvn
parents:
74
diff
changeset
|
85 static bool all_controls_dominate(Node* dom, Node* sub); |
| 0 | 86 |
| 163 | 87 // Find any cast-away of null-ness and keep its control. |
| 88 static Node *Ideal_common_DU_postCCP( PhaseCCP *ccp, Node* n, Node* adr ); | |
| 0 | 89 virtual Node *Ideal_DU_postCCP( PhaseCCP *ccp ); |
| 90 | |
| 91 virtual const class TypePtr *adr_type() const; // returns bottom_type of address | |
| 92 | |
| 93 // Shared code for Ideal methods: | |
| 94 Node *Ideal_common(PhaseGVN *phase, bool can_reshape); // Return -1 for short-circuit NULL. | |
| 95 | |
| 96 // Helper function for adr_type() implementations. | |
| 97 static const TypePtr* calculate_adr_type(const Type* t, const TypePtr* cross_check = NULL); | |
| 98 | |
| 99 // Raw access function, to allow copying of adr_type efficiently in | |
| 100 // product builds and retain the debug info for debug builds. | |
| 101 const TypePtr *raw_adr_type() const { | |
| 102 #ifdef ASSERT | |
| 103 return _adr_type; | |
| 104 #else | |
| 105 return 0; | |
| 106 #endif | |
| 107 } | |
| 108 | |
| 109 // Map a load or store opcode to its corresponding store opcode. | |
| 110 // (Return -1 if unknown.) | |
| 111 virtual int store_Opcode() const { return -1; } | |
| 112 | |
| 113 // What is the type of the value in memory? (T_VOID mean "unspecified".) | |
| 114 virtual BasicType memory_type() const = 0; | |
|
29
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
115 virtual int memory_size() const { |
|
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
116 #ifdef ASSERT |
|
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
117 return type2aelembytes(memory_type(), true); |
|
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
118 #else |
|
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
119 return type2aelembytes(memory_type()); |
|
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
120 #endif |
|
d5fc211aea19
6633953: type2aelembytes{T_ADDRESS} should be 8 bytes in 64 bit VM
kvn
parents:
17
diff
changeset
|
121 } |
| 0 | 122 |
| 123 // Search through memory states which precede this node (load or store). | |
| 124 // Look for an exact match for the address, with no intervening | |
| 125 // aliased stores. | |
| 126 Node* find_previous_store(PhaseTransform* phase); | |
| 127 | |
| 128 // Can this node (load or store) accurately see a stored value in | |
| 129 // the given memory state? (The state may or may not be in(Memory).) | |
| 130 Node* can_see_stored_value(Node* st, PhaseTransform* phase) const; | |
| 131 | |
| 132 #ifndef PRODUCT | |
| 133 static void dump_adr_type(const Node* mem, const TypePtr* adr_type, outputStream *st); | |
| 134 virtual void dump_spec(outputStream *st) const; | |
| 135 #endif | |
| 136 }; | |
| 137 | |
| 138 //------------------------------LoadNode--------------------------------------- | |
| 139 // Load value; requires Memory and Address | |
| 140 class LoadNode : public MemNode { | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
141 private: |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
142 // On platforms with weak memory ordering (e.g., PPC, Ia64) we distinguish |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
143 // loads that can be reordered, and such requiring acquire semantics to |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
144 // adhere to the Java specification. The required behaviour is stored in |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
145 // this field. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
146 const MemOrd _mo; |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
147 |
| 0 | 148 protected: |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
149 virtual uint cmp(const Node &n) const; |
| 0 | 150 virtual uint size_of() const; // Size is bigger |
| 151 const Type* const _type; // What kind of value is loaded? | |
| 152 public: | |
| 153 | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
154 LoadNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *rt, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
155 : MemNode(c,mem,adr,at), _type(rt), _mo(mo) { |
| 0 | 156 init_class_id(Class_Load); |
| 157 } | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
158 inline bool is_unordered() const { return !is_acquire(); } |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
159 inline bool is_acquire() const { |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
160 assert(_mo == unordered || _mo == acquire, "unexpected"); |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
161 return _mo == acquire; |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
162 } |
| 0 | 163 |
| 164 // Polymorphic factory method: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
165 static Node* make(PhaseGVN& gvn, Node *c, Node *mem, Node *adr, |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
166 const TypePtr* at, const Type *rt, BasicType bt, MemOrd mo); |
| 0 | 167 |
| 168 virtual uint hash() const; // Check the type | |
| 169 | |
| 170 // Handle algebraic identities here. If we have an identity, return the Node | |
| 171 // we are equivalent to. We look for Load of a Store. | |
| 172 virtual Node *Identity( PhaseTransform *phase ); | |
| 173 | |
| 174 // If the load is from Field memory and the pointer is non-null, we can | |
| 175 // zero out the control input. | |
| 176 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 177 | |
| 163 | 178 // Split instance field load through Phi. |
| 179 Node* split_through_phi(PhaseGVN *phase); | |
| 180 | |
|
17
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
181 // Recover original value from boxed values |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
182 Node *eliminate_autobox(PhaseGVN *phase); |
|
ff5961f4c095
6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents:
0
diff
changeset
|
183 |
| 0 | 184 // Compute a new Type for this node. Basically we just do the pre-check, |
| 185 // then call the virtual add() to set the type. | |
| 186 virtual const Type *Value( PhaseTransform *phase ) const; | |
| 187 | |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
188 // Common methods for LoadKlass and LoadNKlass nodes. |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
189 const Type *klass_value_common( PhaseTransform *phase ) const; |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
190 Node *klass_identity_common( PhaseTransform *phase ); |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
191 |
| 0 | 192 virtual uint ideal_reg() const; |
| 193 virtual const Type *bottom_type() const; | |
| 194 // Following method is copied from TypeNode: | |
| 195 void set_type(const Type* t) { | |
| 196 assert(t != NULL, "sanity"); | |
| 197 debug_only(uint check_hash = (VerifyHashTableKeys && _hash_lock) ? hash() : NO_HASH); | |
| 198 *(const Type**)&_type = t; // cast away const-ness | |
| 199 // If this node is in the hash table, make sure it doesn't need a rehash. | |
| 200 assert(check_hash == NO_HASH || check_hash == hash(), "type change must preserve hash code"); | |
| 201 } | |
| 202 const Type* type() const { assert(_type != NULL, "sanity"); return _type; }; | |
| 203 | |
| 204 // Do not match memory edge | |
| 205 virtual uint match_edge(uint idx) const; | |
| 206 | |
| 207 // Map a load opcode to its corresponding store opcode. | |
| 208 virtual int store_Opcode() const = 0; | |
| 209 | |
|
64
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
33
diff
changeset
|
210 // Check if the load's memory input is a Phi node with the same control. |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
33
diff
changeset
|
211 bool is_instance_field_load_with_local_phi(Node* ctrl); |
|
b8f5ba577b02
6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents:
33
diff
changeset
|
212 |
| 0 | 213 #ifndef PRODUCT |
| 214 virtual void dump_spec(outputStream *st) const; | |
| 215 #endif | |
| 1609 | 216 #ifdef ASSERT |
| 217 // Helper function to allow a raw load without control edge for some cases | |
| 218 static bool is_immutable_value(Node* adr); | |
| 219 #endif | |
| 0 | 220 protected: |
| 221 const Type* load_array_final_field(const TypeKlassPtr *tkls, | |
| 222 ciKlass* klass) const; | |
| 223 }; | |
| 224 | |
| 225 //------------------------------LoadBNode-------------------------------------- | |
| 226 // Load a byte (8bits signed) from memory | |
| 227 class LoadBNode : public LoadNode { | |
| 228 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
229 LoadBNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
230 : LoadNode(c, mem, adr, at, ti, mo) {} |
| 0 | 231 virtual int Opcode() const; |
| 232 virtual uint ideal_reg() const { return Op_RegI; } | |
| 233 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 4815 | 234 virtual const Type *Value(PhaseTransform *phase) const; |
| 0 | 235 virtual int store_Opcode() const { return Op_StoreB; } |
| 236 virtual BasicType memory_type() const { return T_BYTE; } | |
| 237 }; | |
| 238 | |
| 624 | 239 //------------------------------LoadUBNode------------------------------------- |
| 240 // Load a unsigned byte (8bits unsigned) from memory | |
| 241 class LoadUBNode : public LoadNode { | |
| 242 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
243 LoadUBNode(Node* c, Node* mem, Node* adr, const TypePtr* at, const TypeInt* ti, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
244 : LoadNode(c, mem, adr, at, ti, mo) {} |
| 624 | 245 virtual int Opcode() const; |
| 246 virtual uint ideal_reg() const { return Op_RegI; } | |
| 247 virtual Node* Ideal(PhaseGVN *phase, bool can_reshape); | |
| 4815 | 248 virtual const Type *Value(PhaseTransform *phase) const; |
| 624 | 249 virtual int store_Opcode() const { return Op_StoreB; } |
| 250 virtual BasicType memory_type() const { return T_BYTE; } | |
| 251 }; | |
| 252 | |
|
558
3b5ac9e7e6ea
6796746: rename LoadC (char) opcode class to LoadUS (unsigned short)
twisti
parents:
420
diff
changeset
|
253 //------------------------------LoadUSNode------------------------------------- |
|
3b5ac9e7e6ea
6796746: rename LoadC (char) opcode class to LoadUS (unsigned short)
twisti
parents:
420
diff
changeset
|
254 // Load an unsigned short/char (16bits unsigned) from memory |
|
3b5ac9e7e6ea
6796746: rename LoadC (char) opcode class to LoadUS (unsigned short)
twisti
parents:
420
diff
changeset
|
255 class LoadUSNode : public LoadNode { |
| 0 | 256 public: |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
257 LoadUSNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
258 : LoadNode(c, mem, adr, at, ti, mo) {} |
| 0 | 259 virtual int Opcode() const; |
| 260 virtual uint ideal_reg() const { return Op_RegI; } | |
| 261 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 4815 | 262 virtual const Type *Value(PhaseTransform *phase) const; |
| 0 | 263 virtual int store_Opcode() const { return Op_StoreC; } |
| 264 virtual BasicType memory_type() const { return T_CHAR; } | |
| 265 }; | |
| 266 | |
| 4815 | 267 //------------------------------LoadSNode-------------------------------------- |
| 268 // Load a short (16bits signed) from memory | |
| 269 class LoadSNode : public LoadNode { | |
| 270 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
271 LoadSNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
272 : LoadNode(c, mem, adr, at, ti, mo) {} |
| 4815 | 273 virtual int Opcode() const; |
| 274 virtual uint ideal_reg() const { return Op_RegI; } | |
| 275 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 276 virtual const Type *Value(PhaseTransform *phase) const; | |
| 277 virtual int store_Opcode() const { return Op_StoreC; } | |
| 278 virtual BasicType memory_type() const { return T_SHORT; } | |
| 279 }; | |
| 280 | |
| 0 | 281 //------------------------------LoadINode-------------------------------------- |
| 282 // Load an integer from memory | |
| 283 class LoadINode : public LoadNode { | |
| 284 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
285 LoadINode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeInt *ti, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
286 : LoadNode(c, mem, adr, at, ti, mo) {} |
| 0 | 287 virtual int Opcode() const; |
| 288 virtual uint ideal_reg() const { return Op_RegI; } | |
| 289 virtual int store_Opcode() const { return Op_StoreI; } | |
| 290 virtual BasicType memory_type() const { return T_INT; } | |
| 291 }; | |
| 292 | |
| 293 //------------------------------LoadRangeNode---------------------------------- | |
| 294 // Load an array length from the array | |
| 295 class LoadRangeNode : public LoadINode { | |
| 296 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
297 LoadRangeNode(Node *c, Node *mem, Node *adr, const TypeInt *ti = TypeInt::POS) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
298 : LoadINode(c, mem, adr, TypeAryPtr::RANGE, ti, MemNode::unordered) {} |
| 0 | 299 virtual int Opcode() const; |
| 300 virtual const Type *Value( PhaseTransform *phase ) const; | |
| 301 virtual Node *Identity( PhaseTransform *phase ); | |
|
366
8261ee795323
6711100: 64bit fastdebug server vm crashes with assert(_base == Int,"Not an Int")
rasbold
parents:
253
diff
changeset
|
302 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); |
| 0 | 303 }; |
| 304 | |
| 305 //------------------------------LoadLNode-------------------------------------- | |
| 306 // Load a long from memory | |
| 307 class LoadLNode : public LoadNode { | |
| 308 virtual uint hash() const { return LoadNode::hash() + _require_atomic_access; } | |
| 309 virtual uint cmp( const Node &n ) const { | |
| 310 return _require_atomic_access == ((LoadLNode&)n)._require_atomic_access | |
| 311 && LoadNode::cmp(n); | |
| 312 } | |
| 313 virtual uint size_of() const { return sizeof(*this); } | |
| 314 const bool _require_atomic_access; // is piecewise load forbidden? | |
| 315 | |
| 316 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
317 LoadLNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const TypeLong *tl, |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
318 MemOrd mo, bool require_atomic_access = false) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
319 : LoadNode(c, mem, adr, at, tl, mo), _require_atomic_access(require_atomic_access) {} |
| 0 | 320 virtual int Opcode() const; |
| 321 virtual uint ideal_reg() const { return Op_RegL; } | |
| 322 virtual int store_Opcode() const { return Op_StoreL; } | |
| 323 virtual BasicType memory_type() const { return T_LONG; } | |
| 324 bool require_atomic_access() { return _require_atomic_access; } | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
325 static LoadLNode* make_atomic(Compile *C, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
326 const Type* rt, MemOrd mo); |
| 0 | 327 #ifndef PRODUCT |
| 328 virtual void dump_spec(outputStream *st) const { | |
| 329 LoadNode::dump_spec(st); | |
| 330 if (_require_atomic_access) st->print(" Atomic!"); | |
| 331 } | |
| 332 #endif | |
| 333 }; | |
| 334 | |
| 335 //------------------------------LoadL_unalignedNode---------------------------- | |
| 336 // Load a long from unaligned memory | |
| 337 class LoadL_unalignedNode : public LoadLNode { | |
| 338 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
339 LoadL_unalignedNode(Node *c, Node *mem, Node *adr, const TypePtr* at, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
340 : LoadLNode(c, mem, adr, at, TypeLong::LONG, mo) {} |
| 0 | 341 virtual int Opcode() const; |
| 342 }; | |
| 343 | |
| 344 //------------------------------LoadFNode-------------------------------------- | |
| 345 // Load a float (64 bits) from memory | |
| 346 class LoadFNode : public LoadNode { | |
| 347 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
348 LoadFNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *t, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
349 : LoadNode(c, mem, adr, at, t, mo) {} |
| 0 | 350 virtual int Opcode() const; |
| 351 virtual uint ideal_reg() const { return Op_RegF; } | |
| 352 virtual int store_Opcode() const { return Op_StoreF; } | |
| 353 virtual BasicType memory_type() const { return T_FLOAT; } | |
| 354 }; | |
| 355 | |
| 356 //------------------------------LoadDNode-------------------------------------- | |
| 357 // Load a double (64 bits) from memory | |
| 358 class LoadDNode : public LoadNode { | |
| 359 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
360 LoadDNode(Node *c, Node *mem, Node *adr, const TypePtr* at, const Type *t, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
361 : LoadNode(c, mem, adr, at, t, mo) {} |
| 0 | 362 virtual int Opcode() const; |
| 363 virtual uint ideal_reg() const { return Op_RegD; } | |
| 364 virtual int store_Opcode() const { return Op_StoreD; } | |
| 365 virtual BasicType memory_type() const { return T_DOUBLE; } | |
| 366 }; | |
| 367 | |
| 368 //------------------------------LoadD_unalignedNode---------------------------- | |
| 369 // Load a double from unaligned memory | |
| 370 class LoadD_unalignedNode : public LoadDNode { | |
| 371 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
372 LoadD_unalignedNode(Node *c, Node *mem, Node *adr, const TypePtr* at, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
373 : LoadDNode(c, mem, adr, at, Type::DOUBLE, mo) {} |
| 0 | 374 virtual int Opcode() const; |
| 375 }; | |
| 376 | |
| 377 //------------------------------LoadPNode-------------------------------------- | |
| 378 // Load a pointer from memory (either object or array) | |
| 379 class LoadPNode : public LoadNode { | |
| 380 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
381 LoadPNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const TypePtr* t, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
382 : LoadNode(c, mem, adr, at, t, mo) {} |
| 0 | 383 virtual int Opcode() const; |
| 384 virtual uint ideal_reg() const { return Op_RegP; } | |
| 385 virtual int store_Opcode() const { return Op_StoreP; } | |
| 386 virtual BasicType memory_type() const { return T_ADDRESS; } | |
| 387 // depends_only_on_test is almost always true, and needs to be almost always | |
| 388 // true to enable key hoisting & commoning optimizations. However, for the | |
| 389 // special case of RawPtr loads from TLS top & end, the control edge carries | |
| 390 // the dependence preventing hoisting past a Safepoint instead of the memory | |
| 391 // edge. (An unfortunate consequence of having Safepoints not set Raw | |
| 392 // Memory; itself an unfortunate consequence of having Nodes which produce | |
| 393 // results (new raw memory state) inside of loops preventing all manner of | |
| 394 // other optimizations). Basically, it's ugly but so is the alternative. | |
| 395 // See comment in macro.cpp, around line 125 expand_allocate_common(). | |
| 396 virtual bool depends_only_on_test() const { return adr_type() != TypeRawPtr::BOTTOM; } | |
| 397 }; | |
| 398 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
399 |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
400 //------------------------------LoadNNode-------------------------------------- |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
401 // Load a narrow oop from memory (either object or array) |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
402 class LoadNNode : public LoadNode { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
403 public: |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
404 LoadNNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const Type* t, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
405 : LoadNode(c, mem, adr, at, t, mo) {} |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
406 virtual int Opcode() const; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
407 virtual uint ideal_reg() const { return Op_RegN; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
408 virtual int store_Opcode() const { return Op_StoreN; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
409 virtual BasicType memory_type() const { return T_NARROWOOP; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
410 // depends_only_on_test is almost always true, and needs to be almost always |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
411 // true to enable key hoisting & commoning optimizations. However, for the |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
412 // special case of RawPtr loads from TLS top & end, the control edge carries |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
413 // the dependence preventing hoisting past a Safepoint instead of the memory |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
414 // edge. (An unfortunate consequence of having Safepoints not set Raw |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
415 // Memory; itself an unfortunate consequence of having Nodes which produce |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
416 // results (new raw memory state) inside of loops preventing all manner of |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
417 // other optimizations). Basically, it's ugly but so is the alternative. |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
418 // See comment in macro.cpp, around line 125 expand_allocate_common(). |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
419 virtual bool depends_only_on_test() const { return adr_type() != TypeRawPtr::BOTTOM; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
420 }; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
421 |
| 0 | 422 //------------------------------LoadKlassNode---------------------------------- |
| 423 // Load a Klass from an object | |
| 424 class LoadKlassNode : public LoadPNode { | |
| 425 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
426 LoadKlassNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const TypeKlassPtr *tk, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
427 : LoadPNode(c, mem, adr, at, tk, mo) {} |
| 0 | 428 virtual int Opcode() const; |
| 429 virtual const Type *Value( PhaseTransform *phase ) const; | |
| 430 virtual Node *Identity( PhaseTransform *phase ); | |
| 431 virtual bool depends_only_on_test() const { return true; } | |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
432 |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
433 // Polymorphic factory method: |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
434 static Node* make( PhaseGVN& gvn, Node *mem, Node *adr, const TypePtr* at, |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
435 const TypeKlassPtr *tk = TypeKlassPtr::OBJECT ); |
| 0 | 436 }; |
| 437 | |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
438 //------------------------------LoadNKlassNode--------------------------------- |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
439 // Load a narrow Klass from an object. |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
440 class LoadNKlassNode : public LoadNNode { |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
441 public: |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
442 LoadNKlassNode(Node *c, Node *mem, Node *adr, const TypePtr *at, const TypeNarrowKlass *tk, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
443 : LoadNNode(c, mem, adr, at, tk, mo) {} |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
444 virtual int Opcode() const; |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
445 virtual uint ideal_reg() const { return Op_RegN; } |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
446 virtual int store_Opcode() const { return Op_StoreNKlass; } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
447 virtual BasicType memory_type() const { return T_NARROWKLASS; } |
|
164
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
448 |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
449 virtual const Type *Value( PhaseTransform *phase ) const; |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
450 virtual Node *Identity( PhaseTransform *phase ); |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
451 virtual bool depends_only_on_test() const { return true; } |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
452 }; |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
453 |
|
c436414a719e
6703890: Compressed Oops: add LoadNKlass node to generate narrow oops (32-bits) compare instructions
kvn
parents:
163
diff
changeset
|
454 |
| 0 | 455 //------------------------------StoreNode-------------------------------------- |
| 456 // Store value; requires Store, Address and Value | |
| 457 class StoreNode : public MemNode { | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
458 private: |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
459 // On platforms with weak memory ordering (e.g., PPC, Ia64) we distinguish |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
460 // stores that can be reordered, and such requiring release semantics to |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
461 // adhere to the Java specification. The required behaviour is stored in |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
462 // this field. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
463 const MemOrd _mo; |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
464 // Needed for proper cloning. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
465 virtual uint size_of() const { return sizeof(*this); } |
| 0 | 466 protected: |
| 467 virtual uint cmp( const Node &n ) const; | |
| 468 virtual bool depends_only_on_test() const { return false; } | |
| 469 | |
| 470 Node *Ideal_masked_input (PhaseGVN *phase, uint mask); | |
| 471 Node *Ideal_sign_extended_input(PhaseGVN *phase, int num_bits); | |
| 472 | |
| 473 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
474 // We must ensure that stores of object references will be visible |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
475 // only after the object's initialization. So the callers of this |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
476 // procedure must indicate that the store requires `release' |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
477 // semantics, if the stored value is an object reference that might |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
478 // point to a new object and may become externally visible. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
479 StoreNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
480 : MemNode(c, mem, adr, at, val), _mo(mo) { |
| 0 | 481 init_class_id(Class_Store); |
| 482 } | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
483 StoreNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, Node *oop_store, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
484 : MemNode(c, mem, adr, at, val, oop_store), _mo(mo) { |
| 0 | 485 init_class_id(Class_Store); |
| 486 } | |
| 487 | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
488 inline bool is_unordered() const { return !is_release(); } |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
489 inline bool is_release() const { |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
490 assert((_mo == unordered || _mo == release), "unexpected"); |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
491 return _mo == release; |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
492 } |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
493 |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
494 // Conservatively release stores of object references in order to |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
495 // ensure visibility of object initialization. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
496 static inline MemOrd release_if_reference(const BasicType t) { |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
497 const MemOrd mo = (t == T_ARRAY || |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
498 t == T_ADDRESS || // Might be the address of an object reference (`boxing'). |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
499 t == T_OBJECT) ? release : unordered; |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
500 return mo; |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
501 } |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
502 |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
503 // Polymorphic factory method |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
504 // |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
505 // We must ensure that stores of object references will be visible |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
506 // only after the object's initialization. So the callers of this |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
507 // procedure must indicate that the store requires `release' |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
508 // semantics, if the stored value is an object reference that might |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
509 // point to a new object and may become externally visible. |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
510 static StoreNode* make(PhaseGVN& gvn, Node *c, Node *mem, Node *adr, |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
511 const TypePtr* at, Node *val, BasicType bt, MemOrd mo); |
| 0 | 512 |
| 513 virtual uint hash() const; // Check the type | |
| 514 | |
| 515 // If the store is to Field memory and the pointer is non-null, we can | |
| 516 // zero out the control input. | |
| 517 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 518 | |
| 519 // Compute a new Type for this node. Basically we just do the pre-check, | |
| 520 // then call the virtual add() to set the type. | |
| 521 virtual const Type *Value( PhaseTransform *phase ) const; | |
| 522 | |
| 523 // Check for identity function on memory (Load then Store at same address) | |
| 524 virtual Node *Identity( PhaseTransform *phase ); | |
| 525 | |
| 526 // Do not match memory edge | |
| 527 virtual uint match_edge(uint idx) const; | |
| 528 | |
| 529 virtual const Type *bottom_type() const; // returns Type::MEMORY | |
| 530 | |
| 531 // Map a store opcode to its corresponding own opcode, trivially. | |
| 532 virtual int store_Opcode() const { return Opcode(); } | |
| 533 | |
| 534 // have all possible loads of the value stored been optimized away? | |
| 535 bool value_never_loaded(PhaseTransform *phase) const; | |
| 536 }; | |
| 537 | |
| 538 //------------------------------StoreBNode------------------------------------- | |
| 539 // Store byte to memory | |
| 540 class StoreBNode : public StoreNode { | |
| 541 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
542 StoreBNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
543 : StoreNode(c, mem, adr, at, val, mo) {} |
| 0 | 544 virtual int Opcode() const; |
| 545 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 546 virtual BasicType memory_type() const { return T_BYTE; } | |
| 547 }; | |
| 548 | |
| 549 //------------------------------StoreCNode------------------------------------- | |
| 550 // Store char/short to memory | |
| 551 class StoreCNode : public StoreNode { | |
| 552 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
553 StoreCNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
554 : StoreNode(c, mem, adr, at, val, mo) {} |
| 0 | 555 virtual int Opcode() const; |
| 556 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 557 virtual BasicType memory_type() const { return T_CHAR; } | |
| 558 }; | |
| 559 | |
| 560 //------------------------------StoreINode------------------------------------- | |
| 561 // Store int to memory | |
| 562 class StoreINode : public StoreNode { | |
| 563 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
564 StoreINode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
565 : StoreNode(c, mem, adr, at, val, mo) {} |
| 0 | 566 virtual int Opcode() const; |
| 567 virtual BasicType memory_type() const { return T_INT; } | |
| 568 }; | |
| 569 | |
| 570 //------------------------------StoreLNode------------------------------------- | |
| 571 // Store long to memory | |
| 572 class StoreLNode : public StoreNode { | |
| 573 virtual uint hash() const { return StoreNode::hash() + _require_atomic_access; } | |
| 574 virtual uint cmp( const Node &n ) const { | |
| 575 return _require_atomic_access == ((StoreLNode&)n)._require_atomic_access | |
| 576 && StoreNode::cmp(n); | |
| 577 } | |
| 578 virtual uint size_of() const { return sizeof(*this); } | |
| 579 const bool _require_atomic_access; // is piecewise store forbidden? | |
| 580 | |
| 581 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
582 StoreLNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo, bool require_atomic_access = false) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
583 : StoreNode(c, mem, adr, at, val, mo), _require_atomic_access(require_atomic_access) {} |
| 0 | 584 virtual int Opcode() const; |
| 585 virtual BasicType memory_type() const { return T_LONG; } | |
| 586 bool require_atomic_access() { return _require_atomic_access; } | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
587 static StoreLNode* make_atomic(Compile *C, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, MemOrd mo); |
| 0 | 588 #ifndef PRODUCT |
| 589 virtual void dump_spec(outputStream *st) const { | |
| 590 StoreNode::dump_spec(st); | |
| 591 if (_require_atomic_access) st->print(" Atomic!"); | |
| 592 } | |
| 593 #endif | |
| 594 }; | |
| 595 | |
| 596 //------------------------------StoreFNode------------------------------------- | |
| 597 // Store float to memory | |
| 598 class StoreFNode : public StoreNode { | |
| 599 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
600 StoreFNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
601 : StoreNode(c, mem, adr, at, val, mo) {} |
| 0 | 602 virtual int Opcode() const; |
| 603 virtual BasicType memory_type() const { return T_FLOAT; } | |
| 604 }; | |
| 605 | |
| 606 //------------------------------StoreDNode------------------------------------- | |
| 607 // Store double to memory | |
| 608 class StoreDNode : public StoreNode { | |
| 609 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
610 StoreDNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
611 : StoreNode(c, mem, adr, at, val, mo) {} |
| 0 | 612 virtual int Opcode() const; |
| 613 virtual BasicType memory_type() const { return T_DOUBLE; } | |
| 614 }; | |
| 615 | |
| 616 //------------------------------StorePNode------------------------------------- | |
| 617 // Store pointer to memory | |
| 618 class StorePNode : public StoreNode { | |
| 619 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
620 StorePNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
621 : StoreNode(c, mem, adr, at, val, mo) {} |
| 0 | 622 virtual int Opcode() const; |
| 623 virtual BasicType memory_type() const { return T_ADDRESS; } | |
| 624 }; | |
| 625 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
626 //------------------------------StoreNNode------------------------------------- |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
627 // Store narrow oop to memory |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
628 class StoreNNode : public StoreNode { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
629 public: |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
630 StoreNNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
631 : StoreNode(c, mem, adr, at, val, mo) {} |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
632 virtual int Opcode() const; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
633 virtual BasicType memory_type() const { return T_NARROWOOP; } |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
634 }; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
635 |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
636 //------------------------------StoreNKlassNode-------------------------------------- |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
637 // Store narrow klass to memory |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
638 class StoreNKlassNode : public StoreNNode { |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
639 public: |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
640 StoreNKlassNode(Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
641 : StoreNNode(c, mem, adr, at, val, mo) {} |
|
6848
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
642 virtual int Opcode() const; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
643 virtual BasicType memory_type() const { return T_NARROWKLASS; } |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
644 }; |
|
8e47bac5643a
7054512: Compress class pointers after perm gen removal
roland
parents:
6795
diff
changeset
|
645 |
| 0 | 646 //------------------------------StoreCMNode----------------------------------- |
| 647 // Store card-mark byte to memory for CM | |
| 648 // The last StoreCM before a SafePoint must be preserved and occur after its "oop" store | |
| 649 // Preceeding equivalent StoreCMs may be eliminated. | |
| 650 class StoreCMNode : public StoreNode { | |
|
985
685e959d09ea
6877254: Server vm crashes with no branches off of store slice" when run with CMS and UseSuperWord(default)
cfang
parents:
681
diff
changeset
|
651 private: |
|
1198
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
652 virtual uint hash() const { return StoreNode::hash() + _oop_alias_idx; } |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
653 virtual uint cmp( const Node &n ) const { |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
654 return _oop_alias_idx == ((StoreCMNode&)n)._oop_alias_idx |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
655 && StoreNode::cmp(n); |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
656 } |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
657 virtual uint size_of() const { return sizeof(*this); } |
|
985
685e959d09ea
6877254: Server vm crashes with no branches off of store slice" when run with CMS and UseSuperWord(default)
cfang
parents:
681
diff
changeset
|
658 int _oop_alias_idx; // The alias_idx of OopStore |
|
1198
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
659 |
| 0 | 660 public: |
|
1198
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
661 StoreCMNode( Node *c, Node *mem, Node *adr, const TypePtr* at, Node *val, Node *oop_store, int oop_alias_idx ) : |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
662 StoreNode(c, mem, adr, at, val, oop_store, MemNode::release), |
|
1198
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
663 _oop_alias_idx(oop_alias_idx) { |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
664 assert(_oop_alias_idx >= Compile::AliasIdxRaw || |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
665 _oop_alias_idx == Compile::AliasIdxBot && Compile::current()->AliasLevel() == 0, |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
666 "bad oop alias idx"); |
|
8d9bfe6a446b
6920346: G1: "must avoid base_memory and AliasIdxTop"
never
parents:
1100
diff
changeset
|
667 } |
| 0 | 668 virtual int Opcode() const; |
| 669 virtual Node *Identity( PhaseTransform *phase ); | |
|
985
685e959d09ea
6877254: Server vm crashes with no branches off of store slice" when run with CMS and UseSuperWord(default)
cfang
parents:
681
diff
changeset
|
670 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); |
| 0 | 671 virtual const Type *Value( PhaseTransform *phase ) const; |
| 672 virtual BasicType memory_type() const { return T_VOID; } // unspecific | |
|
985
685e959d09ea
6877254: Server vm crashes with no branches off of store slice" when run with CMS and UseSuperWord(default)
cfang
parents:
681
diff
changeset
|
673 int oop_alias_idx() const { return _oop_alias_idx; } |
| 0 | 674 }; |
| 675 | |
| 676 //------------------------------LoadPLockedNode--------------------------------- | |
| 677 // Load-locked a pointer from memory (either object or array). | |
| 678 // On Sparc & Intel this is implemented as a normal pointer load. | |
| 679 // On PowerPC and friends it's a real load-locked. | |
| 680 class LoadPLockedNode : public LoadPNode { | |
| 681 public: | |
|
14429
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
682 LoadPLockedNode(Node *c, Node *mem, Node *adr, MemOrd mo) |
|
2113136690bc
8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering
goetz
parents:
10278
diff
changeset
|
683 : LoadPNode(c, mem, adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM, mo) {} |
| 0 | 684 virtual int Opcode() const; |
| 685 virtual int store_Opcode() const { return Op_StorePConditional; } | |
| 686 virtual bool depends_only_on_test() const { return true; } | |
| 687 }; | |
| 688 | |
| 689 //------------------------------SCMemProjNode--------------------------------------- | |
| 690 // This class defines a projection of the memory state of a store conditional node. | |
| 691 // These nodes return a value, but also update memory. | |
| 692 class SCMemProjNode : public ProjNode { | |
| 693 public: | |
| 694 enum {SCMEMPROJCON = (uint)-2}; | |
| 695 SCMemProjNode( Node *src) : ProjNode( src, SCMEMPROJCON) { } | |
| 696 virtual int Opcode() const; | |
| 697 virtual bool is_CFG() const { return false; } | |
| 698 virtual const Type *bottom_type() const {return Type::MEMORY;} | |
| 699 virtual const TypePtr *adr_type() const { return in(0)->in(MemNode::Memory)->adr_type();} | |
| 700 virtual uint ideal_reg() const { return 0;} // memory projections don't have a register | |
| 701 virtual const Type *Value( PhaseTransform *phase ) const; | |
| 702 #ifndef PRODUCT | |
| 703 virtual void dump_spec(outputStream *st) const {}; | |
| 704 #endif | |
| 705 }; | |
| 706 | |
| 707 //------------------------------LoadStoreNode--------------------------- | |
|
253
b0fe4deeb9fb
6726999: nsk/stress/jck12a/jck12a010 assert(n != null,"Bad immediate dominator info.")
kvn
parents:
196
diff
changeset
|
708 // Note: is_Mem() method returns 'true' for this class. |
| 0 | 709 class LoadStoreNode : public Node { |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
710 private: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
711 const Type* const _type; // What kind of value is loaded? |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
712 const TypePtr* _adr_type; // What kind of memory is being addressed? |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
713 virtual uint size_of() const; // Size is bigger |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
714 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
715 LoadStoreNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* rt, uint required ); |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
716 virtual bool depends_only_on_test() const { return false; } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
717 virtual uint match_edge(uint idx) const { return idx == MemNode::Address || idx == MemNode::ValueIn; } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
718 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
719 virtual const Type *bottom_type() const { return _type; } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
720 virtual uint ideal_reg() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
721 virtual const class TypePtr *adr_type() const { return _adr_type; } // returns bottom_type of address |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
722 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
723 bool result_not_used() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
724 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
725 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
726 class LoadStoreConditionalNode : public LoadStoreNode { |
| 0 | 727 public: |
| 728 enum { | |
| 729 ExpectedIn = MemNode::ValueIn+1 // One more input than MemNode | |
| 730 }; | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
731 LoadStoreConditionalNode(Node *c, Node *mem, Node *adr, Node *val, Node *ex); |
| 0 | 732 }; |
| 733 | |
| 734 //------------------------------StorePConditionalNode--------------------------- | |
| 735 // Conditionally store pointer to memory, if no change since prior | |
| 736 // load-locked. Sets flags for success or failure of the store. | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
737 class StorePConditionalNode : public LoadStoreConditionalNode { |
| 0 | 738 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
739 StorePConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ll ) : LoadStoreConditionalNode(c, mem, adr, val, ll) { } |
| 0 | 740 virtual int Opcode() const; |
| 741 // Produces flags | |
| 742 virtual uint ideal_reg() const { return Op_RegFlags; } | |
| 743 }; | |
| 744 | |
|
420
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
745 //------------------------------StoreIConditionalNode--------------------------- |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
746 // Conditionally store int to memory, if no change since prior |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
747 // load-locked. Sets flags for success or failure of the store. |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
748 class StoreIConditionalNode : public LoadStoreConditionalNode { |
|
420
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
749 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
750 StoreIConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ii ) : LoadStoreConditionalNode(c, mem, adr, val, ii) { } |
|
420
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
751 virtual int Opcode() const; |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
752 // Produces flags |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
753 virtual uint ideal_reg() const { return Op_RegFlags; } |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
754 }; |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
755 |
| 0 | 756 //------------------------------StoreLConditionalNode--------------------------- |
| 757 // Conditionally store long to memory, if no change since prior | |
| 758 // load-locked. Sets flags for success or failure of the store. | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
759 class StoreLConditionalNode : public LoadStoreConditionalNode { |
| 0 | 760 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
761 StoreLConditionalNode( Node *c, Node *mem, Node *adr, Node *val, Node *ll ) : LoadStoreConditionalNode(c, mem, adr, val, ll) { } |
| 0 | 762 virtual int Opcode() const; |
|
420
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
763 // Produces flags |
|
a1980da045cc
6462850: generate biased locking code in C2 ideal graph
kvn
parents:
366
diff
changeset
|
764 virtual uint ideal_reg() const { return Op_RegFlags; } |
| 0 | 765 }; |
| 766 | |
| 767 | |
| 768 //------------------------------CompareAndSwapLNode--------------------------- | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
769 class CompareAndSwapLNode : public LoadStoreConditionalNode { |
| 0 | 770 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
771 CompareAndSwapLNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } |
| 0 | 772 virtual int Opcode() const; |
| 773 }; | |
| 774 | |
| 775 | |
| 776 //------------------------------CompareAndSwapINode--------------------------- | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
777 class CompareAndSwapINode : public LoadStoreConditionalNode { |
| 0 | 778 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
779 CompareAndSwapINode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } |
| 0 | 780 virtual int Opcode() const; |
| 781 }; | |
| 782 | |
| 783 | |
| 784 //------------------------------CompareAndSwapPNode--------------------------- | |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
785 class CompareAndSwapPNode : public LoadStoreConditionalNode { |
| 0 | 786 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
787 CompareAndSwapPNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } |
| 0 | 788 virtual int Opcode() const; |
| 789 }; | |
| 790 | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
791 //------------------------------CompareAndSwapNNode--------------------------- |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
792 class CompareAndSwapNNode : public LoadStoreConditionalNode { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
793 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
794 CompareAndSwapNNode( Node *c, Node *mem, Node *adr, Node *val, Node *ex) : LoadStoreConditionalNode(c, mem, adr, val, ex) { } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
795 virtual int Opcode() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
796 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
797 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
798 //------------------------------GetAndAddINode--------------------------- |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
799 class GetAndAddINode : public LoadStoreNode { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
800 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
801 GetAndAddINode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeInt::INT, 4) { } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
802 virtual int Opcode() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
803 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
804 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
805 //------------------------------GetAndAddLNode--------------------------- |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
806 class GetAndAddLNode : public LoadStoreNode { |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
807 public: |
|
6795
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
808 GetAndAddLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeLong::LONG, 4) { } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
809 virtual int Opcode() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
810 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
811 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
812 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
813 //------------------------------GetAndSetINode--------------------------- |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
814 class GetAndSetINode : public LoadStoreNode { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
815 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
816 GetAndSetINode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeInt::INT, 4) { } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
817 virtual int Opcode() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
818 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
819 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
820 //------------------------------GetAndSetINode--------------------------- |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
821 class GetAndSetLNode : public LoadStoreNode { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
822 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
823 GetAndSetLNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at ) : LoadStoreNode(c, mem, adr, val, at, TypeLong::LONG, 4) { } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
824 virtual int Opcode() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
825 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
826 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
827 //------------------------------GetAndSetPNode--------------------------- |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
828 class GetAndSetPNode : public LoadStoreNode { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
829 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
830 GetAndSetPNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* t ) : LoadStoreNode(c, mem, adr, val, at, t, 4) { } |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
831 virtual int Opcode() const; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
832 }; |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
833 |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
834 //------------------------------GetAndSetNNode--------------------------- |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
835 class GetAndSetNNode : public LoadStoreNode { |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
836 public: |
|
7eca5de9e0b6
7023898: Intrinsify AtomicLongFieldUpdater.getAndIncrement()
roland
parents:
6143
diff
changeset
|
837 GetAndSetNNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* t ) : LoadStoreNode(c, mem, adr, val, at, t, 4) { } |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
838 virtual int Opcode() const; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
839 }; |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
74
diff
changeset
|
840 |
| 0 | 841 //------------------------------ClearArray------------------------------------- |
| 842 class ClearArrayNode: public Node { | |
| 843 public: | |
|
1100
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
844 ClearArrayNode( Node *ctrl, Node *arymem, Node *word_cnt, Node *base ) |
|
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
845 : Node(ctrl,arymem,word_cnt,base) { |
|
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
846 init_class_id(Class_ClearArray); |
|
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
847 } |
| 0 | 848 virtual int Opcode() const; |
| 849 virtual const Type *bottom_type() const { return Type::MEMORY; } | |
| 850 // ClearArray modifies array elements, and so affects only the | |
| 851 // array memory addressed by the bottom_type of its base address. | |
| 852 virtual const class TypePtr *adr_type() const; | |
| 853 virtual Node *Identity( PhaseTransform *phase ); | |
| 854 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 855 virtual uint match_edge(uint idx) const; | |
| 856 | |
| 857 // Clear the given area of an object or array. | |
| 858 // The start offset must always be aligned mod BytesPerInt. | |
| 859 // The end offset must always be aligned mod BytesPerLong. | |
| 860 // Return the new memory. | |
| 861 static Node* clear_memory(Node* control, Node* mem, Node* dest, | |
| 862 intptr_t start_offset, | |
| 863 intptr_t end_offset, | |
| 864 PhaseGVN* phase); | |
| 865 static Node* clear_memory(Node* control, Node* mem, Node* dest, | |
| 866 intptr_t start_offset, | |
| 867 Node* end_offset, | |
| 868 PhaseGVN* phase); | |
| 869 static Node* clear_memory(Node* control, Node* mem, Node* dest, | |
| 870 Node* start_offset, | |
| 871 Node* end_offset, | |
| 872 PhaseGVN* phase); | |
|
1100
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
873 // Return allocation input memory edge if it is different instance |
|
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
874 // or itself if it is the one we are looking for. |
|
f96a1a986f7b
6895383: JCK test throws NPE for method compiled with Escape Analysis
kvn
parents:
986
diff
changeset
|
875 static bool step_through(Node** np, uint instance_id, PhaseTransform* phase); |
| 0 | 876 }; |
| 877 | |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
878 //------------------------------StrIntrinsic------------------------------- |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
879 // Base class for Ideal nodes used in String instrinsic code. |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
880 class StrIntrinsicNode: public Node { |
| 0 | 881 public: |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
882 StrIntrinsicNode(Node* control, Node* char_array_mem, |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
883 Node* s1, Node* c1, Node* s2, Node* c2): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
884 Node(control, char_array_mem, s1, c1, s2, c2) { |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
885 } |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
886 |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
887 StrIntrinsicNode(Node* control, Node* char_array_mem, |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
888 Node* s1, Node* s2, Node* c): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
889 Node(control, char_array_mem, s1, s2, c) { |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
890 } |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
891 |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
892 StrIntrinsicNode(Node* control, Node* char_array_mem, |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
893 Node* s1, Node* s2): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
894 Node(control, char_array_mem, s1, s2) { |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
895 } |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
896 |
| 0 | 897 virtual bool depends_only_on_test() const { return false; } |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
985
diff
changeset
|
898 virtual const TypePtr* adr_type() const { return TypeAryPtr::CHARS; } |
| 0 | 899 virtual uint match_edge(uint idx) const; |
| 900 virtual uint ideal_reg() const { return Op_RegI; } | |
| 901 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 4115 | 902 virtual const Type *Value(PhaseTransform *phase) const; |
| 0 | 903 }; |
| 904 | |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
905 //------------------------------StrComp------------------------------------- |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
906 class StrCompNode: public StrIntrinsicNode { |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
907 public: |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
908 StrCompNode(Node* control, Node* char_array_mem, |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
909 Node* s1, Node* c1, Node* s2, Node* c2): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
910 StrIntrinsicNode(control, char_array_mem, s1, c1, s2, c2) {}; |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
911 virtual int Opcode() const; |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
912 virtual const Type* bottom_type() const { return TypeInt::INT; } |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
913 }; |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
914 |
| 681 | 915 //------------------------------StrEquals------------------------------------- |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
916 class StrEqualsNode: public StrIntrinsicNode { |
| 681 | 917 public: |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
985
diff
changeset
|
918 StrEqualsNode(Node* control, Node* char_array_mem, |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
919 Node* s1, Node* s2, Node* c): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
920 StrIntrinsicNode(control, char_array_mem, s1, s2, c) {}; |
| 681 | 921 virtual int Opcode() const; |
| 922 virtual const Type* bottom_type() const { return TypeInt::BOOL; } | |
| 923 }; | |
| 924 | |
| 925 //------------------------------StrIndexOf------------------------------------- | |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
926 class StrIndexOfNode: public StrIntrinsicNode { |
| 681 | 927 public: |
|
986
62001a362ce9
6827605: new String intrinsics may prevent EA scalar replacement
kvn
parents:
985
diff
changeset
|
928 StrIndexOfNode(Node* control, Node* char_array_mem, |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
929 Node* s1, Node* c1, Node* s2, Node* c2): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
930 StrIntrinsicNode(control, char_array_mem, s1, c1, s2, c2) {}; |
| 681 | 931 virtual int Opcode() const; |
| 932 virtual const Type* bottom_type() const { return TypeInt::INT; } | |
| 933 }; | |
| 934 | |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
935 //------------------------------AryEq--------------------------------------- |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
936 class AryEqNode: public StrIntrinsicNode { |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
937 public: |
|
2412
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
938 AryEqNode(Node* control, Node* char_array_mem, Node* s1, Node* s2): |
|
f9424955eb18
7029152: Ideal nodes for String intrinsics miss memory edge optimization
kvn
parents:
1972
diff
changeset
|
939 StrIntrinsicNode(control, char_array_mem, s1, s2) {}; |
|
169
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
940 virtual int Opcode() const; |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
941 virtual const Type* bottom_type() const { return TypeInt::BOOL; } |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
942 }; |
|
9148c65abefc
6695049: (coll) Create an x86 intrinsic for Arrays.equals
rasbold
parents:
164
diff
changeset
|
943 |
|
7637
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
944 |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
945 //------------------------------EncodeISOArray-------------------------------- |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
946 // encode char[] to byte[] in ISO_8859_1 |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
947 class EncodeISOArrayNode: public Node { |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
948 public: |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
949 EncodeISOArrayNode(Node *control, Node* arymem, Node* s1, Node* s2, Node* c): Node(control, arymem, s1, s2, c) {}; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
950 virtual int Opcode() const; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
951 virtual bool depends_only_on_test() const { return false; } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
952 virtual const Type* bottom_type() const { return TypeInt::INT; } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
953 virtual const TypePtr* adr_type() const { return TypePtr::BOTTOM; } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
954 virtual uint match_edge(uint idx) const; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
955 virtual uint ideal_reg() const { return Op_RegI; } |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
956 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
957 virtual const Type *Value(PhaseTransform *phase) const; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
958 }; |
|
b30b3c2a0cf2
6896617: Optimize sun.nio.cs.ISO_8859_1$Encode.encodeArrayLoop() on x86
kvn
parents:
6853
diff
changeset
|
959 |
| 0 | 960 //------------------------------MemBar----------------------------------------- |
| 961 // There are different flavors of Memory Barriers to match the Java Memory | |
| 962 // Model. Monitor-enter and volatile-load act as Aquires: no following ref | |
| 963 // can be moved to before them. We insert a MemBar-Acquire after a FastLock or | |
| 964 // volatile-load. Monitor-exit and volatile-store act as Release: no | |
| 605 | 965 // preceding ref can be moved to after them. We insert a MemBar-Release |
| 0 | 966 // before a FastUnlock or volatile-store. All volatiles need to be |
| 967 // serialized, so we follow all volatile-stores with a MemBar-Volatile to | |
| 605 | 968 // separate it from any following volatile-load. |
| 0 | 969 class MemBarNode: public MultiNode { |
| 970 virtual uint hash() const ; // { return NO_HASH; } | |
| 971 virtual uint cmp( const Node &n ) const ; // Always fail, except on self | |
| 972 | |
| 973 virtual uint size_of() const { return sizeof(*this); } | |
| 974 // Memory type this node is serializing. Usually either rawptr or bottom. | |
| 975 const TypePtr* _adr_type; | |
| 976 | |
| 977 public: | |
| 978 enum { | |
| 979 Precedent = TypeFunc::Parms // optional edge to force precedence | |
| 980 }; | |
| 981 MemBarNode(Compile* C, int alias_idx, Node* precedent); | |
| 982 virtual int Opcode() const = 0; | |
| 983 virtual const class TypePtr *adr_type() const { return _adr_type; } | |
| 984 virtual const Type *Value( PhaseTransform *phase ) const; | |
| 985 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 986 virtual uint match_edge(uint idx) const { return 0; } | |
| 987 virtual const Type *bottom_type() const { return TypeTuple::MEMBAR; } | |
| 988 virtual Node *match( const ProjNode *proj, const Matcher *m ); | |
| 989 // Factory method. Builds a wide or narrow membar. | |
| 990 // Optional 'precedent' becomes an extra edge if not null. | |
| 991 static MemBarNode* make(Compile* C, int opcode, | |
| 992 int alias_idx = Compile::AliasIdxBot, | |
| 993 Node* precedent = NULL); | |
| 994 }; | |
| 995 | |
| 996 // "Acquire" - no following ref can move before (but earlier refs can | |
| 997 // follow, like an early Load stalled in cache). Requires multi-cpu | |
|
3849
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
998 // visibility. Inserted after a volatile load. |
| 0 | 999 class MemBarAcquireNode: public MemBarNode { |
| 1000 public: | |
| 1001 MemBarAcquireNode(Compile* C, int alias_idx, Node* precedent) | |
| 1002 : MemBarNode(C, alias_idx, precedent) {} | |
| 1003 virtual int Opcode() const; | |
| 1004 }; | |
| 1005 | |
| 1006 // "Release" - no earlier ref can move after (but later refs can move | |
| 1007 // up, like a speculative pipelined cache-hitting Load). Requires | |
|
3849
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1008 // multi-cpu visibility. Inserted before a volatile store. |
| 0 | 1009 class MemBarReleaseNode: public MemBarNode { |
| 1010 public: | |
| 1011 MemBarReleaseNode(Compile* C, int alias_idx, Node* precedent) | |
| 1012 : MemBarNode(C, alias_idx, precedent) {} | |
| 1013 virtual int Opcode() const; | |
| 1014 }; | |
| 1015 | |
|
3849
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1016 // "Acquire" - no following ref can move before (but earlier refs can |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1017 // follow, like an early Load stalled in cache). Requires multi-cpu |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1018 // visibility. Inserted after a FastLock. |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1019 class MemBarAcquireLockNode: public MemBarNode { |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1020 public: |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1021 MemBarAcquireLockNode(Compile* C, int alias_idx, Node* precedent) |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1022 : MemBarNode(C, alias_idx, precedent) {} |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1023 virtual int Opcode() const; |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1024 }; |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1025 |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1026 // "Release" - no earlier ref can move after (but later refs can move |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1027 // up, like a speculative pipelined cache-hitting Load). Requires |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1028 // multi-cpu visibility. Inserted before a FastUnLock. |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1029 class MemBarReleaseLockNode: public MemBarNode { |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1030 public: |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1031 MemBarReleaseLockNode(Compile* C, int alias_idx, Node* precedent) |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1032 : MemBarNode(C, alias_idx, precedent) {} |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1033 virtual int Opcode() const; |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1034 }; |
|
f1c12354c3f7
7074017: Introduce MemBarAcquireLock/MemBarReleaseLock nodes for monitor enter/exit code paths
roland
parents:
2426
diff
changeset
|
1035 |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1036 class MemBarStoreStoreNode: public MemBarNode { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1037 public: |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1038 MemBarStoreStoreNode(Compile* C, int alias_idx, Node* precedent) |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1039 : MemBarNode(C, alias_idx, precedent) { |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1040 init_class_id(Class_MemBarStoreStore); |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1041 } |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1042 virtual int Opcode() const; |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1043 }; |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1044 |
| 0 | 1045 // Ordering between a volatile store and a following volatile load. |
| 1046 // Requires multi-CPU visibility? | |
| 1047 class MemBarVolatileNode: public MemBarNode { | |
| 1048 public: | |
| 1049 MemBarVolatileNode(Compile* C, int alias_idx, Node* precedent) | |
| 1050 : MemBarNode(C, alias_idx, precedent) {} | |
| 1051 virtual int Opcode() const; | |
| 1052 }; | |
| 1053 | |
| 1054 // Ordering within the same CPU. Used to order unsafe memory references | |
| 1055 // inside the compiler when we lack alias info. Not needed "outside" the | |
| 1056 // compiler because the CPU does all the ordering for us. | |
| 1057 class MemBarCPUOrderNode: public MemBarNode { | |
| 1058 public: | |
| 1059 MemBarCPUOrderNode(Compile* C, int alias_idx, Node* precedent) | |
| 1060 : MemBarNode(C, alias_idx, precedent) {} | |
| 1061 virtual int Opcode() const; | |
| 1062 virtual uint ideal_reg() const { return 0; } // not matched in the AD file | |
| 1063 }; | |
| 1064 | |
| 1065 // Isolation of object setup after an AllocateNode and before next safepoint. | |
| 1066 // (See comment in memnode.cpp near InitializeNode::InitializeNode for semantics.) | |
| 1067 class InitializeNode: public MemBarNode { | |
| 1068 friend class AllocateNode; | |
| 1069 | |
|
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1070 enum { |
|
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1071 Incomplete = 0, |
|
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1072 Complete = 1, |
|
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1073 WithArraycopy = 2 |
|
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1074 }; |
|
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1075 int _is_complete; |
| 0 | 1076 |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1077 bool _does_not_escape; |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1078 |
| 0 | 1079 public: |
| 1080 enum { | |
| 1081 Control = TypeFunc::Control, | |
| 1082 Memory = TypeFunc::Memory, // MergeMem for states affected by this op | |
| 1083 RawAddress = TypeFunc::Parms+0, // the newly-allocated raw address | |
| 1084 RawStores = TypeFunc::Parms+1 // zero or more stores (or TOP) | |
| 1085 }; | |
| 1086 | |
| 1087 InitializeNode(Compile* C, int adr_type, Node* rawoop); | |
| 1088 virtual int Opcode() const; | |
| 1089 virtual uint size_of() const { return sizeof(*this); } | |
| 1090 virtual uint ideal_reg() const { return 0; } // not matched in the AD file | |
| 1091 virtual const RegMask &in_RegMask(uint) const; // mask for RawAddress | |
| 1092 | |
| 1093 // Manage incoming memory edges via a MergeMem on in(Memory): | |
| 1094 Node* memory(uint alias_idx); | |
| 1095 | |
| 1096 // The raw memory edge coming directly from the Allocation. | |
| 1097 // The contents of this memory are *always* all-zero-bits. | |
| 1098 Node* zero_memory() { return memory(Compile::AliasIdxRaw); } | |
| 1099 | |
| 1100 // Return the corresponding allocation for this initialization (or null if none). | |
| 1101 // (Note: Both InitializeNode::allocation and AllocateNode::initialization | |
| 1102 // are defined in graphKit.cpp, which sets up the bidirectional relation.) | |
| 1103 AllocateNode* allocation(); | |
| 1104 | |
| 1105 // Anything other than zeroing in this init? | |
| 1106 bool is_non_zero(); | |
| 1107 | |
| 1108 // An InitializeNode must completed before macro expansion is done. | |
| 1109 // Completion requires that the AllocateNode must be followed by | |
| 1110 // initialization of the new memory to zero, then to any initializers. | |
|
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1111 bool is_complete() { return _is_complete != Incomplete; } |
|
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1112 bool is_complete_with_arraycopy() { return (_is_complete & WithArraycopy) != 0; } |
| 0 | 1113 |
| 1114 // Mark complete. (Must not yet be complete.) | |
| 1115 void set_complete(PhaseGVN* phase); | |
|
3961
a92cdbac8b9e
7081933: Use zeroing elimination optimization for large array
kvn
parents:
3854
diff
changeset
|
1116 void set_complete_with_arraycopy() { _is_complete = Complete | WithArraycopy; } |
| 0 | 1117 |
|
4763
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1118 bool does_not_escape() { return _does_not_escape; } |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1119 void set_does_not_escape() { _does_not_escape = true; } |
|
1dc233a8c7fe
7121140: Allocation paths require explicit memory synchronization operations for RMO systems
roland
parents:
4115
diff
changeset
|
1120 |
| 0 | 1121 #ifdef ASSERT |
| 1122 // ensure all non-degenerate stores are ordered and non-overlapping | |
| 1123 bool stores_are_sane(PhaseTransform* phase); | |
| 1124 #endif //ASSERT | |
| 1125 | |
| 1126 // See if this store can be captured; return offset where it initializes. | |
| 1127 // Return 0 if the store cannot be moved (any sort of problem). | |
|
8116
6931f425c517
8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents:
7637
diff
changeset
|
1128 intptr_t can_capture_store(StoreNode* st, PhaseTransform* phase, bool can_reshape); |
| 0 | 1129 |
| 1130 // Capture another store; reformat it to write my internal raw memory. | |
| 1131 // Return the captured copy, else NULL if there is some sort of problem. | |
|
8116
6931f425c517
8007294: ReduceFieldZeroing doesn't check for dependent load and can lead to incorrect execution
roland
parents:
7637
diff
changeset
|
1132 Node* capture_store(StoreNode* st, intptr_t start, PhaseTransform* phase, bool can_reshape); |
| 0 | 1133 |
| 1134 // Find captured store which corresponds to the range [start..start+size). | |
| 1135 // Return my own memory projection (meaning the initial zero bits) | |
| 1136 // if there is no such store. Return NULL if there is a problem. | |
| 1137 Node* find_captured_store(intptr_t start, int size_in_bytes, PhaseTransform* phase); | |
| 1138 | |
| 1139 // Called when the associated AllocateNode is expanded into CFG. | |
| 1140 Node* complete_stores(Node* rawctl, Node* rawmem, Node* rawptr, | |
| 1141 intptr_t header_size, Node* size_in_bytes, | |
| 1142 PhaseGVN* phase); | |
| 1143 | |
| 1144 private: | |
| 1145 void remove_extra_zeroes(); | |
| 1146 | |
| 1147 // Find out where a captured store should be placed (or already is placed). | |
| 1148 int captured_store_insertion_point(intptr_t start, int size_in_bytes, | |
| 1149 PhaseTransform* phase); | |
| 1150 | |
| 1151 static intptr_t get_store_offset(Node* st, PhaseTransform* phase); | |
| 1152 | |
| 1153 Node* make_raw_address(intptr_t offset, PhaseTransform* phase); | |
| 1154 | |
| 10278 | 1155 bool detect_init_independence(Node* n, int& count); |
| 0 | 1156 |
| 1157 void coalesce_subword_stores(intptr_t header_size, Node* size_in_bytes, | |
| 1158 PhaseGVN* phase); | |
| 1159 | |
| 1160 intptr_t find_next_fullword_store(uint i, PhaseGVN* phase); | |
| 1161 }; | |
| 1162 | |
| 1163 //------------------------------MergeMem--------------------------------------- | |
| 1164 // (See comment in memnode.cpp near MergeMemNode::MergeMemNode for semantics.) | |
| 1165 class MergeMemNode: public Node { | |
| 1166 virtual uint hash() const ; // { return NO_HASH; } | |
| 1167 virtual uint cmp( const Node &n ) const ; // Always fail, except on self | |
| 1168 friend class MergeMemStream; | |
| 1169 MergeMemNode(Node* def); // clients use MergeMemNode::make | |
| 1170 | |
| 1171 public: | |
| 1172 // If the input is a whole memory state, clone it with all its slices intact. | |
| 1173 // Otherwise, make a new memory state with just that base memory input. | |
| 1174 // In either case, the result is a newly created MergeMem. | |
| 1175 static MergeMemNode* make(Compile* C, Node* base_memory); | |
| 1176 | |
| 1177 virtual int Opcode() const; | |
| 1178 virtual Node *Identity( PhaseTransform *phase ); | |
| 1179 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); | |
| 1180 virtual uint ideal_reg() const { return NotAMachineReg; } | |
| 1181 virtual uint match_edge(uint idx) const { return 0; } | |
| 1182 virtual const RegMask &out_RegMask() const; | |
| 1183 virtual const Type *bottom_type() const { return Type::MEMORY; } | |
| 1184 virtual const TypePtr *adr_type() const { return TypePtr::BOTTOM; } | |
| 1185 // sparse accessors | |
| 1186 // Fetch the previously stored "set_memory_at", or else the base memory. | |
| 1187 // (Caller should clone it if it is a phi-nest.) | |
| 1188 Node* memory_at(uint alias_idx) const; | |
| 1189 // set the memory, regardless of its previous value | |
| 1190 void set_memory_at(uint alias_idx, Node* n); | |
| 1191 // the "base" is the memory that provides the non-finite support | |
| 1192 Node* base_memory() const { return in(Compile::AliasIdxBot); } | |
| 1193 // warning: setting the base can implicitly set any of the other slices too | |
| 1194 void set_base_memory(Node* def); | |
| 1195 // sentinel value which denotes a copy of the base memory: | |
| 1196 Node* empty_memory() const { return in(Compile::AliasIdxTop); } | |
| 1197 static Node* make_empty_memory(); // where the sentinel comes from | |
| 1198 bool is_empty_memory(Node* n) const { assert((n == empty_memory()) == n->is_top(), "sanity"); return n->is_top(); } | |
| 1199 // hook for the iterator, to perform any necessary setup | |
| 1200 void iteration_setup(const MergeMemNode* other = NULL); | |
| 1201 // push sentinels until I am at least as long as the other (semantic no-op) | |
| 1202 void grow_to_match(const MergeMemNode* other); | |
| 1203 bool verify_sparse() const PRODUCT_RETURN0; | |
| 1204 #ifndef PRODUCT | |
| 1205 virtual void dump_spec(outputStream *st) const; | |
| 1206 #endif | |
| 1207 }; | |
| 1208 | |
| 1209 class MergeMemStream : public StackObj { | |
| 1210 private: | |
| 1211 MergeMemNode* _mm; | |
| 1212 const MergeMemNode* _mm2; // optional second guy, contributes non-empty iterations | |
| 1213 Node* _mm_base; // loop-invariant base memory of _mm | |
| 1214 int _idx; | |
| 1215 int _cnt; | |
| 1216 Node* _mem; | |
| 1217 Node* _mem2; | |
| 1218 int _cnt2; | |
| 1219 | |
| 1220 void init(MergeMemNode* mm, const MergeMemNode* mm2 = NULL) { | |
| 1221 // subsume_node will break sparseness at times, whenever a memory slice | |
| 1222 // folds down to a copy of the base ("fat") memory. In such a case, | |
| 1223 // the raw edge will update to base, although it should be top. | |
| 1224 // This iterator will recognize either top or base_memory as an | |
| 1225 // "empty" slice. See is_empty, is_empty2, and next below. | |
| 1226 // | |
| 1227 // The sparseness property is repaired in MergeMemNode::Ideal. | |
| 1228 // As long as access to a MergeMem goes through this iterator | |
| 1229 // or the memory_at accessor, flaws in the sparseness will | |
| 1230 // never be observed. | |
| 1231 // | |
| 1232 // Also, iteration_setup repairs sparseness. | |
| 1233 assert(mm->verify_sparse(), "please, no dups of base"); | |
| 1234 assert(mm2==NULL || mm2->verify_sparse(), "please, no dups of base"); | |
| 1235 | |
| 1236 _mm = mm; | |
| 1237 _mm_base = mm->base_memory(); | |
| 1238 _mm2 = mm2; | |
| 1239 _cnt = mm->req(); | |
| 1240 _idx = Compile::AliasIdxBot-1; // start at the base memory | |
| 1241 _mem = NULL; | |
| 1242 _mem2 = NULL; | |
| 1243 } | |
| 1244 | |
| 1245 #ifdef ASSERT | |
| 1246 Node* check_memory() const { | |
| 1247 if (at_base_memory()) | |
| 1248 return _mm->base_memory(); | |
| 1249 else if ((uint)_idx < _mm->req() && !_mm->in(_idx)->is_top()) | |
| 1250 return _mm->memory_at(_idx); | |
| 1251 else | |
| 1252 return _mm_base; | |
| 1253 } | |
| 1254 Node* check_memory2() const { | |
| 1255 return at_base_memory()? _mm2->base_memory(): _mm2->memory_at(_idx); | |
| 1256 } | |
| 1257 #endif | |
| 1258 | |
| 1259 static bool match_memory(Node* mem, const MergeMemNode* mm, int idx) PRODUCT_RETURN0; | |
| 1260 void assert_synch() const { | |
| 1261 assert(!_mem || _idx >= _cnt || match_memory(_mem, _mm, _idx), | |
| 1262 "no side-effects except through the stream"); | |
| 1263 } | |
| 1264 | |
| 1265 public: | |
| 1266 | |
| 1267 // expected usages: | |
| 1268 // for (MergeMemStream mms(mem->is_MergeMem()); next_non_empty(); ) { ... } | |
| 1269 // for (MergeMemStream mms(mem1, mem2); next_non_empty2(); ) { ... } | |
| 1270 | |
| 1271 // iterate over one merge | |
| 1272 MergeMemStream(MergeMemNode* mm) { | |
| 1273 mm->iteration_setup(); | |
| 1274 init(mm); | |
| 1275 debug_only(_cnt2 = 999); | |
| 1276 } | |
| 1277 // iterate in parallel over two merges | |
| 1278 // only iterates through non-empty elements of mm2 | |
| 1279 MergeMemStream(MergeMemNode* mm, const MergeMemNode* mm2) { | |
| 1280 assert(mm2, "second argument must be a MergeMem also"); | |
| 1281 ((MergeMemNode*)mm2)->iteration_setup(); // update hidden state | |
| 1282 mm->iteration_setup(mm2); | |
| 1283 init(mm, mm2); | |
| 1284 _cnt2 = mm2->req(); | |
| 1285 } | |
| 1286 #ifdef ASSERT | |
| 1287 ~MergeMemStream() { | |
| 1288 assert_synch(); | |
| 1289 } | |
| 1290 #endif | |
| 1291 | |
| 1292 MergeMemNode* all_memory() const { | |
| 1293 return _mm; | |
| 1294 } | |
| 1295 Node* base_memory() const { | |
| 1296 assert(_mm_base == _mm->base_memory(), "no update to base memory, please"); | |
| 1297 return _mm_base; | |
| 1298 } | |
| 1299 const MergeMemNode* all_memory2() const { | |
| 1300 assert(_mm2 != NULL, ""); | |
| 1301 return _mm2; | |
| 1302 } | |
| 1303 bool at_base_memory() const { | |
| 1304 return _idx == Compile::AliasIdxBot; | |
| 1305 } | |
| 1306 int alias_idx() const { | |
| 1307 assert(_mem, "must call next 1st"); | |
| 1308 return _idx; | |
| 1309 } | |
| 1310 | |
| 1311 const TypePtr* adr_type() const { | |
| 1312 return Compile::current()->get_adr_type(alias_idx()); | |
| 1313 } | |
| 1314 | |
| 1315 const TypePtr* adr_type(Compile* C) const { | |
| 1316 return C->get_adr_type(alias_idx()); | |
| 1317 } | |
| 1318 bool is_empty() const { | |
| 1319 assert(_mem, "must call next 1st"); | |
| 1320 assert(_mem->is_top() == (_mem==_mm->empty_memory()), "correct sentinel"); | |
| 1321 return _mem->is_top(); | |
| 1322 } | |
| 1323 bool is_empty2() const { | |
| 1324 assert(_mem2, "must call next 1st"); | |
| 1325 assert(_mem2->is_top() == (_mem2==_mm2->empty_memory()), "correct sentinel"); | |
| 1326 return _mem2->is_top(); | |
| 1327 } | |
| 1328 Node* memory() const { | |
| 1329 assert(!is_empty(), "must not be empty"); | |
| 1330 assert_synch(); | |
| 1331 return _mem; | |
| 1332 } | |
| 1333 // get the current memory, regardless of empty or non-empty status | |
| 1334 Node* force_memory() const { | |
| 1335 assert(!is_empty() || !at_base_memory(), ""); | |
| 1336 // Use _mm_base to defend against updates to _mem->base_memory(). | |
| 1337 Node *mem = _mem->is_top() ? _mm_base : _mem; | |
| 1338 assert(mem == check_memory(), ""); | |
| 1339 return mem; | |
| 1340 } | |
| 1341 Node* memory2() const { | |
| 1342 assert(_mem2 == check_memory2(), ""); | |
| 1343 return _mem2; | |
| 1344 } | |
| 1345 void set_memory(Node* mem) { | |
| 1346 if (at_base_memory()) { | |
| 1347 // Note that this does not change the invariant _mm_base. | |
| 1348 _mm->set_base_memory(mem); | |
| 1349 } else { | |
| 1350 _mm->set_memory_at(_idx, mem); | |
| 1351 } | |
| 1352 _mem = mem; | |
| 1353 assert_synch(); | |
| 1354 } | |
| 1355 | |
| 1356 // Recover from a side effect to the MergeMemNode. | |
| 1357 void set_memory() { | |
| 1358 _mem = _mm->in(_idx); | |
| 1359 } | |
| 1360 | |
| 1361 bool next() { return next(false); } | |
| 1362 bool next2() { return next(true); } | |
| 1363 | |
| 1364 bool next_non_empty() { return next_non_empty(false); } | |
| 1365 bool next_non_empty2() { return next_non_empty(true); } | |
| 1366 // next_non_empty2 can yield states where is_empty() is true | |
| 1367 | |
| 1368 private: | |
| 1369 // find the next item, which might be empty | |
| 1370 bool next(bool have_mm2) { | |
| 1371 assert((_mm2 != NULL) == have_mm2, "use other next"); | |
| 1372 assert_synch(); | |
| 1373 if (++_idx < _cnt) { | |
| 1374 // Note: This iterator allows _mm to be non-sparse. | |
| 1375 // It behaves the same whether _mem is top or base_memory. | |
| 1376 _mem = _mm->in(_idx); | |
| 1377 if (have_mm2) | |
| 1378 _mem2 = _mm2->in((_idx < _cnt2) ? _idx : Compile::AliasIdxTop); | |
| 1379 return true; | |
| 1380 } | |
| 1381 return false; | |
| 1382 } | |
| 1383 | |
| 1384 // find the next non-empty item | |
| 1385 bool next_non_empty(bool have_mm2) { | |
| 1386 while (next(have_mm2)) { | |
| 1387 if (!is_empty()) { | |
| 1388 // make sure _mem2 is filled in sensibly | |
| 1389 if (have_mm2 && _mem2->is_top()) _mem2 = _mm2->base_memory(); | |
| 1390 return true; | |
| 1391 } else if (have_mm2 && !is_empty2()) { | |
| 1392 return true; // is_empty() == true | |
| 1393 } | |
| 1394 } | |
| 1395 return false; | |
| 1396 } | |
| 1397 }; | |
| 1398 | |
| 1399 //------------------------------Prefetch--------------------------------------- | |
| 1400 | |
| 1401 // Non-faulting prefetch load. Prefetch for many reads. | |
| 1402 class PrefetchReadNode : public Node { | |
| 1403 public: | |
| 1404 PrefetchReadNode(Node *abio, Node *adr) : Node(0,abio,adr) {} | |
| 1405 virtual int Opcode() const; | |
| 1406 virtual uint ideal_reg() const { return NotAMachineReg; } | |
| 1407 virtual uint match_edge(uint idx) const { return idx==2; } | |
| 1408 virtual const Type *bottom_type() const { return Type::ABIO; } | |
| 1409 }; | |
| 1410 | |
| 1411 // Non-faulting prefetch load. Prefetch for many reads & many writes. | |
| 1412 class PrefetchWriteNode : public Node { | |
| 1413 public: | |
| 1414 PrefetchWriteNode(Node *abio, Node *adr) : Node(0,abio,adr) {} | |
| 1415 virtual int Opcode() const; | |
| 1416 virtual uint ideal_reg() const { return NotAMachineReg; } | |
| 1417 virtual uint match_edge(uint idx) const { return idx==2; } | |
| 3854 | 1418 virtual const Type *bottom_type() const { return Type::ABIO; } |
| 1419 }; | |
| 1420 | |
| 1421 // Allocation prefetch which may fault, TLAB size have to be adjusted. | |
| 1422 class PrefetchAllocationNode : public Node { | |
| 1423 public: | |
| 1424 PrefetchAllocationNode(Node *mem, Node *adr) : Node(0,mem,adr) {} | |
| 1425 virtual int Opcode() const; | |
| 1426 virtual uint ideal_reg() const { return NotAMachineReg; } | |
| 1427 virtual uint match_edge(uint idx) const { return idx==2; } | |
|
1367
9e321dcfa5b7
6940726: Use BIS instruction for allocation prefetch on Sparc
kvn
parents:
1198
diff
changeset
|
1428 virtual const Type *bottom_type() const { return ( AllocatePrefetchStyle == 3 ) ? Type::MEMORY : Type::ABIO; } |
| 0 | 1429 }; |
| 1972 | 1430 |
| 1431 #endif // SHARE_VM_OPTO_MEMNODE_HPP |