Lines Matching refs:it
127 for (changeset_ty::const_iterator it = S.begin(), ie = S.end(); it != ie; in ExecuteOneTest()
128 ++it) in ExecuteOneTest()
129 for (succ_iterator_ty it2 = succ_begin(*it), ie2 = succ_end(*it); in ExecuteOneTest()
183 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
184 ie = Changes.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
185 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
186 Successors.insert(std::make_pair(*it, std::vector<change_ty>())); in DAGDeltaAlgorithmImpl()
188 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(), in DAGDeltaAlgorithmImpl() local
189 ie = Dependencies.end(); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
190 Predecessors[it->second].push_back(it->first); in DAGDeltaAlgorithmImpl()
191 Successors[it->first].push_back(it->second); in DAGDeltaAlgorithmImpl()
195 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
196 ie = Changes.end(); it != ie; ++it) in DAGDeltaAlgorithmImpl()
197 if (succ_begin(*it) == succ_end(*it)) in DAGDeltaAlgorithmImpl()
198 Roots.push_back(*it); in DAGDeltaAlgorithmImpl()
207 for (pred_iterator_ty it = pred_begin(Change), in DAGDeltaAlgorithmImpl() local
208 ie = pred_end(Change); it != ie; ++it) { in DAGDeltaAlgorithmImpl()
209 SuccClosure[*it].insert(Change); in DAGDeltaAlgorithmImpl()
210 SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end()); in DAGDeltaAlgorithmImpl()
211 Worklist.push_back(*it); in DAGDeltaAlgorithmImpl()
216 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
217 ie = Changes.end(); it != ie; ++it) in DAGDeltaAlgorithmImpl()
218 PredClosure.insert(std::make_pair(*it, std::set<change_ty>())); in DAGDeltaAlgorithmImpl()
219 for (changeset_ty::const_iterator it = Changes.begin(), in DAGDeltaAlgorithmImpl() local
220 ie = Changes.end(); it != ie; ++it) in DAGDeltaAlgorithmImpl()
221 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl()
222 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) in DAGDeltaAlgorithmImpl()
223 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
229 for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end(); in DAGDeltaAlgorithmImpl()
230 it != ie; ++it) { in DAGDeltaAlgorithmImpl()
231 if (it != Changes.begin()) 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), ie2 = succ_end(*it); in DAGDeltaAlgorithmImpl()
239 if (it2 != succ_begin(*it)) in DAGDeltaAlgorithmImpl()
249 for (std::vector<change_ty>::const_iterator it = Roots.begin(), in DAGDeltaAlgorithmImpl()
251 it != ie; ++it) { in DAGDeltaAlgorithmImpl()
252 if (it != Roots.begin()) in DAGDeltaAlgorithmImpl()
254 llvm::errs() << *it; in DAGDeltaAlgorithmImpl()
259 for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end(); in DAGDeltaAlgorithmImpl()
260 it != ie; ++it) { in DAGDeltaAlgorithmImpl()
261 llvm::errs() << format(" %-4d: [", *it); in DAGDeltaAlgorithmImpl()
262 for (pred_closure_iterator_ty it2 = pred_closure_begin(*it), in DAGDeltaAlgorithmImpl()
263 ie2 = pred_closure_end(*it); in DAGDeltaAlgorithmImpl()
265 if (it2 != pred_closure_begin(*it)) in DAGDeltaAlgorithmImpl()
273 for (changeset_ty::const_iterator it = Changes.begin(), ie = Changes.end(); in DAGDeltaAlgorithmImpl()
274 it != ie; ++it) { in DAGDeltaAlgorithmImpl()
275 llvm::errs() << format(" %-4d: [", *it); in DAGDeltaAlgorithmImpl()
276 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it), in DAGDeltaAlgorithmImpl()
277 ie2 = succ_closure_end(*it); in DAGDeltaAlgorithmImpl()
279 if (it2 != succ_closure_begin(*it)) in DAGDeltaAlgorithmImpl()
294 for (changeset_ty::const_iterator it = Changes.begin(), in GetTestResult() local
295 ie = Changes.end(); it != ie; ++it) in GetTestResult()
296 Extended.insert(pred_closure_begin(*it), pred_closure_end(*it)); in GetTestResult()
343 for (changeset_ty::const_iterator it = CurrentMinSet.begin(), in Run() local
344 ie = CurrentMinSet.end(); it != ie; ++it) in Run()
345 CurrentSet.insert(pred_begin(*it), pred_end(*it)); in Run()