lib/Support/DAGDeltaAlgorithm.cpp

27 // well formed predicates, this doesn't happen, but it commonly occurs in
129         for (changeset_ty::const_iterator it = S.begin(),
130                ie = S.end(); it != ie; ++it)
131           for (succ_iterator_ty it2 = succ_begin(*it),
132                  ie2 = succ_end(*it); it2 != ie2; ++it2)
190   for (changeset_ty::const_iterator it = Changes.begin(),
191          ie = Changes.end(); it != ie; ++it) {
192     Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
193     Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
195   for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(),
196          ie = Dependencies.end(); it != ie; ++it) {
197     Predecessors[it->second].push_back(it->first);
198     Successors[it->first].push_back(it->second);
202   for (changeset_ty::const_iterator it = Changes.begin(),
203          ie = Changes.end(); it != ie; ++it)
204     if (succ_begin(*it) == succ_end(*it))
205       Roots.push_back(*it);
214     for (pred_iterator_ty it = pred_begin(Change),
215            ie = pred_end(Change); it != ie; ++it) {
216       SuccClosure[*it].insert(Change);
217       SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end());
218       Worklist.push_back(*it);
223   for (changeset_ty::const_iterator it = Changes.begin(),
224          ie = Changes.end(); it != ie; ++it)
225     PredClosure.insert(std::make_pair(*it, std::set<change_ty>()));
226   for (changeset_ty::const_iterator it = Changes.begin(),
227          ie = Changes.end(); it != ie; ++it)
228     for (succ_closure_iterator_ty it2 = succ_closure_begin(*it),
229            ie2 = succ_closure_end(*it); it2 != ie2; ++it2)
230       PredClosure[*it2].insert(*it);
236       for (changeset_ty::const_iterator it = Changes.begin(),
237              ie = Changes.end(); it != ie; ++it) {
238         if (it != Changes.begin()) llvm::errs() << ", ";
239         llvm::errs() << *it;
241         if (succ_begin(*it) != succ_end(*it)) {
243           for (succ_iterator_ty it2 = succ_begin(*it),
244                  ie2 = succ_end(*it); it2 != ie2; ++it2) {
245             if (it2 != succ_begin(*it)) llvm::errs() << ", ";
254       for (std::vector<change_ty>::const_iterator it = Roots.begin(),
255              ie = Roots.end(); it != ie; ++it) {
256         if (it != Roots.begin()) llvm::errs() << ", ";
257         llvm::errs() << *it;
262       for (changeset_ty::const_iterator it = Changes.begin(),
263              ie = Changes.end(); it != ie; ++it) {
264         llvm::errs() << format("  %-4d: [", *it);
265         for (pred_closure_iterator_ty it2 = pred_closure_begin(*it),
266                ie2 = pred_closure_end(*it); it2 != ie2; ++it2) {
267           if (it2 != pred_closure_begin(*it)) llvm::errs() << ", ";
274       for (changeset_ty::const_iterator it = Changes.begin(),
275              ie = Changes.end(); it != ie; ++it) {
276         llvm::errs() << format("  %-4d: [", *it);
277         for (succ_closure_iterator_ty it2 = succ_closure_begin(*it),
278                ie2 = succ_closure_end(*it); it2 != ie2; ++it2) {
279           if (it2 != succ_closure_begin(*it)) llvm::errs() << ", ";
293   for (changeset_ty::const_iterator it = Changes.begin(),
294          ie = Changes.end(); it != ie; ++it)
295     Extended.insert(pred_closure_begin(*it), pred_closure_end(*it));
342     for (changeset_ty::const_iterator it = CurrentMinSet.begin(),
343            ie = CurrentMinSet.end(); it != ie; ++it)
344       CurrentSet.insert(pred_begin(*it), pred_end(*it));