Skip to content
  1. Mar 30, 2011
    • Jakob Stoklund Olesen's avatar
      Prevent infinite growth of SmallMap instances. · f587f441
      Jakob Stoklund Olesen authored
      Rehash but don't grow when full of tombstones.
      
      Patch by José Fonseca!
      
      llvm-svn: 128565
      f587f441
    • Benjamin Kramer's avatar
      Avoid turning a floating point division with a constant power of two into a... · af0ed953
      Benjamin Kramer authored
      Avoid turning a floating point division with a constant power of two into a denormal multiplication.
      
      Some platforms may treat denormals as zero, on other platforms multiplication
      with a subnormal is slower than dividing by a normal.
      
      llvm-svn: 128555
      af0ed953
    • Benjamin Kramer's avatar
      Add APFloat::getExactInverse. · 03fd6726
      Benjamin Kramer authored
      The idea is, that if an ieee 754 float is divided by a power of two, we can
      turn the division into a cheaper multiplication. This function sees if we can
      get an exact multiplicative inverse for a divisor and returns it if possible.
      
      This is the hard part of PR9587.
      
      I tested many inputs against llvm-gcc's frotend implementation of this
      optimization and didn't find any difference. However, floating point is the
      land of weird edge cases, so any review would be appreciated.
      
      llvm-svn: 128545
      03fd6726
  2. Mar 27, 2011
  3. Mar 24, 2011
  4. Mar 22, 2011
  5. Mar 21, 2011
  6. Mar 20, 2011
  7. Mar 19, 2011
  8. Mar 18, 2011
  9. Mar 17, 2011
  10. Mar 16, 2011
  11. Mar 15, 2011
  12. Mar 10, 2011
  13. Mar 08, 2011
  14. Mar 07, 2011
  15. Mar 04, 2011
  16. Feb 27, 2011
  17. Feb 21, 2011
    • Cameron Zwarich's avatar
      The signed version of our "magic number" computation for the integer approximation · 8731d0cc
      Cameron Zwarich authored
      of a constant had a minor typo introduced when copying it from the book, which
      caused it to favor negative approximations over positive approximations in many
      cases. Positive approximations require fewer operations beyond the multiplication.
      
      In the case of division by 3, we still generate code that is a single instruction
      larger than GCC's code.
      
      llvm-svn: 126097
      8731d0cc
  18. Feb 19, 2011
  19. Feb 18, 2011
  20. Feb 17, 2011
Loading