Searched defs:useful (Results 1 - 4 of 4) sorted by relevance
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | phaseX.hpp | 9 * This code is distributed in the hope that it will be useful, but WITHOUT 94 void remove_useless_nodes(VectorSet &useful); // replace with sentinel 356 void remove_useless_nodes(VectorSet &useful) { argument 357 _table.remove_useless_nodes(useful);
|
H A D | phaseX.cpp | 9 * This code is distributed in the hope that it will be useful, but WITHOUT 311 void NodeHash::remove_useless_nodes(VectorSet &useful) { argument 319 if(n != NULL && n != sentinel_node && !useful.test(n->_idx)) { 383 // 1) Use a breadthfirst walk to collect useful nodes reachable from root. 391 // Identify nodes that are reachable from below, useful. 403 // Disconnect 'useless' nodes that are adjacent to useful nodes 408 // loops without calls or exceptions visible to root, i.e., useful.
|
H A D | node.cpp | 9 * This code is distributed in the hope that it will be useful, but WITHOUT 2043 void Unique_Node_List::remove_useless_nodes(VectorSet &useful) { argument 2048 if( ! useful.test(n->_idx) ) {
|
H A D | compile.cpp | 9 * This code is distributed in the hope that it will be useful, but WITHOUT 327 // Identify all nodes that are reachable from below, useful. 330 void Compile::identify_useful_nodes(Unique_Node_List &useful) { argument 332 useful.map( estimated_worklist_size, NULL ); // preallocate space 335 if (root() != NULL) { useful.push(root()); } 336 // If 'top' is cached, declare it useful to preserve cached node 337 if( cached_top_node() ) { useful.push(cached_top_node()); } 339 // Push all useful nodes onto the list, breadthfirst 340 for( uint next = 0; next < useful.size(); ++next ) { 341 assert( next < unique(), "Unique useful node 354 update_dead_node_list(Unique_Node_List &useful) argument 367 remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) argument 383 remove_useless_nodes(Unique_Node_List &useful) argument 3520 Unique_Node_List useful; local [all...] |
Completed in 39 milliseconds