/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-319722-ArrayBuffer.js | 30 var ab; variable 33 for (k = 8; k >= 1 && ab == null; k = k/2) { 35 ab = new ArrayBuffer(maxSize * k); 37 ab = null; 41 assertTrue(ab != null); 45 new constr(ab, 0, maxSize);
|
H A D | regress-581.js | 39 var ab = a.concat(b); variable 40 assertEquals(2 * pow31 - 1, ab.length); 41 assertEquals(31, ab[pow31]); 42 assertEquals(32, ab[2 * pow31 - 1]);
|
H A D | regress-copy-hole-to-field.js | 47 var o = {ab:5}; 50 o.ab = a[i]; 57 assertEquals(undefined, o.ab);
|
/external/compiler-rt/test/asan/TestCases/Helpers/ |
H A D | initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
/external/libcxx/test/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 | 30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 31 int* an = ab + sizeof(ab)/sizeof(ab[0]); 32 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 | 52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 53 int* an = ab + sizeof(ab)/sizeof(ab[0]); 54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 58 test<stack_allocator<int, 4096> >(ab, an); 60 test<min_allocator<int> >(ab, a [all...] |
H A D | iter_iter_alloc.pass.cpp | 39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local 40 int* an = ab + sizeof(ab)/sizeof(ab[0]); 41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 42 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 43 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 44 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 47 test(forward_iterator<const int*>(ab), forward_iterato [all...] |
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-ot-shape-complex-hebrew.cc | 34 hb_codepoint_t *ab) 71 bool found = 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 | 191 hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, 194 return ucdn_compose(ab, a, b); 199 hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, 202 return ucdn_decompose(ab, a, b); 190 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 198 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
|
/external/harfbuzz_ng/src/ |
H A D | hb-ot-shape-complex-hebrew.cc | 34 hb_codepoint_t *ab) 71 bool found = 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...] |
/external/pcre/dist/ |
H A D | pcre_valid_utf8.c | 120 register pcre_uchar ab, c, d; local 137 ab = PRIV(utf8_table4)[c & 0x3f]; /* Number of additional bytes */ 138 if (length < ab) 141 return ab - length; /* Codes ERR1 to ERR5 */ 143 length -= ab; /* Length remaining */ 157 switch (ab) 285 if (ab > 3) 287 *erroroffset = (int)(p - string) - ab; 288 return (ab == 4)? PCRE_UTF8_ERR11 : PCRE_UTF8_ERR12;
|
/external/clang/test/CodeGenCXX/ |
H A D | atomicinit.cpp | 30 void atomic_init_bool(_Atomic(bool) *ab, bool b) { 34 __c11_atomic_init(ab, b); 39 _Atomic(bool) ab; member in struct:AtomicBoolMember 47 AtomicBoolMember::AtomicBoolMember(bool b) : ab(b) { }
|
/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}}
|
/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/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticSubDivide.cpp | 36 double ab = interp(src[0], src[2], t); local 38 double abc = interp(ab, bc, t); 65 double ab = interp(src[0], src[2], t); local 69 dst[2] = ab; 70 dst[4] = interp(ab, bc, t);
|
H A D | CubicSubDivide.cpp | 58 double ab = interp(src[0], src[2], t); local 61 double abc = interp(ab, bc, t); 112 double ab = interp(src[0], src[2], t); local 115 double abc = interp(ab, bc, t); 120 dst[2] = ab;
|
/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/lldb/test/lang/cpp/overloaded-functions/ |
H A D | main.cpp | 5 char ab; member in struct:A
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticSubDivide.cpp | 36 double ab = interp(src[0], src[2], t); local 38 double abc = interp(ab, bc, t); 65 double ab = interp(src[0], src[2], t); local 69 dst[2] = ab; 70 dst[4] = interp(ab, bc, t);
|
/external/chromium_org/extensions/browser/api/storage/ |
H A D | settings_quota_unittest.cc | 566 std::vector<std::string> ab; local 567 ab.push_back("a"); 568 ab.push_back("b"); 573 EXPECT_EQ(0u, storage_->GetBytesInUse(ab)); 580 EXPECT_EQ(2u, storage_->GetBytesInUse(ab)); 587 EXPECT_EQ(4u, storage_->GetBytesInUse(ab)); 594 EXPECT_EQ(4u, storage_->GetBytesInUse(ab));
|