From: Jessica Paquette Date: Tue, 24 Jul 2018 17:36:13 +0000 (+0000) Subject: [MachineOutliner][NFC] Sink some candidate logic into OutlinedFunction X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=f381561a76c5bdff7e16110621048a307720bbbb;p=llvm [MachineOutliner][NFC] Sink some candidate logic into OutlinedFunction Just some simple gardening to improve clarity. Before, we had something along the lines of 1) Create a std::vector of Candidates 2) Create an OutlinedFunction 3) Create a std::vector of pointers to Candidates 4) Copy those over to the OutlinedFunction and the Candidate list Now, OutlinedFunctions create the Candidate pointers. They're still copied over to the main list of Candidates, but it makes it a bit clearer what's going on. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@337838 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/include/llvm/CodeGen/MachineOutliner.h b/include/llvm/CodeGen/MachineOutliner.h index 7847c9f017c..73913586719 100644 --- a/include/llvm/CodeGen/MachineOutliner.h +++ b/include/llvm/CodeGen/MachineOutliner.h @@ -209,10 +209,19 @@ public: : NotOutlinedCost - OutlinedCost; } - OutlinedFunction(unsigned Name, unsigned OccurrenceCount, + OutlinedFunction(unsigned Name, std::vector &Cands, const std::vector &Sequence, TargetCostInfo &TCI) - : OccurrenceCount(OccurrenceCount), Name(Name), Sequence(Sequence), - TCI(TCI) {} + : Name(Name), Sequence(Sequence), TCI(TCI) { + OccurrenceCount = Cands.size(); + for (Candidate &C : Cands) + Candidates.push_back(std::make_shared(C)); + + unsigned B = getBenefit(); + for (std::shared_ptr &C : Candidates) { + C->Benefit = B; + C->TCI = TCI; + } + } }; } // namespace outliner } // namespace llvm diff --git a/lib/CodeGen/MachineOutliner.cpp b/lib/CodeGen/MachineOutliner.cpp index 5a365f2a657..c576738cf7a 100644 --- a/lib/CodeGen/MachineOutliner.cpp +++ b/lib/CodeGen/MachineOutliner.cpp @@ -916,12 +916,11 @@ unsigned MachineOutliner::findCandidates( std::vector Seq; for (unsigned i = Leaf->SuffixIdx; i < Leaf->SuffixIdx + StringLen; i++) Seq.push_back(ST.Str[i]); - OutlinedFunction OF(FunctionList.size(), CandidatesForRepeatedSeq.size(), + OutlinedFunction OF(FunctionList.size(), CandidatesForRepeatedSeq, Seq, TCI); - unsigned Benefit = OF.getBenefit(); // Is it better to outline this candidate than not? - if (Benefit < 1) { + if (OF.getBenefit() < 1) { // Outlining this candidate would take more instructions than not // outlining. // Emit a remark explaining why we didn't outline this candidate. @@ -958,19 +957,11 @@ unsigned MachineOutliner::findCandidates( if (StringLen > MaxLen) MaxLen = StringLen; - // At this point, the candidate class is seen as beneficial. Set their - // benefit values and save them in the candidate list. - std::vector> CandidatesForFn; - for (Candidate &C : CandidatesForRepeatedSeq) { - C.Benefit = Benefit; - C.TCI = TCI; - std::shared_ptr Cptr = std::make_shared(C); - CandidateList.push_back(Cptr); - CandidatesForFn.push_back(Cptr); - } - + // The function is beneficial. Save its candidates to the candidate list + // for pruning. + for (std::shared_ptr &C : OF.Candidates) + CandidateList.push_back(C); FunctionList.push_back(OF); - FunctionList.back().Candidates = CandidatesForFn; // Move to the next function. Parent.IsInTree = false;