RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-17 13:30:41 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

blockfreq: Rename PackagedLoops => Loops

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@206859 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Duncan P. N. Exon Smith 2014-04-22 03:31:50 +00:00
parent 40a483e980
commit dda2f883dd
2 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
include/llvm/Analysis/BlockFrequencyInfoImpl.h
View File

@ -1051,7 +1051,7 @@ public:
std::vector<WorkingData> Working; std::vector<WorkingData> Working;
/// \brief Indexed information about loops. /// \brief Indexed information about loops.
std::vector<std::unique_ptr<LoopData>> PackagedLoops; std::vector<std::unique_ptr<LoopData>> Loops;
/// \brief Add all edges out of a packaged loop to the distribution. /// \brief Add all edges out of a packaged loop to the distribution.
/// ///
@ -1079,7 +1079,7 @@ public:
/// \brief Distribute mass according to a distribution. /// \brief Distribute mass according to a distribution.
/// ///
/// Distributes the mass in Source according to Dist. If LoopHead.isValid(), /// Distributes the mass in Source according to Dist. If LoopHead.isValid(),
/// backedges and exits are stored in its entry in PackagedLoops. /// backedges and exits are stored in its entry in Loops.
/// ///
/// Mass is distributed in parallel from two copies of the source mass. /// Mass is distributed in parallel from two copies of the source mass.
/// ///
@ -1438,8 +1438,8 @@ template <class BT> void BlockFrequencyInfoImpl<BT>::initializeLoops() {
BlockNode Header = getNode(Loop->getHeader()); BlockNode Header = getNode(Loop->getHeader());
assert(Header.isValid()); assert(Header.isValid());
PackagedLoops.emplace_back(new LoopData(Header)); Loops.emplace_back(new LoopData(Header));
Working[Header.Index].Loop = PackagedLoops.back().get(); Working[Header.Index].Loop = Loops.back().get();
DEBUG(dbgs() << " - loop = " << getBlockName(Header) << "\n"); DEBUG(dbgs() << " - loop = " << getBlockName(Header) << "\n");
} }
@ -1470,7 +1470,7 @@ template <class BT> void BlockFrequencyInfoImpl<BT>::initializeLoops() {
template <class BT> void BlockFrequencyInfoImpl<BT>::computeMassInLoops() { template <class BT> void BlockFrequencyInfoImpl<BT>::computeMassInLoops() {
// Visit loops with the deepest first, and the top-level loops last. // Visit loops with the deepest first, and the top-level loops last.
for (const auto &L : make_range(PackagedLoops.rbegin(), PackagedLoops.rend())) for (const auto &L : make_range(Loops.rbegin(), Loops.rend()))
computeMassInLoop(L->Header); computeMassInLoop(L->Header);
} }

2
lib/Analysis/BlockFrequencyInfoImpl.cpp
View File

@ -602,7 +602,7 @@ void BlockFrequencyInfoImplBase::clear() {
// does not actually clear heap storage. // does not actually clear heap storage.
std::vector<FrequencyData>().swap(Freqs); std::vector<FrequencyData>().swap(Freqs);
std::vector<WorkingData>().swap(Working); std::vector<WorkingData>().swap(Working);
std::vector<std::unique_ptr<LoopData>>().swap(PackagedLoops); std::vector<std::unique_ptr<LoopData>>().swap(Loops);
} }
/// \brief Clear all memory not needed downstream. /// \brief Clear all memory not needed downstream.