/external/deqp/modules/gles3/stress/ |
H A D | es3sSyncTests.cpp | 162 std::vector<float> vertices; local 177 // Generate vertices 180 generateVertices (vertices, m_numSyncs, m_rnd); 181 glVertexAttribPointer (0, 4, GL_FLOAT, GL_FALSE, 0, &vertices[0]);
|
H A D | es3sOcclusionQueryTests.cpp | 151 std::vector<float> vertices; local 172 vertices.resize(4*NUM_GENERATED_VERTICES); 176 vertices[4*i ] = m_rnd.getFloat(-1.0f, 1.0f); 177 vertices[4*i + 1] = m_rnd.getFloat(-1.0f, 1.0f); 178 vertices[4*i + 2] = m_rnd.getFloat(0.0f, 1.0f); 179 vertices[4*i + 3] = 1.0f; 189 occluderVertices[4*i ] = vertices[4*vtxNdx]; 190 occluderVertices[4*i + 1] = vertices[4*vtxNdx + 1]; 191 occluderVertices[4*i + 2] = vertices[4*vtxNdx + 2]; 192 occluderVertices[4*i + 3] = vertices[ [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/ |
H A D | Surface.java | 88 Vector3f[] vertices = new Vector3f[(uSegments + 1) * (vSegments + 1)];
97 vertices[arrayIndex++] = interpolationResult;
120 Map<Vector3f, Vector3f> normalMap = new HashMap<Vector3f, Vector3f>(vertices.length);
122 Vector3f n = FastMath.computeNormal(vertices[indices[i]], vertices[indices[i + 1]], vertices[indices[i + 2]]);
123 this.addNormal(n, normalMap, smooth, vertices[indices[i]], vertices[indices[i + 1]], vertices[indices[i + 2]]);
125 //preparing normal list (the order of normals must match the order of vertices)
239 addNormal(Vector3f normalToAdd, Map<Vector3f, Vector3f> normalMap, boolean smooth, Vector3f... vertices) argument [all...] |
/external/mesa3d/src/gallium/drivers/softpipe/ |
H A D | sp_prim_vbuf.c | 31 * draw_arrays() functions below will be called. Loop over the vertices and 545 sp_vbuf_so_info(struct vbuf_render *vbr, uint primitives, uint vertices, argument 553 vertices * 4 /*sizeof(float|int32)*/ * 4 /*x,y,z,w*/;
|
/external/mesa3d/src/gallium/tests/graw/ |
H A D | occlusion-query.c | 78 set_vertices(struct vertex *vertices, unsigned bytes) argument 101 vertices);
|
H A D | quad-tex.c | 22 static struct vertex vertices[] = variable in typeref:struct:vertex 62 sizeof(vertices), 63 vertices);
|
H A D | tex-swizzle.c | 22 static struct vertex vertices[] = variable in typeref:struct:vertex 60 sizeof(vertices), 61 vertices);
|
H A D | quad-sample.c | 43 static struct vertex vertices[] = variable in typeref:struct:vertex 106 sizeof(vertices), 107 vertices);
|
H A D | shader-leak.c | 40 static struct vertex vertices[1] = variable in typeref:struct:vertex 96 sizeof(vertices), 97 vertices);
|
H A D | tri-gs.c | 36 static struct vertex vertices[4] = variable in typeref:struct:vertex 97 sizeof(vertices), 98 vertices);
|
H A D | tri-instanced.c | 49 static struct vertex vertices[4] = variable in typeref:struct:vertex 140 sizeof(vertices), 141 vertices);
|
/external/skia/bench/ |
H A D | PatchGridBench.cpp | 59 SkPoint vertices[4][5] = { local 105 points[SkPatchUtils::kTopP0_CubicCtrlPts] = vertices[i][j]; 106 points[SkPatchUtils::kTopP3_CubicCtrlPts] = vertices[i][j + 1]; 107 points[SkPatchUtils::kBottomP0_CubicCtrlPts] = vertices[i + 1][j]; 108 points[SkPatchUtils::kBottomP3_CubicCtrlPts] = vertices[i + 1][j + 1];
|
/external/skia/src/gpu/ |
H A D | GrVertices.h | 134 const GrNonInstancedVertices* init(const GrVertices& vertices) { argument 135 fVertices = &vertices; 136 if (vertices.fInstanceCount <= vertices.fMaxInstancesPerDraw) { 139 return &vertices; 141 SkASSERT(vertices.isInstanced()); 142 fInstanceBatch.fIndexBuffer.reset(vertices.fIndexBuffer.get()); 143 fInstanceBatch.fVertexBuffer.reset(vertices.fVertexBuffer.get()); 144 fInstanceBatch.fIndexCount = vertices.fMaxInstancesPerDraw * 145 vertices [all...] |
H A D | GrBatchTarget.h | 79 void draw(const GrVertices& vertices) { argument 80 fFlushBuffer.back().fVertexDraws.push_back(vertices); 125 void putBackVertices(size_t vertices, size_t vertexStride) { argument 126 fVertexPool->putBack(vertices * vertexStride);
|
H A D | GrRectBatch.cpp | 122 void* vertices = helper.init(batchTarget, vertexStride, instanceCount); variable 124 if (!vertices) { 132 intptr_t offset = GrTCast<intptr_t>(vertices) + kVerticesPerQuad * i * vertexStride;
|
/external/deqp/framework/referencerenderer/ |
H A D | rrPrimitiveAssembler.hpp | 80 static void exec (Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 85 *(outputIterator++) = Triangle(vertices[ndx], vertices[ndx+1], vertices[ndx+2], provokingOffset); 88 static size_t getPrimitiveCount (size_t vertices) argument 90 return vertices / 3; 97 static void exec (Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 104 VertexPacket* vert0 = vertices[0]; 105 VertexPacket* vert1 = vertices[1]; 114 *(outputIterator++) = Triangle(vert0, vert1, vertices[nd 133 getPrimitiveCount(size_t vertices) argument 142 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 157 getPrimitiveCount(size_t vertices) argument 205 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 213 getPrimitiveCount(size_t vertices) argument 222 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 239 getPrimitiveCount(size_t vertices) argument 248 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 267 getPrimitiveCount(size_t vertices) argument 296 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 304 getPrimitiveCount(size_t vertices) argument 358 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 366 getPrimitiveCount(size_t vertices) argument 375 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 383 getPrimitiveCount(size_t vertices) argument 444 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 452 getPrimitiveCount(size_t vertices) argument 461 exec(Iterator outputIterator, VertexPacket* const* vertices, size_t numVertices, rr::ProvokingVertex provokingConvention) argument 504 getPrimitiveCount(size_t vertices) argument [all...] |
/external/deqp/modules/gles3/functional/ |
H A D | es3fSyncTests.cpp | 174 std::vector<float> vertices; local 189 // Generate vertices 192 generateVertices (vertices, m_numPrimitives, m_rnd); 193 glVertexAttribPointer (0, 4, GL_FLOAT, GL_FALSE, 0, &vertices[0]); 197 glDrawArrays(GL_TRIANGLES, 0, (int)vertices.size() / 4);
|
/external/deqp/modules/gles31/functional/ |
H A D | es31fNegativeVertexArrayApiTests.cpp | 356 GLfloat vertices[1]; local 359 ctx.glDrawElements(-1, 1, GL_UNSIGNED_BYTE, vertices); 364 ctx.glDrawElements(GL_POINTS, 1, -1, vertices); 366 ctx.glDrawElements(GL_POINTS, 1, GL_FLOAT, vertices); 371 ctx.glDrawElements(GL_POINTS, -1, GL_UNSIGNED_BYTE, vertices); 379 ctx.glDrawElements(GL_POINTS, 1, GL_UNSIGNED_BYTE, vertices); 403 ctx.glDrawElements (GL_POINTS, 1, GL_UNSIGNED_BYTE, vertices); 407 ctx.glDrawElements (GL_POINTS, 1, GL_UNSIGNED_BYTE, vertices); 424 GLfloat vertices[1]; local 427 ctx.glDrawElements(-1, 1, GL_UNSIGNED_BYTE, vertices); 461 GLfloat vertices[1]; local 628 GLfloat vertices[1]; local 700 GLfloat vertices[1]; local 741 GLfloat vertices[1]; local 816 GLfloat vertices[1]; local 889 GLfloat vertices[1]; local 931 GLfloat vertices[1]; local [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
H A D | BufferUtils.java | 219 * @param vertices 220 * number of vertices that need to be held by the newly created 224 public static FloatBuffer createVector3Buffer(int vertices) { argument 225 FloatBuffer vBuff = createFloatBuffer(3 * vertices); 236 * @param vertices 237 * number of vertices that need to be held by the newly created 241 public static FloatBuffer createVector3Buffer(FloatBuffer buf, int vertices) { argument 242 if (buf != null && buf.limit() == 3 * vertices) { 247 return createFloatBuffer(3 * vertices); 475 * @param vertices 480 createVector2Buffer(int vertices) argument 497 createVector2Buffer(FloatBuffer buf, int vertices) argument [all...] |
H A D | TangentBinormalGenerator.java | 101 VertexData[] vertices = new VertexData[size]; 103 vertices[i] = new VertexData(); 105 return vertices; 143 VertexData[] vertices; 146 vertices = processTriangles(mesh, index, v, t); 149 vertices = processTriangleStrip(mesh, index, v, t); 152 vertices = processTriangleFan(mesh, index, v, t); 159 processTriangleData(mesh, vertices, approxTangents); 192 VertexData[] vertices = initVertexData(vertexBuffer.capacity() / 3); 203 vertices[inde 428 processTriangleData(Mesh mesh, VertexData[] vertices, boolean approxTangent) argument [all...] |
/external/mesa3d/src/gallium/auxiliary/draw/ |
H A D | draw_pipe_vbuf.c | 67 unsigned *vertices; member in struct:vbuf_stage 125 * Recall that the vertices are constructed by the 'draw' module and 134 /* Hmm - vertices are emitted one at a time - better make sure 198 * Set the prim type for subsequent vertices. 220 /* Translate from pipeline vertices to hw vertices. 270 assert(vbuf->vertices == NULL); 321 if(vbuf->vertices) { 334 /* Reset temporary vertices ids */ 342 vbuf->vertex_ptr = vbuf->vertices [all...] |
/external/mesa3d/src/gallium/tests/trivial/ |
H A D | quad-tex.c | 114 float vertices[4][2][4] = { local 134 PIPE_USAGE_STATIC, sizeof(vertices)); 135 pipe_buffer_write(p->pipe, p->vbuf, 0, sizeof(vertices), vertices);
|
H A D | tri.c | 109 float vertices[4][2][4] = { local 125 PIPE_USAGE_STATIC, sizeof(vertices)); 126 pipe_buffer_write(p->pipe, p->vbuf, 0, sizeof(vertices), vertices);
|
/external/skia/src/core/ |
H A D | SkRecords.h | 319 SkPoint* vertices, 328 , vertices(vertices) 338 PODArray<SkPoint> vertices; member in struct:SkRecords::DrawVertices 316 DrawVertices(const SkPaint& paint, SkCanvas::VertexMode vmode, int vertexCount, SkPoint* vertices, SkPoint* texs, SkColor* colors, SkXfermode* xmode, uint16_t* indices, int indexCount) argument
|
/external/ceres-solver/internal/ceres/ |
H A D | visibility_based_preconditioner.cc | 155 // vertices and approximating it with a degree-2 maximum spanning 504 const HashSet<int>& vertices = forest.vertices(); local 505 CHECK_EQ(vertices.size(), num_clusters_); 509 for (HashSet<int>::const_iterator it1 = vertices.begin(); 510 it1 != vertices.end(); 541 // Construct a graph whose vertices are the clusters, and the edge 543 // vertices. 574 // Canonical views clustering returns a HashMap from vertices to 576 // possible that some of the vertices ma [all...] |