[PATCH] D13994: [SimplifyLibCalls] Optimization for pow(x, n) where n is some constant

[Joerg Sonnenberger via llvm-commits]

joerg added a comment.

Instead of a hard-coded limit of 32, would about building a table of multiplication chains with at most 8 multiplications or something like that? Precomputing them is easy and the number of intermediate registers should also be low enough to be. Might be worth checking much temporaries are generated and tweak the limit a bit.


Repository:
  rL LLVM

http://reviews.llvm.org/D13994