diff options
| author | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-01-23 20:13:00 +0000 |
|---|---|---|
| committer | kazu <kazu@138bc75d-0d04-0410-961f-82ee72b054a4> | 2005-01-23 20:13:00 +0000 |
| commit | 78a1d03f08ec1ef47f8f8add8871ebae6435c6ba (patch) | |
| tree | 740da495c9d3123cbfdbe5c90cebd1fa40a69f56 /gcc/cfganal.c | |
| parent | 7debb3e74d670f773139dc3db11152b34fffa390 (diff) | |
* cfganal.c: Fix a reference to Harvey's paper.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@94126 138bc75d-0d04-0410-961f-82ee72b054a4
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 |