/external/v8/test/mjsunit/ |
H A D | neuter-twice.js | 7 var ab = new ArrayBuffer(100); 8 %ArrayBufferNeuter(ab); 9 %ArrayBufferNeuter(ab);
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
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 | 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...] |
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 | 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 | 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 | 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...] |
/external/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/clang/test/Parser/ |
H A D | cxx-member-init-missing-paren-crash.cpp | 7 bool ab() {
|
/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/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/clang/test/Sema/ |
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}}
|
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/compiler-rt/test/asan/TestCases/Helpers/ |
H A D | initialization-nobug-extra.cc | 3 static int ab = getAB(); variable
|
/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/v8/test/webkit/fast/regex/ |
H A D | alternative-length-miscalculation.js | 32 var re2 = /[^a]|ab/;
|
/external/mesa3d/src/glsl/tests/lower_jumps/ |
H A D | lower_guarded_conditional_break.opt_test | 10 ((declare (in) float aa) (declare (in) float ab) (declare (in) float b) 15 ((if (expression bool > (var_ref ab) (constant float (0.000000)))
|
H A D | lower_unified_returns.opt_test | 12 ((declare (in) float aa) (declare (in) float ab) (declare (in) float b) 17 ((if (expression bool > (var_ref ab) (constant float (0.000000)))
|
/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/valgrind/none/tests/s390x/ |
H A D | troo.stdout.exp | 6 the translated values are ff bb dd ab ca 8 the translated values are ff bb dd ab ca bc cc da ea aa 14 the translated values are ff bb dd ab ca bc cc da
|
/external/libvncserver/webclients/novnc/include/web-socket-js/ |
H A D | swfobject.js | 4 var swfobject=function(){var D="undefined",r="object",S="Shockwave Flash",W="ShockwaveFlash.ShockwaveFlash",q="application/x-shockwave-flash",R="SWFObjectExprInst",x="onreadystatechange",O=window,j=document,t=navigator,T=false,U=[h],o=[],N=[],I=[],l,Q,E,B,J=false,a=false,n,G,m=true,M=function(){var aa=typeof j.getElementById!=D&&typeof j.getElementsByTagName!=D&&typeof j.createElement!=D,ah=t.userAgent.toLowerCase(),Y=t.platform.toLowerCase(),ae=Y?/win/.test(Y):/win/.test(ah),ac=Y?/mac/.test(Y):/mac/.test(ah),af=/webkit/.test(ah)?parseFloat(ah.replace(/^.*webkit\/(\d+(\.\d+)?).*$/,"$1")):false,X=!+"\v1",ag=[0,0,0],ab=null;if(typeof t.plugins!=D&&typeof t.plugins[S]==r){ab=t.plugins[S].description;if(ab&&!(typeof t.mimeTypes!=D&&t.mimeTypes[q]&&!t.mimeTypes[q].enabledPlugin)){T=true;X=false;ab=ab.replace(/^.*\s+(\S+\s+\S+$)/,"$1");ag[0]=parseInt(ab.replace(/^(.*)\..*$/,"$1"),10);ag[1]=parseInt(ab.replace(/^.*\.(.*)\s.*$/,"$1"),10);ag[2]=/[a-zA-Z]/.test(ab)?parseInt(ab.replace(/^.*[a-zA-Z]+(.*)$/,"$1"),10):0}}else{if(typeof O.ActiveXObject!=D){try{var ad=new ActiveXObject(W);if(ad){ab [all...] |