index
:
emscripten-fastcomp
master
LLVM with the emscripten fastcomp javascript backend
git repository hosting
about
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
lib
/
Analysis
Age
Commit message (
Expand
)
Author
2007-10-16
Template DominatorTreeBase by node type. This is the next major step towards
Owen Anderson
2007-10-06
Bindings for the verifier.
Gordon Henriksen
2007-10-03
Completely merge the implementation details of DomTree and PostDomTree.
Owen Anderson
2007-10-03
Use empty() member functions when that's what's being tested for instead
Dan Gohman
2007-10-03
Factor some code from the DomTree and PostDomTree calculate methods up into
Owen Anderson
2007-10-02
Rewrite sqrt and powi to use anyfloat. By popular demand.
Dale Johannesen
2007-09-30
Template-ize more of the DomTree internal implementation details. Only the c...
Owen Anderson
2007-09-30
Add a new DenseSet abstraction.
Chris Lattner
2007-09-29
Switch to densemap rather than std::set
Daniel Berlin
2007-09-28
Remove unneeded #include.
Owen Anderson
2007-09-28
Have PostDomTree use the newly templated DFSPass.
Owen Anderson
2007-09-28
Add sqrt and powi intrinsics for long double.
Dale Johannesen
2007-09-27
Ignore redundant constraints
Daniel Berlin
2007-09-27
Build the correct range for loops with unusual bounds. Fix from Jay Foad.
Nick Lewycky
2007-09-25
Add a newline to the end of this file.
Duncan Sands
2007-09-24
Don't execute dump unless NDEBUG isn't defined.
Bill Wendling
2007-09-24
Comment fixups
Daniel Berlin
2007-09-24
Implement offline variable substitution in order to reduce memory
Daniel Berlin
2007-09-24
Merge significant portions of the DomTree and PostDomTree implementations.
Owen Anderson
2007-09-23
Factor the calculation details for PostDomTree out of PostDominators.cpp and
Owen Anderson
2007-09-21
Add partial caching of non-local memory dependence queries. This provides a ...
Owen Anderson
2007-09-19
Add a flag to mark a dirty cache entry. This is not yet used, but will event...
Owen Anderson
2007-09-18
ooops...
Devang Patel
2007-09-16
Fix bug in andersen's related to test_and_set.
Daniel Berlin
2007-09-16
Rewrite of andersen's to be about 100x faster, cleaner, and begin to support ...
Daniel Berlin
2007-09-14
Change "tmp." to "tmp" for temporaries created by ScalarEvolutionExpander
Dan Gohman
2007-09-11
Fix a typo in memdep, which was causing PR1648.
Owen Anderson
2007-09-09
Remove an un-needed dependence query. This improves compile time marginally ...
Owen Anderson
2007-09-07
Add lengthof and endof templates that hide a lot of sizeof computations.
Owen Anderson
2007-09-06
Next round of APFloat changes.
Dale Johannesen
2007-09-05
Missing break. Patch by Wojciech Matyjewicz.
Evan Cheng
2007-08-21
Use SmallVector.
Devang Patel
2007-08-21
No need to hardcode SmallVector size.
Devang Patel
2007-08-21
Use SmallVector instead of std::vector.
Devang Patel
2007-08-20
- Use correct header for SCEV inside LoopPass.cpp
Anton Korobeynikov
2007-08-16
Cache non-local memory dependence analysis. This is a significant compile
Owen Anderson
2007-08-11
constant fold ptrtoint(inttoptr) with target data when available. This allows
Chris Lattner
2007-08-10
Do not overuse std::string. Pass around char * directly.
Devang Patel
2007-08-09
Make NonLocal and None const in the right way. :-)
Owen Anderson
2007-08-08
Add more comments to memdep.
Owen Anderson
2007-08-08
Make memdep fit in 80 cols.
Owen Anderson
2007-08-08
Change the None and NonLocal markers in memdep to be const.
Owen Anderson
2007-08-08
Handle functions with no name better.
Chris Lattner
2007-08-08
significantly speed up constant folding of calls (and thus all clients that use
Chris Lattner
2007-08-08
reimplement dfs number computation to be significantly faster. This speeds up
Chris Lattner
2007-08-07
Clean up a bunch of caching stuff in memdep. This reduces the time to run GVN
Owen Anderson
2007-08-06
Improve the accuracy of memdep for determining the dependencies of loads.
Owen Anderson
2007-08-06
This resolves a regression of BasicAA which failed to find any memory informa...
Chandler Carruth
2007-08-06
Let scalar-evolution analyze loops with an unsigned comparison for the exit
Nick Lewycky
2007-08-06
Don't assume it's safe to transform a loop just because it's dominated by any
Nick Lewycky
[next]