Searched refs:numEdges (Results 1 – 9 of 9) sorted by relevance
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 107 unsigned numEdges; variable
125 ++numEdges; in addConstructedEdge()
143 Graph() : numNodes(0), numEdges(0) {} in Graph()
148 Graph(const Graph &other) : numNodes(0), numEdges(0) { in Graph()
190 unsigned getNumEdges() const { return numEdges; } in getNumEdges()
343 --numEdges; in removeEdge()
350 numNodes = numEdges = 0; in clear()
|
| /external/skia/bench/ |
| D | TopoSortBench.cpp | 36 int numEdges = fRand.nextU() % (kMaxEdges+1); in onDelayedSetup() local
38 for (int j = 0; j < numEdges; ++j) { in onDelayedSetup()
|
| /external/skqp/bench/ |
| D | TopoSortBench.cpp | 36 int numEdges = fRand.nextU() % (kMaxEdges+1); in onDelayedSetup() local
38 for (int j = 0; j < numEdges; ++j) { in onDelayedSetup()
|
| /external/skqp/src/utils/ |
| D | SkPolyUtils.cpp | 1158 unsigned int numEdges = 0; in SkOffsetSimplePolygon() local
1180 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()
1183 numEdges++; in SkOffsetSimplePolygon()
1193 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()
1199 if (numEdges > (unsigned int)std::numeric_limits<int32_t>::max()) { in SkOffsetSimplePolygon()
1204 SkSTArray<64, OffsetEdge> edgeData(numEdges); in SkOffsetSimplePolygon()
1265 SkASSERT(edgeData.count() == (int)numEdges); in SkOffsetSimplePolygon()
1268 unsigned int offsetVertexCount = numEdges; in SkOffsetSimplePolygon()
1270 unsigned long long maxIterations = (unsigned long long)(numEdges) * numEdges; in SkOffsetSimplePolygon()
|
| /external/skia/src/utils/ |
| D | SkPolyUtils.cpp | 1180 unsigned int numEdges = 0; in SkOffsetSimplePolygon() local
1202 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()
1205 numEdges++; in SkOffsetSimplePolygon()
1215 numEdges += SkTMax(numSteps, 1); in SkOffsetSimplePolygon()
1221 if (numEdges > (unsigned int)std::numeric_limits<int32_t>::max()) { in SkOffsetSimplePolygon()
1226 SkSTArray<64, OffsetEdge> edgeData(numEdges); in SkOffsetSimplePolygon()
1287 SkASSERT(edgeData.count() == (int)numEdges); in SkOffsetSimplePolygon()
1290 unsigned int offsetVertexCount = numEdges; in SkOffsetSimplePolygon()
1292 unsigned long long maxIterations = (unsigned long long)(numEdges) * numEdges; in SkOffsetSimplePolygon()
|
| /external/antlr/tool/src/main/java/org/antlr/tool/ |
| D | Grammar.java | 1290 int numEdges = edges.size(); in makeEdgeSetsDisjoint() local
1291 for (int e = 0; e < numEdges; e++) { in makeEdgeSetsDisjoint()
|
| /external/deqp/external/vulkancts/modules/vulkan/tessellation/ |
| D | vktTessellationInvarianceTests.cpp | 1670 const int numEdges = m_caseDef.primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? 3 in genTessLevelCases() local
1683 for (int edgeNdx = 0; edgeNdx < numEdges; ++edgeNdx) in genTessLevelCases()
|
| /external/tensorflow/tensorflow/stream_executor/cuda/ |
| D | cuda_10_0.inc | 1381 …ult CUDAAPI cuGraphGetEdges(CUgraph hGraph, CUgraphNode *from, CUgraphNode *to, size_t *numEdges) {
1385 return func_ptr(hGraph, from, to, numEdges);
|
| /external/deqp/modules/gles31/functional/ |
| D | es31fTessellationTests.cpp | 4821 const int numEdges = m_primitiveType == TESSPRIMITIVETYPE_TRIANGLES ? 3 in genTessLevelCases() local
4835 for (int edgeNdx = 0; edgeNdx < numEdges; edgeNdx++) in genTessLevelCases()
|