Update links and references in libstdc++ manual

	* doc/xml/manual/policy_data_structures.xml: Fix spelling of author's
	name.
	* doc/xml/manual/policy_data_structures_biblio.xml: Likewise. Remove
	broken links to texts that are no longer online.
	* doc/xml/manual/profile_mode.xml: Update links to CGO 2009 paper and
	LCPC 2006 paper.
	* doc/xml/manual/using.xml: Update links to memory model information.
	* doc/xml/manual/using_exceptions.xml: Update link to "Appendix E:
	Standard-Library Exception Safety".
	* doc/html/*: Regenerate.

From-SVN: r245277

libstdc++-v3/ChangeLog

+2017-02-08  Jonathan Wakely  <jwakely@redhat.com>
+
+	* doc/xml/manual/policy_data_structures.xml: Fix spelling of author's
+	name.
+	* doc/xml/manual/policy_data_structures_biblio.xml: Likewise. Remove
+	broken links to texts that are no longer online.
+	* doc/xml/manual/profile_mode.xml: Update links to CGO 2009 paper and
+	LCPC 2006 paper.
+	* doc/xml/manual/using.xml: Update links to memory model information.
+	* doc/xml/manual/using_exceptions.xml: Update link to "Appendix E:
+	Standard-Library Exception Safety".
+	* doc/html/*: Regenerate.
+
 2017-02-08  Gerald Pfeifer  <gerald@pfeifer.com>
 
 	* doc/xml/manual/profile_mode.xml: Unbreak link to

libstdc++-v3/doc/html/manual/abi.html

@@ -544,7 +544,7 @@ gcc test.c -g -O2 -L. -lone -ltwo /usr/lib/libstdc++.so.5 /usr/lib/libstdc++.so.
 	Linker and Libraries Guide (document 819-0690)
 	</a>
       </em>. </span></p></div><div class="biblioentry"><a id="id-1.3.6.3.6.10.6"></a><p><span class="title"><em>
-	<a class="link" href="http://download.oracle.com/docs/cd/E19422-01/819-3689/index.html" target="_top">
+	<a class="link" href="http://docs.oracle.com/cd/E19422-01/819-3689/" target="_top">
       Sun Studio 11: C++ Migration Guide (document 819-3689)
 	</a>
       </em>. </span></p></div><div class="biblioentry"><a id="id-1.3.6.3.6.10.7"></a><p><span class="title"><em>

libstdc++-v3/doc/html/manual/debug.html

@@ -161,7 +161,7 @@
   DRD</a>,
   <a class="link" href="http://valgrind.org/docs/manual/hg-manual.html" target="_top"> 
   Helgrind</a>, and
-  <a class="link" href="http://code.google.com/p/data-race-test/" target="_top"> 
+  <a class="link" href="https://code.google.com/p/data-race-test/" target="_top"> 
   ThreadSanitizer</a> (this refers to ThreadSanitizer v1, not the
   new "tsan" feature built-in to GCC itself).
 </p><p>

libstdc++-v3/doc/html/manual/documentation_hacking.html

@@ -359,16 +359,15 @@
 	For PDF output, something that transforms valid Docbook XML to PDF is
 	required. Possible solutions include <a class="link" href="http://dblatex.sourceforge.net" target="_top">dblatex</a>,
 	<span class="command"><strong>xmlto</strong></span>, or <span class="command"><strong>prince</strong></span>. Of
-	these, <span class="command"><strong>dblatex</strong></span> is the default. Other
-	options are listed on the DocBook web <a class="link" href="http://wiki.docbook.org/topic/DocBookPublishingTools" target="_top">pages</a>. Please
-	consult the <code class="email">&lt;<a class="email" href="mailto:libstdc++@gcc.gnu.org">libstdc++@gcc.gnu.org</a>&gt;</code> list when
+	these, <span class="command"><strong>dblatex</strong></span> is the default.
+	Please consult the <code class="email">&lt;<a class="email" href="mailto:libstdc++@gcc.gnu.org">libstdc++@gcc.gnu.org</a>&gt;</code> list when
 	preparing printed manuals for current best practice and
 	suggestions.
       </p><p>
 	For Texinfo output, something that transforms valid Docbook
 	XML to Texinfo is required. The default choice is <a class="link" href="http://docbook2x.sourceforge.net/" target="_top">docbook2X</a>.
       </p><p>
-	For epub output, the <a class="link" href="https://sourceforge.net/projects/docbook/files/epub3/" target="_top">stylesheets</a> for EPUB3 are required. These stylesheets are still in development. To validate the created file, <a class="link" href="https://code.google.com/p/epubcheck/" target="_top">epubcheck</a> is necessary.
+	For epub output, the <a class="link" href="https://sourceforge.net/projects/docbook/files/epub3/" target="_top">stylesheets</a> for EPUB3 are required. These stylesheets are still in development. To validate the created file, <a class="link" href="https://github.com/IDPF/epubcheck" target="_top">epubcheck</a> is necessary.
       </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="docbook.rules"></a>Generating the DocBook Files</h4></div></div></div><p>
 	The following Makefile rules generate (in order): an HTML
 	version of all the DocBook documentation, a PDF version of the
@@ -527,9 +526,8 @@ make <code class="literal">XSL_STYLE_DIR="/usr/share/xml/docbook/stylesheet/nwal
 <br />
       &lt;/set&gt;<br />
     </p></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="docbook.markup"></a>Markup By Example</h4></div></div></div><p>
-	Complete details on Docbook markup can be found in the DocBook
-	Element Reference,
-	<a class="link" href="http://www.docbook.org/tdg/en/html/part2.html" target="_top">online</a>.
+	Complete details on Docbook markup can be found in the
+	<a class="link" href="http://tdg.docbook.org/tdg/5.0/ref-elements.html" target="_top">DocBook Element Reference</a>.
 	An incomplete reference for HTML to Docbook conversion is
 	detailed in the table below.
       </p><div class="table"><a id="table.docbook_cmp"></a><p class="title"><strong>Table B.4. HTML to Docbook XML Markup Comparison</strong></p><div class="table-contents"><table summary="HTML to Docbook XML Markup Comparison" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">HTML</th><th align="left">Docbook</th></tr></thead><tbody><tr><td align="left">&lt;p&gt;</td><td align="left">&lt;para&gt;</td></tr><tr><td align="left">&lt;pre&gt;</td><td align="left">&lt;computeroutput&gt;, &lt;programlisting&gt;,

libstdc++-v3/doc/html/manual/policy_data_structures.html

@@ -1097,14 +1097,12 @@
 	    Litwin
 	  </span>. </span><span class="publisher"><span class="publishername">
 	  Proceedings of International Conference on Very Large Data Bases
-	. </span></span></p></div><div class="biblioentry"><a id="biblio.maverik_lowerbounds"></a><p>[biblio.maverik_lowerbounds] <span class="title"><em>
-	<a class="link" href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps/" target="_top">
+	. </span></span></p></div><div class="biblioentry"><a id="biblio.maverick_lowerbounds"></a><p>[biblio.maverick_lowerbounds] <span class="title"><em>
 	Deamortization - Part 2: Binomial Heaps
-	</a>
       </em>. </span><span class="date">
 	2005
       . </span><span class="author"><span class="firstname">
-	    Maverik
+	    Maverick
 	  </span> <span class="surname">
 	    Woo
 	  </span>. </span></p></div><div class="biblioentry"><a id="biblio.meyers96more"></a><p>[biblio.meyers96more] <span class="title"><em>
@@ -1293,9 +1291,7 @@
 	    </span>. </span><span class="publisher"><span class="publishername">
 	  Addison-Wesley Publishing Company
 	. </span></span></p></div><div class="biblioentry"><a id="biblio.wickland96thirty"></a><p>[biblio.wickland96thirty] <span class="title"><em>
-	<a class="link" href="http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip" target="_top">
 	Thirty Years Among the Dead
-	</a>
       </em>. </span><span class="date">
 	1996
       . </span><span class="author"><span class="firstname">

libstdc++-v3/doc/html/manual/policy_data_structures_design.html

@@ -1221,7 +1221,7 @@
 	an underlying pairing heap (<a class="xref" href="policy_data_structures.html#biblio.fredman86pairing" title="The pairing heap: a new form of self-adjusting heap">[biblio.fredman86pairing]</a>),
 	binary heap (<a class="xref" href="policy_data_structures.html#biblio.clrs2001" title="Introduction to Algorithms, 2nd edition">[biblio.clrs2001]</a>),
 	binomial heap (<a class="xref" href="policy_data_structures.html#biblio.clrs2001" title="Introduction to Algorithms, 2nd edition">[biblio.clrs2001]</a>),
-	a binomial heap with a redundant binary counter (<a class="xref" href="policy_data_structures.html#biblio.maverik_lowerbounds" title="Deamortization - Part 2: Binomial Heaps">[biblio.maverik_lowerbounds]</a>),
+	a binomial heap with a redundant binary counter (<a class="xref" href="policy_data_structures.html#biblio.maverick_lowerbounds" title="Deamortization - Part 2: Binomial Heaps">[biblio.maverick_lowerbounds]</a>),
 	or a thin heap (<a class="xref" href="policy_data_structures.html#biblio.kt99fat_heaps" title="New Heap Data Structures">[biblio.kt99fat_heaps]</a>).
 	</p><p>
 	  As mentioned in the tutorial,

libstdc++-v3/doc/html/manual/profile_mode.html

@@ -10,9 +10,9 @@
   calls to an instrumentation library to record the internal state of
   various components at interesting entry/exit points to/from the standard
   library.  Process trace, recognize suboptimal patterns, give advice.
-  For details, see
-  <a class="link" href="http://dx.doi.org/10.1109/CGO.2009.36" target="_top">paper presented at
-   CGO 2009</a>.
+  For details, see the
+  <a class="link" href="http://http://ieeexplore.ieee.org/document/4907670/" target="_top">Perflint
+  paper presented at CGO 2009</a>.
   </p><p>
   <span class="emphasis"><em>Strengths: </em></span>
 </p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>

libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html

@@ -376,7 +376,7 @@ foo.cc:1: advice: Change "list" to "forward_list".
   See papers:
   <a class="link" href="https://dl.acm.org/citation.cfm?doid=1065944.1065981" target="_top">
   A framework for adaptive algorithm selection in STAPL</a> and
-  <a class="link" href="http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=4228227" target="_top">
+  <a class="link" href="http://ieeexplore.ieee.org/document/4228227/" target="_top">
   Optimizing Sorting with Machine Learning Algorithms</a>.
   </p></li><li class="listitem"><p><span class="emphasis"><em>Sample runtime reduction:</em></span>60%.
   </p></li><li class="listitem"><p><span class="emphasis"><em>Recommendation:</em></span> Change sort algorithm
@@ -441,8 +441,8 @@ foo.cc:7: advice: Insert prefetch instruction.
   </p></li><li class="listitem"><p><span class="emphasis"><em>Fundamentals:</em></span>Allocation can be tuned
   to a specific traversal pattern, to result in better data locality.
   See paper:
-  <a class="link" href="http://www.springerlink.com/content/8085744l00x72662/" target="_top">
-  Custom Memory Allocation for Free</a>.
+  <a class="link" href="https://parasol.tamu.edu/publications/download.php?file_id=570" target="_top">
+  Custom Memory Allocation for Free</a> by Jula and Rauchwerger.
   </p></li><li class="listitem"><p><span class="emphasis"><em>Sample runtime reduction:</em></span>30%.
   </p></li><li class="listitem"><p><span class="emphasis"><em>Recommendation:</em></span>
   High scatter score N for container built at site S.

libstdc++-v3/doc/html/manual/status.html

@@ -697,7 +697,7 @@ Feature-testing recommendations for C++</a>.
 	  N4258
 	</a>
       </td><td align="center">6.1</td><td align="left"><code class="code"> __cpp_lib_allocator_traits_is_always_equal &gt;= 201411 </code></td></tr><tr><td align="left">Contiguous Iterators </td><td align="left">
-	<a class="link" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4284.htm" target="_top">
+	<a class="link" href="http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4284.html" target="_top">
 	  N4284
 	</a>
       </td><td align="center">N/A</td><td align="left"> </td></tr><tr><td align="left"> Minimal incomplete type support for standard containers </td><td align="left">

libstdc++-v3/doc/html/manual/test.html

@@ -510,7 +510,7 @@ with specific options, and additional options for 32-bit x86:
     More examples can be found in the
     <code class="filename">libstdc++-v3/testsuite/*/*.cc</code> files.
    </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="tests.dg.directives"></a>Directives Specific to Libstdc++ Tests</h4></div></div></div><p>
-    In addition to the usual <a class="link" href="https://gcc.gnu.org/onlinedocs/gccint/Require-support.html" target="_top">Variants
+    In addition to the usual <a class="link" href="https://gcc.gnu.org/onlinedocs/gccint/Require-Support.html" target="_top">Variants
     of <code class="literal">dg-require-<em class="replaceable"><code>support</code></em></code></a>
     several more directives are available for use in libstdc++ tests,
     including the following:

libstdc++-v3/doc/html/manual/using_concurrency.html

@@ -157,9 +157,9 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33)
       t2.join();
     }
       </pre><p>For further details of the C++11 memory model see Hans-J. Boehm's
-      <a class="link" href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/user-faq.html" target="_top">Threads
+      <a class="link" href="https://www.hboehm.info/c++mm/" target="_top">Threads
       and memory model for C++</a> pages, particularly the <a class="link" href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/threadsintro.html" target="_top">introduction</a> 
-      and <a class="link" href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/user-faq.html" target="_top">FAQ</a>.
+      and <a class="link" href="https://www.hboehm.info/c++mm/user-faq.html" target="_top">FAQ</a>.
       </p></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.concurrency.atomics"></a>Atomics</h3></div></div></div><p>
     </p></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.concurrency.io"></a>IO</h3></div></div></div><p>This gets a bit tricky.  Please read carefully, and bear with me.
    </p><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="concurrency.io.structure"></a>Structure</h4></div></div></div><p>A wrapper

libstdc++-v3/doc/html/manual/using_exceptions.html

@@ -299,7 +299,7 @@ is called.
       </em>. </span><span class="author"><span class="firstname">Richard</span> <span class="surname">Henderson</span>. </span><span class="publisher"><span class="publishername">
 	GNU
       . </span></span></p></div><div class="biblioentry"><a id="id-1.3.3.4.9.9.7"></a><p><span class="title"><em>
-	<a class="link" href="http://www.research.att.com/~bs/3rd_safe.pdf" target="_top">
+	<a class="link" href="http://www.stroustrup.com/3rd_safe.pdf" target="_top">
 	Appendix E: Standard-Library Exception Safety
 	</a>
       </em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span></p></div><div class="biblioentry"><a id="id-1.3.3.4.9.9.8"></a><p><span class="citetitle"><em class="citetitle">

libstdc++-v3/doc/xml/manual/policy_data_structures.xml

@@ -4719,7 +4719,7 @@
 	an underlying pairing heap (<xref linkend="biblio.fredman86pairing"/>),
 	binary heap (<xref linkend="biblio.clrs2001"/>),
 	binomial heap (<xref linkend="biblio.clrs2001"/>),
-	a binomial heap with a redundant binary counter (<xref linkend="biblio.maverik_lowerbounds"/>),
+	a binomial heap with a redundant binary counter (<xref linkend="biblio.maverick_lowerbounds"/>),
 	or a thin heap (<xref linkend="biblio.kt99fat_heaps"/>).
 	</para>
 

libstdc++-v3/doc/xml/manual/policy_data_structures_biblio.xml

@@ -892,12 +892,9 @@
     </biblioentry>
 
     <!-- 26 -->
-    <biblioentry xml:id="biblio.maverik_lowerbounds">
+    <biblioentry xml:id="biblio.maverick_lowerbounds">
       <title>
-	<link xmlns:xlink="http://www.w3.org/1999/xlink"
-	      xlink:href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps/">
 	Deamortization - Part 2: Binomial Heaps
-	</link>
       </title>
       <date>
 	2005
@@ -906,7 +903,7 @@
       <author>
 	<personname>
 	  <firstname>
-	    Maverik
+	    Maverick
 	  </firstname>
 	  <surname>
 	    Woo
@@ -1422,10 +1419,7 @@
     <!-- 45 -->
     <biblioentry xml:id="biblio.wickland96thirty">
       <title>
-	<link xmlns:xlink="http://www.w3.org/1999/xlink"
-	      xlink:href="http://myweb.wvnet.edu/~gsa00121/books/amongdead30.zip">
 	Thirty Years Among the Dead
-	</link>
       </title>
       <date>
 	1996

libstdc++-v3/doc/xml/manual/profile_mode.xml

@@ -25,9 +25,9 @@
   calls to an instrumentation library to record the internal state of
   various components at interesting entry/exit points to/from the standard
   library.  Process trace, recognize suboptimal patterns, give advice.
-  For details, see
-  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://dx.doi.org/10.1109/CGO.2009.36">paper presented at
-   CGO 2009</link>.
+  For details, see the
+  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://http://ieeexplore.ieee.org/document/4907670/">Perflint
+  paper presented at CGO 2009</link>.
   </para>
   <para>
   <emphasis>Strengths: </emphasis>
@@ -1509,8 +1509,8 @@ foo.cc:7: advice: Insert prefetch instruction.
   <listitem><para><emphasis>Fundamentals:</emphasis>Allocation can be tuned
   to a specific traversal pattern, to result in better data locality.
   See paper:
-  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.springerlink.com/content/8085744l00x72662/">
-  Custom Memory Allocation for Free</link>.
+  <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://parasol.tamu.edu/publications/download.php?file_id=570">
+  Custom Memory Allocation for Free</link> by Jula and Rauchwerger.
   </para></listitem>
   <listitem><para><emphasis>Sample runtime reduction:</emphasis>30%.
   </para></listitem>

libstdc++-v3/doc/xml/manual/using.xml

@@ -1624,9 +1624,9 @@ gcc version 4.1.2 20070925 (Red Hat 4.1.2-33)
       </programlisting>
 
       <para>For further details of the C++11 memory model see Hans-J. Boehm's
-      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/user-faq.html">Threads
+      <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://www.hboehm.info/c++mm/">Threads
       and memory model for C++</link> pages, particularly the <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/threadsintro.html">introduction</link> 
-      and <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.hpl.hp.com/personal/Hans_Boehm/c++mm/user-faq.html">FAQ</link>.
+      and <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://www.hboehm.info/c++mm/user-faq.html">FAQ</link>.
       </para>
 
   </section>

libstdc++-v3/doc/xml/manual/using_exceptions.xml

@@ -512,7 +512,7 @@ is called.
   <biblioentry>
       <title>
 	<link xmlns:xlink="http://www.w3.org/1999/xlink"
-	      xlink:href="http://www.research.att.com/~bs/3rd_safe.pdf">
+	      xlink:href="http://www.stroustrup.com/3rd_safe.pdf">
 	Appendix E: Standard-Library Exception Safety
 	</link>
       </title>