Home
last modified time | relevance | path

Searched defs:i2 (Results 1 – 25 of 281) sorted by relevance

12345678910>>...12

/llvm-project/clang/test/Analysis/
H A Dstl-algorithm-modeling.cpp17 const auto i2 = return_any_iterator(V.begin()); test_find1() local
36 const auto i2 = return_any_iterator(V.begin()); test_find2() local
57 const auto i2 = return_any_iterator(V.begin()); test_find_if1() local
76 const auto i2 = return_any_iterator(V.begin()); test_find_if2() local
95 const auto i2 = return_any_iterator(V.begin()); test_find_if_not1() local
114 const auto i2 = return_any_iterator(V.begin()); test_find_if_not2() local
134 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of1() local
155 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of2() local
177 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of3() local
198 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of4() local
220 const auto i2 = return_any_iterator(V1.begin()); test_find_end1() local
241 const auto i2 = return_any_iterator(V1.begin()); test_find_end2() local
263 const auto i2 = return_any_iterator(V1.begin()); test_find_end3() local
284 const auto i2 = return_any_iterator(V1.begin()); test_find_end4() local
308 const auto i2 = return_any_iterator(V.begin()); test_lower_bound1() local
327 const auto i2 = return_any_iterator(V.begin()); test_lower_bound2() local
346 const auto i2 = return_any_iterator(V.begin()); test_upper_bound1() local
365 const auto i2 = return_any_iterator(V.begin()); test_upper_bound2() local
384 const auto i2 = return_any_iterator(V1.begin()); test_search1() local
405 const auto i2 = return_any_iterator(V1.begin()); test_search2() local
427 const auto i2 = return_any_iterator(V1.begin()); test_search3() local
448 const auto i2 = return_any_iterator(V1.begin()); test_search4() local
470 const auto i2 = return_any_iterator(V1.begin()); test_search5() local
491 const auto i2 = return_any_iterator(V.begin()); test_search_n1() local
510 const auto i2 = return_any_iterator(V.begin()); test_search_n2() local
531 const auto i2 = return_any_iterator(V.begin()); test_search_n3() local
550 const auto i2 = return_any_iterator(V.begin()); test_search_n4() local
[all...]
H A Dstl-algorithm-modeling-aggressive-std-find-modeling.cpp18 const auto i2 = return_any_iterator(V.begin()); test_find1() local
39 const auto i2 = return_any_iterator(V.begin()); test_find2() local
62 const auto i2 = return_any_iterator(V.begin()); test_find_if1() local
83 const auto i2 = return_any_iterator(V.begin()); test_find_if2() local
104 const auto i2 = return_any_iterator(V.begin()); test_find_if_not1() local
125 const auto i2 = return_any_iterator(V.begin()); test_find_if_not2() local
147 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of1() local
170 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of2() local
194 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of3() local
217 const auto i2 = return_any_iterator(V1.begin()); test_find_first_of4() local
241 const auto i2 = return_any_iterator(V1.begin()); test_find_end1() local
264 const auto i2 = return_any_iterator(V1.begin()); test_find_end2() local
288 const auto i2 = return_any_iterator(V1.begin()); test_find_end3() local
311 const auto i2 = return_any_iterator(V1.begin()); test_find_end4() local
337 const auto i2 = return_any_iterator(V.begin()); test_lower_bound1() local
358 const auto i2 = return_any_iterator(V.begin()); test_lower_bound2() local
379 const auto i2 = return_any_iterator(V.begin()); test_upper_bound1() local
400 const auto i2 = return_any_iterator(V.begin()); test_upper_bound2() local
421 const auto i2 = return_any_iterator(V1.begin()); test_search1() local
444 const auto i2 = return_any_iterator(V1.begin()); test_search2() local
468 const auto i2 = return_any_iterator(V1.begin()); test_search3() local
491 const auto i2 = return_any_iterator(V1.begin()); test_search4() local
515 const auto i2 = return_any_iterator(V1.begin()); test_search5() local
538 const auto i2 = return_any_iterator(V.begin()); test_search_n1() local
559 const auto i2 = return_any_iterator(V.begin()); test_search_n2() local
581 const auto i2 = return_any_iterator(V.begin()); test_search_n3() local
602 const auto i2 = return_any_iterator(V.begin()); test_search_n4() local
[all...]
H A Diterator-modeling.cpp145 auto i2 = i1; in copy() local
157 auto i2 = i1 + 2; in plus_lhs() local
169 auto i2 = 2 + i1; in plus_rhs() local
181 auto i2 in plus_lhs_negative() local
193 auto i2 = (-2) + i1; plus_rhs_negative() local
205 auto i2 = i1 - 2; minus() local
217 auto i2 = i1 - (-2); minus_negative() local
229 auto i2 = i1; copy_and_increment1() local
241 auto i2 = i1; copy_and_increment2() local
253 auto i2 = i1; copy_and_decrement1() local
265 auto i2 = i1; copy_and_decrement2() local
374 auto i0 = L1.cbegin(), i1 = L2.cbegin(), i2 = --L2.cend(), i3 = L2.cend(); list_move_assignment() local
393 auto i0 = V1.cbegin(), i1 = V2.cbegin(), i2 = --V2.cend(), i3 = V2.cend(); vector_move_assignment() local
411 auto i0 = D1.cbegin(), i1 = D2.cbegin(), i2 = --D2.cend(), i3 = D2.cend(); deque_move_assignment() local
430 auto i0 = FL1.cbegin(), i1 = FL2.cbegin(), i2 = FL2.cend(); forward_list_move_assignment() local
528 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_push_back() local
547 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_push_back() local
566 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_push_back() local
588 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_emplace_back() local
607 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_emplace_back() local
626 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_emplace_back() local
648 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_pop_back() local
667 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_pop_back() local
686 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_pop_back() local
728 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_push_front() local
785 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_emplace_front() local
824 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); list_pop_front() local
843 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); deque_pop_front() local
862 auto i0 = FL.cbegin(), i1 = ++FL.cbegin(), i2 = FL.cend(); forward_list_pop_front() local
895 auto i2 = L.insert(i0, n); list_insert_begin() local
906 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); list_insert_behind_begin() local
926 auto i0 = L.cbegin(), i1 = return_any_iterator(L.cbegin()), i2 = L.cend(); list_insert_unknown() local
945 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_insert_ahead_of_end() local
963 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_insert_end() local
990 auto i2 = V.insert(i0, n); vector_insert_begin() local
999 auto i0 = V.cbegin(), i1 = ++V.cbegin(), i2 = V.cend(); vector_insert_behind_begin() local
1015 auto i0 = V.cbegin(), i1 = return_any_iterator(V.cbegin()), i2 = V.cend(); vector_insert_unknown() local
1032 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_insert_ahead_of_end() local
1048 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_insert_end() local
1073 auto i2 = D.insert(i0, n); deque_insert_begin() local
1082 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); deque_insert_behind_begin() local
1097 auto i0 = D.cbegin(), i1 = return_any_iterator(D.cbegin()), i2 = D.cend(); deque_insert_unknown() local
1113 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_insert_ahead_of_end() local
1128 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_insert_end() local
1158 auto i2 = FL.insert_after(i0, n); forward_list_insert_after_begin() local
1169 auto i0 = FL.cbegin(), i1 = ++FL.cbegin(), i2 = FL.cend(); forward_list_insert_after_behind_begin() local
1187 auto i0 = FL.cbegin(), i1 = return_any_iterator(FL.cbegin()), i2 = FL.cend(); forward_list_insert_after_unknown() local
1223 auto i2 = L.emplace(i0, n); list_emplace_begin() local
1234 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); list_emplace_behind_begin() local
1254 auto i0 = L.cbegin(), i1 = return_any_iterator(L.cbegin()), i2 = L.cend(); list_emplace_unknown() local
1273 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_emplace_ahead_of_end() local
1291 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_emplace_end() local
1318 auto i2 = V.emplace(i0, n); vector_emplace_begin() local
1326 auto i0 = V.cbegin(), i1 = ++V.cbegin(), i2 = V.cend(); vector_emplace_behind_begin() local
1342 auto i0 = V.cbegin(), i1 = return_any_iterator(V.cbegin()), i2 = V.cend(); vector_emplace_unknown() local
1359 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_emplace_ahead_of_end() local
1375 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_emplace_end() local
1400 auto i2 = D.emplace(i0, n); deque_emplace_begin() local
1408 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); deque_emplace_behind_begin() local
1422 auto i0 = D.cbegin(), i1 = return_any_iterator(D.cbegin()), i2 = D.cend(); deque_emplace_unknown() local
1438 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_emplace_ahead_of_end() local
1453 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_emplace_end() local
1483 auto i2 = FL.emplace_after(i0, n); forward_list_emplace_after_begin() local
1495 auto i0 = FL.cbegin(), i1 = ++FL.cbegin(), i2 = FL.cend(); forward_list_emplace_after_behind_begin() local
1513 auto i0 = FL.cbegin(), i1 = return_any_iterator(FL.cbegin()), i2 = FL.cend(); forward_list_emplace_after_unknown() local
1545 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); list_erase_begin() local
1562 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); list_erase_behind_begin() local
1579 auto i0 = L.cbegin(), i1 = return_any_iterator(L.cbegin()), i2 = L.cend(); list_erase_unknown() local
1597 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); list_erase_ahead_of_end() local
1617 auto i0 = V.cbegin(), i1 = ++V.cbegin(), i2 = V.cend(); vector_erase_begin() local
1632 auto i0 = V.cbegin(), i1 = ++V.cbegin(), i2 = V.cend(); vector_erase_behind_begin() local
1648 auto i0 = V.cbegin(), i1 = return_any_iterator(V.cbegin()), i2 = V.cend(); vector_erase_unknown() local
1665 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); vector_erase_ahead_of_end() local
1689 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); deque_erase_begin() local
1704 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); deque_erase_behind_begin() local
1719 auto i0 = D.cbegin(), i1 = return_any_iterator(D.cbegin()), i2 = D.cend(); deque_erase_unknown() local
1735 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); deque_erase_ahead_of_end() local
1763 auto i0 = FL.cbegin(), i1 = ++FL.cbegin(), i2 = i1, i3 = FL.cend(); forward_list_erase_after_begin() local
1783 auto i0 = FL.cbegin(), i1 = return_any_iterator(FL.cbegin()), i2 = i1, forward_list_erase_after_unknown() local
1987 auto i2 = i1 + 2; plus_lhs_ptr_iterator() local
1999 auto i2 = 2 + i1; plus_rhs_ptr_iterator() local
2011 auto i2 = i1 - 2; minus_ptr_iterator() local
[all...]
/llvm-project/flang/test/Lower/PowerPC/
H A Dppc-vec-extract.f909 subroutine vec_extract_testf32(x, i1, i2, i4, i8) argument
58 subroutine vec_extract_testf64(x, i1, i2, i4, i8) argument
108 subroutine vec_extract_testi8(x, i1, i2, i4, i8) argument
157 subroutine vec_extract_testi16(x, i1, i2, i4, i8) argument
206 subroutine vec_extract_testi32(x, i1, i2, i4, i8) argument
255 subroutine vec_extract_testi64(x, i1, i2, i4, i8) argument
H A Dppc-vec-insert.f908 subroutine vec_insert_testf32(v, x, i1, i2, i4, i8) argument
62 subroutine vec_insert_testf64(v, x, i1, i2, i4, i8) argument
116 subroutine vec_insert_testi8(v, x, i1, i2, i4, i8) argument
170 subroutine vec_insert_testi16(v, x, i1, i2, i4, i8) argument
224 subroutine vec_insert_testi32(v, x, i1, i2, i4, i8) argument
278 subroutine vec_insert_testi64(v, x, i1, i2, i4, i8) argument
/llvm-project/libcxx/test/std/ranges/range.adaptors/range.lazy.split/range.lazy.split.outer/
H A Dincrement.pass.cpp34 decltype(auto) i2 = ++i; in test() local
45 decltype(auto) i2 = i++; in test() local
61 decltype(auto) i2 = ++i; in test() local
/llvm-project/libcxx/test/std/ranges/range.adaptors/range.lazy.split/range.lazy.split.inner/
H A Dincrement.pass.cpp42 decltype(auto) i2 = ++i; in test() local
53 decltype(auto) i2 = i++; in test() local
70 decltype(auto) i2 = ++i; in test() local
102 decltype(auto) i2 = ++i; in test() local
/llvm-project/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op!=/
H A Dnot_equal.pass.cpp28 std::istreambuf_iterator<char> i2(inf2); in main() local
67 std::istreambuf_iterator<char> i2(std::default_sentinel); in main() local
88 std::istreambuf_iterator<wchar_t> i2(inf2); in main() local
/llvm-project/libcxx/test/std/iterators/stream.iterators/istreambuf.iterator/istreambuf.iterator_op==/
H A Dequal.pass.cpp30 std::istreambuf_iterator<char> i2(inf2); in main() local
69 std::istreambuf_iterator<char> i2(std::default_sentinel); in main() local
90 std::istreambuf_iterator<wchar_t> i2(inf2); in main() local
/llvm-project/libcxx/test/libcxx/containers/unord/unord.multimap/
H A Dassert.local_iterator.dereference.pass.cpp29 C::const_local_iterator i2 = c.cend(0); in main() local
44 C::const_local_iterator i2 = c.cend(0); in main() local
H A Dassert.iterator.dereference.pass.cpp30 C::const_iterator i2 = c.cend(); in main() local
46 C::const_iterator i2 = c.cend(); in main() local
H A Dassert.iterator.increment.pass.cpp33 C::const_iterator i2 = c.cbegin(); in main() local
52 C::const_iterator i2 = c.cbegin(); in main() local
H A Dassert.local_iterator.increment.pass.cpp35 C::const_local_iterator i2 = c.cbegin(b); in main() local
58 C::const_local_iterator i2 = c.cbegin(b); in main() local
/llvm-project/libcxx/test/libcxx/containers/unord/unord.map/
H A Dassert.iterator.increment.pass.cpp33 C::const_iterator i2 = c.cbegin(); in main() local
52 C::const_iterator i2 = c.cbegin(); in main() local
H A Dassert.iterator.dereference.pass.cpp30 C::const_iterator i2 = c.cend(); in main() local
46 C::const_iterator i2 = c.cend(); in main() local
H A Dassert.local_iterator.dereference.pass.cpp29 C::const_local_iterator i2 = c.cend(0); in main() local
44 C::const_local_iterator i2 = c.cend(0); in main() local
H A Dassert.local_iterator.increment.pass.cpp35 C::const_local_iterator i2 = c.cbegin(b); in main() local
57 C::const_local_iterator i2 = c.cbegin(b); in main() local
/llvm-project/clang-tools-extra/test/clang-tidy/checkers/misc/
H A Dmisplaced-const.c13 const cip i2 = 0; // const applies to both pointer and pointee. in func() local
27 const cip i2, in func2()
36 const cip i2; member
/llvm-project/libcxx/test/libcxx/containers/unord/unord.set/
H A Dassert.iterator.increment.pass.cpp34 C::const_iterator i2 = c.cbegin(); in main() local
50 C::const_iterator i2 = c.cbegin(); in main() local
H A Dassert.local_iterator.dereference.pass.cpp30 C::const_local_iterator i2 = c.cend(0); in main() local
42 C::const_local_iterator i2 = c.cend(0); in main() local
H A Dassert.iterator.dereference.pass.cpp29 C::const_iterator i2 = c.cend(); in main() local
40 C::const_iterator i2 = c.cend(); in main() local
/llvm-project/libcxx/test/libcxx/containers/unord/unord.multiset/
H A Dassert.local_iterator.dereference.pass.cpp30 C::const_local_iterator i2 = c.cend(0); in main() local
42 C::const_local_iterator i2 = c.cend(0); in main() local
H A Dassert.iterator.dereference.pass.cpp29 C::const_iterator i2 = c.cend(); in main() local
40 C::const_iterator i2 = c.cend(); in main() local
H A Dassert.iterator.increment.pass.cpp34 C::const_iterator i2 = c.cbegin(); in main() local
50 C::const_iterator i2 = c.cbegin(); in main() local
/llvm-project/libcxx/test/std/utilities/utility/forward/
H A Dforward.pass.cpp73 constexpr int i2 = std::forward<int>(42); in main() local
83 constexpr int i2 = std::forward<int>(42); in main() local

12345678910>>...12