/external/compiler-rt/lib/asan/lit_tests/Helpers/ |
H A D | initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
/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/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
|
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/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/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;
|
/external/ceres-solver/internal/ceres/ |
H A D | autodiff_test.cc | 110 A ab = a*b; local 121 R(1, 0) = A(2)*(ad+bc); R(1, 1) = aa-bb+cc-dd; R(1, 2) = A(2)*(cd-ab); // NOLINT 122 R(2, 0) = A(2)*(bd-ac); R(2, 1) = A(2)*(ab+cd); R(2, 2) = aa-bb-cc+dd; // NOLINT
|
H A D | rotation_test.cc | 869 double ab[4]; local 871 QuaternionProduct(a, b, ab); 872 QuaternionProduct(ab, c, ab_c);
|
/external/clang/test/SemaTemplate/ |
H A D | friend-template.cpp | 244 A<double>::B<double> ab; member in namespace:rdar11147355
|
/external/jmonkeyengine/engine/src/lwjgl/com/jme3/audio/lwjgl/ |
H A D | LwjglAudioRenderer.java | 973 private void updateAudioBuffer(AudioBuffer ab){
argument 974 int id = ab.getId();
975 if (ab.getId() == -1){
979 ab.setId(id);
981 objManager.registerForCleanup(ab);
984 ab.getData().clear();
985 alBufferData(id, convertFormat(ab), ab.getData(), ab.getSampleRate());
986 ab [all...] |
/external/regex-re2/re2/ |
H A D | prefilter.cc | 141 // we know "ab" is a required string, then it doesn't help at all to 144 // regexps, matching ab will already allow this regexp to be a 316 Info *ab = new Info(); local 318 CrossProduct(a->exact_, b->exact_, &ab->exact_); 319 ab->is_exact_ = true; 323 return ab; 326 // Constructs an inexact Info for ab given a and b. 335 Info *ab = new Info(); 337 ab->match_ = Prefilter::And(a->TakeMatch(), b->TakeMatch()); 338 ab 346 Info *ab = new Info(); local 368 Info *ab = new Info(); local 385 Info *ab = new Info(); local [all...] |
/external/ceres-solver/include/ceres/ |
H A D | rotation.h | 392 T ab = a * b; local 403 R[3] = T(2) * (ad + bc); R[4] = aa - bb + cc - dd; R[5] = T(2) * (cd - ab); // NOLINT 404 R[6] = T(2) * (bd - ac); R[7] = T(2) * (ab + cd); R[8] = aa - bb - cc + dd; // NOLINT
|
/external/harfbuzz_ng/test/api/ |
H A D | test-unicode.c | 788 gunichar a, b, ab; local 795 g_assert (!hb_unicode_compose (uf, 0x0041, 0x0042, &ab) && ab == 0); 796 g_assert (!hb_unicode_compose (uf, 0x0041, 0, &ab) && ab == 0); 797 g_assert (!hb_unicode_compose (uf, 0x0066, 0x0069, &ab) && ab == 0); 800 g_assert (!hb_unicode_compose (uf, 0x212B, 0, &ab) && ab == 0); 801 g_assert (!hb_unicode_compose (uf, 0x00C5, 0, &ab) [all...] |
/external/skia/legacy/src/core/ |
H A D | SkGeometry.cpp | 90 float ab = a - b; local 92 if (ab < 0) 94 return ab == 0 || bc < 0; 206 SkScalar ab = SkScalarInterp(src[0], src[2], t); 208 return SkScalarInterp(ab, bc, t); 258 SkScalar ab = SkScalarInterp(src[0], src[2], t); local 262 dst[2] = ab; 263 dst[4] = SkScalarInterp(ab, bc, t); 497 SkScalar ab = SkScalarInterp(src[0], src[2], t); 500 SkScalar abc = SkScalarInterp(ab, b 570 SkScalar ab = SkScalarInterp(src[0], src[2], t); local [all...] |
/external/skia/src/core/ |
H A D | SkGeometry.cpp | 90 float ab = a - b; local 92 if (ab < 0) 94 return ab == 0 || bc < 0; 206 SkScalar ab = SkScalarInterp(src[0], src[2], t); 208 return SkScalarInterp(ab, bc, t); 258 SkScalar ab = SkScalarInterp(src[0], src[2], t); local 262 dst[2] = ab; 263 dst[4] = SkScalarInterp(ab, bc, t); 497 SkScalar ab = SkScalarInterp(src[0], src[2], t); 500 SkScalar abc = SkScalarInterp(ab, b 570 SkScalar ab = SkScalarInterp(src[0], src[2], t); local [all...] |
/external/skia/src/gpu/ |
H A D | GrPathUtils.cpp | 282 // ab is the vector from a to the second control point. 288 const SkVector& ab, 294 SkScalar apXab = ap.cross(ab); 331 SkVector ab = p[1] - p[0]; local 334 if (ab.isZero()) { 342 ab = p[2] - p[0]; 348 // When the ab and cd tangents are nearly parallel with vector from d to a the constraint that 360 // cross(ab, da)^2/length(da)^2 == sqd distance from b to line from d to a. 362 SkScalar detABSqd = ab.cross(da); 368 SkPoint b = p[0] + ab; 287 is_point_within_cubic_tangents(const SkPoint& a, const SkVector& ab, const SkVector& dc, const SkPoint& d, SkPath::Direction dir, const SkPoint p) argument [all...] |