Changes in directory llvm/lib/Target:
README.txt updated: 1.17 -> 1.18 --- Log message: remove two implemented items --- Diffs of the changes: (+0 -22) README.txt | 22 ---------------------- 1 files changed, 22 deletions(-) Index: llvm/lib/Target/README.txt diff -u llvm/lib/Target/README.txt:1.17 llvm/lib/Target/README.txt:1.18 --- llvm/lib/Target/README.txt:1.17 Sat Mar 11 14:20:40 2006 +++ llvm/lib/Target/README.txt Mon Mar 13 00:52:22 2006 @@ -56,20 +56,6 @@ //===---------------------------------------------------------------------===// -DAG combine this into mul A, 8: - -int %test(int %A) { - %B = mul int %A, 8 ;; shift - %C = add int %B, 7 ;; dead, no demanded bits. - %D = and int %C, -8 ;; dead once add is gone. - ret int %D -} - -This sort of thing occurs in the alloca lowering code and other places that -are generating alignment of an already aligned value. - -//===---------------------------------------------------------------------===// - Turn this into a signed shift right in instcombine: int f(unsigned x) { @@ -81,14 +67,6 @@ //===---------------------------------------------------------------------===// -We should reassociate: -int f(int a, int b){ return a * a + 2 * a * b + b * b; } -into: -int f(int a, int b) { return a * (a + 2 * b) + b * b; } -to eliminate a multiply. - -//===---------------------------------------------------------------------===// - On targets with expensive 64-bit multiply, we could LSR this: for (i = ...; ++i) { _______________________________________________ llvm-commits mailing list llvm-commits@cs.uiuc.edu http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits