HomeSort by: relevance | last modified time | path
    Searched refs:NId (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
Graph.h 123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
124 if (NId == NIds[0])
127 assert(NId == NIds[1] && "Edge not connected to NId");
140 void disconnectFrom(Graph &G, NodeId NId) {
141 if (NId == NIds[0])
144 assert(NId == NIds[1] && "Edge does not connect NId");
180 NodeEntry &getNode(NodeId NId) {
181 assert(NId < Nodes.size() && "Out of bound NodeId")
    [all...]
ReductionRules.h 30 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
37 assert(G.getNodeDegree(NId) == 1 &&
40 EdgeId EId = *G.adjEdgeIds(NId).begin();
41 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 const Vector &XCosts = G.getNodeCosts(NId);
48 if (NId == G.getEdgeNode1Id(EId)) {
74 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
81 assert(G.getNodeDegree(NId) == 2 &&
84 const Vector &XCosts = G.getNodeCosts(NId);
86 typename GraphT::AdjEdgeItr AEItr = G.adjEdgeIds(NId).begin()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) {
149 VRegToNodeId[VReg.id()] = NId;
300 void handleAddNode(NodeId NId) {
301 assert(G.getNodeCosts(NId).getLength() > 1 &&
303 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId));
306 void handleRemoveNode(NodeId NId) {}
307 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
314 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
315 NodeMetadata& NMd = G.getNodeMetadata(NId);
    [all...]
SelectionDAGNodes.h 844 int NId = N->getNodeId();
845 // If we Invalidated the Id, reconstruct original NId.
846 if (NId < -1)
847 NId = -(NId + 1);
853 if (TopologicalPrune && M->getOpcode() != ISD::TokenFactor && (NId > 0) &&
854 (MId > 0) && (MId < NId)) {
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegAllocPBQP.cpp 199 for (auto NId : G.nodeIds()) {
201 LIS.getInterval(G.getNodeMetadata(NId).getVReg()).weight();
206 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId));
208 G.setNodeCosts(NId, std::move(NodeCosts));
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId,
226 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs();
238 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId,
241 const auto *NRegs = &G.getNodeMetadata(NId).getAllowedRegs();
332 for (auto NId : G.nodeIds()) {
333 Register VReg = G.getNodeMetadata(NId).getVReg()
    [all...]

Completed in 27 milliseconds