Lines Matching defs:Chain
107 class Chain;
132 bool colorChainSet(std::vector<Chain*> GV, MachineBasicBlock &MBB,
134 bool colorChain(Chain *G, Color C, MachineBasicBlock &MBB);
135 int scavengeRegister(Chain *G, Color C, MachineBasicBlock &MBB);
137 std::map<unsigned, Chain*> &Active,
138 std::set<std::unique_ptr<Chain>> &AllChains);
140 std::map<unsigned, Chain*> &RegChains);
142 Chain *getAndEraseNext(Color PreferredColor, std::vector<Chain*> &L);
146 /// A Chain is a sequence of instructions that are linked together by
171 class Chain {
189 Chain(MachineInstr *MI, unsigned Idx, Color C)
203 "Chain: broken invariant. A Chain can only be killed after its last "
224 "Chain: broken invariant. A Chain can only be killed after its last "
251 bool rangeOverlapsWith(const Chain &Other) const {
260 bool startsBefore(Chain *Other) {
320 std::map<unsigned, Chain*> ActiveChains;
321 std::set<std::unique_ptr<Chain>> AllChains;
335 EquivalenceClasses<Chain*> EC;
349 std::vector<std::vector<Chain*> > V;
351 std::vector<Chain*> Cs(EC.member_begin(I), EC.member_end());
359 [](const std::vector<Chain*> &A,
360 const std::vector<Chain*> &B) {
383 Chain *AArch64A57FPLoadBalancing::getAndEraseNext(Color PreferredColor,
384 std::vector<Chain*> &L) {
401 Chain *Ch = *--I;
407 Chain *Ch = *I;
414 Chain *Ch = L.front();
419 bool AArch64A57FPLoadBalancing::colorChainSet(std::vector<Chain*> GV,
432 std::sort(GV.begin(), GV.end(), [](const Chain *G1, const Chain *G2) {
439 while (Chain *G = getAndEraseNext(PreferredColor, GV)) {
467 int AArch64A57FPLoadBalancing::scavengeRegister(Chain *G, Color C,
502 bool AArch64A57FPLoadBalancing::colorChain(Chain *G, Color C,
577 std::map<unsigned, Chain*> &ActiveChains,
578 std::set<std::unique_ptr<Chain>> &AllChains) {
595 auto G = llvm::make_unique<Chain>(MI, Idx, getColor(DestReg));
612 DEBUG(dbgs() << "Chain found for accumulator register "
639 auto G = llvm::make_unique<Chain>(MI, Idx, getColor(DestReg));
657 std::map<unsigned, Chain*> &ActiveChains) {