diff options
| -rw-r--r-- | gcc/ChangeLog | 2 | ||||
| -rw-r--r-- | gcc/cfganal.c | 2 |
2 files changed, 3 insertions, 1 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 22fe3fe..f40756d 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 3aa774f..f232253 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 |