Lines Matching refs:next
84 for (IteratorRef it = cfg->iteratorDFS(true); !it->end(); it->next(), ++i) {
102 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next()) {
145 for (Graph::EdgeIterator ei = nw->incident(); !ei.end(); ei.next()) {
194 for (IteratorRef dtIt = iteratorDFS(false); !dtIt->end(); dtIt->next()) {
200 for (succIt = bb->cfg.outgoing(); !succIt.end(); succIt.next()) {
206 for (chldIt = bb->dom.outgoing(); !chldIt.end(); chldIt.next()) {
210 for (; !dfIt.end(); dfIt.next()) {
230 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
245 for (Instruction *i = bb->getEntry(); i; i = i->next) {
271 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
280 for (Instruction *i = bb->getEntry(); i; i = i->next) {
308 for (ArrayList::Iterator fi = allFuncs.iterator(); !fi.end(); fi.next()) {
373 for (; !dfIter.end(); dfIter.next()) {
475 for (Instruction *stmt = bb->getFirst(); stmt; stmt = stmt->next) {
503 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
509 for (Graph::EdgeIterator ei = sb->cfg.incident(); !ei.end(); ei.next()) {
516 for (phi = sb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) {
525 for (Graph::EdgeIterator ei = bb->dom.outgoing(); !ei.end(); ei.next())
545 for (Instruction *stmt = bb->getFirst(); stmt; stmt = stmt->next) {