56 next (I iter)  in next()  argument
58   return ++iter;  in next()
164 term_list::insert (iterator iter, tree t)  in insert()  argument
167   iter = seq.insert (iter, t);  in insert()
173   return iter;  in insert()
180 term_list::erase (iterator iter)  in erase()  argument
182   gcc_assert (includes (*iter));  in erase()
183   term_entry ent = {*iter};  in erase()
185   iter = seq.erase (iter);  in erase()
186   return iter;  in erase()
194 term_list::replace (iterator iter, tree t)  in replace()  argument
196   iter = erase (iter);  in replace()
198     insert (iter, t);  in replace()
199   return iter;  in replace()
208 term_list::replace (iterator iter, tree t1, tree t2)  in replace()  argument
210   iter = erase (iter);  in replace()
212     insert (iter, t1);  in replace()
214     insert (iter, t2);  in replace()
215   return iter;  in replace()
371   term_list::iterator iter = ts.begin();  in analyze_pack()  local
373   while (iter != end)  in analyze_pack()
375       if (TREE_CODE (*iter) == TREE_CODE (t))  in analyze_pack()
377           tree c2 = normalize_expression (PACK_EXPANSION_PATTERN (*iter));  in analyze_pack()
383       ++iter;  in analyze_pack()
506   term_list::iterator iter = g.conclusions.begin ();  in check_goal()  local
509   while (iter != end)  in check_goal()
511       proof_result r = check_term (g.assumptions, *iter);  in check_goal()
516       ++iter;  in check_goal()
533   proof_state::iterator iter = p.begin();  in check_proof()  local
535   while (iter != end)  in check_proof()
537       proof_result r = check_goal (*iter);  in check_proof()
541         iter = p.discharge (iter);  in check_proof()
543         ++iter;  in check_proof()
586   term_list::iterator iter = g.assumptions.begin();  in load_assumptions()  local
588   while (iter != end)  in load_assumptions()
590       switch (TREE_CODE (*iter))  in load_assumptions()
593           iter = load_check_assumption (g.assumptions, iter);  in load_assumptions()
596           iter = load_parameterized_assumption (g.assumptions, iter);  in load_assumptions()
599           iter = load_conjunction_assumption (g.assumptions, iter);  in load_assumptions()
602           ++iter;  in load_assumptions()
613   proof_state::iterator iter = p.begin();  in load_assumptions()  local
614   while (iter != p.end())  in load_assumptions()
616       load_assumptions (*iter);  in load_assumptions()
617       ++iter;  in load_assumptions()
668   proof_state::iterator iter = p.begin();  in explode_assumptions()  local
670   while (iter != end)  in explode_assumptions()
672       if (explode_goal (p, iter))  in explode_assumptions()
674       ++iter;  in explode_assumptions()
697   term_list::iterator iter = g.conclusions.begin();  in load_conclusions()  local
699   while (iter != end)  in load_conclusions()
701       if (TREE_CODE (*iter) == DISJ_CONSTR)  in load_conclusions()
702         iter = load_disjunction_conclusion (g.conclusions, iter);  in load_conclusions()
704         ++iter;  in load_conclusions()
711   proof_state::iterator iter = p.begin();  in load_conclusions()  local
712   while (iter != p.end())  in load_conclusions()
714       load_conclusions (*iter);  in load_conclusions()
715       ++iter;  in load_conclusions()