Searched refs:MId (Results 1 – 4 of 4) sorted by relevance
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 224 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs() argument
227 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs(); in haveDisjointAllowedRegs()
239 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs() argument
242 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs(); in setDisjointAllowedRegs()
366 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply() local
370 if (haveDisjointAllowedRegs(G, NId, MId, D)) in apply()
374 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId)); in apply()
379 if (!createInterferenceEdge(G, NId, MId, C)) in apply()
380 setDisjointAllowedRegs(G, NId, MId, D); in apply()
397 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge() argument
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 41 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 D | OcamlGCPrinter.cpp | 52 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 D | SelectionDAGNodes.h | 909 int MId = M->getNodeId();
911 (MId > 0) && (MId < NId)) {
|