/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | 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);
|
H A D | regress-crbug-178790.js | 31 var r1 = ""; variable 33 r1 += "a?"; 35 "test".match(RegExp(r1));
|
/external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
H A D | p3.cpp | 2 int& r1; // expected-error{{declaration of reference variable 'r1' requires an initializer}} variable
|
/external/v8/test/mjsunit/regress/ |
H A D | 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/chromium_org/chrome/browser/autocomplete/ |
H A D | autocomplete_match_unittest.cc | 12 int r1; member in struct:RelevantCases 30 m1.relevance = cases[i].r1;
|
/external/chromium_org/ui/gfx/range/ |
H A D | range_unittest.cc | 66 gfx::Range r1(10, 4); 69 EXPECT_EQ(r1, r2); 70 EXPECT_NE(r1, r3); 74 EXPECT_NE(r1, r4); 79 EXPECT_NE(r1, r5); 85 gfx::Range r1(10, 5); 87 EXPECT_TRUE(r1.EqualsIgnoringDirection(r2)); 153 void TestContainsAndIntersects(const gfx::Range& r1, argument 156 EXPECT_TRUE(r1.Intersects(r1)); [all...] |
/external/clang/test/Misc/ |
H A D | verify.c | 10 struct s r1; // expected-error-re {{tentative definition has type 'struct s' that is never completed}} variable in typeref:struct:s
|
/external/pixman/test/ |
H A D | region-translate-test.c | 14 pixman_region32_t r1, r2; local 16 pixman_region32_init_rects (&r1, &rect, 1); 19 assert (pixman_region32_equal (&r1, &r2)); 21 pixman_region32_translate (&r1, -LARGE, LARGE); 22 pixman_region32_translate (&r1, LARGE, -LARGE); 24 assert (pixman_region32_equal (&r1, &r2)); 26 pixman_region32_fini (&r1);
|
H A D | region-test.c | 9 pixman_region32_t r1; local 40 pixman_region32_init_rect (&r1, 0, 0, 20, 64000); 44 pixman_region32_subtract (&r1, &r2, &r3); 52 pixman_region32_init_rects (&r1, boxes, 3); 54 b = pixman_region32_rectangles (&r1, &i); 68 pixman_region32_init_rects (&r1, boxes2, 2); 70 b = pixman_region32_rectangles (&r1, &i); 80 pixman_region32_init_rects (&r1, boxes3, 2); 82 b = pixman_region32_rectangles (&r1, &i); 91 pixman_region32_init (&r1); [all...] |
/external/chromium_org/ui/gfx/ |
H A D | path_gtk.cc | 35 NativeRegion Path::IntersectRegions(NativeRegion r1, NativeRegion r2) { argument 36 GdkRegion* copy = gdk_region_copy(r1); 42 NativeRegion Path::CombineRegions(NativeRegion r1, NativeRegion r2) { argument 43 GdkRegion* copy = gdk_region_copy(r1); 49 NativeRegion Path::SubtractRegion(NativeRegion r1, NativeRegion r2) { argument 50 GdkRegion* copy = gdk_region_copy(r1);
|
H A D | path_aura.cc | 26 NativeRegion Path::IntersectRegions(NativeRegion r1, NativeRegion r2) { argument 28 new_region->op(*r1, *r2, SkRegion::kIntersect_Op); 33 NativeRegion Path::CombineRegions(NativeRegion r1, NativeRegion r2) { argument 35 new_region->op(*r1, *r2, SkRegion::kUnion_Op); 40 NativeRegion Path::SubtractRegion(NativeRegion r1, NativeRegion r2) { argument 42 new_region->op(*r1, *r2, SkRegion::kDifference_Op);
|
H A D | path_win.cc | 48 NativeRegion Path::IntersectRegions(NativeRegion r1, NativeRegion r2) { argument 50 CombineRgn(dest, r1, r2, RGN_AND); 55 NativeRegion Path::CombineRegions(NativeRegion r1, NativeRegion r2) { argument 57 CombineRgn(dest, r1, r2, RGN_OR); 62 NativeRegion Path::SubtractRegion(NativeRegion r1, NativeRegion r2) { argument 64 CombineRgn(dest, r1, r2, RGN_DIFF);
|
/external/stlport/test/unit/ |
H A D | 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 [all...] |
H A D | 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/chromium_org/third_party/WebKit/Source/core/html/canvas/ |
H A D | CanvasGradient.cpp | 43 CanvasGradient::CanvasGradient(const FloatPoint& p0, float r0, const FloatPoint& p1, float r1) argument 44 : m_gradient(Gradient::create(p0, r0, p1, r1))
|
H A D | CanvasGradient.h | 46 static PassRefPtr<CanvasGradient> create(const FloatPoint& p0, float r0, const FloatPoint& p1, float r1) argument 48 return adoptRef(new CanvasGradient(p0, r0, p1, r1)); 57 CanvasGradient(const FloatPoint& p0, float r0, const FloatPoint& p1, float r1);
|
/external/chromium_org/third_party/WebKit/Source/core/svg/ |
H A D | SVGPathSegArcAbs.h | 31 static PassRefPtr<SVGPathSegArcAbs> create(SVGPathElement* element, SVGPathSegRole role, float x, float y, float r1, float r2, float angle, bool largeArcFlag, bool sweepFlag) argument 33 return adoptRef(new SVGPathSegArcAbs(element, role, x, y, r1, r2, angle, largeArcFlag, sweepFlag)); 37 SVGPathSegArcAbs(SVGPathElement* element, SVGPathSegRole role, float x, float y, float r1, float r2, float angle, bool largeArcFlag, bool sweepFlag) argument 38 : SVGPathSegArc(element, role, x, y, r1, r2, angle, largeArcFlag, sweepFlag)
|
H A D | SVGPathSegArcRel.h | 31 static PassRefPtr<SVGPathSegArcRel> create(SVGPathElement* element, SVGPathSegRole role, float x, float y, float r1, float r2, float angle, bool largeArcFlag, bool sweepFlag) argument 33 return adoptRef(new SVGPathSegArcRel(element, role, x, y, r1, r2, angle, largeArcFlag, sweepFlag)); 37 SVGPathSegArcRel(SVGPathElement* element, SVGPathSegRole role, float x, float y, float r1, float r2, float angle, bool largeArcFlag, bool sweepFlag) argument 38 : SVGPathSegArc(element, role, x, y, r1, r2, angle, largeArcFlag, sweepFlag)
|
/external/chromium_org/third_party/libwebp/dsp/ |
H A D | upsampling_sse2.c | 64 // Loads 17 pixels each from rows r1 and r2 and generates 32 pixels. 65 #define UPSAMPLE_32PIXELS(r1, r2, out) { \ 67 const __m128i a = _mm_loadu_si128((__m128i*)&(r1)[0]); \ 68 const __m128i b = _mm_loadu_si128((__m128i*)&(r1)[1]); \ 95 static void Upsample32Pixels(const uint8_t r1[], const uint8_t r2[], argument 97 UPSAMPLE_32PIXELS(r1, r2, out); 101 uint8_t r1[17], r2[17]; \ 102 memcpy(r1, (tb), (num_pixels)); \ 105 memset(r1 + (num_pixels), r1[(num_pixel [all...] |
/external/chromium_org/v8/test/mjsunit/ |
H A D | array-concat.js | 202 var r1 = [].concat(arr1, arr2); // [,2,1,3] variable 203 assertEquals([,2,1,3], r1);
|
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.ref/ |
H A D | p6-0x.cpp | 22 typedef LRI& r1; CHECK_EQUAL_TYPES(r1, int&); typedef
|
/external/clang/test/Sema/ |
H A D | vector-cast.c | 25 long long r1 = (long long)v1; local
|
/external/eigen/test/ |
H A D | product_large.cpp | 57 MatrixXf r1 = mat1.row(2)*mat2.transpose(); local 58 VERIFY_IS_APPROX(r1, (mat1.row(2)*mat2.transpose()).eval());
|
/external/opencv/cv/src/ |
H A D | _cvgeom.h | 77 double r1; /* The ratio of the height of triangle to the base of the triangle */ member in struct:_CvTrianAttr
|
/external/v8/test/mjsunit/ |
H A D | array-concat.js | 202 var r1 = [].concat(arr1, arr2); // [,2,1,3] variable 203 assertEquals([,2,1,3], r1);
|