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
34,861 Commits 4 Branches 5 Tags 704 MiB
d292b1c096
Commit Graph

1616 Commits

Author SHA1 Message Date
Owen Anderson
43fefb53a6 Template DominatorTreeBase by node type. This is the next major step towards 
having dominator information on MBB's.

llvm-svn: 43036
 2007-10-16 19:59:25 +00:00
Gordon Henriksen
06eeba26c1 Bindings for the verifier. 
llvm-svn: 42707
 2007-10-06 21:00:36 +00:00
Owen Anderson
cb51170957 Completely merge the implementation details of DomTree and PostDomTree. 
Also, add a FIXME for a bug in PostDomTree calculation I noticed while writing this,

llvm-svn: 42593
 2007-10-03 21:25:45 +00:00
Dan Gohman
30ba45b569 Use empty() member functions when that's what's being tested for instead 
of comparing begin() and end().

llvm-svn: 42585
 2007-10-03 19:26:29 +00:00
Owen Anderson
91e23d710c Factor some code from the DomTree and PostDomTree calculate methods up into 
each one's runOnFunction method.

llvm-svn: 42563
 2007-10-03 03:20:17 +00:00
Dale Johannesen
a4e3643cb3 Rewrite sqrt and powi to use anyfloat. By popular demand. 
llvm-svn: 42537
 2007-10-02 17:43:59 +00:00
Owen Anderson
09ba812a80 Template-ize more of the DomTree internal implementation details. Only the calculate() methods for DomTree and PostDomTree remain to be merged/template-ized. 
llvm-svn: 42476
 2007-09-30 04:17:16 +00:00
Chris Lattner
1654385fd0 Add a new DenseSet abstraction. 
llvm-svn: 42474
 2007-09-30 00:47:20 +00:00
Daniel Berlin
90642519e9 Switch to densemap rather than std::set 
llvm-svn: 42462
 2007-09-29 00:50:40 +00:00
Owen Anderson
bc2f1ab49d Remove unneeded #include. 
llvm-svn: 42428
 2007-09-28 01:25:07 +00:00
Owen Anderson
a533c458f5 Have PostDomTree use the newly templated DFSPass. 
llvm-svn: 42427
 2007-09-28 01:23:47 +00:00
Dale Johannesen
e61886cee4 Add sqrt and powi intrinsics for long double. 
llvm-svn: 42423
 2007-09-28 01:08:20 +00:00
Daniel Berlin
b3d303b103 Ignore redundant constraints 
llvm-svn: 42397
 2007-09-27 15:42:23 +00:00
Nick Lewycky
a44e458ddc Build the correct range for loops with unusual bounds. Fix from Jay Foad. 
llvm-svn: 42394
 2007-09-27 14:12:54 +00:00
Duncan Sands
db0b588ea2 Add a newline to the end of this file. 
llvm-svn: 42314
 2007-09-25 20:08:48 +00:00
Bill Wendling
9390abcf16 Don't execute dump unless NDEBUG isn't defined. 
llvm-svn: 42280
 2007-09-24 22:43:48 +00:00
Daniel Berlin
f6cb4c3d65 Comment fixups 
llvm-svn: 42279
 2007-09-24 22:20:45 +00:00
Daniel Berlin
f900d1295f Implement offline variable substitution in order to reduce memory 
and time usage.
Fixup operator == to make this work, and add a resize method to DenseMap
so we can resize our hashtable once we know how big it should be.

llvm-svn: 42269
 2007-09-24 19:45:49 +00:00
Owen Anderson
a0a11ee8b9 Merge significant portions of the DomTree and PostDomTree implementations. 
The two remaining unmerged parts are DFSPass, and the Calculate().

llvm-svn: 42255
 2007-09-24 02:29:29 +00:00
Owen Anderson
bc099e74d8 Factor the calculation details for PostDomTree out of PostDominators.cpp and 
into a separate header file.

Next step: merging PostDominatorCalculation.h with DominatorCalculation.h.

llvm-svn: 42251
 2007-09-23 22:21:00 +00:00
Owen Anderson
9070cf6dea Add partial caching of non-local memory dependence queries. This provides a modest 
speedup for GVN.

llvm-svn: 42185
 2007-09-21 03:53:52 +00:00
Owen Anderson
5454d4cbc9 Add a flag to mark a dirty cache entry. This is not yet used, but will eventually 
help non-local memdep caching.

llvm-svn: 42137
 2007-09-19 16:13:57 +00:00
Devang Patel
d9c8d99cac ooops... 
llvm-svn: 42118
 2007-09-18 23:58:14 +00:00
Daniel Berlin
d44b2016ca Fix bug in andersen's related to test_and_set. 
Add operator == and != to SparseBitVector.
Simplify code for test_and_set

llvm-svn: 42018
 2007-09-16 23:59:53 +00:00
Daniel Berlin
3625ac77e4 Rewrite of andersen's to be about 100x faster, cleaner, and begin to support field sensitivity 
llvm-svn: 42016
 2007-09-16 21:45:02 +00:00
Dan Gohman
5f29ab68e1 Change "tmp." to "tmp" for temporaries created by ScalarEvolutionExpander 
for consistency with many other transforms.

llvm-svn: 41957
 2007-09-14 20:11:40 +00:00
Owen Anderson
3a7df6cf67 Fix a typo in memdep, which was causing PR1648. 
llvm-svn: 41833
 2007-09-11 04:31:00 +00:00
Owen Anderson
ab8a978ed7 Remove an un-needed dependence query. This improves compile time marginally on 401.bzip2. 
llvm-svn: 41792
 2007-09-09 21:43:49 +00:00
Owen Anderson
4b71e55287 Add lengthof and endof templates that hide a lot of sizeof computations. 
Patch by Sterling Stein!

llvm-svn: 41758
 2007-09-07 04:06:50 +00:00
Dale Johannesen
86f367a6b7 Next round of APFloat changes. 
Use APFloat in UpgradeParser and AsmParser.
Change all references to ConstantFP to use the
APFloat interface rather than double.  Remove
the ConstantFP double interfaces.
Use APFloat functions for constant folding arithmetic
and comparisons.
(There are still way too many places APFloat is
just a wrapper around host float/double, but we're
getting there.)

llvm-svn: 41747
 2007-09-06 18:13:44 +00:00
Evan Cheng
804e104123 Missing break. Patch by Wojciech Matyjewicz. 
llvm-svn: 41727
 2007-09-05 21:36:14 +00:00
Devang Patel
b86f1fdb3f Use SmallVector. 
llvm-svn: 41230
 2007-08-21 16:54:51 +00:00
Devang Patel
e92ff0baef No need to hardcode SmallVector size. 
llvm-svn: 41228
 2007-08-21 16:39:43 +00:00
Devang Patel
f06e667e9c Use SmallVector instead of std::vector. 
llvm-svn: 41207
 2007-08-21 00:31:24 +00:00
Anton Korobeynikov
4e15adaf04 - Use correct header for SCEV inside LoopPass.cpp 
- Move SCEVExpander::expand() out-of-line workarounding possible toolchain bug

llvm-svn: 41197
 2007-08-20 21:17:26 +00:00
Owen Anderson
03cbda804e Cache non-local memory dependence analysis. This is a significant compile 
time performance win in most cases.

llvm-svn: 41126
 2007-08-16 21:27:05 +00:00
Chris Lattner
afb3c33c2a constant fold ptrtoint(inttoptr) with target data when available. This allows 
us to fold the entry block of PR1602 to false instead of:

br i1 icmp eq (i32 and (i32 ptrtoint (void (%struct.S*)* inttoptr (i64
1 to void (%struct.S*)*) to i32), i32 1), i32 0), label %cond_next, label
%cond_true

llvm-svn: 41023
 2007-08-11 23:49:01 +00:00
Devang Patel
fa7277dd34 Do not overuse std::string. Pass around char * directly. 
llvm-svn: 41001
 2007-08-10 18:29:32 +00:00
Owen Anderson
3eba1e8f5c Make NonLocal and None const in the right way. :-) 
llvm-svn: 40961
 2007-08-09 04:42:44 +00:00
Owen Anderson
3db807751b Add more comments to memdep. 
llvm-svn: 40953
 2007-08-08 22:26:03 +00:00
Owen Anderson
d791c9f667 Make memdep fit in 80 cols. 
llvm-svn: 40950
 2007-08-08 22:01:54 +00:00
Owen Anderson
f988c3ee5c Change the None and NonLocal markers in memdep to be const. 
llvm-svn: 40946
 2007-08-08 21:39:39 +00:00
Chris Lattner
3e94308eb7 Handle functions with no name better. 
llvm-svn: 40926
 2007-08-08 16:07:23 +00:00
Chris Lattner
606d5bced1 significantly speed up constant folding of calls (and thus all clients that use 
ConstantFoldInstruction on calls) by avoiding Value::getName().  getName() constructs
and returns an std::string, which does heap allocation stuff.  This slightly speeds up
instcombine.

llvm-svn: 40924
 2007-08-08 06:55:43 +00:00
Chris Lattner
65d638a918 reimplement dfs number computation to be significantly faster. This speeds up 
natural loop canonicalization (which does many cfg xforms) by 4.3x, for 
example.  This also fixes a bug in postdom dfnumber computation.

llvm-svn: 40920
 2007-08-08 05:51:24 +00:00
Owen Anderson
22d94da65b Clean up a bunch of caching stuff in memdep. This reduces the time to run GVN 
on 403.gcc from ~15s to ~10s.

llvm-svn: 40884
 2007-08-07 00:33:45 +00:00
Owen Anderson
da58c95cd3 Improve the accuracy of memdep for determining the dependencies of loads. 
This brings GVN to parity with GCSE+LoadVN.

llvm-svn: 40882
 2007-08-06 23:26:03 +00:00
Chandler Carruth
67d3119773 This resolves a regression of BasicAA which failed to find any memory information for overloaded intrinsics (PR1600). This resolves that issue, and improves the matching scheme to use a BitVector rather than a binary search. 
llvm-svn: 40872
 2007-08-06 20:57:16 +00:00
Nick Lewycky
04447caa7b Let scalar-evolution analyze loops with an unsigned comparison for the exit 
condition. Fixes 1597.

llvm-svn: 40867
 2007-08-06 19:21:00 +00:00
Nick Lewycky
071a2c6a5e Don't assume it's safe to transform a loop just because it's dominated by any 
comparison. Fixes bug 1598.

llvm-svn: 40866
 2007-08-06 18:33:46 +00:00