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