Searched refs:Unique_Node_List (Results 1 - 20 of 20) sorted by relevance
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | stringopts.hpp | 40 Unique_Node_List dead_worklist; 85 PhaseStringOpts(PhaseGVN* gvn, Unique_Node_List* worklist);
|
H A D | escape.hpp | 346 Unique_Node_List ideal_nodes; // Used by CG construction and types splitting. 375 void add_objload_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist); 377 void add_node_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist); 505 Unique_Node_List *delayed_worklist) {
|
H A D | phaseX.hpp | 147 Unique_Node_List _useful; // Nodes reachable from root 150 PhaseRemoveUseless( PhaseGVN *gvn, Unique_Node_List *worklist ); 152 Unique_Node_List *get_useful() { return &_useful; } 435 Unique_Node_List _worklist; // Iterative worklist
|
H A D | compile.hpp | 79 class Unique_Node_List; 358 Unique_Node_List* _for_igvn; // Initial work-list for next round of Iterative GVN 806 Unique_Node_List* for_igvn() { return _for_igvn; } 807 inline void record_for_igvn(Node* n); // Body is after class Unique_Node_List. 809 void set_for_igvn(Unique_Node_List *for_igvn) { _for_igvn = for_igvn; } 816 void identify_useful_nodes(Unique_Node_List &useful); 817 void update_dead_node_list(Unique_Node_List &useful); 818 void remove_useless_nodes (Unique_Node_List &useful); 838 void remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful);
|
H A D | node.hpp | 1000 void verify_edges(Unique_Node_List &visited); // Verify bi-directional edges 1351 //------------------------------Unique_Node_List------------------------------- 1352 class Unique_Node_List : public Node_List { class in inherits:Node_List 1357 Unique_Node_List() : Node_List(), _in_worklist(Thread::current()->resource_area()), _clock_index(0) {} function in class:Unique_Node_List 1358 Unique_Node_List(Arena *a) : Node_List(a), _in_worklist(a), _clock_index(0) {} function in class:Unique_Node_List
|
H A D | compile.cpp | 328 // Use breadth-first pass that records state in a Unique_Node_List, 330 void Compile::identify_useful_nodes(Unique_Node_List &useful) { 354 void Compile::update_dead_node_list(Unique_Node_List &useful) { 367 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) { 383 void Compile::remove_useless_nodes(Unique_Node_List &useful) { 692 Unique_Node_List for_igvn(comp_arena()); 942 Unique_Node_List for_igvn(comp_arena()); 1137 Unique_Node_List useful(comp_arena()); 1156 Unique_Node_List useful(comp_arena()); 2918 Unique_Node_List sfp [all...] |
H A D | live.cpp | 280 Unique_Node_List worklist(a);
|
H A D | lcm.cpp | 1043 Unique_Node_List *out = new Unique_Node_List(Thread::current()->resource_area());
|
H A D | node.cpp | 1747 void Node::verify_edges(Unique_Node_List &visited) { 2029 void Unique_Node_List::remove( Node *n ) { 2043 void Unique_Node_List::remove_useless_nodes(VectorSet &useful) {
|
H A D | block.hpp | 398 Unique_Node_List _raw_oops;
|
H A D | superword.hpp | 366 void remove_and_insert(MemNode *current, MemNode *prev, MemNode *lip, Node *uip, Unique_Node_List &schd_before);
|
H A D | superword.cpp | 1147 Node *uip, Unique_Node_List &sched_before) { 1217 Unique_Node_List schedule_before_pack; 1218 Unique_Node_List memops;
|
H A D | phaseX.cpp | 384 PhaseRemoveUseless::PhaseRemoveUseless( PhaseGVN *gvn, Unique_Node_List *worklist ) : Phase(Remove_Useless), 1435 Unique_Node_List worklist;
|
H A D | stringopts.cpp | 571 PhaseStringOpts::PhaseStringOpts(PhaseGVN* gvn, Unique_Node_List*): 728 Unique_Node_List ctrl_path;
|
H A D | loopnode.hpp | 915 void collect_potentially_useful_predicates(IdealLoopTree *loop, Unique_Node_List &predicate_opaque1);
|
H A D | memnode.cpp | 408 Unique_Node_List dom_list(arena); 667 Unique_Node_List closure; 671 Unique_Node_List worklist; 3183 Unique_Node_List mems;
|
H A D | escape.cpp | 105 Unique_Node_List delayed_worklist; 286 void ConnectionGraph::add_objload_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist) { 307 void ConnectionGraph::add_node_to_connection_graph(Node *n, Unique_Node_List *delayed_worklist) {
|
H A D | loopnode.cpp | 1944 IdealLoopTree * loop, Unique_Node_List &useful_predicates) { 1980 Unique_Node_List useful_predicates; // to store useful predicates
|
H A D | matcher.cpp | 161 Unique_Node_List worklist;
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | vmStructs.cpp | 1712 declare_c2_type(Unique_Node_List, Node_List) \
|
Completed in 167 milliseconds