RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 19:52:54 +01:00
Code Issues Projects Releases Wiki Activity
5,348 Commits 4 Branches 5 Tags 704 MiB
ea424f3aff
Commit Graph

5348 Commits

This Branch
This Branch
All Branches
Author SHA1 Message Date
Chris Lattner
ea424f3aff Rename -no-* to -disable-* 
llvm-svn: 5642
 2003-02-26 20:00:41 +00:00
Chris Lattner
4e622afb23 Add new -no-aa implementation 
llvm-svn: 5641
 2003-02-26 19:57:10 +00:00
Chris Lattner
721f9fc770 Move BasicAA pass out to it's own header file 
llvm-svn: 5640
 2003-02-26 19:41:54 +00:00
Chris Lattner
374168a56e BasicAA doesn't need a public header 
llvm-svn: 5639
 2003-02-26 19:41:46 +00:00
Chris Lattner
4162adcfee Adjust to implement new AA interface 
llvm-svn: 5638
 2003-02-26 19:29:36 +00:00
Chris Lattner
4d57299049 Adjust to new AA interface 
llvm-svn: 5637
 2003-02-26 19:29:16 +00:00
Chris Lattner
92a8816086 Convert to work with new AliasAnalysis interface by conservatively assuming all pointers are arbitrarily large accesses 
llvm-svn: 5636
 2003-02-26 19:28:57 +00:00
Chris Lattner
5afbabc83b Calculate and pass load sizes to the alias analysis infrastructure 
llvm-svn: 5635
 2003-02-26 19:27:35 +00:00
Chris Lattner
d67ff79f57 Adjust to new AA interface 
Add tracking for Mod/Ref info

llvm-svn: 5634
 2003-02-26 19:27:05 +00:00
Chris Lattner
a84b1da40f - Checkin of the alias analysis work: 
* Takes into account the size of the memory reference to determine aliasing.
    * Expose mod/ref information in a more consistent way
    * BasicAA can now disambiguate A[i][1] and A[j][2] for conservative request
      sizes

llvm-svn: 5633
 2003-02-26 19:26:51 +00:00
Chris Lattner
f3a3d13d24 Tweak to work with new AA implementation 
llvm-svn: 5632
 2003-02-26 19:25:04 +00:00
Chris Lattner
8a8dc5b686 Checkin of new alias analysis interface: 
* Takes into account the size of the memory reference to determine aliasing.
  * Expose mod/ref information in a more consistent way

llvm-svn: 5631
 2003-02-26 19:24:47 +00:00
Chris Lattner
b7d52c4fa8 Allow ImmutablePass's to require other immutable passes and to be initialized 
llvm-svn: 5630
 2003-02-26 19:10:57 +00:00
Chris Lattner
7f0e8c4d31 * Un "protect" the getAnalysis<> functions 
* Add a new initializePass() method to ImmutablePass

llvm-svn: 5629
 2003-02-26 19:10:28 +00:00
Chris Lattner
f37c63bc4b Remove implemented projects 
llvm-svn: 5628
 2003-02-26 16:38:22 +00:00
Chris Lattner
63b566e303 Update programmers manual for renamed method 
llvm-svn: 5627
 2003-02-26 16:38:15 +00:00
Chris Lattner
b46d9cdbd8 Hopefully final tweak to this testcase 
llvm-svn: 5626
 2003-02-26 16:18:00 +00:00
Chris Lattner
1c20fbe554 Add a new test for basicaa 
llvm-svn: 5625
 2003-02-25 21:43:37 +00:00
Chris Lattner
ce3e651af6 Fix typeo 
llvm-svn: 5624
 2003-02-25 21:14:59 +00:00
Chris Lattner
b1aeaf7efb Remove wierd case that can never happen 
llvm-svn: 5623
 2003-02-25 20:27:09 +00:00
Chris Lattner
38e874dd6e Add new helper template function 
llvm-svn: 5622
 2003-02-25 00:00:50 +00:00
Chris Lattner
953428667f Fix testcase 
llvm-svn: 5621
 2003-02-24 23:14:07 +00:00
Chris Lattner
497c0d443c Rename Instruction::hasSideEffects() -> mayWriteToMemory() 
llvm-svn: 5620
 2003-02-24 20:48:32 +00:00
Chris Lattner
f2009dbddb This is a substantial rewrite of the AliasSetTracker class which now uses 
a union-find based algorithm, is significantly faster, and is more general.
It will also scale to handle call instructions correctly, which is a nice
added bonus.

This includes a new pass -print-alias-sets which can be used to show how
alias sets are formed for a particular analysis.

llvm-svn: 5619
 2003-02-24 20:37:56 +00:00
Chris Lattner
caba6cfcf5 Initial checkin of CallSite wrapper for Call/Invoke instructions 
llvm-svn: 5618
 2003-02-24 20:35:45 +00:00
Chris Lattner
6563942b6e Fix test 
llvm-svn: 5617
 2003-02-24 20:30:14 +00:00
Chris Lattner
f170a0d80f Make printing messages nicer 
llvm-svn: 5616
 2003-02-24 20:07:54 +00:00
Chris Lattner
a54b810eeb Fix #endif 
llvm-svn: 5615
 2003-02-24 04:40:35 +00:00
Chris Lattner
e037ba8cde Add support for the slist extension 
llvm-svn: 5614
 2003-02-24 04:31:49 +00:00
Chris Lattner
1c1f11bd3f Initial implementation of Loop invariant memory->scalar promotion 
llvm-svn: 5613
 2003-02-24 03:52:32 +00:00
Chris Lattner
722477c317 Tweak testcase 
llvm-svn: 5612
 2003-02-24 03:52:13 +00:00
Chris Lattner
a124de5ec6 New testcase for scalar promotion 
llvm-svn: 5611
 2003-02-24 03:52:04 +00:00
Chris Lattner
2e4c1c8640 Split mem2reg promotion into two parts: a function which does the work, and 
a pass which wraps the function.  This allows other passes to use the functionality

llvm-svn: 5610
 2003-02-22 23:57:48 +00:00
Chris Lattner
74aa1f8c03 Add a new interface file for the PromoteMemToReg interface in the Utils library 
llvm-svn: 5609
 2003-02-22 23:04:52 +00:00
Chris Lattner
283d117dad Clean up std namespace references 
llvm-svn: 5608
 2003-02-22 22:25:17 +00:00
Chris Lattner
ab3dd0580e New testcase to check to see if LICM is performing scalar promotion 
llvm-svn: 5607
 2003-02-22 22:20:19 +00:00
Chris Lattner
4c2012352d Dramatically simplify building of natural loops and fix a bug where the BBMap 
was not correctly computed.

llvm-svn: 5606
 2003-02-22 21:33:11 +00:00
Chris Lattner
1fc8307d2a Fix the requisite bug that I introduced 
llvm-svn: 5605
 2003-02-20 00:28:00 +00:00
Chris Lattner
92bf8c2754 Fix 80 character formatting 
llvm-svn: 5604
 2003-02-20 00:18:07 +00:00
Chris Lattner
97d323caea Fix bug: 2003-02-19-LoopInfoNestingBug.ll 
llvm-svn: 5603
 2003-02-20 00:17:17 +00:00
Chris Lattner
4b5d31d431 Add a testcase for broken loopinfo 
llvm-svn: 5602
 2003-02-20 00:09:26 +00:00
Chris Lattner
eb50d964a6 Make tests rerun if analyze is rebuilt 
llvm-svn: 5601
 2003-02-20 00:09:19 +00:00
Chris Lattner
f646ce5421 Fix warnings compiling C files 
llvm-svn: 5600
 2003-02-19 22:12:20 +00:00
Chris Lattner
876f0342b4 Remove support for memset 
llvm-svn: 5599
 2003-02-18 20:42:15 +00:00
Chris Lattner
adb111cdfe Add lots of functions 
llvm-svn: 5598
 2003-02-18 20:42:07 +00:00
Chris Lattner
c24ffa9297 4 new transformations: 
* X*C + X --> X * (C+1)
  * X + X*C --> X * (C+1)
  * X - X*C --> X * (1-C)
  * X*C - X --> X * (C-1)

llvm-svn: 5592
 2003-02-18 19:57:07 +00:00
Chris Lattner
1954ecb19d Add new testcases 
llvm-svn: 5591
 2003-02-18 19:55:31 +00:00
Chris Lattner
6adec31e9a Modernize testcase 
llvm-svn: 5590
 2003-02-18 19:43:53 +00:00
Chris Lattner
d94a9168ae Modernize testcases 
llvm-svn: 5589
 2003-02-18 19:43:21 +00:00
Chris Lattner
1759ccff2b test for a variety of new transformations: 
* A & ~A == 0
  * A / (2^c) == A >> c  if unsigned
  * 0 / A == 0
  * 1.0 * A == A
  * A * (2^c) == A << c
  * A ^ ~A == -1
  * A | ~A == -1
  * 0 % X = 0
  * A % (2^c) == A & (c-1) if unsigned
  * A - (A & B) == A & ~B
  * -1 - A == ~A

llvm-svn: 5588
 2003-02-18 19:28:47 +00:00