| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 56 UnsafeCols(new bool[M.getCols() - 1]()) { in MatrixMetadata()
57 unsigned* ColCounts = new unsigned[M.getCols() - 1](); in MatrixMetadata()
61 for (unsigned j = 1; j < M.getCols(); ++j) { in MatrixMetadata()
72 *std::max_element(ColCounts, ColCounts + M.getCols() - 1); in MatrixMetadata()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 47 UnsafeCols(new bool[M.getCols() - 1]()) { in MatrixMetadata()
49 unsigned* ColCounts = new unsigned[M.getCols() - 1](); in MatrixMetadata()
53 for (unsigned j = 1; j < M.getCols(); ++j) { in MatrixMetadata()
64 *std::max_element(ColCounts, ColCounts + M.getCols() - 1); in MatrixMetadata()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 132 (n2.getCosts().getLength() == ne.getCosts().getCols()) && in addConstructedEdge()
179 getNodeCosts(n2Itr).getLength() == costs.getCols() && in addEdge()
|
| D | HeuristicSolver.h | 514 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) { in tryNormaliseEdgeMatrix()
529 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) { in tryNormaliseEdgeMatrix()
|
| D | Math.h | 149 unsigned getCols() const { return cols; } in getCols() function
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 511 assert(CostMat.getCols() == Allowed2.size() + 1 && "Size mismatch."); in addVirtRegCoalesce()
903 assert(M.getCols() != 0 && "No cols in matrix."); in dump()
905 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 486 assert(CostMat.getCols() == Allowed2.size() + 1 && "Size mismatch."); in addVirtRegCoalesce()
854 assert(M.getCols() != 0 && "No cols in matrix."); in dump()
856 OS << PrintNodeInfo(N2Id, *this) << ' ' << M.getCols() << " cols:\n"; in dump()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 412 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
438 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
|
| D | Math.h | 168 unsigned getCols() const { in getCols() function
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 418 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
444 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
|
| D | Math.h | 231 unsigned getCols() const { in getCols() function
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 322 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Matrix width mismatch."); in addInterferenceCosts()
433 assert(costMat.getCols() == vr2Allowed.size() + 1 && "Size mismatch."); in addVirtRegCoalesce()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| D | Briggs.h | 317 numReverseRegs = eCosts.getCols() - 1; in computeEdgeContributions()
|
| /external/swiftshader/src/OpenGL/compiler/ |
| D | Types.h | 650 int getCols() const in getCols() function
|
| /external/kotlinc/lib/ |
| D | kotlin-daemon-client.jar | META-INF/
META-INF/MANIFEST.MF
org/
org/jetbrains/
org/ ... |
| /external/guice/lib/build/jdiff/ |
| D | xerces.jar | META-INF/
META-INF/MANIFEST.MF
javax/
javax/xml/
javax/ ... |
| /external/cldr/tools/java/libs/ |
| D | xercesImpl.jar | META-INF/
META-INF/MANIFEST.MF
META-INF/services/
org/
... |