| /third_party/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_setup_vbuf.c | 156 setup->triangle(setup, v0, v1, v2); in rect()
157 setup->triangle(setup, v3, v4, v5); in rect()
232 setup->triangle( setup, in lp_setup_draw_elements()
244 setup->triangle( setup, in lp_setup_draw_elements()
254 setup->triangle( setup, in lp_setup_draw_elements()
266 setup->triangle( setup, in lp_setup_draw_elements()
275 setup->triangle( setup, in lp_setup_draw_elements()
288 setup->triangle( setup, in lp_setup_draw_elements()
293 setup->triangle( setup, in lp_setup_draw_elements()
302 setup->triangle( setup, in lp_setup_draw_elements()
[all …]
|
| D | lp_rast.h | 250 } triangle; member
275 lp_rast_arg_triangle( const struct lp_rast_triangle *triangle, in lp_rast_arg_triangle() argument
279 arg.triangle.tri = triangle; in lp_rast_arg_triangle()
280 arg.triangle.plane_mask = plane_mask; in lp_rast_arg_triangle()
292 lp_rast_arg_triangle_contained( const struct lp_rast_triangle *triangle, in lp_rast_arg_triangle_contained() argument
296 arg.triangle.tri = triangle; in lp_rast_arg_triangle_contained()
297 arg.triangle.plane_mask = x | (y << 8); in lp_rast_arg_triangle_contained()
|
| D | lp_rast_tri.c | 113 arg2.triangle.tri = arg.triangle.tri; in lp_rast_triangle_3_16()
114 arg2.triangle.plane_mask = (1<<3)-1; in lp_rast_triangle_3_16()
130 arg2.triangle.tri = arg.triangle.tri; in lp_rast_triangle_4_16()
131 arg2.triangle.plane_mask = (1<<4)-1; in lp_rast_triangle_4_16()
140 arg2.triangle.tri = arg.triangle.tri; in lp_rast_triangle_ms_3_16()
141 arg2.triangle.plane_mask = (1<<3)-1; in lp_rast_triangle_ms_3_16()
157 arg2.triangle.tri = arg.triangle.tri; in lp_rast_triangle_ms_4_16()
158 arg2.triangle.plane_mask = (1<<4)-1; in lp_rast_triangle_ms_4_16()
295 const struct lp_rast_triangle *tri = arg.triangle.tri; in lp_rast_triangle_32_3_16()
297 const int x = (arg.triangle.plane_mask & 0xff) + task->x; in lp_rast_triangle_32_3_16()
[all …]
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/SUN/ |
| D | SUN_triangle_list.txt | 34 OpenGL has two chained triangle primitives, TRIANGLE_STRIP and
35 TRIANGLE_FAN. For multiple, consecutive triangle strips or
36 triangle fans, the overhead of Begin and End, or separate calls to
40 Many surface tessellators produce triangle strips with very few
43 or switch from a triangle strip to a triangle fan, many times
48 savings. Unfortunately, the overhead of switching from a triangle
49 strip to a triangle fan, or vice versa, can reduce, or even
52 A new triangle list primitive, along with an associated replacement
54 triangle strips and fans to be specified within the same Begin/End
55 pair or from a single call to DrawArrays. The triangle list
[all …]
|
| /third_party/openGLES/extensions/SUN/ |
| D | SUN_triangle_list.txt | 34 OpenGL has two chained triangle primitives, TRIANGLE_STRIP and
35 TRIANGLE_FAN. For multiple, consecutive triangle strips or
36 triangle fans, the overhead of Begin and End, or separate calls to
40 Many surface tessellators produce triangle strips with very few
43 or switch from a triangle strip to a triangle fan, many times
48 savings. Unfortunately, the overhead of switching from a triangle
49 strip to a triangle fan, or vice versa, can reduce, or even
52 A new triangle list primitive, along with an associated replacement
54 triangle strips and fans to be specified within the same Begin/End
55 pair or from a single call to DrawArrays. The triangle list
[all …]
|
| /third_party/skia/docs/examples/ |
| D | SKIA_LOGO.cpp | 11 SkPath s, k, a, triangle; in draw() local
79 triangle.reset(); in draw()
80 triangle.moveTo(362.64, 257.32); in draw()
81 triangle.lineTo(335.292, 293.392); in draw()
82 triangle.lineTo(307.8, 257.48); in draw()
83 triangle.lineTo(362.64, 257.32); in draw()
85 canvas->drawPath(triangle, p); in draw()
|
| D | SKIA_LOGO_ANIMATE.cpp | 10 SkPath s, k, a, triangle; in draw() local
91 triangle.reset(); in draw()
92 triangle.moveTo(362.64, 257.32); in draw()
93 triangle.lineTo(335.292, 293.392); in draw()
94 triangle.lineTo(307.8, 257.48); in draw()
95 triangle.lineTo(362.64, 257.32); in draw()
97 canvas->drawPath(triangle, p); in draw()
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/chapters/ |
| D | tessellation.txt | 27 (rectangle or triangle) according to the per-patch outer and inner
80 For triangles, the tessellator subdivides a triangle primitive into smaller
124 relative influence of the three vertices of the triangle on the position of
227 triangle have counter-clockwise ordering if
234 normalized parameter space of the [eq]##i##th vertex of the triangle.
237 triangle have counter-clockwise ordering if [eq]#a# is positive, and
245 area of the triangle.
253 [[tessellation-triangle-tessellation]]
257 triangle is subdivided into a collection of triangles covering the area of
258 the original triangle.
[all …]
|
| D | tessellation.adoc | 27 (rectangle or triangle) according to the per-patch outer and inner
80 For triangles, the tessellator subdivides a triangle primitive into smaller
124 relative influence of the three vertices of the triangle on the position of
227 triangle have counter-clockwise ordering if
234 normalized parameter space of the [eq]##i##th vertex of the triangle.
237 triangle have counter-clockwise ordering if [eq]#a# is positive, and
245 area of the triangle.
253 [[tessellation-triangle-tessellation]]
257 triangle is subdivided into a collection of triangles covering the area of
258 the original triangle.
[all …]
|
| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/ray_query/ |
| D | vktRayQueryBarycentricCoordinatesTests.cpp | 154 tcu::Vec3 calcCoordinates (const std::vector<tcu::Vec3>& triangle, float b, float c) in calcCoordinates() argument
156 DE_ASSERT(triangle.size() == 3u); in calcCoordinates()
164 return triangle[0] * a + triangle[1] * b + triangle[2] * c; in calcCoordinates()
203 const std::vector<tcu::Vec3> triangle = in iterate() local
210 …bottomLevelAS->addGeometry(triangle, true/*is triangles*/, VK_GEOMETRY_NO_DUPLICATE_ANY_HIT_INVOCA… in iterate()
233 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.x(), barycentricABC.y()))… in iterate()
234 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.x()))… in iterate()
235 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.z()))… in iterate()
253 directions.push_back(extendToV4(calcCoordinates(triangle, b, c))); in iterate()
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ray_query/ |
| D | vktRayQueryBarycentricCoordinatesTests.cpp | 154 tcu::Vec3 calcCoordinates (const std::vector<tcu::Vec3>& triangle, float b, float c) in calcCoordinates() argument
156 DE_ASSERT(triangle.size() == 3u); in calcCoordinates()
164 return triangle[0] * a + triangle[1] * b + triangle[2] * c; in calcCoordinates()
203 const std::vector<tcu::Vec3> triangle = in iterate() local
210 …bottomLevelAS->addGeometry(triangle, true/*is triangles*/, VK_GEOMETRY_NO_DUPLICATE_ANY_HIT_INVOCA… in iterate()
233 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.x(), barycentricABC.y()))… in iterate()
234 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.x()))… in iterate()
235 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.z()))… in iterate()
253 directions.push_back(extendToV4(calcCoordinates(triangle, b, c))); in iterate()
|
| /third_party/skia/third_party/externals/swiftshader/src/Renderer/ |
| D | Renderer.cpp | 1120 Triangle *triangle = triangleBatch[unit]; in processPrimitiveVertices() local
1562 vertexRoutine(&triangle->v0, (unsigned int*)&batch, task, data); in processPrimitiveVertices()
1567 Triangle *triangle = triangleBatch[unit]; in setupSolidTriangles() local
1579 for(int i = 0; i < count; i++, triangle++) in setupSolidTriangles()
1581 Vertex &v0 = triangle->v0; in setupSolidTriangles()
1582 Vertex &v1 = triangle->v1; in setupSolidTriangles()
1583 Vertex &v2 = triangle->v2; in setupSolidTriangles()
1599 if(setupRoutine(primitive, triangle, &polygon, data)) in setupSolidTriangles()
1612 Triangle *triangle = triangleBatch[unit]; in setupWireframeTriangle() local
1619 const Vertex &v0 = triangle[0].v0; in setupWireframeTriangle()
[all …]
|
| /third_party/glslang/Test/ |
| D | hlsl.clipdistance-4.geom | 8 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)
|
| D | hlsl.clipdistance-1.geom | 7 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…
|
| D | hlsl.clipdistance-2.geom | 7 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.
|
| D | hlsl.clipdistance-3.geom | 8 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…
|
| /third_party/skia/third_party/externals/opengl-registry/extensions/NV/ |
| D | NV_fill_rectangle.txt | 43 This extension adds a new PolygonMode setting where a triangle is
45 box, disregarding the actual triangle edges. This can be useful for
84 FILL_RECTANGLE_NV mode modifies triangle rasterization to consider a sample
86 bounding box of the triangle after projection. Note that the barycentric
97 If clipping is applied, the triangle is culled rather than clipped. When
152 (1) Where in the pipeline does the conversion from triangle to screen-
156 earlier. So transform feedback would write out the triangle as if it were
157 being FILLed normally, and the triangle may have started life as a
159 a triangle by a geometry shader.
161 (2) What happens if such a triangle is clipped?
[all …]
|
| /third_party/openGLES/extensions/NV/ |
| D | NV_fill_rectangle.txt | 43 This extension adds a new PolygonMode setting where a triangle is
45 box, disregarding the actual triangle edges. This can be useful for
84 FILL_RECTANGLE_NV mode modifies triangle rasterization to consider a sample
86 bounding box of the triangle after projection. Note that the barycentric
97 If clipping is applied, the triangle is culled rather than clipped. When
152 (1) Where in the pipeline does the conversion from triangle to screen-
156 earlier. So transform feedback would write out the triangle as if it were
157 being FILLed normally, and the triangle may have started life as a
159 a triangle by a geometry shader.
161 (2) What happens if such a triangle is clipped?
[all …]
|
| /third_party/vk-gl-cts/external/vulkancts/modules_no_buildgn/vulkan/ray_tracing/ |
| D | vktRayTracingBarycentricCoordinatesTests.cpp | 193 tcu::Vec3 calcCoordinates (const std::vector<tcu::Vec3>& triangle, float b, float c) in calcCoordinates() argument
195 DE_ASSERT(triangle.size() == 3u); in calcCoordinates()
203 return triangle[0] * a + triangle[1] * b + triangle[2] * c; in calcCoordinates()
244 const std::vector<tcu::Vec3> triangle = in iterate() local
251 …bottomLevelAS->addGeometry(triangle, true/*is triangles*/, VK_GEOMETRY_NO_DUPLICATE_ANY_HIT_INVOCA… in iterate()
274 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.x(), barycentricABC.y()))… in iterate()
275 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.x()))… in iterate()
276 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.z()))… in iterate()
294 directions.push_back(extendToV4(calcCoordinates(triangle, b, c))); in iterate()
|
| /third_party/vk-gl-cts/external/vulkancts/modules/vulkan/ray_tracing/ |
| D | vktRayTracingBarycentricCoordinatesTests.cpp | 193 tcu::Vec3 calcCoordinates (const std::vector<tcu::Vec3>& triangle, float b, float c) in calcCoordinates() argument
195 DE_ASSERT(triangle.size() == 3u); in calcCoordinates()
203 return triangle[0] * a + triangle[1] * b + triangle[2] * c; in calcCoordinates()
244 const std::vector<tcu::Vec3> triangle = in iterate() local
251 …bottomLevelAS->addGeometry(triangle, true/*is triangles*/, VK_GEOMETRY_NO_DUPLICATE_ANY_HIT_INVOCA… in iterate()
274 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.x(), barycentricABC.y()))… in iterate()
275 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.x()))… in iterate()
276 …directions.push_back(extendToV4(calcCoordinates(triangle, barycentricABC.y(), barycentricABC.z()))… in iterate()
294 directions.push_back(extendToV4(calcCoordinates(triangle, b, c))); in iterate()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | exhaustiveSwitchStatements1.types | 153 interface Triangle { kind: "triangle"; side: number; }
154 >kind : "triangle"
168 >s.kind : "square" | "rectangle" | "circle" | "triangle"
170 >kind : "square" | "rectangle" | "circle" | "triangle"
212 case "triangle": area = Math.sqrt(3) / 4 * s.side * s.side; break;
213 >"triangle" : "triangle"
244 … case "circle": return Math.PI * s.radius * s.radius; case "triangle": return Math.sqr…
246 … case "circle": return Math.PI * s.radius * s.radius; case "triangle": return Math.sqr…
247 … case "circle": return Math.PI * s.radius * s.radius; case "triangle": return Math.sqr…
248 … case "circle": return Math.PI * s.radius * s.radius; case "triangle": return Math.sqr…
[all …]
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/proposals/ |
| D | VK_EXT_opacity_micromap.adoc | 11 structure as well as a specific application of an opacity micromap to acceleration sub-triangle opa…
17 …om geometry. There are some applications where having a more compact representation of sub-triangle
28 extra information from the application outside of a given triangle.
30 Relatedly, the mapping from triangle to index is another design choice. With raster images, pitch o…
39 structure geometry triangle. The build information contains usage information to compute the size i…
45 mapping information from each triangle in the geometry to a specified triangle index in the microma…
|
| /third_party/flutter/skia/site/dev/design/conical/ |
| D | index.md | 176 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
|
| /third_party/skia/site/docs/dev/design/conical/ |
| D | _index.md | 210 Triangle $\triangle C_f C P$ is similar to triangle $\triangle C_f C_1 P_1$.
212 $x'$ is a solution to $x_t$. Because triangle $\triangle C_f C P$ and triangle
213 $\triangle C_f C_1 P_1$ are similar,
222 _Proof._ Let $C_t = (x_t, 0)$. Triangle $\triangle C_f C_t P$ is similar to
264 P_1$. Triangle $\triangle C_1 H C_f$ is similar to triangle
265 $\triangle P X_P C_f$. Thus
269 Triangle $\triangle C_1 H P_1$ is a right triangle with hypotenuse $r_1$. Hence
284 As before, triangle $\triangle C_1 H C_f$ is similar to triangle
285 $\triangle P X_P C_f$, and triangle $\triangle C_1 H P_1$ is a right triangle,
|
| /third_party/vk-gl-cts/external/vulkan-docs/src/appendices/ |
| D | invariance.adoc | 171 identical set of point, line, or triangle primitives as long as the pipeline
181 subdivided primitive in triangle and quad tessellation, and the tessellation
188 For triangle tessellation, if the subdivision generates a vertex with
212 for triangle and quad tessellation must: be identical except for vertex and
213 triangle order.
214 For each triangle n1 produced by processing the first patch, there must: be
215 a triangle n2 produced when processing the second patch each of whose
221 vertex order, the set of interior triangles generated for triangle and quad
223 triangle order.
224 For each interior triangle n1 produced by processing the first patch, there
[all …]
|