Lines Matching refs:it
27 // well formed predicates, this doesn't happen, but it commonly occurs in
131 for (changeset_ty::const_iterator it = S.begin(),
132 ie = S.end(); it != ie; ++it)
133 for (succ_iterator_ty it2 = succ_begin(*it),
134 ie2 = succ_end(*it); it2 != ie2; ++it2)
192 for (changeset_ty::const_iterator it = Changes.begin(),
193 ie = Changes.end(); it != ie; ++it) {
194 Predecessors.insert(std::make_pair(*it, std::vector<change_ty>()));
195 Successors.insert(std::make_pair(*it, std::vector<change_ty>()));
197 for (std::vector<edge_ty>::const_iterator it = Dependencies.begin(),
198 ie = Dependencies.end(); it != ie; ++it) {
199 Predecessors[it->second].push_back(it->first);
200 Successors[it->first].push_back(it->second);
204 for (changeset_ty::const_iterator it = Changes.begin(),
205 ie = Changes.end(); it != ie; ++it)
206 if (succ_begin(*it) == succ_end(*it))
207 Roots.push_back(*it);
216 for (pred_iterator_ty it = pred_begin(Change),
217 ie = pred_end(Change); it != ie; ++it) {
218 SuccClosure[*it].insert(Change);
219 SuccClosure[*it].insert(ChangeSuccs.begin(), ChangeSuccs.end());
220 Worklist.push_back(*it);
225 for (changeset_ty::const_iterator it = Changes.begin(),
226 ie = Changes.end(); it != ie; ++it)
227 PredClosure.insert(std::make_pair(*it, std::set<change_ty>()));
228 for (changeset_ty::const_iterator it = Changes.begin(),
229 ie = Changes.end(); it != ie; ++it)
230 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it),
231 ie2 = succ_closure_end(*it); it2 != ie2; ++it2)
232 PredClosure[*it2].insert(*it);
238 for (changeset_ty::const_iterator it = Changes.begin(),
239 ie = Changes.end(); it != ie; ++it) {
240 if (it != Changes.begin()) llvm::errs() << ", ";
241 llvm::errs() << *it;
243 if (succ_begin(*it) != succ_end(*it)) {
245 for (succ_iterator_ty it2 = succ_begin(*it),
246 ie2 = succ_end(*it); it2 != ie2; ++it2) {
247 if (it2 != succ_begin(*it)) llvm::errs() << ", ";
256 for (std::vector<change_ty>::const_iterator it = Roots.begin(),
257 ie = Roots.end(); it != ie; ++it) {
258 if (it != Roots.begin()) llvm::errs() << ", ";
259 llvm::errs() << *it;
264 for (changeset_ty::const_iterator it = Changes.begin(),
265 ie = Changes.end(); it != ie; ++it) {
266 llvm::errs() << format(" %-4d: [", *it);
267 for (pred_closure_iterator_ty it2 = pred_closure_begin(*it),
268 ie2 = pred_closure_end(*it); it2 != ie2; ++it2) {
269 if (it2 != pred_closure_begin(*it)) llvm::errs() << ", ";
276 for (changeset_ty::const_iterator it = Changes.begin(),
277 ie = Changes.end(); it != ie; ++it) {
278 llvm::errs() << format(" %-4d: [", *it);
279 for (succ_closure_iterator_ty it2 = succ_closure_begin(*it),
280 ie2 = succ_closure_end(*it); it2 != ie2; ++it2) {
281 if (it2 != succ_closure_begin(*it)) llvm::errs() << ", ";
295 for (changeset_ty::const_iterator it = Changes.begin(),
296 ie = Changes.end(); it != ie; ++it)
297 Extended.insert(pred_closure_begin(*it), pred_closure_end(*it));
344 for (changeset_ty::const_iterator it = CurrentMinSet.begin(),
345 ie = CurrentMinSet.end(); it != ie; ++it)
346 CurrentSet.insert(pred_begin(*it), pred_end(*it));
