Lines Matching defs:useful
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) {
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 nodes < total nodes");
342 Node *n = useful.at(next);
347 useful.push(m);
352 // Update dead_node_list with any missing dead nodes using useful
353 // list. Consider all non-useful nodes to be useless i.e., dead nodes.
354 void Compile::update_dead_node_list(Unique_Node_List &useful) {
356 VectorSet& useful_node_set = useful.member_set();
359 // If node with index node_idx is not in useful set,
367 void Compile::remove_useless_late_inlines(GrowableArray<CallGenerator*>* inlines, Unique_Node_List &useful) {
375 if (!useful.member(call)) {
383 void Compile::remove_useless_nodes(Unique_Node_List &useful) {
385 while (next < useful.size()) {
386 Node *n = useful.at(next++);
391 if (! useful.member(child)) {
393 "If top is cached in Compile object it is in useful list");
407 if (!useful.member(n)) {
414 if (!useful.member(n)) {
419 remove_useless_late_inlines(&_string_late_inlines, useful);
420 remove_useless_late_inlines(&_late_inlines, useful);
1137 Unique_Node_List useful(comp_arena());
1138 // Get useful node list by walking the graph.
1139 identify_useful_nodes(useful);
1140 return useful.size();
1156 Unique_Node_List useful(comp_arena());
1157 // Get useful node list by walking the graph.
1158 identify_useful_nodes(useful);
1161 uint l_nodes_by_walk = useful.size();
1169 VectorSet& useful_member_set = useful.member_set();
1180 useful.at(i)->dump();
2896 // Break the link with AllocateNode: it is no longer useful and
3520 Unique_Node_List useful;
3521 useful.push(root());
3522 for (uint next = 0; next < useful.size(); ++next) {
3523 Node* n = useful.at(next);
3533 useful.push(m);