maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity
23,202 Commits 23 Branches 0 Tags 2.2 GiB
Commit Graph

23202 Commits

Author SHA1 Message Date
Chris Lattner e50c092b7c Add basic hazard recognizer support. noop insertion isn't complete yet though. 
llvm-svn: 26558
 2006-03-05 22:45:01 +00:00
Andrew Lenharth ef9aa1294a For transforms the behave differently if main goes away, add an option to prevent bugpoint from removing main 
llvm-svn: 26557
 2006-03-05 22:21:36 +00:00
Jeff Cohen 55e2aac24b Fix VC++ compilation error. 
llvm-svn: 26554
 2006-03-05 21:43:37 +00:00
Jim Laskey af25c7e4f3 Breathe some life into a comment. 
llvm-svn: 26553
 2006-03-05 21:20:20 +00:00
Chris Lattner 98ecb8ec61 Split the list scheduler into top-down and bottom-up pieces. The priority 
function of the top-down scheduler are completely bogus currently, and
having (future) PPC specific in this file is also wrong, but this is a
small incremental step.

llvm-svn: 26552
 2006-03-05 21:10:33 +00:00
Chris Lattner 1b59b09b6b Add a new scheduling type. This is, of course, a hack. Proper factoring 
will come later.

llvm-svn: 26551
 2006-03-05 21:08:06 +00:00
Chris Lattner 7a36d97518 Move the available queue to being inside the ListSchedule method, since it 
bounds its lifetime.

llvm-svn: 26550
 2006-03-05 20:21:55 +00:00
Chris Lattner 5032c32d30 add a note 
llvm-svn: 26549
 2006-03-05 20:00:08 +00:00
Chris Lattner bdaf4f38b5 Reinstate this now that the offending opposite xform has been removed. 
llvm-svn: 26548
 2006-03-05 19:53:55 +00:00
Chris Lattner c726a5c31f Do not fold (add (shl x, c1), (shl c2, c1)) -> (shl (add x, c2), c1), 
we want to canonicalize the other way.

llvm-svn: 26547
 2006-03-05 19:52:57 +00:00
Chris Lattner c610e62e46 print arbitrary constant pool entries 
llvm-svn: 26545
 2006-03-05 09:38:03 +00:00
Evan Cheng d428e22c07 Back out fold (shl (add x, c1), c2) -> (add (shl x, c2), c1<<c2) for now. 
It's causing an infinite loop compiling ldecod on x86 / Darwin.

llvm-svn: 26544
 2006-03-05 07:30:16 +00:00
Chris Lattner 3bc4050217 Add some simple copysign folds 
llvm-svn: 26543
 2006-03-05 05:30:57 +00:00
Chris Lattner 5c1ba2ac08 Codegen copysign[f] into a FCOPYSIGN node 
llvm-svn: 26542
 2006-03-05 05:09:38 +00:00
Chris Lattner 9c7f50376a Copysign needs to be expanded everywhere. Note that Alpha and IA64 should 
implement copysign as a native op if they have it.

llvm-svn: 26541
 2006-03-05 05:08:37 +00:00
Chris Lattner 7373ddbe77 Add a copysign node 
llvm-svn: 26540
 2006-03-05 05:06:40 +00:00
Chris Lattner c2dd7aae71 add a note for something evan noticed 
llvm-svn: 26539
 2006-03-05 01:15:18 +00:00
Chris Lattner 6bc98653c2 Make vector narrowing more effective, implementing 
Transforms/InstCombine/vec_narrow.ll.  This add support for narrowing
extract_element(insertelement) also.

llvm-svn: 26538
 2006-03-05 00:22:33 +00:00
Chris Lattner 818c54925e new testcase for vector narrowing. 
llvm-svn: 26537
 2006-03-05 00:21:28 +00:00
Chris Lattner 8d8b4cf63d Implemented. 
llvm-svn: 26536
 2006-03-04 23:33:44 +00:00
Chris Lattner f29f5204cc fold (mul (add x, c1), c2) -> (add (mul x, c2), c1*c2) 
fold (shl (add x, c1), c2) -> (add (shl x, c2), c1<<c2)

This allows us to compile CodeGen/PowerPC/addi-reassoc.ll into:

_test1:
        slwi r2, r4, 4
        add r2, r2, r3
        lwz r3, 36(r2)
        blr
_test2:
        mulli r2, r4, 5
        add r2, r2, r3
        lbz r2, 11(r2)
        extsb r3, r2
        blr

instead of:

_test1:
        addi r2, r4, 2
        slwi r2, r2, 4
        add r2, r3, r2
        lwz r3, 4(r2)
        blr
_test2:
        addi r2, r4, 2
        mulli r2, r2, 5
        add r2, r3, r2
        lbz r2, 1(r2)
        extsb r3, r2
        blr

llvm-svn: 26535
 2006-03-04 23:33:26 +00:00
Chris Lattner ca7e9664a7 new testcase 
llvm-svn: 26534
 2006-03-04 23:31:49 +00:00
Chris Lattner 3e19c23765 Fix a crash compiling Obsequi 
llvm-svn: 26529
 2006-03-04 21:48:01 +00:00
Chris Lattner f97c7f5dbb new testcase 
llvm-svn: 26525
 2006-03-04 09:35:02 +00:00
Chris Lattner 4c065091d8 Add factoring of multiplications, e.g. turning A*A+A*B into A*(A+B). 
Testcase here: Transforms/Reassociate/mulfactor.ll

llvm-svn: 26524
 2006-03-04 09:31:13 +00:00
Chris Lattner c9a318d8fa Add a note 
llvm-svn: 26523
 2006-03-04 08:44:51 +00:00
Chris Lattner adf5ec6f96 Regenerate 
llvm-svn: 26522
 2006-03-04 07:53:41 +00:00
Chris Lattner a33bcff313 Don't use invalidated iterators! 
llvm-svn: 26521
 2006-03-04 07:53:16 +00:00
Evan Cheng c66fd44541 Add an entry 
llvm-svn: 26520
 2006-03-04 07:49:50 +00:00
Chris Lattner 32c01df299 Canonicalize (X+C1)*C2 -> X*C2+C1*C2 
This implements Transforms/InstCombine/add.ll:test31

llvm-svn: 26519
 2006-03-04 06:04:02 +00:00
Chris Lattner ba66f8e1ad new testcase 
llvm-svn: 26518
 2006-03-04 06:02:36 +00:00
Evan Cheng 6dc73297c3 MEMSET / MEMCPY lowering bugs: we can't issue a single WORD / DWORD version of 
rep/stos and rep/mov if the count is not a constant. We could do
  rep/stosl; and $count, 3; rep/stosb
For now, I will lower them to memset / memcpy calls. We will revisit this after
a little bit experiment.

Also need to take care of the trailing bytes even if the count is a constant.
Since the max. number of trailing bytes are 3, we will simply issue loads /
stores.

llvm-svn: 26517
 2006-03-04 02:48:56 +00:00
Jeff Cohen 56b4b49c69 Keep Visual Studio happy. 
llvm-svn: 26516
 2006-03-04 02:19:46 +00:00
Chris Lattner 071faf25e0 Be more conservative with our symbolic alias analysis. In particular, 
don't assume that A[1][0] and A[0][i] can't alias.  "i" might be out of
range, or even negative.  This fixes a miscompilation of 188.ammp (which
does bad pointer tricks) with the new CFE.

Testcase here: Analysis/BasicAA/2006-03-03-BadArraySubscript.ll

llvm-svn: 26515
 2006-03-04 02:06:34 +00:00
Chris Lattner 05285fbf5b new testcase 
llvm-svn: 26514
 2006-03-04 02:05:07 +00:00
Chris Lattner e43e5c0697 add a note 
llvm-svn: 26513
 2006-03-04 01:19:34 +00:00
Evan Cheng 084a102b17 Typo 
llvm-svn: 26512
 2006-03-04 01:12:00 +00:00
Chris Lattner efef036443 New testcase, make sure nate doesn't vanish 
llvm-svn: 26511
 2006-03-04 00:47:12 +00:00
Chris Lattner 5316e5d6ff Spec change: the size of a memset/memcpy/memmove is not required to be aligned 
to the alignment argument.

llvm-svn: 26510
 2006-03-04 00:02:10 +00:00
Jim Laskey c44f05d624 Added support for dwarf block data entries. 
llvm-svn: 26509
 2006-03-03 21:00:14 +00:00
Chris Lattner ae0f1512c9 Silence a warning. 
llvm-svn: 26508
 2006-03-03 19:34:28 +00:00
Evan Cheng 9929793411 Add another test case for instruction scheduling. 
llvm-svn: 26507
 2006-03-03 18:58:09 +00:00
Chris Lattner c2de4f3dc1 Unbreak autouprade of llvm.sqrt, simplify some code. 
llvm-svn: 26506
 2006-03-03 16:31:22 +00:00
Jim Laskey 88f0fe15a2 Adding basic structure support. 
llvm-svn: 26505
 2006-03-03 15:06:57 +00:00
Evan Cheng 3bf916ddd9 Add more vector NodeTypes: VSDIV, VUDIV, VAND, VOR, and VXOR. 
llvm-svn: 26504
 2006-03-03 07:01:07 +00:00
Evan Cheng a7fb285c60 Number of NodeTypes now exceeds 128. 
llvm-svn: 26503
 2006-03-03 06:58:59 +00:00
Evan Cheng 23e75f5b49 SDOperand::isOperand should not be a forwarding. It must check *this against N's operands. 
llvm-svn: 26502
 2006-03-03 06:42:32 +00:00
Evan Cheng 6b08ae8497 Added isOperand(N): true if this is an operand of N 
llvm-svn: 26501
 2006-03-03 06:24:54 +00:00
Evan Cheng 5e9a695026 A bit more tweaking 
llvm-svn: 26500
 2006-03-03 06:23:43 +00:00
Chris Lattner f6e846eee8 Fix pasteo 
llvm-svn: 26499
 2006-03-03 06:13:41 +00:00