RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-30 07:22:55 +01:00
Code Issues Projects Releases Wiki Activity
18,403 Commits 4 Branches 5 Tags 704 MiB
675a0b9769
Commit Graph

1864 Commits

Author SHA1 Message Date
Jeff Cohen
fd9504c7d9 PHI nodes were incorrectly placed when more than one GEP is reduced in a loop. 
llvm-svn: 20360
 2005-02-27 21:08:04 +00:00
Jeff Cohen
6258d4a431 First pass at improved Loop Strength Reduction. Still not yet ready for prime time. 
llvm-svn: 20358
 2005-02-27 19:37:07 +00:00
Chris Lattner
73d4556bb6 Teach globalopt how memset/cpy/move affect memory, to allow better optimization. 
llvm-svn: 20352
 2005-02-27 18:58:52 +00:00
Chris Lattner
a024984017 Fix spelling, patch contributed by Gabor Greif! 
llvm-svn: 20343
 2005-02-27 06:18:25 +00:00
Chris Lattner
14f720d625 remove extraneous cast 
llvm-svn: 20334
 2005-02-26 18:33:28 +00:00
Chris Lattner
7a434679c3 Implement Transforms/SimplifyCFG/switch_thread.ll 
This does a simple form of "jump threading", which eliminates CFG edges that
are provably dead.  This triggers 90 times in the external tests, and
eliminating CFG edges is always always a good thing! :)

llvm-svn: 20300
 2005-02-24 06:17:52 +00:00
Chris Lattner
bfb6a94126 make this more efficient. Scan up to 16 nodes, not the whole list. 
llvm-svn: 20289
 2005-02-23 16:53:04 +00:00
Chris Lattner
b5256c157d Remove use of bind_obj 
llvm-svn: 20276
 2005-02-22 23:22:58 +00:00
Chris Lattner
29126b65c4 Do not mark obviously unreachable blocks live when processing PHI nodes, 
and handle incomplete control dependences correctly.  This fixes:

Regression/Transforms/ADCE/dead-phi-edge.ll
  -> a missed optimization

Regression/Transforms/ADCE/dead-phi-edge.ll
  -> a compiler crash distilled from QT4

llvm-svn: 20227
 2005-02-17 19:28:49 +00:00
Chris Lattner
0a61115d67 Fix the second bug attached to PR504. 
llvm-svn: 20181
 2005-02-14 20:11:45 +00:00
Chris Lattner
8f3f72f2bc Fix for testcase Transforms/IndVarsSimplify/2005-02-11-InvokeCrash.ll 
and PR504.

llvm-svn: 20129
 2005-02-12 03:26:49 +00:00
Alkis Evlogimenos
82f384712f Localize globals if they are only used in main(). This replaces the 
global with an alloca, which eventually gets promoted into a
register. This enables a lot of other optimizations later on.

llvm-svn: 20109
 2005-02-10 18:36:30 +00:00
Alkis Evlogimenos
3521fcb18f Fix crash on MallocInsts of unsized types. 
llvm-svn: 19988
 2005-02-02 04:43:37 +00:00
Chris Lattner
d04865822c API change. 
llvm-svn: 19959
 2005-02-01 01:23:49 +00:00
Chris Lattner
555ef32a44 Adjust to changes in APIs 
llvm-svn: 19958
 2005-02-01 01:23:31 +00:00
Chris Lattner
849a4118e6 Hacks to make this ugly ugly code work with the new use lists. 
llvm-svn: 19957
 2005-02-01 01:22:56 +00:00
Chris Lattner
c4884b553e Implement InstCombine/cast.ll:test25, a case that occurs many times 
in spec

llvm-svn: 19953
 2005-01-31 05:51:45 +00:00
Chris Lattner
6a431c25d1 Implement the trivial cases in InstCombine/store.ll 
llvm-svn: 19950
 2005-01-31 05:36:43 +00:00
Chris Lattner
a4ba8e9f0d Implement Transforms/InstCombine/cast-load-gep.ll, which allows us to devirtualize 
11 indirect calls in perlbmk.

llvm-svn: 19947
 2005-01-31 04:50:46 +00:00
Chris Lattner
c29f25e260 Adjust to changes in instruction interfaces. 
llvm-svn: 19900
 2005-01-29 00:39:08 +00:00
Chris Lattner
7dab604f10 Switchinst takes a hint for the number of cases it will have. 
llvm-svn: 19899
 2005-01-29 00:38:45 +00:00
Chris Lattner
ccc0c99fae switchinst ctor now takes a hint for the number of cases that it will have. 
llvm-svn: 19898
 2005-01-29 00:38:26 +00:00
Chris Lattner
d87666619f Adjust Valuehandle to hold its operand directly in it. 
llvm-svn: 19897
 2005-01-29 00:37:36 +00:00
Chris Lattner
b035ec4a9c * add some DEBUG statements 
* Properly compile this:

struct a {};
int test() {
  struct a b[2];
  if (&b[0] != &b[1])
    abort ();
  return 0;
}

to 'return 0', not abort().

llvm-svn: 19875
 2005-01-28 19:32:01 +00:00
Alkis Evlogimenos
eb6bfe9cee Add a dependency to the trace library so that it gets pulled in 
automatically.

llvm-svn: 19828
 2005-01-25 16:23:57 +00:00
Chris Lattner
ab2ab313d3 Get rid of a several dozen more and instructions in specint. 
llvm-svn: 19786
 2005-01-23 20:26:55 +00:00
Chris Lattner
151c8e6390 Handle comparisons of gep instructions that have different typed indices 
as long as they are the same size.

llvm-svn: 19734
 2005-01-21 23:06:49 +00:00
Chris Lattner
5a9660aa71 Add two optimizations. The first folds (X+Y)-X -> Y 
The second folds operations into selects, e.g. (select C, (X+Y), (Y+Z))
-> (Y+(select C, X, Z)

This occurs a few times across spec, e.g.

         select    add/sub
mesa:    83        0
povray:  5         2
gcc      4         2
parser   0         22
perlbmk  13        30
twolf    0         3

llvm-svn: 19706
 2005-01-19 21:50:18 +00:00
Chris Lattner
302ea8908d Fix 'raise' to work with packed types. Patch by Morten Ofstad. 
llvm-svn: 19693
 2005-01-19 16:16:35 +00:00
Chris Lattner
3402945d52 Delete PHI nodes that are not dead but are locked in a cycle of single 
useness.

llvm-svn: 19629
 2005-01-17 05:10:15 +00:00
Chris Lattner
de6b1ca556 Move code out of indentation one level to make it easier to read. 
Disable the xform for < > cases.  It turns out that the following is being
miscompiled:

bool %test(sbyte %S) {
        %T = cast sbyte %S to uint
        %V = setgt uint %T, 255
        ret bool %V
}

llvm-svn: 19628
 2005-01-17 03:20:02 +00:00
Chris Lattner
708ff662ba Fix some bugs in an xform added yesterday. This fixes Prolangs-C/allroots. 
llvm-svn: 19553
 2005-01-14 17:35:12 +00:00
Chris Lattner
13fd87be57 Fix a compile crash on spiff 
llvm-svn: 19552
 2005-01-14 17:17:59 +00:00
Chris Lattner
6b519e3314 if two gep comparisons only differ by one index, compare that index directly. 
This allows us to better optimize begin() -> end() comparisons in common cases.

llvm-svn: 19542
 2005-01-14 00:20:05 +00:00
Chris Lattner
283b7d9809 Do not overrun iterators. This fixes a 176.gcc crash 
llvm-svn: 19541
 2005-01-13 23:26:48 +00:00
Chris Lattner
b3dfd0aecd Turn select C, (X+Y), (X-Y) --> (X+(select C, Y, (-Y))). This occurs in 
the 'sim' program and probably elsewhere.  In sim, it comes up for cases
like this:

#define round(x) ((x)>0.0 ? (x)+0.5 : (x)-0.5)
double G;
void T(double X) { G = round(X); }

(it uses the round macro a lot).  This changes the LLVM code from:

        %tmp.1 = setgt double %X, 0.000000e+00          ; <bool> [#uses=1]
        %tmp.4 = add double %X, 5.000000e-01            ; <double> [#uses=1]
        %tmp.6 = sub double %X, 5.000000e-01            ; <double> [#uses=1]
        %mem_tmp.0 = select bool %tmp.1, double %tmp.4, double %tmp.6
        store double %mem_tmp.0, double* %G

to:

        %tmp.1 = setgt double %X, 0.000000e+00          ; <bool> [#uses=1]
        %mem_tmp.0.p = select bool %tmp.1, double 5.000000e-01, double -5.000000e-01
        %mem_tmp.0 = add double %mem_tmp.0.p, %X
        store double %mem_tmp.0, double* %G
        ret void

llvm-svn: 19537
 2005-01-13 22:52:24 +00:00
Chris Lattner
e59c6d1cbe Implement an optimization for == and != comparisons like this: 
_Bool test2(int X, int Y) {
  return &arr[X][Y] == arr;
}

instead of generating this:

bool %test2(int %X, int %Y) {
        %tmp.3.idx = mul int %X, 160            ; <int> [#uses=1]
        %tmp.3.idx1 = shl int %Y, ubyte 2               ; <int> [#uses=1]
        %tmp.3.offs2 = sub int 0, %tmp.3.idx            ; <int> [#uses=1]
        %tmp.7 = seteq int %tmp.3.idx1, %tmp.3.offs2            ; <bool> [#uses=1]
        ret bool %tmp.7
}


generate this:

bool %test2(int %X, int %Y) {
        seteq int %X, 0         ; <bool>:0 [#uses=1]
        seteq int %Y, 0         ; <bool>:1 [#uses=1]
        %tmp.7 = and bool %0, %1                ; <bool> [#uses=1]
        ret bool %tmp.7
}

This idiom occurs in C++ programs when iterating from begin() to end(),
in a vector or array.  For example, we now compile this:

void test(int X, int Y) {
  for (int *i = arr; i != arr+100; ++i)
    foo(*i);
}

to this:

no_exit:                ; preds = %entry, %no_exit
	...
        %exitcond = seteq uint %indvar.next, 100                ; <bool> [#uses=1]
        br bool %exitcond, label %return, label %no_exit



instead of this:

no_exit:                ; preds = %entry, %no_exit
	...
        %inc5 = getelementptr [100 x [40 x int]]* %arr, int 0, int 0, int %inc.rec              ; <int*> [#uses=1]
        %tmp.8 = seteq int* %inc5, getelementptr ([100 x [40 x int]]* %arr, int 0, int 100, int 0)              ; <bool> [#uses=1]
        %indvar.next = add uint %indvar, 1              ; <uint> [#uses=1]
        br bool %tmp.8, label %return, label %no_exit

llvm-svn: 19536
 2005-01-13 22:25:21 +00:00
Chris Lattner
ee469241c3 Fix some bugs in code I didn't mean to check in. 
llvm-svn: 19534
 2005-01-13 20:40:58 +00:00
Chris Lattner
aebad4db9a Fix a crash compiling 129.compress 
llvm-svn: 19533
 2005-01-13 20:14:25 +00:00
Reid Spencer
7e9642515c Add the LOADABLE_MODULE=1 directive to indicate that this shared library is 
intended to be a dlopenable module and not a "plain" shared library.

llvm-svn: 19456
 2005-01-11 04:33:32 +00:00
Jeff Cohen
8b03a55724 Apply feedback from Chris. 
llvm-svn: 19432
 2005-01-10 04:23:32 +00:00
Chris Lattner
c2821461e9 Fix VS warnings 
llvm-svn: 19383
 2005-01-08 19:48:40 +00:00
Chris Lattner
2e24bcf264 Fix VS warnings. 
llvm-svn: 19382
 2005-01-08 19:45:31 +00:00
Chris Lattner
131ada2668 Fix uint64_t -> unsigned VS warnings. 
llvm-svn: 19381
 2005-01-08 19:42:22 +00:00
Chris Lattner
ee218d4348 Silence VS warnings. 
llvm-svn: 19380
 2005-01-08 19:37:20 +00:00
Chris Lattner
d1e987d9ae Silence warnings 
llvm-svn: 19379
 2005-01-08 19:34:41 +00:00
Jeff Cohen
ce541ade79 Add more missing createXxxPass functions. 
llvm-svn: 19370
 2005-01-08 17:21:40 +00:00
Misha Brukman
22df7f894f Convert tabs to spaces 
llvm-svn: 19320
 2005-01-07 07:05:34 +00:00
Jeff Cohen
c07c54f5b4 Add missing createXxxPass functions 
llvm-svn: 19319
 2005-01-07 06:57:28 +00:00
Jeff Cohen
79dc6715bb Add missing include 
llvm-svn: 19315
 2005-01-07 05:42:13 +00:00
Jeff Cohen
67f737e5d1 Put createLoopUnswitchPass() into proper namespace 
llvm-svn: 19306
 2005-01-06 05:47:18 +00:00
Jeff Cohen
a8574e28a3 Add missing include 
llvm-svn: 19305
 2005-01-06 05:46:44 +00:00
Chris Lattner
14d51ed06a This is a bulk commit that implements the following primary improvements: 
* We can now fold cast instructions into select instructions that
    have at least one constant operand.
  * We now optimize expressions more aggressively based on bits that are
    known to be zero.  These optimizations occur a lot in code that uses
    bitfields even in simple ways.
  * We now turn more cast-cast sequences into AND instructions.  Before we
    would only do this if it if all types were unsigned.  Now only the
    middle type needs to be unsigned (guaranteeing a zero extend).
  * We transform sign extensions into zero extensions in several cases.

This corresponds to these test/Regression/Transforms/InstCombine testcases:
  2004-11-22-Missed-and-fold.ll
  and.ll: test28-29
  cast.ll: test21-24
  and-or-and.ll
  cast-cast-to-and.ll
  zeroext-and-reduce.ll

llvm-svn: 19220
 2005-01-01 16:22:27 +00:00
Chris Lattner
5fff877f74 Implement SimplifyCFG/DeadSetCC.ll 
SimplifyCFG is one of those passes that we use for final cleanup: it should
not rely on other passes to clean up its garbage.  This fixes the "why are
trivially dead setcc's in the output of gccas" problem.

llvm-svn: 19212
 2005-01-01 16:02:12 +00:00
Chris Lattner
b49dd5c526 Fix PR491 and testcase Transforms/DeadStoreElimination/2004-12-28-PartialStore.ll 
llvm-svn: 19180
 2004-12-29 04:36:02 +00:00
Chris Lattner
3a260f9757 Adjust to new interfaces 
llvm-svn: 18958
 2004-12-15 07:22:25 +00:00
Chris Lattner
763e852e7a Constant exprs are not efficiently negatable in practice. This disables 
turning X - (constantexpr) into X + (-constantexpr) among other things.

llvm-svn: 18935
 2004-12-14 20:08:06 +00:00
Brian Gaeke
ca2d45f5c1 Fix link error in PPC optimized build of 'opt'. 
llvm-svn: 18913
 2004-12-13 21:28:39 +00:00
Chris Lattner
318f80ae39 Get rid of getSizeOf, using ConstantExpr::getSizeOf instead. 
do not insert a prototype for malloc of: void* malloc(uint): on 64-bit u
targets this is not correct.  Instead of prototype it as void *malloc(...),
and pass the correct intptr_t through the "...".

Finally, fix Regression/CodeGen/SparcV9/2004-12-13-MallocCrash.ll, by not
forming constantexpr casts from pointer to uint.

llvm-svn: 18908
 2004-12-13 20:00:02 +00:00
Chris Lattner
bc889ab3c7 Change indentation of a whole bunch of code, no real changes here. 
llvm-svn: 18843
 2004-12-12 23:49:37 +00:00
Chris Lattner
85776b0e99 More substantial simplifications and speedups. This makes ADCE about 20% faster 
in some cases.

llvm-svn: 18842
 2004-12-12 23:40:17 +00:00
Chris Lattner
deda69d473 More minor microoptimizations 
llvm-svn: 18841
 2004-12-12 22:44:30 +00:00
Chris Lattner
1629a92f18 Remove some more set operations 
llvm-svn: 18840
 2004-12-12 22:22:18 +00:00
Chris Lattner
a47e7e4093 Reduce number of set operations. 
llvm-svn: 18839
 2004-12-12 22:16:13 +00:00
Chris Lattner
2be8c4a870 Optimize div/rem + select combinations more. 
In particular, implement div.ll:test10 and rem.ll:test4.

llvm-svn: 18838
 2004-12-12 21:48:58 +00:00
Chris Lattner
0a2feabdc9 Properly implement copying of a global, fixing the 255.vortex & povray 
failures from last night.

llvm-svn: 18832
 2004-12-12 19:34:41 +00:00
Chris Lattner
9e7ce53b82 Simplify code and do not invalidate iterators. 
This fixes a crash compiling TimberWolfMC that was exposed due to recent
optimizer changes.

llvm-svn: 18831
 2004-12-12 18:23:20 +00:00
Chris Lattner
97adae1fa4 Though the previous xform applies to literally dozens (hundreds?) of variables 
in SPEC, the subsequent optimziations that we are after don't play with
with FP values, so disable this xform for them.  Really we just don't want
stuff like:

double G;   (always 0 or 412312.312)
  = G;

turning into:

bool G_b;
  = G_b ? 412312.312 : 0;

We'd rather just do the load.

-Chris

llvm-svn: 18819
 2004-12-12 06:03:06 +00:00
Chris Lattner
f125dc0e49 If a variable can only hold two values, and is not already a bool, shrink it 
down to actually BE a bool.  This allows simple value range propagation
stuff work harder, deleting comparisons in bzip2 in some hot loops.

This implements GlobalOpt/integer-bool.ll, which is the essence of the
loop condition distilled into a testcase.

llvm-svn: 18817
 2004-12-12 05:53:50 +00:00
Chris Lattner
02c04bbf45 If one side of and/or is known to be 0/-1, it doesn't matter 
if the other side is overdefined.

This allows us to fold conditions like:  if (X < Y || Y > Z) in some cases.

llvm-svn: 18807
 2004-12-11 23:15:19 +00:00
Chris Lattner
59ce936426 Only cound if we actually made a change. 
llvm-svn: 18800
 2004-12-11 17:00:14 +00:00
Chris Lattner
8378361f0c The split bb is really the exit of the old function 
llvm-svn: 18799
 2004-12-11 16:59:54 +00:00
Chris Lattner
06bfa390f6 Two bug fixes: 
1. Actually increment the Statistic for the GV elim optzn
 2. When resolving undef branches, only resolve branches in executable blocks,
    avoiding marking a bunch of completely dead blocks live.  This has a big
    impact on the quality of the generated code.

With this patch, we positively rip up vortex, compiling Ut_MoveBytes to a
single memcpy call. In vortex we get this:

     12 ipsccp           - Number of globals found to be constant
    986 ipsccp           - Number of arguments constant propagated
   1378 ipsccp           - Number of basic blocks unreachable
   8919 ipsccp           - Number of instructions removed

llvm-svn: 18796
 2004-12-11 06:05:53 +00:00
Chris Lattner
5af0ef5c44 Do not delete the entry block to a function. 
llvm-svn: 18795
 2004-12-11 05:32:19 +00:00
Chris Lattner
943f94d2b3 Implement Transforms/SCCP/ipsccp-gvar.ll, by tracking values stored to 
non-address-taken global variables.

llvm-svn: 18790
 2004-12-11 05:15:59 +00:00
Chris Lattner
beeab3a124 Fix a bug where we could delete dead invoke instructions with uses. 
In functions where we fully constant prop the return value, replace all
ret instructions with 'ret undef'.

llvm-svn: 18786
 2004-12-11 02:53:57 +00:00
Chris Lattner
d1d00e017b Implement SCCP/ipsccp-conditional.ll, by totally deleting dead blocks. 
llvm-svn: 18781
 2004-12-10 22:29:08 +00:00
Chris Lattner
5be2c2e299 Fix SCCP/2004-12-10-UndefBranchBug.ll 
llvm-svn: 18776
 2004-12-10 20:41:50 +00:00
Chris Lattner
40e97884f6 Fix Regression/Transforms/SimplifyCFG/2004-12-10-SimplifyCFGCrash.ll, 
and the failure on make_dparser last night.

llvm-svn: 18766
 2004-12-10 17:42:31 +00:00
Chris Lattner
ead42a768e This is the initial implementation of IPSCCP, as requested by Brian. 
This implements SCCP/ipsccp-basic.ll, rips apart Olden/mst (as described in
PR415), and does other nice things.

There is still more to come with this, but it's a start.

llvm-svn: 18752
 2004-12-10 08:02:06 +00:00
Chris Lattner
f5962a7d6c note to self: Do not check in debugging code! 
llvm-svn: 18693
 2004-12-09 07:15:52 +00:00
Chris Lattner
1e2b3fd343 Implement trivial sinking for load instructions. This causes us to sink 567 loads in spec 
llvm-svn: 18692
 2004-12-09 07:14:34 +00:00
Chris Lattner
8529319568 Do extremely simple sinking of instructions when they are only used in a 
successor block.  This turns cases like this:

x = a op b
if (c) {
  use x
}

into:

if (c) {
  x = a op b
  use x
}

This triggers 3965 times in spec, and is tested by
Regression/Transforms/InstCombine/sink_instruction.ll

This appears to expose a bug in the X86 backend for 177.mesa, which I'm
looking in to.

llvm-svn: 18677
 2004-12-08 23:43:58 +00:00
Alkis Evlogimenos
fe549f46e1 Fix this regression and remove the XFAIL from this test. 
llvm-svn: 18674
 2004-12-08 23:10:30 +00:00
Chris Lattner
62e3f533f3 Fix Transforms/InstCombine/2004-12-08-RemInfiniteLoop.ll 
llvm-svn: 18670
 2004-12-08 22:20:34 +00:00
Chris Lattner
8ecbc96420 Add support for compilers without argument dependent name lookup, contributed 
by Bjørn Wennberg

llvm-svn: 18627
 2004-12-08 16:12:20 +00:00
Chris Lattner
2f52add966 Remove unneeded class qualifier, contributed by Bjørn Wennberg 
llvm-svn: 18625
 2004-12-08 16:05:02 +00:00
Reid Spencer
f929fb661d For PR387:\ 
Add doInitialization method to avoid overloaded virtuals

llvm-svn: 18602
 2004-12-07 08:11:36 +00:00
Chris Lattner
a5a08f5484 Implement stripping of debug symbols, making the --strip-debug options in 
gccas/gccld more than just a noop.

llvm-svn: 18456
 2004-12-03 16:22:08 +00:00
Chris Lattner
45529acebd Initial reimplementation of the -strip pass, with a stub for implementing 
-S

llvm-svn: 18440
 2004-12-02 21:25:03 +00:00
Chris Lattner
d742c10964 This pass is moving to lib IPO 
llvm-svn: 18439
 2004-12-02 21:24:40 +00:00
Chris Lattner
afb31cf723 Implement a FIXME by checking to make sure that a malloc is not being used 
in scary and unknown ways before we promote it.  This fixes the miscompilation
of 188.ammp that has been plauging us since a globalopt patch went in.

Thanks a ton to Tanya for helping me diagnose the problem!

llvm-svn: 18418
 2004-12-02 07:11:07 +00:00
Chris Lattner
fd541d4228 Fix a minor bug where we set a var to initialized on malloc, not on store. 
This doesn't fix anything that I'm aware of, just noticed it by inspection

llvm-svn: 18417
 2004-12-02 06:25:58 +00:00
Chris Lattner
23c9c1bb62 This pass is completely broken. 
llvm-svn: 18387
 2004-11-30 17:09:06 +00:00
Chris Lattner
c58bc8d96e Squelch warning 
llvm-svn: 18381
 2004-11-30 07:47:34 +00:00
Chris Lattner
537e5a6b50 Fix test/Regression/Transforms/LICM/2004-09-14-AliasAnalysisInvalidate.llx 
This only fails on darwin or on X86 under valgrind.

llvm-svn: 18377
 2004-11-30 07:01:15 +00:00
Chris Lattner
25b93fea2a Alkis noticed that this variable is dead. Thanks! 
llvm-svn: 18369
 2004-11-30 04:01:44 +00:00
Chris Lattner
b237a19a78 If we have something like this: 
if (x) {
    code
    ...
  } else {
    code
    ...
  }

Turn it into:

  code
  if (x) {
    ...
  } else {
    ...
  }

This reduces code size and in some common cases allows us to completely
eliminate the conditional.  This turns several if/then/else blocks in loops
into straightline code in 179.art, turning the loops into single basic blocks
(good for modsched even!).

Maybe now brg will leave me alone ;-)

llvm-svn: 18366
 2004-11-30 00:29:14 +00:00
Chris Lattner
ba782edfb7 Allow hoisting loads of globals and alloca's in conditionals. 
llvm-svn: 18363
 2004-11-29 21:26:12 +00:00
Reid Spencer
dd287f7758 Fix for PR454: 
* Make sure we handle signed to unsigned conversion correctly
* Move this visitSetCondInst case to its own method.

llvm-svn: 18312
 2004-11-28 21:31:15 +00:00