Searched refs:is_CFG (Results 1 - 21 of 21) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dmultnode.hpp43 virtual bool is_CFG() const { return true; } function in class:MultiNode
78 virtual bool is_CFG() const;
H A Drootnode.hpp60 virtual bool is_CFG() const { return true; } function in class:HaltNode
H A Dmultnode.cpp71 bool ProjNode::is_CFG() const { function in class:ProjNode
73 return (_con == TypeFunc::Control && def->is_CFG());
H A Dcfgnode.hpp90 virtual bool is_CFG () const { return true; } function in class:RegionNode
107 virtual bool is_CFG() const { return true; } function in class:JProjNode
224 virtual bool is_CFG() const { return true; } function in class:GotoNode
240 virtual bool is_CFG() const { return true; } function in class:CProjNode
H A Dsplit_if.cpp36 assert( n->is_CFG(), "" );
67 if( n->is_CFG() ) {
230 assert(!n->is_CFG(), "must be data node");
281 if( def->is_CFG() ) {
325 if( use->is_CFG() )
H A Dloopnode.cpp88 assert( !n->is_Phi() && !n->is_CFG(), "this code only handles data nodes" );
93 if (!early->is_CFG()) // Might be a non-CFG multi-def
150 assert(ctl->is_CFG(), "expensive input 0 must be cfg");
203 if (p->is_Proj() && p->is_CFG()) {
1569 assert(in->is_CFG(), "must be");
2505 if( !n->is_CFG() ) return;
2510 if( !n->is_CFG() ) return;
2788 if( m->is_CFG() && !is_visited(m) ) { // Only for CFG children
2811 if ( u->is_CFG() && !is_visited(u) ) {
2847 if( !m->is_CFG() ) continu
[all...]
H A DloopPredicate.cpp103 assert(n->is_CFG(), "must be control node");
467 } else if (!n->is_CFG()) {
518 assert(!n->is_CFG(), "should not see CFG here");
559 assert(old->is_CFG() && n->is_CFG(), "must be");
574 assert(ctrl->is_CFG(), "must be");
H A Dloopopts.cpp46 assert(!n->is_CFG(), "");
660 if( n->is_CFG() || n->is_LoadStore() )
1218 if (!use->is_CFG() && get_ctrl(use) == post_loop->in(2)) {
1305 if( !old->is_CFG() ) continue;
1317 if( !loop->is_member( use_loop ) && use->is_CFG() ) {
1344 if( useuse->is_CFG() ) {
1389 if( !loop->is_member( use_loop ) && (!old->is_CFG() || !use->is_CFG())) {
1418 Node *prev = use->is_CFG() ? use : get_ctrl(use);
1612 if (n->is_CFG()) {
[all...]
H A Ddivnode.hpp154 virtual bool is_CFG() const { return false; } function in class:DivModNode
H A Dloopnode.hpp582 assert( n->is_CFG(), "" );
585 assert( lca->is_CFG(), "" );
600 assert(ctrl->is_CFG(), "CFG");
649 assert (n->is_CFG(), "must be a CFG node");
H A Ddomgraph.cpp401 // nodes (using the is_CFG() call) and places them in a dominator tree. Thus,
434 if( whead->in(j) == NULL || !whead->in(j)->is_CFG() )
551 if( s->is_CFG() && pil->has_node(s) && !visited.test(s->_idx) ) {
H A Dcallnode.hpp107 virtual bool is_CFG() const { return (_con == TypeFunc::Control); } function in class:ParmNode
121 virtual bool is_CFG() const { return true; } function in class:ReturnNode
142 virtual bool is_CFG() const { return true; } function in class:RethrowNode
H A Dnode.cpp1095 assert(this->is_CFG(), "expecting control");
1096 assert(sub != NULL && sub->is_CFG(), "expecting control");
1710 if (only_ctrl && !n->is_CFG()) continue;
1995 if (use->is_CFG() && use != this) {
H A Dcfgnode.cpp326 if (u != NULL && (u->is_Phi() || u->is_CFG()))
353 if (m != NULL && m->is_CFG()) {
1521 uint i = (in->is_Proj() && !in->is_CFG()) ? 0 : 1;
1570 uint i = (n->is_Proj() && !n->is_CFG()) ? 0 : 1;
H A Dnode.hpp786 virtual bool is_CFG() const { return false; } function in class:Node
794 virtual bool depends_only_on_test() const { assert(!is_CFG(), ""); return true; };
H A Dsuperword.cpp1602 (n->is_Proj() && !n->as_Proj()->is_CFG())) {
1608 if (!n->is_CFG()) {
H A Dmemnode.cpp394 assert(sub->is_CFG(), "expecting control");
417 if (!n->is_CFG() && n->pinned()) {
422 assert(n->is_CFG(), "expecting control");
426 } else if (n->is_CFG()) {
H A Dmemnode.hpp635 virtual bool is_CFG() const { return false; } function in class:SCMemProjNode
H A DphaseX.cpp743 if (n != NULL && !n->is_dead_loop_safe() && !n->is_CFG()) {
H A DloopTransform.cpp1483 assert(ctrl->is_CFG(), "must be control");
H A Dcompile.cpp3655 assert(!n->is_CFG() && !n->is_Mem(), "no cfg or memory nodes here");

Completed in 184 milliseconds