Searched defs:triangle (Results 1 - 25 of 38) sorted by last modified time

12

/external/skia/tests/
H A DPathOpsDTriangleTest.cpp33 const SkDTriangle& triangle = tests[index]; local
34 SkASSERT(ValidTriangle(triangle));
35 bool result = triangle.contains(inPoint[index]);
37 SkDebugf("%s [%d] expected point in triangle\n", __FUNCTION__, index);
40 result = triangle.contains(outPoint[index]);
42 SkDebugf("%s [%d] expected point outside triangle\n", __FUNCTION__, index);
60 const SkDTriangle& triangle = oneOff[index]; local
61 SkASSERT(ValidTriangle(triangle));
63 bool result = triangle.contains(triangle
[all...]
H A DPathOpsTestCommon.cpp183 bool ValidTriangle(const SkDTriangle& triangle) { argument
185 if (!ValidPoint(triangle.fPts[index])) {
/external/skia/experimental/Intersection/
H A DConvexHull_Test.cpp50 const Cubic triangle[] = { variable
72 size_t triangle_count = sizeof(triangle) / sizeof(triangle[0]);
82 { triangle, triangle_count },
H A DSkAntiEdge.cpp179 int triangle = xCoverage * yCoverage; // 30 bits local
185 triangle -= xCoverage * yCoverage;
187 coverage = triangle >> 15;
200 int triangle = xCoverage * yCoverage >> 15; local
201 coverage = partial - 1 - triangle;
260 int triangle = xCoverage * yCoverage; // 30 bits local
266 triangle -= xCoverage * yCoverage;
268 coverage = triangle >> 15;
281 int triangle = xCoverage * yCoverage >> 15; local
282 coverage = partial - 1 - triangle;
[all...]
H A DTriangleUtilities.cpp11 bool pointInTriangle(const Triangle& triangle, const _Point& pt) { argument
13 _Vector v0 = triangle[2] - triangle[0];
14 _Vector v1 = triangle[1] - triangle[0];
15 _Vector v2 = pt - triangle[0];
29 // Check if point is in triangle
/external/pdfium/core/src/fpdfapi/fpdf_render/
H A Dfpdf_render_pattern.cpp304 static void _DrawGouraud(CFX_DIBitmap* pBitmap, int alpha, CPDF_MeshVertex triangle[3]) argument
306 FX_FLOAT min_y = triangle[0].y, max_y = triangle[0].y;
308 if (min_y > triangle[i].y) {
309 min_y = triangle[i].y;
311 if (max_y < triangle[i].y) {
312 max_y = triangle[i].y;
329 CPDF_MeshVertex& vertex1 = triangle[i];
330 CPDF_MeshVertex& vertex2 = triangle[(i + 1) % 3];
391 CPDF_MeshVertex triangle[ local
439 CPDF_MeshVertex triangle[3]; local
[all...]
/external/mesa3d/src/mesa/swrast_setup/
H A Dss_tritmp.h33 static void TAG(triangle)(struct gl_context *ctx, GLuint e0, GLuint e1, GLuint e2 ) function
225 TAG(triangle)( ctx, v0, v1, v3 );
228 TAG(triangle)( ctx, v1, v2, v3 );
232 TAG(triangle)( ctx, v0, v1, v3 );
233 TAG(triangle)( ctx, v1, v2, v3 );
242 tri_tab[IND] = TAG(triangle);
/external/mesa3d/src/mesa/tnl_dd/
H A Dt_dd_triemit.h90 static __inline void TAG(triangle)( CTX_ARG, function
H A Dt_dd_tritmp.h55 * AREA_IS_CCW(a): Return true if triangle with signed area a is ccw.
114 static void TAG(triangle)( struct gl_context *ctx, GLuint e0, GLuint e1, GLuint e2 ) function
587 TAG(triangle)( ctx, e0, e1, e3 );
590 TAG(triangle)( ctx, e1, e2, e3 );
593 TAG(triangle)( ctx, e0, e1, e3 );
594 TAG(triangle)( ctx, e1, e2, e3 );
663 TAB[IND].triangle = TAG(triangle);
/external/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_rast.h106 * Rasterization information for a triangle known to be in this bin,
153 } triangle; member in union:lp_rast_cmd_arg
177 lp_rast_arg_triangle( const struct lp_rast_triangle *triangle, argument
181 arg.triangle.tri = triangle;
182 arg.triangle.plane_mask = plane_mask;
187 * Build argument for a contained triangle.
190 * left coordinates of the a block that fully encloses the triangle.
193 lp_rast_arg_triangle_contained( const struct lp_rast_triangle *triangle, argument
197 arg.triangle
[all...]
H A Dlp_setup_context.h30 * The setup code is concerned with point/line/triangle setup and
62 * Point/line/triangle setup context.
155 void (*triangle)( struct lp_setup_context *, member in struct:lp_setup_context
/external/mesa3d/src/mesa/drivers/dri/i915/
H A Dintel_tris.c603 tnl_triangle_func triangle; member in struct:__anon27738
1015 tnl->Driver.Render.Triangle = rast_tab[index].triangle;
/external/mesa3d/src/mesa/drivers/dri/r200/
H A Dr200_swtcl.c404 tnl_triangle_func triangle; member in struct:__anon27901
585 tnl->Driver.Render.Triangle = rast_tab[index].triangle;
/external/mesa3d/src/mesa/drivers/dri/radeon/
H A Dradeon_swtcl.c526 tnl_triangle_func triangle; member in struct:__anon27921
708 tnl->Driver.Render.Triangle = rast_tab[index].triangle;
/external/deqp/modules/gles3/functional/
H A Des3fPolygonOffsetTests.cpp357 const tcu::Vec4 triangle[] = local
392 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle);
431 attribs[0].pointer = triangle;
473 // generater triangle endpoint with following properties
523 // draw colorless (mask = 0,0,0) triangle at random* location, set offset and render green triangle with depthfunc = equal
529 tcu::Vec4 triangle[3]; local
531 for (int vertexNdx = 0; vertexNdx < DE_LENGTH_OF_ARRAY(triangle); ++vertexNdx)
532 triangle[vertexNdx] = genRandomVec4(rnd);
534 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle);
974 const tcu::Vec4 triangle[] = local
[all...]
H A Des3fShaderTextureFunctionTests.cpp1172 const tcu::Vec4 triangle[3] = // covers entire viewport local
1205 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle);
H A Des3fClippingTests.cpp335 // Must be within the triangle area
1281 FillTriangle triangle; local
1283 triangle.c0 = (tri % 2) ? halfWhite : halfWhite + oddSliceColor;
1284 triangle.c1 = (tri % 2) ? halfWhite : halfWhite + oddSliceColor;
1285 triangle.c2 = (tri % 2) ? halfWhite : halfWhite + oddSliceColor;
1286 triangle.v0 = center;
1287 triangle.v1 = tcu::Vec4(vertex0.x() * radius, vertex0.y() * radius, vertex0.z() * radius, 1.0f);
1288 triangle.v2 = tcu::Vec4(vertex1.x() * radius, vertex1.y() * radius, vertex1.z() * radius, 1.0f);
1290 m_triangles.push_back(triangle);
1940 const TriangleCase::TriangleData triangle local
1994 const TriangleCase::TriangleData triangle = {p0, white, p1, white, p2, white}; local
2025 const TriangleCase::TriangleData triangle = {p0, white, p1, white, p2, white}; local
[all...]
/external/deqp/modules/gles31/functional/
H A Des31fTextureMultisampleTests.cpp517 TriangleSceneSpec::SceneTriangle triangle; local
519 triangle.positions[0] = m_testTriangles[triangleNdx].p1 - offset;
520 triangle.positions[1] = m_testTriangles[triangleNdx].p2 - offset;
521 triangle.positions[2] = m_testTriangles[triangleNdx].p3 - offset;
523 triangle.sharedEdge[0] = false;
524 triangle.sharedEdge[1] = false;
525 triangle.sharedEdge[2] = false;
527 scene.triangles.push_back(triangle);
/external/deqp/modules/glshared/
H A DglsRasterizationTestUtil.cpp141 bool pixelOnlyOnASharedEdge (const tcu::IVec2& pixel, const TriangleSceneSpec::SceneTriangle& triangle, const tcu::IVec2& viewportSize) argument
143 if (triangle.sharedEdge[0] || triangle.sharedEdge[1] || triangle.sharedEdge[2])
147 tcu::Vec2(triangle.positions[0].x() / triangle.positions[0].w(), triangle.positions[0].y() / triangle.positions[0].w()),
148 tcu::Vec2(triangle.positions[1].x() / triangle
184 getTriangleAABB(const TriangleSceneSpec::SceneTriangle& triangle, const tcu::IVec2& viewportSize) argument
[all...]
/external/deqp/framework/referencerenderer/
H A DrrRenderer.cpp408 // gen triangle (v0) -> mid1 -> mid2
615 // Clip triangle and form a convex n-gon ( n c {3, 4} )
950 // degenerate triangle, it won't generate any fragments anyway. Return value doesn't matter
964 static float findPrimitiveMaximumDepthSlope (const pa::Triangle& triangle) argument
966 const float d1 = findTriangleVertexDepthSlope(triangle.v0->position, triangle.v1->position, triangle.v2->position);
967 const float d2 = findTriangleVertexDepthSlope(triangle.v1->position, triangle.v2->position, triangle
992 findPrimitiveMinimumResolvableDifference(const pa::Triangle& triangle, const rr::MultisampleConstPixelBufferAccess& depthAccess) argument
1098 rasterizePrimitive(const RenderState& state, const RenderTarget& renderTarget, const Program& program, const pa::Triangle& triangle, const tcu::IVec4& renderTargetRect, RasterizationInternalBuffers& buffers) argument
[all...]
/external/deqp/modules/gles2/functional/
H A Des2fClippingTests.cpp332 // Must be within the triangle area
1277 FillTriangle triangle; local
1279 triangle.c0 = (tri % 2) ? halfWhite : halfWhite + oddSliceColor;
1280 triangle.c1 = (tri % 2) ? halfWhite : halfWhite + oddSliceColor;
1281 triangle.c2 = (tri % 2) ? halfWhite : halfWhite + oddSliceColor;
1282 triangle.v0 = center;
1283 triangle.v1 = tcu::Vec4(vertex0.x() * radius, vertex0.y() * radius, vertex0.z() * radius, 1.0f);
1284 triangle.v2 = tcu::Vec4(vertex1.x() * radius, vertex1.y() * radius, vertex1.z() * radius, 1.0f);
1286 m_triangles.push_back(triangle);
1936 const TriangleCase::TriangleData triangle local
1990 const TriangleCase::TriangleData triangle = {p0, white, p1, white, p2, white}; local
2021 const TriangleCase::TriangleData triangle = {p0, white, p1, white, p2, white}; local
[all...]
H A Des2fPolygonOffsetTests.cpp354 const tcu::Vec4 triangle[] = local
389 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle);
428 attribs[0].pointer = triangle;
470 // generater triangle endpoint with following properties
520 // draw colorless (mask = 0,0,0) triangle at random* location, set offset and render green triangle with depthfunc = equal
526 tcu::Vec4 triangle[3]; local
528 for (int vertexNdx = 0; vertexNdx < DE_LENGTH_OF_ARRAY(triangle); ++vertexNdx)
529 triangle[vertexNdx] = genRandomVec4(rnd);
531 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle);
971 const tcu::Vec4 triangle[] = local
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DConvexHull_Test.cpp50 const Cubic triangle[] = { variable
72 size_t triangle_count = sizeof(triangle) / sizeof(triangle[0]);
82 { triangle, triangle_count },
H A DSkAntiEdge.cpp179 int triangle = xCoverage * yCoverage; // 30 bits local
185 triangle -= xCoverage * yCoverage;
187 coverage = triangle >> 15;
200 int triangle = xCoverage * yCoverage >> 15; local
201 coverage = partial - 1 - triangle;
260 int triangle = xCoverage * yCoverage; // 30 bits local
266 triangle -= xCoverage * yCoverage;
268 coverage = triangle >> 15;
281 int triangle = xCoverage * yCoverage >> 15; local
282 coverage = partial - 1 - triangle;
[all...]
H A DTriangleUtilities.cpp11 bool pointInTriangle(const Triangle& triangle, const _Point& pt) { argument
13 _Vector v0 = triangle[2] - triangle[0];
14 _Vector v1 = triangle[1] - triangle[0];
15 _Vector v2 = pt - triangle[0];
29 // Check if point is in triangle

Completed in 2557 milliseconds

12