Home
last modified time | relevance | path

Searched refs:triangle (Results 1 – 25 of 199) sorted by relevance

12345678

/external/mesa3d/src/gallium/drivers/llvmpipe/
Dlp_setup_vbuf.c188 setup->triangle( setup, in lp_setup_draw_elements()
199 setup->triangle( setup, in lp_setup_draw_elements()
209 setup->triangle( setup, in lp_setup_draw_elements()
221 setup->triangle( setup, in lp_setup_draw_elements()
230 setup->triangle( setup, in lp_setup_draw_elements()
243 setup->triangle( setup, in lp_setup_draw_elements()
248 setup->triangle( setup, in lp_setup_draw_elements()
257 setup->triangle( setup, in lp_setup_draw_elements()
262 setup->triangle( setup, in lp_setup_draw_elements()
275 setup->triangle( setup, in lp_setup_draw_elements()
[all …]
Dlp_rast.h178 } triangle; member
202 lp_rast_arg_triangle( const struct lp_rast_triangle *triangle, in lp_rast_arg_triangle() argument
206 arg.triangle.tri = triangle; in lp_rast_arg_triangle()
207 arg.triangle.plane_mask = plane_mask; in lp_rast_arg_triangle()
218 lp_rast_arg_triangle_contained( const struct lp_rast_triangle *triangle, in lp_rast_arg_triangle_contained() argument
222 arg.triangle.tri = triangle; in lp_rast_arg_triangle_contained()
223 arg.triangle.plane_mask = x | (y << 8); in lp_rast_arg_triangle_contained()
Dlp_rast_tri.c114 arg2.triangle.tri = arg.triangle.tri; in lp_rast_triangle_3_16()
115 arg2.triangle.plane_mask = (1<<3)-1; in lp_rast_triangle_3_16()
131 arg2.triangle.tri = arg.triangle.tri; in lp_rast_triangle_4_16()
132 arg2.triangle.plane_mask = (1<<4)-1; in lp_rast_triangle_4_16()
244 const struct lp_rast_triangle *tri = arg.triangle.tri; in lp_rast_triangle_32_3_16()
246 int x = (arg.triangle.plane_mask & 0xff) + task->x; in lp_rast_triangle_32_3_16()
247 int y = (arg.triangle.plane_mask >> 8) + task->y; in lp_rast_triangle_32_3_16()
357 const struct lp_rast_triangle *tri = arg.triangle.tri; in lp_rast_triangle_32_3_4()
359 unsigned x = (arg.triangle.plane_mask & 0xff) + task->x; in lp_rast_triangle_32_3_4()
360 unsigned y = (arg.triangle.plane_mask >> 8) + task->y; in lp_rast_triangle_32_3_4()
[all …]
Dlp_rast_tri_tmp.h180 const struct lp_rast_triangle *tri = arg.triangle.tri; in TAG()
181 unsigned plane_mask = arg.triangle.plane_mask; in TAG()
333 const struct lp_rast_triangle *tri = arg.triangle.tri; in TRI_16()
335 unsigned mask = arg.triangle.plane_mask; in TRI_16()
406 const struct lp_rast_triangle *tri = arg.triangle.tri; in TRI_4()
408 unsigned mask = arg.triangle.plane_mask; in TRI_4()
/external/deqp-deps/glslang/Test/
Dhlsl.clipdistance-4.geom8 void main(triangle in float4 pos[3] : SV_Position,
9 triangle in uint VertexID[3] : VertexID,
11 triangle in float2 clip0[3] : SV_ClipDistance0, // test input arrayed semantic vars
12 triangle in float2 clip1[3] : SV_ClipDistance1)
Dhlsl.clipdistance-2.geom7 void main(triangle in float4 pos[3] : SV_Position,
8 triangle in uint VertexID[3] : VertexID,
10 … triangle in float2 clip[3][2] : SV_ClipDistance) // externally: an array 3 of array 4 of float.
Dhlsl.clipdistance-1.geom7 void main(triangle in float4 pos[3] : SV_Position,
8 triangle in uint VertexID[3] : VertexID,
10 …triangle in float4 clip[3] : SV_ClipDistance) // externally: an array 3 of array 4 (not vec4!) o…
Dhlsl.clipdistance-3.geom8 void main(triangle in float4 pos[3] : SV_Position,
9 triangle in uint VertexID[3] : VertexID,
11 …triangle in float4 clip[3] : SV_ClipDistance) // externally: an array 3 of array 4 (not vec4!) o…
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/ARM/
Darm-frame-lowering-no-terminator.ll12 define internal void @foo(%t2* nocapture %this, %t1* nocapture readonly %triangle, i32 %partId, i32…
17 %arrayidx.i = getelementptr inbounds %t1, %t1* %triangle, i32 0, i32 0, i32 0
19 %arrayidx5.i = getelementptr inbounds %t1, %t1* %triangle, i32 0, i32 0, i32 1
22 %arrayidx11.i = getelementptr inbounds %t1, %t1* %triangle, i32 0, i32 0, i32 2
26 %arrayidx.i129 = getelementptr inbounds %t1, %t1* %triangle, i32 1, i32 0, i32 0
29 %arrayidx5.i132 = getelementptr inbounds %t1, %t1* %triangle, i32 1, i32 0, i32 1
32 %arrayidx11.i135 = getelementptr inbounds %t1, %t1* %triangle, i32 1, i32 0, i32 2
35 %arrayidx.i149 = getelementptr inbounds %t1, %t1* %triangle, i32 2, i32 0, i32 0
38 %arrayidx5.i152 = getelementptr inbounds %t1, %t1* %triangle, i32 2, i32 0, i32 1
/external/swiftshader/src/Renderer/
DRenderer.cpp1119 Triangle *triangle = triangleBatch[unit]; in processPrimitiveVertices() local
1561 vertexRoutine(&triangle->v0, (unsigned int*)&batch, task, data); in processPrimitiveVertices()
1566 Triangle *triangle = triangleBatch[unit]; in setupSolidTriangles() local
1578 for(int i = 0; i < count; i++, triangle++) in setupSolidTriangles()
1580 Vertex &v0 = triangle->v0; in setupSolidTriangles()
1581 Vertex &v1 = triangle->v1; in setupSolidTriangles()
1582 Vertex &v2 = triangle->v2; in setupSolidTriangles()
1598 if(setupRoutine(primitive, triangle, &polygon, data)) in setupSolidTriangles()
1611 Triangle *triangle = triangleBatch[unit]; in setupWireframeTriangle() local
1618 const Vertex &v0 = triangle[0].v0; in setupWireframeTriangle()
[all …]
/external/tensorflow/tensorflow/core/kernels/
Dmatrix_triangular_solve_op.cc95 auto triangle = matrix.template triangularView<Eigen::Lower>(); in ComputeMatrix() local
97 output.noalias() = triangle.adjoint().solve(rhs); in ComputeMatrix()
99 output.noalias() = triangle.solve(rhs); in ComputeMatrix()
102 auto triangle = matrix.template triangularView<Eigen::Upper>(); in ComputeMatrix() local
104 output.noalias() = triangle.adjoint().solve(rhs); in ComputeMatrix()
106 output.noalias() = triangle.solve(rhs); in ComputeMatrix()
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/javabeans/
DTriangleBeanTest.java25 Triangle triangle = new Triangle(); in testGetTriangle() local
26 triangle.setName("Triangle25"); in testGetTriangle()
28 bean.setShape(triangle); in testGetTriangle()
/external/skqp/site/dev/design/conical/
Dindex.md176 Triangle $\triangle C_f C P$ is similar to triangle $\triangle C_f C_1 P_1$.
178 to $x_t$. Because triangle $\triangle C_f C P$ and triangle $\triangle C_f C_1 P_1$ are similar, $x'
185 *Proof.* Let $C_t = (x_t, 0)$. Triangle $\triangle C_f C_t P$ is similar to $C_f C_1 P_1$. Therefore
219 P_1$. Triangle $\triangle C_1 H C_f$ is similar to triangle $\triangle P X_P C_f$. Thus
223 Triangle $\triangle C_1 H P_1$ is a right triangle with hypotenuse $r_1$. Hence
241 As before, triangle $\triangle C_1 H C_f$ is similar to triangle $\triangle P X_P C_f$, and triangle
242 $\triangle C_1 H P_1$ is a right triangle, so we have
/external/skia/site/dev/design/conical/
Dindex.md176 Triangle $\triangle C_f C P$ is similar to triangle $\triangle C_f C_1 P_1$.
178 to $x_t$. Because triangle $\triangle C_f C P$ and triangle $\triangle C_f C_1 P_1$ are similar, $x'
185 *Proof.* Let $C_t = (x_t, 0)$. Triangle $\triangle C_f C_t P$ is similar to $C_f C_1 P_1$. Therefore
219 P_1$. Triangle $\triangle C_1 H C_f$ is similar to triangle $\triangle P X_P C_f$. Thus
223 Triangle $\triangle C_1 H P_1$ is a right triangle with hypotenuse $r_1$. Hence
241 As before, triangle $\triangle C_1 H C_f$ is similar to triangle $\triangle P X_P C_f$, and triangle
242 $\triangle C_1 H P_1$ is a right triangle, so we have
/external/mesa3d/src/mesa/swrast_setup/
Dss_tritmp.h33 static void TAG(triangle)(struct gl_context *ctx, GLuint e0, GLuint e1, GLuint e2 ) in TAG() argument
225 TAG(triangle)( ctx, v0, v1, v3 ); in TAG() local
228 TAG(triangle)( ctx, v1, v2, v3 ); in TAG() local
232 TAG(triangle)( ctx, v0, v1, v3 ); in TAG() local
233 TAG(triangle)( ctx, v1, v2, v3 ); in TAG() local
242 tri_tab[IND] = TAG(triangle); in TAG()
/external/skqp/gm/
Dsharedcorners.cpp110 for (const std::array<int, 3>& triangle : triangles) { in drawTriangleBoxes() local
111 path.moveTo(points[triangle[0]]); in drawTriangleBoxes()
112 path.lineTo(points[triangle[1]]); in drawTriangleBoxes()
113 path.lineTo(points[triangle[2]]); in drawTriangleBoxes()
/external/skia/gm/
Dsharedcorners.cpp110 for (const std::array<int, 3>& triangle : triangles) { in drawTriangleBoxes() local
111 path.moveTo(points[triangle[0]]); in drawTriangleBoxes()
112 path.lineTo(points[triangle[1]]); in drawTriangleBoxes()
113 path.lineTo(points[triangle[2]]); in drawTriangleBoxes()
/external/deqp/modules/gles3/functional/
Des3fPolygonOffsetTests.cpp357 const tcu::Vec4 triangle[] = in testPolygonOffset() local
392 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle); in testPolygonOffset()
431 attribs[0].pointer = triangle; in testPolygonOffset()
529 tcu::Vec4 triangle[3]; in testPolygonOffset() local
531 for (int vertexNdx = 0; vertexNdx < DE_LENGTH_OF_ARRAY(triangle); ++vertexNdx) in testPolygonOffset()
532 triangle[vertexNdx] = genRandomVec4(rnd); in testPolygonOffset()
534 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle); in testPolygonOffset()
537 for (size_t ndx = 0; ndx < DE_LENGTH_OF_ARRAY(triangle); ++ndx) in testPolygonOffset()
539 << "\tx=" << triangle[ndx].x() in testPolygonOffset()
540 << "\ty=" << triangle[ndx].y() in testPolygonOffset()
[all …]
/external/deqp/modules/gles2/functional/
Des2fPolygonOffsetTests.cpp354 const tcu::Vec4 triangle[] = in testPolygonOffset() local
389 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle); in testPolygonOffset()
428 attribs[0].pointer = triangle; in testPolygonOffset()
526 tcu::Vec4 triangle[3]; in testPolygonOffset() local
528 for (int vertexNdx = 0; vertexNdx < DE_LENGTH_OF_ARRAY(triangle); ++vertexNdx) in testPolygonOffset()
529 triangle[vertexNdx] = genRandomVec4(rnd); in testPolygonOffset()
531 gl.vertexAttribPointer (positionLoc, 4, GL_FLOAT, GL_FALSE, 0, triangle); in testPolygonOffset()
534 for (size_t ndx = 0; ndx < DE_LENGTH_OF_ARRAY(triangle); ++ndx) in testPolygonOffset()
536 << "\tx=" << triangle[ndx].x() in testPolygonOffset()
537 << "\ty=" << triangle[ndx].y() in testPolygonOffset()
[all …]
/external/swiftshader/src/Device/
DRenderer.cpp992 Triangle *triangle = triangleBatch[unit]; in processPrimitiveVertices() local
1284 vertexRoutine(&triangle->v0, (unsigned int*)&batch, task, data); in processPrimitiveVertices()
1289 Triangle *triangle = triangleBatch[unit]; in setupTriangles() local
1301 for(int i = 0; i < count; i++, triangle++) in setupTriangles()
1303 Vertex &v0 = triangle->v0; in setupTriangles()
1304 Vertex &v1 = triangle->v1; in setupTriangles()
1305 Vertex &v2 = triangle->v2; in setupTriangles()
1321 if(setupRoutine(primitive, triangle, &polygon, data)) in setupTriangles()
1334 Triangle *triangle = triangleBatch[unit]; in setupLines() local
1345 if(setupLine(*primitive, *triangle, draw)) in setupLines()
[all …]
/external/deqp/doc/testspecs/GLES31/
Dfunctional.separate_shader.txt49 glUseProgram and and glBindProgramPipeline and draws a triangle. The
55 program. After this, glUniform is called and a triangle is drawn. The
68 single-shader program. A triangle is drawn with the pipeline and the
69 result is compared to a triangle drawn with an equivalent monolithic
88 diagonal stripes in the drawn triangle.
/external/libcxx/test/std/numerics/numeric.ops/exclusive.scan/
Dexclusive_scan.pass.cpp58 size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
76 assert(v[i] == 30 + triangle(i-1)); in basic_tests()
84 assert(v[i] == 40 + triangle(i)); in basic_tests()
/external/libcxx/test/std/numerics/numeric.ops/inclusive.scan/
Dinclusive_scan.pass.cpp58 size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
76 assert(v[i] == triangle(i)); in basic_tests()
84 assert(v[i] == triangle(i + 1)); in basic_tests()
Dinclusive_scan_op.pass.cpp64 size_t triangle(size_t n) { return n*(n+1)/2; } in triangle() function
82 assert(v[i] == triangle(i)); in basic_tests()
90 assert(v[i] == triangle(i + 1)); in basic_tests()
/external/swiftshader/third_party/PowerVR_SDK/Examples/Beginner/01_HelloAPI/
DHelloAPI.txt5 Draw a triangle to the screen using hardware acceleration.
8 …ep, through the process of initializing a window using :API:, drawing a triangle in it using hardw…

12345678