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
/
DataStructure
/
DataStructure.cpp
Age
Commit message (
Expand
)
Author
2003-03-03
Don't apply type information to load instructions if it will cause collapsing
Chris Lattner
2003-02-14
Fix resolution of indirect function calls... whoops
Chris Lattner
2003-02-14
- Eliminate provably non-pointer nodes from graphs.
Chris Lattner
2003-02-13
Move node forwarding code from being inlined to being out-of-line.
Chris Lattner
2003-02-11
Implement a "union-findy" version of DS-Analysis, which eliminates the
Chris Lattner
2003-02-10
Modest speedup which seems to help steens quite a bit on large graphs
Chris Lattner
2003-02-10
Fix problem breaking GAP, use hasNoReferrers more
Chris Lattner
2003-02-09
* Fix a bug where global incompleteness marking would not mark the global
Chris Lattner
2003-02-08
Add a special case for main because we know it's incoming arguments don't alias
Chris Lattner
2003-02-06
Fix an assertion failure
Chris Lattner
2003-02-05
Implement optimization for direct function call case. This dramatically
Chris Lattner
2003-02-04
Add sanity check
Chris Lattner
2003-02-03
* Fix a bug introduced in the last checkin wrt Stack markers
Chris Lattner
2003-02-03
Implement the globals graph!
Chris Lattner
2003-02-01
Fix a bug where we would delete neccesary calls in bu pass
Chris Lattner
2003-02-01
Fix a bug where we would incorrectly delete globals which had edges to alive ...
Chris Lattner
2003-02-01
Delete nodes more efficiently
Chris Lattner
2003-02-01
Remove dead nodes more efficiently
Chris Lattner
2003-02-01
Improve efficiency of aliveness traversal code
Chris Lattner
2003-02-01
Change DSGraph stuff to use hash_(set|map) instead of std::(set|map)
Chris Lattner
2003-02-01
Remove using declarations
Chris Lattner
2003-01-31
Remove globals on the bottom up pass which do not contain any information
Chris Lattner
2003-01-29
Use and implement API for graph traversals
Chris Lattner
2003-01-23
* Eliminate boolean arguments in favor of using enums
Chris Lattner
2003-01-22
Fix analysis of the Burg program
Chris Lattner
2002-12-06
Fix several related bugs in DSNode::mergeWith() caused by the
Vikram S. Adve
2002-12-05
Cute bug fix: when moving links from N to this, some links could have
Vikram S. Adve
2002-11-27
Fix logical error in TD pass: we should clear Mod/Ref bits of each caller
Vikram S. Adve
2002-11-25
Keep global nodes in each DS Graph (by forcing them to be marked live).
Vikram S. Adve
2002-11-18
Add peak memory usage measurement stuff
Chris Lattner
2002-11-12
Fix two bugs:
Chris Lattner
2002-11-11
Elimiante calls to a node with nothing in it.
Chris Lattner
2002-11-11
Mark stuff reachable by _AUX_ calls as incomplete in the BU graph
Chris Lattner
2002-11-11
Use call site mergeWith method to simplify code
Chris Lattner
2002-11-10
Fix a bug that could trigger when varargs call sites had non-matching number ...
Chris Lattner
2002-11-10
* Dramatically rework liveness evaluation.
Chris Lattner
2002-11-09
eliminate the ability to remove global nodes from deadNodeElminate... for now.
Chris Lattner
2002-11-09
Move maskNodeTypes to header file
Chris Lattner
2002-11-09
Clean up DSGraph::removeDeadNodes interface
Chris Lattner
2002-11-09
Make removeTriviallyDeadNodes a private interface of DSGraph
Chris Lattner
2002-11-09
Add initial support for a globals graph
Chris Lattner
2002-11-09
Tighten up array handling
Chris Lattner
2002-11-09
Fix warning & release build
Chris Lattner
2002-11-08
Fold arrays down to a single element. This causes huge wins on some benchmarks
Chris Lattner
2002-11-08
Allow specification of whether the call sites should be copied, AND whether
Chris Lattner
2002-11-08
- Add a bunch of checking to make sure that dead nodes are not used after they
Chris Lattner
2002-11-08
Use DSNodeHandleMap instead to be safe
Chris Lattner
2002-11-08
Add flush
Chris Lattner
2002-11-07
Instead of using a bool that constant has to be explained, use a self
Chris Lattner
2002-11-07
Implement a new mergeInGraph method, which basically factors code out of
Chris Lattner
[prev]
[next]