- Jun 04, 2009
-
-
Dan Gohman authored
instcombine doesn't know when it's safe. To partially compensate for this, introduce new code to do this transformation in dagcombine, which can use UnsafeFPMath. llvm-svn: 72872
-
- Jun 03, 2009
-
-
Dan Gohman authored
be simplified to a loop-invariant value. This fixes PR4315. llvm-svn: 72798
-
- Jun 02, 2009
-
-
Dan Gohman authored
addresses, involving Base values which do not have Pointer type. This fixes PR4297. llvm-svn: 72739
-
- Jun 01, 2009
-
-
Eli Friedman authored
RewriteStoreUserOfWholeAlloca deal with tail padding because isSafeUseOfBitCastedAllocation expects them to. Otherwise, we crash trying to erase the bitcast. llvm-svn: 72688
-
- May 31, 2009
-
-
Owen Anderson authored
a single predecessor. Patch by Jakub Staszak. llvm-svn: 72661
-
- May 30, 2009
-
-
Chris Lattner authored
Benjamin Kramer! llvm-svn: 72625
-
- May 29, 2009
-
-
Bill Wendling authored
llvm-svn: 72589
-
Torok Edwin authored
llvm-svn: 72577
-
Torok Edwin authored
is, otherwise we get a <badref>. llvm-svn: 72567
-
Torok Edwin authored
This is useful when trying to figure out why GVN didn't eliminate redundant loads. llvm-svn: 72565
-
Owen Anderson authored
Diagnosis and patch thanks to Jakub Staszak. llvm-svn: 72562
-
- May 28, 2009
-
-
Nick Lewycky authored
empty SmallVector. llvm-svn: 72512
-
- May 27, 2009
-
-
Dan Gohman authored
rewrite the comparison if there is any implicit extension or truncation on the induction variable. I'm planning for IVUsers to eventually take over some of the work of this code, and for it to be generalized. llvm-svn: 72496
-
Dan Gohman authored
a smaller type, promoted its offset back up to the type of the new comparison. This fixes PR4222. llvm-svn: 72493
-
- May 25, 2009
-
-
Dan Gohman authored
in the case where a loop exit value cannot be computed, instead of only in some cases while using SCEVCouldNotCompute in others. This simplifies getSCEVAtScope's callers. llvm-svn: 72375
-
- May 24, 2009
-
-
Torok Edwin authored
one of the RecursivelyDeleteTriviallyDeadInstructions. Add a comment explaining why the cache needs to be cleared. llvm-svn: 72372
-
Torok Edwin authored
Also fix 80 column violation. llvm-svn: 72371
-
Dan Gohman authored
leave the original comparison in place if it has other uses, since the other uses won't be dominated by the new comparison instruction. llvm-svn: 72369
-
Dan Gohman authored
comparison, use takeName to give the integer comparison a name. llvm-svn: 72367
-
Torok Edwin authored
Fix by clearing the rewriter cache before deleting the trivially dead instructions. Also make InsertedExpressions use an AssertingVH to catch these bugs easier. llvm-svn: 72364
-
- May 23, 2009
-
-
Evan Cheng authored
Fix bug in FoldFCmp_IntToFP_Cst. If inttofp is a uintofp, use unsigned instead of signed integer constant. llvm-svn: 72300
-
- May 22, 2009
-
-
Dan Gohman authored
assuming that the use of the value is in a block dominated by the "normal" destination. LangRef.html and other documentation sources don't explicitly guarantee this, but it seems to be assumed in other places in LLVM at least. This fixes an assertion failure on the included testcase, which is derived from the Ada testsuite. FixUsesBeforeDefs is a temporary measure which I'm looking to replace with a more capable solution. llvm-svn: 72266
-
Eli Friedman authored
PR4238. llvm-svn: 72244
-
- May 21, 2009
-
-
Dan Gohman authored
Instcombine to be more aggressive about using SimplifyDemandedBits on shift nodes. This allows a shift to be simplified to zero in the included test case. llvm-svn: 72204
-
- May 20, 2009
-
-
Dan Gohman authored
of the comparison is defined inside the loop. This fixes a use-before-def problem, because the transformation puts a use of the RHS outside the loop. llvm-svn: 72149
-
- May 19, 2009
-
-
Dan Gohman authored
llvm-svn: 72132
-
Dan Gohman authored
llvm-svn: 72131
-
Dan Gohman authored
llvm-svn: 72130
-
Dan Gohman authored
instructions. It attempts to create high-level multi-operand GEPs, though in cases where this isn't possible it falls back to casting the pointer to i8* and emitting a GEP with that. Using GEP instructions instead of ptrtoint+arithmetic+inttoptr helps pointer analyses that don't use ScalarEvolution, such as BasicAliasAnalysis. Also, make the AddrModeMatcher more aggressive in handling GEPs. Previously it assumed that operand 0 of a GEP would require a register in almost all cases. It now does extra checking and can do more matching if operand 0 of the GEP is foldable. This fixes a problem that was exposed by SCEVExpander using GEPs. llvm-svn: 72093
-
- May 18, 2009
-
-
Dan Gohman authored
avoid ambiguity with the word "use" in IVStrideUse. llvm-svn: 72012
-
- May 14, 2009
-
-
Dale Johannesen authored
llvm-svn: 71775
-
- May 13, 2009
-
-
Chris Lattner authored
is not known to be nothrow. This allows readnone/readonly functions to be deleted even if we don't know whether the callee can throw. llvm-svn: 71676
-
Chris Lattner authored
llvm-svn: 71644
-
Dale Johannesen authored
without one. Use it where we were using abs on int64_t objects. (I strongly suspect the casts to unsigned in the fragments in LoopStrengthReduce are not doing whatever the original intent was, but the obvious change to uint64_t doesn't work. Maybe later.) llvm-svn: 71612
-
- May 12, 2009
-
-
Dan Gohman authored
and generalize it so that it can be used by IndVarSimplify. Implement the base IndVarSimplify transformation code using IVUsers. This removes TestOrigIVForWrap and associated code, as ScalarEvolution now has enough builtin overflow detection and folding logic to handle all the same cases, and more. Run "opt -iv-users -analyze -disable-output" on your favorite loop for an example of what IVUsers does. This lets IndVarSimplify eliminate IV casts and compute trip counts in more cases. Also, this happens to finally fix the remaining testcases in PR1301. Now that IndVarSimplify is being more aggressive, it occasionally runs into the problem where ScalarEvolutionExpander's code for avoiding duplicate expansions makes it difficult to ensure that all expanded instructions dominate all the instructions that will use them. As a temporary measure, IndVarSimplify now uses a FixUsesBeforeDefs function to fix up instructions inserted by SCEVExpander. Fortunately, this code is contained, and can be easily removed once a more comprehensive solution is available. llvm-svn: 71535
-
Evan Cheng authored
Teach LSR to optimize more loop exit compares, i.e. change them to use postinc iv value. Previously LSR would only optimize those which are in the loop latch block. However, if LSR can prove it is safe (and profitable), it's now possible to change those not in the latch blocks to use postinc values. Also, if the compare is the only use, LSR would place the iv increment instruction before the compare instead in the latch. llvm-svn: 71485
-
- May 11, 2009
-
-
Dale Johannesen authored
count down to 0 instead, under very restricted circumstances. Adjust 4 testcases in which this optimization fires. llvm-svn: 71439
-
- May 09, 2009
-
-
Duncan Sands authored
will make it more obvious what it represents, and stop it being confused with the StoreSize. llvm-svn: 71349
-
Evan Cheng authored
llvm-svn: 71305
-
- May 08, 2009
-
-
Chris Lattner authored
method, fixing a crash on PR4146. While the store will ultimately overwrite the "padded size" number of bits in memory, the stored value may be a subset of this size. This function only wants to handle the case where all bits are stored. llvm-svn: 71224
-