/external/compiler-rt/lib/asan/lit_tests/TestCases/Helpers/ |
H A D | initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
/external/chromium_org/v8/test/mjsunit/regress/ |
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/eigen/unsupported/test/ |
H A D | kronecker_product.cpp | 18 void check_dimension(const MatrixType& ab, const unsigned int rows, const unsigned int cols) argument 20 VERIFY_IS_EQUAL(ab.rows(), rows); 21 VERIFY_IS_EQUAL(ab.cols(), cols); 26 void check_kronecker_product(const MatrixType& ab) argument 28 VERIFY_IS_EQUAL(ab.rows(), 6); 29 VERIFY_IS_EQUAL(ab.cols(), 6); 30 VERIFY_IS_EQUAL(ab.nonZeros(), 36); 31 VERIFY_IS_APPROX(ab.coeff(0,0), -0.4017367630386106); 32 VERIFY_IS_APPROX(ab.coeff(0,1), 0.1056863433932735); 33 VERIFY_IS_APPROX(ab 71 check_sparse_kronecker_product(const MatrixType& ab) argument [all...] |
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-ot-shape-complex-default.cc | 84 hb_codepoint_t *ab) 121 bool found = c->unicode->compose (a, b, ab); 129 *ab = 0xFB1D; 135 *ab = 0xFB1F; 138 *ab = 0xFB2E; 144 *ab = 0xFB2F; 150 *ab = 0xFB4B; 156 *ab = sDageshForms[a - 0x05D0]; 157 found = (*ab != 0); 159 *ab 81 compose_default(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 | 168 hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, 171 return ucdn_compose(ab, a, b); 176 hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, 179 return ucdn_decompose(ab, a, b); 167 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 175 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 | 174 hb_codepoint_t *ab, 181 *ab = ret; 206 U16_GET_UNSAFE (normalized, 0, *ab); 217 hb_codepoint_t ab, 227 len = unorm2_getRawDecomposition (normalizer, ab, decomposed, 235 return *a != ab; 259 U16_APPEND (utf16, len, ARRAY_LENGTH (utf16), ab, err); 272 ret = *a != ab; 278 /* Here's the ugly part: if ab decomposes to a single character and 288 if (c != *a && c != ab) { 171 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 216 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, 301 hb_codepoint_t *ab) 303 return ufuncs->compose (a, b, ab); 308 hb_codepoint_t ab, 312 return ufuncs->decompose (ab, a, b); 298 hb_unicode_compose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument 307 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 | 87 hb_codepoint_t ab, 91 return c->unicode->decompose (ab, a, b); 98 hb_codepoint_t *ab) 100 return c->unicode->compose (a, b, ab); 132 decompose (const hb_ot_shape_normalize_context_t *c, bool shortest, hb_codepoint_t ab) argument 136 if (!c->decompose (c, ab, &a, &b) || 86 decompose_unicode(const hb_ot_shape_normalize_context_t *c, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b) argument 95 compose_unicode(const hb_ot_shape_normalize_context_t *c, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument
|
H A D | hb-unicode-private.hh | 80 hb_codepoint_t *ab) 82 *ab = 0; 84 return func.compose (this, a, b, ab, user_data.compose); 87 inline hb_bool_t decompose (hb_codepoint_t ab, argument 90 *a = ab; *b = 0; 91 return func.decompose (this, ab, a, b, user_data.decompose); 79 compose(hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument
|
/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/harfbuzz_ng/src/ |
H A D | hb-ot-shape-complex-default.cc | 90 hb_codepoint_t *ab) 127 bool found = c->unicode->compose (a, b, ab); 135 *ab = 0xFB1D; 141 *ab = 0xFB1F; 144 *ab = 0xFB2E; 150 *ab = 0xFB2F; 156 *ab = 0xFB4B; 162 *ab = sDageshForms[a - 0x05D0]; 163 found = (*ab != 0); 165 *ab 87 compose_default(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 | 168 hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab, 171 return ucdn_compose(ab, a, b); 176 hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b, 179 return ucdn_decompose(ab, a, b); 167 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 175 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 | 174 hb_codepoint_t *ab, 181 *ab = ret; 206 U16_GET_UNSAFE (normalized, 0, *ab); 217 hb_codepoint_t ab, 227 len = unorm2_getRawDecomposition (normalizer, ab, decomposed, 235 return *a != ab; 259 U16_APPEND (utf16, len, ARRAY_LENGTH (utf16), ab, err); 272 ret = *a != ab; 278 /* Here's the ugly part: if ab decomposes to a single character and 288 if (c != *a && c != ab) { 171 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 216 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, 301 hb_codepoint_t *ab) 303 return ufuncs->compose (a, b, ab); 308 hb_codepoint_t ab, 312 return ufuncs->decompose (ab, a, b); 298 hb_unicode_compose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t a, hb_codepoint_t b, hb_codepoint_t *ab) argument 307 hb_unicode_decompose(hb_unicode_funcs_t *ufuncs, hb_codepoint_t ab, hb_codepoint_t *a, hb_codepoint_t *b) argument
|
/external/compiler-rt/lib/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/chromium_org/chrome/browser/extensions/api/storage/ |
H A D | settings_quota_unittest.cc | 567 std::vector<std::string> ab; local 568 ab.push_back("a"); 569 ab.push_back("b"); 574 EXPECT_EQ(0u, storage_->GetBytesInUse(ab)); 581 EXPECT_EQ(2u, storage_->GetBytesInUse(ab)); 588 EXPECT_EQ(4u, storage_->GetBytesInUse(ab)); 595 EXPECT_EQ(4u, storage_->GetBytesInUse(ab));
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-hashing.cc | 222 uint8_t ab[2] = {a, b}; local 223 check(i::Vector<const uint8_t>(ab, 2));
|
H A D | test-weaktypedarrays.cc | 55 static bool HasArrayBufferInWeakList(Heap* heap, JSArrayBuffer* ab) { argument 59 if (ab == o) return true; 155 i::OS::SNPrintF(source, "ab%d = null;", i); 165 i::OS::SNPrintF(source, "ab%d", j); 166 v8::Handle<v8::ArrayBuffer> ab = local 169 *v8::Utils::OpenHandle(*ab))); 188 v8::Handle<v8::ArrayBuffer> ab = v8::ArrayBuffer::New(2048); local 189 Handle<JSArrayBuffer> iab = v8::Utils::OpenHandle(*ab); 192 v8::Handle<View> ta1 = View::New(ab, 0, 256); 195 v8::Handle<View> ta2 = View::New(ab, 287 v8::Handle<v8::ArrayBuffer> ab = local 311 v8::Handle<v8::ArrayBuffer> ab = local 331 v8::Handle<v8::ArrayBuffer> ab = local [all...] |
/external/v8/test/cctest/ |
H A D | test-hashing.cc | 215 char ab[2] = {a, b}; local 216 check(i::Vector<const char>(ab, 2));
|
/external/eigen/blas/ |
H A D | level1_impl.h | 86 Scalar ab = internal::abs(b); local 87 if((aa+ab)==Scalar(0)) 97 Scalar amax = aa>ab ? a : b; 102 if (aa > ab) z = *s; 103 if (ab > aa && *c!=RealScalar(0))
|
/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;
|