Searched defs:ab (Results 1 - 25 of 72) sorted by relevance

123

/external/compiler-rt/test/asan/TestCases/Helpers/
H A Dinitialization-nobug-extra.cc3 static int ab = getAB(); variable
/external/libcxx/test/std/containers/sequences/deque/deque.cons/
H A Dmove_alloc.pass.cpp25 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 Dmove_assign.pass.cpp25 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 Dmove.pass.cpp25 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 Dcopy.pass.cpp30 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 Dcopy_alloc.pass.cpp32 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 Dop_equal.pass.cpp31 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 Diter_iter.pass.cpp52 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 Diter_iter_alloc.pass.cpp39 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/v8/test/mjsunit/regress/
H A Dregress-319722-ArrayBuffer.js30 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 Dregress-581.js39 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 Dregress-copy-hole-to-field.js47 var o = {ab:5};
50 o.ab = a[i];
57 assertEquals(undefined, o.ab);
/external/harfbuzz_ng/src/
H A Dhb-ot-shape-complex-hebrew.cc34 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 Dhb-ucdn.cc191 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
H A Dhb-glib.cc243 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
/external/pcre/dist/
H A Dpcre_valid_utf8.c120 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/Sema/
H A Ddecl-in-prototype.c23 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 Dstring-plus-char.c5 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/eigen/unsupported/test/
H A Dkronecker_product.cpp19 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/compiler-rt/lib/builtins/ppc/
H A Dgcc_qmul.c21 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 Dmain.cpp5 char ab; member in struct:A
/external/clang/test/CodeGenCXX/
H A Datomicinit.cpp40 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 DtcuRGBA.cpp95 int ab = (bPacked >> RGBA::ALPHA_SHIFT) & 0xFF; local
97 aDiff = (deUint8)deAbs32(aa - ab);
/external/v8/test/cctest/
H A Dtest-weaktypedarrays.cc55 static bool HasArrayBufferInWeakList(Heap* heap, JSArrayBuffer* ab) { argument
59 if (ab == o) return true;
158 i::SNPrintF(source, "ab%d = null;", i);
168 i::SNPrintF(source, "ab%d", j);
169 v8::Handle<v8::ArrayBuffer> ab = local
172 *v8::Utils::OpenHandle(*ab)));
191 v8::Handle<v8::ArrayBuffer> ab = local
193 Handle<JSArrayBuffer> iab = v8::Utils::OpenHandle(*ab);
196 v8::Handle<View> ta1 = View::New(ab, 0, 256);
199 v8::Handle<View> ta2 = View::New(ab,
292 v8::Handle<v8::ArrayBuffer> ab = local
316 v8::Handle<v8::ArrayBuffer> ab = local
336 v8::Handle<v8::ArrayBuffer> ab = local
[all...]
/external/eigen/blas/
H A Dlevel1_impl.h89 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))

Completed in 1214 milliseconds

123