diff options
| author | Gerald Pfeifer <gerald@pfeifer.com> | 2018-09-01 21:27:14 +0000 |
|---|---|---|
| committer | Gerald Pfeifer <gerald@pfeifer.com> | 2018-09-01 21:27:14 +0000 |
| commit | ffe14bb014f81fd374dc87194041a6211d2041c0 (patch) | |
| tree | 3bbc762535e6fb89e6dc25913f2fa2bd64928226 /libstdc++-v3/doc | |
| parent | 5370726f59b087de6659eecd6176fe5fe0ca0a77 (diff) | |
* doc/xml/manual/profile_mode.xml: Update three ieeexplore.ieee.org
references.
git-svn-id: https://gcc.gnu.org/svn/gcc/trunk@264031 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'libstdc++-v3/doc')
| -rw-r--r-- | libstdc++-v3/doc/xml/manual/profile_mode.xml | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/libstdc++-v3/doc/xml/manual/profile_mode.xml b/libstdc++-v3/doc/xml/manual/profile_mode.xml index 7e71a7e3312..fa1b7c993c3 100644 --- a/libstdc++-v3/doc/xml/manual/profile_mode.xml +++ b/libstdc++-v3/doc/xml/manual/profile_mode.xml @@ -26,7 +26,7 @@ various components at interesting entry/exit points to/from the standard library. Process trace, recognize suboptimal patterns, give advice. For details, see the - <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://ieeexplore.ieee.org/document/4907670/">Perflint + <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://ieeexplore.ieee.org/document/4907670/">Perflint paper presented at CGO 2009</link>. </para> <para> @@ -328,7 +328,7 @@ vector-size: improvement = 3: call stack = 0x804842c ... <para> For details, see - <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://ieeexplore.ieee.org/document/4907670/">paper presented at + <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://ieeexplore.ieee.org/document/4907670/">paper presented at CGO 2009</link>. </para> </section> @@ -1403,7 +1403,7 @@ foo.cc:1: advice: Change "list" to "forward_list". See papers: <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://dl.acm.org/citation.cfm?doid=1065944.1065981"> A framework for adaptive algorithm selection in STAPL</link> and - <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://ieeexplore.ieee.org/document/4228227/"> + <link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://ieeexplore.ieee.org/document/4228227/"> Optimizing Sorting with Machine Learning Algorithms</link>. </para></listitem> <listitem><para><emphasis>Sample runtime reduction:</emphasis>60%. |