diff --git a/bolt/BinaryFunction.cpp b/bolt/BinaryFunction.cpp
index a61c65b8c425..5ac5f9692a01 100644
--- a/bolt/BinaryFunction.cpp
+++ b/bolt/BinaryFunction.cpp
@@ -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;
diff --git a/bolt/BinaryFunction.h b/bolt/BinaryFunction.h
index d56c1ff17880..f6cb9a882b10 100644
--- a/bolt/BinaryFunction.h
+++ b/bolt/BinaryFunction.h
@@ -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.