equal
deleted
inserted
replaced
483 |
483 |
484 bool is_loop() { return !_irreducible && _tail && !_tail->is_top(); } |
484 bool is_loop() { return !_irreducible && _tail && !_tail->is_top(); } |
485 bool is_inner() { return is_loop() && _child == NULL; } |
485 bool is_inner() { return is_loop() && _child == NULL; } |
486 bool is_counted() { return is_loop() && _head != NULL && _head->is_CountedLoop(); } |
486 bool is_counted() { return is_loop() && _head != NULL && _head->is_CountedLoop(); } |
487 |
487 |
|
488 void remove_main_post_loops(CountedLoopNode *cl, PhaseIdealLoop *phase); |
|
489 |
488 #ifndef PRODUCT |
490 #ifndef PRODUCT |
489 void dump_head( ) const; // Dump loop head only |
491 void dump_head( ) const; // Dump loop head only |
490 void dump() const; // Dump this loop recursively |
492 void dump() const; // Dump this loop recursively |
491 void verify_tree(IdealLoopTree *loop, const IdealLoopTree *parent) const; |
493 void verify_tree(IdealLoopTree *loop, const IdealLoopTree *parent) const; |
492 #endif |
494 #endif |