Home
last modified time | relevance | path

Searched refs:getNodeCosts (Results 1 – 25 of 71) sorted by relevance

123

/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/
H A DHeuristicSolver.h245 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR1()
250 Vector &yCosts = g.getNodeCosts(ynItr); in applyR1()
263 Vector &yCosts = g.getNodeCosts(ynItr); in applyR1()
291 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR2()
444 if (g.getNodeCosts(nItr).getLength() == 1) { in disconnectTrivialNodes()
456 g.getNodeCosts(otherNodeItr) += in disconnectTrivialNodes()
461 g.getNodeCosts(otherNodeItr) += in disconnectTrivialNodes()
508 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eItr)), in tryNormaliseEdgeMatrix()
509 &vCosts = g.getNodeCosts(g.getEdgeNode2(eItr)); in tryNormaliseEdgeMatrix()
561 Vector v(g.getNodeCosts(nItr)); in computeSolution()
H A DGraph.h179 assert(getNodeCosts(n1Itr).getLength() == costs.getRows() && in addEdge()
180 getNodeCosts(n2Itr).getLength() == costs.getCols() && in addEdge()
196 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } in getNodeCosts() function
201 const Vector& getNodeCosts(ConstNodeItr nItr) const { in getNodeCosts() function
365 << nodeItr << ": " << getNodeCosts(nodeItr) << "\" ]\n"; in printDot()
418 nodeMap[nItr] = addNode(other.getNodeCosts(nItr)); in copyFrom()
/dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/Heuristics/
H A DBriggs.h66 PBQPNum cost1 = g->getNodeCosts(n1Itr)[0] / s->getSolverDegree(n1Itr), in operator()
67 cost2 = g->getNodeCosts(n2Itr)[0] / s->getSolverDegree(n2Itr); in operator()
359 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in addEdgeContributions()
386 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in subtractEdgeContributions()
405 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in updateAllocability()
415 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in initializeNode()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
H A DGraph.h410 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
411 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
436 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
437 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
488 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
H A DGraph.h410 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
411 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
436 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
437 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
488 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
H A DGraph.h410 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
411 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
436 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
437 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
488 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/dports/devel/llvm10/llvm-10.0.1.src/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
H A DGraph.h410 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
411 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
436 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
437 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
488 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
H A DGraph.h410 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
411 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
436 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
437 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
488 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/llvm11/llvm-11.0.1.src/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/llvm90/llvm-9.0.1.src/include/llvm/CodeGen/PBQP/
H A DReductionRules.h44 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
84 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
191 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/llvm80/llvm-8.0.1.src/include/llvm/CodeGen/PBQP/
H A DReductionRules.h45 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
46 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
85 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
192 RawVector v = G.getNodeCosts(NId); in backpropagate()
/dports/devel/llvm70/llvm-7.0.1.src/include/llvm/CodeGen/PBQP/
H A DReductionRules.h45 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
46 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
85 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
192 RawVector v = G.getNodeCosts(NId); in backpropagate()

123