/external/selinux/mcstrans/share/examples/nato/setrans.d/ |
H A D | constraints.conf | 8 c0!c1
|
/external/clang/test/CodeGenCXX/ |
H A D | attr-notail.cpp | 9 int foo1(int a, Class1 *c1) { argument 11 return c1->m1(); 12 return c1->m2();
|
/external/bison/lib/ |
H A D | c-strcasecmp.c | 31 unsigned char c1, c2; local 38 c1 = c_tolower (*p1); 41 if (c1 == '\0') 47 while (c1 == c2); 50 return c1 - c2; 55 return (c1 > c2 ? 1 : c1 < c2 ? -1 : 0);
|
H A D | c-strncasecmp.c | 31 unsigned char c1, c2; local 38 c1 = c_tolower (*p1); 41 if (--n == 0 || c1 == '\0') 47 while (c1 == c2); 50 return c1 - c2; 55 return (c1 > c2 ? 1 : c1 < c2 ? -1 : 0);
|
/external/libcxx/test/std/numerics/complex.number/complex.literals/ |
H A D | literals1.pass.cpp | 22 std::complex<long double> c1 = 3.0il; local 23 assert ( c1 == std::complex<long double>(0, 3.0)); 25 assert ( c1 == c2 ); 29 std::complex<double> c1 = 3.0i; local 30 assert ( c1 == std::complex<double>(0, 3.0)); 32 assert ( c1 == c2 ); 36 std::complex<float> c1 = 3.0if; local 37 assert ( c1 == std::complex<float>(0, 3.0)); 39 assert ( c1 == c2 );
|
H A D | literals2.pass.cpp | 22 std::complex<long double> c1 = 3.0il; local 23 assert ( c1 == std::complex<long double>(0, 3.0)); 25 assert ( c1 == c2 ); 29 std::complex<double> c1 = 3.0i; local 30 assert ( c1 == std::complex<double>(0, 3.0)); 32 assert ( c1 == c2 ); 36 std::complex<float> c1 = 3.0if; local 37 assert ( c1 == std::complex<float>(0, 3.0)); 39 assert ( c1 == c2 );
|
/external/boringssl/src/crypto/fipsmodule/bn/asm/ |
H A D | x86_64-gcc.c | 102 BN_ULONG c1 = 0; local 105 return (c1); 109 mul_add(rp[0], ap[0], w, c1); 110 mul_add(rp[1], ap[1], w, c1); 111 mul_add(rp[2], ap[2], w, c1); 112 mul_add(rp[3], ap[3], w, c1); 118 mul_add(rp[0], ap[0], w, c1); 120 return c1; 122 mul_add(rp[1], ap[1], w, c1); 124 return c1; 134 BN_ULONG c1 = 0; local 289 BN_ULONG c1, c2, c3; local 391 BN_ULONG c1, c2, c3; local 429 BN_ULONG c1, c2, c3; local 503 BN_ULONG c1, c2, c3; local [all...] |
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
H A D | lv_value.pass.cpp | 25 test(C c1, typename C::difference_type j, argument 29 std::insert_iterator<C> q(c1, c1.begin() + j); 33 assert(c1 == c2); 51 C c1; local 53 c1.push_back(i); 54 C c2 = c1; 56 test(c1, 0, 'a', 'b', 'c', c2); 57 c2 = c1; 59 test(c1, 69 C c1; local [all...] |
/external/libcxx/test/std/containers/sequences/array/array.swap/ |
H A D | swap.pass.cpp | 36 C c1 = {1, 2, 3.5}; local 38 c1.swap(c2); 39 assert(c1.size() == 3); 40 assert(c1[0] == 4); 41 assert(c1[1] == 5); 42 assert(c1[2] == 6.5); 51 C c1 = {1, 2, 3.5}; local 53 std::swap(c1, c2); 54 assert(c1.size() == 3); 55 assert(c1[ 67 C c1 = {}; local 76 C c1 = {}; local [all...] |
/external/clang/test/Modules/ |
H A D | submodule-visibility-cycles.cpp | 5 C1 c1; variable
|
/external/jdiff/src/jdiff/ |
H A D | CompareClassPdiffs.java | 17 ClassDiff c1 = (ClassDiff)obj1; 19 if (c1.pdiff < c2.pdiff) 21 if (c1.pdiff > c2.pdiff) 23 return c1.name_.compareTo(c2.name_);
|
/external/pcre/dist2/src/ |
H A D | pcre2_string_utils.c | 68 PCRE2_UCHAR c1, c2; local 71 c1 = *str1++; 73 if (c1 != c2) return ((c1 > c2) << 1) - 1; 96 PCRE2_UCHAR c1, c2; local 99 c1 = *str1++; 101 if (c1 != c2) return ((c1 > c2) << 1) - 1; 123 PCRE2_UCHAR c1, c2; local 126 c1 152 PCRE2_UCHAR c1, c2; local [all...] |
/external/clang/test/Analysis/ |
H A D | padding_message.cpp | 5 char c1; member in struct:IntSandwich 12 char c1; member in struct:TurDuckHen 21 char c1; member in struct:SmallIntSandwich 39 char c1; member in struct:HoldsAUnion 61 char c1; member in struct:__anon1848 68 char c1; member in struct:StructAttrAlign 75 char c1; member in struct:OverlyAlignedChar 83 char c1; member in struct:HoldsOverlyAlignedChar 91 char c1; member in struct:X 101 char c1; member in struct:__anon1849 110 char c1; member in struct:DefaultAttrAlign 117 char c1; member in struct:SmallArrayShortSandwich 124 char c1; member in struct:SmallArrayInFunc 136 char c1; member in class:VirtualIntSandwich 144 char c1; member in class:InnerPaddedB 161 char c1; member in struct:__anon1850 164 char c1; member in struct:__anon1850::__anon1851 176 char c1; member in struct:Foo::Nested [all...] |
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | reverse.pass.cpp | 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 25 c1.reverse(); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 c1.reverse(); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
H A D | sort.pass.cpp | 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 25 c1.sort(); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 33 c1.sort(); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
H A D | sort_comp.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 c1.sort(std::greater<int>()); 27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 c1.sort(std::greater<int>()); 35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
/external/libcxx/test/std/containers/unord/unord.map/ |
H A D | swap_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 39 c1.swap(c2); 41 LIBCPP_ASSERT(c1.bucket_count() == 0); 42 assert(c1.size() == 0); 43 assert(c1.hash_function() == Hash(2)); 44 assert(c1.key_eq() == Compare(2)); 45 assert(c1.get_allocator().get_id() == 1); 46 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1 [all...] |
H A D | eq.pass.cpp | 44 const C c1(std::begin(a), std::end(a)); 46 assert(!(c1 == c2)); 47 assert( (c1 != c2)); 63 const C c1(std::begin(a), std::end(a)); 64 const C c2 = c1; 65 assert( (c1 == c2)); 66 assert(!(c1 != c2)); 82 C c1(std::begin(a), std::end(a)); 83 C c2 = c1; 85 assert( (c1 [all...] |
/external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
H A D | swap_non_member.pass.cpp | 36 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 39 swap(c1, c2); 41 LIBCPP_ASSERT(c1.bucket_count() == 0); 42 assert(c1.size() == 0); 43 assert(c1.hash_function() == Hash(2)); 44 assert(c1.key_eq() == Compare(2)); 45 assert(c1.get_allocator().get_id() == 1); 46 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1 [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/ |
H A D | swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 38 c1.swap(c2); 40 LIBCPP_ASSERT(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator().get_id() == 1); 45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1 [all...] |
/external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
H A D | swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 38 swap(c1, c2); 40 LIBCPP_ASSERT(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator().get_id() == 1); 45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1 [all...] |
/external/libcxx/test/std/containers/unord/unord.set/ |
H A D | swap_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 38 c1.swap(c2); 40 LIBCPP_ASSERT(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator().get_id() == 1); 45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1 [all...] |
/external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
H A D | swap_non_member.pass.cpp | 35 C c1(0, Hash(1), Compare(1), Alloc(1, 1)); 38 swap(c1, c2); 40 LIBCPP_ASSERT(c1.bucket_count() == 0); 41 assert(c1.size() == 0); 42 assert(c1.hash_function() == Hash(2)); 43 assert(c1.key_eq() == Compare(2)); 44 assert(c1.get_allocator().get_id() == 1); 45 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1 [all...] |
/external/boringssl/src/crypto/fipsmodule/bn/ |
H A D | generic.c | 129 BN_ULONG c1 = 0; local 133 return c1; 137 mul_add(rp[0], ap[0], w, c1); 138 mul_add(rp[1], ap[1], w, c1); 139 mul_add(rp[2], ap[2], w, c1); 140 mul_add(rp[3], ap[3], w, c1); 147 mul_add(rp[0], ap[0], w, c1); 153 return c1; 157 BN_ULONG c1 = 0; local 161 return c1; 462 BN_ULONG c1, c2, c3; local 564 BN_ULONG c1, c2, c3; local 602 BN_ULONG c1, c2, c3; local 676 BN_ULONG c1, c2, c3; local [all...] |
/external/python/cpython2/Modules/cjkcodecs/ |
H A D | emu_jisx0213_2000.h | 27 #define EMULATE_JISX0213_2000_DECODE_PLANE1(assi, c1, c2) \ 29 (((c1) == 0x2E && (c2) == 0x21) || \ 30 ((c1) == 0x2F && (c2) == 0x7E) || \ 31 ((c1) == 0x4F && (c2) == 0x54) || \ 32 ((c1) == 0x4F && (c2) == 0x7E) || \ 33 ((c1) == 0x74 && (c2) == 0x27) || \ 34 ((c1) == 0x7E && (c2) == 0x7A) || \ 35 ((c1) == 0x7E && (c2) == 0x7B) || \ 36 ((c1) == 0x7E && (c2) == 0x7C) || \ 37 ((c1) [all...] |