- Jun 23, 2008
-
-
Wojciech Matyjewicz authored
multiplicative inverse of a given number. Modify udivrem to allow input and output pairs of arguments to overlap. Patch is based on the work by Chandler Carruth. llvm-svn: 52638
-
Dan Gohman authored
llvm-svn: 52637
-
Dan Gohman authored
explaining why empty array constants use ValID::createUndef(). llvm-svn: 52636
-
Owen Anderson authored
Tighten the conditions under which we do PRE, remove some unneeded code, and correct our preserved analyses list, since we do now change the CFG by splitting critical edges during PRE. llvm-svn: 52631
-
Chris Lattner authored
llvm-svn: 52630
-
Dan Gohman authored
private implementation doesn't really need the convenience. llvm-svn: 52629
-
Dan Gohman authored
llvm-svn: 52628
-
Dan Gohman authored
copying its return value. llvm-svn: 52627
-
Dan Gohman authored
llvm-svn: 52624
-
Duncan Sands authored
Bail out with an error if there is no libcall available for the given size of integer. llvm-svn: 52622
-
Duncan Sands authored
llvm-svn: 52621
-
Duncan Sands authored
stores. llvm-svn: 52620
-
Owen Anderson authored
instance variables so they can be allocated just once, and reuse the worklist as the dead list as well. llvm-svn: 52618
-
- Jun 22, 2008
-
-
Dan Gohman authored
with more than two nodes. llvm-svn: 52617
-
Dan Gohman authored
llvm-svn: 52616
-
Dan Gohman authored
ConstantExprs. llvm-svn: 52615
-
Dan Gohman authored
llvm-svn: 52614
-
Dan Gohman authored
llvm-svn: 52613
-
Dan Gohman authored
llvm-svn: 52612
-
Chris Lattner authored
structures. Its default threshold is to promote things that are smaller than 128 bytes, which is sane. However, it is not sane to do this for things that turn into 128 *registers*. Add a cap on the number of registers introduced, defaulting to 128/4=32. llvm-svn: 52611
-
Duncan Sands authored
fixes PR2476; patch by Richard Osborne. The same problem exists for a bunch of other operators, but I'm ignoring this because they will be automagically fixed when the new LegalizeTypes infrastructure lands, since it already solves this problem centrally. llvm-svn: 52610
-
Eli Friedman authored
15). See also PR1800, which is about the signed case. llvm-svn: 52608
-
Dan Gohman authored
llvm-svn: 52606
-
Dan Gohman authored
llvm-svn: 52605
-
Dan Gohman authored
llvm-svn: 52604
-
Dan Gohman authored
check this with an assert. llvm-svn: 52603
-
Dan Gohman authored
llvm-svn: 52602
-
Dan Gohman authored
llvm-svn: 52601
-
Dan Gohman authored
llvm-svn: 52600
-
- Jun 21, 2008
-
-
Dan Gohman authored
llvm-svn: 52594
-
Dan Gohman authored
llvm-svn: 52592
-
Chris Lattner authored
llvm-svn: 52590
-
Chris Lattner authored
llvm-svn: 52589
-
Chris Lattner authored
llvm-svn: 52588
-
Chris Lattner authored
llvm-svn: 52587
-
Dan Gohman authored
llvm-svn: 52585
-
Dan Gohman authored
field, which is otherwise unused after instruction selection, as an index into the SUnit array. llvm-svn: 52583
-
Dan Gohman authored
and provides fairly efficient removal of arbitrary elements. Switch ScheduleDAGRRList from std::set to this new priority queue. llvm-svn: 52582
-
Duncan Sands authored
don't know if a truncating store is possible here, but added support for it anyway. llvm-svn: 52577
-
Dan Gohman authored
to DenseMap<SDNode*, SUnit*>, and adjust the way cloned SUnit nodes are handled so that only the original node needs to be in the map. This speeds up llc on 447.dealII.llvm.bc by about 2%. llvm-svn: 52576
-