/external/compiler-rt/test/asan/TestCases/Helpers/ |
H A D | initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | move_alloc.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[ 55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
H A D | move_assign.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 42 int* an = ab + sizeof(ab)/sizeof(ab[ 57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
H A D | move.pass.cpp | 25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[ 56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
H A D | copy.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); 34 test(std::deque<int>(ab, an)); 50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 51 int* an = ab + sizeof(ab)/sizeof(ab[0]); 52 test(std::deque<int, min_allocator<int>>(ab, a [all...] |
H A D | copy_alloc.pass.cpp | 32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); 34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), 38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); 40 test(std::deque<int, other_allocator<int> >(ab, a 45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local [all...] |
H A D | op_equal.pass.cpp | 31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); 33 test(std::deque<int>(ab, an)); 51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); 53 test(std::deque<int, min_allocator<int>>(ab, a [all...] |
H A D | iter_iter.pass.cpp | 53 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 54 int* an = ab + sizeof(ab)/sizeof(ab[0]); 55 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 56 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 57 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 58 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 59 test<limited_allocator<int, 4096> >(ab, an); 61 test<min_allocator<int> >(ab, a [all...] |
H A D | iter_iter_alloc.pass.cpp | 40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 41 int* an = ab + sizeof(ab)/sizeof(ab[0]); 42 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 43 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 44 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 45 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 47 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 48 test(forward_iterator<const int*>(ab), forward_iterato [all...] |
/external/harfbuzz_ng/src/ |
H A D | hb-ot-shape-complex-hebrew.cc | 34 hb_codepoint_t *ab) 71 bool found = (bool) c->unicode->compose (a, b, ab); 80 *ab = 0xFB1Du; 86 *ab = 0xFB1Fu; 89 *ab = 0xFB2Eu; 95 *ab = 0xFB2Fu; 101 *ab = 0xFB4Bu; 107 *ab = sDageshForms[a - 0x05D0u]; 108 found = (*ab != 0); 110 *ab 31 compose_hebrew(const hb_ot_shape_normalize_context_t *c, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument [all...] |
H A D | hb-ucdn.cc | 203 hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, 206 return ucdn_compose(ab, a, b); 211 hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, 214 return ucdn_decompose(ab, a, b); 202 hb_ucdn_compose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, void *user_data HB_UNUSED) argument 210 hb_ucdn_decompose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, void *user_data HB_UNUSED) argument
|
H A D | hb-glib.cc | 243 hb_codepoint_t *ab, 247 return g_unichar_compose (a, b, ab); 266 *ab = g_utf8_get_char (normalized); 278 hb_codepoint_t ab, 284 return g_unichar_decompose (ab, a, b); 295 len = g_unichar_to_utf8 (ab, utf8); 304 ret = *a != ab; 308 /* Here's the ugly part: if ab decomposes to a single character and 313 if (c != ab && c != *a) { 240 hb_glib_unicode_compose(hb_unicode_funcs_t *ufuncs HB_UNUSED, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, void *user_data HB_UNUSED) argument 277 hb_glib_unicode_decompose(hb_unicode_funcs_t *ufuncs HB_UNUSED, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, void *user_data HB_UNUSED) argument
|
H A D | hb-icu.cc | 175 hb_codepoint_t *ab, 182 *ab = ret; 207 U16_GET_UNSAFE (normalized, 0, *ab); 218 hb_codepoint_t ab, 228 len = unorm2_getRawDecomposition (normalizer, ab, decomposed, 236 return *a != ab; 260 U16_APPEND (utf16, len, ARRAY_LENGTH (utf16), ab, err); 273 ret = *a != ab; 279 /* Here's the ugly part: if ab decomposes to a single character and 289 if (c != *a && c != ab) { 172 hb_icu_unicode_compose(hb_unicode_funcs_t *ufuncs HB_UNUSED, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, void *user_data HB_UNUSED) argument 217 hb_icu_unicode_decompose(hb_unicode_funcs_t *ufuncs HB_UNUSED, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, void *user_data HB_UNUSED) argument [all...] |
H A D | hb-unicode.cc | 85 hb_codepoint_t *ab HB_UNUSED, 93 hb_codepoint_t ab HB_UNUSED, 392 * @ab: (out): 404 hb_codepoint_t *ab) 406 return ufuncs->compose (a, b, ab); 412 * @ab: 424 hb_codepoint_t ab, 428 return ufuncs->decompose (ab, a, b); 401 hb_unicode_compose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument 423 hb_unicode_decompose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b) argument
|
H A D | hb-ot-shape-normalize.cc | 75 hb_codepoint_t ab, 79 return (bool) c->unicode->decompose (ab, a, b); 86 hb_codepoint_t *ab) 88 return (bool) c->unicode->compose (a, b, ab); 120 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) argument 126 if (!c->decompose (c, ab, &a, &b) || 74 decompose_unicode(const hb_ot_shape_normalize_context_t *c, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b) argument 83 compose_unicode(const hb_ot_shape_normalize_context_t *c, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument
|
/external/pcre/dist2/src/ |
H A D | pcre2_valid_utf.c | 136 register uint32_t ab, d; local 155 ab = PRIV(utf8_table4)[c & 0x3f]; /* Number of additional bytes (1-5) */ 156 if (length < ab) /* Missing bytes */ 159 switch(ab - length) 168 length -= ab; /* Length remaining */ 182 switch (ab) 310 if (ab > 3) 312 *erroroffset = (int)(p - string) - ab; 313 return (ab == 4)? PCRE2_ERROR_UTF8_ERR11 : PCRE2_ERROR_UTF8_ERR12;
|
/external/clang/test/Sema/ |
H A D | decl-in-prototype.c | 23 struct ab { // expected-note {{previous definition is here}} expected-note {{previous definition is here}} struct in struct:aA 28 int f5(struct aA { struct ab { int j; } b; struct ab { char glorx; } glorx; } *); // expected-warning {{declaration of 'struct aA' will not be visible}} expected-warning {{redefinition of 'ab' will not be visible}} expected-warning {{redefinition of 'ab' will not be visible}}
|
H A D | string-plus-char.c | 5 const char *foo(const struct AB *ab) { argument 6 return ab->a + 'b'; // expected-warning {{adding 'char' to a string pointer does not append to the string}} expected-note {{use array indexing to silence this warning}} 23 struct AB ab; local 24 constStr = foo(&ab) + 'c'; // expected-warning {{adding 'char' to a string pointer does not append to the string}} expected-note {{use array indexing to silence this warning}}
|
/external/compiler-rt/lib/builtins/ppc/ |
H A D | gcc_qmul.c | 21 double ab, tmp, tau; local 23 ab = A * B; 26 if (ab == 0.0) { 27 dst.s.hi = ab; 32 const doublebits abBits = { .d = ab }; 34 dst.s.hi = ab; 45 tmp = LOWORDER(ab, aHi, aLo, bHi, bLo); 47 tau = ab + tmp; 49 dst.s.lo = (ab - tau) + tmp;
|
/external/clang/test/CodeGenCXX/ |
H A D | atomicinit.cpp | 40 void atomic_init_bool(_Atomic(bool) *ab, bool b) { 44 __c11_atomic_init(ab, b); 49 _Atomic(bool) ab; member in struct:AtomicBoolMember 57 AtomicBoolMember::AtomicBoolMember(bool b) : ab(b) { }
|
/external/deqp/framework/common/ |
H A D | tcuRGBA.cpp | 89 int ab = (bPacked >> RGBA::ALPHA_SHIFT) & 0xFF; local 91 aDiff = (deUint8)deAbs32(aa - ab);
|
/external/eigen/unsupported/test/ |
H A D | kronecker_product.cpp | 19 void check_dimension(const MatrixType& ab, const int rows, const int cols) argument 21 VERIFY_IS_EQUAL(ab.rows(), rows); 22 VERIFY_IS_EQUAL(ab.cols(), cols); 27 void check_kronecker_product(const MatrixType& ab) argument 29 VERIFY_IS_EQUAL(ab.rows(), 6); 30 VERIFY_IS_EQUAL(ab.cols(), 6); 31 VERIFY_IS_EQUAL(ab.nonZeros(), 36); 32 VERIFY_IS_APPROX(ab.coeff(0,0), -0.4017367630386106); 33 VERIFY_IS_APPROX(ab.coeff(0,1), 0.1056863433932735); 34 VERIFY_IS_APPROX(ab 72 check_sparse_kronecker_product(const MatrixType& ab) argument [all...] |
/external/eigen/blas/ |
H A D | level1_impl.h | 89 Scalar ab = abs(b); local 90 if((aa+ab)==Scalar(0)) 100 Scalar amax = aa>ab ? a : b; 105 if (aa > ab) z = *s; 106 if (ab > aa && *c!=RealScalar(0))
|
/external/guice/core/test/com/google/inject/ |
H A D | MembersInjectorTest.java | 279 @Inject A<B> ab; field in class:MembersInjectorTest.InjectsMembersInjector
|
/external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
H A D | p4.cpp | 128 HasMixins<A, B> ab; local 129 HasMixins<A, B> ab2 = ab;
|