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