caio/clang-p2996
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix comments. NFC.

Browse Source 
Summary: Updated comments in BinaryFunction class.

(cherry picked from FBD28108888)
This commit is contained in:
Rafael Auler
2015-10-16 17:15:00 -07:00
committed by Maksim Panchenko
parent 9a8d357d0b
commit ec22caff1e
2 changed files with 6 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
bolt/BinaryFunction.cpp
View File

@@ -547,9 +547,9 @@ void BinaryFunction::optimizeLayout(bool DumpLayout) {
dbgs() << "running block layout heuristics on " << getName() << "\n";
}
// Greedy heuristic implementation for the "TSP problem", applied to BB
// layout. Try to maximize weight during a path traversing all BBs. In this
// way, we will convert the hottest branches into fall-throughs.
// Greedy heuristic implementation for the TSP, applied to BB layout. Try to
// maximize weight during a path traversing all BBs. In this way, we will
// convert the hottest branches into fall-throughs.
// Encode an edge between two basic blocks, source and destination
typedef std::pair<BinaryBasicBlock *, BinaryBasicBlock *> EdgeTy;

7
bolt/BinaryFunction.h
View File

@@ -193,10 +193,9 @@ public:
/// adjustments to instructions at the end of basic blocks.
void optimizeLayout(bool DumpLayout);
/// Dynamic programming implementation for the "TSP problem", applied to BB
/// layout. Find the optimal way to maximize weight during a path traversing
/// all BBs. In this way, we will convert the hottest branches into
/// fall-throughs.
/// Dynamic programming implementation for the TSP, applied to BB layout. Find
/// the optimal way to maximize weight during a path traversing all BBs. In
/// this way, we will convert the hottest branches into fall-throughs.
///
/// Uses exponential amount of memory on the number of basic blocks and should
/// only be used for small functions.