diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-01-23 20:13:00 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-01-23 20:13:00 +0000 |
| commit | 708bde14eaf5568ecc2fdb23a4cb15762f117f7c (patch) | |
| tree | 740da495c9d3123cbfdbe5c90cebd1fa40a69f56 /gcc/cfganal.c | |
| parent | edd517b1c5e1f43cd23d0dc5508dc6080043be7e (diff) | |
| download | gcc-708bde14eaf5568ecc2fdb23a4cb15762f117f7c.tar.gz | |
* cfganal.c: Fix a reference to Harvey's paper.
From-SVN: r94126
Diffstat (limited to 'gcc/cfganal.c')
| -rw-r--r-- | gcc/cfganal.c | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/cfganal.c b/gcc/cfganal.c index 3aa774f7fe4..f2322535243 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 |