diff options
author | Reid Spencer <rspencer@reidspencer.com> | 2006-12-31 06:02:00 +0000 |
---|---|---|
committer | Reid Spencer <rspencer@reidspencer.com> | 2006-12-31 06:02:00 +0000 |
commit | eacb7020ec7b0a6a0078f1be7bfd77bf6fe1ff06 (patch) | |
tree | ac1b0bfa8c340bb02ac25f991a1ee28b216de458 /test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll | |
parent | 47857812e29324a9d1560796a05b53d3a9217fd9 (diff) |
For PR950:
Update the test suite to accommodate the change from signed integer types
to signless integer types. The changes were of only a few kinds:
1. Make sure llvm-upgrade is run on the source which does the bulk of the
changes automatically.
2. Change things like "grep 'int'" to "grep 'i32'"
3. In several tests bitcasting caused the same name to be reused in the
same type plane. These had to be manually fixed. The fix was (generally)
to leave the bitcast and provide the instruction with a new name. This
should not affect the semantics of the test. In a few cases, the
bitcasts were known to be superfluous and irrelevant to the test case
so they were removed.
4. One test case uses a bytecode file which needed to be updated to the
latest bytecode format.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@32789 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll')
-rw-r--r-- | test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll b/test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll index ba897c401f..d8316a52bc 100644 --- a/test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll +++ b/test/Transforms/LoopStrengthReduce/share_code_in_preheader.ll @@ -1,17 +1,17 @@ ; RUN: llvm-upgrade < %s | llvm-as | opt -loop-reduce | llvm-dis | grep mul | wc -l | grep 1 ; LSR should not make two copies of the Q*L expression in the preheader! -sbyte %test(sbyte* %A, sbyte* %B, int %L, int %Q, int %N) { +sbyte %test(sbyte* %A, sbyte* %B, int %L, int %Q, int %N.s) { entry: %tmp.6 = mul int %Q, %L ; <int> [#uses=1] - %N = cast int %N to uint ; <uint> [#uses=1] + %N = cast int %N.s to uint ; <uint> [#uses=1] br label %no_exit no_exit: ; preds = %no_exit, %no_exit.preheader - %indvar = phi uint [ 0, %entry], [ %indvar.next, %no_exit ] ; <uint> [#uses=2] + %indvar.ui = phi uint [ 0, %entry], [ %indvar.next, %no_exit ] ; <uint> [#uses=2] %Sum.0.0 = phi sbyte [ 0, %entry], [ %tmp.21, %no_exit ] ; <sbyte> [#uses=1] - %indvar = cast uint %indvar to int ; <int> [#uses=1] - %N_addr.0.0 = sub int %N, %indvar ; <int> [#uses=1] + %indvar = cast uint %indvar.ui to int ; <int> [#uses=1] + %N_addr.0.0 = sub int %N.s, %indvar ; <int> [#uses=1] %tmp.8 = add int %N_addr.0.0, %tmp.6 ; <int> [#uses=2] %tmp.9 = getelementptr sbyte* %A, int %tmp.8 ; <sbyte*> [#uses=1] %tmp.10 = load sbyte* %tmp.9 ; <sbyte> [#uses=1] @@ -19,7 +19,7 @@ no_exit: ; preds = %no_exit, %no_exit.preheader %tmp.18 = load sbyte* %tmp.17 ; <sbyte> [#uses=1] %tmp.19 = sub sbyte %tmp.10, %tmp.18 ; <sbyte> [#uses=1] %tmp.21 = add sbyte %tmp.19, %Sum.0.0 ; <sbyte> [#uses=2] - %indvar.next = add uint %indvar, 1 ; <uint> [#uses=2] + %indvar.next = add uint %indvar.ui, 1 ; <uint> [#uses=2] %exitcond = seteq uint %indvar.next, %N ; <bool> [#uses=1] br bool %exitcond, label %loopexit, label %no_exit |