Lines Matching refs:it
128 for (changeset_ty::const_iterator it = S.begin(), in ExecuteOneTest()
129 ie = S.end(); it != ie; ++it) in ExecuteOneTest()
130 for (succ_iterator_ty it2 = succ_begin(*it), in ExecuteOneTest()
131 ie2 = succ_end(*it); it2 != ie2; ++it2) in ExecuteOneTest()
184 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
185 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
186 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
187 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
189 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
190 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
191 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
192 Successors[it->first].push_back(it->second); in DAGDeltaAlgorithmImpl()
196 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
197 ie = Changes.end(); it != ie; ++it) in DAGDeltaAlgorithmImpl()
198 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl()
199 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
208 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl() local
209 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
210 SuccClosure[*it].insert(Change); in DAGDeltaAlgorithmImpl()
211 SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end()); in DAGDeltaAlgorithmImpl()
212 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()
217 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
218 ie = Changes.end(); it != ie; ++it) in DAGDeltaAlgorithmImpl()
219 PredClosure.insert(std::make_pair(*it, std::set<change_ty>())); in DAGDeltaAlgorithmImpl()
220 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
221 ie = Changes.end(); it != ie; ++it) in DAGDeltaAlgorithmImpl()
222 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl()
223 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) in DAGDeltaAlgorithmImpl()
224 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
230 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl()
231 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
232 if (it != Changes.begin()) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
233 llvm::errs() << *it; in DAGDeltaAlgorithmImpl()
235 if (succ_begin(*it) != succ_end(*it)) { in DAGDeltaAlgorithmImpl()
237 for (succ_iterator_ty it2 = succ_begin(*it), in DAGDeltaAlgorithmImpl()
238 ie2 = succ_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
239 if (it2 != succ_begin(*it)) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
248 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
249 ie = Roots.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
250 if (it != Roots.begin()) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
251 llvm::errs() << *it; in DAGDeltaAlgorithmImpl()
256 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl()
257 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
258 llvm::errs() << format(" %-4d: [", *it); in DAGDeltaAlgorithmImpl()
259 for (pred_closure_iterator_ty it2 = pred_closure_begin(*it), in DAGDeltaAlgorithmImpl()
260 ie2 = pred_closure_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
261 if (it2 != pred_closure_begin(*it)) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
268 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl()
269 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
270 llvm::errs() << format(" %-4d: [", *it); in DAGDeltaAlgorithmImpl()
271 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl()
272 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) { in DAGDeltaAlgorithmImpl()
273 if (it2 != succ_closure_begin(*it)) llvm::errs() << ", "; in DAGDeltaAlgorithmImpl()
287 for (changeset_ty::const_iterator it = Changes.begin(), in GetTestResult() local
288 ie = Changes.end(); it != ie; ++it) in GetTestResult()
289 Extended.insert(pred_closure_begin(*it), pred_closure_end(*it)); in GetTestResult()
336 for (changeset_ty::const_iterator it = CurrentMinSet.begin(), in Run() local
337 ie = CurrentMinSet.end(); it != ie; ++it) in Run()
338 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()