Commit message (Collapse) | Author | Age | Files | Lines | |
---|---|---|---|---|---|
* | Remove LoopDependenceAnalysis. | Benjamin Kramer | 2012-10-26 | 1 | -362/+0 |
| | | | | | | | It was unmaintained and not much more than a stub. The new DependenceAnalysis pass is both more general and complete. llvm-svn: 166810 | ||||
* | Move TargetData to DataLayout. | Micah Villmow | 2012-10-08 | 1 | -1/+1 |
| | | | | llvm-svn: 165402 | ||||
* | More dead code removal (using -Wunreachable-code) | David Blaikie | 2012-01-20 | 1 | -2/+0 |
| | | | | llvm-svn: 148578 | ||||
* | Misc analysis passes that need to be aware of atomic load/store. | Eli Friedman | 2011-08-15 | 1 | -1/+7 |
| | | | | llvm-svn: 137650 | ||||
* | split dom frontier handling stuff out to its own DominanceFrontier header, | Chris Lattner | 2011-01-02 | 1 | -0/+1 |
| | | | | | | so that Dominators.h is *just* domtree. Also prune #includes a bit. llvm-svn: 122714 | ||||
* | Move Value::getUnderlyingObject to be a standalone | Dan Gohman | 2010-12-15 | 1 | -2/+3 |
| | | | | | | | function so that it can live in Analysis instead of VMCore. llvm-svn: 121885 | ||||
* | Minimally update this code to handle PartialAlias. | Dan Gohman | 2010-12-10 | 1 | -0/+1 |
| | | | | llvm-svn: 121518 | ||||
* | Move SCEV::isLoopInvariant and hasComputableLoopEvolution to be member | Dan Gohman | 2010-11-17 | 1 | -1/+1 |
| | | | | | | | functions of ScalarEvolution, in preparation for memoization and other optimizations. llvm-svn: 119562 | ||||
* | Begin adding static dependence information to passes, which will allow us to | Owen Anderson | 2010-10-12 | 1 | -1/+5 |
| | | | | | | | | | perform initialization without static constructors AND without explicit initialization by the client. For the moment, passes are required to initialize both their (potential) dependencies and any passes they preserve. I hope to be able to relax the latter requirement in the future. llvm-svn: 116334 | ||||
* | Now with fewer extraneous semicolons! | Owen Anderson | 2010-10-07 | 1 | -1/+1 |
| | | | | llvm-svn: 115996 | ||||
* | Fix batch of converting RegisterPass<> to INTIALIZE_PASS(). | Owen Anderson | 2010-07-21 | 1 | -2/+2 |
| | | | | llvm-svn: 109045 | ||||
* | Define placement new wrappers for BumpPtrAllocator and | Dan Gohman | 2010-03-18 | 1 | -2/+1 |
| | | | | | | | RecyclingAllocator to allow client code to be simpler, and simplify several clients. llvm-svn: 98847 | ||||
* | Convert debug messages to use dbgs(). Generally this means | David Greene | 2009-12-23 | 1 | -7/+7 |
| | | | | | | s/errs/dbgs/g except for certain special cases. llvm-svn: 92042 | ||||
* | remove a few dead insertion methods. | Chris Lattner | 2009-08-24 | 1 | -5/+0 |
| | | | | llvm-svn: 79882 | ||||
* | Push LLVMContexts through the IntegerType APIs. | Owen Anderson | 2009-08-13 | 1 | -1/+1 |
| | | | | llvm-svn: 78948 | ||||
* | SIV/MIV classification for LDA. | Andreas Bolka | 2009-08-07 | 1 | -6/+35 |
| | | | | | | | | | | LoopDependenceAnalysis::getLoops is currently O(N*M) for a loop-nest of depth N and a compound SCEV of M atomic SCEVs. As both N and M will typically be very small, this should not be a problem. If it turns out to be one, rewriting getLoops as SCEVVisitor will reduce complexity to O(M). llvm-svn: 78394 | ||||
* | Simplify the ZIV tester to the max. | Andreas Bolka | 2009-08-06 | 1 | -3/+2 |
| | | | | | | As suggested by Nick Lewycky. llvm-svn: 78277 | ||||
* | ZIV tester for LDA. | Andreas Bolka | 2009-08-05 | 1 | -1/+17 |
| | | | | llvm-svn: 78157 | ||||
* | Restrict LDA to GEPs with the same pointer offset. | Andreas Bolka | 2009-08-05 | 1 | -11/+27 |
| | | | | | | | We can not simply apply ZIV testing to the pointer offsets, as this would incorrectly return independence for e.g. (GEP x,0,i; GEP x,1,-i). llvm-svn: 78155 | ||||
* | Restrict LDA to affine subscripts. | Andreas Bolka | 2009-08-03 | 1 | -0/+18 |
| | | | | llvm-svn: 77932 | ||||
* | Equal SCEVs of a subscript give rise to dependence. | Andreas Bolka | 2009-07-30 | 1 | -1/+11 |
| | | | | llvm-svn: 77570 | ||||
* | Skeleton for pairwise subscript testing. | Andreas Bolka | 2009-07-29 | 1 | -3/+45 |
| | | | | llvm-svn: 77437 | ||||
* | Simplify LDA-internal interface. | Andreas Bolka | 2009-07-28 | 1 | -12/+8 |
| | | | | llvm-svn: 77359 | ||||
* | Add LDA statistics. | Andreas Bolka | 2009-07-28 | 1 | -0/+14 |
| | | | | llvm-svn: 77358 | ||||
* | Minor factoring, naming and formatting cleanups. | Andreas Bolka | 2009-07-28 | 1 | -24/+29 |
| | | | | llvm-svn: 77357 | ||||
* | Convert DOUT to DEBUG. | Andreas Bolka | 2009-07-25 | 1 | -5/+5 |
| | | | | llvm-svn: 77065 | ||||
* | Make AliasAnalysis and related classes use | Dan Gohman | 2009-07-25 | 1 | -2/+2 |
| | | | | | | getAnalysisIfAvailable<TargetData>(). llvm-svn: 77028 | ||||
* | Forward-declare raw_ostream. | Andreas Bolka | 2009-07-24 | 1 | -0/+2 |
| | | | | llvm-svn: 77014 | ||||
* | Cache dependence computation using FoldingSet. | Andreas Bolka | 2009-07-23 | 1 | -23/+65 |
| | | | | | | | | | This introduces an LDA-internal DependencePair class. The intention is, that this is a place where dependence testers can store various results such as SCEVs describing conflicting iterations, breaking conditions, distance/direction vectors, etc. llvm-svn: 76877 | ||||
* | Minor cosmetics: indentation, formatting, naming. | Andreas Bolka | 2009-07-23 | 1 | -18/+18 |
| | | | | llvm-svn: 76839 | ||||
* | llvm_unreachable->llvm_unreachable(0), LLVM_UNREACHABLE->llvm_unreachable. | Torok Edwin | 2009-07-14 | 1 | -1/+1 |
| | | | | | | | | | This adds location info for all llvm_unreachable calls (which is a macro now) in !NDEBUG builds. In NDEBUG builds location info and the message is off (it only prints "UREACHABLE executed"). llvm-svn: 75640 | ||||
* | assert(0) -> LLVM_UNREACHABLE. | Torok Edwin | 2009-07-11 | 1 | -1/+2 |
| | | | | | | | | | Make llvm_unreachable take an optional string, thus moving the cerr<< out of line. LLVM_UNREACHABLE is now a simple wrapper that makes the message go away for NDEBUG builds. llvm-svn: 75379 | ||||
* | Minor improvement to the LDA debug output. | Andreas Bolka | 2009-07-03 | 1 | -2/+7 |
| | | | | llvm-svn: 74754 | ||||
* | Use AA to check objects before LDA. | Andreas Bolka | 2009-07-01 | 1 | -15/+14 |
| | | | | llvm-svn: 74647 | ||||
* | Array accesses are independent if the underlying arrays differ. | Andreas Bolka | 2009-06-30 | 1 | -0/+47 |
| | | | | llvm-svn: 74499 | ||||
* | Relax LDA memory instruction checks. | Andreas Bolka | 2009-06-29 | 1 | -4/+7 |
| | | | | llvm-svn: 74439 | ||||
* | Missed one. | Andreas Bolka | 2009-06-29 | 1 | -1/+1 |
| | | | | llvm-svn: 74416 | ||||
* | Fix case in LDA util function names. | Andreas Bolka | 2009-06-29 | 1 | -4/+4 |
| | | | | llvm-svn: 74415 | ||||
* | Print pairwise dependence results, add testcases. | Andreas Bolka | 2009-06-28 | 1 | -2/+26 |
| | | | | llvm-svn: 74402 | ||||
* | Minimal LDA interface, maximally conservative tester. | Andreas Bolka | 2009-06-28 | 1 | -0/+24 |
| | | | | llvm-svn: 74401 | ||||
* | LDA analysis output scaffolding. | Andreas Bolka | 2009-06-28 | 1 | -1/+19 |
| | | | | llvm-svn: 74400 | ||||
* | Scaffolding for LDA pass. | Andreas Bolka | 2009-06-24 | 1 | -0/+47 |
llvm-svn: 74120 |