Fix or remove broken URLs in documentation

* doc/README.cords: Remove broken link to reality.sgi.com.
* doc/README.environment: Fix link to HPL tech reports.
* doc/overview.html: Remove broken link to parcftp.xerox.com.
* doc/overview.html: Fix (or update) external links.

diff --git a/doc/README.cords b/doc/README.cords
index 0339a9a90d78b320490d70f6823b223760cb4e62..f64dd2e8b13cf3a87cb31d531b757a5b6f99cbe2 100644 (file)
--- a/doc/README.cords
+++ b/doc/README.cords
@@ -26,8 +26,7 @@ A fundamentally similar "rope" data structure is also part of SGI's standard
 template library implementation, and its descendants, which include the
 GNU C++ library.  That uses reference counting by default.
 There is a short description of that data structure at
-http://reality.sgi.com/boehm/ropeimpl.html .  (The more official location
-http://www.sgi.com/tech/stl/ropeimpl.html is missing a figure.)
+http://www.sgi.com/tech/stl/ropeimpl.html .
 
 All of these are descendants of the "ropes" in Xerox Cedar.
 

diff --git a/doc/README.environment b/doc/README.environment
index 79752f7834a229518f08a8f684d5a411c04064f4..7c7096c5205745844d56f7af9da30b9ffa680f8e 100644 (file)
--- a/doc/README.environment
+++ b/doc/README.environment
@@ -93,8 +93,8 @@ GC_PRINT_BACK_HEIGHT - Print max length of chain through unreachable objects
                      This feature is still somewhat experimental, and requires
                      that the collector have been built with MAKE_BACK_GRAPH
                      defined.  For details, see Boehm, "Bounding Space Usage
-                     of Conservative Garbage Collectors", POPL 2001, or
-                     http://lib.hpl.hp.com/techpubs/2001/HPL-2001-251.html .
+                     of Conservative Garbage Collectors", POPL 2001
+                     (http://www.hpl.hp.com/techreports/2001/HPL-2001-251.html).
 
 GC_RETRY_SIGNALS, GC_NO_RETRY_SIGNALS - Try to compensate for lost
                      thread suspend signals in linux_threads.c.  On by

diff --git a/doc/overview.html b/doc/overview.html
index d7e90db5f306919a142531b912848bd782a218c2..833c63a0fa1c31785bf858470abfe2d0a84f64d5 100644 (file)
--- a/doc/overview.html
+++ b/doc/overview.html
@@ -25,8 +25,7 @@
 [ This is an updated version of the page formerly at
 <tt>http://reality.sgi.com/boehm/gc.html</tt>
 and before that at
-<a href="ftp://parcftp.xerox.com/pub/gc/gc.html">
-<tt>ftp://parcftp.xerox.com/pub/gc/gc.html</tt></a>.]
+<tt>ftp://parcftp.xerox.com/pub/gc/gc.html</tt>. ]
 <p>
 The <a href="http://www.hpl.hp.com/personal/Hans_Boehm">Boehm</a>-<a href="http://www.cs.cornell.edu/annual_report/00-01/bios.htm#demers">Demers</a>-<a href="http://www-sul.stanford.edu/weiser/">Weiser</a>
 conservative garbage collector can
@@ -115,15 +114,13 @@ incorporate changes, it is impossible for
 me to update the project file.)
 <p>
 Precompiled versions of the collector for NetBSD are available
-<a href="ftp://ftp.netbsd.org/pub/NetBSD/packages/pkgsrc/devel/boehm-gc/README.html">here</a>
-or
-<a href="http://www.netbsd.org/packages/devel/boehm-gc/README.html">here</a>.
+<a href="ftp://ftp.netbsd.org/pub/pkgsrc/current/pkgsrc/devel/boehm-gc/README.html">here</a>.
 </p><p>
 <a href="http://www.debian.org/">Debian Linux</a> includes prepackaged
 versions of the collector.
 </p><h2><a name="multiprocessors">Scalable multiprocessor versions</a></h2>
 Kenjiro Taura, Toshio Endo, and Akinori Yonezawa have made available
-a <a href="http://www.yl.is.s.u-tokyo.ac.jp/gc/">parallel collector</a>
+a <a href="http://web.yl.is.s.u-tokyo.ac.jp/gc/">parallel collector</a>
 based on this one.  Their collector takes advantage of multiple processors
 during a collection.  Starting with collector version 6.0alpha1
 we also do this, though with more modest processor scalability goals.
@@ -156,7 +153,7 @@ with malloc/free implementations.  Both space and time overhead are
 likely to be only slightly higher
 for programs written for malloc/free
 (see Detlefs, Dosser and Zorn's
-<a href="ftp://ftp.cs.colorado.edu/pub/techreports/zorn/CU-CS-665-93.ps.Z">Memory Allocation Costs in Large C and C++ Programs</a>.)
+<a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.3073&rep=rep1&type=ps">Memory Allocation Costs in Large C and C++ Programs</a>.)
 For programs allocating primarily very small objects, the collector
 may be faster; for programs allocating primarily large objects it will
 be slower.  If the collector is used in a multi-threaded environment
@@ -182,8 +179,8 @@ David Chase's
 <a href="http://www.iecc.com/gclist/GC-faq.html">GC FAQ</a>.
 </p><p>
 Richard Jones'
-<a href="http://www.ukc.ac.uk/computer_science/Html/Jones/gc.html">
-GC page</a> and
+<a href="https://www.cs.kent.ac.uk/people/staff/rej/gc.html">
+Garbage Collection Page</a> and
 <a href="http://www.cs.kent.ac.uk/people/staff/rej/gcbook/gcbook.html">
 his book</a>.
 </p><p>
@@ -230,7 +227,7 @@ M. Serrano, H. Boehm,
 "Understanding Memory Allocation of Scheme Programs",
 <i>Proceedings of the Fifth ACM SIGPLAN International Conference on
 Functional Programming</i>, 2000, Montreal, Canada, pp. 245-256.
-<a href="http://www.acm.org/pubs/citations/proceedings/fp/351240/p245-serrano/">
+<a href="http://dl.acm.org/citation.cfm?id=351264">
 Official version.</a>
 <a href="http://www.hpl.hp.com/techreports/2000/HPL-2000-62.html">
 Earlier Technical Report version.</a>  Includes some discussion of the
@@ -270,11 +267,11 @@ Boehm, H., and D. Chase,  <a href="http://www.hpl.hp.com/personal/Hans_Boehm/gc/
 </p><p>
 <b>Other related information: </b>
 </p><p>
-The Detlefs, Dosser and Zorn's <a href="ftp://ftp.cs.colorado.edu/pub/techreports/zorn/CU-CS-665-93.ps.Z">Memory Allocation Costs in Large C and C++ Programs</a>.
+The Detlefs, Dosser and Zorn's <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.30.3073&rep=rep1&type=ps">Memory Allocation Costs in Large C and C++ Programs</a>.
  This is a performance comparison of the Boehm-Demers-Weiser collector to malloc/free,
 using programs written for malloc/free.
 </p><p>
-Joel Bartlett's <a href="ftp://ftp.digital.com/pub/DEC/CCgc">mostly copying conservative garbage collector for C++</a>.
+Joel Bartlett's <a href="ftp://gatekeeper.dec.com/pub/compaq/WRL/research-reports/WRL-TN-12.ps">mostly copying conservative garbage collector for C++</a>.
 </p><p>
 John Ellis and David Detlef's <a href="ftp://parcftp.xerox.com/pub/ellis/gc/gc.ps">Safe Efficient Garbage Collection for C++</a> proposal.
 </p><p>
@@ -294,7 +291,7 @@ Some versions of the Xerox DocuPrint printer software.
 The <a href="http://www.mozilla.org/">Mozilla</a> project, as leak
 detector.
 </p><p>
-The <a href="http://www.go-mono.com/">Mono</a> project,
+The <a href="http://www.mono-project.com">Mono</a> project,
 an open source implementation of the .NET development framework.
 </p><p>
 The <a href="http://www.gnu.org/projects/dotgnu/">DotGNU Portable.NET
@@ -304,28 +301,25 @@ The <a href="http://irssi.org/">Irssi IRC client</a>.
 </p><p>
 <a href="http://titanium.cs.berkeley.edu/">The Berkeley Titanium project</a>.
 </p><p>
-<a href="http://www.nag.co.uk/nagware_fortran_compilers.asp">The NAGWare f90 Fortran 90 compiler</a>.
+<a href="http://www.nag.co.uk/nagware/NP/NP_desc.asp">The NAGWare f90 Fortran 90 compiler</a>.
 </p><p>
-Elwood Corporation's <a href="http://www.elwood.com/eclipse-info/index.htm">
-Eclipse</a> Common Lisp system, C library, and translator.
+Elwood Corporation's Eclipse Common Lisp system, C library, and translator.
 </p><p>
-The <a href="http://www-sop.inria.fr/mimosa/fp/Bigloo/">Bigloo
-Scheme</a>
-and <a href="http://kaolin.unice.fr/%7Eserrano/camloo.html">Camloo ML
-compilers</a>
+The <a href="http://www-sop.inria.fr/mimosa/fp/Bigloo/">Bigloo Scheme</a>
+and <a href="https://github.com/samoht/camloo">Camloo ML compilers</a>
 written by Manuel Serrano and others.
 </p><p>
-Brent Benson's <a href="http://ftp.cs.indiana.edu/pub/scheme-repository/imp/">libscheme</a>.
+Brent Benson's <a href="http://www.cs.indiana.edu/scheme-repository/libscheme-vhll/final.html">libscheme</a>.
 </p><p>
-The <a href="http://www.cs.rice.edu/CS/PLT/packages/mzscheme/index.html">MzScheme</a> scheme implementation.
+The MzScheme scheme implementation.
 </p><p>
 The <a href="http://www.cs.washington.edu/research/projects/cecil/www/cecil-home.html">University of Washington Cecil Implementation</a>.
 </p><p>
-<a href="http://www.icsi.berkeley.edu/Sather/">The Berkeley Sather implementation</a>.
+<a href="http://www1.icsi.berkeley.edu/~sather/">The Berkeley Sather implementation</a>.
 </p><p>
-<a href="http://www.cs.berkeley.edu/%7Eharmonia/">The Berkeley Harmonia Project</a>.
+<a href="http://www.cs.berkeley.edu/~harmonia/harmonia/index.html">The Berkeley Harmonia Project</a>.
 </p><p>
-The <a href="http://www.cs.arizona.edu/sumatra/toba/">Toba</a> Java Virtual
+The <a href="http://www.cs.arizona.edu/projects/sumatra/toba/">Toba</a> Java Virtual
 Machine to C translator.
 </p><p>
 The <a href="http://www.gwydiondylan.org/">Gwydion Dylan compiler</a>.
@@ -343,10 +337,9 @@ system.
 </p><p>
 <a href="http://asymptote.sf.net/">Asymptote LaTeX-compatible
 vector graphics language.</a>
-
 </p><h1><a name="collector">More collector information at this site</a></h1>
 <a href="simple_example.html">A simple illustration of how to build and
-use the collector.</a>.
+use the collector</a>.
 <p>
 <a href="gcinterface.html">Description of alternate interfaces to the
 garbage collector.</a>