From 708bde14eaf5568ecc2fdb23a4cb15762f117f7c Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Sun, 23 Jan 2005 20:13:00 +0000 Subject: [PATCH] * cfganal.c: Fix a reference to Harvey's paper. From-SVN: r94126 --- gcc/ChangeLog | 2 ++ gcc/cfganal.c | 2 +- 2 files changed, 3 insertions(+), 1 deletion(-) 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 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 -- 2.47.2