Mercurial > hg > truffle

comparison src/share/vm/opto/loopnode.hpp @ 10408:836a62f43af9

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge with http://hg.openjdk.java.net/hsx/hsx25/hotspot/
author Doug Simon <doug.simon@oracle.com>
date Wed, 19 Jun 2013 10:45:56 +0200
parents 1682bec79205
children 3213ba4d3dff
comparison
equal deleted inserted replaced
10086:e0fb8a213650 10408:836a62f43af9
963 // Has a use in the vector set 963 // Has a use in the vector set
964 bool has_use_in_set( Node* n, VectorSet& vset ); 964 bool has_use_in_set( Node* n, VectorSet& vset );
965 // Has use internal to the vector set (ie. not in a phi at the loop head) 965 // Has use internal to the vector set (ie. not in a phi at the loop head)
966 bool has_use_internal_to_set( Node* n, VectorSet& vset, IdealLoopTree *loop ); 966 bool has_use_internal_to_set( Node* n, VectorSet& vset, IdealLoopTree *loop );
967 // clone "n" for uses that are outside of loop 967 // clone "n" for uses that are outside of loop
968 void clone_for_use_outside_loop( IdealLoopTree *loop, Node* n, Node_List& worklist ); 968 int clone_for_use_outside_loop( IdealLoopTree *loop, Node* n, Node_List& worklist );
969 // clone "n" for special uses that are in the not_peeled region 969 // clone "n" for special uses that are in the not_peeled region
970 void clone_for_special_use_inside_loop( IdealLoopTree *loop, Node* n, 970 void clone_for_special_use_inside_loop( IdealLoopTree *loop, Node* n,
971 VectorSet& not_peel, Node_List& sink_list, Node_List& worklist ); 971 VectorSet& not_peel, Node_List& sink_list, Node_List& worklist );
972 // Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi does not already exist 972 // Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi does not already exist
973 void insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp ); 973 void insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp );