Searched refs:AllocateNode (Results 1 - 14 of 14) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dmacro.hpp30 class AllocateNode;
80 void expand_allocate(AllocateNode *alloc);
82 void expand_allocate_common(AllocateNode* alloc,
89 bool eliminate_allocate_node(AllocateNode *alloc);
90 bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints);
91 bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done);
92 void process_users_of_allocation(AllocateNode *alloc);
109 Node* initialize_object(AllocateNode* alloc,
H A Dcallnode.hpp50 class AllocateNode;
454 DEBUG_ONLY(AllocateNode* _alloc;)
462 AllocateNode* alloc,
475 AllocateNode* alloc() const { return _alloc; }
731 // AllocateNode and AllocateArrayNode are subclasses of CallNode because they will
738 class AllocateNode : public CallNode { class in inherits:CallNode
772 AllocateNode(Compile* C, const TypeFunc *atype, Node *ctrl, Node *mem, Node *abio,
785 // Pattern-match a possible usage of AllocateNode.
792 static AllocateNode* Ideal_allocation(Node* ptr, PhaseTransform* phase);
796 // (Note: AllocateNode
[all...]
H A Dmacro.cpp353 assert(alloc == AllocateNode::Ideal_allocation(mem->in(3), phase, offset), "sanity");
562 bool PhaseMacroExpand::can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
582 int length = alloc->in(AllocateNode::ALength)->find_int_con(-1);
681 bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) {
707 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1);
852 void PhaseMacroExpand::process_users_of_allocation(AllocateNode *alloc) {
948 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) {
967 Node* klass = alloc->in(AllocateNode::KlassNode);
1083 AllocateNode* alloc, // allocation node to be expanded
1093 Node* size_in_bytes = alloc->in(AllocateNode
[all...]
H A Dmemnode.cpp129 AllocateNode* alloc = proj_in->as_Initialize()->allocation();
458 bool MemNode::detect_ptr_independence(Node* p1, AllocateNode* a1,
459 Node* p2, AllocateNode* a2,
497 AllocateNode* alloc = AllocateNode::Ideal_allocation(base, phase);
535 AllocateNode::Ideal_allocation(st_base, phase),
550 AllocateNode* st_alloc = st_init->allocation();
1008 AllocateNode* alloc = AllocateNode::Ideal_allocation(st_adr, phase, st_off);
1011 AllocateNode* allo
[all...]
H A DgraphKit.cpp1135 Node* akls = AllocateNode::Ideal_klass(obj, &_gvn);
2994 Node* GraphKit::set_output_for_allocation(AllocateNode* alloc,
3054 { // Verify that the AllocateNode::Ideal_allocation recognizers work:
3055 assert(AllocateNode::Ideal_allocation(rawoop, &_gvn) == alloc,
3057 assert(AllocateNode::Ideal_allocation(javaoop, &_gvn) == alloc,
3065 assert(alloc->in(AllocateNode::ALength)->is_top(), "no length, please");
3146 AllocateNode* alloc
3147 = new (C) AllocateNode(C, AllocateNode::alloc_type(),
3324 // Given an oop pointer or raw pointer, see if it feeds from an AllocateNode
[all...]
H A Dmemnode.hpp73 static bool detect_ptr_independence(Node* p1, AllocateNode* a1,
74 Node* p2, AllocateNode* a2,
987 // Isolation of object setup after an AllocateNode and before next safepoint.
990 friend class AllocateNode;
1023 // (Note: Both InitializeNode::allocation and AllocateNode::initialization
1025 AllocateNode* allocation();
1031 // Completion requires that the AllocateNode must be followed by
1061 // Called when the associated AllocateNode is expanded into CFG.
H A Dcallnode.cpp1084 AllocateNode* alloc,
1142 uint AllocateNode::size_of() const { return sizeof(*this); }
1144 AllocateNode::AllocateNode(Compile* C, const TypeFunc *atype, function in class:AllocateNode
1220 Node *length = in(AllocateNode::ALength);
H A Dstringopts.cpp44 AllocateNode* _begin; // The allocation the begins the pattern
103 void set_allocation(AllocateNode* alloc) {
193 AllocateNode* begin() { return _begin; }
425 AllocateNode* alloc = NULL;
738 AllocateNode* an = n->as_Allocate();
H A Dsubnode.cpp645 AllocateNode* alloc1 = AllocateNode::Ideal_allocation(in1, NULL);
646 AllocateNode* alloc2 = AllocateNode::Ideal_allocation(in2, NULL);
H A Dlibrary_call.cpp260 AllocateNode* alloc,
4135 AllocateNode* alloc = NULL;
4139 alloc = AllocateNode::Ideal_allocation(alloc_obj, &_gvn);
4142 // Mark as complete_with_arraycopy so that on AllocateNode
4143 // expansion, we know this AllocateNode is initialized by an array
4211 // Record what AllocateNode this StoreStore protects so that
4213 // AllocateNode and eliminate the MemBarStoreStoreNode if possible
4214 // based on the escape status of the AllocateNode.
4215 insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out(AllocateNode::RawAddress));
4605 && _gvn.find_int_con(alloc->in(AllocateNode
[all...]
H A Descape.cpp740 Node* k = call->in(AllocateNode::KlassNode);
750 int length = call->in(AllocateNode::ALength)->find_int_con(-1);
1734 // escape status of associated AllocateNode and optimize out
1740 assert (alloc->is_Allocate(), "storestore should point to AllocateNode");
2545 AllocateNode* alloc = proj_in->as_Initialize()->allocation();
2752 igvn->type(alloc->in(AllocateNode::KlassNode)) != TypeKlassPtr::OBJECT)) {
H A DgraphKit.hpp798 Node* set_output_for_allocation(AllocateNode* alloc,
H A Dnode.hpp43 class AllocateNode;
/openjdk7/hotspot/src/share/vm/runtime/
H A DvmStructs.cpp1742 declare_c2_type(AllocateNode, CallNode) \
1743 declare_c2_type(AllocateArrayNode, AllocateNode) \

Completed in 139 milliseconds