From b5ef5c12720dbf31c5b09dd5b026abda5924fa0e Mon Sep 17 00:00:00 2001 From: Ivan Maidanski Date: Sun, 23 Feb 2014 12:53:55 +0400 Subject: [PATCH] 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. --- doc/README.cords | 3 +-- doc/README.environment | 4 ++-- doc/overview.html | 47 ++++++++++++++++++------------------------ 3 files changed, 23 insertions(+), 31 deletions(-) diff --git a/doc/README.cords b/doc/README.cords index 0339a9a9..f64dd2e8 100644 --- 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 79752f78..7c7096c5 100644 --- 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 d7e90db5..833c63a0 100644 --- a/doc/overview.html +++ b/doc/overview.html @@ -25,8 +25,7 @@ [ This is an updated version of the page formerly at http://reality.sgi.com/boehm/gc.html and before that at - -ftp://parcftp.xerox.com/pub/gc/gc.html.] +ftp://parcftp.xerox.com/pub/gc/gc.html. ]

The Boehm-Demers-Weiser conservative garbage collector can @@ -115,15 +114,13 @@ incorporate changes, it is impossible for me to update the project file.)

Precompiled versions of the collector for NetBSD are available -here -or -here. +here.

Debian Linux includes prepackaged versions of the collector.

Scalable multiprocessor versions

Kenjiro Taura, Toshio Endo, and Akinori Yonezawa have made available -a parallel collector +a parallel collector 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 -Memory Allocation Costs in Large C and C++ Programs.) +Memory Allocation Costs in Large C and C++ Programs.) 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 GC FAQ.

Richard Jones' - -GC page and + +Garbage Collection Page and his book.

@@ -230,7 +227,7 @@ M. Serrano, H. Boehm, "Understanding Memory Allocation of Scheme Programs", Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming, 2000, Montreal, Canada, pp. 245-256. - + Official version. Earlier Technical Report version. Includes some discussion of the @@ -270,11 +267,11 @@ Boehm, H., and D. Chase, Memory Allocation Costs in Large C and C++ Programs. +The Detlefs, Dosser and Zorn's Memory Allocation Costs in Large C and C++ Programs. This is a performance comparison of the Boehm-Demers-Weiser collector to malloc/free, using programs written for malloc/free.

-Joel Bartlett's mostly copying conservative garbage collector for C++. +Joel Bartlett's mostly copying conservative garbage collector for C++.

John Ellis and David Detlef's Safe Efficient Garbage Collection for C++ proposal.

@@ -294,7 +291,7 @@ Some versions of the Xerox DocuPrint printer software. The Mozilla project, as leak detector.

-The Mono project, +The Mono project, an open source implementation of the .NET development framework.

The DotGNU Portable.NET @@ -304,28 +301,25 @@ The Irssi IRC client.

The Berkeley Titanium project.

-The NAGWare f90 Fortran 90 compiler. +The NAGWare f90 Fortran 90 compiler.

-Elwood Corporation's -Eclipse Common Lisp system, C library, and translator. +Elwood Corporation's Eclipse Common Lisp system, C library, and translator.

-The Bigloo -Scheme -and Camloo ML -compilers +The Bigloo Scheme +and Camloo ML compilers written by Manuel Serrano and others.

-Brent Benson's libscheme. +Brent Benson's libscheme.

-The MzScheme scheme implementation. +The MzScheme scheme implementation.

The University of Washington Cecil Implementation.

-The Berkeley Sather implementation. +The Berkeley Sather implementation.

-The Berkeley Harmonia Project. +The Berkeley Harmonia Project.

-The Toba Java Virtual +The Toba Java Virtual Machine to C translator.

The Gwydion Dylan compiler. @@ -343,10 +337,9 @@ system.

Asymptote LaTeX-compatible vector graphics language. -

More collector information at this site

A simple illustration of how to build and -use the collector.. +use the collector.

Description of alternate interfaces to the garbage collector. -- 2.40.0