Home
last modified time | relevance | path

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

/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp189 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs() argument
192 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs(); in haveDisjointAllowedRegs()
204 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs() argument
207 const auto *MRegs = &G.getNodeMetadata(MId).getAllowedRegs(); in setDisjointAllowedRegs()
331 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply() local
335 if (haveDisjointAllowedRegs(G, NId, MId, D)) in apply()
339 IEdgeKey EK(std::min(NId, MId), std::max(NId, MId)); in apply()
344 if (!createInterferenceEdge(G, NId, MId, C)) in apply()
345 setDisjointAllowedRegs(G, NId, MId, D); in apply()
363 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge() argument
[all …]
/external/llvm/lib/CodeGen/AsmPrinter/
DOcamlGCPrinter.cpp48 const std::string &MId = M.getModuleIdentifier(); in EmitCamlGlobal() local
53 SymName.append(MId.begin(), std::find(MId.begin(), MId.end(), '.')); in EmitCamlGlobal()
/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1() local
44 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
68 G.setNodeCosts(MId, YCosts); in applyR1()
69 G.disconnectEdge(EId, MId); in applyR1()