summaryrefslogtreecommitdiffstats
path: root/llvm
Commit message (Collapse)AuthorAgeFilesLines
...
* Match changes to unix build system.Jeff Cohen2006-02-141-1/+1
| | | | llvm-svn: 26167
* now that libcalls don't suck, we can remove this hackChris Lattner2006-02-141-6/+2
| | | | llvm-svn: 26164
* Adjust to new style "generated files in CVS" mechanism for lex outputChris Lattner2006-02-142-0/+201
| | | | llvm-svn: 26163
* adjust to new style of handling lexer changesChris Lattner2006-02-142-111/+466
| | | | llvm-svn: 26162
* Adjust to new form of handling lexer dependencies, this way shouldn't haveChris Lattner2006-02-143-40/+273
| | | | | | the problems the old way did. llvm-svn: 26161
* Implement an alternative way of handling generated lex files in CVS. ThisChris Lattner2006-02-141-5/+15
| | | | | | | should solve the "updating cvs when .l files change give me conflict markers that break my build" issue. llvm-svn: 26160
* Wrap a couple more long linesChris Lattner2006-02-141-4/+5
| | | | llvm-svn: 26159
* wrap long linesChris Lattner2006-02-141-9/+16
| | | | llvm-svn: 26158
* Use statistics to keep track of what flavors of loops we are unswitchingChris Lattner2006-02-141-7/+19
| | | | llvm-svn: 26157
* Fix a latent bug in the call sequence handling stuff. Some targets (e.g. x86)Chris Lattner2006-02-141-4/+11
| | | | | | create these nodes with flag results. Remember that we legalized them. llvm-svn: 26156
* Implement Instcombine/and.ll:test34Chris Lattner2006-02-131-0/+12
| | | | llvm-svn: 26155
* new testcaseChris Lattner2006-02-131-0/+6
| | | | llvm-svn: 26154
* Fix typo that caused build failures for things trying to use m_Or.Chris Lattner2006-02-131-2/+2
| | | | llvm-svn: 26153
* If any of the sign extended bits are demanded, the input sign bit is demandedChris Lattner2006-02-131-3/+9
| | | | | | | | for a sign extension. This fixes InstCombine/2006-02-13-DemandedMiscompile.ll and Ptrdist/bc. llvm-svn: 26152
* testcase reduced from Ptrdist/bc that is miscompiled by recent instcombine ↵Chris Lattner2006-02-131-0/+9
| | | | | | changes. llvm-svn: 26151
* Another hack due to allowing multiple symbols with the same name.Chris Lattner2006-02-131-11/+52
| | | | llvm-svn: 26150
* Another work around for the 'symbols with different types can have the sameChris Lattner2006-02-131-0/+4
| | | | | | name' issue. llvm-svn: 26149
* improved zap discoveryAndrew Lenharth2006-02-131-0/+33
| | | | llvm-svn: 26148
* test for improved zap discoveryAndrew Lenharth2006-02-131-0/+10
| | | | llvm-svn: 26147
* Sync up the tag numbers with gcc4.Jim Laskey2006-02-131-9/+1
| | | | llvm-svn: 26146
* Rename to better reflect usage (current and planned.)Jim Laskey2006-02-133-5/+7
| | | | llvm-svn: 26145
* Completely rewrite libcall insertion by the legalizer, providing theChris Lattner2006-02-131-198/+217
| | | | | | | | | | | | | | | | following handy-dandy properties: 1. it is always correct now 2. it is much faster than before 3. it is easier to understand This implementation builds off of the recent simplifications of the legalizer that made it single-pass instead of iterative. This fixes JM/lencod, JM/ldecod, and CodeGen/Generic/2006-02-12-InsertLibcall.ll (at least on PPC). llvm-svn: 26144
* Switch targets over to using SelectionDAG::getCALLSEQ_START to createChris Lattner2006-02-134-12/+8
| | | | | | CALLSEQ_START nodes. llvm-svn: 26143
* Switch to using getCALLSEQ_START instead of using our own creation callsChris Lattner2006-02-131-4/+4
| | | | llvm-svn: 26142
* Add a methodChris Lattner2006-02-131-0/+12
| | | | llvm-svn: 26141
* this passes now, due to Nate's recent effortsChris Lattner2006-02-131-1/+0
| | | | llvm-svn: 26140
* Reduce this testcase a bit more, with the help of llvm-extract and some hand ↵Chris Lattner2006-02-131-12/+8
| | | | | | tweaks llvm-svn: 26139
* Be careful not to request or look at bits shifted in from outside the sizeChris Lattner2006-02-131-3/+9
| | | | | | of the input. This fixes the mediabench/gsm/toast failure last night. llvm-svn: 26138
* Added a test case for a libcall insertion bug.Evan Cheng2006-02-121-0/+64
| | | | llvm-svn: 26137
* Add missing patterns for andi. and andis., fixing test/Regression/CodeGen/Nate Begeman2006-02-121-2/+4
| | | | | | PowerPC/and-imm.ll llvm-svn: 26136
* remove some more dead special case codeChris Lattner2006-02-121-35/+8
| | | | llvm-svn: 26135
* Eliminate special case hacks that are superceded by general purpose hacksChris Lattner2006-02-121-139/+51
| | | | llvm-svn: 26134
* tweaksChris Lattner2006-02-122-1/+10
| | | | llvm-svn: 26133
* Three changes:Chris Lattner2006-02-121-6/+135
| | | | | | | | | | | | 1. Teach GetConstantInType to handle boolean constants. 2. Teach instcombine to fold (compare X, CST) when X has known 0/1 bits. Testcase here: set.ll:test22 3. Improve the "(X >> c1) & C2 == 0" folding code to allow a noop cast between the shift and and. More aggressive bitfolding for other reasons was turning signed shr's into unsigned shr's, leaving the noop cast in the way. llvm-svn: 26131
* new testcaseChris Lattner2006-02-121-1/+9
| | | | llvm-svn: 26130
* move a failing testcase from bit-tracking.ll to narrow.ll, and move theChris Lattner2006-02-122-22/+18
| | | | | | xfail marker with it llvm-svn: 26129
* Revert my last patch. It too breaks stuffChris Lattner2006-02-121-12/+6
| | | | llvm-svn: 26128
* Make these tests fail if opt crashes.Chris Lattner2006-02-122-0/+2
| | | | llvm-svn: 26127
* Fix for my previously reverted patchChris Lattner2006-02-111-6/+12
| | | | llvm-svn: 26126
* Update comments to be actually accurateChris Lattner2006-02-111-13/+19
| | | | llvm-svn: 26124
* This is implemented by the simplify-libcalls pass, not instcombineChris Lattner2006-02-111-23/+0
| | | | llvm-svn: 26123
* Port the recent innovations in ComputeMaskedBits to SimplifyDemandedBits.Chris Lattner2006-02-111-211/+425
| | | | | | | | | | | This allows us to simplify on conditions where bits are not known, but they are not demanded either! This also fixes a couple of bugs in ComputeMaskedBits that were exposed during this work. In the future, swaths of instcombine should be removed, as this code subsumes a bunch of ad-hockery. llvm-svn: 26122
* revert my previous change, it exposed other problems.Chris Lattner2006-02-111-1/+1
| | | | llvm-svn: 26121
* fix storing booleans (grawp missed this one)Duraid Madina2006-02-111-3/+3
| | | | llvm-svn: 26120
* now short immediates will get matched (previously constants were allDuraid Madina2006-02-111-5/+3
| | | | | | triggering movl 64bit imm fat instructions) llvm-svn: 26119
* Make this check stricter. Disallow loop exit blocks from being shared byChris Lattner2006-02-111-4/+7
| | | | | | loops and their subloops. llvm-svn: 26118
* Prevent certain nodes that have already been selected from being folded intoEvan Cheng2006-02-111-19/+40
| | | | | | | | X86 addressing mode. Currently we do not allow any node whose target node produces a chain as well as any node that is at the root of the addressing mode expression tree. llvm-svn: 26117
* remove dead exprChris Lattner2006-02-111-1/+0
| | | | llvm-svn: 26116
* Reorg for integration with gcc4. Old style debug info will not be passed thoughJim Laskey2006-02-113-193/+436
| | | | | | to SelIDAG. llvm-svn: 26115
* implement unswitching of loops with switch stmts and selects in themChris Lattner2006-02-111-94/+135
| | | | llvm-svn: 26114
OpenPOWER on IntegriCloud