mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
76c2b22ee4
arbitrary iteration. The patch: 1) changes SCEVSDivExpr into SCEVUDivExpr, 2) replaces PartialFact() function with BinomialCoefficient(); the computations (essentially, the division) in BinomialCoefficient() are performed with the apprioprate bitwidth necessary to avoid overflow; unsigned division is used instead of the signed one. Computations in BinomialCoefficient() require support from the code generator for APInts. Currently, we use a hack rounding up the neccessary bitwidth to the nearest power of 2. The hack is easy to turn off in future. One remaining issue: we assume the divisor of the binomial coefficient formula can be computed accurately using 16 bits. It means we can handle AddRecs of length up to 9. In future, we should use APInts to evaluate the divisor. Thanks to Nicholas for cooperation! llvm-svn: 46955 |
||
|---|---|---|
| .. | ||
| 2007-07-15-NegativeStride.ll | ||
| 2007-08-06-MisinterpretBranch.ll | ||
| 2007-08-06-Unsigned.ll | ||
| 2007-09-27-LargeStepping.ll | ||
| 2007-11-14-SignedAddRec.ll | ||
| 2007-11-18-OrInstruction.ll | ||
| dg.exp | ||
| do-loop.ll | ||
| smax.ll | ||
| SolveQuadraticEquation.ll | ||
| trip-count2.ll | ||
| trip-count.ll | ||