Skip to content

R
riscv-gcc-1
Commit 395ec8f3 by Jonathan Wakely Committed by Jonathan Wakely
Options

Fix ViewCVS URLs in libstdc++ manual 

	* doc/xml/manual/allocator.xml: Fix ViewCVS URLs.
	* doc/xml/manual/mt_allocator.xml: Likewise.
	* doc/html/*: Regenerate.

From-SVN: r247911
parent c8634a1a
Showing with 17 additions and 12 deletions
libstdc++-v3/ChangeLog
2017-05-11 Jonathan Wakely <jwakely@redhat.com> 2017-05-11 Jonathan Wakely <jwakely@redhat.com>
* doc/xml/manual/allocator.xml: Fix ViewCVS URLs.
* doc/xml/manual/mt_allocator.xml: Likewise.
* doc/html/*: Regenerate.
PR libstdc++/80285 PR libstdc++/80285
* include/bits/shared_ptr_base.h (_Sp_make_shared_tag::_S_ti): Define * include/bits/shared_ptr_base.h (_Sp_make_shared_tag::_S_ti): Define
function to get unique fake std::type_info reference. function to get unique fake std::type_info reference.
......
libstdc++-v3/doc/html/manual/memory.html
...@@ -119,8 +119,8 @@ ...@@ -119,8 +119,8 @@
Over multiple iterations, various STL container Over multiple iterations, various STL container
objects have elements inserted to some maximum amount. A variety objects have elements inserted to some maximum amount. A variety
of allocators are tested. of allocators are tested.
Test source for <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup" target="_top">sequence</a> Test source for <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup" target="_top">sequence</a>
and <a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup" target="_top">associative</a> and <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup" target="_top">associative</a>
containers. containers.
</p></li><li class="listitem"><p> </p></li><li class="listitem"><p>
Insertion and erasure in a multi-threaded environment. Insertion and erasure in a multi-threaded environment.
...@@ -129,14 +129,14 @@ ...@@ -129,14 +129,14 @@
on a per-thread basis, as well as measuring thread contention on a per-thread basis, as well as measuring thread contention
for memory resources. for memory resources.
Test source Test source
<a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup" target="_top">here</a>. <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup" target="_top">here</a>.
</p></li><li class="listitem"><p> </p></li><li class="listitem"><p>
A threaded producer/consumer model. A threaded producer/consumer model.
</p><p> </p><p>
Test source for Test source for
<a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup" target="_top">sequence</a> <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup" target="_top">sequence</a>
and and
<a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup" target="_top">associative</a> <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup" target="_top">associative</a>
containers. containers.
</p></li></ol></div><p> </p></li></ol></div><p>
The current default choice for The current default choice for
......
libstdc++-v3/doc/html/manual/mt_allocator_impl.html
...@@ -156,6 +156,6 @@ containers, this works, as an instance of the allocator is constructed ...@@ -156,6 +156,6 @@ containers, this works, as an instance of the allocator is constructed
as part of a container's constructor. However, this assumption is as part of a container's constructor. However, this assumption is
implementation-specific, and subject to change. For an example of a implementation-specific, and subject to change. For an example of a
pool that frees memory, see the following pool that frees memory, see the following
<a class="link" href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup" target="_top"> <a class="link" href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup" target="_top">
example.</a> example.</a>
</p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="mt_allocator_design.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="mt_allocator.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="mt_allocator_ex_single.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Design Issues </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Single Thread Example</td></tr></table></div></body></html> </p></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="mt_allocator_design.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="mt_allocator.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="mt_allocator_ex_single.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Design Issues </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Single Thread Example</td></tr></table></div></body></html>
\ No newline at end of file
libstdc++-v3/doc/xml/manual/allocator.xml
...@@ -185,8 +185,8 @@ ...@@ -185,8 +185,8 @@
Over multiple iterations, various STL container Over multiple iterations, various STL container
objects have elements inserted to some maximum amount. A variety objects have elements inserted to some maximum amount. A variety
of allocators are tested. of allocators are tested.
Test source for <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup">sequence</link> Test source for <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/sequence.cc?view=markup">sequence</link>
and <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup">associative</link> and <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert/associative.cc?view=markup">associative</link>
containers. containers.
</para> </para>
...@@ -201,7 +201,7 @@ ...@@ -201,7 +201,7 @@
on a per-thread basis, as well as measuring thread contention on a per-thread basis, as well as measuring thread contention
for memory resources. for memory resources.
Test source Test source
<link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup">here</link>. <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc%2B%2B-v3/testsuite/performance/23_containers/insert_erase/associative.cc?view=markup">here</link>.
</para> </para>
</listitem> </listitem>
...@@ -211,9 +211,9 @@ ...@@ -211,9 +211,9 @@
</para> </para>
<para> <para>
Test source for Test source for
<link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup">sequence</link> <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/sequence.cc?view=markup">sequence</link>
and and
<link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup">associative</link> <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/performance/23_containers/producer_consumer/associative.cc?view=markup">associative</link>
containers. containers.
</para> </para>
</listitem> </listitem>
......
libstdc++-v3/doc/xml/manual/mt_allocator.xml
...@@ -308,7 +308,7 @@ containers, this works, as an instance of the allocator is constructed ...@@ -308,7 +308,7 @@ containers, this works, as an instance of the allocator is constructed
as part of a container's constructor. However, this assumption is as part of a container's constructor. However, this assumption is
implementation-specific, and subject to change. For an example of a implementation-specific, and subject to change. For an example of a
pool that frees memory, see the following pool that frees memory, see the following
<link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup"> <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://gcc.gnu.org/viewcvs/gcc/trunk/libstdc++-v3/testsuite/ext/mt_allocator/deallocate_local-6.cc?view=markup">
example.</link> example.</link>
</para> </para>
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment