/external/skia/tests/ |
H A D | PathOpsQuadLineIntersectionTest.cpp | 16 SkDQuad quad; member in struct:lineQuad 21 // quad line results 31 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, argument 42 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 52 intersections.intersect(quad, line); 59 SkDQuad quad; member in struct:oneLineQuad 82 const SkDQuad& quad = oneOffs[index].quad; local 83 SkASSERT(ValidQuad(quad)); 109 const SkDQuad& quad = lineQuadTests[index].quad; local [all...] |
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 14 static int doIntersect(SkIntersections& intersections, const SkDQuad& quad, const SkDLine& line, argument 25 result = intersections.vertical(quad, top, bottom, line[0].fX, flipped); 33 result = intersections.horizontal(quad, left, right, line[0].fY, flipped); 35 intersections.intersect(quad, line); 41 static void testLineIntersect(skiatest::Reporter* reporter, const SkDQuad& quad, argument 46 str += sprintf(str, " path.moveTo(%1.9g, %1.9g);\n", quad[0].fX, quad[0].fY); 47 str += sprintf(str, " path.quadTo(%1.9g, %1.9g, %1.9g, %1.9g);\n", quad[1].fX, 48 quad[1].fY, quad[ 83 SkDQuad quad = {{{(double) ax, (double) ay}, {(double) bx, (double) by}, local [all...] |
H A D | PathOpsTestCommon.cpp | 18 SkDQuad quad = cubic.toQuad(); local 19 quads.push_back(quad); 26 SkDQuad quad = part.toQuad(); 27 quads.push_back(quad); 174 bool ValidQuad(const SkDQuad& quad) { argument 176 if (!ValidPoint(quad[index])) {
|
/external/chromium_org/cc/layers/ |
H A D | nine_patch_layer_impl.cc | 221 TextureDrawQuad* quad = local 223 quad->SetNew(shared_quad_state, 238 TextureDrawQuad* quad = local 240 quad->SetNew(shared_quad_state, 255 TextureDrawQuad* quad = local 257 quad->SetNew(shared_quad_state, 272 TextureDrawQuad* quad = local 274 quad->SetNew(shared_quad_state, 289 TextureDrawQuad* quad = local 291 quad 306 TextureDrawQuad* quad = local 323 TextureDrawQuad* quad = local 340 TextureDrawQuad* quad = local 358 TextureDrawQuad* quad = local [all...] |
H A D | painted_scrollbar_layer_impl.cc | 103 TextureDrawQuad* quad = local 105 quad->SetNew(shared_quad_state, 124 TextureDrawQuad* quad = local 126 quad->SetNew(shared_quad_state,
|
H A D | render_surface_impl.cc | 227 RenderPassDrawQuad* quad = local 229 quad->SetNew(shared_quad_state,
|
/external/chromium_org/cc/output/ |
H A D | software_renderer_unittest.cc | 288 TileDrawQuad* quad = local 290 quad->SetNew(shared_quad_state, 298 quad->visible_rect = visible_rect; 339 // Draw a fullscreen green quad in a first frame. 394 // Pass drawn as inner quad is magenta. 408 // Interior pass quad has smaller visible rect.
|
/external/chromium_org/cc/surfaces/ |
H A D | surface_aggregator_test_helpers.cc | 65 RenderPassDrawQuad* quad = local 67 quad->SetNew(shared_state, 109 void TestQuadMatchesExpectations(Quad expected_quad, const DrawQuad* quad) { argument 112 ASSERT_EQ(DrawQuad::SOLID_COLOR, quad->material); 115 SolidColorDrawQuad::MaterialCast(quad); 121 ASSERT_EQ(DrawQuad::RENDER_PASS, quad->material); 124 RenderPassDrawQuad::MaterialCast(quad);
|
/external/chromium_org/content/common/ |
H A D | cc_messages.cc | 305 const cc::DrawQuad* quad = &*iter; local 306 DCHECK(quad->rect.Contains(quad->visible_rect)) 307 << quad->material << " rect: " << quad->rect.ToString() 308 << " visible_rect: " << quad->visible_rect.ToString(); 309 DCHECK(quad->opaque_rect.IsEmpty() || 310 quad->rect.Contains(quad->opaque_rect)) 311 << quad 402 QuadType* quad = render_pass->CreateAndAppendDrawQuad<QuadType>(); local 544 const cc::DrawQuad* quad = &*iter; local [all...] |
/external/chromium_org/third_party/WebKit/Source/core/paint/ |
H A D | ObjectPainter.cpp | 317 FloatPoint quad[4]; local 320 quad[0] = FloatPoint(x1 + std::max(-adjacentWidth1, 0), y1); 321 quad[1] = FloatPoint(x1 + std::max(adjacentWidth1, 0), y2); 322 quad[2] = FloatPoint(x2 - std::max(adjacentWidth2, 0), y2); 323 quad[3] = FloatPoint(x2 - std::max(-adjacentWidth2, 0), y1); 326 quad[0] = FloatPoint(x1 + std::max(adjacentWidth1, 0), y1); 327 quad[1] = FloatPoint(x1 + std::max(-adjacentWidth1, 0), y2); 328 quad[2] = FloatPoint(x2 - std::max(-adjacentWidth2, 0), y2); 329 quad[3] = FloatPoint(x2 - std::max(adjacentWidth2, 0), y1); 332 quad[ [all...] |
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | LinkHighlight.cpp | 172 static void addQuadToPath(const FloatQuad& quad, Path& path) argument 174 // FIXME: Make this create rounded quad-paths, just like the axis-aligned case. 175 path.moveTo(quad.p1()); 176 path.addLineTo(quad.p2()); 177 path.addLineTo(quad.p3()); 178 path.addLineTo(quad.p4()); 221 // FIXME: for now, we'll only use rounded paths if we have a single node quad. The reason for this is that
|
/external/chromium_org/third_party/angle/src/libGLESv2/renderer/d3d/d3d9/ |
H A D | SwapChain9.cpp | 295 float quad[4][6] = {{x1, y1, 0.0f, 1.0f, u1, v2}, local 301 device->DrawPrimitiveUP(D3DPT_TRIANGLEFAN, 2, quad, 6 * sizeof(float));
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | CubicToQuadratics_Test.cpp | 24 const Quadratic& quad = quadTests[index]; local 26 quad_to_cubic(quad, cubic); 241 const Quadratic& quad = quads[z]; local 243 quad[0].x, quad[0].y, quad[1].x, quad[1].y, quad[2].x, quad[2].y);
|
H A D | LineQuadraticIntersection.cpp | 95 : quad(q) 102 solve by rotating line+quad so line is horizontal, then finding the roots 103 set up matrix to rotate quad to x-axis 114 quad[n].y' = (quad[n].y - line[0].y) * A - (quad[n].x - line[0].x) * O 120 r[n] = (quad[n].y - line[0].y) * adj - (quad[n].x - line[0].x) * opp; 147 double D = quad[2].y; // f 148 double E = quad[ 289 const Quadratic& quad; member in class:LineQuadraticIntersections 295 horizontalIntersect(const Quadratic& quad, const _Point& pt) argument 310 verticalIntersect(const Quadratic& quad, const _Point& pt) argument 332 horizontalIntersect(const Quadratic& quad, double left, double right, double y, double tRange[2]) argument 349 horizontalIntersect(const Quadratic& quad, double left, double right, double y, bool flipped, Intersections& intersections) argument 355 verticalIntersect(const Quadratic& quad, double top, double bottom, double x, bool flipped, Intersections& intersections) argument 361 intersect(const Quadratic& quad, const _Line& line, Intersections& i) argument 366 intersectRay(const Quadratic& quad, const _Line& line, Intersections& i) argument [all...] |
H A D | LineQuadraticIntersection_Test.cpp | 15 Quadratic quad; member in struct:lineQuad 20 // quad line results 32 static int doIntersect(Intersections& intersections, const Quadratic& quad, const _Line& line, bool& flipped) { argument 42 result = verticalIntersect(quad, top, bottom, line[0].x, flipped, intersections); 50 result = horizontalIntersect(quad, left, right, line[0].y, flipped, intersections); 52 intersect(quad, line, intersections); 59 Quadratic quad; member in struct:oneLineQuad 73 const Quadratic& quad = oneOffs[index].quad; local 75 int result = doIntersect(intersections, quad, lin 94 const Quadratic& quad = lineQuadTests[index].quad; local 143 testLineIntersect(State4& state, const Quadratic& quad, const _Line& line, const double x, const double y) argument 190 Quadratic quad = {{ax, ay}, {bx, by}, {cx, cy}}; local [all...] |
H A D | QuadraticUtilities.cpp | 13 double nearestT(const Quadratic& quad, const _Point& pt) { argument 14 _Vector pos = quad[0] - pt; 17 _Vector A = quad[1] - quad[0]; 18 _Vector B = quad[2] - quad[1]; 26 double d0 = pt.distanceSquared(quad[0]); 27 double d2 = pt.distanceSquared(quad[2]); 32 xy_at_t(quad, ts[index], onQuad.x, onQuad.y); 45 bool point_in_hull(const Quadratic& quad, cons argument 49 top(const Quadratic& quad, double startT, double endT) argument 200 toCubic(const Quadratic& quad, Cubic& cubic) argument 210 derivativeAtT(const double* quad, double t) argument 217 dx_at_t(const Quadratic& quad, double t) argument 221 dy_at_t(const Quadratic& quad, double t) argument 225 dxdy_at_t(const Quadratic& quad, double t) argument 234 xy_at_t(const Quadratic& quad, double t, double& x, double& y) argument 247 xy_at_t(const Quadratic& quad, double t) argument [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkMath.cpp | 247 int quad = ((unsigned)radians / (kTableSize * 256)) & 3; local 259 int quad = ((unsigned)radians / kTableSize) & 3; local 262 if (quad & 1) { 265 if (quad & 2) { 268 if (((quad - 1) & 2) == 0) {
|
/external/chromium_org/third_party/skia/src/pathops/ |
H A D | SkDQuadLineIntersection.cpp | 110 solve by rotating line+quad so line is horizontal, then finding the roots 111 set up matrix to rotate quad to x-axis 122 quad[n].fY' = (quad[n].fY - line[0].fY) * A - (quad[n].fX - line[0].fX) * O 247 // FIXME: see if line end is nearly on quad 273 // FIXME: see if line end is nearly on quad 299 // FIXME: see if line end is nearly on quad 354 int SkIntersections::horizontal(const SkDQuad& quad, double left, double right, double y, argument 357 LineQuadraticIntersections q(quad, lin 361 vertical(const SkDQuad& quad, double top, double bottom, double x, bool flipped) argument 368 intersect(const SkDQuad& quad, const SkDLine& line) argument 374 intersectRay(const SkDQuad& quad, const SkDLine& line) argument [all...] |
H A D | SkIntersections.cpp | 153 SkDQuad quad; local 154 quad.set(pts); 156 return intersectRay(quad, line); 197 SkDQuad quad; local 198 quad.set(a); 199 return vertical(quad, top, bottom, x, flipped);
|
H A D | SkReduceOrder.cpp | 16 static int coincident_line(const SkDQuad& quad, SkDQuad& reduction) { argument 17 reduction[0] = reduction[1] = quad[0]; 25 static int vertical_line(const SkDQuad& quad, SkDQuad& reduction) { argument 26 reduction[0] = quad[0]; 27 reduction[1] = quad[2]; 31 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) { argument 32 reduction[0] = quad[0]; 33 reduction[1] = quad[2]; 37 static int check_linear(const SkDQuad& quad, argument 41 while (quad[startInde 63 reduce(const SkDQuad& quad) argument 262 SkDQuad quad; local [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
H A D | SkCullPoints.cpp | 47 static void toQuad(const SkIRect& r, SkIPoint quad[4]) { argument 48 SkASSERT(quad); 50 quad[0].set(r.fLeft, r.fTop); 51 quad[1].set(r.fRight, r.fTop); 52 quad[2].set(r.fRight, r.fBottom); 53 quad[3].set(r.fLeft, r.fBottom);
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsAngleTest.cpp | 85 SkDQuad quad = {{line[0], dPt, qPt}}; local 86 // binary search for maximum movement of quad[1] towards test that still has 1 intersection 91 last = quad[1]; 92 quad[1].fX = dPt.fX - line[1].fY * moveT; 93 quad[1].fY = dPt.fY + line[1].fX * moveT; 95 i.intersect(quad, line); 103 } while (last.asSkPoint() != quad[1].asSkPoint());
|
H A D | PathOpsCubicToQuadsTest.cpp | 35 const SkDQuad& quad = quadTests[index]; local 36 SkASSERT(ValidQuad(quad)); 37 SkDCubic cubic = quad.toCubic();
|
/external/deqp/modules/glshared/ |
H A D | glsFragmentOpUtil.cpp | 177 void QuadRenderer::render (const Quad& quad) const 181 quad.posA.x(), quad.posA.y(), quad.depth[0], 1.0f, 182 quad.posA.x(), quad.posB.y(), quad.depth[1], 1.0f, 183 quad.posB.x(), quad.posA.y(), quad 223 render(const tcu::PixelBufferAccess& colorBuffer, const tcu::PixelBufferAccess& depthBuffer, const tcu::PixelBufferAccess& stencilBuffer, const IntegerQuad& quad, const rr::FragmentOperationState& state) argument [all...] |
/external/opencv/cvaux/src/ |
H A D | cvcalibfilter.cpp | 45 #undef quad macro 673 /* Save quad */ 678 fprintf(f, "%15.10f ", stereo.quad[i][j].x ); 679 fprintf(f, "%15.10f ", stereo.quad[i][j].y ); 729 /* load quad */ 734 fscanf(f, "%f ", &(stereo.quad[i][j].x) ); 735 fscanf(f, "%f ", &(stereo.quad[i][j].y) );
|