Searched refs:is_block_proj (Results 1 - 9 of 9) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Drootnode.hpp43 virtual const Node *is_block_proj() const { return this; } function in class:RootNode
63 virtual const Node *is_block_proj() const { return this; } function in class:HaltNode
H A Dcfgnode.hpp109 virtual const Node* is_block_proj() const { return in(0); } function in class:JProjNode
226 virtual const Node *is_block_proj() const { return this; } function in class:GotoNode
242 virtual const Node *is_block_proj() const { return in(0); } function in class:CProjNode
419 virtual const Node* is_block_proj() const { return this; } function in class:JumpNode
H A Dblock.cpp416 const Node *x = proj->is_block_proj();
431 } while( !p->is_block_proj() &&
462 if(prevproj->is_block_proj() != prevproj) { // Control-dependent edge?
486 assert( pb->_nodes[ pb->_nodes.size() - pb->_num_succs ]->is_block_proj(),
859 const Node *x = end->is_block_proj();
869 assert( !p->is_block_proj() || p->is_Root(), "not a CFG" );
942 Node *bp = (Node*)b->_nodes[b->_nodes.size()-1]->is_block_proj();
H A Dblock.hpp263 // so (last->is_block_proj() != last) always, then simplify this code
267 assert(last->is_block_proj() == last || last->is_block_proj() == _nodes[last_idx - _num_succs], "");
268 return (last->is_block_proj() == last) ? last_idx : (last_idx - _num_succs);
H A DidealGraphPrinter.cpp506 if (node->is_block_proj()) {
507 print_prop("is_block_proj", "true");
H A Dnode.hpp809 virtual const Node *is_block_proj() const;
H A Dgcm.cpp90 // Nodes that have is_block_proj() nodes as their control need to use
96 const Node *p = in0->is_block_proj();
224 // to root and nodes that use is_block_proj() nodes should be attached
H A Dnode.cpp956 const Node *Node::is_block_proj() const { return 0; } function in class:Node
H A Dmatcher.cpp2366 if (x->is_Call() || x->is_SafePoint() || x->is_block_proj())

Completed in 68 milliseconds