[llvm] ac423a8 - Attempt to fix linking issue on the bot

[Vitaly Buka via llvm-commits]

Author: Vitaly Buka
Date: 2022-03-08T15:33:10-08:00
New Revision: ac423a8c8aa87a128e51f3690afc1405d06b8c9d

URL: https://github.com/llvm/llvm-project/commit/ac423a8c8aa87a128e51f3690afc1405d06b8c9d
DIFF: https://github.com/llvm/llvm-project/commit/ac423a8c8aa87a128e51f3690afc1405d06b8c9d.diff

LOG: Attempt to fix linking issue on the bot

Added: 
    

Modified: 
    llvm/lib/Transforms/Utils/SampleProfileInference.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Transforms/Utils/SampleProfileInference.cpp b/llvm/lib/Transforms/Utils/SampleProfileInference.cpp
index 6f56f1c432c2e..2d003e2e01a83 100644
--- a/llvm/lib/Transforms/Utils/SampleProfileInference.cpp
+++ b/llvm/lib/Transforms/Utils/SampleProfileInference.cpp
@@ -173,7 +173,7 @@ class MinCostMaxFlow {
   /// A cost of taking an unlikely jump.
   static constexpr int64_t AuxCostUnlikely = ((int64_t)1) << 30;
   /// Minimum BaseDistance for the jump distance values in island joining.
-  static constexpr uint64_t MinBaseDistance = 10000;
+  static constexpr uint64_t MinBaseDistance = 10000ull;
 
 private:
   /// Iteratively find an augmentation path/dag in the network and send the
@@ -741,7 +741,7 @@ class FlowAdjuster {
   /// parts to a multiple of 1 / BaseDistance.
   int64_t jumpDistance(FlowJump *Jump) const {
     uint64_t BaseDistance =
-        std::max(static_cast<uint64_t>(MinCostMaxFlow::MinBaseDistance),
+        std::max(MinCostMaxFlow::MinBaseDistance,
                  std::min(Func.Blocks[Func.Entry].Flow,
                           MinCostMaxFlow::AuxCostUnlikely / NumBlocks()));
     if (Jump->IsUnlikely)