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

  /external/llvm/lib/CodeGen/AsmPrinter/
OcamlGCPrinter.cpp 48 const std::string &MId = M.getModuleIdentifier();
53 SymName.append(MId.begin(), std::find(MId.begin(), MId.end(), '.'));
  /external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
44 RawVector YCosts = G.getNodeCosts(MId);
68 G.setNodeCosts(MId, YCosts);
69 G.disconnectEdge(EId, MId);
204 NodeId mId = G.getEdgeNode2Id(EId);
205 v += edgeCosts.getColAsVector(s.getSelection(mId));
207 NodeId mId = G.getEdgeNode1Id(EId);
208 v += edgeCosts.getRowAsVector(s.getSelection(mId));
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 189 PBQPRAGraph::NodeId MId,
192 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs();
204 PBQPRAGraph::NodeId MId,
207 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs();
331 PBQP::GraphBase::NodeId MId = getNodeId(A);
335 if (haveDisjointAllowedRegs(G, NId, MId, D))
339 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId));
344 if (!createInterferenceEdge(G, NId, MId, C))
345 setDisjointAllowedRegs(G, NId, MId, D)
    [all...]

Completed in 64 milliseconds