* cfganal.c: Fix a reference to Harvey's paper.

From-SVN: r94126

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 22fe3fe8358e6db8acfc24974d65247cfaada0e9..f40756db6fc9ecf2724e7223fe1f411438eb0f12 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -2,6 +2,8 @@
 
        * flow.c (regset_bytes, regset_size): Remove.
 
+       * cfganal.c: Fix a reference to Harvey's paper.
+
 2005-01-23  Steven Bosscher  <stevenb@suse.de>
 
        PR rtl-optimization/19464

diff --git a/gcc/cfganal.c b/gcc/cfganal.c
index 3aa774f7fe4dba4944735d188825b8cad8e2dc5e..f23225352439c87127db78d4c66b2414507a145c 100644 (file)
--- a/gcc/cfganal.c
+++ b/gcc/cfganal.c
@@ -936,7 +936,7 @@ dfs_enumerate_from (basic_block bb, int reverse,
 /* Compute dominance frontiers, ala Harvey, Ferrante, et al.
    
    This algorithm can be found in Timothy Harvey's PhD thesis, at
-   http://www.cs.rice.edu/~harv/thesis.pdf in the section on iterative
+   http://www.cs.rice.edu/~harv/dissertation.pdf in the section on iterative
    dominance algorithms.
 
    First, we identify each join point, j (any node with more than one