Mercurial > hg > truffle

comparison src/share/vm/opto/loopnode.hpp @ 401:ee8f06bfb27c

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
6743188: incomplete fix for 6700047 C2 failed in idom_no_update Reviewed-by: rasbold, kvn
author never
date Fri, 03 Oct 2008 13:58:20 -0700
parents 194b8e3a2fc4
children 98cb887364d3
comparison
equal deleted inserted replaced
400:cc80376deb0c 401:ee8f06bfb27c
323 // Split shared headers and insert loop landing pads. 323 // Split shared headers and insert loop landing pads.
324 // Insert a LoopNode to replace the RegionNode. 324 // Insert a LoopNode to replace the RegionNode.
325 // Returns TRUE if loop tree is structurally changed. 325 // Returns TRUE if loop tree is structurally changed.
326 bool beautify_loops( PhaseIdealLoop *phase ); 326 bool beautify_loops( PhaseIdealLoop *phase );
327 327
328 // Perform iteration-splitting on inner loops. Split iterations to avoid 328 // Perform iteration-splitting on inner loops. Split iterations to
329 // range checks or one-shot null checks. 329 // avoid range checks or one-shot null checks. Returns false if the
330 void iteration_split( PhaseIdealLoop *phase, Node_List &old_new ); 330 // current round of loop opts should stop.
331 331 bool iteration_split( PhaseIdealLoop *phase, Node_List &old_new );
332 // Driver for various flavors of iteration splitting 332
333 void iteration_split_impl( PhaseIdealLoop *phase, Node_List &old_new ); 333 // Driver for various flavors of iteration splitting. Returns false
334 // if the current round of loop opts should stop.
335 bool iteration_split_impl( PhaseIdealLoop *phase, Node_List &old_new );
334 336
335 // Given dominators, try to find loops with calls that must always be 337 // Given dominators, try to find loops with calls that must always be
336 // executed (call dominates loop tail). These loops do not need non-call 338 // executed (call dominates loop tail). These loops do not need non-call
337 // safepoints (ncsfpt). 339 // safepoints (ncsfpt).
338 void check_safepts(VectorSet &visited, Node_List &stack); 340 void check_safepts(VectorSet &visited, Node_List &stack);