Lines Matching refs:EdgeIterator
319 for (Graph::EdgeIterator ei = p->cfg.outgoing(); !ei.end(); ei.next())
342 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
364 for (Graph::EdgeIterator ei = bb->cfg.incident(); !ei.end(); ei.next()) {
462 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
520 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
547 for (Graph::EdgeIterator ei = bb->cfg.outgoing(); !ei.end(); ei.next()) {
636 static inline RIG_Node *get(const Graph::EdgeIterator& ei)
680 inline void checkInterference(const RIG_Node *, Graph::EdgeIterator&);
730 for (Graph::EdgeIterator ei = nodes[i].outgoing(); !ei.end(); ei.next())
732 for (Graph::EdgeIterator ei = nodes[i].incident(); !ei.end(); ei.next())
1142 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
1145 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next())
1191 EdgeIterator& ei)
1256 for (Graph::EdgeIterator ei = node->outgoing(); !ei.end(); ei.next())
1258 for (Graph::EdgeIterator ei = node->incident(); !ei.end(); ei.next())
