Lines Matching refs:next
126 for( BLEdgeIterator next = node->succBegin(),
127 end = node->succEnd(); next != end; next++ ) {
128 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges
129 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges
130 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber
131 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one?
132 best = *next;
144 BallLarusEdge* next = getNextEdge(currentNode, increment);
146 increment -= next->getWeight();
148 if( next->getType() != BallLarusEdge::BACKEDGE_PHONY &&
149 next->getType() != BallLarusEdge::SPLITEDGE_PHONY &&
150 next->getTarget() != _ppi->_currentDag->getExit() )
152 next->getSource()->getBlock(),
153 next->getTarget()->getBlock(),
154 next->getDuplicateNumber()));
156 if( next->getType() == BallLarusEdge::BACKEDGE_PHONY &&
157 next->getTarget() == _ppi->_currentDag->getExit() )
159 next->getRealEdge()->getSource()->getBlock(),
160 next->getRealEdge()->getTarget()->getBlock(),
161 next->getDuplicateNumber()));
163 if( next->getType() == BallLarusEdge::SPLITEDGE_PHONY &&
164 next->getSource() == _ppi->_currentDag->getRoot() )
166 next->getRealEdge()->getSource()->getBlock(),
167 next->getRealEdge()->getTarget()->getBlock(),
168 next->getDuplicateNumber()));
171 currentNode = next->getTarget();
183 BallLarusEdge* next = getNextEdge(currentNode, increment);
184 increment -= next->getWeight();
187 if( next->getType() == BallLarusEdge::NORMAL)
190 else if( next->getTarget() == _ppi->_currentDag->getExit() ) {
192 pbv->push_back (next->getRealEdge()->getTarget()->getBlock());
196 currentNode = next->getTarget();
