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