HomeSort by relevance Sort by last modified time
    Searched refs:NodeEntry (Results 1 - 3 of 3) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 64 class NodeEntry {
74 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {}
108 ThisEdgeAdjIdxs[0] = NodeEntry::getInvalidAdjEdgeIdx();
109 ThisEdgeAdjIdxs[1] = NodeEntry::getInvalidAdjEdgeIdx();
115 NodeEntry::getInvalidAdjEdgeIdx();
120 assert(ThisEdgeAdjIdxs[NIdx] == NodeEntry::getInvalidAdjEdgeIdx() &&
122 NodeEntry &N = G.getNode(NIds[NIdx]);
140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
150 assert(ThisEdgeAdjIdxs[NIdx] != NodeEntry::getInvalidAdjEdgeIdx() &&
152 NodeEntry &N = G.getNode(NIds[NIdx])
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h 31 class NodeEntry;
34 typedef std::list<NodeEntry> NodeList;
55 class NodeEntry {
62 NodeEntry(const Vector &costs) : costs(costs), degree(0) {}
111 NodeEntry& getNode(NodeItr nItr) { return *nItr; }
112 const NodeEntry& getNode(ConstNodeItr nItr) const { return *nItr; }
117 NodeItr addConstructedNode(const NodeEntry &n) {
128 NodeEntry &n1 = getNode(ne.getNode1());
129 NodeEntry &n2 = getNode(ne.getNode2());
169 return addConstructedNode(NodeEntry(costs))
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
Graph.h 63 class NodeEntry {
69 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {}
108 ThisEdgeAdjIdxs[0] = NodeEntry::getInvalidAdjEdgeIdx();
109 ThisEdgeAdjIdxs[1] = NodeEntry::getInvalidAdjEdgeIdx();
113 assert(ThisEdgeAdjIdxs[NIdx] == NodeEntry::getInvalidAdjEdgeIdx() &&
115 NodeEntry &N = G.getNode(NIds[NIdx]);
124 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
134 assert(ThisEdgeAdjIdxs[NIdx] != NodeEntry::getInvalidAdjEdgeIdx() &&
136 NodeEntry &N = G.getNode(NIds[NIdx]);
138 ThisEdgeAdjIdxs[NIdx] = NodeEntry::getInvalidAdjEdgeIdx()
    [all...]

Completed in 2373 milliseconds