/external/valgrind/none/tests/s390x/ |
D | insert.stdout.exp | 1 ic 0000000000000000 <- 0000000000000000 = 0000000000000000 2 ic 0000000000000001 <- 0000000000000000 = 0000000000000000 3 ic 000000000000FFFF <- 0000000000000000 = 000000000000FF00 4 ic 0000000000007FFF <- 0000000000000000 = 0000000000007F00 5 ic 0000000000008000 <- 0000000000000000 = 0000000000008000 6 ic 00000000FFFFFFFF <- 0000000000000000 = 00000000FFFFFF00 7 ic 0000000080000000 <- 0000000000000000 = 0000000080000000 8 ic 000000007FFFFFFF <- 0000000000000000 = 000000007FFFFF00 9 ic AAAAAAAAAAAAAAAA <- 0000000000000000 = AAAAAAAAAAAAAA00 10 ic 8000000000000000 <- 0000000000000000 = 8000000000000000 [all …]
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
D | find_first_of.pass.cpp | 27 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local 32 …urn (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(i… in test_constexpr() 33 …&& (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)))… in test_constexpr() 34 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)))… in test_constexpr() 35 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)))… in test_constexpr() 36 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)))… in test_constexpr() 37 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)))… in test_constexpr() 53 int ic[] = {7}; in main() local 56 forward_iterator<const int*>(ic), in main() 57 forward_iterator<const int*>(ic + 1)) == in main() [all …]
|
D | find_first_of_pred.pass.cpp | 29 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3}; in test_constexpr() local 34 …n (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr() 35 … (std::find_first_of(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), e… in test_constexpr() 36 …&& (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)),… in test_constexpr() 37 … (std::find_first_of(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), e… in test_constexpr() 38 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)),… in test_constexpr() 39 … (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), e… in test_constexpr() 56 int ic[] = {7}; in main() local 59 forward_iterator<const int*>(ic), in main() 60 forward_iterator<const int*>(ic + 1), in main() [all …]
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
D | rotate.pass.cpp | 54 int ic[] = {0, 1, 2}; in test() local 55 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0])); in test() 56 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test() 57 assert(base(r) == ic+sc); in test() 58 assert(ic[0] == 0); in test() 59 assert(ic[1] == 1); in test() 60 assert(ic[2] == 2); in test() 61 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test() 62 assert(base(r) == ic+2); in test() 63 assert(ic[0] == 1); in test() [all …]
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
D | find_end.pass.cpp | 27 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local 32 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr() 33 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == F… in test_constexpr() 34 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia))) == B… in test_constexpr() 35 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == B… in test_constexpr() 36 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia))) == R… in test_constexpr() 37 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == R… in test_constexpr()
|
D | find_end_pred.pass.cpp | 36 int ic[] = {0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 0, 1, 2, 3, 0, 1, 2, 0, 1, 0}; in test_constexpr() local 41 …return (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ia)), FI(std::end(ia)… in test_constexpr() 42 …&& (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) … in test_constexpr() 43 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ia)), BI(std::end(ia)), eq) … in test_constexpr() 44 …&& (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) … in test_constexpr() 45 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)), eq) … in test_constexpr() 46 …&& (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) … in test_constexpr()
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
D | search_n.pass.cpp | 71 int ic[] = {0, 0, 0}; in test() local 72 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test() 73 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); in test() 74 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); in test() 75 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); in test() 76 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); in test() 77 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); in test() 80 (void)std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0); in test()
|
D | search_n_pred.pass.cpp | 139 int ic[] = {0, 0, 0}; in test() local 140 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test() 141 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic)); in test() 144 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic)); in test() 147 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic)); in test() 150 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic)); in test() 153 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc)); in test() 158 …TEST_IGNORE_NODISCARD std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(4), 0, co… in test()
|
D | search.pass.cpp | 40 int ic[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test_constexpr() local 41 return (std::search(std::begin(ic), std::end(ic), std::begin(ia), std::end(ia)) == ic+3) in test_constexpr() 42 … && (std::search(std::begin(ic), std::end(ic), std::begin(ib), std::end(ib)) == std::end(ic)) in test_constexpr() 43 && (std::search(std::begin(ic), std::end(ic), MySearcherC()) == std::begin(ic)) in test_constexpr() 80 int ic[] = {1}; in test() local 81 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); in test()
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
D | mismatch.pass.cpp | 31 int ic[] = {1, 3, 5, 7}; in test_constexpr() local 35 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic)); in test_constexpr() 36 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr() 39 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)); in test_constexpr() 40 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr() 43 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); in test_constexpr() 44 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr() 47 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); in test_constexpr() 48 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr() 51 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); in test_constexpr() [all …]
|
D | mismatch_pred.pass.cpp | 36 int ic[] = {1, 3, 5, 7}; in test_constexpr() local 40 auto p1 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), eq); in test_constexpr() 41 if (p1.first != ia+2 || p1.second != ic+2) in test_constexpr() 44 auto p2 = std::mismatch(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq); in test_constexpr() 45 if (p2.first != ia+2 || p2.second != ic+2) in test_constexpr() 48 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); in test_constexpr() 49 if (p3.first != ib+2 || p3.second != ic+2) in test_constexpr() 52 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); in test_constexpr() 53 if (p4.first != ib+2 || p4.second != ic+2) in test_constexpr() 56 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); in test_constexpr() [all …]
|
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/ |
D | p7.cpp | 13 void test_capture_constness(int i, const int ic) { in test_capture_constness() argument 14 (void)[i,ic] ()->void { in test_capture_constness() 16 float &fr2 = check_const_int(ic); in test_capture_constness() 21 float &fr2 = check_const_int(ic); in test_capture_constness() 24 (void)[i,ic] () mutable ->void { in test_capture_constness() 26 float &fr = check_const_int(ic); in test_capture_constness() 31 float &fr = check_const_int(ic); in test_capture_constness() 34 (void)[&i,&ic] ()->void { in test_capture_constness() 36 float &fr = check_const_int(ic); in test_capture_constness() 41 float &fr = check_const_int(ic); in test_capture_constness()
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
D | merge.pass.cpp | 54 int* ic = new int[2*N]; in test() local 60 InIter2(ib), InIter2(ib+N), OutIter(ic)); in test() 61 assert(base(r) == ic+2*N); in test() 62 assert(ic[0] == 0); in test() 63 assert(ic[2*N-1] == static_cast<int>(2*N-1)); in test() 64 assert(std::is_sorted(ic, ic+2*N)); in test() 65 delete [] ic; in test() 73 int* ic = new int[2*N]; in test() local 75 ic[i] = i; in test() 76 std::shuffle(ic, ic+2*N, randomness); in test() [all …]
|
D | merge_comp.pass.cpp | 59 int* ic = new int[2*N]; in test() local 68 InIter2(ib), InIter2(ib+N), OutIter(ic), pred); in test() 69 assert(base(r) == ic+2*N); in test() 70 assert(ic[0] == static_cast<int>(2*N-1)); in test() 71 assert(ic[2*N-1] == 0); in test() 72 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test() 74 delete [] ic; in test() 82 int* ic = new int[2*N]; in test() local 84 ic[i] = i; in test() 85 std::shuffle(ic, ic+2*N, randomness); in test() [all …]
|
/external/libpcap/ |
D | optimize.c | 241 find_levels_r(opt_state_t *opt_state, struct icode *ic, struct block *b) in find_levels_r() argument 245 if (isMarked(ic, b)) in find_levels_r() 248 Mark(ic, b); in find_levels_r() 252 find_levels_r(opt_state, ic, JT(b)); in find_levels_r() 253 find_levels_r(opt_state, ic, JF(b)); in find_levels_r() 269 find_levels(opt_state_t *opt_state, struct icode *ic) in find_levels() argument 272 unMarkAll(ic); in find_levels() 273 find_levels_r(opt_state, ic, ic->root); in find_levels() 604 fold_op(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in fold_op() argument 946 opt_stmt(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in opt_stmt() argument [all …]
|
/external/python/cpython2/Lib/plat-mac/ |
D | ic.py | 164 def __init__(self, signature='Pyth', ic=None): argument 165 if ic: 166 self.ic = ic 168 self.ic = icglue.ICStart(signature) 169 if hasattr(self.ic, 'ICFindConfigFile'): 170 self.ic.ICFindConfigFile() 175 self.ic.ICBegin(icReadOnlyPerm) 176 num = self.ic.ICCountPref() 178 rv.append(self.ic.ICGetIndPref(i+1)) 179 self.ic.ICEnd() [all …]
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
D | reverse.pass.cpp | 39 int ic[] = {0, 1, 2}; in test() local 40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test() 41 std::reverse(Iter(ic), Iter(ic+sc)); in test() 42 assert(ic[0] == 2); in test() 43 assert(ic[1] == 1); in test() 44 assert(ic[2] == 0); in test()
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
D | equal.pass.cpp | 32 int ic[] = {1, 3, 5, 7}; in test_constexpr() local 36 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic)) in test_constexpr() 37 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)) in test_constexpr() 38 && std::equal(std::begin(ib), std::end(ib), std::begin(ic)) in test_constexpr() 39 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)) in test_constexpr() 41 && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))) in test_constexpr() 42 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic))) in test_constexpr()
|
D | equal_pred.pass.cpp | 39 int ic[] = {1, 3, 5, 7}; in test_constexpr() local 43 return !std::equal(std::begin(ia), std::end(ia), std::begin(ic) , eq) in test_constexpr() 44 && !std::equal(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic), eq) in test_constexpr() 45 && std::equal(std::begin(ib), std::end(ib), std::begin(ic) , eq) in test_constexpr() 46 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq) in test_constexpr() 48 … && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)) , eq) in test_constexpr() 49 … && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq) in test_constexpr()
|
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
D | unique.pass.cpp | 55 int ic[] = {0, 0}; in test() local 56 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test() 57 r = std::unique(Iter(ic), Iter(ic+sc)); in test() 58 assert(base(r) == ic + 1); in test() 59 assert(ic[0] == 0); in test() 128 Ptr ic[2]; in test1() local 129 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1() 130 r = std::unique(Iter(ic), Iter(ic+sc)); in test1() 131 assert(base(r) == ic + 1); in test1() 132 assert(ic[0] == 0); in test1()
|
D | unique_pred.pass.cpp | 69 int ic[] = {0, 0}; in test() local 70 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test() 72 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test() 73 assert(base(r) == ic + 1); in test() 74 assert(ic[0] == 0); in test() 158 Ptr ic[2]; in test1() local 159 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1() 161 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test1() 162 assert(base(r) == ic + 1); in test1() 163 assert(ic[0] == 0); in test1()
|
/external/skqp/tests/ |
D | SGTest.cpp | 28 sksg::InvalidationController ic; in check_inval() local 29 const auto bbox = root->revalidate(&ic, SkMatrix::I()); in check_inval() 34 ic.bounds().left(), ic.bounds().top(), ic.bounds().right(), ic.bounds().bottom()); in check_inval() 38 REPORTER_ASSERT(reporter, ic.bounds() == expected_inval_bounds); in check_inval() 41 const auto damage_count = SkTo<size_t>(ic.end() - ic.begin()); in check_inval() 45 r2 = ic.begin()[i]; in check_inval()
|
/external/skia/tests/ |
D | SGTest.cpp | 28 sksg::InvalidationController ic; in check_inval() local 29 const auto bbox = root->revalidate(&ic, SkMatrix::I()); in check_inval() 34 ic.bounds().left(), ic.bounds().top(), ic.bounds().right(), ic.bounds().bottom()); in check_inval() 38 REPORTER_ASSERT(reporter, ic.bounds() == expected_inval_bounds); in check_inval() 41 const auto damage_count = SkTo<size_t>(ic.end() - ic.begin()); in check_inval() 45 r2 = ic.begin()[i]; in check_inval()
|
/external/tensorflow/tensorflow/core/kernels/neon/ |
D | depthwiseconv_float.h | 189 int ic = 0; 191 for (; ic <= input_depth - 16; ic += 16) { 220 for (; ic <= input_depth - 4; ic += 4) { 239 for (; ic < input_depth; ic++) { 258 int ic = 0; 260 for (; ic <= input_depth - 2; ic += 2) { 287 for (; ic < input_depth; ic++) { 325 int ic = 0; 327 for (; ic <= input_depth - 8; ic += 8) { 358 for (; ic <= input_depth - 4; ic += 4) { [all …]
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
D | includes.pass.cpp | 28 int ic[] = {3, 3, 3, 3}; in test_constexpr() local 31 && !std::includes(std::begin(ia), std::end(ia), std::begin(ic), std::end(ic)) in test_constexpr() 44 int ic[] = {1, 2}; in test() local 45 const unsigned sc = sizeof(ic)/sizeof(ic[0]); ((void)sc); in test() 57 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2))); in test()
|