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

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
OcamlGCPrinter.cpp 52 const std::string &MId = M.getModuleIdentifier();
57 SymName.append(MId.begin(), llvm::find(MId, '.'));
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 41 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
45 RawVector YCosts = G.getNodeCosts(MId);
69 G.setNodeCosts(MId, YCosts);
70 G.disconnectEdge(EId, MId);
205 NodeId mId = G.getEdgeNode2Id(EId);
206 v += edgeCosts.getColAsVector(s.getSelection(mId));
208 NodeId mId = G.getEdgeNode1Id(EId);
209 v += edgeCosts.getRowAsVector(s.getSelection(mId));
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegAllocPBQP.cpp 224 PBQPRAGraph::NodeId MId,
227 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs();
239 PBQPRAGraph::NodeId MId,
242 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs();
366 PBQP::GraphBase::NodeId MId = getNodeId(A);
370 if (haveDisjointAllowedRegs(G, NId, MId, D))
374 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId));
379 if (!createInterferenceEdge(G, NId, MId, C))
380 setDisjointAllowedRegs(G, NId, MId, D)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
SelectionDAGNodes.h 852 int MId = M->getNodeId();
854 (MId > 0) && (MId < NId)) {

Completed in 34 milliseconds