Lines Matching defs:next
64 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
67 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
70 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
101 for (Instruction *i = getFirst(); i; i = i->next)
106 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
124 assert(inst->next == 0 && inst->prev == 0);
158 assert(inst->next == 0 && inst->prev == 0);
190 assert(p->next == 0 && p->prev == 0);
205 p->next = q;
208 p->prev->next = p;
221 assert(q->next == 0 && q->prev == 0);
229 q->next = p->next;
230 if (q->next)
231 q->next->prev = q;
232 p->next = q;
244 insn->prev->next = insn->next;
246 if (insn->next)
247 insn->next->prev = insn->prev;
252 if (insn->next)
253 entry = insn->next;
262 phi = (insn->next && insn->next->op == OP_PHI) ? insn->next : 0;
266 insn->next =
274 if (a->next != b) {
279 assert(a->next == b);
288 a->next = b->next;
289 b->next = a;
293 b->prev->next = b;
294 if (a->next)
295 a->next->prev = a;
309 exit->next = NULL;
319 for (; insn; insn = insn->next) {
351 splitCommon(insn ? insn->next : NULL, bb, attach);
378 for (Graph::EdgeIterator ei = cfg.outgoing(); !ei.end(); ei.next())
421 for (IteratorRef it = cfg.iteratorCFG(); !it->end(); it->next()) {
425 for (Instruction *insn = bb->getFirst(); insn; insn = insn->next)
438 for (ArrayList::Iterator bi = allBBlocks.iterator(); !bi.end(); bi.next())
448 for (ArrayList::Iterator bi = allBBlocks.iterator(); !bi.end(); bi.next())
464 !it->end(); it->next()) {
485 Instruction *insn, *next;
493 for (; !bbIter->end(); bbIter->next()) {
498 insn = next) {
499 next = insn->next;
520 for (IteratorRef it = cfg.iteratorDFS(); !it->end(); it->next()) {
524 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {