| /dports/games/alephone/alephone-release-20190331/Source_Files/RenderMain/ |
| H A D | RenderRasterize.cpp | 368 vertex_count= polygon->vertex_count; in render_node_floor_or_ceiling()
390 if (vertex_count) in render_node_floor_or_ceiling()
445 textured_polygon.vertex_count= vertex_count; in render_node_floor_or_ceiling()
481 vertex_count= 2; in render_node_side()
489 if (vertex_count) in render_node_side()
492 vertex_count= 4; in render_node_side()
573 textured_polygon.vertex_count= vertex_count; in render_node_side()
653 if (vertex_count) in xy_clip_horizontal_polygon()
879 if (vertex_count) in z_clip_horizontal_polygon()
1097 if (vertex_count) in xy_clip_line()
[all …]
|
| /dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/src/ |
| H A D | meshoptimizer.h | 158 MESHOPTIMIZER_API size_t meshopt_encodeIndexBufferBound(size_t index_count, size_t vertex_count);
179 MESHOPTIMIZER_API size_t meshopt_encodeVertexBufferBound(size_t vertex_count, size_t vertex_size);
302 unsigned char vertex_count; member
679 …meshopt_generateShadowIndexBufferMulti(out.data, in.data, index_count, vertex_count, streams, stre…
688 meshopt_optimizeVertexCache(out.data, in.data, index_count, vertex_count);
697 meshopt_optimizeVertexCacheFifo(out.data, in.data, index_count, vertex_count, cache_size);
714 return meshopt_optimizeVertexFetchRemap(destination, in.data, index_count, vertex_count);
766 return meshopt_stripify(out.data, in.data, index_count, vertex_count, unsigned(restart_index));
783 …return meshopt_analyzeVertexCache(in.data, index_count, vertex_count, cache_size, warp_size, buffe…
799 return meshopt_analyzeVertexFetch(in.data, index_count, vertex_count, vertex_size);
[all …]
|
| H A D | indexgenerator.cpp | 128 assert(indices || index_count == vertex_count); in meshopt_generateVertexRemap()
138 size_t table_size = hashBuckets(vertex_count); in meshopt_generateVertexRemap()
147 assert(index < vertex_count); in meshopt_generateVertexRemap()
168 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemap()
193 size_t table_size = hashBuckets(vertex_count); in meshopt_generateVertexRemapMulti()
202 assert(index < vertex_count); in meshopt_generateVertexRemapMulti()
223 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemapMulti()
242 for (size_t i = 0; i < vertex_count; ++i) in meshopt_remapVertexBuffer()
246 assert(remap[i] < vertex_count); in meshopt_remapVertexBuffer()
289 assert(index < vertex_count); in meshopt_generateShadowIndexBuffer()
[all …]
|
| H A D | vfetchoptimizer.cpp | 7 …ap(unsigned int* destination, const unsigned int* indices, size_t index_count, size_t vertex_count) in meshopt_optimizeVertexFetchRemap() argument
11 memset(destination, -1, vertex_count * sizeof(unsigned int)); in meshopt_optimizeVertexFetchRemap()
18 assert(index < vertex_count); in meshopt_optimizeVertexFetchRemap()
26 assert(next_vertex <= vertex_count); in meshopt_optimizeVertexFetchRemap()
31 …signed int* indices, size_t index_count, const void* vertices, size_t vertex_count, size_t vertex_… in meshopt_optimizeVertexFetch() argument
41 unsigned char* vertices_copy = allocator.allocate<unsigned char>(vertex_count * vertex_size); in meshopt_optimizeVertexFetch()
42 memcpy(vertices_copy, vertices, vertex_count * vertex_size); in meshopt_optimizeVertexFetch()
47 unsigned int* vertex_remap = allocator.allocate<unsigned int>(vertex_count); in meshopt_optimizeVertexFetch()
48 memset(vertex_remap, -1, vertex_count * sizeof(unsigned int)); in meshopt_optimizeVertexFetch()
55 assert(index < vertex_count); in meshopt_optimizeVertexFetch()
[all …]
|
| H A D | spatialorder.cpp | 31 for (size_t i = 0; i < vertex_count; ++i) in computeOrder()
53 for (size_t i = 0; i < vertex_count; ++i) in computeOrder()
121 unsigned int* keys = allocator.allocate<unsigned int>(vertex_count); in meshopt_spatialSortRemap()
125 computeHistogram(hist, keys, vertex_count); in meshopt_spatialSortRemap()
129 for (size_t i = 0; i < vertex_count; ++i) in meshopt_spatialSortRemap()
133 radixPass(scratch, destination, keys, vertex_count, hist, 0); in meshopt_spatialSortRemap()
134 radixPass(destination, scratch, keys, vertex_count, hist, 1); in meshopt_spatialSortRemap()
135 radixPass(scratch, destination, keys, vertex_count, hist, 2); in meshopt_spatialSortRemap()
138 for (size_t i = 0; i < vertex_count; ++i) in meshopt_spatialSortRemap()
150 (void)vertex_count; in meshopt_spatialSortTriangles()
[all …]
|
| H A D | vcacheoptimizer.cpp | 36 adjacency.counts = allocator.allocate<unsigned int>(vertex_count); in buildTriangleAdjacency()
37 adjacency.offsets = allocator.allocate<unsigned int>(vertex_count); in buildTriangleAdjacency()
41 memset(adjacency.counts, 0, vertex_count * sizeof(unsigned int)); in buildTriangleAdjacency()
45 assert(indices[i] < vertex_count); in buildTriangleAdjacency()
53 for (size_t i = 0; i < vertex_count; ++i) in buildTriangleAdjacency()
72 for (size_t i = 0; i < vertex_count; ++i) in buildTriangleAdjacency()
92 while (input_cursor < vertex_count) in getNextVertexDeadEnd()
168 if (index_count == 0 || vertex_count == 0) in meshopt_optimizeVertexCache()
197 float* vertex_scores = allocator.allocate<float>(vertex_count); in meshopt_optimizeVertexCache()
199 for (size_t i = 0; i < vertex_count; ++i) in meshopt_optimizeVertexCache()
[all …]
|
| H A D | simplifier.cpp | 47 assert(indices[i] < vertex_count); in buildEdgeAdjacency()
55 for (size_t i = 0; i < vertex_count; ++i) in buildEdgeAdjacency()
74 for (size_t i = 0; i < vertex_count; ++i) in buildEdgeAdjacency()
163 for (size_t i = 0; i < vertex_count; ++i) in buildPositionRemap()
176 for (size_t i = 0; i < vertex_count; ++i) in buildPositionRemap()
179 for (size_t i = 0; i < vertex_count; ++i) in buildPositionRemap()
272 for (size_t i = 0; i < vertex_count; ++i) in classifyVertices()
282 for (size_t i = 0; i < vertex_count; ++i) in classifyVertices()
378 for (size_t i = 0; i < vertex_count; ++i) in rescalePositions()
403 for (size_t i = 0; i < vertex_count; ++i) in rescalePositions()
[all …]
|
| /dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/src/ |
| H A D | meshoptimizer.h | 158 MESHOPTIMIZER_API size_t meshopt_encodeIndexBufferBound(size_t index_count, size_t vertex_count);
179 MESHOPTIMIZER_API size_t meshopt_encodeVertexBufferBound(size_t vertex_count, size_t vertex_size);
302 unsigned char vertex_count; member
679 …meshopt_generateShadowIndexBufferMulti(out.data, in.data, index_count, vertex_count, streams, stre…
688 meshopt_optimizeVertexCache(out.data, in.data, index_count, vertex_count);
697 meshopt_optimizeVertexCacheFifo(out.data, in.data, index_count, vertex_count, cache_size);
714 return meshopt_optimizeVertexFetchRemap(destination, in.data, index_count, vertex_count);
766 return meshopt_stripify(out.data, in.data, index_count, vertex_count, unsigned(restart_index));
783 …return meshopt_analyzeVertexCache(in.data, index_count, vertex_count, cache_size, warp_size, buffe…
799 return meshopt_analyzeVertexFetch(in.data, index_count, vertex_count, vertex_size);
[all …]
|
| H A D | indexgenerator.cpp | 128 assert(indices || index_count == vertex_count); in meshopt_generateVertexRemap()
138 size_t table_size = hashBuckets(vertex_count); in meshopt_generateVertexRemap()
147 assert(index < vertex_count); in meshopt_generateVertexRemap()
168 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemap()
193 size_t table_size = hashBuckets(vertex_count); in meshopt_generateVertexRemapMulti()
202 assert(index < vertex_count); in meshopt_generateVertexRemapMulti()
223 assert(next_vertex <= vertex_count); in meshopt_generateVertexRemapMulti()
242 for (size_t i = 0; i < vertex_count; ++i) in meshopt_remapVertexBuffer()
246 assert(remap[i] < vertex_count); in meshopt_remapVertexBuffer()
289 assert(index < vertex_count); in meshopt_generateShadowIndexBuffer()
[all …]
|
| H A D | vfetchoptimizer.cpp | 7 …ap(unsigned int* destination, const unsigned int* indices, size_t index_count, size_t vertex_count) in meshopt_optimizeVertexFetchRemap() argument
11 memset(destination, -1, vertex_count * sizeof(unsigned int)); in meshopt_optimizeVertexFetchRemap()
18 assert(index < vertex_count); in meshopt_optimizeVertexFetchRemap()
26 assert(next_vertex <= vertex_count); in meshopt_optimizeVertexFetchRemap()
31 …signed int* indices, size_t index_count, const void* vertices, size_t vertex_count, size_t vertex_… in meshopt_optimizeVertexFetch() argument
41 unsigned char* vertices_copy = allocator.allocate<unsigned char>(vertex_count * vertex_size); in meshopt_optimizeVertexFetch()
42 memcpy(vertices_copy, vertices, vertex_count * vertex_size); in meshopt_optimizeVertexFetch()
47 unsigned int* vertex_remap = allocator.allocate<unsigned int>(vertex_count); in meshopt_optimizeVertexFetch()
48 memset(vertex_remap, -1, vertex_count * sizeof(unsigned int)); in meshopt_optimizeVertexFetch()
55 assert(index < vertex_count); in meshopt_optimizeVertexFetch()
[all …]
|
| H A D | spatialorder.cpp | 31 for (size_t i = 0; i < vertex_count; ++i) in computeOrder()
53 for (size_t i = 0; i < vertex_count; ++i) in computeOrder()
121 unsigned int* keys = allocator.allocate<unsigned int>(vertex_count); in meshopt_spatialSortRemap()
125 computeHistogram(hist, keys, vertex_count); in meshopt_spatialSortRemap()
129 for (size_t i = 0; i < vertex_count; ++i) in meshopt_spatialSortRemap()
133 radixPass(scratch, destination, keys, vertex_count, hist, 0); in meshopt_spatialSortRemap()
134 radixPass(destination, scratch, keys, vertex_count, hist, 1); in meshopt_spatialSortRemap()
135 radixPass(scratch, destination, keys, vertex_count, hist, 2); in meshopt_spatialSortRemap()
138 for (size_t i = 0; i < vertex_count; ++i) in meshopt_spatialSortRemap()
150 (void)vertex_count; in meshopt_spatialSortTriangles()
[all …]
|
| H A D | vcacheoptimizer.cpp | 36 adjacency.counts = allocator.allocate<unsigned int>(vertex_count); in buildTriangleAdjacency()
37 adjacency.offsets = allocator.allocate<unsigned int>(vertex_count); in buildTriangleAdjacency()
41 memset(adjacency.counts, 0, vertex_count * sizeof(unsigned int)); in buildTriangleAdjacency()
45 assert(indices[i] < vertex_count); in buildTriangleAdjacency()
53 for (size_t i = 0; i < vertex_count; ++i) in buildTriangleAdjacency()
72 for (size_t i = 0; i < vertex_count; ++i) in buildTriangleAdjacency()
92 while (input_cursor < vertex_count) in getNextVertexDeadEnd()
168 if (index_count == 0 || vertex_count == 0) in meshopt_optimizeVertexCache()
197 float* vertex_scores = allocator.allocate<float>(vertex_count); in meshopt_optimizeVertexCache()
199 for (size_t i = 0; i < vertex_count; ++i) in meshopt_optimizeVertexCache()
[all …]
|
| H A D | simplifier.cpp | 47 assert(indices[i] < vertex_count); in buildEdgeAdjacency()
55 for (size_t i = 0; i < vertex_count; ++i) in buildEdgeAdjacency()
74 for (size_t i = 0; i < vertex_count; ++i) in buildEdgeAdjacency()
163 for (size_t i = 0; i < vertex_count; ++i) in buildPositionRemap()
176 for (size_t i = 0; i < vertex_count; ++i) in buildPositionRemap()
179 for (size_t i = 0; i < vertex_count; ++i) in buildPositionRemap()
272 for (size_t i = 0; i < vertex_count; ++i) in classifyVertices()
282 for (size_t i = 0; i < vertex_count; ++i) in classifyVertices()
378 for (size_t i = 0; i < vertex_count; ++i) in rescalePositions()
403 for (size_t i = 0; i < vertex_count; ++i) in rescalePositions()
[all …]
|
| /dports/graphics/qgis/qgis-3.22.3/external/meshOptimizer/ |
| H A D | meshoptimizer.h | 159 MESHOPTIMIZER_API size_t meshopt_encodeIndexBufferBound( size_t index_count, size_t vertex_count );
180 MESHOPTIMIZER_API size_t meshopt_encodeVertexBufferBound( size_t vertex_count, size_t vertex_size );
303 unsigned char vertex_count; member
681 …meshopt_generateShadowIndexBufferMulti( out.data, in.data, index_count, vertex_count, streams, str…
690 meshopt_optimizeVertexCache( out.data, in.data, index_count, vertex_count );
699 meshopt_optimizeVertexCacheFifo( out.data, in.data, index_count, vertex_count, cache_size );
716 return meshopt_optimizeVertexFetchRemap( destination, in.data, index_count, vertex_count );
768 …return meshopt_stripify( out.data, in.data, index_count, vertex_count, unsigned( restart_index ) );
785 …return meshopt_analyzeVertexCache( in.data, index_count, vertex_count, cache_size, warp_size, buff…
801 return meshopt_analyzeVertexFetch( in.data, index_count, vertex_count, vertex_size );
[all …]
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/external/meshOptimizer/ |
| H A D | meshoptimizer.h | 159 MESHOPTIMIZER_API size_t meshopt_encodeIndexBufferBound( size_t index_count, size_t vertex_count );
180 MESHOPTIMIZER_API size_t meshopt_encodeVertexBufferBound( size_t vertex_count, size_t vertex_size );
303 unsigned char vertex_count; member
681 …meshopt_generateShadowIndexBufferMulti( out.data, in.data, index_count, vertex_count, streams, str…
690 meshopt_optimizeVertexCache( out.data, in.data, index_count, vertex_count );
699 meshopt_optimizeVertexCacheFifo( out.data, in.data, index_count, vertex_count, cache_size );
716 return meshopt_optimizeVertexFetchRemap( destination, in.data, index_count, vertex_count );
768 …return meshopt_stripify( out.data, in.data, index_count, vertex_count, unsigned( restart_index ) );
785 …return meshopt_analyzeVertexCache( in.data, index_count, vertex_count, cache_size, warp_size, buff…
801 return meshopt_analyzeVertexFetch( in.data, index_count, vertex_count, vertex_size );
[all …]
|
| /dports/net/frr7-pythontools/frr-frr-7.5.1/tests/isisd/ |
| H A D | test_isis_vertex_queue.c | 8 static size_t vertex_count; variable
24 vertices[vertex_count]->d_N = 20; in setup_test_vertices()
25 vertex_count++; in setup_test_vertices()
31 vertices[vertex_count]->d_N = 20; in setup_test_vertices()
32 vertex_count++; in setup_test_vertices()
38 vertices[vertex_count]->d_N = 15; in setup_test_vertices()
39 vertex_count++; in setup_test_vertices()
45 vertices[vertex_count]->d_N = 15; in setup_test_vertices()
46 vertex_count++; in setup_test_vertices()
53 vertex_count++; in setup_test_vertices()
[all …]
|
| /dports/net/frr7/frr-frr-7.5.1/tests/isisd/ |
| H A D | test_isis_vertex_queue.c | 8 static size_t vertex_count; variable
24 vertices[vertex_count]->d_N = 20; in setup_test_vertices()
25 vertex_count++; in setup_test_vertices()
31 vertices[vertex_count]->d_N = 20; in setup_test_vertices()
32 vertex_count++; in setup_test_vertices()
38 vertices[vertex_count]->d_N = 15; in setup_test_vertices()
39 vertex_count++; in setup_test_vertices()
45 vertices[vertex_count]->d_N = 15; in setup_test_vertices()
46 vertex_count++; in setup_test_vertices()
53 vertex_count++; in setup_test_vertices()
[all …]
|
| /dports/emulators/mess/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/demo/ |
| H A D | tests.cpp | 60 const size_t vertex_count = 10; in decodeIndex16() local
75 const size_t vertex_count = 10; in encodeIndexMemorySafe() local
96 const size_t vertex_count = 10; in decodeIndexMemorySafe() local
119 const size_t vertex_count = 10; in decodeIndexRejectExtraBytes() local
135 const size_t vertex_count = 10; in decodeIndexRejectMalformedHeaders() local
150 const size_t vertex_count = sizeof(kVertexBuffer) / sizeof(kVertexBuffer[0]); in decodeVertexV0() local
154 PV decoded[vertex_count]; in decodeVertexV0()
161 const size_t vertex_count = sizeof(kVertexBuffer) / sizeof(kVertexBuffer[0]); in encodeVertexMemorySafe() local
187 PV decoded[vertex_count]; in decodeVertexMemorySafe()
213 PV decoded[vertex_count]; in decodeVertexRejectExtraBytes()
[all …]
|
| /dports/emulators/mame/mame-mame0226/3rdparty/bgfx/3rdparty/meshoptimizer/demo/ |
| H A D | tests.cpp | 60 const size_t vertex_count = 10; in decodeIndex16() local
75 const size_t vertex_count = 10; in encodeIndexMemorySafe() local
96 const size_t vertex_count = 10; in decodeIndexMemorySafe() local
119 const size_t vertex_count = 10; in decodeIndexRejectExtraBytes() local
135 const size_t vertex_count = 10; in decodeIndexRejectMalformedHeaders() local
150 const size_t vertex_count = sizeof(kVertexBuffer) / sizeof(kVertexBuffer[0]); in decodeVertexV0() local
154 PV decoded[vertex_count]; in decodeVertexV0()
161 const size_t vertex_count = sizeof(kVertexBuffer) / sizeof(kVertexBuffer[0]); in encodeVertexMemorySafe() local
187 PV decoded[vertex_count]; in decodeVertexMemorySafe()
213 PV decoded[vertex_count]; in decodeVertexRejectExtraBytes()
[all …]
|
| /dports/graphics/gource/gource-0.51/src/core/ |
| H A D | vbo.cpp | 33 vertex_count = 0; in quadbuf()
65 vertex_count = 0; in reset()
69 return vertex_count; in vertices()
94 int i = vertex_count; in add()
96 vertex_count += 4; in add()
99 resize(vertex_count*2); in add()
114 int i = vertex_count; in add()
116 vertex_count += 4; in add()
119 resize(vertex_count*2); in add()
133 if(vertex_count==0) return; in update()
[all …]
|
| /dports/sysutils/logstalgia/Logstalgia-logstalgia-1.1.2/src/core/ |
| H A D | vbo.cpp | 33 vertex_count = 0; in quadbuf()
65 vertex_count = 0; in reset()
69 return vertex_count; in vertices()
94 int i = vertex_count; in add()
96 vertex_count += 4; in add()
99 resize(vertex_count*2); in add()
114 int i = vertex_count; in add()
116 vertex_count += 4; in add()
119 resize(vertex_count*2); in add()
133 if(vertex_count==0) return; in update()
[all …]
|
| /dports/graphics/gource/gource-0.51/src/ |
| H A D | bloom.cpp | 25 vertex_count = 0; in bloombuf()
53 vertex_count = 0; in reset()
63 return vertex_count; in vertices()
77 int i = vertex_count; in add()
79 vertex_count += 4; in add()
81 if(vertex_count > data_size) { in add()
82 resize(vertex_count*2); in add()
92 if(vertex_count==0) return; in update()
102 if(buffer_size < vertex_count) { in update()
113 if(vertex_count==0 || bufferid==0) return; in draw()
[all …]
|
| /dports/games/searchandrescue/searchandrescue_1.4.0/sar/ |
| H A D | v3dfio.c | 491 vertex_count = 0; \ in V3DLoadModel()
1314 vertex_count++; in V3DLoadModel()
1336 vertex_count++; in V3DLoadModel()
1376 vertex_count++; in V3DLoadModel()
1416 vertex_count++; in V3DLoadModel()
1439 vertex_count++; in V3DLoadModel()
1479 vertex_count++; in V3DLoadModel()
1519 vertex_count++; in V3DLoadModel()
1542 vertex_count++; in V3DLoadModel()
1582 vertex_count++; in V3DLoadModel()
[all …]
|
| /dports/math/fcl/fcl-0.7.0/include/fcl/geometry/shape/ |
| H A D | convex-inl.h | 124 for (int j = 1; j <= vertex_count; ++j) { in computeMomentofInertia()
133 for (int j = 0; j < vertex_count; ++j) { in computeMomentofInertia()
147 face_index += vertex_count + 1; in computeMomentofInertia()
176 for (int j = 1; j <= vertex_count; ++j) { in computeCOM()
184 for (int j = 1; j <= vertex_count; ++j) { in computeCOM()
194 face_index += vertex_count + 1; in computeCOM()
218 for (int j = 1; j <= vertex_count; ++j) { in computeVolume()
231 for (int j = 1; j <= vertex_count; ++j) { in computeVolume()
240 face_index += vertex_count + 1; in computeVolume()
372 face_index += vertex_count + 1; in ValidateTopology()
[all …]
|
| /dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/src/core/ |
| H A D | polygon.c | 24 p->vertex_count = count; in Polygon_Resize()
36 p->vertex_count = 0; in Polygon_Clear()
46 if(p->vertex_count < 3) in Polygon_IsBroken()
58 curr_v = p->vertices + p->vertex_count - 1; in Polygon_IsBroken()
59 for(uint16_t i = 0; i < p->vertex_count; i++) in Polygon_IsBroken()
80 if(dst->vertex_count != src->vertex_count) in Polygon_Copy()
82 Polygon_Resize(dst, src->vertex_count); in Polygon_Copy()
93 for(uint16_t i = 0; i < src->vertex_count; i++) in Polygon_Copy()
231 buf_size = (p1->vertex_count + p2->vertex_count) * 3 * sizeof(float); in Polygon_IntersectPolygon()
238 prev_v = p1->vertices + p1->vertex_count - 1; in Polygon_IntersectPolygon()
[all …]
|