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