BranchProbability.cpp 2.0 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273
  1. //===-------------- lib/Support/BranchProbability.cpp -----------*- C++ -*-===//
  2. //
  3. // The LLVM Compiler Infrastructure
  4. //
  5. // This file is distributed under the University of Illinois Open Source
  6. // License. See LICENSE.TXT for details.
  7. //
  8. //===----------------------------------------------------------------------===//
  9. //
  10. // This file implements Branch Probability class.
  11. //
  12. //===----------------------------------------------------------------------===//
  13. #include "llvm/Support/BranchProbability.h"
  14. #include "llvm/Support/Debug.h"
  15. #include "llvm/Support/Format.h"
  16. #include "llvm/Support/raw_ostream.h"
  17. using namespace llvm;
  18. raw_ostream &BranchProbability::print(raw_ostream &OS) const {
  19. return OS << N << " / " << D << " = "
  20. << format("%g%%", ((double)N / D) * 100.0);
  21. }
  22. void BranchProbability::dump() const { print(dbgs()) << '\n'; }
  23. static uint64_t scale(uint64_t Num, uint32_t N, uint32_t D) {
  24. assert(D && "divide by 0");
  25. // Fast path for multiplying by 1.0.
  26. if (!Num || D == N)
  27. return Num;
  28. // Split Num into upper and lower parts to multiply, then recombine.
  29. uint64_t ProductHigh = (Num >> 32) * N;
  30. uint64_t ProductLow = (Num & UINT32_MAX) * N;
  31. // Split into 32-bit digits.
  32. uint32_t Upper32 = ProductHigh >> 32;
  33. uint32_t Lower32 = ProductLow & UINT32_MAX;
  34. uint32_t Mid32Partial = ProductHigh & UINT32_MAX;
  35. uint32_t Mid32 = Mid32Partial + (ProductLow >> 32);
  36. // Carry.
  37. Upper32 += Mid32 < Mid32Partial;
  38. // Check for overflow.
  39. if (Upper32 >= D)
  40. return UINT64_MAX;
  41. uint64_t Rem = (uint64_t(Upper32) << 32) | Mid32;
  42. uint64_t UpperQ = Rem / D;
  43. // Check for overflow.
  44. if (UpperQ > UINT32_MAX)
  45. return UINT64_MAX;
  46. Rem = ((Rem % D) << 32) | Lower32;
  47. uint64_t LowerQ = Rem / D;
  48. uint64_t Q = (UpperQ << 32) + LowerQ;
  49. // Check for overflow.
  50. return Q < LowerQ ? UINT64_MAX : Q;
  51. }
  52. uint64_t BranchProbability::scale(uint64_t Num) const {
  53. return ::scale(Num, N, D);
  54. }
  55. uint64_t BranchProbability::scaleByInverse(uint64_t Num) const {
  56. return ::scale(Num, D, N);
  57. }