| /openjdk7/hotspot/src/share/vm/opto/ |
| H A D | multnode.cpp | 86 if (bottom_type() == Type::MEMORY) {
|
| H A D | macro.cpp | 1178 result_phi_rawmem = new (C) PhiNode(result_region, Type::MEMORY, TypeRawPtr::BOTTOM);
1191 contended_phi_rawmem = new (C) PhiNode(contended_region, Type::MEMORY, TypeRawPtr::BOTTOM);
1619 Node *pf_phi_rawmem = new (C) PhiNode( pf_region, Type::MEMORY,
1699 Node *pf_phi_rawmem = new (C) PhiNode( pf_region, Type::MEMORY,
2098 mem_phi = new (C) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2101 Node* fast_lock_mem_phi = new (C) PhiNode( fast_lock_region, Type::MEMORY, TypeRawPtr::BOTTOM);
2208 Node *slow_mem = new (C) PhiNode( slow_path, Type::MEMORY, TypeRawPtr::BOTTOM);
2234 mem_phi = new (C) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2292 mem_phi = new (C) PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM);
2302 mem_phi = new (C) PhiNode( region, Type::MEMORY, TypeRawPt
[all...] |
| H A D | cfgnode.cpp | 387 if (phi && phi->type() == Type::MEMORY && req() == 3 && phi->is_diamond_phi(true)) {
730 assert(t != Type::MEMORY || at == flatten_phi_adr_type(at), "flatten at");
742 if (t == Type::MEMORY) at = flatten_phi_adr_type(x->adr_type());
748 if (t == Type::MEMORY) at = flatten_phi_adr_type(x->adr_type());
772 assert(type() == Type::MEMORY &&
786 if (phi2->type() == Type::MEMORY && phi2->adr_type() == at) {
866 assert((_type == Type::MEMORY) == (_adr_type != NULL), "adr_type for memory phis only");
1798 if (progress == NULL && can_reshape && type() == Type::MEMORY) {
|
| H A D | idealKit.cpp | 340 _gvn.set_type(p, Type::MEMORY); // must be mapped
457 phi = PhiNode::make(join_region, join_slice, Type::MEMORY, mms.adr_type(C));
459 // gvn().set_type(phi, Type::MEMORY);
|
| H A D | memnode.hpp | 481 virtual const Type *bottom_type() const; // returns Type::MEMORY
636 virtual const Type *bottom_type() const {return Type::MEMORY;}
787 virtual const Type *bottom_type() const { return Type::MEMORY; }
1105 virtual const Type *bottom_type() const { return Type::MEMORY; }
1350 virtual const Type *bottom_type() const { return ( AllocatePrefetchStyle == 3 ) ? Type::MEMORY : Type::ABIO; }
|
| H A D | stringopts.cpp | 1070 Node *final_mem = PhiNode::make(final_merge, kit.memory(char_adr_idx), Type::MEMORY, TypeAryPtr::CHARS);
1071 kit.gvn().set_type(final_mem, Type::MEMORY);
1159 Node *mem = PhiNode::make(head, kit.memory(char_adr_idx), Type::MEMORY, TypeAryPtr::CHARS);
1160 kit.gvn().set_type(mem, Type::MEMORY);
|
| H A D | superword.cpp | 510 if (n->is_Mem() || n->is_Phi() && n->bottom_type() == Type::MEMORY) {
606 } else if (out->is_Phi() && out->bottom_type() == Type::MEMORY && !in_bb(out)) {
1182 } else if (!sched_up && use->is_Phi() && use->bottom_type() == Type::MEMORY) {
1628 if (in_bb(n) && (n->is_Phi() && n->bottom_type() == Type::MEMORY)) {
2524 } else if (_n->is_Mem() || _n->is_Phi() && _n->bottom_type() == Type::MEMORY) {
|
| H A D | idealGraphPrinter.cpp | 498 } else if( t == Type::MEMORY ) {
|
| H A D | machnode.cpp | 539 if (bottom_type() == Type::MEMORY) {
|
| H A D | graphKit.cpp | 356 Node* m_phi = PhiNode::make(region, m, Type::MEMORY, mms.adr_type(C));
358 _gvn.set_type(m_phi, Type::MEMORY);
1394 _gvn.set_type(p, Type::MEMORY); // must be mapped
2250 phi = PhiNode::make(region, old_slice, Type::MEMORY, mms.adr_type(C));
2251 _gvn.set_type(phi, Type::MEMORY);
|
| H A D | parse1.cpp | 725 Node* memphi = new (C) PhiNode(region, Type::MEMORY, TypePtr::BOTTOM);
1694 gvn().set_type(remerge, Type::MEMORY);
1957 Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
|
| H A D | type.cpp | 108 const Type *Type::MEMORY; // Abstract store only member in class:Type
226 MEMORY = make(Memory); // Abstract store only
312 fsc[1] = Type::MEMORY;
1712 flds[TypeFunc::Memory ] = Type::MEMORY;
|
| H A D | library_call.cpp | 3036 PhiNode* result_mem = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
3453 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY,
3714 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY,
4272 PhiNode* result_mem = new(C) PhiNode(result_reg, Type::MEMORY,
4636 PhiNode* result_memory = new(C) PhiNode(result_region, Type::MEMORY, adr_type);
4763 Node* done_mem = new(C) PhiNode(done_ctl, Type::MEMORY, adr_type);
4872 PhiNode* slow_mem2 = new(C) PhiNode(slow_reg2, Type::MEMORY, adr_type);
|
| H A D | type.hpp | 335 static const Type *MEMORY; member in class:Type
|
| H A D | memnode.cpp | 162 assert(mphi->bottom_type() == Type::MEMORY, "memory phi required");
2275 return Type::MEMORY;
2361 return Type::MEMORY;
3899 // SEMANTICS OF MEMORY MERGES: A MergeMem is a memory state assembled from several
3939 // REPRESENTATION OF MEMORY MERGES: The indexes used to address the Node::in array
3982 // PARTIAL MEMORY STATES: During optimization, MergeMem nodes may arise that represent
|
| H A D | node.cpp | 1610 } else if (t == Type::MEMORY) {
|
| H A D | escape.cpp | 2333 result = PhiNode::make(orig_phi->in(0), NULL, Type::MEMORY, atype);
2596 assert(mphi->bottom_type() == Type::MEMORY, "memory phi required");
|
| /openjdk7/jdk/src/share/classes/java/lang/management/ |
| H A D | PlatformComponent.java | 97 MEMORY( enum constant in enum:PlatformComponent
|
| /openjdk7/jdk/src/share/classes/sun/tools/jconsole/ |
| H A D | Messages.java | 194 public static String MEMORY; field in class:Messages
|
| H A D | MemoryTab.java | 96 return Messages.MEMORY;
|