| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
| p3.cpp | 2 int& r1; // expected-error{{declaration of reference variable 'r1' requires an initializer}} variable
|
| /external/v8/test/mjsunit/regress/ |
| regress-1472.js | 30 var r1 = /(?:a(?:b(?:c(?:d(?:e(?:f(?:g(?:h(?:i(?:j(?:k(?:l(?:m(?:n(?:o(?:p(?:q(?:r(?:s(?:t(?:u(?:v(?:w(?:x(?:y(?:z(?:FooBar)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)/; variable
31 "xxx".match(r1);
|
| /external/clang/test/Misc/ |
| verify.c | 10 struct s r1; // expected-error-re {{tentative definition has type 'struct s' that is never completed}} variable in typeref:struct:s
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| RandomTest.java | 35 MyRandom r1 = new MyRandom(); local
36 r1.nextInt();
37 assertNotNull(r1.state);
|
| /external/stlport/test/unit/ |
| reference_wrapper_test.cpp | 37 rr_type r1 = std::tr1::ref(i); local
39 CPPUNIT_CHECK( r1.get() == 1 );
41 r1 = std::tr1::ref(j);
43 CPPUNIT_CHECK( r1.get() == 2 );
47 CPPUNIT_CHECK( r1.get() == 2 );
51 CPPUNIT_CHECK( r1.get() == 4 );
53 r1.get() = 5;
68 crr_type r1 = std::tr1::cref(i); local
70 CPPUNIT_CHECK( r1.get() == 1 );
72 r1 = std::tr1::cref(j)
[all...] |
| includes_test.cpp | 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2); local
44 CPPUNIT_ASSERT(!r1);
55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); local
56 CPPUNIT_ASSERT(!r1);
80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); local
81 CPPUNIT_ASSERT(!r1);
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| reference_wrapper_test.cpp | 37 rr_type r1 = std::tr1::ref(i); local
39 CPPUNIT_CHECK( r1.get() == 1 );
41 r1 = std::tr1::ref(j);
43 CPPUNIT_CHECK( r1.get() == 2 );
47 CPPUNIT_CHECK( r1.get() == 2 );
51 CPPUNIT_CHECK( r1.get() == 4 );
53 r1.get() = 5;
68 crr_type r1 = std::tr1::cref(i); local
70 CPPUNIT_CHECK( r1.get() == 1 );
72 r1 = std::tr1::cref(j)
[all...] |
| includes_test.cpp | 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2); local
44 CPPUNIT_ASSERT(!r1);
55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); local
56 CPPUNIT_ASSERT(!r1);
80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); local
81 CPPUNIT_ASSERT(!r1);
|
| /ndk/tests/device/test-stlport/unit/ |
| reference_wrapper_test.cpp | 37 rr_type r1 = std::tr1::ref(i); local
39 CPPUNIT_CHECK( r1.get() == 1 );
41 r1 = std::tr1::ref(j);
43 CPPUNIT_CHECK( r1.get() == 2 );
47 CPPUNIT_CHECK( r1.get() == 2 );
51 CPPUNIT_CHECK( r1.get() == 4 );
53 r1.get() = 5;
68 crr_type r1 = std::tr1::cref(i); local
70 CPPUNIT_CHECK( r1.get() == 1 );
72 r1 = std::tr1::cref(j)
[all...] |
| includes_test.cpp | 43 bool r1=includes(numbers1, numbers1 + 5, numbers3, numbers3 + 2); local
44 CPPUNIT_ASSERT(!r1);
55 bool r1=includes(v1.begin(), v1.end(), v2.begin(), v2.end()); local
56 CPPUNIT_ASSERT(!r1);
80 bool r1 = includes(v1.begin(), v1.end(), v2.begin(), v2.end(), compare_strings); local
81 CPPUNIT_ASSERT(!r1);
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| TestBufferedTreeNodeStream.java | 53 Tree r1 = new CommonTree(new CommonToken(102)); local
54 r0.addChild(r1);
55 r1.addChild(new CommonTree(new CommonToken(103)));
58 r1.addChild(r2);
|
| /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.ref/ |
| p6-0x.cpp | 21 typedef LRI& r1; CHECK_EQUAL_TYPES(r1, int&); typedef
|
| /external/clang/test/Sema/ |
| vector-cast.c | 25 long long r1 = (long long)v1; local
|
| /external/opencv/cv/src/ |
| _cvgeom.h | 77 double r1; /* The ratio of the height of triangle to the base of the triangle */ member in struct:_CvTrianAttr
|
| /external/skia/samplecode/ |
| Sample2PtRadial.cpp | 35 SkScalar r1 = 100; local
36 SkShader* s = SkGradientShader::CreateTwoPointRadial(c0, r0, c1, r1, colors,
|
| /external/skia/tests/ |
| DataRefTest.cpp | 34 SkData* r1 = SkData::NewWithCopy(str, strlen(str)); local
37 SkData* r3 = SkData::NewSubset(r1, 7, 6);
40 SkAutoUnref aur1(r1);
45 assert_len(reporter, r1, strlen(str));
49 assert_data(reporter, r1, str, strlen(str));
52 SkData* tmp = SkData::NewSubset(r1, strlen(str), 10);
55 tmp = SkData::NewSubset(r1, 0, 0);
|
| SrcOverTest.cpp | 57 unsigned r1 = test_srcover1(dst, i); local
64 REPORTER_ASSERT(reporter, r1 <= 255 && r1 >= max);
68 // this shows where r1 (faster) differs from r2 (more exact)
69 if (r1 != r2) {
70 SkDebugf("--- dst=%d i=%d r1=%d r2=%d exact=%g\n",
71 dst, i, r1, r2, i + dst - dst*i/255.0f);
|
| /external/v8/test/mjsunit/ |
| array-concat.js | 202 var r1 = [].concat(arr1, arr2); // [,2,1,3] variable
203 assertEquals([,2,1,3], r1);
|
| /external/valgrind/main/none/tests/x86/ |
| incdec_alt.c | 7 int r1,r2,r3,r4,r5,r6,r7,r8,a1,a2; variable
21 "\tmovl %eax," VG_SYM(r1) "\n"
58 r1=r2=r3=r4=r5=r6=r7=r8=0;
60 printf("0x%08x\n",r1);
|
| /hardware/samsung_slsi/exynos5/mobicore/common/MobiCore/inc/Mci/ |
| mcifcfunc.h | 69 uint32_t r1; member in struct:__anon19479
79 uint32_t r1,
89 uint32_t r1,
93 return smcFc(r0,r1,r2,r3);
130 return ret.r1;
151 if (MC_FC_RET_OK == ret.r1)
157 return ret.r1;
182 return ret.r1;
|
| /external/clang/test/FixIt/ |
| typo.c | 29 Rectangle r1; // expected-error{{must use 'struct' tag to refer to type 'Rectangle'}} local
30 r1.top_left.x = 0;
33 rectangle *r2 = &r1; // expected-error{{unknown type name 'rectangle'; did you mean 'Rectangle'?}}
|
| /external/openssl/crypto/rsa/ |
| rsa_crpt.c | 168 BIGNUM *ret = NULL, *r0, *r1, *r2; local
175 r1 = BN_CTX_get(ctx);
180 if (!BN_sub(r1, p, BN_value_one())) goto err;
182 if (!BN_mul(r0, r1, r2, ctx)) goto err;
|
| rsa_gen.c | 102 BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp; local
112 r1 = BN_CTX_get(ctx);
138 if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
139 if (BN_is_one(r1)) break;
163 if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
164 if (BN_is_one(r1))
182 if (!BN_sub(r1,rsa->p,BN_value_one())) goto err; /* p-1 */
184 if (!BN_mul(r0,r1,r2,ctx)) goto err; /* (p-1)(q-1) */
204 if (!BN_mod(rsa->dmp1,d,r1,ctx)) goto err;
|
| /external/webkit/Source/JavaScriptCore/jit/ |
| ExecutableAllocator.cpp | 115 add r1, r1, r0 local
|
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| idct.cpp | 131 int32 r0, r1, r2, r3, r4, r5, r6, r7, r8; /* butterfly nodes */ local
145 r1 = blk[B_SIZE * 4 + i] << 11;
158 if (!(r1 | r2 | r3 | r4 | r5 | r6 | r7))
192 r8 = r0 + r1;
193 r0 -= r1;
195 r1 = W6 * (r3 + r2);
196 r2 = (r1 - (W2 + W6) * r2);
197 r3 = (r1 + (W2 - W6) * r3);
199 r1 = r4 + r6;
218 tmpBLK32[0 + i] = (r7 + r1) >> 8
353 int32 r0, r1, r2, r3, r4, r5, r6, r7, r8; \/* butterfly nodes *\/ local
[all...] |
