Home
last modified time | relevance | path

Searched refs:PBQPRAGraph (Results 1 – 5 of 5) sorted by relevance

/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp174 bool mapPBQPToRegAlloc(const PBQPRAGraph &G,
192 void apply(PBQPRAGraph &G) override { in apply()
223 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
238 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
239 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs()
304 void apply(PBQPRAGraph &G) override { in apply()
396 bool createInterferenceEdge(PBQPRAGraph &G, in createInterferenceEdge()
397 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
437 void apply(PBQPRAGraph &G) override { in apply()
503 PBQPRAGraph::RawMatrix &CostMat, in addVirtRegCoalesce()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DPBQPRAConstraint.h28 class PBQPRAGraph; variable
33 using PBQPRAGraph = PBQP::RegAlloc::PBQPRAGraph; variable
40 virtual void apply(PBQPRAGraph &G) = 0;
52 void apply(PBQPRAGraph &G) override { in apply()
H A DRegAllocPBQP.h503 class PBQPRAGraph : public PBQP::Graph<RegAllocSolverImpl> {
508 PBQPRAGraph(GraphMetadata Metadata) : BaseT(std::move(Metadata)) {} in PBQPRAGraph() function
522 inline Solution solve(PBQPRAGraph& G) { in solve()
/llvm-project-15.0.7/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp173 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint()
174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint()
176 const PBQPRAGraph::NodeMetadata::AllowedRegVector *vRdAllowed = in addIntraChainConstraint()
178 const PBQPRAGraph::NodeMetadata::AllowedRegVector *vRaAllowed = in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
190 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint()
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint()
260 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint()
270 const PBQPRAGraph::NodeMetadata::AllowedRegVector *vRdAllowed = in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
[all …]
H A DAArch64PBQPRegAlloc.h23 void apply(PBQPRAGraph &G) override;
32 bool addIntraChainConstraint(PBQPRAGraph &G, unsigned Rd, unsigned Ra);
35 void addInterChainConstraint(PBQPRAGraph &G, unsigned Rd, unsigned Ra);