Home
last modified time | relevance | path

Searched refs:Vertex (Results 1 – 25 of 73) sorted by relevance

123

/external/skia/src/gpu/
DGrTessellator.cpp97 struct Vertex;
143 struct Vertex { struct
144 Vertex(const SkPoint& point, uint8_t alpha) in Vertex() function
156 Vertex* fPrev; // Linked list of contours, then Y-sorted vertices. argument
157 Vertex* fNext; // " argument
162 Vertex* fPartner; // Corresponding inner or outer vertex (for AA). argument
196 inline void* emit_vertex(Vertex* v, const AAParams* aaParams, void* data) { in emit_vertex()
217 void* emit_triangle(Vertex* v0, Vertex* v1, Vertex* v2, const AAParams* aaParams, void* data) { in emit_triangle()
238 VertexList(Vertex* head, Vertex* tail) : fHead(head), fTail(tail) {} in VertexList()
239 Vertex* fHead;
[all …]
/external/llvm/include/llvm/Support/
DGenericDomTreeConstruction.h43 Vertex.push_back(V); // Vertex[n] = V; in DFSPass()
70 DT.Vertex.push_back(BB); // Vertex[n] = V; in DFSPass()
124 typename GraphT::NodeType* VAncestor = DT.Vertex[VInfo.Parent]; in Eval()
162 DT.Vertex.push_back(nullptr); // Vertex[n] = V; in Calculate()
191 typename GraphT::NodeType* W = DT.Vertex[i]; in Calculate()
197 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
222 DT.IDoms[W] = DT.Vertex[WInfo.Parent]; in Calculate()
230 typename GraphT::NodeType* Root = DT.Vertex[1]; in Calculate()
232 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
239 typename GraphT::NodeType* W = DT.Vertex[i]; in Calculate()
[all …]
DGenericDomTree.h210 Vertex.clear(); in wipe()
236 std::vector<NodeT *> Vertex; variable
245 Vertex.clear(); in reset()
327 Vertex(std::move(Arg.Vertex)), Info(std::move(Arg.Info)) { in DominatorTreeBase()
338 Vertex = std::move(RHS.Vertex);
720 this->Vertex.push_back(nullptr); in recalculate()
/external/swiftshader/src/Shader/
DVertexRoutine.cpp69 Pointer<Byte> cacheLine0 = vertexCache + tagIndex * UInt((int)sizeof(Vertex)); in generate()
74 Pointer<Byte> cacheLine = vertexCache + cacheIndex * UInt((int)sizeof(Vertex)); in generate()
89 vertex += sizeof(Vertex); in generate()
618 *Pointer<Float>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 0) = v.x.x; in writeCache()
619 *Pointer<Float>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 1) = v.x.y; in writeCache()
620 *Pointer<Float>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 2) = v.x.z; in writeCache()
621 *Pointer<Float>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 3) = v.x.w; in writeCache()
634 *Pointer<Float4>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 0, 16) = v.x; in writeCache()
635 *Pointer<Float4>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 1, 16) = v.y; in writeCache()
636 *Pointer<Float4>(cacheLine + OFFSET(Vertex,v[i]) + sizeof(Vertex) * 2, 16) = v.z; in writeCache()
[all …]
DSetupRoutine.cpp68 X[0] = *Pointer<Int>(v0 + OFFSET(Vertex,X)); in generate()
69 X[1] = *Pointer<Int>(v1 + OFFSET(Vertex,X)); in generate()
70 X[2] = *Pointer<Int>(v2 + OFFSET(Vertex,X)); in generate()
72 Y[0] = *Pointer<Int>(v0 + OFFSET(Vertex,Y)); in generate()
73 Y[1] = *Pointer<Int>(v1 + OFFSET(Vertex,Y)); in generate()
74 Y[2] = *Pointer<Int>(v2 + OFFSET(Vertex,Y)); in generate()
316 Float rhw0 = *Pointer<Float>(v0 + OFFSET(Vertex,W)); in generate()
318 Int X0 = *Pointer<Int>(v0 + OFFSET(Vertex,X)); in generate()
319 Int X1 = *Pointer<Int>(v1 + OFFSET(Vertex,X)); in generate()
320 Int X2 = *Pointer<Int>(v2 + OFFSET(Vertex,X)); in generate()
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DDominatorInternals.h44 Vertex.push_back(V); // Vertex[n] = V; in DFSPass()
71 DT.Vertex.push_back(BB); // Vertex[n] = V; in DFSPass()
125 typename GraphT::NodeType* VAncestor = DT.Vertex[VInfo.Parent]; in Eval()
163 DT.Vertex.push_back(NULL); // Vertex[n] = V; in Calculate()
192 typename GraphT::NodeType* W = DT.Vertex[i]; in Calculate()
198 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
223 DT.IDoms[W] = DT.Vertex[WInfo.Parent]; in Calculate()
231 typename GraphT::NodeType* Root = DT.Vertex[1]; in Calculate()
233 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]]; in Calculate()
240 typename GraphT::NodeType* W = DT.Vertex[i]; in Calculate()
[all …]
/external/opencv/cvaux/src/
Denmin.cpp75 struct Vertex
197 getSizeForGraph( Vertex ),
211 ( ( Vertex* )newVtxPtr ) -> coord = i;
216 ( ( Vertex* )newVtxPtr ) -> coord = -2; /* adding alpha vertex */
219 ( ( Vertex* )newVtxPtr ) -> coord = -1; /* adding beta vertex */
235 ( ( Vertex* )vtxPtr ) -> coord,
242 if( ( ( Vertex* )tempVtxPtr ) -> coord + 1 ==
243 ( ( Vertex* )vtxPtr ) -> coord )
246 vFunc( corr[ ( ( Vertex* )tempVtxPtr ) -> coord ],
255 ( ( Vertex* )vtxPtr ) -> coord;
[all …]
/external/clang/test/CodeGenCXX/
Ddebug-info-template-array.cpp9 struct Vertex {}; struct
13 unique_ptr<Vertex<2>[]> v = unique_ptr<Vertex<2>[]>(); in crash()
/external/swiftshader/src/Renderer/
DTriangle.hpp24 Vertex V0;
25 Vertex V1;
26 Vertex V2;
DPrimitive.hpp25 Vertex v0;
26 Vertex v1;
27 Vertex v2;
DVertex.hpp62 ALIGN(16, struct Vertex
95 …static_assert((sizeof(Vertex) & 0x0000000F) == 0, "Vertex size not a multiple of 16 bytes (alignme…
DSetupProcessor.hpp29 struct Vertex;
DVertexProcessor.hpp30 Vertex vertex[16][4];
182 …typedef void (*RoutinePointer)(Vertex *output, unsigned int *batch, VertexTask *vertexTask, DrawDa…
/external/skia/gm/
Dbeziereffects.cpp50 struct Vertex { struct in skiagm::BezierCubicOrConicTestOp
58 SkASSERT(vertexStride == sizeof(Vertex)); in onPrepareDraws()
59 Vertex* verts = reinterpret_cast<Vertex*>(helper.init(target, vertexStride, 1)); in onPrepareDraws()
64 sizeof(Vertex)); in onPrepareDraws()
113 struct Vertex { in onDraw() struct
253 struct Vertex { in onDraw() struct
413 struct Vertex { struct in skiagm::BezierQuadTestOp
421 SkASSERT(vertexStride == sizeof(Vertex)); in onPrepareDraws()
422 Vertex* verts = reinterpret_cast<Vertex*>(helper.init(target, vertexStride, 1)); in onPrepareDraws()
427 sizeof(Vertex)); in onPrepareDraws()
[all …]
/external/skia/src/gpu/ops/
DGrMSAAPathRenderer.cpp52 struct Vertex { struct
56 Vertex* vertices;
57 Vertex* nextVertex;
59 Vertex* verticesEnd;
66 struct Vertex { struct
71 Vertex* vertices;
72 Vertex* nextVertex;
74 Vertex* verticesEnd;
337 size_t lineVertexStride = sizeof(MSAALineVertices::Vertex); in onPrepareDraws()
338 lines.vertices = (MSAALineVertices::Vertex*) target->makeVertexSpace(lineVertexStride, in onPrepareDraws()
[all …]
/external/skia/bench/
DGLVec4ScalarBench.cpp202 struct Vertex { struct
210 Vertex vertices[kVerticesPerTri * kNumTriPerDraw]; in setupSingleVbo() argument
212 Vertex* v = &vertices[i * kVerticesPerTri]; in setupSingleVbo()
223 viewMatrices[i].mapPointsWithStride(position, sizeof(Vertex), kVerticesPerTri); in setupSingleVbo()
238 GR_GL_CALL(gl, VertexAttribPointer(0, 2, GR_GL_FLOAT, GR_GL_FALSE, sizeof(Vertex), in setupSingleVbo()
240 GR_GL_CALL(gl, VertexAttribPointer(1, 3, GR_GL_FLOAT, GR_GL_FALSE, sizeof(Vertex), in setupSingleVbo()
DGLInstancedArraysBench.cpp262 struct Vertex { struct
270 Vertex vertices[kVerticesPerTri * kNumTri]; in setupSingleVbo() argument
272 Vertex* v = &vertices[i * kVerticesPerTri]; in setupSingleVbo()
278 viewMatrices[i].mapPointsWithStride(position, sizeof(Vertex), kVerticesPerTri); in setupSingleVbo()
295 GR_GL_CALL(gl, VertexAttribPointer(0, 2, GR_GL_FLOAT, GR_GL_FALSE, sizeof(Vertex), in setupSingleVbo()
297 GR_GL_CALL(gl, VertexAttribPointer(1, 3, GR_GL_FLOAT, GR_GL_FALSE, sizeof(Vertex), in setupSingleVbo()
/external/libmojo/mojo/public/interfaces/bindings/tests/
Dregression_tests.mojom38 Vertex? v;
41 struct Vertex {
/external/mesa3d/src/gallium/docs/source/cso/
Dvelems.rst3 Vertex Elements
36 Vertex position may be specified with two to four components. Using less than
/external/mesa3d/src/gallium/docs/
Dllvm-todo.txt11 Vertex ID support.
/external/swiftshader/third_party/PowerVR_SDK/Examples/Beginner/01_HelloAPI/
DHelloAPI.txt19 :Vertex Count:
/external/deqp/doc/testspecs/GLES31/
Dfunctional.vertex_attribute_binding.txt19 Vertex Attribute Binding Tests
27 + Vertex attribute binding state setting and queries
/external/mesa3d/doxygen/
Dshader.doxy8 PROJECT_NAME = "Mesa Vertex and Fragment Program code"
/external/mesa3d/src/mesa/tnl_dd/
Dt_dd_vertex.h77 } TAG(Vertex), *TAG(VertexPtr);
/external/deqp/data/gles31/shaders/
Dlinkage_uniform.test4 desc "Vertex side uniform has highp, fragment side uniform mediump."
33 desc "Vertex side uniform has highp, fragment side uniform mediump."
62 desc "Vertex side uniform has lowp, fragment side uniform highp."
91 desc "Vertex side uniform has lowp, fragment side uniform mediump."
976 desc "Vertex struct has int, fragment struct has float."
1007 desc "Vertex struct has vec3, fragment struct has vec4."
1038 desc "Vertex side struct has highp, fragment side struct mediump."
1069 desc "Vertex side struct has mediump, fragment side struct lowp."
1100 desc "Vertex side struct has lowp, fragment side struct mediump."
1131 desc "Vertex side struct has lowp, fragment side struct implicit mediump."

123