From: Owen Anderson <resistor@mac.com>
Date: Tue, 25 Sep 2007 02:10:58 +0000 (+0000)
Subject: Fill in the sections about my contributions.
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=50fd00024ff83ada83b53a32ee3debf6038b0b1e;p=oota-llvm.git

Fill in the sections about my contributions.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42286 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/docs/ReleaseNotes.html b/docs/ReleaseNotes.html
index 69132c45053..eb8a2560516 100644
--- a/docs/ReleaseNotes.html
+++ b/docs/ReleaseNotes.html
@@ -98,9 +98,17 @@ optimizer, speeding it up and making it more aggressive</p>
 
 <ul>
 
-<li>Owen DSE and MemDep analysis</li>
-<li>Owen GVN</li>
-<li>Owen GVN-PRE, not in llvm-gcc</li>
+<li>Owen Anderson wrote the new MemoryDependenceAnalysis pass, which provides 
+    a lazy, caching layer on top of alias analysis.  He then used it to rewrite
+    DeadStoreElimination which resulted in significantly better compile time in 
+    common cases, </li>
+<li>Owen implemented the new GVN pass, which is also based on 
+    MemoryDependenceAnalysis.  This pass replaces GCSE/LoadVN in the standard
+    set of passes, providing more aggressive optimization at a some-what 
+    improved compile-time cost.</li>
+<li>Owen implemented GVN-PRE, a partial redundancy elimination algorithm that
+    shares some details with the new GVN pass.  It is still in need of compile
+    time tuning, and is not turned on by default.</li>
 <li>Devang merged ETForest and DomTree into a single easier to use data
 structure.</li>
 <li>Nick Lewycky improved loop trip count analysis to handle many more common