Lines Matching refs:it
126 for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie; in ExecuteOneTest()
127 ++it) in ExecuteOneTest()
128 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
203 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl() local
204 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
205 SuccClosure[*it].insert(Change); in DAGDeltaAlgorithmImpl()
206 SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end()); in DAGDeltaAlgorithmImpl()
207 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()
224 for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end(); in DAGDeltaAlgorithmImpl()
225 it != ie; ++it) { in DAGDeltaAlgorithmImpl()
226 if (it != Changes.begin()) in DAGDeltaAlgorithmImpl()
228 llvm::errs() << *it; in DAGDeltaAlgorithmImpl()
230 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl()
232 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
234 if (it2 != succ_begin(*it)) in DAGDeltaAlgorithmImpl()
244 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
246 it != ie; ++it) { in DAGDeltaAlgorithmImpl()
247 if (it != Roots.begin()) in DAGDeltaAlgorithmImpl()
249 llvm::errs() << *it; in DAGDeltaAlgorithmImpl()