summaryrefslogtreecommitdiffstats
Commit message (Collapse)AuthorAgeFilesLines
* Add a simple xform to simplify array accesses with casts in the way.Chris Lattner2005-09-131-2/+62
| | | | | | | This is useful for 178.galgel where resolution of dope vectors (by the optimizer) causes the scales to become apparent. llvm-svn: 23328
* Fix an issue where LSR would miss rewriting a use of an IV expression by a ↵Chris Lattner2005-09-131-4/+8
| | | | | | | | | PHI node that is not the original PHI. This fixes up a dot-product loop in galgel, speeding it up from 18.47s to 16.13s. llvm-svn: 23327
* fails since linux-itanium headers are DifferentDuraid Madina2005-09-131-1/+1
| | | | llvm-svn: 23326
* Add a helper function, allowing us to simplify some code a bit, changingChris Lattner2005-09-131-39/+47
| | | | | | indentation, no functionality change llvm-svn: 23325
* Implement a simple xform to turn code like this:Chris Lattner2005-09-121-0/+66
| | | | | | | | | if () { store A -> P; } else { store B -> P; } into a PHI node with one store, in the most trival case. This implements load.ll:test10. llvm-svn: 23324
* new testcaseChris Lattner2005-09-121-0/+14
| | | | llvm-svn: 23323
* Another load-peephole optimization: do gcse when two loads are next toChris Lattner2005-09-121-2/+5
| | | | | | each other. This implements InstCombine/load.ll:test9 llvm-svn: 23322
* new testcaseChris Lattner2005-09-121-0/+7
| | | | llvm-svn: 23321
* Implement a trivial form of store->load forwarding where the store and theChris Lattner2005-09-121-0/+9
| | | | | | | | load are exactly consequtive. This is picked up by other passes, but this triggers thousands of times in fortran programs that use static locals (and is thus a compile-time speedup). llvm-svn: 23320
* new testcaseChris Lattner2005-09-121-0/+6
| | | | llvm-svn: 23319
* Fix a regression from last night, which caused this pass to create invalidChris Lattner2005-09-121-8/+6
| | | | | | | | | | | | code for IV uses outside of loops that are not dominated by the latch block. We should only convert these uses to use the post-inc value if they ARE dominated by the latch block. Also use a new LoopInfo method to simplify some code. This fixes Transforms/LoopStrengthReduce/2005-09-12-UsesOutOutsideOfLoop.ll llvm-svn: 23318
* relax pattern match on nameChris Lattner2005-09-121-1/+1
| | | | llvm-svn: 23317
* new testcaseChris Lattner2005-09-121-0/+43
| | | | llvm-svn: 23316
* Add a new getLoopLatch() method.Chris Lattner2005-09-121-1/+25
| | | | llvm-svn: 23315
* new methodChris Lattner2005-09-121-0/+6
| | | | llvm-svn: 23314
* _test:Chris Lattner2005-09-121-5/+19
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | li r2, 0 LBB_test_1: ; no_exit.2 li r5, 0 stw r5, 0(r3) addi r2, r2, 1 addi r3, r3, 4 cmpwi cr0, r2, 701 blt cr0, LBB_test_1 ; no_exit.2 LBB_test_2: ; loopexit.2.loopexit addi r2, r2, 1 stw r2, 0(r4) blr [zion ~/llvm]$ cat > ~/xx Uses of IV's outside of the loop should use hte post-incremented version of the IV, not the preincremented version. This helps many loops (e.g. in sixtrack) which used to generate code like this (this is the code from the dont-hoist-simple-loop-constants.ll testcase): _test: li r2, 0 **** IV starts at 0 LBB_test_1: ; no_exit.2 or r5, r2, r2 **** Copy for loop exit li r2, 0 stw r2, 0(r3) addi r3, r3, 4 addi r2, r5, 1 addi r6, r5, 2 **** IV+2 cmpwi cr0, r6, 701 blt cr0, LBB_test_1 ; no_exit.2 LBB_test_2: ; loopexit.2.loopexit addi r2, r5, 2 **** IV+2 stw r2, 0(r4) blr And now generated code like this: _test: li r2, 1 *** IV starts at 1 LBB_test_1: ; no_exit.2 li r5, 0 stw r5, 0(r3) addi r2, r2, 1 addi r3, r3, 4 cmpwi cr0, r2, 701 *** IV.postinc + 0 blt cr0, LBB_test_1 LBB_test_2: ; loopexit.2.loopexit stw r2, 0(r4) *** IV.postinc + 0 blr llvm-svn: 23313
* new testcaseChris Lattner2005-09-121-0/+28
| | | | llvm-svn: 23312
* RegenerateChris Lattner2005-09-123-1193/+1642
| | | | llvm-svn: 23311
* Rearrange two rules, which apparently makes some versions of bison happier.Chris Lattner2005-09-121-15/+15
| | | | llvm-svn: 23310
* Make sure to disable 64-bit extensions for this testChris Lattner2005-09-111-1/+1
| | | | llvm-svn: 23309
* Fix more Visual Studio build problems.Jeff Cohen2005-09-101-0/+6
| | | | llvm-svn: 23308
* Fix miscellaneous Visual Studio build problems.Jeff Cohen2005-09-103-1/+9
| | | | llvm-svn: 23307
* implement Transforms/LoopStrengthReduce/dont-hoist-simple-loop-constants.ll.Chris Lattner2005-09-101-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | We used to emit this code for it: _test: li r2, 1 ;; Value tying up a register for the whole loop li r5, 0 LBB_test_1: ; no_exit.2 or r6, r5, r5 li r5, 0 stw r5, 0(r3) addi r5, r6, 1 addi r3, r3, 4 add r7, r2, r5 ;; should be addi r7, r5, 1 cmpwi cr0, r7, 701 blt cr0, LBB_test_1 ; no_exit.2 LBB_test_2: ; loopexit.2.loopexit addi r2, r6, 2 stw r2, 0(r4) blr now we emit this: _test: li r2, 0 LBB_test_1: ; no_exit.2 or r5, r2, r2 li r2, 0 stw r2, 0(r3) addi r3, r3, 4 addi r2, r5, 1 addi r6, r5, 2 ;; whoa, fold those adds! cmpwi cr0, r6, 701 blt cr0, LBB_test_1 ; no_exit.2 LBB_test_2: ; loopexit.2.loopexit addi r2, r5, 2 stw r2, 0(r4) blr more improvement coming. llvm-svn: 23306
* new testcaseChris Lattner2005-09-101-0/+24
| | | | llvm-svn: 23305
* PowerPC cannot truncstore i1 nativelyChris Lattner2005-09-103-2/+3
| | | | llvm-svn: 23304
* Allow targets to say they don't support truncstore i1 (which includes a maskChris Lattner2005-09-101-2/+15
| | | | | | when storing to an 8-bit memory location), as most don't. llvm-svn: 23303
* Add a missing #include, patch courtesy of Baptiste Lepilleur.Chris Lattner2005-09-091-0/+1
| | | | llvm-svn: 23302
* Fix a problem duraid encountered on itanium where this folding:Chris Lattner2005-09-091-2/+6
| | | | | | | select (x < y), 1, 0 -> (x < y) incorrectly: the setcc returns i1 but the select returned i32. Add the zero extend as needed. llvm-svn: 23301
* Fix a crash viewing dags that have target nodes in themChris Lattner2005-09-091-1/+2
| | | | llvm-svn: 23300
* I forgot that we always spill fp values as 64-bits. Implement spill foldingChris Lattner2005-09-091-3/+10
| | | | | | for FP as well. This triggers a couple dozen times on 177.mesa (for example). llvm-svn: 23299
* Fix a problem that Nate noticed, where spill code was not getting coallescedChris Lattner2005-09-092-0/+32
| | | | | | | | | | | | | | | | | | | | | with copies, leading to code like this: lwz r4, 380(r1) or r10, r4, r4 ;; Last use of r4 By teaching the PPC backend how to fold spills into copies, we now get this code: lwz r10, 380(r1) wow. :) This reduces a testcase nate sent me from 1505 instructions to 1484. Note that this could handle FP values but doesn't currently, for reasons mentioned in the patch llvm-svn: 23298
* code cleanupChris Lattner2005-09-091-2/+3
| | | | llvm-svn: 23297
* Use continue in the use-processing loop to make it clear what the early exitsChris Lattner2005-09-091-115/+123
| | | | | | | | | are, simplify logic, and cause things to not be nested as deeply. This also uses MRI->areAliases instead of an explicit loop. No functionality change, just code cleanup. llvm-svn: 23296
* Last round of 2-node folds from SD.cpp. Will move on to 3 node ops suchNate Begeman2005-09-092-2/+107
| | | | | | as setcc and select next. llvm-svn: 23295
* remove debugging code *slaps head*Chris Lattner2005-09-091-1/+0
| | | | llvm-svn: 23294
* When spilling a live range that is used multiple times by one instruction,Chris Lattner2005-09-091-9/+26
| | | | | | | | only add a reload live range once for the instruction. This is one step towards fixing a regalloc pessimization that Nate notice, but is later undone by the spiller (so no code is changed). llvm-svn: 23293
* Teach the code generator that rlwimi is commutable if the rotate amountChris Lattner2005-09-093-1/+38
| | | | | | | | is zero. This lets the register allocator elide some copies in some cases. This implements CodeGen/PowerPC/rlwimi-commute.ll llvm-svn: 23292
* Added targets to speed up build of llc.Jim Laskey2005-09-091-2/+309
| | | | llvm-svn: 23291
* New testcase, neither should require a register-register copyChris Lattner2005-09-091-0/+26
| | | | llvm-svn: 23290
* add an accessor to provide more checkingChris Lattner2005-09-092-5/+9
| | | | llvm-svn: 23289
* use new accessors to simplify code. Add checking to make sure top-level instrChris Lattner2005-09-091-4/+12
| | | | | | definitions are void llvm-svn: 23288
* add some accessorsChris Lattner2005-09-091-0/+2
| | | | llvm-svn: 23287
* Introduce two new concepts:Chris Lattner2005-09-091-11/+75
| | | | | | | | | | | | | | 1. Add support for defining Pattern's, which can match expressions when there is no instruction that directly implements something. Instructions usually implicitly define patterns. 2. Add support for defining SDNodeXForm's, which are node transformations. This seperates the concept of a node xform out from the existing predicate support. Using this new stuff, we add a few instruction patterns, one for testing, and two for OR/XOR by an arbitrary immediate. llvm-svn: 23286
* Fix incorrect commentChris Lattner2005-09-081-3/+2
| | | | llvm-svn: 23285
* Implement a complete type inference system for dag patterns, based on theChris Lattner2005-09-082-13/+234
| | | | | | | | | | | | | | | constraints defined in the DAG node definitions in the .td files. This allows us to infer (and check!) the types for all nodes in the current ppc .td file. For example, instead of: Inst pattern EQV: (set GPRC:i32:$rT, (xor (xor GPRC:i32:$rA, GPRC:i32:$rB), (imm)<<Predicate_immAllOnes>>)) we now fully infer: Inst pattern EQV: (set:void GPRC:i32:$rT, (xor:i32 (xor:i32 GPRC:i32:$rA, GPRC:i32:$rB), (imm:i32)<<Predicate_immAllOnes>>)) from: (set GPRC:$rT, (not (xor GPRC:$rA, GPRC:$rB))) llvm-svn: 23284
* whitespace/comment changes, no functionality diffsChris Lattner2005-09-081-2/+5
| | | | llvm-svn: 23283
* Compute the value types that are natively supported by a target.Chris Lattner2005-09-083-2/+25
| | | | llvm-svn: 23282
* Parse information about type constraints on SDNodesChris Lattner2005-09-082-0/+71
| | | | llvm-svn: 23281
* use node info in the one place we currently use itChris Lattner2005-09-081-1/+1
| | | | llvm-svn: 23280
* start parsing SDNode info recordsChris Lattner2005-09-082-0/+39
| | | | llvm-svn: 23279
OpenPOWER on IntegriCloud