refactor handling of symbolic constant folding, picking up

a few new cases( see Integer/a1.ll), but not anything that
would happen in practice.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@49965 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2008-04-19 21:58:19 +00:00
parent 61783d7322
commit 1c14c29746
2 changed files with 66 additions and 66 deletions

View File

@@ -10,10 +10,10 @@
@j = constant i1 undef ; <i1*> [#uses=0]
@m = constant i1 undef ; <i1*> [#uses=0]
@n = constant i1 true ; <i1*> [#uses=0]
@o = constant i1 sdiv (i1 true, i1 true) ; <i1*> [#uses=0]
@p = constant i1 sdiv (i1 true, i1 true) ; <i1*> [#uses=0]
@o = constant i1 true ; <i1*> [#uses=0]
@p = constant i1 true ; <i1*> [#uses=0]
@q = constant i1 true ; <i1*> [#uses=0]
@r = constant i1 true ; <i1*> [#uses=0]
@s = constant i1 srem (i1 true, i1 true) ; <i1*> [#uses=0]
@s = constant i1 false ; <i1*> [#uses=0]
@t = constant i1 false ; <i1*> [#uses=0]
@u = constant i1 srem (i1 true, i1 true) ; <i1*> [#uses=0]
@u = constant i1 false ; <i1*> [#uses=0]