From: Kazu Hirata <kazu@cs.umass.edu>
Date: Sun, 23 Jan 2005 20:13:00 +0000 (+0000)
Subject: * cfganal.c: Fix a reference to Harvey's paper.
X-Git-Tag: releases/gcc-4.0.0~1333
X-Git-Url: http://git.ipfire.org/?a=commitdiff_plain;h=708bde14eaf5568ecc2fdb23a4cb15762f117f7c;p=thirdparty%2Fgcc.git

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

From-SVN: r94126
---

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 22fe3fe8358e..f40756db6fc9 100644
--- 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 3aa774f7fe4d..f23225352439 100644
--- 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