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

/external/llvm/lib/CodeGen/AsmPrinter/
H A DOcamlGCPrinter.cpp48 const std::string &MId = M.getModuleIdentifier(); local
53 SymName.append(MId.begin(), std::find(MId.begin(), MId.end(), '.'));
/external/llvm/include/llvm/CodeGen/PBQP/
H A DReductionRules.h40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); local
44 RawVector YCosts = G.getNodeCosts(MId);
68 G.setNodeCosts(MId, YCosts);
69 G.disconnectEdge(EId, MId);
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp189 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); variable
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,
188 haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, const DisjointAllowedRegsCache &D) const argument
203 setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, DisjointAllowedRegsCache &D) argument
362 createInterferenceEdge(PBQPRAGraph &G, PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, IMatrixCache &C) argument
[all...]

Completed in 78 milliseconds