summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* Have -fms-no-extensions turn off -fms-compatibilityDouglas Gregor2011-10-241-2/+6
| | | | llvm-svn: 142798
* Make -fms-compatibility imply -fms-extensions. Fixes PR11204.Douglas Gregor2011-10-242-1/+5
| | | | llvm-svn: 142797
* Remove debugging printfs that some idiot left in.David Chisnall2011-10-241-3/+0
| | | | llvm-svn: 142796
* Enable experimental support for objc_msgSend with GNUstep ObjC runtime.David Chisnall2011-10-242-10/+33
| | | | llvm-svn: 142795
* Implement comparison operators for BranchProbability in a way that can't ↵Benjamin Kramer2011-10-242-10/+27
| | | | | | | | overflow INT64_MAX. Add a test case for the edge case that triggers this. Thanks to Chandler for bringing this to my attention. llvm-svn: 142794
* Remove return heuristics from the static branch probabilities, andChandler Carruth2011-10-243-74/+160
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | introduce no-return or unreachable heuristics. The return heuristics from the Ball and Larus paper don't work well in practice as they pessimize early return paths. The only good hitrate return heuristics are those for: - NULL return - Constant return - negative integer return Only the last of these three can possibly require significant code for the returning block, and even the last is fairly rare and usually also a constant. As a consequence, even for the cold return paths, there is little code on that return path, and so little code density to be gained by sinking it. The places where sinking these blocks is valuable (inner loops) will already be weighted appropriately as the edge is a loop-exit branch. All of this aside, early returns are nearly as common as all three of these return categories, and should actually be predicted as taken! Rather than muddy the waters of the static predictions, just remain silent on returns and let the CFG itself dictate any layout or other issues. However, the return heuristic was flagging one very important case: unreachable. Unfortunately it still gave a 1/4 chance of the branch-to-unreachable occuring. It also didn't do a rigorous job of finding those blocks which post-dominate an unreachable block. This patch builds a more powerful analysis that should flag all branches to blocks known to then reach unreachable. It also has better worst-case runtime complexity by not looping through successors for each block. The previous code would perform an N^2 walk in the event of a single entry block branching to N successors with a switch where each successor falls through to the next and they finally fall through to a return. Test case added for noreturn heuristics. Also doxygen comments improved along the way. llvm-svn: 142793
* Revert "Test commit"NAKAMURA Takumi2011-10-242-2/+0
| | | | llvm-svn: 142792
* Test commitNAKAMURA Takumi2011-10-242-0/+2
| | | | llvm-svn: 142791
* Reapply r142781 with fix. Original message:Nick Lewycky2011-10-242-21/+65
| | | | | | | | | | | | | | | | | | | Enhance SCEV's brute force loop analysis to handle multiple PHI nodes in the loop header when computing the trip count. With this, we now constant evaluate: struct ListNode { const struct ListNode *next; int i; }; static const struct ListNode node1 = {0, 1}; static const struct ListNode node2 = {&node1, 2}; static const struct ListNode node3 = {&node2, 3}; int test() { int sum = 0; for (const struct ListNode *n = &node3; n != 0; n = n->next) sum += n->i; return sum; } llvm-svn: 142790
* Doxygen-ify the comments on the public interface for BPI. Also, move theChandler Carruth2011-10-241-18/+47
| | | | | | | two more subtle routines to the bottom and expand on their cautionary comments a bit. No functionality or actual interface change here. llvm-svn: 142789
* PHI nodes not in the loop header aren't part of the loop iteration initialNick Lewycky2011-10-241-1/+1
| | | | | | | state. Furthermore, they might not have two operands. This fixes the underlying issue behind the crashes introduced in r142781. llvm-svn: 142788
* A dead malloc, a free(NULL) and a free(undef) are all trivially deadNick Lewycky2011-10-242-2/+9
| | | | | | | | | | instructions. This doesn't introduce any optimizations we weren't doing before (except potentially due to pass ordering issues), now passes will eliminate them sooner as part of their own cleanups. llvm-svn: 142787
* Speculatively revert r142781. Bots are showingNick Lewycky2011-10-242-65/+21
| | | | | | | Assertion `i_nocapture < OperandTraits<PHINode>::operands(this) && "getOperand() out of range!"' failed. coming out of indvars. llvm-svn: 142786
* Windows/Path.inc: [PR8460] Get rid of ScopedNullTerminator. Thanks to Zvi ↵NAKAMURA Takumi2011-10-241-18/+9
| | | | | | Rackover! llvm-svn: 142785
* Actually rename the file AnalysisContext.cpp -> AnalysisDeclContext.cppChandler Carruth2011-10-241-0/+0
| | | | | | | to match the CMakeLists.txt change in r142782; this should fix the CMake build. llvm-svn: 142784
* Simplify the design of BranchProbabilityInfo by collapsing it intoChandler Carruth2011-10-242-155/+120
| | | | | | | | | | | | | a single class. Previously it was split between two classes, one internal and one external. The concern seemed to center around exposing the weights used, but those can remain confined to the implementation file. Having a single class to maintain the state and analyses in use will also simplify several of the enhancements I want to make to our static heuristics. llvm-svn: 142783
* Rename AnalysisContext to AnalysisDeclContext. Not only is this name more ↵Ted Kremenek2011-10-2438-178/+178
| | | | | | accurate, but it frees up the name AnalysisContext for other uses. llvm-svn: 142782
* Enhance SCEV's brute force loop analysis to handle multiple PHI nodes in theNick Lewycky2011-10-232-21/+65
| | | | | | | | | | | | | | | | | | loop header when computing the trip count. With this, we now constant evaluate: struct ListNode { const struct ListNode *next; int i; }; static const struct ListNode node1 = {0, 1}; static const struct ListNode node2 = {&node1, 2}; static const struct ListNode node3 = {&node2, 3}; int test() { int sum = 0; for (const struct ListNode *n = &node3; n != 0; n = n->next) sum += n->i; return sum; } llvm-svn: 142781
* Tidy up a loop to be more idiomatic for LLVM's codebase, and remove someChandler Carruth2011-10-231-18/+9
| | | | | | | extraneous whitespace. Trying to clean-up this pass as much as I can before I start making functional changes. llvm-svn: 142780
* Add X86 SARX, SHRX, and SHLX instructions.Craig Topper2011-10-234-18/+135
| | | | llvm-svn: 142779
* Teach the BranchProbabilityInfo pass to print its results, and use thatChandler Carruth2011-10-234-5/+119
| | | | | | | | | | to bring it under direct test instead of merely indirectly testing it in the BlockFrequencyInfo pass. The next step is to start adding tests for the various heuristics employed, and to start fixing those heuristics once they're under test. llvm-svn: 142778
* PoCC: Fix bugs when executing PoCCTobias Grosser2011-10-231-16/+16
| | | | | | | These are remainders of the switch to the newer isl version. At the point of switching I did not test with PoCC support. I should have done. ;-) llvm-svn: 142777
* Remove pollyccTobias Grosser2011-10-231-403/+0
| | | | | | | | The recommanded and supported way to use Polly is to load it into clang. Documentation for this is available on the website under http://polly.grosser.es/example_load_Polly_into_clang.html llvm-svn: 142776
* Only have a single option to disable tiling for both isl and Pocc optimzerTobias Grosser2011-10-234-10/+33
| | | | | | This also documents the new option on the website. llvm-svn: 142775
* Enable prevectorization with -enable-polly-vector.Tobias Grosser2011-10-236-18/+38
| | | | | | This removes the separate prevector options for the Pluto and isl scheduler. llvm-svn: 142774
* Add an option to run the PoCC optimizerTobias Grosser2011-10-232-2/+26
| | | | llvm-svn: 142773
* Allow to disable the schedule optimizerTobias Grosser2011-10-232-1/+12
| | | | | | The option -polly-no-optimizer disables the scheduling optimizer. llvm-svn: 142772
* Rename -enable-schedule-prevector to -polly-prevectorTobias Grosser2011-10-232-3/+3
| | | | llvm-svn: 142771
* ScheduleOptimizer: Allow to disable tilingTobias Grosser2011-10-231-8/+16
| | | | llvm-svn: 142770
* ScopLib: Fix memory issuesTobias Grosser2011-10-232-25/+36
| | | | llvm-svn: 142769
* ScopInfo: Remove unneeded codeTobias Grosser2011-10-232-30/+11
| | | | llvm-svn: 142768
* Fix compilation of Polly with scoplib supportTobias Grosser2011-10-232-42/+48
| | | | llvm-svn: 142767
* Rename -enable-polly-viewer to -polly-run-viewerTobias Grosser2011-10-232-4/+13
| | | | | | Similar changes for polly-only-viewer, polly-printer and polly-only-printer. llvm-svn: 142766
* RegisterPasses: Allow to disable code generation.Tobias Grosser2011-10-232-1/+13
| | | | llvm-svn: 142765
* Rename the script to indicate that this is for the TEST=simple tests.Bill Wendling2011-10-231-0/+0
| | | | llvm-svn: 142764
* Resurrect the 'find regressions for the TEST=nightly tests' script.Bill Wendling2011-10-231-0/+130
| | | | llvm-svn: 142763
* Now that we have comparison on probabilities, add some static functionsChandler Carruth2011-10-232-8/+8
| | | | | | | to get important constant branch probabilities and use them for finding the best branch out of a set of possibilities. llvm-svn: 142762
* Remove a commented out line of code that snuck by my auditing.Chandler Carruth2011-10-231-1/+0
| | | | llvm-svn: 142761
* Fix grammar for C++11 alignment specifiers, and add a few FIXMEs.Peter Collingbourne2011-10-236-13/+44
| | | | llvm-svn: 142760
* Fix typo (C++1 -> C++11).Peter Collingbourne2011-10-231-1/+1
| | | | llvm-svn: 142759
* Diagnose unexpanded parameter packs in member initialisers (includingPeter Collingbourne2011-10-232-0/+15
| | | | | | in-class member initialisers). llvm-svn: 142758
* Clean up duplicated code in Sema::BuildMemInitializer.Peter Collingbourne2011-10-231-14/+3
| | | | llvm-svn: 142757
* Improve unexpanded parameter pack diagnostics by using UPPC_Initializer here.Peter Collingbourne2011-10-231-2/+3
| | | | llvm-svn: 142756
* Attach class template attributes to the templated CXXRecordDecl,Peter Collingbourne2011-10-233-1/+11
| | | | | | | | | instead of silently discarding them. As a side effect, this improves diagnostics for constexpr class templates slightly. llvm-svn: 142755
* Move Python.h includes out of the headers into the .cpp file where it's ↵Benjamin Kramer2011-10-234-25/+24
| | | | | | | | actually used. Python.h includes a ton of macros that can cause weird behavior down the road. llvm-svn: 142754
* Remove unused include of deprecated header.Benjamin Kramer2011-10-232-13/+1
| | | | llvm-svn: 142753
* Print branch probabilities as percentages.Benjamin Kramer2011-10-231-3/+3
| | | | | | 50% is much more readable than 5.000000e-01. llvm-svn: 142752
* Add compare operators to BranchProbability and use it to determine if an ↵Benjamin Kramer2011-10-234-17/+40
| | | | | | edge is hot. llvm-svn: 142751
* ScopDetection: Allow to limit the scop detection to a single functionTobias Grosser2011-10-233-2/+149
| | | | | | | -polly-detect-only=<functionname> allows to limit the scop detection to a single function. llvm-svn: 142750
* Fix buildbot linkTobias Grosser2011-10-231-1/+1
| | | | llvm-svn: 142749
OpenPOWER on IntegriCloud