HomeSort by relevance Sort by last modified time
    Searched refs:NId (Results 1 - 25 of 29) sorted by null

1 2

  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
148 VRegToNodeId[VReg] = NId;
299 void handleAddNode(NodeId NId) {
300 assert(G.getNodeCosts(NId).getLength() > 1 &&
302 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
305 void handleRemoveNode(NodeId NId) {}
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
314 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
127 if (NId == NIds[0])
130 assert(NId == NIds[1] && "Edge does not connect NId.");
140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
141 if (NId == NIds[0])
144 assert(NId == NIds[1] && "Edge not connected to NId");
157 void disconnectFrom(Graph &G, NodeId NId) {
158 if (NId == NIds[0]
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
36 assert(G.getNodeDegree(NId) == 1 &&
39 EdgeId EId = *G.adjEdgeIds(NId).begin();
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
43 const Vector &XCosts = G.getNodeCosts(NId);
47 if (NId == G.getEdgeNode1Id(EId)) {
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
80 assert(G.getNodeDegree(NId) == 2 &&
83 const Vector &XCosts = G.getNodeCosts(NId);
85 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 125 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
126 if (NId == NIds[0])
129 assert(NId == NIds[1] && "Edge not connected to NId");
142 void disconnectFrom(Graph &G, NodeId NId) {
143 if (NId == NIds[0])
146 assert(NId == NIds[1] && "Edge does not connect NId");
178 NodeEntry &getNode(NodeId NId) {
179 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
  /external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 155 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
156 VRegToNodeId[VReg] = NId;
359 void handleAddNode(NodeId NId) {
360 assert(G.getNodeCosts(NId).getLength() > 1 &&
362 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
364 void handleRemoveNode(NodeId NId) {}
365 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
377 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
378 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]

Completed in 949 milliseconds

1 2