Home
last modified time | relevance | path

Searched refs:MId (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp221 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs() argument
224 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs(); in haveDisjointAllowedRegs()
236 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs() argument
239 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs(); in setDisjointAllowedRegs()
363 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply() local
367 if (haveDisjointAllowedRegs(G, NId, MId, D)) in apply()
371 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId)); in apply()
376 if (!createInterferenceEdge(G, NId, MId, C)) in apply()
377 setDisjointAllowedRegs(G, NId, MId, D); in apply()
394 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h41 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1() local
45 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
69 G.setNodeCosts(MId, YCosts); in applyR1()
70 G.disconnectEdge(EId, MId); in applyR1()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DOcamlGCPrinter.cpp52 const std::string &MId = M.getModuleIdentifier(); in EmitCamlGlobal() local
57 SymName.append(MId.begin(), llvm::find(MId, '.')); in EmitCamlGlobal()
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DSelectionDAGNodes.h981 int MId = M->getNodeId();
983 (MId > 0) && (MId < NId)) {