summaryrefslogtreecommitdiffstats
path: root/llvm/lib/Transforms
Commit message (Collapse)AuthorAgeFilesLines
* Use Operands.data() instead of &Operands[0] where Operands is a potentiallyNick Lewycky2009-05-281-1/+1
| | | | | | empty SmallVector. llvm-svn: 72512
* Revert 72493 and replace it with a more conservative fix, for now: don'tDan Gohman2009-05-271-7/+8
| | | | | | | | 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
* In ChangeCompareStride, when the stride to be reused is truncated toDan Gohman2009-05-271-2/+7
| | | | | | | a smaller type, promoted its offset back up to the type of the new comparison. This fixes PR4222. llvm-svn: 72493
* Change ScalarEvolution::getSCEVAtScope to always return the original valueDan Gohman2009-05-241-4/+2
| | | | | | | | 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
* Move Rewriter.clear() earlier, to avoid triggerring the AssertingVH byTorok Edwin2009-05-241-2/+8
| | | | | | | one of the RecursivelyDeleteTriviallyDeadInstructions. Add a comment explaining why the cache needs to be cleared. llvm-svn: 72372
* Instead of clearing the rewriter, don't attempt to rewrite dead phi nodes.Torok Edwin2009-05-241-2/+2
| | | | | | Also fix 80 column violation. llvm-svn: 72371
* When rewriting the loop exit test with the canonical induction variable,Dan Gohman2009-05-241-1/+6
| | | | | | | 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
* When replacing a floating-point comparison with an integerDan Gohman2009-05-241-0/+1
| | | | | | comparison, use takeName to give the integer comparison a name. llvm-svn: 72367
* The rewriter may hold references to instructions that are deleted because ↵Torok Edwin2009-05-241-0/+2
| | | | | | | | | | | they are trivially dead. 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
* available_externall linkage is not local, this was confusing the codegenerator,Torok Edwin2009-05-234-5/+8
| | | | | | | | | and it wasn't generating calls through @PLT for these functions. hasLocalLinkage() is now false for available_externally, I attempted to fix the inliner and dce to handle available_externally properly. It passed make check. llvm-svn: 72328
* Fix bug in FoldFCmp_IntToFP_Cst. If inttofp is a uintofp, use unsigned ↵Evan Cheng2009-05-221-61/+67
| | | | | | instead of signed integer constant. llvm-svn: 72300
* Teach IndVarSimplify's FixUsesBeforeDefs to handle InvokeInsts byDan Gohman2009-05-221-1/+5
| | | | | | | | | | | | | | | 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
* Fix loop-index-split to correctly preserve dominance frontiers. Part of Eli Friedman2009-05-221-17/+12
| | | | | | PR4238. llvm-svn: 72244
* Teach ValueTracking a new way to analyze PHI nodes, and and teachDan Gohman2009-05-211-2/+4
| | | | | | | | 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
* Suppress the IV reversal transformation in the case that the RHSDan Gohman2009-05-201-0/+5
| | | | | | | | 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
* Remove an irrelevant comment.Dan Gohman2009-05-191-3/+1
| | | | llvm-svn: 72132
* Add some more comments to the top of this file.Dan Gohman2009-05-191-1/+8
| | | | llvm-svn: 72131
* Trim unneeded #includes.Dan Gohman2009-05-192-3/+0
| | | | llvm-svn: 72130
* Teach SCEVExpander to expand arithmetic involving pointers into GEPDan Gohman2009-05-193-48/+50
| | | | | | | | | | | | | | | | 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
* Rename UseTy to AccessTy, for consistency with getAccessType, and toDan Gohman2009-05-181-24/+25
| | | | | | avoid ambiguity with the word "use" in IVStrideUse. llvm-svn: 72012
* Reuse existing getUnderlyingObject instead ofDale Johannesen2009-05-141-24/+6
| | | | | | adding another copy. llvm-svn: 71783
* Use abs64 in one more place.Dale Johannesen2009-05-141-1/+1
| | | | llvm-svn: 71775
* Handle some additonal cases of external weak globals.Dale Johannesen2009-05-131-4/+22
| | | | llvm-svn: 71717
* Don't generate a select whose operand is load of a weakDale Johannesen2009-05-131-0/+6
| | | | | | | external. These may have address 0 and are not safe to execute unconditionally. llvm-svn: 71688
* calls in nothrow functions can be marked nothrow even if the calleeChris Lattner2009-05-131-0/+10
| | | | | | | 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
* Fix PR4206 - crash in simplify lib callsChris Lattner2009-05-131-1/+1
| | | | llvm-svn: 71644
* Add an int64_t variant of abs, for host environmentsDale Johannesen2009-05-131-3/+3
| | | | | | | | | | | 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
* Factor the code for collecting IV users out of LSR into an IVUsers class,Dan Gohman2009-05-122-920/+584
| | | | | | | | | | | | | | | | | | | | | | | | 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
* Teach LSR to optimize more loop exit compares, i.e. change them to use ↵Evan Cheng2009-05-111-43/+139
| | | | | | | | 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
* Reverse a loop that is counting up to a maximum toDale Johannesen2009-05-111-6/+118
| | | | | | | | count down to 0 instead, under very restricted circumstances. Adjust 4 testcases in which this optimization fires. llvm-svn: 71439
* Rename PaddedSize to AllocSize, in the hope that thisDuncan Sands2009-05-097-47/+47
| | | | | | | will make it more obvious what it represents, and stop it being confused with the StoreSize. llvm-svn: 71349
* Factor out code that optimize loop terminating condition.Evan Cheng2009-05-091-0/+9
| | | | llvm-svn: 71305
* fix RewriteStoreUserOfWholeAlloca to use the correct type sizeChris Lattner2009-05-081-4/+6
| | | | | | | | | 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
* This transform requires valid TargetData info. Wrap it in 'if (TD)' inNick Lewycky2009-05-081-25/+27
| | | | | | preparation for the day we use null TargetData when no target is specified. llvm-svn: 71210
* PR4123: don't crash when inlining a call which uses its own result.Eli Friedman2009-05-081-3/+10
| | | | llvm-svn: 71199
* Perform constant folding on operands of instructions with non-voidDan Gohman2009-05-071-1/+3
| | | | | | types, such as loads and calls. llvm-svn: 71175
* Unbreak the build.Evan Cheng2009-05-061-1/+1
| | | | llvm-svn: 71091
* Make sure to use signed arithmetic in APInt to fix a regression.David Greene2009-05-061-2/+3
| | | | llvm-svn: 71090
* Simplify code by using SmallVector's pop_back_val() instead ofDan Gohman2009-05-064-12/+6
| | | | | | separate back() and pop_back() calls. llvm-svn: 71089
* Fix PR3754: don't mark functions that wrap MallocInst withDuncan Sands2009-05-061-0/+5
| | | | | | | | the readnone. Since MallocInst is scheduled for deletion it doesn't seem worth doing anything more subtle, such as having mayWriteToMemory return true for MallocInst. llvm-svn: 71077
* Allow readonly functions to unwind exceptions. TeachDuncan Sands2009-05-069-21/+16
| | | | | | | | the optimizers about this. For example, a readonly function with no uses cannot be removed unless it is also marked nounwind. llvm-svn: 71071
* Fix a copy+pasto in a comment.Dan Gohman2009-05-051-1/+1
| | | | llvm-svn: 71035
* Delete a FIXME which is no longer relevant, and add a FIXME that is.Dan Gohman2009-05-051-2/+3
| | | | llvm-svn: 71033
* Temporarily reverting r71008. It was causing this failure:Bill Wendling2009-05-051-3/+2
| | | | | | | | | | | | Running /Volumes/Sandbox/Buildbot/llvm/full-llvm/build/llvm.src/test/ CodeGen/X86/dg.exp ... FAIL: /Volumes/Sandbox/Buildbot/llvm/full-llvm/build/llvm.src/test/ CodeGen/X86/change-compare-stride-1.ll Failed with exit(1) at line 2 while running: grep {cmpq $-478,} change-compare-stride-1.ll.tmp child process exited abnormally llvm-svn: 71013
* Handle overflow of 64-bit loop conditions.David Greene2009-05-051-2/+3
| | | | llvm-svn: 71008
* Re-apply 70645, converting ScalarEvolution to useDan Gohman2009-05-045-52/+10
| | | | | | | | | | | | CallbackVH, with fixes. allUsesReplacedWith need to walk the def-use chains and invalidate all users of a value that is replaced. SCEVs of users need to be recalcualted even if the new value is equivalent. Also, make forgetLoopPHIs walk def-use chains, since any SCEV that depends on a PHI should be recalculated when more information about that PHI becomes available. llvm-svn: 70927
* Constify a bunch of SCEV-using code.Dan Gohman2009-05-041-4/+4
| | | | llvm-svn: 70919
* fix some problems spotted by Duncan and Nicolas GeoffrayChris Lattner2009-05-041-2/+2
| | | | llvm-svn: 70872
* * Sink 4 duplicates of edge threading validity checks and DOUT prints intoChris Lattner2009-05-041-71/+84
| | | | | | | | | | ThreadEdge directly. This shares the code, but is just a refactoring. * Make JumpThreading compute the set of loop headers and avoid threading across them. This prevents jump threading from forming irreducible loops (goodness) but also prevents it from threading in other cases that are beneficial (see the comment above FindFunctionBackedges). llvm-svn: 70820
* Factor loop backedge finding out of CodeGenPrepare into a new Chris Lattner2009-05-042-42/+59
| | | | | | FindFunctionBackedges function. llvm-svn: 70819
OpenPOWER on IntegriCloud