~ubuntu-branches/debian/sid/gcc-4.8/sid : revision 78

1

# DP: updates from the 4.8 branch upto 20131129 (r205525).

2

3

last_updated()

4

{

5

cat > ${dir}LAST_UPDATED <<EOF

6

Fri Nov 29 14:04:07 CET 2013

7

Fri Nov 29 13:04:07 UTC 2013 (revision 205525)

8

EOF

9

}

10

11

LANG=C svn diff svn://gcc.gnu.org/svn/gcc/tags/gcc_4_8_2_release svn://gcc.gnu.org/svn/gcc/branches/gcc-4_8-branch \

12

| sed -r 's,^--- (\S+)\t(\S+)(.*)$,--- a/src/\1\t\2,;s,^\+\+\+ (\S+)\t(\S+)(.*)$,+++ b/src/\1\t\2,' \

13

| awk '/^Index:.*\.(class|texi)/ {skip=1; next} /^Index:/ { skip=0 } skip==0'

14

15

Index: libstdc++-v3/configure

16

===================================================================

17

--- a/src/libstdc++-v3/configure (.../tags/gcc_4_8_2_release)

18

+++ b/src/libstdc++-v3/configure (.../branches/gcc-4_8-branch)

19

@@ -71573,7 +71573,7 @@

20

fi

21

22

# For libtool versioning info, format is CURRENT:REVISION:AGE

23

-libtool_VERSION=6:18:0

24

+libtool_VERSION=6:19:0

25

26

# Everything parsed; figure out what files and settings to use.

27

case $enable_symvers in

28

Index: libstdc++-v3/doc/xml/manual/abi.xml

29

===================================================================

30

--- a/src/libstdc++-v3/doc/xml/manual/abi.xml (.../tags/gcc_4_8_2_release)

31

+++ b/src/libstdc++-v3/doc/xml/manual/abi.xml (.../branches/gcc-4_8-branch)

32

@@ -203,6 +203,7 @@

33

34

35

36

+ <listitem><para>GCC 4.8.0: GCC_4.8.0</para></listitem>

37

</itemizedlist>

38

</listitem>

39

40

@@ -261,6 +262,7 @@

41

<listitem><para>GCC 4.6.1: libstdc++.so.6.0.16</para></listitem>

42

<listitem><para>GCC 4.7.0: libstdc++.so.6.0.17</para></listitem>

43

<listitem><para>GCC 4.8.0: libstdc++.so.6.0.18</para></listitem>

44

+ <listitem><para>GCC 4.8.3: libstdc++.so.6.0.19</para></listitem>

45

</itemizedlist>

46

<para>

47

Note 1: Error should be libstdc++.so.3.0.3.

48

@@ -324,6 +326,7 @@

49

<listitem><para>GCC 4.6.1: GLIBCXX_3.4.16, CXXABI_1.3.5</para></listitem>

50

<listitem><para>GCC 4.7.0: GLIBCXX_3.4.17, CXXABI_1.3.6</para></listitem>

51

<listitem><para>GCC 4.8.0: GLIBCXX_3.4.18, CXXABI_1.3.7</para></listitem>

52

+ <listitem><para>GCC 4.8.3: GLIBCXX_3.4.19, CXXABI_1.3.7</para></listitem>

53

</itemizedlist>

54

</listitem>

55

56

Index: libstdc++-v3/doc/xml/manual/status_cxx2011.xml

57

===================================================================

58

--- a/src/libstdc++-v3/doc/xml/manual/status_cxx2011.xml (.../tags/gcc_4_8_2_release)

59

+++ b/src/libstdc++-v3/doc/xml/manual/status_cxx2011.xml (.../branches/gcc-4_8-branch)

60

@@ -877,10 +877,11 @@

61

62

</row>

63

<row>

64

+ <?dbhtml bgcolor="#B0B0B0" ?>

65

66

<entry>Other transformations</entry>

67

- <entry>Y</entry>

68

- <entry/>

69

+ <entry>Partial</entry>

70

+ <entry>Missing <code>aligned_union</code>.</entry>

71

</row>

72

<row>

73

74

Index: libstdc++-v3/doc/xml/manual/spine.xml

75

===================================================================

76

--- a/src/libstdc++-v3/doc/xml/manual/spine.xml (.../tags/gcc_4_8_2_release)

77

+++ b/src/libstdc++-v3/doc/xml/manual/spine.xml (.../branches/gcc-4_8-branch)

78

@@ -20,6 +20,7 @@

79

80

81

82

+ <year>2013</year>

83

84

85

</holder>

86

Index: libstdc++-v3/doc/html/bk02.html

87

===================================================================

88

--- a/src/libstdc++-v3/doc/html/bk02.html (.../tags/gcc_4_8_2_release)

89

+++ b/src/libstdc++-v3/doc/html/bk02.html (.../branches/gcc-4_8-branch)

90

@@ -1,2 +1,2 @@

91

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

92

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library" /><link rel="prev" href="manual/backwards.html" title="Backwards Compatibility" /><link rel="next" href="api.html" title="The GNU C++ Library API Reference" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="manual/backwards.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="api.html">Next</a></td></tr></table><hr /></div><div class="book"><div class="titlepage"><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="article"><a href="api.html">The GNU C++ Library API Reference</a></span></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="manual/backwards.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="api.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Backwards Compatibility </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> The GNU C++ Library API Reference</td></tr></table></div></body></html>

93

\ No newline at end of file

94

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library" /><link rel="prev" href="manual/backwards.html" title="Backwards Compatibility" /><link rel="next" href="api.html" title="The GNU C++ Library API Reference" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="manual/backwards.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="api.html">Next</a></td></tr></table><hr /></div><div class="book"><div class="titlepage"><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="article"><a href="api.html">The GNU C++ Library API Reference</a></span></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="manual/backwards.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="api.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Backwards Compatibility </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> The GNU C++ Library API Reference</td></tr></table></div></body></html>

95

\ No newline at end of file

96

Index: libstdc++-v3/doc/html/bk03.html

97

===================================================================

98

--- a/src/libstdc++-v3/doc/html/bk03.html (.../tags/gcc_4_8_2_release)

99

+++ b/src/libstdc++-v3/doc/html/bk03.html (.../branches/gcc-4_8-branch)

100

@@ -1,2 +1,2 @@

101

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

102

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library" /><link rel="prev" href="api.html" title="The GNU C++ Library API Reference" /><link rel="next" href="faq.html" title="Frequently Asked Questions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="api.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="faq.html">Next</a></td></tr></table><hr /></div><div class="book"><div class="titlepage"><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="article"><a href="faq.html">Frequently Asked Questions</a></span></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="api.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="faq.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library API Reference </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> Frequently Asked Questions</td></tr></table></div></body></html>

103

\ No newline at end of file

104

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library" /><link rel="prev" href="api.html" title="The GNU C++ Library API Reference" /><link rel="next" href="faq.html" title="Frequently Asked Questions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="api.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="faq.html">Next</a></td></tr></table><hr /></div><div class="book"><div class="titlepage"><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="article"><a href="faq.html">Frequently Asked Questions</a></span></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="api.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="faq.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library API Reference </td><td width="20%" align="center"><a accesskey="h" href="index.html">Home</a></td><td width="40%" align="right" valign="top"> Frequently Asked Questions</td></tr></table></div></body></html>

105

\ No newline at end of file

106

Index: libstdc++-v3/doc/html/faq.html

107

===================================================================

108

--- a/src/libstdc++-v3/doc/html/faq.html (.../tags/gcc_4_8_2_release)

109

+++ b/src/libstdc++-v3/doc/html/faq.html (.../branches/gcc-4_8-branch)

110

@@ -1,9 +1,9 @@

111

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

112

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Frequently Asked Questions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="bk03.html" title="" /><link rel="prev" href="bk03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Frequently Asked Questions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk03.html">Prev</a> </td><th width="60%" align="center"></th><td width="20%" align="right"> </td></tr></table><hr /></div><div class="article"><div class="titlepage"><div><div><h1 class="title"><a id="faq"></a>Frequently Asked Questions</h1></div><div><p class="copyright">Copyright ©

113

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Frequently Asked Questions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="bk03.html" title="" /><link rel="prev" href="bk03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Frequently Asked Questions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk03.html">Prev</a> </td><th width="60%" align="center"></th><td width="20%" align="right"> </td></tr></table><hr /></div><div class="article"><div class="titlepage"><div><div><h1 class="title"><a id="faq"></a>Frequently Asked Questions</h1></div><div><p class="copyright">Copyright ©

114

2008, 2010

115

116

117

- </p></div></div><hr /></div><div class="qandaset"><a id="idp1581728"></a><dl><dt></dt><dd><dl><dt>1.1. <a href="faq.html#faq.what">

118

+ </p></div></div><hr /></div><div class="qandaset"><a id="idm270011560848"></a><dl><dt></dt><dd><dl><dt>1.1. <a href="faq.html#faq.what">

119

What is libstdc++?

120

</a></dt><dt>1.2. <a href="faq.html#faq.why">

121

Why should I use libstdc++?

122

Index: libstdc++-v3/doc/html/index.html

123

===================================================================

124

--- a/src/libstdc++-v3/doc/html/index.html (.../tags/gcc_4_8_2_release)

125

+++ b/src/libstdc++-v3/doc/html/index.html (.../branches/gcc-4_8-branch)

126

@@ -1,5 +1,5 @@

127

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

128

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="description" content="Short Contents Copyright (C) 2008-2013 FSF Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. This is the top level of the libstdc++ documentation set. The documentation is divided into the following three sections. Manual Frequently Asked Questions API and Source Documentation" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="next" href="manual/index.html" title="The GNU C++ Library Manual" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library</th></tr><tr><td width="20%" align="left"> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="manual/index.html">Next</a></td></tr></table><hr /></div><div class="set" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="set-index"></a>The GNU C++ Library</h1></div><div><div class="abstract"><a id="contents"></a><p class="title"><strong>Short Contents</strong></p><p>

129

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="description" content="Short Contents Copyright (C) 2008-2013 FSF Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, with no Front-Cover Texts, and with no Back-Cover Texts. This is the top level of the libstdc++ documentation set. The documentation is divided into the following three sections. Manual Frequently Asked Questions API and Source Documentation" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="next" href="manual/index.html" title="The GNU C++ Library Manual" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library</th></tr><tr><td width="20%" align="left"> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="manual/index.html">Next</a></td></tr></table><hr /></div><div class="set" lang="en" xml:lang="en"><div class="titlepage"><div><div><h1 class="title"><a id="set-index"></a>The GNU C++ Library</h1></div><div><div class="abstract"><a id="contents"></a><p class="title"><strong>Short Contents</strong></p><p>

130

131

<a class="link" href="http://www.fsf.org/" target="_top">FSF

132

</a>

133

@@ -20,7 +20,7 @@

134

</p></li><li class="listitem"><p>

135

<a class="link" href="api.html" title="The GNU C++ Library API Reference">API and Source Documentation</a>

136

</p></li></ul></div><p>

137

- </p></div></div></div><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="book"><a href="manual/index.html">The GNU C++ Library Manual</a></span></dt><dd><dl><dt><span class="part"><a href="manual/intro.html">I.

138

+ </p></div></div></div><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="book"><a href="manual/index.html">The GNU C++ Library Manual</a></span></dt><dd><dl><dt><span class="part"><a href="manual/intro.html">I.

139

Introduction

140

141

</a></span></dt><dd><dl><dt><span class="chapter"><a href="manual/status.html">1. Status</a></span></dt><dd><dl><dt><span class="section"><a href="manual/status.html#manual.intro.status.iso">Implementation Status</a></span></dt><dd><dl><dt><span class="section"><a href="manual/status.html#status.iso.1998">C++ 1998/2003</a></span></dt><dd><dl><dt><span class="section"><a href="manual/status.html#iso.1998.status">Implementation Status</a></span></dt><dt><span class="section"><a href="manual/status.html#iso.1998.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="manual/status.html#status.iso.2011">C++ 2011</a></span></dt><dd><dl><dt><span class="section"><a href="manual/status.html#iso.2011.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="manual/status.html#status.iso.tr1">C++ TR1</a></span></dt><dd><dl><dt><span class="section"><a href="manual/status.html#iso.tr1.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="manual/status.html#status.iso.tr24733">C++ TR 24733</a></span></dt></dl></dd><dt><span class="section"><a href="manual/license.html">License</a></span></dt><dd><dl><dt><span class="section"><a href="manual/license.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="section"><a href="manual/license.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="section"><a href="manual/bugs.html">Bugs</a></span></dt><dd><dl><dt><span class="section"><a href="manual/bugs.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="section"><a href="manual/bugs.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/setup.html">2. Setup</a></span></dt><dd><dl><dt><span class="section"><a href="manual/setup.html#manual.intro.setup.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="manual/configure.html">Configure</a></span></dt><dt><span class="section"><a href="manual/make.html">Make</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/using.html">3. Using</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using.html#manual.intro.using.flags">Command Options</a></span></dt><dt><span class="section"><a href="manual/using_headers.html">Headers</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_headers.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="section"><a href="manual/using_headers.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="section"><a href="manual/using_headers.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="section"><a href="manual/using_headers.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="section"><a href="manual/using_macros.html">Macros</a></span></dt><dt><span class="section"><a href="manual/using_namespaces.html">Namespaces</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_namespaces.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="section"><a href="manual/using_namespaces.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="section"><a href="manual/using_namespaces.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="section"><a href="manual/using_dynamic_or_shared.html">Linking</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_dynamic_or_shared.html#manual.intro.using.linkage.freestanding">Almost Nothing</a></span></dt><dt><span class="section"><a href="manual/using_dynamic_or_shared.html#manual.intro.using.linkage.dynamic">Finding Dynamic or Shared Libraries</a></span></dt></dl></dd><dt><span class="section"><a href="manual/using_concurrency.html">Concurrency</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_concurrency.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="manual/using_concurrency.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="manual/using_concurrency.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="section"><a href="manual/using_concurrency.html#manual.intro.using.concurrency.io">IO</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_concurrency.html#concurrency.io.structure">Structure</a></span></dt><dt><span class="section"><a href="manual/using_concurrency.html#concurrency.io.defaults">Defaults</a></span></dt><dt><span class="section"><a href="manual/using_concurrency.html#concurrency.io.future">Future</a></span></dt><dt><span class="section"><a href="manual/using_concurrency.html#concurrency.io.alt">Alternatives</a></span></dt></dl></dd><dt><span class="section"><a href="manual/using_concurrency.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="section"><a href="manual/using_exceptions.html">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_exceptions.html#intro.using.exception.safety">Exception Safety</a></span></dt><dt><span class="section"><a href="manual/using_exceptions.html#intro.using.exception.propagating">Exception Neutrality</a></span></dt><dt><span class="section"><a href="manual/using_exceptions.html#intro.using.exception.no">Doing without</a></span></dt><dt><span class="section"><a href="manual/using_exceptions.html#intro.using.exception.compat">Compatibility</a></span></dt><dd><dl><dt><span class="section"><a href="manual/using_exceptions.html#using.exception.compat.c">With <code class="literal">C</code></a></span></dt><dt><span class="section"><a href="manual/using_exceptions.html#using.exception.compat.posix">With <code class="literal">POSIX</code> thread cancellation</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="section"><a href="manual/debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.races">Data Race Hunting</a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt><dt><span class="section"><a href="manual/debug.html#debug.profile_mode">Profile-based Performance Analysis</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="manual/std_contents.html">II.

142

@@ -34,13 +34,13 @@

143

</a></span></dt><dd><dl><dt><span class="section"><a href="manual/diagnostics.html#std.diagnostics.exceptions">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="manual/diagnostics.html#std.diagnostics.exceptions.api">API Reference</a></span></dt><dt><span class="section"><a href="manual/diagnostics.html#std.diagnostics.exceptions.data">Adding Data to <code class="classname">exception</code></a></span></dt></dl></dd><dt><span class="section"><a href="manual/concept_checking.html">Concept Checking</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/utilities.html">6.

144

Utilities

145

146

-</a></span></dt><dd><dl><dt><span class="section"><a href="manual/utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="manual/pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="manual/memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#idp13920976">Interface Design</a></span></dt><dt><span class="section"><a href="manual/memory.html#idp13924528">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="manual/memory.html#idp13937824">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="manual/memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="manual/memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#idp15512272">Class Hierarchy</a></span></dt><dt><span class="section"><a href="manual/memory.html#idp15534784">Thread Safety</a></span></dt><dt><span class="section"><a href="manual/memory.html#idp15542080">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="manual/memory.html#idp15556704">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#idp15573056">Examples</a></span></dt><dt><span class="section"><a href="manual/memory.html#idp15576640">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/traits.html">Traits</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/strings.html">7.

147

+</a></span></dt><dd><dl><dt><span class="section"><a href="manual/utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="manual/pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="manual/memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#idm270001611968">Interface Design</a></span></dt><dt><span class="section"><a href="manual/memory.html#idm270001608416">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="manual/memory.html#idm270001595120">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="manual/memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="manual/memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="manual/memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#idm270000019344">Class Hierarchy</a></span></dt><dt><span class="section"><a href="manual/memory.html#idm269999996832">Thread Safety</a></span></dt><dt><span class="section"><a href="manual/memory.html#idm269999989536">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="manual/memory.html#idm269999974912">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="manual/memory.html#idm269999958496">Examples</a></span></dt><dt><span class="section"><a href="manual/memory.html#idm269999954912">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="manual/memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/traits.html">Traits</a></span></dt></dl></dd><dt><span class="chapter"><a href="manual/strings.html">7.

148

Strings

149

150

</a></span></dt><dd><dl><dt><span class="section"><a href="manual/strings.html#std.strings.string">String Classes</a></span></dt><dd><dl><dt><span class="section"><a href="manual/strings.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="section"><a href="manual/strings.html#strings.string.case">Case Sensitivity</a></span></dt><dt><span class="section"><a href="manual/strings.html#strings.string.character_types">Arbitrary Character Types</a></span></dt><dt><span class="section"><a href="manual/strings.html#strings.string.token">Tokenizing</a></span></dt><dt><span class="section"><a href="manual/strings.html#strings.string.shrink">Shrink to Fit</a></span></dt><dt><span class="section"><a href="manual/strings.html#strings.string.Cstring">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/localization.html">8.

151

Localization

152

153

-</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="manual/localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="manual/localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#idp15778336">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="manual/facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="manual/facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="manual/facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/containers.html">9.

154

+</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="manual/localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="manual/localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#idm269999753024">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="manual/facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="manual/facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="manual/facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="manual/facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="manual/facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="manual/facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/containers.html">9.

155

Containers

156

157

</a></span></dt><dd><dl><dt><span class="section"><a href="manual/containers.html#std.containers.sequences">Sequences</a></span></dt><dd><dl><dt><span class="section"><a href="manual/containers.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="section"><a href="manual/containers.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="section"><a href="manual/containers.html#containers.sequences.vector">vector</a></span></dt><dd><dl><dt><span class="section"><a href="manual/containers.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/associative.html">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="manual/associative.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="section"><a href="manual/associative.html#containers.associative.bitset">bitset</a></span></dt><dd><dl><dt><span class="section"><a href="manual/associative.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="section"><a href="manual/associative.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/unordered_associative.html">Unordered Associative</a></span></dt><dd><dl><dt><span class="section"><a href="manual/unordered_associative.html#containers.unordered.hash">Hash Code</a></span></dt><dd><dl><dt><span class="section"><a href="manual/unordered_associative.html#containers.unordered.cache">Hash Code Caching Policy</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="manual/containers_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="manual/containers_and_c.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="manual/iterators.html">10.

158

Index: libstdc++-v3/doc/html/api.html

159

===================================================================

160

--- a/src/libstdc++-v3/doc/html/api.html (.../tags/gcc_4_8_2_release)

161

+++ b/src/libstdc++-v3/doc/html/api.html (.../branches/gcc-4_8-branch)

162

@@ -1,12 +1,12 @@

163

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

164

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library API Reference</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="bk02.html" title="" /><link rel="prev" href="bk02.html" title="" /><link rel="next" href="bk03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library API Reference</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk02.html">Prev</a> </td><th width="60%" align="center"></th><td width="20%" align="right"> <a accesskey="n" href="bk03.html">Next</a></td></tr></table><hr /></div><div class="article"><div class="titlepage"><div><div><h1 class="title"><a id="api"></a>The GNU C++ Library API Reference</h1></div><div><p class="copyright">Copyright ©

165

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library API Reference</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="index.html" title="The GNU C++ Library" /><link rel="up" href="bk02.html" title="" /><link rel="prev" href="bk02.html" title="" /><link rel="next" href="bk03.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library API Reference</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bk02.html">Prev</a> </td><th width="60%" align="center"></th><td width="20%" align="right"> <a accesskey="n" href="bk03.html">Next</a></td></tr></table><hr /></div><div class="article"><div class="titlepage"><div><div><h1 class="title"><a id="api"></a>The GNU C++ Library API Reference</h1></div><div><p class="copyright">Copyright ©

166

2008

167

,

168

2010

169

170

<a class="link" href="http://www.fsf.org/" target="_top">FSF

171

</a>

172

- </p></div><div><div class="legalnotice"><a id="idp3706336"></a><p>

173

+ </p></div><div><div class="legalnotice"><a id="idm270006235696"></a><p>

174

<a class="link" href="manual/license.html" title="License">License

175

</a>

176

</p></div></div></div><hr /></div><p>

177

Index: libstdc++-v3/doc/html/manual/dynamic_memory.html

178

===================================================================

179

--- a/src/libstdc++-v3/doc/html/manual/dynamic_memory.html (.../tags/gcc_4_8_2_release)

180

+++ b/src/libstdc++-v3/doc/html/manual/dynamic_memory.html (.../branches/gcc-4_8-branch)

181

@@ -1,5 +1,5 @@

182

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

183

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Dynamic Memory</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="support.html" title="Chapter 4. Support" /><link rel="prev" href="support.html" title="Chapter 4. Support" /><link rel="next" href="termination.html" title="Termination" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Dynamic Memory</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="support.html">Prev</a> </td><th width="60%" align="center">Chapter 4.

184

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Dynamic Memory</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="support.html" title="Chapter 4. Support" /><link rel="prev" href="support.html" title="Chapter 4. Support" /><link rel="next" href="termination.html" title="Termination" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Dynamic Memory</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="support.html">Prev</a> </td><th width="60%" align="center">Chapter 4.

185

Support

186

187

</th><td width="20%" align="right"> <a accesskey="n" href="termination.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.support.memory"></a>Dynamic Memory</h2></div></div></div><p>

188

Index: libstdc++-v3/doc/html/manual/iterators.html

189

===================================================================

190

--- a/src/libstdc++-v3/doc/html/manual/iterators.html (.../tags/gcc_4_8_2_release)

191

+++ b/src/libstdc++-v3/doc/html/manual/iterators.html (.../branches/gcc-4_8-branch)

192

@@ -1,13 +1,13 @@

193

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

194

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 10. Iterators</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="containers_and_c.html" title="Interacting with C" /><link rel="next" href="algorithms.html" title="Chapter 11. Algorithms" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 10.

195

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 10. Iterators</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="containers_and_c.html" title="Interacting with C" /><link rel="next" href="algorithms.html" title="Chapter 11. Algorithms" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 10.

196

Iterators

197

198

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="containers_and_c.html">Prev</a> </td><th width="60%" align="center">Part II.

199

Standard Contents

200

</th><td width="20%" align="right"> <a accesskey="n" href="algorithms.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.iterators"></a>Chapter 10.

201

Iterators

202

- <a id="idp16156992" class="indexterm"></a>

203

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="iterators.html#std.iterators.predefined">Predefined</a></span></dt><dd><dl><dt><span class="section"><a href="iterators.html#iterators.predefined.vs_pointers">Iterators vs. Pointers</a></span></dt><dt><span class="section"><a href="iterators.html#iterators.predefined.end">One Past the End</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.iterators.predefined"></a>Predefined</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="iterators.predefined.vs_pointers"></a>Iterators vs. Pointers</h3></div></div></div><p>

204

+ <a id="idm269999374096" class="indexterm"></a>

205

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="iterators.html#std.iterators.predefined">Predefined</a></span></dt><dd><dl><dt><span class="section"><a href="iterators.html#iterators.predefined.vs_pointers">Iterators vs. Pointers</a></span></dt><dt><span class="section"><a href="iterators.html#iterators.predefined.end">One Past the End</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.iterators.predefined"></a>Predefined</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="iterators.predefined.vs_pointers"></a>Iterators vs. Pointers</h3></div></div></div><p>

206

The following

207

FAQ <a class="link" href="../faq.html#faq.iterator_as_pod" title="7.1.">entry</a> points out that

208

iterators are not implemented as pointers. They are a generalization

209

Index: libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html

210

===================================================================

211

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html (.../tags/gcc_4_8_2_release)

212

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator_ex_single.html (.../branches/gcc-4_8-branch)

213

@@ -1,5 +1,5 @@

214

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

215

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Single Thread Example</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator_impl.html" title="Implementation" /><link rel="next" href="mt_allocator_ex_multi.html" title="Multiple Thread Example" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Single Thread Example</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_impl.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_ex_multi.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.example_single"></a>Single Thread Example</h2></div></div></div><p>

216

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Single Thread Example</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator_impl.html" title="Implementation" /><link rel="next" href="mt_allocator_ex_multi.html" title="Multiple Thread Example" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Single Thread Example</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_impl.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_ex_multi.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.example_single"></a>Single Thread Example</h2></div></div></div><p>

217

Let's start by describing how the data on a freelist is laid out in memory.

218

This is the first two blocks in freelist for thread id 3 in bin 3 (8 bytes):

219

</p><pre class="programlisting">

220

Index: libstdc++-v3/doc/html/manual/generalized_numeric_operations.html

221

===================================================================

222

--- a/src/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html (.../tags/gcc_4_8_2_release)

223

+++ b/src/libstdc++-v3/doc/html/manual/generalized_numeric_operations.html (.../branches/gcc-4_8-branch)

224

@@ -1,5 +1,5 @@

225

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

226

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Generalized Operations</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="numerics.html" title="Chapter 12. Numerics" /><link rel="prev" href="numerics.html" title="Chapter 12. Numerics" /><link rel="next" href="numerics_and_c.html" title="Interacting with C" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Generalized Operations</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="numerics.html">Prev</a> </td><th width="60%" align="center">Chapter 12.

227

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Generalized Operations</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="numerics.html" title="Chapter 12. Numerics" /><link rel="prev" href="numerics.html" title="Chapter 12. Numerics" /><link rel="next" href="numerics_and_c.html" title="Interacting with C" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Generalized Operations</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="numerics.html">Prev</a> </td><th width="60%" align="center">Chapter 12.

228

Numerics

229

230

</th><td width="20%" align="right"> <a accesskey="n" href="numerics_and_c.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.numerics.generalized_ops"></a>Generalized Operations</h2></div></div></div><p>

231

Index: libstdc++-v3/doc/html/manual/mt_allocator.html

232

===================================================================

233

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator.html (.../tags/gcc_4_8_2_release)

234

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator.html (.../branches/gcc-4_8-branch)

235

@@ -1,8 +1,8 @@

236

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

237

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 20. The mt_allocator</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="profile_mode_diagnostics.html" title="Diagnostics" /><link rel="next" href="mt_allocator_design.html" title="Design Issues" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 20. The mt_allocator</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_diagnostics.html">Prev</a> </td><th width="60%" align="center">Part III.

238

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 20. The mt_allocator</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="profile_mode_diagnostics.html" title="Diagnostics" /><link rel="next" href="mt_allocator_design.html" title="Design Issues" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 20. The mt_allocator</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_diagnostics.html">Prev</a> </td><th width="60%" align="center">Part III.

239

Extensions

240

241

-</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_design.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.allocator.mt"></a>Chapter 20. The mt_allocator</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="mt_allocator.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="section"><a href="mt_allocator_design.html">Design Issues</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator_design.html#allocator.mt.overview">Overview</a></span></dt></dl></dd><dt><span class="section"><a href="mt_allocator_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.tune">Tunable Parameters</a></span></dt><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.init">Initialization</a></span></dt><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.deallocation">Deallocation Notes</a></span></dt></dl></dd><dt><span class="section"><a href="mt_allocator_ex_single.html">Single Thread Example</a></span></dt><dt><span class="section"><a href="mt_allocator_ex_multi.html">Multiple Thread Example</a></span></dt></dl></div><p>

242

+</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_design.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.allocator.mt"></a>Chapter 20. The mt_allocator</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="mt_allocator.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="section"><a href="mt_allocator_design.html">Design Issues</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator_design.html#allocator.mt.overview">Overview</a></span></dt></dl></dd><dt><span class="section"><a href="mt_allocator_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.tune">Tunable Parameters</a></span></dt><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.init">Initialization</a></span></dt><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.deallocation">Deallocation Notes</a></span></dt></dl></dd><dt><span class="section"><a href="mt_allocator_ex_single.html">Single Thread Example</a></span></dt><dt><span class="section"><a href="mt_allocator_ex_multi.html">Multiple Thread Example</a></span></dt></dl></div><p>

243

</p><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.intro"></a>Intro</h2></div></div></div><p>

244

The mt allocator [hereinafter referred to simply as "the allocator"]

245

is a fixed size (power of two) allocator that was initially

246

Index: libstdc++-v3/doc/html/manual/unordered_associative.html

247

===================================================================

248

--- a/src/libstdc++-v3/doc/html/manual/unordered_associative.html (.../tags/gcc_4_8_2_release)

249

+++ b/src/libstdc++-v3/doc/html/manual/unordered_associative.html (.../branches/gcc-4_8-branch)

250

@@ -1,5 +1,5 @@

251

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

252

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Unordered Associative</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="containers.html" title="Chapter 9. Containers" /><link rel="prev" href="associative.html" title="Associative" /><link rel="next" href="containers_and_c.html" title="Interacting with C" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Unordered Associative</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="associative.html">Prev</a> </td><th width="60%" align="center">Chapter 9.

253

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Unordered Associative</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="containers.html" title="Chapter 9. Containers" /><link rel="prev" href="associative.html" title="Associative" /><link rel="next" href="containers_and_c.html" title="Interacting with C" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Unordered Associative</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="associative.html">Prev</a> </td><th width="60%" align="center">Chapter 9.

254

Containers

255

256

</th><td width="20%" align="right"> <a accesskey="n" href="containers_and_c.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.containers.unordered"></a>Unordered Associative</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="containers.unordered.hash"></a>Hash Code</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="containers.unordered.cache"></a>Hash Code Caching Policy</h4></div></div></div><p>

257

Index: libstdc++-v3/doc/html/manual/configure.html

258

===================================================================

259

--- a/src/libstdc++-v3/doc/html/manual/configure.html (.../tags/gcc_4_8_2_release)

260

+++ b/src/libstdc++-v3/doc/html/manual/configure.html (.../branches/gcc-4_8-branch)

261

@@ -1,5 +1,5 @@

262

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

263

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Configure</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, configure, options" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="setup.html" title="Chapter 2. Setup" /><link rel="prev" href="setup.html" title="Chapter 2. Setup" /><link rel="next" href="make.html" title="Make" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Configure</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="setup.html">Prev</a> </td><th width="60%" align="center">Chapter 2. Setup</th><td width="20%" align="right"> <a accesskey="n" href="make.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.setup.configure"></a>Configure</h2></div></div></div><p>

264

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Configure</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, configure, options" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="setup.html" title="Chapter 2. Setup" /><link rel="prev" href="setup.html" title="Chapter 2. Setup" /><link rel="next" href="make.html" title="Make" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Configure</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="setup.html">Prev</a> </td><th width="60%" align="center">Chapter 2. Setup</th><td width="20%" align="right"> <a accesskey="n" href="make.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.setup.configure"></a>Configure</h2></div></div></div><p>

265

When configuring libstdc++, you'll have to configure the entire

266

<span class="emphasis"><em>gccsrcdir</em></span> directory. Consider using the

267

toplevel gcc configuration option

268

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

269

===================================================================

270

--- a/src/libstdc++-v3/doc/html/manual/status.html (.../tags/gcc_4_8_2_release)

271

+++ b/src/libstdc++-v3/doc/html/manual/status.html (.../branches/gcc-4_8-branch)

272

@@ -1,13 +1,13 @@

273

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

274

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 1. Status</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="intro.html" title="Part I. Introduction" /><link rel="prev" href="intro.html" title="Part I. Introduction" /><link rel="next" href="license.html" title="License" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 1. Status</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="intro.html">Prev</a> </td><th width="60%" align="center">Part I.

275

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 1. Status</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="intro.html" title="Part I. Introduction" /><link rel="prev" href="intro.html" title="Part I. Introduction" /><link rel="next" href="license.html" title="License" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 1. Status</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="intro.html">Prev</a> </td><th width="60%" align="center">Part I.

276

Introduction

277

278

-</th><td width="20%" align="right"> <a accesskey="n" href="license.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.intro.status"></a>Chapter 1. Status</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="status.html#manual.intro.status.iso">Implementation Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#status.iso.1998">C++ 1998/2003</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.1998.status">Implementation Status</a></span></dt><dt><span class="section"><a href="status.html#iso.1998.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.2011">C++ 2011</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.2011.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr1">C++ TR1</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.tr1.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr24733">C++ TR 24733</a></span></dt></dl></dd><dt><span class="section"><a href="license.html">License</a></span></dt><dd><dl><dt><span class="section"><a href="license.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="section"><a href="license.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="section"><a href="bugs.html">Bugs</a></span></dt><dd><dl><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.status.iso"></a>Implementation Status</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="status.iso.1998"></a>C++ 1998/2003</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="iso.1998.status"></a>Implementation Status</h4></div></div></div><p>

279

+</th><td width="20%" align="right"> <a accesskey="n" href="license.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.intro.status"></a>Chapter 1. Status</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="status.html#manual.intro.status.iso">Implementation Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#status.iso.1998">C++ 1998/2003</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.1998.status">Implementation Status</a></span></dt><dt><span class="section"><a href="status.html#iso.1998.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.2011">C++ 2011</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.2011.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr1">C++ TR1</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.tr1.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr24733">C++ TR 24733</a></span></dt></dl></dd><dt><span class="section"><a href="license.html">License</a></span></dt><dd><dl><dt><span class="section"><a href="license.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="section"><a href="license.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="section"><a href="bugs.html">Bugs</a></span></dt><dd><dl><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.status.iso"></a>Implementation Status</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="status.iso.1998"></a>C++ 1998/2003</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="iso.1998.status"></a>Implementation Status</h4></div></div></div><p>

280

This status table is based on the table of contents of ISO/IEC 14882:2003.

281

</p><p>

282

This page describes the C++ support in mainline GCC SVN, not in any

283

particular release.

284

-</p><div class="table"><a id="idp452240"></a><p class="title"><strong>Table 1.1. C++ 1998/2003 Implementation Status</strong></p><div class="table-contents"><table summary="C++ 1998/2003 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">

285

+</p><div class="table"><a id="idm270008034928"></a><p class="title"><strong>Table 1.1. C++ 1998/2003 Implementation Status</strong></p><div class="table-contents"><table summary="C++ 1998/2003 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">

286

287

</td><td colspan="3" align="left">

288

<span class="emphasis"><em>Language support</em></span>

289

@@ -157,7 +157,7 @@

290

</p><p>

291

This page describes the C++11 support in mainline GCC SVN, not in any

292

particular release.

293

-</p><div class="table"><a id="idp8670848"></a><p class="title"><strong>Table 1.2. C++ 2011 Implementation Status</strong></p><div class="table-contents"><table summary="C++ 2011 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">

294

+</p><div class="table"><a id="idm270007982624"></a><p class="title"><strong>Table 1.2. C++ 2011 Implementation Status</strong></p><div class="table-contents"><table summary="C++ 2011 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">

295

296

</td><td colspan="3" align="left">

297

<span class="emphasis"><em>Language support</em></span>

298

@@ -183,7 +183,7 @@

299

is_trivially_copy_constructible, is_trivially_move_constructible,

300

is_trivially_assignable, is_trivially_default_assignable,

301

is_trivially_copy_assignable, is_trivially_move_assignable

302

- </td></tr><tr><td align="left">20.9.5</td><td align="left">Type property queries</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.6</td><td align="left">Relationships between types</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7</td><td align="left">Transformations between types</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.9.7.1</td><td align="left">Const-volatile modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.2</td><td align="left">Reference modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.3</td><td align="left">Sign modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.4</td><td align="left">Array modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.5</td><td align="left">Pointer modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.6</td><td align="left">Other transformations</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10</td><td align="left">Compile-time rational arithmetic</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.10.1</td><td align="left">In general</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.10.2</td><td align="left">Header <code class="code"><ratio></code> synopsis</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.10.3</td><td align="left">Class template <code class="code">ratio</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10.4</td><td align="left">Arithmetic on <code class="code">ratio</code>s</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10.5</td><td align="left">Comparison of <code class="code">ratio</code>s</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10.6</td><td align="left">SI types for <code class="code">ratio</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11</td><td align="left">Time utilities</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.11.3</td><td align="left">Clock requirements</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.4</td><td align="left">Time-related traits</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.11.4.1</td><td align="left"><code class="code">treat_as_floating_point</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.4.2</td><td align="left"><code class="code">duration_values</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.4.3</td><td align="left">Specializations of <code class="code">common_type</code></td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.11.5</td><td align="left">Class template <code class="code">duration</code></td><td align="left">Partial</td><td align="left">Missing constexpr for non-member arithmetic operations</td></tr><tr><td align="left">20.11.6</td><td align="left">Class template <code class="code">time_point</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.7</td><td align="left">Clocks</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.11.7.1</td><td align="left">Class <code class="code">system_clock</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.7.2</td><td align="left">Class <code class="code">steady_clock</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.7.3</td><td align="left">Class <code class="code">high_resolution_clock</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.8</td><td align="left">Date and time functions</td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.12</td><td align="left">Scoped allocator adaptor</td><td align="left">Partial</td><td align="left"> </td></tr><tr><td align="left">20.12.1</td><td align="left">Header <code class="code"><scoped_allocator></code> synopsis</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.12.2</td><td align="left">Scoped allocator adaptor member types</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.12.3</td><td align="left">Scoped allocator adaptor constructors</td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.12.4</td><td align="left">Scoped allocator adaptor members</td><td align="left">Partial</td><td align="left">OUTERMOST is not recursive.</td></tr><tr><td align="left">20.12.5</td><td align="left">Scoped allocator operators</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.13</td><td align="left">Class <code class="code">type_index</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">

303

+ </td></tr><tr><td align="left">20.9.5</td><td align="left">Type property queries</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.6</td><td align="left">Relationships between types</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7</td><td align="left">Transformations between types</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.9.7.1</td><td align="left">Const-volatile modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.2</td><td align="left">Reference modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.3</td><td align="left">Sign modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.4</td><td align="left">Array modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.9.7.5</td><td align="left">Pointer modifications</td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.9.7.6</td><td align="left">Other transformations</td><td align="left">Partial</td><td align="left">Missing <code class="code">aligned_union</code>.</td></tr><tr><td align="left">20.10</td><td align="left">Compile-time rational arithmetic</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.10.1</td><td align="left">In general</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.10.2</td><td align="left">Header <code class="code"><ratio></code> synopsis</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.10.3</td><td align="left">Class template <code class="code">ratio</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10.4</td><td align="left">Arithmetic on <code class="code">ratio</code>s</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10.5</td><td align="left">Comparison of <code class="code">ratio</code>s</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.10.6</td><td align="left">SI types for <code class="code">ratio</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11</td><td align="left">Time utilities</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.11.3</td><td align="left">Clock requirements</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.4</td><td align="left">Time-related traits</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.11.4.1</td><td align="left"><code class="code">treat_as_floating_point</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.4.2</td><td align="left"><code class="code">duration_values</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.4.3</td><td align="left">Specializations of <code class="code">common_type</code></td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.11.5</td><td align="left">Class template <code class="code">duration</code></td><td align="left">Partial</td><td align="left">Missing constexpr for non-member arithmetic operations</td></tr><tr><td align="left">20.11.6</td><td align="left">Class template <code class="code">time_point</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.7</td><td align="left">Clocks</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.11.7.1</td><td align="left">Class <code class="code">system_clock</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.7.2</td><td align="left">Class <code class="code">steady_clock</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.7.3</td><td align="left">Class <code class="code">high_resolution_clock</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.11.8</td><td align="left">Date and time functions</td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.12</td><td align="left">Scoped allocator adaptor</td><td align="left">Partial</td><td align="left"> </td></tr><tr><td align="left">20.12.1</td><td align="left">Header <code class="code"><scoped_allocator></code> synopsis</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">20.12.2</td><td align="left">Scoped allocator adaptor member types</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.12.3</td><td align="left">Scoped allocator adaptor constructors</td><td align="left">Y</td><td align="left"> </td></tr><tr bgcolor="#B0B0B0"><td align="left">20.12.4</td><td align="left">Scoped allocator adaptor members</td><td align="left">Partial</td><td align="left">OUTERMOST is not recursive.</td></tr><tr><td align="left">20.12.5</td><td align="left">Scoped allocator operators</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">20.13</td><td align="left">Class <code class="code">type_index</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">

304

305

</td><td colspan="3" align="left">

306

<span class="emphasis"><em>Strings</em></span>

307

@@ -302,7 +302,7 @@

308

</p><p>

309

This page describes the TR1 support in mainline GCC SVN, not in any particular

310

release.

311

-</p><div class="table"><a id="idp7483200"></a><p class="title"><strong>Table 1.3. C++ TR1 Implementation Status</strong></p><div class="table-contents"><table summary="C++ TR1 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left"><span class="emphasis"><em>2</em></span></td><td colspan="3" align="left"><span class="emphasis"><em>General Utilities</em></span></td></tr><tr><td align="left">2.1</td><td align="left">Reference wrappers</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.1</td><td align="left">Additions to header <code class="code"><functional></code> synopsis</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.1</td><td align="left"><code class="code">reference_wrapper</code> construct/copy/destroy</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.2</td><td align="left"><code class="code">reference_wrapper</code> assignment</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.3</td><td align="left"><code class="code">reference_wrapper</code> access</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.4</td><td align="left"><code class="code">reference_wrapper</code> invocation</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.5</td><td align="left"><code class="code">reference_wrapper</code> helper functions</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.2</td><td align="left">Smart pointers</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.1</td><td align="left">Additions to header <code class="code"><memory></code> synopsis</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.2.2</td><td align="left">Class <code class="code">bad_weak_ptr</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.2.3</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left"> </td><td align="left">

312

+</p><div class="table"><a id="idm270006687472"></a><p class="title"><strong>Table 1.3. C++ TR1 Implementation Status</strong></p><div class="table-contents"><table summary="C++ TR1 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left"><span class="emphasis"><em>2</em></span></td><td colspan="3" align="left"><span class="emphasis"><em>General Utilities</em></span></td></tr><tr><td align="left">2.1</td><td align="left">Reference wrappers</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.1</td><td align="left">Additions to header <code class="code"><functional></code> synopsis</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2</td><td align="left">Class template <code class="code">reference_wrapper</code></td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.1.2.1</td><td align="left"><code class="code">reference_wrapper</code> construct/copy/destroy</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.2</td><td align="left"><code class="code">reference_wrapper</code> assignment</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.3</td><td align="left"><code class="code">reference_wrapper</code> access</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.4</td><td align="left"><code class="code">reference_wrapper</code> invocation</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.1.2.5</td><td align="left"><code class="code">reference_wrapper</code> helper functions</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.2</td><td align="left">Smart pointers</td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left">2.2.1</td><td align="left">Additions to header <code class="code"><memory></code> synopsis</td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.2.2</td><td align="left">Class <code class="code">bad_weak_ptr</code></td><td align="left">Y</td><td align="left"> </td></tr><tr><td align="left">2.2.3</td><td align="left">Class template <code class="code">shared_ptr</code></td><td align="left"> </td><td align="left">

313

<p>

314

Uses code from

315

<a class="link" href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm" target="_top">boost::shared_ptr</a>.

316

@@ -323,7 +323,7 @@

317

</p><p>

318

This page describes the TR 24733 support in mainline GCC SVN, not in any

319

particular release.

320

-</p><div class="table"><a id="idp12559072"></a><p class="title"><strong>Table 1.4. C++ TR 24733 Implementation Status</strong></p><div class="table-contents"><table summary="C++ TR 24733 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">

321

+</p><div class="table"><a id="idm270002960368"></a><p class="title"><strong>Table 1.4. C++ TR 24733 Implementation Status</strong></p><div class="table-contents"><table summary="C++ TR 24733 Implementation Status" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Section</th><th align="left">Description</th><th align="left">Status</th><th align="left">Comments</th></tr></thead><tbody><tr><td align="left">

322

323

</td><td colspan="3" align="left">

324

<span class="emphasis"><em>Introduction</em></span>

325

Index: libstdc++-v3/doc/html/manual/profile_mode_devel.html

326

===================================================================

327

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_devel.html (.../tags/gcc_4_8_2_release)

328

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_devel.html (.../branches/gcc-4_8-branch)

329

@@ -1,5 +1,5 @@

330

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

331

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Developer Information</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_impl.html" title="Implementation Issues" /><link rel="next" href="profile_mode_diagnostics.html" title="Diagnostics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Developer Information</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_impl.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_diagnostics.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.developer"></a>Developer Information</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.developer.bigpic"></a>Big Picture</h3></div></div></div><p>The profile mode headers are included with

332

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Developer Information</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_impl.html" title="Implementation Issues" /><link rel="next" href="profile_mode_diagnostics.html" title="Diagnostics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Developer Information</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_impl.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_diagnostics.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.developer"></a>Developer Information</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.developer.bigpic"></a>Big Picture</h3></div></div></div><p>The profile mode headers are included with

333

<code class="code">-D_GLIBCXX_PROFILE</code> through preprocessor directives in

334

<code class="code">include/std/*</code>.

335

</p><p>Instrumented implementations are provided in

336

Index: libstdc++-v3/doc/html/manual/debug_mode_design.html

337

===================================================================

338

--- a/src/libstdc++-v3/doc/html/manual/debug_mode_design.html (.../tags/gcc_4_8_2_release)

339

+++ b/src/libstdc++-v3/doc/html/manual/debug_mode_design.html (.../branches/gcc-4_8-branch)

340

@@ -1,5 +1,5 @@

341

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

342

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="prev" href="debug_mode_using.html" title="Using" /><link rel="next" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode_using.html">Prev</a> </td><th width="60%" align="center">Chapter 17. Debug Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.design"></a>Design</h2></div></div></div><p>

343

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="prev" href="debug_mode_using.html" title="Using" /><link rel="next" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode_using.html">Prev</a> </td><th width="60%" align="center">Chapter 17. Debug Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.design"></a>Design</h2></div></div></div><p>

344

</p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="debug_mode.design.goals"></a>Goals</h3></div></div></div><p>

345

</p><p> The libstdc++ debug mode replaces unsafe (but efficient) standard

346

containers and iterators with semantically equivalent safe standard

347

@@ -391,7 +391,7 @@

348

</p><p> There are several existing implementations of debug modes for C++

349

standard library implementations, although none of them directly

350

supports debugging for programs using libstdc++. The existing

351

- implementations include:</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p><a class="link" href="http://www.mathcs.sjsu.edu/faculty/horstman/safestl.html" target="_top">SafeSTL</a>:

352

+ implementations include:</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p><a class="link" href="http://www.cs.sjsu.edu/faculty/horstman/safestl.html" target="_top">SafeSTL</a>:

353

SafeSTL was the original debugging version of the Standard Template

354

Library (STL), implemented by Cay S. Horstmann on top of the

355

Hewlett-Packard STL. Though it inspired much work in this area, it

356

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

357

===================================================================

358

--- a/src/libstdc++-v3/doc/html/manual/policy_data_structures_design.html (.../tags/gcc_4_8_2_release)

359

+++ b/src/libstdc++-v3/doc/html/manual/policy_data_structures_design.html (.../branches/gcc-4_8-branch)

360

@@ -1,5 +1,5 @@

361

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

362

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_data_structures_using.html" title="Using" /><link rel="next" href="policy_based_data_structures_test.html" title="Testing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures_using.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="policy_based_data_structures_test.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="containers.pbds.design"></a>Design</h2></div></div></div><p></p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.design.concepts"></a>Concepts</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="pbds.design.concepts.null_type"></a>Null Policy Classes</h4></div></div></div><p>

363

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_data_structures_using.html" title="Using" /><link rel="next" href="policy_based_data_structures_test.html" title="Testing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures_using.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="policy_based_data_structures_test.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="containers.pbds.design"></a>Design</h2></div></div></div><p></p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.design.concepts"></a>Concepts</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="pbds.design.concepts.null_type"></a>Null Policy Classes</h4></div></div></div><p>

364

Associative containers are typically parametrized by various

365

policies. For example, a hash-based associative container is

366

parametrized by a hash-functor, transforming each key into an

367

@@ -170,7 +170,7 @@

368

naturally; collision-chaining hash tables (label B) store

369

equivalent-key values in the same bucket, the bucket can be

370

arranged so that equivalent-key values are consecutive.

371

- </p><div class="figure"><a id="idp18000448"></a><p class="title"><strong>Figure 22.8. Non-unique Mapping Standard Containers</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_embedded_lists_1.png" align="middle" alt="Non-unique Mapping Standard Containers" /></div></div></div><br class="figure-break" /><p>

372

+ </p><div class="figure"><a id="idm269997530416"></a><p class="title"><strong>Figure 22.8. Non-unique Mapping Standard Containers</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_embedded_lists_1.png" align="middle" alt="Non-unique Mapping Standard Containers" /></div></div></div><br class="figure-break" /><p>

373

Put differently, the standards' non-unique mapping

374

associative-containers are associative containers that map

375

primary keys to linked lists that are embedded into the

376

@@ -252,7 +252,7 @@

377

first graphic above. Labels A and B, respectively. Each shaded

378

box represents some size-type or secondary

379

associative-container.

380

- </p><div class="figure"><a id="idp18023952"></a><p class="title"><strong>Figure 22.10. Non-unique Mapping Containers</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_embedded_lists_3.png" align="middle" alt="Non-unique Mapping Containers" /></div></div></div><br class="figure-break" /><p>

381

+ </p><div class="figure"><a id="idm269997506912"></a><p class="title"><strong>Figure 22.10. Non-unique Mapping Containers</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_embedded_lists_3.png" align="middle" alt="Non-unique Mapping Containers" /></div></div></div><br class="figure-break" /><p>

382

In the first example above, then, one would use an associative

383

container mapping each user to an associative container which

384

maps each application id to a start time (see

385

@@ -305,7 +305,7 @@

386

shows invariants for order-preserving containers: point-type

387

iterators are synonymous with range-type iterators.

388

Orthogonally, <span class="emphasis"><em>C</em></span>shows invariants for "set"

389

- containers: iterators are synonymous with const iterators.</p><div class="figure"><a id="idp18043824"></a><p class="title"><strong>Figure 22.11. Point Iterator Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_point_iterator_hierarchy.png" align="middle" alt="Point Iterator Hierarchy" /></div></div></div><br class="figure-break" /><p>Note that point-type iterators in self-organizing containers

390

+ containers: iterators are synonymous with const iterators.</p><div class="figure"><a id="idm269997487104"></a><p class="title"><strong>Figure 22.11. Point Iterator Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_point_iterator_hierarchy.png" align="middle" alt="Point Iterator Hierarchy" /></div></div></div><br class="figure-break" /><p>Note that point-type iterators in self-organizing containers

391

(hash-based associative containers) lack movement

392

operators, such as <code class="literal">operator++</code> - in fact, this

393

is the reason why this library differentiates from the standard C++ librarys

394

@@ -344,7 +344,7 @@

395

to the question of whether point-type iterators and range-type

396

iterators are valid. The graphic below shows tags corresponding to

397

different types of invalidation guarantees.

398

- </p><div class="figure"><a id="idp18057168"></a><p class="title"><strong>Figure 22.12. Invalidation Guarantee Tags Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_invalidation_tag_hierarchy.png" align="middle" alt="Invalidation Guarantee Tags Hierarchy" /></div></div></div><br class="figure-break" /><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>

399

+ </p><div class="figure"><a id="idm269997473760"></a><p class="title"><strong>Figure 22.12. Invalidation Guarantee Tags Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_invalidation_tag_hierarchy.png" align="middle" alt="Invalidation Guarantee Tags Hierarchy" /></div></div></div><br class="figure-break" /><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>

400

<code class="classname">basic_invalidation_guarantee</code>

401

corresponds to a basic guarantee that a point-type iterator,

402

a found pointer, or a found reference, remains valid as long

403

@@ -428,7 +428,7 @@

404

</p><p>

405

This library contains a container tag hierarchy corresponding to the

406

diagram below.

407

- </p><div class="figure"><a id="idp18087392"></a><p class="title"><strong>Figure 22.13. Container Tag Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_container_tag_hierarchy.png" align="middle" alt="Container Tag Hierarchy" /></div></div></div><br class="figure-break" /><p>

408

+ </p><div class="figure"><a id="idm269997443664"></a><p class="title"><strong>Figure 22.13. Container Tag Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_container_tag_hierarchy.png" align="middle" alt="Container Tag Hierarchy" /></div></div></div><br class="figure-break" /><p>

409

Given any container <span class="type">Cntnr</span>, the tag of

410

the underlying data structure can be found via <code class="literal">typename

411

Cntnr::container_category</code>.

412

@@ -487,7 +487,7 @@

413

collision-chaining container, except for the following.</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p><code class="classname">Comb_Probe_Fn</code> describes how to transform a probe

414

sequence into a sequence of positions within the table.</p></li><li class="listitem"><p><code class="classname">Probe_Fn</code> describes a probe sequence policy.</p></li></ol></div><p>Some of the default template values depend on the values of

415

other parameters, and are explained below.</p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="container.hash.details"></a>Details</h5></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.hash.details.hash_policies"></a>Hash Policies</h6></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="details.hash_policies.general"></a>General</h6></div></div></div><p>Following is an explanation of some functions which hashing

416

- involves. The graphic below illustrates the discussion.</p><div class="figure"><a id="idp18127536"></a><p class="title"><strong>Figure 22.14. Hash functions, ranged-hash functions, and

417

+ involves. The graphic below illustrates the discussion.</p><div class="figure"><a id="idm269997403584"></a><p class="title"><strong>Figure 22.14. Hash functions, ranged-hash functions, and

418

range-hashing functions</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_ranged_hash_range_hashing_fns.png" align="middle" alt="Hash functions, ranged-hash functions, and range-hashing functions" /></div></div></div><br class="figure-break" /><p>Let U be a domain (e.g., the integers, or the

419

strings of 3 characters). A hash-table algorithm needs to map

420

elements of U "uniformly" into the range [0,..., m -

421

@@ -504,7 +504,7 @@

422

Z<sub>+</sub>,</p><p>which maps a non-negative hash value, and a non-negative

423

range upper-bound into a non-negative integral in the range

424

between 0 (inclusive) and the range upper bound (exclusive),

425

- i.e., for any r in Z<sub>+</sub>,</p><p>0 ≤ g(r, m) ≤ m - 1</p><p>The resulting ranged-hash function, is</p><div class="equation"><a id="idp18141344"></a><p class="title"><strong>Equation 22.1. Ranged Hash Function</strong></p><div class="equation-contents"><span class="mathphrase">

426

+ i.e., for any r in Z<sub>+</sub>,</p><p>0 ≤ g(r, m) ≤ m - 1</p><p>The resulting ranged-hash function, is</p><div class="equation"><a id="idm269997389776"></a><p class="title"><strong>Equation 22.1. Ranged Hash Function</strong></p><div class="equation-contents"><span class="mathphrase">

427

f(u , m) = g(h(u), m)

428

</span></div></div><br class="equation-break" /><p>From the above, it is obvious that given g and

429

h, f can always be composed (however the converse

430

@@ -524,7 +524,7 @@

431

transforming the sequence of hash values into a sequence of

432

positions.</p></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="details.hash_policies.range"></a>Range Hashing</h6></div></div></div><p>Some common choices for range-hashing functions are the

433

division, multiplication, and middle-square methods (<a class="xref" href="policy_data_structures.html#biblio.knuth98sorting" title="The Art of Computer Programming - Sorting and Searching">[biblio.knuth98sorting]</a>), defined

434

- as</p><div class="equation"><a id="idp18147232"></a><p class="title"><strong>Equation 22.2. Range-Hashing, Division Method</strong></p><div class="equation-contents"><span class="mathphrase">

435

+ as</p><div class="equation"><a id="idm269997383888"></a><p class="title"><strong>Equation 22.2. Range-Hashing, Division Method</strong></p><div class="equation-contents"><span class="mathphrase">

436

g(r, m) = r mod m

437

</span></div></div><br class="equation-break" /><p>g(r, m) = ⌈ u/v ( a r mod v ) ⌉</p><p>and</p><p>g(r, m) = ⌈ u/v ( r<sup>2</sup> mod v ) ⌉</p><p>respectively, for some positive integrals u and

438

v (typically powers of 2), and some a. Each of

439

@@ -535,9 +535,9 @@

440

implement using the low

441

level % (modulo) operation (for any m), or the

442

low level & (bit-mask) operation (for the case where

443

- m is a power of 2), i.e.,</p><div class="equation"><a id="idp18151744"></a><p class="title"><strong>Equation 22.3. Division via Prime Modulo</strong></p><div class="equation-contents"><span class="mathphrase">

444

+ m is a power of 2), i.e.,</p><div class="equation"><a id="idm269997379376"></a><p class="title"><strong>Equation 22.3. Division via Prime Modulo</strong></p><div class="equation-contents"><span class="mathphrase">

445

g(r, m) = r % m

446

- </span></div></div><br class="equation-break" /><p>and</p><div class="equation"><a id="idp18153568"></a><p class="title"><strong>Equation 22.4. Division via Bit Mask</strong></p><div class="equation-contents"><span class="mathphrase">

447

+ </span></div></div><br class="equation-break" /><p>and</p><div class="equation"><a id="idm269997377552"></a><p class="title"><strong>Equation 22.4. Division via Bit Mask</strong></p><div class="equation-contents"><span class="mathphrase">

448

g(r, m) = r & m - 1, (with m =

449

2<sup>k</sup> for some k)

450

</span></div></div><br class="equation-break" /><p>respectively.</p><p>The % (modulo) implementation has the advantage that for

451

@@ -563,7 +563,7 @@

452

s = [ s<sub>0</sub>,..., s<sub>t - 1</sub>]

453

</p><p>be a string of t characters, each of which is from

454

domain S. Consider the following ranged-hash

455

- function:</p><div class="equation"><a id="idp18163200"></a><p class="title"><strong>Equation 22.5.

456

+ function:</p><div class="equation"><a id="idm269997367984"></a><p class="title"><strong>Equation 22.5.

457

A Standard String Hash Function

458

</strong></p><div class="equation-contents"><span class="mathphrase">

459

f<sub>1</sub>(s, m) = ∑ <sub>i =

460

@@ -575,7 +575,7 @@

461

of a long DNA sequence (and so S = {'A', 'C', 'G',

462

'T'}). In this case, scanning the entire string might be

463

prohibitively expensive. A possible alternative might be to use

464

- only the first k characters of the string, where</p><p>|S|<sup>k</sup> ≥ m ,</p><p>i.e., using the hash function</p><div class="equation"><a id="idp18169344"></a><p class="title"><strong>Equation 22.6.

465

+ only the first k characters of the string, where</p><p>|S|<sup>k</sup> ≥ m ,</p><p>i.e., using the hash function</p><div class="equation"><a id="idm269997361840"></a><p class="title"><strong>Equation 22.6.

466

Only k String DNA Hash

467

</strong></p><div class="equation-contents"><span class="mathphrase">

468

f<sub>2</sub>(s, m) = ∑ <sub>i

469

@@ -606,12 +606,12 @@

470

the container transforms the key into a non-negative integral

471

using the hash functor (points B and C), and transforms the

472

result into a position using the combining functor (points D

473

- and E).</p><div class="figure"><a id="idp18191968"></a><p class="title"><strong>Figure 22.15. Insert hash sequence diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_range_hashing_seq_diagram.png" align="middle" alt="Insert hash sequence diagram" /></div></div></div><br class="figure-break" /><p>If <code class="classname">cc_hash_table</code>'s

474

+ and E).</p><div class="figure"><a id="idm269997339216"></a><p class="title"><strong>Figure 22.15. Insert hash sequence diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_range_hashing_seq_diagram.png" align="middle" alt="Insert hash sequence diagram" /></div></div></div><br class="figure-break" /><p>If <code class="classname">cc_hash_table</code>'s

475

hash-functor, <code class="classname">Hash_Fn</code> is instantiated by <code class="classname">null_type</code> , then <code class="classname">Comb_Hash_Fn</code> is taken to be

476

a ranged-hash function. The graphic below shows an <code class="function">insert</code> sequence

477

diagram. The user inserts an element (point A), the container

478

transforms the key into a position using the combining functor

479

- (points B and C).</p><div class="figure"><a id="idp18199024"></a><p class="title"><strong>Figure 22.16. Insert hash sequence diagram with a null policy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_range_hashing_seq_diagram2.png" align="middle" alt="Insert hash sequence diagram with a null policy" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="hash_policies.implementation.probe"></a>

480

+ (points B and C).</p><div class="figure"><a id="idm269997332160"></a><p class="title"><strong>Figure 22.16. Insert hash sequence diagram with a null policy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_range_hashing_seq_diagram2.png" align="middle" alt="Insert hash sequence diagram with a null policy" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="hash_policies.implementation.probe"></a>

481

Probing tables

482

</h6></div></div></div><p><code class="classname">gp_hash_table</code> is parametrized by

483

<code class="classname">Hash_Fn</code>, <code class="classname">Probe_Fn</code>,

484

@@ -634,7 +634,7 @@

485

a linear probe and a quadratic probe function,

486

respectively.</p></li></ol></div><p>

487

The graphic below shows the relationships.

488

- </p><div class="figure"><a id="idp18215840"></a><p class="title"><strong>Figure 22.17. Hash policy class diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_policy_cd.png" align="middle" alt="Hash policy class diagram" /></div></div></div><br class="figure-break" /></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.hash.details.resize_policies"></a>Resize Policies</h6></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="resize_policies.general"></a>General</h6></div></div></div><p>Hash-tables, as opposed to trees, do not naturally grow or

489

+ </p><div class="figure"><a id="idm269997315408"></a><p class="title"><strong>Figure 22.17. Hash policy class diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_hash_policy_cd.png" align="middle" alt="Hash policy class diagram" /></div></div></div><br class="figure-break" /></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.hash.details.resize_policies"></a>Resize Policies</h6></div></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="resize_policies.general"></a>General</h6></div></div></div><p>Hash-tables, as opposed to trees, do not naturally grow or

490

shrink. It is necessary to specify policies to determine how

491

and when a hash table should change its size. Usually, resize

492

policies can be decomposed into orthogonal policies:</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>A size policy indicating how a hash table

493

@@ -667,10 +667,10 @@

494

and some load factor be denoted by Α. We would like to

495

calculate the minimal length of k, such that if there were Α

496

m elements in the hash table, a probe sequence of length k would

497

- be found with probability at most 1/m.</p><div class="figure"><a id="idp18234944"></a><p class="title"><strong>Figure 22.18. Balls and bins</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_balls_and_bins.png" align="middle" alt="Balls and bins" /></div></div></div><br class="figure-break" /><p>Denote the probability that a probe sequence of length

498

+ be found with probability at most 1/m.</p><div class="figure"><a id="idm269997296368"></a><p class="title"><strong>Figure 22.18. Balls and bins</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_balls_and_bins.png" align="middle" alt="Balls and bins" /></div></div></div><br class="figure-break" /><p>Denote the probability that a probe sequence of length

499

k appears in bin i by p<sub>i</sub>, the

500

length of the probe sequence of bin i by

501

- l<sub>i</sub>, and assume uniform distribution. Then</p><div class="equation"><a id="idp18240448"></a><p class="title"><strong>Equation 22.7.

502

+ l<sub>i</sub>, and assume uniform distribution. Then</p><div class="equation"><a id="idm269997290864"></a><p class="title"><strong>Equation 22.7.

503

Probability of Probe Sequence of Length k

504

</strong></p><div class="equation-contents"><span class="mathphrase">

505

p<sub>1</sub> =

506

@@ -684,7 +684,7 @@

507

l<sub>i</sub> are negatively-dependent

508

(<a class="xref" href="policy_data_structures.html#biblio.dubhashi98neg" title="Balls and bins: A study in negative dependence">[biblio.dubhashi98neg]</a>)

509

. Let

510

- I(.) denote the indicator function. Then</p><div class="equation"><a id="idp18247216"></a><p class="title"><strong>Equation 22.8.

511

+ I(.) denote the indicator function. Then</p><div class="equation"><a id="idm269997284096"></a><p class="title"><strong>Equation 22.8.

512

Probability Probe Sequence in Some Bin

513

</strong></p><div class="equation-contents"><span class="mathphrase">

514

P( exists<sub>i</sub> l<sub>i</sub> ≥ k ) =

515

@@ -723,7 +723,7 @@

516

a resize is needed, and if so, what is the new size (points D

517

to G); following the resize, it notifies the policy that a

518

resize has completed (point H); finally, the element is

519

- inserted, and the policy notified (point I).</p><div class="figure"><a id="idp18265728"></a><p class="title"><strong>Figure 22.19. Insert resize sequence diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_insert_resize_sequence_diagram1.png" align="middle" alt="Insert resize sequence diagram" /></div></div></div><br class="figure-break" /><p>In practice, a resize policy can be usually orthogonally

520

+ inserted, and the policy notified (point I).</p><div class="figure"><a id="idm269997265648"></a><p class="title"><strong>Figure 22.19. Insert resize sequence diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_insert_resize_sequence_diagram1.png" align="middle" alt="Insert resize sequence diagram" /></div></div></div><br class="figure-break" /><p>In practice, a resize policy can be usually orthogonally

521

decomposed to a size policy and a trigger policy. Consequently,

522

the library contains a single class for instantiating a resize

523

policy: <code class="classname">hash_standard_resize_policy</code>

524

@@ -732,8 +732,8 @@

525

both, and acts as a standard delegate (<a class="xref" href="policy_data_structures.html#biblio.gof" title="Design Patterns - Elements of Reusable Object-Oriented Software">[biblio.gof]</a>)

526

to these policies.</p><p>The two graphics immediately below show sequence diagrams

527

illustrating the interaction between the standard resize policy

528

- and its trigger and size policies, respectively.</p><div class="figure"><a id="idp18273504"></a><p class="title"><strong>Figure 22.20. Standard resize policy trigger sequence

529

- diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_insert_resize_sequence_diagram2.png" align="middle" alt="Standard resize policy trigger sequence diagram" /></div></div></div><br class="figure-break" /><div class="figure"><a id="idp18277664"></a><p class="title"><strong>Figure 22.21. Standard resize policy size sequence

530

+ and its trigger and size policies, respectively.</p><div class="figure"><a id="idm269997257872"></a><p class="title"><strong>Figure 22.20. Standard resize policy trigger sequence

531

+ diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_insert_resize_sequence_diagram2.png" align="middle" alt="Standard resize policy trigger sequence diagram" /></div></div></div><br class="figure-break" /><div class="figure"><a id="idm269997253712"></a><p class="title"><strong>Figure 22.21. Standard resize policy size sequence

532

diagram</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_insert_resize_sequence_diagram3.png" align="middle" alt="Standard resize policy size sequence diagram" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="resize_policies.impl.predefined"></a>Predefined Policies</h6></div></div></div><p>The library includes the following

533

instantiations of size and trigger policies:</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p><code class="classname">hash_load_check_resize_trigger</code>

534

implements a load check trigger policy.</p></li><li class="listitem"><p><code class="classname">cc_hash_max_collision_check_resize_trigger</code>

535

@@ -876,7 +876,7 @@

536

each node, and maintains node invariants (see <a class="xref" href="policy_data_structures.html#biblio.clrs2001" title="Introduction to Algorithms, 2nd edition">[biblio.clrs2001]</a>.) The first stores in

537

each node the size of the sub-tree rooted at the node; the

538

second stores at each node the maximal endpoint of the

539

- intervals at the sub-tree rooted at the node.</p><div class="figure"><a id="idp18355696"></a><p class="title"><strong>Figure 22.22. Tree node invariants</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_tree_node_invariants.png" align="middle" alt="Tree node invariants" /></div></div></div><br class="figure-break" /><p>Supporting such trees is difficult for a number of

540

+ intervals at the sub-tree rooted at the node.</p><div class="figure"><a id="idm269997175616"></a><p class="title"><strong>Figure 22.22. Tree node invariants</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_tree_node_invariants.png" align="middle" alt="Tree node invariants" /></div></div></div><br class="figure-break" /><p>Supporting such trees is difficult for a number of

541

reasons:</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>There must be a way to specify what a node's metadata

542

should be (if any).</p></li><li class="listitem"><p>Various operations can invalidate node

543

invariants. The graphic below shows how a right rotation,

544

@@ -890,7 +890,7 @@

545

metadata.</p></li><li class="listitem"><p>It is not feasible to know in advance which methods trees

546

can support. Besides the usual <code class="classname">find</code> method, the

547

first tree can support a <code class="classname">find_by_order</code> method, while

548

- the second can support an <code class="classname">overlaps</code> method.</p></li></ol></div><div class="figure"><a id="idp18365136"></a><p class="title"><strong>Figure 22.23. Tree node invalidation</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_tree_node_invalidations.png" align="middle" alt="Tree node invalidation" /></div></div></div><br class="figure-break" /><p>These problems are solved by a combination of two means:

549

+ the second can support an <code class="classname">overlaps</code> method.</p></li></ol></div><div class="figure"><a id="idm269997166176"></a><p class="title"><strong>Figure 22.23. Tree node invalidation</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_tree_node_invalidations.png" align="middle" alt="Tree node invalidation" /></div></div></div><br class="figure-break" /><p>These problems are solved by a combination of two means:

550

node iterators, and template-template node updater

551

parameters.</p><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.tree.node.iterators"></a>Node Iterators</h6></div></div></div><p>Each tree-based container defines two additional iterator

552

types, <code class="classname">const_node_iterator</code>

553

@@ -919,7 +919,7 @@

554

<code class="classname">node_update</code> class, and publicly subclasses

555

<code class="classname">node_update</code>. The graphic below shows this

556

scheme, as well as some predefined policies (which are explained

557

- below).</p><div class="figure"><a id="idp18378304"></a><p class="title"><strong>Figure 22.24. A tree and its update policy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_tree_node_updator_policy_cd.png" align="middle" alt="A tree and its update policy" /></div></div></div><br class="figure-break" /><p><code class="classname">node_update</code> (an instantiation of

558

+ below).</p><div class="figure"><a id="idm269997153072"></a><p class="title"><strong>Figure 22.24. A tree and its update policy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_tree_node_updator_policy_cd.png" align="middle" alt="A tree and its update policy" /></div></div></div><br class="figure-break" /><p><code class="classname">node_update</code> (an instantiation of

559

<code class="classname">Node_Update</code>) must define <code class="classname">metadata_type</code> as

560

the type of metadata it requires. For order statistics,

561

e.g., <code class="classname">metadata_type</code> might be <code class="classname">size_t</code>.

562

@@ -938,7 +938,7 @@

563

<code class="classname">nd_it</code>. For example, say node x in the

564

graphic below label A has an invalid invariant, but its' children,

565

y and z have valid invariants. After the invocation, all three

566

- nodes should have valid invariants, as in label B.</p><div class="figure"><a id="idp18389968"></a><p class="title"><strong>Figure 22.25. Restoring node invariants</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_restoring_node_invariants.png" align="middle" alt="Restoring node invariants" /></div></div></div><br class="figure-break" /><p>When a tree operation might invalidate some node invariant,

567

+ nodes should have valid invariants, as in label B.</p><div class="figure"><a id="idm269997141408"></a><p class="title"><strong>Figure 22.25. Restoring node invariants</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_restoring_node_invariants.png" align="middle" alt="Restoring node invariants" /></div></div></div><br class="figure-break" /><p>When a tree operation might invalidate some node invariant,

568

it invokes this method in its <code class="classname">node_update</code> base to

569

restore the invariant. For example, the graphic below shows

570

an <code class="function">insert</code> operation (point A); the tree performs some

571

@@ -946,7 +946,7 @@

572

C, and D). (It is well known that any <code class="function">insert</code>,

573

<code class="function">erase</code>, <code class="function">split</code> or <code class="function">join</code>, can restore

574

all node invariants by a small number of node invariant updates (<a class="xref" href="policy_data_structures.html#biblio.clrs2001" title="Introduction to Algorithms, 2nd edition">[biblio.clrs2001]</a>)

575

- .</p><div class="figure"><a id="idp18398144"></a><p class="title"><strong>Figure 22.26. Insert update sequence</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_update_seq_diagram.png" align="middle" alt="Insert update sequence" /></div></div></div><br class="figure-break" /><p>To complete the description of the scheme, three questions

576

+ .</p><div class="figure"><a id="idm269997133232"></a><p class="title"><strong>Figure 22.26. Insert update sequence</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_update_seq_diagram.png" align="middle" alt="Insert update sequence" /></div></div></div><br class="figure-break" /><p>To complete the description of the scheme, three questions

577

need to be answered:</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>How can a tree which supports order statistics define a

578

method such as <code class="classname">find_by_order</code>?</p></li><li class="listitem"><p>How can the node updater base access methods of the

579

tree?</p></li><li class="listitem"><p>How can the following cyclic dependency be resolved?

580

@@ -988,7 +988,7 @@

581

node's metadata (this is halting reducible). In the graphic

582

below, assume the shaded node is inserted. The tree would have

583

to traverse the useless path shown to the root, applying

584

- redundant updates all the way.</p></li></ol></div><div class="figure"><a id="idp18420400"></a><p class="title"><strong>Figure 22.27. Useless update path</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_rationale_null_node_updator.png" align="middle" alt="Useless update path" /></div></div></div><br class="figure-break" /><p>A null policy class, <code class="classname">null_node_update</code>

585

+ redundant updates all the way.</p></li></ol></div><div class="figure"><a id="idm269997110976"></a><p class="title"><strong>Figure 22.27. Useless update path</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_rationale_null_node_updator.png" align="middle" alt="Useless update path" /></div></div></div><br class="figure-break" /><p>A null policy class, <code class="classname">null_node_update</code>

586

solves both these problems. The tree detects that node

587

invariants are irrelevant, and defines all accordingly.</p></div></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.tree.details.split"></a>Split and Join</h6></div></div></div><p>Tree-based containers support split and join methods.

588

It is possible to split a tree so that it passes

589

@@ -1071,7 +1071,7 @@

590

sub-tree with leafs "a" and "as". The maximal common prefix is

591

"a". The internal node contains, consequently, to const

592

iterators, one pointing to <code class="varname">'a'</code>, and the other to

593

- <code class="varname">'s'</code>.</p><div class="figure"><a id="idp18465088"></a><p class="title"><strong>Figure 22.28. A PATRICIA trie</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_pat_trie.png" align="middle" alt="A PATRICIA trie" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.trie.details.node"></a>Node Invariants</h6></div></div></div><p>Trie-based containers support node invariants, as do

594

+ <code class="varname">'s'</code>.</p><div class="figure"><a id="idm269997066288"></a><p class="title"><strong>Figure 22.28. A PATRICIA trie</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_pat_trie.png" align="middle" alt="A PATRICIA trie" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.trie.details.node"></a>Node Invariants</h6></div></div></div><p>Trie-based containers support node invariants, as do

595

tree-based containers. There are two minor

596

differences, though, which, unfortunately, thwart sharing them

597

sharing the same node-updating policies:</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>A trie's <code class="classname">Node_Update</code> template-template

598

@@ -1080,7 +1080,7 @@

599

parametrized by <code class="classname">Cmp_Fn</code>.</p></li><li class="listitem"><p>Tree-based containers store values in all nodes, while

600

trie-based containers (at least in this implementation) store

601

values in leafs.</p></li></ol></div><p>The graphic below shows the scheme, as well as some predefined

602

- policies (which are explained below).</p><div class="figure"><a id="idp18475584"></a><p class="title"><strong>Figure 22.29. A trie and its update policy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_trie_node_updator_policy_cd.png" align="middle" alt="A trie and its update policy" /></div></div></div><br class="figure-break" /><p>This library offers the following pre-defined trie node

603

+ policies (which are explained below).</p><div class="figure"><a id="idm269997055856"></a><p class="title"><strong>Figure 22.29. A trie and its update policy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_trie_node_updator_policy_cd.png" align="middle" alt="A trie and its update policy" /></div></div></div><br class="figure-break" /><p>This library offers the following pre-defined trie node

604

updating policies:</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>

605

<code class="classname">trie_order_statistics_node_update</code>

606

supports order statistics.

607

@@ -1128,7 +1128,7 @@

608

simple list of integer keys. If we search for the integer 6, we

609

are paying an overhead: the link with key 6 is only the fifth

610

link; if it were the first link, it could be accessed

611

- faster.</p><div class="figure"><a id="idp18506160"></a><p class="title"><strong>Figure 22.30. A simple list</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_simple_list.png" align="middle" alt="A simple list" /></div></div></div><br class="figure-break" /><p>List-update algorithms reorder lists as elements are

612

+ faster.</p><div class="figure"><a id="idm269997025344"></a><p class="title"><strong>Figure 22.30. A simple list</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_simple_list.png" align="middle" alt="A simple list" /></div></div></div><br class="figure-break" /><p>List-update algorithms reorder lists as elements are

613

accessed. They try to determine, by the access history, which

614

keys to move to the front of the list. Some of these algorithms

615

require adding some metadata alongside each entry.</p><p>For example, in the graphic below label A shows the counter

616

@@ -1138,7 +1138,7 @@

617

predetermined value, say 10, as shown in label C, the count is set

618

to 0 and the node is moved to the front of the list, as in label

619

D.

620

- </p><div class="figure"><a id="idp18511744"></a><p class="title"><strong>Figure 22.31. The counter algorithm</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_list_update.png" align="middle" alt="The counter algorithm" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.list.details.policies"></a>Policies</h6></div></div></div><p>this library allows instantiating lists with policies

621

+ </p><div class="figure"><a id="idm269997019760"></a><p class="title"><strong>Figure 22.31. The counter algorithm</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_list_update.png" align="middle" alt="The counter algorithm" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h6 class="title"><a id="container.list.details.policies"></a>Policies</h6></div></div></div><p>this library allows instantiating lists with policies

622

implementing any algorithm moving nodes to the front of the

623

list (policies implementing algorithms interchanging nodes are

624

unsupported).</p><p>Associative containers based on lists are parametrized by a

625

@@ -1310,7 +1310,7 @@

626

sequence; the second uses a tree (or forest of trees), which is

627

typically less structured than an associative container's tree;

628

the third simply uses an associative container. These are

629

- shown in the graphic below, in labels A1 and A2, label B, and label C.</p><div class="figure"><a id="idp18575568"></a><p class="title"><strong>Figure 22.32. Underlying Priority-Queue Data-Structures.</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_priority_queue_different_underlying_dss.png" align="middle" alt="Underlying Priority-Queue Data-Structures." /></div></div></div><br class="figure-break" /><p>Roughly speaking, any value that is both pushed and popped

630

+ shown in the graphic below, in labels A1 and A2, label B, and label C.</p><div class="figure"><a id="idm269996955920"></a><p class="title"><strong>Figure 22.32. Underlying Priority-Queue Data-Structures.</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_priority_queue_different_underlying_dss.png" align="middle" alt="Underlying Priority-Queue Data-Structures." /></div></div></div><br class="figure-break" /><p>Roughly speaking, any value that is both pushed and popped

631

from a priority queue must incur a logarithmic expense (in the

632

amortized sense). Any priority queue implementation that would

633

avoid this, would violate known bounds on comparison-based

634

@@ -1390,7 +1390,7 @@

635

container <code class="classname">Cntnr</code>, the tag of the underlying

636

data structure can be found via <code class="classname">typename

637

Cntnr::container_category</code>; this is one of the possible tags shown in the graphic below.

638

- </p><div class="figure"><a id="idp18610544"></a><p class="title"><strong>Figure 22.33. Priority-Queue Data-Structure Tags.</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_priority_queue_tag_hierarchy.png" align="middle" alt="Priority-Queue Data-Structure Tags." /></div></div></div><br class="figure-break" /><p>Additionally, a traits mechanism can be used to query a

639

+ </p><div class="figure"><a id="idm269996920880"></a><p class="title"><strong>Figure 22.33. Priority-Queue Data-Structure Tags.</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_priority_queue_tag_hierarchy.png" align="middle" alt="Priority-Queue Data-Structure Tags." /></div></div></div><br class="figure-break" /><p>Additionally, a traits mechanism can be used to query a

640

container type for its attributes. Given any container

641

<code class="classname">Cntnr</code>, then </p><pre class="programlisting">__gnu_pbds::container_traits<Cntnr></pre><p>

642

is a traits class identifying the properties of the

643

Index: libstdc++-v3/doc/html/manual/using.html

644

===================================================================

645

--- a/src/libstdc++-v3/doc/html/manual/using.html (.../tags/gcc_4_8_2_release)

646

+++ b/src/libstdc++-v3/doc/html/manual/using.html (.../branches/gcc-4_8-branch)

647

@@ -1,8 +1,8 @@

648

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

649

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 3. Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="intro.html" title="Part I. Introduction" /><link rel="prev" href="make.html" title="Make" /><link rel="next" href="using_headers.html" title="Headers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 3. Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="make.html">Prev</a> </td><th width="60%" align="center">Part I.

650

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 3. Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="intro.html" title="Part I. Introduction" /><link rel="prev" href="make.html" title="Make" /><link rel="next" href="using_headers.html" title="Headers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 3. Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="make.html">Prev</a> </td><th width="60%" align="center">Part I.

651

Introduction

652

653

-</th><td width="20%" align="right"> <a accesskey="n" href="using_headers.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.intro.using"></a>Chapter 3. Using</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="using.html#manual.intro.using.flags">Command Options</a></span></dt><dt><span class="section"><a href="using_headers.html">Headers</a></span></dt><dd><dl><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="section"><a href="using_macros.html">Macros</a></span></dt><dt><span class="section"><a href="using_namespaces.html">Namespaces</a></span></dt><dd><dl><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="section"><a href="using_dynamic_or_shared.html">Linking</a></span></dt><dd><dl><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.freestanding">Almost Nothing</a></span></dt><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.dynamic">Finding Dynamic or Shared Libraries</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html">Concurrency</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.io">IO</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#concurrency.io.structure">Structure</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.defaults">Defaults</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.future">Future</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.alt">Alternatives</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="section"><a href="using_exceptions.html">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.safety">Exception Safety</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.propagating">Exception Neutrality</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.no">Doing without</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.compat">Compatibility</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.c">With <code class="literal">C</code></a></span></dt><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.posix">With <code class="literal">POSIX</code> thread cancellation</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="section"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="section"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.races">Data Race Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="section"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="section"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt><dt><span class="section"><a href="debug.html#debug.profile_mode">Profile-based Performance Analysis</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.flags"></a>Command Options</h2></div></div></div><p>

654

+</th><td width="20%" align="right"> <a accesskey="n" href="using_headers.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.intro.using"></a>Chapter 3. Using</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="using.html#manual.intro.using.flags">Command Options</a></span></dt><dt><span class="section"><a href="using_headers.html">Headers</a></span></dt><dd><dl><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="section"><a href="using_macros.html">Macros</a></span></dt><dt><span class="section"><a href="using_namespaces.html">Namespaces</a></span></dt><dd><dl><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="section"><a href="using_dynamic_or_shared.html">Linking</a></span></dt><dd><dl><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.freestanding">Almost Nothing</a></span></dt><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.dynamic">Finding Dynamic or Shared Libraries</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html">Concurrency</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.io">IO</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#concurrency.io.structure">Structure</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.defaults">Defaults</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.future">Future</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.alt">Alternatives</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="section"><a href="using_exceptions.html">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.safety">Exception Safety</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.propagating">Exception Neutrality</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.no">Doing without</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.compat">Compatibility</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.c">With <code class="literal">C</code></a></span></dt><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.posix">With <code class="literal">POSIX</code> thread cancellation</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="section"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="section"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.races">Data Race Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="section"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="section"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt><dt><span class="section"><a href="debug.html#debug.profile_mode">Profile-based Performance Analysis</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.flags"></a>Command Options</h2></div></div></div><p>

655

The set of features available in the GNU C++ library is shaped

656

by

657

several <a class="link" href="http://gcc.gnu.org/onlinedocs/gcc-4.3.2/gcc/Invoking-GCC.html" target="_top">GCC

658

@@ -10,5 +10,5 @@

659

enumerated and detailed in the table below.

660

</p><p>

661

By default, <span class="command"><strong>g++</strong></span> is equivalent to <span class="command"><strong>g++ -std=gnu++98</strong></span>. The standard library also defaults to this dialect.

662

- </p><div class="table"><a id="idp13051936"></a><p class="title"><strong>Table 3.1. C++ Command Options</strong></p><div class="table-contents"><table summary="C++ Command Options" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">Option Flags</th><th align="left">Description</th></tr></thead><tbody><tr><td align="left"><code class="literal">-std=c++98</code></td><td align="left">Use the 1998 ISO C++ standard plus amendments.</td></tr><tr><td align="left"><code class="literal">-std=gnu++98</code></td><td align="left">As directly above, with GNU extensions.</td></tr><tr><td align="left"><code class="literal">-std=c++11</code></td><td align="left">Use the 2011 ISO C++ standard.</td></tr><tr><td align="left"><code class="literal">-std=gnu++11</code></td><td align="left">As directly above, with GNU extensions.</td></tr><tr><td align="left"><code class="literal">-fexceptions</code></td><td align="left">See <a class="link" href="using_exceptions.html#intro.using.exception.no" title="Doing without">exception-free dialect</a></td></tr><tr><td align="left"><code class="literal">-frtti</code></td><td align="left">As above, but RTTI-free dialect.</td></tr><tr><td align="left"><code class="literal">-pthread</code> or <code class="literal">-pthreads</code></td><td align="left">For ISO C++11 <thread>, <future>,

663

+ </p><div class="table"><a id="idm270002481088"></a><p class="title"><strong>Table 3.1. C++ Command Options</strong></p><div class="table-contents"><table summary="C++ Command Options" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">Option Flags</th><th align="left">Description</th></tr></thead><tbody><tr><td align="left"><code class="literal">-std=c++98</code></td><td align="left">Use the 1998 ISO C++ standard plus amendments.</td></tr><tr><td align="left"><code class="literal">-std=gnu++98</code></td><td align="left">As directly above, with GNU extensions.</td></tr><tr><td align="left"><code class="literal">-std=c++11</code></td><td align="left">Use the 2011 ISO C++ standard.</td></tr><tr><td align="left"><code class="literal">-std=gnu++11</code></td><td align="left">As directly above, with GNU extensions.</td></tr><tr><td align="left"><code class="literal">-fexceptions</code></td><td align="left">See <a class="link" href="using_exceptions.html#intro.using.exception.no" title="Doing without">exception-free dialect</a></td></tr><tr><td align="left"><code class="literal">-frtti</code></td><td align="left">As above, but RTTI-free dialect.</td></tr><tr><td align="left"><code class="literal">-pthread</code> or <code class="literal">-pthreads</code></td><td align="left">For ISO C++11 <thread>, <future>,

664

<mutex>, or <condition_variable>.</td></tr><tr><td align="left"><code class="literal">-fopenmp</code></td><td align="left">For <a class="link" href="parallel_mode.html" title="Chapter 18. Parallel Mode">parallel</a> mode.</td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="make.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="intro.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="using_headers.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Make </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Headers</td></tr></table></div></body></html>

665

\ No newline at end of file

666

Index: libstdc++-v3/doc/html/manual/profile_mode_impl.html

667

===================================================================

668

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_impl.html (.../tags/gcc_4_8_2_release)

669

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_impl.html (.../branches/gcc-4_8-branch)

670

@@ -1,5 +1,5 @@

671

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

672

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation Issues</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_cost_model.html" title="Empirical Cost Model" /><link rel="next" href="profile_mode_devel.html" title="Developer Information" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation Issues</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_cost_model.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_devel.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.implementation"></a>Implementation Issues</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.implementation.stack"></a>Stack Traces</h3></div></div></div><p>

673

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation Issues</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_cost_model.html" title="Empirical Cost Model" /><link rel="next" href="profile_mode_devel.html" title="Developer Information" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation Issues</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_cost_model.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_devel.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.implementation"></a>Implementation Issues</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.implementation.stack"></a>Stack Traces</h3></div></div></div><p>

674

Accurate stack traces are needed during profiling since we group events by

675

call context and dynamic instance. Without accurate traces, diagnostics

676

may be hard to interpret. For instance, when giving advice to the user

677

Index: libstdc++-v3/doc/html/manual/ext_containers.html

678

===================================================================

679

--- a/src/libstdc++-v3/doc/html/manual/ext_containers.html (.../tags/gcc_4_8_2_release)

680

+++ b/src/libstdc++-v3/doc/html/manual/ext_containers.html (.../branches/gcc-4_8-branch)

681

@@ -1,8 +1,8 @@

682

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

683

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 23. HP/SGI Extensions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="policy_data_structures_ack.html" title="Acknowledgments" /><link rel="next" href="ext_sgi.html" title="Deprecated" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 23. HP/SGI Extensions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures_ack.html">Prev</a> </td><th width="60%" align="center">Part III.

684

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 23. HP/SGI Extensions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="policy_data_structures_ack.html" title="Acknowledgments" /><link rel="next" href="ext_sgi.html" title="Deprecated" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 23. HP/SGI Extensions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures_ack.html">Prev</a> </td><th width="60%" align="center">Part III.

685

Extensions

686

687

-</th><td width="20%" align="right"> <a accesskey="n" href="ext_sgi.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.containers"></a>Chapter 23. HP/SGI Extensions</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="ext_containers.html#manual.ext.containers.sgi">Backwards Compatibility</a></span></dt><dt><span class="section"><a href="ext_sgi.html">Deprecated</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.containers.sgi"></a>Backwards Compatibility</h2></div></div></div><p>A few extensions and nods to backwards-compatibility have

688

+</th><td width="20%" align="right"> <a accesskey="n" href="ext_sgi.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.containers"></a>Chapter 23. HP/SGI Extensions</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="ext_containers.html#manual.ext.containers.sgi">Backwards Compatibility</a></span></dt><dt><span class="section"><a href="ext_sgi.html">Deprecated</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.containers.sgi"></a>Backwards Compatibility</h2></div></div></div><p>A few extensions and nods to backwards-compatibility have

689

been made with containers. Those dealing with older SGI-style

690

allocators are dealt with elsewhere. The remaining ones all deal

691

with bits:

692

Index: libstdc++-v3/doc/html/manual/ext_concurrency_use.html

693

===================================================================

694

--- a/src/libstdc++-v3/doc/html/manual/ext_concurrency_use.html (.../tags/gcc_4_8_2_release)

695

+++ b/src/libstdc++-v3/doc/html/manual/ext_concurrency_use.html (.../branches/gcc-4_8-branch)

696

@@ -1,5 +1,5 @@

697

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

698

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Use</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="ext_concurrency.html" title="Chapter 30. Concurrency" /><link rel="prev" href="ext_concurrency_impl.html" title="Implementation" /><link rel="next" href="appendix.html" title="Part IV. Appendices" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Use</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_concurrency_impl.html">Prev</a> </td><th width="60%" align="center">Chapter 30. Concurrency</th><td width="20%" align="right"> <a accesskey="n" href="appendix.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.use"></a>Use</h2></div></div></div><p>Typical usage of the last two constructs is demonstrated as follows:

699

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Use</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="ext_concurrency.html" title="Chapter 30. Concurrency" /><link rel="prev" href="ext_concurrency_impl.html" title="Implementation" /><link rel="next" href="appendix.html" title="Part IV. Appendices" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Use</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_concurrency_impl.html">Prev</a> </td><th width="60%" align="center">Chapter 30. Concurrency</th><td width="20%" align="right"> <a accesskey="n" href="appendix.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.use"></a>Use</h2></div></div></div><p>Typical usage of the last two constructs is demonstrated as follows:

700

</p><pre class="programlisting">

701

#include <ext/concurrence.h>

702

703

Index: libstdc++-v3/doc/html/manual/ext_io.html

704

===================================================================

705

--- a/src/libstdc++-v3/doc/html/manual/ext_io.html (.../tags/gcc_4_8_2_release)

706

+++ b/src/libstdc++-v3/doc/html/manual/ext_io.html (.../branches/gcc-4_8-branch)

707

@@ -1,8 +1,8 @@

708

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

709

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 28. Input and Output</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_iterators.html" title="Chapter 27. Iterators" /><link rel="next" href="ext_demangling.html" title="Chapter 29. Demangling" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 28. Input and Output</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_iterators.html">Prev</a> </td><th width="60%" align="center">Part III.

710

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 28. Input and Output</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_iterators.html" title="Chapter 27. Iterators" /><link rel="next" href="ext_demangling.html" title="Chapter 29. Demangling" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 28. Input and Output</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_iterators.html">Prev</a> </td><th width="60%" align="center">Part III.

711

Extensions

712

713

-</th><td width="20%" align="right"> <a accesskey="n" href="ext_demangling.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.io"></a>Chapter 28. Input and Output</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="ext_io.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></div><p>

714

+</th><td width="20%" align="right"> <a accesskey="n" href="ext_demangling.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.io"></a>Chapter 28. Input and Output</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="ext_io.html#manual.ext.io.filebuf_derived">Derived filebufs</a></span></dt></dl></div><p>

715

Extensions allowing <code class="code">filebuf</code>s to be constructed from

716

"C" types like FILE*s and file descriptors.

717

</p><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.io.filebuf_derived"></a>Derived filebufs</h2></div></div></div><p>The v2 library included non-standard extensions to construct

718

Index: libstdc++-v3/doc/html/manual/termination.html

719

===================================================================

720

--- a/src/libstdc++-v3/doc/html/manual/termination.html (.../tags/gcc_4_8_2_release)

721

+++ b/src/libstdc++-v3/doc/html/manual/termination.html (.../branches/gcc-4_8-branch)

722

@@ -1,5 +1,5 @@

723

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

724

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Termination</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="support.html" title="Chapter 4. Support" /><link rel="prev" href="dynamic_memory.html" title="Dynamic Memory" /><link rel="next" href="diagnostics.html" title="Chapter 5. Diagnostics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Termination</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="dynamic_memory.html">Prev</a> </td><th width="60%" align="center">Chapter 4.

725

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Termination</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="support.html" title="Chapter 4. Support" /><link rel="prev" href="dynamic_memory.html" title="Dynamic Memory" /><link rel="next" href="diagnostics.html" title="Chapter 5. Diagnostics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Termination</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="dynamic_memory.html">Prev</a> </td><th width="60%" align="center">Chapter 4.

726

Support

727

728

</th><td width="20%" align="right"> <a accesskey="n" href="diagnostics.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.support.termination"></a>Termination</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="support.termination.handlers"></a>Termination Handlers</h3></div></div></div><p>

729

Index: libstdc++-v3/doc/html/manual/using_macros.html

730

===================================================================

731

--- a/src/libstdc++-v3/doc/html/manual/using_macros.html (.../tags/gcc_4_8_2_release)

732

+++ b/src/libstdc++-v3/doc/html/manual/using_macros.html (.../branches/gcc-4_8-branch)

733

@@ -1,5 +1,5 @@

734

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

735

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Macros</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_headers.html" title="Headers" /><link rel="next" href="using_namespaces.html" title="Namespaces" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Macros</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_headers.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_namespaces.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.macros"></a>Macros</h2></div></div></div><p>

736

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Macros</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_headers.html" title="Headers" /><link rel="next" href="using_namespaces.html" title="Namespaces" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Macros</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_headers.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_namespaces.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.macros"></a>Macros</h2></div></div></div><p>

737

All library macros begin with <code class="code">_GLIBCXX_</code>.

738

</p><p>

739

Furthermore, all pre-processor macros, switches, and

740

Index: libstdc++-v3/doc/html/manual/concurrency.html

741

===================================================================

742

--- a/src/libstdc++-v3/doc/html/manual/concurrency.html (.../tags/gcc_4_8_2_release)

743

+++ b/src/libstdc++-v3/doc/html/manual/concurrency.html (.../branches/gcc-4_8-branch)

744

@@ -1,13 +1,13 @@

745

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

746

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 15. Concurrency</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library, mutex, thread, future, condition_variable" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="atomics.html" title="Chapter 14. Atomics" /><link rel="next" href="extensions.html" title="Part III. Extensions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 15.

747

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 15. Concurrency</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library, mutex, thread, future, condition_variable" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="atomics.html" title="Chapter 14. Atomics" /><link rel="next" href="extensions.html" title="Part III. Extensions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 15.

748

Concurrency

749

750

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="atomics.html">Prev</a> </td><th width="60%" align="center">Part II.

751

Standard Contents

752

</th><td width="20%" align="right"> <a accesskey="n" href="extensions.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.concurrency"></a>Chapter 15.

753

Concurrency

754

- <a id="idp16404464" class="indexterm"></a>

755

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="concurrency.html#std.concurrency.api">API Reference</a></span></dt></dl></div><p>

756

+ <a id="idm269999126816" class="indexterm"></a>

757

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="concurrency.html#std.concurrency.api">API Reference</a></span></dt></dl></div><p>

758

Facilities for concurrent operation, and control thereof.

759

</p><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.concurrency.api"></a>API Reference</h2></div></div></div><p>

760

All items are declared in one of four standard header files.

761

Index: libstdc++-v3/doc/html/manual/ext_utilities.html

762

===================================================================

763

--- a/src/libstdc++-v3/doc/html/manual/ext_utilities.html (.../tags/gcc_4_8_2_release)

764

+++ b/src/libstdc++-v3/doc/html/manual/ext_utilities.html (.../branches/gcc-4_8-branch)

765

@@ -1,5 +1,5 @@

766

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

767

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 24. Utilities</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_sgi.html" title="Deprecated" /><link rel="next" href="ext_algorithms.html" title="Chapter 25. Algorithms" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 24. Utilities</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_sgi.html">Prev</a> </td><th width="60%" align="center">Part III.

768

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 24. Utilities</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_sgi.html" title="Deprecated" /><link rel="next" href="ext_algorithms.html" title="Chapter 25. Algorithms" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 24. Utilities</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_sgi.html">Prev</a> </td><th width="60%" align="center">Part III.

769

Extensions

770

771

</th><td width="20%" align="right"> <a accesskey="n" href="ext_algorithms.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.util"></a>Chapter 24. Utilities</h2></div></div></div><p>

772

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

773

===================================================================

774

--- a/src/libstdc++-v3/doc/html/manual/policy_data_structures.html (.../tags/gcc_4_8_2_release)

775

+++ b/src/libstdc++-v3/doc/html/manual/policy_data_structures.html (.../branches/gcc-4_8-branch)

776

@@ -1,8 +1,8 @@

777

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

778

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 22. Policy-Based Data Structures</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="bitmap_allocator_impl.html" title="Implementation" /><link rel="next" href="policy_data_structures_using.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 22. Policy-Based Data Structures</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bitmap_allocator_impl.html">Prev</a> </td><th width="60%" align="center">Part III.

779

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 22. Policy-Based Data Structures</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="bitmap_allocator_impl.html" title="Implementation" /><link rel="next" href="policy_data_structures_using.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 22. Policy-Based Data Structures</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bitmap_allocator_impl.html">Prev</a> </td><th width="60%" align="center">Part III.

780

Extensions

781

782

-</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures_using.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.containers.pbds"></a>Chapter 22. Policy-Based Data Structures</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro">Intro</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues">Performance Issues</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues.associative">Associative</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues.priority_queue">Priority Que</a></span></dt></dl></dd><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation">Goals</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation.associative">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.policy">Policy Choices</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.underlying">Underlying Data Structures</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.iterators">Iterators</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.functions">Functional</a></span></dt></dl></dd><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation.priority_queue">Priority Queues</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.policy">Policy Choices</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.underlying">Underlying Data Structures</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.binary_heap">Binary Heaps</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="section"><a href="policy_data_structures_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.organization">Organization</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial">Tutorial</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.basic">Basic Use</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.configuring">

783

+</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures_using.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.containers.pbds"></a>Chapter 22. Policy-Based Data Structures</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="policy_data_structures.html#pbds.intro">Intro</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues">Performance Issues</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues.associative">Associative</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues.priority_queue">Priority Que</a></span></dt></dl></dd><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation">Goals</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation.associative">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.policy">Policy Choices</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.underlying">Underlying Data Structures</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.iterators">Iterators</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.functions">Functional</a></span></dt></dl></dd><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation.priority_queue">Priority Queues</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.policy">Policy Choices</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.underlying">Underlying Data Structures</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.binary_heap">Binary Heaps</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="section"><a href="policy_data_structures_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.organization">Organization</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial">Tutorial</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.basic">Basic Use</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.configuring">

784

Configuring via Template Parameters

785

</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.traits">

786

Querying Container Attributes

787

@@ -248,7 +248,7 @@

788

these invariants, one must supply some policy that is aware

789

of these changes. Without this, it would be better to use a

790

linked list (in itself very efficient for these purposes).

791

- </p></li></ol></div><div class="figure"><a id="idp17613296"></a><p class="title"><strong>Figure 22.1. Node Invariants</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_node_invariants.png" align="middle" alt="Node Invariants" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="motivation.associative.underlying"></a>Underlying Data Structures</h5></div></div></div><p>

792

+ </p></li></ol></div><div class="figure"><a id="idm269997917584"></a><p class="title"><strong>Figure 22.1. Node Invariants</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_node_invariants.png" align="middle" alt="Node Invariants" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="motivation.associative.underlying"></a>Underlying Data Structures</h5></div></div></div><p>

793

The standard C++ library contains associative containers based on

794

red-black trees and collision-chaining hash tables. These are

795

very useful, but they are not ideal for all types of

796

@@ -256,7 +256,7 @@

797

</p><p>

798

The figure below shows the different underlying data structures

799

currently supported in this library.

800

- </p><div class="figure"><a id="idp17619952"></a><p class="title"><strong>Figure 22.2. Underlying Associative Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_different_underlying_dss_1.png" align="middle" alt="Underlying Associative Data Structures" /></div></div></div><br class="figure-break" /><p>

801

+ </p><div class="figure"><a id="idm269997910864"></a><p class="title"><strong>Figure 22.2. Underlying Associative Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_different_underlying_dss_1.png" align="middle" alt="Underlying Associative Data Structures" /></div></div></div><br class="figure-break" /><p>

802

A shows a collision-chaining hash-table, B shows a probing

803

hash-table, C shows a red-black tree, D shows a splay tree, E shows

804

a tree based on an ordered vector(implicit in the order of the

805

@@ -375,7 +375,7 @@

806

no guarantee that the elements traversed will coincide with the

807

<span class="emphasis"><em>logical</em></span> elements between 1 and 5, as in

808

label B.

809

- </p><div class="figure"><a id="idp17651648"></a><p class="title"><strong>Figure 22.3. Range Iteration in Different Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_point_iterators_range_ops_1.png" align="middle" alt="Node Invariants" /></div></div></div><br class="figure-break" /><p>

810

+ </p><div class="figure"><a id="idm269997879168"></a><p class="title"><strong>Figure 22.3. Range Iteration in Different Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_point_iterators_range_ops_1.png" align="middle" alt="Node Invariants" /></div></div></div><br class="figure-break" /><p>

811

In our opinion, this problem is not caused just because

812

red-black trees are order preserving while

813

collision-chaining hash tables are (generally) not - it

814

@@ -426,7 +426,7 @@

815

list, as in the graphic below, label B. Here the iterators are as

816

light as can be, but the hash-table's operations are more

817

complicated.

818

- </p><div class="figure"><a id="idp17666528"></a><p class="title"><strong>Figure 22.4. Point Iteration in Hash Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_point_iterators_range_ops_2.png" align="middle" alt="Point Iteration in Hash Data Structures" /></div></div></div><br class="figure-break" /><p>

819

+ </p><div class="figure"><a id="idm269997864256"></a><p class="title"><strong>Figure 22.4. Point Iteration in Hash Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_point_iterators_range_ops_2.png" align="middle" alt="Point Iteration in Hash Data Structures" /></div></div></div><br class="figure-break" /><p>

820

It should be noted that containers based on collision-chaining

821

hash-tables are not the only ones with this type of behavior;

822

many other self-organizing data structures display it as well.

823

@@ -442,7 +442,7 @@

824

container. The graphic below shows three cases: A1 and A2 show

825

a red-black tree; B1 and B2 show a probing hash-table; C1 and C2

826

show a collision-chaining hash table.

827

- </p><div class="figure"><a id="idp17675840"></a><p class="title"><strong>Figure 22.5. Effect of erase in different underlying data structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_invalidation_guarantee_erase.png" align="middle" alt="Effect of erase in different underlying data structures" /></div></div></div><br class="figure-break" /><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>

828

+ </p><div class="figure"><a id="idm269997855056"></a><p class="title"><strong>Figure 22.5. Effect of erase in different underlying data structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_invalidation_guarantee_erase.png" align="middle" alt="Effect of erase in different underlying data structures" /></div></div></div><br class="figure-break" /><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>

829

Erasing 5 from A1 yields A2. Clearly, an iterator to 3 can

830

be de-referenced and incremented. The sequence of iterators

831

changed, but in a way that is well-defined by the interface.

832

@@ -678,7 +678,7 @@

833

typically less structured than an associative container's tree;

834

the third simply uses an associative container. These are

835

shown in the figure below with labels A1 and A2, B, and C.

836

- </p><div class="figure"><a id="idp17743424"></a><p class="title"><strong>Figure 22.6. Underlying Priority Queue Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_different_underlying_dss_2.png" align="middle" alt="Underlying Priority Queue Data Structures" /></div></div></div><br class="figure-break" /><p>

837

+ </p><div class="figure"><a id="idm269997787392"></a><p class="title"><strong>Figure 22.6. Underlying Priority Queue Data Structures</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_different_underlying_dss_2.png" align="middle" alt="Underlying Priority Queue Data Structures" /></div></div></div><br class="figure-break" /><p>

838

No single implementation can completely replace any of the

839

others. Some have better <code class="function">push</code>

840

and <code class="function">pop</code> amortized performance, some have

841

@@ -1098,7 +1098,7 @@

842

</span>. </span><span class="publisher"><span class="publishername">

843

Proceedings of International Conference on Very Large Data Bases

844

. </span></span></p></div><div class="biblioentry"><a id="biblio.maverik_lowerbounds"></a><p>[biblio.maverik_lowerbounds] <span class="title"><em>

845

- <a class="link" href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps" target="_top">

846

+ <a class="link" href="http://magic.aladdin.cs.cmu.edu/2005/08/01/deamortization-part-2-binomial-heaps/" target="_top">

847

Deamortization - Part 2: Binomial Heaps

848

</a>

849

</em>. </span><span class="date">

850

@@ -1190,7 +1190,7 @@

851

</span>. </span><span class="publisher"><span class="publishername">

852

Addison-Wesley Publishing Company

853

. </span></span></p></div><div class="biblioentry"><a id="biblio.nelson96stlpq"></a><p>[biblio.nelson96stlpq] <span class="title"><em>

854

- <a class="link" href="http://www.dogma.net/markn/articles/pq_stl/priority.htm" target="_top">Priority Queues and the STL

855

+ <a class="link" href="http://marknelson.us/1996/01/01/priority-queues/" target="_top">Priority Queues and the STL

856

</a>

857

</em>. </span><span class="date">

858

January 1996

859

Index: libstdc++-v3/doc/html/manual/ext_iterators.html

860

===================================================================

861

--- a/src/libstdc++-v3/doc/html/manual/ext_iterators.html (.../tags/gcc_4_8_2_release)

862

+++ b/src/libstdc++-v3/doc/html/manual/ext_iterators.html (.../branches/gcc-4_8-branch)

863

@@ -1,5 +1,5 @@

864

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

865

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 27. Iterators</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_numerics.html" title="Chapter 26. Numerics" /><link rel="next" href="ext_io.html" title="Chapter 28. Input and Output" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 27. Iterators</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_numerics.html">Prev</a> </td><th width="60%" align="center">Part III.

866

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 27. Iterators</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_numerics.html" title="Chapter 26. Numerics" /><link rel="next" href="ext_io.html" title="Chapter 28. Input and Output" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 27. Iterators</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_numerics.html">Prev</a> </td><th width="60%" align="center">Part III.

867

Extensions

868

869

</th><td width="20%" align="right"> <a accesskey="n" href="ext_io.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.iterators"></a>Chapter 27. Iterators</h2></div></div></div><p>24.3.2 describes <code class="code">struct iterator</code>, which didn't exist in the

870

Index: libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html

871

===================================================================

872

--- a/src/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html (.../tags/gcc_4_8_2_release)

873

+++ b/src/libstdc++-v3/doc/html/manual/bitmap_allocator_impl.html (.../branches/gcc-4_8-branch)

874

@@ -1,5 +1,5 @@

875

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

876

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator" /><link rel="prev" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator" /><link rel="next" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bitmap_allocator.html">Prev</a> </td><th width="60%" align="center">Chapter 21. The bitmap_allocator</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.bitmap.impl"></a>Implementation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="bitmap.impl.free_list_store"></a>Free List Store</h3></div></div></div><p>

877

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator" /><link rel="prev" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator" /><link rel="next" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bitmap_allocator.html">Prev</a> </td><th width="60%" align="center">Chapter 21. The bitmap_allocator</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.bitmap.impl"></a>Implementation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="bitmap.impl.free_list_store"></a>Free List Store</h3></div></div></div><p>

878

The Free List Store (referred to as FLS for the remaining part of this

879

document) is the Global memory pool that is shared by all instances of

880

the bitmapped allocator instantiated for any type. This maintains a

881

@@ -75,7 +75,7 @@

882

</p><p>

883

Consider a block of size 64 ints. In memory, it would look like this:

884

(assume a 32-bit system where, size_t is a 32-bit entity).

885

- </p><div class="table"><a id="idp17500848"></a><p class="title"><strong>Table 21.1. Bitmap Allocator Memory Map</strong></p><div class="table-contents"><table summary="Bitmap Allocator Memory Map" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left">268</td><td align="left">0</td><td align="left">4294967295</td><td align="left">4294967295</td><td align="left">Data -> Space for 64 ints</td></tr></tbody></table></div></div><br class="table-break" /><p>

886

+ </p><div class="table"><a id="idm269998030352"></a><p class="title"><strong>Table 21.1. Bitmap Allocator Memory Map</strong></p><div class="table-contents"><table summary="Bitmap Allocator Memory Map" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left">268</td><td align="left">0</td><td align="left">4294967295</td><td align="left">4294967295</td><td align="left">Data -> Space for 64 ints</td></tr></tbody></table></div></div><br class="table-break" /><p>

887

The first Column(268) represents the size of the Block in bytes as

888

seen by the Bitmap Allocator. Internally, a global free list is

889

used to keep track of the free blocks used and given back by the

890

Index: libstdc++-v3/doc/html/manual/appendix_contributing.html

891

===================================================================

892

--- a/src/libstdc++-v3/doc/html/manual/appendix_contributing.html (.../tags/gcc_4_8_2_release)

893

+++ b/src/libstdc++-v3/doc/html/manual/appendix_contributing.html (.../branches/gcc-4_8-branch)

894

@@ -1,13 +1,13 @@

895

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

896

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix A. Contributing</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="appendix.html" title="Part IV. Appendices" /><link rel="next" href="source_organization.html" title="Directory Layout and Source Conventions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix A.

897

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix A. Contributing</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="appendix.html" title="Part IV. Appendices" /><link rel="next" href="source_organization.html" title="Directory Layout and Source Conventions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix A.

898

Contributing

899

900

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix.html">Prev</a> </td><th width="60%" align="center">Part IV.

901

Appendices

902

</th><td width="20%" align="right"> <a accesskey="n" href="source_organization.html">Next</a></td></tr></table><hr /></div><div class="appendix"><div class="titlepage"><div><div><h1 class="title"><a id="appendix.contrib"></a>

903

Contributing

904

- <a id="idp21875168" class="indexterm"></a>

905

-</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="section"><a href="source_organization.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="section"><a href="source_code_style.html">Coding Style</a></span></dt><dd><dl><dt><span class="section"><a href="source_code_style.html#coding_style.bad_identifiers">Bad Identifiers</a></span></dt><dt><span class="section"><a href="source_code_style.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="section"><a href="source_design_notes.html">Design Notes</a></span></dt></dl></div><p>

906

+ <a id="idm269993657472" class="indexterm"></a>

907

+</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="section"><a href="source_organization.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="section"><a href="source_code_style.html">Coding Style</a></span></dt><dd><dl><dt><span class="section"><a href="source_code_style.html#coding_style.bad_identifiers">Bad Identifiers</a></span></dt><dt><span class="section"><a href="source_code_style.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="section"><a href="source_design_notes.html">Design Notes</a></span></dt></dl></div><p>

908

The GNU C++ Library follows an open development model. Active

909

contributors are assigned maintainer-ship responsibility, and given

910

write access to the source repository. First time contributors

911

@@ -36,7 +36,7 @@

912

for this group is quite useful.

913

</p></li><li class="listitem"><p>

914

Peruse

915

- the <a class="link" href="http://www.gnu.org/prep/standards" target="_top">GNU

916

+ the <a class="link" href="http://www.gnu.org/prep/standards/" target="_top">GNU

917

Coding Standards</a>, and chuckle when you hit the part

918

about <span class="quote">“<span class="quote">Using Languages Other Than C</span>”</span>.

919

</p></li><li class="listitem"><p>

920

Index: libstdc++-v3/doc/html/manual/parallel_mode_test.html

921

===================================================================

922

--- a/src/libstdc++-v3/doc/html/manual/parallel_mode_test.html (.../tags/gcc_4_8_2_release)

923

+++ b/src/libstdc++-v3/doc/html/manual/parallel_mode_test.html (.../branches/gcc-4_8-branch)

924

@@ -1,5 +1,5 @@

925

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

926

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Testing</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode_design.html" title="Design" /><link rel="next" href="profile_mode.html" title="Chapter 19. Profile Mode" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Testing</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_design.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.test"></a>Testing</h2></div></div></div><p>

927

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Testing</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode_design.html" title="Design" /><link rel="next" href="profile_mode.html" title="Chapter 19. Profile Mode" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Testing</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_design.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.test"></a>Testing</h2></div></div></div><p>

928

Both the normal conformance and regression tests and the

929

supplemental performance tests work.

930

</p><p>

931

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

932

===================================================================

933

--- a/src/libstdc++-v3/doc/html/manual/profile_mode.html (.../tags/gcc_4_8_2_release)

934

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode.html (.../branches/gcc-4_8-branch)

935

@@ -1,8 +1,8 @@

936

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

937

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 19. Profile Mode</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="parallel_mode_test.html" title="Testing" /><link rel="next" href="profile_mode_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 19. Profile Mode</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_test.html">Prev</a> </td><th width="60%" align="center">Part III.

938

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 19. Profile Mode</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="parallel_mode_test.html" title="Testing" /><link rel="next" href="profile_mode_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 19. Profile Mode</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_test.html">Prev</a> </td><th width="60%" align="center">Part III.

939

Extensions

940

941

-</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_design.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.profile_mode"></a>Chapter 19. Profile Mode</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.intro">Intro</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.using">Using the Profile Mode</a></span></dt><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.tuning">Tuning the Profile Mode</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.wrapper">Wrapper Model</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.instrumentation">Instrumentation</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.rtlib">Run Time Behavior</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.analysis">Analysis and Diagnostics</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.cost-model">Cost Model</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.reports">Reports</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.testing">Testing</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_api.html">Extensions for Custom Containers</a></span></dt><dt><span class="section"><a href="profile_mode_cost_model.html">Empirical Cost Model</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html">Implementation Issues</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.stack">Stack Traces</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.symbols">Symbolization of Instruction Addresses</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.concurrency">Concurrency</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.stdlib-in-proflib">Using the Standard Library in the Instrumentation Implementation</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.malloc-hooks">Malloc Hooks</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.construction-destruction">Construction and Destruction of Global Objects</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_devel.html">Developer Information</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_devel.html#manual.ext.profile_mode.developer.bigpic">Big Picture</a></span></dt><dt><span class="section"><a href="profile_mode_devel.html#manual.ext.profile_mode.developer.howto">How To Add A Diagnostic</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html">Diagnostics</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.template">Diagnostic Template</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.containers">Containers</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_small">Hashtable Too Small</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_large">Hashtable Too Large</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.inefficient_hash">Inefficient Hash</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_too_small">Vector Too Small</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_too_large">Vector Too Large</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_to_hashtable">Vector to Hashtable</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_to_vector">Hashtable to Vector</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_to_list">Vector to List</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.list_to_vector">List to Vector</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.list_to_slist">List to Forward List (Slist)</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.assoc_ord_to_unord">Ordered to Unordered Associative Container</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.algorithms">Algorithms</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.algorithms.sort">Sort Algorithm Performance</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality">Data Locality</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality.sw_prefetch">Need Software Prefetch</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality.linked">Linked Structure Locality</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread">Multithreaded Data Access</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread.ddtest">Data Dependence Violations at Container Level</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread.false_share">False Sharing</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.statistics">Statistics</a></span></dt></dl></dd><dt><span class="bibliography"><a href="profile_mode.html#profile_mode.biblio">Bibliography</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.intro"></a>Intro</h2></div></div></div><p>

942

+</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_design.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.profile_mode"></a>Chapter 19. Profile Mode</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.intro">Intro</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.using">Using the Profile Mode</a></span></dt><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.tuning">Tuning the Profile Mode</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.wrapper">Wrapper Model</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.instrumentation">Instrumentation</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.rtlib">Run Time Behavior</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.analysis">Analysis and Diagnostics</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.cost-model">Cost Model</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.reports">Reports</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.testing">Testing</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_api.html">Extensions for Custom Containers</a></span></dt><dt><span class="section"><a href="profile_mode_cost_model.html">Empirical Cost Model</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html">Implementation Issues</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.stack">Stack Traces</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.symbols">Symbolization of Instruction Addresses</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.concurrency">Concurrency</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.stdlib-in-proflib">Using the Standard Library in the Instrumentation Implementation</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.malloc-hooks">Malloc Hooks</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.construction-destruction">Construction and Destruction of Global Objects</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_devel.html">Developer Information</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_devel.html#manual.ext.profile_mode.developer.bigpic">Big Picture</a></span></dt><dt><span class="section"><a href="profile_mode_devel.html#manual.ext.profile_mode.developer.howto">How To Add A Diagnostic</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html">Diagnostics</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.template">Diagnostic Template</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.containers">Containers</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_small">Hashtable Too Small</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_large">Hashtable Too Large</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.inefficient_hash">Inefficient Hash</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_too_small">Vector Too Small</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_too_large">Vector Too Large</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_to_hashtable">Vector to Hashtable</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_to_vector">Hashtable to Vector</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_to_list">Vector to List</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.list_to_vector">List to Vector</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.list_to_slist">List to Forward List (Slist)</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.assoc_ord_to_unord">Ordered to Unordered Associative Container</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.algorithms">Algorithms</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.algorithms.sort">Sort Algorithm Performance</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality">Data Locality</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality.sw_prefetch">Need Software Prefetch</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality.linked">Linked Structure Locality</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread">Multithreaded Data Access</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread.ddtest">Data Dependence Violations at Container Level</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread.false_share">False Sharing</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.statistics">Statistics</a></span></dt></dl></dd><dt><span class="bibliography"><a href="profile_mode.html#profile_mode.biblio">Bibliography</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.intro"></a>Intro</h2></div></div></div><p>

943

<span class="emphasis"><em>Goal: </em></span>Give performance improvement advice based on

944

recognition of suboptimal usage patterns of the standard library.

945

</p><p>

946

@@ -137,7 +137,7 @@

947

call context.

948

(Environment variable not supported.)

949

</p></li></ul></div><p>

950

- </p></div></div><div class="bibliography"><div class="titlepage"><div><div><h2 class="title"><a id="profile_mode.biblio"></a>Bibliography</h2></div></div></div><div class="biblioentry"><a id="idp17395456"></a><p><span class="citetitle"><em class="citetitle">

951

+ </p></div></div><div class="bibliography"><div class="titlepage"><div><div><h2 class="title"><a id="profile_mode.biblio"></a>Bibliography</h2></div></div></div><div class="biblioentry"><a id="idm269998135936"></a><p><span class="citetitle"><em class="citetitle">

952

Perflint: A Context Sensitive Performance Advisor for C++ Programs

953

</em>. </span><span class="author"><span class="firstname">Lixia</span> <span class="surname">Liu</span>. </span><span class="author"><span class="firstname">Silvius</span> <span class="surname">Rus</span>. </span><span class="copyright">Copyright © 2009 . </span><span class="publisher"><span class="publishername">

954

Proceedings of the 2009 International Symposium on Code Generation

955

Index: libstdc++-v3/doc/html/manual/stringstreams.html

956

===================================================================

957

--- a/src/libstdc++-v3/doc/html/manual/stringstreams.html (.../tags/gcc_4_8_2_release)

958

+++ b/src/libstdc++-v3/doc/html/manual/stringstreams.html (.../branches/gcc-4_8-branch)

959

@@ -1,5 +1,5 @@

960

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

961

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Memory Based Streams</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="streambufs.html" title="Stream Buffers" /><link rel="next" href="fstreams.html" title="File Based Streams" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Memory Based Streams</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="streambufs.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

962

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Memory Based Streams</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="streambufs.html" title="Stream Buffers" /><link rel="next" href="fstreams.html" title="File Based Streams" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Memory Based Streams</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="streambufs.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

963

Input and Output

964

965

</th><td width="20%" align="right"> <a accesskey="n" href="fstreams.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.io.memstreams"></a>Memory Based Streams</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.io.memstreams.compat"></a>Compatibility With strstream</h3></div></div></div><p>

966

Index: libstdc++-v3/doc/html/manual/traits.html

967

===================================================================

968

--- a/src/libstdc++-v3/doc/html/manual/traits.html (.../tags/gcc_4_8_2_release)

969

+++ b/src/libstdc++-v3/doc/html/manual/traits.html (.../branches/gcc-4_8-branch)

970

@@ -1,5 +1,5 @@

971

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

972

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Traits</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="utilities.html" title="Chapter 6. Utilities" /><link rel="prev" href="memory.html" title="Memory" /><link rel="next" href="strings.html" title="Chapter 7. Strings" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Traits</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="memory.html">Prev</a> </td><th width="60%" align="center">Chapter 6.

973

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Traits</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="utilities.html" title="Chapter 6. Utilities" /><link rel="prev" href="memory.html" title="Memory" /><link rel="next" href="strings.html" title="Chapter 7. Strings" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Traits</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="memory.html">Prev</a> </td><th width="60%" align="center">Chapter 6.

974

Utilities

975

976

</th><td width="20%" align="right"> <a accesskey="n" href="strings.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.util.traits"></a>Traits</h2></div></div></div><p>

977

Index: libstdc++-v3/doc/html/manual/policy_data_structures_ack.html

978

===================================================================

979

--- a/src/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html (.../tags/gcc_4_8_2_release)

980

+++ b/src/libstdc++-v3/doc/html/manual/policy_data_structures_ack.html (.../branches/gcc-4_8-branch)

981

@@ -1,10 +1,9 @@

982

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

983

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Acknowledgments</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_based_data_structures_test.html" title="Testing" /><link rel="next" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Acknowledgments</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_based_data_structures_test.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="ext_containers.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="pbds.ack"></a>Acknowledgments</h2></div></div></div><p>

984

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Acknowledgments</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_based_data_structures_test.html" title="Testing" /><link rel="next" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Acknowledgments</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_based_data_structures_test.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="ext_containers.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="pbds.ack"></a>Acknowledgments</h2></div></div></div><p>

985

Written by Ami Tavory and Vladimir Dreizin (IBM Haifa Research

986

Laboratories), and Benjamin Kosnik (Red Hat).

987

</p><p>

988

- This library was partially written at

989

- <a class="link" href="http://www.haifa.il.ibm.com/" target="_top">IBM's Haifa Research Labs</a>.

990

+ This library was partially written at IBM's Haifa Research Labs.

991

It is based heavily on policy-based design and uses many useful

992

techniques from Modern C++ Design: Generic Programming and Design

993

Patterns Applied by Andrei Alexandrescu.

994

Index: libstdc++-v3/doc/html/manual/associative.html

995

===================================================================

996

--- a/src/libstdc++-v3/doc/html/manual/associative.html (.../tags/gcc_4_8_2_release)

997

+++ b/src/libstdc++-v3/doc/html/manual/associative.html (.../branches/gcc-4_8-branch)

998

@@ -1,5 +1,5 @@

999

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1000

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Associative</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="containers.html" title="Chapter 9. Containers" /><link rel="prev" href="containers.html" title="Chapter 9. Containers" /><link rel="next" href="unordered_associative.html" title="Unordered Associative" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Associative</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="containers.html">Prev</a> </td><th width="60%" align="center">Chapter 9.

1001

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Associative</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="containers.html" title="Chapter 9. Containers" /><link rel="prev" href="containers.html" title="Chapter 9. Containers" /><link rel="next" href="unordered_associative.html" title="Unordered Associative" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Associative</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="containers.html">Prev</a> </td><th width="60%" align="center">Chapter 9.

1002

Containers

1003

1004

</th><td width="20%" align="right"> <a accesskey="n" href="unordered_associative.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.containers.associative"></a>Associative</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="containers.associative.insert_hints"></a>Insertion Hints</h3></div></div></div><p>

1005

Index: libstdc++-v3/doc/html/manual/ext_concurrency.html

1006

===================================================================

1007

--- a/src/libstdc++-v3/doc/html/manual/ext_concurrency.html (.../tags/gcc_4_8_2_release)

1008

+++ b/src/libstdc++-v3/doc/html/manual/ext_concurrency.html (.../branches/gcc-4_8-branch)

1009

@@ -1,8 +1,8 @@

1010

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1011

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 30. Concurrency</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_demangling.html" title="Chapter 29. Demangling" /><link rel="next" href="ext_concurrency_impl.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 30. Concurrency</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_demangling.html">Prev</a> </td><th width="60%" align="center">Part III.

1012

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 30. Concurrency</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_demangling.html" title="Chapter 29. Demangling" /><link rel="next" href="ext_concurrency_impl.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 30. Concurrency</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_demangling.html">Prev</a> </td><th width="60%" align="center">Part III.

1013

Extensions

1014

1015

-</th><td width="20%" align="right"> <a accesskey="n" href="ext_concurrency_impl.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.concurrency"></a>Chapter 30. Concurrency</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="ext_concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="ext_concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="section"><a href="ext_concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="section"><a href="ext_concurrency_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="ext_concurrency_impl.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builtin Atomic Functions</a></span></dt><dt><span class="section"><a href="ext_concurrency_impl.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="section"><a href="ext_concurrency_use.html">Use</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.design"></a>Design</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.design.threads"></a>Interface to Locks and Mutexes</h3></div></div></div><p>The file <code class="filename"><ext/concurrence.h></code>

1016

+</th><td width="20%" align="right"> <a accesskey="n" href="ext_concurrency_impl.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.concurrency"></a>Chapter 30. Concurrency</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="ext_concurrency.html#manual.ext.concurrency.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="ext_concurrency.html#manual.ext.concurrency.design.threads">Interface to Locks and Mutexes</a></span></dt><dt><span class="section"><a href="ext_concurrency.html#manual.ext.concurrency.design.atomics">Interface to Atomic Functions</a></span></dt></dl></dd><dt><span class="section"><a href="ext_concurrency_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="ext_concurrency_impl.html#manual.ext.concurrency.impl.atomic_fallbacks">Using Builtin Atomic Functions</a></span></dt><dt><span class="section"><a href="ext_concurrency_impl.html#manual.ext.concurrency.impl.thread">Thread Abstraction</a></span></dt></dl></dd><dt><span class="section"><a href="ext_concurrency_use.html">Use</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.design"></a>Design</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.design.threads"></a>Interface to Locks and Mutexes</h3></div></div></div><p>The file <code class="filename"><ext/concurrence.h></code>

1017

contains all the higher-level

1018

constructs for playing with threads. In contrast to the atomics layer,

1019

the concurrence layer consists largely of types. All types are defined within <code class="code">namespace __gnu_cxx</code>.

1020

Index: libstdc++-v3/doc/html/manual/support.html

1021

===================================================================

1022

--- a/src/libstdc++-v3/doc/html/manual/support.html (.../tags/gcc_4_8_2_release)

1023

+++ b/src/libstdc++-v3/doc/html/manual/support.html (.../branches/gcc-4_8-branch)

1024

@@ -1,13 +1,13 @@

1025

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1026

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 4. Support</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="std_contents.html" title="Part II. Standard Contents" /><link rel="next" href="dynamic_memory.html" title="Dynamic Memory" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 4.

1027

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 4. Support</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="std_contents.html" title="Part II. Standard Contents" /><link rel="next" href="dynamic_memory.html" title="Dynamic Memory" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 4.

1028

Support

1029

1030

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="std_contents.html">Prev</a> </td><th width="60%" align="center">Part II.

1031

Standard Contents

1032

</th><td width="20%" align="right"> <a accesskey="n" href="dynamic_memory.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.support"></a>Chapter 4.

1033

Support

1034

- <a id="idp13745936" class="indexterm"></a>

1035

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="support.html#std.support.types">Types</a></span></dt><dd><dl><dt><span class="section"><a href="support.html#std.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="section"><a href="support.html#std.support.types.numeric_limits">Numeric Properties</a></span></dt><dt><span class="section"><a href="support.html#std.support.types.null">NULL</a></span></dt></dl></dd><dt><span class="section"><a href="dynamic_memory.html">Dynamic Memory</a></span></dt><dt><span class="section"><a href="termination.html">Termination</a></span></dt><dd><dl><dt><span class="section"><a href="termination.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="section"><a href="termination.html#support.termination.verbose">Verbose Terminate Handler</a></span></dt></dl></dd></dl></div><p>

1036

+ <a id="idm270001786944" class="indexterm"></a>

1037

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="support.html#std.support.types">Types</a></span></dt><dd><dl><dt><span class="section"><a href="support.html#std.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="section"><a href="support.html#std.support.types.numeric_limits">Numeric Properties</a></span></dt><dt><span class="section"><a href="support.html#std.support.types.null">NULL</a></span></dt></dl></dd><dt><span class="section"><a href="dynamic_memory.html">Dynamic Memory</a></span></dt><dt><span class="section"><a href="termination.html">Termination</a></span></dt><dd><dl><dt><span class="section"><a href="termination.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="section"><a href="termination.html#support.termination.verbose">Verbose Terminate Handler</a></span></dt></dl></dd></dl></div><p>

1038

This part deals with the functions called and objects created

1039

automatically during the course of a program's existence.

1040

</p><p>

1041

Index: libstdc++-v3/doc/html/manual/bitmap_allocator.html

1042

===================================================================

1043

--- a/src/libstdc++-v3/doc/html/manual/bitmap_allocator.html (.../tags/gcc_4_8_2_release)

1044

+++ b/src/libstdc++-v3/doc/html/manual/bitmap_allocator.html (.../branches/gcc-4_8-branch)

1045

@@ -1,8 +1,8 @@

1046

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1047

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 21. The bitmap_allocator</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="mt_allocator_ex_multi.html" title="Multiple Thread Example" /><link rel="next" href="bitmap_allocator_impl.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 21. The bitmap_allocator</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_ex_multi.html">Prev</a> </td><th width="60%" align="center">Part III.

1048

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 21. The bitmap_allocator</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="mt_allocator_ex_multi.html" title="Multiple Thread Example" /><link rel="next" href="bitmap_allocator_impl.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 21. The bitmap_allocator</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_ex_multi.html">Prev</a> </td><th width="60%" align="center">Part III.

1049

Extensions

1050

1051

-</th><td width="20%" align="right"> <a accesskey="n" href="bitmap_allocator_impl.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.allocator.bitmap"></a>Chapter 21. The bitmap_allocator</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.free_list_store">Free List Store</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.super_block">Super Block</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.super_block_data">Super Block Data Layout</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.max_wasted">Maximum Wasted Percentage</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.allocate"><code class="function">allocate</code></a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.deallocate"><code class="function">deallocate</code></a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.questions">Questions</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.1">1</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.2">2</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.3">3</a></span></dt></dl></dd><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.locality">Locality</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.grow_policy">Overhead and Grow Policy</a></span></dt></dl></dd></dl></div><p>

1052

+</th><td width="20%" align="right"> <a accesskey="n" href="bitmap_allocator_impl.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.allocator.bitmap"></a>Chapter 21. The bitmap_allocator</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.free_list_store">Free List Store</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.super_block">Super Block</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.super_block_data">Super Block Data Layout</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.max_wasted">Maximum Wasted Percentage</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.allocate"><code class="function">allocate</code></a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.deallocate"><code class="function">deallocate</code></a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.questions">Questions</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.1">1</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.2">2</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.3">3</a></span></dt></dl></dd><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.locality">Locality</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.grow_policy">Overhead and Grow Policy</a></span></dt></dl></dd></dl></div><p>

1053

</p><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.bitmap.design"></a>Design</h2></div></div></div><p>

1054

As this name suggests, this allocator uses a bit-map to keep track

1055

of the used and unused memory locations for its book-keeping

1056

Index: libstdc++-v3/doc/html/manual/license.html

1057

===================================================================

1058

--- a/src/libstdc++-v3/doc/html/manual/license.html (.../tags/gcc_4_8_2_release)

1059

+++ b/src/libstdc++-v3/doc/html/manual/license.html (.../branches/gcc-4_8-branch)

1060

@@ -1,5 +1,5 @@

1061

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1062

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>License</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="status.html" title="Chapter 1. Status" /><link rel="prev" href="status.html" title="Chapter 1. Status" /><link rel="next" href="bugs.html" title="Bugs" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">License</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="status.html">Prev</a> </td><th width="60%" align="center">Chapter 1. Status</th><td width="20%" align="right"> <a accesskey="n" href="bugs.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.status.license"></a>License</h2></div></div></div><p>

1063

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>License</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="status.html" title="Chapter 1. Status" /><link rel="prev" href="status.html" title="Chapter 1. Status" /><link rel="next" href="bugs.html" title="Bugs" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">License</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="status.html">Prev</a> </td><th width="60%" align="center">Chapter 1. Status</th><td width="20%" align="right"> <a accesskey="n" href="bugs.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.status.license"></a>License</h2></div></div></div><p>

1064

There are two licenses affecting GNU libstdc++: one for the code,

1065

and one for the documentation.

1066

</p><p>

1067

Index: libstdc++-v3/doc/html/manual/numerics.html

1068

===================================================================

1069

--- a/src/libstdc++-v3/doc/html/manual/numerics.html (.../tags/gcc_4_8_2_release)

1070

+++ b/src/libstdc++-v3/doc/html/manual/numerics.html (.../branches/gcc-4_8-branch)

1071

@@ -1,13 +1,13 @@

1072

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1073

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 12. Numerics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="algorithms.html" title="Chapter 11. Algorithms" /><link rel="next" href="generalized_numeric_operations.html" title="Generalized Operations" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 12.

1074

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 12. Numerics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="algorithms.html" title="Chapter 11. Algorithms" /><link rel="next" href="generalized_numeric_operations.html" title="Generalized Operations" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 12.

1075

Numerics

1076

1077

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="algorithms.html">Prev</a> </td><th width="60%" align="center">Part II.

1078

Standard Contents

1079

</th><td width="20%" align="right"> <a accesskey="n" href="generalized_numeric_operations.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.numerics"></a>Chapter 12.

1080

Numerics

1081

- <a id="idp16214640" class="indexterm"></a>

1082

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="numerics.html#std.numerics.complex">Complex</a></span></dt><dd><dl><dt><span class="section"><a href="numerics.html#numerics.complex.processing">complex Processing</a></span></dt></dl></dd><dt><span class="section"><a href="generalized_numeric_operations.html">Generalized Operations</a></span></dt><dt><span class="section"><a href="numerics_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="numerics_and_c.html#numerics.c.array">Numerics vs. Arrays</a></span></dt><dt><span class="section"><a href="numerics_and_c.html#numerics.c.c99">C99</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.numerics.complex"></a>Complex</h2></div></div></div><p>

1083

+ <a id="idm269999316576" class="indexterm"></a>

1084

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="numerics.html#std.numerics.complex">Complex</a></span></dt><dd><dl><dt><span class="section"><a href="numerics.html#numerics.complex.processing">complex Processing</a></span></dt></dl></dd><dt><span class="section"><a href="generalized_numeric_operations.html">Generalized Operations</a></span></dt><dt><span class="section"><a href="numerics_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="numerics_and_c.html#numerics.c.array">Numerics vs. Arrays</a></span></dt><dt><span class="section"><a href="numerics_and_c.html#numerics.c.c99">C99</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.numerics.complex"></a>Complex</h2></div></div></div><p>

1085

</p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="numerics.complex.processing"></a>complex Processing</h3></div></div></div><p>

1086

</p><p>Using <code class="code">complex<></code> becomes even more comple- er, sorry,

1087

<span class="emphasis"><em>complicated</em></span>, with the not-quite-gratuitously-incompatible

1088

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

1089

===================================================================

1090

--- a/src/libstdc++-v3/doc/html/manual/using_exceptions.html (.../tags/gcc_4_8_2_release)

1091

+++ b/src/libstdc++-v3/doc/html/manual/using_exceptions.html (.../branches/gcc-4_8-branch)

1092

@@ -1,5 +1,5 @@

1093

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1094

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Exceptions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, exception, error, exception neutrality, exception safety, exception propagation, -fno-exceptions" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_concurrency.html" title="Concurrency" /><link rel="next" href="debug.html" title="Debugging Support" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Exceptions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_concurrency.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="debug.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.exceptions"></a>Exceptions</h2></div></div></div><p>

1095

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Exceptions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, exception, error, exception neutrality, exception safety, exception propagation, -fno-exceptions" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_concurrency.html" title="Concurrency" /><link rel="next" href="debug.html" title="Debugging Support" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Exceptions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_concurrency.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="debug.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.exceptions"></a>Exceptions</h2></div></div></div><p>

1096

The C++ language provides language support for stack unwinding

1097

with <code class="literal">try</code> and <code class="literal">catch</code> blocks and

1098

the <code class="literal">throw</code> keyword.

1099

@@ -265,7 +265,7 @@

1100

}

1101

catch(...)

1102

{ this->_M_setstate(ios_base::badbit); }

1103

-</pre></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="using.exceptions.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="idp13644000"></a><p><span class="title"><em>

1104

+</pre></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="using.exceptions.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="idm270001889024"></a><p><span class="title"><em>

1105

1106

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

1107

</a>

1108

@@ -274,39 +274,39 @@

1109

1110

The Open Group/The Institute of Electrical and Electronics

1111

Engineers, Inc.

1112

- . </span></p></div><div class="biblioentry"><a id="idp13647696"></a><p><span class="title"><em>

1113

+ . </span></p></div><div class="biblioentry"><a id="idm270001885328"></a><p><span class="title"><em>

1114

1115

Error and Exception Handling

1116

</a>

1117

</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams </span>. </span><span class="publisher"><span class="publishername">

1118

Boost

1119

- . </span></span></p></div><div class="biblioentry"><a id="idp13651392"></a><p><span class="title"><em>

1120

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001881632"></a><p><span class="title"><em>

1121

1122

Exception-Safety in Generic Components

1123

</a>

1124

</em>. </span><span class="author"><span class="firstname">David</span> <span class="surname">Abrahams</span>. </span><span class="publisher"><span class="publishername">

1125

Boost

1126

- . </span></span></p></div><div class="biblioentry"><a id="idp13655104"></a><p><span class="title"><em>

1127

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001877920"></a><p><span class="title"><em>

1128

1129

Standard Library Exception Policy

1130

</a>

1131

</em>. </span><span class="author"><span class="firstname">Matt</span> <span class="surname">Austern</span>. </span><span class="publisher"><span class="publishername">

1132

WG21 N1077

1133

- . </span></span></p></div><div class="biblioentry"><a id="idp13658816"></a><p><span class="title"><em>

1134

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001874208"></a><p><span class="title"><em>

1135

1136

ia64 c++ abi exception handling

1137

</a>

1138

</em>. </span><span class="author"><span class="firstname">Richard</span> <span class="surname">Henderson</span>. </span><span class="publisher"><span class="publishername">

1139

GNU

1140

- . </span></span></p></div><div class="biblioentry"><a id="idp13662512"></a><p><span class="title"><em>

1141

+ . </span></span></p></div><div class="biblioentry"><a id="idm270001870512"></a><p><span class="title"><em>

1142

1143

Appendix E: Standard-Library Exception Safety

1144

</a>

1145

- </em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span></p></div><div class="biblioentry"><a id="idp13665328"></a><p><span class="citetitle"><em class="citetitle">

1146

+ </em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span></p></div><div class="biblioentry"><a id="idm270001867696"></a><p><span class="citetitle"><em class="citetitle">

1147

Exceptional C++

1148

</em>. </span><span class="pagenums">

1149

Exception-Safety Issues and Techniques

1150

- . </span><span class="author"><span class="firstname">Herb</span> <span class="surname">Sutter</span>. </span></p></div><div class="biblioentry"><a id="idp13667712"></a><p><span class="title"><em>

1151

+ . </span><span class="author"><span class="firstname">Herb</span> <span class="surname">Sutter</span>. </span></p></div><div class="biblioentry"><a id="idm270001865312"></a><p><span class="title"><em>

1152

1153

GCC Bug 25191: exception_defines.h #defines try/catch

1154

</a>

1155

Index: libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html

1156

===================================================================

1157

--- a/src/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html (.../tags/gcc_4_8_2_release)

1158

+++ b/src/libstdc++-v3/doc/html/manual/policy_based_data_structures_test.html (.../branches/gcc-4_8-branch)

1159

@@ -1,5 +1,5 @@

1160

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1161

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Testing</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_data_structures_design.html" title="Design" /><link rel="next" href="policy_data_structures_ack.html" title="Acknowledgments" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Testing</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures_design.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures_ack.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="pbds.test"></a>Testing</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.test.regression"></a>Regression</h3></div></div></div><p>The library contains a single comprehensive regression test.

1162

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Testing</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_data_structures_design.html" title="Design" /><link rel="next" href="policy_data_structures_ack.html" title="Acknowledgments" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Testing</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures_design.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures_ack.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="pbds.test"></a>Testing</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.test.regression"></a>Regression</h3></div></div></div><p>The library contains a single comprehensive regression test.

1163

For a given container type in this library, the test creates

1164

an object of the container type and an object of the

1165

corresponding standard type (e.g., <code class="classname">std::set</code>). It

1166

Index: libstdc++-v3/doc/html/manual/parallel_mode_design.html

1167

===================================================================

1168

--- a/src/libstdc++-v3/doc/html/manual/parallel_mode_design.html (.../tags/gcc_4_8_2_release)

1169

+++ b/src/libstdc++-v3/doc/html/manual/parallel_mode_design.html (.../branches/gcc-4_8-branch)

1170

@@ -1,5 +1,5 @@

1171

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1172

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode_using.html" title="Using" /><link rel="next" href="parallel_mode_test.html" title="Testing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_using.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_test.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.design"></a>Design</h2></div></div></div><p>

1173

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode_using.html" title="Using" /><link rel="next" href="parallel_mode_test.html" title="Testing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_using.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_test.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.design"></a>Design</h2></div></div></div><p>

1174

</p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="parallel_mode.design.intro"></a>Interface Basics</h3></div></div></div><p>

1175

All parallel algorithms are intended to have signatures that are

1176

equivalent to the ISO C++ algorithms replaced. For instance, the

1177

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

1178

===================================================================

1179

--- a/src/libstdc++-v3/doc/html/manual/abi.html (.../tags/gcc_4_8_2_release)

1180

+++ b/src/libstdc++-v3/doc/html/manual/abi.html (.../branches/gcc-4_8-branch)

1181

@@ -1,5 +1,5 @@

1182

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1183

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>ABI Policy and Guidelines</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, ABI, version, dynamic, shared, compatibility" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="test.html" title="Test" /><link rel="next" href="api.html" title="API Evolution and Deprecation History" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">ABI Policy and Guidelines</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="test.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1184

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>ABI Policy and Guidelines</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, ABI, version, dynamic, shared, compatibility" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="test.html" title="Test" /><link rel="next" href="api.html" title="API Evolution and Deprecation History" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">ABI Policy and Guidelines</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="test.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1185

Porting and Maintenance

1186

1187

</th><td width="20%" align="right"> <a accesskey="n" href="api.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="appendix.porting.abi"></a>ABI Policy and Guidelines</h2></div></div></div><p>

1188

@@ -493,39 +493,39 @@

1189

1190

C++ ABI Summary

1191

</a>

1192

- </em>. </span></p></div><div class="biblioentry"><a id="idp22945936"></a><p><span class="title"><em>

1193

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992586624"></a><p><span class="title"><em>

1194

1195

Intel Compilers for Linux Compatibility with the GNU Compilers

1196

</a>

1197

- </em>. </span></p></div><div class="biblioentry"><a id="idp22947792"></a><p><span class="title"><em>

1198

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992584768"></a><p><span class="title"><em>

1199

1200

Linker and Libraries Guide (document 819-0690)

1201

</a>

1202

- </em>. </span></p></div><div class="biblioentry"><a id="idp22949632"></a><p><span class="title"><em>

1203

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992582928"></a><p><span class="title"><em>

1204

1205

Sun Studio 11: C++ Migration Guide (document 819-3689)

1206

</a>

1207

- </em>. </span></p></div><div class="biblioentry"><a id="idp22951488"></a><p><span class="title"><em>

1208

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992581072"></a><p><span class="title"><em>

1209

1210

How to Write Shared Libraries

1211

</a>

1212

- </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span></p></div><div class="biblioentry"><a id="idp22954928"></a><p><span class="title"><em>

1213

+ </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span></p></div><div class="biblioentry"><a id="idm269992577632"></a><p><span class="title"><em>

1214

1215

C++ ABI for the ARM Architecture

1216

</a>

1217

- </em>. </span></p></div><div class="biblioentry"><a id="idp22956736"></a><p><span class="title"><em>

1218

+ </em>. </span></p></div><div class="biblioentry"><a id="idm269992575824"></a><p><span class="title"><em>

1219

1220

Dynamic Shared Objects: Survey and Issues

1221

</a>

1222

</em>. </span><span class="subtitle">

1223

ISO C++ J16/06-0046

1224

- . </span><span class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span>. </span></p></div><div class="biblioentry"><a id="idp22960032"></a><p><span class="title"><em>

1225

+ . </span><span class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span>. </span></p></div><div class="biblioentry"><a id="idm269992572528"></a><p><span class="title"><em>

1226

1227

Versioning With Namespaces

1228

</a>

1229

</em>. </span><span class="subtitle">

1230

ISO C++ J16/06-0083

1231

- . </span><span class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span>. </span></p></div><div class="biblioentry"><a id="idp22963312"></a><p><span class="title"><em>

1232

+ . </span><span class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span>. </span></p></div><div class="biblioentry"><a id="idm269992569248"></a><p><span class="title"><em>

1233

1234

Binary Compatibility of Shared Libraries Implemented in C++

1235

on GNU/Linux Systems

1236

Index: libstdc++-v3/doc/html/manual/intro.html

1237

===================================================================

1238

--- a/src/libstdc++-v3/doc/html/manual/intro.html (.../tags/gcc_4_8_2_release)

1239

+++ b/src/libstdc++-v3/doc/html/manual/intro.html (.../branches/gcc-4_8-branch)

1240

@@ -1,8 +1,8 @@

1241

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1242

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part I. Introduction</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="index.html" title="The GNU C++ Library Manual" /><link rel="next" href="status.html" title="Chapter 1. Status" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part I.

1243

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part I. Introduction</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="index.html" title="The GNU C++ Library Manual" /><link rel="next" href="status.html" title="Chapter 1. Status" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part I.

1244

Introduction

1245

1246

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="index.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library Manual</th><td width="20%" align="right"> <a accesskey="n" href="status.html">Next</a></td></tr></table><hr /></div><div class="part"><div class="titlepage"><div><div><h1 class="title"><a id="manual.intro"></a>Part I.

1247

Introduction

1248

- <a id="idp9040416" class="indexterm"></a>

1249

-</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="chapter"><a href="status.html">1. Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#manual.intro.status.iso">Implementation Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#status.iso.1998">C++ 1998/2003</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.1998.status">Implementation Status</a></span></dt><dt><span class="section"><a href="status.html#iso.1998.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.2011">C++ 2011</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.2011.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr1">C++ TR1</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.tr1.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr24733">C++ TR 24733</a></span></dt></dl></dd><dt><span class="section"><a href="license.html">License</a></span></dt><dd><dl><dt><span class="section"><a href="license.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="section"><a href="license.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="section"><a href="bugs.html">Bugs</a></span></dt><dd><dl><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="setup.html">2. Setup</a></span></dt><dd><dl><dt><span class="section"><a href="setup.html#manual.intro.setup.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="configure.html">Configure</a></span></dt><dt><span class="section"><a href="make.html">Make</a></span></dt></dl></dd><dt><span class="chapter"><a href="using.html">3. Using</a></span></dt><dd><dl><dt><span class="section"><a href="using.html#manual.intro.using.flags">Command Options</a></span></dt><dt><span class="section"><a href="using_headers.html">Headers</a></span></dt><dd><dl><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="section"><a href="using_macros.html">Macros</a></span></dt><dt><span class="section"><a href="using_namespaces.html">Namespaces</a></span></dt><dd><dl><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="section"><a href="using_dynamic_or_shared.html">Linking</a></span></dt><dd><dl><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.freestanding">Almost Nothing</a></span></dt><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.dynamic">Finding Dynamic or Shared Libraries</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html">Concurrency</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.io">IO</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#concurrency.io.structure">Structure</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.defaults">Defaults</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.future">Future</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.alt">Alternatives</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="section"><a href="using_exceptions.html">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.safety">Exception Safety</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.propagating">Exception Neutrality</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.no">Doing without</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.compat">Compatibility</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.c">With <code class="literal">C</code></a></span></dt><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.posix">With <code class="literal">POSIX</code> thread cancellation</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="section"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="section"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.races">Data Race Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="section"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="section"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt><dt><span class="section"><a href="debug.html#debug.profile_mode">Profile-based Performance Analysis</a></span></dt></dl></dd></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="index.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="index.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="status.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library Manual </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Chapter 1. Status</td></tr></table></div></body></html>

1250

\ No newline at end of file

1251

+ <a id="idm270013458800" class="indexterm"></a>

1252

+</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="chapter"><a href="status.html">1. Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#manual.intro.status.iso">Implementation Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#status.iso.1998">C++ 1998/2003</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.1998.status">Implementation Status</a></span></dt><dt><span class="section"><a href="status.html#iso.1998.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.2011">C++ 2011</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.2011.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr1">C++ TR1</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.tr1.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr24733">C++ TR 24733</a></span></dt></dl></dd><dt><span class="section"><a href="license.html">License</a></span></dt><dd><dl><dt><span class="section"><a href="license.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="section"><a href="license.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="section"><a href="bugs.html">Bugs</a></span></dt><dd><dl><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="setup.html">2. Setup</a></span></dt><dd><dl><dt><span class="section"><a href="setup.html#manual.intro.setup.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="configure.html">Configure</a></span></dt><dt><span class="section"><a href="make.html">Make</a></span></dt></dl></dd><dt><span class="chapter"><a href="using.html">3. Using</a></span></dt><dd><dl><dt><span class="section"><a href="using.html#manual.intro.using.flags">Command Options</a></span></dt><dt><span class="section"><a href="using_headers.html">Headers</a></span></dt><dd><dl><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="section"><a href="using_macros.html">Macros</a></span></dt><dt><span class="section"><a href="using_namespaces.html">Namespaces</a></span></dt><dd><dl><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="section"><a href="using_dynamic_or_shared.html">Linking</a></span></dt><dd><dl><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.freestanding">Almost Nothing</a></span></dt><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.dynamic">Finding Dynamic or Shared Libraries</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html">Concurrency</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.io">IO</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#concurrency.io.structure">Structure</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.defaults">Defaults</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.future">Future</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.alt">Alternatives</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="section"><a href="using_exceptions.html">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.safety">Exception Safety</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.propagating">Exception Neutrality</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.no">Doing without</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.compat">Compatibility</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.c">With <code class="literal">C</code></a></span></dt><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.posix">With <code class="literal">POSIX</code> thread cancellation</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="section"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="section"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.races">Data Race Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="section"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="section"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt><dt><span class="section"><a href="debug.html#debug.profile_mode">Profile-based Performance Analysis</a></span></dt></dl></dd></dl></dd></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="index.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="index.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="status.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library Manual </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Chapter 1. Status</td></tr></table></div></body></html>

1253

\ No newline at end of file

1254

Index: libstdc++-v3/doc/html/manual/profile_mode_api.html

1255

===================================================================

1256

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_api.html (.../tags/gcc_4_8_2_release)

1257

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_api.html (.../branches/gcc-4_8-branch)

1258

@@ -1,5 +1,5 @@

1259

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1260

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Extensions for Custom Containers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_design.html" title="Design" /><link rel="next" href="profile_mode_cost_model.html" title="Empirical Cost Model" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Extensions for Custom Containers</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_design.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_cost_model.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.api"></a>Extensions for Custom Containers</h2></div></div></div><p>

1261

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Extensions for Custom Containers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_design.html" title="Design" /><link rel="next" href="profile_mode_cost_model.html" title="Empirical Cost Model" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Extensions for Custom Containers</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_design.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_cost_model.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.api"></a>Extensions for Custom Containers</h2></div></div></div><p>

1262

Many large projects use their own data structures instead of the ones in the

1263

standard library. If these data structures are similar in functionality

1264

to the standard library, they can be instrumented with the same hooks

1265

Index: libstdc++-v3/doc/html/manual/atomics.html

1266

===================================================================

1267

--- a/src/libstdc++-v3/doc/html/manual/atomics.html (.../tags/gcc_4_8_2_release)

1268

+++ b/src/libstdc++-v3/doc/html/manual/atomics.html (.../branches/gcc-4_8-branch)

1269

@@ -1,13 +1,13 @@

1270

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1271

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 14. Atomics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library, atomic" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="io_and_c.html" title="Interacting with C" /><link rel="next" href="concurrency.html" title="Chapter 15. Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 14.

1272

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 14. Atomics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library, atomic" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="io_and_c.html" title="Interacting with C" /><link rel="next" href="concurrency.html" title="Chapter 15. Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 14.

1273

Atomics

1274

1275

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="io_and_c.html">Prev</a> </td><th width="60%" align="center">Part II.

1276

Standard Contents

1277

</th><td width="20%" align="right"> <a accesskey="n" href="concurrency.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.atomics"></a>Chapter 14.

1278

Atomics

1279

- <a id="idp16390640" class="indexterm"></a>

1280

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="atomics.html#std.atomics.api">API Reference</a></span></dt></dl></div><p>

1281

+ <a id="idm269999140704" class="indexterm"></a>

1282

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="atomics.html#std.atomics.api">API Reference</a></span></dt></dl></div><p>

1283

Facilities for atomic operations.

1284

</p><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.atomics.api"></a>API Reference</h2></div></div></div><p>

1285

All items are declared in the standard header

1286

Index: libstdc++-v3/doc/html/manual/internals.html

1287

===================================================================

1288

--- a/src/libstdc++-v3/doc/html/manual/internals.html (.../tags/gcc_4_8_2_release)

1289

+++ b/src/libstdc++-v3/doc/html/manual/internals.html (.../branches/gcc-4_8-branch)

1290

@@ -1,5 +1,5 @@

1291

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1292

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Porting to New Hardware or Operating Systems</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, internals" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="documentation_hacking.html" title="Writing and Generating Documentation" /><link rel="next" href="test.html" title="Test" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Porting to New Hardware or Operating Systems</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="documentation_hacking.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1293

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Porting to New Hardware or Operating Systems</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, internals" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="documentation_hacking.html" title="Writing and Generating Documentation" /><link rel="next" href="test.html" title="Test" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Porting to New Hardware or Operating Systems</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="documentation_hacking.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1294

Porting and Maintenance

1295

1296

</th><td width="20%" align="right"> <a accesskey="n" href="test.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="appendix.porting.internals"></a>Porting to New Hardware or Operating Systems</h2></div></div></div><p>

1297

Index: libstdc++-v3/doc/html/manual/policy_data_structures_using.html

1298

===================================================================

1299

--- a/src/libstdc++-v3/doc/html/manual/policy_data_structures_using.html (.../tags/gcc_4_8_2_release)

1300

+++ b/src/libstdc++-v3/doc/html/manual/policy_data_structures_using.html (.../branches/gcc-4_8-branch)

1301

@@ -1,5 +1,5 @@

1302

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1303

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="next" href="policy_data_structures_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures_design.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="containers.pbds.using"></a>Using</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.using.prereq"></a>Prerequisites</h3></div></div></div><p>The library contains only header files, and does not require any

1304

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, policy, container, data, structure, associated, tree, trie, hash, metaprogramming" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="prev" href="policy_data_structures.html" title="Chapter 22. Policy-Based Data Structures" /><link rel="next" href="policy_data_structures_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="policy_data_structures.html">Prev</a> </td><th width="60%" align="center">Chapter 22. Policy-Based Data Structures</th><td width="20%" align="right"> <a accesskey="n" href="policy_data_structures_design.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="containers.pbds.using"></a>Using</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.using.prereq"></a>Prerequisites</h3></div></div></div><p>The library contains only header files, and does not require any

1305

other libraries except the standard C++ library . All classes are

1306

defined in namespace <code class="code">__gnu_pbds</code>. The library internally

1307

uses macros beginning with <code class="code">PB_DS</code>, but

1308

@@ -61,7 +61,7 @@

1309

In addition, there are the following diagnostics classes,

1310

used to report errors specific to this library's data

1311

structures.

1312

- </p><div class="figure"><a id="idp17806128"></a><p class="title"><strong>Figure 22.7. Exception Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_exception_hierarchy.png" align="middle" alt="Exception Hierarchy" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.using.tutorial"></a>Tutorial</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="pbds.using.tutorial.basic"></a>Basic Use</h4></div></div></div><p>

1313

+ </p><div class="figure"><a id="idm269997724688"></a><p class="title"><strong>Figure 22.7. Exception Hierarchy</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/pbds_exception_hierarchy.png" align="middle" alt="Exception Hierarchy" /></div></div></div><br class="figure-break" /></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="pbds.using.tutorial"></a>Tutorial</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="pbds.using.tutorial.basic"></a>Basic Use</h4></div></div></div><p>

1314

For the most part, the policy-based containers containers in

1315

namespace <code class="literal">__gnu_pbds</code> have the same interface as

1316

the equivalent containers in the standard C++ library, except for

1317

Index: libstdc++-v3/doc/html/manual/bugs.html

1318

===================================================================

1319

--- a/src/libstdc++-v3/doc/html/manual/bugs.html (.../tags/gcc_4_8_2_release)

1320

+++ b/src/libstdc++-v3/doc/html/manual/bugs.html (.../branches/gcc-4_8-branch)

1321

@@ -1,5 +1,5 @@

1322

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1323

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Bugs</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="status.html" title="Chapter 1. Status" /><link rel="prev" href="license.html" title="License" /><link rel="next" href="setup.html" title="Chapter 2. Setup" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Bugs</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="license.html">Prev</a> </td><th width="60%" align="center">Chapter 1. Status</th><td width="20%" align="right"> <a accesskey="n" href="setup.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.status.bugs"></a>Bugs</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.status.bugs.impl"></a>Implementation Bugs</h3></div></div></div><p>

1324

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Bugs</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="status.html" title="Chapter 1. Status" /><link rel="prev" href="license.html" title="License" /><link rel="next" href="setup.html" title="Chapter 2. Setup" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Bugs</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="license.html">Prev</a> </td><th width="60%" align="center">Chapter 1. Status</th><td width="20%" align="right"> <a accesskey="n" href="setup.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.status.bugs"></a>Bugs</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.status.bugs.impl"></a>Implementation Bugs</h3></div></div></div><p>

1325

Information on known bugs, details on efforts to fix them, and

1326

fixed bugs are all available as part of the <a class="link" href="http://gcc.gnu.org/bugs/" target="_top">GCC bug tracking system</a>,

1327

with the category set to <code class="literal">libstdc++</code>.

1328

Index: libstdc++-v3/doc/html/manual/parallel_mode_using.html

1329

===================================================================

1330

--- a/src/libstdc++-v3/doc/html/manual/parallel_mode_using.html (.../tags/gcc_4_8_2_release)

1331

+++ b/src/libstdc++-v3/doc/html/manual/parallel_mode_using.html (.../branches/gcc-4_8-branch)

1332

@@ -1,5 +1,5 @@

1333

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1334

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode_semantics.html" title="Semantics" /><link rel="next" href="parallel_mode_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_semantics.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_design.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.using"></a>Using</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="parallel_mode.using.prereq_flags"></a>Prerequisite Compiler Flags</h3></div></div></div><p>

1335

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode_semantics.html" title="Semantics" /><link rel="next" href="parallel_mode_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode_semantics.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_design.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.using"></a>Using</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="parallel_mode.using.prereq_flags"></a>Prerequisite Compiler Flags</h3></div></div></div><p>

1336

Any use of parallel functionality requires additional compiler

1337

and runtime support, in particular support for OpenMP. Adding this support is

1338

not difficult: just compile your application with the compiler

1339

@@ -62,4 +62,4 @@

1340

flags for atomic operations.)

1341

</p><p> The following table provides the names and headers of all the

1342

parallel algorithms that can be used in a similar manner:

1343

-</p><div class="table"><a id="idp16725920"></a><p class="title"><strong>Table 18.1. Parallel Algorithms</strong></p><div class="table-contents"><table summary="Parallel Algorithms" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Algorithm</th><th align="left">Header</th><th align="left">Parallel algorithm</th><th align="left">Parallel header</th></tr></thead><tbody><tr><td align="left"><code class="function">std::accumulate</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::accumulate</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_difference</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_difference</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::inner_product</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::inner_product</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::partial_sum</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::partial_sum</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::equal</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::equal</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_first_of</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_first_of</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::for_each</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::for_each</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::lexicographical_compare</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::lexicographical_compare</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::mismatch</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::mismatch</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::transform</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::transform</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::max_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::max_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::merge</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::merge</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::min_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::min_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::nth_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::nth_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partial_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partial_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partition</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partition</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::random_shuffle</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::random_shuffle</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_union</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_union</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_intersection</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_intersection</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_symmetric_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_symmetric_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::stable_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::stable_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::unique_copy</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::unique_copy</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="parallel_mode_semantics.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="parallel_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="parallel_mode_design.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>

1344

\ No newline at end of file

1345

+</p><div class="table"><a id="idm269998805216"></a><p class="title"><strong>Table 18.1. Parallel Algorithms</strong></p><div class="table-contents"><table summary="Parallel Algorithms" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Algorithm</th><th align="left">Header</th><th align="left">Parallel algorithm</th><th align="left">Parallel header</th></tr></thead><tbody><tr><td align="left"><code class="function">std::accumulate</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::accumulate</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_difference</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_difference</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::inner_product</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::inner_product</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::partial_sum</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="function">__gnu_parallel::partial_sum</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr><tr><td align="left"><code class="function">std::adjacent_find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::adjacent_find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::count_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::count_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::equal</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::equal</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::find_first_of</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::find_first_of</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::for_each</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::for_each</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::generate_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::generate_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::lexicographical_compare</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::lexicographical_compare</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::mismatch</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::mismatch</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::search_n</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::search_n</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::transform</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::transform</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::replace_if</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::replace_if</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::max_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::max_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::merge</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::merge</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::min_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::min_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::nth_element</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::nth_element</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partial_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partial_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::partition</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::partition</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::random_shuffle</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::random_shuffle</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_union</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_union</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_intersection</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_intersection</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_symmetric_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_symmetric_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::set_difference</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::set_difference</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::stable_sort</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::stable_sort</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr><tr><td align="left"><code class="function">std::unique_copy</code></td><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="function">__gnu_parallel::unique_copy</code></td><td align="left"><code class="filename">parallel/algorithm</code></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="parallel_mode_semantics.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="parallel_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="parallel_mode_design.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>

1346

\ No newline at end of file

1347

Index: libstdc++-v3/doc/html/manual/ext_numerics.html

1348

===================================================================

1349

--- a/src/libstdc++-v3/doc/html/manual/ext_numerics.html (.../tags/gcc_4_8_2_release)

1350

+++ b/src/libstdc++-v3/doc/html/manual/ext_numerics.html (.../branches/gcc-4_8-branch)

1351

@@ -1,5 +1,5 @@

1352

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1353

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 26. Numerics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_algorithms.html" title="Chapter 25. Algorithms" /><link rel="next" href="ext_iterators.html" title="Chapter 27. Iterators" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 26. Numerics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_algorithms.html">Prev</a> </td><th width="60%" align="center">Part III.

1354

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 26. Numerics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_algorithms.html" title="Chapter 25. Algorithms" /><link rel="next" href="ext_iterators.html" title="Chapter 27. Iterators" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 26. Numerics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_algorithms.html">Prev</a> </td><th width="60%" align="center">Part III.

1355

Extensions

1356

1357

</th><td width="20%" align="right"> <a accesskey="n" href="ext_iterators.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.numerics"></a>Chapter 26. Numerics</h2></div></div></div><p>26.4, the generalized numeric operations such as <code class="code">accumulate</code>,

1358

Index: libstdc++-v3/doc/html/manual/parallel_mode_semantics.html

1359

===================================================================

1360

--- a/src/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html (.../tags/gcc_4_8_2_release)

1361

+++ b/src/libstdc++-v3/doc/html/manual/parallel_mode_semantics.html (.../branches/gcc-4_8-branch)

1362

@@ -1,5 +1,5 @@

1363

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1364

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Semantics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="next" href="parallel_mode_using.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Semantics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_using.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.semantics"></a>Semantics</h2></div></div></div><p> The parallel mode STL algorithms are currently not exception-safe,

1365

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Semantics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="prev" href="parallel_mode.html" title="Chapter 18. Parallel Mode" /><link rel="next" href="parallel_mode_using.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Semantics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="parallel_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 18. Parallel Mode</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_using.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.semantics"></a>Semantics</h2></div></div></div><p> The parallel mode STL algorithms are currently not exception-safe,

1366

i.e. user-defined functors must not throw exceptions.

1367

Also, the order of execution is not guaranteed for some functions, of course.

1368

Therefore, user-defined functors should not have any concurrent side effects.

1369

Index: libstdc++-v3/doc/html/manual/std_contents.html

1370

===================================================================

1371

--- a/src/libstdc++-v3/doc/html/manual/std_contents.html (.../tags/gcc_4_8_2_release)

1372

+++ b/src/libstdc++-v3/doc/html/manual/std_contents.html (.../branches/gcc-4_8-branch)

1373

@@ -1,9 +1,9 @@

1374

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1375

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part II. Standard Contents</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="debug.html" title="Debugging Support" /><link rel="next" href="support.html" title="Chapter 4. Support" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part II.

1376

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part II. Standard Contents</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="debug.html" title="Debugging Support" /><link rel="next" href="support.html" title="Chapter 4. Support" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part II.

1377

Standard Contents

1378

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library Manual</th><td width="20%" align="right"> <a accesskey="n" href="support.html">Next</a></td></tr></table><hr /></div><div class="part"><div class="titlepage"><div><div><h1 class="title"><a id="manual.std"></a>Part II.

1379

Standard Contents

1380

- </h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="chapter"><a href="support.html">4.

1381

+ </h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="chapter"><a href="support.html">4.

1382

Support

1383

1384

</a></span></dt><dd><dl><dt><span class="section"><a href="support.html#std.support.types">Types</a></span></dt><dd><dl><dt><span class="section"><a href="support.html#std.support.types.fundamental">Fundamental Types</a></span></dt><dt><span class="section"><a href="support.html#std.support.types.numeric_limits">Numeric Properties</a></span></dt><dt><span class="section"><a href="support.html#std.support.types.null">NULL</a></span></dt></dl></dd><dt><span class="section"><a href="dynamic_memory.html">Dynamic Memory</a></span></dt><dt><span class="section"><a href="termination.html">Termination</a></span></dt><dd><dl><dt><span class="section"><a href="termination.html#support.termination.handlers">Termination Handlers</a></span></dt><dt><span class="section"><a href="termination.html#support.termination.verbose">Verbose Terminate Handler</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="diagnostics.html">5.

1385

@@ -12,13 +12,13 @@

1386

</a></span></dt><dd><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.api">API Reference</a></span></dt><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.data">Adding Data to <code class="classname">exception</code></a></span></dt></dl></dd><dt><span class="section"><a href="concept_checking.html">Concept Checking</a></span></dt></dl></dd><dt><span class="chapter"><a href="utilities.html">6.

1387

Utilities

1388

1389

-</a></span></dt><dd><dl><dt><span class="section"><a href="utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp13920976">Interface Design</a></span></dt><dt><span class="section"><a href="memory.html#idp13924528">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="memory.html#idp13937824">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp15512272">Class Hierarchy</a></span></dt><dt><span class="section"><a href="memory.html#idp15534784">Thread Safety</a></span></dt><dt><span class="section"><a href="memory.html#idp15542080">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="memory.html#idp15556704">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp15573056">Examples</a></span></dt><dt><span class="section"><a href="memory.html#idp15576640">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="traits.html">Traits</a></span></dt></dl></dd><dt><span class="chapter"><a href="strings.html">7.

1390

+</a></span></dt><dd><dl><dt><span class="section"><a href="utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm270001611968">Interface Design</a></span></dt><dt><span class="section"><a href="memory.html#idm270001608416">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="memory.html#idm270001595120">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm270000019344">Class Hierarchy</a></span></dt><dt><span class="section"><a href="memory.html#idm269999996832">Thread Safety</a></span></dt><dt><span class="section"><a href="memory.html#idm269999989536">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="memory.html#idm269999974912">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm269999958496">Examples</a></span></dt><dt><span class="section"><a href="memory.html#idm269999954912">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="traits.html">Traits</a></span></dt></dl></dd><dt><span class="chapter"><a href="strings.html">7.

1391

Strings

1392

1393

</a></span></dt><dd><dl><dt><span class="section"><a href="strings.html#std.strings.string">String Classes</a></span></dt><dd><dl><dt><span class="section"><a href="strings.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.case">Case Sensitivity</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.character_types">Arbitrary Character Types</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.token">Tokenizing</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.shrink">Shrink to Fit</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.Cstring">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="localization.html">8.

1394

Localization

1395

1396

-</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#idp15778336">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="chapter"><a href="containers.html">9.

1397

+</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#idm269999753024">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="chapter"><a href="containers.html">9.

1398

Containers

1399

1400

</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#std.containers.sequences">Sequences</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="section"><a href="containers.html#containers.sequences.vector">vector</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="associative.html">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="section"><a href="associative.html#containers.associative.bitset">bitset</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="section"><a href="associative.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="unordered_associative.html">Unordered Associative</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.hash">Hash Code</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.cache">Hash Code Caching Policy</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="containers_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="containers_and_c.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="iterators.html">10.

1401

Index: libstdc++-v3/doc/html/manual/appendix.html

1402

===================================================================

1403

--- a/src/libstdc++-v3/doc/html/manual/appendix.html (.../tags/gcc_4_8_2_release)

1404

+++ b/src/libstdc++-v3/doc/html/manual/appendix.html (.../branches/gcc-4_8-branch)

1405

@@ -1,9 +1,9 @@

1406

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1407

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part IV. Appendices</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="ext_concurrency_use.html" title="Use" /><link rel="next" href="appendix_contributing.html" title="Appendix A. Contributing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part IV.

1408

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part IV. Appendices</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="ext_concurrency_use.html" title="Use" /><link rel="next" href="appendix_contributing.html" title="Appendix A. Contributing" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part IV.

1409

Appendices

1410

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_concurrency_use.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library Manual</th><td width="20%" align="right"> <a accesskey="n" href="appendix_contributing.html">Next</a></td></tr></table><hr /></div><div class="part"><div class="titlepage"><div><div><h1 class="title"><a id="appendix"></a>Part IV.

1411

Appendices

1412

-</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="appendix"><a href="appendix_contributing.html">A.

1413

+</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="appendix"><a href="appendix_contributing.html">A.

1414

Contributing

1415

1416

</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_contributing.html#contrib.list">Contributor Checklist</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_contributing.html#list.reading">Reading</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.copyright">Assignment</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.getting">Getting Sources</a></span></dt><dt><span class="section"><a href="appendix_contributing.html#list.patches">Submitting Patches</a></span></dt></dl></dd><dt><span class="section"><a href="source_organization.html">Directory Layout and Source Conventions</a></span></dt><dt><span class="section"><a href="source_code_style.html">Coding Style</a></span></dt><dd><dl><dt><span class="section"><a href="source_code_style.html#coding_style.bad_identifiers">Bad Identifiers</a></span></dt><dt><span class="section"><a href="source_code_style.html#coding_style.example">By Example</a></span></dt></dl></dd><dt><span class="section"><a href="source_design_notes.html">Design Notes</a></span></dt></dl></dd><dt><span class="appendix"><a href="appendix_porting.html">B.

1417

Index: libstdc++-v3/doc/html/manual/memory.html

1418

===================================================================

1419

--- a/src/libstdc++-v3/doc/html/manual/memory.html (.../tags/gcc_4_8_2_release)

1420

+++ b/src/libstdc++-v3/doc/html/manual/memory.html (.../branches/gcc-4_8-branch)

1421

@@ -1,5 +1,5 @@

1422

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1423

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Memory</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="utilities.html" title="Chapter 6. Utilities" /><link rel="prev" href="pairs.html" title="Pairs" /><link rel="next" href="traits.html" title="Traits" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Memory</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="pairs.html">Prev</a> </td><th width="60%" align="center">Chapter 6.

1424

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Memory</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="utilities.html" title="Chapter 6. Utilities" /><link rel="prev" href="pairs.html" title="Pairs" /><link rel="next" href="traits.html" title="Traits" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Memory</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="pairs.html">Prev</a> </td><th width="60%" align="center">Chapter 6.

1425

Utilities

1426

1427

</th><td width="20%" align="right"> <a accesskey="n" href="traits.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.util.memory"></a>Memory</h2></div></div></div><p>

1428

@@ -92,7 +92,7 @@

1429

or loading and unloading shared objects in memory. As such, using

1430

caching allocators on systems that do not support

1431

<code class="function">abi::__cxa_atexit</code> is not recommended.

1432

- </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="allocator.impl"></a>Implementation</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp13920976"></a>Interface Design</h5></div></div></div><p>

1433

+ </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="allocator.impl"></a>Implementation</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm270001611968"></a>Interface Design</h5></div></div></div><p>

1434

The only allocator interface that

1435

is supported is the standard C++ interface. As such, all STL

1436

containers have been adjusted, and all external allocators have

1437

@@ -105,7 +105,7 @@

1438

</p><p>

1439

The base class that <code class="classname">allocator</code> is derived from

1440

may not be user-configurable.

1441

-</p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp13924528"></a>Selecting Default Allocation Policy</h5></div></div></div><p>

1442

+</p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm270001608416"></a>Selecting Default Allocation Policy</h5></div></div></div><p>

1443

It's difficult to pick an allocation strategy that will provide

1444

maximum utility, without excessively penalizing some behavior. In

1445

fact, it's difficult just deciding which typical actions to measure

1446

@@ -142,7 +142,7 @@

1447

The current default choice for

1448

<code class="classname">allocator</code> is

1449

<code class="classname">__gnu_cxx::new_allocator</code>.

1450

- </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp13937824"></a>Disabling Memory Caching</h5></div></div></div><p>

1451

+ </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm270001595120"></a>Disabling Memory Caching</h5></div></div></div><p>

1452

In use, <code class="classname">allocator</code> may allocate and

1453

deallocate using implementation-specific strategies and

1454

heuristics. Because of this, a given call to an allocator object's

1455

@@ -309,33 +309,33 @@

1456

of the used and unused memory locations. It has its own

1457

<a class="link" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator">chapter</a>

1458

in the documentation.

1459

- </p></li></ol></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="allocator.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idp13992848"></a><p><span class="citetitle"><em class="citetitle">

1460

+ </p></li></ol></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="allocator.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idm270000084224"></a><p><span class="citetitle"><em class="citetitle">

1461

ISO/IEC 14882:1998 Programming languages - C++

1462

</em>. </span>

1463

isoc++_1998

1464

- <span class="pagenums">20.4 Memory. </span></p></div><div class="biblioentry"><a id="idp13994688"></a><p><span class="title"><em>

1465

- <a class="link" href="http://www.drdobbs.com/cpp/184403759" target="_top">

1466

+ <span class="pagenums">20.4 Memory. </span></p></div><div class="biblioentry"><a id="idm270000082384"></a><p><span class="title"><em>

1467

+ <a class="link" href="http://www.drdobbs.com/the-standard-librarian-what-are-allocato/184403759" target="_top">

1468

The Standard Librarian: What Are Allocators Good For?

1469

</a>

1470

</em>. </span><span class="author"><span class="firstname">Matt</span> <span class="surname">Austern</span>. </span><span class="publisher"><span class="publishername">

1471

C/C++ Users Journal

1472

- . </span></span></p></div><div class="biblioentry"><a id="idp13998416"></a><p><span class="title"><em>

1473

+ . </span></span></p></div><div class="biblioentry"><a id="idm270000078608"></a><p><span class="title"><em>

1474

1475

The Hoard Memory Allocator

1476

</a>

1477

- </em>. </span><span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span></p></div><div class="biblioentry"><a id="idp14001184"></a><p><span class="title"><em>

1478

+ </em>. </span><span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span></p></div><div class="biblioentry"><a id="idm270000075840"></a><p><span class="title"><em>

1479

1480

Reconsidering Custom Memory Allocation

1481

</a>

1482

- </em>. </span><span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span><span class="author"><span class="firstname">Ben</span> <span class="surname">Zorn</span>. </span><span class="author"><span class="firstname">Kathryn</span> <span class="surname">McKinley</span>. </span><span class="copyright">Copyright © 2002 OOPSLA. </span></p></div><div class="biblioentry"><a id="idp14007344"></a><p><span class="title"><em>

1483

+ </em>. </span><span class="author"><span class="firstname">Emery</span> <span class="surname">Berger</span>. </span><span class="author"><span class="firstname">Ben</span> <span class="surname">Zorn</span>. </span><span class="author"><span class="firstname">Kathryn</span> <span class="surname">McKinley</span>. </span><span class="copyright">Copyright © 2002 OOPSLA. </span></p></div><div class="biblioentry"><a id="idm270000069680"></a><p><span class="title"><em>

1484

1485

Allocator Types

1486

</a>

1487

</em>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="publisher"><span class="publishername">

1488

C/C++ Users Journal

1489

- . </span></span></p></div><div class="biblioentry"><a id="idp14012080"></a><p><span class="citetitle"><em class="citetitle">The C++ Programming Language</em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 . </span><span class="pagenums">19.4 Allocators. </span><span class="publisher"><span class="publishername">

1490

+ . </span></span></p></div><div class="biblioentry"><a id="idm270000064944"></a><p><span class="citetitle"><em class="citetitle">The C++ Programming Language</em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 . </span><span class="pagenums">19.4 Allocators. </span><span class="publisher"><span class="publishername">

1491

Addison Wesley

1492

- . </span></span></p></div><div class="biblioentry"><a id="idp14016512"></a><p><span class="citetitle"><em class="citetitle">Yalloc: A Recycling C++ Allocator</em>. </span><span class="author"><span class="firstname">Felix</span> <span class="surname">Yen</span>. </span></p></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.util.memory.auto_ptr"></a>auto_ptr</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="auto_ptr.limitations"></a>Limitations</h4></div></div></div><p>Explaining all of the fun and delicious things that can

1493

+ . </span></span></p></div><div class="biblioentry"><a id="idm270000060512"></a><p><span class="citetitle"><em class="citetitle">Yalloc: A Recycling C++ Allocator</em>. </span><span class="author"><span class="firstname">Felix</span> <span class="surname">Yen</span>. </span></p></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.util.memory.auto_ptr"></a>auto_ptr</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="auto_ptr.limitations"></a>Limitations</h4></div></div></div><p>Explaining all of the fun and delicious things that can

1494

happen with misuse of the <code class="classname">auto_ptr</code> class

1495

template (called <acronym class="acronym">AP</acronym> here) would take some

1496

time. Suffice it to say that the use of <acronym class="acronym">AP</acronym>

1497

@@ -445,7 +445,7 @@

1498

Derived classes override those functions to destroy resources in a context

1499

where the correct dynamic type is known. This is an application of the

1500

technique known as type erasure.

1501

- </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="shared_ptr.impl"></a>Implementation</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15512272"></a>Class Hierarchy</h5></div></div></div><p>

1502

+ </p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="shared_ptr.impl"></a>Implementation</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm270000019344"></a>Class Hierarchy</h5></div></div></div><p>

1503

A <code class="classname">shared_ptr<T></code> contains a pointer of

1504

type <span class="type">T*</span> and an object of type

1505

<code class="classname">__shared_count</code>. The shared_count contains a

1506

@@ -492,9 +492,9 @@

1507

aliasing constructor, make_shared & allocate_shared. Additionally,

1508

the constructors taking <code class="classname">auto_ptr</code> parameters are

1509

deprecated in C++11 mode.

1510

- </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15534784"></a>Thread Safety</h5></div></div></div><p>

1511

+ </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999996832"></a>Thread Safety</h5></div></div></div><p>

1512

The

1513

-<a class="link" href="http://boost.org/libs/smart_ptr/shared_ptr.htm#ThreadSafety" target="_top">Thread

1514

+<a class="link" href="http://www.boost.org/libs/smart_ptr/shared_ptr.htm#ThreadSafety" target="_top">Thread

1515

Safety</a> section of the Boost shared_ptr documentation says "shared_ptr

1516

objects offer the same level of thread safety as built-in types."

1517

The implementation must ensure that concurrent updates to separate shared_ptr

1518

@@ -537,7 +537,7 @@

1519

shared_ptr in libstdc++ the compiler and library are fixed, which

1520

makes things much simpler: we have an atomic CAS or we don't, see Lock

1521

Policy below for details.

1522

-</p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15542080"></a>Selecting Lock Policy</h5></div></div></div><p>

1523

+</p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999989536"></a>Selecting Lock Policy</h5></div></div></div><p>

1524

</p><p>

1525

There is a single <code class="classname">_Sp_counted_base</code> class,

1526

which is a template parameterized on the enum

1527

@@ -578,7 +578,7 @@

1528

<code class="filename">ext/atomicity.h</code>, which detect if the program

1529

is multi-threaded. If only one thread of execution exists in

1530

the program then less expensive non-atomic operations are used.

1531

- </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15556704"></a>Related functions and classes</h5></div></div></div><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="code">dynamic_pointer_cast</code>, <code class="code">static_pointer_cast</code>,

1532

+ </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999974912"></a>Related functions and classes</h5></div></div></div><div class="variablelist"><dl class="variablelist"><dt><span class="term"><code class="code">dynamic_pointer_cast</code>, <code class="code">static_pointer_cast</code>,

1533

<code class="code">const_pointer_cast</code></span></dt><dd><p>

1534

As noted in N2351, these functions can be implemented non-intrusively using

1535

the alias constructor. However the aliasing constructor is only available

1536

@@ -611,13 +611,13 @@

1537

As well as the extra constructors, this implementation also needs some

1538

members of _Sp_counted_deleter to be protected where they could otherwise

1539

be private.

1540

- </p></dd></dl></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="shared_ptr.using"></a>Use</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15573056"></a>Examples</h5></div></div></div><p>

1541

+ </p></dd></dl></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="shared_ptr.using"></a>Use</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999958496"></a>Examples</h5></div></div></div><p>

1542

Examples of use can be found in the testsuite, under

1543

<code class="filename">testsuite/tr1/2_general_utilities/shared_ptr</code>,

1544

<code class="filename">testsuite/20_util/shared_ptr</code>

1545

and

1546

<code class="filename">testsuite/20_util/weak_ptr</code>.

1547

- </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15576640"></a>Unresolved Issues</h5></div></div></div><p>

1548

+ </p></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999954912"></a>Unresolved Issues</h5></div></div></div><p>

1549

The <span class="emphasis"><em><code class="classname">shared_ptr</code> atomic access</em></span>

1550

clause in the C++11 standard is not implemented in GCC.

1551

</p><p>

1552

@@ -658,25 +658,25 @@

1553

code to work with, Peter Dimov in particular for his help and

1554

invaluable advice on thread safety. Phillip Jordan and Paolo

1555

Carlini for the lock policy implementation.

1556

- </p></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="shared_ptr.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idp15587936"></a><p><span class="title"><em>

1557

+ </p></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="shared_ptr.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idm269999943680"></a><p><span class="title"><em>

1558

1559

Improving shared_ptr for C++0x, Revision 2

1560

</a>

1561

</em>. </span><span class="subtitle">

1562

N2351

1563

- . </span></p></div><div class="biblioentry"><a id="idp15590224"></a><p><span class="title"><em>

1564

+ . </span></p></div><div class="biblioentry"><a id="idm269999941392"></a><p><span class="title"><em>

1565

1566

C++ Standard Library Active Issues List

1567

</a>

1568

</em>. </span><span class="subtitle">

1569

N2456

1570

- . </span></p></div><div class="biblioentry"><a id="idp15592512"></a><p><span class="title"><em>

1571

+ . </span></p></div><div class="biblioentry"><a id="idm269999939104"></a><p><span class="title"><em>

1572

1573

Working Draft, Standard for Programming Language C++

1574

</a>

1575

</em>. </span><span class="subtitle">

1576

N2461

1577

- . </span></p></div><div class="biblioentry"><a id="idp15594816"></a><p><span class="title"><em>

1578

+ . </span></p></div><div class="biblioentry"><a id="idm269999936800"></a><p><span class="title"><em>

1579

1580

Boost C++ Libraries documentation, shared_ptr

1581

</a>

1582

Index: libstdc++-v3/doc/html/manual/api.html

1583

===================================================================

1584

--- a/src/libstdc++-v3/doc/html/manual/api.html (.../tags/gcc_4_8_2_release)

1585

+++ b/src/libstdc++-v3/doc/html/manual/api.html (.../branches/gcc-4_8-branch)

1586

@@ -1,5 +1,5 @@

1587

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1588

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>API Evolution and Deprecation History</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, api, evolution, deprecation, history" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="abi.html" title="ABI Policy and Guidelines" /><link rel="next" href="backwards.html" title="Backwards Compatibility" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">API Evolution and Deprecation History</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="abi.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1589

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>API Evolution and Deprecation History</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, api, evolution, deprecation, history" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="abi.html" title="ABI Policy and Guidelines" /><link rel="next" href="backwards.html" title="Backwards Compatibility" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">API Evolution and Deprecation History</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="abi.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1590

Porting and Maintenance

1591

1592

</th><td width="20%" align="right"> <a accesskey="n" href="backwards.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="appendix.porting.api"></a>API Evolution and Deprecation History</h2></div></div></div><p>

1593

@@ -77,11 +77,11 @@

1594

<span class="type">__alloc</span> to select an underlying allocator that

1595

satisfied memory allocation requests. The selection of this

1596

underlying allocator was not user-configurable.

1597

- </p><div class="table"><a id="idp23030528"></a><p class="title"><strong>Table B.6. Extension Allocators</strong></p><div class="table-contents"><table summary="Extension Allocators" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Allocator (3.4)</th><th align="left">Header (3.4)</th><th align="left">Allocator (3.[0-3])</th><th align="left">Header (3.[0-3])</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::new_allocator<T></code></td><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="classname">std::__new_alloc</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::malloc_allocator<T></code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="classname">std::__malloc_alloc_template<int></code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::debug_allocator<T></code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="classname">std::debug_alloc<T></code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__pool_alloc<T></code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="classname">std::__default_alloc_template<bool,int></code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__mt_alloc<T></code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><code class="classname">__gnu_cxx::bitmap_allocator<T></code></td><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr></tbody></table></div></div><br class="table-break" /><p> Releases after gcc-3.4 have continued to add to the collection

1598

+ </p><div class="table"><a id="idm269992502096"></a><p class="title"><strong>Table B.6. Extension Allocators</strong></p><div class="table-contents"><table summary="Extension Allocators" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Allocator (3.4)</th><th align="left">Header (3.4)</th><th align="left">Allocator (3.[0-3])</th><th align="left">Header (3.[0-3])</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::new_allocator<T></code></td><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="classname">std::__new_alloc</code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::malloc_allocator<T></code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="classname">std::__malloc_alloc_template<int></code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::debug_allocator<T></code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="classname">std::debug_alloc<T></code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__pool_alloc<T></code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="classname">std::__default_alloc_template<bool,int></code></td><td align="left"><code class="filename">memory</code></td></tr><tr><td align="left"><code class="classname">__gnu_cxx::__mt_alloc<T></code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr><tr><td align="left"><code class="classname">__gnu_cxx::bitmap_allocator<T></code></td><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"> </td><td align="left"> </td></tr></tbody></table></div></div><br class="table-break" /><p> Releases after gcc-3.4 have continued to add to the collection

1599

of available allocators. All of these new allocators are

1600

standard-style. The following table includes details, along with

1601

the first released version of GCC that included the extension allocator.

1602

- </p><div class="table"><a id="idp23058160"></a><p class="title"><strong>Table B.7. Extension Allocators Continued</strong></p><div class="table-contents"><table summary="Extension Allocators Continued" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /></colgroup><thead><tr><th align="left">Allocator</th><th align="left">Include</th><th align="left">Version</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::array_allocator<T></code></td><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left">4.0.0</td></tr><tr><td align="left"><code class="classname">__gnu_cxx::throw_allocator<T></code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td><td align="left">4.2.0</td></tr></tbody></table></div></div><br class="table-break" /><p>

1603

+ </p><div class="table"><a id="idm269992474464"></a><p class="title"><strong>Table B.7. Extension Allocators Continued</strong></p><div class="table-contents"><table summary="Extension Allocators Continued" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /></colgroup><thead><tr><th align="left">Allocator</th><th align="left">Include</th><th align="left">Version</th></tr></thead><tbody><tr><td align="left"><code class="classname">__gnu_cxx::array_allocator<T></code></td><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left">4.0.0</td></tr><tr><td align="left"><code class="classname">__gnu_cxx::throw_allocator<T></code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td><td align="left">4.2.0</td></tr></tbody></table></div></div><br class="table-break" /><p>

1604

Debug mode first appears.

1605

</p><p>

1606

Precompiled header support <acronym class="acronym">PCH</acronym> support.

1607

Index: libstdc++-v3/doc/html/manual/source_organization.html

1608

===================================================================

1609

--- a/src/libstdc++-v3/doc/html/manual/source_organization.html (.../tags/gcc_4_8_2_release)

1610

+++ b/src/libstdc++-v3/doc/html/manual/source_organization.html (.../branches/gcc-4_8-branch)

1611

@@ -1,5 +1,5 @@

1612

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1613

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Directory Layout and Source Conventions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="next" href="source_code_style.html" title="Coding Style" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Directory Layout and Source Conventions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_contributing.html">Prev</a> </td><th width="60%" align="center">Appendix A.

1614

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Directory Layout and Source Conventions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="next" href="source_code_style.html" title="Coding Style" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Directory Layout and Source Conventions</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_contributing.html">Prev</a> </td><th width="60%" align="center">Appendix A.

1615

Contributing

1616

1617

</th><td width="20%" align="right"> <a accesskey="n" href="source_code_style.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="contrib.organization"></a>Directory Layout and Source Conventions</h2></div></div></div><p>

1618

Index: libstdc++-v3/doc/html/manual/fstreams.html

1619

===================================================================

1620

--- a/src/libstdc++-v3/doc/html/manual/fstreams.html (.../tags/gcc_4_8_2_release)

1621

+++ b/src/libstdc++-v3/doc/html/manual/fstreams.html (.../branches/gcc-4_8-branch)

1622

@@ -1,5 +1,5 @@

1623

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1624

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>File Based Streams</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="stringstreams.html" title="Memory Based Streams" /><link rel="next" href="io_and_c.html" title="Interacting with C" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">File Based Streams</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="stringstreams.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

1625

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>File Based Streams</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="stringstreams.html" title="Memory Based Streams" /><link rel="next" href="io_and_c.html" title="Interacting with C" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">File Based Streams</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="stringstreams.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

1626

Input and Output

1627

1628

</th><td width="20%" align="right"> <a accesskey="n" href="io_and_c.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.io.filestreams"></a>File Based Streams</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.io.filestreams.copying_a_file"></a>Copying a File</h3></div></div></div><p>

1629

Index: libstdc++-v3/doc/html/manual/ext_demangling.html

1630

===================================================================

1631

--- a/src/libstdc++-v3/doc/html/manual/ext_demangling.html (.../tags/gcc_4_8_2_release)

1632

+++ b/src/libstdc++-v3/doc/html/manual/ext_demangling.html (.../branches/gcc-4_8-branch)

1633

@@ -1,5 +1,5 @@

1634

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1635

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 29. Demangling</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_io.html" title="Chapter 28. Input and Output" /><link rel="next" href="ext_concurrency.html" title="Chapter 30. Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 29. Demangling</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_io.html">Prev</a> </td><th width="60%" align="center">Part III.

1636

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 29. Demangling</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_io.html" title="Chapter 28. Input and Output" /><link rel="next" href="ext_concurrency.html" title="Chapter 30. Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 29. Demangling</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_io.html">Prev</a> </td><th width="60%" align="center">Part III.

1637

Extensions

1638

1639

</th><td width="20%" align="right"> <a accesskey="n" href="ext_concurrency.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.demangle"></a>Chapter 29. Demangling</h2></div></div></div><p>

1640

Index: libstdc++-v3/doc/html/manual/ext_preface.html

1641

===================================================================

1642

--- a/src/libstdc++-v3/doc/html/manual/ext_preface.html (.../tags/gcc_4_8_2_release)

1643

+++ b/src/libstdc++-v3/doc/html/manual/ext_preface.html (.../branches/gcc-4_8-branch)

1644

@@ -1,8 +1,8 @@

1645

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1646

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="extensions.html" title="Part III. Extensions" /><link rel="next" href="ext_compile_checks.html" title="Chapter 16. Compile Time Checks" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="extensions.html">Prev</a> </td><th width="60%" align="center">Part III.

1647

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title></title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="extensions.html" title="Part III. Extensions" /><link rel="next" href="ext_compile_checks.html" title="Chapter 16. Compile Time Checks" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center"></th></tr><tr><td width="20%" align="left"><a accesskey="p" href="extensions.html">Prev</a> </td><th width="60%" align="center">Part III.

1648

Extensions

1649

1650

-</th><td width="20%" align="right"> <a accesskey="n" href="ext_compile_checks.html">Next</a></td></tr></table><hr /></div><div class="preface"><div class="titlepage"><div><div><h1 class="title"><a id="idp16425920"></a></h1></div></div></div><p>

1651

+</th><td width="20%" align="right"> <a accesskey="n" href="ext_compile_checks.html">Next</a></td></tr></table><hr /></div><div class="preface"><div class="titlepage"><div><div><h1 class="title"><a id="idm269999105296"></a></h1></div></div></div><p>

1652

Here we will make an attempt at describing the non-Standard

1653

extensions to the library. Some of these are from older versions of

1654

standard library components, namely SGI's STL, and some of these are

1655

Index: libstdc++-v3/doc/html/manual/concept_checking.html

1656

===================================================================

1657

--- a/src/libstdc++-v3/doc/html/manual/concept_checking.html (.../tags/gcc_4_8_2_release)

1658

+++ b/src/libstdc++-v3/doc/html/manual/concept_checking.html (.../branches/gcc-4_8-branch)

1659

@@ -1,5 +1,5 @@

1660

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1661

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Concept Checking</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="diagnostics.html" title="Chapter 5. Diagnostics" /><link rel="prev" href="diagnostics.html" title="Chapter 5. Diagnostics" /><link rel="next" href="utilities.html" title="Chapter 6. Utilities" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Concept Checking</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="diagnostics.html">Prev</a> </td><th width="60%" align="center">Chapter 5.

1662

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Concept Checking</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="diagnostics.html" title="Chapter 5. Diagnostics" /><link rel="prev" href="diagnostics.html" title="Chapter 5. Diagnostics" /><link rel="next" href="utilities.html" title="Chapter 6. Utilities" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Concept Checking</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="diagnostics.html">Prev</a> </td><th width="60%" align="center">Chapter 5.

1663

Diagnostics

1664

1665

</th><td width="20%" align="right"> <a accesskey="n" href="utilities.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.diagnostics.concept_checking"></a>Concept Checking</h2></div></div></div><p>

1666

Index: libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html

1667

===================================================================

1668

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html (.../tags/gcc_4_8_2_release)

1669

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator_ex_multi.html (.../branches/gcc-4_8-branch)

1670

@@ -1,5 +1,5 @@

1671

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1672

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Multiple Thread Example</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator_ex_single.html" title="Single Thread Example" /><link rel="next" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Multiple Thread Example</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_ex_single.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="bitmap_allocator.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.example_multi"></a>Multiple Thread Example</h2></div></div></div><p>

1673

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Multiple Thread Example</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator_ex_single.html" title="Single Thread Example" /><link rel="next" href="bitmap_allocator.html" title="Chapter 21. The bitmap_allocator" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Multiple Thread Example</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_ex_single.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="bitmap_allocator.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.example_multi"></a>Multiple Thread Example</h2></div></div></div><p>

1674

In the ST example we never used the thread_id variable present in each block.

1675

Let's start by explaining the purpose of this in a MT application.

1676

</p><p>

1677

Index: libstdc++-v3/doc/html/manual/ext_compile_checks.html

1678

===================================================================

1679

--- a/src/libstdc++-v3/doc/html/manual/ext_compile_checks.html (.../tags/gcc_4_8_2_release)

1680

+++ b/src/libstdc++-v3/doc/html/manual/ext_compile_checks.html (.../branches/gcc-4_8-branch)

1681

@@ -1,5 +1,5 @@

1682

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1683

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 16. Compile Time Checks</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_preface.html" title="" /><link rel="next" href="debug_mode.html" title="Chapter 17. Debug Mode" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 16. Compile Time Checks</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_preface.html">Prev</a> </td><th width="60%" align="center">Part III.

1684

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 16. Compile Time Checks</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_preface.html" title="" /><link rel="next" href="debug_mode.html" title="Chapter 17. Debug Mode" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 16. Compile Time Checks</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_preface.html">Prev</a> </td><th width="60%" align="center">Part III.

1685

Extensions

1686

1687

</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.compile_checks"></a>Chapter 16. Compile Time Checks</h2></div></div></div><p>

1688

Index: libstdc++-v3/doc/html/manual/strings.html

1689

===================================================================

1690

--- a/src/libstdc++-v3/doc/html/manual/strings.html (.../tags/gcc_4_8_2_release)

1691

+++ b/src/libstdc++-v3/doc/html/manual/strings.html (.../branches/gcc-4_8-branch)

1692

@@ -1,13 +1,13 @@

1693

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1694

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 7. Strings</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="traits.html" title="Traits" /><link rel="next" href="localization.html" title="Chapter 8. Localization" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 7.

1695

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 7. Strings</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="traits.html" title="Traits" /><link rel="next" href="localization.html" title="Chapter 8. Localization" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 7.

1696

Strings

1697

1698

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="traits.html">Prev</a> </td><th width="60%" align="center">Part II.

1699

Standard Contents

1700

</th><td width="20%" align="right"> <a accesskey="n" href="localization.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.strings"></a>Chapter 7.

1701

Strings

1702

- <a id="idp15603440" class="indexterm"></a>

1703

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="strings.html#std.strings.string">String Classes</a></span></dt><dd><dl><dt><span class="section"><a href="strings.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.case">Case Sensitivity</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.character_types">Arbitrary Character Types</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.token">Tokenizing</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.shrink">Shrink to Fit</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.Cstring">CString (MFC)</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.strings.string"></a>String Classes</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="strings.string.simple"></a>Simple Transformations</h3></div></div></div><p>

1704

+ <a id="idm269999928112" class="indexterm"></a>

1705

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="strings.html#std.strings.string">String Classes</a></span></dt><dd><dl><dt><span class="section"><a href="strings.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.case">Case Sensitivity</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.character_types">Arbitrary Character Types</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.token">Tokenizing</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.shrink">Shrink to Fit</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.Cstring">CString (MFC)</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.strings.string"></a>String Classes</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="strings.string.simple"></a>Simple Transformations</h3></div></div></div><p>

1706

Here are Standard, simple, and portable ways to perform common

1707

transformations on a <code class="code">string</code> instance, such as

1708

"convert to all upper case." The word transformations

1709

Index: libstdc++-v3/doc/html/manual/containers_and_c.html

1710

===================================================================

1711

--- a/src/libstdc++-v3/doc/html/manual/containers_and_c.html (.../tags/gcc_4_8_2_release)

1712

+++ b/src/libstdc++-v3/doc/html/manual/containers_and_c.html (.../branches/gcc-4_8-branch)

1713

@@ -1,5 +1,5 @@

1714

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1715

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Interacting with C</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="containers.html" title="Chapter 9. Containers" /><link rel="prev" href="unordered_associative.html" title="Unordered Associative" /><link rel="next" href="iterators.html" title="Chapter 10. Iterators" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Interacting with C</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="unordered_associative.html">Prev</a> </td><th width="60%" align="center">Chapter 9.

1716

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Interacting with C</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="containers.html" title="Chapter 9. Containers" /><link rel="prev" href="unordered_associative.html" title="Unordered Associative" /><link rel="next" href="iterators.html" title="Chapter 10. Iterators" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Interacting with C</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="unordered_associative.html">Prev</a> </td><th width="60%" align="center">Chapter 9.

1717

Containers

1718

1719

</th><td width="20%" align="right"> <a accesskey="n" href="iterators.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.containers.c"></a>Interacting with C</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="containers.c.vs_array"></a>Containers vs. Arrays</h3></div></div></div><p>

1720

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

1721

===================================================================

1722

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html (.../tags/gcc_4_8_2_release)

1723

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_diagnostics.html (.../branches/gcc-4_8-branch)

1724

@@ -1,5 +1,5 @@

1725

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1726

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Diagnostics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_devel.html" title="Developer Information" /><link rel="next" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Diagnostics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_devel.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.diagnostics"></a>Diagnostics</h2></div></div></div><p>

1727

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Diagnostics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_devel.html" title="Developer Information" /><link rel="next" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Diagnostics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_devel.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.diagnostics"></a>Diagnostics</h2></div></div></div><p>

1728

The table below presents all the diagnostics we intend to implement.

1729

Each diagnostic has a corresponding compile time switch

1730

<code class="code">-D_GLIBCXX_PROFILE_<diagnostic></code>.

1731

@@ -17,7 +17,7 @@

1732

A high accuracy means that the diagnostic is unlikely to be wrong.

1733

These grades are not perfect. They are just meant to guide users with

1734

specific needs or time budgets.

1735

- </p><div class="table"><a id="idp17088912"></a><p class="title"><strong>Table 19.2. Profile Diagnostics</strong></p><div class="table-contents"><table summary="Profile Diagnostics" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /><col align="left" class="c6" /><col align="left" class="c7" /></colgroup><thead><tr><th align="left">Group</th><th align="left">Flag</th><th align="left">Benefit</th><th align="left">Cost</th><th align="left">Freq.</th><th align="left">Implemented</th><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left"><a class="link" href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.containers" title="Containers">

1736

+ </p><div class="table"><a id="idm269998442544"></a><p class="title"><strong>Table 19.2. Profile Diagnostics</strong></p><div class="table-contents"><table summary="Profile Diagnostics" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /><col align="left" class="c6" /><col align="left" class="c7" /></colgroup><thead><tr><th align="left">Group</th><th align="left">Flag</th><th align="left">Benefit</th><th align="left">Cost</th><th align="left">Freq.</th><th align="left">Implemented</th><td class="auto-generated"> </td></tr></thead><tbody><tr><td align="left"><a class="link" href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.containers" title="Containers">

1737

CONTAINERS</a></td><td align="left"><a class="link" href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_small" title="Hashtable Too Small">

1738

HASHTABLE_TOO_SMALL</a></td><td align="left">10</td><td align="left">1</td><td align="left"> </td><td align="left">10</td><td align="left">yes</td></tr><tr><td align="left"> </td><td align="left"><a class="link" href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_large" title="Hashtable Too Large">

1739

HASHTABLE_TOO_LARGE</a></td><td align="left">5</td><td align="left">1</td><td align="left"> </td><td align="left">10</td><td align="left">yes</td></tr><tr><td align="left"> </td><td align="left"><a class="link" href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.inefficient_hash" title="Inefficient Hash">

1740

@@ -374,7 +374,7 @@

1741

Quick Sort for a particular call context.

1742

</p></li><li class="listitem"><p><span class="emphasis"><em>Fundamentals:</em></span>

1743

See papers:

1744

- <a class="link" href="http://portal.acm.org/citation.cfm?doid=1065944.1065981" target="_top">

1745

+ <a class="link" href="https://dl.acm.org/citation.cfm?doid=1065944.1065981" target="_top">

1746

A framework for adaptive algorithm selection in STAPL</a> and

1747

1748

Optimizing Sorting with Machine Learning Algorithms</a>.

1749

@@ -500,7 +500,7 @@

1750

Keep a shadow for each container. Record iterator dereferences and

1751

container member accesses. Issue advice for elements referenced by

1752

multiple threads.

1753

- See paper: <a class="link" href="http://portal.acm.org/citation.cfm?id=207110.207148" target="_top">

1754

+ See paper: <a class="link" href="https://dl.acm.org/citation.cfm?id=207110.207148" target="_top">

1755

The LRPD test: speculative run-time parallelization of loops with

1756

privatization and reduction parallelization</a>.

1757

</p></li><li class="listitem"><p><span class="emphasis"><em>Cost model:</em></span>

1758

Index: libstdc++-v3/doc/html/manual/ext_concurrency_impl.html

1759

===================================================================

1760

--- a/src/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html (.../tags/gcc_4_8_2_release)

1761

+++ b/src/libstdc++-v3/doc/html/manual/ext_concurrency_impl.html (.../branches/gcc-4_8-branch)

1762

@@ -1,5 +1,5 @@

1763

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1764

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="ext_concurrency.html" title="Chapter 30. Concurrency" /><link rel="prev" href="ext_concurrency.html" title="Chapter 30. Concurrency" /><link rel="next" href="ext_concurrency_use.html" title="Use" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_concurrency.html">Prev</a> </td><th width="60%" align="center">Chapter 30. Concurrency</th><td width="20%" align="right"> <a accesskey="n" href="ext_concurrency_use.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.impl"></a>Implementation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.impl.atomic_fallbacks"></a>Using Builtin Atomic Functions</h3></div></div></div><p>The functions for atomic operations described above are either

1765

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="ext_concurrency.html" title="Chapter 30. Concurrency" /><link rel="prev" href="ext_concurrency.html" title="Chapter 30. Concurrency" /><link rel="next" href="ext_concurrency_use.html" title="Use" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_concurrency.html">Prev</a> </td><th width="60%" align="center">Chapter 30. Concurrency</th><td width="20%" align="right"> <a accesskey="n" href="ext_concurrency_use.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.concurrency.impl"></a>Implementation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.concurrency.impl.atomic_fallbacks"></a>Using Builtin Atomic Functions</h3></div></div></div><p>The functions for atomic operations described above are either

1766

implemented via compiler intrinsics (if the underlying host is

1767

capable) or by library fallbacks.</p><p>Compiler intrinsics (builtins) are always preferred. However, as

1768

the compiler builtins for atomics are not universally implemented,

1769

Index: libstdc++-v3/doc/html/manual/io_and_c.html

1770

===================================================================

1771

--- a/src/libstdc++-v3/doc/html/manual/io_and_c.html (.../tags/gcc_4_8_2_release)

1772

+++ b/src/libstdc++-v3/doc/html/manual/io_and_c.html (.../branches/gcc-4_8-branch)

1773

@@ -1,5 +1,5 @@

1774

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1775

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Interacting with C</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="fstreams.html" title="File Based Streams" /><link rel="next" href="atomics.html" title="Chapter 14. Atomics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Interacting with C</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="fstreams.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

1776

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Interacting with C</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="fstreams.html" title="File Based Streams" /><link rel="next" href="atomics.html" title="Chapter 14. Atomics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Interacting with C</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="fstreams.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

1777

Input and Output

1778

1779

</th><td width="20%" align="right"> <a accesskey="n" href="atomics.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.io.c"></a>Interacting with C</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.io.c.FILE"></a>Using FILE* and file descriptors</h3></div></div></div><p>

1780

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

1781

===================================================================

1782

--- a/src/libstdc++-v3/doc/html/manual/documentation_hacking.html (.../tags/gcc_4_8_2_release)

1783

+++ b/src/libstdc++-v3/doc/html/manual/documentation_hacking.html (.../branches/gcc-4_8-branch)

1784

@@ -1,5 +1,5 @@

1785

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1786

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Writing and Generating Documentation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, documentation, style, docbook, doxygen" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="next" href="internals.html" title="Porting to New Hardware or Operating Systems" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Writing and Generating Documentation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_porting.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1787

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Writing and Generating Documentation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, documentation, style, docbook, doxygen" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="next" href="internals.html" title="Porting to New Hardware or Operating Systems" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Writing and Generating Documentation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_porting.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1788

Porting and Maintenance

1789

1790

</th><td width="20%" align="right"> <a accesskey="n" href="internals.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="appendix.porting.doc"></a>Writing and Generating Documentation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="doc.intro"></a>Introduction</h3></div></div></div><p>

1791

@@ -112,7 +112,7 @@

1792

supported, and are always aliased to dummy rules. These

1793

unsupported formats are: <span class="emphasis"><em>info</em></span>,

1794

<span class="emphasis"><em>ps</em></span>, and <span class="emphasis"><em>dvi</em></span>.

1795

- </p></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="doc.doxygen"></a>Doxygen</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="doxygen.prereq"></a>Prerequisites</h4></div></div></div><div class="table"><a id="idp22162432"></a><p class="title"><strong>Table B.1. Doxygen Prerequisites</strong></p><div class="table-contents"><table summary="Doxygen Prerequisites" border="1"><colgroup><col align="center" class="c1" /><col align="center" class="c2" /><col align="center" class="c3" /></colgroup><thead><tr><th align="center">Tool</th><th align="center">Version</th><th align="center">Required By</th></tr></thead><tbody><tr><td align="center">coreutils</td><td align="center">8.5</td><td align="center">all</td></tr><tr><td align="center">bash</td><td align="center">4.1</td><td align="center">all</td></tr><tr><td align="center">doxygen</td><td align="center">1.7.6.1</td><td align="center">all</td></tr><tr><td align="center">graphviz</td><td align="center">2.26</td><td align="center">graphical hierarchies</td></tr><tr><td align="center">pdflatex</td><td align="center">2007-59</td><td align="center">pdf output</td></tr></tbody></table></div></div><br class="table-break" /><p>

1796

+ </p></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="doc.doxygen"></a>Doxygen</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="doxygen.prereq"></a>Prerequisites</h4></div></div></div><div class="table"><a id="idm269993370272"></a><p class="title"><strong>Table B.1. Doxygen Prerequisites</strong></p><div class="table-contents"><table summary="Doxygen Prerequisites" border="1"><colgroup><col align="center" class="c1" /><col align="center" class="c2" /><col align="center" class="c3" /></colgroup><thead><tr><th align="center">Tool</th><th align="center">Version</th><th align="center">Required By</th></tr></thead><tbody><tr><td align="center">coreutils</td><td align="center">8.5</td><td align="center">all</td></tr><tr><td align="center">bash</td><td align="center">4.1</td><td align="center">all</td></tr><tr><td align="center">doxygen</td><td align="center">1.7.6.1</td><td align="center">all</td></tr><tr><td align="center">graphviz</td><td align="center">2.26</td><td align="center">graphical hierarchies</td></tr><tr><td align="center">pdflatex</td><td align="center">2007-59</td><td align="center">pdf output</td></tr></tbody></table></div></div><br class="table-break" /><p>

1797

Prerequisite tools are Bash 2.0 or later,

1798

<a class="link" href="http://www.doxygen.org/" target="_top">Doxygen</a>, and

1799

the <a class="link" href="http://www.gnu.org/software/coreutils/" target="_top">GNU

1800

@@ -232,9 +232,8 @@

1801

member functions.

1802

</p><p>

1803

Some commentary to accompany

1804

- the first list in the <a class="link" href="http://www.stack.nl/~dimitri/doxygen/docblocks.html" target="_top">Special

1805

- Documentation Blocks</a> section of

1806

- the Doxygen manual:

1807

+ the first list in the <a class="link" href="http://www.stack.nl/~dimitri/doxygen/manual/docblocks.html" target="_top">Special

1808

+ Documentation Blocks</a> section of the Doxygen manual:

1809

</p><div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem"><p>For longer comments, use the Javadoc style...</p></li><li class="listitem"><p>

1810

...not the Qt style. The intermediate *'s are preferred.

1811

</p></li><li class="listitem"><p>

1812

@@ -310,7 +309,7 @@

1813

writing Doxygen comments. Single and double quotes, and

1814

separators in filenames are two common trouble spots. When in

1815

doubt, consult the following table.

1816

- </p><div class="table"><a id="idp22238096"></a><p class="title"><strong>Table B.2. HTML to Doxygen Markup Comparison</strong></p><div class="table-contents"><table summary="HTML to Doxygen 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">Doxygen</th></tr></thead><tbody><tr><td align="left">\</td><td align="left">\\</td></tr><tr><td align="left">"</td><td align="left">\"</td></tr><tr><td align="left">'</td><td align="left">\'</td></tr><tr><td align="left"><i></td><td align="left">@a word</td></tr><tr><td align="left"><b></td><td align="left">@b word</td></tr><tr><td align="left"><code></td><td align="left">@c word</td></tr><tr><td align="left"><em></td><td align="left">@a word</td></tr><tr><td align="left"><em></td><td align="left"><em>two words or more</em></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="doc.docbook"></a>Docbook</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="docbook.prereq"></a>Prerequisites</h4></div></div></div><div class="table"><a id="idp22257536"></a><p class="title"><strong>Table B.3. Docbook Prerequisites</strong></p><div class="table-contents"><table summary="Docbook Prerequisites" border="1"><colgroup><col align="center" class="c1" /><col align="center" class="c2" /><col align="center" class="c3" /></colgroup><thead><tr><th align="center">Tool</th><th align="center">Version</th><th align="center">Required By</th></tr></thead><tbody><tr><td align="center">docbook5-style-xsl</td><td align="center">1.76.1</td><td align="center">all</td></tr><tr><td align="center">xsltproc</td><td align="center">1.1.26</td><td align="center">all</td></tr><tr><td align="center">xmllint</td><td align="center">2.7.7</td><td align="center">validation</td></tr><tr><td align="center">dblatex</td><td align="center">0.3</td><td align="center">pdf output</td></tr><tr><td align="center">pdflatex</td><td align="center">2007-59</td><td align="center">pdf output</td></tr><tr><td align="center">docbook2X</td><td align="center">0.8.8</td><td align="center">info output</td></tr><tr><td align="center">epub3 stylesheets</td><td align="center">b3</td><td align="center">epub output</td></tr></tbody></table></div></div><br class="table-break" /><p>

1817

+ </p><div class="table"><a id="idm269993294592"></a><p class="title"><strong>Table B.2. HTML to Doxygen Markup Comparison</strong></p><div class="table-contents"><table summary="HTML to Doxygen 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">Doxygen</th></tr></thead><tbody><tr><td align="left">\</td><td align="left">\\</td></tr><tr><td align="left">"</td><td align="left">\"</td></tr><tr><td align="left">'</td><td align="left">\'</td></tr><tr><td align="left"><i></td><td align="left">@a word</td></tr><tr><td align="left"><b></td><td align="left">@b word</td></tr><tr><td align="left"><code></td><td align="left">@c word</td></tr><tr><td align="left"><em></td><td align="left">@a word</td></tr><tr><td align="left"><em></td><td align="left"><em>two words or more</em></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="doc.docbook"></a>Docbook</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="docbook.prereq"></a>Prerequisites</h4></div></div></div><div class="table"><a id="idm269993275152"></a><p class="title"><strong>Table B.3. Docbook Prerequisites</strong></p><div class="table-contents"><table summary="Docbook Prerequisites" border="1"><colgroup><col align="center" class="c1" /><col align="center" class="c2" /><col align="center" class="c3" /></colgroup><thead><tr><th align="center">Tool</th><th align="center">Version</th><th align="center">Required By</th></tr></thead><tbody><tr><td align="center">docbook5-style-xsl</td><td align="center">1.76.1</td><td align="center">all</td></tr><tr><td align="center">xsltproc</td><td align="center">1.1.26</td><td align="center">all</td></tr><tr><td align="center">xmllint</td><td align="center">2.7.7</td><td align="center">validation</td></tr><tr><td align="center">dblatex</td><td align="center">0.3</td><td align="center">pdf output</td></tr><tr><td align="center">pdflatex</td><td align="center">2007-59</td><td align="center">pdf output</td></tr><tr><td align="center">docbook2X</td><td align="center">0.8.8</td><td align="center">info output</td></tr><tr><td align="center">epub3 stylesheets</td><td align="center">b3</td><td align="center">epub output</td></tr></tbody></table></div></div><br class="table-break" /><p>

1818

Editing the DocBook sources requires an XML editor. Many

1819

exist: some notable options

1820

include <span class="command"><strong>emacs</strong></span>, <span class="application">Kate</span>,

1821

@@ -520,11 +519,11 @@

1822

<a class="link" href="http://www.docbook.org/tdg/en/html/part2.html" target="_top">online</a>.

1823

An incomplete reference for HTML to Docbook conversion is

1824

detailed in the table below.

1825

- </p><div class="table"><a id="idp22335040"></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"><p></td><td align="left"><para></td></tr><tr><td align="left"><pre></td><td align="left"><computeroutput>, <programlisting>,

1826

+ </p><div class="table"><a id="idm269993197520"></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"><p></td><td align="left"><para></td></tr><tr><td align="left"><pre></td><td align="left"><computeroutput>, <programlisting>,

1827

1828

And examples of detailed markup for which there are no real HTML

1829

equivalents are listed in the table below.

1830

-</p><div class="table"><a id="idp22359184"></a><p class="title"><strong>Table B.5. Docbook XML Element Use</strong></p><div class="table-contents"><table summary="Docbook XML Element Use" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">Element</th><th align="left">Use</th></tr></thead><tbody><tr><td align="left"><structname></td><td align="left"><structname>char_traits</structname></td></tr><tr><td align="left"><classname></td><td align="left"><classname>string</classname></td></tr><tr><td align="left"><function></td><td align="left">

1831

+</p><div class="table"><a id="idm269993173376"></a><p class="title"><strong>Table B.5. Docbook XML Element Use</strong></p><div class="table-contents"><table summary="Docbook XML Element Use" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">Element</th><th align="left">Use</th></tr></thead><tbody><tr><td align="left"><structname></td><td align="left"><structname>char_traits</structname></td></tr><tr><td align="left"><classname></td><td align="left"><classname>string</classname></td></tr><tr><td align="left"><function></td><td align="left">

1832

<p><function>clear()</function></p>

1833

<p><function>fs.clear()</function></p>

1834

</td></tr><tr><td align="left"><type></td><td align="left"><type>long long</type></td></tr><tr><td align="left"><varname></td><td align="left"><varname>fs</varname></td></tr><tr><td align="left"><literal></td><td align="left">

1835

Index: libstdc++-v3/doc/html/manual/extensions.html

1836

===================================================================

1837

--- a/src/libstdc++-v3/doc/html/manual/extensions.html (.../tags/gcc_4_8_2_release)

1838

+++ b/src/libstdc++-v3/doc/html/manual/extensions.html (.../branches/gcc-4_8-branch)

1839

@@ -1,11 +1,11 @@

1840

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1841

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part III. Extensions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="io_and_c.html" title="Interacting with C" /><link rel="next" href="ext_preface.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part III.

1842

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Part III. Extensions</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="index.html" title="The GNU C++ Library Manual" /><link rel="prev" href="io_and_c.html" title="Interacting with C" /><link rel="next" href="ext_preface.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Part III.

1843

Extensions

1844

1845

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="io_and_c.html">Prev</a> </td><th width="60%" align="center">The GNU C++ Library Manual</th><td width="20%" align="right"> <a accesskey="n" href="ext_preface.html">Next</a></td></tr></table><hr /></div><div class="part"><div class="titlepage"><div><div><h1 class="title"><a id="manual.ext"></a>Part III.

1846

Extensions

1847

- <a id="idp16423680" class="indexterm"></a>

1848

-</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="preface"><a href="ext_preface.html"></a></span></dt><dt><span class="chapter"><a href="ext_compile_checks.html">16. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="debug_mode.html">17. Debug Mode</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="debug_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="debug_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.goals">Goals</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods">Methods</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.wrappers">The Wrapper Model</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_iter">Safe Iterators</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_seq">Safe Sequences (Containers)</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.precond">Precondition Checking</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.coexistence">Release- and debug-mode coexistence</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.compile">Compile-time coexistence of release- and debug-mode components</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.link">Link- and run-time coexistence of release- and

1849

+ <a id="idm269999107536" class="indexterm"></a>

1850

+</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="preface"><a href="ext_preface.html"></a></span></dt><dt><span class="chapter"><a href="ext_compile_checks.html">16. Compile Time Checks</a></span></dt><dt><span class="chapter"><a href="debug_mode.html">17. Debug Mode</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="debug_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="debug_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.goals">Goals</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods">Methods</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.wrappers">The Wrapper Model</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_iter">Safe Iterators</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_seq">Safe Sequences (Containers)</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.precond">Precondition Checking</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.coexistence">Release- and debug-mode coexistence</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.compile">Compile-time coexistence of release- and debug-mode components</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.link">Link- and run-time coexistence of release- and

1851

debug-mode components</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.alt">Alternatives for Coexistence</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="parallel_mode.html">18. Parallel Mode</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="parallel_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.prereq_flags">Prerequisite Compiler Flags</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.specific">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.omp">Setting up the OpenMP Environment</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.compile">Compile Time Switches</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.settings">Run Time Settings and Defaults</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_test.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="profile_mode.html">19. Profile Mode</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.intro">Intro</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.using">Using the Profile Mode</a></span></dt><dt><span class="section"><a href="profile_mode.html#manual.ext.profile_mode.tuning">Tuning the Profile Mode</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.wrapper">Wrapper Model</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.instrumentation">Instrumentation</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.rtlib">Run Time Behavior</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.analysis">Analysis and Diagnostics</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.cost-model">Cost Model</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.reports">Reports</a></span></dt><dt><span class="section"><a href="profile_mode_design.html#manual.ext.profile_mode.design.testing">Testing</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_api.html">Extensions for Custom Containers</a></span></dt><dt><span class="section"><a href="profile_mode_cost_model.html">Empirical Cost Model</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html">Implementation Issues</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.stack">Stack Traces</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.symbols">Symbolization of Instruction Addresses</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.concurrency">Concurrency</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.stdlib-in-proflib">Using the Standard Library in the Instrumentation Implementation</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.malloc-hooks">Malloc Hooks</a></span></dt><dt><span class="section"><a href="profile_mode_impl.html#manual.ext.profile_mode.implementation.construction-destruction">Construction and Destruction of Global Objects</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_devel.html">Developer Information</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_devel.html#manual.ext.profile_mode.developer.bigpic">Big Picture</a></span></dt><dt><span class="section"><a href="profile_mode_devel.html#manual.ext.profile_mode.developer.howto">How To Add A Diagnostic</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html">Diagnostics</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.template">Diagnostic Template</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.containers">Containers</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_small">Hashtable Too Small</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_too_large">Hashtable Too Large</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.inefficient_hash">Inefficient Hash</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_too_small">Vector Too Small</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_too_large">Vector Too Large</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_to_hashtable">Vector to Hashtable</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.hashtable_to_vector">Hashtable to Vector</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.vector_to_list">Vector to List</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.list_to_vector">List to Vector</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.list_to_slist">List to Forward List (Slist)</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.assoc_ord_to_unord">Ordered to Unordered Associative Container</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.algorithms">Algorithms</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.algorithms.sort">Sort Algorithm Performance</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality">Data Locality</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality.sw_prefetch">Need Software Prefetch</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.locality.linked">Linked Structure Locality</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread">Multithreaded Data Access</a></span></dt><dd><dl><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread.ddtest">Data Dependence Violations at Container Level</a></span></dt><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.mthread.false_share">False Sharing</a></span></dt></dl></dd><dt><span class="section"><a href="profile_mode_diagnostics.html#manual.ext.profile_mode.analysis.statistics">Statistics</a></span></dt></dl></dd><dt><span class="bibliography"><a href="profile_mode.html#profile_mode.biblio">Bibliography</a></span></dt></dl></dd><dt><span class="chapter"><a href="mt_allocator.html">20. The mt_allocator</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator.html#allocator.mt.intro">Intro</a></span></dt><dt><span class="section"><a href="mt_allocator_design.html">Design Issues</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator_design.html#allocator.mt.overview">Overview</a></span></dt></dl></dd><dt><span class="section"><a href="mt_allocator_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.tune">Tunable Parameters</a></span></dt><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.init">Initialization</a></span></dt><dt><span class="section"><a href="mt_allocator_impl.html#allocator.mt.deallocation">Deallocation Notes</a></span></dt></dl></dd><dt><span class="section"><a href="mt_allocator_ex_single.html">Single Thread Example</a></span></dt><dt><span class="section"><a href="mt_allocator_ex_multi.html">Multiple Thread Example</a></span></dt></dl></dd><dt><span class="chapter"><a href="bitmap_allocator.html">21. The bitmap_allocator</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator.html#allocator.bitmap.design">Design</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.free_list_store">Free List Store</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.super_block">Super Block</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.super_block_data">Super Block Data Layout</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.max_wasted">Maximum Wasted Percentage</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.allocate"><code class="function">allocate</code></a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.deallocate"><code class="function">deallocate</code></a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.questions">Questions</a></span></dt><dd><dl><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.1">1</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.2">2</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.question.3">3</a></span></dt></dl></dd><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.locality">Locality</a></span></dt><dt><span class="section"><a href="bitmap_allocator_impl.html#bitmap.impl.grow_policy">Overhead and Grow Policy</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="policy_data_structures.html">22. Policy-Based Data Structures</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro">Intro</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues">Performance Issues</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues.associative">Associative</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.issues.priority_queue">Priority Que</a></span></dt></dl></dd><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation">Goals</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation.associative">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.policy">Policy Choices</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.underlying">Underlying Data Structures</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.iterators">Iterators</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.associative.functions">Functional</a></span></dt></dl></dd><dt><span class="section"><a href="policy_data_structures.html#pbds.intro.motivation.priority_queue">Priority Queues</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.policy">Policy Choices</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.underlying">Underlying Data Structures</a></span></dt><dt><span class="section"><a href="policy_data_structures.html#motivation.priority_queue.binary_heap">Binary Heaps</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="section"><a href="policy_data_structures_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.organization">Organization</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial">Tutorial</a></span></dt><dd><dl><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.basic">Basic Use</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.configuring">

1852

Configuring via Template Parameters

1853

</a></span></dt><dt><span class="section"><a href="policy_data_structures_using.html#pbds.using.tutorial.traits">

1854

Index: libstdc++-v3/doc/html/manual/debug_mode_using.html

1855

===================================================================

1856

--- a/src/libstdc++-v3/doc/html/manual/debug_mode_using.html (.../tags/gcc_4_8_2_release)

1857

+++ b/src/libstdc++-v3/doc/html/manual/debug_mode_using.html (.../branches/gcc-4_8-branch)

1858

@@ -1,5 +1,5 @@

1859

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1860

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="prev" href="debug_mode_semantics.html" title="Semantics" /><link rel="next" href="debug_mode_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode_semantics.html">Prev</a> </td><th width="60%" align="center">Chapter 17. Debug Mode</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode_design.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.using"></a>Using</h2></div></div></div><p>

1861

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Using</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="prev" href="debug_mode_semantics.html" title="Semantics" /><link rel="next" href="debug_mode_design.html" title="Design" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Using</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode_semantics.html">Prev</a> </td><th width="60%" align="center">Chapter 17. Debug Mode</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode_design.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.using"></a>Using</h2></div></div></div><p>

1862

</p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="debug_mode.using.mode"></a>Using the Debug Mode</h3></div></div></div><p>To use the libstdc++ debug mode, compile your application with the

1863

compiler flag <code class="code">-D_GLIBCXX_DEBUG</code>. Note that this flag

1864

changes the sizes and behavior of standard class templates such

1865

@@ -18,6 +18,6 @@

1866

mode or with debug mode. The

1867

following table provides the names and headers of the debugging

1868

containers:

1869

-</p><div class="table"><a id="idp16490400"></a><p class="title"><strong>Table 17.1. Debugging Containers</strong></p><div class="table-contents"><table summary="Debugging Containers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th></tr></thead><tbody><tr><td align="left"><code class="classname">std::bitset</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="classname">__gnu_debug::bitset</code></td><td align="left"><code class="filename"><debug/bitset></code></td></tr><tr><td align="left"><code class="classname">std::deque</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="classname">__gnu_debug::deque</code></td><td align="left"><code class="filename"><debug/deque></code></td></tr><tr><td align="left"><code class="classname">std::list</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="classname">__gnu_debug::list</code></td><td align="left"><code class="filename"><debug/list></code></td></tr><tr><td align="left"><code class="classname">std::map</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::map</code></td><td align="left"><code class="filename"><debug/map></code></td></tr><tr><td align="left"><code class="classname">std::multimap</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::multimap</code></td><td align="left"><code class="filename"><debug/map></code></td></tr><tr><td align="left"><code class="classname">std::multiset</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::multiset</code></td><td align="left"><code class="filename"><debug/set></code></td></tr><tr><td align="left"><code class="classname">std::set</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::set</code></td><td align="left"><code class="filename"><debug/set></code></td></tr><tr><td align="left"><code class="classname">std::string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::string</code></td><td align="left"><code class="filename"><debug/string></code></td></tr><tr><td align="left"><code class="classname">std::wstring</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::wstring</code></td><td align="left"><code class="filename"><debug/string></code></td></tr><tr><td align="left"><code class="classname">std::basic_string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::basic_string</code></td><td align="left"><code class="filename"><debug/string></code></td></tr><tr><td align="left"><code class="classname">std::vector</code></td><td align="left"><code class="filename">vector</code></td><td align="left"><code class="classname">__gnu_debug::vector</code></td><td align="left"><code class="filename"><debug/vector></code></td></tr></tbody></table></div></div><br class="table-break" /><p>In addition, when compiling in C++11 mode, these additional

1870

+</p><div class="table"><a id="idm269999040896"></a><p class="title"><strong>Table 17.1. Debugging Containers</strong></p><div class="table-contents"><table summary="Debugging Containers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th></tr></thead><tbody><tr><td align="left"><code class="classname">std::bitset</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="classname">__gnu_debug::bitset</code></td><td align="left"><code class="filename"><debug/bitset></code></td></tr><tr><td align="left"><code class="classname">std::deque</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="classname">__gnu_debug::deque</code></td><td align="left"><code class="filename"><debug/deque></code></td></tr><tr><td align="left"><code class="classname">std::list</code></td><td align="left"><code class="filename">list</code></td><td align="left"><code class="classname">__gnu_debug::list</code></td><td align="left"><code class="filename"><debug/list></code></td></tr><tr><td align="left"><code class="classname">std::map</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::map</code></td><td align="left"><code class="filename"><debug/map></code></td></tr><tr><td align="left"><code class="classname">std::multimap</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="classname">__gnu_debug::multimap</code></td><td align="left"><code class="filename"><debug/map></code></td></tr><tr><td align="left"><code class="classname">std::multiset</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::multiset</code></td><td align="left"><code class="filename"><debug/set></code></td></tr><tr><td align="left"><code class="classname">std::set</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="classname">__gnu_debug::set</code></td><td align="left"><code class="filename"><debug/set></code></td></tr><tr><td align="left"><code class="classname">std::string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::string</code></td><td align="left"><code class="filename"><debug/string></code></td></tr><tr><td align="left"><code class="classname">std::wstring</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::wstring</code></td><td align="left"><code class="filename"><debug/string></code></td></tr><tr><td align="left"><code class="classname">std::basic_string</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="classname">__gnu_debug::basic_string</code></td><td align="left"><code class="filename"><debug/string></code></td></tr><tr><td align="left"><code class="classname">std::vector</code></td><td align="left"><code class="filename">vector</code></td><td align="left"><code class="classname">__gnu_debug::vector</code></td><td align="left"><code class="filename"><debug/vector></code></td></tr></tbody></table></div></div><br class="table-break" /><p>In addition, when compiling in C++11 mode, these additional

1871

containers have additional debug capability.

1872

-</p><div class="table"><a id="idp16535296"></a><p class="title"><strong>Table 17.2. Debugging Containers C++11</strong></p><div class="table-contents"><table summary="Debugging Containers C++11" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th></tr></thead><tbody><tr><td align="left"><code class="classname">std::unordered_map</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_map</code></td><td align="left"><code class="filename"><debug/unordered_map></code></td></tr><tr><td align="left"><code class="classname">std::unordered_multimap</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multimap</code></td><td align="left"><code class="filename"><debug/unordered_map></code></td></tr><tr><td align="left"><code class="classname">std::unordered_set</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_set</code></td><td align="left"><code class="filename"><debug/unordered_set></code></td></tr><tr><td align="left"><code class="classname">std::unordered_multiset</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multiset</code></td><td align="left"><code class="filename"><debug/unordered_set></code></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="debug_mode_semantics.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="debug_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="debug_mode_design.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>

1873

\ No newline at end of file

1874

+</p><div class="table"><a id="idm269998996000"></a><p class="title"><strong>Table 17.2. Debugging Containers C++11</strong></p><div class="table-contents"><table summary="Debugging Containers C++11" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><thead><tr><th align="left">Container</th><th align="left">Header</th><th align="left">Debug container</th><th align="left">Debug header</th></tr></thead><tbody><tr><td align="left"><code class="classname">std::unordered_map</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_map</code></td><td align="left"><code class="filename"><debug/unordered_map></code></td></tr><tr><td align="left"><code class="classname">std::unordered_multimap</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multimap</code></td><td align="left"><code class="filename"><debug/unordered_map></code></td></tr><tr><td align="left"><code class="classname">std::unordered_set</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_set</code></td><td align="left"><code class="filename"><debug/unordered_set></code></td></tr><tr><td align="left"><code class="classname">std::unordered_multiset</code></td><td align="left"><code class="filename">unordered_set</code></td><td align="left"><code class="classname">__gnu_debug::unordered_multiset</code></td><td align="left"><code class="filename"><debug/unordered_set></code></td></tr></tbody></table></div></div><br class="table-break" /></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="debug_mode_semantics.html">Prev</a> </td><td width="20%" align="center"><a accesskey="u" href="debug_mode.html">Up</a></td><td width="40%" align="right"> <a accesskey="n" href="debug_mode_design.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">Semantics </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Design</td></tr></table></div></body></html>

1875

\ No newline at end of file

1876

Index: libstdc++-v3/doc/html/manual/parallel_mode.html

1877

===================================================================

1878

--- a/src/libstdc++-v3/doc/html/manual/parallel_mode.html (.../tags/gcc_4_8_2_release)

1879

+++ b/src/libstdc++-v3/doc/html/manual/parallel_mode.html (.../branches/gcc-4_8-branch)

1880

@@ -1,8 +1,8 @@

1881

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1882

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 18. Parallel Mode</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="debug_mode_design.html" title="Design" /><link rel="next" href="parallel_mode_semantics.html" title="Semantics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 18. Parallel Mode</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode_design.html">Prev</a> </td><th width="60%" align="center">Part III.

1883

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 18. Parallel Mode</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, parallel" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="debug_mode_design.html" title="Design" /><link rel="next" href="parallel_mode_semantics.html" title="Semantics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 18. Parallel Mode</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode_design.html">Prev</a> </td><th width="60%" align="center">Part III.

1884

Extensions

1885

1886

-</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_semantics.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.parallel_mode"></a>Chapter 18. Parallel Mode</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="parallel_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.prereq_flags">Prerequisite Compiler Flags</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.specific">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.omp">Setting up the OpenMP Environment</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.compile">Compile Time Switches</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.settings">Run Time Settings and Defaults</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_test.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></div><p> The libstdc++ parallel mode is an experimental parallel

1887

+</th><td width="20%" align="right"> <a accesskey="n" href="parallel_mode_semantics.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.parallel_mode"></a>Chapter 18. Parallel Mode</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="parallel_mode.html#manual.ext.parallel_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="parallel_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.prereq_flags">Prerequisite Compiler Flags</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.parallel_mode">Using Parallel Mode</a></span></dt><dt><span class="section"><a href="parallel_mode_using.html#parallel_mode.using.specific">Using Specific Parallel Components</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.intro">Interface Basics</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning">Configuration and Tuning</a></span></dt><dd><dl><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.omp">Setting up the OpenMP Environment</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.compile">Compile Time Switches</a></span></dt><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.tuning.settings">Run Time Settings and Defaults</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_design.html#parallel_mode.design.impl">Implementation Namespaces</a></span></dt></dl></dd><dt><span class="section"><a href="parallel_mode_test.html">Testing</a></span></dt><dt><span class="bibliography"><a href="parallel_mode.html#parallel_mode.biblio">Bibliography</a></span></dt></dl></div><p> The libstdc++ parallel mode is an experimental parallel

1888

implementation of many algorithms the C++ Standard Library.

1889

</p><p>

1890

Several of the standard algorithms, for instance

1891

@@ -12,11 +12,11 @@

1892

specific compiler flag.

1893

</p><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.parallel_mode.intro"></a>Intro</h2></div></div></div><p>The following library components in the include

1894

<code class="filename">numeric</code> are included in the parallel mode:</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p><code class="function">std::accumulate</code></p></li><li class="listitem"><p><code class="function">std::adjacent_difference</code></p></li><li class="listitem"><p><code class="function">std::inner_product</code></p></li><li class="listitem"><p><code class="function">std::partial_sum</code></p></li></ul></div><p>The following library components in the include

1895

-<code class="filename">algorithm</code> are included in the parallel mode:</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p><code class="function">std::adjacent_find</code></p></li><li class="listitem"><p><code class="function">std::count</code></p></li><li class="listitem"><p><code class="function">std::count_if</code></p></li><li class="listitem"><p><code class="function">std::equal</code></p></li><li class="listitem"><p><code class="function">std::find</code></p></li><li class="listitem"><p><code class="function">std::find_if</code></p></li><li class="listitem"><p><code class="function">std::find_first_of</code></p></li><li class="listitem"><p><code class="function">std::for_each</code></p></li><li class="listitem"><p><code class="function">std::generate</code></p></li><li class="listitem"><p><code class="function">std::generate_n</code></p></li><li class="listitem"><p><code class="function">std::lexicographical_compare</code></p></li><li class="listitem"><p><code class="function">std::mismatch</code></p></li><li class="listitem"><p><code class="function">std::search</code></p></li><li class="listitem"><p><code class="function">std::search_n</code></p></li><li class="listitem"><p><code class="function">std::transform</code></p></li><li class="listitem"><p><code class="function">std::replace</code></p></li><li class="listitem"><p><code class="function">std::replace_if</code></p></li><li class="listitem"><p><code class="function">std::max_element</code></p></li><li class="listitem"><p><code class="function">std::merge</code></p></li><li class="listitem"><p><code class="function">std::min_element</code></p></li><li class="listitem"><p><code class="function">std::nth_element</code></p></li><li class="listitem"><p><code class="function">std::partial_sort</code></p></li><li class="listitem"><p><code class="function">std::partition</code></p></li><li class="listitem"><p><code class="function">std::random_shuffle</code></p></li><li class="listitem"><p><code class="function">std::set_union</code></p></li><li class="listitem"><p><code class="function">std::set_intersection</code></p></li><li class="listitem"><p><code class="function">std::set_symmetric_difference</code></p></li><li class="listitem"><p><code class="function">std::set_difference</code></p></li><li class="listitem"><p><code class="function">std::sort</code></p></li><li class="listitem"><p><code class="function">std::stable_sort</code></p></li><li class="listitem"><p><code class="function">std::unique_copy</code></p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h2 class="title"><a id="parallel_mode.biblio"></a>Bibliography</h2></div></div></div><div class="biblioentry"><a id="idp16926864"></a><p><span class="citetitle"><em class="citetitle">

1896

+<code class="filename">algorithm</code> are included in the parallel mode:</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p><code class="function">std::adjacent_find</code></p></li><li class="listitem"><p><code class="function">std::count</code></p></li><li class="listitem"><p><code class="function">std::count_if</code></p></li><li class="listitem"><p><code class="function">std::equal</code></p></li><li class="listitem"><p><code class="function">std::find</code></p></li><li class="listitem"><p><code class="function">std::find_if</code></p></li><li class="listitem"><p><code class="function">std::find_first_of</code></p></li><li class="listitem"><p><code class="function">std::for_each</code></p></li><li class="listitem"><p><code class="function">std::generate</code></p></li><li class="listitem"><p><code class="function">std::generate_n</code></p></li><li class="listitem"><p><code class="function">std::lexicographical_compare</code></p></li><li class="listitem"><p><code class="function">std::mismatch</code></p></li><li class="listitem"><p><code class="function">std::search</code></p></li><li class="listitem"><p><code class="function">std::search_n</code></p></li><li class="listitem"><p><code class="function">std::transform</code></p></li><li class="listitem"><p><code class="function">std::replace</code></p></li><li class="listitem"><p><code class="function">std::replace_if</code></p></li><li class="listitem"><p><code class="function">std::max_element</code></p></li><li class="listitem"><p><code class="function">std::merge</code></p></li><li class="listitem"><p><code class="function">std::min_element</code></p></li><li class="listitem"><p><code class="function">std::nth_element</code></p></li><li class="listitem"><p><code class="function">std::partial_sort</code></p></li><li class="listitem"><p><code class="function">std::partition</code></p></li><li class="listitem"><p><code class="function">std::random_shuffle</code></p></li><li class="listitem"><p><code class="function">std::set_union</code></p></li><li class="listitem"><p><code class="function">std::set_intersection</code></p></li><li class="listitem"><p><code class="function">std::set_symmetric_difference</code></p></li><li class="listitem"><p><code class="function">std::set_difference</code></p></li><li class="listitem"><p><code class="function">std::sort</code></p></li><li class="listitem"><p><code class="function">std::stable_sort</code></p></li><li class="listitem"><p><code class="function">std::unique_copy</code></p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h2 class="title"><a id="parallel_mode.biblio"></a>Bibliography</h2></div></div></div><div class="biblioentry"><a id="idm269998604464"></a><p><span class="citetitle"><em class="citetitle">

1897

Parallelization of Bulk Operations for STL Dictionaries

1898

</em>. </span><span class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span>. </span><span class="author"><span class="firstname">Leonor</span> <span class="surname">Frias</span>. </span><span class="copyright">Copyright © 2007 . </span><span class="publisher"><span class="publishername">

1899

Workshop on Highly Parallel Processing on a Chip (HPPC) 2007. (LNCS)

1900

- . </span></span></p></div><div class="biblioentry"><a id="idp16931936"></a><p><span class="citetitle"><em class="citetitle">

1901

+ . </span></span></p></div><div class="biblioentry"><a id="idm269998599392"></a><p><span class="citetitle"><em class="citetitle">

1902

The Multi-Core Standard Template Library

1903

</em>. </span><span class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span>. </span><span class="author"><span class="firstname">Peter</span> <span class="surname">Sanders</span>. </span><span class="author"><span class="firstname">Felix</span> <span class="surname">Putze</span>. </span><span class="copyright">Copyright © 2007 . </span><span class="publisher"><span class="publishername">

1904

Euro-Par 2007: Parallel Processing. (LNCS 4641)

1905

Index: libstdc++-v3/doc/html/manual/debug_mode_semantics.html

1906

===================================================================

1907

--- a/src/libstdc++-v3/doc/html/manual/debug_mode_semantics.html (.../tags/gcc_4_8_2_release)

1908

+++ b/src/libstdc++-v3/doc/html/manual/debug_mode_semantics.html (.../branches/gcc-4_8-branch)

1909

@@ -1,5 +1,5 @@

1910

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1911

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Semantics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="prev" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="next" href="debug_mode_using.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Semantics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 17. Debug Mode</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode_using.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.semantics"></a>Semantics</h2></div></div></div><p>

1912

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Semantics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="prev" href="debug_mode.html" title="Chapter 17. Debug Mode" /><link rel="next" href="debug_mode_using.html" title="Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Semantics</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="debug_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 17. Debug Mode</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode_using.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.semantics"></a>Semantics</h2></div></div></div><p>

1913

</p><p>A program that uses the C++ standard library correctly

1914

will maintain the same semantics under debug mode as it had with

1915

the normal (release) library. All functional and exception-handling

1916

Index: libstdc++-v3/doc/html/manual/setup.html

1917

===================================================================

1918

--- a/src/libstdc++-v3/doc/html/manual/setup.html (.../tags/gcc_4_8_2_release)

1919

+++ b/src/libstdc++-v3/doc/html/manual/setup.html (.../branches/gcc-4_8-branch)

1920

@@ -1,8 +1,8 @@

1921

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1922

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 2. Setup</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="intro.html" title="Part I. Introduction" /><link rel="prev" href="bugs.html" title="Bugs" /><link rel="next" href="configure.html" title="Configure" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 2. Setup</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bugs.html">Prev</a> </td><th width="60%" align="center">Part I.

1923

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 2. Setup</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="intro.html" title="Part I. Introduction" /><link rel="prev" href="bugs.html" title="Bugs" /><link rel="next" href="configure.html" title="Configure" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 2. Setup</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="bugs.html">Prev</a> </td><th width="60%" align="center">Part I.

1924

Introduction

1925

1926

-</th><td width="20%" align="right"> <a accesskey="n" href="configure.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.intro.setup"></a>Chapter 2. Setup</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="setup.html#manual.intro.setup.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="configure.html">Configure</a></span></dt><dt><span class="section"><a href="make.html">Make</a></span></dt></dl></div><p>To transform libstdc++ sources into installed include files

1927

+</th><td width="20%" align="right"> <a accesskey="n" href="configure.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.intro.setup"></a>Chapter 2. Setup</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="setup.html#manual.intro.setup.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="configure.html">Configure</a></span></dt><dt><span class="section"><a href="make.html">Make</a></span></dt></dl></div><p>To transform libstdc++ sources into installed include files

1928

and properly built binaries useful for linking to other software is

1929

a multi-step process. Steps include getting the sources,

1930

configuring and building the sources, testing, and installation.

1931

Index: libstdc++-v3/doc/html/manual/backwards.html

1932

===================================================================

1933

--- a/src/libstdc++-v3/doc/html/manual/backwards.html (.../tags/gcc_4_8_2_release)

1934

+++ b/src/libstdc++-v3/doc/html/manual/backwards.html (.../branches/gcc-4_8-branch)

1935

@@ -1,5 +1,5 @@

1936

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1937

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Backwards Compatibility</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, backwards" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="api.html" title="API Evolution and Deprecation History" /><link rel="next" href="appendix_free.html" title="Appendix C. Free Software Needs Free Documentation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Backwards Compatibility</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="api.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1938

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Backwards Compatibility</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, backwards" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="api.html" title="API Evolution and Deprecation History" /><link rel="next" href="appendix_free.html" title="Appendix C. Free Software Needs Free Documentation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Backwards Compatibility</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="api.html">Prev</a> </td><th width="60%" align="center">Appendix B.

1939

Porting and Maintenance

1940

1941

</th><td width="20%" align="right"> <a accesskey="n" href="appendix_free.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.appendix.porting.backwards"></a>Backwards Compatibility</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="backwards.first"></a>First</h3></div></div></div><p>The first generation GNU C++ library was called libg++. It was a

1942

@@ -940,15 +940,15 @@

1943

This is a change in behavior from older versions. Now, most

1944

<span class="type">iterator_type</span> typedefs in container classes are POD

1945

objects, not <span class="type">value_type</span> pointers.

1946

-</p></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="backwards.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="idp23415104"></a><p><span class="title"><em>

1947

+</p></div></div><div class="bibliography"><div class="titlepage"><div><div><h3 class="title"><a id="backwards.biblio"></a>Bibliography</h3></div></div></div><div class="biblioentry"><a id="idm269992117648"></a><p><span class="title"><em>

1948

1949

Migrating to GCC 4.1

1950

</a>

1951

- </em>. </span><span class="author"><span class="firstname">Dan</span> <span class="surname">Kegel</span>. </span></p></div><div class="biblioentry"><a id="idp23417888"></a><p><span class="title"><em>

1952

+ </em>. </span><span class="author"><span class="firstname">Dan</span> <span class="surname">Kegel</span>. </span></p></div><div class="biblioentry"><a id="idm269992114864"></a><p><span class="title"><em>

1953

1954

Building the Whole Debian Archive with GCC 4.1: A Summary

1955

</a>

1956

- </em>. </span><span class="author"><span class="firstname">Martin</span> <span class="surname">Michlmayr</span>. </span></p></div><div class="biblioentry"><a id="idp23420736"></a><p><span class="title"><em>

1957

+ </em>. </span><span class="author"><span class="firstname">Martin</span> <span class="surname">Michlmayr</span>. </span></p></div><div class="biblioentry"><a id="idm269992112016"></a><p><span class="title"><em>

1958

1959

Migration guide for GCC-3.2

1960

</a>

1961

Index: libstdc++-v3/doc/html/manual/source_design_notes.html

1962

===================================================================

1963

--- a/src/libstdc++-v3/doc/html/manual/source_design_notes.html (.../tags/gcc_4_8_2_release)

1964

+++ b/src/libstdc++-v3/doc/html/manual/source_design_notes.html (.../branches/gcc-4_8-branch)

1965

@@ -1,5 +1,5 @@

1966

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1967

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design Notes</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="source_code_style.html" title="Coding Style" /><link rel="next" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design Notes</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="source_code_style.html">Prev</a> </td><th width="60%" align="center">Appendix A.

1968

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design Notes</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="source_code_style.html" title="Coding Style" /><link rel="next" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design Notes</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="source_code_style.html">Prev</a> </td><th width="60%" align="center">Appendix A.

1969

Contributing

1970

1971

</th><td width="20%" align="right"> <a accesskey="n" href="appendix_porting.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="contrib.design_notes"></a>Design Notes</h2></div></div></div><p>

1972

Index: libstdc++-v3/doc/html/manual/ext_sgi.html

1973

===================================================================

1974

--- a/src/libstdc++-v3/doc/html/manual/ext_sgi.html (.../tags/gcc_4_8_2_release)

1975

+++ b/src/libstdc++-v3/doc/html/manual/ext_sgi.html (.../branches/gcc-4_8-branch)

1976

@@ -1,5 +1,5 @@

1977

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1978

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Deprecated</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions" /><link rel="prev" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions" /><link rel="next" href="ext_utilities.html" title="Chapter 24. Utilities" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Deprecated</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_containers.html">Prev</a> </td><th width="60%" align="center">Chapter 23. HP/SGI Extensions</th><td width="20%" align="right"> <a accesskey="n" href="ext_utilities.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.containers.deprecated_sgi"></a>Deprecated</h2></div></div></div><p>

1979

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Deprecated</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions" /><link rel="prev" href="ext_containers.html" title="Chapter 23. HP/SGI Extensions" /><link rel="next" href="ext_utilities.html" title="Chapter 24. Utilities" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Deprecated</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_containers.html">Prev</a> </td><th width="60%" align="center">Chapter 23. HP/SGI Extensions</th><td width="20%" align="right"> <a accesskey="n" href="ext_utilities.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.containers.deprecated_sgi"></a>Deprecated</h2></div></div></div><p>

1980

The SGI hashing classes <code class="classname">hash_set</code> and

1981

<code class="classname">hash_set</code> have been deprecated by the

1982

unordered_set, unordered_multiset, unordered_map,

1983

Index: libstdc++-v3/doc/html/manual/facets.html

1984

===================================================================

1985

--- a/src/libstdc++-v3/doc/html/manual/facets.html (.../tags/gcc_4_8_2_release)

1986

+++ b/src/libstdc++-v3/doc/html/manual/facets.html (.../branches/gcc-4_8-branch)

1987

@@ -1,8 +1,8 @@

1988

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

1989

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Facets</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="localization.html" title="Chapter 8. Localization" /><link rel="prev" href="localization.html" title="Chapter 8. Localization" /><link rel="next" href="containers.html" title="Chapter 9. Containers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Facets</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="localization.html">Prev</a> </td><th width="60%" align="center">Chapter 8.

1990

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Facets</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="localization.html" title="Chapter 8. Localization" /><link rel="prev" href="localization.html" title="Chapter 8. Localization" /><link rel="next" href="containers.html" title="Chapter 9. Containers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Facets</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="localization.html">Prev</a> </td><th width="60%" align="center">Chapter 8.

1991

Localization

1992

1993

-</th><td width="20%" align="right"> <a accesskey="n" href="containers.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.localization.facet"></a>Facets</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.localization.facet.ctype"></a>ctype</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="facet.ctype.impl"></a>Implementation</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idp15778336"></a>Specializations</h5></div></div></div><p>

1994

+</th><td width="20%" align="right"> <a accesskey="n" href="containers.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.localization.facet"></a>Facets</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.localization.facet.ctype"></a>ctype</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="facet.ctype.impl"></a>Implementation</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="idm269999753024"></a>Specializations</h5></div></div></div><p>

1995

For the required specialization codecvt<wchar_t, char, mbstate_t> ,

1996

conversions are made between the internal character set (always UCS4

1997

on GNU/Linux) and whatever the currently selected locale for the

1998

@@ -49,24 +49,24 @@

1999

</p></li><li class="listitem"><p>

2000

Rename abstract base class. See if just smash-overriding is a

2001

better approach. Clarify, add sanity to naming.

2002

- </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="facet.ctype.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idp15793392"></a><p><span class="citetitle"><em class="citetitle">

2003

+ </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="facet.ctype.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idm269999738032"></a><p><span class="citetitle"><em class="citetitle">

2004

The GNU C Library

2005

- </em>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="idp15798144"></a><p><span class="citetitle"><em class="citetitle">

2006

+ </em>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling and 7 Locales and Internationalization. </span></p></div><div class="biblioentry"><a id="idm269999733280"></a><p><span class="citetitle"><em class="citetitle">

2007

Correspondence

2008

- </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idp15801232"></a><p><span class="citetitle"><em class="citetitle">

2009

+ </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idm269999730192"></a><p><span class="citetitle"><em class="citetitle">

2010

ISO/IEC 14882:1998 Programming languages - C++

2011

2012

2013

ISO/IEC 9899:1999 Programming languages - C

2014

2015

2016

2017

The Open Group Base Specifications, Issue 6 (IEEE Std. 1003.1-2004)

2018

</a>

2019

2020

- The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span></p></div><div class="biblioentry"><a id="idp15809040"></a><p><span class="citetitle"><em class="citetitle">

2021

+ The Open Group/The Institute of Electrical and Electronics Engineers, Inc.. </span></p></div><div class="biblioentry"><a id="idm269999722384"></a><p><span class="citetitle"><em class="citetitle">

2022

The C++ Programming Language, Special Edition

2023

</em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">

2024

Addison Wesley

2025

- . </span></span></p></div><div class="biblioentry"><a id="idp15813664"></a><p><span class="citetitle"><em class="citetitle">

2026

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999717760"></a><p><span class="citetitle"><em class="citetitle">

2027

Standard C++ IOStreams and Locales

2028

</em>. </span><span class="subtitle">

2029

Advanced Programmer's Guide and Reference

2030

@@ -409,42 +409,42 @@

2031

</p></li><li class="listitem"><p>

2032

wchar_t/char internal buffers and conversions between

2033

internal/external buffers?

2034

- </p></li></ul></div></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="facet.codecvt.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idp15891136"></a><p><span class="citetitle"><em class="citetitle">

2035

+ </p></li></ul></div></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="facet.codecvt.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idm269999640080"></a><p><span class="citetitle"><em class="citetitle">

2036

The GNU C Library

2037

</em>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">

2038

Chapters 6 Character Set Handling and 7 Locales and Internationalization

2039

- . </span></p></div><div class="biblioentry"><a id="idp15895888"></a><p><span class="citetitle"><em class="citetitle">

2040

+ . </span></p></div><div class="biblioentry"><a id="idm269999635328"></a><p><span class="citetitle"><em class="citetitle">

2041

Correspondence

2042

- </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idp15898976"></a><p><span class="citetitle"><em class="citetitle">

2043

+ </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idm269999632240"></a><p><span class="citetitle"><em class="citetitle">

2044

ISO/IEC 14882:1998 Programming languages - C++

2045

2046

2047

ISO/IEC 9899:1999 Programming languages - C

2048

2049

2050

2051

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

2052

</a>

2053

2054

The Open Group/The Institute of Electrical and Electronics

2055

Engineers, Inc.

2056

- . </span></p></div><div class="biblioentry"><a id="idp15906768"></a><p><span class="citetitle"><em class="citetitle">

2057

+ . </span></p></div><div class="biblioentry"><a id="idm269999624448"></a><p><span class="citetitle"><em class="citetitle">

2058

The C++ Programming Language, Special Edition

2059

</em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">

2060

Addison Wesley

2061

- . </span></span></p></div><div class="biblioentry"><a id="idp15911392"></a><p><span class="citetitle"><em class="citetitle">

2062

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999619824"></a><p><span class="citetitle"><em class="citetitle">

2063

Standard C++ IOStreams and Locales

2064

</em>. </span><span class="subtitle">

2065

Advanced Programmer's Guide and Reference

2066

. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">

2067

Addison Wesley Longman

2068

- . </span></span></p></div><div class="biblioentry"><a id="idp15917056"></a><p><span class="title"><em>

2069

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999614160"></a><p><span class="title"><em>

2070

2071

A brief description of Normative Addendum 1

2072

</a>

2073

- </em>. </span><span class="author"><span class="firstname">Clive</span> <span class="surname">Feather</span>. </span><span class="pagenums">Extended Character Sets. </span></p></div><div class="biblioentry"><a id="idp15920304"></a><p><span class="title"><em>

2074

+ </em>. </span><span class="author"><span class="firstname">Clive</span> <span class="surname">Feather</span>. </span><span class="pagenums">Extended Character Sets. </span></p></div><div class="biblioentry"><a id="idm269999610912"></a><p><span class="title"><em>

2075

2076

The Unicode HOWTO

2077

</a>

2078

- </em>. </span><span class="author"><span class="firstname">Bruno</span> <span class="surname">Haible</span>. </span></p></div><div class="biblioentry"><a id="idp15923088"></a><p><span class="title"><em>

2079

+ </em>. </span><span class="author"><span class="firstname">Bruno</span> <span class="surname">Haible</span>. </span></p></div><div class="biblioentry"><a id="idm269999608128"></a><p><span class="title"><em>

2080

2081

UTF-8 and Unicode FAQ for Unix/Linux

2082

</a>

2083

@@ -690,39 +690,39 @@

2084

model. As of this writing, it is unknown how to query to see

2085

if a specified message catalog exists using the gettext

2086

package.

2087

- </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="facet.messages.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idp16003632"></a><p><span class="citetitle"><em class="citetitle">

2088

+ </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="facet.messages.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idm269999527584"></a><p><span class="citetitle"><em class="citetitle">

2089

The GNU C Library

2090

</em>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">Chapters 6 Character Set Handling, and 7 Locales and Internationalization

2091

- . </span></p></div><div class="biblioentry"><a id="idp16008384"></a><p><span class="citetitle"><em class="citetitle">

2092

+ . </span></p></div><div class="biblioentry"><a id="idm269999522832"></a><p><span class="citetitle"><em class="citetitle">

2093

Correspondence

2094

- </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idp16011472"></a><p><span class="citetitle"><em class="citetitle">

2095

+ </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idm269999519744"></a><p><span class="citetitle"><em class="citetitle">

2096

ISO/IEC 14882:1998 Programming languages - C++

2097

2098

2099

ISO/IEC 9899:1999 Programming languages - C

2100

2101

2102

2103

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

2104

</a>

2105

2106

The Open Group/The Institute of Electrical and Electronics

2107

Engineers, Inc.

2108

- . </span></p></div><div class="biblioentry"><a id="idp16019264"></a><p><span class="citetitle"><em class="citetitle">

2109

+ . </span></p></div><div class="biblioentry"><a id="idm269999511952"></a><p><span class="citetitle"><em class="citetitle">

2110

The C++ Programming Language, Special Edition

2111

</em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">

2112

Addison Wesley

2113

- . </span></span></p></div><div class="biblioentry"><a id="idp16023888"></a><p><span class="citetitle"><em class="citetitle">

2114

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999507328"></a><p><span class="citetitle"><em class="citetitle">

2115

Standard C++ IOStreams and Locales

2116

</em>. </span><span class="subtitle">

2117

Advanced Programmer's Guide and Reference

2118

. </span><span class="author"><span class="firstname">Angelika</span> <span class="surname">Langer</span>. </span><span class="author"><span class="firstname">Klaus</span> <span class="surname">Kreft</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley Longman, Inc.. </span><span class="publisher"><span class="publishername">

2119

Addison Wesley Longman

2120

- . </span></span></p></div><div class="biblioentry"><a id="idp16029552"></a><p><span class="title"><em>

2121

- <a class="link" href="http://java.sun.com/reference/api/index.html" target="_top">

2122

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999501664"></a><p><span class="title"><em>

2123

+ <a class="link" href="http://www.oracle.com/technetwork/java/api/index.html" target="_top">

2124

API Specifications, Java Platform

2125

</a>

2126

</em>. </span><span class="pagenums">java.util.Properties, java.text.MessageFormat,

2127

java.util.Locale, java.util.ResourceBundle

2128

- . </span></p></div><div class="biblioentry"><a id="idp16031888"></a><p><span class="title"><em>

2129

+ . </span></p></div><div class="biblioentry"><a id="idm269999499328"></a><p><span class="title"><em>

2130

2131

GNU gettext tools, version 0.10.38, Native Language Support

2132

Library and Tools.

2133

Index: libstdc++-v3/doc/html/manual/diagnostics.html

2134

===================================================================

2135

--- a/src/libstdc++-v3/doc/html/manual/diagnostics.html (.../tags/gcc_4_8_2_release)

2136

+++ b/src/libstdc++-v3/doc/html/manual/diagnostics.html (.../branches/gcc-4_8-branch)

2137

@@ -1,13 +1,13 @@

2138

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2139

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 5. Diagnostics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="termination.html" title="Termination" /><link rel="next" href="concept_checking.html" title="Concept Checking" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 5.

2140

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 5. Diagnostics</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="termination.html" title="Termination" /><link rel="next" href="concept_checking.html" title="Concept Checking" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 5.

2141

Diagnostics

2142

2143

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="termination.html">Prev</a> </td><th width="60%" align="center">Part II.

2144

Standard Contents

2145

</th><td width="20%" align="right"> <a accesskey="n" href="concept_checking.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.diagnostics"></a>Chapter 5.

2146

Diagnostics

2147

- <a id="idp13835248" class="indexterm"></a>

2148

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.api">API Reference</a></span></dt><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.data">Adding Data to <code class="classname">exception</code></a></span></dt></dl></dd><dt><span class="section"><a href="concept_checking.html">Concept Checking</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.diagnostics.exceptions"></a>Exceptions</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.diagnostics.exceptions.api"></a>API Reference</h3></div></div></div><p>

2149

+ <a id="idm270001697504" class="indexterm"></a>

2150

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.api">API Reference</a></span></dt><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.data">Adding Data to <code class="classname">exception</code></a></span></dt></dl></dd><dt><span class="section"><a href="concept_checking.html">Concept Checking</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.diagnostics.exceptions"></a>Exceptions</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.diagnostics.exceptions.api"></a>API Reference</h3></div></div></div><p>

2151

All exception objects are defined in one of the standard header

2152

files: <code class="filename">exception</code>,

2153

<code class="filename">stdexcept</code>, <code class="filename">new</code>, and

2154

Index: libstdc++-v3/doc/html/manual/mt_allocator_design.html

2155

===================================================================

2156

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator_design.html (.../tags/gcc_4_8_2_release)

2157

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator_design.html (.../branches/gcc-4_8-branch)

2158

@@ -1,5 +1,5 @@

2159

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2160

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design Issues</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="next" href="mt_allocator_impl.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design Issues</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_impl.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.design_issues"></a>Design Issues</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.mt.overview"></a>Overview</h3></div></div></div><p> There are three general components to the allocator: a datum

2161

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design Issues</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="next" href="mt_allocator_impl.html" title="Implementation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design Issues</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_impl.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.design_issues"></a>Design Issues</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.mt.overview"></a>Overview</h3></div></div></div><p> There are three general components to the allocator: a datum

2162

describing the characteristics of the memory pool, a policy class

2163

containing this pool that links instantiation types to common or

2164

individual pools, and a class inheriting from the policy class that is

2165

Index: libstdc++-v3/doc/html/manual/appendix_free.html

2166

===================================================================

2167

--- a/src/libstdc++-v3/doc/html/manual/appendix_free.html (.../tags/gcc_4_8_2_release)

2168

+++ b/src/libstdc++-v3/doc/html/manual/appendix_free.html (.../branches/gcc-4_8-branch)

2169

@@ -1,12 +1,12 @@

2170

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2171

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix C. Free Software Needs Free Documentation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="backwards.html" title="Backwards Compatibility" /><link rel="next" href="appendix_gpl.html" title="Appendix D. GNU General Public License version 3" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix C.

2172

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix C. Free Software Needs Free Documentation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="backwards.html" title="Backwards Compatibility" /><link rel="next" href="appendix_gpl.html" title="Appendix D. GNU General Public License version 3" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix C.

2173

Free Software Needs Free Documentation

2174

2175

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="backwards.html">Prev</a> </td><th width="60%" align="center">Part IV.

2176

Appendices

2177

</th><td width="20%" align="right"> <a accesskey="n" href="appendix_gpl.html">Next</a></td></tr></table><hr /></div><div class="appendix"><div class="titlepage"><div><div><h1 class="title"><a id="appendix.free"></a>

2178

Free Software Needs Free Documentation

2179

- <a id="idp23426192" class="indexterm"></a>

2180

+ <a id="idm269992106560" class="indexterm"></a>

2181

</h1></div></div></div><p>

2182

The biggest deficiency in free operating systems is not in the

2183

software--it is the lack of good free manuals that we can include in

2184

Index: libstdc++-v3/doc/html/manual/algorithms.html

2185

===================================================================

2186

--- a/src/libstdc++-v3/doc/html/manual/algorithms.html (.../tags/gcc_4_8_2_release)

2187

+++ b/src/libstdc++-v3/doc/html/manual/algorithms.html (.../branches/gcc-4_8-branch)

2188

@@ -1,13 +1,13 @@

2189

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2190

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 11. Algorithms</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library, algorithm" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="iterators.html" title="Chapter 10. Iterators" /><link rel="next" href="numerics.html" title="Chapter 12. Numerics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 11.

2191

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 11. Algorithms</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library, algorithm" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="iterators.html" title="Chapter 10. Iterators" /><link rel="next" href="numerics.html" title="Chapter 12. Numerics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 11.

2192

Algorithms

2193

2194

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="iterators.html">Prev</a> </td><th width="60%" align="center">Part II.

2195

Standard Contents

2196

</th><td width="20%" align="right"> <a accesskey="n" href="numerics.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.algorithms"></a>Chapter 11.

2197

Algorithms

2198

- <a id="idp16191968" class="indexterm"></a>

2199

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="algorithms.html#std.algorithms.mutating">Mutating</a></span></dt><dd><dl><dt><span class="section"><a href="algorithms.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="section"><a href="algorithms.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></div><p>

2200

+ <a id="idm269999339120" class="indexterm"></a>

2201

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="algorithms.html#std.algorithms.mutating">Mutating</a></span></dt><dd><dl><dt><span class="section"><a href="algorithms.html#algorithms.mutating.swap"><code class="function">swap</code></a></span></dt><dd><dl><dt><span class="section"><a href="algorithms.html#algorithms.swap.specializations">Specializations</a></span></dt></dl></dd></dl></dd></dl></div><p>

2202

The neatest accomplishment of the algorithms section is that all the

2203

work is done via iterators, not containers directly. This means two

2204

important things:

2205

Index: libstdc++-v3/doc/html/manual/appendix_porting.html

2206

===================================================================

2207

--- a/src/libstdc++-v3/doc/html/manual/appendix_porting.html (.../tags/gcc_4_8_2_release)

2208

+++ b/src/libstdc++-v3/doc/html/manual/appendix_porting.html (.../branches/gcc-4_8-branch)

2209

@@ -1,13 +1,13 @@

2210

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2211

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix B. Porting and Maintenance</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="source_design_notes.html" title="Design Notes" /><link rel="next" href="documentation_hacking.html" title="Writing and Generating Documentation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix B.

2212

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix B. Porting and Maintenance</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="source_design_notes.html" title="Design Notes" /><link rel="next" href="documentation_hacking.html" title="Writing and Generating Documentation" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix B.

2213

Porting and Maintenance

2214

2215

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="source_design_notes.html">Prev</a> </td><th width="60%" align="center">Part IV.

2216

Appendices

2217

</th><td width="20%" align="right"> <a accesskey="n" href="documentation_hacking.html">Next</a></td></tr></table><hr /></div><div class="appendix"><div class="titlepage"><div><div><h1 class="title"><a id="appendix.porting"></a>

2218

Porting and Maintenance

2219

- <a id="idp22008864" class="indexterm"></a>

2220

-</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="appendix_porting.html#appendix.porting.build_hacking">Configure and Build Hacking</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_porting.html#build_hacking.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.overview">Overview</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_porting.html#build_hacking.overview.basic">General Process</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.overview.map">What Comes from Where</a></span></dt></dl></dd><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure">Configure</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.scripts">Storing Information in non-AC files (like configure.host)</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.conventions">Coding and Commenting Conventions</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.acinclude">The acinclude.m4 layout</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.enable"><code class="constant">GLIBCXX_ENABLE</code>, the <code class="literal">--enable</code> maker</a></span></dt></dl></dd><dt><span class="section"><a href="appendix_porting.html#build_hacking.make">Make</a></span></dt></dl></dd><dt><span class="section"><a href="documentation_hacking.html">Writing and Generating Documentation</a></span></dt><dd><dl><dt><span class="section"><a href="documentation_hacking.html#doc.intro">Introduction</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doc.generation">Generating Documentation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doc.doxygen">Doxygen</a></span></dt><dd><dl><dt><span class="section"><a href="documentation_hacking.html#doxygen.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doxygen.rules">Generating the Doxygen Files</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doxygen.debug">Debugging Generation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doxygen.markup">Markup</a></span></dt></dl></dd><dt><span class="section"><a href="documentation_hacking.html#doc.docbook">Docbook</a></span></dt><dd><dl><dt><span class="section"><a href="documentation_hacking.html#docbook.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.rules">Generating the DocBook Files</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.debug">Debugging Generation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.validation">Editing and Validation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.examples">File Organization and Basics</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.markup">Markup By Example</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="internals.html">Porting to New Hardware or Operating Systems</a></span></dt><dd><dl><dt><span class="section"><a href="internals.html#internals.os">Operating System</a></span></dt><dt><span class="section"><a href="internals.html#internals.cpu">CPU</a></span></dt><dt><span class="section"><a href="internals.html#internals.char_types">Character Types</a></span></dt><dt><span class="section"><a href="internals.html#internals.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="internals.html#internals.numeric_limits">Numeric Limits</a></span></dt><dt><span class="section"><a href="internals.html#internals.libtool">Libtool</a></span></dt></dl></dd><dt><span class="section"><a href="test.html">Test</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.organization">Organization</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.organization.layout">Directory Layout</a></span></dt><dt><span class="section"><a href="test.html#test.organization.naming">Naming Conventions</a></span></dt></dl></dd><dt><span class="section"><a href="test.html#test.run">Running the Testsuite</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.run.basic">Basic</a></span></dt><dt><span class="section"><a href="test.html#test.run.variations">Variations</a></span></dt><dt><span class="section"><a href="test.html#test.run.permutations">Permutations</a></span></dt></dl></dd><dt><span class="section"><a href="test.html#test.new_tests">Writing a new test case</a></span></dt><dt><span class="section"><a href="test.html#test.harness">Test Harness and Utilities</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.harness.dejagnu">Dejagnu Harness Details</a></span></dt><dt><span class="section"><a href="test.html#test.harness.utils">Utilities</a></span></dt></dl></dd><dt><span class="section"><a href="test.html#test.special">Special Topics</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.exception.safety">

2221

+ <a id="idm269993523968" class="indexterm"></a>

2222

+</h1></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="appendix_porting.html#appendix.porting.build_hacking">Configure and Build Hacking</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_porting.html#build_hacking.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.overview">Overview</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_porting.html#build_hacking.overview.basic">General Process</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.overview.map">What Comes from Where</a></span></dt></dl></dd><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure">Configure</a></span></dt><dd><dl><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.scripts">Storing Information in non-AC files (like configure.host)</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.conventions">Coding and Commenting Conventions</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.acinclude">The acinclude.m4 layout</a></span></dt><dt><span class="section"><a href="appendix_porting.html#build_hacking.configure.enable"><code class="constant">GLIBCXX_ENABLE</code>, the <code class="literal">--enable</code> maker</a></span></dt></dl></dd><dt><span class="section"><a href="appendix_porting.html#build_hacking.make">Make</a></span></dt></dl></dd><dt><span class="section"><a href="documentation_hacking.html">Writing and Generating Documentation</a></span></dt><dd><dl><dt><span class="section"><a href="documentation_hacking.html#doc.intro">Introduction</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doc.generation">Generating Documentation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doc.doxygen">Doxygen</a></span></dt><dd><dl><dt><span class="section"><a href="documentation_hacking.html#doxygen.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doxygen.rules">Generating the Doxygen Files</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doxygen.debug">Debugging Generation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#doxygen.markup">Markup</a></span></dt></dl></dd><dt><span class="section"><a href="documentation_hacking.html#doc.docbook">Docbook</a></span></dt><dd><dl><dt><span class="section"><a href="documentation_hacking.html#docbook.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.rules">Generating the DocBook Files</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.debug">Debugging Generation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.validation">Editing and Validation</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.examples">File Organization and Basics</a></span></dt><dt><span class="section"><a href="documentation_hacking.html#docbook.markup">Markup By Example</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="internals.html">Porting to New Hardware or Operating Systems</a></span></dt><dd><dl><dt><span class="section"><a href="internals.html#internals.os">Operating System</a></span></dt><dt><span class="section"><a href="internals.html#internals.cpu">CPU</a></span></dt><dt><span class="section"><a href="internals.html#internals.char_types">Character Types</a></span></dt><dt><span class="section"><a href="internals.html#internals.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="internals.html#internals.numeric_limits">Numeric Limits</a></span></dt><dt><span class="section"><a href="internals.html#internals.libtool">Libtool</a></span></dt></dl></dd><dt><span class="section"><a href="test.html">Test</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.organization">Organization</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.organization.layout">Directory Layout</a></span></dt><dt><span class="section"><a href="test.html#test.organization.naming">Naming Conventions</a></span></dt></dl></dd><dt><span class="section"><a href="test.html#test.run">Running the Testsuite</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.run.basic">Basic</a></span></dt><dt><span class="section"><a href="test.html#test.run.variations">Variations</a></span></dt><dt><span class="section"><a href="test.html#test.run.permutations">Permutations</a></span></dt></dl></dd><dt><span class="section"><a href="test.html#test.new_tests">Writing a new test case</a></span></dt><dt><span class="section"><a href="test.html#test.harness">Test Harness and Utilities</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.harness.dejagnu">Dejagnu Harness Details</a></span></dt><dt><span class="section"><a href="test.html#test.harness.utils">Utilities</a></span></dt></dl></dd><dt><span class="section"><a href="test.html#test.special">Special Topics</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.exception.safety">

2223

Qualifying Exception Safety Guarantees

2224

2225

</a></span></dt><dd><dl><dt><span class="section"><a href="test.html#test.exception.safety.overview">Overview</a></span></dt><dt><span class="section"><a href="test.html#test.exception.safety.status">

2226

@@ -61,7 +61,7 @@

2227

in the build directory starts the build process. The <code class="literal">all</code> target comes from the <code class="filename">Makefile</code> file, which is generated via <span class="command"><strong>configure</strong></span> from the <code class="filename">Makefile.in</code> file, which is in turn generated (via

2228

<span class="command"><strong>automake</strong></span>) from the file

2229

<code class="filename">Makefile.am</code>.

2230

-</p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="build_hacking.overview.map"></a>What Comes from Where</h4></div></div></div><div class="figure"><a id="idp22035648"></a><p class="title"><strong>Figure B.1. Configure and Build File Dependencies</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/confdeps.png" align="middle" alt="Dependency Graph for Configure and Build Files" /></div></div></div><br class="figure-break" /><p>

2231

+</p></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="build_hacking.overview.map"></a>What Comes from Where</h4></div></div></div><div class="figure"><a id="idm269993497120"></a><p class="title"><strong>Figure B.1. Configure and Build File Dependencies</strong></p><div class="figure-contents"><div class="mediaobject" align="center"><img src="../images/confdeps.png" align="middle" alt="Dependency Graph for Configure and Build Files" /></div></div></div><br class="figure-break" /><p>

2232

Regenerate all generated files by using the command

2233

<code class="code">autoreconf</code> at the top level of the libstdc++ source

2234

directory.

2235

Index: libstdc++-v3/doc/html/manual/profile_mode_cost_model.html

2236

===================================================================

2237

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html (.../tags/gcc_4_8_2_release)

2238

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_cost_model.html (.../branches/gcc-4_8-branch)

2239

@@ -1,5 +1,5 @@

2240

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2241

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Empirical Cost Model</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_api.html" title="Extensions for Custom Containers" /><link rel="next" href="profile_mode_impl.html" title="Implementation Issues" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Empirical Cost Model</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_api.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_impl.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.cost_model"></a>Empirical Cost Model</h2></div></div></div><p>

2242

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Empirical Cost Model</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode_api.html" title="Extensions for Custom Containers" /><link rel="next" href="profile_mode_impl.html" title="Implementation Issues" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Empirical Cost Model</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode_api.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_impl.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.cost_model"></a>Empirical Cost Model</h2></div></div></div><p>

2243

Currently, the cost model uses formulas with predefined relative weights

2244

for alternative containers or container implementations. For instance,

2245

iterating through a vector is X times faster than iterating through a list.

2246

Index: libstdc++-v3/doc/html/manual/make.html

2247

===================================================================

2248

--- a/src/libstdc++-v3/doc/html/manual/make.html (.../tags/gcc_4_8_2_release)

2249

+++ b/src/libstdc++-v3/doc/html/manual/make.html (.../branches/gcc-4_8-branch)

2250

@@ -1,5 +1,5 @@

2251

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2252

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Make</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="setup.html" title="Chapter 2. Setup" /><link rel="prev" href="configure.html" title="Configure" /><link rel="next" href="using.html" title="Chapter 3. Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Make</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="configure.html">Prev</a> </td><th width="60%" align="center">Chapter 2. Setup</th><td width="20%" align="right"> <a accesskey="n" href="using.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.setup.make"></a>Make</h2></div></div></div><p>If you have never done this before, you should read the basic

2253

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Make</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="setup.html" title="Chapter 2. Setup" /><link rel="prev" href="configure.html" title="Configure" /><link rel="next" href="using.html" title="Chapter 3. Using" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Make</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="configure.html">Prev</a> </td><th width="60%" align="center">Chapter 2. Setup</th><td width="20%" align="right"> <a accesskey="n" href="using.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.setup.make"></a>Make</h2></div></div></div><p>If you have never done this before, you should read the basic

2254

<a class="link" href="http://gcc.gnu.org/install/" target="_top">GCC Installation

2255

Instructions</a> first. Read <span class="emphasis"><em>all of them</em></span>.

2256

<span class="emphasis"><em>Twice.</em></span>

2257

Index: libstdc++-v3/doc/html/manual/pairs.html

2258

===================================================================

2259

--- a/src/libstdc++-v3/doc/html/manual/pairs.html (.../tags/gcc_4_8_2_release)

2260

+++ b/src/libstdc++-v3/doc/html/manual/pairs.html (.../branches/gcc-4_8-branch)

2261

@@ -1,5 +1,5 @@

2262

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2263

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Pairs</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="utilities.html" title="Chapter 6. Utilities" /><link rel="prev" href="utilities.html" title="Chapter 6. Utilities" /><link rel="next" href="memory.html" title="Memory" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Pairs</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="utilities.html">Prev</a> </td><th width="60%" align="center">Chapter 6.

2264

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Pairs</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="utilities.html" title="Chapter 6. Utilities" /><link rel="prev" href="utilities.html" title="Chapter 6. Utilities" /><link rel="next" href="memory.html" title="Memory" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Pairs</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="utilities.html">Prev</a> </td><th width="60%" align="center">Chapter 6.

2265

Utilities

2266

2267

</th><td width="20%" align="right"> <a accesskey="n" href="memory.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.util.pairs"></a>Pairs</h2></div></div></div><p>The <code class="code">pair<T1,T2></code> is a simple and handy way to

2268

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

2269

===================================================================

2270

--- a/src/libstdc++-v3/doc/html/manual/test.html (.../tags/gcc_4_8_2_release)

2271

+++ b/src/libstdc++-v3/doc/html/manual/test.html (.../branches/gcc-4_8-branch)

2272

@@ -1,5 +1,5 @@

2273

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2274

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Test</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, test, testsuite, performance, conformance, ABI, exception safety" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="internals.html" title="Porting to New Hardware or Operating Systems" /><link rel="next" href="abi.html" title="ABI Policy and Guidelines" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Test</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="internals.html">Prev</a> </td><th width="60%" align="center">Appendix B.

2275

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Test</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, test, testsuite, performance, conformance, ABI, exception safety" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_porting.html" title="Appendix B. Porting and Maintenance" /><link rel="prev" href="internals.html" title="Porting to New Hardware or Operating Systems" /><link rel="next" href="abi.html" title="ABI Policy and Guidelines" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Test</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="internals.html">Prev</a> </td><th width="60%" align="center">Appendix B.

2276

Porting and Maintenance

2277

2278

</th><td width="20%" align="right"> <a accesskey="n" href="abi.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.setup.test"></a>Test</h2></div></div></div><p>

2279

@@ -492,7 +492,7 @@

2280

reporting functions including:

2281

</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: circle; "><li class="listitem"><p>time_counter</p></li><li class="listitem"><p>resource_counter</p></li><li class="listitem"><p>report_performance</p></li></ul></div></li></ul></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="test.special"></a>Special Topics</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="test.exception.safety"></a>

2282

Qualifying Exception Safety Guarantees

2283

- <a id="idp22628992" class="indexterm"></a>

2284

+ <a id="idm269992903504" class="indexterm"></a>

2285

</h4></div></div></div><div class="section"><div class="titlepage"><div><div><h5 class="title"><a id="test.exception.safety.overview"></a>Overview</h5></div></div></div><p>

2286

Testing is composed of running a particular test sequence,

2287

and looking at what happens to the surrounding code when

2288

Index: libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html

2289

===================================================================

2290

--- a/src/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html (.../tags/gcc_4_8_2_release)

2291

+++ b/src/libstdc++-v3/doc/html/manual/using_dynamic_or_shared.html (.../branches/gcc-4_8-branch)

2292

@@ -1,5 +1,5 @@

2293

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2294

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Linking</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_namespaces.html" title="Namespaces" /><link rel="next" href="using_concurrency.html" title="Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Linking</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_namespaces.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_concurrency.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.linkage"></a>Linking</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.linkage.freestanding"></a>Almost Nothing</h3></div></div></div><p>

2295

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Linking</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_namespaces.html" title="Namespaces" /><link rel="next" href="using_concurrency.html" title="Concurrency" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Linking</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_namespaces.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_concurrency.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.linkage"></a>Linking</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.linkage.freestanding"></a>Almost Nothing</h3></div></div></div><p>

2296

Or as close as it gets: freestanding. This is a minimal

2297

configuration, with only partial support for the standard

2298

library. Assume only the following header files can be used:

2299

Index: libstdc++-v3/doc/html/manual/using_headers.html

2300

===================================================================

2301

--- a/src/libstdc++-v3/doc/html/manual/using_headers.html (.../tags/gcc_4_8_2_release)

2302

+++ b/src/libstdc++-v3/doc/html/manual/using_headers.html (.../branches/gcc-4_8-branch)

2303

@@ -1,5 +1,5 @@

2304

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2305

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Headers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using.html" title="Chapter 3. Using" /><link rel="next" href="using_macros.html" title="Macros" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Headers</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_macros.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.headers"></a>Headers</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.headers.all"></a>Header Files</h3></div></div></div><p>

2306

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Headers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using.html" title="Chapter 3. Using" /><link rel="next" href="using_macros.html" title="Macros" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Headers</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_macros.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.headers"></a>Headers</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.headers.all"></a>Header Files</h3></div></div></div><p>

2307

The C++ standard specifies the entire set of header files that

2308

must be available to all hosted implementations. Actually, the

2309

word "files" is a misnomer, since the contents of the

2310

@@ -18,19 +18,19 @@

2311

the 1998 standard as updated for 2003, and the current 2011 standard.

2312

</p><p>

2313

C++98/03 include files. These are available in the default compilation mode, i.e. <code class="code">-std=c++98</code> or <code class="code">-std=gnu++98</code>.

2314

- </p><div class="table"><a id="idp13079360"></a><p class="title"><strong>Table 3.2. C++ 1998 Library Headers</strong></p><div class="table-contents"><table summary="C++ 1998 Library Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">complex</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">exception</code></td></tr><tr><td align="left"><code class="filename">fstream</code></td><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">ios</code></td><td align="left"><code class="filename">iosfwd</code></td></tr><tr><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">limits</code></td><td align="left"><code class="filename">list</code></td></tr><tr><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">numeric</code></td></tr><tr><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">stack</code></td></tr><tr><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">streambuf</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="filename">utility</code></td><td align="left"><code class="filename">typeinfo</code></td></tr><tr><td align="left"><code class="filename">valarray</code></td><td align="left"><code class="filename">vector</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idp13115840"></a><p class="title"><strong>Table 3.3. C++ 1998 Library Headers for C Library Facilities</strong></p><div class="table-contents"><table summary="C++ 1998 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">ciso646</code></td></tr><tr><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">clocale</code></td><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">csignal</code></td></tr><tr><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstddef</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cstring</code></td></tr><tr><td align="left"><code class="filename">ctime</code></td><td align="left"><code class="filename">cwchar</code></td><td align="left"><code class="filename">cwctype</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p>

2315

+ </p><div class="table"><a id="idm270002453792"></a><p class="title"><strong>Table 3.2. C++ 1998 Library Headers</strong></p><div class="table-contents"><table summary="C++ 1998 Library Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">complex</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">exception</code></td></tr><tr><td align="left"><code class="filename">fstream</code></td><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">ios</code></td><td align="left"><code class="filename">iosfwd</code></td></tr><tr><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">limits</code></td><td align="left"><code class="filename">list</code></td></tr><tr><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">numeric</code></td></tr><tr><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">stack</code></td></tr><tr><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">streambuf</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="filename">utility</code></td><td align="left"><code class="filename">typeinfo</code></td></tr><tr><td align="left"><code class="filename">valarray</code></td><td align="left"><code class="filename">vector</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idm270002417312"></a><p class="title"><strong>Table 3.3. C++ 1998 Library Headers for C Library Facilities</strong></p><div class="table-contents"><table summary="C++ 1998 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">ciso646</code></td></tr><tr><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">clocale</code></td><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">csignal</code></td></tr><tr><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstddef</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cstring</code></td></tr><tr><td align="left"><code class="filename">ctime</code></td><td align="left"><code class="filename">cwchar</code></td><td align="left"><code class="filename">cwctype</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p>

2316

C++11 include files. These are only available in C++11 compilation

2317

mode, i.e. <code class="literal">-std=c++11</code> or <code class="literal">-std=gnu++11</code>.

2318

-</p><p></p><div class="table"><a id="idp13140576"></a><p class="title"><strong>Table 3.4. C++ 2011 Library Headers</strong></p><div class="table-contents"><table summary="C++ 2011 Library Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">array</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">chrono</code></td><td align="left"><code class="filename">complex</code></td></tr><tr><td align="left"><code class="filename">condition_variable</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">exception</code></td><td align="left"><code class="filename">forward_list</code></td><td align="left"><code class="filename">fstream</code></td></tr><tr><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">future</code></td><td align="left"><code class="filename">initalizer_list</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">ios</code></td></tr><tr><td align="left"><code class="filename">iosfwd</code></td><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">limits</code></td></tr><tr><td align="left"><code class="filename">list</code></td><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">mutex</code></td></tr><tr><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">random</code></td></tr><tr><td align="left"><code class="filename">ratio</code></td><td align="left"><code class="filename">regex</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">stack</code></td></tr><tr><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">streambuf</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="filename">system_error</code></td><td align="left"><code class="filename">thread</code></td></tr><tr><td align="left"><code class="filename">tuple</code></td><td align="left"><code class="filename">type_traits</code></td><td align="left"><code class="filename">typeinfo</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="filename">unordered_set</code></td></tr><tr><td align="left"><code class="filename">utility</code></td><td align="left"><code class="filename">valarray</code></td><td align="left"><code class="filename">vector</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idp13192016"></a><p class="title"><strong>Table 3.5. C++ 2011 Library Headers for C Library Facilities</strong></p><div class="table-contents"><table summary="C++ 2011 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">ccomplex</code></td><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">cfenv</code></td></tr><tr><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">cinttypes</code></td><td align="left"><code class="filename">ciso646</code></td><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">clocale</code></td></tr><tr><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">csignal</code></td><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstdbool</code></td></tr><tr><td align="left"><code class="filename">cstddef</code></td><td align="left"><code class="filename">cstdint</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">cstring</code></td></tr><tr><td align="left"><code class="filename">ctgmath</code></td><td align="left"><code class="filename">ctime</code></td><td align="left"><code class="filename">cuchar</code></td><td align="left"><code class="filename">cwchar</code></td><td align="left"><code class="filename">cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

2319

+</p><p></p><div class="table"><a id="idm270002392576"></a><p class="title"><strong>Table 3.4. C++ 2011 Library Headers</strong></p><div class="table-contents"><table summary="C++ 2011 Library Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">algorithm</code></td><td align="left"><code class="filename">array</code></td><td align="left"><code class="filename">bitset</code></td><td align="left"><code class="filename">chrono</code></td><td align="left"><code class="filename">complex</code></td></tr><tr><td align="left"><code class="filename">condition_variable</code></td><td align="left"><code class="filename">deque</code></td><td align="left"><code class="filename">exception</code></td><td align="left"><code class="filename">forward_list</code></td><td align="left"><code class="filename">fstream</code></td></tr><tr><td align="left"><code class="filename">functional</code></td><td align="left"><code class="filename">future</code></td><td align="left"><code class="filename">initalizer_list</code></td><td align="left"><code class="filename">iomanip</code></td><td align="left"><code class="filename">ios</code></td></tr><tr><td align="left"><code class="filename">iosfwd</code></td><td align="left"><code class="filename">iostream</code></td><td align="left"><code class="filename">istream</code></td><td align="left"><code class="filename">iterator</code></td><td align="left"><code class="filename">limits</code></td></tr><tr><td align="left"><code class="filename">list</code></td><td align="left"><code class="filename">locale</code></td><td align="left"><code class="filename">map</code></td><td align="left"><code class="filename">memory</code></td><td align="left"><code class="filename">mutex</code></td></tr><tr><td align="left"><code class="filename">new</code></td><td align="left"><code class="filename">numeric</code></td><td align="left"><code class="filename">ostream</code></td><td align="left"><code class="filename">queue</code></td><td align="left"><code class="filename">random</code></td></tr><tr><td align="left"><code class="filename">ratio</code></td><td align="left"><code class="filename">regex</code></td><td align="left"><code class="filename">set</code></td><td align="left"><code class="filename">sstream</code></td><td align="left"><code class="filename">stack</code></td></tr><tr><td align="left"><code class="filename">stdexcept</code></td><td align="left"><code class="filename">streambuf</code></td><td align="left"><code class="filename">string</code></td><td align="left"><code class="filename">system_error</code></td><td align="left"><code class="filename">thread</code></td></tr><tr><td align="left"><code class="filename">tuple</code></td><td align="left"><code class="filename">type_traits</code></td><td align="left"><code class="filename">typeinfo</code></td><td align="left"><code class="filename">unordered_map</code></td><td align="left"><code class="filename">unordered_set</code></td></tr><tr><td align="left"><code class="filename">utility</code></td><td align="left"><code class="filename">valarray</code></td><td align="left"><code class="filename">vector</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idm270002341136"></a><p class="title"><strong>Table 3.5. C++ 2011 Library Headers for C Library Facilities</strong></p><div class="table-contents"><table summary="C++ 2011 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">cassert</code></td><td align="left"><code class="filename">ccomplex</code></td><td align="left"><code class="filename">cctype</code></td><td align="left"><code class="filename">cerrno</code></td><td align="left"><code class="filename">cfenv</code></td></tr><tr><td align="left"><code class="filename">cfloat</code></td><td align="left"><code class="filename">cinttypes</code></td><td align="left"><code class="filename">ciso646</code></td><td align="left"><code class="filename">climits</code></td><td align="left"><code class="filename">clocale</code></td></tr><tr><td align="left"><code class="filename">cmath</code></td><td align="left"><code class="filename">csetjmp</code></td><td align="left"><code class="filename">csignal</code></td><td align="left"><code class="filename">cstdarg</code></td><td align="left"><code class="filename">cstdbool</code></td></tr><tr><td align="left"><code class="filename">cstddef</code></td><td align="left"><code class="filename">cstdint</code></td><td align="left"><code class="filename">cstdlib</code></td><td align="left"><code class="filename">cstdio</code></td><td align="left"><code class="filename">cstring</code></td></tr><tr><td align="left"><code class="filename">ctgmath</code></td><td align="left"><code class="filename">ctime</code></td><td align="left"><code class="filename">cuchar</code></td><td align="left"><code class="filename">cwchar</code></td><td align="left"><code class="filename">cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

2320

In addition, TR1 includes as:

2321

-</p><div class="table"><a id="idp13221904"></a><p class="title"><strong>Table 3.6. C++ TR 1 Library Headers</strong></p><div class="table-contents"><table summary="C++ TR 1 Library Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/array</code></td><td align="left"><code class="filename">tr1/complex</code></td><td align="left"><code class="filename">tr1/memory</code></td><td align="left"><code class="filename">tr1/functional</code></td><td align="left"><code class="filename">tr1/random</code></td></tr><tr><td align="left"><code class="filename">tr1/regex</code></td><td align="left"><code class="filename">tr1/tuple</code></td><td align="left"><code class="filename">tr1/type_traits</code></td><td align="left"><code class="filename">tr1/unordered_map</code></td><td align="left"><code class="filename">tr1/unordered_set</code></td></tr><tr><td align="left"><code class="filename">tr1/utility</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idp13238832"></a><p class="title"><strong>Table 3.7. C++ TR 1 Library Headers for C Library Facilities</strong></p><div class="table-contents"><table summary="C++ TR 1 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/ccomplex</code></td><td align="left"><code class="filename">tr1/cfenv</code></td><td align="left"><code class="filename">tr1/cfloat</code></td><td align="left"><code class="filename">tr1/cmath</code></td><td align="left"><code class="filename">tr1/cinttypes</code></td></tr><tr><td align="left"><code class="filename">tr1/climits</code></td><td align="left"><code class="filename">tr1/cstdarg</code></td><td align="left"><code class="filename">tr1/cstdbool</code></td><td align="left"><code class="filename">tr1/cstdint</code></td><td align="left"><code class="filename">tr1/cstdio</code></td></tr><tr><td align="left"><code class="filename">tr1/cstdlib</code></td><td align="left"><code class="filename">tr1/ctgmath</code></td><td align="left"><code class="filename">tr1/ctime</code></td><td align="left"><code class="filename">tr1/cwchar</code></td><td align="left"><code class="filename">tr1/cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>Decimal floating-point arithmetic is available if the C++

2322

+</p><div class="table"><a id="idm270002311248"></a><p class="title"><strong>Table 3.6. C++ TR 1 Library Headers</strong></p><div class="table-contents"><table summary="C++ TR 1 Library Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/array</code></td><td align="left"><code class="filename">tr1/complex</code></td><td align="left"><code class="filename">tr1/memory</code></td><td align="left"><code class="filename">tr1/functional</code></td><td align="left"><code class="filename">tr1/random</code></td></tr><tr><td align="left"><code class="filename">tr1/regex</code></td><td align="left"><code class="filename">tr1/tuple</code></td><td align="left"><code class="filename">tr1/type_traits</code></td><td align="left"><code class="filename">tr1/unordered_map</code></td><td align="left"><code class="filename">tr1/unordered_set</code></td></tr><tr><td align="left"><code class="filename">tr1/utility</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idm270002294320"></a><p class="title"><strong>Table 3.7. C++ TR 1 Library Headers for C Library Facilities</strong></p><div class="table-contents"><table summary="C++ TR 1 Library Headers for C Library Facilities" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">tr1/ccomplex</code></td><td align="left"><code class="filename">tr1/cfenv</code></td><td align="left"><code class="filename">tr1/cfloat</code></td><td align="left"><code class="filename">tr1/cmath</code></td><td align="left"><code class="filename">tr1/cinttypes</code></td></tr><tr><td align="left"><code class="filename">tr1/climits</code></td><td align="left"><code class="filename">tr1/cstdarg</code></td><td align="left"><code class="filename">tr1/cstdbool</code></td><td align="left"><code class="filename">tr1/cstdint</code></td><td align="left"><code class="filename">tr1/cstdio</code></td></tr><tr><td align="left"><code class="filename">tr1/cstdlib</code></td><td align="left"><code class="filename">tr1/ctgmath</code></td><td align="left"><code class="filename">tr1/ctime</code></td><td align="left"><code class="filename">tr1/cwchar</code></td><td align="left"><code class="filename">tr1/cwctype</code></td></tr></tbody></table></div></div><br class="table-break" /><p>Decimal floating-point arithmetic is available if the C++

2323

compiler supports scalar decimal floating-point types defined via

2324

<code class="code">__attribute__((mode(SD|DD|LD)))</code>.

2325

-</p><div class="table"><a id="idp13259904"></a><p class="title"><strong>Table 3.8. C++ TR 24733 Decimal Floating-Point Header</strong></p><div class="table-contents"><table summary="C++ TR 24733 Decimal Floating-Point Header" border="1"><colgroup><col align="left" class="c1" /></colgroup><tbody><tr><td align="left"><code class="filename">decimal/decimal</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

2326

+</p><div class="table"><a id="idm270002273248"></a><p class="title"><strong>Table 3.8. C++ TR 24733 Decimal Floating-Point Header</strong></p><div class="table-contents"><table summary="C++ TR 24733 Decimal Floating-Point Header" border="1"><colgroup><col align="left" class="c1" /></colgroup><tbody><tr><td align="left"><code class="filename">decimal/decimal</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

2327

Also included are files for the C++ ABI interface:

2328

-</p><div class="table"><a id="idp13265424"></a><p class="title"><strong>Table 3.9. C++ ABI Headers</strong></p><div class="table-contents"><table summary="C++ ABI Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><tbody><tr><td align="left"><code class="filename">cxxabi.h</code></td><td align="left"><code class="filename">cxxabi_forced.h</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

2329

+</p><div class="table"><a id="idm270002267728"></a><p class="title"><strong>Table 3.9. C++ ABI Headers</strong></p><div class="table-contents"><table summary="C++ ABI Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><tbody><tr><td align="left"><code class="filename">cxxabi.h</code></td><td align="left"><code class="filename">cxxabi_forced.h</code></td></tr></tbody></table></div></div><br class="table-break" /><p>

2330

And a large variety of extensions.

2331

-</p><div class="table"><a id="idp13271824"></a><p class="title"><strong>Table 3.10. Extension Headers</strong></p><div class="table-contents"><table summary="Extension Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">ext/algorithm</code></td><td align="left"><code class="filename">ext/atomicity.h</code></td><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"><code class="filename">ext/cast.h</code></td></tr><tr><td align="left"><code class="filename">ext/codecvt_specializations.h</code></td><td align="left"><code class="filename">ext/concurrence.h</code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="filename">ext/enc_filebuf.h</code></td><td align="left"><code class="filename">ext/extptr_allocator.h</code></td></tr><tr><td align="left"><code class="filename">ext/functional</code></td><td align="left"><code class="filename">ext/iterator</code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="filename">ext/memory</code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td></tr><tr><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="filename">ext/numeric</code></td><td align="left"><code class="filename">ext/numeric_traits.h</code></td><td align="left"><code class="filename">ext/pb_ds/assoc_container.h</code></td><td align="left"><code class="filename">ext/pb_ds/priority_queue.h</code></td></tr><tr><td align="left"><code class="filename">ext/pod_char_traits.h</code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="filename">ext/rb_tree</code></td><td align="left"><code class="filename">ext/rope</code></td><td align="left"><code class="filename">ext/slist</code></td></tr><tr><td align="left"><code class="filename">ext/stdio_filebuf.h</code></td><td align="left"><code class="filename">ext/stdio_sync_filebuf.h</code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td><td align="left"><code class="filename">ext/typelist.h</code></td><td align="left"><code class="filename">ext/type_traits.h</code></td></tr><tr><td align="left"><code class="filename">ext/vstring.h</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idp13307552"></a><p class="title"><strong>Table 3.11. Extension Debug Headers</strong></p><div class="table-contents"><table summary="Extension Debug Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">debug/bitset</code></td><td align="left"><code class="filename">debug/deque</code></td><td align="left"><code class="filename">debug/list</code></td><td align="left"><code class="filename">debug/map</code></td><td align="left"><code class="filename">debug/set</code></td></tr><tr><td align="left"><code class="filename">debug/string</code></td><td align="left"><code class="filename">debug/unordered_map</code></td><td align="left"><code class="filename">debug/unordered_set</code></td><td align="left"><code class="filename">debug/vector</code></td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idp13322320"></a><p class="title"><strong>Table 3.12. Extension Profile Headers</strong></p><div class="table-contents"><table summary="Extension Profile Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><tbody><tr><td align="left"><code class="filename">profile/bitset</code></td><td align="left"><code class="filename">profile/deque</code></td><td align="left"><code class="filename">profile/list</code></td><td align="left"><code class="filename">profile/map</code></td></tr><tr><td align="left"><code class="filename">profile/set</code></td><td align="left"><code class="filename">profile/unordered_map</code></td><td align="left"><code class="filename">profile/unordered_set</code></td><td align="left"><code class="filename">profile/vector</code></td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idp13335696"></a><p class="title"><strong>Table 3.13. Extension Parallel Headers</strong></p><div class="table-contents"><table summary="Extension Parallel Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><tbody><tr><td align="left"><code class="filename">parallel/algorithm</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr></tbody></table></div></div><br class="table-break" /></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.headers.mixing"></a>Mixing Headers</h3></div></div></div><p> A few simple rules.

2332

+</p><div class="table"><a id="idm270002261328"></a><p class="title"><strong>Table 3.10. Extension Headers</strong></p><div class="table-contents"><table summary="Extension Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">ext/algorithm</code></td><td align="left"><code class="filename">ext/atomicity.h</code></td><td align="left"><code class="filename">ext/array_allocator.h</code></td><td align="left"><code class="filename">ext/bitmap_allocator.h</code></td><td align="left"><code class="filename">ext/cast.h</code></td></tr><tr><td align="left"><code class="filename">ext/codecvt_specializations.h</code></td><td align="left"><code class="filename">ext/concurrence.h</code></td><td align="left"><code class="filename">ext/debug_allocator.h</code></td><td align="left"><code class="filename">ext/enc_filebuf.h</code></td><td align="left"><code class="filename">ext/extptr_allocator.h</code></td></tr><tr><td align="left"><code class="filename">ext/functional</code></td><td align="left"><code class="filename">ext/iterator</code></td><td align="left"><code class="filename">ext/malloc_allocator.h</code></td><td align="left"><code class="filename">ext/memory</code></td><td align="left"><code class="filename">ext/mt_allocator.h</code></td></tr><tr><td align="left"><code class="filename">ext/new_allocator.h</code></td><td align="left"><code class="filename">ext/numeric</code></td><td align="left"><code class="filename">ext/numeric_traits.h</code></td><td align="left"><code class="filename">ext/pb_ds/assoc_container.h</code></td><td align="left"><code class="filename">ext/pb_ds/priority_queue.h</code></td></tr><tr><td align="left"><code class="filename">ext/pod_char_traits.h</code></td><td align="left"><code class="filename">ext/pool_allocator.h</code></td><td align="left"><code class="filename">ext/rb_tree</code></td><td align="left"><code class="filename">ext/rope</code></td><td align="left"><code class="filename">ext/slist</code></td></tr><tr><td align="left"><code class="filename">ext/stdio_filebuf.h</code></td><td align="left"><code class="filename">ext/stdio_sync_filebuf.h</code></td><td align="left"><code class="filename">ext/throw_allocator.h</code></td><td align="left"><code class="filename">ext/typelist.h</code></td><td align="left"><code class="filename">ext/type_traits.h</code></td></tr><tr><td align="left"><code class="filename">ext/vstring.h</code></td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idm270002225600"></a><p class="title"><strong>Table 3.11. Extension Debug Headers</strong></p><div class="table-contents"><table summary="Extension Debug Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /><col align="left" class="c5" /></colgroup><tbody><tr><td align="left"><code class="filename">debug/bitset</code></td><td align="left"><code class="filename">debug/deque</code></td><td align="left"><code class="filename">debug/list</code></td><td align="left"><code class="filename">debug/map</code></td><td align="left"><code class="filename">debug/set</code></td></tr><tr><td align="left"><code class="filename">debug/string</code></td><td align="left"><code class="filename">debug/unordered_map</code></td><td align="left"><code class="filename">debug/unordered_set</code></td><td align="left"><code class="filename">debug/vector</code></td><td class="auto-generated"> </td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idm270002210832"></a><p class="title"><strong>Table 3.12. Extension Profile Headers</strong></p><div class="table-contents"><table summary="Extension Profile Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /><col align="left" class="c3" /><col align="left" class="c4" /></colgroup><tbody><tr><td align="left"><code class="filename">profile/bitset</code></td><td align="left"><code class="filename">profile/deque</code></td><td align="left"><code class="filename">profile/list</code></td><td align="left"><code class="filename">profile/map</code></td></tr><tr><td align="left"><code class="filename">profile/set</code></td><td align="left"><code class="filename">profile/unordered_map</code></td><td align="left"><code class="filename">profile/unordered_set</code></td><td align="left"><code class="filename">profile/vector</code></td></tr></tbody></table></div></div><br class="table-break" /><p></p><div class="table"><a id="idm270002197456"></a><p class="title"><strong>Table 3.13. Extension Parallel Headers</strong></p><div class="table-contents"><table summary="Extension Parallel Headers" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><tbody><tr><td align="left"><code class="filename">parallel/algorithm</code></td><td align="left"><code class="filename">parallel/numeric</code></td></tr></tbody></table></div></div><br class="table-break" /></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.headers.mixing"></a>Mixing Headers</h3></div></div></div><p> A few simple rules.

2333

</p><p>First, mixing different dialects of the standard headers is not

2334

possible. It's an all-or-nothing affair. Thus, code like

2335

</p><pre class="programlisting">

2336

Index: libstdc++-v3/doc/html/manual/using_namespaces.html

2337

===================================================================

2338

--- a/src/libstdc++-v3/doc/html/manual/using_namespaces.html (.../tags/gcc_4_8_2_release)

2339

+++ b/src/libstdc++-v3/doc/html/manual/using_namespaces.html (.../branches/gcc-4_8-branch)

2340

@@ -1,5 +1,5 @@

2341

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2342

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Namespaces</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_macros.html" title="Macros" /><link rel="next" href="using_dynamic_or_shared.html" title="Linking" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Namespaces</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_macros.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_dynamic_or_shared.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.namespaces"></a>Namespaces</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.namespaces.all"></a>Available Namespaces</h3></div></div></div><p> There are three main namespaces.

2343

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Namespaces</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_macros.html" title="Macros" /><link rel="next" href="using_dynamic_or_shared.html" title="Linking" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Namespaces</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_macros.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_dynamic_or_shared.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.namespaces"></a>Namespaces</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.intro.using.namespaces.all"></a>Available Namespaces</h3></div></div></div><p> There are three main namespaces.

2344

</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>std</p><p>The ISO C++ standards specify that "all library entities are defined

2345

within namespace std." This includes namespaces nested

2346

within <code class="code">namespace std</code>, such as <code class="code">namespace

2347

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

2348

===================================================================

2349

--- a/src/libstdc++-v3/doc/html/manual/debug.html (.../tags/gcc_4_8_2_release)

2350

+++ b/src/libstdc++-v3/doc/html/manual/debug.html (.../branches/gcc-4_8-branch)

2351

@@ -1,5 +1,5 @@

2352

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2353

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Debugging Support</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_exceptions.html" title="Exceptions" /><link rel="next" href="std_contents.html" title="Part II. Standard Contents" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Debugging Support</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_exceptions.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="std_contents.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.debug"></a>Debugging Support</h2></div></div></div><p>

2354

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Debugging Support</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_exceptions.html" title="Exceptions" /><link rel="next" href="std_contents.html" title="Part II. Standard Contents" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Debugging Support</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_exceptions.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="std_contents.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.debug"></a>Debugging Support</h2></div></div></div><p>

2355

There are numerous things that can be done to improve the ease with

2356

which C++ binaries are debugged when using the GNU tool chain. Here

2357

are some of them.

2358

@@ -161,7 +161,7 @@

2359

DRD</a>,

2360

2361

Helgrind</a>, and

2362

- <a class="link" href="http://code.google.com/p/data-race-test" target="_top">

2363

+ <a class="link" href="http://code.google.com/p/data-race-test/" target="_top">

2364

ThreadSanitizer</a>.

2365

</p><p>

2366

With DRD, Helgrind and ThreadSanitizer you will need to define

2367

Index: libstdc++-v3/doc/html/manual/localization.html

2368

===================================================================

2369

--- a/src/libstdc++-v3/doc/html/manual/localization.html (.../tags/gcc_4_8_2_release)

2370

+++ b/src/libstdc++-v3/doc/html/manual/localization.html (.../branches/gcc-4_8-branch)

2371

@@ -1,13 +1,13 @@

2372

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2373

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 8. Localization</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="strings.html" title="Chapter 7. Strings" /><link rel="next" href="facets.html" title="Facets" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 8.

2374

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 8. Localization</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="strings.html" title="Chapter 7. Strings" /><link rel="next" href="facets.html" title="Facets" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 8.

2375

Localization

2376

2377

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="strings.html">Prev</a> </td><th width="60%" align="center">Part II.

2378

Standard Contents

2379

</th><td width="20%" align="right"> <a accesskey="n" href="facets.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.localization"></a>Chapter 8.

2380

Localization

2381

- <a id="idp15701088" class="indexterm"></a>

2382

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#idp15778336">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.localization.locales"></a>Locales</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.localization.locales.locale"></a>locale</h3></div></div></div><p>

2383

+ <a id="idm269999830208" class="indexterm"></a>

2384

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#idm269999753024">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.localization.locales"></a>Locales</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="std.localization.locales.locale"></a>locale</h3></div></div></div><p>

2385

Describes the basic locale object, including nested

2386

classes id, facet, and the reference-counted implementation object,

2387

class _Impl.

2388

@@ -402,29 +402,29 @@

2389

What should non-required facet instantiations do? If the

2390

generic implementation is provided, then how to end-users

2391

provide specializations?

2392

- </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="locales.locale.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idp15744064"></a><p><span class="citetitle"><em class="citetitle">

2393

+ </p></li></ul></div></div><div class="bibliography"><div class="titlepage"><div><div><h4 class="title"><a id="locales.locale.biblio"></a>Bibliography</h4></div></div></div><div class="biblioentry"><a id="idm269999787232"></a><p><span class="citetitle"><em class="citetitle">

2394

The GNU C Library

2395

</em>. </span><span class="author"><span class="firstname">Roland</span> <span class="surname">McGrath</span>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2007 FSF. </span><span class="pagenums">

2396

Chapters 6 Character Set Handling and 7 Locales and

2397

Internationalization

2398

- . </span></p></div><div class="biblioentry"><a id="idp15748832"></a><p><span class="citetitle"><em class="citetitle">

2399

+ . </span></p></div><div class="biblioentry"><a id="idm269999782464"></a><p><span class="citetitle"><em class="citetitle">

2400

Correspondence

2401

- </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idp15751920"></a><p><span class="citetitle"><em class="citetitle">

2402

+ </em>. </span><span class="author"><span class="firstname">Ulrich</span> <span class="surname">Drepper</span>. </span><span class="copyright">Copyright © 2002 . </span></p></div><div class="biblioentry"><a id="idm269999779376"></a><p><span class="citetitle"><em class="citetitle">

2403

ISO/IEC 14882:1998 Programming languages - C++

2404

2405

2406

ISO/IEC 9899:1999 Programming languages - C

2407

2408

2409

2410

System Interface Definitions, Issue 7 (IEEE Std. 1003.1-2008)

2411

</a>

2412

2413

The Open Group/The Institute of Electrical and Electronics

2414

Engineers, Inc.

2415

- . </span></p></div><div class="biblioentry"><a id="idp15759712"></a><p><span class="citetitle"><em class="citetitle">

2416

+ . </span></p></div><div class="biblioentry"><a id="idm269999771584"></a><p><span class="citetitle"><em class="citetitle">

2417

The C++ Programming Language, Special Edition

2418

</em>. </span><span class="author"><span class="firstname">Bjarne</span> <span class="surname">Stroustrup</span>. </span><span class="copyright">Copyright © 2000 Addison Wesley, Inc.. </span><span class="pagenums">Appendix D. </span><span class="publisher"><span class="publishername">

2419

Addison Wesley

2420

- . </span></span></p></div><div class="biblioentry"><a id="idp15764336"></a><p><span class="citetitle"><em class="citetitle">

2421

+ . </span></span></p></div><div class="biblioentry"><a id="idm269999766960"></a><p><span class="citetitle"><em class="citetitle">

2422

Standard C++ IOStreams and Locales

2423

</em>. </span><span class="subtitle">

2424

Advanced Programmer's Guide and Reference

2425

Index: libstdc++-v3/doc/html/manual/ext_algorithms.html

2426

===================================================================

2427

--- a/src/libstdc++-v3/doc/html/manual/ext_algorithms.html (.../tags/gcc_4_8_2_release)

2428

+++ b/src/libstdc++-v3/doc/html/manual/ext_algorithms.html (.../branches/gcc-4_8-branch)

2429

@@ -1,5 +1,5 @@

2430

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2431

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 25. Algorithms</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_utilities.html" title="Chapter 24. Utilities" /><link rel="next" href="ext_numerics.html" title="Chapter 26. Numerics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 25. Algorithms</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_utilities.html">Prev</a> </td><th width="60%" align="center">Part III.

2432

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 25. Algorithms</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_utilities.html" title="Chapter 24. Utilities" /><link rel="next" href="ext_numerics.html" title="Chapter 26. Numerics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 25. Algorithms</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_utilities.html">Prev</a> </td><th width="60%" align="center">Part III.

2433

Extensions

2434

2435

</th><td width="20%" align="right"> <a accesskey="n" href="ext_numerics.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.algorithms"></a>Chapter 25. Algorithms</h2></div></div></div><p>25.1.6 (count, count_if) is extended with two more versions of count

2436

Index: libstdc++-v3/doc/html/manual/debug_mode.html

2437

===================================================================

2438

--- a/src/libstdc++-v3/doc/html/manual/debug_mode.html (.../tags/gcc_4_8_2_release)

2439

+++ b/src/libstdc++-v3/doc/html/manual/debug_mode.html (.../branches/gcc-4_8-branch)

2440

@@ -1,8 +1,8 @@

2441

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2442

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 17. Debug Mode</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_compile_checks.html" title="Chapter 16. Compile Time Checks" /><link rel="next" href="debug_mode_semantics.html" title="Semantics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 17. Debug Mode</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_compile_checks.html">Prev</a> </td><th width="60%" align="center">Part III.

2443

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 17. Debug Mode</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, debug" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="extensions.html" title="Part III. Extensions" /><link rel="prev" href="ext_compile_checks.html" title="Chapter 16. Compile Time Checks" /><link rel="next" href="debug_mode_semantics.html" title="Semantics" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 17. Debug Mode</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="ext_compile_checks.html">Prev</a> </td><th width="60%" align="center">Part III.

2444

Extensions

2445

2446

-</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode_semantics.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.debug_mode"></a>Chapter 17. Debug Mode</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="debug_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="debug_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.goals">Goals</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods">Methods</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.wrappers">The Wrapper Model</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_iter">Safe Iterators</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_seq">Safe Sequences (Containers)</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.precond">Precondition Checking</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.coexistence">Release- and debug-mode coexistence</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.compile">Compile-time coexistence of release- and debug-mode components</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.link">Link- and run-time coexistence of release- and

2447

+</th><td width="20%" align="right"> <a accesskey="n" href="debug_mode_semantics.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="manual.ext.debug_mode"></a>Chapter 17. Debug Mode</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="debug_mode.html#manual.ext.debug_mode.intro">Intro</a></span></dt><dt><span class="section"><a href="debug_mode_semantics.html">Semantics</a></span></dt><dt><span class="section"><a href="debug_mode_using.html">Using</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.mode">Using the Debug Mode</a></span></dt><dt><span class="section"><a href="debug_mode_using.html#debug_mode.using.specific">Using a Specific Debug Container</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html">Design</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.goals">Goals</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods">Methods</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.wrappers">The Wrapper Model</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_iter">Safe Iterators</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.safe_seq">Safe Sequences (Containers)</a></span></dt></dl></dd><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.precond">Precondition Checking</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.methods.coexistence">Release- and debug-mode coexistence</a></span></dt><dd><dl><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.compile">Compile-time coexistence of release- and debug-mode components</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.link">Link- and run-time coexistence of release- and

2448

debug-mode components</a></span></dt><dt><span class="section"><a href="debug_mode_design.html#methods.coexistence.alt">Alternatives for Coexistence</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug_mode_design.html#debug_mode.design.other">Other Implementations</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.debug_mode.intro"></a>Intro</h2></div></div></div><p>

2449

By default, libstdc++ is built with efficiency in mind, and

2450

therefore performs little or no error checking that is not

2451

Index: libstdc++-v3/doc/html/manual/profile_mode_design.html

2452

===================================================================

2453

--- a/src/libstdc++-v3/doc/html/manual/profile_mode_design.html (.../tags/gcc_4_8_2_release)

2454

+++ b/src/libstdc++-v3/doc/html/manual/profile_mode_design.html (.../branches/gcc-4_8-branch)

2455

@@ -1,6 +1,6 @@

2456

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2457

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="next" href="profile_mode_api.html" title="Extensions for Custom Containers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_api.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.design"></a>Design</h2></div></div></div><p>

2458

-</p><div class="table"><a id="idp16981200"></a><p class="title"><strong>Table 19.1. Profile Code Location</strong></p><div class="table-contents"><table summary="Profile Code Location" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">Code Location</th><th align="left">Use</th></tr></thead><tbody><tr><td align="left"><code class="code">libstdc++-v3/include/std/*</code></td><td align="left">Preprocessor code to redirect to profile extension headers.</td></tr><tr><td align="left"><code class="code">libstdc++-v3/include/profile/*</code></td><td align="left">Profile extension public headers (map, vector, ...).</td></tr><tr><td align="left"><code class="code">libstdc++-v3/include/profile/impl/*</code></td><td align="left">Profile extension internals. Implementation files are

2459

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Design</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="C++, library, profile" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="prev" href="profile_mode.html" title="Chapter 19. Profile Mode" /><link rel="next" href="profile_mode_api.html" title="Extensions for Custom Containers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Design</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="profile_mode.html">Prev</a> </td><th width="60%" align="center">Chapter 19. Profile Mode</th><td width="20%" align="right"> <a accesskey="n" href="profile_mode_api.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.ext.profile_mode.design"></a>Design</h2></div></div></div><p>

2460

+</p><div class="table"><a id="idm269998550064"></a><p class="title"><strong>Table 19.1. Profile Code Location</strong></p><div class="table-contents"><table summary="Profile Code Location" border="1"><colgroup><col align="left" class="c1" /><col align="left" class="c2" /></colgroup><thead><tr><th align="left">Code Location</th><th align="left">Use</th></tr></thead><tbody><tr><td align="left"><code class="code">libstdc++-v3/include/std/*</code></td><td align="left">Preprocessor code to redirect to profile extension headers.</td></tr><tr><td align="left"><code class="code">libstdc++-v3/include/profile/*</code></td><td align="left">Profile extension public headers (map, vector, ...).</td></tr><tr><td align="left"><code class="code">libstdc++-v3/include/profile/impl/*</code></td><td align="left">Profile extension internals. Implementation files are

2461

only included from <code class="code">impl/profiler.h</code>, which is the only

2462

file included from the public headers.</td></tr></tbody></table></div></div><br class="table-break" /><p>

2463

</p><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="manual.ext.profile_mode.design.wrapper"></a>Wrapper Model</h3></div></div></div><p>

2464

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

2465

===================================================================

2466

--- a/src/libstdc++-v3/doc/html/manual/using_concurrency.html (.../tags/gcc_4_8_2_release)

2467

+++ b/src/libstdc++-v3/doc/html/manual/using_concurrency.html (.../branches/gcc-4_8-branch)

2468

@@ -1,5 +1,5 @@

2469

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2470

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Concurrency</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_dynamic_or_shared.html" title="Linking" /><link rel="next" href="using_exceptions.html" title="Exceptions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Concurrency</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_dynamic_or_shared.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_exceptions.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.concurrency"></a>Concurrency</h2></div></div></div><p>This section discusses issues surrounding the proper compilation

2471

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Concurrency</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="using.html" title="Chapter 3. Using" /><link rel="prev" href="using_dynamic_or_shared.html" title="Linking" /><link rel="next" href="using_exceptions.html" title="Exceptions" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Concurrency</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="using_dynamic_or_shared.html">Prev</a> </td><th width="60%" align="center">Chapter 3. Using</th><td width="20%" align="right"> <a accesskey="n" href="using_exceptions.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="manual.intro.using.concurrency"></a>Concurrency</h2></div></div></div><p>This section discusses issues surrounding the proper compilation

2472

of multithreaded applications which use the Standard C++

2473

library. This information is GCC-specific since the C++

2474

standard does not address matters of multithreaded applications.

2475

Index: libstdc++-v3/doc/html/manual/mt_allocator_impl.html

2476

===================================================================

2477

--- a/src/libstdc++-v3/doc/html/manual/mt_allocator_impl.html (.../tags/gcc_4_8_2_release)

2478

+++ b/src/libstdc++-v3/doc/html/manual/mt_allocator_impl.html (.../branches/gcc-4_8-branch)

2479

@@ -1,5 +1,5 @@

2480

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2481

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator_design.html" title="Design Issues" /><link rel="next" href="mt_allocator_ex_single.html" title="Single Thread Example" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_design.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_ex_single.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.impl"></a>Implementation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.mt.tune"></a>Tunable Parameters</h3></div></div></div><p>Certain allocation parameters can be modified, or tuned. There

2482

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Implementation</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, allocator" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="mt_allocator.html" title="Chapter 20. The mt_allocator" /><link rel="prev" href="mt_allocator_design.html" title="Design Issues" /><link rel="next" href="mt_allocator_ex_single.html" title="Single Thread Example" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Implementation</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="mt_allocator_design.html">Prev</a> </td><th width="60%" align="center">Chapter 20. The mt_allocator</th><td width="20%" align="right"> <a accesskey="n" href="mt_allocator_ex_single.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="allocator.mt.impl"></a>Implementation</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="allocator.mt.tune"></a>Tunable Parameters</h3></div></div></div><p>Certain allocation parameters can be modified, or tuned. There

2483

exists a nested <code class="code">struct __pool_base::_Tune</code> that contains all

2484

these parameters, which include settings for

2485

</p><div class="itemizedlist"><ul class="itemizedlist" style="list-style-type: disc; "><li class="listitem"><p>Alignment</p></li><li class="listitem"><p>Maximum bytes before calling <code class="code">::operator new</code> directly</p></li><li class="listitem"><p>Minimum bytes</p></li><li class="listitem"><p>Size of underlying global allocations</p></li><li class="listitem"><p>Maximum number of supported threads</p></li><li class="listitem"><p>Migration of deallocations to the global free list</p></li><li class="listitem"><p>Shunt for global <code class="code">new</code> and <code class="code">delete</code></p></li></ul></div><p>Adjusting parameters for a given instance of an allocator can only

2486

Index: libstdc++-v3/doc/html/manual/appendix_gfdl.html

2487

===================================================================

2488

--- a/src/libstdc++-v3/doc/html/manual/appendix_gfdl.html (.../tags/gcc_4_8_2_release)

2489

+++ b/src/libstdc++-v3/doc/html/manual/appendix_gfdl.html (.../branches/gcc-4_8-branch)

2490

@@ -1,5 +1,5 @@

2491

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2492

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix E. GNU Free Documentation License</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="appendix_gpl.html" title="Appendix D. GNU General Public License version 3" /><link rel="next" href="../bk02.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix E. GNU Free Documentation License</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_gpl.html">Prev</a> </td><th width="60%" align="center">Part IV.

2493

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix E. GNU Free Documentation License</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="appendix_gpl.html" title="Appendix D. GNU General Public License version 3" /><link rel="next" href="../bk02.html" title="" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix E. GNU Free Documentation License</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_gpl.html">Prev</a> </td><th width="60%" align="center">Part IV.

2494

Appendices

2495

</th><td width="20%" align="right"> <a accesskey="n" href="../bk02.html">Next</a></td></tr></table><hr /></div><div class="appendix"><div class="titlepage"><div><div><h1 class="title"><a id="appendix.gfdl-1.3"></a>GNU Free Documentation License</h1></div></div></div><p>Version 1.3, 3 November 2008</p><p>

2496

2497

Index: libstdc++-v3/doc/html/manual/containers.html

2498

===================================================================

2499

--- a/src/libstdc++-v3/doc/html/manual/containers.html (.../tags/gcc_4_8_2_release)

2500

+++ b/src/libstdc++-v3/doc/html/manual/containers.html (.../branches/gcc-4_8-branch)

2501

@@ -1,13 +1,13 @@

2502

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2503

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 9. Containers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="facets.html" title="Facets" /><link rel="next" href="associative.html" title="Associative" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 9.

2504

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 9. Containers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="facets.html" title="Facets" /><link rel="next" href="associative.html" title="Associative" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 9.

2505

Containers

2506

2507

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="facets.html">Prev</a> </td><th width="60%" align="center">Part II.

2508

Standard Contents

2509

</th><td width="20%" align="right"> <a accesskey="n" href="associative.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.containers"></a>Chapter 9.

2510

Containers

2511

- <a id="idp16037808" class="indexterm"></a>

2512

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="containers.html#std.containers.sequences">Sequences</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="section"><a href="containers.html#containers.sequences.vector">vector</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="associative.html">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="section"><a href="associative.html#containers.associative.bitset">bitset</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="section"><a href="associative.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="unordered_associative.html">Unordered Associative</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.hash">Hash Code</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.cache">Hash Code Caching Policy</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="containers_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="containers_and_c.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.containers.sequences"></a>Sequences</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="containers.sequences.list"></a>list</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="sequences.list.size"></a>list::size() is O(n)</h4></div></div></div><p>

2513

+ <a id="idm269999493408" class="indexterm"></a>

2514

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="containers.html#std.containers.sequences">Sequences</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="section"><a href="containers.html#containers.sequences.vector">vector</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="associative.html">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="section"><a href="associative.html#containers.associative.bitset">bitset</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="section"><a href="associative.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="unordered_associative.html">Unordered Associative</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.hash">Hash Code</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.cache">Hash Code Caching Policy</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="containers_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="containers_and_c.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.containers.sequences"></a>Sequences</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="containers.sequences.list"></a>list</h3></div></div></div><div class="section"><div class="titlepage"><div><div><h4 class="title"><a id="sequences.list.size"></a>list::size() is O(n)</h4></div></div></div><p>

2515

Yes it is, and that's okay. This is a decision that we preserved

2516

when we imported SGI's STL implementation. The following is

2517

quoted from <a class="link" href="http://www.sgi.com/tech/stl/FAQ.html" target="_top">their FAQ</a>:

2518

Index: libstdc++-v3/doc/html/manual/io.html

2519

===================================================================

2520

--- a/src/libstdc++-v3/doc/html/manual/io.html (.../tags/gcc_4_8_2_release)

2521

+++ b/src/libstdc++-v3/doc/html/manual/io.html (.../branches/gcc-4_8-branch)

2522

@@ -1,13 +1,13 @@

2523

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2524

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 13. Input and Output</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="numerics_and_c.html" title="Interacting with C" /><link rel="next" href="streambufs.html" title="Stream Buffers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 13.

2525

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 13. Input and Output</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="numerics_and_c.html" title="Interacting with C" /><link rel="next" href="streambufs.html" title="Stream Buffers" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 13.

2526

Input and Output

2527

2528

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="numerics_and_c.html">Prev</a> </td><th width="60%" align="center">Part II.

2529

Standard Contents

2530

</th><td width="20%" align="right"> <a accesskey="n" href="streambufs.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.io"></a>Chapter 13.

2531

Input and Output

2532

- <a id="idp16257600" class="indexterm"></a>

2533

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="io.html#std.io.objects">Iostream Objects</a></span></dt><dt><span class="section"><a href="streambufs.html">Stream Buffers</a></span></dt><dd><dl><dt><span class="section"><a href="streambufs.html#io.streambuf.derived">Derived streambuf Classes</a></span></dt><dt><span class="section"><a href="streambufs.html#io.streambuf.buffering">Buffering</a></span></dt></dl></dd><dt><span class="section"><a href="stringstreams.html">Memory Based Streams</a></span></dt><dd><dl><dt><span class="section"><a href="stringstreams.html#std.io.memstreams.compat">Compatibility With strstream</a></span></dt></dl></dd><dt><span class="section"><a href="fstreams.html">File Based Streams</a></span></dt><dd><dl><dt><span class="section"><a href="fstreams.html#std.io.filestreams.copying_a_file">Copying a File</a></span></dt><dt><span class="section"><a href="fstreams.html#std.io.filestreams.binary">Binary Input and Output</a></span></dt></dl></dd><dt><span class="section"><a href="io_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="io_and_c.html#std.io.c.FILE">Using FILE* and file descriptors</a></span></dt><dt><span class="section"><a href="io_and_c.html#std.io.c.sync">Performance</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.io.objects"></a>Iostream Objects</h2></div></div></div><p>To minimize the time you have to wait on the compiler, it's good to

2534

+ <a id="idm269999273616" class="indexterm"></a>

2535

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="io.html#std.io.objects">Iostream Objects</a></span></dt><dt><span class="section"><a href="streambufs.html">Stream Buffers</a></span></dt><dd><dl><dt><span class="section"><a href="streambufs.html#io.streambuf.derived">Derived streambuf Classes</a></span></dt><dt><span class="section"><a href="streambufs.html#io.streambuf.buffering">Buffering</a></span></dt></dl></dd><dt><span class="section"><a href="stringstreams.html">Memory Based Streams</a></span></dt><dd><dl><dt><span class="section"><a href="stringstreams.html#std.io.memstreams.compat">Compatibility With strstream</a></span></dt></dl></dd><dt><span class="section"><a href="fstreams.html">File Based Streams</a></span></dt><dd><dl><dt><span class="section"><a href="fstreams.html#std.io.filestreams.copying_a_file">Copying a File</a></span></dt><dt><span class="section"><a href="fstreams.html#std.io.filestreams.binary">Binary Input and Output</a></span></dt></dl></dd><dt><span class="section"><a href="io_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="io_and_c.html#std.io.c.FILE">Using FILE* and file descriptors</a></span></dt><dt><span class="section"><a href="io_and_c.html#std.io.c.sync">Performance</a></span></dt></dl></dd></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.io.objects"></a>Iostream Objects</h2></div></div></div><p>To minimize the time you have to wait on the compiler, it's good to

2536

only include the headers you really need. Many people simply include

2537

<iostream> when they don't need to -- and that can <span class="emphasis"><em>penalize

2538

your runtime as well.</em></span> Here are some tips on which header to use

2539

Index: libstdc++-v3/doc/html/manual/index.html

2540

===================================================================

2541

--- a/src/libstdc++-v3/doc/html/manual/index.html (.../tags/gcc_4_8_2_release)

2542

+++ b/src/libstdc++-v3/doc/html/manual/index.html (.../branches/gcc-4_8-branch)

2543

@@ -1,7 +1,7 @@

2544

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2545

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library Manual</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="../index.html" title="The GNU C++ Library" /><link rel="prev" href="../index.html" title="The GNU C++ Library" /><link rel="next" href="intro.html" title="Part I. Introduction" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library Manual</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="../index.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr></table><hr /></div><div class="book"><div class="titlepage"><div><div><h1 class="title"><a id="manual"></a>The GNU C++ Library Manual</h1></div><div><div class="authorgroup"><div class="author"><h3 class="author"><span class="firstname"></span> <span class="surname"></span></h3></div><div class="author"><h3 class="author"><span class="firstname">Paolo</span> <span class="surname">Carlini</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Phil</span> <span class="surname">Edwards</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Doug</span> <span class="surname">Gregor</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Dhruv</span> <span class="surname">Matani</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jason</span> <span class="surname">Merrill</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Mark</span> <span class="surname">Mitchell</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Nathan</span> <span class="surname">Myers</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Felix</span> <span class="surname">Natter</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Stefan</span> <span class="surname">Olsson</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Silvius</span> <span class="surname">Rus</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Ami</span> <span class="surname">Tavory</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jonathan</span> <span class="surname">Wakely</span></h3></div></div></div><div><p class="copyright">Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012

2546

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>The GNU C++ Library Manual</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="../index.html" title="The GNU C++ Library" /><link rel="prev" href="../index.html" title="The GNU C++ Library" /><link rel="next" href="intro.html" title="Part I. Introduction" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">The GNU C++ Library Manual</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="../index.html">Prev</a> </td><th width="60%" align="center"> </th><td width="20%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr></table><hr /></div><div class="book"><div class="titlepage"><div><div><h1 class="title"><a id="manual"></a>The GNU C++ Library Manual</h1></div><div><div class="authorgroup"><div class="author"><h3 class="author"><span class="firstname"></span> <span class="surname"></span></h3></div><div class="author"><h3 class="author"><span class="firstname">Paolo</span> <span class="surname">Carlini</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Phil</span> <span class="surname">Edwards</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Doug</span> <span class="surname">Gregor</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Benjamin</span> <span class="surname">Kosnik</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Dhruv</span> <span class="surname">Matani</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jason</span> <span class="surname">Merrill</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Mark</span> <span class="surname">Mitchell</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Nathan</span> <span class="surname">Myers</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Felix</span> <span class="surname">Natter</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Stefan</span> <span class="surname">Olsson</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Silvius</span> <span class="surname">Rus</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Johannes</span> <span class="surname">Singler</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Ami</span> <span class="surname">Tavory</span></h3></div><div class="author"><h3 class="author"><span class="firstname">Jonathan</span> <span class="surname">Wakely</span></h3></div></div></div><div><p class="copyright">Copyright © 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013

2547

2548

- </p></div></div><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="part"><a href="intro.html">I.

2549

+ </p></div></div><hr /></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="part"><a href="intro.html">I.

2550

Introduction

2551

2552

</a></span></dt><dd><dl><dt><span class="chapter"><a href="status.html">1. Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#manual.intro.status.iso">Implementation Status</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#status.iso.1998">C++ 1998/2003</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.1998.status">Implementation Status</a></span></dt><dt><span class="section"><a href="status.html#iso.1998.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.2011">C++ 2011</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.2011.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr1">C++ TR1</a></span></dt><dd><dl><dt><span class="section"><a href="status.html#iso.tr1.specific">Implementation Specific Behavior</a></span></dt></dl></dd><dt><span class="section"><a href="status.html#status.iso.tr24733">C++ TR 24733</a></span></dt></dl></dd><dt><span class="section"><a href="license.html">License</a></span></dt><dd><dl><dt><span class="section"><a href="license.html#manual.intro.status.license.gpl">The Code: GPL</a></span></dt><dt><span class="section"><a href="license.html#manual.intro.status.license.fdl">The Documentation: GPL, FDL</a></span></dt></dl></dd><dt><span class="section"><a href="bugs.html">Bugs</a></span></dt><dd><dl><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.impl">Implementation Bugs</a></span></dt><dt><span class="section"><a href="bugs.html#manual.intro.status.bugs.iso">Standard Bugs</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="setup.html">2. Setup</a></span></dt><dd><dl><dt><span class="section"><a href="setup.html#manual.intro.setup.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="configure.html">Configure</a></span></dt><dt><span class="section"><a href="make.html">Make</a></span></dt></dl></dd><dt><span class="chapter"><a href="using.html">3. Using</a></span></dt><dd><dl><dt><span class="section"><a href="using.html#manual.intro.using.flags">Command Options</a></span></dt><dt><span class="section"><a href="using_headers.html">Headers</a></span></dt><dd><dl><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.all">Header Files</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.mixing">Mixing Headers</a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.cheaders">The C Headers and <code class="code">namespace std</code></a></span></dt><dt><span class="section"><a href="using_headers.html#manual.intro.using.headers.pre">Precompiled Headers</a></span></dt></dl></dd><dt><span class="section"><a href="using_macros.html">Macros</a></span></dt><dt><span class="section"><a href="using_namespaces.html">Namespaces</a></span></dt><dd><dl><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.all">Available Namespaces</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.std">namespace std</a></span></dt><dt><span class="section"><a href="using_namespaces.html#manual.intro.using.namespaces.comp">Using Namespace Composition</a></span></dt></dl></dd><dt><span class="section"><a href="using_dynamic_or_shared.html">Linking</a></span></dt><dd><dl><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.freestanding">Almost Nothing</a></span></dt><dt><span class="section"><a href="using_dynamic_or_shared.html#manual.intro.using.linkage.dynamic">Finding Dynamic or Shared Libraries</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html">Concurrency</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.prereq">Prerequisites</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.thread_safety">Thread Safety</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.atomics">Atomics</a></span></dt><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.io">IO</a></span></dt><dd><dl><dt><span class="section"><a href="using_concurrency.html#concurrency.io.structure">Structure</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.defaults">Defaults</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.future">Future</a></span></dt><dt><span class="section"><a href="using_concurrency.html#concurrency.io.alt">Alternatives</a></span></dt></dl></dd><dt><span class="section"><a href="using_concurrency.html#manual.intro.using.concurrency.containers">Containers</a></span></dt></dl></dd><dt><span class="section"><a href="using_exceptions.html">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.safety">Exception Safety</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.propagating">Exception Neutrality</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.no">Doing without</a></span></dt><dt><span class="section"><a href="using_exceptions.html#intro.using.exception.compat">Compatibility</a></span></dt><dd><dl><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.c">With <code class="literal">C</code></a></span></dt><dt><span class="section"><a href="using_exceptions.html#using.exception.compat.posix">With <code class="literal">POSIX</code> thread cancellation</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="debug.html">Debugging Support</a></span></dt><dd><dl><dt><span class="section"><a href="debug.html#debug.compiler">Using <span class="command"><strong>g++</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.req">Debug Versions of Library Binary Files</a></span></dt><dt><span class="section"><a href="debug.html#debug.memory">Memory Leak Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.races">Data Race Hunting</a></span></dt><dt><span class="section"><a href="debug.html#debug.gdb">Using <span class="command"><strong>gdb</strong></span></a></span></dt><dt><span class="section"><a href="debug.html#debug.exceptions">Tracking uncaught exceptions</a></span></dt><dt><span class="section"><a href="debug.html#debug.debug_mode">Debug Mode</a></span></dt><dt><span class="section"><a href="debug.html#debug.compile_time_checks">Compile Time Checking</a></span></dt><dt><span class="section"><a href="debug.html#debug.profile_mode">Profile-based Performance Analysis</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="part"><a href="std_contents.html">II.

2553

@@ -15,13 +15,13 @@

2554

</a></span></dt><dd><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions">Exceptions</a></span></dt><dd><dl><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.api">API Reference</a></span></dt><dt><span class="section"><a href="diagnostics.html#std.diagnostics.exceptions.data">Adding Data to <code class="classname">exception</code></a></span></dt></dl></dd><dt><span class="section"><a href="concept_checking.html">Concept Checking</a></span></dt></dl></dd><dt><span class="chapter"><a href="utilities.html">6.

2555

Utilities

2556

2557

-</a></span></dt><dd><dl><dt><span class="section"><a href="utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp13920976">Interface Design</a></span></dt><dt><span class="section"><a href="memory.html#idp13924528">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="memory.html#idp13937824">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp15512272">Class Hierarchy</a></span></dt><dt><span class="section"><a href="memory.html#idp15534784">Thread Safety</a></span></dt><dt><span class="section"><a href="memory.html#idp15542080">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="memory.html#idp15556704">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp15573056">Examples</a></span></dt><dt><span class="section"><a href="memory.html#idp15576640">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="traits.html">Traits</a></span></dt></dl></dd><dt><span class="chapter"><a href="strings.html">7.

2558

+</a></span></dt><dd><dl><dt><span class="section"><a href="utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm270001611968">Interface Design</a></span></dt><dt><span class="section"><a href="memory.html#idm270001608416">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="memory.html#idm270001595120">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm270000019344">Class Hierarchy</a></span></dt><dt><span class="section"><a href="memory.html#idm269999996832">Thread Safety</a></span></dt><dt><span class="section"><a href="memory.html#idm269999989536">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="memory.html#idm269999974912">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm269999958496">Examples</a></span></dt><dt><span class="section"><a href="memory.html#idm269999954912">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="traits.html">Traits</a></span></dt></dl></dd><dt><span class="chapter"><a href="strings.html">7.

2559

Strings

2560

2561

</a></span></dt><dd><dl><dt><span class="section"><a href="strings.html#std.strings.string">String Classes</a></span></dt><dd><dl><dt><span class="section"><a href="strings.html#strings.string.simple">Simple Transformations</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.case">Case Sensitivity</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.character_types">Arbitrary Character Types</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.token">Tokenizing</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.shrink">Shrink to Fit</a></span></dt><dt><span class="section"><a href="strings.html#strings.string.Cstring">CString (MFC)</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="localization.html">8.

2562

Localization

2563

2564

-</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#idp15778336">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="chapter"><a href="containers.html">9.

2565

+</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales">Locales</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#std.localization.locales.locale">locale</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locales.locale.req">Requirements</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.design">Design</a></span></dt><dt><span class="section"><a href="localization.html#locales.locale.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="localization.html#locale.impl.c">Interacting with "C" locales</a></span></dt></dl></dd><dt><span class="section"><a href="localization.html#locales.locale.future">Future</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="facets.html">Facets</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#std.localization.facet.ctype">ctype</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.ctype.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#idm269999753024">Specializations</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.ctype.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#std.localization.facet.codecvt">codecvt</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.codecvt.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.design">Design</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#codecvt.design.wchar_t_size"><span class="type">wchar_t</span> Size</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.unicode">Support for Unicode</a></span></dt><dt><span class="section"><a href="facets.html#codecvt.design.issues">Other Issues</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.codecvt.impl">Implementation</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.codecvt.future">Future</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#manual.localization.facet.messages">messages</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#facet.messages.req">Requirements</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.design">Design</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="facets.html#messages.impl.models">Models</a></span></dt><dt><span class="section"><a href="facets.html#messages.impl.gnu">The GNU Model</a></span></dt></dl></dd><dt><span class="section"><a href="facets.html#facet.messages.use">Use</a></span></dt><dt><span class="section"><a href="facets.html#facet.messages.future">Future</a></span></dt></dl></dd></dl></dd></dl></dd><dt><span class="chapter"><a href="containers.html">9.

2566

Containers

2567

2568

</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#std.containers.sequences">Sequences</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#containers.sequences.list">list</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.list.size">list::size() is O(n)</a></span></dt></dl></dd><dt><span class="section"><a href="containers.html#containers.sequences.vector">vector</a></span></dt><dd><dl><dt><span class="section"><a href="containers.html#sequences.vector.management">Space Overhead Management</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="associative.html">Associative</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#containers.associative.insert_hints">Insertion Hints</a></span></dt><dt><span class="section"><a href="associative.html#containers.associative.bitset">bitset</a></span></dt><dd><dl><dt><span class="section"><a href="associative.html#associative.bitset.size_variable">Size Variable</a></span></dt><dt><span class="section"><a href="associative.html#associative.bitset.type_string">Type String</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="unordered_associative.html">Unordered Associative</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.hash">Hash Code</a></span></dt><dd><dl><dt><span class="section"><a href="unordered_associative.html#containers.unordered.cache">Hash Code Caching Policy</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="containers_and_c.html">Interacting with C</a></span></dt><dd><dl><dt><span class="section"><a href="containers_and_c.html#containers.c.vs_array">Containers vs. Arrays</a></span></dt></dl></dd></dl></dd><dt><span class="chapter"><a href="iterators.html">10.

2569

@@ -143,19 +143,19 @@

2570

2571

</a></span></dt><dt><span class="appendix"><a href="appendix_gpl.html">D.

2572

<acronym class="acronym">GNU</acronym> General Public License version 3

2573

- </a></span></dt><dt><span class="appendix"><a href="appendix_gfdl.html">E. GNU Free Documentation License</a></span></dt></dl></dd></dl></div><div class="list-of-figures"><p><strong>List of Figures</strong></p><dl><dt>22.1. <a href="policy_data_structures.html#idp17613296">Node Invariants</a></dt><dt>22.2. <a href="policy_data_structures.html#idp17619952">Underlying Associative Data Structures</a></dt><dt>22.3. <a href="policy_data_structures.html#idp17651648">Range Iteration in Different Data Structures</a></dt><dt>22.4. <a href="policy_data_structures.html#idp17666528">Point Iteration in Hash Data Structures</a></dt><dt>22.5. <a href="policy_data_structures.html#idp17675840">Effect of erase in different underlying data structures</a></dt><dt>22.6. <a href="policy_data_structures.html#idp17743424">Underlying Priority Queue Data Structures</a></dt><dt>22.7. <a href="policy_data_structures_using.html#idp17806128">Exception Hierarchy</a></dt><dt>22.8. <a href="policy_data_structures_design.html#idp18000448">Non-unique Mapping Standard Containers</a></dt><dt>22.9. <a href="policy_data_structures_design.html#fig.pbds_embedded_lists_2">

2574

+ </a></span></dt><dt><span class="appendix"><a href="appendix_gfdl.html">E. GNU Free Documentation License</a></span></dt></dl></dd></dl></div><div class="list-of-figures"><p><strong>List of Figures</strong></p><dl><dt>22.1. <a href="policy_data_structures.html#idm269997917584">Node Invariants</a></dt><dt>22.2. <a href="policy_data_structures.html#idm269997910864">Underlying Associative Data Structures</a></dt><dt>22.3. <a href="policy_data_structures.html#idm269997879168">Range Iteration in Different Data Structures</a></dt><dt>22.4. <a href="policy_data_structures.html#idm269997864256">Point Iteration in Hash Data Structures</a></dt><dt>22.5. <a href="policy_data_structures.html#idm269997855056">Effect of erase in different underlying data structures</a></dt><dt>22.6. <a href="policy_data_structures.html#idm269997787392">Underlying Priority Queue Data Structures</a></dt><dt>22.7. <a href="policy_data_structures_using.html#idm269997724688">Exception Hierarchy</a></dt><dt>22.8. <a href="policy_data_structures_design.html#idm269997530416">Non-unique Mapping Standard Containers</a></dt><dt>22.9. <a href="policy_data_structures_design.html#fig.pbds_embedded_lists_2">

2575

Effect of embedded lists in

2576

<code class="classname">std::multimap</code>

2577

- </a></dt><dt>22.10. <a href="policy_data_structures_design.html#idp18023952">Non-unique Mapping Containers</a></dt><dt>22.11. <a href="policy_data_structures_design.html#idp18043824">Point Iterator Hierarchy</a></dt><dt>22.12. <a href="policy_data_structures_design.html#idp18057168">Invalidation Guarantee Tags Hierarchy</a></dt><dt>22.13. <a href="policy_data_structures_design.html#idp18087392">Container Tag Hierarchy</a></dt><dt>22.14. <a href="policy_data_structures_design.html#idp18127536">Hash functions, ranged-hash functions, and

2578

- range-hashing functions</a></dt><dt>22.15. <a href="policy_data_structures_design.html#idp18191968">Insert hash sequence diagram</a></dt><dt>22.16. <a href="policy_data_structures_design.html#idp18199024">Insert hash sequence diagram with a null policy</a></dt><dt>22.17. <a href="policy_data_structures_design.html#idp18215840">Hash policy class diagram</a></dt><dt>22.18. <a href="policy_data_structures_design.html#idp18234944">Balls and bins</a></dt><dt>22.19. <a href="policy_data_structures_design.html#idp18265728">Insert resize sequence diagram</a></dt><dt>22.20. <a href="policy_data_structures_design.html#idp18273504">Standard resize policy trigger sequence

2579

- diagram</a></dt><dt>22.21. <a href="policy_data_structures_design.html#idp18277664">Standard resize policy size sequence

2580

- diagram</a></dt><dt>22.22. <a href="policy_data_structures_design.html#idp18355696">Tree node invariants</a></dt><dt>22.23. <a href="policy_data_structures_design.html#idp18365136">Tree node invalidation</a></dt><dt>22.24. <a href="policy_data_structures_design.html#idp18378304">A tree and its update policy</a></dt><dt>22.25. <a href="policy_data_structures_design.html#idp18389968">Restoring node invariants</a></dt><dt>22.26. <a href="policy_data_structures_design.html#idp18398144">Insert update sequence</a></dt><dt>22.27. <a href="policy_data_structures_design.html#idp18420400">Useless update path</a></dt><dt>22.28. <a href="policy_data_structures_design.html#idp18465088">A PATRICIA trie</a></dt><dt>22.29. <a href="policy_data_structures_design.html#idp18475584">A trie and its update policy</a></dt><dt>22.30. <a href="policy_data_structures_design.html#idp18506160">A simple list</a></dt><dt>22.31. <a href="policy_data_structures_design.html#idp18511744">The counter algorithm</a></dt><dt>22.32. <a href="policy_data_structures_design.html#idp18575568">Underlying Priority-Queue Data-Structures.</a></dt><dt>22.33. <a href="policy_data_structures_design.html#idp18610544">Priority-Queue Data-Structure Tags.</a></dt><dt>B.1. <a href="appendix_porting.html#idp22035648">Configure and Build File Dependencies</a></dt></dl></div><div class="list-of-tables"><p><strong>List of Tables</strong></p><dl><dt>1.1. <a href="status.html#idp452240">C++ 1998/2003 Implementation Status</a></dt><dt>1.2. <a href="status.html#idp8670848">C++ 2011 Implementation Status</a></dt><dt>1.3. <a href="status.html#idp7483200">C++ TR1 Implementation Status</a></dt><dt>1.4. <a href="status.html#idp12559072">C++ TR 24733 Implementation Status</a></dt><dt>3.1. <a href="using.html#idp13051936">C++ Command Options</a></dt><dt>3.2. <a href="using_headers.html#idp13079360">C++ 1998 Library Headers</a></dt><dt>3.3. <a href="using_headers.html#idp13115840">C++ 1998 Library Headers for C Library Facilities</a></dt><dt>3.4. <a href="using_headers.html#idp13140576">C++ 2011 Library Headers</a></dt><dt>3.5. <a href="using_headers.html#idp13192016">C++ 2011 Library Headers for C Library Facilities</a></dt><dt>3.6. <a href="using_headers.html#idp13221904">C++ TR 1 Library Headers</a></dt><dt>3.7. <a href="using_headers.html#idp13238832">C++ TR 1 Library Headers for C Library Facilities</a></dt><dt>3.8. <a href="using_headers.html#idp13259904">C++ TR 24733 Decimal Floating-Point Header</a></dt><dt>3.9. <a href="using_headers.html#idp13265424">C++ ABI Headers</a></dt><dt>3.10. <a href="using_headers.html#idp13271824">Extension Headers</a></dt><dt>3.11. <a href="using_headers.html#idp13307552">Extension Debug Headers</a></dt><dt>3.12. <a href="using_headers.html#idp13322320">Extension Profile Headers</a></dt><dt>3.13. <a href="using_headers.html#idp13335696">Extension Parallel Headers</a></dt><dt>17.1. <a href="debug_mode_using.html#idp16490400">Debugging Containers</a></dt><dt>17.2. <a href="debug_mode_using.html#idp16535296">Debugging Containers C++11</a></dt><dt>18.1. <a href="parallel_mode_using.html#idp16725920">Parallel Algorithms</a></dt><dt>19.1. <a href="profile_mode_design.html#idp16981200">Profile Code Location</a></dt><dt>19.2. <a href="profile_mode_diagnostics.html#idp17088912">Profile Diagnostics</a></dt><dt>21.1. <a href="bitmap_allocator_impl.html#idp17500848">Bitmap Allocator Memory Map</a></dt><dt>B.1. <a href="documentation_hacking.html#idp22162432">Doxygen Prerequisites</a></dt><dt>B.2. <a href="documentation_hacking.html#idp22238096">HTML to Doxygen Markup Comparison</a></dt><dt>B.3. <a href="documentation_hacking.html#idp22257536">Docbook Prerequisites</a></dt><dt>B.4. <a href="documentation_hacking.html#idp22335040">HTML to Docbook XML Markup Comparison</a></dt><dt>B.5. <a href="documentation_hacking.html#idp22359184">Docbook XML Element Use</a></dt><dt>B.6. <a href="api.html#idp23030528">Extension Allocators</a></dt><dt>B.7. <a href="api.html#idp23058160">Extension Allocators Continued</a></dt></dl></div><div class="list-of-equations"><p><strong>List of Equations</strong></p><dl><dt>22.1. <a href="policy_data_structures_design.html#idp18141344">Ranged Hash Function</a></dt><dt>22.2. <a href="policy_data_structures_design.html#idp18147232">Range-Hashing, Division Method</a></dt><dt>22.3. <a href="policy_data_structures_design.html#idp18151744">Division via Prime Modulo</a></dt><dt>22.4. <a href="policy_data_structures_design.html#idp18153568">Division via Bit Mask</a></dt><dt>22.5. <a href="policy_data_structures_design.html#idp18163200">

2581

+ </a></dt><dt>22.10. <a href="policy_data_structures_design.html#idm269997506912">Non-unique Mapping Containers</a></dt><dt>22.11. <a href="policy_data_structures_design.html#idm269997487104">Point Iterator Hierarchy</a></dt><dt>22.12. <a href="policy_data_structures_design.html#idm269997473760">Invalidation Guarantee Tags Hierarchy</a></dt><dt>22.13. <a href="policy_data_structures_design.html#idm269997443664">Container Tag Hierarchy</a></dt><dt>22.14. <a href="policy_data_structures_design.html#idm269997403584">Hash functions, ranged-hash functions, and

2582

+ range-hashing functions</a></dt><dt>22.15. <a href="policy_data_structures_design.html#idm269997339216">Insert hash sequence diagram</a></dt><dt>22.16. <a href="policy_data_structures_design.html#idm269997332160">Insert hash sequence diagram with a null policy</a></dt><dt>22.17. <a href="policy_data_structures_design.html#idm269997315408">Hash policy class diagram</a></dt><dt>22.18. <a href="policy_data_structures_design.html#idm269997296368">Balls and bins</a></dt><dt>22.19. <a href="policy_data_structures_design.html#idm269997265648">Insert resize sequence diagram</a></dt><dt>22.20. <a href="policy_data_structures_design.html#idm269997257872">Standard resize policy trigger sequence

2583

+ diagram</a></dt><dt>22.21. <a href="policy_data_structures_design.html#idm269997253712">Standard resize policy size sequence

2584

+ diagram</a></dt><dt>22.22. <a href="policy_data_structures_design.html#idm269997175616">Tree node invariants</a></dt><dt>22.23. <a href="policy_data_structures_design.html#idm269997166176">Tree node invalidation</a></dt><dt>22.24. <a href="policy_data_structures_design.html#idm269997153072">A tree and its update policy</a></dt><dt>22.25. <a href="policy_data_structures_design.html#idm269997141408">Restoring node invariants</a></dt><dt>22.26. <a href="policy_data_structures_design.html#idm269997133232">Insert update sequence</a></dt><dt>22.27. <a href="policy_data_structures_design.html#idm269997110976">Useless update path</a></dt><dt>22.28. <a href="policy_data_structures_design.html#idm269997066288">A PATRICIA trie</a></dt><dt>22.29. <a href="policy_data_structures_design.html#idm269997055856">A trie and its update policy</a></dt><dt>22.30. <a href="policy_data_structures_design.html#idm269997025344">A simple list</a></dt><dt>22.31. <a href="policy_data_structures_design.html#idm269997019760">The counter algorithm</a></dt><dt>22.32. <a href="policy_data_structures_design.html#idm269996955920">Underlying Priority-Queue Data-Structures.</a></dt><dt>22.33. <a href="policy_data_structures_design.html#idm269996920880">Priority-Queue Data-Structure Tags.</a></dt><dt>B.1. <a href="appendix_porting.html#idm269993497120">Configure and Build File Dependencies</a></dt></dl></div><div class="list-of-tables"><p><strong>List of Tables</strong></p><dl><dt>1.1. <a href="status.html#idm270008034928">C++ 1998/2003 Implementation Status</a></dt><dt>1.2. <a href="status.html#idm270007982624">C++ 2011 Implementation Status</a></dt><dt>1.3. <a href="status.html#idm270006687472">C++ TR1 Implementation Status</a></dt><dt>1.4. <a href="status.html#idm270002960368">C++ TR 24733 Implementation Status</a></dt><dt>3.1. <a href="using.html#idm270002481088">C++ Command Options</a></dt><dt>3.2. <a href="using_headers.html#idm270002453792">C++ 1998 Library Headers</a></dt><dt>3.3. <a href="using_headers.html#idm270002417312">C++ 1998 Library Headers for C Library Facilities</a></dt><dt>3.4. <a href="using_headers.html#idm270002392576">C++ 2011 Library Headers</a></dt><dt>3.5. <a href="using_headers.html#idm270002341136">C++ 2011 Library Headers for C Library Facilities</a></dt><dt>3.6. <a href="using_headers.html#idm270002311248">C++ TR 1 Library Headers</a></dt><dt>3.7. <a href="using_headers.html#idm270002294320">C++ TR 1 Library Headers for C Library Facilities</a></dt><dt>3.8. <a href="using_headers.html#idm270002273248">C++ TR 24733 Decimal Floating-Point Header</a></dt><dt>3.9. <a href="using_headers.html#idm270002267728">C++ ABI Headers</a></dt><dt>3.10. <a href="using_headers.html#idm270002261328">Extension Headers</a></dt><dt>3.11. <a href="using_headers.html#idm270002225600">Extension Debug Headers</a></dt><dt>3.12. <a href="using_headers.html#idm270002210832">Extension Profile Headers</a></dt><dt>3.13. <a href="using_headers.html#idm270002197456">Extension Parallel Headers</a></dt><dt>17.1. <a href="debug_mode_using.html#idm269999040896">Debugging Containers</a></dt><dt>17.2. <a href="debug_mode_using.html#idm269998996000">Debugging Containers C++11</a></dt><dt>18.1. <a href="parallel_mode_using.html#idm269998805216">Parallel Algorithms</a></dt><dt>19.1. <a href="profile_mode_design.html#idm269998550064">Profile Code Location</a></dt><dt>19.2. <a href="profile_mode_diagnostics.html#idm269998442544">Profile Diagnostics</a></dt><dt>21.1. <a href="bitmap_allocator_impl.html#idm269998030352">Bitmap Allocator Memory Map</a></dt><dt>B.1. <a href="documentation_hacking.html#idm269993370272">Doxygen Prerequisites</a></dt><dt>B.2. <a href="documentation_hacking.html#idm269993294592">HTML to Doxygen Markup Comparison</a></dt><dt>B.3. <a href="documentation_hacking.html#idm269993275152">Docbook Prerequisites</a></dt><dt>B.4. <a href="documentation_hacking.html#idm269993197520">HTML to Docbook XML Markup Comparison</a></dt><dt>B.5. <a href="documentation_hacking.html#idm269993173376">Docbook XML Element Use</a></dt><dt>B.6. <a href="api.html#idm269992502096">Extension Allocators</a></dt><dt>B.7. <a href="api.html#idm269992474464">Extension Allocators Continued</a></dt></dl></div><div class="list-of-equations"><p><strong>List of Equations</strong></p><dl><dt>22.1. <a href="policy_data_structures_design.html#idm269997389776">Ranged Hash Function</a></dt><dt>22.2. <a href="policy_data_structures_design.html#idm269997383888">Range-Hashing, Division Method</a></dt><dt>22.3. <a href="policy_data_structures_design.html#idm269997379376">Division via Prime Modulo</a></dt><dt>22.4. <a href="policy_data_structures_design.html#idm269997377552">Division via Bit Mask</a></dt><dt>22.5. <a href="policy_data_structures_design.html#idm269997367984">

2585

A Standard String Hash Function

2586

- </a></dt><dt>22.6. <a href="policy_data_structures_design.html#idp18169344">

2587

+ </a></dt><dt>22.6. <a href="policy_data_structures_design.html#idm269997361840">

2588

Only k String DNA Hash

2589

- </a></dt><dt>22.7. <a href="policy_data_structures_design.html#idp18240448">

2590

+ </a></dt><dt>22.7. <a href="policy_data_structures_design.html#idm269997290864">

2591

Probability of Probe Sequence of Length k

2592

- </a></dt><dt>22.8. <a href="policy_data_structures_design.html#idp18247216">

2593

+ </a></dt><dt>22.8. <a href="policy_data_structures_design.html#idm269997284096">

2594

Probability Probe Sequence in Some Bin

2595

</a></dt></dl></div></div><div class="navfooter"><hr /><table width="100%" summary="Navigation footer"><tr><td width="40%" align="left"><a accesskey="p" href="../index.html">Prev</a> </td><td width="20%" align="center"> </td><td width="40%" align="right"> <a accesskey="n" href="intro.html">Next</a></td></tr><tr><td width="40%" align="left" valign="top">The GNU C++ Library </td><td width="20%" align="center"><a accesskey="h" href="../index.html">Home</a></td><td width="40%" align="right" valign="top"> Part I.

2596

Introduction

2597

Index: libstdc++-v3/doc/html/manual/numerics_and_c.html

2598

===================================================================

2599

--- a/src/libstdc++-v3/doc/html/manual/numerics_and_c.html (.../tags/gcc_4_8_2_release)

2600

+++ b/src/libstdc++-v3/doc/html/manual/numerics_and_c.html (.../branches/gcc-4_8-branch)

2601

@@ -1,5 +1,5 @@

2602

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2603

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Interacting with C</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="numerics.html" title="Chapter 12. Numerics" /><link rel="prev" href="generalized_numeric_operations.html" title="Generalized Operations" /><link rel="next" href="io.html" title="Chapter 13. Input and Output" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Interacting with C</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="generalized_numeric_operations.html">Prev</a> </td><th width="60%" align="center">Chapter 12.

2604

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Interacting with C</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="numerics.html" title="Chapter 12. Numerics" /><link rel="prev" href="generalized_numeric_operations.html" title="Generalized Operations" /><link rel="next" href="io.html" title="Chapter 13. Input and Output" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Interacting with C</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="generalized_numeric_operations.html">Prev</a> </td><th width="60%" align="center">Chapter 12.

2605

Numerics

2606

2607

</th><td width="20%" align="right"> <a accesskey="n" href="io.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.numerics.c"></a>Interacting with C</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="numerics.c.array"></a>Numerics vs. Arrays</h3></div></div></div><p>One of the major reasons why FORTRAN can chew through numbers so well

2608

Index: libstdc++-v3/doc/html/manual/appendix_gpl.html

2609

===================================================================

2610

--- a/src/libstdc++-v3/doc/html/manual/appendix_gpl.html (.../tags/gcc_4_8_2_release)

2611

+++ b/src/libstdc++-v3/doc/html/manual/appendix_gpl.html (.../branches/gcc-4_8-branch)

2612

@@ -1,5 +1,5 @@

2613

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2614

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix D. GNU General Public License version 3</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="appendix_free.html" title="Appendix C. Free Software Needs Free Documentation" /><link rel="next" href="appendix_gfdl.html" title="Appendix E. GNU Free Documentation License" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix D.

2615

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Appendix D. GNU General Public License version 3</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix.html" title="Part IV. Appendices" /><link rel="prev" href="appendix_free.html" title="Appendix C. Free Software Needs Free Documentation" /><link rel="next" href="appendix_gfdl.html" title="Appendix E. GNU Free Documentation License" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Appendix D.

2616

<acronym class="acronym">GNU</acronym> General Public License version 3

2617

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="appendix_free.html">Prev</a> </td><th width="60%" align="center">Part IV.

2618

Appendices

2619

@@ -77,7 +77,7 @@

2620

</p><p>

2621

The precise terms and conditions for copying, distribution and modification

2622

follow.

2623

- </p><h2><a id="idp23466384"></a>

2624

+ </p><h2><a id="idm269992066368"></a>

2625

TERMS AND CONDITIONS

2626

</h2><h2><a id="gpl-3-definitions"></a>

2627

0. Definitions.

2628

@@ -618,7 +618,7 @@

2629

waiver of all civil liability in connection with the Program, unless a

2630

warranty or assumption of liability accompanies a copy of the Program in

2631

return for a fee.

2632

- </p><h2><a id="idp23565184"></a>

2633

+ </p><h2><a id="idm269991967568"></a>

2634

END OF TERMS AND CONDITIONS

2635

</h2><h2><a id="HowToApply"></a>

2636

How to Apply These Terms to Your New Programs

2637

Index: libstdc++-v3/doc/html/manual/source_code_style.html

2638

===================================================================

2639

--- a/src/libstdc++-v3/doc/html/manual/source_code_style.html (.../tags/gcc_4_8_2_release)

2640

+++ b/src/libstdc++-v3/doc/html/manual/source_code_style.html (.../branches/gcc-4_8-branch)

2641

@@ -1,5 +1,5 @@

2642

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2643

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Coding Style</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="source_organization.html" title="Directory Layout and Source Conventions" /><link rel="next" href="source_design_notes.html" title="Design Notes" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Coding Style</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="source_organization.html">Prev</a> </td><th width="60%" align="center">Appendix A.

2644

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Coding Style</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="appendix_contributing.html" title="Appendix A. Contributing" /><link rel="prev" href="source_organization.html" title="Directory Layout and Source Conventions" /><link rel="next" href="source_design_notes.html" title="Design Notes" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Coding Style</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="source_organization.html">Prev</a> </td><th width="60%" align="center">Appendix A.

2645

Contributing

2646

2647

</th><td width="20%" align="right"> <a accesskey="n" href="source_design_notes.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="contrib.coding_style"></a>Coding Style</h2></div></div></div><p>

2648

Index: libstdc++-v3/doc/html/manual/streambufs.html

2649

===================================================================

2650

--- a/src/libstdc++-v3/doc/html/manual/streambufs.html (.../tags/gcc_4_8_2_release)

2651

+++ b/src/libstdc++-v3/doc/html/manual/streambufs.html (.../branches/gcc-4_8-branch)

2652

@@ -1,5 +1,5 @@

2653

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2654

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Stream Buffers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="io.html" title="Chapter 13. Input and Output" /><link rel="next" href="stringstreams.html" title="Memory Based Streams" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Stream Buffers</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="io.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

2655

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Stream Buffers</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="io.html" title="Chapter 13. Input and Output" /><link rel="prev" href="io.html" title="Chapter 13. Input and Output" /><link rel="next" href="stringstreams.html" title="Memory Based Streams" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Stream Buffers</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="io.html">Prev</a> </td><th width="60%" align="center">Chapter 13.

2656

Input and Output

2657

2658

</th><td width="20%" align="right"> <a accesskey="n" href="stringstreams.html">Next</a></td></tr></table><hr /></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.io.streambufs"></a>Stream Buffers</h2></div></div></div><div class="section"><div class="titlepage"><div><div><h3 class="title"><a id="io.streambuf.derived"></a>Derived streambuf Classes</h3></div></div></div><p>

2659

Index: libstdc++-v3/doc/html/manual/utilities.html

2660

===================================================================

2661

--- a/src/libstdc++-v3/doc/html/manual/utilities.html (.../tags/gcc_4_8_2_release)

2662

+++ b/src/libstdc++-v3/doc/html/manual/utilities.html (.../branches/gcc-4_8-branch)

2663

@@ -1,13 +1,13 @@

2664

<?xml version="1.0" encoding="UTF-8" standalone="no"?>

2665

-<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 6. Utilities</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.77.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="concept_checking.html" title="Concept Checking" /><link rel="next" href="pairs.html" title="Pairs" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 6.

2666

+<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Chapter 6. Utilities</title><meta name="generator" content="DocBook XSL-NS Stylesheets V1.78.1" /><meta name="keywords" content="ISO C++, library" /><meta name="keywords" content="ISO C++, runtime, library" /><link rel="home" href="../index.html" title="The GNU C++ Library" /><link rel="up" href="std_contents.html" title="Part II. Standard Contents" /><link rel="prev" href="concept_checking.html" title="Concept Checking" /><link rel="next" href="pairs.html" title="Pairs" /></head><body><div class="navheader"><table width="100%" summary="Navigation header"><tr><th colspan="3" align="center">Chapter 6.

2667

Utilities

2668

2669

</th></tr><tr><td width="20%" align="left"><a accesskey="p" href="concept_checking.html">Prev</a> </td><th width="60%" align="center">Part II.

2670

Standard Contents

2671

</th><td width="20%" align="right"> <a accesskey="n" href="pairs.html">Next</a></td></tr></table><hr /></div><div class="chapter"><div class="titlepage"><div><div><h2 class="title"><a id="std.util"></a>Chapter 6.

2672

Utilities

2673

- <a id="idp13862416" class="indexterm"></a>

2674

-</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl><dt><span class="section"><a href="utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp13920976">Interface Design</a></span></dt><dt><span class="section"><a href="memory.html#idp13924528">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="memory.html#idp13937824">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp15512272">Class Hierarchy</a></span></dt><dt><span class="section"><a href="memory.html#idp15534784">Thread Safety</a></span></dt><dt><span class="section"><a href="memory.html#idp15542080">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="memory.html#idp15556704">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idp15573056">Examples</a></span></dt><dt><span class="section"><a href="memory.html#idp15576640">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="traits.html">Traits</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.util.functors"></a>Functors</h2></div></div></div><p>If you don't know what functors are, you're not alone. Many people

2675

+ <a id="idm270001670464" class="indexterm"></a>

2676

+</h2></div></div></div><div class="toc"><p><strong>Table of Contents</strong></p><dl class="toc"><dt><span class="section"><a href="utilities.html#std.util.functors">Functors</a></span></dt><dt><span class="section"><a href="pairs.html">Pairs</a></span></dt><dt><span class="section"><a href="memory.html">Memory</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#std.util.memory.allocator">Allocators</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#allocator.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#allocator.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#allocator.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm270001611968">Interface Design</a></span></dt><dt><span class="section"><a href="memory.html#idm270001608416">Selecting Default Allocation Policy</a></span></dt><dt><span class="section"><a href="memory.html#idm270001595120">Disabling Memory Caching</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#allocator.using">Using a Specific Allocator</a></span></dt><dt><span class="section"><a href="memory.html#allocator.custom">Custom Allocators</a></span></dt><dt><span class="section"><a href="memory.html#allocator.ext">Extension Allocators</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.auto_ptr">auto_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#auto_ptr.limitations">Limitations</a></span></dt><dt><span class="section"><a href="memory.html#auto_ptr.using">Use in Containers</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#std.util.memory.shared_ptr">shared_ptr</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#shared_ptr.req">Requirements</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.design_issues">Design Issues</a></span></dt><dt><span class="section"><a href="memory.html#shared_ptr.impl">Implementation</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm270000019344">Class Hierarchy</a></span></dt><dt><span class="section"><a href="memory.html#idm269999996832">Thread Safety</a></span></dt><dt><span class="section"><a href="memory.html#idm269999989536">Selecting Lock Policy</a></span></dt><dt><span class="section"><a href="memory.html#idm269999974912">Related functions and classes</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.using">Use</a></span></dt><dd><dl><dt><span class="section"><a href="memory.html#idm269999958496">Examples</a></span></dt><dt><span class="section"><a href="memory.html#idm269999954912">Unresolved Issues</a></span></dt></dl></dd><dt><span class="section"><a href="memory.html#shared_ptr.ack">Acknowledgments</a></span></dt></dl></dd></dl></dd><dt><span class="section"><a href="traits.html">Traits</a></span></dt></dl></div><div class="section"><div class="titlepage"><div><div><h2 class="title" style="clear: both"><a id="std.util.functors"></a>Functors</h2></div></div></div><p>If you don't know what functors are, you're not alone. Many people

2677

get slightly the wrong idea. In the interest of not reinventing

2678

the wheel, we will refer you to the introduction to the functor

2679

concept written by SGI as part of their STL, in

2680

Index: libstdc++-v3/include/debug/functions.h

2681

===================================================================

2682

--- a/src/libstdc++-v3/include/debug/functions.h (.../tags/gcc_4_8_2_release)

2683

+++ b/src/libstdc++-v3/include/debug/functions.h (.../branches/gcc-4_8-branch)

2684

@@ -345,11 +345,13 @@

2685

return __check_sorted_set_aux(__first, __last, __pred, _SameType());

2686

}

2687

2688

+ // _GLIBCXX_RESOLVE_LIB_DEFECTS

2689

+ // 270. Binary search requirements overly strict

2690

+ // Determine if a sequence is partitioned w.r.t. this element.

2691

template<typename _ForwardIterator, typename _Tp>

2692

inline bool

2693

- __check_partitioned_lower_aux(_ForwardIterator __first,

2694

- _ForwardIterator __last, const _Tp& __value,

2695

- std::forward_iterator_tag)

2696

+ __check_partitioned_lower(_ForwardIterator __first,

2697

+ _ForwardIterator __last, const _Tp& __value)

2698

{

2699

while (__first != __last && *__first < __value)

2700

++__first;

2701

@@ -362,38 +364,11 @@

2702

return __first == __last;

2703

}

2704

2705

- // For performance reason, as the iterator range has been validated, check on

2706

- // random access safe iterators is done using the base iterator.

2707

- template<typename _Iterator, typename _Sequence, typename _Tp>

2708

- inline bool

2709

- __check_partitioned_lower_aux(

2710

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2711

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2712

- const _Tp& __value,

2713

- std::random_access_iterator_tag __tag)

2714

- {

2715

- return __check_partitioned_lower_aux(__first.base(), __last.base(),

2716

- __value, __tag);

2717

- }

2718

-

2719

- // _GLIBCXX_RESOLVE_LIB_DEFECTS

2720

- // 270. Binary search requirements overly strict

2721

- // Determine if a sequence is partitioned w.r.t. this element.

2722

template<typename _ForwardIterator, typename _Tp>

2723

inline bool

2724

- __check_partitioned_lower(_ForwardIterator __first,

2725

+ __check_partitioned_upper(_ForwardIterator __first,

2726

_ForwardIterator __last, const _Tp& __value)

2727

{

2728

- return __check_partitioned_lower_aux(__first, __last, __value,

2729

- std::__iterator_category(__first));

2730

- }

2731

-

2732

- template<typename _ForwardIterator, typename _Tp>

2733

- inline bool

2734

- __check_partitioned_upper_aux(_ForwardIterator __first,

2735

- _ForwardIterator __last, const _Tp& __value,

2736

- std::forward_iterator_tag)

2737

- {

2738

while (__first != __last && !(__value < *__first))

2739

++__first;

2740

if (__first != __last)

2741

@@ -405,35 +380,12 @@

2742

return __first == __last;

2743

}

2744

2745

- // For performance reason, as the iterator range has been validated, check on

2746

- // random access safe iterators is done using the base iterator.

2747

- template<typename _Iterator, typename _Sequence, typename _Tp>

2748

- inline bool

2749

- __check_partitioned_upper_aux(

2750

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2751

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2752

- const _Tp& __value,

2753

- std::random_access_iterator_tag __tag)

2754

- {

2755

- return __check_partitioned_upper_aux(__first.base(), __last.base(),

2756

- __value, __tag);

2757

- }

2758

-

2759

- template<typename _ForwardIterator, typename _Tp>

2760

- inline bool

2761

- __check_partitioned_upper(_ForwardIterator __first,

2762

- _ForwardIterator __last, const _Tp& __value)

2763

- {

2764

- return __check_partitioned_upper_aux(__first, __last, __value,

2765

- std::__iterator_category(__first));

2766

- }

2767

-

2768

+ // Determine if a sequence is partitioned w.r.t. this element.

2769

template<typename _ForwardIterator, typename _Tp, typename _Pred>

2770

inline bool

2771

- __check_partitioned_lower_aux(_ForwardIterator __first,

2772

- _ForwardIterator __last, const _Tp& __value,

2773

- _Pred __pred,

2774

- std::forward_iterator_tag)

2775

+ __check_partitioned_lower(_ForwardIterator __first,

2776

+ _ForwardIterator __last, const _Tp& __value,

2777

+ _Pred __pred)

2778

{

2779

while (__first != __last && bool(__pred(*__first, __value)))

2780

++__first;

2781

@@ -446,39 +398,12 @@

2782

return __first == __last;

2783

}

2784

2785

- // For performance reason, as the iterator range has been validated, check on

2786

- // random access safe iterators is done using the base iterator.

2787

- template<typename _Iterator, typename _Sequence,

2788

- typename _Tp, typename _Pred>

2789

- inline bool

2790

- __check_partitioned_lower_aux(

2791

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2792

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2793

- const _Tp& __value, _Pred __pred,

2794

- std::random_access_iterator_tag __tag)

2795

- {

2796

- return __check_partitioned_lower_aux(__first.base(), __last.base(),

2797

- __value, __pred, __tag);

2798

- }

2799

-

2800

- // Determine if a sequence is partitioned w.r.t. this element.

2801

template<typename _ForwardIterator, typename _Tp, typename _Pred>

2802

inline bool

2803

- __check_partitioned_lower(_ForwardIterator __first,

2804

+ __check_partitioned_upper(_ForwardIterator __first,

2805

_ForwardIterator __last, const _Tp& __value,

2806

_Pred __pred)

2807

{

2808

- return __check_partitioned_lower_aux(__first, __last, __value, __pred,

2809

- std::__iterator_category(__first));

2810

- }

2811

-

2812

- template<typename _ForwardIterator, typename _Tp, typename _Pred>

2813

- inline bool

2814

- __check_partitioned_upper_aux(_ForwardIterator __first,

2815

- _ForwardIterator __last, const _Tp& __value,

2816

- _Pred __pred,

2817

- std::forward_iterator_tag)

2818

- {

2819

while (__first != __last && !bool(__pred(__value, *__first)))

2820

++__first;

2821

if (__first != __last)

2822

@@ -490,31 +415,6 @@

2823

return __first == __last;

2824

}

2825

2826

- // For performance reason, as the iterator range has been validated, check on

2827

- // random access safe iterators is done using the base iterator.

2828

- template<typename _Iterator, typename _Sequence,

2829

- typename _Tp, typename _Pred>

2830

- inline bool

2831

- __check_partitioned_upper_aux(

2832

- const _Safe_iterator<_Iterator, _Sequence>& __first,

2833

- const _Safe_iterator<_Iterator, _Sequence>& __last,

2834

- const _Tp& __value, _Pred __pred,

2835

- std::random_access_iterator_tag __tag)

2836

- {

2837

- return __check_partitioned_upper_aux(__first.base(), __last.base(),

2838

- __value, __pred, __tag);

2839

- }

2840

-

2841

- template<typename _ForwardIterator, typename _Tp, typename _Pred>

2842

- inline bool

2843

- __check_partitioned_upper(_ForwardIterator __first,

2844

- _ForwardIterator __last, const _Tp& __value,

2845

- _Pred __pred)

2846

- {

2847

- return __check_partitioned_upper_aux(__first, __last, __value, __pred,

2848

- std::__iterator_category(__first));

2849

- }

2850

-

2851

// Helper struct to detect random access safe iterators.

2852

template<typename _Iterator>

2853

struct __is_safe_random_iterator

2854

Index: libstdc++-v3/include/debug/macros.h

2855

===================================================================

2856

--- a/src/libstdc++-v3/include/debug/macros.h (.../tags/gcc_4_8_2_release)

2857

+++ b/src/libstdc++-v3/include/debug/macros.h (.../branches/gcc-4_8-branch)

2858

@@ -261,8 +261,9 @@

2859

w.r.t. the value _Value. */

2860

#define __glibcxx_check_partitioned_lower(_First,_Last,_Value) \

2861

__glibcxx_check_valid_range(_First,_Last); \

2862

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower(_First, _Last, \

2863

- _Value), \

2864

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower( \

2865

+ __gnu_debug::__base(_First), \

2866

+ __gnu_debug::__base(_Last), _Value), \

2867

_M_message(__gnu_debug::__msg_unpartitioned) \

2868

._M_iterator(_First, #_First) \

2869

._M_iterator(_Last, #_Last) \

2870

@@ -270,8 +271,9 @@

2871

2872

#define __glibcxx_check_partitioned_upper(_First,_Last,_Value) \

2873

__glibcxx_check_valid_range(_First,_Last); \

2874

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper(_First, _Last, \

2875

- _Value), \

2876

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper( \

2877

+ __gnu_debug::__base(_First), \

2878

+ __gnu_debug::__base(_Last), _Value), \

2879

_M_message(__gnu_debug::__msg_unpartitioned) \

2880

._M_iterator(_First, #_First) \

2881

._M_iterator(_Last, #_Last) \

2882

@@ -281,8 +283,9 @@

2883

w.r.t. the value _Value and predicate _Pred. */

2884

#define __glibcxx_check_partitioned_lower_pred(_First,_Last,_Value,_Pred) \

2885

__glibcxx_check_valid_range(_First,_Last); \

2886

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower(_First, _Last, \

2887

- _Value, _Pred), \

2888

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_lower( \

2889

+ __gnu_debug::__base(_First), \

2890

+ __gnu_debug::__base(_Last), _Value, _Pred), \

2891

_M_message(__gnu_debug::__msg_unpartitioned_pred) \

2892

._M_iterator(_First, #_First) \

2893

._M_iterator(_Last, #_Last) \

2894

@@ -293,8 +296,9 @@

2895

w.r.t. the value _Value and predicate _Pred. */

2896

#define __glibcxx_check_partitioned_upper_pred(_First,_Last,_Value,_Pred) \

2897

__glibcxx_check_valid_range(_First,_Last); \

2898

-_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper(_First, _Last, \

2899

- _Value, _Pred), \

2900

+_GLIBCXX_DEBUG_VERIFY(__gnu_debug::__check_partitioned_upper( \

2901

+ __gnu_debug::__base(_First), \

2902

+ __gnu_debug::__base(_Last), _Value, _Pred), \

2903

_M_message(__gnu_debug::__msg_unpartitioned_pred) \

2904

._M_iterator(_First, #_First) \

2905

._M_iterator(_Last, #_Last) \

2906

Index: libstdc++-v3/include/bits/stl_algo.h

2907

===================================================================

2908

--- a/src/libstdc++-v3/include/bits/stl_algo.h (.../tags/gcc_4_8_2_release)

2909

+++ b/src/libstdc++-v3/include/bits/stl_algo.h (.../branches/gcc-4_8-branch)

2910

@@ -2279,7 +2279,7 @@

2911

_RandomAccessIterator __last)

2912

{

2913

_RandomAccessIterator __mid = __first + (__last - __first) / 2;

2914

- std::__move_median_to_first(__first, __first + 1, __mid, (__last - 2));

2915

+ std::__move_median_to_first(__first, __first + 1, __mid, __last - 1);

2916

return std::__unguarded_partition(__first + 1, __last, *__first);

2917

}

2918

2919

@@ -2291,7 +2291,7 @@

2920

_RandomAccessIterator __last, _Compare __comp)

2921

{

2922

_RandomAccessIterator __mid = __first + (__last - __first) / 2;

2923

- std::__move_median_to_first(__first, __first + 1, __mid, (__last - 2),

2924

+ std::__move_median_to_first(__first, __first + 1, __mid, __last - 1,

2925

__comp);

2926

return std::__unguarded_partition(__first + 1, __last, *__first, __comp);

2927

}

2928

Index: libstdc++-v3/include/bits/shared_ptr_base.h

2929

===================================================================

2930

--- a/src/libstdc++-v3/include/bits/shared_ptr_base.h (.../tags/gcc_4_8_2_release)

2931

+++ b/src/libstdc++-v3/include/bits/shared_ptr_base.h (.../branches/gcc-4_8-branch)

2932

@@ -391,7 +391,7 @@

2933

public:

2934

template<typename... _Args>

2935

_Sp_counted_ptr_inplace(_Alloc __a, _Args&&... __args)

2936

- : _M_impl(__a), _M_storage()

2937

+ : _M_impl(__a)

2938

{

2939

_M_impl._M_ptr = static_cast<_Tp*>(static_cast<void*>(&_M_storage));

2940

// _GLIBCXX_RESOLVE_LIB_DEFECTS

2941

@@ -819,7 +819,7 @@

2942

: _M_ptr(__r.get()), _M_refcount()

2943

{

2944

__glibcxx_function_requires(_ConvertibleConcept<_Tp1*, _Tp*>)

2945

- auto __tmp = std::__addressof(*__r.get());

2946

+ auto __tmp = __r.get();

2947

_M_refcount = __shared_count<_Lp>(std::move(__r));

2948

__enable_shared_from_this_helper(_M_refcount, __tmp, __tmp);

2949

}

2950

Index: libstdc++-v3/include/c_global/cstdio

2951

===================================================================

2952

--- a/src/libstdc++-v3/include/c_global/cstdio (.../tags/gcc_4_8_2_release)

2953

+++ b/src/libstdc++-v3/include/c_global/cstdio (.../branches/gcc-4_8-branch)

2954

@@ -69,6 +69,7 @@

2955

#undef ftell

2956

#undef fwrite

2957

#undef getc

2958

+#undef getchar

2959

#undef gets

2960

#undef perror

2961

#undef printf

2962

Index: libstdc++-v3/ChangeLog

2963

===================================================================

2964

--- a/src/libstdc++-v3/ChangeLog (.../tags/gcc_4_8_2_release)

2965

+++ b/src/libstdc++-v3/ChangeLog (.../branches/gcc-4_8-branch)

2966

@@ -1,3 +1,62 @@

2967

+2013-11-22 Jonathan Wakely <jwakely.gcc@gmail.com>

2968

+

2969

+ * acinclude.m4 (libtool_VERSION): Bump.

2970

+ * configure: Regenerate.

2971

+ * doc/xml/manual/abi.xml: Update version information.

2972

+

2973

+2013-11-05 Jonathan Wakely <jwakely.gcc@gmail.com>

2974

+

2975

+ * doc/xml/manual/status_cxx2011.xml: Document aligned_union as

2976

+ missing.

2977

+

2978

+ * doc/xml/manual/spine.xml: Update copyright years.

2979

+ * doc/html/*: Regenerate.

2980

+

2981

+2013-11-01 Paolo Carlini <paolo.carlini@oracle.com>

2982

+

2983

+ PR libstdc++/58952

2984

+ * include/c_global/cstdio: Undef getchar.

2985

+

2986

+2013-10-31 Jonathan Wakely <jwakely.gcc@gmail.com>

2987

+

2988

+ * testsuite/20_util/shared_ptr/cons/58839.cc: Do not use

2989

+ default_delete<void>.

2990

+

2991

+2013-10-30 Chris Studholme <cvs@cs.utoronto.ca>

2992

+

2993

+ PR libstdc++/58912

2994

+ * include/bits/shared_ptr_base.h (_Sp_counted_ptr_inplace): Remove

2995

+ unnecessary initialization of storage buffer.

2996

+

2997

+2013-10-29 Jonathan Wakely <jwakely.gcc@gmail.com>

2998

+

2999

+ PR libstdc++/58839

3000

+ * include/bits/shared_ptr_base.h

3001

+ (__shared_ptr<T>::__shared_ptr(unique_ptr<U,D>&&)): Do not dereference

3002

+ pointer.

3003

+ * testsuite/20_util/shared_ptr/cons/58839.cc: New.

3004

+

3005

+2013-10-20 Chris Jefferson <chris@bubblescope.net>

3006

+ Paolo Carlini <paolo.carlini@oracle.com>

3007

+

3008

+ PR libstdc++/58800

3009

+ * include/bits/stl_algo.h (__unguarded_partition_pivot): Change

3010

+ __last - 2 to __last - 1.

3011

+ * testsuite/25_algorithms/nth_element/58800.cc: New

3012

+

3013

+2013-10-16 François Dumont <fdumont@gcc.gnu.org>

3014

+

3015

+ PR libstdc++/58191

3016

+ * include/debug/macros.h (__glibcxx_check_partitioned_lower): Add

3017

+ __gnu_debug::__base calls on iterators passed to internal debug

3018

+ check.

3019

+ (__glibcxx_check_partitioned_lower_pred): Likewise.

3020

+ (__glibcxx_check_partitioned_upper): Likewise.

3021

+ (__glibcxx_check_partitioned_upper_pred): Likewise.

3022

+ * include/debug/functions.h (__check_partitioned_lower):

3023

+ Remove code to detect safe iterators.

3024

+ (__check_partitioned_upper): Likewise.

3025

+

3026

2013-10-16 Release Manager

3027

3028

* GCC 4.8.2 released.

3029

Index: libstdc++-v3/testsuite/25_algorithms/nth_element/58800.cc

3030

===================================================================

3031

--- a/src/libstdc++-v3/testsuite/25_algorithms/nth_element/58800.cc (.../tags/gcc_4_8_2_release)

3032

+++ b/src/libstdc++-v3/testsuite/25_algorithms/nth_element/58800.cc (.../branches/gcc-4_8-branch)

3033

@@ -0,0 +1,52 @@

3034

3035

+//

3036

+// This file is part of the GNU ISO C++ Library. This library is free

3037

+// software; you can redistribute it and/or modify it under the

3038

+// terms of the GNU General Public License as published by the

3039

+// Free Software Foundation; either version 3, or (at your option)

3040

+// any later version.

3041

+

3042

+// This library is distributed in the hope that it will be useful,

3043

+// but WITHOUT ANY WARRANTY; without even the implied warranty of

3044

+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

3045

+// GNU General Public License for more details.

3046

+

3047

+// You should have received a copy of the GNU General Public License along

3048

+// with this library; see the file COPYING3. If not see

3049

+// <http://www.gnu.org/licenses/>.

3050

+

3051

+// 25.3.2 [lib.alg.nth.element]

3052

+

3053

+// { dg-options "-std=gnu++11" }

3054

+

3055

+#include <algorithm>

3056

+#include <testsuite_hooks.h>

3057

+#include <testsuite_iterators.h>

3058

+

3059

+using __gnu_test::test_container;

3060

+using __gnu_test::random_access_iterator_wrapper;

3061

+

3062

+typedef test_container<int, random_access_iterator_wrapper> Container;

3063

+

3064

+void test01()

3065

+{

3066

+ std::vector<int> v = {

3067

+ 207089,

3068

+ 202585,

3069

+ 180067,

3070

+ 157549,

3071

+ 211592,

3072

+ 216096,

3073

+ 207089

3074

+ };

3075

+

3076

+ Container con(v.data(), v.data() + 7);

3077

+

3078

+ std::nth_element(con.begin(), con.begin() + 3, con.end());

3079

+}

3080

+

3081

+int main()

3082

+{

3083

+ test01();

3084

+ return 0;

3085

+}

3086

Index: libstdc++-v3/testsuite/20_util/shared_ptr/cons/58839.cc

3087

===================================================================

3088

--- a/src/libstdc++-v3/testsuite/20_util/shared_ptr/cons/58839.cc (.../tags/gcc_4_8_2_release)

3089

+++ b/src/libstdc++-v3/testsuite/20_util/shared_ptr/cons/58839.cc (.../branches/gcc-4_8-branch)

3090

@@ -0,0 +1,33 @@

3091

+// { dg-options "-std=gnu++11" }

3092

+// { dg-do compile }

3093

+

3094

3095

+//

3096

+// This file is part of the GNU ISO C++ Library. This library is free

3097

+// software; you can redistribute it and/or modify it under the

3098

+// terms of the GNU General Public License as published by the

3099

+// Free Software Foundation; either version 3, or (at your option)

3100

+// any later version.

3101

+

3102

+// This library is distributed in the hope that it will be useful,

3103

+// but WITHOUT ANY WARRANTY; without even the implied warranty of

3104

+// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

3105

+// GNU General Public License for more details.

3106

+

3107

+// You should have received a copy of the GNU General Public License along

3108

+// with this library; see the file COPYING3. If not see

3109

+// <http://www.gnu.org/licenses/>.

3110

+

3111

+#include <memory>

3112

+

3113

+// libstdc++/58839

3114

+

3115

+struct D {

3116

+ void operator()(void*) const noexcept { }

3117

+};

3118

+

3119

+void test01()

3120

+{

3121

+ std::unique_ptr<void, D> y;

3122

+ std::shared_ptr<void> x = std::move(y);

3123

+}

3124

Index: libstdc++-v3/acinclude.m4

3125

===================================================================

3126

--- a/src/libstdc++-v3/acinclude.m4 (.../tags/gcc_4_8_2_release)

3127

+++ b/src/libstdc++-v3/acinclude.m4 (.../branches/gcc-4_8-branch)

3128

@@ -3266,7 +3266,7 @@

3129

fi

3130

3131

# For libtool versioning info, format is CURRENT:REVISION:AGE

3132

-libtool_VERSION=6:18:0

3133

+libtool_VERSION=6:19:0

3134

3135

# Everything parsed; figure out what files and settings to use.

3136

case $enable_symvers in

3137

Index: contrib/ChangeLog

3138

===================================================================

3139

--- a/src/contrib/ChangeLog (.../tags/gcc_4_8_2_release)

3140

+++ b/src/contrib/ChangeLog (.../branches/gcc-4_8-branch)

3141

@@ -1,3 +1,7 @@

3142

+2013-10-21 Mike Stump <mikestump@comcast.net>

3143

+

3144

+ * gcc_update (configure): Update to handle svn 1.8.1.

3145

+

3146

2013-10-16 Release Manager

3147

3148

* GCC 4.8.2 released.

3149

Index: contrib/gcc_update

3150

===================================================================

3151

--- a/src/contrib/gcc_update (.../tags/gcc_4_8_2_release)

3152

+++ b/src/contrib/gcc_update (.../branches/gcc-4_8-branch)

3153

@@ -382,7 +382,7 @@

3154

fi

3155

3156

revision=`$GCC_SVN info | awk '/Revision:/ { print $2 }'`

3157

- branch=`$GCC_SVN info | sed -ne "/URL:/ {

3158

+ branch=`$GCC_SVN info | sed -ne "/^URL:/ {

3159

s,.*/trunk,trunk,

3160

s,.*/branches/,,

3161

s,.*/tags/,,

3162

Index: libgcc/ChangeLog

3163

===================================================================

3164

--- a/src/libgcc/ChangeLog (.../tags/gcc_4_8_2_release)

3165

+++ b/src/libgcc/ChangeLog (.../branches/gcc-4_8-branch)

3166

@@ -1,3 +1,21 @@

3167

+2013-11-10 Kai Tietz <ktietz@redhat.com>

3168

+

3169

+ Back-merged from trunk

3170

+ * config/i386/cygming-crtbegin.c (__gcc_register_frame):

3171

+ Increment load-count on use of LIBGCC_SONAME DLL.

3172

+ (hmod_libgcc): New static variable to hold handle of

3173

+ LIBGCC_SONAME DLL.

3174

+ (__gcc_deregister_frame): Decrement load-count of

3175

+ LIBGCC_SONAME DLL.

3176

+

3177

+2013-11-07 Uros Bizjak <ubizjak@gmail.com>

3178

+

3179

+ * config/i386/sfp-exceptions.c (__sfp_handle_exceptions): Handle

3180

+ FP_EX_DENORM. Store result to volatile location after SSE division

3181

+ to close interrupt window. Remove unneeded fwait after x87

3182

+ division since interrupt window will be closed by emitted fstp.

3183

+ Rewrite FP_EX_INEXACT handling.

3184

+

3185

2013-10-16 Release Manager

3186

3187

* GCC 4.8.2 released.

3188

Index: libgcc/config/i386/sfp-exceptions.c

3189

===================================================================

3190

--- a/src/libgcc/config/i386/sfp-exceptions.c (.../tags/gcc_4_8_2_release)

3191

+++ b/src/libgcc/config/i386/sfp-exceptions.c (.../branches/gcc-4_8-branch)

3192

@@ -48,20 +48,32 @@

3193

{

3194

float f = 0.0f;

3195

#ifdef __x86_64__

3196

+ volatile float r __attribute__ ((unused));

3197

asm volatile ("%vdivss\t{%0, %d0|%d0, %0}" : "+x" (f));

3198

+ r = f; /* Needed to trigger exception. */

3199

#else

3200

asm volatile ("fdiv\t{%y0, %0|%0, %y0}" : "+t" (f));

3201

- asm volatile ("fwait");

3202

+ /* No need for fwait, exception is triggered by emitted fstp. */

3203

#endif

3204

}

3205

+ if (_fex & FP_EX_DENORM)

3206

+ {

3207

+ struct fenv temp;

3208

+ asm volatile ("fnstenv\t%0" : "=m" (temp));

3209

+ temp.__status_word |= FP_EX_DENORM;

3210

+ asm volatile ("fldenv\t%0" : : "m" (temp));

3211

+ asm volatile ("fwait");

3212

+ }

3213

if (_fex & FP_EX_DIVZERO)

3214

{

3215

float f = 1.0f, g = 0.0f;

3216

#ifdef __x86_64__

3217

+ volatile float r __attribute__ ((unused));

3218

asm volatile ("%vdivss\t{%1, %d0|%d0, %1}" : "+x" (f) : "xm" (g));

3219

+ r = f; /* Needed to trigger exception. */

3220

#else

3221

asm volatile ("fdivs\t%1" : "+t" (f) : "m" (g));

3222

- asm volatile ("fwait");

3223

+ /* No need for fwait, exception is triggered by emitted fstp. */

3224

#endif

3225

}

3226

if (_fex & FP_EX_OVERFLOW)

3227

@@ -82,11 +94,15 @@

3228

}

3229

if (_fex & FP_EX_INEXACT)

3230

{

3231

- struct fenv temp;

3232

- asm volatile ("fnstenv\t%0" : "=m" (temp));

3233

- temp.__status_word |= FP_EX_INEXACT;

3234

- asm volatile ("fldenv\t%0" : : "m" (temp));

3235

- asm volatile ("fwait");

3236

+ float f = 1.0f, g = 3.0f;

3237

+#ifdef __x86_64__

3238

+ volatile float r __attribute__ ((unused));

3239

+ asm volatile ("%vdivss\t{%1, %d0|%d0, %1}" : "+x" (f) : "xm" (g));

3240

+ r = f; /* Needed to trigger exception. */

3241

+#else

3242

+ asm volatile ("fdivs\t%1" : "+t" (f) : "m" (g));

3243

+ /* No need for fwait, exception is triggered by emitted fstp. */

3244

+#endif

3245

}

3246

};

3247

#endif

3248

Index: libgcc/config/i386/cygming-crtbegin.c

3249

===================================================================

3250

--- a/src/libgcc/config/i386/cygming-crtbegin.c (.../tags/gcc_4_8_2_release)

3251

+++ b/src/libgcc/config/i386/cygming-crtbegin.c (.../branches/gcc-4_8-branch)

3252

@@ -69,6 +69,9 @@

3253

= { };

3254

3255

static struct object obj;

3256

+

3257

+/* Handle of libgcc's DLL reference. */

3258

+HANDLE hmod_libgcc;

3259

#endif

3260

3261

#if TARGET_USE_JCR_SECTION

3262

@@ -93,9 +96,14 @@

3263

3264

void (*register_frame_fn) (const void *, struct object *);

3265

HANDLE h = GetModuleHandle (LIBGCC_SONAME);

3266

+

3267

if (h)

3268

- register_frame_fn = (void (*) (const void *, struct object *))

3269

- GetProcAddress (h, "__register_frame_info");

3270

+ {

3271

+ /* Increasing the load-count of LIBGCC_SONAME DLL. */

3272

+ hmod_libgcc = LoadLibrary (LIBGCC_SONAME);

3273

+ register_frame_fn = (void (*) (const void *, struct object *))

3274

+ GetProcAddress (h, "__register_frame_info");

3275

+ }

3276

else

3277

register_frame_fn = __register_frame_info;

3278

if (register_frame_fn)

3279

@@ -132,5 +140,7 @@

3280

deregister_frame_fn = __deregister_frame_info;

3281

if (deregister_frame_fn)

3282

deregister_frame_fn (__EH_FRAME_BEGIN__);

3283

+ if (hmod_libgcc)

3284

+ FreeLibrary (hmod_libgcc);

3285

#endif

3286

}

3287

Index: gcc/tree-vrp.c

3288

===================================================================

3289

--- a/src/gcc/tree-vrp.c (.../tags/gcc_4_8_2_release)

3290

+++ b/src/gcc/tree-vrp.c (.../branches/gcc-4_8-branch)

3291

@@ -5271,9 +5271,13 @@

3292

}

3293

else if (CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (op_def)))

3294

{

3295

- /* Recurse through the type conversion. */

3296

- retval |= register_edge_assert_for_1 (gimple_assign_rhs1 (op_def),

3297

- code, e, bsi);

3298

+ /* Recurse through the type conversion, unless it is a narrowing

3299

+ conversion or conversion from non-integral type. */

3300

+ tree rhs = gimple_assign_rhs1 (op_def);

3301

+ if (INTEGRAL_TYPE_P (TREE_TYPE (rhs))

3302

+ && (TYPE_PRECISION (TREE_TYPE (rhs))

3303

+ <= TYPE_PRECISION (TREE_TYPE (op))))

3304

+ retval |= register_edge_assert_for_1 (rhs, code, e, bsi);

3305

}

3306

3307

return retval;

3308

Index: gcc/loop-unswitch.c

3309

===================================================================

3310

--- a/src/gcc/loop-unswitch.c (.../tags/gcc_4_8_2_release)

3311

+++ b/src/gcc/loop-unswitch.c (.../branches/gcc-4_8-branch)

3312

@@ -191,6 +191,7 @@

3313

if (!test)

3314

return NULL_RTX;

3315

3316

+ mode = VOIDmode;

3317

for (i = 0; i < 2; i++)

3318

{

3319

op[i] = XEXP (test, i);

3320

@@ -205,11 +206,15 @@

3321

return NULL_RTX;

3322

3323

op[i] = get_iv_value (&iv, const0_rtx);

3324

+ if (iv.extend != IV_UNKNOWN_EXTEND

3325

+ && iv.mode != iv.extend_mode)

3326

+ op[i] = lowpart_subreg (iv.mode, op[i], iv.extend_mode);

3327

+ if (mode == VOIDmode)

3328

+ mode = iv.mode;

3329

+ else

3330

+ gcc_assert (mode == iv.mode);

3331

}

3332

3333

- mode = GET_MODE (op[0]);

3334

- if (mode == VOIDmode)

3335

- mode = GET_MODE (op[1]);

3336

if (GET_MODE_CLASS (mode) == MODE_CC)

3337

{

3338

if (at != BB_END (bb))

3339

Index: gcc/tree-ssa-loop-im.c

3340

===================================================================

3341

--- a/src/gcc/tree-ssa-loop-im.c (.../tags/gcc_4_8_2_release)

3342

+++ b/src/gcc/tree-ssa-loop-im.c (.../branches/gcc-4_8-branch)

3343

@@ -1190,6 +1190,67 @@

3344

fini_walk_dominator_tree (&walk_data);

3345

}

3346

3347

+/* Return true if CODE is an operation that when operating on signed

3348

+ integer types involves undefined behavior on overflow and the

3349

+ operation can be expressed with unsigned arithmetic. */

3350

+

3351

+static bool

3352

+arith_code_with_undefined_signed_overflow (tree_code code)

3353

+{

3354

+ switch (code)

3355

+ {

3356

+ case PLUS_EXPR:

3357

+ case MINUS_EXPR:

3358

+ case MULT_EXPR:

3359

+ case NEGATE_EXPR:

3360

+ case POINTER_PLUS_EXPR:

3361

+ return true;

3362

+ default:

3363

+ return false;

3364

+ }

3365

+}

3366

+

3367

+/* Rewrite STMT, an assignment with a signed integer or pointer arithmetic

3368

+ operation that can be transformed to unsigned arithmetic by converting

3369

+ its operand, carrying out the operation in the corresponding unsigned

3370

+ type and converting the result back to the original type.

3371

+

3372

+ Returns a sequence of statements that replace STMT and also contain

3373

+ a modified form of STMT itself. */

3374

+

3375

+static gimple_seq

3376

+rewrite_to_defined_overflow (gimple stmt)

3377

+{

3378

+ if (dump_file && (dump_flags & TDF_DETAILS))

3379

+ {

3380

+ fprintf (dump_file, "rewriting stmt with undefined signed "

3381

+ "overflow ");

3382

+ print_gimple_stmt (dump_file, stmt, 0, TDF_SLIM);

3383

+ }

3384

+

3385

+ tree lhs = gimple_assign_lhs (stmt);

3386

+ tree type = unsigned_type_for (TREE_TYPE (lhs));

3387

+ gimple_seq stmts = NULL;

3388

+ for (unsigned i = 1; i < gimple_num_ops (stmt); ++i)

3389

+ {

3390

+ gimple_seq stmts2 = NULL;

3391

+ gimple_set_op (stmt, i,

3392

+ force_gimple_operand (fold_convert (type,

3393

+ gimple_op (stmt, i)),

3394

+ &stmts2, true, NULL_TREE));

3395

+ gimple_seq_add_seq (&stmts, stmts2);

3396

+ }

3397

+ gimple_assign_set_lhs (stmt, make_ssa_name (type, stmt));

3398

+ if (gimple_assign_rhs_code (stmt) == POINTER_PLUS_EXPR)

3399

+ gimple_assign_set_rhs_code (stmt, PLUS_EXPR);

3400

+ gimple_seq_add_stmt (&stmts, stmt);

3401

+ gimple cvt = gimple_build_assign_with_ops

3402

+ (NOP_EXPR, lhs, gimple_assign_lhs (stmt), NULL_TREE);

3403

+ gimple_seq_add_stmt (&stmts, cvt);

3404

+

3405

+ return stmts;

3406

+}

3407

+

3408

/* Hoist the statements in basic block BB out of the loops prescribed by

3409

data stored in LIM_DATA structures associated with each statement. Callback

3410

for walk_dominator_tree. */

3411

@@ -1321,7 +1382,21 @@

3412

}

3413

}

3414

gsi_remove (&bsi, false);

3415

- gsi_insert_on_edge (e, stmt);

3416

+ /* In case this is a stmt that is not unconditionally executed

3417

+ when the target loop header is executed and the stmt may

3418

+ invoke undefined integer or pointer overflow rewrite it to

3419

+ unsigned arithmetic. */

3420

+ if (is_gimple_assign (stmt)

3421

+ && INTEGRAL_TYPE_P (TREE_TYPE (gimple_assign_lhs (stmt)))

3422

+ && TYPE_OVERFLOW_UNDEFINED (TREE_TYPE (gimple_assign_lhs (stmt)))

3423

+ && arith_code_with_undefined_signed_overflow

3424

+ (gimple_assign_rhs_code (stmt))

3425

+ && (!ALWAYS_EXECUTED_IN (bb)

3426

+ || !(ALWAYS_EXECUTED_IN (bb) == level

3427

+ || flow_loop_nested_p (ALWAYS_EXECUTED_IN (bb), level))))

3428

+ gsi_insert_seq_on_edge (e, rewrite_to_defined_overflow (stmt));

3429

+ else

3430

+ gsi_insert_on_edge (e, stmt);

3431

}

3432

}

3433

3434

Index: gcc/tree-ssa-tail-merge.c

3435

===================================================================

3436

--- a/src/gcc/tree-ssa-tail-merge.c (.../tags/gcc_4_8_2_release)

3437

+++ b/src/gcc/tree-ssa-tail-merge.c (.../branches/gcc-4_8-branch)

3438

@@ -297,7 +297,8 @@

3439

tree val;

3440

def_operand_p def_p;

3441

3442

- if (gimple_has_side_effects (stmt))

3443

+ if (gimple_has_side_effects (stmt)

3444

+ || gimple_vdef (stmt) != NULL_TREE)

3445

return false;

3446

3447

def_p = SINGLE_SSA_DEF_OPERAND (stmt, SSA_OP_DEF);

3448

Index: gcc/cgraphbuild.c

3449

===================================================================

3450

--- a/src/gcc/cgraphbuild.c (.../tags/gcc_4_8_2_release)

3451

+++ b/src/gcc/cgraphbuild.c (.../branches/gcc-4_8-branch)

3452

@@ -73,7 +73,7 @@

3453

decl = get_base_var (*tp);

3454

if (TREE_CODE (decl) == FUNCTION_DECL)

3455

{

3456

- struct cgraph_node *node = cgraph_get_create_node (decl);

3457

+ struct cgraph_node *node = cgraph_get_create_real_symbol_node (decl);

3458

if (!ctx->only_vars)

3459

cgraph_mark_address_taken_node (node);

3460

ipa_record_reference ((symtab_node)ctx->varpool_node,

3461

@@ -143,7 +143,7 @@

3462

{

3463

struct cgraph_node *per_node;

3464

3465

- per_node = cgraph_get_create_node (DECL_FUNCTION_PERSONALITY (node->symbol.decl));

3466

+ per_node = cgraph_get_create_real_symbol_node (DECL_FUNCTION_PERSONALITY (node->symbol.decl));

3467

ipa_record_reference ((symtab_node)node, (symtab_node)per_node, IPA_REF_ADDR, NULL);

3468

cgraph_mark_address_taken_node (per_node);

3469

}

3470

@@ -223,7 +223,7 @@

3471

addr = get_base_address (addr);

3472

if (TREE_CODE (addr) == FUNCTION_DECL)

3473

{

3474

- struct cgraph_node *node = cgraph_get_create_node (addr);

3475

+ struct cgraph_node *node = cgraph_get_create_real_symbol_node (addr);

3476

cgraph_mark_address_taken_node (node);

3477

ipa_record_reference ((symtab_node)data,

3478

(symtab_node)node,

3479

@@ -252,7 +252,7 @@

3480

{

3481

/* ??? This can happen on platforms with descriptors when these are

3482

directly manipulated in the code. Pretend that it's an address. */

3483

- struct cgraph_node *node = cgraph_get_create_node (t);

3484

+ struct cgraph_node *node = cgraph_get_create_real_symbol_node (t);

3485

cgraph_mark_address_taken_node (node);

3486

ipa_record_reference ((symtab_node)data,

3487

(symtab_node)node,

3488

@@ -330,7 +330,7 @@

3489

{

3490

tree fn = gimple_omp_parallel_child_fn (stmt);

3491

ipa_record_reference ((symtab_node)node,

3492

- (symtab_node)cgraph_get_create_node (fn),

3493

+ (symtab_node)cgraph_get_create_real_symbol_node (fn),

3494

IPA_REF_ADDR, stmt);

3495

}

3496

if (gimple_code (stmt) == GIMPLE_OMP_TASK)

3497

@@ -338,12 +338,12 @@

3498

tree fn = gimple_omp_task_child_fn (stmt);

3499

if (fn)

3500

ipa_record_reference ((symtab_node)node,

3501

- (symtab_node) cgraph_get_create_node (fn),

3502

+ (symtab_node) cgraph_get_create_real_symbol_node (fn),

3503

IPA_REF_ADDR, stmt);

3504

fn = gimple_omp_task_copy_fn (stmt);

3505

if (fn)

3506

ipa_record_reference ((symtab_node)node,

3507

- (symtab_node)cgraph_get_create_node (fn),

3508

+ (symtab_node)cgraph_get_create_real_symbol_node (fn),

3509

IPA_REF_ADDR, stmt);

3510

}

3511

}

3512

Index: gcc/c-family/ChangeLog

3513

===================================================================

3514

--- a/src/gcc/c-family/ChangeLog (.../tags/gcc_4_8_2_release)

3515

+++ b/src/gcc/c-family/ChangeLog (.../branches/gcc-4_8-branch)

3516

@@ -1,3 +1,18 @@

3517

+2013-11-29 Jakub Jelinek <jakub@redhat.com>

3518

+

3519

+ PR c/59280

3520

+ * c-common.c (get_priority): If TREE_VALUE (args) is IDENTIFIER_NODE,

3521

+ goto invalid. If it is error_mark_node, don't issue further

3522

+ diagnostics.

3523

+

3524

+2013-11-04 Marek Polacek <polacek@redhat.com>

3525

+

3526

+ Backport from mainline

3527

+ 2013-11-04 Marek Polacek <polacek@redhat.com>

3528

+

3529

+ PR c++/58979

3530

+ * c-common.c (invalid_indirection_error): Handle RO_ARROW_STAR case.

3531

+

3532

2013-10-16 Release Manager

3533

3534

* GCC 4.8.2 released.

3535

Index: gcc/c-family/c-common.c

3536

===================================================================

3537

--- a/src/gcc/c-family/c-common.c (.../tags/gcc_4_8_2_release)

3538

+++ b/src/gcc/c-family/c-common.c (.../branches/gcc-4_8-branch)

3539

@@ -6917,6 +6917,10 @@

3540

}

3541

3542

arg = TREE_VALUE (args);

3543

+ if (TREE_CODE (arg) == IDENTIFIER_NODE)

3544

+ goto invalid;

3545

+ if (arg == error_mark_node)

3546

+ return DEFAULT_INIT_PRIORITY;

3547

arg = default_conversion (arg);

3548

if (!host_integerp (arg, /*pos=*/0)

3549

|| !INTEGRAL_TYPE_P (TREE_TYPE (arg)))

3550

@@ -9763,6 +9767,11 @@

3551

"invalid type argument of %<->%> (have %qT)",

3552

type);

3553

break;

3554

+ case RO_ARROW_STAR:

3555

+ error_at (loc,

3556

+ "invalid type argument of %<->*%> (have %qT)",

3557

+ type);

3558

+ break;

3559

case RO_IMPLICIT_CONVERSION:

3560

error_at (loc,

3561

"invalid type argument of implicit conversion (have %qT)",

3562

Index: gcc/cgraph.c

3563

===================================================================

3564

--- a/src/gcc/cgraph.c (.../tags/gcc_4_8_2_release)

3565

+++ b/src/gcc/cgraph.c (.../branches/gcc-4_8-branch)

3566

@@ -2596,4 +2596,47 @@

3567

FOR_EACH_FUNCTION (node)

3568

verify_cgraph_node (node);

3569

}

3570

+

3571

+/* Create external decl node for DECL.

3572

+ The difference i nbetween cgraph_get_create_node and

3573

+ cgraph_get_create_real_symbol_node is that cgraph_get_create_node

3574

+ may return inline clone, while cgraph_get_create_real_symbol_node

3575

+ will create a new node in this case.

3576

+ FIXME: This function should be removed once clones are put out of decl

3577

+ hash. */

3578

+

3579

+struct cgraph_node *

3580

+cgraph_get_create_real_symbol_node (tree decl)

3581

+{

3582

+ struct cgraph_node *first_clone = cgraph_get_node (decl);

3583

+ struct cgraph_node *node;

3584

+ /* create symbol table node. even if inline clone exists, we can not take

3585

+ it as a target of non-inlined call. */

3586

+ node = cgraph_get_node (decl);

3587

+ if (node && !node->global.inlined_to)

3588

+ return node;

3589

+

3590

+ node = cgraph_create_node (decl);

3591

+

3592

+ /* ok, we previously inlined the function, then removed the offline copy and

3593

+ now we want it back for external call. this can happen when devirtualizing

3594

+ while inlining function called once that happens after extern inlined and

3595

+ virtuals are already removed. in this case introduce the external node

3596

+ and make it available for call. */

3597

+ if (first_clone)

3598

+ {

3599

+ first_clone->clone_of = node;

3600

+ node->clones = first_clone;

3601

+ symtab_prevail_in_asm_name_hash ((symtab_node) node);

3602

+ symtab_insert_node_to_hashtable ((symtab_node) node);

3603

+ if (dump_file)

3604

+ fprintf (dump_file, "Introduced new external node "

3605

+ "(%s/%i) and turned into root of the clone tree.\n",

3606

+ xstrdup (cgraph_node_name (node)), node->uid);

3607

+ }

3608

+ else if (dump_file)

3609

+ fprintf (dump_file, "Introduced new external node "

3610

+ "(%s/%i).\n", xstrdup (cgraph_node_name (node)), node->uid);

3611

+ return node;

3612

+}

3613

#include "gt-cgraph.h"

3614

Index: gcc/cgraph.h

3615

===================================================================

3616

--- a/src/gcc/cgraph.h (.../tags/gcc_4_8_2_release)

3617

+++ b/src/gcc/cgraph.h (.../branches/gcc-4_8-branch)

3618

@@ -575,6 +575,7 @@

3619

struct cgraph_node * cgraph_create_node (tree);

3620

struct cgraph_node * cgraph_create_empty_node (void);

3621

struct cgraph_node * cgraph_get_create_node (tree);

3622

+struct cgraph_node * cgraph_get_create_real_symbol_node (tree);

3623

struct cgraph_node * cgraph_same_body_alias (struct cgraph_node *, tree, tree);

3624

struct cgraph_node * cgraph_add_thunk (struct cgraph_node *, tree, tree, bool, HOST_WIDE_INT,

3625

HOST_WIDE_INT, tree, tree);

3626

Index: gcc/optabs.c

3627

===================================================================

3628

--- a/src/gcc/optabs.c (.../tags/gcc_4_8_2_release)

3629

+++ b/src/gcc/optabs.c (.../branches/gcc-4_8-branch)

3630

@@ -7035,8 +7035,7 @@

3631

3632

create_output_operand (&ops[0], target, mode);

3633

create_fixed_operand (&ops[1], mem);

3634

- /* VAL may have been promoted to a wider mode. Shrink it if so. */

3635

- create_convert_operand_to (&ops[2], val, mode, true);

3636

+ create_input_operand (&ops[2], val, mode);

3637

create_integer_operand (&ops[3], model);

3638

if (maybe_expand_insn (icode, 4, ops))

3639

return ops[0].value;

3640

@@ -7075,8 +7074,7 @@

3641

struct expand_operand ops[3];

3642

create_output_operand (&ops[0], target, mode);

3643

create_fixed_operand (&ops[1], mem);

3644

- /* VAL may have been promoted to a wider mode. Shrink it if so. */

3645

- create_convert_operand_to (&ops[2], val, mode, true);

3646

+ create_input_operand (&ops[2], val, mode);

3647

if (maybe_expand_insn (icode, 3, ops))

3648

return ops[0].value;

3649

}

3650

@@ -7118,8 +7116,6 @@

3651

{

3652

if (!target || !register_operand (target, mode))

3653

target = gen_reg_rtx (mode);

3654

- if (GET_MODE (val) != VOIDmode && GET_MODE (val) != mode)

3655

- val = convert_modes (mode, GET_MODE (val), val, 1);

3656

if (expand_compare_and_swap_loop (mem, target, val, NULL_RTX))

3657

return target;

3658

}

3659

@@ -7331,8 +7327,8 @@

3660

create_output_operand (&ops[0], target_bool, bool_mode);

3661

create_output_operand (&ops[1], target_oval, mode);

3662

create_fixed_operand (&ops[2], mem);

3663

- create_convert_operand_to (&ops[3], expected, mode, true);

3664

- create_convert_operand_to (&ops[4], desired, mode, true);

3665

+ create_input_operand (&ops[3], expected, mode);

3666

+ create_input_operand (&ops[4], desired, mode);

3667

create_integer_operand (&ops[5], is_weak);

3668

create_integer_operand (&ops[6], succ_model);

3669

create_integer_operand (&ops[7], fail_model);

3670

@@ -7353,8 +7349,8 @@

3671

3672

create_output_operand (&ops[0], target_oval, mode);

3673

create_fixed_operand (&ops[1], mem);

3674

- create_convert_operand_to (&ops[2], expected, mode, true);

3675

- create_convert_operand_to (&ops[3], desired, mode, true);

3676

+ create_input_operand (&ops[2], expected, mode);

3677

+ create_input_operand (&ops[3], desired, mode);

3678

if (!maybe_expand_insn (icode, 4, ops))

3679

return false;

3680

3681

Index: gcc/DATESTAMP

3682

===================================================================

3683

--- a/src/gcc/DATESTAMP (.../tags/gcc_4_8_2_release)

3684

+++ b/src/gcc/DATESTAMP (.../branches/gcc-4_8-branch)

3685

@@ -1 +1 @@

3686

-20131016

3687

+20131129

3688

Index: gcc/configure

3689

===================================================================

3690

--- a/src/gcc/configure (.../tags/gcc_4_8_2_release)

3691

+++ b/src/gcc/configure (.../branches/gcc-4_8-branch)

3692

@@ -24263,6 +24263,43 @@

3693

$as_echo "#define HAVE_AS_SPARC4 1" >>confdefs.h

3694

3695

fi

3696

+

3697

+ { $as_echo "$as_me:${as_lineno-$LINENO}: checking assembler for LEON instructions" >&5

3698

+$as_echo_n "checking assembler for LEON instructions... " >&6; }

3699

+if test "${gcc_cv_as_sparc_leon+set}" = set; then :

3700

+ $as_echo_n "(cached) " >&6

3701

+else

3702

+ gcc_cv_as_sparc_leon=no

3703

+ if test x$gcc_cv_as != x; then

3704

+ $as_echo '.text

3705

+ .register %g2, #scratch

3706

+ .register %g3, #scratch

3707

+ .align 4

3708

+ smac %g2, %g3, %g1

3709

+ umac %g2, %g3, %g1

3710

+ cas [%g2], %g3, %g1' > conftest.s

3711

+ if { ac_try='$gcc_cv_as $gcc_cv_as_flags -Aleon -o conftest.o conftest.s >&5'

3712

+ { { eval echo "\"\$as_me\":${as_lineno-$LINENO}: \"$ac_try\""; } >&5

3713

+ (eval $ac_try) 2>&5

3714

+ ac_status=$?

3715

+ $as_echo "$as_me:${as_lineno-$LINENO}: \$? = $ac_status" >&5

3716

+ test $ac_status = 0; }; }

3717

+ then

3718

+ gcc_cv_as_sparc_leon=yes

3719

+ else

3720

+ echo "configure: failed program was" >&5

3721

+ cat conftest.s >&5

3722

+ fi

3723

+ rm -f conftest.o conftest.s

3724

+ fi

3725

+fi

3726

+{ $as_echo "$as_me:${as_lineno-$LINENO}: result: $gcc_cv_as_sparc_leon" >&5

3727

+$as_echo "$gcc_cv_as_sparc_leon" >&6; }

3728

+if test $gcc_cv_as_sparc_leon = yes; then

3729

+

3730

+$as_echo "#define HAVE_AS_LEON 1" >>confdefs.h

3731

+

3732

+fi

3733

;;

3734

3735

i[34567]86-*-* | x86_64-*-*)

3736

@@ -27239,8 +27276,8 @@

3737

$as_echo_n "checking for exported symbols... " >&6; }

3738

if test "x$export_sym_check" != x; then

3739

echo "int main() {return 0;} int foobar() {return 0;}" > conftest.c

3740

- ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest > /dev/null 2>&1

3741

- if $export_sym_check conftest | grep foobar > /dev/null; then

3742

+ ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest$ac_exeext > /dev/null 2>&1

3743

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

3744

: # No need to use a flag

3745

{ $as_echo "$as_me:${as_lineno-$LINENO}: result: yes" >&5

3746

$as_echo "yes" >&6; }

3747

@@ -27249,8 +27286,8 @@

3748

$as_echo "yes" >&6; }

3749

{ $as_echo "$as_me:${as_lineno-$LINENO}: checking for -rdynamic" >&5

3750

$as_echo_n "checking for -rdynamic... " >&6; }

3751

- ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest > /dev/null 2>&1

3752

- if $export_sym_check conftest | grep foobar > /dev/null; then

3753

+ ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest$ac_exeext > /dev/null 2>&1

3754

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

3755

plugin_rdynamic=yes

3756

pluginlibs="-rdynamic"

3757

else

3758

Index: gcc/builtins.c

3759

===================================================================

3760

--- a/src/gcc/builtins.c (.../tags/gcc_4_8_2_release)

3761

+++ b/src/gcc/builtins.c (.../branches/gcc-4_8-branch)

3762

@@ -1958,6 +1958,7 @@

3763

tree fndecl = get_callee_fndecl (exp);

3764

enum machine_mode mode;

3765

bool errno_set = false;

3766

+ bool try_widening = false;

3767

tree arg;

3768

3769

if (!validate_arglist (exp, REAL_TYPE, VOID_TYPE))

3770

@@ -1969,6 +1970,7 @@

3771

{

3772

CASE_FLT_FN (BUILT_IN_SQRT):

3773

errno_set = ! tree_expr_nonnegative_p (arg);

3774

+ try_widening = true;

3775

builtin_optab = sqrt_optab;

3776

break;

3777

CASE_FLT_FN (BUILT_IN_EXP):

3778

@@ -2025,8 +2027,10 @@

3779

if (! flag_errno_math || ! HONOR_NANS (mode))

3780

errno_set = false;

3781

3782

- /* Before working hard, check whether the instruction is available. */

3783

- if (optab_handler (builtin_optab, mode) != CODE_FOR_nothing

3784

+ /* Before working hard, check whether the instruction is available, but try

3785

+ to widen the mode for specific operations. */

3786

+ if ((optab_handler (builtin_optab, mode) != CODE_FOR_nothing

3787

+ || (try_widening && !excess_precision_type (TREE_TYPE (exp))))

3788

&& (!errno_set || !optimize_insn_for_size_p ()))

3789

{

3790

rtx result = gen_reg_rtx (mode);

3791

Index: gcc/fold-const.c

3792

===================================================================

3793

--- a/src/gcc/fold-const.c (.../tags/gcc_4_8_2_release)

3794

+++ b/src/gcc/fold-const.c (.../branches/gcc-4_8-branch)

3795

@@ -2664,10 +2664,11 @@

3796

case COMPONENT_REF:

3797

/* Handle operand 2 the same as for ARRAY_REF. Operand 0

3798

may be NULL when we're called to compare MEM_EXPRs. */

3799

- if (!OP_SAME_WITH_NULL (0))

3800

+ if (!OP_SAME_WITH_NULL (0)

3801

+ || !OP_SAME (1))

3802

return 0;

3803

flags &= ~OEP_CONSTANT_ADDRESS_OF;

3804

- return OP_SAME (1) && OP_SAME_WITH_NULL (2);

3805

+ return OP_SAME_WITH_NULL (2);

3806

3807

case BIT_FIELD_REF:

3808

if (!OP_SAME (0))

3809

@@ -10927,6 +10928,13 @@

3810

fold_build2_loc (loc, MULT_EXPR, type,

3811

build_int_cst (type, 2) , arg1));

3812

3813

+ /* ((T) (X /[ex] C)) * C cancels out if the conversion is

3814

+ sign-changing only. */

3815

+ if (TREE_CODE (arg1) == INTEGER_CST

3816

+ && TREE_CODE (arg0) == EXACT_DIV_EXPR

3817

+ && operand_equal_p (arg1, TREE_OPERAND (arg0, 1), 0))

3818

+ return fold_convert_loc (loc, type, TREE_OPERAND (arg0, 0));

3819

+

3820

strict_overflow_p = false;

3821

if (TREE_CODE (arg1) == INTEGER_CST

3822

&& 0 != (tem = extract_muldiv (op0, arg1, code, NULL_TREE,

3823

Index: gcc/ChangeLog

3824

===================================================================

3825

--- a/src/gcc/ChangeLog (.../tags/gcc_4_8_2_release)

3826

+++ b/src/gcc/ChangeLog (.../branches/gcc-4_8-branch)

3827

@@ -1,3 +1,503 @@

3828

+2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

3829

+

3830

+ Backport from mainline

3831

+ 2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

3832

+

3833

+ * config/arm/iterators.md (vrint_conds): New int attribute.

3834

+ * config/arm/vfp.md (<vrint_pattern><SDF:mode>2): Set conds attribute.

3835

+ (smax<mode>3): Likewise.

3836

+ (smin<mode>3): Likewise.

3837

+

3838

+2013-11-19 Uros Bizjak <ubizjak@gmail.com>

3839

+

3840

+ Backport from mainline

3841

+ 2013-11-27 Uros Bizjak <ubizjak@gmail.com>

3842

+ Ganesh Gopalasubramanian <Ganesh.Gopalasubramanian@amd.com>

3843

+

3844

+ PR target/56788

3845

+ * gcc.target/i386/xop-frczX.c: New test.

3846

+

3847

+2013-11-28 Terry Guo <terry.guo@arm.com>

3848

+

3849

+ Backport mainline r205391

3850

+ 2013-11-26 Terry Guo <terry.guo@arm.com>

3851

+

3852

+ * config/arm/arm.c (require_pic_register): Handle high pic base

3853

+ register for thumb-1.

3854

+ (arm_load_pic_register): Also initialize high pic base register.

3855

+ * doc/invoke.texi: Update documentation for option -mpic-register.

3856

+

3857

+2013-11-27 Jakub Jelinek <jakub@redhat.com>

3858

+

3859

+ Backported from mainline

3860

+ 2013-11-26 Jakub Jelinek <jakub@redhat.com>

3861

+

3862

+ PR tree-optimization/59014

3863

+ * tree-vrp.c (register_edge_assert_for_1): Don't look

3864

+ through conversions from non-integral types or through

3865

+ narrowing conversions.

3866

+

3867

+2013-11-27 Eric Botcazou <ebotcazou@adacore.com>

3868

+

3869

+ PR middle-end/59138

3870

+ * expr.c (emit_group_store): Don't write past the end of the structure.

3871

+ (store_bit_field): Fix formatting.

3872

+

3873

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

3874

+

3875

+ Backport from mainline

3876

+ 2013-09-17 Sebastian Huber <sebastian.huber@embedded-brains.de>

3877

+

3878

+ * config/sparc/t-rtems: Add leon3 multilibs.

3879

+

3880

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

3881

+

3882

+ Backport from mainline

3883

+ 2013-08-09 Eric Botcazou <ebotcazou@adacore.com>

3884

+

3885

+ * configure.ac: Add GAS check for LEON instructions on SPARC.

3886

+ * configure: Regenerate.

3887

+ * config.in: Likewise.

3888

+ * config.gcc (with_cpu): Remove sparc-leon*-* and deal with LEON in the

3889

+ sparc*-*-* block.

3890

+ * config/sparc/sparc.opt (LEON, LEON3): New masks.

3891

+ * config/sparc/sparc.h (ASM_CPU32_DEFAULT_SPEC): Set to AS_LEON_FLAG

3892

+ for LEON or LEON3.

3893

+ (ASM_CPU_SPEC): Pass AS_LEON_FLAG if -mcpu=leon or -mcpu=leon3.

3894

+ (AS_LEON_FLAG): New macro.

3895

+ * config/sparc/sparc.c (sparc_option_override): Set MASK_LEON for leon

3896

+ and MASK_LEON3 for leon3 and unset them if HAVE_AS_LEON is not defined.

3897

+ Deal with LEON and LEON3 for the memory model.

3898

+ * config/sparc/sync.md (atomic_compare_and_swap<mode>): Enable if LEON3

3899

+ (atomic_compare_and_swap<mode>_1): Likewise.

3900

+ (*atomic_compare_and_swap<mode>_1): Likewise.

3901

+

3902

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

3903

+

3904

+ Backport from mainline

3905

+ 2013-07-23 Eric Botcazou <ebotcazou@adacore.com>

3906

+

3907

+ * doc/invoke.texi (SPARC Options): Document new leon3 processor value.

3908

+

3909

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

3910

+

3911

+ Backport from mainline

3912

+ 2013-07-22 Eric Botcazou <ebotcazou@adacore.com>

3913

+

3914

+ * config.gcc (sparc*-*-*): Accept leon3 processor.

3915

+ (sparc-leon*-*): Merge with sparc*-*-* and add leon3 support.

3916

+ * doc/invoke.texi (SPARC Options): Adjust -mfix-ut699 entry.

3917

+ * config/sparc/sparc-opts.h (enum processor_type): Add PROCESSOR_LEON3.

3918

+ * config/sparc/sparc.opt (enum processor_type): Add leon3.

3919

+ (mfix-ut699): Adjust comment.

3920

+ * config/sparc/sparc.h (TARGET_CPU_leon3): New define.

3921

+ (CPP_CPU32_DEFAULT_SPEC): Add leon3 support.

3922

+ (CPP_CPU_SPEC): Likewise.

3923

+ (ASM_CPU_SPEC): Likewise.

3924

+ * config/sparc/sparc.c (leon3_cost): New constant.

3925

+ (sparc_option_override): Add leon3 support.

3926

+ (mem_ref): New function.

3927

+ (sparc_gate_work_around_errata): Return true if -mfix-ut699 is enabled.

3928

+ (sparc_do_work_around_errata): Look into the instruction in the delay

3929

+ slot and adjust accordingly. Add fix for the data cache nullify issues

3930

+ of the UT699. Change insertion position for the NOP.

3931

+ * config/sparc/leon.md (leon_fpalu, leon_fpmds, write_buf): Delete.

3932

+ (leon3_load): New reservation.

3933

+ (leon_store): Bump latency to 2.

3934

+ (grfpu): New automaton.

3935

+ (grfpu_alu): New unit.

3936

+ (grfpu_ds): Likewise.

3937

+ (leon_fp_alu): Adjust.

3938

+ (leon_fp_mult): Delete.

3939

+ (leon_fp_div): Split into leon_fp_divs and leon_fp_divd.

3940

+ (leon_fp_sqrt): Split into leon_fp_sqrts and leon_fp_sqrtd.

3941

+ * config/sparc/sparc.md (cpu): Add leon3.

3942

+ * config/sparc/sync.md (atomic_exchangesi): Disable if -mfix-ut699.

3943

+ (swapsi): Likewise.

3944

+ (atomic_test_and_set): Likewise.

3945

+ (ldstub): Likewise.

3946

+

3947

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

3948

+

3949

+ Backport from mainline

3950

+ 2013-04-10 Steven Bosscher <steven@gcc.gnu.org>

3951

+

3952

+ * config/sparc/sparc.c: Include tree-pass.h.

3953

+ (TARGET_MACHINE_DEPENDENT_REORG): Do not redefine.

3954

+ (sparc_reorg): Rename to sparc_do_work_around_errata. Move to

3955

+ head of file. Change return type. Split off gate function.

3956

+ (sparc_gate_work_around_errata): New function.

3957

+ (pass_work_around_errata): New pass definition.

3958

+ (insert_pass_work_around_errata) New pass insert definition to

3959

+ insert pass_work_around_errata just after delayed-branch scheduling.

3960

+ (sparc_option_override): Insert the pass.

3961

+ * config/sparc/t-sparc (sparc.o): Add TREE_PASS_H dependence.

3962

+

3963

+2013-11-24 Sebastian Huber <sebastian.huber@embedded-brains.de>

3964

+

3965

+ Backport from mainline

3966

+ 2013-05-28 Eric Botcazou <ebotcazou@adacore.com>

3967

+

3968

+ * doc/invoke.texi (SPARC Options): Document -mfix-ut699.

3969

+ * builtins.c (expand_builtin_mathfn) <BUILT_IN_SQRT>: Try to widen the

3970

+ mode if the instruction isn't available in the original mode.

3971

+ * config/sparc/sparc.opt (mfix-ut699): New option.

3972

+ * config/sparc/sparc.md (muldf3_extend): Disable if -mfix-ut699.

3973

+ (divdf3): Turn into expander.

3974

+ (divdf3_nofix): New insn.

3975

+ (divdf3_fix): Likewise.

3976

+ (divsf3): Disable if -mfix-ut699.

3977

+ (sqrtdf2): Turn into expander.

3978

+ (sqrtdf2_nofix): New insn.

3979

+ (sqrtdf2_fix): Likewise.

3980

+ (sqrtsf2): Disable if -mfix-ut699.

3981

+

3982

+2013-11-22 Eric Botcazou <ebotcazou@adacore.com>

3983

+

3984

+ * print-rtl.c (print_rtx) <case MEM>: Output a space if no MEM_EXPR.

3985

+

3986

+2013-11-21 Zhenqiang Chen <zhenqiang.chen@linaro.org>

3987

+

3988

+ PR bootstrap/57683

3989

+ Backport from mainline: r197467 and r198999.

3990

+ 2013-04-03 Jeff Law <law@redhat.com>

3991

+

3992

+ * Makefile.in (lra-constraints.o): Depend on $(OPTABS_H).

3993

+ (lra-eliminations.o): Likewise.

3994

+

3995

+ 2013-05-16 Jeff Law <law@redhat.com>

3996

+

3997

+ * Makefile.in (tree-switch-conversion.o): Depend on $(OPTABS_H).

3998

+

3999

+2013-11-20 Eric Botcazou <ebotcazou@adacore.com>

4000

+

4001

+ PR target/59207

4002

+ * config/sparc/sparc.c (sparc_fold_builtin) <case CODE_FOR_pdist_vis>:

4003

+ Make sure neg2_ovf is set before being used.

4004

+

4005

+2013-11-20 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

4006

+ Dominik Vogt <vogt@linux.vnet.ibm.com>

4007

+

4008

+ Backport from mainline

4009

+ * config/s390/s390.c (s390_canonicalize_comparison): Don't fold

4010

+ int comparisons with an out of range condition code.

4011

+ (s390_optimize_nonescaping_tx): Skip empty BBs.

4012

+ Generate the new tbegin RTX when removing the FPR clobbers (with

4013

+ two SETs).

4014

+ (s390_expand_tbegin): Fix the retry loop counter. Copy CC to the

4015

+ result before doing the retry calculations.

4016

+ (s390_init_builtins): Make tbegin "returns_twice" and tabort

4017

+ "noreturn".

4018

+ * config/s390/s390.md (UNSPECV_TBEGIN_TDB): New constant used for

4019

+ the TDB setting part of an tbegin.

4020

+ ("tbegin_1", "tbegin_nofloat_1"): Add a set for the TDB.

4021

+ ("tx_assist"): Set unused argument to an immediate zero instead of

4022

+ loading zero into a GPR and pass it as argument.

4023

+ * config/s390/htmxlintrin.h (__TM_simple_begin, __TM_begin):

4024

+ Remove inline and related attributes.

4025

+ (__TM_nesting_depth, __TM_is_user_abort, __TM_is_named_user_abort)

4026

+ (__TM_is_illegal, __TM_is_footprint_exceeded)

4027

+ (__TM_is_nested_too_deep, __TM_is_conflict): Fix format value

4028

+ check.

4029

+

4030

+2013-11-19 Uros Bizjak <ubizjak@gmail.com>

4031

+

4032

+ Backport from mainline

4033

+ 2013-11-18 Uros Bizjak <ubizjak@gmail.com>

4034

+

4035

+ * config/i386/i386.c (ix86_decompose_address): Use REG_P instead of

4036

+ ix86_address_subreg_operand. Move subreg checks to

4037

+ ix86_validate_address_register. Move address override check to

4038

+ ix86_legitimate_address_p.

4039

+ (ix86_validate_address_register): New function.

4040

+ (ix86_legitimate_address_p): Call ix86_validate_address_register

4041

+ to validate base and index registers. Add address override check

4042

+ from ix86_decompose_address.

4043

+ (ix86_decompose_address): Remove.

4044

+

4045

+ Backport from mainline

4046

+ 2013-11-17 Uros Bizjak <ubizjak@gmail.com>

4047

+

4048

+ PR target/59153

4049

+ * config/i386/i386.c (ix86_address_subreg_operand): Do not

4050

+ reject non-integer subregs.

4051

+ (ix86_decompose_address): Do not reject invalid CONST_INT RTXes.

4052

+ Move check for invalid x32 constant addresses ...

4053

+ (ix86_legitimate_address_p): ... here.

4054

+

4055

+2013-11-19 Richard Biener <rguenther@suse.de>

4056

+

4057

+ Backport from mainline

4058

+ 2013-11-07 Richard Biener <rguenther@suse.de>

4059

+

4060

+ * tree-dfa.c (get_ref_base_and_extent): Fix casting.

4061

+

4062

+2013-11-19 Richard Biener <rguenther@suse.de>

4063

+

4064

+ PR tree-optimization/57517

4065

+ * tree-predcom.c (combinable_refs_p): Verify the combination

4066

+ is always executed when the refs are.

4067

+

4068

+2013-11-19 Richard Biener <rguenther@suse.de>

4069

+

4070

+ Backport from mainline

4071

+ 2013-11-05 Richard Biener <rguenther@suse.de>

4072

+

4073

+ PR middle-end/58941

4074

+ * tree-dfa.c (get_ref_base_and_extent): Merge common code

4075

+ in MEM_REF and TARGET_MEM_REF handling. Make sure to

4076

+ process trailing array detection before diving into the

4077

+ view-converted object (and possibly apply some extra offset).

4078

+

4079

+2013-11-18 Richard Biener <rguenther@suse.de>

4080

+

4081

+ Backport from mainline

4082

+ 2013-10-21 Richard Biener <rguenther@suse.de>

4083

+

4084

+ PR tree-optimization/58794

4085

+ * fold-const.c (operand_equal_p): Compare FIELD_DECL operand

4086

+ of COMPONENT_REFs with OEP_CONSTANT_ADDRESS_OF left in place.

4087

+

4088

+ 2013-10-21 Richard Biener <rguenther@suse.de>

4089

+

4090

+ PR middle-end/58742

4091

+ * fold-const.c (fold_binary_loc): Fold ((T) (X /[ex] C)) * C

4092

+ to (T) X for sign-changing conversions (or no conversion).

4093

+

4094

+ 2013-11-06 Richard Biener <rguenther@suse.de>

4095

+

4096

+ PR tree-optimization/58653

4097

+ * tree-predcom.c (ref_at_iteration): Rewrite to generate

4098

+ a MEM_REF.

4099

+ (prepare_initializers_chain): Adjust.

4100

+

4101

+ PR tree-optimization/59047

4102

+ * tree-predcom.c (ref_at_iteration): Handle bitfield accesses

4103

+ properly.

4104

+

4105

+ 2013-10-15 Richard Biener <rguenther@suse.de>

4106

+

4107

+ PR tree-optimization/58143

4108

+ * tree-ssa-loop-im.c (arith_code_with_undefined_signed_overflow):

4109

+ New function.

4110

+ (rewrite_to_defined_overflow): Likewise.

4111

+ (move_computations_dom_walker::before_dom): Rewrite stmts

4112

+ with undefined signed overflow that are not always executed

4113

+ into unsigned arithmetic.

4114

+

4115

+2013-11-14 Uros Bizjak <ubizjak@gmail.com>

4116

+

4117

+ Backport from mainline

4118

+ 2013-11-10 Uros Bizjak <ubizjak@gmail.com>

4119

+

4120

+ * mode-switching.c (optimize_mode_switching): Mark block as

4121

+ nontransparent, if last_mode at block exit is different from no_mode.

4122

+

4123

+ Backport from mainline

4124

+ 2013-11-06 Uros Bizjak <ubizjak@gmail.com>

4125

+

4126

+ PR target/59021

4127

+ * config/i386/i386.c (ix86_avx_u128_mode_needed): Require

4128

+ AVX_U128_DIRTY mode for call_insn RTXes that use AVX256 registers.

4129

+ (ix86_avx_u128_mode_needed): Return AVX_U128_DIRTY mode for call_insn

4130

+ RTXes that return in AVX256 register.

4131

+

4132

+2013-11-14 Jakub Jelinek <jakub@redhat.com>

4133

+ Uros Bizjak <ubizjak@gmail.com>

4134

+

4135

+ PR target/59101

4136

+ * config/i386/i386.md (*anddi_2): Only allow CCZmode if

4137

+ operands[2] satisfies_constraint_Z that might have bit 31 set.

4138

+

4139

+2013-11-12 H.J. Lu <hongjiu.lu@intel.com>

4140

+

4141

+ Backported from mainline

4142

+ 2013-11-12 H.J. Lu <hongjiu.lu@intel.com>

4143

+

4144

+ PR target/59088

4145

+ * config/i386/i386.c (initial_ix86_tune_features): Set

4146

+ X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL and

4147

+ X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL for m_HASWELL.

4148

+

4149

+2013-11-11 Ramana Radhakrishnan <ramana.radhakrishnan@arm.com>

4150

+

4151

+ Backported from mainline

4152

+ 2013-10-30 Ramana Radhakrishnan <ramana.radhakrishnan@arm.com>

4153

+

4154

+ PR target/58854

4155

+ * config/arm/arm.c (arm_expand_epilogue_apcs_frame): Emit blockage

4156

+

4157

+2013-11-11 Jakub Jelinek <jakub@redhat.com>

4158

+

4159

+ Backported from mainline

4160

+ 2013-11-06 Jakub Jelinek <jakub@redhat.com>

4161

+

4162

+ PR middle-end/58970

4163

+ * expr.c (get_bit_range): Handle *offset == NULL_TREE.

4164

+ (expand_assignment): If *bitpos is negative, set *offset

4165

+ and adjust *bitpos, so that it is not negative.

4166

+

4167

+ 2013-11-05 Jakub Jelinek <jakub@redhat.com>

4168

+

4169

+ PR rtl-optimization/58997

4170

+ * loop-iv.c (iv_subreg): For IV_UNKNOWN_EXTEND, expect

4171

+ get_iv_value to be in iv->mode rather than iv->extend_mode.

4172

+ (iv_extend): Likewise. Otherwise, if iv->extend != extend,

4173

+ use lowpart_subreg on get_iv_value before calling simplify_gen_unary.

4174

+ * loop-unswitch.c (may_unswitch_on): Make sure op[i] is in the right

4175

+ mode.

4176

+

4177

+2013-11-10 Karlson2k <k2k@narod.ru>

4178

+ Kai Tietz <ktietz@redhat.com>

4179

+

4180

+ Merged from trunk

4181

+ PR plugins/52872

4182

+ * configure.ac: Adding for exported symbols check

4183

+ and for rdynamic-check executable-extension.

4184

+ * configure: Regenerated.

4185

+

4186

+2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

4187

+

4188

+ PR target/59034

4189

+ * config/i386/i386.md (push peepholer/splitter): Use Pmode

4190

+ with stack_pointer_rtx.

4191

+

4192

+2013-11-05 Uros Bizjak <ubizjak@gmail.com>

4193

+

4194

+ * config/i386/t-rtems (MULTILIB_MATCHES): Fix option typos.

4195

+

4196

+2013-11-05 Jakub Jelinek <jakub@redhat.com>

4197

+

4198

+ PR tree-optimization/58984

4199

+ * ipa-prop.c (ipa_load_from_parm_agg_1): Add SIZE_P argument,

4200

+ set *SIZE_P if non-NULL on success.

4201

+ (ipa_load_from_parm_agg, ipa_analyze_indirect_call_uses): Adjust

4202

+ callers.

4203

+ (ipcp_transform_function): Likewise. Punt if size of access

4204

+ is different from TYPE_SIZE on v->value's type.

4205

+

4206

+2013-11-03 H.J. Lu <hongjiu.lu@intel.com>

4207

+

4208

+ Backport from mainline

4209

+ 2013-10-12 H.J. Lu <hongjiu.lu@intel.com>

4210

+

4211

+ PR target/58690

4212

+ * config/i386/i386.c (ix86_copy_addr_to_reg): New function.

4213

+ (ix86_expand_movmem): Replace copy_addr_to_reg with

4214

+ ix86_copy_addr_to_reg.

4215

+ (ix86_expand_setmem): Likewise.

4216

+

4217

+2013-10-29 Uros Bizjak <ubizjak@gmail.com>

4218

+

4219

+ Backport from mainline

4220

+ 2013-08-08 Richard Sandiford <rdsandiford@googlemail.com>

4221

+

4222

+ PR rtl-optimization/58079

4223

+ * combine.c (combine_simplify_rtx): Avoid using SUBST if

4224

+ simplify_comparison has widened a comparison with an integer.

4225

+

4226

+2013-10-29 Martin Jambor <mjambor@suse.cz>

4227

+

4228

+ PR middle-end/58789

4229

+ Backport from mainline

4230

+ 2013-05-09 Martin Jambor <mjambor@suse.cz>

4231

+

4232

+ PR lto/57084

4233

+ * gimple-fold.c (canonicalize_constructor_val): Call

4234

+ cgraph_get_create_real_symbol_node instead of cgraph_get_create_node.

4235

+

4236

+ Backport from mainline

4237

+ 2013-03-16 Jan Hubicka <jh@suse.cz>

4238

+

4239

+ * cgraph.h (cgraph_get_create_real_symbol_node): Declare.

4240

+ * cgraph.c (cgraph_get_create_real_symbol_node): New function.

4241

+ * cgrpahbuild.c: Use cgraph_get_create_real_symbol_node instead

4242

+ of cgraph_get_create_node.

4243

+ * ipa-prop.c (ipa_make_edge_direct_to_target): Likewise.

4244

+

4245

+2013-10-28 Tom de Vries <tom@codesourcery.com>

4246

+

4247

+ * cfgexpand.c (gimple_expand_cfg): Remove test for parm_birth_insn.

4248

+ Don't commit insertions after NOTE_INSN_FUNCTION_BEG.

4249

+

4250

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

4251

+

4252

+ Backport from mainline

4253

+ 2013-10-22 Uros Bizjak <ubizjak@gmail.com>

4254

+

4255

+ PR target/58779

4256

+ * config/i386/i386.c (put_condition_code) <case GTU, case LEU>:

4257

+ Remove CCCmode handling.

4258

+ <case LTU>: Return 'c' suffix for CCCmode.

4259

+ <case GEU>: Return 'nc' suffix for CCCmode.

4260

+ (ix86_cc_mode) <case GTU, case LEU>: Do not generate overflow checks.

4261

+ * config/i386/i386.md (*sub<mode>3_cconly_overflow): Remove.

4262

+ (*sub<mode>3_cc_overflow): Ditto.

4263

+ (*subsi3_zext_cc_overflow): Ditto.

4264

+

4265

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

4266

+

4267

+ Backport from mainline

4268

+ 2013-10-19 Uros Bizjak <ubizjak@gmail.com>

4269

+

4270

+ PR target/58792

4271

+ * config/i386/i386.c (ix86_function_value_regno): Add DX_REG,

4272

+ ST1_REG and XMM1_REG for 32bit and 64bit targets. Also add DI_REG

4273

+ and SI_REG for 64bit SYSV ABI targets.

4274

+

4275

+2013-08-25 Richard Henderson <rth@twiddle.net>

4276

+

4277

+ PR rtl/58542

4278

+ * optabs.c (maybe_emit_atomic_exchange): Use create_input_operand

4279

+ instead of create_convert_operand_to.

4280

+ (maybe_emit_sync_lock_test_and_set): Likewise.

4281

+ (expand_atomic_compare_and_swap): Likewise.

4282

+ (maybe_emit_compare_and_swap_exchange_loop): Don't convert_modes.

4283

+

4284

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

4285

+

4286

+ PR rtl-optimization/58831

4287

+ * alias.c (init_alias_analysis): At the beginning of each iteration, set

4288

+ the reg_seen[N] bit if static_reg_base_value[N] is non-null.

4289

+

4290

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

4291

+

4292

+ * recog.c (search_ofs): New static variable moved from...

4293

+ (peep2_find_free_register): ...here.

4294

+ (peephole2_optimize): Initialize it.

4295

+

4296

+2013-10-24 David Edelsohn <dje.gcc@gmail.com>

4297

+

4298

+ Backport from mainline

4299

+ 2013-10-23 David Edelsohn <dje.gcc@gmail.com>

4300

+

4301

+ PR target/58838

4302

+ * config/rs6000/rs6000.md (mulsi3_internal1 and splitter): Add

4303

+ TARGET_32BIT final condition.

4304

+ (mulsi3_internal2 and splitter): Same.

4305

+

4306

+2013-10-23 Tom de Vries <tom@codesourcery.com>

4307

+

4308

+ PR tree-optimization/58805

4309

+ * tree-ssa-tail-merge.c (stmt_local_def): Add gimple_vdef check.

4310

+

4311

+2013-10-23 Richard Biener <rguenther@suse.de>

4312

+

4313

+ Backport from mainline

4314

+ 2013-06-24 Richard Biener <rguenther@suse.de>

4315

+

4316

+ PR tree-optimization/57488

4317

+ * tree-ssa-pre.c (insert): Clear NEW sets before each iteration.

4318

+

4319

+2013-10-16 Ganesh Gopalasubramanian <Ganesh.Gopalasubramanian@amd.com>

4320

+

4321

+ Backport from mainline

4322

+ 2013-10-16 Ganesh Gopalasubramanian

4323

+ <Ganesh.Gopalasubramanian@amd.com>

4324

+

4325

+ * config/i386/i386.c (ix86_option_override_internal): Enable FMA4

4326

+ for AMD bdver3.

4327

+

4328

2013-10-16 Release Manager

4329

4330

* GCC 4.8.2 released.

4331

@@ -639,7 +1144,7 @@

4332

2013-07-31 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

4333

4334

Backport from mainline

4335

- 2013-03-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

4336

+ 2013-03-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

4337

4338

* config/s390/s390.h (TARGET_FLT_EVAL_METHOD): Define.

4339

4340

Index: gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c

4341

===================================================================

4342

--- a/src/gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c (.../tags/gcc_4_8_2_release)

4343

+++ b/src/gcc/testsuite/gcc.target/arm/thumb1-pic-single-base.c (.../branches/gcc-4_8-branch)

4344

@@ -0,0 +1,11 @@

4345

+/* { dg-do compile } */

4346

+/* { dg-require-effective-target arm_thumb1_ok } */

4347

+/* { dg-options "-mthumb -fpic -msingle-pic-base" } */

4348

+

4349

+int g_test;

4350

+

4351

+int

4352

+foo (int par)

4353

+{

4354

+ g_test = par;

4355

+}

4356

Index: gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c

4357

===================================================================

4358

--- a/src/gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c (.../tags/gcc_4_8_2_release)

4359

+++ b/src/gcc/testsuite/gcc.target/arm/thumb1-pic-high-reg.c (.../branches/gcc-4_8-branch)

4360

@@ -0,0 +1,11 @@

4361

+/* { dg-do compile } */

4362

+/* { dg-require-effective-target arm_thumb1_ok } */

4363

+/* { dg-options "-mthumb -fpic -mpic-register=9" } */

4364

+

4365

+int g_test;

4366

+

4367

+int

4368

+foo (int par)

4369

+{

4370

+ g_test = par;

4371

+}

4372

Index: gcc/testsuite/gcc.target/arm/require-pic-register-loc.c

4373

===================================================================

4374

--- a/src/gcc/testsuite/gcc.target/arm/require-pic-register-loc.c (.../tags/gcc_4_8_2_release)

4375

+++ b/src/gcc/testsuite/gcc.target/arm/require-pic-register-loc.c (.../branches/gcc-4_8-branch)

4376

@@ -0,0 +1,29 @@

4377

+/* { dg-do compile } */

4378

+/* { dg-options "-g -fPIC" } */

4379

+

4380

+void *v;

4381

+void a (void *x) { }

4382

+void b (void) { }

4383

+ /* line 7. */

4384

+int /* line 8. */

4385

+main (int argc) /* line 9. */

4386

+{ /* line 10. */

4387

+ if (argc == 12345) /* line 11. */

4388

+ {

4389

+ a (v);

4390

+ return 1;

4391

+ }

4392

+ b ();

4393

+

4394

+ return 0;

4395

+}

4396

+

4397

+/* { dg-final { scan-assembler-not "\.loc 1 7 0" } } */

4398

+/* { dg-final { scan-assembler-not "\.loc 1 8 0" } } */

4399

+/* { dg-final { scan-assembler-not "\.loc 1 9 0" } } */

4400

+

4401

+/* The loc at the start of the prologue. */

4402

+/* { dg-final { scan-assembler-times "\.loc 1 10 0" 1 } } */

4403

+

4404

+/* The loc at the end of the prologue, with the first user line. */

4405

+/* { dg-final { scan-assembler-times "\.loc 1 11 0" 1 } } */

4406

Index: gcc/testsuite/gcc.target/arm/vrinta-ce.c

4407

===================================================================

4408

--- a/src/gcc/testsuite/gcc.target/arm/vrinta-ce.c (.../tags/gcc_4_8_2_release)

4409

+++ b/src/gcc/testsuite/gcc.target/arm/vrinta-ce.c (.../branches/gcc-4_8-branch)

4410

@@ -0,0 +1,15 @@

4411

+/* { dg-do compile } */

4412

+/* { dg-require-effective-target arm_v8_vfp_ok } */

4413

+/* { dg-options "-O2 -marm -march=armv8-a" } */

4414

+/* { dg-add-options arm_v8_vfp } */

4415

+

4416

+double foo (double a)

4417

+{

4418

+ if (a > 3.0)

4419

+ return __builtin_round (a);

4420

+

4421

+ return 0.0;

4422

+}

4423

+

4424

+/* { dg-final { scan-assembler-times "vrinta.f64\td\[0-9\]+" 1 } } */

4425

+

4426

Index: gcc/testsuite/gcc.target/i386/pr59034-1.c

4427

===================================================================

4428

--- a/src/gcc/testsuite/gcc.target/i386/pr59034-1.c (.../tags/gcc_4_8_2_release)

4429

+++ b/src/gcc/testsuite/gcc.target/i386/pr59034-1.c (.../branches/gcc-4_8-branch)

4430

@@ -0,0 +1,10 @@

4431

+/* { dg-do compile { target { ! { ia32 } } } } */

4432

+/* { dg-require-effective-target maybe_x32 } */

4433

+/* { dg-options "-O -mx32 -mtune=corei7 -maddress-mode=short" } */

4434

+

4435

+extern int foo(int, ...);

4436

+int bar(void) {

4437

+ long double l = 1.2345E6;

4438

+ foo(0, l);

4439

+ return 0;

4440

+}

4441

Index: gcc/testsuite/gcc.target/i386/pr58690.c

4442

===================================================================

4443

--- a/src/gcc/testsuite/gcc.target/i386/pr58690.c (.../tags/gcc_4_8_2_release)

4444

+++ b/src/gcc/testsuite/gcc.target/i386/pr58690.c (.../branches/gcc-4_8-branch)

4445

@@ -0,0 +1,14 @@

4446

+/* { dg-do compile { target { ! { ia32 } } } } */

4447

+/* { dg-require-effective-target maybe_x32 } */

4448

+/* { dg-options "-O2 -mx32 -maddress-mode=short" } */

4449

+

4450

+struct gomp_thread

4451

+{

4452

+ char foo[41];

4453

+};

4454

+extern __thread struct gomp_thread gomp_tls_data;

4455

+void

4456

+foo (void)

4457

+{

4458

+ __builtin_memset (&gomp_tls_data, '\0', sizeof (gomp_tls_data));

4459

+}

4460

Index: gcc/testsuite/gcc.target/i386/pr59021.c

4461

===================================================================

4462

--- a/src/gcc/testsuite/gcc.target/i386/pr59021.c (.../tags/gcc_4_8_2_release)

4463

+++ b/src/gcc/testsuite/gcc.target/i386/pr59021.c (.../branches/gcc-4_8-branch)

4464

@@ -0,0 +1,23 @@

4465

+/* { dg-do compile } */

4466

+/* { dg-options "-O2 -mavx -mvzeroupper" } */

4467

+

4468

+extern void abort (void);

4469

+

4470

+struct S {

4471

+ int i1;

4472

+ int i2;

4473

+ int i3;

4474

+};

4475

+

4476

+typedef double v4df __attribute__ ((vector_size (32)));

4477

+

4478

+extern int foo (v4df, int i1, int i2, int i3, int i4, int i5, struct S s);

4479

+

4480

+void bar (v4df v, struct S s)

4481

+{

4482

+ int r = foo (v, 1, 2, 3, 4, 5, s);

4483

+ if (r)

4484

+ abort ();

4485

+}

4486

+

4487

+/* { dg-final { scan-assembler-not "vzeroupper" } } */

4488

Index: gcc/testsuite/gcc.target/i386/pr59034-2.c

4489

===================================================================

4490

--- a/src/gcc/testsuite/gcc.target/i386/pr59034-2.c (.../tags/gcc_4_8_2_release)

4491

+++ b/src/gcc/testsuite/gcc.target/i386/pr59034-2.c (.../branches/gcc-4_8-branch)

4492

@@ -0,0 +1,10 @@

4493

+/* { dg-do compile { target { ! { ia32 } } } } */

4494

+/* { dg-require-effective-target maybe_x32 } */

4495

+/* { dg-options "-O -mx32 -mtune=corei7 -maddress-mode=long" } */

4496

+

4497

+extern int foo(int, ...);

4498

+int bar(void) {

4499

+ long double l = 1.2345E6;

4500

+ foo(0, l);

4501

+ return 0;

4502

+}

4503

Index: gcc/testsuite/gcc.target/i386/xop-frczX.c

4504

===================================================================

4505

--- a/src/gcc/testsuite/gcc.target/i386/xop-frczX.c (.../tags/gcc_4_8_2_release)

4506

+++ b/src/gcc/testsuite/gcc.target/i386/xop-frczX.c (.../branches/gcc-4_8-branch)

4507

@@ -0,0 +1,60 @@

4508

+/* { dg-do run } */

4509

+/* { dg-require-effective-target xop } */

4510

+/* { dg-options "-O2 -mxop" } */

4511

+

4512

+#include "xop-check.h"

4513

+

4514

+#include <x86intrin.h>

4515

+

4516

+void

4517

+check_mm_vmfrcz_sd (__m128d __A, __m128d __B)

4518

+{

4519

+ union128d a, b, c;

4520

+ double d[2];

4521

+

4522

+ a.x = __A;

4523

+ b.x = __B;

4524

+ c.x = _mm_frcz_sd (__A, __B);

4525

+ d[0] = b.a[0] - (int)b.a[0] ;

4526

+ d[1] = a.a[1];

4527

+ if (check_union128d (c, d))

4528

+ abort ();

4529

+}

4530

+

4531

+void

4532

+check_mm_vmfrcz_ss (__m128 __A, __m128 __B)

4533

+{

4534

+ union128 a, b, c;

4535

+ float f[4];

4536

+

4537

+ a.x = __A;

4538

+ b.x = __B;

4539

+ c.x = _mm_frcz_ss (__A, __B);

4540

+ f[0] = b.a[0] - (int)b.a[0] ;

4541

+ f[1] = a.a[1];

4542

+ f[2] = a.a[2];

4543

+ f[3] = a.a[3];

4544

+ if (check_union128 (c, f))

4545

+ abort ();

4546

+}

4547

+

4548

+static void

4549

+xop_test (void)

4550

+{

4551

+ union128 a, b;

4552

+ union128d c,d;

4553

+ int i;

4554

+

4555

+ for (i = 0; i < 4; i++)

4556

+ {

4557

+ a.a[i] = i + 3.5;

4558

+ b.a[i] = i + 7.9;

4559

+ }

4560

+ for (i = 0; i < 2; i++)

4561

+ {

4562

+ c.a[i] = i + 3.5;

4563

+ d.a[i] = i + 7.987654321;

4564

+ }

4565

+ check_mm_vmfrcz_ss (a.x, b.x);

4566

+ check_mm_vmfrcz_sd (c.x, d.x);

4567

+}

4568

Index: gcc/testsuite/gcc.target/i386/pr30315.c

4569

===================================================================

4570

--- a/src/gcc/testsuite/gcc.target/i386/pr30315.c (.../tags/gcc_4_8_2_release)

4571

+++ b/src/gcc/testsuite/gcc.target/i386/pr30315.c (.../branches/gcc-4_8-branch)

4572

@@ -1,6 +1,6 @@

4573

/* { dg-do compile } */

4574

/* { dg-options "-O2" } */

4575

-/* { dg-final { scan-assembler-times "cmp" 4 } } */

4576

+/* { dg-final { scan-assembler-not "cmp" } } */

4577

4578

extern void abort (void);

4579

int c;

4580

@@ -34,39 +34,10 @@

4581

}

4582

#define PLUSCCONLY(T, t) PLUSCCONLY1(T, t, a) PLUSCCONLY1(T, t, b)

4583

4584

-#define MINUSCC(T, t) \

4585

-T minuscc##t (T a, T b) \

4586

-{ \

4587

- T difference = a - b; \

4588

- if (difference > a) \

4589

- abort (); \

4590

- return difference; \

4591

-}

4592

-

4593

-#define DECCC(T, t) \

4594

-T deccc##t (T a, T b) \

4595

-{ \

4596

- T difference = a - b; \

4597

- if (difference > a) \

4598

- c --; \

4599

- return difference; \

4600

-}

4601

-

4602

-#define MINUSCCONLY(T, t) \

4603

-void minuscconly##t (T a, T b) \

4604

-{ \

4605

- T difference = a - b; \

4606

- if (difference > a) \

4607

- abort (); \

4608

-}

4609

-

4610

#define TEST(T, t) \

4611

PLUSCC(T, t) \

4612

PLUSCCONLY(T, t) \

4613

- INCCC(T, t) \

4614

- MINUSCC(T, t) \

4615

- MINUSCCONLY(T, t) \

4616

- DECCC(T, t)

4617

+ INCCC(T, t)

4618

4619

TEST (unsigned long, l)

4620

TEST (unsigned int, i)

4621

@@ -84,14 +55,3 @@

4622

4623

PLUSCCZEXT(a)

4624

PLUSCCZEXT(b)

4625

-

4626

-#define MINUSCCZEXT \

4627

-unsigned long minuscczext (unsigned int a, unsigned int b) \

4628

-{ \

4629

- unsigned int difference = a - b; \

4630

- if (difference > a) \

4631

- abort (); \

4632

- return difference; \

4633

-}

4634

-

4635

-MINUSCCZEXT

4636

Index: gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c

4637

===================================================================

4638

--- a/src/gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c (.../tags/gcc_4_8_2_release)

4639

+++ b/src/gcc/testsuite/gcc.target/s390/htm-xl-intrin-1.c (.../branches/gcc-4_8-branch)

4640

@@ -1,37 +0,0 @@

4641

-/* This checks the availability of the XL compiler intrinsics for

4642

- transactional execution with the expected prototypes. */

4643

-

4644

-/* { dg-do compile } */

4645

-/* { dg-options "-O3 -march=zEC12 -mzarch" } */

4646

-

4647

-#include <htmxlintrin.h>

4648

-

4649

-int a = 0;

4650

-unsigned long g;

4651

-

4652

-int

4653

-foo ()

4654

-{

4655

- struct __htm_tdb *tdb_struct;

4656

- void * const tdb = tdb_struct;

4657

- long result;

4658

- unsigned char code;

4659

-

4660

- result = __TM_simple_begin ();

4661

- result = __TM_begin (tdb);

4662

- result = __TM_end ();

4663

- __TM_abort ();

4664

- __TM_named_abort (42);

4665

- __TM_non_transactional_store (&g, 42);

4666

- result = __TM_nesting_depth (tdb);

4667

-

4668

- result = __TM_is_user_abort (tdb);

4669

- result = __TM_is_named_user_abort (tdb, &code);

4670

- result = __TM_is_illegal (tdb);

4671

- result = __TM_is_footprint_exceeded (tdb);

4672

- result = __TM_is_nested_too_deep (tdb);

4673

- result = __TM_is_conflict (tdb);

4674

- result = __TM_is_failure_persistent (result);

4675

- result = __TM_failure_address (tdb);

4676

- result = __TM_failure_code (tdb);

4677

-}

4678

Index: gcc/testsuite/gcc.target/s390/htm-1.c

4679

===================================================================

4680

--- a/src/gcc/testsuite/gcc.target/s390/htm-1.c (.../tags/gcc_4_8_2_release)

4681

+++ b/src/gcc/testsuite/gcc.target/s390/htm-1.c (.../branches/gcc-4_8-branch)

4682

@@ -1,73 +0,0 @@

4683

-/* This checks the availability of the low-level builtins introduced

4684

- for transactional execution. */

4685

-

4686

-/* { dg-do compile } */

4687

-/* { dg-options "-O3 -march=zEC12 -mzarch" } */

4688

-

4689

-#include <stdint.h>

4690

-#include <htmintrin.h>

4691

-

4692

-int global = 0;

4693

-uint64_t g;

4694

-struct __htm_tdb global_tdb;

4695

-

4696

-int

4697

-foo (struct __htm_tdb* tdb, int reg, int *mem, uint64_t *mem64)

4698

-{

4699

-

4700

- int cc;

4701

- int n;

4702

-

4703

- cc = __builtin_tbegin (0);

4704

- cc = __builtin_tbegin (tdb);

4705

- cc = __builtin_tbegin (&global_tdb);

4706

-

4707

- cc = __builtin_tbegin_nofloat (0);

4708

- cc = __builtin_tbegin_nofloat (&global_tdb);

4709

-

4710

- cc = __builtin_tbegin_retry (0, 42);

4711

- cc = __builtin_tbegin_retry (0, reg);

4712

- cc = __builtin_tbegin_retry (0, *mem);

4713

- cc = __builtin_tbegin_retry (0, global);

4714

- cc = __builtin_tbegin_retry (tdb, 42);

4715

- cc = __builtin_tbegin_retry (&global_tdb, 42);

4716

-

4717

- cc = __builtin_tbegin_retry_nofloat (0, 42);

4718

- cc = __builtin_tbegin_retry_nofloat (0, reg);

4719

- cc = __builtin_tbegin_retry_nofloat (0, *mem);

4720

- cc = __builtin_tbegin_retry_nofloat (0, global);

4721

- cc = __builtin_tbegin_retry_nofloat (&global_tdb, 42);

4722

-

4723

- __builtin_tbeginc ();

4724

-

4725

- n = __builtin_tx_nesting_depth();

4726

-

4727

- __builtin_non_tx_store(&g, 23);

4728

- __builtin_non_tx_store(mem64, 23);

4729

- __builtin_non_tx_store(&g, reg);

4730

- __builtin_non_tx_store(&g, *mem);

4731

- __builtin_non_tx_store(&g, global);

4732

-

4733

- __builtin_tabort (42 + 255);

4734

- __builtin_tabort (reg);

4735

- /* { dg-final { scan-assembler-times "tabort\t255" 1 } } */

4736

- __builtin_tabort (reg + 255);

4737

- __builtin_tabort (*mem);

4738

- __builtin_tabort (global);

4739

- /* Here global + 255 gets reloaded into a reg. Better would be to

4740

- just reload global or *mem and get the +255 for free as address

4741

- arithmetic. */

4742

- __builtin_tabort (*mem + 255);

4743

- __builtin_tabort (global + 255);

4744

-

4745

- __builtin_tend();

4746

-

4747

- __builtin_tx_assist (23);

4748

- __builtin_tx_assist (reg);

4749

- __builtin_tx_assist (*mem);

4750

- __builtin_tx_assist (global);

4751

-}

4752

-

4753

-/* Make sure the tdb NULL argument ends up as immediate value in the

4754

- instruction. */

4755

-/* { dg-final { scan-assembler-times "tbegin\t0," 10 } } */

4756

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c

4757

===================================================================

4758

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c (.../tags/gcc_4_8_2_release)

4759

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c (.../branches/gcc-4_8-branch)

4760

@@ -0,0 +1,165 @@

4761

+/* This checks the availability of the low-level builtins introduced

4762

+ for transactional execution. */

4763

+

4764

+/* { dg-do compile } */

4765

+/* { dg-require-effective-target htm } */

4766

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

4767

+

4768

+#include <stdint.h>

4769

+#include <htmintrin.h>

4770

+

4771

+int global = 0;

4772

+uint64_t g;

4773

+struct __htm_tdb global_tdb;

4774

+

4775

+int

4776

+foo (struct __htm_tdb* tdb, int reg, int *mem, uint64_t *mem64)

4777

+{

4778

+

4779

+ int cc;

4780

+ int n;

4781

+

4782

+ __builtin_tbegin ((void *)0);

4783

+ __builtin_tbegin ((void *)-99999);

4784

+ __builtin_tbegin ((void *)99999);

4785

+ while (__builtin_tbegin ((void *)0) != 0)

4786

+ {

4787

+ }

4788

+ cc = __builtin_tbegin ((void *)0x12345678);

4789

+ cc = __builtin_tbegin (tdb);

4790

+ cc = __builtin_tbegin (&global_tdb);

4791

+ cc = __builtin_tbegin ((void *)(long long)(reg + 0x12345678));

4792

+ cc = __builtin_tbegin ((void *)(long long)(reg));

4793

+

4794

+ __builtin_tbegin_nofloat ((void *)0);

4795

+ __builtin_tbegin_nofloat ((void *)-99999);

4796

+ __builtin_tbegin_nofloat ((void *)99999);

4797

+ cc = __builtin_tbegin_nofloat ((void *)0x12345678);

4798

+ cc = __builtin_tbegin_nofloat (tdb);

4799

+ cc = __builtin_tbegin_nofloat (&global_tdb);

4800

+ cc = __builtin_tbegin_nofloat ((void *)(long long)(reg + 0x12345678));

4801

+ cc = __builtin_tbegin_nofloat ((void *)(long long)(reg));

4802

+

4803

+ __builtin_tbegin_retry ((void *)0, 0);

4804

+ cc = __builtin_tbegin_retry ((void *)0, 1);

4805

+ cc = __builtin_tbegin_retry ((void *)0, -1);

4806

+ cc = __builtin_tbegin_retry ((void *)0, 42);

4807

+ cc = __builtin_tbegin_retry ((void *)0, reg);

4808

+ cc = __builtin_tbegin_retry ((void *)0, *mem);

4809

+ cc = __builtin_tbegin_retry ((void *)0, global);

4810

+ cc = __builtin_tbegin_retry (tdb, 42);

4811

+ cc = __builtin_tbegin_retry (&global_tdb, 42);

4812

+ cc = __builtin_tbegin_retry ((void *)0x12345678, global);

4813

+ cc = __builtin_tbegin_retry (

4814

+ (void *)(long long) (reg + 0x12345678), global + 1);

4815

+ cc = __builtin_tbegin_retry (

4816

+ (void *)(long long)(reg), global - 1);

4817

+

4818

+ __builtin_tbegin_retry_nofloat ((void *)0, 0);

4819

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, 1);

4820

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, -1);

4821

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, 42);

4822

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, reg);

4823

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, *mem);

4824

+ cc = __builtin_tbegin_retry_nofloat ((void *)0, global);

4825

+ cc = __builtin_tbegin_retry_nofloat (tdb, 42);

4826

+ cc = __builtin_tbegin_retry_nofloat (&global_tdb, 42);

4827

+ cc = __builtin_tbegin_retry_nofloat ((void *)0x12345678, global);

4828

+ cc = __builtin_tbegin_retry_nofloat (

4829

+ (void *)(long long) (reg + 0x12345678), global + 1);

4830

+ cc = __builtin_tbegin_retry_nofloat (

4831

+ (void *)(long long)(reg), global - 1);

4832

+

4833

+ __builtin_tbeginc ();

4834

+

4835

+ __builtin_tx_nesting_depth ();

4836

+ n = __builtin_tx_nesting_depth ();

4837

+

4838

+ __builtin_non_tx_store (mem64, 0);

4839

+ {

4840

+ const uint64_t val_var = 0x1122334455667788;

4841

+

4842

+ __builtin_non_tx_store (mem64, val_var);

4843

+ }

4844

+ __builtin_non_tx_store (mem64, (uint64_t)reg);

4845

+ __builtin_non_tx_store (mem64, g);

4846

+ __builtin_non_tx_store ((uint64_t *)0, 0);

4847

+ __builtin_non_tx_store ((uint64_t *)0x12345678, 0);

4848

+ __builtin_non_tx_store (&g, 23);

4849

+ __builtin_non_tx_store (&g, reg);

4850

+ __builtin_non_tx_store (&g, *mem);

4851

+ __builtin_non_tx_store (&g, global);

4852

+

4853

+ __builtin_tend();

4854

+

4855

+ __builtin_tx_assist (0);

4856

+ __builtin_tx_assist (1);

4857

+ __builtin_tx_assist (reg);

4858

+ __builtin_tx_assist (*mem);

4859

+ __builtin_tx_assist (global);

4860

+}

4861

+

4862

+/* The taborts must go into separate function since they are

4863

+ "noreturn". */

4864

+

4865

+void

4866

+tabort1 ()

4867

+{

4868

+ __builtin_tabort (256);

4869

+}

4870

+

4871

+void

4872

+tabort2 (int reg)

4873

+{

4874

+ __builtin_tabort (reg);

4875

+}

4876

+

4877

+void

4878

+tabort3 (int reg)

4879

+{

4880

+ /* { dg-final { scan-assembler-times "tabort\t255" 1 } } */

4881

+ __builtin_tabort (reg + 255);

4882

+}

4883

+

4884

+void

4885

+tabort4 (int *mem)

4886

+{

4887

+ __builtin_tabort (*mem);

4888

+}

4889

+

4890

+void

4891

+tabort5 ()

4892

+{

4893

+ __builtin_tabort (global);

4894

+}

4895

+

4896

+void

4897

+tabort6 (int *mem)

4898

+{

4899

+ /* Here global + 255 gets reloaded into a reg. Better would be to

4900

+ just reload global or *mem and get the +255 for free as address

4901

+ arithmetic. */

4902

+ __builtin_tabort (*mem + 255);

4903

+}

4904

+

4905

+void

4906

+tabort7 ()

4907

+{

4908

+ __builtin_tabort (global + 255);

4909

+}

4910

+

4911

+void

4912

+tabort8 ()

4913

+{

4914

+ __builtin_tabort (-1);

4915

+}

4916

+

4917

+

4918

+/* Make sure the tdb NULL argument ends up as immediate value in the

4919

+ instruction. */

4920

+/* { dg-final { scan-assembler-times "tbegin\t0," 17 } } */

4921

+/* { dg-final { scan-assembler-times "tbegin\t" 41 } } */

4922

+/* Check number of occurences of certain instructions. */

4923

+/* { dg-final { scan-assembler-times "tbeginc\t" 1 } } */

4924

+/* { dg-final { scan-assembler-times "tabort\t" 8 } } */

4925

+/* { dg-final { scan-assembler "ppa\t" } } */

4926

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c

4927

===================================================================

4928

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c (.../tags/gcc_4_8_2_release)

4929

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-2.c (.../branches/gcc-4_8-branch)

4930

@@ -0,0 +1,13 @@

4931

+/* { dg-do compile } */

4932

+/* { dg-require-effective-target htm } */

4933

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

4934

+

4935

+void must_not_compile1 (void)

4936

+{

4937

+ __builtin_tabort (0); /* { dg-error "Invalid transaction abort code:" } */

4938

+}

4939

+

4940

+void must_not_compile2 (void)

4941

+{

4942

+ __builtin_tabort (255); /* { dg-error "Invalid transaction abort code:" } */

4943

+}

4944

Index: gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c

4945

===================================================================

4946

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c (.../tags/gcc_4_8_2_release)

4947

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-compile-3.c (.../branches/gcc-4_8-branch)

4948

@@ -0,0 +1,37 @@

4949

+/* This checks the availability of the XL compiler intrinsics for

4950

+ transactional execution with the expected prototypes. */

4951

+

4952

+/* { dg-do compile } */

4953

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

4954

+

4955

+#include <htmxlintrin.h>

4956

+

4957

+int a = 0;

4958

+unsigned long g;

4959

+

4960

+int

4961

+foo ()

4962

+{

4963

+ struct __htm_tdb *tdb_struct;

4964

+ void * const tdb = tdb_struct;

4965

+ long result;

4966

+ unsigned char code;

4967

+

4968

+ result = __TM_simple_begin ();

4969

+ result = __TM_begin (tdb);

4970

+ result = __TM_end ();

4971

+ __TM_abort ();

4972

+ __TM_named_abort (42);

4973

+ __TM_non_transactional_store (&g, 42);

4974

+ result = __TM_nesting_depth (tdb);

4975

+

4976

+ result = __TM_is_user_abort (tdb);

4977

+ result = __TM_is_named_user_abort (tdb, &code);

4978

+ result = __TM_is_illegal (tdb);

4979

+ result = __TM_is_footprint_exceeded (tdb);

4980

+ result = __TM_is_nested_too_deep (tdb);

4981

+ result = __TM_is_conflict (tdb);

4982

+ result = __TM_is_failure_persistent (result);

4983

+ result = __TM_failure_address (tdb);

4984

+ result = __TM_failure_code (tdb);

4985

+}

4986

Index: gcc/testsuite/gcc.target/s390/s390.exp

4987

===================================================================

4988

--- a/src/gcc/testsuite/gcc.target/s390/s390.exp (.../tags/gcc_4_8_2_release)

4989

+++ b/src/gcc/testsuite/gcc.target/s390/s390.exp (.../branches/gcc-4_8-branch)

4990

@@ -24,6 +24,19 @@

4991

# Load support procs.

4992

load_lib gcc-dg.exp

4993

4994

+# Return 1 if htm (etnd - extract nesting depth) instructions can be

4995

+# compiled.

4996

+proc check_effective_target_htm { } {

4997

+ if { ![check_runtime s390_check_htm [subst {

4998

+ int main (void)

4999

+ {

5000

+ unsigned int nd = 77;

5001

+ asm (".insn rre,0xb2ec0000,%0,0" : "=d" (nd));

5002

+ return nd;

5003

+ }

5004

+ }]] } { return 0 } else { return 1 }

5005

+}

5006

+

5007

# If a testcase doesn't have special options, use these.

5008

global DEFAULT_CFLAGS

5009

if ![info exists DEFAULT_CFLAGS] then {

5010

Index: gcc/testsuite/gcc.target/s390/htm-builtins-1.c

5011

===================================================================

5012

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-1.c (.../tags/gcc_4_8_2_release)

5013

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-1.c (.../branches/gcc-4_8-branch)

5014

@@ -0,0 +1,1073 @@

5015

+/* Functional tests of the htm __builtin_... macros. */

5016

+

5017

+/* { dg-do run } */

5018

+/* { dg-require-effective-target htm } */

5019

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

5020

+

5021

+/* ---------------------------- included header files ---------------------- */

5022

+

5023

+#include <stdio.h>

5024

+#include <string.h>

5025

+#include <stdint.h>

5026

+#include <htmintrin.h>

5027

+

5028

+/* ---------------------------- local definitions -------------------------- */

5029

+

5030

+#define DEFAULT_MAX_REPETITIONS 5

5031

+#define DEFAULT_REQUIRED_QUORUM ((DEFAULT_MAX_REPETITIONS) - 1)

5032

+#define NUM_WARMUP_RUNS 10

5033

+

5034

+/* ---------------------------- local macros ------------------------------- */

5035

+

5036

+#define TEST_DF_REP(name) \

5037

+ { #name, name, DEFAULT_MAX_REPETITIONS, DEFAULT_REQUIRED_QUORUM }

5038

+#define TEST_NO_REP(name) { #name, name, 1, 1 }

5039

+

5040

+/* ---------------------------- local types -------------------------------- */

5041

+

5042

+typedef int (*test_func_t)(void);

5043

+

5044

+typedef struct

5045

+{

5046

+ const char *name;

5047

+ test_func_t test_func;

5048

+ int max_repetitions;

5049

+ int required_quorum;

5050

+} test_table_entry_t;

5051

+

5052

+/* ---------------------------- local variables ---------------------------- */

5053

+

5054

+__attribute__ ((aligned(256))) static struct __htm_tdb local_tdb256;

5055

+static struct __htm_tdb local_tdb;

5056

+static int do_dump_tdb = 0;

5057

+

5058

+/* ---------------------------- exported variables (globals) --------------- */

5059

+

5060

+__attribute__ ((aligned(256))) struct

5061

+{

5062

+ float float_1;

5063

+ float float_2;

5064

+ float float_3;

5065

+} global = { 1.0, 2.5, 0.0 };

5066

+

5067

+__attribute__ ((aligned(256))) struct

5068

+{

5069

+ volatile uint64_t c1;

5070

+ volatile uint64_t c2;

5071

+ volatile uint64_t c3;

5072

+} counters = { 0, 0, 0 };

5073

+

5074

+/* ---------------------------- local helper functions --------------------- */

5075

+

5076

+static void dump_tdb (struct __htm_tdb *tdb)

5077

+{

5078

+ unsigned char *p;

5079

+ int i;

5080

+ int j;

5081

+

5082

+ if (do_dump_tdb == 0)

5083

+ {

5084

+ return;

5085

+ }

5086

+ p = (unsigned char *)tdb;

5087

+ for (i = 0; i < 16; i++)

5088

+ {

5089

+ fprintf (stderr, "0x%02x ", i * 16);

5090

+ for (j = 0; j < 16; j++)

5091

+ {

5092

+ fprintf (stderr, "%02x", (int)p[i * 16 + j]);

5093

+ if (j < 15)

5094

+ {

5095

+ fprintf (stderr, " ");

5096

+ }

5097

+ if (j == 7)

5098

+ {

5099

+ fprintf (stderr, " ");

5100

+ }

5101

+ }

5102

+ fprintf (stderr, "\n");

5103

+ }

5104

+

5105

+ return;

5106

+}

5107

+

5108

+/* ---------------------------- local test functions ----------------------- */

5109

+

5110

+/* Check values of the constants defined in htmintrin.h. */

5111

+static int test_constants (void)

5112

+{

5113

+ if (_HTM_TBEGIN_STARTED != 0)

5114

+ {

5115

+ return 100 * _HTM_TBEGIN_STARTED + 1;

5116

+ }

5117

+ if (_HTM_TBEGIN_INDETERMINATE != 1)

5118

+ {

5119

+ return 100 * _HTM_TBEGIN_INDETERMINATE + 2;

5120

+ }

5121

+ if (_HTM_TBEGIN_TRANSIENT != 2)

5122

+ {

5123

+ return 100 * _HTM_TBEGIN_TRANSIENT + 3;

5124

+ }

5125

+ if (_HTM_TBEGIN_PERSISTENT != 3)

5126

+ {

5127

+ return 100 * _HTM_TBEGIN_PERSISTENT + 4;

5128

+ }

5129

+

5130

+ return 0;

5131

+}

5132

+

5133

+static int test_tbegin_ntstg_tend (void)

5134

+{

5135

+ int rc;

5136

+

5137

+ counters.c1 = 0;

5138

+ counters.c2 = 0;

5139

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5140

+ {

5141

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

5142

+ counters.c2 = 2;

5143

+ rc = __builtin_tend ();

5144

+ if (rc != 0)

5145

+ {

5146

+ return 100 * rc + 5;

5147

+ }

5148

+ if (counters.c1 != 1)

5149

+ {

5150

+ return 100 * counters.c1 + 2;

5151

+ }

5152

+ if (counters.c2 != 2)

5153

+ {

5154

+ return 100 * counters.c2 + 3;

5155

+ }

5156

+ }

5157

+ else

5158

+ {

5159

+ return 100 * rc + 4;

5160

+ }

5161

+

5162

+ return 0;

5163

+}

5164

+

5165

+static int test_tbegin_ntstg_tabort (void)

5166

+{

5167

+ float f;

5168

+

5169

+ counters.c1 = 0;

5170

+ counters.c2 = 0;

5171

+ f = 0;

5172

+ if (__builtin_tbegin ((void *)0) == 0)

5173

+ {

5174

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

5175

+ counters.c2 = 2;

5176

+ f = 1;

5177

+ __builtin_tabort (256);

5178

+ return 1;

5179

+ }

5180

+ if (counters.c1 != 1)

5181

+ {

5182

+ return 100 * counters.c1 + 2;

5183

+ }

5184

+ if (counters.c2 != 0)

5185

+ {

5186

+ return 100 * counters.c2 + 3;

5187

+ }

5188

+ if (f != 0)

5189

+ {

5190

+ return 100 * f + 4;

5191

+ }

5192

+

5193

+ return 0;

5194

+}

5195

+

5196

+static int test_tbegin_nofloat (void)

5197

+{

5198

+ int rc;

5199

+

5200

+ counters.c1 = 0;

5201

+ counters.c2 = 0;

5202

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

5203

+ {

5204

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, 1);

5205

+ counters.c2 = 2;

5206

+ rc = __builtin_tend ();

5207

+ if (rc != 0)

5208

+ {

5209

+ return 100 * rc + 5;

5210

+ }

5211

+ if (counters.c1 != 1)

5212

+ {

5213

+ return 100 * counters.c1 + 2;

5214

+ }

5215

+ if (counters.c2 != 2)

5216

+ {

5217

+ return 100 * counters.c2 + 3;

5218

+ }

5219

+ }

5220

+ else

5221

+ {

5222

+ return 100 * rc + 4;

5223

+ }

5224

+

5225

+ return 0;

5226

+}

5227

+

5228

+static int test_tbegin_retry (void)

5229

+{

5230

+ int rc;

5231

+

5232

+ counters.c1 = 0;

5233

+ counters.c2 = 0;

5234

+ counters.c3 = 0;

5235

+ if ((rc = __builtin_tbegin_retry ((void *)0, 5)) == 0)

5236

+ {

5237

+ int do_abort;

5238

+

5239

+ do_abort = (counters.c1 == 0) ? 1 : 0;

5240

+ __builtin_non_tx_store (

5241

+ (uint64_t *)&counters.c1, counters.c1 + 1);

5242

+ if (do_abort == 1)

5243

+ {

5244

+ __builtin_tabort (256);

5245

+ }

5246

+ counters.c2 = counters.c2 + 10;

5247

+ __builtin_non_tx_store ((uint64_t *)&counters.c3, 3);

5248

+ rc = __builtin_tend ();

5249

+ if (rc != 0)

5250

+ {

5251

+ return 100 * rc + 5;

5252

+ }

5253

+ if (counters.c1 != 2)

5254

+ {

5255

+ return 100 * counters.c1 + 2;

5256

+ }

5257

+ if (counters.c2 != 10)

5258

+ {

5259

+ return 100 * counters.c2 + 3;

5260

+ }

5261

+ if (counters.c3 != 3)

5262

+ {

5263

+ return 100 * counters.c3 + 6;

5264

+ }

5265

+ }

5266

+ else

5267

+ {

5268

+ return 100 * rc + 4;

5269

+ }

5270

+

5271

+ return 0;

5272

+}

5273

+

5274

+static int test_tbegin_retry_nofloat (void)

5275

+{

5276

+ int rc;

5277

+

5278

+ counters.c1 = 0;

5279

+ counters.c2 = 0;

5280

+ counters.c3 = 0;

5281

+ if ((rc = __builtin_tbegin_retry_nofloat ((void *)0, 5)) == 0)

5282

+ {

5283

+ int do_abort;

5284

+

5285

+ do_abort = (counters.c1 == 0) ? 1 : 0;

5286

+ __builtin_non_tx_store (

5287

+ (uint64_t *)&counters.c1, counters.c1 + 1);

5288

+ if (do_abort == 1)

5289

+ {

5290

+ __builtin_tabort (256);

5291

+ }

5292

+ counters.c2 = counters.c2 + 10;

5293

+ __builtin_non_tx_store ((uint64_t *)&counters.c3, 3);

5294

+ rc = __builtin_tend ();

5295

+ if (rc != 0)

5296

+ {

5297

+ return 100 * rc + 5;

5298

+ }

5299

+ if (counters.c1 != 2)

5300

+ {

5301

+ return 100 * counters.c1 + 2;

5302

+ }

5303

+ if (counters.c2 != 10)

5304

+ {

5305

+ return 100 * counters.c2 + 3;

5306

+ }

5307

+ if (counters.c3 != 3)

5308

+ {

5309

+ return 100 * counters.c3 + 6;

5310

+ }

5311

+ }

5312

+ else

5313

+ {

5314

+ return 100 * rc + 4;

5315

+ }

5316

+

5317

+ return 0;

5318

+}

5319

+

5320

+static int test_tbegin_aborts (void)

5321

+{

5322

+ float f;

5323

+ int rc;

5324

+

5325

+ f = 77;

5326

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5327

+ {

5328

+ f = 88;

5329

+ __builtin_tabort (256);

5330

+ return 2;

5331

+ }

5332

+ else if (rc != 2)

5333

+ {

5334

+ return 3;

5335

+ }

5336

+ if (f != 77)

5337

+ {

5338

+ return 4;

5339

+ }

5340

+ f = 66;

5341

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5342

+ {

5343

+ f = 99;

5344

+ __builtin_tabort (257);

5345

+ return 5;

5346

+ }

5347

+ else if (rc != 3)

5348

+ {

5349

+ return 100 * rc + 6;

5350

+ }

5351

+ if (f != 66)

5352

+ {

5353

+ return 100 * f + 7;

5354

+ }

5355

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5356

+ {

5357

+ global.float_3 = global.float_1 + global.float_2;

5358

+ rc = __builtin_tend ();

5359

+ if (rc != 0)

5360

+ {

5361

+ return 100 * rc + 8;

5362

+ }

5363

+ }

5364

+ else

5365

+ {

5366

+ return 100 * rc + 9;

5367

+ }

5368

+ if (global.float_3 != global.float_1 + global.float_2)

5369

+ {

5370

+ return 100 * rc + 10;

5371

+ }

5372

+

5373

+ return 0;

5374

+}

5375

+

5376

+static __attribute__((noinline)) void indirect_abort(int abort_code)

5377

+{

5378

+ __builtin_tabort (abort_code);

5379

+

5380

+ return;

5381

+}

5382

+

5383

+static int test_tbegin_indirect_aborts (void)

5384

+{

5385

+ float f;

5386

+ int rc;

5387

+

5388

+ f = 77;

5389

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5390

+ {

5391

+ f = 88;

5392

+ indirect_abort(256);

5393

+ return 2;

5394

+ }

5395

+ else if (rc != 2)

5396

+ {

5397

+ return 100 * rc + 3;

5398

+ }

5399

+ if (f != 77)

5400

+ {

5401

+ return 100 * rc + 4;

5402

+ }

5403

+ f = 66;

5404

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5405

+ {

5406

+ f = 99;

5407

+ indirect_abort(257);

5408

+ return 5;

5409

+ }

5410

+ else if (rc != 3)

5411

+ {

5412

+ return 100 * rc + 6;

5413

+ }

5414

+ if (f != 66)

5415

+ {

5416

+ return 100 * f + 7;

5417

+ }

5418

+

5419

+ return 0;

5420

+}

5421

+

5422

+static int test_tbegin_nofloat_aborts (void)

5423

+{

5424

+ int rc;

5425

+

5426

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

5427

+ {

5428

+ __builtin_tabort (256);

5429

+ return 2;

5430

+ }

5431

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

5432

+ {

5433

+ __builtin_tabort (257);

5434

+ return 1005;

5435

+ }

5436

+ else if (rc != 3)

5437

+ {

5438

+ return 1000 * rc + 6;

5439

+ }

5440

+

5441

+ return 0;

5442

+}

5443

+

5444

+static int test_tbegin_nofloat_indirect_aborts (void)

5445

+{

5446

+ int rc;

5447

+

5448

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

5449

+ {

5450

+ indirect_abort (256);

5451

+ return 2;

5452

+ }

5453

+ if ((rc = __builtin_tbegin_nofloat ((void *)0)) == 0)

5454

+ {

5455

+ indirect_abort (257);

5456

+ return 1005;

5457

+ }

5458

+ else if (rc != 3)

5459

+ {

5460

+ return 1000 * rc + 6;

5461

+ }

5462

+

5463

+ return 0;

5464

+}

5465

+

5466

+static

5467

+int _test_tbegin_retry_aborts (int retries, uint64_t abort_code)

5468

+{

5469

+ int rc;

5470

+

5471

+ counters.c1 = 0;

5472

+ if ((rc = __builtin_tbegin_retry ((void *)0, retries)) == 0)

5473

+ {

5474

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, counters.c1 + 1);

5475

+ __builtin_tabort (abort_code);

5476

+ return 2;

5477

+ }

5478

+ else

5479

+ {

5480

+ if ((abort_code & 1) == 0)

5481

+ {

5482

+ if (rc != 2)

5483

+ {

5484

+ return 100 * rc + 2003;

5485

+ }

5486

+ else if (counters.c1 != (uint64_t)retries + 1)

5487

+ {

5488

+ return 1000 * counters.c1 + 100 * retries + 4;

5489

+ }

5490

+ }

5491

+ else

5492

+ {

5493

+ if (rc != 3)

5494

+ {

5495

+ return 100 * rc + 3005;

5496

+ }

5497

+ else if (counters.c1 != 1)

5498

+ {

5499

+ return 1000 * counters.c1 + 100 * retries + 6;

5500

+ }

5501

+ }

5502

+ }

5503

+

5504

+ return 0;

5505

+}

5506

+

5507

+static int test_tbegin_retry_aborts (void)

5508

+{

5509

+ int rc;

5510

+ int retries;

5511

+

5512

+ for (retries = 1; retries <= 3; retries++)

5513

+ {

5514

+ rc = _test_tbegin_retry_aborts (retries, 256);

5515

+ if (rc != 0)

5516

+ {

5517

+ return 10000 + rc;

5518

+ }

5519

+ }

5520

+ for (retries = 1; retries <= 3; retries++)

5521

+ {

5522

+ rc = _test_tbegin_retry_aborts (retries, 257);

5523

+ if (rc != 0)

5524

+ {

5525

+ return 20000 + rc;

5526

+ }

5527

+ }

5528

+ if ((rc = __builtin_tbegin_retry ((void *)0, 5)) == 0)

5529

+ {

5530

+ global.float_3 = global.float_1 + global.float_2;

5531

+ rc = __builtin_tend ();

5532

+ if (rc != 0)

5533

+ {

5534

+ return 30000 + 100 * rc + 6;

5535

+ }

5536

+ }

5537

+ else

5538

+ {

5539

+ return 30000 + 100 * rc + 7;

5540

+ }

5541

+

5542

+ return 0;

5543

+}

5544

+

5545

+static int _test_tbegin_retry_nofloat_aborts (int retries, uint64_t abort_code)

5546

+{

5547

+ int rc;

5548

+

5549

+ counters.c1 = 0;

5550

+ if ((rc = __builtin_tbegin_retry_nofloat ((void *)0, retries)) == 0)

5551

+ {

5552

+ __builtin_non_tx_store ((uint64_t *)&counters.c1, counters.c1 + 1);

5553

+ __builtin_tabort (abort_code);

5554

+ return 2;

5555

+ }

5556

+ else

5557

+ {

5558

+ if ((abort_code & 1) == 0)

5559

+ {

5560

+ if (rc != 2)

5561

+ {

5562

+ return 100 * rc + 2003;

5563

+ }

5564

+ else if (counters.c1 != (uint64_t)retries + 1)

5565

+ {

5566

+ return 1000 * counters.c1 + 100 * retries + 4;

5567

+ }

5568

+ }

5569

+ else

5570

+ {

5571

+ if (rc != 3)

5572

+ {

5573

+ return 100 * rc + 3005;

5574

+ }

5575

+ else if (counters.c1 != 1)

5576

+ {

5577

+ return 1000 * counters.c1 + 100 * retries + 6;

5578

+ }

5579

+ }

5580

+ }

5581

+

5582

+ return 0;

5583

+}

5584

+

5585

+static int test_tbegin_retry_nofloat_aborts (void)

5586

+{

5587

+ int rc;

5588

+ int retries;

5589

+

5590

+ for (retries = 1; retries <= 3; retries++)

5591

+ {

5592

+ rc = _test_tbegin_retry_nofloat_aborts (retries, 256);

5593

+ if (rc != 0)

5594

+ {

5595

+ return 10 * retries + rc;

5596

+ }

5597

+ }

5598

+ for (retries = 1; retries <= 3; retries++)

5599

+ {

5600

+ rc = _test_tbegin_retry_nofloat_aborts (retries, 257);

5601

+ if (rc != 0)

5602

+ {

5603

+ return 10000 + 10 * retries + rc;

5604

+ }

5605

+ }

5606

+

5607

+ return 0;

5608

+}

5609

+

5610

+static int test_tbegin_tdb (void)

5611

+{

5612

+ int rc;

5613

+

5614

+ local_tdb.format = 0;

5615

+ if ((rc = __builtin_tbegin (&local_tdb)) == 0)

5616

+ {

5617

+ rc = __builtin_tend ();

5618

+ if (rc != 0)

5619

+ {

5620

+ return 100 * rc + 1;

5621

+ }

5622

+ if (local_tdb.format != 0)

5623

+ {

5624

+ dump_tdb (&local_tdb);

5625

+ return 100 * local_tdb.format + 2;

5626

+ }

5627

+ }

5628

+ else

5629

+ {

5630

+ return 100 * rc + 3;

5631

+ }

5632

+ local_tdb.format = 0;

5633

+ if ((rc = __builtin_tbegin (&local_tdb)) == 0)

5634

+ {

5635

+ __builtin_tabort (257);

5636

+ return 4;

5637

+ }

5638

+ else

5639

+ {

5640

+ if (rc != 3)

5641

+ {

5642

+ return 100 * rc + 5;

5643

+ }

5644

+ if (local_tdb.format != 1)

5645

+ {

5646

+ dump_tdb (&local_tdb);

5647

+ return 100 * local_tdb.format + 6;

5648

+ }

5649

+ }

5650

+ local_tdb256.format = 0;

5651

+ if ((rc = __builtin_tbegin (&local_tdb256)) == 0)

5652

+ {

5653

+ rc = __builtin_tend ();

5654

+ if (rc != 0)

5655

+ {

5656

+ return 1100 * rc + 1;

5657

+ }

5658

+ if (local_tdb256.format != 0)

5659

+ {

5660

+ dump_tdb (&local_tdb256);

5661

+ return 1100 * local_tdb256.format + 2;

5662

+ }

5663

+ }

5664

+ else

5665

+ {

5666

+ return 1100 * rc + 3;

5667

+ }

5668

+ local_tdb256.format = 0;

5669

+ if ((rc = __builtin_tbegin (&local_tdb256)) == 0)

5670

+ {

5671

+ __builtin_tabort (257);

5672

+ return 2004;

5673

+ }

5674

+ else

5675

+ {

5676

+ if (rc != 3)

5677

+ {

5678

+ return 2100 * rc + 5;

5679

+ }

5680

+ if (local_tdb256.format != 1)

5681

+ {

5682

+ dump_tdb (&local_tdb256);

5683

+ return 2100 * local_tdb256.format + 6;

5684

+ }

5685

+ }

5686

+

5687

+ return 0;

5688

+}

5689

+

5690

+static int test_tbegin_nofloat_tdb (void)

5691

+{

5692

+ int rc;

5693

+

5694

+ local_tdb.format = 0;

5695

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb)) == 0)

5696

+ {

5697

+ rc = __builtin_tend ();

5698

+ if (rc != 0)

5699

+ {

5700

+ return 100 * rc + 1;

5701

+ }

5702

+ if (local_tdb.format != 0)

5703

+ {

5704

+ dump_tdb (&local_tdb);

5705

+ return 100 * local_tdb.format + 2;

5706

+ }

5707

+ }

5708

+ else

5709

+ {

5710

+ return 3;

5711

+ }

5712

+ local_tdb.format = 0;

5713

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb)) == 0)

5714

+ {

5715

+ __builtin_tabort (257);

5716

+ return 4;

5717

+ }

5718

+ else

5719

+ {

5720

+ if (rc != 3)

5721

+ {

5722

+ return 100 * rc + 5;

5723

+ }

5724

+ if (local_tdb.format != 1)

5725

+ {

5726

+ dump_tdb (&local_tdb);

5727

+ return 100 * local_tdb.format + 6;

5728

+ }

5729

+ }

5730

+ local_tdb256.format = 0;

5731

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb256)) == 0)

5732

+ {

5733

+ rc = __builtin_tend ();

5734

+ if (rc != 0)

5735

+ {

5736

+ return 1100 * rc + 1;

5737

+ }

5738

+ if (local_tdb256.format != 0)

5739

+ {

5740

+ dump_tdb (&local_tdb256);

5741

+ return 1100 * local_tdb256.format + 2;

5742

+ }

5743

+ }

5744

+ else

5745

+ {

5746

+ return 1003;

5747

+ }

5748

+ local_tdb256.format = 0;

5749

+ if ((rc = __builtin_tbegin_nofloat (&local_tdb256)) == 0)

5750

+ {

5751

+ __builtin_tabort (257);

5752

+ return 2004;

5753

+ }

5754

+ else

5755

+ {

5756

+ if (rc != 3)

5757

+ {

5758

+ return 2100 * rc + 5;

5759

+ }

5760

+ if (local_tdb256.format != 1)

5761

+ {

5762

+ dump_tdb (&local_tdb256);

5763

+ return 2100 * local_tdb256.format + 6;

5764

+ }

5765

+ }

5766

+

5767

+ return 0;

5768

+}

5769

+

5770

+static int test_tbegin_retry_tdb (void)

5771

+{

5772

+ int rc;

5773

+

5774

+ local_tdb256.format = 0;

5775

+ if ((rc = __builtin_tbegin_retry (&local_tdb256, 2)) == 0)

5776

+ {

5777

+ rc = __builtin_tend ();

5778

+ if (rc != 0)

5779

+ {

5780

+ return 1100 * rc + 1;

5781

+ }

5782

+ if (local_tdb256.format != 0)

5783

+ {

5784

+ dump_tdb (&local_tdb256);

5785

+ return 1100 * local_tdb256.format + 2;

5786

+ }

5787

+ }

5788

+ else

5789

+ {

5790

+ return 1003;

5791

+ }

5792

+ local_tdb256.format = 0;

5793

+ if ((rc = __builtin_tbegin_retry (&local_tdb256, 2)) == 0)

5794

+ {

5795

+ __builtin_tabort (257);

5796

+ return 2004;

5797

+ }

5798

+ else

5799

+ {

5800

+ if (rc != 3)

5801

+ {

5802

+ return 2100 * rc + 5;

5803

+ }

5804

+ if (local_tdb256.format != 1)

5805

+ {

5806

+ dump_tdb (&local_tdb256);

5807

+ return 2100 * local_tdb256.format + 6;

5808

+ }

5809

+ }

5810

+

5811

+ return 0;

5812

+}

5813

+

5814

+static int test_tbegin_retry_nofloat_tdb (void)

5815

+{

5816

+ int rc;

5817

+

5818

+ local_tdb.format = 0;

5819

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb, 2)) == 0)

5820

+ {

5821

+ rc = __builtin_tend ();

5822

+ if (rc != 0)

5823

+ {

5824

+ return 100 * rc + 1;

5825

+ }

5826

+ if (local_tdb.format != 0)

5827

+ {

5828

+ dump_tdb (&local_tdb);

5829

+ return 100 * local_tdb.format + 2;

5830

+ }

5831

+ }

5832

+ else

5833

+ {

5834

+ return 100 * rc + 3;

5835

+ }

5836

+ local_tdb.format = 0;

5837

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb, 2)) == 0)

5838

+ {

5839

+ __builtin_tabort (257);

5840

+ return 4;

5841

+ }

5842

+ else

5843

+ {

5844

+ if (rc != 3)

5845

+ {

5846

+ return 100 * rc + 5;

5847

+ }

5848

+ if (local_tdb.format != 1)

5849

+ {

5850

+ dump_tdb (&local_tdb);

5851

+ return 100 * local_tdb.format + 6;

5852

+ }

5853

+ }

5854

+ local_tdb256.format = 0;

5855

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb256, 2)) == 0)

5856

+ {

5857

+ rc = __builtin_tend ();

5858

+ if (rc != 0)

5859

+ {

5860

+ return 1100 * rc + 1;

5861

+ }

5862

+ if (local_tdb256.format != 0)

5863

+ {

5864

+ dump_tdb (&local_tdb256);

5865

+ return 1100 * local_tdb256.format + 2;

5866

+ }

5867

+ }

5868

+ else

5869

+ {

5870

+ return 1100 * rc + 3;

5871

+ }

5872

+ local_tdb256.format = 0;

5873

+ if ((rc = __builtin_tbegin_retry_nofloat (&local_tdb256, 2)) == 0)

5874

+ {

5875

+ __builtin_tabort (257);

5876

+ return 2004;

5877

+ }

5878

+ else

5879

+ {

5880

+ if (rc != 3)

5881

+ {

5882

+ return 2100 * rc + 5;

5883

+ }

5884

+ if (local_tdb256.format != 1)

5885

+ {

5886

+ dump_tdb (&local_tdb256);

5887

+ return 2100 * local_tdb256.format + 6;

5888

+ }

5889

+ }

5890

+

5891

+ return 0;

5892

+}

5893

+

5894

+static int test_etnd (void)

5895

+{

5896

+ int rc;

5897

+

5898

+ counters.c1 = 0;

5899

+ counters.c2 = 0;

5900

+ counters.c3 = 0;

5901

+ if ((rc = __builtin_tbegin ((void *)0)) == 0)

5902

+ {

5903

+ counters.c1 = __builtin_tx_nesting_depth ();

5904

+ if (__builtin_tbegin ((void *)0) == 0)

5905

+ {

5906

+ counters.c2 = __builtin_tx_nesting_depth ();

5907

+ if (__builtin_tbegin ((void *)0) == 0)

5908

+ {

5909

+ counters.c3 = __builtin_tx_nesting_depth ();

5910

+ __builtin_tend ();

5911

+ }

5912

+ __builtin_tend ();

5913

+ }

5914

+ __builtin_tend ();

5915

+ }

5916

+ else

5917

+ {

5918

+ return 100 * rc + 1;

5919

+ }

5920

+ if (counters.c1 != 1)

5921

+ {

5922

+ return 100 * counters.c1 + 2;

5923

+ }

5924

+ if (counters.c2 != 2)

5925

+ {

5926

+ return 100 * counters.c2 + 3;

5927

+ }

5928

+ if (counters.c3 != 3)

5929

+ {

5930

+ return 100 * counters.c3 + 4;

5931

+ }

5932

+

5933

+ return 0;

5934

+}

5935

+

5936

+static int test_tbeginc (void)

5937

+{

5938

+ int rc;

5939

+

5940

+ counters.c1 = 0;

5941

+ __builtin_tbeginc ();

5942

+ counters.c1 = 1;

5943

+ rc = __builtin_tend ();

5944

+ if (rc != 0)

5945

+ {

5946

+ return 10000 * rc + 1;

5947

+ }

5948

+ if (counters.c1 != 1)

5949

+ {

5950

+ return 100000 * counters.c1 + 3;

5951

+ }

5952

+

5953

+ return 0;

5954

+}

5955

+

5956

+/* ---------------------------- local testing framework functions ---------- */

5957

+

5958

+static int run_one_test (const test_table_entry_t *test_entry)

5959

+{

5960

+ int do_print_passes;

5961

+ int succeeded;

5962

+ int rc;

5963

+ int i;

5964

+

5965

+ /* Warmup run to get all necessary data and instruction pages into the page

5966

+ * tables. */

5967

+ {

5968

+ int run;

5969

+

5970

+ do_dump_tdb = 0;

5971

+ for (run = 0; run < NUM_WARMUP_RUNS; run++)

5972

+ {

5973

+ test_entry->test_func ();

5974

+ }

5975

+ do_dump_tdb = 1;

5976

+ }

5977

+ do_print_passes = (

5978

+ test_entry->required_quorum != 1 ||

5979

+ test_entry->max_repetitions != 1);

5980

+ printf ("RRR RUN %s\n", test_entry->name);

5981

+ if (do_print_passes == 1)

5982

+ {

5983

+ printf (

5984

+ " (requires %d successful out of %d runs)\n",

5985

+ test_entry->required_quorum,

5986

+ test_entry->max_repetitions);

5987

+ }

5988

+ succeeded = 0;

5989

+ rc = 0;

5990

+ for (rc = 0, i = 0; i < test_entry->max_repetitions; i++)

5991

+ {

5992

+ if (do_print_passes == 1)

5993

+ {

5994

+ if (i == 0)

5995

+ {

5996

+ printf (" ");

5997

+ }

5998

+ else

5999

+ {

6000

+ printf (",");

6001

+ }

6002

+ }

6003

+ rc = test_entry->test_func ();

6004

+ if (rc == 0)

6005

+ {

6006

+ if (do_print_passes == 1)

6007

+ {

6008

+ printf (" success");

6009

+ }

6010

+ succeeded++;

6011

+ if (succeeded >= test_entry->required_quorum)

6012

+ {

6013

+ break;

6014

+ }

6015

+ }

6016

+ else

6017

+ {

6018

+ printf (" failed (rc = %d)", rc);

6019

+ }

6020

+ }

6021

+ if (do_print_passes == 1 || rc != 0)

6022

+ {

6023

+ printf ("\n");

6024

+ }

6025

+ if (succeeded >= test_entry->required_quorum)

6026

+ {

6027

+ printf ("+++ OK %s\n", test_entry->name);

6028

+

6029

+ return 0;

6030

+ }

6031

+ else

6032

+ {

6033

+ printf ("--- FAIL %s\n", test_entry->name);

6034

+

6035

+ return (rc != 0) ? rc : -1;

6036

+ }

6037

+}

6038

+

6039

+static int run_all_tests (const test_table_entry_t *test_table)

6040

+{

6041

+ const test_table_entry_t *test;

6042

+ int rc;

6043

+

6044

+ for (

6045

+ rc = 0, test = &test_table[0];

6046

+ test->test_func != NULL && rc == 0; test++)

6047

+ {

6048

+ rc = run_one_test (test);

6049

+ }

6050

+

6051

+ return rc;

6052

+}

6053

+

6054

+/* ---------------------------- interface functions ------------------------ */

6055

+

6056

+int main (void)

6057

+{

6058

+ const test_table_entry_t test_table[] = {

6059

+ TEST_NO_REP (test_constants),

6060

+ TEST_DF_REP (test_tbegin_ntstg_tend),

6061

+ TEST_DF_REP (test_tbegin_ntstg_tabort),

6062

+ TEST_DF_REP (test_tbegin_nofloat),

6063

+ TEST_NO_REP (test_tbegin_retry),

6064

+ TEST_NO_REP (test_tbegin_retry_nofloat),

6065

+ TEST_DF_REP (test_tbegin_aborts),

6066

+ TEST_DF_REP (test_tbegin_indirect_aborts),

6067

+ TEST_DF_REP (test_tbegin_nofloat_aborts),

6068

+ TEST_DF_REP (test_tbegin_nofloat_indirect_aborts),

6069

+ TEST_NO_REP (test_tbegin_retry_aborts),

6070

+ TEST_NO_REP (test_tbegin_retry_nofloat_aborts),

6071

+ TEST_DF_REP (test_tbegin_tdb),

6072

+ TEST_DF_REP (test_tbegin_nofloat_tdb),

6073

+ TEST_NO_REP (test_tbegin_retry_tdb),

6074

+ TEST_NO_REP (test_tbegin_retry_nofloat_tdb),

6075

+ TEST_DF_REP (test_etnd),

6076

+ TEST_DF_REP (test_tbeginc),

6077

+ { (void *)0, 0, 0 }

6078

+ };

6079

+

6080

+ {

6081

+ int rc;

6082

+

6083

+ rc = run_all_tests (test_table);

6084

+

6085

+ return rc;

6086

+ }

6087

+}

6088

Index: gcc/testsuite/gcc.target/s390/htm-builtins-2.c

6089

===================================================================

6090

--- a/src/gcc/testsuite/gcc.target/s390/htm-builtins-2.c (.../tags/gcc_4_8_2_release)

6091

+++ b/src/gcc/testsuite/gcc.target/s390/htm-builtins-2.c (.../branches/gcc-4_8-branch)

6092

@@ -0,0 +1,682 @@

6093

+/* Functional tests of the htm __TM_... macros. */

6094

+

6095

+/* { dg-do run } */

6096

+/* { dg-require-effective-target htm } */

6097

+/* { dg-options "-O3 -march=zEC12 -mzarch" } */

6098

+

6099

+/* ---------------------------- included header files ---------------------- */

6100

+

6101

+#include <stdio.h>

6102

+#include <string.h>

6103

+#include <inttypes.h>

6104

+#include <htmxlintrin.h>

6105

+

6106

+/* ---------------------------- local definitions -------------------------- */

6107

+

6108

+#define DEFAULT_MAX_REPETITIONS 5

6109

+#define DEFAULT_REQUIRED_QUORUM ((DEFAULT_MAX_REPETITIONS) - 1)

6110

+#define DEFAULT_ABORT_ADDRESS (0x12345678u)

6111

+

6112

+/* ---------------------------- local macros ------------------------------- */

6113

+

6114

+#define TEST_DF_REP(name) \

6115

+ { #name, name, DEFAULT_MAX_REPETITIONS, DEFAULT_REQUIRED_QUORUM }

6116

+#define TEST_NO_REP(name) { #name, name, 1, 1 }

6117

+

6118

+/* ---------------------------- local types -------------------------------- */

6119

+

6120

+typedef int (*test_func_t)(void);

6121

+

6122

+typedef struct

6123

+{

6124

+ const char *name;

6125

+ test_func_t test_func;

6126

+ int max_repetitions;

6127

+ int required_quorum;

6128

+} test_table_entry_t;

6129

+

6130

+typedef enum

6131

+{

6132

+ ABORT_T_SYSTEM = 0,

6133

+ ABORT_T_USER = 1,

6134

+} abort_user_t;

6135

+

6136

+typedef enum

6137

+{

6138

+ ABORT_T_NONE = 0,

6139

+ ABORT_T_ILLEGAL,

6140

+ ABORT_T_FOOTPRINT_EXCEEDED,

6141

+ ABORT_T_NESTED_TOO_DEEP,

6142

+ ABORT_T_CONFLICT,

6143

+

6144

+ ABORT_T_INVALID_ABORT_CODE

6145

+} abort_t;

6146

+

6147

+/* ---------------------------- local variables ---------------------------- */

6148

+

6149

+__attribute__ ((aligned(256))) static struct __htm_tdb local_tdb256;

6150

+static struct __htm_tdb local_tdb;

6151

+

6152

+static abort_t const abort_classes[] =

6153

+{

6154

+ ABORT_T_INVALID_ABORT_CODE,

6155

+ ABORT_T_NONE,

6156

+ ABORT_T_NONE,

6157

+ ABORT_T_NONE,

6158

+

6159

+ ABORT_T_ILLEGAL,

6160

+ ABORT_T_NONE,

6161

+ ABORT_T_NONE,

6162

+ ABORT_T_FOOTPRINT_EXCEEDED,

6163

+

6164

+ ABORT_T_FOOTPRINT_EXCEEDED,

6165

+ ABORT_T_CONFLICT,

6166

+ ABORT_T_CONFLICT,

6167

+ ABORT_T_ILLEGAL,

6168

+

6169

+ ABORT_T_NONE,

6170

+ ABORT_T_NESTED_TOO_DEEP,

6171

+ ABORT_T_NONE,

6172

+ ABORT_T_NONE,

6173

+

6174

+ ABORT_T_NONE

6175

+};

6176

+

6177

+static size_t num_abort_classes = sizeof(abort_classes) / sizeof(abort_t);

6178

+

6179

+/* ---------------------------- exported variables (globals) --------------- */

6180

+

6181

+int global_int = 0;

6182

+uint64_t global_u64 = 0;

6183

+float global_float_1 = 1.0;

6184

+float global_float_2 = 2.5;

6185

+float global_float_3 = 0.0;

6186

+__attribute__ ((aligned(256))) struct

6187

+{

6188

+ volatile uint64_t c1;

6189

+ volatile uint64_t c2;

6190

+ volatile uint64_t c3;

6191

+} counters = { 0, 0, 0 };

6192

+

6193

+/* ---------------------------- local helper functions --------------------- */

6194

+

6195

+static void dump_tdb(struct __htm_tdb *tdb)

6196

+{

6197

+ unsigned char *p;

6198

+ int i;

6199

+ int j;

6200

+

6201

+ p = (unsigned char *)tdb;

6202

+ for (i = 0; i < 16; i++)

6203

+ {

6204

+ fprintf(stderr, "0x%02x ", i * 16);

6205

+ for (j = 0; j < 16; j++)

6206

+ {

6207

+ fprintf(stderr, "%02x", (int)p[i * 16 + j]);

6208

+ if (j < 15)

6209

+ {

6210

+ fprintf(stderr, " ");

6211

+ }

6212

+ if (j == 7)

6213

+ {

6214

+ fprintf(stderr, " ");

6215

+ }

6216

+ }

6217

+ fprintf(stderr, "\n");

6218

+ }

6219

+

6220

+ return;

6221

+}

6222

+

6223

+static void make_fake_tdb(struct __htm_tdb *tdb)

6224

+{

6225

+ memset(tdb, 0, sizeof(*tdb));

6226

+ tdb->format = 1;

6227

+ tdb->nesting_depth = 1;

6228

+ tdb->atia = DEFAULT_ABORT_ADDRESS;

6229

+ tdb->abort_code = 11;

6230

+

6231

+ return;

6232

+}

6233

+

6234

+static int check_abort_code_in_tdb(struct __htm_tdb *tdb, uint64_t abort_code)

6235

+{

6236

+ long expect_rc;

6237

+ long rc;

6238

+

6239

+ if (abort_code != 0)

6240

+ {

6241

+ long addr;

6242

+

6243

+ addr = __TM_failure_address(&local_tdb);

6244

+ if (addr != DEFAULT_ABORT_ADDRESS)

6245

+ {

6246

+ return 11;

6247

+ }

6248

+ }

6249

+ {

6250

+ long long tdb_abort_code;

6251

+

6252

+ tdb_abort_code = __TM_failure_code(tdb);

6253

+ if ((uint64_t)tdb_abort_code != abort_code)

6254

+ {

6255

+ fprintf(

6256

+ stderr, "tm_ac %" PRIu64 ", ac %" PRIu64

6257

+ ", tdb_ac %" PRIu64 "\n",

6258

+ (uint64_t)tdb_abort_code, abort_code,

6259

+ (uint64_t)tdb->abort_code);

6260

+ return 10;

6261

+ }

6262

+ }

6263

+ expect_rc = (abort_code >= 256) ? 1 : 0;

6264

+ rc = __TM_is_user_abort(tdb);

6265

+ if (rc != expect_rc)

6266

+ {

6267

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

6268

+ return 1;

6269

+ }

6270

+ {

6271

+ unsigned char code;

6272

+

6273

+ code = 0xffu;

6274

+ rc = __TM_is_named_user_abort(tdb, &code);

6275

+ if (rc != expect_rc)

6276

+ {

6277

+ fprintf(

6278

+ stderr, "rc %ld, expect_rc %ld\n", rc,

6279

+ expect_rc);

6280

+ return 2;

6281

+ }

6282

+ if (expect_rc == 1 && code != abort_code - 256)

6283

+ {

6284

+ return 3;

6285

+ }

6286

+ }

6287

+ if (abort_code > (uint64_t)num_abort_classes)

6288

+ {

6289

+ abort_code = (uint64_t)num_abort_classes;

6290

+ }

6291

+ expect_rc = (abort_classes[abort_code] == ABORT_T_ILLEGAL) ? 1 : 0;

6292

+ rc = __TM_is_illegal(tdb);

6293

+ if (rc != expect_rc)

6294

+ {

6295

+ dump_tdb(tdb);

6296

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

6297

+ return 4;

6298

+ }

6299

+ expect_rc =

6300

+ (abort_classes[abort_code] == ABORT_T_FOOTPRINT_EXCEEDED) ?

6301

+ 1 : 0;

6302

+ rc = __TM_is_footprint_exceeded(tdb);

6303

+ if (rc != expect_rc)

6304

+ {

6305

+ dump_tdb(tdb);

6306

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

6307

+ return 5;

6308

+ }

6309

+ expect_rc =

6310

+ (abort_classes[abort_code] == ABORT_T_NESTED_TOO_DEEP) ? 1 : 0;

6311

+ rc = __TM_is_nested_too_deep(tdb);

6312

+ if (rc != expect_rc)

6313

+ {

6314

+ dump_tdb(tdb);

6315

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

6316

+ return 6;

6317

+ }

6318

+ expect_rc = (abort_classes[abort_code] == ABORT_T_CONFLICT) ? 1 : 0;

6319

+ rc = __TM_is_conflict(tdb);

6320

+ if (rc != expect_rc)

6321

+ {

6322

+ dump_tdb(tdb);

6323

+ fprintf(stderr, "rc %ld, expect_rc %ld\n", rc, expect_rc);

6324

+ return 7;

6325

+ }

6326

+

6327

+ return 0;

6328

+}

6329

+

6330

+/* ---------------------------- local test functions ----------------------- */

6331

+

6332

+/* Not a test; make sure that the involved global cachelines are reserved for

6333

+ * writing. */

6334

+static int init_cache(void)

6335

+{

6336

+ make_fake_tdb(&local_tdb);

6337

+ make_fake_tdb(&local_tdb256);

6338

+ global_int = 0;

6339

+ global_u64 = 0;

6340

+ global_float_1 = 1.0;

6341

+ global_float_2 = 2.5;

6342

+ global_float_3 = 0.0;

6343

+ counters.c1 = 0;

6344

+ counters.c2 = 0;

6345

+ counters.c3 = 0;

6346

+

6347

+ return 0;

6348

+}

6349

+

6350

+static int test_abort_classification(void)

6351

+{

6352

+ int i;

6353

+

6354

+ make_fake_tdb(&local_tdb);

6355

+ for (i = 0; i <= 256; i++)

6356

+ {

6357

+ int rc;

6358

+

6359

+ local_tdb.abort_code = (uint64_t)i;

6360

+ rc = check_abort_code_in_tdb(&local_tdb, (uint64_t)i);

6361

+ if (rc != 0)

6362

+ {

6363

+ return 100 * i + rc;

6364

+ }

6365

+ }

6366

+

6367

+ return 0;

6368

+}

6369

+

6370

+static int test_cc_classification(void)

6371

+{

6372

+ long rc;

6373

+

6374

+ rc = __TM_is_failure_persistent(0);

6375

+ if (rc != 0)

6376

+ {

6377

+ return 1;

6378

+ }

6379

+ rc = __TM_is_failure_persistent(1);

6380

+ if (rc != 0)

6381

+ {

6382

+ return 2;

6383

+ }

6384

+ rc = __TM_is_failure_persistent(2);

6385

+ if (rc != 0)

6386

+ {

6387

+ return 3;

6388

+ }

6389

+ rc = __TM_is_failure_persistent(3);

6390

+ if (rc != 1)

6391

+ {

6392

+ return 4;

6393

+ }

6394

+

6395

+ return 0;

6396

+}

6397

+

6398

+static int test_tbegin_ntstg_tend(void)

6399

+{

6400

+ long rc;

6401

+

6402

+ counters.c1 = 0;

6403

+ counters.c2 = 0;

6404

+ if ((rc = __TM_simple_begin()) == 0)

6405

+ {

6406

+ __TM_non_transactional_store((uint64_t *)&counters.c1, 1);

6407

+ counters.c2 = 2;

6408

+ rc = __TM_end();

6409

+ if (rc != 0)

6410

+ {

6411

+ return 100 * rc + 5;

6412

+ }

6413

+ if (counters.c1 != 1)

6414

+ {

6415

+ return 100 * counters.c1 + 2;

6416

+ }

6417

+ if (counters.c2 != 2)

6418

+ {

6419

+ return 100 * counters.c2 + 3;

6420

+ }

6421

+ }

6422

+ else

6423

+ {

6424

+ return 100 * rc + 4;

6425

+ }

6426

+

6427

+ return 0;

6428

+}

6429

+

6430

+static int test_tbegin_ntstg_tabort(void)

6431

+{

6432

+ register float f;

6433

+

6434

+ counters.c1 = 0;

6435

+ counters.c2 = 0;

6436

+ f = 0;

6437

+ if (__TM_simple_begin() == 0)

6438

+ {

6439

+ __TM_non_transactional_store((uint64_t *)&counters.c1, 1);

6440

+ counters.c2 = 2;

6441

+ f = 1;

6442

+ __TM_named_abort(0);

6443

+ return 1;

6444

+ }

6445

+ if (counters.c1 != 1)

6446

+ {

6447

+ return 100 * counters.c1 + 2;

6448

+ }

6449

+ if (counters.c2 != 0)

6450

+ {

6451

+ return 100 * counters.c2 + 3;

6452

+ }

6453

+ if (f != 0)

6454

+ {

6455

+ return 100 * f + 4;

6456

+ }

6457

+

6458

+ return 0;

6459

+}

6460

+

6461

+static int test_tbegin_aborts(void)

6462

+{

6463

+ float f;

6464

+ long rc;

6465

+

6466

+ f = 77;

6467

+ if ((rc = __TM_simple_begin()) == 0)

6468

+ {

6469

+ f = 88;

6470

+ __TM_abort();

6471

+ return 2;

6472

+ }

6473

+ else if (rc != 2)

6474

+ {

6475

+ return 3;

6476

+ }

6477

+ if (f != 77)

6478

+ {

6479

+ return 4;

6480

+ }

6481

+ f = 66;

6482

+ if ((rc = __TM_simple_begin()) == 0)

6483

+ {

6484

+ f = 99;

6485

+ __TM_named_abort(3);

6486

+ return 5;

6487

+ }

6488

+ else if (rc != 3)

6489

+ {

6490

+ return 100 * rc + 6;

6491

+ }

6492

+ if (f != 66)

6493

+ {

6494

+ return 100 * f + 7;

6495

+ }

6496

+ if ((rc = __TM_simple_begin()) == 0)

6497

+ {

6498

+ global_float_3 = global_float_1 + global_float_2;

6499

+ rc = __TM_end();

6500

+ if (rc != 0)

6501

+ {

6502

+ return 100 * rc + 8;

6503

+ }

6504

+ }

6505

+ else

6506

+ {

6507

+ return 100 * rc + 9;

6508

+ }

6509

+ if (global_float_3 != global_float_1 + global_float_2)

6510

+ {

6511

+ return 100 * rc + 10;

6512

+ }

6513

+

6514

+ return 0;

6515

+}

6516

+

6517

+static int test_tbegin_tdb(void)

6518

+{

6519

+ long rc;

6520

+

6521

+ local_tdb.format = 0;

6522

+ if ((rc = __TM_begin(&local_tdb)) == 0)

6523

+ {

6524

+ rc = __TM_end();

6525

+ if (rc != 0)

6526

+ {

6527

+ return 100 * rc + 1;

6528

+ }

6529

+ if (local_tdb.format != 0)

6530

+ {

6531

+ dump_tdb(&local_tdb);

6532

+ return 100 * local_tdb.format + 2;

6533

+ }

6534

+ }

6535

+ else

6536

+ {

6537

+ return 100 * rc + 3;

6538

+ }

6539

+ local_tdb.format = 0;

6540

+ if ((rc = __TM_begin(&local_tdb)) == 0)

6541

+ {

6542

+ __TM_named_abort(1);

6543

+ return 4;

6544

+ }

6545

+ else

6546

+ {

6547

+ if (rc != 3)

6548

+ {

6549

+ return 100 * rc + 5;

6550

+ }

6551

+ if (local_tdb.format != 1)

6552

+ {

6553

+ dump_tdb(&local_tdb);

6554

+ return 100 * local_tdb.format + 6;

6555

+ }

6556

+ }

6557

+ local_tdb256.format = 0;

6558

+ if ((rc = __TM_begin(&local_tdb256)) == 0)

6559

+ {

6560

+ rc = __TM_end();

6561

+ if (rc != 0)

6562

+ {

6563

+ return 1100 * rc + 1;

6564

+ }

6565

+ if (local_tdb256.format != 0)

6566

+ {

6567

+ dump_tdb(&local_tdb256);

6568

+ return 1100 * local_tdb256.format + 2;

6569

+ }

6570

+ }

6571

+ else

6572

+ {

6573

+ return 1100 * rc + 3;

6574

+ }

6575

+#if 1 /*!!!does not work*/

6576

+ local_tdb256.format = 0;

6577

+ if ((rc = __TM_begin(&local_tdb256)) == 0)

6578

+ {

6579

+ __TM_named_abort(1);

6580

+ return 2004;

6581

+ }

6582

+ else

6583

+ {

6584

+ if (rc != 3)

6585

+ {

6586

+ return 2100 * rc + 5;

6587

+ }

6588

+ if (local_tdb256.format != 1)

6589

+ {

6590

+ dump_tdb(&local_tdb256);

6591

+ return 2100 * local_tdb256.format + 6;

6592

+ }

6593

+ }

6594

+#endif

6595

+

6596

+ return 0;

6597

+}

6598

+

6599

+static int test_etnd(void)

6600

+{

6601

+ long rc;

6602

+

6603

+ {

6604

+ long nd;

6605

+

6606

+ make_fake_tdb(&local_tdb);

6607

+ local_tdb.nesting_depth = 0;

6608

+ nd = __TM_nesting_depth(&local_tdb);

6609

+ if (nd != 0)

6610

+ {

6611

+ return 1;

6612

+ }

6613

+ local_tdb.nesting_depth = 7;

6614

+ nd = __TM_nesting_depth(&local_tdb);

6615

+ if (nd != 7)

6616

+ {

6617

+ return 7;

6618

+ }

6619

+ local_tdb.format = 0;

6620

+ nd = __TM_nesting_depth(&local_tdb);

6621

+ if (nd != 0)

6622

+ {

6623

+ return 2;

6624

+ }

6625

+ }

6626

+ counters.c1 = 0;

6627

+ counters.c1 = 0;

6628

+ counters.c2 = 0;

6629

+ counters.c3 = 0;

6630

+ if ((rc = __TM_simple_begin()) == 0)

6631

+ {

6632

+ counters.c1 = __TM_nesting_depth(0);

6633

+ if (__TM_simple_begin() == 0)

6634

+ {

6635

+ counters.c2 = __TM_nesting_depth(0);

6636

+ if (__TM_simple_begin() == 0)

6637

+ {

6638

+ counters.c3 = __TM_nesting_depth(0);

6639

+ __TM_end();

6640

+ }

6641

+ __TM_end();

6642

+ }

6643

+ __TM_end();

6644

+ }

6645

+ else

6646

+ {

6647

+ return 100 * rc + 1;

6648

+ }

6649

+ if (counters.c1 != 1)

6650

+ {

6651

+ return 100 * counters.c1 + 2;

6652

+ }

6653

+ if (counters.c2 != 2)

6654

+ {

6655

+ return 100 * counters.c2 + 3;

6656

+ }

6657

+ if (counters.c3 != 3)

6658

+ {

6659

+ return 100 * counters.c3 + 4;

6660

+ }

6661

+

6662

+ return 0;

6663

+}

6664

+

6665

+/* ---------------------------- local testing framework functions ---------- */

6666

+

6667

+static int run_one_test(const test_table_entry_t *test_entry)

6668

+{

6669

+ int do_print_passes;

6670

+ int succeeded;

6671

+ int rc;

6672

+ int i;

6673

+

6674

+ do_print_passes = (

6675

+ test_entry->required_quorum != 1 ||

6676

+ test_entry->max_repetitions != 1);

6677

+ printf("RRR RUN %s\n", test_entry->name);

6678

+ if (do_print_passes == 1)

6679

+ {

6680

+ printf(

6681

+ " (requires %d successful out of %d runs)\n",

6682

+ test_entry->required_quorum,

6683

+ test_entry->max_repetitions);

6684

+ }

6685

+ succeeded = 0;

6686

+ rc = 0;

6687

+ for (rc = 0, i = 0; i < test_entry->max_repetitions; i++)

6688

+ {

6689

+ if (do_print_passes == 1)

6690

+ {

6691

+ if (i == 0)

6692

+ {

6693

+ printf(" ");

6694

+ }

6695

+ else

6696

+ {

6697

+ printf(",");

6698

+ }

6699

+ }

6700

+ rc = test_entry->test_func();

6701

+ if (rc == 0)

6702

+ {

6703

+ if (do_print_passes == 1)

6704

+ {

6705

+ printf(" success");

6706

+ }

6707

+ succeeded++;

6708

+ if (succeeded >= test_entry->required_quorum)

6709

+ {

6710

+ break;

6711

+ }

6712

+ }

6713

+ else

6714

+ {

6715

+ printf(" failed (rc = %d)", rc);

6716

+ }

6717

+ }

6718

+ if (do_print_passes == 1 || rc != 0)

6719

+ {

6720

+ printf("\n");

6721

+ }

6722

+ if (succeeded >= test_entry->required_quorum)

6723

+ {

6724

+ printf("+++ OK %s\n", test_entry->name);

6725

+

6726

+ return 0;

6727

+ }

6728

+ else

6729

+ {

6730

+ printf("--- FAIL %s\n", test_entry->name);

6731

+

6732

+ return (rc != 0) ? rc : -1;

6733

+ }

6734

+}

6735

+

6736

+static int run_all_tests(const test_table_entry_t *test_table)

6737

+{

6738

+ const test_table_entry_t *test;

6739

+ int rc;

6740

+

6741

+ for (

6742

+ rc = 0, test = &test_table[0];

6743

+ test->test_func != NULL && rc == 0; test++)

6744

+ {

6745

+ rc = run_one_test(test);

6746

+ }

6747

+

6748

+ return rc;

6749

+}

6750

+

6751

+/* ---------------------------- interface functions ------------------------ */

6752

+

6753

+int main(void)

6754

+{

6755

+ const test_table_entry_t test_table[] = {

6756

+ TEST_NO_REP(init_cache),

6757

+ TEST_NO_REP(test_abort_classification),

6758

+ TEST_NO_REP(test_cc_classification),

6759

+ TEST_DF_REP(test_tbegin_ntstg_tend),

6760

+ TEST_DF_REP(test_tbegin_ntstg_tabort),

6761

+ TEST_DF_REP(test_tbegin_aborts),

6762

+ TEST_DF_REP(test_tbegin_tdb),

6763

+ TEST_DF_REP(test_etnd),

6764

+ { (void *)0, 0, 0 }

6765

+ };

6766

+

6767

+ {

6768

+ int rc;

6769

+

6770

+ rc = run_all_tests(test_table);

6771

+

6772

+ return rc;

6773

+ }

6774

+}

6775

Index: gcc/testsuite/gcc.target/sh/pr54089-3.c

6776

===================================================================

6777

--- a/src/gcc/testsuite/gcc.target/sh/pr54089-3.c (.../tags/gcc_4_8_2_release)

6778

+++ b/src/gcc/testsuite/gcc.target/sh/pr54089-3.c (.../branches/gcc-4_8-branch)

6779

@@ -5,7 +5,7 @@

6780

/* { dg-options "-O1" } */

6781

/* { dg-skip-if "" { "sh*-*-*" } { "*" } { "-m1*" "-m2" "-m2e*" } } */

6782

/* { dg-final { scan-assembler-not "and" } } */

6783

-/* { dg-final { scan-assembler-not "31" } } */

6784

+/* { dg-final { scan-assembler-not "#31" } } */

6785

6786

int

6787

test00 (unsigned int a, int* b, int c, int* d, unsigned int e)

6788

Index: gcc/testsuite/gfortran.dg/reshape_6.f90

6789

===================================================================

6790

--- a/src/gcc/testsuite/gfortran.dg/reshape_6.f90 (.../tags/gcc_4_8_2_release)

6791

+++ b/src/gcc/testsuite/gfortran.dg/reshape_6.f90 (.../branches/gcc-4_8-branch)

6792

@@ -0,0 +1,19 @@

6793

+! { dg-do compile }

6794

+! PR fortran/58989

6795

+!

6796

+program test

6797

+

6798

+ real(8), dimension(4,4) :: fluxes

6799

+ real(8), dimension(2,2,2,2) :: f

6800

+ integer, dimension(3) :: dmmy

6801

+ integer, parameter :: indx(4)=(/2,2,2,2/)

6802

+

6803

+ fluxes = 1

6804

+

6805

+ dmmy = (/2,2,2/)

6806

+

6807

+ f = reshape(fluxes,(/dmmy,2/)) ! Caused an ICE

6808

+ f = reshape(fluxes,(/2,2,2,2/)) ! Works as expected

6809

+ f = reshape(fluxes,indx) ! Works as expected

6810

+

6811

+end program test

6812

Index: gcc/testsuite/gfortran.dg/derived_external_function_1.f90

6813

===================================================================

6814

--- a/src/gcc/testsuite/gfortran.dg/derived_external_function_1.f90 (.../tags/gcc_4_8_2_release)

6815

+++ b/src/gcc/testsuite/gfortran.dg/derived_external_function_1.f90 (.../branches/gcc-4_8-branch)

6816

@@ -0,0 +1,27 @@

6817

+! { dg-do run }

6818

+!

6819

+! PR fortran/58771

6820

+!

6821

+! Contributed by Vittorio Secca <zeccav@gmail.com>

6822

+!

6823

+! ICEd on the write statement with f() because the derived type backend

6824

+! declaration not built.

6825

+!

6826

+module m

6827

+ type t

6828

+ integer(4) g

6829

+ end type

6830

+end

6831

+

6832

+type(t) function f() result(ff)

6833

+ use m

6834

+ ff%g = 42

6835

+end

6836

+

6837

+ use m

6838

+ character (20) :: line1, line2

6839

+ type(t) f

6840

+ write (line1, *) f()

6841

+ write (line2, *) 42_4

6842

+ if (line1 .ne. line2) call abort

6843

+end

6844

Index: gcc/testsuite/gfortran.dg/constructor_9.f90

6845

===================================================================

6846

--- a/src/gcc/testsuite/gfortran.dg/constructor_9.f90 (.../tags/gcc_4_8_2_release)

6847

+++ b/src/gcc/testsuite/gfortran.dg/constructor_9.f90 (.../branches/gcc-4_8-branch)

6848

@@ -0,0 +1,22 @@

6849

+! { dg-do compile }

6850

+! { dg-options "-Wall" }

6851

+!

6852

+! PR 58471: [4.8/4.9 Regression] ICE on invalid with missing type constructor and -Wall

6853

+!

6854

+! Contributed by Andrew Benson <abensonca@gmail.com>

6855

+

6856

+module cf

6857

+ implicit none

6858

+ type :: cfmde

6859

+ end type

6860

+ interface cfmde

6861

+ module procedure mdedc ! { dg-error "is neither function nor subroutine" }

6862

+ end interface

6863

+contains

6864

+ subroutine cfi()

6865

+ type(cfmde), pointer :: cfd

6866

+ cfd=cfmde() ! { dg-error "Can't convert" }

6867

+ end subroutine

6868

+end module

6869

+

6870

+! { dg-final { cleanup-modules "cf" } }

6871

Index: gcc/testsuite/gfortran.dg/proc_ptr_43.f90

6872

===================================================================

6873

--- a/src/gcc/testsuite/gfortran.dg/proc_ptr_43.f90 (.../tags/gcc_4_8_2_release)

6874

+++ b/src/gcc/testsuite/gfortran.dg/proc_ptr_43.f90 (.../branches/gcc-4_8-branch)

6875

@@ -0,0 +1,19 @@

6876

+! { dg-do compile }

6877

+!

6878

+! PR 58099: [4.8/4.9 Regression] [F03] over-zealous procedure-pointer error checking

6879

+!

6880

+! Contributed by Daniel Price <daniel.price@monash.edu>

6881

+

6882

+ implicit none

6883

+ procedure(real), pointer :: wfunc

6884

+

6885

+ wfunc => w_cubic

6886

+

6887

+contains

6888

+

6889

+ pure real function w_cubic(q2)

6890

+ real, intent(in) :: q2

6891

+ w_cubic = 0.

6892

+ end function

6893

+

6894

+end

6895

Index: gcc/testsuite/gfortran.dg/extends_15.f90

6896

===================================================================

6897

--- a/src/gcc/testsuite/gfortran.dg/extends_15.f90 (.../tags/gcc_4_8_2_release)

6898

+++ b/src/gcc/testsuite/gfortran.dg/extends_15.f90 (.../branches/gcc-4_8-branch)

6899

@@ -0,0 +1,16 @@

6900

+! { dg-do compile }

6901

+!

6902

+! PR 58355: [4.7/4.8/4.9 Regression] [F03] ICE with TYPE, EXTENDS before parent TYPE defined

6903

+!

6904

+! Contributed by Andrew Benson <abensonca@gmail.com>

6905

+

6906

+module ct

6907

+ public :: t1

6908

+

6909

+ type, extends(t1) :: t2 ! { dg-error "has not been previously defined" }

6910

+

6911

+ type :: t1

6912

+ end type

6913

+end

6914

+

6915

+! { dg-final { cleanup-modules "ct" } }

6916

Index: gcc/testsuite/gcc.c-torture/execute/pr58984.c

6917

===================================================================

6918

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58984.c (.../tags/gcc_4_8_2_release)

6919

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58984.c (.../branches/gcc-4_8-branch)

6920

@@ -0,0 +1,57 @@

6921

+/* PR tree-optimization/58984 */

6922

+

6923

+struct S { int f0 : 8; int : 6; int f1 : 5; };

6924

+struct T { char f0; int : 6; int f1 : 5; };

6925

+

6926

+int a, *c = &a, e, n, b, m;

6927

+

6928

+static int

6929

+foo (struct S p)

6930

+{

6931

+ const unsigned short *f[36];

6932

+ for (; e < 2; e++)

6933

+ {

6934

+ const unsigned short **i = &f[0];

6935

+ *c ^= 1;

6936

+ if (p.f1)

6937

+ {

6938

+ *i = 0;

6939

+ return b;

6940

+ }

6941

+ }

6942

+ return 0;

6943

+}

6944

+

6945

+static int

6946

+bar (struct T p)

6947

+{

6948

+ const unsigned short *f[36];

6949

+ for (; e < 2; e++)

6950

+ {

6951

+ const unsigned short **i = &f[0];

6952

+ *c ^= 1;

6953

+ if (p.f1)

6954

+ {

6955

+ *i = 0;

6956

+ return b;

6957

+ }

6958

+ }

6959

+ return 0;

6960

+}

6961

+

6962

+int

6963

+main ()

6964

+{

6965

+ struct S o = { 1, 1 };

6966

+ foo (o);

6967

+ m = n || o.f0;

6968

+ if (a != 1)

6969

+ __builtin_abort ();

6970

+ e = 0;

6971

+ struct T p = { 1, 1 };

6972

+ bar (p);

6973

+ m |= n || p.f0;

6974

+ if (a != 0)

6975

+ __builtin_abort ();

6976

+ return 0;

6977

+}

6978

Index: gcc/testsuite/gcc.c-torture/execute/20131127-1.c

6979

===================================================================

6980

--- a/src/gcc/testsuite/gcc.c-torture/execute/20131127-1.c (.../tags/gcc_4_8_2_release)

6981

+++ b/src/gcc/testsuite/gcc.c-torture/execute/20131127-1.c (.../branches/gcc-4_8-branch)

6982

@@ -0,0 +1,34 @@

6983

+/* PR middle-end/59138 */

6984

+/* Testcase by John Regehr <regehr@cs.utah.edu> */

6985

+

6986

+extern void abort (void);

6987

+

6988

+#pragma pack(1)

6989

+

6990

+struct S0 {

6991

+ int f0;

6992

+ int f1;

6993

+ int f2;

6994

+ short f3;

6995

+};

6996

+

6997

+short a = 1;

6998

+

6999

+struct S0 b = { 1 }, c, d, e;

7000

+

7001

+struct S0 fn1() { return c; }

7002

+

7003

+void fn2 (void)

7004

+{

7005

+ b = fn1 ();

7006

+ a = 0;

7007

+ d = e;

7008

+}

7009

+

7010

+int main (void)

7011

+{

7012

+ fn2 ();

7013

+ if (a != 0)

7014

+ abort ();

7015

+ return 0;

7016

+}

7017

Index: gcc/testsuite/gcc.c-torture/execute/pr59014-2.c

7018

===================================================================

7019

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59014-2.c (.../tags/gcc_4_8_2_release)

7020

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59014-2.c (.../branches/gcc-4_8-branch)

7021

@@ -0,0 +1,23 @@

7022

+/* PR tree-optimization/59014 */

7023

+

7024

+__attribute__((noinline, noclone)) long long int

7025

+foo (long long int x, long long int y)

7026

+{

7027

+ if (((int) x | (int) y) != 0)

7028

+ return 6;

7029

+ return x + y;

7030

+}

7031

+

7032

+int

7033

+main ()

7034

+{

7035

+ if (sizeof (long long) == sizeof (int))

7036

+ return 0;

7037

+ int shift_half = sizeof (int) * __CHAR_BIT__ / 2;

7038

+ long long int x = (3LL << shift_half) << shift_half;

7039

+ long long int y = (5LL << shift_half) << shift_half;

7040

+ long long int z = foo (x, y);

7041

+ if (z != ((8LL << shift_half) << shift_half))

7042

+ __builtin_abort ();

7043

+ return 0;

7044

+}

7045

Index: gcc/testsuite/gcc.c-torture/execute/pr59101.c

7046

===================================================================

7047

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59101.c (.../tags/gcc_4_8_2_release)

7048

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59101.c (.../branches/gcc-4_8-branch)

7049

@@ -0,0 +1,15 @@

7050

+/* PR target/59101 */

7051

+

7052

+__attribute__((noinline, noclone)) int

7053

+foo (int a)

7054

+{

7055

+ return (~a & 4102790424LL) > 0 | 6;

7056

+}

7057

+

7058

+int

7059

+main ()

7060

+{

7061

+ if (foo (0) != 7)

7062

+ __builtin_abort ();

7063

+ return 0;

7064

+}

7065

Index: gcc/testsuite/gcc.c-torture/execute/pr58831.c

7066

===================================================================

7067

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr58831.c (.../tags/gcc_4_8_2_release)

7068

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr58831.c (.../branches/gcc-4_8-branch)

7069

@@ -0,0 +1,40 @@

7070

+#include <assert.h>

7071

+

7072

+int a, *b, c, d, f, **i, p, q, *r;

7073

+short o, j;

7074

+

7075

+static int __attribute__((noinline, noclone))

7076

+fn1 (int *p1, int **p2)

7077

+{

7078

+ int **e = &b;

7079

+ for (; p; p++)

7080

+ *p1 = 1;

7081

+ *e = *p2 = &d;

7082

+

7083

+ assert (r);

7084

+

7085

+ return c;

7086

+}

7087

+

7088

+static int ** __attribute__((noinline, noclone))

7089

+fn2 (void)

7090

+{

7091

+ for (f = 0; f != 42; f++)

7092

+ {

7093

+ int *g[3] = {0, 0, 0};

7094

+ for (o = 0; o; o--)

7095

+ for (; a > 1;)

7096

+ {

7097

+ int **h[1] = { &g[2] };

7098

+ }

7099

+ }

7100

+ return &r;

7101

+}

7102

+

7103

+int

7104

+main (void)

7105

+{

7106

+ i = fn2 ();

7107

+ fn1 (b, i);

7108

+ return 0;

7109

+}

7110

Index: gcc/testsuite/gcc.c-torture/execute/pr59014.c

7111

===================================================================

7112

--- a/src/gcc/testsuite/gcc.c-torture/execute/pr59014.c (.../tags/gcc_4_8_2_release)

7113

+++ b/src/gcc/testsuite/gcc.c-torture/execute/pr59014.c (.../branches/gcc-4_8-branch)

7114

@@ -0,0 +1,25 @@

7115

+/* PR tree-optimization/59014 */

7116

+

7117

+int a = 2, b, c, d;

7118

+

7119

+int

7120

+foo ()

7121

+{

7122

+ for (;; c++)

7123

+ if ((b > 0) | (a & 1))

7124

+ ;

7125

+ else

7126

+ {

7127

+ d = a;

7128

+ return 0;

7129

+ }

7130

+}

7131

+

7132

+int

7133

+main ()

7134

+{

7135

+ foo ();

7136

+ if (d != 2)

7137

+ __builtin_abort ();

7138

+ return 0;

7139

+}

7140

Index: gcc/testsuite/gcc.c-torture/compile/pr58970-1.c

7141

===================================================================

7142

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58970-1.c (.../tags/gcc_4_8_2_release)

7143

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58970-1.c (.../branches/gcc-4_8-branch)

7144

@@ -0,0 +1,11 @@

7145

+/* PR middle-end/58970 */

7146

+

7147

+struct T { int b : 1; };

7148

+struct S { struct T t[1]; };

7149

+

7150

+void

7151

+foo (int x, struct S *s)

7152

+{

7153

+ if (x == -1)

7154

+ s->t[x].b = 0;

7155

+}

7156

Index: gcc/testsuite/gcc.c-torture/compile/pr58997.c

7157

===================================================================

7158

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58997.c (.../tags/gcc_4_8_2_release)

7159

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58997.c (.../branches/gcc-4_8-branch)

7160

@@ -0,0 +1,19 @@

7161

+/* PR rtl-optimization/58997 */

7162

+

7163

+int a, b, c, e;

7164

+short d;

7165

+char h;

7166

+

7167

+void

7168

+foo ()

7169

+{

7170

+ while (b)

7171

+ {

7172

+ d = a ? c : 1 % a;

7173

+ c = d;

7174

+ h = d;

7175

+ if (!h)

7176

+ while (e)

7177

+ ;

7178

+ }

7179

+}

7180

Index: gcc/testsuite/gcc.c-torture/compile/pr58970-2.c

7181

===================================================================

7182

--- a/src/gcc/testsuite/gcc.c-torture/compile/pr58970-2.c (.../tags/gcc_4_8_2_release)

7183

+++ b/src/gcc/testsuite/gcc.c-torture/compile/pr58970-2.c (.../branches/gcc-4_8-branch)

7184

@@ -0,0 +1,11 @@

7185

+/* PR middle-end/58970 */

7186

+

7187

+struct T { char a : 8; char b : 1; };

7188

+struct S { char x; struct T t[1]; };

7189

+

7190

+void

7191

+foo (int x, struct S *s)

7192

+{

7193

+ if (x == -1)

7194

+ s->t[x].b = 0;

7195

+}

7196

Index: gcc/testsuite/gcc.dg/pr57518.c

7197

===================================================================

7198

--- a/src/gcc/testsuite/gcc.dg/pr57518.c (.../tags/gcc_4_8_2_release)

7199

+++ b/src/gcc/testsuite/gcc.dg/pr57518.c (.../branches/gcc-4_8-branch)

7200

@@ -1,8 +1,8 @@

7201

-/* PR rtl-optimization/57130 */

7202

+/* PR rtl-optimization/57518 */

7203

7204

/* { dg-do compile } */

7205

/* { dg-options "-O2 -fdump-rtl-ira" } */

7206

-/* { dg-final { scan-rtl-dump-not "REG_EQUIV.*mem.*\"ip\"" "ira" } } */

7207

+/* { dg-final { scan-rtl-dump-not "REG_EQUIV\[^\n\]*mem\[^\n\]*\"ip\".*subreg" "ira" } } */

7208

7209

char ip[10];

7210

int total;

7211

Index: gcc/testsuite/gcc.dg/20050922-1.c

7212

===================================================================

7213

--- a/src/gcc/testsuite/gcc.dg/20050922-1.c (.../tags/gcc_4_8_2_release)

7214

+++ b/src/gcc/testsuite/gcc.dg/20050922-1.c (.../branches/gcc-4_8-branch)

7215

@@ -4,7 +4,7 @@

7216

/* { dg-do run } */

7217

/* { dg-options "-O1 -std=c99" } */

7218

7219

-#include <stdlib.h>

7220

+extern void abort (void);

7221

7222

#if __INT_MAX__ == 2147483647

7223

typedef unsigned int uint32_t;

7224

Index: gcc/testsuite/gcc.dg/atomic-store-6.c

7225

===================================================================

7226

--- a/src/gcc/testsuite/gcc.dg/atomic-store-6.c (.../tags/gcc_4_8_2_release)

7227

+++ b/src/gcc/testsuite/gcc.dg/atomic-store-6.c (.../branches/gcc-4_8-branch)

7228

@@ -0,0 +1,13 @@

7229

+/* { dg-do run } */

7230

+/* { dg-require-effective-target sync_int_128_runtime } */

7231

+/* { dg-options "-mcx16" { target { i?86-*-* x86_64-*-* } } } */

7232

+

7233

+__int128_t i;

7234

+

7235

+int main()

7236

+{

7237

+ __atomic_store_16(&i, -1, 0);

7238

+ if (i != -1)

7239

+ __builtin_abort();

7240

+ return 0;

7241

+}

7242

Index: gcc/testsuite/gcc.dg/20050922-2.c

7243

===================================================================

7244

--- a/src/gcc/testsuite/gcc.dg/20050922-2.c (.../tags/gcc_4_8_2_release)

7245

+++ b/src/gcc/testsuite/gcc.dg/20050922-2.c (.../branches/gcc-4_8-branch)

7246

@@ -4,7 +4,8 @@

7247

/* { dg-do run } */

7248

/* { dg-options "-O1 -std=c99" } */

7249

7250

-#include <stdlib.h>

7251

+extern void abort (void);

7252

+extern void exit (int);

7253

7254

#if __INT_MAX__ == 2147483647

7255

typedef unsigned int uint32_t;

7256

Index: gcc/testsuite/gcc.dg/pr58805.c

7257

===================================================================

7258

--- a/src/gcc/testsuite/gcc.dg/pr58805.c (.../tags/gcc_4_8_2_release)

7259

+++ b/src/gcc/testsuite/gcc.dg/pr58805.c (.../branches/gcc-4_8-branch)

7260

@@ -0,0 +1,24 @@

7261

+/* { dg-do compile } */

7262

+/* { dg-options "-O2 -ftree-tail-merge -fdump-tree-pre" } */

7263

+

7264

+/* Type that matches the 'p' constraint. */

7265

+#define TYPE void *

7266

+

7267

+static inline

7268

+void bar (TYPE *r)

7269

+{

7270

+ TYPE t;

7271

+ __asm__ ("" : "=&p" (t), "=p" (*r));

7272

+}

7273

+

7274

+void

7275

+foo (int n, TYPE *x, TYPE *y)

7276

+{

7277

+ if (n == 0)

7278

+ bar (x);

7279

+ else

7280

+ bar (y);

7281

+}

7282

+

7283

+/* { dg-final { scan-tree-dump-times "__asm__" 2 "pre"} } */

7284

+/* { dg-final { cleanup-tree-dump "pre" } } */

7285

Index: gcc/testsuite/gcc.dg/torture/pr59047.c

7286

===================================================================

7287

--- a/src/gcc/testsuite/gcc.dg/torture/pr59047.c (.../tags/gcc_4_8_2_release)

7288

+++ b/src/gcc/testsuite/gcc.dg/torture/pr59047.c (.../branches/gcc-4_8-branch)

7289

@@ -0,0 +1,39 @@

7290

+/* { dg-do run } */

7291

+

7292

+extern void abort (void);

7293

+

7294

+struct

7295

+{

7296

+ int f0;

7297

+ int f1:1;

7298

+ int f2:2;

7299

+} a = {0, 0, 1};

7300

+

7301

+int b, c, *d, e, f;

7302

+

7303

+int

7304

+fn1 ()

7305

+{

7306

+ for (; b < 1; ++b)

7307

+ {

7308

+ for (e = 0; e < 1; e = 1)

7309

+ {

7310

+ int **g = &d;

7311

+ *g = &c;

7312

+ }

7313

+ *d = 0;

7314

+ f = a.f1;

7315

+ if (f)

7316

+ return 0;

7317

+ }

7318

+ return 0;

7319

+}

7320

+

7321

+int

7322

+main ()

7323

+{

7324

+ fn1 ();

7325

+ if (b != 1)

7326

+ abort ();

7327

+ return 0;

7328

+}

7329

Index: gcc/testsuite/gcc.dg/torture/pr57517.c

7330

===================================================================

7331

--- a/src/gcc/testsuite/gcc.dg/torture/pr57517.c (.../tags/gcc_4_8_2_release)

7332

+++ b/src/gcc/testsuite/gcc.dg/torture/pr57517.c (.../branches/gcc-4_8-branch)

7333

@@ -0,0 +1,16 @@

7334

+/* { dg-do compile } */

7335

+

7336

+int x[1024], y[1024], z[1024], w[1024];

7337

+void foo (void)

7338

+{

7339

+ int i;

7340

+ for (i = 1; i < 1024; ++i)

7341

+ {

7342

+ int a = x[i];

7343

+ int b = y[i];

7344

+ int c = x[i-1];

7345

+ int d = y[i-1];

7346

+ if (w[i])

7347

+ z[i] = (a + b) + (c + d);

7348

+ }

7349

+}

7350

Index: gcc/testsuite/gcc.dg/torture/pr58779.c

7351

===================================================================

7352

--- a/src/gcc/testsuite/gcc.dg/torture/pr58779.c (.../tags/gcc_4_8_2_release)

7353

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58779.c (.../branches/gcc-4_8-branch)

7354

@@ -0,0 +1,12 @@

7355

+/* { dg-do run } */

7356

+

7357

+int a, c;

7358

+

7359

+int main ()

7360

+{

7361

+ int e = -1;

7362

+ short d = (c <= 0) ^ e;

7363

+ if ((unsigned int) a - (a || d) <= (unsigned int) a)

7364

+ __builtin_abort ();

7365

+ return 0;

7366

+}

7367

Index: gcc/testsuite/gcc.dg/torture/pr58079.c

7368

===================================================================

7369

--- a/src/gcc/testsuite/gcc.dg/torture/pr58079.c (.../tags/gcc_4_8_2_release)

7370

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58079.c (.../branches/gcc-4_8-branch)

7371

@@ -0,0 +1,107 @@

7372

+/* { dg-options "-mlong-calls" { target mips*-*-* } } */

7373

+

7374

+typedef unsigned char u8;

7375

+typedef unsigned short u16;

7376

+typedef unsigned int __kernel_size_t;

7377

+typedef __kernel_size_t size_t;

7378

+struct list_head {

7379

+ struct list_head *next;

7380

+};

7381

+

7382

+struct dmx_ts_feed {

7383

+ int is_filtering;

7384

+};

7385

+struct dmx_section_feed {

7386

+ u16 secbufp;

7387

+ u16 seclen;

7388

+ u16 tsfeedp;

7389

+};

7390

+

7391

+typedef int (*dmx_ts_cb) (

7392

+ const u8 * buffer1,

7393

+ size_t buffer1_length,

7394

+ const u8 * buffer2,

7395

+ size_t buffer2_length

7396

+);

7397

+

7398

+struct dvb_demux_feed {

7399

+ union {

7400

+ struct dmx_ts_feed ts;

7401

+ struct dmx_section_feed sec;

7402

+ } feed;

7403

+ union {

7404

+ dmx_ts_cb ts;

7405

+ } cb;

7406

+ int type;

7407

+ u16 pid;

7408

+ int ts_type;

7409

+ struct list_head list_head;

7410

+};

7411

+

7412

+struct dvb_demux {

7413

+ int (*stop_feed)(struct dvb_demux_feed *feed);

7414

+ struct list_head feed_list;

7415

+};

7416

+

7417

+

7418

+static

7419

+inline

7420

+__attribute__((always_inline))

7421

+u8

7422

+payload(const u8 *tsp)

7423

+{

7424

+ if (tsp[3] & 0x20) {

7425

+ return 184 - 1 - tsp[4];

7426

+ }

7427

+ return 184;

7428

+}

7429

+

7430

+static

7431

+inline

7432

+__attribute__((always_inline))

7433

+int

7434

+dvb_dmx_swfilter_payload(struct dvb_demux_feed *feed, const u8 *buf)

7435

+{

7436

+ int count = payload(buf);

7437

+ int p;

7438

+ if (count == 0)

7439

+ return -1;

7440

+ return feed->cb.ts(&buf[p], count, ((void *)0), 0);

7441

+}

7442

+

7443

+static

7444

+inline

7445

+__attribute__((always_inline))

7446

+void

7447

+dvb_dmx_swfilter_packet_type(struct dvb_demux_feed *feed, const u8 *buf)

7448

+{

7449

+ switch (feed->type) {

7450

+ case 0:

7451

+ if (feed->ts_type & 1) {

7452

+ dvb_dmx_swfilter_payload(feed, buf);

7453

+ }

7454

+ if (dvb_dmx_swfilter_section_packet(feed, buf) < 0)

7455

+ feed->feed.sec.seclen = feed->feed.sec.secbufp = 0;

7456

+ }

7457

+}

7458

+

7459

+static

7460

+void

7461

+dvb_dmx_swfilter_packet(struct dvb_demux *demux, const u8 *buf)

7462

+{

7463

+ struct dvb_demux_feed *feed;

7464

+ int dvr_done = 0;

7465

+

7466

+ for (feed = ({ const typeof( ((typeof(*feed) *)0)->list_head ) *__mptr = ((&demux->feed_list)->next); (typeof(*feed) *)( (char *)__mptr - __builtin_offsetof(typeof(*feed),list_head) );}); __builtin_prefetch(feed->list_head.next), &feed->list_head != (&demux->feed_list); feed = ({ const typeof( ((typeof(*feed) *)0)->list_head ) *__mptr = (feed->list_head.next); (typeof(*feed) *)( (char *)__mptr - __builtin_offsetof(typeof(*feed),list_head) );})) {

7467

+ if (((((feed)->type == 0) && ((feed)->feed.ts.is_filtering) && (((feed)->ts_type & (1 | 8)) == 1))) && (dvr_done++))

7468

+ dvb_dmx_swfilter_packet_type(feed, buf);

7469

+ else if (feed->pid == 0x2000)

7470

+ feed->cb.ts(buf, 188, ((void *)0), 0);

7471

+ }

7472

+}

7473

+void dvb_dmx_swfilter_packets(struct dvb_demux *demux, const u8 *buf, size_t count)

7474

+{

7475

+ while (count--) {

7476

+ dvb_dmx_swfilter_packet(demux, buf);

7477

+ }

7478

+}

7479

Index: gcc/testsuite/gcc.dg/torture/pr58830.c

7480

===================================================================

7481

--- a/src/gcc/testsuite/gcc.dg/torture/pr58830.c (.../tags/gcc_4_8_2_release)

7482

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58830.c (.../branches/gcc-4_8-branch)

7483

@@ -0,0 +1,42 @@

7484

+/* { dg-do run } */

7485

+/* { dg-additional-options "-ftree-pre -ftree-partial-pre" } */

7486

+

7487

+extern void abort (void);

7488

+

7489

+int b, c, d, f, g, h, i, j[6], *l = &b, *m, n, *o, r;

7490

+char k;

7491

+

7492

+static int

7493

+foo ()

7494

+{

7495

+ char *p = &k;

7496

+

7497

+ for (; d; d++)

7498

+ if (i)

7499

+ h = 0;

7500

+ else

7501

+ h = c || (r = 0);

7502

+

7503

+ for (f = 0; f < 2; f++)

7504

+ {

7505

+ unsigned int q;

7506

+ *l = 0;

7507

+ if (n)

7508

+ *m = g;

7509

+ if (g)

7510

+ o = 0;

7511

+ for (q = -8; q >= 5; q++)

7512

+ (*p)--;

7513

+ }

7514

+

7515

+ return 0;

7516

+}

7517

+

7518

+int

7519

+main ()

7520

+{

7521

+ foo ();

7522

+ if (j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[j[0]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]] ^ (k & 15)] != 0)

7523

+ abort ();

7524

+ return 0;

7525

+}

7526

Index: gcc/testsuite/gcc.dg/torture/pr58143-1.c

7527

===================================================================

7528

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-1.c (.../tags/gcc_4_8_2_release)

7529

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-1.c (.../branches/gcc-4_8-branch)

7530

@@ -0,0 +1,51 @@

7531

+/* { dg-do run } */

7532

+/* { dg-additional-options "-fstrict-overflow" } */

7533

+

7534

+extern void abort (void);

7535

+

7536

+int a, b, c, d, e, f, g, h = 1, i;

7537

+

7538

+int foo (int p)

7539

+{

7540

+ return p < 0 && a < - __INT_MAX__ - 1 - p ? 0 : 1;

7541

+}

7542

+

7543

+int *bar ()

7544

+{

7545

+ int j;

7546

+ i = h ? 0 : 1 % h;

7547

+ for (j = 0; j < 1; j++)

7548

+ for (d = 0; d; d++)

7549

+ for (e = 1; e;)

7550

+ return 0;

7551

+ return 0;

7552

+}

7553

+

7554

+int baz ()

7555

+{

7556

+ for (; b >= 0; b--)

7557

+ for (c = 1; c >= 0; c--)

7558

+ {

7559

+ int *k = &c;

7560

+ for (;;)

7561

+ {

7562

+ for (f = 0; f < 1; f++)

7563

+ {

7564

+ g = foo (*k);

7565

+ bar ();

7566

+ }

7567

+ if (*k)

7568

+ break;

7569

+ return 0;

7570

+ }

7571

+ }

7572

+ return 0;

7573

+}

7574

+

7575

+int main ()

7576

+{

7577

+ baz ();

7578

+ if (b != 0)

7579

+ abort ();

7580

+ return 0;

7581

+}

7582

Index: gcc/testsuite/gcc.dg/torture/pr58143-2.c

7583

===================================================================

7584

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-2.c (.../tags/gcc_4_8_2_release)

7585

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-2.c (.../branches/gcc-4_8-branch)

7586

@@ -0,0 +1,34 @@

7587

+/* { dg-do run } */

7588

+/* { dg-additional-options "-fstrict-overflow" } */

7589

+

7590

+int a, b, d, e, f, *g, h, i;

7591

+volatile int c;

7592

+

7593

+char foo (unsigned char p)

7594

+{

7595

+ return p + 1;

7596

+}

7597

+

7598

+int bar ()

7599

+{

7600

+ for (h = 0; h < 3; h = foo (h))

7601

+ {

7602

+ c;

7603

+ for (f = 0; f < 1; f++)

7604

+ {

7605

+ i = a && 0 < -__INT_MAX__ - h ? 0 : 1;

7606

+ if (e)

7607

+ for (; d;)

7608

+ b = 0;

7609

+ else

7610

+ g = 0;

7611

+ }

7612

+ }

7613

+ return 0;

7614

+}

7615

+

7616

+int main ()

7617

+{

7618

+ bar ();

7619

+ return 0;

7620

+}

7621

Index: gcc/testsuite/gcc.dg/torture/pr58941.c

7622

===================================================================

7623

--- a/src/gcc/testsuite/gcc.dg/torture/pr58941.c (.../tags/gcc_4_8_2_release)

7624

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58941.c (.../branches/gcc-4_8-branch)

7625

@@ -0,0 +1,33 @@

7626

+/* { dg-do run } */

7627

+

7628

+extern void abort (void);

7629

+

7630

+typedef struct {

7631

+ int msgLength;

7632

+ unsigned char data[1000];

7633

+} SMsg;

7634

+

7635

+typedef struct {

7636

+ int dummy;

7637

+ int d[0];

7638

+} SData;

7639

+

7640

+int condition = 3;

7641

+

7642

+int main()

7643

+{

7644

+ SMsg msg;

7645

+ SData *pData = (SData*)(msg.data);

7646

+ unsigned int i = 0;

7647

+ for (i = 0; i < 1; i++)

7648

+ {

7649

+ pData->d[i] = 0;

7650

+ if(condition & 1)

7651

+ pData->d[i] |= 0x55;

7652

+ if(condition & 2)

7653

+ pData->d[i] |= 0xaa;

7654

+ }

7655

+ if (pData->d[0] != 0xff)

7656

+ abort ();

7657

+ return 0;

7658

+}

7659

Index: gcc/testsuite/gcc.dg/torture/pr57488.c

7660

===================================================================

7661

--- a/src/gcc/testsuite/gcc.dg/torture/pr57488.c (.../tags/gcc_4_8_2_release)

7662

+++ b/src/gcc/testsuite/gcc.dg/torture/pr57488.c (.../branches/gcc-4_8-branch)

7663

@@ -0,0 +1,58 @@

7664

+/* { dg-do run } */

7665

+

7666

+extern void abort (void);

7667

+

7668

+int i, j, *pj = &j, **ppj = &pj;

7669

+int x, *px = &x;

7670

+

7671

+short s, *ps = &s, k;

7672

+

7673

+unsigned short u, *pu = &u, **ppu = &pu;

7674

+

7675

+char c, *pc = &c;

7676

+

7677

+unsigned char v = 48;

7678

+

7679

+static int

7680

+bar (int p)

7681

+{

7682

+ p = k;

7683

+ *px = **ppu = i;

7684

+ *ppj = &p;

7685

+ if (**ppj)

7686

+ *pj = p;

7687

+ return p;

7688

+}

7689

+

7690

+void __attribute__((noinline))

7691

+foo ()

7692

+{

7693

+ for (; i <= 3; i++)

7694

+ for (; j; j--);

7695

+

7696

+ u ^= bar (*pj);

7697

+

7698

+ for (k = 1; k >= 0; k--)

7699

+ {

7700

+ int l;

7701

+ bar (0);

7702

+ for (l = 1; l < 5; l++)

7703

+ {

7704

+ int m;

7705

+ for (m = 6; m; m--)

7706

+ {

7707

+ v--;

7708

+ *ps = *pc;

7709

+ }

7710

+ }

7711

+ }

7712

+}

7713

+

7714

+int

7715

+main ()

7716

+{

7717

+ foo ();

7718

+ if (v != 0)

7719

+ abort ();

7720

+ return 0;

7721

+}

7722

Index: gcc/testsuite/gcc.dg/torture/pr58143-3.c

7723

===================================================================

7724

--- a/src/gcc/testsuite/gcc.dg/torture/pr58143-3.c (.../tags/gcc_4_8_2_release)

7725

+++ b/src/gcc/testsuite/gcc.dg/torture/pr58143-3.c (.../branches/gcc-4_8-branch)

7726

@@ -0,0 +1,18 @@

7727

+/* { dg-do run } */

7728

+/* { dg-additional-options "-fstrict-overflow" } */

7729

+

7730

+int a, b, c, d, e;

7731

+

7732

+int

7733

+main ()

7734

+{

7735

+ for (b = 4; b > -30; b--)

7736

+ for (; c;)

7737

+ for (;;)

7738

+ {

7739

+ e = a > __INT_MAX__ - b;

7740

+ if (d)

7741

+ break;

7742

+ }

7743

+ return 0;

7744

+}

7745

Index: gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c

7746

===================================================================

7747

--- a/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c (.../tags/gcc_4_8_2_release)

7748

+++ b/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-6.c (.../branches/gcc-4_8-branch)

7749

@@ -0,0 +1,14 @@

7750

+/* { dg-do run } */

7751

+/* { dg-options "-O3" } */

7752

+

7753

+int a, c, e[5][2];

7754

+unsigned int d;

7755

+

7756

+int

7757

+main ()

7758

+{

7759

+ for (d = 0; d < 2; d++)

7760

+ if (a ? 0 : e[c + 3][d] & e[c + 4][d])

7761

+ break;

7762

+ return 0;

7763

+}

7764

Index: gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c

7765

===================================================================

7766

--- a/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c (.../tags/gcc_4_8_2_release)

7767

+++ b/src/gcc/testsuite/gcc.dg/tree-ssa/predcom-7.c (.../branches/gcc-4_8-branch)

7768

@@ -0,0 +1,18 @@

7769

+/* { dg-do run } */

7770

+/* { dg-options "-O3 -fdump-tree-pcom-details" } */

7771

+

7772

+int b, f, d[5][2];

7773

+unsigned int c;

7774

+

7775

+int

7776

+main ()

7777

+{

7778

+ for (c = 0; c < 2; c++)

7779

+ if (d[b + 3][c] & d[b + 4][c])

7780

+ if (f)

7781

+ break;

7782

+ return 0;

7783

+}

7784

+

7785

+/* { dg-final { scan-tree-dump "Executing predictive commoning" "pcom" } } */

7786

+/* { dg-final { cleanup-tree-dump "pcom" } } */

7787

Index: gcc/testsuite/ChangeLog

7788

===================================================================

7789

--- a/src/gcc/testsuite/ChangeLog (.../tags/gcc_4_8_2_release)

7790

+++ b/src/gcc/testsuite/ChangeLog (.../branches/gcc-4_8-branch)

7791

@@ -1,3 +1,292 @@

7792

+2013-11-29 Jakub Jelinek <jakub@redhat.com>

7793

+

7794

+ PR c/59280

7795

+ * c-c++-common/pr59280.c: New test.

7796

+

7797

+2013-11-28 Jakub Jelinek <jakub@redhat.com>

7798

+

7799

+ PR c++/59297

7800

+ * g++.dg/gomp/pr59297.C: New test.

7801

+

7802

+2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

7803

+

7804

+ Backport from mainline

7805

+ 2013-11-28 Kyrylo Tkachov <kyrylo.tkachov@arm.com>

7806

+

7807

+ * gcc.target/arm/vrinta-ce.c: New testcase.

7808

+

7809

+2013-11-28 Uros Bizjak <ubizjak@gmail.com>

7810

+

7811

+ Backport from mainline

7812

+ 2013-11-23 Uros Bizjak <ubizjak@gmail.com>

7813

+

7814

+ PR target/56788

7815

+ * config/i386/i386.c (bdesc_multi_arg) <IX86_BUILTIN_VFRCZSS>:

7816

+ Declare as MULTI_ARG_1_SF instruction.

7817

+ <IX86_BUILTIN_VFRCZSD>: Decleare as MULTI_ARG_1_DF instruction.

7818

+ * config/i386/sse.md (*xop_vmfrcz<mode>2): Rename

7819

+ from *xop_vmfrcz_<mode>.

7820

+ * config/i386/xopintrin.h (_mm_frcz_ss): Use __builtin_ia32_movss

7821

+ to merge scalar result with __A.

7822

+ (_mm_frcz_sd): Use __builtin_ia32_movsd to merge scalar

7823

+ result with __A.

7824

+

7825

+2013-11-28 Terry Guo <terry.guo@arm.com>

7826

+

7827

+ Backport mainline r205391

7828

+ 2013-11-26 Terry Guo <terry.guo@arm.com>

7829

+

7830

+ * gcc.target/arm/thumb1-pic-high-reg.c: New case.

7831

+ * gcc.target/arm/thumb1-pic-single-base.c: New case.

7832

+

7833

+2013-11-27 Jakub Jelinek <jakub@redhat.com>

7834

+

7835

+ Backported from mainline

7836

+ 2013-11-27 Jakub Jelinek <jakub@redhat.com>

7837

+

7838

+ PR tree-optimization/59014

7839

+ * gcc.c-torture/execute/pr59014-2.c: New test.

7840

+

7841

+ 2013-11-26 Jakub Jelinek <jakub@redhat.com>

7842

+

7843

+ PR tree-optimization/59014

7844

+ * gcc.c-torture/execute/pr59014.c: New test.

7845

+

7846

+2013-11-27 Eric Botcazou <ebotcazou@adacore.com>

7847

+

7848

+ * gcc.c-torture/execute/20131127-1.c: New test.

7849

+

7850

+2013-11-25 Vidya Praveen <vidyapraveen@arm.com>

7851

+

7852

+ Backport from mainline

7853

+ 2013-10-21 Vidya Praveen <vidyapraveen@arm.com>

7854

+

7855

+ * gcc.dg/20050922-1.c: Remove stdlib.h and declare abort().

7856

+ * gcc.dg/20050922-1.c: Remove stdlib.h and declare abort() and exit().

7857

+

7858

+2013-11-20 Dominik Vogt <vogt@linux.vnet.ibm.com>

7859

+

7860

+ Backport from mainline

7861

+ * gcc.target/s390/htm-1.c: Rename to ...

7862

+ * gcc/testsuite/gcc.target/s390/htm-builtins-compile-1.c: ... this

7863

+ one.

7864

+ * gcc.target/s390/htm-xl-intrin-1.c: Rename to ...

7865

+ * gcc.target/s390/htm-builtins-compile-3.c: ... this one.

7866

+ * gcc.target/s390/htm-builtins-compile-2.c: New testcase.

7867

+ * gcc.target/s390/htm-builtins-1.c: New testcase.

7868

+ * gcc.target/s390/htm-builtins-2.c: New testcase.

7869

+ * gcc.target/s390/s390.exp: Add check for htm machine.

7870

+

7871

+2013-11-19 Richard Biener <rguenther@suse.de>

7872

+

7873

+ PR tree-optimization/57517

7874

+ * gfortran.fortran-torture/compile/pr57517.f90: New testcase.

7875

+ * gcc.dg/torture/pr57517.c: Likewise.

7876

+

7877

+2013-11-19 Richard Biener <rguenther@suse.de>

7878

+

7879

+ Backport from mainline

7880

+ 2013-11-05 Richard Biener <rguenther@suse.de>

7881

+

7882

+ PR middle-end/58941

7883

+ * gcc.dg/torture/pr58941.c: New testcase.

7884

+

7885

+2013-11-18 Richard Biener <rguenther@suse.de>

7886

+

7887

+ Backport from mainline

7888

+ 2013-10-21 Richard Biener <rguenther@suse.de>

7889

+

7890

+ PR tree-optimization/58794

7891

+ * c-c++-common/torture/pr58794-1.c: New testcase.

7892

+ * c-c++-common/torture/pr58794-2.c: Likewise.

7893

+

7894

+ 2013-10-21 Richard Biener <rguenther@suse.de>

7895

+

7896

+ PR middle-end/58742

7897

+ * c-c++-common/fold-divmul-1.c: New testcase.

7898

+

7899

+ 2013-11-06 Richard Biener <rguenther@suse.de>

7900

+

7901

+ PR tree-optimization/58653

7902

+ * gcc.dg/tree-ssa/predcom-6.c: New testcase.

7903

+ * gcc.dg/tree-ssa/predcom-7.c: Likewise.

7904

+

7905

+ PR tree-optimization/59047

7906

+ * gcc.dg/torture/pr59047.c: New testcase.

7907

+

7908

+ 2013-10-15 Richard Biener <rguenther@suse.de>

7909

+

7910

+ PR tree-optimization/58143

7911

+ * gcc.dg/torture/pr58143-1.c: New testcase.

7912

+ * gcc.dg/torture/pr58143-2.c: Likewise.

7913

+ * gcc.dg/torture/pr58143-3.c: Likewise.

7914

+

7915

+2013-11-17 Janus Weil <janus@gcc.gnu.org>

7916

+

7917

+ Backport from mainline

7918

+ 2013-11-07 Janus Weil <janus@gcc.gnu.org>

7919

+

7920

+ PR fortran/58471

7921

+ * gfortran.dg/constructor_9.f90: New.

7922

+

7923

+2013-11-16 Janus Weil <janus@gcc.gnu.org>

7924

+

7925

+ Backport from mainline

7926

+ 2013-09-20 Janus Weil <janus@gcc.gnu.org>

7927

+

7928

+ PR fortran/58099

7929

+ * gfortran.dg/proc_ptr_43.f90: New.

7930

+

7931

+2013-11-16 Paul Thomas <pault@gcc.gnu.org>

7932

+

7933

+ PR fortran/58771

7934

+ * gfortran.dg/derived_external_function_1.f90 : New test

7935

+

7936

+2013-11-14 Uros Bizjak <ubizjak@gmail.com>

7937

+

7938

+ Backport from mainline

7939

+ 2013-11-06 Uros Bizjak <ubizjak@gmail.com>

7940

+

7941

+ PR target/59021

7942

+ * gcc.target/i386/pr59021.c: New test.

7943

+

7944

+2013-11-14 Jakub Jelinek <jakub@redhat.com>

7945

+

7946

+ PR target/59101

7947

+ * gcc.c-torture/execute/pr59101.c: New test.

7948

+

7949

+2013-11-11 Jakub Jelinek <jakub@redhat.com>

7950

+

7951

+ Backported from mainline

7952

+ 2013-11-06 Jakub Jelinek <jakub@redhat.com>

7953

+

7954

+ PR middle-end/58970

7955

+ * gcc.c-torture/compile/pr58970-1.c: New test.

7956

+ * gcc.c-torture/compile/pr58970-2.c: New test.

7957

+

7958

+ 2013-11-05 Jakub Jelinek <jakub@redhat.com>

7959

+

7960

+ PR rtl-optimization/58997

7961

+ * gcc.c-torture/compile/pr58997.c: New test.

7962

+

7963

+2013-11-10 Wei Mi <wmi@google.com>

7964

+

7965

+ * testsuite/gcc.dg/pr57518.c: Backport regex fix from r200720.

7966

+

7967

+2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

7968

+

7969

+ Backport from mainline

7970

+ 2013-11-07 H.J. Lu <hongjiu.lu@intel.com>

7971

+

7972

+ PR target/59034

7973

+ * gcc.target/i386/pr59034-1.c: New test.

7974

+ * gcc.target/i386/pr59034-2.c: Likewise.

7975

+

7976

+2013-11-06 Wei Mi <wmi@google.com>

7977

+

7978

+ PR regression/58985

7979

+ * testsuite/gcc.dg/pr57518.c: Add subreg in regexp pattern.

7980

+

7981

+2013-11-05 Steven G. Kargl <kargl@gcc.gnu.org>

7982

+

7983

+ PR fortran/58989

7984

+ * gfortran.dg/reshape_6.f90: New test.

7985

+

7986

+2013-11-05 Jakub Jelinek <jakub@redhat.com>

7987

+

7988

+ PR tree-optimization/58984

7989

+ * gcc.c-torture/execute/pr58984.c: New test.

7990

+

7991

+2013-11-04 Marek Polacek <polacek@redhat.com>

7992

+

7993

+ Backport from mainline

7994

+ 2013-11-04 Marek Polacek <polacek@redhat.com>

7995

+

7996

+ PR c++/58979

7997

+ * g++.dg/diagnostic/pr58979.C: New test.

7998

+

7999

+2013-11-03 H.J. Lu <hongjiu.lu@intel.com>

8000

+

8001

+ Backport from mainline

8002

+ 2013-10-12 H.J. Lu <hongjiu.lu@intel.com>

8003

+

8004

+ PR target/58690

8005

+ * gcc.target/i386/pr58690.c: New test

8006

+

8007

+2013-11-02 Janus Weil <janus@gcc.gnu.org>

8008

+

8009

+ Backport from mainline

8010

+ 2013-09-23 Janus Weil <janus@gcc.gnu.org>

8011

+

8012

+ PR fortran/58355

8013

+ * gfortran.dg/extends_15.f90: New.

8014

+

8015

+2013-10-29 Uros Bizjak <ubizjak@gmail.com>

8016

+

8017

+ Backport from mainline

8018

+ 2013-08-08 Richard Sandiford <rdsandiford@googlemail.com>

8019

+

8020

+ PR rtl-optimization/58079

8021

+ * gcc.dg/torture/pr58079.c: New test.

8022

+

8023

+2013-10-28 Tom de Vries <tom@codesourcery.com>

8024

+

8025

+ * gcc.target/arm/require-pic-register-loc.c: New test.

8026

+

8027

+2013-10-26 Uros Bizjak <ubizjak@gmail.com>

8028

+

8029

+ Backport from mainline

8030

+ 2013-10-22 Uros Bizjak <ubizjak@gmail.com>

8031

+

8032

+ PR target/58779

8033

+ * gcc.target/i386/pr30315.c: Remove MINUSCC, DECCC, MINUSCCONLY

8034

+ and MINUSCCZEXT defines. Update scan-assembler dg directive.

8035

+ * gcc.dg/torture/pr58779.c: New test.

8036

+

8037

+2013-10-25 Richard Henderson <rth@redhat.com>

8038

+

8039

+ PR rtl/58542

8040

+ * gcc.dg/atomic-store-6.c: New.

8041

+

8042

+2013-10-25 Tom de Vries <tom@codesourcery.com>

8043

+

8044

+ PR c++/58282

8045

+ * g++.dg/tm/noexcept-6.C: New test.

8046

+

8047

+2013-10-25 Eric Botcazou <ebotcazou@adacore.com>

8048

+

8049

+ * gcc.c-torture/execute/pr58831.c: New test.

8050

+

8051

+2013-10-23 Tom de Vries <tom@codesourcery.com>

8052

+

8053

+ PR tree-optimization/58805

8054

+ * gcc.dg/pr58805.c: New test.

8055

+

8056

+2013-10-23 Richard Biener <rguenther@suse.de>

8057

+

8058

+ * gcc.dg/torture/pr58830.c: New testcase.

8059

+

8060

+ Backport from mainline

8061

+ 2013-06-24 Richard Biener <rguenther@suse.de>

8062

+

8063

+ PR tree-optimization/57488

8064

+ * gcc.dg/torture/pr57488.c: New testcase.

8065

+

8066

+2013-10-19 Oleg Endo <olegendo@gcc.gnu.org>

8067

+

8068

+ * gcc.target/sh/pr54089-3.c: Fix test for load of constant 31.

8069

+

8070

+2013-10-17 Paolo Carlini <paolo.carlini@oracle.com>

8071

+

8072

+ PR c++/58596

8073

+ * g++.dg/cpp0x/lambda/lambda-nsdmi5.C: New

8074

+

8075

+2013-10-16 Paolo Carlini <paolo.carlini@oracle.com>

8076

+

8077

+ PR c++/58633

8078

+ * g++.dg/cpp0x/decltype57.C: New.

8079

+ * g++.dg/cpp0x/enum18.C: Revert r174385 changes.

8080

+

8081

2013-10-16 Release Manager

8082

8083

* GCC 4.8.2 released.

8084

@@ -39,9 +328,9 @@

8085

Backport from mainline

8086

2013-06-27 Andreas Krebbel <Andreas.Krebbel@de.ibm.com>

8087

8088

- * gcc.target/s390/htm-1.c: New file.

8089

- * gcc.target/s390/htm-nofloat-1.c: New file.

8090

- * gcc.target/s390/htm-xl-intrin-1.c: New file.

8091

+ * gcc.target/s390/htm-1.c: New file.

8092

+ * gcc.target/s390/htm-nofloat-1.c: New file.

8093

+ * gcc.target/s390/htm-xl-intrin-1.c: New file.

8094

8095

2013-10-04 Tobias Burnus <burnus@net-b.de>

8096

8097

@@ -307,8 +596,8 @@

8098

Backport from mainline

8099

2013-08-12 Perez Read <netfirewall@gmail.com>

8100

8101

- PR target/58132

8102

- * gcc.target/i386/movabs-1.c: New test.

8103

+ PR target/58132

8104

+ * gcc.target/i386/movabs-1.c: New test.

8105

8106

2013-08-11 Janus Weil <janus@gcc.gnu.org>

8107

8108

@@ -623,8 +912,8 @@

8109

8110

2013-05-09 Martin Jambor <mjambor@suse.cz>

8111

8112

- PR middle-end/56988

8113

- * gcc.dg/ipa/pr56988.c: New test.

8114

+ PR middle-end/56988

8115

+ * gcc.dg/ipa/pr56988.c: New test.

8116

8117

2013-05-08 Marc Glisse <marc.glisse@inria.fr>

8118

8119

@@ -701,7 +990,7 @@

8120

2013-04-25 Marek Polacek <polacek@redhat.com>

8121

8122

PR tree-optimization/57066

8123

- * gcc.dg/torture/builtin-logb-1.c: Adjust testcase.

8124

+ * gcc.dg/torture/builtin-logb-1.c: Adjust testcase.

8125

8126

2013-05-02 Jakub Jelinek <jakub@redhat.com>

8127

8128

@@ -727,32 +1016,32 @@

8129

Backport from mainline

8130

2013-04-24 Vladimir Makarov <vmakarov@redhat.com>

8131

8132

- PR rtl-optimizations/57046

8133

- * gcc.target/i386/pr57046.c: New test.

8134

+ PR rtl-optimizations/57046

8135

+ * gcc.target/i386/pr57046.c: New test.

8136

8137

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

8138

8139

Backport from mainline

8140

2013-04-22 Vladimir Makarov <vmakarov@redhat.com>

8141

8142

- PR target/57018

8143

- * gcc.target/i386/pr57018.c: New test.

8144

+ PR target/57018

8145

+ * gcc.target/i386/pr57018.c: New test.

8146

8147

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

8148

8149

Backport from mainline

8150

2013-04-18 Jakub Jelinek <jakub@redhat.com>

8151

8152

- PR rtl-optimization/56999

8153

- * g++.dg/opt/pr56999.C: New test.

8154

+ PR rtl-optimization/56999

8155

+ * g++.dg/opt/pr56999.C: New test.

8156

8157

2013-05-02 Vladimir Makarov <vmakarov@redhat.com>

8158

8159

Backport from mainline

8160

2013-04-19 Vladimir Makarov <vmakarov@redhat.com>

8161

8162

- PR rtl-optimization/56847

8163

- * gcc.dg/pr56847.c: New test.

8164

+ PR rtl-optimization/56847

8165

+ * gcc.dg/pr56847.c: New test.

8166

8167

2013-05-02 Ian Bolton <ian.bolton@arm.com>

8168

8169

Index: gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90

8170

===================================================================

8171

--- a/src/gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90 (.../tags/gcc_4_8_2_release)

8172

+++ b/src/gcc/testsuite/gfortran.fortran-torture/compile/pr57517.f90 (.../branches/gcc-4_8-branch)

8173

@@ -0,0 +1,13 @@

8174

+SUBROUTINE cal_helicity (uh, ph, phb, wavg, ims, ime, its, ite)

8175

+ INTEGER, INTENT( IN ) :: ims, ime, its, ite

8176

+ REAL, DIMENSION( ims:ime), INTENT( IN ) :: ph, phb, wavg

8177

+ REAL, DIMENSION( ims:ime), INTENT( INOUT ) :: uh

8178

+ INTEGER :: i

8179

+ REAL :: zu

8180

+ DO i = its, ite

8181

+ zu = (ph(i ) + phb(i)) + (ph(i-1) + phb(i-1))

8182

+ IF (wavg(i) .GT. 0) THEN

8183

+ uh(i) = uh(i) + zu

8184

+ ENDIF

8185

+ END DO

8186

+END SUBROUTINE cal_helicity

8187

Index: gcc/testsuite/g++.dg/gomp/pr59297.C

8188

===================================================================

8189

--- a/src/gcc/testsuite/g++.dg/gomp/pr59297.C (.../tags/gcc_4_8_2_release)

8190

+++ b/src/gcc/testsuite/g++.dg/gomp/pr59297.C (.../branches/gcc-4_8-branch)

8191

@@ -0,0 +1,25 @@

8192

+// PR c++/59297

8193

+// { dg-do compile }

8194

+// { dg-options "-fopenmp" }

8195

+

8196

+template <typename T>

8197

+struct A

8198

+{

8199

+ ~A ();

8200

+ const T &operator[] (int) const;

8201

+};

8202

+

8203

+struct B

8204

+{

8205

+ int &operator () (A <int>);

8206

+};

8207

+

8208

+void

8209

+foo (B &x, int &z)

8210

+{

8211

+ A<A<int> > y;

8212

+ #pragma omp atomic

8213

+ x (y[0]) += 1;

8214

+ #pragma omp atomic

8215

+ z += x(y[1]);

8216

+}

8217

Index: gcc/testsuite/g++.dg/diagnostic/pr58979.C

8218

===================================================================

8219

--- a/src/gcc/testsuite/g++.dg/diagnostic/pr58979.C (.../tags/gcc_4_8_2_release)

8220

+++ b/src/gcc/testsuite/g++.dg/diagnostic/pr58979.C (.../branches/gcc-4_8-branch)

8221

@@ -0,0 +1,4 @@

8222

+// PR c++/58979

8223

+// { dg-do compile }

8224

+

8225

+int i = 0->*0; // { dg-error "invalid type argument of" }

8226

Index: gcc/testsuite/g++.dg/tm/noexcept-6.C

8227

===================================================================

8228

--- a/src/gcc/testsuite/g++.dg/tm/noexcept-6.C (.../tags/gcc_4_8_2_release)

8229

+++ b/src/gcc/testsuite/g++.dg/tm/noexcept-6.C (.../branches/gcc-4_8-branch)

8230

@@ -0,0 +1,23 @@

8231

+// { dg-do compile }

8232

+// { dg-options "-fno-exceptions -fgnu-tm -O -std=c++0x -fdump-tree-tmlower" }

8233

+

8234

+struct TrueFalse

8235

+{

8236

+ static constexpr bool v() { return true; }

8237

+};

8238

+

8239

+int global;

8240

+

8241

+template<typename T> int foo()

8242

+{

8243

+ return __transaction_atomic noexcept(T::v()) (global + 1);

8244

+}

8245

+

8246

+int f1()

8247

+{

8248

+ return foo<TrueFalse>();

8249

+}

8250

+

8251

+/* { dg-final { scan-tree-dump-times "eh_must_not_throw" 0 "tmlower" } } */

8252

+/* { dg-final { scan-tree-dump-times "__transaction_atomic" 1 "tmlower" } } */

8253

+/* { dg-final { cleanup-tree-dump "tmlower" } } */

8254

Index: gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C

8255

===================================================================

8256

--- a/src/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C (.../tags/gcc_4_8_2_release)

8257

+++ b/src/gcc/testsuite/g++.dg/cpp0x/lambda/lambda-nsdmi5.C (.../branches/gcc-4_8-branch)

8258

@@ -0,0 +1,7 @@

8259

+// PR c++/58596

8260

+// { dg-do compile { target c++11 } }

8261

+

8262

+struct A

8263

+{

8264

+ int i = [] { return decltype(i)(); }();

8265

+};

8266

Index: gcc/testsuite/g++.dg/cpp0x/enum18.C

8267

===================================================================

8268

--- a/src/gcc/testsuite/g++.dg/cpp0x/enum18.C (.../tags/gcc_4_8_2_release)

8269

+++ b/src/gcc/testsuite/g++.dg/cpp0x/enum18.C (.../branches/gcc-4_8-branch)

8270

@@ -4,5 +4,5 @@

8271

int main(void) {

8272

enum e {};

8273

e ev;

8274

- ev.e::~e_u(); // { dg-error "e_u. has not been declared" }

8275

+ ev.e::~e_u(); // { dg-error "" }

8276

}

8277

Index: gcc/testsuite/g++.dg/cpp0x/nsdmi9.C

8278

===================================================================

8279

--- a/src/gcc/testsuite/g++.dg/cpp0x/nsdmi9.C (.../tags/gcc_4_8_2_release)

8280

+++ b/src/gcc/testsuite/g++.dg/cpp0x/nsdmi9.C (.../branches/gcc-4_8-branch)

8281

@@ -0,0 +1,13 @@

8282

+// PR c++/58162

8283

+// { dg-require-effective-target c++11 }

8284

+

8285

+struct A {

8286

+ A();

8287

+ A(A&&);

8288

+};

8289

+

8290

+struct B {

8291

+ A const a = A();

8292

+};

8293

+

8294

+B b;

8295

Index: gcc/testsuite/g++.dg/cpp0x/decltype57.C

8296

===================================================================

8297

--- a/src/gcc/testsuite/g++.dg/cpp0x/decltype57.C (.../tags/gcc_4_8_2_release)

8298

+++ b/src/gcc/testsuite/g++.dg/cpp0x/decltype57.C (.../branches/gcc-4_8-branch)

8299

@@ -0,0 +1,8 @@

8300

+// PR c++/58633

8301

+// { dg-do compile { target c++11 } }

8302

+

8303

+void foo(int i)

8304

+{

8305

+ typedef int I;

8306

+ decltype(i.I::~I())* p;

8307

+}

8308

Index: gcc/testsuite/g++.dg/inherit/virtual11.C

8309

===================================================================

8310

--- a/src/gcc/testsuite/g++.dg/inherit/virtual11.C (.../tags/gcc_4_8_2_release)

8311

+++ b/src/gcc/testsuite/g++.dg/inherit/virtual11.C (.../branches/gcc-4_8-branch)

8312

@@ -0,0 +1,17 @@

8313

+// PR c++/59031

8314

+// { dg-do compile }

8315

+// { dg-options "-fdump-tree-gimple " }

8316

+class B {

8317

+ public:

8318

+ virtual int add (int a, int b) {return a+ b;}

8319

+};

8320

+

8321

+class D : public B {

8322

+};

8323

+

8324

+int foo (int a, int b) {

8325

+ D d;

8326

+ return d.add(a, b);

8327

+}

8328

+// { dg-final { scan-tree-dump-not "OBJ_TYPE_REF" "gimple" } }

8329

+// { dg-final { cleanup-tree-dump "gimple" } }

8330

Index: gcc/testsuite/c-c++-common/pr59280.c

8331

===================================================================

8332

--- a/src/gcc/testsuite/c-c++-common/pr59280.c (.../tags/gcc_4_8_2_release)

8333

+++ b/src/gcc/testsuite/c-c++-common/pr59280.c (.../branches/gcc-4_8-branch)

8334

@@ -0,0 +1,4 @@

8335

+/* PR c/59280 */

8336

+/* { dg-do compile } */

8337

+

8338

+void bar (char *) __attribute__((constructor(foo))); /* { dg-error "constructor priorities must be integers|was not declared|constructor priorities are not supported" } */

8339

Index: gcc/testsuite/c-c++-common/fold-divmul-1.c

8340

===================================================================

8341

--- a/src/gcc/testsuite/c-c++-common/fold-divmul-1.c (.../tags/gcc_4_8_2_release)

8342

+++ b/src/gcc/testsuite/c-c++-common/fold-divmul-1.c (.../branches/gcc-4_8-branch)

8343

@@ -0,0 +1,11 @@

8344

+/* { dg-do compile } */

8345

+/* { dg-options "-fdump-tree-original" } */

8346

+

8347

+int *

8348

+fx (int *b, int *e)

8349

+{

8350

+ return b + (e - b);

8351

+}

8352

+

8353

+/* { dg-final { scan-tree-dump-not "/\\\[ex\\\]" "original" } } */

8354

+/* { dg-final { cleanup-tree-dump "original" } } */

8355

Index: gcc/testsuite/c-c++-common/torture/pr58794-1.c

8356

===================================================================

8357

--- a/src/gcc/testsuite/c-c++-common/torture/pr58794-1.c (.../tags/gcc_4_8_2_release)

8358

+++ b/src/gcc/testsuite/c-c++-common/torture/pr58794-1.c (.../branches/gcc-4_8-branch)

8359

@@ -0,0 +1,29 @@

8360

+/* { dg-do compile } */

8361

+

8362

+struct S0

8363

+{

8364

+ int f;

8365

+};

8366

+

8367

+struct S1

8368

+{

8369

+ struct S0 f1;

8370

+ volatile int f2;

8371

+};

8372

+

8373

+struct S2

8374

+{

8375

+ struct S1 g;

8376

+} a, b;

8377

+

8378

+static int *c[1][2] = {{0, (int *)&a.g.f2}};

8379

+static int d;

8380

+

8381

+int

8382

+main ()

8383

+{

8384

+ for (d = 0; d < 1; d++)

8385

+ for (b.g.f1.f = 0; b.g.f1.f < 1; b.g.f1.f++)

8386

+ *c[b.g.f1.f][d + 1] = 0;

8387

+ return 0;

8388

+}

8389

Index: gcc/testsuite/c-c++-common/torture/pr58794-2.c

8390

===================================================================

8391

--- a/src/gcc/testsuite/c-c++-common/torture/pr58794-2.c (.../tags/gcc_4_8_2_release)

8392

+++ b/src/gcc/testsuite/c-c++-common/torture/pr58794-2.c (.../branches/gcc-4_8-branch)

8393

@@ -0,0 +1,21 @@

8394

+/* { dg-do compile } */

8395

+

8396

+struct S

8397

+{

8398

+ volatile int f;

8399

+} a;

8400

+

8401

+unsigned int b;

8402

+

8403

+static int *c[1][2] = {{0, (int *)&a.f}};

8404

+static unsigned int d;

8405

+

8406

+int

8407

+main ()

8408

+{

8409

+ for (; d < 1; d++)

8410

+ for (; b < 1; b++)

8411

+ *c[b][d + 1] = 0;

8412

+

8413

+ return 0;

8414

+}

8415

Index: gcc/cp/typeck.c

8416

===================================================================

8417

--- a/src/gcc/cp/typeck.c (.../tags/gcc_4_8_2_release)

8418

+++ b/src/gcc/cp/typeck.c (.../branches/gcc-4_8-branch)

8419

@@ -7611,7 +7611,7 @@

8420

/* Handle null pointer to member function conversions. */

8421

if (null_ptr_cst_p (pfn))

8422

{

8423

- pfn = build_c_cast (input_location, type, pfn);

8424

+ pfn = cp_build_c_cast (type, pfn, complain);

8425

return build_ptrmemfunc1 (to_type,

8426

integer_zero_node,

8427

pfn);

8428

Index: gcc/cp/except.c

8429

===================================================================

8430

--- a/src/gcc/cp/except.c (.../tags/gcc_4_8_2_release)

8431

+++ b/src/gcc/cp/except.c (.../branches/gcc-4_8-branch)

8432

@@ -380,6 +380,9 @@

8433

{

8434

tree type = body ? TREE_TYPE (body) : void_type_node;

8435

8436

+ if (!flag_exceptions)

8437

+ return body;

8438

+

8439

if (cond && !value_dependent_expression_p (cond))

8440

{

8441

cond = cxx_constant_value (cond);

8442

Index: gcc/cp/ChangeLog

8443

===================================================================

8444

--- a/src/gcc/cp/ChangeLog (.../tags/gcc_4_8_2_release)

8445

+++ b/src/gcc/cp/ChangeLog (.../branches/gcc-4_8-branch)

8446

@@ -1,3 +1,53 @@

8447

+2013-11-28 Jakub Jelinek <jakub@redhat.com>

8448

+

8449

+ PR c++/59297

8450

+ * semantics.c (finish_omp_atomic): Call finish_expr_stmt

8451

+ rather than add_stmt.

8452

+

8453

+2013-11-23 Easwaran Raman <eraman@google.com>

8454

+

8455

+ PR c++/59031

8456

+ * call.c (build_new_method_call_1): Comnpare function context

8457

+ with BASELINK_BINFO type rather than instance type before

8458

+ marking the call with LOOKUP_NONVIRTUAL.

8459

+

8460

+2013-10-31 Jason Merrill <jason@redhat.com>

8461

+

8462

+ PR c++/58162

8463

+ * parser.c (cp_parser_late_parse_one_default_arg): Set

8464

+ TARGET_EXPR_DIRECT_INIT_P.

8465

+

8466

+2013-11-11 Paolo Carlini <paolo.carlini@oracle.com>

8467

+

8468

+ * cvt.c (cp_convert_to_pointer): Call build_ptrmemfunc before

8469

+ maybe_warn_zero_as_null_pointer_constant to avoid duplicate

8470

+ -Wzero-as-null-pointer-constant diagnostics.

8471

+

8472

+ * typeck.c (build_ptrmemfunc): Use cp_build_c_cast.

8473

+

8474

+2013-10-25 Tom de Vries <tom@codesourcery.com>

8475

+

8476

+ PR c++/58282

8477

+ * except.c (build_must_not_throw_expr): Handle

8478

+ flag_exceptions.

8479

+

8480

+2013-10-17 Paolo Carlini <paolo.carlini@oracle.com>

8481

+

8482

+ PR c++/58596

8483

+ * semantics.c (lambda_expr_this_capture): Handle NSDMIs in the

8484

+ cp_unevaluated_operand case.

8485

+

8486

+2013-10-16 Paolo Carlini <paolo.carlini@oracle.com>

8487

+

8488

+ PR c++/58633

8489

+ * parser.c (cp_parser_pseudo_destructor_name): Revert r174385 changes.

8490

+

8491

+2013-10-16 Jason Merrill <jason@redhat.com>

8492

+

8493

+ PR c++/57850

8494

+ * decl2.c (dump_tu): Split out from...

8495

+ (cp_write_global_declarations): ...here. Call it in PCH mode.

8496

+

8497

2013-10-16 Release Manager

8498

8499

* GCC 4.8.2 released.

8500

Index: gcc/cp/semantics.c

8501

===================================================================

8502

--- a/src/gcc/cp/semantics.c (.../tags/gcc_4_8_2_release)

8503

+++ b/src/gcc/cp/semantics.c (.../branches/gcc-4_8-branch)

8504

@@ -5059,7 +5059,7 @@

8505

}

8506

stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);

8507

}

8508

- add_stmt (stmt);

8509

+ finish_expr_stmt (stmt);

8510

}

8511

8512

void

8513

@@ -9481,7 +9481,14 @@

8514

/* In unevaluated context this isn't an odr-use, so just return the

8515

nearest 'this'. */

8516

if (cp_unevaluated_operand)

8517

- return lookup_name (this_identifier);

8518

+ {

8519

+ /* In an NSDMI the fake 'this' pointer that we're using for

8520

+ parsing is in scope_chain. */

8521

+ if (LAMBDA_EXPR_EXTRA_SCOPE (lambda)

8522

+ && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (lambda)) == FIELD_DECL)

8523

+ return scope_chain->x_current_class_ptr;

8524

+ return lookup_name (this_identifier);

8525

+ }

8526

8527

/* Try to default capture 'this' if we can. */

8528

if (!this_capture

8529

Index: gcc/cp/decl2.c

8530

===================================================================

8531

--- a/src/gcc/cp/decl2.c (.../tags/gcc_4_8_2_release)

8532

+++ b/src/gcc/cp/decl2.c (.../branches/gcc-4_8-branch)

8533

@@ -3960,6 +3960,22 @@

8534

expand_or_defer_fn (finish_function (0));

8535

}

8536

8537

+/* The entire file is now complete. If requested, dump everything

8538

+ to a file. */

8539

+

8540

+static void

8541

+dump_tu (void)

8542

+{

8543

+ int flags;

8544

+ FILE *stream = dump_begin (TDI_tu, &flags);

8545

+

8546

+ if (stream)

8547

+ {

8548

+ dump_node (global_namespace, flags & ~TDF_SLIM, stream);

8549

+ dump_end (TDI_tu, stream);

8550

+ }

8551

+}

8552

+

8553

/* This routine is called at the end of compilation.

8554

Its job is to create all the code needed to initialize and

8555

destroy the global aggregates. We do the destruction

8556

@@ -3990,6 +4006,7 @@

8557

if (pch_file)

8558

{

8559

c_common_write_pch ();

8560

+ dump_tu ();

8561

return;

8562

}

8563

8564

@@ -4359,17 +4376,8 @@

8565

8566

/* The entire file is now complete. If requested, dump everything

8567

to a file. */

8568

- {

8569

- int flags;

8570

- FILE *stream = dump_begin (TDI_tu, &flags);

8571

+ dump_tu ();

8572

8573

- if (stream)

8574

- {

8575

- dump_node (global_namespace, flags & ~TDF_SLIM, stream);

8576

- dump_end (TDI_tu, stream);

8577

- }

8578

- }

8579

-

8580

if (flag_detailed_statistics)

8581

{

8582

dump_tree_statistics ();

8583

Index: gcc/cp/parser.c

8584

===================================================================

8585

--- a/src/gcc/cp/parser.c (.../tags/gcc_4_8_2_release)

8586

+++ b/src/gcc/cp/parser.c (.../branches/gcc-4_8-branch)

8587

@@ -6421,10 +6421,6 @@

8588

/* Look for the `~'. */

8589

cp_parser_require (parser, CPP_COMPL, RT_COMPL);

8590

8591

- /* Once we see the ~, this has to be a pseudo-destructor. */

8592

- if (!processing_template_decl && !cp_parser_error_occurred (parser))

8593

- cp_parser_commit_to_tentative_parse (parser);

8594

-

8595

/* Look for the type-name again. We are not responsible for

8596

checking that it matches the first type-name. */

8597

*type = cp_parser_nonclass_name (parser);

8598

@@ -22576,6 +22572,9 @@

8599

&& CONSTRUCTOR_IS_DIRECT_INIT (parsed_arg))

8600

flags = LOOKUP_NORMAL;

8601

parsed_arg = digest_init_flags (TREE_TYPE (decl), parsed_arg, flags);

8602

+ if (TREE_CODE (parsed_arg) == TARGET_EXPR)

8603

+ /* This represents the whole initialization. */

8604

+ TARGET_EXPR_DIRECT_INIT_P (parsed_arg) = true;

8605

}

8606

}

8607

8608

Index: gcc/cp/call.c

8609

===================================================================

8610

--- a/src/gcc/cp/call.c (.../tags/gcc_4_8_2_release)

8611

+++ b/src/gcc/cp/call.c (.../branches/gcc-4_8-branch)

8612

@@ -7414,7 +7414,7 @@

8613

struct z_candidate *candidates = 0, *cand;

8614

tree explicit_targs = NULL_TREE;

8615

tree basetype = NULL_TREE;

8616

- tree access_binfo;

8617

+ tree access_binfo, binfo;

8618

tree optype;

8619

tree first_mem_arg = NULL_TREE;

8620

tree instance_ptr;

8621

@@ -7454,6 +7454,7 @@

8622

if (!conversion_path)

8623

conversion_path = BASELINK_BINFO (fns);

8624

access_binfo = BASELINK_ACCESS_BINFO (fns);

8625

+ binfo = BASELINK_BINFO (fns);

8626

optype = BASELINK_OPTYPE (fns);

8627

fns = BASELINK_FUNCTIONS (fns);

8628

if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)

8629

@@ -7697,13 +7698,13 @@

8630

{

8631

/* Optimize away vtable lookup if we know that this

8632

function can't be overridden. We need to check if

8633

- the context and the instance type are the same,

8634

+ the context and the type where we found fn are the same,

8635

actually FN might be defined in a different class

8636

type because of a using-declaration. In this case, we

8637

do not want to perform a non-virtual call. */

8638

if (DECL_VINDEX (fn) && ! (flags & LOOKUP_NONVIRTUAL)

8639

&& same_type_ignoring_top_level_qualifiers_p

8640

- (DECL_CONTEXT (fn), TREE_TYPE (instance))

8641

+ (DECL_CONTEXT (fn), BINFO_TYPE (binfo))

8642

&& resolves_to_fixed_type_p (instance, 0))

8643

flags |= LOOKUP_NONVIRTUAL;

8644

if (explicit_targs)

8645

Index: gcc/cp/cvt.c

8646

===================================================================

8647

--- a/src/gcc/cp/cvt.c (.../tags/gcc_4_8_2_release)

8648

+++ b/src/gcc/cp/cvt.c (.../branches/gcc-4_8-branch)

8649

@@ -203,13 +203,13 @@

8650

8651

if (null_ptr_cst_p (expr))

8652

{

8653

- if (complain & tf_warning)

8654

- maybe_warn_zero_as_null_pointer_constant (expr, loc);

8655

-

8656

if (TYPE_PTRMEMFUNC_P (type))

8657

return build_ptrmemfunc (TYPE_PTRMEMFUNC_FN_TYPE (type), expr, 0,

8658

/*c_cast_p=*/false, complain);

8659

8660

+ if (complain & tf_warning)

8661

+ maybe_warn_zero_as_null_pointer_constant (expr, loc);

8662

+

8663

/* A NULL pointer-to-data-member is represented by -1, not by

8664

zero. */

8665

tree val = (TYPE_PTRDATAMEM_P (type)

8666

Index: gcc/cp/cp-tree.h

8667

===================================================================

8668

--- a/src/gcc/cp/cp-tree.h (.../tags/gcc_4_8_2_release)

8669

+++ b/src/gcc/cp/cp-tree.h (.../branches/gcc-4_8-branch)

8670

@@ -344,7 +344,8 @@

8671

/* Returns true iff NODE is a BASELINK. */

8672

#define BASELINK_P(NODE) \

8673

(TREE_CODE (NODE) == BASELINK)

8674

-/* The BINFO indicating the base from which the BASELINK_FUNCTIONS came. */

8675

+/* The BINFO indicating the base in which lookup found the

8676

+ BASELINK_FUNCTIONS. */

8677

#define BASELINK_BINFO(NODE) \

8678

(((struct tree_baselink*) BASELINK_CHECK (NODE))->binfo)

8679

/* The functions referred to by the BASELINK; either a FUNCTION_DECL,

8680

Index: gcc/mode-switching.c

8681

===================================================================

8682

--- a/src/gcc/mode-switching.c (.../tags/gcc_4_8_2_release)

8683

+++ b/src/gcc/mode-switching.c (.../branches/gcc-4_8-branch)

8684

@@ -568,12 +568,15 @@

8685

8686

info[bb->index].computing = last_mode;

8687

/* Check for blocks without ANY mode requirements.

8688

- N.B. because of MODE_AFTER, last_mode might still be different

8689

- from no_mode. */

8690

+ N.B. because of MODE_AFTER, last_mode might still

8691

+ be different from no_mode, in which case we need to

8692

+ mark the block as nontransparent. */

8693

if (!any_set_required)

8694

{

8695

ptr = new_seginfo (no_mode, BB_END (bb), bb->index, live_now);

8696

add_seginfo (info + bb->index, ptr);

8697

+ if (last_mode != no_mode)

8698

+ bitmap_clear_bit (transp[bb->index], j);

8699

}

8700

}

8701

#if defined (MODE_ENTRY) && defined (MODE_EXIT)

8702

Index: gcc/config.in

8703

===================================================================

8704

--- a/src/gcc/config.in (.../tags/gcc_4_8_2_release)

8705

+++ b/src/gcc/config.in (.../branches/gcc-4_8-branch)

8706

@@ -375,6 +375,12 @@

8707

#endif

8708

8709

8710

+/* Define if your assembler supports LEON instructions. */

8711

+#ifndef USED_FOR_TARGET

8712

+#undef HAVE_AS_LEON

8713

+#endif

8714

+

8715

+

8716

/* Define if the assembler won't complain about a line such as # 0 "" 2. */

8717

#ifndef USED_FOR_TARGET

8718

#undef HAVE_AS_LINE_ZERO

8719

Index: gcc/expr.c

8720

===================================================================

8721

--- a/src/gcc/expr.c (.../tags/gcc_4_8_2_release)

8722

+++ b/src/gcc/expr.c (.../branches/gcc-4_8-branch)

8723

@@ -1994,12 +1994,14 @@

8724

HOST_WIDE_INT bytepos = INTVAL (XEXP (XVECEXP (src, 0, i), 1));

8725

enum machine_mode mode = GET_MODE (tmps[i]);

8726

unsigned int bytelen = GET_MODE_SIZE (mode);

8727

- unsigned int adj_bytelen = bytelen;

8728

+ unsigned int adj_bytelen;

8729

rtx dest = dst;

8730

8731

/* Handle trailing fragments that run over the size of the struct. */

8732

if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)

8733

adj_bytelen = ssize - bytepos;

8734

+ else

8735

+ adj_bytelen = bytelen;

8736

8737

if (GET_CODE (dst) == CONCAT)

8738

{

8739

@@ -2040,6 +2042,7 @@

8740

}

8741

}

8742

8743

+ /* Handle trailing fragments that run over the size of the struct. */

8744

if (ssize >= 0 && bytepos + (HOST_WIDE_INT) bytelen > ssize)

8745

{

8746

/* store_bit_field always takes its value from the lsb.

8747

@@ -2057,16 +2060,22 @@

8748

tmps[i] = expand_shift (RSHIFT_EXPR, mode, tmps[i],

8749

shift, tmps[i], 0);

8750

}

8751

- bytelen = adj_bytelen;

8752

+

8753

+ /* Make sure not to write past the end of the struct. */

8754

+ store_bit_field (dest,

8755

+ adj_bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,

8756

+ bytepos * BITS_PER_UNIT, ssize * BITS_PER_UNIT,

8757

+ VOIDmode, tmps[i]);

8758

}

8759

8760

/* Optimize the access just a bit. */

8761

- if (MEM_P (dest)

8762

- && (! SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))

8763

- || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))

8764

- && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0

8765

- && bytelen == GET_MODE_SIZE (mode))

8766

+ else if (MEM_P (dest)

8767

+ && (!SLOW_UNALIGNED_ACCESS (mode, MEM_ALIGN (dest))

8768

+ || MEM_ALIGN (dest) >= GET_MODE_ALIGNMENT (mode))

8769

+ && bytepos * BITS_PER_UNIT % GET_MODE_ALIGNMENT (mode) == 0

8770

+ && bytelen == GET_MODE_SIZE (mode))

8771

emit_move_insn (adjust_address (dest, mode, bytepos), tmps[i]);

8772

+

8773

else

8774

store_bit_field (dest, bytelen * BITS_PER_UNIT, bytepos * BITS_PER_UNIT,

8775

0, 0, mode, tmps[i]);

8776

@@ -4551,19 +4560,19 @@

8777

- tree_low_cst (DECL_FIELD_BIT_OFFSET (repr), 1));

8778

8779

/* If the adjustment is larger than bitpos, we would have a negative bit

8780

- position for the lower bound and this may wreak havoc later. This can

8781

- occur only if we have a non-null offset, so adjust offset and bitpos

8782

- to make the lower bound non-negative. */

8783

+ position for the lower bound and this may wreak havoc later. Adjust

8784

+ offset and bitpos to make the lower bound non-negative in that case. */

8785

if (bitoffset > *bitpos)

8786

{

8787

HOST_WIDE_INT adjust = bitoffset - *bitpos;

8788

-

8789

gcc_assert ((adjust % BITS_PER_UNIT) == 0);

8790

- gcc_assert (*offset != NULL_TREE);

8791

8792

*bitpos += adjust;

8793

- *offset

8794

- = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));

8795

+ if (*offset == NULL_TREE)

8796

+ *offset = size_int (-adjust / BITS_PER_UNIT);

8797

+ else

8798

+ *offset

8799

+ = size_binop (MINUS_EXPR, *offset, size_int (adjust / BITS_PER_UNIT));

8800

*bitstart = 0;

8801

}

8802

else

8803

@@ -4668,8 +4677,7 @@

8804

expand_insn (icode, 2, ops);

8805

}

8806

else

8807

- store_bit_field (mem, GET_MODE_BITSIZE (mode),

8808

- 0, 0, 0, mode, reg);

8809

+ store_bit_field (mem, GET_MODE_BITSIZE (mode), 0, 0, 0, mode, reg);

8810

return;

8811

}

8812

8813

@@ -4698,6 +4706,15 @@

8814

tem = get_inner_reference (to, &bitsize, &bitpos, &offset, &mode1,

8815

&unsignedp, &volatilep, true);

8816

8817

+ /* Make sure bitpos is not negative, it can wreak havoc later. */

8818

+ if (bitpos < 0)

8819

+ {

8820

+ gcc_assert (offset == NULL_TREE);

8821

+ offset = size_int (bitpos >> (BITS_PER_UNIT == 8

8822

+ ? 3 : exact_log2 (BITS_PER_UNIT)));

8823

+ bitpos &= BITS_PER_UNIT - 1;

8824

+ }

8825

+

8826

if (TREE_CODE (to) == COMPONENT_REF

8827

&& DECL_BIT_FIELD_TYPE (TREE_OPERAND (to, 1)))

8828

get_bit_range (&bitregion_start, &bitregion_end, to, &bitpos, &offset);

8829

Index: gcc/go/go-gcc.cc

8830

===================================================================

8831

--- a/src/gcc/go/go-gcc.cc (.../tags/gcc_4_8_2_release)

8832

+++ b/src/gcc/go/go-gcc.cc (.../branches/gcc-4_8-branch)

8833

@@ -232,6 +232,9 @@

8834

Bexpression*

8835

convert_expression(Btype* type, Bexpression* expr, Location);

8836

8837

+ Bexpression*

8838

+ function_code_expression(Bfunction*, Location);

8839

+

8840

// Statements.

8841

8842

Bstatement*

8843

@@ -334,6 +337,17 @@

8844

Bexpression*

8845

label_address(Blabel*, Location);

8846

8847

+ // Functions.

8848

+

8849

+ Bfunction*

8850

+ error_function()

8851

+ { return this->make_function(error_mark_node); }

8852

+

8853

+ Bfunction*

8854

+ function(Btype* fntype, const std::string& name, const std::string& asm_name,

8855

+ bool is_visible, bool is_declaration, bool is_inlinable,

8856

+ bool disable_split_stack, bool in_unique_section, Location);

8857

+

8858

private:

8859

// Make a Bexpression from a tree.

8860

Bexpression*

8861

@@ -350,6 +364,10 @@

8862

make_type(tree t)

8863

{ return new Btype(t); }

8864

8865

+ Bfunction*

8866

+ make_function(tree t)

8867

+ { return new Bfunction(t); }

8868

+

8869

Btype*

8870

fill_in_struct(Btype*, const std::vector<Btyped_identifier>&);

8871

8872

@@ -966,6 +984,19 @@

8873

return tree_to_expr(ret);

8874

}

8875

8876

+// Get the address of a function.

8877

+

8878

+Bexpression*

8879

+Gcc_backend::function_code_expression(Bfunction* bfunc, Location location)

8880

+{

8881

+ tree func = bfunc->get_tree();

8882

+ if (func == error_mark_node)

8883

+ return this->error_expression();

8884

+

8885

+ tree ret = build_fold_addr_expr_loc(location.gcc_location(), func);

8886

+ return this->make_expression(ret);

8887

+}

8888

+

8889

// An expression as a statement.

8890

8891

Bstatement*

8892

@@ -1724,6 +1755,56 @@

8893

return this->make_expression(ret);

8894

}

8895

8896

+// Declare or define a new function.

8897

+

8898

+Bfunction*

8899

+Gcc_backend::function(Btype* fntype, const std::string& name,

8900

+ const std::string& asm_name, bool is_visible,

8901

+ bool is_declaration, bool is_inlinable,

8902

+ bool disable_split_stack, bool in_unique_section,

8903

+ Location location)

8904

+{

8905

+ tree functype = fntype->get_tree();

8906

+ if (functype != error_mark_node)

8907

+ {

8908

+ gcc_assert(FUNCTION_POINTER_TYPE_P(functype));

8909

+ functype = TREE_TYPE(functype);

8910

+ }

8911

+ tree id = get_identifier_from_string(name);

8912

+ if (functype == error_mark_node || id == error_mark_node)

8913

+ return this->error_function();

8914

+

8915

+ tree decl = build_decl(location.gcc_location(), FUNCTION_DECL, id, functype);

8916

+ if (!asm_name.empty())

8917

+ SET_DECL_ASSEMBLER_NAME(decl, get_identifier_from_string(asm_name));

8918

+ if (is_visible)

8919

+ TREE_PUBLIC(decl) = 1;

8920

+ if (is_declaration)

8921

+ DECL_EXTERNAL(decl) = 1;

8922

+ else

8923

+ {

8924

+ tree restype = TREE_TYPE(functype);

8925

+ tree resdecl =

8926

+ build_decl(location.gcc_location(), RESULT_DECL, NULL_TREE, restype);

8927

+ DECL_ARTIFICIAL(resdecl) = 1;

8928

+ DECL_IGNORED_P(resdecl) = 1;

8929

+ DECL_CONTEXT(resdecl) = decl;

8930

+ DECL_RESULT(decl) = resdecl;

8931

+ }

8932

+ if (!is_inlinable)

8933

+ DECL_UNINLINABLE(decl) = 1;

8934

+ if (disable_split_stack)

8935

+ {

8936

+ tree attr = get_identifier("__no_split_stack__");

8937

+ DECL_ATTRIBUTES(decl) = tree_cons(attr, NULL_TREE, NULL_TREE);

8938

+ }

8939

+ if (in_unique_section)

8940

+ resolve_unique_section(decl, 0, 1);

8941

+

8942

+ go_preserve_from_gc(decl);

8943

+ return new Bfunction(decl);

8944

+}

8945

+

8946

// The single backend.

8947

8948

static Gcc_backend gcc_backend;

8949

@@ -1799,3 +1880,9 @@

8950

{

8951

return bv->get_tree();

8952

}

8953

+

8954

+tree

8955

+function_to_tree(Bfunction* bf)

8956

+{

8957

+ return bf->get_tree();

8958

+}

8959

Index: gcc/go/ChangeLog

8960

===================================================================

8961

--- a/src/gcc/go/ChangeLog (.../tags/gcc_4_8_2_release)

8962

+++ b/src/gcc/go/ChangeLog (.../branches/gcc-4_8-branch)

8963

@@ -1,3 +1,17 @@

8964

+2013-10-16 Ian Lance Taylor <iant@google.com>

8965

+

8966

+ Bring in from mainline:

8967

+

8968

+ 2013-10-11 Chris Manghane <cmang@google.com>

8969

+ * go-gcc.cc (Gcc_backend::function_code_expression): New

8970

+ function.

8971

+

8972

+ 2013-10-10 Chris Manghane <cmang@google.com>

8973

+ * go-gcc.cc (Backend::error_function): New function.

8974

+ (Backend::function): New function.

8975

+ (Backend::make_function): New function.

8976

+ (function_to_tree): New function.

8977

+

8978

2013-10-16 Release Manager

8979

8980

* GCC 4.8.2 released.

8981

Index: gcc/go/gofrontend/gogo.cc

8982

===================================================================

8983

--- a/src/gcc/go/gofrontend/gogo.cc (.../tags/gcc_4_8_2_release)

8984

+++ b/src/gcc/go/gofrontend/gogo.cc (.../branches/gcc-4_8-branch)

8985

@@ -3320,7 +3320,8 @@

8986

closure_var_(NULL), block_(block), location_(location), labels_(),

8987

local_type_count_(0), descriptor_(NULL), fndecl_(NULL), defer_stack_(NULL),

8988

is_sink_(false), results_are_named_(false), nointerface_(false),

8989

- calls_recover_(false), is_recover_thunk_(false), has_recover_thunk_(false),

8990

+ is_unnamed_type_stub_method_(false), calls_recover_(false),

8991

+ is_recover_thunk_(false), has_recover_thunk_(false),

8992

in_unique_section_(false)

8993

{

8994

}

8995

@@ -3819,6 +3820,81 @@

8996

*presults = results;

8997

}

8998

8999

+// Get the backend representation.

9000

+

9001

+Bfunction*

9002

+Function::get_or_make_decl(Gogo* gogo, Named_object* no)

9003

+{

9004

+ if (this->fndecl_ == NULL)

9005

+ {

9006

+ std::string asm_name;

9007

+ bool is_visible = false;

9008

+ if (no->package() != NULL)

9009

+ ;

9010

+ else if (this->enclosing_ != NULL || Gogo::is_thunk(no))

9011

+ ;

9012

+ else if (Gogo::unpack_hidden_name(no->name()) == "init"

9013

+ && !this->type_->is_method())

9014

+ ;

9015

+ else if (Gogo::unpack_hidden_name(no->name()) == "main"

9016

+ && gogo->is_main_package())

9017

+ is_visible = true;

9018

+ // Methods have to be public even if they are hidden because

9019

+ // they can be pulled into type descriptors when using

9020

+ // anonymous fields.

9021

+ else if (!Gogo::is_hidden_name(no->name())

9022

+ || this->type_->is_method())

9023

+ {

9024

+ if (!this->is_unnamed_type_stub_method_)

9025

+ is_visible = true;

9026

+ std::string pkgpath = gogo->pkgpath_symbol();

9027

+ if (this->type_->is_method()

9028

+ && Gogo::is_hidden_name(no->name())

9029

+ && Gogo::hidden_name_pkgpath(no->name()) != gogo->pkgpath())

9030

+ {

9031

+ // This is a method we created for an unexported

9032

+ // method of an imported embedded type. We need to

9033

+ // use the pkgpath of the imported package to avoid

9034

+ // a possible name collision. See bug478 for a test

9035

+ // case.

9036

+ pkgpath = Gogo::hidden_name_pkgpath(no->name());

9037

+ pkgpath = Gogo::pkgpath_for_symbol(pkgpath);

9038

+ }

9039

+

9040

+ asm_name = pkgpath;

9041

+ asm_name.append(1, '.');

9042

+ asm_name.append(Gogo::unpack_hidden_name(no->name()));

9043

+ if (this->type_->is_method())

9044

+ {

9045

+ asm_name.append(1, '.');

9046

+ Type* rtype = this->type_->receiver()->type();

9047

+ asm_name.append(rtype->mangled_name(gogo));

9048

+ }

9049

+ }

9050

+

9051

+ // If a function calls the predeclared recover function, we

9052

+ // can't inline it, because recover behaves differently in a

9053

+ // function passed directly to defer. If this is a recover

9054

+ // thunk that we built to test whether a function can be

9055

+ // recovered, we can't inline it, because that will mess up

9056

+ // our return address comparison.

9057

+ bool is_inlinable = !(this->calls_recover_ || this->is_recover_thunk_);

9058

+

9059

+ // If this is a thunk created to call a function which calls

9060

+ // the predeclared recover function, we need to disable

9061

+ // stack splitting for the thunk.

9062

+ bool disable_split_stack = this->is_recover_thunk_;

9063

+

9064

+ Btype* functype = this->type_->get_backend_fntype(gogo);

9065

+ this->fndecl_ =

9066

+ gogo->backend()->function(functype, no->get_id(gogo), asm_name,

9067

+ is_visible, false, is_inlinable,

9068

+ disable_split_stack,

9069

+ this->in_unique_section_, this->location());

9070

+ }

9071

+ return this->fndecl_;

9072

+}

9073

+

9074

// Class Block.

9075

9076

Block::Block(Block* enclosing, Location location)

9077

@@ -5110,6 +5186,75 @@

9078

go_unreachable();

9079

}

9080

9081

+

9082

+// Return the external identifier for this object.

9083

+

9084

+std::string

9085

+Named_object::get_id(Gogo* gogo)

9086

+{

9087

+ go_assert(!this->is_variable() && !this->is_result_variable());

9088

+ std::string decl_name;

9089

+ if (this->is_function_declaration()

9090

+ && !this->func_declaration_value()->asm_name().empty())

9091

+ decl_name = this->func_declaration_value()->asm_name();

9092

+ else if (this->is_type()

9093

+ && Linemap::is_predeclared_location(this->type_value()->location()))

9094

+ {

9095

+ // We don't need the package name for builtin types.

9096

+ decl_name = Gogo::unpack_hidden_name(this->name_);

9097

+ }

9098

+ else

9099

+ {

9100

+ std::string package_name;

9101

+ if (this->package_ == NULL)

9102

+ package_name = gogo->package_name();

9103

+ else

9104

+ package_name = this->package_->package_name();

9105

+

9106

+ // Note that this will be misleading if this is an unexported

9107

+ // method generated for an embedded imported type. In that case

9108

+ // the unexported method should have the package name of the

9109

+ // package from which it is imported, but we are going to give

9110

+ // it our package name. Fixing this would require knowing the

9111

+ // package name, but we only know the package path. It might be

9112

+ // better to use package paths here anyhow. This doesn't affect

9113

+ // the assembler code, because we always set that name in

9114

+ // Function::get_or_make_decl anyhow. FIXME.

9115

+

9116

+ decl_name = package_name + '.' + Gogo::unpack_hidden_name(this->name_);

9117

+

9118

+ Function_type* fntype;

9119

+ if (this->is_function())

9120

+ fntype = this->func_value()->type();

9121

+ else if (this->is_function_declaration())

9122

+ fntype = this->func_declaration_value()->type();

9123

+ else

9124

+ fntype = NULL;

9125

+ if (fntype != NULL && fntype->is_method())

9126

+ {

9127

+ decl_name.push_back('.');

9128

+ decl_name.append(fntype->receiver()->type()->mangled_name(gogo));

9129

+ }

9130

+ }

9131

+ if (this->is_type())

9132

+ {

9133

+ unsigned int index;

9134

+ const Named_object* in_function = this->type_value()->in_function(&index);

9135

+ if (in_function != NULL)

9136

+ {

9137

+ decl_name += '$' + Gogo::unpack_hidden_name(in_function->name());

9138

+ if (index > 0)

9139

+ {

9140

+ char buf[30];

9141

+ snprintf(buf, sizeof buf, "%u", index);

9142

+ decl_name += '$';

9143

+ decl_name += buf;

9144

+ }

9145

+ }

9146

+ }

9147

+ return decl_name;

9148

+}

9149

+

9150

// Class Bindings.

9151

9152

Bindings::Bindings(Bindings* enclosing)

9153

Index: gcc/go/gofrontend/runtime.def

9154

===================================================================

9155

--- a/src/gcc/go/gofrontend/runtime.def (.../tags/gcc_4_8_2_release)

9156

+++ b/src/gcc/go/gofrontend/runtime.def (.../branches/gcc-4_8-branch)

9157

@@ -68,6 +68,12 @@

9158

P1(STRING), R1(SLICE))

9159

9160

9161

+// Complex division.

9162

+DEF_GO_RUNTIME(COMPLEX64_DIV, "__go_complex64_div",

9163

+ P2(COMPLEX64, COMPLEX64), R1(COMPLEX64))

9164

+DEF_GO_RUNTIME(COMPLEX128_DIV, "__go_complex128_div",

9165

+ P2(COMPLEX128, COMPLEX128), R1(COMPLEX128))

9166

+

9167

// Make a slice.

9168

DEF_GO_RUNTIME(MAKESLICE1, "__go_make_slice1", P2(TYPE, UINTPTR), R1(SLICE))

9169

DEF_GO_RUNTIME(MAKESLICE2, "__go_make_slice2", P3(TYPE, UINTPTR, UINTPTR),

9170

Index: gcc/go/gofrontend/gogo.h

9171

===================================================================

9172

--- a/src/gcc/go/gofrontend/gogo.h (.../tags/gcc_4_8_2_release)

9173

+++ b/src/gcc/go/gofrontend/gogo.h (.../branches/gcc-4_8-branch)

9174

@@ -48,6 +48,7 @@

9175

class Bblock;

9176

class Bvariable;

9177

class Blabel;

9178

+class Bfunction;

9179

9180

// This file declares the basic classes used to hold the internal

9181

// representation of Go which is built by the parser.

9182

@@ -952,6 +953,15 @@

9183

this->nointerface_ = true;

9184

}

9185

9186

+ // Record that this function is a stub method created for an unnamed

9187

+ // type.

9188

+ void

9189

+ set_is_unnamed_type_stub_method()

9190

+ {

9191

+ go_assert(this->is_method());

9192

+ this->is_unnamed_type_stub_method_ = true;

9193

+ }

9194

+

9195

// Add a new field to the closure variable.

9196

void

9197

add_closure_field(Named_object* var, Location loc)

9198

@@ -1089,17 +1099,13 @@

9199

this->descriptor_ = descriptor;

9200

}

9201

9202

- // Return the function's decl given an identifier.

9203

- tree

9204

- get_or_make_decl(Gogo*, Named_object*, tree id);

9205

+ // Return the backend representation.

9206

+ Bfunction*

9207

+ get_or_make_decl(Gogo*, Named_object*);

9208

9209

// Return the function's decl after it has been built.

9210

tree

9211

- get_decl() const

9212

- {

9213

- go_assert(this->fndecl_ != NULL);

9214

- return this->fndecl_;

9215

- }

9216

+ get_decl() const;

9217

9218

// Set the function decl to hold a tree of the function code.

9219

void

9220

@@ -1170,7 +1176,7 @@

9221

// The function descriptor, if any.

9222

Expression* descriptor_;

9223

// The function decl.

9224

- tree fndecl_;

9225

+ Bfunction* fndecl_;

9226

// The defer stack variable. A pointer to this variable is used to

9227

// distinguish the defer stack for one function from another. This

9228

// is NULL unless we actually need a defer stack.

9229

@@ -1181,6 +1187,9 @@

9230

bool results_are_named_ : 1;

9231

// True if this method should not be included in the type descriptor.

9232

bool nointerface_ : 1;

9233

+ // True if this function is a stub method created for an unnamed

9234

+ // type.

9235

+ bool is_unnamed_type_stub_method_ : 1;

9236

// True if this function calls the predeclared recover function.

9237

bool calls_recover_ : 1;

9238

// True if this a thunk built for a function which calls recover.

9239

@@ -1265,9 +1274,9 @@

9240

has_descriptor() const

9241

{ return this->descriptor_ != NULL; }

9242

9243

- // Return a decl for the function given an identifier.

9244

- tree

9245

- get_or_make_decl(Gogo*, Named_object*, tree id);

9246

+ // Return a backend representation.

9247

+ Bfunction*

9248

+ get_or_make_decl(Gogo*, Named_object*);

9249

9250

// If there is a descriptor, build it into the backend

9251

// representation.

9252

@@ -1290,7 +1299,7 @@

9253

// The function descriptor, if any.

9254

Expression* descriptor_;

9255

// The function decl if needed.

9256

- tree fndecl_;

9257

+ Bfunction* fndecl_;

9258

};

9259

9260

// A variable.

9261

@@ -2181,8 +2190,8 @@

9262

Bvariable*

9263

get_backend_variable(Gogo*, Named_object* function);

9264

9265

- // Return a tree for the external identifier for this object.

9266

- tree

9267

+ // Return the external identifier for this object.

9268

+ std::string

9269

get_id(Gogo*);

9270

9271

// Return a tree representing this object.

9272

Index: gcc/go/gofrontend/types.h

9273

===================================================================

9274

--- a/src/gcc/go/gofrontend/types.h (.../tags/gcc_4_8_2_release)

9275

+++ b/src/gcc/go/gofrontend/types.h (.../branches/gcc-4_8-branch)

9276

@@ -1717,7 +1717,8 @@

9277

Typed_identifier_list* results, Location location)

9278

: Type(TYPE_FUNCTION),

9279

receiver_(receiver), parameters_(parameters), results_(results),

9280

- location_(location), is_varargs_(false), is_builtin_(false)

9281

+ location_(location), is_varargs_(false), is_builtin_(false),

9282

+ fnbtype_(NULL)

9283

{ }

9284

9285

// Get the receiver.

9286

@@ -1798,6 +1799,11 @@

9287

static Type*

9288

make_function_type_descriptor_type();

9289

9290

+ // Return the backend representation of this function type. This is used

9291

+ // as the real type of a backend function declaration or defintion.

9292

+ Btype*

9293

+ get_backend_fntype(Gogo*);

9294

+

9295

protected:

9296

int

9297

do_traverse(Traverse*);

9298

@@ -1851,6 +1857,9 @@

9299

// Whether this is a special builtin function which can not simply

9300

// be called. This is used for len, cap, etc.

9301

bool is_builtin_;

9302

+ // The backend representation of this type for backend function

9303

+ // declarations and definitions.

9304

+ Btype* fnbtype_;

9305

};

9306

9307

// The type of a pointer.

9308

@@ -1915,7 +1924,7 @@

9309

{

9310

public:

9311

explicit Struct_field(const Typed_identifier& typed_identifier)

9312

- : typed_identifier_(typed_identifier), tag_(NULL)

9313

+ : typed_identifier_(typed_identifier), tag_(NULL), is_imported_(false)

9314

{ }

9315

9316

// The field name.

9317

@@ -1926,6 +1935,10 @@

9318

bool

9319

is_field_name(const std::string& name) const;

9320

9321

+ // Return whether this struct field is an unexported field named NAME.

9322

+ bool

9323

+ is_unexported_field_name(Gogo*, const std::string& name) const;

9324

+

9325

// Return whether this struct field is an embedded built-in type.

9326

bool

9327

is_embedded_builtin(Gogo*) const;

9328

@@ -1963,6 +1976,11 @@

9329

set_tag(const std::string& tag)

9330

{ this->tag_ = new std::string(tag); }

9331

9332

+ // Record that this field is defined in an imported struct.

9333

+ void

9334

+ set_is_imported()

9335

+ { this->is_imported_ = true; }

9336

+

9337

// Set the type. This is only used in error cases.

9338

void

9339

set_type(Type* type)

9340

@@ -1973,6 +1991,8 @@

9341

Typed_identifier typed_identifier_;

9342

// The field tag. This is NULL if the field has no tag.

9343

std::string* tag_;

9344

+ // Whether this field is defined in an imported struct.

9345

+ bool is_imported_;

9346

};

9347

9348

// A list of struct fields.

9349

Index: gcc/go/gofrontend/parse.cc

9350

===================================================================

9351

--- a/src/gcc/go/gofrontend/parse.cc (.../tags/gcc_4_8_2_release)

9352

+++ b/src/gcc/go/gofrontend/parse.cc (.../branches/gcc-4_8-branch)

9353

@@ -744,6 +744,8 @@

9354

return NULL;

9355

9356

Parse::Names names;

9357

+ if (receiver != NULL)

9358

+ names[receiver->name()] = receiver;

9359

if (params != NULL)

9360

this->check_signature_names(params, &names);

9361

if (results != NULL)

9362

Index: gcc/go/gofrontend/import.h

9363

===================================================================

9364

--- a/src/gcc/go/gofrontend/import.h (.../tags/gcc_4_8_2_release)

9365

+++ b/src/gcc/go/gofrontend/import.h (.../branches/gcc-4_8-branch)

9366

@@ -149,6 +149,11 @@

9367

location() const

9368

{ return this->location_; }

9369

9370

+ // Return the package we are importing.

9371

+ Package*

9372

+ package() const

9373

+ { return this->package_; }

9374

+

9375

// Return the next character.

9376

int

9377

peek_char()

9378

Index: gcc/go/gofrontend/runtime.cc

9379

===================================================================

9380

--- a/src/gcc/go/gofrontend/runtime.cc (.../tags/gcc_4_8_2_release)

9381

+++ b/src/gcc/go/gofrontend/runtime.cc (.../branches/gcc-4_8-branch)

9382

@@ -42,6 +42,8 @@

9383

RFT_RUNE,

9384

// Go type float64, C type double.

9385

RFT_FLOAT64,

9386

+ // Go type complex64, C type __complex float.

9387

+ RFT_COMPLEX64,

9388

// Go type complex128, C type __complex double.

9389

RFT_COMPLEX128,

9390

// Go type string, C type struct __go_string.

9391

@@ -126,6 +128,10 @@

9392

t = Type::lookup_float_type("float64");

9393

break;

9394

9395

+ case RFT_COMPLEX64:

9396

+ t = Type::lookup_complex_type("complex64");

9397

+ break;

9398

+

9399

case RFT_COMPLEX128:

9400

t = Type::lookup_complex_type("complex128");

9401

break;

9402

@@ -216,6 +222,7 @@

9403

case RFT_UINTPTR:

9404

case RFT_RUNE:

9405

case RFT_FLOAT64:

9406

+ case RFT_COMPLEX64:

9407

case RFT_COMPLEX128:

9408

case RFT_STRING:

9409

case RFT_POINTER:

9410

Index: gcc/go/gofrontend/expressions.h

9411

===================================================================

9412

--- a/src/gcc/go/gofrontend/expressions.h (.../tags/gcc_4_8_2_release)

9413

+++ b/src/gcc/go/gofrontend/expressions.h (.../branches/gcc-4_8-branch)

9414

@@ -1514,8 +1514,8 @@

9415

closure()

9416

{ return this->closure_; }

9417

9418

- // Return a tree for the code for a function.

9419

- static tree

9420

+ // Return a backend expression for the code of a function.

9421

+ static Bexpression*

9422

get_code_pointer(Gogo*, Named_object* function, Location loc);

9423

9424

protected:

9425

Index: gcc/go/gofrontend/gogo-tree.cc

9426

===================================================================

9427

--- a/src/gcc/go/gofrontend/gogo-tree.cc (.../tags/gcc_4_8_2_release)

9428

+++ b/src/gcc/go/gofrontend/gogo-tree.cc (.../branches/gcc-4_8-branch)

9429

@@ -985,74 +985,6 @@

9430

delete[] vec;

9431

}

9432

9433

-// Get a tree for the identifier for a named object.

9434

-

9435

-tree

9436

-Named_object::get_id(Gogo* gogo)

9437

-{

9438

- go_assert(!this->is_variable() && !this->is_result_variable());

9439

- std::string decl_name;

9440

- if (this->is_function_declaration()

9441

- && !this->func_declaration_value()->asm_name().empty())

9442

- decl_name = this->func_declaration_value()->asm_name();

9443

- else if (this->is_type()

9444

- && Linemap::is_predeclared_location(this->type_value()->location()))

9445

- {

9446

- // We don't need the package name for builtin types.

9447

- decl_name = Gogo::unpack_hidden_name(this->name_);

9448

- }

9449

- else

9450

- {

9451

- std::string package_name;

9452

- if (this->package_ == NULL)

9453

- package_name = gogo->package_name();

9454

- else

9455

- package_name = this->package_->package_name();

9456

-

9457

- // Note that this will be misleading if this is an unexported

9458

- // method generated for an embedded imported type. In that case

9459

- // the unexported method should have the package name of the

9460

- // package from which it is imported, but we are going to give

9461

- // it our package name. Fixing this would require knowing the

9462

- // package name, but we only know the package path. It might be

9463

- // better to use package paths here anyhow. This doesn't affect

9464

- // the assembler code, because we always set that name in

9465

- // Function::get_or_make_decl anyhow. FIXME.

9466

-

9467

- decl_name = package_name + '.' + Gogo::unpack_hidden_name(this->name_);

9468

-

9469

- Function_type* fntype;

9470

- if (this->is_function())

9471

- fntype = this->func_value()->type();

9472

- else if (this->is_function_declaration())

9473

- fntype = this->func_declaration_value()->type();

9474

- else

9475

- fntype = NULL;

9476

- if (fntype != NULL && fntype->is_method())

9477

- {

9478

- decl_name.push_back('.');

9479

- decl_name.append(fntype->receiver()->type()->mangled_name(gogo));

9480

- }

9481

- }

9482

- if (this->is_type())

9483

- {

9484

- unsigned int index;

9485

- const Named_object* in_function = this->type_value()->in_function(&index);

9486

- if (in_function != NULL)

9487

- {

9488

- decl_name += '$' + Gogo::unpack_hidden_name(in_function->name());

9489

- if (index > 0)

9490

- {

9491

- char buf[30];

9492

- snprintf(buf, sizeof buf, "%u", index);

9493

- decl_name += '$';

9494

- decl_name += buf;

9495

- }

9496

- }

9497

- }

9498

- return get_identifier_from_string(decl_name);

9499

-}

9500

-

9501

// Get a tree for a named object.

9502

9503

tree

9504

@@ -1067,11 +999,6 @@

9505

return error_mark_node;

9506

}

9507

9508

- tree name;

9509

- if (this->classification_ == NAMED_OBJECT_TYPE)

9510

- name = NULL_TREE;

9511

- else

9512

- name = this->get_id(gogo);

9513

tree decl;

9514

switch (this->classification_)

9515

{

9516

@@ -1099,6 +1026,7 @@

9517

decl = error_mark_node;

9518

else if (INTEGRAL_TYPE_P(TREE_TYPE(expr_tree)))

9519

{

9520

+ tree name = get_identifier_from_string(this->get_id(gogo));

9521

decl = build_decl(named_constant->location().gcc_location(),

9522

CONST_DECL, name, TREE_TYPE(expr_tree));

9523

DECL_INITIAL(decl) = expr_tree;

9524

@@ -1161,7 +1089,7 @@

9525

case NAMED_OBJECT_FUNC:

9526

{

9527

Function* func = this->u_.func_value;

9528

- decl = func->get_or_make_decl(gogo, this, name);

9529

+ decl = function_to_tree(func->get_or_make_decl(gogo, this));

9530

if (decl != error_mark_node)

9531

{

9532

if (func->block() != NULL)

9533

@@ -1286,124 +1214,13 @@

9534

return block_tree;

9535

}

9536

9537

-// Get a tree for a function decl.

9538

+// Get the backend representation.

9539

9540

-tree

9541

-Function::get_or_make_decl(Gogo* gogo, Named_object* no, tree id)

9542

+Bfunction*

9543

+Function_declaration::get_or_make_decl(Gogo* gogo, Named_object* no)

9544

{

9545

- if (this->fndecl_ == NULL_TREE)

9546

+ if (this->fndecl_ == NULL)

9547

{

9548

- tree functype = type_to_tree(this->type_->get_backend(gogo));

9549

-

9550

- if (functype != error_mark_node)

9551

- {

9552

- // The type of a function comes back as a pointer to a

9553

- // struct whose first field is the function, but we want the

9554

- // real function type for a function declaration.

9555

- go_assert(POINTER_TYPE_P(functype)

9556

- && TREE_CODE(TREE_TYPE(functype)) == RECORD_TYPE);

9557

- functype = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(functype)));

9558

- go_assert(FUNCTION_POINTER_TYPE_P(functype));

9559

- functype = TREE_TYPE(functype);

9560

- }

9561

-

9562

- if (functype == error_mark_node)

9563

- this->fndecl_ = error_mark_node;

9564

- else

9565

- {

9566

- tree decl = build_decl(this->location().gcc_location(), FUNCTION_DECL,

9567

- id, functype);

9568

-

9569

- this->fndecl_ = decl;

9570

-

9571

- if (no->package() != NULL)

9572

- ;

9573

- else if (this->enclosing_ != NULL || Gogo::is_thunk(no))

9574

- ;

9575

- else if (Gogo::unpack_hidden_name(no->name()) == "init"

9576

- && !this->type_->is_method())

9577

- ;

9578

- else if (Gogo::unpack_hidden_name(no->name()) == "main"

9579

- && gogo->is_main_package())

9580

- TREE_PUBLIC(decl) = 1;

9581

- // Methods have to be public even if they are hidden because

9582

- // they can be pulled into type descriptors when using

9583

- // anonymous fields.

9584

- else if (!Gogo::is_hidden_name(no->name())

9585

- || this->type_->is_method())

9586

- {

9587

- TREE_PUBLIC(decl) = 1;

9588

- std::string pkgpath = gogo->pkgpath_symbol();

9589

- if (this->type_->is_method()

9590

- && Gogo::is_hidden_name(no->name())

9591

- && Gogo::hidden_name_pkgpath(no->name()) != gogo->pkgpath())

9592

- {

9593

- // This is a method we created for an unexported

9594

- // method of an imported embedded type. We need to

9595

- // use the pkgpath of the imported package to avoid

9596

- // a possible name collision. See bug478 for a test

9597

- // case.

9598

- pkgpath = Gogo::hidden_name_pkgpath(no->name());

9599

- pkgpath = Gogo::pkgpath_for_symbol(pkgpath);

9600

- }

9601

-

9602

- std::string asm_name = pkgpath;

9603

- asm_name.append(1, '.');

9604

- asm_name.append(Gogo::unpack_hidden_name(no->name()));

9605

- if (this->type_->is_method())

9606

- {

9607

- asm_name.append(1, '.');

9608

- Type* rtype = this->type_->receiver()->type();

9609

- asm_name.append(rtype->mangled_name(gogo));

9610

- }

9611

- SET_DECL_ASSEMBLER_NAME(decl,

9612

- get_identifier_from_string(asm_name));

9613

- }

9614

-

9615

- // Why do we have to do this in the frontend?

9616

- tree restype = TREE_TYPE(functype);

9617

- tree resdecl =

9618

- build_decl(this->location().gcc_location(), RESULT_DECL, NULL_TREE,

9619

- restype);

9620

- DECL_ARTIFICIAL(resdecl) = 1;

9621

- DECL_IGNORED_P(resdecl) = 1;

9622

- DECL_CONTEXT(resdecl) = decl;

9623

- DECL_RESULT(decl) = resdecl;

9624

-

9625

- // If a function calls the predeclared recover function, we

9626

- // can't inline it, because recover behaves differently in a

9627

- // function passed directly to defer. If this is a recover

9628

- // thunk that we built to test whether a function can be

9629

- // recovered, we can't inline it, because that will mess up

9630

- // our return address comparison.

9631

- if (this->calls_recover_ || this->is_recover_thunk_)

9632

- DECL_UNINLINABLE(decl) = 1;

9633

-

9634

- // If this is a thunk created to call a function which calls

9635

- // the predeclared recover function, we need to disable

9636

- // stack splitting for the thunk.

9637

- if (this->is_recover_thunk_)

9638

- {

9639

- tree attr = get_identifier("__no_split_stack__");

9640

- DECL_ATTRIBUTES(decl) = tree_cons(attr, NULL_TREE, NULL_TREE);

9641

- }

9642

-

9643

- if (this->in_unique_section_)

9644

- resolve_unique_section (decl, 0, 1);

9645

-

9646

- go_preserve_from_gc(decl);

9647

- }

9648

- }

9649

- return this->fndecl_;

9650

-}

9651

-

9652

-// Get a tree for a function declaration.

9653

-

9654

-tree

9655

-Function_declaration::get_or_make_decl(Gogo* gogo, Named_object* no, tree id)

9656

-{

9657

- if (this->fndecl_ == NULL_TREE)

9658

- {

9659

// Let Go code use an asm declaration to pick up a builtin

9660

// function.

9661

if (!this->asm_name_.empty())

9662

@@ -1412,58 +1229,46 @@

9663

builtin_functions.find(this->asm_name_);

9664

if (p != builtin_functions.end())

9665

{

9666

- this->fndecl_ = p->second;

9667

+ this->fndecl_ = tree_to_function(p->second);

9668

return this->fndecl_;

9669

}

9670

}

9671

9672

- tree functype = type_to_tree(this->fntype_->get_backend(gogo));

9673

+ std::string asm_name;

9674

+ if (this->asm_name_.empty())

9675

+ {

9676

+ asm_name = (no->package() == NULL

9677

+ ? gogo->pkgpath_symbol()

9678

+ : no->package()->pkgpath_symbol());

9679

+ asm_name.append(1, '.');

9680

+ asm_name.append(Gogo::unpack_hidden_name(no->name()));

9681

+ if (this->fntype_->is_method())

9682

+ {

9683

+ asm_name.append(1, '.');

9684

+ Type* rtype = this->fntype_->receiver()->type();

9685

+ asm_name.append(rtype->mangled_name(gogo));

9686

+ }

9687

+ }

9688

9689

- if (functype != error_mark_node)

9690

- {

9691

- // The type of a function comes back as a pointer to a

9692

- // struct whose first field is the function, but we want the

9693

- // real function type for a function declaration.

9694

- go_assert(POINTER_TYPE_P(functype)

9695

- && TREE_CODE(TREE_TYPE(functype)) == RECORD_TYPE);

9696

- functype = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(functype)));

9697

- go_assert(FUNCTION_POINTER_TYPE_P(functype));

9698

- functype = TREE_TYPE(functype);

9699

- }

9700

+ Btype* functype = this->fntype_->get_backend_fntype(gogo);

9701

+ this->fndecl_ =

9702

+ gogo->backend()->function(functype, no->get_id(gogo), asm_name,

9703

+ true, true, true, false, false,

9704

+ this->location());

9705

+ }

9706

9707

- tree decl;

9708

- if (functype == error_mark_node)

9709

- decl = error_mark_node;

9710

- else

9711

- {

9712

- decl = build_decl(this->location().gcc_location(), FUNCTION_DECL, id,

9713

- functype);

9714

- TREE_PUBLIC(decl) = 1;

9715

- DECL_EXTERNAL(decl) = 1;

9716

-

9717

- if (this->asm_name_.empty())

9718

- {

9719

- std::string asm_name = (no->package() == NULL

9720

- ? gogo->pkgpath_symbol()

9721

- : no->package()->pkgpath_symbol());

9722

- asm_name.append(1, '.');

9723

- asm_name.append(Gogo::unpack_hidden_name(no->name()));

9724

- if (this->fntype_->is_method())

9725

- {

9726

- asm_name.append(1, '.');

9727

- Type* rtype = this->fntype_->receiver()->type();

9728

- asm_name.append(rtype->mangled_name(gogo));

9729

- }

9730

- SET_DECL_ASSEMBLER_NAME(decl,

9731

- get_identifier_from_string(asm_name));

9732

- }

9733

- }

9734

- this->fndecl_ = decl;

9735

- go_preserve_from_gc(decl);

9736

- }

9737

return this->fndecl_;

9738

}

9739

9740

+// Return the function's decl after it has been built.

9741

+

9742

+tree

9743

+Function::get_decl() const

9744

+{

9745

+ go_assert(this->fndecl_ != NULL);

9746

+ return function_to_tree(this->fndecl_);

9747

+}

9748

+

9749

// We always pass the receiver to a method as a pointer. If the

9750

// receiver is actually declared as a non-pointer type, then we copy

9751

// the value into a local variable, so that it has the right type. In

9752

@@ -1558,7 +1363,7 @@

9753

void

9754

Function::build_tree(Gogo* gogo, Named_object* named_function)

9755

{

9756

- tree fndecl = this->fndecl_;

9757

+ tree fndecl = this->get_decl();

9758

go_assert(fndecl != NULL_TREE);

9759

9760

tree params = NULL_TREE;

9761

@@ -1796,7 +1601,7 @@

9762

set = NULL_TREE;

9763

else

9764

set = fold_build2_loc(end_loc.gcc_location(), MODIFY_EXPR, void_type_node,

9765

- DECL_RESULT(this->fndecl_), retval);

9766

+ DECL_RESULT(this->get_decl()), retval);

9767

tree ret_stmt = fold_build1_loc(end_loc.gcc_location(), RETURN_EXPR,

9768

void_type_node, set);

9769

append_to_statement_list(ret_stmt, &stmt_list);

9770

@@ -1851,7 +1656,7 @@

9771

retval = this->return_value(gogo, named_function, end_loc,

9772

&stmt_list);

9773

set = fold_build2_loc(end_loc.gcc_location(), MODIFY_EXPR, void_type_node,

9774

- DECL_RESULT(this->fndecl_), retval);

9775

+ DECL_RESULT(this->get_decl()), retval);

9776

ret_stmt = fold_build1_loc(end_loc.gcc_location(), RETURN_EXPR,

9777

void_type_node, set);

9778

9779

@@ -1869,7 +1674,7 @@

9780

*fini = stmt_list;

9781

}

9782

9783

-// Return the value to assign to DECL_RESULT(this->fndecl_). This may

9784

+// Return the value to assign to DECL_RESULT(this->get_decl()). This may

9785

// also add statements to STMT_LIST, which need to be executed before

9786

// the assignment. This is used for a return statement with no

9787

// explicit values.

9788

@@ -1902,7 +1707,7 @@

9789

}

9790

else

9791

{

9792

- tree rettype = TREE_TYPE(DECL_RESULT(this->fndecl_));

9793

+ tree rettype = TREE_TYPE(DECL_RESULT(this->get_decl()));

9794

retval = create_tmp_var(rettype, "RESULT");

9795

tree field = TYPE_FIELDS(rettype);

9796

int index = 0;

9797

@@ -2323,18 +2128,14 @@

9798

go_assert(m != NULL);

9799

9800

Named_object* no = m->named_object();

9801

-

9802

- tree fnid = no->get_id(this);

9803

-

9804

- tree fndecl;

9805

+ Bfunction* bf;

9806

if (no->is_function())

9807

- fndecl = no->func_value()->get_or_make_decl(this, no, fnid);

9808

+ bf = no->func_value()->get_or_make_decl(this, no);

9809

else if (no->is_function_declaration())

9810

- fndecl = no->func_declaration_value()->get_or_make_decl(this, no,

9811

- fnid);

9812

+ bf = no->func_declaration_value()->get_or_make_decl(this, no);

9813

else

9814

go_unreachable();

9815

- fndecl = build_fold_addr_expr(fndecl);

9816

+ tree fndecl = build_fold_addr_expr(function_to_tree(bf));

9817

9818

elt = pointers->quick_push(empty);

9819

elt->index = size_int(i);

9820

@@ -2353,10 +2154,11 @@

9821

TREE_CONSTANT(decl) = 1;

9822

DECL_INITIAL(decl) = constructor;

9823

9824

- // If the interface type has hidden methods, then this is the only

9825

- // definition of the table. Otherwise it is a comdat table which

9826

- // may be defined in multiple packages.

9827

- if (has_hidden_methods)

9828

+ // If the interface type has hidden methods, and the table is for a

9829

+ // named type, then this is the only definition of the table.

9830

+ // Otherwise it is a comdat table which may be defined in multiple

9831

+ // packages.

9832

+ if (has_hidden_methods && type->named_type() != NULL)

9833

TREE_PUBLIC(decl) = 1;

9834

else

9835

{

9836

Index: gcc/go/gofrontend/lex.cc

9837

===================================================================

9838

--- a/src/gcc/go/gofrontend/lex.cc (.../tags/gcc_4_8_2_release)

9839

+++ b/src/gcc/go/gofrontend/lex.cc (.../branches/gcc-4_8-branch)

9840

@@ -873,7 +873,28 @@

9841

&& (cc < 'a' || cc > 'z')

9842

&& cc != '_'

9843

&& (cc < '0' || cc > '9'))

9844

- break;

9845

+ {

9846

+ // Check for an invalid character here, as we get better

9847

+ // error behaviour if we swallow them as part of the

9848

+ // identifier we are building.

9849

+ if ((cc >= ' ' && cc < 0x7f)

9850

+ || cc == '\t'

9851

+ || cc == '\r'

9852

+ || cc == '\n')

9853

+ break;

9854

+

9855

+ this->lineoff_ = p - this->linebuf_;

9856

+ error_at(this->location(),

9857

+ "invalid character 0x%x in identifier",

9858

+ cc);

9859

+ if (!has_non_ascii_char)

9860

+ {

9861

+ buf.assign(pstart, p - pstart);

9862

+ has_non_ascii_char = true;

9863

+ }

9864

+ if (!Lex::is_invalid_identifier(buf))

9865

+ buf.append("$INVALID$");

9866

+ }

9867

++p;

9868

if (is_first)

9869

{

9870

Index: gcc/go/gofrontend/backend.h

9871

===================================================================

9872

--- a/src/gcc/go/gofrontend/backend.h (.../tags/gcc_4_8_2_release)

9873

+++ b/src/gcc/go/gofrontend/backend.h (.../branches/gcc-4_8-branch)

9874

@@ -23,7 +23,7 @@

9875

// The backend representation of a statement.

9876

class Bstatement;

9877

9878

-// The backend representation of a function definition.

9879

+// The backend representation of a function definition or declaration.

9880

class Bfunction;

9881

9882

// The backend representation of a block.

9883

@@ -266,6 +266,11 @@

9884

virtual Bexpression*

9885

convert_expression(Btype* type, Bexpression* expr, Location) = 0;

9886

9887

+ // Create an expression for the address of a function. This is used to

9888

+ // get the address of the code for a function.

9889

+ virtual Bexpression*

9890

+ function_code_expression(Bfunction*, Location) = 0;

9891

+

9892

// Statements.

9893

9894

// Create an error statement. This is used for cases which should

9895

@@ -498,6 +503,32 @@

9896

// recover.

9897

virtual Bexpression*

9898

label_address(Blabel*, Location) = 0;

9899

+

9900

+ // Functions.

9901

+

9902

+ // Create an error function. This is used for cases which should

9903

+ // not occur in a correct program, in order to keep the compilation

9904

+ // going without crashing.

9905

+ virtual Bfunction*

9906

+ error_function() = 0;

9907

+

9908

+ // Declare or define a function of FNTYPE.

9909

+ // NAME is the Go name of the function. ASM_NAME, if not the empty string, is

9910

+ // the name that should be used in the symbol table; this will be non-empty if

9911

+ // a magic extern comment is used.

9912

+ // IS_VISIBLE is true if this function should be visible outside of the

9913

+ // current compilation unit. IS_DECLARATION is true if this is a function

9914

+ // declaration rather than a definition; the function definition will be in

9915

+ // another compilation unit.

9916

+ // IS_INLINABLE is true if the function can be inlined.

9917

+ // DISABLE_SPLIT_STACK is true if this function may not split the stack; this

9918

+ // is used for the implementation of recover.

9919

+ // IN_UNIQUE_SECTION is true if this function should be put into a unique

9920

+ // location if possible; this is used for field tracking.

9921

+ virtual Bfunction*

9922

+ function(Btype* fntype, const std::string& name, const std::string& asm_name,

9923

+ bool is_visible, bool is_declaration, bool is_inlinable,

9924

+ bool disable_split_stack, bool in_unique_section, Location) = 0;

9925

};

9926

9927

// The backend interface has to define this function.

9928

@@ -517,5 +548,6 @@

9929

extern tree stat_to_tree(Bstatement*);

9930

extern tree block_to_tree(Bblock*);

9931

extern tree var_to_tree(Bvariable*);

9932

+extern tree function_to_tree(Bfunction*);

9933

9934

#endif // !defined(GO_BACKEND_H)

9935

Index: gcc/go/gofrontend/types.cc

9936

===================================================================

9937

--- a/src/gcc/go/gofrontend/types.cc (.../tags/gcc_4_8_2_release)

9938

+++ b/src/gcc/go/gofrontend/types.cc (.../branches/gcc-4_8-branch)

9939

@@ -3383,6 +3383,68 @@

9940

// Get the backend representation for a function type.

9941

9942

Btype*

9943

+Function_type::get_backend_fntype(Gogo* gogo)

9944

+{

9945

+ if (this->fnbtype_ == NULL)

9946

+ {

9947

+ Backend::Btyped_identifier breceiver;

9948

+ if (this->receiver_ != NULL)

9949

+ {

9950

+ breceiver.name = Gogo::unpack_hidden_name(this->receiver_->name());

9951

+

9952

+ // We always pass the address of the receiver parameter, in

9953

+ // order to make interface calls work with unknown types.

9954

+ Type* rtype = this->receiver_->type();

9955

+ if (rtype->points_to() == NULL)

9956

+ rtype = Type::make_pointer_type(rtype);

9957

+ breceiver.btype = rtype->get_backend(gogo);

9958

+ breceiver.location = this->receiver_->location();

9959

+ }

9960

+

9961

+ std::vector<Backend::Btyped_identifier> bparameters;

9962

+ if (this->parameters_ != NULL)

9963

+ {

9964

+ bparameters.resize(this->parameters_->size());

9965

+ size_t i = 0;

9966

+ for (Typed_identifier_list::const_iterator p =

9967

+ this->parameters_->begin(); p != this->parameters_->end();

9968

+ ++p, ++i)

9969

+ {

9970

+ bparameters[i].name = Gogo::unpack_hidden_name(p->name());

9971

+ bparameters[i].btype = p->type()->get_backend(gogo);

9972

+ bparameters[i].location = p->location();

9973

+ }

9974

+ go_assert(i == bparameters.size());

9975

+ }

9976

+

9977

+ std::vector<Backend::Btyped_identifier> bresults;

9978

+ if (this->results_ != NULL)

9979

+ {

9980

+ bresults.resize(this->results_->size());

9981

+ size_t i = 0;

9982

+ for (Typed_identifier_list::const_iterator p =

9983

+ this->results_->begin(); p != this->results_->end();

9984

+ ++p, ++i)

9985

+ {

9986

+ bresults[i].name = Gogo::unpack_hidden_name(p->name());

9987

+ bresults[i].btype = p->type()->get_backend(gogo);

9988

+ bresults[i].location = p->location();

9989

+ }

9990

+ go_assert(i == bresults.size());

9991

+ }

9992

+

9993

+ this->fnbtype_ = gogo->backend()->function_type(breceiver, bparameters,

9994

+ bresults,

9995

+ this->location());

9996

+

9997

+ }

9998

+

9999

+ return this->fnbtype_;

10000

+}

10001

+

10002

+// Get the backend representation for a Go function type.

10003

+

10004

+Btype*

10005

Function_type::do_get_backend(Gogo* gogo)

10006

{

10007

// When we do anything with a function value other than call it, it

10008

@@ -3395,57 +3457,9 @@

10009

gogo->backend()->placeholder_struct_type("__go_descriptor", loc);

10010

Btype* ptr_struct_type = gogo->backend()->pointer_type(struct_type);

10011

10012

- Backend::Btyped_identifier breceiver;

10013

- if (this->receiver_ != NULL)

10014

- {

10015

- breceiver.name = Gogo::unpack_hidden_name(this->receiver_->name());

10016

-

10017

- // We always pass the address of the receiver parameter, in

10018

- // order to make interface calls work with unknown types.

10019

- Type* rtype = this->receiver_->type();

10020

- if (rtype->points_to() == NULL)

10021

- rtype = Type::make_pointer_type(rtype);

10022

- breceiver.btype = rtype->get_backend(gogo);

10023

- breceiver.location = this->receiver_->location();

10024

- }

10025

-

10026

- std::vector<Backend::Btyped_identifier> bparameters;

10027

- if (this->parameters_ != NULL)

10028

- {

10029

- bparameters.resize(this->parameters_->size());

10030

- size_t i = 0;

10031

- for (Typed_identifier_list::const_iterator p = this->parameters_->begin();

10032

- p != this->parameters_->end();

10033

- ++p, ++i)

10034

- {

10035

- bparameters[i].name = Gogo::unpack_hidden_name(p->name());

10036

- bparameters[i].btype = p->type()->get_backend(gogo);

10037

- bparameters[i].location = p->location();

10038

- }

10039

- go_assert(i == bparameters.size());

10040

- }

10041

-

10042

- std::vector<Backend::Btyped_identifier> bresults;

10043

- if (this->results_ != NULL)

10044

- {

10045

- bresults.resize(this->results_->size());

10046

- size_t i = 0;

10047

- for (Typed_identifier_list::const_iterator p = this->results_->begin();

10048

- p != this->results_->end();

10049

- ++p, ++i)

10050

- {

10051

- bresults[i].name = Gogo::unpack_hidden_name(p->name());

10052

- bresults[i].btype = p->type()->get_backend(gogo);

10053

- bresults[i].location = p->location();

10054

- }

10055

- go_assert(i == bresults.size());

10056

- }

10057

-

10058

- Btype* fntype = gogo->backend()->function_type(breceiver, bparameters,

10059

- bresults, loc);

10060

std::vector<Backend::Btyped_identifier> fields(1);

10061

fields[0].name = "code";

10062

- fields[0].btype = fntype;

10063

+ fields[0].btype = this->get_backend_fntype(gogo);

10064

fields[0].location = loc;

10065

if (!gogo->backend()->set_placeholder_struct_type(struct_type, fields))

10066

return gogo->backend()->error_type();

10067

@@ -4195,7 +4209,8 @@

10068

10069

// This is a horrible hack caused by the fact that we don't pack

10070

// the names of builtin types. FIXME.

10071

- if (nt != NULL

10072

+ if (!this->is_imported_

10073

+ && nt != NULL

10074

&& nt->is_builtin()

10075

&& nt->name() == Gogo::unpack_hidden_name(name))

10076

return true;

10077

@@ -4204,6 +4219,36 @@

10078

}

10079

}

10080

10081

+// Return whether this field is an unexported field named NAME.

10082

+

10083

+bool

10084

+Struct_field::is_unexported_field_name(Gogo* gogo,

10085

+ const std::string& name) const

10086

+{

10087

+ const std::string& field_name(this->field_name());

10088

+ if (Gogo::is_hidden_name(field_name)

10089

+ && name == Gogo::unpack_hidden_name(field_name)

10090

+ && gogo->pack_hidden_name(name, false) != field_name)

10091

+ return true;

10092

+

10093

+ // Check for the name of a builtin type. This is like the test in

10094

+ // is_field_name, only there we return false if this->is_imported_,

10095

+ // and here we return true.

10096

+ if (this->is_imported_ && this->is_anonymous())

10097

+ {

10098

+ Type* t = this->typed_identifier_.type();

10099

+ if (t->points_to() != NULL)

10100

+ t = t->points_to();

10101

+ Named_type* nt = t->named_type();

10102

+ if (nt != NULL

10103

+ && nt->is_builtin()

10104

+ && nt->name() == Gogo::unpack_hidden_name(name))

10105

+ return true;

10106

+ }

10107

+

10108

+ return false;

10109

+}

10110

+

10111

// Return whether this field is an embedded built-in type.

10112

10113

bool

10114

@@ -4264,13 +4309,8 @@

10115

++p)

10116

{

10117

Type* t = p->type();

10118

- if (t->is_undefined())

10119

+ if (p->is_anonymous())

10120

{

10121

- error_at(p->location(), "struct field type is incomplete");

10122

- p->set_type(Type::make_error_type());

10123

- }

10124

- else if (p->is_anonymous())

10125

- {

10126

if (t->named_type() != NULL && t->points_to() != NULL)

10127

{

10128

error_at(p->location(), "embedded type may not be a pointer");

10129

@@ -4641,13 +4681,8 @@

10130

for (Struct_field_list::const_iterator pf = fields->begin();

10131

pf != fields->end();

10132

++pf)

10133

- {

10134

- const std::string& field_name(pf->field_name());

10135

- if (Gogo::is_hidden_name(field_name)

10136

- && name == Gogo::unpack_hidden_name(field_name)

10137

- && gogo->pack_hidden_name(name, false) != field_name)

10138

- return true;

10139

- }

10140

+ if (pf->is_unexported_field_name(gogo, name))

10141

+ return true;

10142

}

10143

return false;

10144

}

10145

@@ -5250,6 +5285,7 @@

10146

Type* ftype = imp->read_type();

10147

10148

Struct_field sf(Typed_identifier(name, ftype, imp->location()));

10149

+ sf.set_is_imported();

10150

10151

if (imp->peek_char() == ' ')

10152

{

10153

@@ -9022,6 +9058,8 @@

10154

fntype->is_varargs(), location);

10155

gogo->finish_function(fntype->location());

10156

10157

+ if (type->named_type() == NULL && stub->is_function())

10158

+ stub->func_value()->set_is_unnamed_type_stub_method();

10159

if (m->nointerface() && stub->is_function())

10160

stub->func_value()->set_nointerface();

10161

}

10162

@@ -9289,7 +9327,9 @@

10163

else

10164

{

10165

bool is_unexported;

10166

- if (!Gogo::is_hidden_name(name))

10167

+ // The test for 'a' and 'z' is to handle builtin names,

10168

+ // which are not hidden.

10169

+ if (!Gogo::is_hidden_name(name) && (name[0] < 'a' || name[0] > 'z'))

10170

is_unexported = false;

10171

else

10172

{

10173

Index: gcc/go/gofrontend/expressions.cc

10174

===================================================================

10175

--- a/src/gcc/go/gofrontend/expressions.cc (.../tags/gcc_4_8_2_release)

10176

+++ b/src/gcc/go/gofrontend/expressions.cc (.../branches/gcc-4_8-branch)

10177

@@ -1219,7 +1219,7 @@

10178

10179

// Get the tree for the code of a function expression.

10180

10181

-tree

10182

+Bexpression*

10183

Func_expression::get_code_pointer(Gogo* gogo, Named_object* no, Location loc)

10184

{

10185

Function_type* fntype;

10186

@@ -1237,25 +1237,18 @@

10187

error_at(loc,

10188

"invalid use of special builtin function %qs; must be called",

10189

no->message_name().c_str());

10190

- return error_mark_node;

10191

+ return gogo->backend()->error_expression();

10192

}

10193

10194

- tree id = no->get_id(gogo);

10195

- if (id == error_mark_node)

10196

- return error_mark_node;

10197

-

10198

- tree fndecl;

10199

+ Bfunction* fndecl;

10200

if (no->is_function())

10201

- fndecl = no->func_value()->get_or_make_decl(gogo, no, id);

10202

+ fndecl = no->func_value()->get_or_make_decl(gogo, no);

10203

else if (no->is_function_declaration())

10204

- fndecl = no->func_declaration_value()->get_or_make_decl(gogo, no, id);

10205

+ fndecl = no->func_declaration_value()->get_or_make_decl(gogo, no);

10206

else

10207

go_unreachable();

10208

10209

- if (fndecl == error_mark_node)

10210

- return error_mark_node;

10211

-

10212

- return build_fold_addr_expr_loc(loc.gcc_location(), fndecl);

10213

+ return gogo->backend()->function_code_expression(fndecl, loc);

10214

}

10215

10216

// Get the tree for a function expression. This is used when we take

10217

@@ -1492,8 +1485,10 @@

10218

tree

10219

Func_code_reference_expression::do_get_tree(Translate_context* context)

10220

{

10221

- return Func_expression::get_code_pointer(context->gogo(), this->function_,

10222

- this->location());

10223

+ Bexpression* ret =

10224

+ Func_expression::get_code_pointer(context->gogo(), this->function_,

10225

+ this->location());

10226

+ return expr_to_tree(ret);

10227

}

10228

10229

// Make a reference to the code of a function.

10230

@@ -3055,8 +3050,7 @@

10231

do_lower(Gogo*, Named_object*, Statement_inserter*, int);

10232

10233

bool

10234

- do_is_constant() const

10235

- { return this->expr_->is_constant(); }

10236

+ do_is_constant() const;

10237

10238

bool

10239

do_numeric_constant_value(Numeric_constant*) const;

10240

@@ -3198,6 +3192,27 @@

10241

return this;

10242

}

10243

10244

+// Return whether a type conversion is a constant.

10245

+

10246

+bool

10247

+Type_conversion_expression::do_is_constant() const

10248

+{

10249

+ if (!this->expr_->is_constant())

10250

+ return false;

10251

+

10252

+ // A conversion to a type that may not be used as a constant is not

10253

+ // a constant. For example, []byte(nil).

10254

+ Type* type = this->type_;

10255

+ if (type->integer_type() == NULL

10256

+ && type->float_type() == NULL

10257

+ && type->complex_type() == NULL

10258

+ && !type->is_boolean_type()

10259

+ && !type->is_string_type())

10260

+ return false;

10261

+

10262

+ return true;

10263

+}

10264

+

10265

// Return the constant numeric value if there is one.

10266

10267

bool

10268

@@ -5586,6 +5601,15 @@

10269

subcontext.type = NULL;

10270

}

10271

10272

+ if (this->op_ == OPERATOR_ANDAND || this->op_ == OPERATOR_OROR)

10273

+ {

10274

+ // For a logical operation, the context does not determine the

10275

+ // types of the operands. The operands must be some boolean

10276

+ // type but if the context has a boolean type they do not

10277

+ // inherit it. See http://golang.org/issue/3924.

10278

+ subcontext.type = NULL;

10279

+ }

10280

+

10281

// Set the context for the left hand operand.

10282

if (is_shift_op)

10283

{

10284

@@ -5967,6 +5991,43 @@

10285

right);

10286

}

10287

10288

+ // For complex division Go wants slightly different results than the

10289

+ // GCC library provides, so we have our own runtime routine.

10290

+ if (this->op_ == OPERATOR_DIV && this->left_->type()->complex_type() != NULL)

10291

+ {

10292

+ const char *name;

10293

+ tree *pdecl;

10294

+ Type* ctype;

10295

+ static tree complex64_div_decl;

10296

+ static tree complex128_div_decl;

10297

+ switch (this->left_->type()->complex_type()->bits())

10298

+ {

10299

+ case 64:

10300

+ name = "__go_complex64_div";

10301

+ pdecl = &complex64_div_decl;

10302

+ ctype = Type::lookup_complex_type("complex64");

10303

+ break;

10304

+ case 128:

10305

+ name = "__go_complex128_div";

10306

+ pdecl = &complex128_div_decl;

10307

+ ctype = Type::lookup_complex_type("complex128");

10308

+ break;

10309

+ default:

10310

+ go_unreachable();

10311

+ }

10312

+ Btype* cbtype = ctype->get_backend(gogo);

10313

+ tree ctype_tree = type_to_tree(cbtype);

10314

+ return Gogo::call_builtin(pdecl,

10315

+ this->location(),

10316

+ name,

10317

+ 2,

10318

+ ctype_tree,

10319

+ ctype_tree,

10320

+ fold_convert_loc(gccloc, ctype_tree, left),

10321

+ type,

10322

+ fold_convert_loc(gccloc, ctype_tree, right));

10323

+ }

10324

+

10325

tree compute_type = excess_precision_type(type);

10326

if (compute_type != NULL_TREE)

10327

{

10328

@@ -7191,6 +7252,15 @@

10329

if (this->code_ == BUILTIN_OFFSETOF)

10330

{

10331

Expression* arg = this->one_arg();

10332

+

10333

+ if (arg->bound_method_expression() != NULL

10334

+ || arg->interface_field_reference_expression() != NULL)

10335

+ {

10336

+ this->report_error(_("invalid use of method value as argument "

10337

+ "of Offsetof"));

10338

+ return this;

10339

+ }

10340

+

10341

Field_reference_expression* farg = arg->field_reference_expression();

10342

while (farg != NULL)

10343

{

10344

@@ -7200,7 +7270,8 @@

10345

// it must not be reached through pointer indirections.

10346

if (farg->expr()->deref() != farg->expr())

10347

{

10348

- this->report_error(_("argument of Offsetof implies indirection of an embedded field"));

10349

+ this->report_error(_("argument of Offsetof implies "

10350

+ "indirection of an embedded field"));

10351

return this;

10352

}

10353

// Go up until we reach the original base.

10354

@@ -7476,7 +7547,7 @@

10355

switch (nc.to_unsigned_long(&v))

10356

{

10357

case Numeric_constant::NC_UL_VALID:

10358

- return true;

10359

+ break;

10360

case Numeric_constant::NC_UL_NOTINT:

10361

error_at(e->location(), "non-integer %s argument to make",

10362

is_length ? "len" : "cap");

10363

@@ -7488,8 +7559,23 @@

10364

case Numeric_constant::NC_UL_BIG:

10365

// We don't want to give a compile-time error for a 64-bit

10366

// value on a 32-bit target.

10367

- return true;

10368

+ break;

10369

}

10370

+

10371

+ mpz_t val;

10372

+ if (!nc.to_int(&val))

10373

+ go_unreachable();

10374

+ int bits = mpz_sizeinbase(val, 2);

10375

+ mpz_clear(val);

10376

+ Type* int_type = Type::lookup_integer_type("int");

10377

+ if (bits >= int_type->integer_type()->bits())

10378

+ {

10379

+ error_at(e->location(), "%s argument too large for make",

10380

+ is_length ? "len" : "cap");

10381

+ return false;

10382

+ }

10383

+

10384

+ return true;

10385

}

10386

10387

if (e->type()->integer_type() != NULL)

10388

@@ -7595,6 +7681,8 @@

10389

bool

10390

Builtin_call_expression::do_is_constant() const

10391

{

10392

+ if (this->is_error_expression())

10393

+ return true;

10394

switch (this->code_)

10395

{

10396

case BUILTIN_LEN:

10397

@@ -9744,15 +9832,9 @@

10398

}

10399

10400

tree fntype_tree = type_to_tree(fntype->get_backend(gogo));

10401

- if (fntype_tree == error_mark_node)

10402

+ tree fnfield_type = type_to_tree(fntype->get_backend_fntype(gogo));

10403

+ if (fntype_tree == error_mark_node || fnfield_type == error_mark_node)

10404

return error_mark_node;

10405

- go_assert(POINTER_TYPE_P(fntype_tree));

10406

- if (TREE_TYPE(fntype_tree) == error_mark_node)

10407

- return error_mark_node;

10408

- go_assert(TREE_CODE(TREE_TYPE(fntype_tree)) == RECORD_TYPE);

10409

- tree fnfield_type = TREE_TYPE(TYPE_FIELDS(TREE_TYPE(fntype_tree)));

10410

- if (fnfield_type == error_mark_node)

10411

- return error_mark_node;

10412

go_assert(FUNCTION_POINTER_TYPE_P(fnfield_type));

10413

tree rettype = TREE_TYPE(TREE_TYPE(fnfield_type));

10414

if (rettype == error_mark_node)

10415

@@ -9763,7 +9845,7 @@

10416

if (func != NULL)

10417

{

10418

Named_object* no = func->named_object();

10419

- fn = Func_expression::get_code_pointer(gogo, no, location);

10420

+ fn = expr_to_tree(Func_expression::get_code_pointer(gogo, no, location));

10421

if (!has_closure)

10422

closure_tree = NULL_TREE;

10423

else

10424

@@ -10817,11 +10899,20 @@

10425

void

10426

String_index_expression::do_check_types(Gogo*)

10427

{

10428

- if (this->start_->type()->integer_type() == NULL)

10429

+ Numeric_constant nc;

10430

+ unsigned long v;

10431

+ if (this->start_->type()->integer_type() == NULL

10432

+ && !this->start_->type()->is_error()

10433

+ && (!this->start_->numeric_constant_value(&nc)

10434

+ || nc.to_unsigned_long(&v) == Numeric_constant::NC_UL_NOTINT))

10435

this->report_error(_("index must be integer"));

10436

if (this->end_ != NULL

10437

&& this->end_->type()->integer_type() == NULL

10438

- && !this->end_->is_nil_expression())

10439

+ && !this->end_->type()->is_error()

10440

+ && !this->end_->is_nil_expression()

10441

+ && !this->end_->is_error_expression()

10442

+ && (!this->end_->numeric_constant_value(&nc)

10443

+ || nc.to_unsigned_long(&v) == Numeric_constant::NC_UL_NOTINT))

10444

this->report_error(_("slice end must be integer"));

10445

10446

std::string sval;

10447

Index: gcc/recog.c

10448

===================================================================

10449

--- a/src/gcc/recog.c (.../tags/gcc_4_8_2_release)

10450

+++ b/src/gcc/recog.c (.../branches/gcc-4_8-branch)

10451

@@ -3061,6 +3061,9 @@

10452

return 1;

10453

}

10454

10455

+/* Regno offset to be used in the register search. */

10456

+static int search_ofs;

10457

+

10458

/* Try to find a hard register of mode MODE, matching the register class in

10459

CLASS_STR, which is available at the beginning of insn CURRENT_INSN and

10460

remains available until the end of LAST_INSN. LAST_INSN may be NULL_RTX,

10461

@@ -3076,7 +3079,6 @@

10462

peep2_find_free_register (int from, int to, const char *class_str,

10463

enum machine_mode mode, HARD_REG_SET *reg_set)

10464

{

10465

- static int search_ofs;

10466

enum reg_class cl;

10467

HARD_REG_SET live;

10468

df_ref *def_rec;

10469

@@ -3541,6 +3543,7 @@

10470

/* Initialize the regsets we're going to use. */

10471

for (i = 0; i < MAX_INSNS_PER_PEEP2 + 1; ++i)

10472

peep2_insn_data[i].live_before = BITMAP_ALLOC (&reg_obstack);

10473

+ search_ofs = 0;

10474

live = BITMAP_ALLOC (&reg_obstack);

10475

10476

FOR_EACH_BB_REVERSE (bb)

10477

Index: gcc/ada/ChangeLog

10478

===================================================================

10479

--- a/src/gcc/ada/ChangeLog (.../tags/gcc_4_8_2_release)

10480

+++ b/src/gcc/ada/ChangeLog (.../branches/gcc-4_8-branch)

10481

@@ -1,3 +1,15 @@

10482

+2013-10-19 Eric Botcazou <ebotcazou@adacore.com>

10483

+

10484

+ * gcc-interface/utils.c (scale_by_factor_of): New function.

10485

+ (rest_of_record_type_compilation): Use scale_by_factor_of in order to

10486

+ scale the original offset for both rounding cases; in the second case,

10487

+ take into accout the addend to compute the alignment. Tidy up.

10488

+

10489

+2013-10-19 Eric Botcazou <ebotcazou@adacore.com>

10490

+

10491

+ * gcc-interface/utils.c (gnat_set_type_context): New function.

10492

+ (gnat_pushdecl): Use it to set the context of the type.

10493

+

10494

2013-10-16 Release Manager

10495

10496

* GCC 4.8.2 released.

10497

Index: gcc/ada/gcc-interface/utils.c

10498

===================================================================

10499

--- a/src/gcc/ada/gcc-interface/utils.c (.../tags/gcc_4_8_2_release)

10500

+++ b/src/gcc/ada/gcc-interface/utils.c (.../branches/gcc-4_8-branch)

10501

@@ -232,6 +232,7 @@

10502

static tree split_plus (tree, tree *);

10503

static tree float_type_for_precision (int, enum machine_mode);

10504

static tree convert_to_fat_pointer (tree, tree);

10505

+static unsigned int scale_by_factor_of (tree, unsigned int);

10506

static bool potential_alignment_gap (tree, tree, tree);

10507

static void process_attributes (tree, struct attrib *);

10508

10509

@@ -532,6 +533,22 @@

10510

free_binding_level = level;

10511

}

10512

10513

+/* Set the context of TYPE and its parallel types (if any) to CONTEXT. */

10514

+

10515

+static void

10516

+gnat_set_type_context (tree type, tree context)

10517

+{

10518

+ tree decl = TYPE_STUB_DECL (type);

10519

+

10520

+ TYPE_CONTEXT (type) = context;

10521

+

10522

+ while (decl && DECL_PARALLEL_TYPE (decl))

10523

+ {

10524

+ TYPE_CONTEXT (DECL_PARALLEL_TYPE (decl)) = context;

10525

+ decl = TYPE_STUB_DECL (DECL_PARALLEL_TYPE (decl));

10526

+ }

10527

+}

10528

+

10529

/* Record DECL as belonging to the current lexical scope and use GNAT_NODE

10530

for location information and flag propagation. */

10531

10532

@@ -613,7 +630,7 @@

10533

if (TREE_CODE (t) == POINTER_TYPE)

10534

TYPE_NEXT_PTR_TO (t) = tt;

10535

TYPE_NAME (tt) = DECL_NAME (decl);

10536

- TYPE_CONTEXT (tt) = DECL_CONTEXT (decl);

10537

+ gnat_set_type_context (tt, DECL_CONTEXT (decl));

10538

TYPE_STUB_DECL (tt) = TYPE_STUB_DECL (t);

10539

DECL_ORIGINAL_TYPE (decl) = tt;

10540

}

10541

@@ -623,7 +640,7 @@

10542

/* We need a variant for the placeholder machinery to work. */

10543

tree tt = build_variant_type_copy (t);

10544

TYPE_NAME (tt) = decl;

10545

- TYPE_CONTEXT (tt) = DECL_CONTEXT (decl);

10546

+ gnat_set_type_context (tt, DECL_CONTEXT (decl));

10547

TREE_USED (tt) = TREE_USED (t);

10548

TREE_TYPE (decl) = tt;

10549

if (DECL_ORIGINAL_TYPE (TYPE_NAME (t)))

10550

@@ -645,7 +662,7 @@

10551

if (!(TYPE_NAME (t) && TREE_CODE (TYPE_NAME (t)) == TYPE_DECL))

10552

{

10553

TYPE_NAME (t) = decl;

10554

- TYPE_CONTEXT (t) = DECL_CONTEXT (decl);

10555

+ gnat_set_type_context (t, DECL_CONTEXT (decl));

10556

}

10557

}

10558

}

10559

@@ -1692,93 +1709,74 @@

10560

TYPE_SIZE_UNIT (new_record_type)

10561

= size_int (TYPE_ALIGN (record_type) / BITS_PER_UNIT);

10562

10563

- /* Now scan all the fields, replacing each field with a new

10564

- field corresponding to the new encoding. */

10565

+ /* Now scan all the fields, replacing each field with a new field

10566

+ corresponding to the new encoding. */

10567

for (old_field = TYPE_FIELDS (record_type); old_field;

10568

old_field = DECL_CHAIN (old_field))

10569

{

10570

tree field_type = TREE_TYPE (old_field);

10571

tree field_name = DECL_NAME (old_field);

10572

- tree new_field;

10573

tree curpos = bit_position (old_field);

10574

+ tree pos, new_field;

10575

bool var = false;

10576

unsigned int align = 0;

10577

- tree pos;

10578

10579

+ /* We're going to do some pattern matching below so remove as many

10580

+ conversions as possible. */

10581

+ curpos = remove_conversions (curpos, true);

10582

+

10583

/* See how the position was modified from the last position.

10584

10585

- There are two basic cases we support: a value was added

10586

- to the last position or the last position was rounded to

10587

- a boundary and they something was added. Check for the

10588

- first case first. If not, see if there is any evidence

10589

- of rounding. If so, round the last position and try

10590

- again.

10591

+ There are two basic cases we support: a value was added

10592

+ to the last position or the last position was rounded to

10593

+ a boundary and they something was added. Check for the

10594

+ first case first. If not, see if there is any evidence

10595

+ of rounding. If so, round the last position and retry.

10596

10597

- If this is a union, the position can be taken as zero. */

10598

-

10599

- /* Some computations depend on the shape of the position expression,

10600

- so strip conversions to make sure it's exposed. */

10601

- curpos = remove_conversions (curpos, true);

10602

-

10603

+ If this is a union, the position can be taken as zero. */

10604

if (TREE_CODE (new_record_type) == UNION_TYPE)

10605

- pos = bitsize_zero_node, align = 0;

10606

+ pos = bitsize_zero_node;

10607

else

10608

pos = compute_related_constant (curpos, last_pos);

10609

10610

- if (!pos && TREE_CODE (curpos) == MULT_EXPR

10611

+ if (!pos

10612

+ && TREE_CODE (curpos) == MULT_EXPR

10613

&& host_integerp (TREE_OPERAND (curpos, 1), 1))

10614

{

10615

tree offset = TREE_OPERAND (curpos, 0);

10616

align = tree_low_cst (TREE_OPERAND (curpos, 1), 1);

10617

-

10618

- /* An offset which is a bitwise AND with a mask increases the

10619

- alignment according to the number of trailing zeros. */

10620

- offset = remove_conversions (offset, true);

10621

- if (TREE_CODE (offset) == BIT_AND_EXPR

10622

- && TREE_CODE (TREE_OPERAND (offset, 1)) == INTEGER_CST)

10623

- {

10624

- unsigned HOST_WIDE_INT mask

10625

- = TREE_INT_CST_LOW (TREE_OPERAND (offset, 1));

10626

- unsigned int i;

10627

-

10628

- for (i = 0; i < HOST_BITS_PER_WIDE_INT; i++)

10629

- {

10630

- if (mask & 1)

10631

- break;

10632

- mask >>= 1;

10633

- align *= 2;

10634

- }

10635

- }

10636

-

10637

- pos = compute_related_constant (curpos,

10638

- round_up (last_pos, align));

10639

+ align = scale_by_factor_of (offset, align);

10640

+ last_pos = round_up (last_pos, align);

10641

+ pos = compute_related_constant (curpos, last_pos);

10642

}

10643

- else if (!pos && TREE_CODE (curpos) == PLUS_EXPR

10644

- && TREE_CODE (TREE_OPERAND (curpos, 1)) == INTEGER_CST

10645

+ else if (!pos

10646

+ && TREE_CODE (curpos) == PLUS_EXPR

10647

+ && host_integerp (TREE_OPERAND (curpos, 1), 1)

10648

&& TREE_CODE (TREE_OPERAND (curpos, 0)) == MULT_EXPR

10649

- && host_integerp (TREE_OPERAND

10650

- (TREE_OPERAND (curpos, 0), 1),

10651

- 1))

10652

+ && host_integerp

10653

+ (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1))

10654

{

10655

+ tree offset = TREE_OPERAND (TREE_OPERAND (curpos, 0), 0);

10656

+ unsigned HOST_WIDE_INT addend

10657

+ = tree_low_cst (TREE_OPERAND (curpos, 1), 1);

10658

align

10659

- = tree_low_cst

10660

- (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1);

10661

- pos = compute_related_constant (curpos,

10662

- round_up (last_pos, align));

10663

+ = tree_low_cst (TREE_OPERAND (TREE_OPERAND (curpos, 0), 1), 1);

10664

+ align = scale_by_factor_of (offset, align);

10665

+ align = MIN (align, addend & -addend);

10666

+ last_pos = round_up (last_pos, align);

10667

+ pos = compute_related_constant (curpos, last_pos);

10668

}

10669

- else if (potential_alignment_gap (prev_old_field, old_field,

10670

- pos))

10671

+ else if (potential_alignment_gap (prev_old_field, old_field, pos))

10672

{

10673

align = TYPE_ALIGN (field_type);

10674

- pos = compute_related_constant (curpos,

10675

- round_up (last_pos, align));

10676

+ last_pos = round_up (last_pos, align);

10677

+ pos = compute_related_constant (curpos, last_pos);

10678

}

10679

10680

/* If we can't compute a position, set it to zero.

10681

10682

- ??? We really should abort here, but it's too much work

10683

- to get this correct for all cases. */

10684

-

10685

+ ??? We really should abort here, but it's too much work

10686

+ to get this correct for all cases. */

10687

if (!pos)

10688

pos = bitsize_zero_node;

10689

10690

@@ -2553,6 +2551,32 @@

10691

return false;

10692

}

10693

10694

+/* Return VALUE scaled by the biggest power-of-2 factor of EXPR. */

10695

+

10696

+static unsigned int

10697

+scale_by_factor_of (tree expr, unsigned int value)

10698

+{

10699

+ expr = remove_conversions (expr, true);

10700

+

10701

+ /* An expression which is a bitwise AND with a mask has a power-of-2 factor

10702

+ corresponding to the number of trailing zeros of the mask. */

10703

+ if (TREE_CODE (expr) == BIT_AND_EXPR

10704

+ && TREE_CODE (TREE_OPERAND (expr, 1)) == INTEGER_CST)

10705

+ {

10706

+ unsigned HOST_WIDE_INT mask = TREE_INT_CST_LOW (TREE_OPERAND (expr, 1));

10707

+ unsigned int i = 0;

10708

+

10709

+ while ((mask & 1) == 0 && i < HOST_BITS_PER_WIDE_INT)

10710

+ {

10711

+ mask >>= 1;

10712

+ value *= 2;

10713

+ i++;

10714

+ }

10715

+ }

10716

+

10717

+ return value;

10718

+}

10719

+

10720

/* Given two consecutive field decls PREV_FIELD and CURR_FIELD, return true

10721

unless we can prove these 2 fields are laid out in such a way that no gap

10722

exist between the end of PREV_FIELD and the beginning of CURR_FIELD. OFFSET

10723

Index: gcc/fortran/interface.c

10724

===================================================================

10725

--- a/src/gcc/fortran/interface.c (.../tags/gcc_4_8_2_release)

10726

+++ b/src/gcc/fortran/interface.c (.../branches/gcc-4_8-branch)

10727

@@ -1245,7 +1245,8 @@

10728

return FAILURE;

10729

}

10730

10731

- if (r1->ts.u.cl->length)

10732

+ if (s1->ts.u.cl && s1->ts.u.cl->length

10733

+ && s2->ts.u.cl && s2->ts.u.cl->length)

10734

{

10735

int compval = gfc_dep_compare_expr (r1->ts.u.cl->length,

10736

r2->ts.u.cl->length);

10737

@@ -1367,8 +1368,8 @@

10738

if (s1->attr.function && s2->attr.function)

10739

{

10740

/* If both are functions, check result characteristics. */

10741

- if (check_result_characteristics (s1, s2, errmsg, err_len)

10742

- == FAILURE)

10743

+ if (check_result_characteristics (s1, s2, errmsg, err_len) == FAILURE

10744

+ || check_result_characteristics (s2, s1, errmsg, err_len) == FAILURE)

10745

return 0;

10746

}

10747

10748

Index: gcc/fortran/decl.c

10749

===================================================================

10750

--- a/src/gcc/fortran/decl.c (.../tags/gcc_4_8_2_release)

10751

+++ b/src/gcc/fortran/decl.c (.../branches/gcc-4_8-branch)

10752

@@ -7384,6 +7384,7 @@

10753

10754

10755

/* Check a derived type that is being extended. */

10756

+

10757

static gfc_symbol*

10758

check_extended_derived_type (char *name)

10759

{

10760

@@ -7395,14 +7396,15 @@

10761

return NULL;

10762

}

10763

10764

+ extended = gfc_find_dt_in_generic (extended);

10765

+

10766

+ /* F08:C428. */

10767

if (!extended)

10768

{

10769

- gfc_error ("No such symbol in TYPE definition at %C");

10770

+ gfc_error ("Symbol '%s' at %C has not been previously defined", name);

10771

return NULL;

10772

}

10773

10774

- extended = gfc_find_dt_in_generic (extended);

10775

-

10776

if (extended->attr.flavor != FL_DERIVED)

10777

{

10778

gfc_error ("'%s' in EXTENDS expression at %C is not a "

10779

Index: gcc/fortran/ChangeLog

10780

===================================================================

10781

--- a/src/gcc/fortran/ChangeLog (.../tags/gcc_4_8_2_release)

10782

+++ b/src/gcc/fortran/ChangeLog (.../branches/gcc-4_8-branch)

10783

@@ -1,3 +1,43 @@

10784

+2013-11-17 Janus Weil <janus@gcc.gnu.org>

10785

+

10786

+ Backport from mainline

10787

+ 2013-11-07 Janus Weil <janus@gcc.gnu.org>

10788

+

10789

+ PR fortran/58471

10790

+ * primary.c (gfc_expr_attr): Check for result symbol.

10791

+

10792

+2013-11-16 Janus Weil <janus@gcc.gnu.org>

10793

+

10794

+ Backport from mainline

10795

+ 2013-09-20 Janus Weil <janus@gcc.gnu.org>

10796

+

10797

+ PR fortran/58099

10798

+ * expr.c (gfc_check_pointer_assign): Remove second call to

10799

+ 'gfc_compare_interfaces' with swapped arguments.

10800

+ * interface.c (gfc_compare_interfaces): Symmetrize the call to

10801

+ 'check_result_characteristics' by calling it with swapped arguments.

10802

+

10803

+2013-11-16 Paul Thomas <pault@gcc.gnu.org>

10804

+

10805

+ PR fortran/58771

10806

+ * trans-io.c (transfer_expr): If the backend_decl for a derived

10807

+ type is missing, build it with gfc_typenode_for_spec.

10808

+

10809

+2013-11-05 Steven G. Kargl <kargl@gcc.gnu.org>

10810

+

10811

+ PR fortran/58989

10812

+ * check.c (gfc_check_reshape): ensure that shape is a constant

10813

+ expression.

10814

+

10815

+2013-11-02 Janus Weil <janus@gcc.gnu.org>

10816

+

10817

+ Backport from mainline

10818

+ 2013-09-23 Janus Weil <janus@gcc.gnu.org>

10819

+

10820

+ PR fortran/58355

10821

+ * decl.c (check_extended_derived_type): Prevent segfault, modify error

10822

+ message.

10823

+

10824

2013-10-16 Release Manager

10825

10826

* GCC 4.8.2 released.

10827

Index: gcc/fortran/expr.c

10828

===================================================================

10829

--- a/src/gcc/fortran/expr.c (.../tags/gcc_4_8_2_release)

10830

+++ b/src/gcc/fortran/expr.c (.../branches/gcc-4_8-branch)

10831

@@ -3555,14 +3555,6 @@

10832

return FAILURE;

10833

}

10834

10835

- if (!gfc_compare_interfaces (s2, s1, name, 0, 1,

10836

- err, sizeof(err), NULL, NULL))

10837

- {

10838

- gfc_error ("Interface mismatch in procedure pointer assignment "

10839

- "at %L: %s", &rvalue->where, err);

10840

- return FAILURE;

10841

- }

10842

-

10843

return SUCCESS;

10844

}

10845

10846

Index: gcc/fortran/trans-io.c

10847

===================================================================

10848

--- a/src/gcc/fortran/trans-io.c (.../tags/gcc_4_8_2_release)

10849

+++ b/src/gcc/fortran/trans-io.c (.../branches/gcc-4_8-branch)

10850

@@ -243,16 +243,16 @@

10851

10852

/* The code to generate the error. */

10853

gfc_start_block (&block);

10854

-

10855

+

10856

arg1 = gfc_build_addr_expr (NULL_TREE, var);

10857

-

10858

+

10859

arg2 = build_int_cst (integer_type_node, error_code),

10860

-

10861

+

10862

asprintf (&message, "%s", _(msgid));

10863

arg3 = gfc_build_addr_expr (pchar_type_node,

10864

gfc_build_localized_cstring_const (message));

10865

free (message);

10866

-

10867

+

10868

tmp = build_call_expr_loc (input_location,

10869

gfor_fndecl_generate_error, 3, arg1, arg2, arg3);

10870

10871

@@ -521,7 +521,7 @@

10872

gfc_trans_io_runtime_check (cond, var, LIBERROR_BAD_UNIT,

10873

"Unit number in I/O statement too small",

10874

&se.pre);

10875

-

10876

+

10877

/* UNIT numbers should be less than the max. */

10878

val = gfc_conv_mpz_to_tree (gfc_integer_kinds[i].huge, 4);

10879

cond = fold_build2_loc (input_location, GT_EXPR, boolean_type_node,

10880

@@ -1000,7 +1000,7 @@

10881

if (p->convert)

10882

mask |= set_string (&block, &post_block, var, IOPARM_open_convert,

10883

p->convert);

10884

-

10885

+

10886

if (p->newunit)

10887

mask |= set_parameter_ref (&block, &post_block, var, IOPARM_open_newunit,

10888

p->newunit);

10889

@@ -1234,7 +1234,7 @@

10890

{

10891

mask |= set_parameter_ref (&block, &post_block, var, IOPARM_inquire_exist,

10892

p->exist);

10893

-

10894

+

10895

if (p->unit && !p->iostat)

10896

{

10897

p->iostat = create_dummy_iostat ();

10898

@@ -1322,7 +1322,7 @@

10899

if (p->pad)

10900

mask |= set_string (&block, &post_block, var, IOPARM_inquire_pad,

10901

p->pad);

10902

-

10903

+

10904

if (p->convert)

10905

mask |= set_string (&block, &post_block, var, IOPARM_inquire_convert,

10906

p->convert);

10907

@@ -1547,7 +1547,7 @@

10908

tree dtype;

10909

tree dt_parm_addr;

10910

tree decl = NULL_TREE;

10911

- int n_dim;

10912

+ int n_dim;

10913

int itype;

10914

int rank = 0;

10915

10916

@@ -2032,7 +2032,7 @@

10917

if (gfc_notification_std (GFC_STD_GNU) != SILENT)

10918

{

10919

gfc_error_now ("Derived type '%s' at %L has PRIVATE components",

10920

- ts->u.derived->name, code != NULL ? &(code->loc) :

10921

+ ts->u.derived->name, code != NULL ? &(code->loc) :

10922

&gfc_current_locus);

10923

return;

10924

}

10925

@@ -2041,7 +2041,7 @@

10926

ts->kind = ts->u.derived->ts.kind;

10927

ts->f90_type = ts->u.derived->ts.f90_type;

10928

}

10929

-

10930

+

10931

kind = ts->kind;

10932

function = NULL;

10933

arg2 = NULL;

10934

@@ -2123,7 +2123,7 @@

10935

function = iocall[IOCALL_X_CHARACTER_WIDE];

10936

else

10937

function = iocall[IOCALL_X_CHARACTER_WIDE_WRITE];

10938

-

10939

+

10940

tmp = gfc_build_addr_expr (NULL_TREE, dt_parm);

10941

tmp = build_call_expr_loc (input_location,

10942

function, 4, tmp, addr_expr, arg2, arg3);

10943

@@ -2158,6 +2158,12 @@

10944

expr = build_fold_indirect_ref_loc (input_location,

10945

expr);

10946

10947

+ /* Make sure that the derived type has been built. An external

10948

+ function, if only referenced in an io statement requires this

10949

+ check (see PR58771). */

10950

+ if (ts->u.derived->backend_decl == NULL_TREE)

10951

+ tmp = gfc_typenode_for_spec (ts);

10952

+

10953

for (c = ts->u.derived->components; c; c = c->next)

10954

{

10955

field = c->backend_decl;

10956

Index: gcc/fortran/check.c

10957

===================================================================

10958

--- a/src/gcc/fortran/check.c (.../tags/gcc_4_8_2_release)

10959

+++ b/src/gcc/fortran/check.c (.../branches/gcc-4_8-branch)

10960

@@ -3208,7 +3208,7 @@

10961

"than %d elements", &shape->where, GFC_MAX_DIMENSIONS);

10962

return FAILURE;

10963

}

10964

- else if (shape->expr_type == EXPR_ARRAY)

10965

+ else if (shape->expr_type == EXPR_ARRAY && gfc_is_constant_expr (shape))

10966

{

10967

gfc_expr *e;

10968

int i, extent;

10969

Index: gcc/fortran/primary.c

10970

===================================================================

10971

--- a/src/gcc/fortran/primary.c (.../tags/gcc_4_8_2_release)

10972

+++ b/src/gcc/fortran/primary.c (.../branches/gcc-4_8-branch)

10973

@@ -2252,7 +2252,7 @@

10974

case EXPR_FUNCTION:

10975

gfc_clear_attr (&attr);

10976

10977

- if (e->value.function.esym != NULL)

10978

+ if (e->value.function.esym && e->value.function.esym->result)

10979

{

10980

gfc_symbol *sym = e->value.function.esym->result;

10981

attr = sym->attr;

10982

Index: gcc/configure.ac

10983

===================================================================

10984

--- a/src/gcc/configure.ac (.../tags/gcc_4_8_2_release)

10985

+++ b/src/gcc/configure.ac (.../branches/gcc-4_8-branch)

10986

@@ -3611,6 +3611,19 @@

10987

kasumi_fi_xor %f46, %f48, %f50, %f52],,

10988

[AC_DEFINE(HAVE_AS_SPARC4, 1,

10989

[Define if your assembler supports SPARC4 instructions.])])

10990

+

10991

+ gcc_GAS_CHECK_FEATURE([LEON instructions],

10992

+ gcc_cv_as_sparc_leon,,

10993

+ [-Aleon],

10994

+ [.text

10995

+ .register %g2, #scratch

10996

+ .register %g3, #scratch

10997

+ .align 4

10998

+ smac %g2, %g3, %g1

10999

+ umac %g2, %g3, %g1

11000

+ cas [[%g2]], %g3, %g1],,

11001

+ [AC_DEFINE(HAVE_AS_LEON, 1,

11002

+ [Define if your assembler supports LEON instructions.])])

11003

;;

11004

11005

changequote(,)dnl

11006

@@ -5193,15 +5206,15 @@

11007

AC_MSG_CHECKING([for exported symbols])

11008

if test "x$export_sym_check" != x; then

11009

echo "int main() {return 0;} int foobar() {return 0;}" > conftest.c

11010

- ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest > /dev/null 2>&1

11011

- if $export_sym_check conftest | grep foobar > /dev/null; then

11012

+ ${CC} ${CFLAGS} ${LDFLAGS} conftest.c -o conftest$ac_exeext > /dev/null 2>&1

11013

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

11014

: # No need to use a flag

11015

AC_MSG_RESULT([yes])

11016

else

11017

AC_MSG_RESULT([yes])

11018

AC_MSG_CHECKING([for -rdynamic])

11019

- ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest > /dev/null 2>&1

11020

- if $export_sym_check conftest | grep foobar > /dev/null; then

11021

+ ${CC} ${CFLAGS} ${LDFLAGS} -rdynamic conftest.c -o conftest$ac_exeext > /dev/null 2>&1

11022

+ if $export_sym_check conftest$ac_exeext | grep -q foobar > /dev/null; then

11023

plugin_rdynamic=yes

11024

pluginlibs="-rdynamic"

11025

else

11026

Index: gcc/print-rtl.c

11027

===================================================================

11028

--- a/src/gcc/print-rtl.c (.../tags/gcc_4_8_2_release)

11029

+++ b/src/gcc/print-rtl.c (.../branches/gcc-4_8-branch)

11030

@@ -582,6 +582,8 @@

11031

11032

if (MEM_EXPR (in_rtx))

11033

print_mem_expr (outfile, MEM_EXPR (in_rtx));

11034

+ else

11035

+ fputc (' ', outfile);

11036

11037

if (MEM_OFFSET_KNOWN_P (in_rtx))

11038

fprintf (outfile, "+" HOST_WIDE_INT_PRINT_DEC, MEM_OFFSET (in_rtx));

11039

Index: gcc/alias.c

11040

===================================================================

11041

--- a/src/gcc/alias.c (.../tags/gcc_4_8_2_release)

11042

+++ b/src/gcc/alias.c (.../branches/gcc-4_8-branch)

11043

@@ -2871,17 +2871,14 @@

11044

/* Wipe the reg_seen array clean. */

11045

bitmap_clear (reg_seen);

11046

11047

- /* Mark all hard registers which may contain an address.

11048

- The stack, frame and argument pointers may contain an address.

11049

- An argument register which can hold a Pmode value may contain

11050

- an address even if it is not in BASE_REGS.

11051

+ /* Initialize the alias information for this pass. */

11052

+ for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)

11053

+ if (static_reg_base_value[i])

11054

+ {

11055

+ new_reg_base_value[i] = static_reg_base_value[i];

11056

+ bitmap_set_bit (reg_seen, i);

11057

+ }

11058

11059

- The address expression is VOIDmode for an argument and

11060

- Pmode for other registers. */

11061

-

11062

- memcpy (new_reg_base_value, static_reg_base_value,

11063

- FIRST_PSEUDO_REGISTER * sizeof (rtx));

11064

-

11065

/* Walk the insns adding values to the new_reg_base_value array. */

11066

for (i = 0; i < rpo_cnt; i++)

11067

{

11068

Index: gcc/tree-dfa.c

11069

===================================================================

11070

--- a/src/gcc/tree-dfa.c (.../tags/gcc_4_8_2_release)

11071

+++ b/src/gcc/tree-dfa.c (.../branches/gcc-4_8-branch)

11072

@@ -386,7 +386,6 @@

11073

double_int bit_offset = double_int_zero;

11074

HOST_WIDE_INT hbit_offset;

11075

bool seen_variable_array_ref = false;

11076

- tree base_type;

11077

11078

/* First get the final access size from just the outermost expression. */

11079

if (TREE_CODE (exp) == COMPONENT_REF)

11080

@@ -417,8 +416,6 @@

11081

and find the ultimate containing object. */

11082

while (1)

11083

{

11084

- base_type = TREE_TYPE (exp);

11085

-

11086

switch (TREE_CODE (exp))

11087

{

11088

case BIT_FIELD_REF:

11089

@@ -543,7 +540,38 @@

11090

case VIEW_CONVERT_EXPR:

11091

break;

11092

11093

+ case TARGET_MEM_REF:

11094

+ /* Via the variable index or index2 we can reach the

11095

+ whole object. Still hand back the decl here. */

11096

+ if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR

11097

+ && (TMR_INDEX (exp) || TMR_INDEX2 (exp)))

11098

+ {

11099

+ exp = TREE_OPERAND (TMR_BASE (exp), 0);

11100

+ bit_offset = double_int_zero;

11101

+ maxsize = -1;

11102

+ goto done;

11103

+ }

11104

+ /* Fallthru. */

11105

case MEM_REF:

11106

+ /* We need to deal with variable arrays ending structures such as

11107

+ struct { int length; int a[1]; } x; x.a[d]

11108

+ struct { struct { int a; int b; } a[1]; } x; x.a[d].a

11109

+ struct { struct { int a[1]; } a[1]; } x; x.a[0][d], x.a[d][0]

11110

+ struct { int len; union { int a[1]; struct X x; } u; } x; x.u.a[d]

11111

+ where we do not know maxsize for variable index accesses to

11112

+ the array. The simplest way to conservatively deal with this

11113

+ is to punt in the case that offset + maxsize reaches the

11114

+ base type boundary. This needs to include possible trailing

11115

+ padding that is there for alignment purposes. */

11116

+ if (seen_variable_array_ref

11117

+ && maxsize != -1

11118

+ && (!bit_offset.fits_shwi ()

11119

+ || !host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)

11120

+ || (bit_offset.to_shwi () + maxsize

11121

+ == (HOST_WIDE_INT) TREE_INT_CST_LOW

11122

+ (TYPE_SIZE (TREE_TYPE (exp))))))

11123

+ maxsize = -1;

11124

+

11125

/* Hand back the decl for MEM[&decl, off]. */

11126

if (TREE_CODE (TREE_OPERAND (exp, 0)) == ADDR_EXPR)

11127

{

11128

@@ -565,45 +593,24 @@

11129

}

11130

goto done;

11131

11132

- case TARGET_MEM_REF:

11133

- /* Hand back the decl for MEM[&decl, off]. */

11134

- if (TREE_CODE (TMR_BASE (exp)) == ADDR_EXPR)

11135

- {

11136

- /* Via the variable index or index2 we can reach the

11137

- whole object. */

11138

- if (TMR_INDEX (exp) || TMR_INDEX2 (exp))

11139

- {

11140

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

11141

- bit_offset = double_int_zero;

11142

- maxsize = -1;

11143

- goto done;

11144

- }

11145

- if (integer_zerop (TMR_OFFSET (exp)))

11146

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

11147

- else

11148

- {

11149

- double_int off = mem_ref_offset (exp);

11150

- off = off.alshift (BITS_PER_UNIT == 8

11151

- ? 3 : exact_log2 (BITS_PER_UNIT),

11152

- HOST_BITS_PER_DOUBLE_INT);

11153

- off += bit_offset;

11154

- if (off.fits_shwi ())

11155

- {

11156

- bit_offset = off;

11157

- exp = TREE_OPERAND (TMR_BASE (exp), 0);

11158

- }

11159

- }

11160

- }

11161

- goto done;

11162

-

11163

default:

11164

goto done;

11165

}

11166

11167

exp = TREE_OPERAND (exp, 0);

11168

}

11169

+

11170

+ /* We need to deal with variable arrays ending structures. */

11171

+ if (seen_variable_array_ref

11172

+ && maxsize != -1

11173

+ && (!bit_offset.fits_shwi ()

11174

+ || !host_integerp (TYPE_SIZE (TREE_TYPE (exp)), 1)

11175

+ || (bit_offset.to_shwi () + maxsize

11176

+ == (HOST_WIDE_INT)

11177

+ TREE_INT_CST_LOW (TYPE_SIZE (TREE_TYPE (exp))))))

11178

+ maxsize = -1;

11179

+

11180

done:

11181

-

11182

if (!bit_offset.fits_shwi ())

11183

{

11184

*poffset = 0;

11185

@@ -615,24 +622,6 @@

11186

11187

hbit_offset = bit_offset.to_shwi ();

11188

11189

- /* We need to deal with variable arrays ending structures such as

11190

- struct { int length; int a[1]; } x; x.a[d]

11191

- struct { struct { int a; int b; } a[1]; } x; x.a[d].a

11192

- struct { struct { int a[1]; } a[1]; } x; x.a[0][d], x.a[d][0]

11193

- struct { int len; union { int a[1]; struct X x; } u; } x; x.u.a[d]

11194

- where we do not know maxsize for variable index accesses to

11195

- the array. The simplest way to conservatively deal with this

11196

- is to punt in the case that offset + maxsize reaches the

11197

- base type boundary. This needs to include possible trailing padding

11198

- that is there for alignment purposes. */

11199

-

11200

- if (seen_variable_array_ref

11201

- && maxsize != -1

11202

- && (!host_integerp (TYPE_SIZE (base_type), 1)

11203

- || (hbit_offset + maxsize

11204

- == (signed) TREE_INT_CST_LOW (TYPE_SIZE (base_type)))))

11205

- maxsize = -1;

11206

-

11207

/* In case of a decl or constant base object we can do better. */

11208

11209

if (DECL_P (exp))

11210

Index: gcc/gimple-fold.c

11211

===================================================================

11212

--- a/src/gcc/gimple-fold.c (.../tags/gcc_4_8_2_release)

11213

+++ b/src/gcc/gimple-fold.c (.../branches/gcc-4_8-branch)

11214

@@ -178,7 +178,7 @@

11215

/* Make sure we create a cgraph node for functions we'll reference.

11216

They can be non-existent if the reference comes from an entry

11217

of an external vtable for example. */

11218

- cgraph_get_create_node (base);

11219

+ cgraph_get_create_real_symbol_node (base);

11220

}

11221

/* Fixup types in global initializers. */

11222

if (TREE_TYPE (TREE_TYPE (cval)) != TREE_TYPE (TREE_OPERAND (cval, 0)))

11223

Index: gcc/cfgexpand.c

11224

===================================================================

11225

--- a/src/gcc/cfgexpand.c (.../tags/gcc_4_8_2_release)

11226

+++ b/src/gcc/cfgexpand.c (.../branches/gcc-4_8-branch)

11227

@@ -4707,14 +4707,18 @@

11228

if (e->insns.r)

11229

{

11230

rebuild_jump_labels_chain (e->insns.r);

11231

- /* Avoid putting insns before parm_birth_insn. */

11232

+ /* Put insns after parm birth, but before

11233

+ NOTE_INSNS_FUNCTION_BEG. */

11234

if (e->src == ENTRY_BLOCK_PTR

11235

- && single_succ_p (ENTRY_BLOCK_PTR)

11236

- && parm_birth_insn)

11237

+ && single_succ_p (ENTRY_BLOCK_PTR))

11238

{

11239

rtx insns = e->insns.r;

11240

e->insns.r = NULL_RTX;

11241

- emit_insn_after_noloc (insns, parm_birth_insn, e->dest);

11242

+ if (NOTE_P (parm_birth_insn)

11243

+ && NOTE_KIND (parm_birth_insn) == NOTE_INSN_FUNCTION_BEG)

11244

+ emit_insn_before_noloc (insns, parm_birth_insn, e->dest);

11245

+ else

11246

+ emit_insn_after_noloc (insns, parm_birth_insn, e->dest);

11247

}

11248

else

11249

commit_one_edge_insertion (e);

11250

Index: gcc/tree-ssa-pre.c

11251

===================================================================

11252

--- a/src/gcc/tree-ssa-pre.c (.../tags/gcc_4_8_2_release)

11253

+++ b/src/gcc/tree-ssa-pre.c (.../branches/gcc-4_8-branch)

11254

@@ -3664,6 +3664,12 @@

11255

if (dump_file && dump_flags & TDF_DETAILS)

11256

fprintf (dump_file, "Starting insert iteration %d\n", num_iterations);

11257

new_stuff = insert_aux (ENTRY_BLOCK_PTR);

11258

+

11259

+ /* Clear the NEW sets before the next iteration. We have already

11260

+ fully propagated its contents. */

11261

+ if (new_stuff)

11262

+ FOR_ALL_BB (bb)

11263

+ bitmap_set_free (NEW_SETS (bb));

11264

}

11265

statistics_histogram_event (cfun, "insert iterations", num_iterations);

11266

}

11267

Index: gcc/tree-predcom.c

11268

===================================================================

11269

--- a/src/gcc/tree-predcom.c (.../tags/gcc_4_8_2_release)

11270

+++ b/src/gcc/tree-predcom.c (.../branches/gcc-4_8-branch)

11271

@@ -1323,90 +1323,43 @@

11272

gsi_insert_after (&bsi, new_stmt, GSI_NEW_STMT);

11273

}

11274

11275

-/* Returns the reference to the address of REF in the ITER-th iteration of

11276

- LOOP, or NULL if we fail to determine it (ITER may be negative). We

11277

- try to preserve the original shape of the reference (not rewrite it

11278

- as an indirect ref to the address), to make tree_could_trap_p in

11279

- prepare_initializers_chain return false more often. */

11280

+/* Returns a memory reference to DR in the ITER-th iteration of

11281

+ the loop it was analyzed in. Append init stmts to STMTS. */

11282

11283

-static tree

11284

-ref_at_iteration (struct loop *loop, tree ref, int iter)

11285

+static tree

11286

+ref_at_iteration (data_reference_p dr, int iter, gimple_seq *stmts)

11287

{

11288

- tree idx, *idx_p, type, val, op0 = NULL_TREE, ret;

11289

- affine_iv iv;

11290

- bool ok;

11291

-

11292

- if (handled_component_p (ref))

11293

+ tree off = DR_OFFSET (dr);

11294

+ tree coff = DR_INIT (dr);

11295

+ if (iter == 0)

11296

+ ;

11297

+ else if (TREE_CODE (DR_STEP (dr)) == INTEGER_CST)

11298

+ coff = size_binop (PLUS_EXPR, coff,

11299

+ size_binop (MULT_EXPR, DR_STEP (dr), ssize_int (iter)));

11300

+ else

11301

+ off = size_binop (PLUS_EXPR, off,

11302

+ size_binop (MULT_EXPR, DR_STEP (dr), ssize_int (iter)));

11303

+ tree addr = fold_build_pointer_plus (DR_BASE_ADDRESS (dr), off);

11304

+ addr = force_gimple_operand_1 (addr, stmts, is_gimple_mem_ref_addr,

11305

+ NULL_TREE);

11306

+ tree alias_ptr = fold_convert (reference_alias_ptr_type (DR_REF (dr)), coff);

11307

+ /* While data-ref analysis punts on bit offsets it still handles

11308

+ bitfield accesses at byte boundaries. Cope with that. Note that

11309

+ we cannot simply re-apply the outer COMPONENT_REF because the

11310

+ byte-granular portion of it is already applied via DR_INIT and

11311

+ DR_OFFSET, so simply build a BIT_FIELD_REF knowing that the bits

11312

+ start at offset zero. */

11313

+ if (TREE_CODE (DR_REF (dr)) == COMPONENT_REF

11314

+ && DECL_BIT_FIELD (TREE_OPERAND (DR_REF (dr), 1)))

11315

{

11316

- op0 = ref_at_iteration (loop, TREE_OPERAND (ref, 0), iter);

11317

- if (!op0)

11318

- return NULL_TREE;

11319

+ tree field = TREE_OPERAND (DR_REF (dr), 1);

11320

+ return build3 (BIT_FIELD_REF, TREE_TYPE (DR_REF (dr)),

11321

+ build2 (MEM_REF, DECL_BIT_FIELD_TYPE (field),

11322

+ addr, alias_ptr),

11323

+ DECL_SIZE (field), bitsize_zero_node);

11324

}

11325

- else if (!INDIRECT_REF_P (ref)

11326

- && TREE_CODE (ref) != MEM_REF)

11327

- return unshare_expr (ref);

11328

-

11329

- if (TREE_CODE (ref) == MEM_REF)

11330

- {

11331

- ret = unshare_expr (ref);

11332

- idx = TREE_OPERAND (ref, 0);

11333

- idx_p = &TREE_OPERAND (ret, 0);

11334

- }

11335

- else if (TREE_CODE (ref) == COMPONENT_REF)

11336

- {

11337

- /* Check that the offset is loop invariant. */

11338

- if (TREE_OPERAND (ref, 2)

11339

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 2)))

11340

- return NULL_TREE;

11341

-

11342

- return build3 (COMPONENT_REF, TREE_TYPE (ref), op0,

11343

- unshare_expr (TREE_OPERAND (ref, 1)),

11344

- unshare_expr (TREE_OPERAND (ref, 2)));

11345

- }

11346

- else if (TREE_CODE (ref) == ARRAY_REF)

11347

- {

11348

- /* Check that the lower bound and the step are loop invariant. */

11349

- if (TREE_OPERAND (ref, 2)

11350

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 2)))

11351

- return NULL_TREE;

11352

- if (TREE_OPERAND (ref, 3)

11353

- && !expr_invariant_in_loop_p (loop, TREE_OPERAND (ref, 3)))

11354

- return NULL_TREE;

11355

-

11356

- ret = build4 (ARRAY_REF, TREE_TYPE (ref), op0, NULL_TREE,

11357

- unshare_expr (TREE_OPERAND (ref, 2)),

11358

- unshare_expr (TREE_OPERAND (ref, 3)));

11359

- idx = TREE_OPERAND (ref, 1);

11360

- idx_p = &TREE_OPERAND (ret, 1);

11361

- }

11362

else

11363

- return NULL_TREE;

11364

-

11365

- ok = simple_iv (loop, loop, idx, &iv, true);

11366

- if (!ok)

11367

- return NULL_TREE;

11368

- iv.base = expand_simple_operations (iv.base);

11369

- if (integer_zerop (iv.step))

11370

- *idx_p = unshare_expr (iv.base);

11371

- else

11372

- {

11373

- type = TREE_TYPE (iv.base);

11374

- if (POINTER_TYPE_P (type))

11375

- {

11376

- val = fold_build2 (MULT_EXPR, sizetype, iv.step,

11377

- size_int (iter));

11378

- val = fold_build_pointer_plus (iv.base, val);

11379

- }

11380

- else

11381

- {

11382

- val = fold_build2 (MULT_EXPR, type, iv.step,

11383

- build_int_cst_type (type, iter));

11384

- val = fold_build2 (PLUS_EXPR, type, iv.base, val);

11385

- }

11386

- *idx_p = unshare_expr (val);

11387

- }

11388

-

11389

- return ret;

11390

+ return fold_build2 (MEM_REF, TREE_TYPE (DR_REF (dr)), addr, alias_ptr);

11391

}

11392

11393

/* Get the initialization expression for the INDEX-th temporary variable

11394

@@ -2068,7 +2021,11 @@

11395

11396

stmt = find_common_use_stmt (&name1, &name2);

11397

11398

- if (!stmt)

11399

+ if (!stmt

11400

+ /* A simple post-dominance check - make sure the combination

11401

+ is executed under the same condition as the references. */

11402

+ || (gimple_bb (stmt) != gimple_bb (r1->stmt)

11403

+ && gimple_bb (stmt) != gimple_bb (r2->stmt)))

11404

return false;

11405

11406

acode = gimple_assign_rhs_code (stmt);

11407

@@ -2365,14 +2322,10 @@

11408

if (chain->inits[i] != NULL_TREE)

11409

continue;

11410

11411

- init = ref_at_iteration (loop, DR_REF (dr), (int) i - n);

11412

- if (!init)

11413

- return false;

11414

-

11415

+ init = ref_at_iteration (dr, (int) i - n, &stmts);

11416

if (!chain->all_always_accessed && tree_could_trap_p (init))

11417

return false;

11418

11419

- init = force_gimple_operand (init, &stmts, false, NULL_TREE);

11420

if (stmts)

11421

gsi_insert_seq_on_edge_immediate (entry, stmts);

11422

11423

Index: gcc/loop-iv.c

11424

===================================================================

11425

--- a/src/gcc/loop-iv.c (.../tags/gcc_4_8_2_release)

11426

+++ b/src/gcc/loop-iv.c (.../branches/gcc-4_8-branch)

11427

@@ -425,7 +425,9 @@

11428

&& !iv->first_special)

11429

{

11430

rtx val = get_iv_value (iv, const0_rtx);

11431

- val = lowpart_subreg (mode, val, iv->extend_mode);

11432

+ val = lowpart_subreg (mode, val,

11433

+ iv->extend == IV_UNKNOWN_EXTEND

11434

+ ? iv->mode : iv->extend_mode);

11435

11436

iv->base = val;

11437

iv->extend = IV_UNKNOWN_EXTEND;

11438

@@ -465,8 +467,14 @@

11439

&& !iv->first_special)

11440

{

11441

rtx val = get_iv_value (iv, const0_rtx);

11442

+ if (iv->extend_mode != iv->mode

11443

+ && iv->extend != IV_UNKNOWN_EXTEND

11444

+ && iv->extend != extend)

11445

+ val = lowpart_subreg (iv->mode, val, iv->extend_mode);

11446

val = simplify_gen_unary (iv_extend_to_rtx_code (extend), mode,

11447

- val, iv->extend_mode);

11448

+ val,

11449

+ iv->extend == extend

11450

+ ? iv->extend_mode : iv->mode);

11451

iv->base = val;

11452

iv->extend = IV_UNKNOWN_EXTEND;

11453

iv->mode = iv->extend_mode = mode;

11454

Index: gcc/ipa-prop.c

11455

===================================================================

11456

--- a/src/gcc/ipa-prop.c (.../tags/gcc_4_8_2_release)

11457

+++ b/src/gcc/ipa-prop.c (.../branches/gcc-4_8-branch)

11458

@@ -740,7 +740,7 @@

11459

ipa_load_from_parm_agg_1 (vec<ipa_param_descriptor_t> descriptors,

11460

struct param_analysis_info *parms_ainfo, gimple stmt,

11461

tree op, int *index_p, HOST_WIDE_INT *offset_p,

11462

- bool *by_ref_p)

11463

+ HOST_WIDE_INT *size_p, bool *by_ref_p)

11464

{

11465

int index;

11466

HOST_WIDE_INT size, max_size;

11467

@@ -758,6 +758,8 @@

11468

{

11469

*index_p = index;

11470

*by_ref_p = false;

11471

+ if (size_p)

11472

+ *size_p = size;

11473

return true;

11474

}

11475

return false;

11476

@@ -800,6 +802,8 @@

11477

{

11478

*index_p = index;

11479

*by_ref_p = true;

11480

+ if (size_p)

11481

+ *size_p = size;

11482

return true;

11483

}

11484

return false;

11485

@@ -814,7 +818,7 @@

11486

bool *by_ref_p)

11487

{

11488

return ipa_load_from_parm_agg_1 (info->descriptors, NULL, stmt, op, index_p,

11489

- offset_p, by_ref_p);

11490

+ offset_p, NULL, by_ref_p);

11491

}

11492

11493

/* Given that an actual argument is an SSA_NAME (given in NAME) and is a result

11494

@@ -1646,7 +1650,7 @@

11495

if (gimple_assign_single_p (def)

11496

&& ipa_load_from_parm_agg_1 (info->descriptors, parms_ainfo, def,

11497

gimple_assign_rhs1 (def), &index, &offset,

11498

- &by_ref))

11499

+ NULL, &by_ref))

11500

{

11501

struct cgraph_edge *cs = ipa_note_param_call (node, index, call);

11502

cs->indirect_info->offset = offset;

11503

@@ -2126,7 +2130,6 @@

11504

we may create the first reference to the object in the unit. */

11505

if (!callee || callee->global.inlined_to)

11506

{

11507

- struct cgraph_node *first_clone = callee;

11508

11509

/* We are better to ensure we can refer to it.

11510

In the case of static functions we are out of luck, since we already

11511

@@ -2142,31 +2145,7 @@

11512

xstrdup (cgraph_node_name (ie->callee)), ie->callee->uid);

11513

return NULL;

11514

}

11515

-

11516

- /* Create symbol table node. Even if inline clone exists, we can not take

11517

- it as a target of non-inlined call. */

11518

- callee = cgraph_create_node (target);

11519

-

11520

- /* OK, we previously inlined the function, then removed the offline copy and

11521

- now we want it back for external call. This can happen when devirtualizing

11522

- while inlining function called once that happens after extern inlined and

11523

- virtuals are already removed. In this case introduce the external node

11524

- and make it available for call. */

11525

- if (first_clone)

11526

- {

11527

- first_clone->clone_of = callee;

11528

- callee->clones = first_clone;

11529

- symtab_prevail_in_asm_name_hash ((symtab_node)callee);

11530

- symtab_insert_node_to_hashtable ((symtab_node)callee);

11531

- if (dump_file)

11532

- fprintf (dump_file, "ipa-prop: Introduced new external node "

11533

- "(%s/%i) and turned into root of the clone tree.\n",

11534

- xstrdup (cgraph_node_name (callee)), callee->uid);

11535

- }

11536

- else if (dump_file)

11537

- fprintf (dump_file, "ipa-prop: Introduced new external node "

11538

- "(%s/%i).\n",

11539

- xstrdup (cgraph_node_name (callee)), callee->uid);

11540

+ callee = cgraph_get_create_real_symbol_node (target);

11541

}

11542

ipa_check_create_node_params ();

11543

11544

@@ -3902,7 +3881,7 @@

11545

struct ipa_agg_replacement_value *v;

11546

gimple stmt = gsi_stmt (gsi);

11547

tree rhs, val, t;

11548

- HOST_WIDE_INT offset;

11549

+ HOST_WIDE_INT offset, size;

11550

int index;

11551

bool by_ref, vce;

11552

11553

@@ -3929,13 +3908,15 @@

11554

continue;

11555

11556

if (!ipa_load_from_parm_agg_1 (descriptors, parms_ainfo, stmt,

11557

- rhs, &index, &offset, &by_ref))

11558

+ rhs, &index, &offset, &size, &by_ref))

11559

continue;

11560

for (v = aggval; v; v = v->next)

11561

if (v->index == index

11562

&& v->offset == offset)

11563

break;

11564

- if (!v || v->by_ref != by_ref)

11565

+ if (!v

11566

+ || v->by_ref != by_ref

11567

+ || tree_low_cst (TYPE_SIZE (TREE_TYPE (v->value)), 0) != size)

11568

continue;

11569

11570

gcc_checking_assert (is_gimple_ip_invariant (v->value));

11571

Index: gcc/combine.c

11572

===================================================================

11573

--- a/src/gcc/combine.c (.../tags/gcc_4_8_2_release)

11574

+++ b/src/gcc/combine.c (.../branches/gcc-4_8-branch)

11575

@@ -5798,8 +5798,15 @@

11576

return x;

11577

}

11578

11579

- /* If the code changed, return a whole new comparison. */

11580

- if (new_code != code)

11581

+ /* If the code changed, return a whole new comparison.

11582

+ We also need to avoid using SUBST in cases where

11583

+ simplify_comparison has widened a comparison with a CONST_INT,

11584

+ since in that case the wider CONST_INT may fail the sanity

11585

+ checks in do_SUBST. */

11586

+ if (new_code != code

11587

+ || (CONST_INT_P (op1)

11588

+ && GET_MODE (op0) != GET_MODE (XEXP (x, 0))

11589

+ && GET_MODE (op0) != GET_MODE (XEXP (x, 1))))

11590

return gen_rtx_fmt_ee (new_code, mode, op0, op1);

11591

11592

/* Otherwise, keep this operation, but maybe change its operands.

11593

Index: gcc/config.gcc

11594

===================================================================

11595

--- a/src/gcc/config.gcc (.../tags/gcc_4_8_2_release)

11596

+++ b/src/gcc/config.gcc (.../branches/gcc-4_8-branch)

11597

@@ -2963,11 +2963,18 @@

11598

with_cpu=8540

11599

fi

11600

;;

11601

- sparc-leon*-*)

11602

- with_cpu=v8;

11603

- ;;

11604

sparc*-*-*)

11605

- with_cpu="`echo ${target} | sed 's/-.*$//'`"

11606

+ case ${target} in

11607

+ *-leon-*)

11608

+ with_cpu=leon

11609

+ ;;

11610

+ *-leon[3-9]*)

11611

+ with_cpu=leon3

11612

+ ;;

11613

+ *)

11614

+ with_cpu="`echo ${target} | sed 's/-.*$//'`"

11615

+ ;;

11616

+ esac

11617

;;

11618

esac

11619

11620

@@ -3587,7 +3594,7 @@

11621

case ${val} in

11622

"" | sparc | sparcv9 | sparc64 \

11623

| v7 | cypress \

11624

- | v8 | supersparc | hypersparc | leon \

11625

11626

| sparclite | f930 | f934 | sparclite86x \

11627

| sparclet | tsc701 \

11628

11629

@@ -3745,15 +3752,6 @@

11630

cxx_target_objs="${cxx_target_objs} sh-c.o"

11631

;;

11632

11633

- sparc-leon*-*)

11634

- if test x$with_tune = x ; then

11635

- with_tune=leon;

11636

- fi

11637

-

11638

- # The SPARC port checks this value at compile-time.

11639

- target_cpu_default2="TARGET_CPU_$with_cpu"

11640

- ;;

11641

-

11642

sparc*-*-*)

11643

# Some standard aliases.

11644

case x$with_cpu in

11645

@@ -3765,6 +3763,17 @@

11646

;;

11647

esac

11648

11649

+ if test x$with_tune = x ; then

11650

+ case ${target} in

11651

+ *-leon-*)

11652

+ with_tune=leon

11653

+ ;;

11654

+ *-leon[3-9]*)

11655

+ with_tune=leon3

11656

+ ;;

11657

+ esac

11658

+ fi

11659

+

11660

# The SPARC port checks this value at compile-time.

11661

target_cpu_default2="TARGET_CPU_$with_cpu"

11662

;;

11663

Index: gcc/Makefile.in

11664

===================================================================

11665

--- a/src/gcc/Makefile.in (.../tags/gcc_4_8_2_release)

11666

+++ b/src/gcc/Makefile.in (.../branches/gcc-4_8-branch)

11667

@@ -3037,7 +3037,7 @@

11668

$(TM_H) coretypes.h $(GIMPLE_H) \

11669

$(TREE_PASS_H) $(FLAGS_H) $(EXPR_H) $(BASIC_BLOCK_H) \

11670

$(GGC_H) $(OBSTACK_H) $(PARAMS_H) $(CPPLIB_H) $(PARAMS_H) \

11671

- $(GIMPLE_PRETTY_PRINT_H) langhooks.h

11672

+ $(GIMPLE_PRETTY_PRINT_H) langhooks.h $(OPTABS_H)

11673

tree-complex.o : tree-complex.c $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TREE_H) \

11674

$(TM_H) $(FLAGS_H) $(TREE_FLOW_H) $(GIMPLE_H) \

11675

tree-iterator.h $(TREE_PASS_H) tree-ssa-propagate.h

11676

@@ -3276,12 +3276,12 @@

11677

$(TM_H) $(RTL_H) $(REGS_H) insn-config.h insn-codes.h $(DF_H) \

11678

$(RECOG_H) output.h addresses.h $(REGS_H) hard-reg-set.h $(FLAGS_H) \

11679

$(FUNCTION_H) $(EXPR_H) $(BASIC_BLOCK_H) $(TM_P_H) $(EXCEPT_H) \

11680

- ira.h rtl-error.h $(LRA_INT_H)

11681

+ ira.h rtl-error.h $(LRA_INT_H) $(OPTABS_H)

11682

lra-eliminations.o : lra-eliminations.c $(CONFIG_H) $(SYSTEM_H) coretypes.h \

11683

$(TM_H) $(RTL_H) $(REGS_H) insn-config.h $(DF_H) \

11684

$(RECOG_H) output.h $(REGS_H) hard-reg-set.h $(FLAGS_H) $(FUNCTION_H) \

11685

$(EXPR_H) $(BASIC_BLOCK_H) $(TM_P_H) $(EXCEPT_H) ira.h \

11686

- rtl-error.h $(LRA_INT_H)

11687

+ rtl-error.h $(LRA_INT_H) $(OPTABS_H)

11688

lra-lives.o : lra-lives.c $(CONFIG_H) $(SYSTEM_H) coretypes.h $(TM_H) \

11689

$(RTL_H) $(REGS_H) insn-config.h $(DF_H) \

11690

$(RECOG_H) output.h $(REGS_H) hard-reg-set.h $(FLAGS_H) $(FUNCTION_H) \

11691

Index: gcc/config/s390/s390.c

11692

===================================================================

11693

--- a/src/gcc/config/s390/s390.c (.../tags/gcc_4_8_2_release)

11694

+++ b/src/gcc/config/s390/s390.c (.../branches/gcc-4_8-branch)

11695

@@ -883,7 +883,8 @@

11696

{

11697

/* For CCRAWmode put the required cc mask into the second

11698

operand. */

11699

- if (GET_MODE (XVECEXP (*op0, 0, 0)) == CCRAWmode)

11700

+ if (GET_MODE (XVECEXP (*op0, 0, 0)) == CCRAWmode

11701

+ && INTVAL (*op1) >= 0 && INTVAL (*op1) <= 3)

11702

*op1 = gen_rtx_CONST_INT (VOIDmode, 1 << (3 - INTVAL (*op1)));

11703

*op0 = XVECEXP (*op0, 0, 0);

11704

*code = new_code;

11705

@@ -7846,6 +7847,9 @@

11706

{

11707

bb = BASIC_BLOCK (bb_index);

11708

11709

+ if (!bb)

11710

+ continue;

11711

+

11712

FOR_BB_INSNS (bb, insn)

11713

{

11714

rtx ite, cc, pat, target;

11715

@@ -7959,7 +7963,10 @@

11716

if (!result)

11717

return;

11718

11719

- PATTERN (tbegin_insn) = XVECEXP (PATTERN (tbegin_insn), 0, 0);

11720

+ PATTERN (tbegin_insn) = gen_rtx_PARALLEL (VOIDmode,

11721

+ gen_rtvec (2,

11722

+ XVECEXP (PATTERN (tbegin_insn), 0, 0),

11723

+ XVECEXP (PATTERN (tbegin_insn), 0, 1)));

11724

INSN_CODE (tbegin_insn) = -1;

11725

df_insn_rescan (tbegin_insn);

11726

11727

@@ -9573,6 +9580,7 @@

11728

const int CC3 = 1 << 0;

11729

rtx abort_label = gen_label_rtx ();

11730

rtx leave_label = gen_label_rtx ();

11731

+ rtx retry_plus_two = gen_reg_rtx (SImode);

11732

rtx retry_reg = gen_reg_rtx (SImode);

11733

rtx retry_label = NULL_RTX;

11734

rtx jump;

11735

@@ -9581,16 +9589,17 @@

11736

if (retry != NULL_RTX)

11737

{

11738

emit_move_insn (retry_reg, retry);

11739

+ emit_insn (gen_addsi3 (retry_plus_two, retry_reg, const2_rtx));

11740

+ emit_insn (gen_addsi3 (retry_reg, retry_reg, const1_rtx));

11741

retry_label = gen_label_rtx ();

11742

emit_label (retry_label);

11743

}

11744

11745

if (clobber_fprs_p)

11746

- emit_insn (gen_tbegin_1 (tdb,

11747

- gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK)));

11748

+ emit_insn (gen_tbegin_1 (gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK), tdb));

11749

else

11750

- emit_insn (gen_tbegin_nofloat_1 (tdb,

11751

- gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK)));

11752

+ emit_insn (gen_tbegin_nofloat_1 (gen_rtx_CONST_INT (VOIDmode, TBEGIN_MASK),

11753

+ tdb));

11754

11755

jump = s390_emit_jump (abort_label,

11756

gen_rtx_NE (VOIDmode,

11757

@@ -9611,6 +9620,10 @@

11758

/* Abort handler code. */

11759

11760

emit_label (abort_label);

11761

+ emit_move_insn (dest, gen_rtx_UNSPEC (SImode,

11762

+ gen_rtvec (1, gen_rtx_REG (CCRAWmode,

11763

+ CC_REGNUM)),

11764

+ UNSPEC_CC_TO_INT));

11765

if (retry != NULL_RTX)

11766

{

11767

rtx count = gen_reg_rtx (SImode);

11768

@@ -9622,7 +9635,7 @@

11769

add_reg_note (jump, REG_BR_PROB, very_unlikely);

11770

11771

/* CC2 - transient failure. Perform retry with ppa. */

11772

- emit_move_insn (count, retry);

11773

+ emit_move_insn (count, retry_plus_two);

11774

emit_insn (gen_subsi3 (count, count, retry_reg));

11775

emit_insn (gen_tx_assist (count));

11776

jump = emit_jump_insn (gen_doloop_si64 (retry_label,

11777

@@ -9632,10 +9645,6 @@

11778

LABEL_NUSES (retry_label) = 1;

11779

}

11780

11781

- emit_move_insn (dest, gen_rtx_UNSPEC (SImode,

11782

- gen_rtvec (1, gen_rtx_REG (CCRAWmode,

11783

- CC_REGNUM)),

11784

- UNSPEC_CC_TO_INT));

11785

emit_label (leave_label);

11786

}

11787

11788

@@ -9674,6 +9683,9 @@

11789

s390_init_builtins (void)

11790

{

11791

tree ftype, uint64_type;

11792

+ tree returns_twice_attr = tree_cons (get_identifier ("returns_twice"),

11793

+ NULL, NULL);

11794

+ tree noreturn_attr = tree_cons (get_identifier ("noreturn"), NULL, NULL);

11795

11796

/* void foo (void) */

11797

ftype = build_function_type_list (void_type_node, NULL_TREE);

11798

@@ -9684,17 +9696,17 @@

11799

ftype = build_function_type_list (void_type_node, integer_type_node,

11800

NULL_TREE);

11801

add_builtin_function ("__builtin_tabort", ftype,

11802

- S390_BUILTIN_TABORT, BUILT_IN_MD, NULL, NULL_TREE);

11803

+ S390_BUILTIN_TABORT, BUILT_IN_MD, NULL, noreturn_attr);

11804

add_builtin_function ("__builtin_tx_assist", ftype,

11805

S390_BUILTIN_TX_ASSIST, BUILT_IN_MD, NULL, NULL_TREE);

11806

11807

/* int foo (void *) */

11808

ftype = build_function_type_list (integer_type_node, ptr_type_node, NULL_TREE);

11809

add_builtin_function ("__builtin_tbegin", ftype, S390_BUILTIN_TBEGIN,

11810

- BUILT_IN_MD, NULL, NULL_TREE);

11811

+ BUILT_IN_MD, NULL, returns_twice_attr);

11812

add_builtin_function ("__builtin_tbegin_nofloat", ftype,

11813

S390_BUILTIN_TBEGIN_NOFLOAT,

11814

- BUILT_IN_MD, NULL, NULL_TREE);

11815

+ BUILT_IN_MD, NULL, returns_twice_attr);

11816

11817

/* int foo (void *, int) */

11818

ftype = build_function_type_list (integer_type_node, ptr_type_node,

11819

@@ -9702,11 +9714,11 @@

11820

add_builtin_function ("__builtin_tbegin_retry", ftype,

11821

S390_BUILTIN_TBEGIN_RETRY,

11822

BUILT_IN_MD,

11823

- NULL, NULL_TREE);

11824

+ NULL, returns_twice_attr);

11825

add_builtin_function ("__builtin_tbegin_retry_nofloat", ftype,

11826

S390_BUILTIN_TBEGIN_RETRY_NOFLOAT,

11827

BUILT_IN_MD,

11828

- NULL, NULL_TREE);

11829

+ NULL, returns_twice_attr);

11830

11831

/* int foo (void) */

11832

ftype = build_function_type_list (integer_type_node, NULL_TREE);

11833

Index: gcc/config/s390/s390.md

11834

===================================================================

11835

--- a/src/gcc/config/s390/s390.md (.../tags/gcc_4_8_2_release)

11836

+++ b/src/gcc/config/s390/s390.md (.../branches/gcc-4_8-branch)

11837

@@ -147,6 +147,7 @@

11838

11839

; Transactional Execution support

11840

UNSPECV_TBEGIN

11841

+ UNSPECV_TBEGIN_TDB

11842

UNSPECV_TBEGINC

11843

UNSPECV_TEND

11844

UNSPECV_TABORT

11845

@@ -9896,9 +9897,10 @@

11846

11847

(define_insn "tbegin_1"

11848

[(set (reg:CCRAW CC_REGNUM)

11849

- (unspec_volatile:CCRAW [(match_operand:BLK 0 "memory_operand" "=Q")

11850

- (match_operand 1 "const_int_operand" " D")]

11851

+ (unspec_volatile:CCRAW [(match_operand 0 "const_int_operand" "D")]

11852

UNSPECV_TBEGIN))

11853

+ (set (match_operand:BLK 1 "memory_operand" "=Q")

11854

+ (unspec_volatile:BLK [(match_dup 0)] UNSPECV_TBEGIN_TDB))

11855

(clobber (reg:DF 16))

11856

(clobber (reg:DF 17))

11857

(clobber (reg:DF 18))

11858

@@ -9917,18 +9919,19 @@

11859

(clobber (reg:DF 31))]

11860

; CONST_OK_FOR_CONSTRAINT_P does not work with D constraint since D is

11861

; not supposed to be used for immediates (see genpreds.c).

11862

- "TARGET_HTM && INTVAL (operands[1]) >= 0 && INTVAL (operands[1]) <= 0xffff"

11863

- "tbegin\t%0,%x1"

11864

+ "TARGET_HTM && INTVAL (operands[0]) >= 0 && INTVAL (operands[0]) <= 0xffff"

11865

+ "tbegin\t%1,%x0"

11866

[(set_attr "op_type" "SIL")])

11867

11868

; Same as above but without the FPR clobbers

11869

(define_insn "tbegin_nofloat_1"

11870

[(set (reg:CCRAW CC_REGNUM)

11871

- (unspec_volatile:CCRAW [(match_operand:BLK 0 "memory_operand" "=Q")

11872

- (match_operand 1 "const_int_operand" " D")]

11873

- UNSPECV_TBEGIN))]

11874

- "TARGET_HTM && INTVAL (operands[1]) >= 0 && INTVAL (operands[1]) <= 0xffff"

11875

- "tbegin\t%0,%x1"

11876

+ (unspec_volatile:CCRAW [(match_operand 0 "const_int_operand" "D")]

11877

+ UNSPECV_TBEGIN))

11878

+ (set (match_operand:BLK 1 "memory_operand" "=Q")

11879

+ (unspec_volatile:BLK [(match_dup 0)] UNSPECV_TBEGIN_TDB))]

11880

+ "TARGET_HTM && INTVAL (operands[0]) >= 0 && INTVAL (operands[0]) <= 0xffff"

11881

+ "tbegin\t%1,%x0"

11882

[(set_attr "op_type" "SIL")])

11883

11884

11885

@@ -10012,15 +10015,12 @@

11886

; Transaction perform processor assist

11887

11888

(define_expand "tx_assist"

11889

- [(set (match_dup 1) (const_int 0))

11890

- (unspec_volatile [(match_operand:SI 0 "register_operand" "")

11891

- (match_dup 1)

11892

+ [(unspec_volatile [(match_operand:SI 0 "register_operand" "")

11893

+ (reg:SI GPR0_REGNUM)

11894

(const_int 1)]

11895

UNSPECV_PPA)]

11896

"TARGET_HTM"

11897

-{

11898

- operands[1] = gen_reg_rtx (SImode);

11899

-})

11900

+ "")

11901

11902

(define_insn "*ppa"

11903

[(unspec_volatile [(match_operand:SI 0 "register_operand" "d")

11904

@@ -10028,5 +10028,5 @@

11905

(match_operand 2 "const_int_operand" "I")]

11906

UNSPECV_PPA)]

11907

"TARGET_HTM && INTVAL (operands[2]) < 16"

11908

- "ppa\t%0,%1,1"

11909

+ "ppa\t%0,%1,%2"

11910

[(set_attr "op_type" "RRF")])

11911

Index: gcc/config/s390/htmxlintrin.h

11912

===================================================================

11913

--- a/src/gcc/config/s390/htmxlintrin.h (.../tags/gcc_4_8_2_release)

11914

+++ b/src/gcc/config/s390/htmxlintrin.h (.../branches/gcc-4_8-branch)

11915

@@ -33,13 +33,20 @@

11916

the IBM XL compiler. For documentation please see the "z/OS XL

11917

C/C++ Programming Guide" publically available on the web. */

11918

11919

-extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

11920

+/* FIXME: __TM_simple_begin and __TM_begin should be marked

11921

+ __always_inline__ as well but this currently produces an error

11922

+ since the tbegin builtins are "returns_twice" and setjmp_call_p

11923

+ (calls.c) therefore identifies the functions as calling setjmp.

11924

+ The tree inliner currently refuses to inline functions calling

11925

+ setjmp. */

11926

+

11927

+long

11928

__TM_simple_begin ()

11929

{

11930

return __builtin_tbegin_nofloat (0);

11931

}

11932

11933

-extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

11934

+long

11935

__TM_begin (void* const tdb)

11936

{

11937

return __builtin_tbegin_nofloat (tdb);

11938

@@ -78,7 +85,7 @@

11939

if (depth != 0)

11940

return depth;

11941

11942

- if (tdb->format == 0)

11943

+ if (tdb->format != 1)

11944

return 0;

11945

return tdb->nesting_depth;

11946

}

11947

@@ -90,7 +97,7 @@

11948

{

11949

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

11950

11951

- if (tdb->format == 0)

11952

+ if (tdb->format != 1)

11953

return 0;

11954

11955

return !!(tdb->abort_code >= _HTM_FIRST_USER_ABORT_CODE);

11956

@@ -101,7 +108,7 @@

11957

{

11958

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

11959

11960

- if (tdb->format == 0)

11961

+ if (tdb->format != 1)

11962

return 0;

11963

11964

if (tdb->abort_code >= _HTM_FIRST_USER_ABORT_CODE)

11965

@@ -117,7 +124,7 @@

11966

{

11967

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

11968

11969

- return (tdb->format == 0

11970

+ return (tdb->format == 1

11971

&& (tdb->abort_code == 4 /* unfiltered program interruption */

11972

|| tdb->abort_code == 11 /* restricted instruction */));

11973

}

11974

@@ -127,7 +134,7 @@

11975

{

11976

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

11977

11978

- return (tdb->format == 0

11979

+ return (tdb->format == 1

11980

&& (tdb->abort_code == 7 /* fetch overflow */

11981

|| tdb->abort_code == 8 /* store overflow */));

11982

}

11983

@@ -137,7 +144,7 @@

11984

{

11985

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

11986

11987

- return tdb->format == 0 && tdb->abort_code == 13; /* depth exceeded */

11988

+ return tdb->format == 1 && tdb->abort_code == 13; /* depth exceeded */

11989

}

11990

11991

extern __inline long __attribute__((__gnu_inline__, __always_inline__, __artificial__))

11992

@@ -145,7 +152,7 @@

11993

{

11994

struct __htm_tdb *tdb = (struct __htm_tdb*)tdb_ptr;

11995

11996

- return (tdb->format == 0

11997

+ return (tdb->format == 1

11998

&& (tdb->abort_code == 9 /* fetch conflict */

11999

|| tdb->abort_code == 10 /* store conflict */));

12000

}

12001

Index: gcc/config/sparc/t-rtems

12002

===================================================================

12003

--- a/src/gcc/config/sparc/t-rtems (.../tags/gcc_4_8_2_release)

12004

+++ b/src/gcc/config/sparc/t-rtems (.../branches/gcc-4_8-branch)

12005

@@ -17,6 +17,6 @@

12006

# <http://www.gnu.org/licenses/>.

12007

#

12008

12009

-MULTILIB_OPTIONS = msoft-float mcpu=v8

12010

-MULTILIB_DIRNAMES = soft v8

12011

+MULTILIB_OPTIONS = msoft-float mcpu=v8/mcpu=leon3

12012

+MULTILIB_DIRNAMES = soft v8 leon3

12013

MULTILIB_MATCHES = msoft-float=mno-fpu

12014

Index: gcc/config/sparc/sparc.md

12015

===================================================================

12016

--- a/src/gcc/config/sparc/sparc.md (.../tags/gcc_4_8_2_release)

12017

+++ b/src/gcc/config/sparc/sparc.md (.../branches/gcc-4_8-branch)

12018

@@ -206,7 +206,7 @@

12019

;; 'f' for all DF/TFmode values, including those that are specific to the v8.

12020

12021

;; Attribute for cpu type.

12022

-;; These must match the values for enum processor_type in sparc.h.

12023

+;; These must match the values of the enum processor_type in sparc-opts.h.

12024

(define_attr "cpu"

12025

"v7,

12026

cypress,

12027

@@ -214,6 +214,7 @@

12028

supersparc,

12029

hypersparc,

12030

leon,

12031

+ leon3,

12032

sparclite,

12033

f930,

12034

f934,

12035

@@ -5548,7 +5549,7 @@

12036

[(set (match_operand:DF 0 "register_operand" "=e")

12037

(mult:DF (float_extend:DF (match_operand:SF 1 "register_operand" "f"))

12038

(float_extend:DF (match_operand:SF 2 "register_operand" "f"))))]

12039

- "(TARGET_V8 || TARGET_V9) && TARGET_FPU"

12040

+ "(TARGET_V8 || TARGET_V9) && TARGET_FPU && !sparc_fix_ut699"

12041

"fsmuld\t%1, %2, %0"

12042

[(set_attr "type" "fpmul")

12043

(set_attr "fptype" "double")])

12044

@@ -5577,20 +5578,37 @@

12045

"fdivq\t%1, %2, %0"

12046

[(set_attr "type" "fpdivd")])

12047

12048

-(define_insn "divdf3"

12049

+(define_expand "divdf3"

12050

[(set (match_operand:DF 0 "register_operand" "=e")

12051

(div:DF (match_operand:DF 1 "register_operand" "e")

12052

(match_operand:DF 2 "register_operand" "e")))]

12053

"TARGET_FPU"

12054

+ "")

12055

+

12056

+(define_insn "*divdf3_nofix"

12057

+ [(set (match_operand:DF 0 "register_operand" "=e")

12058

+ (div:DF (match_operand:DF 1 "register_operand" "e")

12059

+ (match_operand:DF 2 "register_operand" "e")))]

12060

+ "TARGET_FPU && !sparc_fix_ut699"

12061

"fdivd\t%1, %2, %0"

12062

[(set_attr "type" "fpdivd")

12063

(set_attr "fptype" "double")])

12064

12065

+(define_insn "*divdf3_fix"

12066

+ [(set (match_operand:DF 0 "register_operand" "=e")

12067

+ (div:DF (match_operand:DF 1 "register_operand" "e")

12068

+ (match_operand:DF 2 "register_operand" "e")))]

12069

+ "TARGET_FPU && sparc_fix_ut699"

12070

+ "fdivd\t%1, %2, %0\n\tstd\t%0, [%%sp-8]"

12071

+ [(set_attr "type" "fpdivd")

12072

+ (set_attr "fptype" "double")

12073

+ (set_attr "length" "2")])

12074

+

12075

(define_insn "divsf3"

12076

[(set (match_operand:SF 0 "register_operand" "=f")

12077

(div:SF (match_operand:SF 1 "register_operand" "f")

12078

(match_operand:SF 2 "register_operand" "f")))]

12079

- "TARGET_FPU"

12080

+ "TARGET_FPU && !sparc_fix_ut699"

12081

"fdivs\t%1, %2, %0"

12082

[(set_attr "type" "fpdivs")])

12083

12084

@@ -5791,18 +5809,33 @@

12085

"fsqrtq\t%1, %0"

12086

[(set_attr "type" "fpsqrtd")])

12087

12088

-(define_insn "sqrtdf2"

12089

+(define_expand "sqrtdf2"

12090

[(set (match_operand:DF 0 "register_operand" "=e")

12091

(sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

12092

"TARGET_FPU"

12093

+ "")

12094

+

12095

+(define_insn "*sqrtdf2_nofix"

12096

+ [(set (match_operand:DF 0 "register_operand" "=e")

12097

+ (sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

12098

+ "TARGET_FPU && !sparc_fix_ut699"

12099

"fsqrtd\t%1, %0"

12100

[(set_attr "type" "fpsqrtd")

12101

(set_attr "fptype" "double")])

12102

12103

+(define_insn "*sqrtdf2_fix"

12104

+ [(set (match_operand:DF 0 "register_operand" "=e")

12105

+ (sqrt:DF (match_operand:DF 1 "register_operand" "e")))]

12106

+ "TARGET_FPU && sparc_fix_ut699"

12107

+ "fsqrtd\t%1, %0\n\tstd\t%0, [%%sp-8]"

12108

+ [(set_attr "type" "fpsqrtd")

12109

+ (set_attr "fptype" "double")

12110

+ (set_attr "length" "2")])

12111

+

12112

(define_insn "sqrtsf2"

12113

[(set (match_operand:SF 0 "register_operand" "=f")

12114

(sqrt:SF (match_operand:SF 1 "register_operand" "f")))]

12115

- "TARGET_FPU"

12116

+ "TARGET_FPU && !sparc_fix_ut699"

12117

"fsqrts\t%1, %0"

12118

[(set_attr "type" "fpsqrts")])

12119

12120

Index: gcc/config/sparc/t-sparc

12121

===================================================================

12122

--- a/src/gcc/config/sparc/t-sparc (.../tags/gcc_4_8_2_release)

12123

+++ b/src/gcc/config/sparc/t-sparc (.../branches/gcc-4_8-branch)

12124

@@ -23,7 +23,7 @@

12125

insn-codes.h conditions.h output.h $(INSN_ATTR_H) $(FLAGS_H) \

12126

$(FUNCTION_H) $(EXCEPT_H) $(EXPR_H) $(OPTABS_H) $(RECOG_H) \

12127

$(DIAGNOSTIC_CORE_H) $(GGC_H) $(TM_P_H) debug.h $(TARGET_H) \

12128

- $(TARGET_DEF_H) $(COMMON_TARGET_H) $(GIMPLE_H) \

12129

+ $(TARGET_DEF_H) $(COMMON_TARGET_H) $(GIMPLE_H) $(TREE_PASS_H) \

12130

langhooks.h reload.h $(PARAMS_H) $(DF_H) $(OPTS_H) \

12131

gt-sparc.h

12132

12133

Index: gcc/config/sparc/sparc.opt

12134

===================================================================

12135

--- a/src/gcc/config/sparc/sparc.opt (.../tags/gcc_4_8_2_release)

12136

+++ b/src/gcc/config/sparc/sparc.opt (.../branches/gcc-4_8-branch)

12137

@@ -146,6 +146,9 @@

12138

Enum(sparc_processor_type) String(leon) Value(PROCESSOR_LEON)

12139

12140

EnumValue

12141

+Enum(sparc_processor_type) String(leon3) Value(PROCESSOR_LEON3)

12142

+

12143

+EnumValue

12144

Enum(sparc_processor_type) String(sparclite) Value(PROCESSOR_SPARCLITE)

12145

12146

EnumValue

12147

@@ -201,9 +204,19 @@

12148

Enable workaround for single erratum of AT697F processor

12149

(corresponding to erratum #13 of AT697E processor)

12150

12151

+mfix-ut699

12152

+Target Report RejectNegative Var(sparc_fix_ut699)

12153

+Enable workarounds for the errata of the UT699 processor

12154

+

12155

Mask(LONG_DOUBLE_128)

12156

;; Use 128-bit long double

12157

12158

+Mask(LEON)

12159

+;; Generate code for LEON

12160

+

12161

+Mask(LEON3)

12162

+;; Generate code for LEON3

12163

+

12164

Mask(SPARCLITE)

12165

;; Generate code for SPARClite

12166

12167

Index: gcc/config/sparc/sync.md

12168

===================================================================

12169

--- a/src/gcc/config/sparc/sync.md (.../tags/gcc_4_8_2_release)

12170

+++ b/src/gcc/config/sparc/sync.md (.../branches/gcc-4_8-branch)

12171

@@ -161,7 +161,8 @@

12172

(match_operand:SI 5 "const_int_operand" "") ;; is_weak

12173

(match_operand:SI 6 "const_int_operand" "") ;; mod_s

12174

(match_operand:SI 7 "const_int_operand" "")] ;; mod_f

12175

- "TARGET_V9 && (<MODE>mode != DImode || TARGET_ARCH64 || TARGET_V8PLUS)"

12176

+ "(TARGET_V9 || TARGET_LEON3)

12177

+ && (<MODE>mode != DImode || TARGET_ARCH64 || TARGET_V8PLUS)"

12178

{

12179

sparc_expand_compare_and_swap (operands);

12180

DONE;

12181

@@ -176,7 +177,7 @@

12182

[(match_operand:I48MODE 2 "register_operand" "")

12183

(match_operand:I48MODE 3 "register_operand" "")]

12184

UNSPECV_CAS))])]

12185

- "TARGET_V9"

12186

+ "TARGET_V9 || TARGET_LEON3"

12187

"")

12188

12189

(define_insn "*atomic_compare_and_swap<mode>_1"

12190

@@ -187,7 +188,7 @@

12191

[(match_operand:I48MODE 2 "register_operand" "r")

12192

(match_operand:I48MODE 3 "register_operand" "0")]

12193

UNSPECV_CAS))]

12194

- "TARGET_V9 && (<MODE>mode == SImode || TARGET_ARCH64)"

12195

+ "(TARGET_V9 || TARGET_LEON3) && (<MODE>mode != DImode || TARGET_ARCH64)"

12196

"cas<modesuffix>\t%1, %2, %0"

12197

[(set_attr "type" "multi")])

12198

12199

@@ -220,7 +221,7 @@

12200

(match_operand:SI 1 "memory_operand" "")

12201

(match_operand:SI 2 "register_operand" "")

12202

(match_operand:SI 3 "const_int_operand" "")]

12203

- "TARGET_V8 || TARGET_V9"

12204

+ "(TARGET_V8 || TARGET_V9) && !sparc_fix_ut699"

12205

{

12206

enum memmodel model = (enum memmodel) INTVAL (operands[3]);

12207

12208

@@ -236,7 +237,7 @@

12209

UNSPECV_SWAP))

12210

(set (match_dup 1)

12211

(match_operand:SI 2 "register_operand" "0"))]

12212

- "TARGET_V8 || TARGET_V9"

12213

+ "(TARGET_V8 || TARGET_V9) && !sparc_fix_ut699"

12214

"swap\t%1, %0"

12215

[(set_attr "type" "multi")])

12216

12217

@@ -244,7 +245,7 @@

12218

[(match_operand:QI 0 "register_operand" "")

12219

(match_operand:QI 1 "memory_operand" "")

12220

(match_operand:SI 2 "const_int_operand" "")]

12221

- ""

12222

+ "!sparc_fix_ut699"

12223

{

12224

enum memmodel model = (enum memmodel) INTVAL (operands[2]);

12225

rtx ret;

12226

@@ -268,6 +269,6 @@

12227

(unspec_volatile:QI [(match_operand:QI 1 "memory_operand" "+m")]

12228

UNSPECV_LDSTUB))

12229

(set (match_dup 1) (const_int -1))]

12230

- ""

12231

+ "!sparc_fix_ut699"

12232

"ldstub\t%1, %0"

12233

[(set_attr "type" "multi")])

12234

Index: gcc/config/sparc/sparc-opts.h

12235

===================================================================

12236

--- a/src/gcc/config/sparc/sparc-opts.h (.../tags/gcc_4_8_2_release)

12237

+++ b/src/gcc/config/sparc/sparc-opts.h (.../branches/gcc-4_8-branch)

12238

@@ -30,6 +30,7 @@

12239

PROCESSOR_SUPERSPARC,

12240

PROCESSOR_HYPERSPARC,

12241

PROCESSOR_LEON,

12242

+ PROCESSOR_LEON3,

12243

PROCESSOR_SPARCLITE,

12244

PROCESSOR_F930,

12245

PROCESSOR_F934,

12246

Index: gcc/config/sparc/sparc.c

12247

===================================================================

12248

--- a/src/gcc/config/sparc/sparc.c (.../tags/gcc_4_8_2_release)

12249

+++ b/src/gcc/config/sparc/sparc.c (.../branches/gcc-4_8-branch)

12250

@@ -52,6 +52,7 @@

12251

#include "params.h"

12252

#include "df.h"

12253

#include "opts.h"

12254

+#include "tree-pass.h"

12255

12256

/* Processor costs */

12257

12258

@@ -226,6 +227,30 @@

12259

};

12260

12261

static const

12262

+struct processor_costs leon3_costs = {

12263

+ COSTS_N_INSNS (1), /* int load */

12264

+ COSTS_N_INSNS (1), /* int signed load */

12265

+ COSTS_N_INSNS (1), /* int zeroed load */

12266

+ COSTS_N_INSNS (1), /* float load */

12267

+ COSTS_N_INSNS (1), /* fmov, fneg, fabs */

12268

+ COSTS_N_INSNS (1), /* fadd, fsub */

12269

+ COSTS_N_INSNS (1), /* fcmp */

12270

+ COSTS_N_INSNS (1), /* fmov, fmovr */

12271

+ COSTS_N_INSNS (1), /* fmul */

12272

+ COSTS_N_INSNS (14), /* fdivs */

12273

+ COSTS_N_INSNS (15), /* fdivd */

12274

+ COSTS_N_INSNS (22), /* fsqrts */

12275

+ COSTS_N_INSNS (23), /* fsqrtd */

12276

+ COSTS_N_INSNS (5), /* imul */

12277

+ COSTS_N_INSNS (5), /* imulX */

12278

+ 0, /* imul bit factor */

12279

+ COSTS_N_INSNS (35), /* idiv */

12280

+ COSTS_N_INSNS (35), /* idivX */

12281

+ COSTS_N_INSNS (1), /* movcc/movr */

12282

+ 0, /* shift penalty */

12283

+};

12284

+

12285

+static const

12286

struct processor_costs sparclet_costs = {

12287

COSTS_N_INSNS (3), /* int load */

12288

COSTS_N_INSNS (3), /* int signed load */

12289

@@ -538,7 +563,6 @@

12290

HOST_WIDE_INT, tree);

12291

static bool sparc_can_output_mi_thunk (const_tree, HOST_WIDE_INT,

12292

HOST_WIDE_INT, const_tree);

12293

-static void sparc_reorg (void);

12294

static struct machine_function * sparc_init_machine_status (void);

12295

static bool sparc_cannot_force_const_mem (enum machine_mode, rtx);

12296

static rtx sparc_tls_get_addr (void);

12297

@@ -680,9 +704,6 @@

12298

#undef TARGET_ASM_CAN_OUTPUT_MI_THUNK

12299

#define TARGET_ASM_CAN_OUTPUT_MI_THUNK sparc_can_output_mi_thunk

12300

12301

-#undef TARGET_MACHINE_DEPENDENT_REORG

12302

-#define TARGET_MACHINE_DEPENDENT_REORG sparc_reorg

12303

-

12304

#undef TARGET_RTX_COSTS

12305

#define TARGET_RTX_COSTS sparc_rtx_costs

12306

#undef TARGET_ADDRESS_COST

12307

@@ -804,6 +825,206 @@

12308

12309

struct gcc_target targetm = TARGET_INITIALIZER;

12310

12311

+/* Return the memory reference contained in X if any, zero otherwise. */

12312

+

12313

+static rtx

12314

+mem_ref (rtx x)

12315

+{

12316

+ if (GET_CODE (x) == SIGN_EXTEND || GET_CODE (x) == ZERO_EXTEND)

12317

+ x = XEXP (x, 0);

12318

+

12319

+ if (MEM_P (x))

12320

+ return x;

12321

+

12322

+ return NULL_RTX;

12323

+}

12324

+

12325

+/* We use a machine specific pass to enable workarounds for errata.

12326

+ We need to have the (essentially) final form of the insn stream in order

12327

+ to properly detect the various hazards. Therefore, this machine specific

12328

+ pass runs as late as possible. The pass is inserted in the pass pipeline

12329

+ at the end of sparc_option_override. */

12330

+

12331

+static bool

12332

+sparc_gate_work_around_errata (void)

12333

+{

12334

+ /* The only errata we handle are those of the AT697F and UT699. */

12335

+ return sparc_fix_at697f != 0 || sparc_fix_ut699 != 0;

12336

+}

12337

+

12338

+static unsigned int

12339

+sparc_do_work_around_errata (void)

12340

+{

12341

+ rtx insn, next;

12342

+

12343

+ /* Force all instructions to be split into their final form. */

12344

+ split_all_insns_noflow ();

12345

+

12346

+ /* Now look for specific patterns in the insn stream. */

12347

+ for (insn = get_insns (); insn; insn = next)

12348

+ {

12349

+ bool insert_nop = false;

12350

+ rtx set;

12351

+

12352

+ /* Look into the instruction in a delay slot. */

12353

+ if (NONJUMP_INSN_P (insn) && GET_CODE (PATTERN (insn)) == SEQUENCE)

12354

+ insn = XVECEXP (PATTERN (insn), 0, 1);

12355

+

12356

+ /* Look for a single-word load into an odd-numbered FP register. */

12357

+ if (sparc_fix_at697f

12358

+ && NONJUMP_INSN_P (insn)

12359

+ && (set = single_set (insn)) != NULL_RTX

12360

+ && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) == 4

12361

+ && MEM_P (SET_SRC (set))

12362

+ && REG_P (SET_DEST (set))

12363

+ && REGNO (SET_DEST (set)) > 31

12364

+ && REGNO (SET_DEST (set)) % 2 != 0)

12365

+ {

12366

+ /* The wrong dependency is on the enclosing double register. */

12367

+ unsigned int x = REGNO (SET_DEST (set)) - 1;

12368

+ unsigned int src1, src2, dest;

12369

+ int code;

12370

+

12371

+ /* If the insn has a delay slot, then it cannot be problematic. */

12372

+ next = next_active_insn (insn);

12373

+ if (!next)

12374

+ break;

12375

+ if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

12376

+ continue;

12377

+

12378

+ extract_insn (next);

12379

+ code = INSN_CODE (next);

12380

+

12381

+ switch (code)

12382

+ {

12383

+ case CODE_FOR_adddf3:

12384

+ case CODE_FOR_subdf3:

12385

+ case CODE_FOR_muldf3:

12386

+ case CODE_FOR_divdf3:

12387

+ dest = REGNO (recog_data.operand[0]);

12388

+ src1 = REGNO (recog_data.operand[1]);

12389

+ src2 = REGNO (recog_data.operand[2]);

12390

+ if (src1 != src2)

12391

+ {

12392

+ /* Case [1-4]:

12393

+ ld [address], %fx+1

12394

+ FPOPd %f{x,y}, %f{y,x}, %f{x,y} */

12395

+ if ((src1 == x || src2 == x)

12396

+ && (dest == src1 || dest == src2))

12397

+ insert_nop = true;

12398

+ }

12399

+ else

12400

+ {

12401

+ /* Case 5:

12402

+ ld [address], %fx+1

12403

+ FPOPd %fx, %fx, %fx */

12404

+ if (src1 == x

12405

+ && dest == src1

12406

+ && (code == CODE_FOR_adddf3 || code == CODE_FOR_muldf3))

12407

+ insert_nop = true;

12408

+ }

12409

+ break;

12410

+

12411

+ case CODE_FOR_sqrtdf2:

12412

+ dest = REGNO (recog_data.operand[0]);

12413

+ src1 = REGNO (recog_data.operand[1]);

12414

+ /* Case 6:

12415

+ ld [address], %fx+1

12416

+ fsqrtd %fx, %fx */

12417

+ if (src1 == x && dest == src1)

12418

+ insert_nop = true;

12419

+ break;

12420

+

12421

+ default:

12422

+ break;

12423

+ }

12424

+ }

12425

+

12426

+ /* Look for a single-word load into an integer register. */

12427

+ else if (sparc_fix_ut699

12428

+ && NONJUMP_INSN_P (insn)

12429

+ && (set = single_set (insn)) != NULL_RTX

12430

+ && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) <= 4

12431

+ && mem_ref (SET_SRC (set)) != NULL_RTX

12432

+ && REG_P (SET_DEST (set))

12433

+ && REGNO (SET_DEST (set)) < 32)

12434

+ {

12435

+ /* There is no problem if the second memory access has a data

12436

+ dependency on the first single-cycle load. */

12437

+ rtx x = SET_DEST (set);

12438

+

12439

+ /* If the insn has a delay slot, then it cannot be problematic. */

12440

+ next = next_active_insn (insn);

12441

+ if (!next)

12442

+ break;

12443

+ if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

12444

+ continue;

12445

+

12446

+ /* Look for a second memory access to/from an integer register. */

12447

+ if ((set = single_set (next)) != NULL_RTX)

12448

+ {

12449

+ rtx src = SET_SRC (set);

12450

+ rtx dest = SET_DEST (set);

12451

+ rtx mem;

12452

+

12453

+ /* LDD is affected. */

12454

+ if ((mem = mem_ref (src)) != NULL_RTX

12455

+ && REG_P (dest)

12456

+ && REGNO (dest) < 32

12457

+ && !reg_mentioned_p (x, XEXP (mem, 0)))

12458

+ insert_nop = true;

12459

+

12460

+ /* STD is *not* affected. */

12461

+ else if ((mem = mem_ref (dest)) != NULL_RTX

12462

+ && GET_MODE_SIZE (GET_MODE (mem)) <= 4

12463

+ && (src == const0_rtx

12464

+ || (REG_P (src)

12465

+ && REGNO (src) < 32

12466

+ && REGNO (src) != REGNO (x)))

12467

+ && !reg_mentioned_p (x, XEXP (mem, 0)))

12468

+ insert_nop = true;

12469

+ }

12470

+ }

12471

+

12472

+ else

12473

+ next = NEXT_INSN (insn);

12474

+

12475

+ if (insert_nop)

12476

+ emit_insn_before (gen_nop (), next);

12477

+ }

12478

+

12479

+ return 0;

12480

+}

12481

+

12482

+struct rtl_opt_pass pass_work_around_errata =

12483

+{

12484

+ {

12485

+ RTL_PASS,

12486

+ "errata", /* name */

12487

+ OPTGROUP_NONE, /* optinfo_flags */

12488

+ sparc_gate_work_around_errata, /* gate */

12489

+ sparc_do_work_around_errata, /* execute */

12490

+ NULL, /* sub */

12491

+ NULL, /* next */

12492

+ 0, /* static_pass_number */

12493

+ TV_MACH_DEP, /* tv_id */

12494

+ 0, /* properties_required */

12495

+ 0, /* properties_provided */

12496

+ 0, /* properties_destroyed */

12497

+ 0, /* todo_flags_start */

12498

+ TODO_verify_rtl_sharing, /* todo_flags_finish */

12499

+ }

12500

+};

12501

+

12502

+struct register_pass_info insert_pass_work_around_errata =

12503

+{

12504

+ &pass_work_around_errata.pass, /* pass */

12505

+ "dbr", /* reference_pass_name */

12506

+ 1, /* ref_pass_instance_number */

12507

+ PASS_POS_INSERT_AFTER /* po_op */

12508

+};

12509

+

12510

+/* Helpers for TARGET_DEBUG_OPTIONS. */

12511

static void

12512

dump_target_flag_bits (const int flags)

12513

{

12514

@@ -888,6 +1109,7 @@

12515

{ TARGET_CPU_supersparc, PROCESSOR_SUPERSPARC },

12516

{ TARGET_CPU_hypersparc, PROCESSOR_HYPERSPARC },

12517

{ TARGET_CPU_leon, PROCESSOR_LEON },

12518

+ { TARGET_CPU_leon3, PROCESSOR_LEON3 },

12519

{ TARGET_CPU_sparclite, PROCESSOR_F930 },

12520

{ TARGET_CPU_sparclite86x, PROCESSOR_SPARCLITE86X },

12521

{ TARGET_CPU_sparclet, PROCESSOR_TSC701 },

12522

@@ -902,7 +1124,7 @@

12523

};

12524

const struct cpu_default *def;

12525

/* Table of values for -m{cpu,tune}=. This must match the order of

12526

- the PROCESSOR_* enumeration. */

12527

+ the enum processor_type in sparc-opts.h. */

12528

static struct cpu_table {

12529

const char *const name;

12530

const int disable;

12531

@@ -914,8 +1136,8 @@

12532

/* TI TMS390Z55 supersparc */

12533

{ "supersparc", MASK_ISA, MASK_V8 },

12534

{ "hypersparc", MASK_ISA, MASK_V8|MASK_FPU },

12535

- /* LEON */

12536

- { "leon", MASK_ISA, MASK_V8|MASK_FPU },

12537

+ { "leon", MASK_ISA, MASK_V8|MASK_LEON|MASK_FPU },

12538

+ { "leon3", MASK_ISA, MASK_V8|MASK_LEON3|MASK_FPU },

12539

{ "sparclite", MASK_ISA, MASK_SPARCLITE },

12540

/* The Fujitsu MB86930 is the original sparclite chip, with no FPU. */

12541

{ "f930", MASK_ISA|MASK_FPU, MASK_SPARCLITE },

12542

@@ -1075,6 +1297,9 @@

12543

#ifndef HAVE_AS_SPARC4

12544

& ~MASK_CBCOND

12545

#endif

12546

+#ifndef HAVE_AS_LEON

12547

+ & ~(MASK_LEON | MASK_LEON3)

12548

+#endif

12549

);

12550

12551

/* If -mfpu or -mno-fpu was explicitly used, don't override with

12552

@@ -1164,6 +1389,9 @@

12553

case PROCESSOR_LEON:

12554

sparc_costs = &leon_costs;

12555

break;

12556

+ case PROCESSOR_LEON3:

12557

+ sparc_costs = &leon3_costs;

12558

+ break;

12559

case PROCESSOR_SPARCLET:

12560

case PROCESSOR_TSC701:

12561

sparc_costs = &sparclet_costs;

12562

@@ -1200,6 +1428,10 @@

12563

/* Choose the most relaxed model for the processor. */

12564

else if (TARGET_V9)

12565

sparc_memory_model = SMM_RMO;

12566

+ else if (TARGET_LEON3)

12567

+ sparc_memory_model = SMM_TSO;

12568

+ else if (TARGET_LEON)

12569

+ sparc_memory_model = SMM_SC;

12570

else if (TARGET_V8)

12571

sparc_memory_model = SMM_PSO;

12572

else

12573

@@ -1241,6 +1473,13 @@

12574

pessimizes for double floating-point registers. */

12575

if (!global_options_set.x_flag_ira_share_save_slots)

12576

flag_ira_share_save_slots = 0;

12577

+

12578

+ /* We register a machine specific pass to work around errata, if any.

12579

+ The pass mut be scheduled as late as possible so that we have the

12580

+ (essentially) final form of the insn stream to work on.

12581

+ Registering the pass must be done at start up. It's convenient to

12582

+ do it here. */

12583

+ register_pass (&insert_pass_work_around_errata);

12584

}

12585

12586

/* Miscellaneous utilities. */

12587

@@ -10355,7 +10594,8 @@

12588

tmp = e0.add_with_sign (tmp, false, &add1_ovf);

12589

if (tmp.is_negative ())

12590

tmp = tmp.neg_with_overflow (&neg2_ovf);

12591

-

12592

+ else

12593

+ neg2_ovf = false;

12594

result = result.add_with_sign (tmp, false, &add2_ovf);

12595

overflow |= neg1_ovf | neg2_ovf | add1_ovf | add2_ovf;

12596

}

12597

@@ -10897,107 +11137,6 @@

12598

return (vcall_offset >= -32768 || ! fixed_regs[5]);

12599

}

12600

12601

-/* We use the machine specific reorg pass to enable workarounds for errata. */

12602

-

12603

-static void

12604

-sparc_reorg (void)

12605

-{

12606

- rtx insn, next;

12607

-

12608

- /* The only erratum we handle for now is that of the AT697F processor. */

12609

- if (!sparc_fix_at697f)

12610

- return;

12611

-

12612

- /* We need to have the (essentially) final form of the insn stream in order

12613

- to properly detect the various hazards. Run delay slot scheduling. */

12614

- if (optimize > 0 && flag_delayed_branch)

12615

- {

12616

- cleanup_barriers ();

12617

- dbr_schedule (get_insns ());

12618

- }

12619

-

12620

- /* Now look for specific patterns in the insn stream. */

12621

- for (insn = get_insns (); insn; insn = next)

12622

- {

12623

- bool insert_nop = false;

12624

- rtx set;

12625

-

12626

- /* Look for a single-word load into an odd-numbered FP register. */

12627

- if (NONJUMP_INSN_P (insn)

12628

- && (set = single_set (insn)) != NULL_RTX

12629

- && GET_MODE_SIZE (GET_MODE (SET_SRC (set))) == 4

12630

- && MEM_P (SET_SRC (set))

12631

- && REG_P (SET_DEST (set))

12632

- && REGNO (SET_DEST (set)) > 31

12633

- && REGNO (SET_DEST (set)) % 2 != 0)

12634

- {

12635

- /* The wrong dependency is on the enclosing double register. */

12636

- unsigned int x = REGNO (SET_DEST (set)) - 1;

12637

- unsigned int src1, src2, dest;

12638

- int code;

12639

-

12640

- /* If the insn has a delay slot, then it cannot be problematic. */

12641

- next = next_active_insn (insn);

12642

- if (NONJUMP_INSN_P (next) && GET_CODE (PATTERN (next)) == SEQUENCE)

12643

- code = -1;

12644

- else

12645

- {

12646

- extract_insn (next);

12647

- code = INSN_CODE (next);

12648

- }

12649

-

12650

- switch (code)

12651

- {

12652

- case CODE_FOR_adddf3:

12653

- case CODE_FOR_subdf3:

12654

- case CODE_FOR_muldf3:

12655

- case CODE_FOR_divdf3:

12656

- dest = REGNO (recog_data.operand[0]);

12657

- src1 = REGNO (recog_data.operand[1]);

12658

- src2 = REGNO (recog_data.operand[2]);

12659

- if (src1 != src2)

12660

- {

12661

- /* Case [1-4]:

12662

- ld [address], %fx+1

12663

- FPOPd %f{x,y}, %f{y,x}, %f{x,y} */

12664

- if ((src1 == x || src2 == x)

12665

- && (dest == src1 || dest == src2))

12666

- insert_nop = true;

12667

- }

12668

- else

12669

- {

12670

- /* Case 5:

12671

- ld [address], %fx+1

12672

- FPOPd %fx, %fx, %fx */

12673

- if (src1 == x

12674

- && dest == src1

12675

- && (code == CODE_FOR_adddf3 || code == CODE_FOR_muldf3))

12676

- insert_nop = true;

12677

- }

12678

- break;

12679

-

12680

- case CODE_FOR_sqrtdf2:

12681

- dest = REGNO (recog_data.operand[0]);

12682

- src1 = REGNO (recog_data.operand[1]);

12683

- /* Case 6:

12684

- ld [address], %fx+1

12685

- fsqrtd %fx, %fx */

12686

- if (src1 == x && dest == src1)

12687

- insert_nop = true;

12688

- break;

12689

-

12690

- default:

12691

- break;

12692

- }

12693

- }

12694

- else

12695

- next = NEXT_INSN (insn);

12696

-

12697

- if (insert_nop)

12698

- emit_insn_after (gen_nop (), insn);

12699

- }

12700

-}

12701

-

12702

/* How to allocate a 'struct machine_function'. */

12703

12704

static struct machine_function *

12705

Index: gcc/config/sparc/leon.md

12706

===================================================================

12707

--- a/src/gcc/config/sparc/leon.md (.../tags/gcc_4_8_2_release)

12708

+++ b/src/gcc/config/sparc/leon.md (.../branches/gcc-4_8-branch)

12709

@@ -17,40 +17,48 @@

12710

;; along with GCC; see the file COPYING3. If not see

12711

;; <http://www.gnu.org/licenses/>.

12712

12713

+;; Leon is a single-issue processor.

12714

12715

(define_automaton "leon")

12716

12717

-(define_cpu_unit "leon_memory, leon_fpalu" "leon")

12718

-(define_cpu_unit "leon_fpmds" "leon")

12719

-(define_cpu_unit "write_buf" "leon")

12720

+(define_cpu_unit "leon_memory" "leon")

12721

12722

(define_insn_reservation "leon_load" 1

12723

- (and (eq_attr "cpu" "leon")

12724

- (eq_attr "type" "load,sload,fpload"))

12725

+ (and (eq_attr "cpu" "leon") (eq_attr "type" "load,sload"))

12726

"leon_memory")

12727

12728

-(define_insn_reservation "leon_store" 1

12729

- (and (eq_attr "cpu" "leon")

12730

- (eq_attr "type" "store,fpstore"))

12731

- "leon_memory+write_buf")

12732

-

12733

-(define_insn_reservation "leon_fp_alu" 1

12734

- (and (eq_attr "cpu" "leon")

12735

- (eq_attr "type" "fp,fpmove"))

12736

- "leon_fpalu, nothing")

12737

+;; Use a double reservation to work around the load pipeline hazard on UT699.

12738

+(define_insn_reservation "leon3_load" 1

12739

+ (and (eq_attr "cpu" "leon3") (eq_attr "type" "load,sload"))

12740

+ "leon_memory*2")

12741

12742

-(define_insn_reservation "leon_fp_mult" 1

12743

- (and (eq_attr "cpu" "leon")

12744

- (eq_attr "type" "fpmul"))

12745

- "leon_fpmds, nothing")

12746

+(define_insn_reservation "leon_store" 2

12747

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "store"))

12748

+ "leon_memory*2")

12749

12750

-(define_insn_reservation "leon_fp_div" 16

12751

- (and (eq_attr "cpu" "leon")

12752

- (eq_attr "type" "fpdivs,fpdivd"))

12753

- "leon_fpmds, nothing*15")

12754

+;; This describes Gaisler Research's FPU

12755

12756

-(define_insn_reservation "leon_fp_sqrt" 23

12757

- (and (eq_attr "cpu" "leon")

12758

- (eq_attr "type" "fpsqrts,fpsqrtd"))

12759

- "leon_fpmds, nothing*21")

12760

+(define_automaton "grfpu")

12761

12762

+(define_cpu_unit "grfpu_alu" "grfpu")

12763

+(define_cpu_unit "grfpu_ds" "grfpu")

12764

+

12765

+(define_insn_reservation "leon_fp_alu" 4

12766

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fp,fpcmp,fpmul"))

12767

+ "grfpu_alu, nothing*3")

12768

+

12769

+(define_insn_reservation "leon_fp_divs" 16

12770

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpdivs"))

12771

+ "grfpu_ds*14, nothing*2")

12772

+

12773

+(define_insn_reservation "leon_fp_divd" 17

12774

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpdivd"))

12775

+ "grfpu_ds*15, nothing*2")

12776

+

12777

+(define_insn_reservation "leon_fp_sqrts" 24

12778

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpsqrts"))

12779

+ "grfpu_ds*22, nothing*2")

12780

+

12781

+(define_insn_reservation "leon_fp_sqrtd" 25

12782

+ (and (eq_attr "cpu" "leon,leon3") (eq_attr "type" "fpsqrtd"))

12783

+ "grfpu_ds*23, nothing*2")

12784

Index: gcc/config/sparc/sparc.h

12785

===================================================================

12786

--- a/src/gcc/config/sparc/sparc.h (.../tags/gcc_4_8_2_release)

12787

+++ b/src/gcc/config/sparc/sparc.h (.../branches/gcc-4_8-branch)

12788

@@ -136,21 +136,22 @@

12789

#define TARGET_CPU_supersparc 2

12790

#define TARGET_CPU_hypersparc 3

12791

#define TARGET_CPU_leon 4

12792

-#define TARGET_CPU_sparclite 5

12793

-#define TARGET_CPU_f930 5 /* alias */

12794

-#define TARGET_CPU_f934 5 /* alias */

12795

-#define TARGET_CPU_sparclite86x 6

12796

-#define TARGET_CPU_sparclet 7

12797

-#define TARGET_CPU_tsc701 7 /* alias */

12798

-#define TARGET_CPU_v9 8 /* generic v9 implementation */

12799

-#define TARGET_CPU_sparcv9 8 /* alias */

12800

-#define TARGET_CPU_sparc64 8 /* alias */

12801

-#define TARGET_CPU_ultrasparc 9

12802

-#define TARGET_CPU_ultrasparc3 10

12803

-#define TARGET_CPU_niagara 11

12804

-#define TARGET_CPU_niagara2 12

12805

-#define TARGET_CPU_niagara3 13

12806

-#define TARGET_CPU_niagara4 14

12807

+#define TARGET_CPU_leon3 5

12808

+#define TARGET_CPU_sparclite 6

12809

+#define TARGET_CPU_f930 6 /* alias */

12810

+#define TARGET_CPU_f934 6 /* alias */

12811

+#define TARGET_CPU_sparclite86x 7

12812

+#define TARGET_CPU_sparclet 8

12813

+#define TARGET_CPU_tsc701 8 /* alias */

12814

+#define TARGET_CPU_v9 9 /* generic v9 implementation */

12815

+#define TARGET_CPU_sparcv9 9 /* alias */

12816

+#define TARGET_CPU_sparc64 9 /* alias */

12817

+#define TARGET_CPU_ultrasparc 10

12818

+#define TARGET_CPU_ultrasparc3 11

12819

+#define TARGET_CPU_niagara 12

12820

+#define TARGET_CPU_niagara2 13

12821

+#define TARGET_CPU_niagara3 14

12822

+#define TARGET_CPU_niagara4 15

12823

12824

#if TARGET_CPU_DEFAULT == TARGET_CPU_v9 \

12825

|| TARGET_CPU_DEFAULT == TARGET_CPU_ultrasparc \

12826

@@ -232,9 +233,10 @@

12827

#define ASM_CPU32_DEFAULT_SPEC ""

12828

#endif

12829

12830

-#if TARGET_CPU_DEFAULT == TARGET_CPU_leon

12831

+#if TARGET_CPU_DEFAULT == TARGET_CPU_leon \

12832

+ || TARGET_CPU_DEFAULT == TARGET_CPU_leon3

12833

#define CPP_CPU32_DEFAULT_SPEC "-D__leon__ -D__sparc_v8__"

12834

-#define ASM_CPU32_DEFAULT_SPEC ""

12835

+#define ASM_CPU32_DEFAULT_SPEC AS_LEON_FLAG

12836

#endif

12837

12838

#endif

12839

@@ -282,6 +284,7 @@

12840

%{mcpu=supersparc:-D__supersparc__ -D__sparc_v8__} \

12841

%{mcpu=hypersparc:-D__hypersparc__ -D__sparc_v8__} \

12842

%{mcpu=leon:-D__leon__ -D__sparc_v8__} \

12843

+%{mcpu=leon3:-D__leon__ -D__sparc_v8__} \

12844

%{mcpu=v9:-D__sparc_v9__} \

12845

%{mcpu=ultrasparc:-D__sparc_v9__} \

12846

%{mcpu=ultrasparc3:-D__sparc_v9__} \

12847

@@ -329,7 +332,8 @@

12848

%{mcpu=v8:-Av8} \

12849

%{mcpu=supersparc:-Av8} \

12850

%{mcpu=hypersparc:-Av8} \

12851

-%{mcpu=leon:-Av8} \

12852

+%{mcpu=leon:" AS_LEON_FLAG "} \

12853

+%{mcpu=leon3:" AS_LEON_FLAG "} \

12854

%{mv8plus:-Av8plus} \

12855

%{mcpu=v9:-Av9} \

12856

%{mcpu=ultrasparc:%{!mv8plus:-Av9a}} \

12857

@@ -1754,6 +1758,12 @@

12858

#define AS_NIAGARA4_FLAG "-Av9" AS_NIAGARA3_FLAG

12859

#endif

12860

12861

+#ifdef HAVE_AS_LEON

12862

+#define AS_LEON_FLAG "-Aleon"

12863

+#else

12864

+#define AS_LEON_FLAG "-Av8"

12865

+#endif

12866

+

12867

/* We use gcc _mcount for profiling. */

12868

#define NO_PROFILE_COUNTERS 0

12869

12870

Index: gcc/config/i386/i386.md

12871

===================================================================

12872

--- a/src/gcc/config/i386/i386.md (.../tags/gcc_4_8_2_release)

12873

+++ b/src/gcc/config/i386/i386.md (.../branches/gcc-4_8-branch)

12874

@@ -1570,7 +1570,7 @@

12875

split_double_mode (DImode, &operands[1], 1, &operands[2], &operands[3]);

12876

12877

operands[1] = gen_lowpart (DImode, operands[2]);

12878

- operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (DImode, stack_pointer_rtx,

12879

+ operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (Pmode, stack_pointer_rtx,

12880

GEN_INT (4)));

12881

})

12882

12883

@@ -1587,7 +1587,7 @@

12884

split_double_mode (DImode, &operands[1], 1, &operands[2], &operands[3]);

12885

12886

operands[1] = gen_lowpart (DImode, operands[2]);

12887

- operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (DImode, stack_pointer_rtx,

12888

+ operands[2] = gen_rtx_MEM (SImode, gen_rtx_PLUS (Pmode, stack_pointer_rtx,

12889

GEN_INT (4)));

12890

})

12891

12892

@@ -6589,7 +6589,7 @@

12893

(set_attr "use_carry" "1")

12894

(set_attr "mode" "<MODE>")])

12895

12896

-;; Overflow setting add and subtract instructions

12897

+;; Overflow setting add instructions

12898

12899

(define_insn "*add<mode>3_cconly_overflow"

12900

[(set (reg:CCC FLAGS_REG)

12901

@@ -6604,43 +6604,31 @@

12902

[(set_attr "type" "alu")

12903

(set_attr "mode" "<MODE>")])

12904

12905

-(define_insn "*sub<mode>3_cconly_overflow"

12906

+(define_insn "*add<mode>3_cc_overflow"

12907

[(set (reg:CCC FLAGS_REG)

12908

(compare:CCC

12909

- (minus:SWI

12910

- (match_operand:SWI 0 "nonimmediate_operand" "<r>m,<r>")

12911

- (match_operand:SWI 1 "<general_operand>" "<r><i>,<r>m"))

12912

- (match_dup 0)))]

12913

- ""

12914

- "cmp{<imodesuffix>}\t{%1, %0|%0, %1}"

12915

- [(set_attr "type" "icmp")

12916

- (set_attr "mode" "<MODE>")])

12917

-

12918

-(define_insn "*<plusminus_insn><mode>3_cc_overflow"

12919

- [(set (reg:CCC FLAGS_REG)

12920

- (compare:CCC

12921

- (plusminus:SWI

12922

- (match_operand:SWI 1 "nonimmediate_operand" "<comm>0,0")

12923

+ (plus:SWI

12924

+ (match_operand:SWI 1 "nonimmediate_operand" "%0,0")

12925

(match_operand:SWI 2 "<general_operand>" "<r><i>,<r>m"))

12926

(match_dup 1)))

12927

(set (match_operand:SWI 0 "nonimmediate_operand" "=<r>m,<r>")

12928

- (plusminus:SWI (match_dup 1) (match_dup 2)))]

12929

- "ix86_binary_operator_ok (<CODE>, <MODE>mode, operands)"

12930

- "<plusminus_mnemonic>{<imodesuffix>}\t{%2, %0|%0, %2}"

12931

+ (plus:SWI (match_dup 1) (match_dup 2)))]

12932

+ "ix86_binary_operator_ok (PLUS, <MODE>mode, operands)"

12933

+ "add{<imodesuffix>}\t{%2, %0|%0, %2}"

12934

[(set_attr "type" "alu")

12935

(set_attr "mode" "<MODE>")])

12936

12937

-(define_insn "*<plusminus_insn>si3_zext_cc_overflow"

12938

+(define_insn "*addsi3_zext_cc_overflow"

12939

[(set (reg:CCC FLAGS_REG)

12940

(compare:CCC

12941

- (plusminus:SI

12942

- (match_operand:SI 1 "nonimmediate_operand" "<comm>0")

12943

+ (plus:SI

12944

+ (match_operand:SI 1 "nonimmediate_operand" "%0")

12945

(match_operand:SI 2 "x86_64_general_operand" "rme"))

12946

(match_dup 1)))

12947

(set (match_operand:DI 0 "register_operand" "=r")

12948

- (zero_extend:DI (plusminus:SI (match_dup 1) (match_dup 2))))]

12949

- "TARGET_64BIT && ix86_binary_operator_ok (<CODE>, SImode, operands)"

12950

- "<plusminus_mnemonic>{l}\t{%2, %k0|%k0, %2}"

12951

+ (zero_extend:DI (plus:SI (match_dup 1) (match_dup 2))))]

12952

+ "TARGET_64BIT && ix86_binary_operator_ok (PLUS, SImode, operands)"

12953

+ "add{l}\t{%2, %k0|%k0, %2}"

12954

[(set_attr "type" "alu")

12955

(set_attr "mode" "SI")])

12956

12957

@@ -8012,7 +8000,18 @@

12958

(const_int 0)))

12959

(set (match_operand:DI 0 "nonimmediate_operand" "=r,r,rm")

12960

(and:DI (match_dup 1) (match_dup 2)))]

12961

- "TARGET_64BIT && ix86_match_ccmode (insn, CCNOmode)

12962

+ "TARGET_64BIT

12963

+ && ix86_match_ccmode

12964

+ (insn,

12965

+ /* If we are going to emit andl instead of andq, and the operands[2]

12966

+ constant might have the SImode sign bit set, make sure the sign

12967

+ flag isn't tested, because the instruction will set the sign flag

12968

+ based on bit 31 rather than bit 63. If it isn't CONST_INT,

12969

+ conservatively assume it might have bit 31 set. */

12970

+ (satisfies_constraint_Z (operands[2])

12971

+ && (!CONST_INT_P (operands[2])

12972

+ || val_signbit_known_set_p (SImode, INTVAL (operands[2]))))

12973

+ ? CCZmode : CCNOmode)

12974

&& ix86_binary_operator_ok (AND, DImode, operands)"

12975

"@

12976

and{l}\t{%k2, %k0|%k0, %k2}

12977

Index: gcc/config/i386/t-rtems

12978

===================================================================

12979

--- a/src/gcc/config/i386/t-rtems (.../tags/gcc_4_8_2_release)

12980

+++ b/src/gcc/config/i386/t-rtems (.../branches/gcc-4_8-branch)

12981

@@ -17,11 +17,10 @@

12982

# <http://www.gnu.org/licenses/>.

12983

#

12984

12985

-MULTILIB_OPTIONS = mtune=i486/mtune=pentium/mtune=pentiumpro \

12986

-msoft-float

12987

+MULTILIB_OPTIONS = mtune=i486/mtune=pentium/mtune=pentiumpro msoft-float

12988

MULTILIB_DIRNAMES= m486 mpentium mpentiumpro soft-float

12989

-MULTILIB_MATCHES = msoft-float=mno-m80387

12990

-MULTILIB_MATCHES += mtune?pentium=mtune?k6 mtune?pentiumpro=mtune?mathlon

12991

+MULTILIB_MATCHES = msoft-float=mno-80387

12992

+MULTILIB_MATCHES += mtune?pentium=mtune?k6 mtune?pentiumpro=mtune?athlon

12993

MULTILIB_EXCEPTIONS = \

12994

mtune=pentium/*msoft-float* \

12995

mtune=pentiumpro/*msoft-float*

12996

Index: gcc/config/i386/sse.md

12997

===================================================================

12998

--- a/src/gcc/config/i386/sse.md (.../tags/gcc_4_8_2_release)

12999

+++ b/src/gcc/config/i386/sse.md (.../branches/gcc-4_8-branch)

13000

@@ -10213,7 +10213,6 @@

13001

[(set_attr "type" "ssecvt1")

13002

(set_attr "mode" "<MODE>")])

13003

13004

-;; scalar insns

13005

(define_expand "xop_vmfrcz<mode>2"

13006

[(set (match_operand:VF_128 0 "register_operand")

13007

(vec_merge:VF_128

13008

@@ -10223,11 +10222,9 @@

13009

(match_dup 3)

13010

(const_int 1)))]

13011

"TARGET_XOP"

13012

-{

13013

- operands[3] = CONST0_RTX (<MODE>mode);

13014

-})

13015

+ "operands[3] = CONST0_RTX (<MODE>mode);")

13016

13017

-(define_insn "*xop_vmfrcz_<mode>"

13018

+(define_insn "*xop_vmfrcz<mode>2"

13019

[(set (match_operand:VF_128 0 "register_operand" "=x")

13020

(vec_merge:VF_128

13021

(unspec:VF_128

13022

Index: gcc/config/i386/xopintrin.h

13023

===================================================================

13024

--- a/src/gcc/config/i386/xopintrin.h (.../tags/gcc_4_8_2_release)

13025

+++ b/src/gcc/config/i386/xopintrin.h (.../branches/gcc-4_8-branch)

13026

@@ -745,13 +745,17 @@

13027

extern __inline __m128 __attribute__((__gnu_inline__, __always_inline__, __artificial__))

13028

_mm_frcz_ss (__m128 __A, __m128 __B)

13029

{

13030

- return (__m128) __builtin_ia32_vfrczss ((__v4sf)__A, (__v4sf)__B);

13031

+ return (__m128) __builtin_ia32_movss ((__v4sf)__A,

13032

+ (__v4sf)

13033

+ __builtin_ia32_vfrczss ((__v4sf)__B));

13034

}

13035

13036

extern __inline __m128d __attribute__((__gnu_inline__, __always_inline__, __artificial__))

13037

_mm_frcz_sd (__m128d __A, __m128d __B)

13038

{

13039

- return (__m128d) __builtin_ia32_vfrczsd ((__v2df)__A, (__v2df)__B);

13040

+ return (__m128d) __builtin_ia32_movsd ((__v2df)__A,

13041

+ (__v2df)

13042

+ __builtin_ia32_vfrczsd ((__v2df)__B));

13043

}

13044

13045

extern __inline __m256 __attribute__((__gnu_inline__, __always_inline__, __artificial__))

13046

Index: gcc/config/i386/i386.c

13047

===================================================================

13048

--- a/src/gcc/config/i386/i386.c (.../tags/gcc_4_8_2_release)

13049

+++ b/src/gcc/config/i386/i386.c (.../branches/gcc-4_8-branch)

13050

@@ -1894,10 +1894,10 @@

13051

13052

13053

/* X86_TUNE_SSE_UNALIGNED_LOAD_OPTIMAL */

13054

- m_COREI7 | m_AMDFAM10 | m_BDVER | m_BTVER,

13055

+ m_COREI7 | m_HASWELL | m_AMDFAM10 | m_BDVER | m_BTVER,

13056

13057

/* X86_TUNE_SSE_UNALIGNED_STORE_OPTIMAL */

13058

- m_COREI7 | m_BDVER,

13059

+ m_COREI7 | m_HASWELL| m_BDVER,

13060

13061

/* X86_TUNE_SSE_PACKED_SINGLE_INSN_OPTIMAL */

13062

m_BDVER ,

13063

@@ -2983,7 +2983,7 @@

13064

{"bdver3", PROCESSOR_BDVER3, CPU_BDVER3,

13065

PTA_64BIT | PTA_MMX | PTA_SSE | PTA_SSE2 | PTA_SSE3

13066

13067

- | PTA_SSE4_2 | PTA_AES | PTA_PCLMUL | PTA_AVX

13068

13069

13070

| PTA_FMA | PTA_PRFCHW | PTA_FXSR | PTA_XSAVE

13071

| PTA_XSAVEOPT},

13072

@@ -7235,9 +7235,15 @@

13073

switch (regno)

13074

{

13075

case AX_REG:

13076

+ case DX_REG:

13077

return true;

13078

+ case DI_REG:

13079

+ case SI_REG:

13080

+ return TARGET_64BIT && ix86_abi != MS_ABI;

13081

13082

- case FIRST_FLOAT_REG:

13083

+ /* Complex values are returned in %st(0)/%st(1) pair. */

13084

+ case ST0_REG:

13085

+ case ST1_REG:

13086

/* TODO: The function should depend on current function ABI but

13087

builtins.c would need updating then. Therefore we use the

13088

default ABI. */

13089

@@ -7245,10 +7251,12 @@

13090

return false;

13091

return TARGET_FLOAT_RETURNS_IN_80387;

13092

13093

- case FIRST_SSE_REG:

13094

+ /* Complex values are returned in %xmm0/%xmm1 pair. */

13095

+ case XMM0_REG:

13096

+ case XMM1_REG:

13097

return TARGET_SSE;

13098

13099

- case FIRST_MMX_REG:

13100

+ case MM0_REG:

13101

if (TARGET_MACHO || TARGET_64BIT)

13102

return false;

13103

return TARGET_MMX;

13104

@@ -11561,30 +11569,6 @@

13105

}

13106

}

13107

13108

-/* Determine if op is suitable SUBREG RTX for address. */

13109

-

13110

-static bool

13111

-ix86_address_subreg_operand (rtx op)

13112

-{

13113

- enum machine_mode mode;

13114

-

13115

- if (!REG_P (op))

13116

- return false;

13117

-

13118

- mode = GET_MODE (op);

13119

-

13120

- if (GET_MODE_CLASS (mode) != MODE_INT)

13121

- return false;

13122

-

13123

- /* Don't allow SUBREGs that span more than a word. It can lead to spill

13124

- failures when the register is one word out of a two word structure. */

13125

- if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)

13126

- return false;

13127

-

13128

- /* Allow only SUBREGs of non-eliminable hard registers. */

13129

- return register_no_elim_operand (op, mode);

13130

-}

13131

-

13132

/* Extract the parts of an RTL expression that is a valid memory address

13133

for an instruction. Return 0 if the structure of the address is

13134

grossly off. Return -1 if the address contains ASHIFT, so it is not

13135

@@ -11641,7 +11625,7 @@

13136

base = addr;

13137

else if (GET_CODE (addr) == SUBREG)

13138

{

13139

- if (ix86_address_subreg_operand (SUBREG_REG (addr)))

13140

+ if (REG_P (SUBREG_REG (addr)))

13141

base = addr;

13142

else

13143

return 0;

13144

@@ -11705,7 +11689,7 @@

13145

break;

13146

13147

case SUBREG:

13148

- if (!ix86_address_subreg_operand (SUBREG_REG (op)))

13149

+ if (!REG_P (SUBREG_REG (op)))

13150

return 0;

13151

/* FALLTHRU */

13152

13153

@@ -11750,19 +11734,6 @@

13154

scale = 1 << scale;

13155

retval = -1;

13156

}

13157

- else if (CONST_INT_P (addr))

13158

- {

13159

- if (!x86_64_immediate_operand (addr, VOIDmode))

13160

- return 0;

13161

-

13162

- /* Constant addresses are sign extended to 64bit, we have to

13163

- prevent addresses from 0x80000000 to 0xffffffff in x32 mode. */

13164

- if (TARGET_X32

13165

- && val_signbit_known_set_p (SImode, INTVAL (addr)))

13166

- return 0;

13167

-

13168

- disp = addr;

13169

- }

13170

else

13171

disp = addr; /* displacement */

13172

13173

@@ -11771,18 +11742,12 @@

13174

if (REG_P (index))

13175

;

13176

else if (GET_CODE (index) == SUBREG

13177

- && ix86_address_subreg_operand (SUBREG_REG (index)))

13178

+ && REG_P (SUBREG_REG (index)))

13179

;

13180

else

13181

return 0;

13182

}

13183

13184

-/* Address override works only on the (%reg) part of %fs:(%reg). */

13185

- if (seg != SEG_DEFAULT

13186

- && ((base && GET_MODE (base) != word_mode)

13187

- || (index && GET_MODE (index) != word_mode)))

13188

- return 0;

13189

-

13190

/* Extract the integral value of scale. */

13191

if (scale_rtx)

13192

{

13193

@@ -12258,6 +12223,45 @@

13194

return false;

13195

}

13196

13197

+/* Determine if op is suitable RTX for an address register.

13198

+ Return naked register if a register or a register subreg is

13199

+ found, otherwise return NULL_RTX. */

13200

+

13201

+static rtx

13202

+ix86_validate_address_register (rtx op)

13203

+{

13204

+ enum machine_mode mode = GET_MODE (op);

13205

+

13206

+ /* Only SImode or DImode registers can form the address. */

13207

+ if (mode != SImode && mode != DImode)

13208

+ return NULL_RTX;

13209

+

13210

+ if (REG_P (op))

13211

+ return op;

13212

+ else if (GET_CODE (op) == SUBREG)

13213

+ {

13214

+ rtx reg = SUBREG_REG (op);

13215

+

13216

+ if (!REG_P (reg))

13217

+ return NULL_RTX;

13218

+

13219

+ mode = GET_MODE (reg);

13220

+

13221

+ /* Don't allow SUBREGs that span more than a word. It can

13222

+ lead to spill failures when the register is one word out

13223

+ of a two word structure. */

13224

+ if (GET_MODE_SIZE (mode) > UNITS_PER_WORD)

13225

+ return NULL_RTX;

13226

+

13227

+ /* Allow only SUBREGs of non-eliminable hard registers. */

13228

+ if (register_no_elim_operand (reg, mode))

13229

+ return reg;

13230

+ }

13231

+

13232

+ /* Op is not a register. */

13233

+ return NULL_RTX;

13234

+}

13235

+

13236

/* Recognizes RTL expressions that are valid memory addresses for an

13237

instruction. The MODE argument is the machine mode for the MEM

13238

expression that wants to use this address.

13239

@@ -12273,6 +12277,7 @@

13240

struct ix86_address parts;

13241

rtx base, index, disp;

13242

HOST_WIDE_INT scale;

13243

+ enum ix86_address_seg seg;

13244

13245

if (ix86_decompose_address (addr, &parts) <= 0)

13246

/* Decomposition failed. */

13247

@@ -12282,23 +12287,16 @@

13248

index = parts.index;

13249

disp = parts.disp;

13250

scale = parts.scale;

13251

+ seg = parts.seg;

13252

13253

/* Validate base register. */

13254

if (base)

13255

{

13256

- rtx reg;

13257

+ rtx reg = ix86_validate_address_register (base);

13258

13259

- if (REG_P (base))

13260

- reg = base;

13261

- else if (GET_CODE (base) == SUBREG && REG_P (SUBREG_REG (base)))

13262

- reg = SUBREG_REG (base);

13263

- else

13264

- /* Base is not a register. */

13265

+ if (reg == NULL_RTX)

13266

return false;

13267

13268

- if (GET_MODE (base) != SImode && GET_MODE (base) != DImode)

13269

- return false;

13270

-

13271

if ((strict && ! REG_OK_FOR_BASE_STRICT_P (reg))

13272

|| (! strict && ! REG_OK_FOR_BASE_NONSTRICT_P (reg)))

13273

/* Base is not valid. */

13274

@@ -12308,19 +12306,11 @@

13275

/* Validate index register. */

13276

if (index)

13277

{

13278

- rtx reg;

13279

+ rtx reg = ix86_validate_address_register (index);

13280

13281

- if (REG_P (index))

13282

- reg = index;

13283

- else if (GET_CODE (index) == SUBREG && REG_P (SUBREG_REG (index)))

13284

- reg = SUBREG_REG (index);

13285

- else

13286

- /* Index is not a register. */

13287

+ if (reg == NULL_RTX)

13288

return false;

13289

13290

- if (GET_MODE (index) != SImode && GET_MODE (index) != DImode)

13291

- return false;

13292

-

13293

if ((strict && ! REG_OK_FOR_INDEX_STRICT_P (reg))

13294

|| (! strict && ! REG_OK_FOR_INDEX_NONSTRICT_P (reg)))

13295

/* Index is not valid. */

13296

@@ -12332,6 +12322,12 @@

13297

&& GET_MODE (base) != GET_MODE (index))

13298

return false;

13299

13300

+ /* Address override works only on the (%reg) part of %fs:(%reg). */

13301

+ if (seg != SEG_DEFAULT

13302

+ && ((base && GET_MODE (base) != word_mode)

13303

+ || (index && GET_MODE (index) != word_mode)))

13304

+ return false;

13305

+

13306

/* Validate scale factor. */

13307

if (scale != 1)

13308

{

13309

@@ -12453,6 +12449,12 @@

13310

&& !x86_64_immediate_operand (disp, VOIDmode))

13311

/* Displacement is out of range. */

13312

return false;

13313

+ /* In x32 mode, constant addresses are sign extended to 64bit, so

13314

+ we have to prevent addresses from 0x80000000 to 0xffffffff. */

13315

+ else if (TARGET_X32 && !(index || base)

13316

+ && CONST_INT_P (disp)

13317

+ && val_signbit_known_set_p (SImode, INTVAL (disp)))

13318

+ return false;

13319

}

13320

13321

/* Everything looks valid. */

13322

@@ -13817,8 +13819,6 @@

13323

Those same assemblers have the same but opposite lossage on cmov. */

13324

if (mode == CCmode)

13325

suffix = fp ? "nbe" : "a";

13326

- else if (mode == CCCmode)

13327

- suffix = "b";

13328

else

13329

gcc_unreachable ();

13330

break;

13331

@@ -13840,8 +13840,12 @@

13332

}

13333

break;

13334

case LTU:

13335

- gcc_assert (mode == CCmode || mode == CCCmode);

13336

- suffix = "b";

13337

+ if (mode == CCmode)

13338

+ suffix = "b";

13339

+ else if (mode == CCCmode)

13340

+ suffix = "c";

13341

+ else

13342

+ gcc_unreachable ();

13343

break;

13344

case GE:

13345

switch (mode)

13346

@@ -13861,20 +13865,20 @@

13347

}

13348

break;

13349

case GEU:

13350

- /* ??? As above. */

13351

- gcc_assert (mode == CCmode || mode == CCCmode);

13352

- suffix = fp ? "nb" : "ae";

13353

+ if (mode == CCmode)

13354

+ suffix = fp ? "nb" : "ae";

13355

+ else if (mode == CCCmode)

13356

+ suffix = "nc";

13357

+ else

13358

+ gcc_unreachable ();

13359

break;

13360

case LE:

13361

gcc_assert (mode == CCmode || mode == CCGCmode || mode == CCNOmode);

13362

suffix = "le";

13363

break;

13364

case LEU:

13365

- /* ??? As above. */

13366

if (mode == CCmode)

13367

suffix = "be";

13368

- else if (mode == CCCmode)

13369

- suffix = fp ? "nb" : "ae";

13370

else

13371

gcc_unreachable ();

13372

break;

13373

@@ -15340,7 +15344,7 @@

13374

rtx arg = XEXP (XEXP (link, 0), 0);

13375

13376

if (ix86_check_avx256_register (&arg, NULL))

13377

- return AVX_U128_ANY;

13378

+ return AVX_U128_DIRTY;

13379

}

13380

}

13381

13382

@@ -15460,8 +15464,8 @@

13383

{

13384

bool avx_reg256_found = false;

13385

note_stores (pat, ix86_check_avx256_stores, &avx_reg256_found);

13386

- if (!avx_reg256_found)

13387

- return AVX_U128_CLEAN;

13388

+

13389

+ return avx_reg256_found ? AVX_U128_DIRTY : AVX_U128_CLEAN;

13390

}

13391

13392

/* Otherwise, return current mode. Remember that if insn

13393

@@ -18486,12 +18490,7 @@

13394

return CCmode;

13395

case GTU: /* CF=0 & ZF=0 */

13396

case LEU: /* CF=1 | ZF=1 */

13397

- /* Detect overflow checks. They need just the carry flag. */

13398

- if (GET_CODE (op0) == MINUS

13399

- && rtx_equal_p (op1, XEXP (op0, 0)))

13400

- return CCCmode;

13401

- else

13402

- return CCmode;

13403

+ return CCmode;

13404

/* Codes possibly doable only with sign flag when

13405

comparing against zero. */

13406

case GE: /* SF=OF or SF=0 */

13407

@@ -21740,6 +21739,21 @@

13408

return SImode;

13409

}

13410

13411

+/* Copy the address to a Pmode register. This is used for x32 to

13412

+ truncate DImode TLS address to a SImode register. */

13413

+

13414

+static rtx

13415

+ix86_copy_addr_to_reg (rtx addr)

13416

+{

13417

+ if (GET_MODE (addr) == Pmode)

13418

+ return copy_addr_to_reg (addr);

13419

+ else

13420

+ {

13421

+ gcc_assert (GET_MODE (addr) == DImode && Pmode == SImode);

13422

+ return gen_rtx_SUBREG (SImode, copy_to_mode_reg (DImode, addr), 0);

13423

+ }

13424

+}

13425

+

13426

/* When SRCPTR is non-NULL, output simple loop to move memory

13427

pointer to SRCPTR to DESTPTR via chunks of MODE unrolled UNROLL times,

13428

overall size is COUNT specified in bytes. When SRCPTR is NULL, output the

13429

@@ -22728,8 +22742,8 @@

13430

gcc_assert (alg != no_stringop);

13431

if (!count)

13432

count_exp = copy_to_mode_reg (GET_MODE (count_exp), count_exp);

13433

- destreg = copy_addr_to_reg (XEXP (dst, 0));

13434

- srcreg = copy_addr_to_reg (XEXP (src, 0));

13435

+ destreg = ix86_copy_addr_to_reg (XEXP (dst, 0));

13436

+ srcreg = ix86_copy_addr_to_reg (XEXP (src, 0));

13437

switch (alg)

13438

{

13439

case libcall:

13440

@@ -23119,7 +23133,7 @@

13441

gcc_assert (alg != no_stringop);

13442

if (!count)

13443

count_exp = copy_to_mode_reg (counter_mode (count_exp), count_exp);

13444

- destreg = copy_addr_to_reg (XEXP (dst, 0));

13445

+ destreg = ix86_copy_addr_to_reg (XEXP (dst, 0));

13446

switch (alg)

13447

{

13448

case libcall:

13449

@@ -27984,8 +27998,8 @@

13450

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_shlv8hi3, "__builtin_ia32_vpshlw", IX86_BUILTIN_VPSHLW, UNKNOWN, (int)MULTI_ARG_2_HI },

13451

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_shlv16qi3, "__builtin_ia32_vpshlb", IX86_BUILTIN_VPSHLB, UNKNOWN, (int)MULTI_ARG_2_QI },

13452

13453

- { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv4sf2, "__builtin_ia32_vfrczss", IX86_BUILTIN_VFRCZSS, UNKNOWN, (int)MULTI_ARG_2_SF },

13454

- { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv2df2, "__builtin_ia32_vfrczsd", IX86_BUILTIN_VFRCZSD, UNKNOWN, (int)MULTI_ARG_2_DF },

13455

+ { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv4sf2, "__builtin_ia32_vfrczss", IX86_BUILTIN_VFRCZSS, UNKNOWN, (int)MULTI_ARG_1_SF },

13456

+ { OPTION_MASK_ISA_XOP, CODE_FOR_xop_vmfrczv2df2, "__builtin_ia32_vfrczsd", IX86_BUILTIN_VFRCZSD, UNKNOWN, (int)MULTI_ARG_1_DF },

13457

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv4sf2, "__builtin_ia32_vfrczps", IX86_BUILTIN_VFRCZPS, UNKNOWN, (int)MULTI_ARG_1_SF },

13458

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv2df2, "__builtin_ia32_vfrczpd", IX86_BUILTIN_VFRCZPD, UNKNOWN, (int)MULTI_ARG_1_DF },

13459

{ OPTION_MASK_ISA_XOP, CODE_FOR_xop_frczv8sf2, "__builtin_ia32_vfrczps256", IX86_BUILTIN_VFRCZPS256, UNKNOWN, (int)MULTI_ARG_1_SF2 },

13460

Index: gcc/config/sh/sh.opt

13461

===================================================================

13462

--- a/src/gcc/config/sh/sh.opt (.../tags/gcc_4_8_2_release)

13463

+++ b/src/gcc/config/sh/sh.opt (.../branches/gcc-4_8-branch)

13464

@@ -21,7 +21,7 @@

13465

;; Used for various architecture options.

13466

Mask(SH_E)

13467

13468

-;; Set if the default precision of th FPU is single.

13469

+;; Set if the default precision of the FPU is single.

13470

Mask(FPU_SINGLE)

13471

13472

;; Set if the a double-precision FPU is present but is restricted to

13473

Index: gcc/config/rs6000/rs6000.md

13474

===================================================================

13475

--- a/src/gcc/config/rs6000/rs6000.md (.../tags/gcc_4_8_2_release)

13476

+++ b/src/gcc/config/rs6000/rs6000.md (.../branches/gcc-4_8-branch)

13477

@@ -2412,7 +2412,7 @@

13478

(match_operand:SI 2 "gpc_reg_operand" "r,r"))

13479

(const_int 0)))

13480

(clobber (match_scratch:SI 3 "=r,r"))]

13481

- ""

13482

+ "TARGET_32BIT"

13483

"@

13484

mullw. %3,%1,%2

13485

#"

13486

@@ -2425,7 +2425,7 @@

13487

(match_operand:SI 2 "gpc_reg_operand" ""))

13488

(const_int 0)))

13489

(clobber (match_scratch:SI 3 ""))]

13490

- "reload_completed"

13491

+ "TARGET_32BIT && reload_completed"

13492

[(set (match_dup 3)

13493

(mult:SI (match_dup 1) (match_dup 2)))

13494

(set (match_dup 0)

13495

@@ -2440,7 +2440,7 @@

13496

(const_int 0)))

13497

(set (match_operand:SI 0 "gpc_reg_operand" "=r,r")

13498

(mult:SI (match_dup 1) (match_dup 2)))]

13499

- ""

13500

+ "TARGET_32BIT"

13501

"@

13502

mullw. %0,%1,%2

13503

#"

13504

@@ -2454,7 +2454,7 @@

13505

(const_int 0)))

13506

(set (match_operand:SI 0 "gpc_reg_operand" "")

13507

(mult:SI (match_dup 1) (match_dup 2)))]

13508

- "reload_completed"

13509

+ "TARGET_32BIT && reload_completed"

13510

[(set (match_dup 0)

13511

(mult:SI (match_dup 1) (match_dup 2)))

13512

(set (match_dup 3)

13513

Index: gcc/config/arm/arm.c

13514

===================================================================

13515

--- a/src/gcc/config/arm/arm.c (.../tags/gcc_4_8_2_release)

13516

+++ b/src/gcc/config/arm/arm.c (.../branches/gcc-4_8-branch)

13517

@@ -5425,7 +5425,8 @@

13518

if (!crtl->uses_pic_offset_table)

13519

{

13520

gcc_assert (can_create_pseudo_p ());

13521

- if (arm_pic_register != INVALID_REGNUM)

13522

+ if (arm_pic_register != INVALID_REGNUM

13523

+ && !(TARGET_THUMB1 && arm_pic_register > LAST_LO_REGNUM))

13524

{

13525

if (!cfun->machine->pic_reg)

13526

cfun->machine->pic_reg = gen_rtx_REG (Pmode, arm_pic_register);

13527

@@ -5451,7 +5452,12 @@

13528

crtl->uses_pic_offset_table = 1;

13529

start_sequence ();

13530

13531

- arm_load_pic_register (0UL);

13532

+ if (TARGET_THUMB1 && arm_pic_register != INVALID_REGNUM

13533

+ && arm_pic_register > LAST_LO_REGNUM)

13534

+ emit_move_insn (cfun->machine->pic_reg,

13535

+ gen_rtx_REG (Pmode, arm_pic_register));

13536

+ else

13537

+ arm_load_pic_register (0UL);

13538

13539

seq = get_insns ();

13540

end_sequence ();

13541

@@ -5709,6 +5715,14 @@

13542

emit_insn (gen_movsi (pic_offset_table_rtx, pic_tmp));

13543

emit_insn (gen_pic_add_dot_plus_four (pic_reg, pic_reg, labelno));

13544

}

13545

+ else if (arm_pic_register != INVALID_REGNUM

13546

+ && arm_pic_register > LAST_LO_REGNUM

13547

+ && REGNO (pic_reg) <= LAST_LO_REGNUM)

13548

+ {

13549

+ emit_insn (gen_pic_load_addr_unified (pic_reg, pic_rtx, labelno));

13550

+ emit_move_insn (gen_rtx_REG (Pmode, arm_pic_register), pic_reg);

13551

+ emit_use (gen_rtx_REG (Pmode, arm_pic_register));

13552

+ }

13553

else

13554

emit_insn (gen_pic_load_addr_unified (pic_reg, pic_rtx, labelno));

13555

}

13556

@@ -23555,6 +23569,7 @@

13557

num_regs = bit_count (saved_regs_mask);

13558

if ((offsets->outgoing_args != (1 + num_regs)) || cfun->calls_alloca)

13559

{

13560

+ emit_insn (gen_blockage ());

13561

/* Unwind the stack to just below the saved registers. */

13562

emit_insn (gen_addsi3 (stack_pointer_rtx,

13563

hard_frame_pointer_rtx,

13564

Index: gcc/config/arm/vfp.md

13565

===================================================================

13566

--- a/src/gcc/config/arm/vfp.md (.../tags/gcc_4_8_2_release)

13567

+++ b/src/gcc/config/arm/vfp.md (.../branches/gcc-4_8-branch)

13568

@@ -1264,6 +1264,7 @@

13569

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

13570

"vrint<vrint_variant>%?.<V_if_elem>\\t%<V_reg>0, %<V_reg>1"

13571

[(set_attr "predicable" "<vrint_predicable>")

13572

+ (set_attr "conds" "<vrint_conds>")

13573

(set_attr "type" "f_rint<vfp_type>")]

13574

)

13575

13576

@@ -1280,7 +1281,8 @@

13577

(match_operand:SDF 2 "register_operand" "<F_constraint>")))]

13578

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

13579

"vmaxnm.<V_if_elem>\\t%<V_reg>0, %<V_reg>1, %<V_reg>2"

13580

- [(set_attr "type" "f_minmax<vfp_type>")]

13581

+ [(set_attr "type" "f_minmax<vfp_type>")

13582

+ (set_attr "conds" "unconditional")]

13583

)

13584

13585

(define_insn "smin<mode>3"

13586

@@ -1289,7 +1291,8 @@

13587

(match_operand:SDF 2 "register_operand" "<F_constraint>")))]

13588

"TARGET_HARD_FLOAT && TARGET_FPU_ARMV8 <vfp_double_cond>"

13589

"vminnm.<V_if_elem>\\t%<V_reg>0, %<V_reg>1, %<V_reg>2"

13590

- [(set_attr "type" "f_minmax<vfp_type>")]

13591

+ [(set_attr "type" "f_minmax<vfp_type>")

13592

+ (set_attr "conds" "unconditional")]

13593

)

13594

13595

;; Unimplemented insns:

13596

Index: gcc/config/arm/iterators.md

13597

===================================================================

13598

--- a/src/gcc/config/arm/iterators.md (.../tags/gcc_4_8_2_release)

13599

+++ b/src/gcc/config/arm/iterators.md (.../branches/gcc-4_8-branch)

13600

@@ -493,6 +493,10 @@

13601

(UNSPEC_VRINTA "no") (UNSPEC_VRINTM "no")

13602

(UNSPEC_VRINTR "yes") (UNSPEC_VRINTX "yes")])

13603

13604

+(define_int_attr vrint_conds [(UNSPEC_VRINTZ "nocond") (UNSPEC_VRINTP "unconditional")

13605

+ (UNSPEC_VRINTA "unconditional") (UNSPEC_VRINTM "unconditional")

13606

+ (UNSPEC_VRINTR "nocond") (UNSPEC_VRINTX "nocond")])

13607

+

13608

(define_int_attr nvrint_variant [(UNSPEC_NVRINTZ "z") (UNSPEC_NVRINTP "p")

13609

(UNSPEC_NVRINTA "a") (UNSPEC_NVRINTM "m")

13610

(UNSPEC_NVRINTX "x") (UNSPEC_NVRINTN "n")])

13611

Index: libgo/configure

13612

===================================================================

13613

--- a/src/libgo/configure (.../tags/gcc_4_8_2_release)

13614

+++ b/src/libgo/configure (.../branches/gcc-4_8-branch)

13615

@@ -14700,7 +14700,7 @@

13616

fi

13617

13618

13619

-for ac_func in accept4 epoll_create1 faccessat fallocate fchmodat fchownat futimesat inotify_add_watch inotify_init inotify_init1 inotify_rm_watch mkdirat mknodat openat pipe2 renameat sync_file_range splice tee unlinkat unshare utimensat

13620

+for ac_func in accept4 dup3 epoll_create1 faccessat fallocate fchmodat fchownat futimesat getxattr inotify_add_watch inotify_init inotify_init1 inotify_rm_watch listxattr mkdirat mknodat openat pipe2 removexattr renameat setxattr sync_file_range splice tee unlinkat unshare utimensat

13621

do :

13622

as_ac_var=`$as_echo "ac_cv_func_$ac_func" | $as_tr_sh`

13623

ac_fn_c_check_func "$LINENO" "$ac_func" "$as_ac_var"

13624

Index: libgo/Makefile.in

13625

===================================================================

13626

--- a/src/libgo/Makefile.in (.../tags/gcc_4_8_2_release)

13627

+++ b/src/libgo/Makefile.in (.../branches/gcc-4_8-branch)

13628

@@ -195,7 +195,7 @@

13629

@LIBGO_IS_LINUX_TRUE@am__objects_5 = getncpu-linux.lo

13630

am__objects_6 = go-append.lo go-assert.lo go-assert-interface.lo \

13631

go-byte-array-to-string.lo go-breakpoint.lo go-caller.lo \

13632

- go-callers.lo go-can-convert-interface.lo go-cgo.lo \

13633

+ go-callers.lo go-can-convert-interface.lo go-cdiv.lo go-cgo.lo \

13634

go-check-interface.lo go-construct-map.lo \

13635

go-convert-interface.lo go-copy.lo go-defer.lo \

13636

go-deferred-recover.lo go-eface-compare.lo \

13637

@@ -757,6 +757,7 @@

13638

runtime/go-caller.c \

13639

runtime/go-callers.c \

13640

runtime/go-can-convert-interface.c \

13641

+ runtime/go-cdiv.c \

13642

runtime/go-cgo.c \

13643

runtime/go-check-interface.c \

13644

runtime/go-construct-map.c \

13645

@@ -1446,7 +1447,7 @@

13646

go/go/build/build.go \

13647

go/go/build/doc.go \

13648

go/go/build/read.go \

13649

- syslist.go

13650

+ go/go/build/syslist.go

13651

13652

go_go_doc_files = \

13653

go/go/doc/comment.go \

13654

@@ -2368,6 +2369,7 @@

13655

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-caller.Plo@am__quote@

13656

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-callers.Plo@am__quote@

13657

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-can-convert-interface.Plo@am__quote@

13658

+@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-cdiv.Plo@am__quote@

13659

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-cgo.Plo@am__quote@

13660

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-check-interface.Plo@am__quote@

13661

@AMDEP_TRUE@@am__include@ @am__quote@./$(DEPDIR)/go-construct-map.Plo@am__quote@

13662

@@ -2554,6 +2556,13 @@

13663

@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@

13664

@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o go-can-convert-interface.lo `test -f 'runtime/go-can-convert-interface.c' || echo '$(srcdir)/'`runtime/go-can-convert-interface.c

13665

13666

+go-cdiv.lo: runtime/go-cdiv.c

13667

+@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT go-cdiv.lo -MD -MP -MF $(DEPDIR)/go-cdiv.Tpo -c -o go-cdiv.lo `test -f 'runtime/go-cdiv.c' || echo '$(srcdir)/'`runtime/go-cdiv.c

13668

+@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/go-cdiv.Tpo $(DEPDIR)/go-cdiv.Plo

13669

+@AMDEP_TRUE@@am__fastdepCC_FALSE@ source='runtime/go-cdiv.c' object='go-cdiv.lo' libtool=yes @AMDEPBACKSLASH@

13670

+@AMDEP_TRUE@@am__fastdepCC_FALSE@ DEPDIR=$(DEPDIR) $(CCDEPMODE) $(depcomp) @AMDEPBACKSLASH@

13671

+@am__fastdepCC_FALSE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -c -o go-cdiv.lo `test -f 'runtime/go-cdiv.c' || echo '$(srcdir)/'`runtime/go-cdiv.c

13672

+

13673

go-cgo.lo: runtime/go-cgo.c

13674

@am__fastdepCC_TRUE@ $(LIBTOOL) --tag=CC $(AM_LIBTOOLFLAGS) $(LIBTOOLFLAGS) --mode=compile $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS) -MT go-cgo.lo -MD -MP -MF $(DEPDIR)/go-cgo.Tpo -c -o go-cgo.lo `test -f 'runtime/go-cgo.c' || echo '$(srcdir)/'`runtime/go-cgo.c

13675

@am__fastdepCC_TRUE@ $(am__mv) $(DEPDIR)/go-cgo.Tpo $(DEPDIR)/go-cgo.Plo

13676

@@ -5062,15 +5071,6 @@

13677

@$(CHECK)

13678

.PHONY: go/build/check

13679

13680

-syslist.go: s-syslist; @true

13681

-s-syslist: Makefile

13682

- echo '// Generated automatically by make.' >syslist.go.tmp

13683

- echo 'package build' >>syslist.go.tmp

13684

- echo 'const goosList = "$(GOOS)"' >>syslist.go.tmp

13685

- echo 'const goarchList = "$(GOARCH)"' >>syslist.go.tmp

13686

- $(SHELL) $(srcdir)/../move-if-change syslist.go.tmp syslist.go

13687

- $(STAMP) $@

13688

-

13689

@go_include@ go/doc.lo.dep

13690

go/doc.lo.dep: $(go_go_doc_files)

13691

$(BUILDDEPS)

13692

Index: libgo/runtime/go-int-array-to-string.c

13693

===================================================================

13694

--- a/src/libgo/runtime/go-int-array-to-string.c (.../tags/gcc_4_8_2_release)

13695

+++ b/src/libgo/runtime/go-int-array-to-string.c (.../branches/gcc-4_8-branch)

13696

@@ -30,6 +30,8 @@

13697

13698

if (v < 0 || v > 0x10ffff)

13699

v = 0xfffd;

13700

+ else if (0xd800 <= v && v <= 0xdfff)

13701

+ v = 0xfffd;

13702

13703

if (v <= 0x7f)

13704

slen += 1;

13705

@@ -56,6 +58,8 @@

13706

character. */

13707

if (v < 0 || v > 0x10ffff)

13708

v = 0xfffd;

13709

+ else if (0xd800 <= v && v <= 0xdfff)

13710

+ v = 0xfffd;

13711

13712

if (v <= 0x7f)

13713

*s++ = v;

13714

Index: libgo/runtime/go-nosys.c

13715

===================================================================

13716

--- a/src/libgo/runtime/go-nosys.c (.../tags/gcc_4_8_2_release)

13717

+++ b/src/libgo/runtime/go-nosys.c (.../branches/gcc-4_8-branch)

13718

@@ -43,6 +43,17 @@

13719

}

13720

#endif

13721

13722

+#ifndef HAVE_DUP3

13723

+int

13724

+dup3 (int oldfd __attribute__ ((unused)),

13725

+ int newfd __attribute__ ((unused)),

13726

+ int flags __attribute__ ((unused)))

13727

+{

13728

+ errno = ENOSYS;

13729

+ return -1;

13730

+}

13731

+#endif

13732

+

13733

#ifndef HAVE_EPOLL_CREATE1

13734

int

13735

epoll_create1 (int flags __attribute__ ((unused)))

13736

@@ -112,6 +123,18 @@

13737

}

13738

#endif

13739

13740

+#ifndef HAVE_GETXATTR

13741

+ssize_t

13742

+getxattr (const char *path __attribute__ ((unused)),

13743

+ const char *name __attribute__ ((unused)),

13744

+ void *value __attribute__ ((unused)),

13745

+ size_t size __attribute__ ((unused)))

13746

+{

13747

+ errno = ENOSYS;

13748

+ return -1;

13749

+}

13750

+#endif

13751

+

13752

#ifndef HAVE_INOTIFY_ADD_WATCH

13753

int

13754

inotify_add_watch (int fd __attribute__ ((unused)),

13755

@@ -151,6 +174,17 @@

13756

}

13757

#endif

13758

13759

+#ifndef HAVE_LISTXATTR

13760

+ssize_t

13761

+listxattr (const char *path __attribute__ ((unused)),

13762

+ char *list __attribute__ ((unused)),

13763

+ size_t size __attribute__ ((unused)))

13764

+{

13765

+ errno = ENOSYS;

13766

+ return -1;

13767

+}

13768

+#endif

13769

+

13770

#ifndef HAVE_MKDIRAT

13771

int

13772

mkdirat (int dirfd __attribute__ ((unused)),

13773

@@ -196,6 +230,16 @@

13774

}

13775

#endif

13776

13777

+#ifndef HAVE_REMOVEXATTR

13778

+int

13779

+removexattr (const char *path __attribute__ ((unused)),

13780

+ const char *name __attribute__ ((unused)))

13781

+{

13782

+ errno = ENOSYS;

13783

+ return -1;

13784

+}

13785

+#endif

13786

+

13787

#ifndef HAVE_RENAMEAT

13788

int

13789

renameat (int olddirfd __attribute__ ((unused)),

13790

@@ -208,6 +252,19 @@

13791

}

13792

#endif

13793

13794

+#ifndef HAVE_SETXATTR

13795

+int

13796

+setxattr (const char *path __attribute__ ((unused)),

13797

+ const char *name __attribute__ ((unused)),

13798

+ const void *value __attribute__ ((unused)),

13799

+ size_t size __attribute__ ((unused)),

13800

+ int flags __attribute__ ((unused)))

13801

+{

13802

+ errno = ENOSYS;

13803

+ return -1;

13804

+}

13805

+#endif

13806

+

13807

#ifndef HAVE_SPLICE

13808

int

13809

splice (int fd __attribute__ ((unused)),

13810

Index: libgo/runtime/go-signal.c

13811

===================================================================

13812

--- a/src/libgo/runtime/go-signal.c (.../tags/gcc_4_8_2_release)

13813

+++ b/src/libgo/runtime/go-signal.c (.../branches/gcc-4_8-branch)

13814

@@ -399,6 +399,9 @@

13815

{

13816

G *gp;

13817

M *mp;

13818

+#ifdef USING_SPLIT_STACK

13819

+ void *stack_context[10];

13820

+#endif

13821

13822

/* We are now running on the stack registered via sigaltstack.

13823

(Actually there is a small span of time between runtime_siginit

13824

@@ -409,7 +412,7 @@

13825

if (gp != NULL)

13826

{

13827

#ifdef USING_SPLIT_STACK

13828

- __splitstack_getcontext (&gp->stack_context[0]);

13829

+ __splitstack_getcontext (&stack_context[0]);

13830

#endif

13831

}

13832

13833

@@ -432,7 +435,7 @@

13834

if (gp != NULL)

13835

{

13836

#ifdef USING_SPLIT_STACK

13837

- __splitstack_setcontext (&gp->stack_context[0]);

13838

+ __splitstack_setcontext (&stack_context[0]);

13839

#endif

13840

}

13841

}

13842

Index: libgo/runtime/go-cdiv.c

13843

===================================================================

13844

--- a/src/libgo/runtime/go-cdiv.c (.../tags/gcc_4_8_2_release)

13845

+++ b/src/libgo/runtime/go-cdiv.c (.../branches/gcc-4_8-branch)

13846

@@ -0,0 +1,46 @@

13847

+/* go-cdiv.c -- complex division routines

13848

+

13849

13850

+ Use of this source code is governed by a BSD-style

13851

+ license that can be found in the LICENSE file. */

13852

+

13853

+/* Calls to these functions are generated by the Go frontend for

13854

+ division of complex64 or complex128. We use these because Go's

13855

+ complex division expects slightly different results from the GCC

13856

+ default. When dividing NaN+1.0i / 0+0i, Go expects NaN+NaNi but

13857

+ GCC generates NaN+Infi. NaN+Infi seems wrong seems the rules of

13858

+ C99 Annex G specify that if either side of a complex number is Inf,

13859

+ the the whole number is Inf, but an operation involving NaN ought

13860

+ to result in NaN, not Inf. */

13861

+

13862

+__complex float

13863

+__go_complex64_div (__complex float a, __complex float b)

13864

+{

13865

+ if (__builtin_expect (b == 0+0i, 0))

13866

+ {

13867

+ if (!__builtin_isinff (__real__ a)

13868

+ && !__builtin_isinff (__imag__ a)

13869

+ && (__builtin_isnanf (__real__ a) || __builtin_isnanf (__imag__ a)))

13870

+ {

13871

+ /* Pass "1" to nanf to match math/bits.go. */

13872

+ return __builtin_nanf("1") + __builtin_nanf("1")*1i;

13873

+ }

13874

+ }

13875

+ return a / b;

13876

+}

13877

+

13878

+__complex double

13879

+__go_complex128_div (__complex double a, __complex double b)

13880

+{

13881

+ if (__builtin_expect (b == 0+0i, 0))

13882

+ {

13883

+ if (!__builtin_isinf (__real__ a)

13884

+ && !__builtin_isinf (__imag__ a)

13885

+ && (__builtin_isnan (__real__ a) || __builtin_isnan (__imag__ a)))

13886

+ {

13887

+ /* Pass "1" to nan to match math/bits.go. */

13888

+ return __builtin_nan("1") + __builtin_nan("1")*1i;

13889

+ }

13890

+ }

13891

+ return a / b;

13892

+}

13893

Index: libgo/runtime/go-make-slice.c

13894

===================================================================

13895

--- a/src/libgo/runtime/go-make-slice.c (.../tags/gcc_4_8_2_release)

13896

+++ b/src/libgo/runtime/go-make-slice.c (.../branches/gcc-4_8-branch)

13897

@@ -34,7 +34,10 @@

13898

std = (const struct __go_slice_type *) td;

13899

13900

ilen = (intgo) len;

13901

- if (ilen < 0 || (uintptr_t) ilen != len)

13902

+ if (ilen < 0

13903

+ || (uintptr_t) ilen != len

13904

+ || (std->__element_type->__size > 0

13905

+ && len > MaxMem / std->__element_type->__size))

13906

runtime_panicstring ("makeslice: len out of range");

13907

13908

icap = (intgo) cap;

13909

Index: libgo/mksysinfo.sh

13910

===================================================================

13911

--- a/src/libgo/mksysinfo.sh (.../tags/gcc_4_8_2_release)

13912

+++ b/src/libgo/mksysinfo.sh (.../branches/gcc-4_8-branch)

13913

@@ -1035,6 +1035,10 @@

13914

grep '^const _LOCK_' gen-sysinfo.go |

13915

sed -e 's/^$const $_$LOCK_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

13916

13917

+# The PRIO constants.

13918

+grep '^const _PRIO_' gen-sysinfo.go | \

13919

+ sed -e 's/^$const $_$PRIO_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

13920

+

13921

# The GNU/Linux LINUX_REBOOT flags.

13922

grep '^const _LINUX_REBOOT_' gen-sysinfo.go |

13923

sed -e 's/^$const $_$LINUX_REBOOT_[^= ]*$$.*$$/\1\2 = _\2/' >> ${OUT}

13924

Index: libgo/config.h.in

13925

===================================================================

13926

--- a/src/libgo/config.h.in (.../tags/gcc_4_8_2_release)

13927

+++ b/src/libgo/config.h.in (.../branches/gcc-4_8-branch)

13928

@@ -39,6 +39,9 @@

13929

/* Define to 1 if you have the `dl_iterate_phdr' function. */

13930

#undef HAVE_DL_ITERATE_PHDR

13931

13932

+/* Define to 1 if you have the `dup3' function. */

13933

+#undef HAVE_DUP3

13934

+

13935

/* Define to 1 if you have the `epoll_create1' function. */

13936

#undef HAVE_EPOLL_CREATE1

13937

13938

@@ -66,6 +69,9 @@

13939

/* Define if _Unwind_GetIPInfo is available. */

13940

#undef HAVE_GETIPINFO

13941

13942

+/* Define to 1 if you have the `getxattr' function. */

13943

+#undef HAVE_GETXATTR

13944

+

13945

/* Define to 1 if you have the `inotify_add_watch' function. */

13946

#undef HAVE_INOTIFY_ADD_WATCH

13947

13948

@@ -111,6 +117,9 @@

13949

/* Define to 1 if you have the <linux/rtnetlink.h> header file. */

13950

#undef HAVE_LINUX_RTNETLINK_H

13951

13952

+/* Define to 1 if you have the `listxattr' function. */

13953

+#undef HAVE_LISTXATTR

13954

+

13955

/* Define to 1 if the system has the type `loff_t'. */

13956

#undef HAVE_LOFF_T

13957

13958

@@ -171,6 +180,9 @@

13959

/* Define to 1 if you have the `pipe2' function. */

13960

#undef HAVE_PIPE2

13961

13962

+/* Define to 1 if you have the `removexattr' function. */

13963

+#undef HAVE_REMOVEXATTR

13964

+

13965

/* Define to 1 if you have the `renameat' function. */

13966

#undef HAVE_RENAMEAT

13967

13968

@@ -180,6 +192,9 @@

13969

/* Define to 1 if you have the `setenv' function. */

13970

#undef HAVE_SETENV

13971

13972

+/* Define to 1 if you have the `setxattr' function. */

13973

+#undef HAVE_SETXATTR

13974

+

13975

/* Define to 1 if you have the `sinl' function. */

13976

#undef HAVE_SINL

13977

13978

Index: libgo/configure.ac

13979

===================================================================

13980

--- a/src/libgo/configure.ac (.../tags/gcc_4_8_2_release)

13981

+++ b/src/libgo/configure.ac (.../branches/gcc-4_8-branch)

13982

@@ -503,7 +503,7 @@

13983

AM_CONDITIONAL(HAVE_STRERROR_R, test "$ac_cv_func_strerror_r" = yes)

13984

AM_CONDITIONAL(HAVE_WAIT4, test "$ac_cv_func_wait4" = yes)

13985

13986

-AC_CHECK_FUNCS(accept4 epoll_create1 faccessat fallocate fchmodat fchownat futimesat inotify_add_watch inotify_init inotify_init1 inotify_rm_watch mkdirat mknodat openat pipe2 renameat sync_file_range splice tee unlinkat unshare utimensat)

13987

+AC_CHECK_FUNCS(accept4 dup3 epoll_create1 faccessat fallocate fchmodat fchownat futimesat getxattr inotify_add_watch inotify_init inotify_init1 inotify_rm_watch listxattr mkdirat mknodat openat pipe2 removexattr renameat setxattr sync_file_range splice tee unlinkat unshare utimensat)

13988

AC_TYPE_OFF_T

13989

AC_CHECK_TYPES([loff_t])

13990

13991

Index: libgo/go/go/build/syslist.go

13992

===================================================================

13993

--- a/src/libgo/go/go/build/syslist.go (.../tags/gcc_4_8_2_release)

13994

+++ b/src/libgo/go/go/build/syslist.go (.../branches/gcc-4_8-branch)

13995

@@ -0,0 +1,8 @@

13996

13997

+// Use of this source code is governed by a BSD-style

13998

+// license that can be found in the LICENSE file.

13999

+

14000

+package build

14001

+

14002

+const goosList = "darwin dragonfly freebsd linux netbsd openbsd plan9 windows solaris "

14003

+const goarchList = "386 amd64 arm alpha m68k mipso32 mipsn32 mipsn64 mipso64 ppc ppc64 sparc sparc64 "

14004

Index: libgo/go/syscall/libcall_linux.go

14005

===================================================================

14006

--- a/src/libgo/go/syscall/libcall_linux.go (.../tags/gcc_4_8_2_release)

14007

+++ b/src/libgo/go/syscall/libcall_linux.go (.../branches/gcc-4_8-branch)

14008

@@ -190,6 +190,9 @@

14009

//sys Adjtimex(buf *Timex) (state int, err error)

14010

//adjtimex(buf *Timex) _C_int

14011

14012

+//sysnb Dup3(oldfd int, newfd int, flags int) (err error)

14013

+//dup3(oldfd _C_int, newfd _C_int, flags _C_int) _C_int

14014

+

14015

//sys Faccessat(dirfd int, path string, mode uint32, flags int) (err error)

14016

//faccessat(dirfd _C_int, pathname *byte, mode _C_int, flags _C_int) _C_int

14017

14018

@@ -268,6 +271,9 @@

14019

return origlen - len(buf), count, names

14020

}

14021

14022

+//sys Getxattr(path string, attr string, dest []byte) (sz int, err error)

14023

+//getxattr(path *byte, attr *byte, buf *byte, count Size_t) Ssize_t

14024

+

14025

//sys InotifyAddWatch(fd int, pathname string, mask uint32) (watchdesc int, err error)

14026

//inotify_add_watch(fd _C_int, pathname *byte, mask uint32) _C_int

14027

14028

@@ -283,6 +289,9 @@

14029

//sys Klogctl(typ int, buf []byte) (n int, err error)

14030

//klogctl(typ _C_int, bufp *byte, len _C_int) _C_int

14031

14032

+//sys Listxattr(path string, dest []byte) (sz int, err error)

14033

+//listxattr(path *byte, list *byte, size Size_t) Ssize_t

14034

+

14035

//sys Mkdirat(dirfd int, path string, mode uint32) (err error)

14036

//mkdirat(dirfd _C_int, path *byte, mode Mode_t) _C_int

14037

14038

@@ -305,6 +314,9 @@

14039

//sys PivotRoot(newroot string, putold string) (err error)

14040

//pivot_root(newroot *byte, putold *byte) _C_int

14041

14042

+//sys Removexattr(path string, attr string) (err error)

14043

+//removexattr(path *byte, name *byte) _C_int

14044

+

14045

//sys Renameat(olddirfd int, oldpath string, newdirfd int, newpath string) (err error)

14046

//renameat(olddirfd _C_int, oldpath *byte, newdirfd _C_int, newpath *byte) _C_int

14047

14048

@@ -338,6 +350,9 @@

14049

//sysnb Setresuid(ruid int, eguid int, suid int) (err error)

14050

//setresuid(ruid Uid_t, euid Uid_t, suid Uid_t) _C_int

14051

14052

+//sys Setxattr(path string, attr string, data []byte, flags int) (err error)

14053

+//setxattr(path *byte, name *byte, value *byte, size Size_t, flags _C_int) _C_int

14054

+

14055

//sys splice(rfd int, roff *_loff_t, wfd int, woff *_loff_t, len int, flags int) (n int64, err error)

14056

//splice(rfd _C_int, roff *_loff_t, wfd _C_int, woff *_loff_t, len Size_t, flags _C_uint) Ssize_t

14057

func Splice(rfd int, roff *int64, wfd int, woff *int64, len int, flags int) (n int64, err error) {

14058

Index: libgo/go/syscall/socket.go

14059

===================================================================

14060

--- a/src/libgo/go/syscall/socket.go (.../tags/gcc_4_8_2_release)

14061

+++ b/src/libgo/go/syscall/socket.go (.../branches/gcc-4_8-branch)

14062

@@ -25,7 +25,7 @@

14063

Pad [96]int8

14064

}

14065

14066

-const SizeofSockaddrAny = 0x1c

14067

+const SizeofSockaddrAny = 0x6c

14068

14069

type SockaddrInet4 struct {

14070

Port int

14071

Index: libgo/go/syscall/libcall_posix.go

14072

===================================================================

14073

--- a/src/libgo/go/syscall/libcall_posix.go (.../tags/gcc_4_8_2_release)

14074

+++ b/src/libgo/go/syscall/libcall_posix.go (.../branches/gcc-4_8-branch)

14075

@@ -238,6 +238,9 @@

14076

//sysnb Getppid() (ppid int)

14077

//getppid() Pid_t

14078

14079

+//sys Getpriority(which int, who int) (prio int, err error)

14080

+//getpriority(which _C_int, who _C_int) _C_int

14081

+

14082

//sysnb Getrlimit(resource int, rlim *Rlimit) (err error)

14083

//getrlimit(resource _C_int, rlim *Rlimit) _C_int

14084

14085

@@ -307,6 +310,9 @@

14086

//sysnb Setpgid(pid int, pgid int) (err error)

14087

//setpgid(pid Pid_t, pgid Pid_t) _C_int

14088

14089

+//sys Setpriority(which int, who int, prio int) (err error)

14090

+//setpriority(which _C_int, who _C_int, prio _C_int) _C_int

14091

+

14092

//sysnb Setreuid(ruid int, euid int) (err error)

14093

//setreuid(ruid Uid_t, euid Uid_t) _C_int

14094

14095

Index: libgo/Makefile.am

14096

===================================================================

14097

--- a/src/libgo/Makefile.am (.../tags/gcc_4_8_2_release)

14098

+++ b/src/libgo/Makefile.am (.../branches/gcc-4_8-branch)

14099

@@ -424,6 +424,7 @@

14100

runtime/go-caller.c \

14101

runtime/go-callers.c \

14102

runtime/go-can-convert-interface.c \

14103

+ runtime/go-cdiv.c \

14104

runtime/go-cgo.c \

14105

runtime/go-check-interface.c \

14106

runtime/go-construct-map.c \

14107

@@ -1254,7 +1255,7 @@

14108

go/go/build/build.go \

14109

go/go/build/doc.go \

14110

go/go/build/read.go \

14111

- syslist.go

14112

+ go/go/build/syslist.go

14113

go_go_doc_files = \

14114

go/go/doc/comment.go \

14115

go/go/doc/doc.go \

14116

@@ -2712,15 +2713,6 @@

14117

@$(CHECK)

14118

.PHONY: go/build/check

14119

14120

-syslist.go: s-syslist; @true

14121

-s-syslist: Makefile

14122

- echo '// Generated automatically by make.' >syslist.go.tmp

14123

- echo 'package build' >>syslist.go.tmp

14124

- echo 'const goosList = "$(GOOS)"' >>syslist.go.tmp

14125

- echo 'const goarchList = "$(GOARCH)"' >>syslist.go.tmp

14126

- $(SHELL) $(srcdir)/../move-if-change syslist.go.tmp syslist.go

14127

- $(STAMP) $@

14128

-

14129

@go_include@ go/doc.lo.dep

14130

go/doc.lo.dep: $(go_go_doc_files)

14131

$(BUILDDEPS)

14132

Index: libcpp/po/ChangeLog

14133

===================================================================

14134

--- a/src/libcpp/po/ChangeLog (.../tags/gcc_4_8_2_release)

14135

+++ b/src/libcpp/po/ChangeLog (.../branches/gcc-4_8-branch)

14136

@@ -1,3 +1,7 @@

14137

+2013-11-01 Joseph Myers <joseph@codesourcery.com>

14138

+

14139

+ * tr.po: Update.

14140

+

14141

2013-10-16 Release Manager

14142

14143

* GCC 4.8.2 released.

14144

Index: libcpp/po/tr.po

14145

===================================================================

14146

--- a/src/libcpp/po/tr.po (.../tags/gcc_4_8_2_release)

14147

+++ b/src/libcpp/po/tr.po (.../branches/gcc-4_8-branch)

14148

@@ -1,20 +1,22 @@

14149

# Turkish translations for cpplib messages.

14150

14151

+# This file is distributed under the same license as the gcc package.

14152

#

14153

# Nilgün Belma Bugüner <nilgun@buguner.name.tr>, 2001, ..., 2007.

14154

+# Volkan Gezer <vlkngzr@gmail.com>, 2013.

14155

msgid ""

14156

msgstr ""

14157

-"Project-Id-Version: cpplib 4.2.0\n"

14158

+"Project-Id-Version: cpplib 4.8.0\n"

14159

"Report-Msgid-Bugs-To: http://gcc.gnu.org/bugs.html\n"

14160

-"POT-Creation-Date: 2013-02-24 01:05+0000\n"

14161

-"PO-Revision-Date: 2007-05-23 01:17+0300\n"

14162

-"Last-Translator: Nilgün Belma Bugüner <nilgun@buguner.name.tr>\n"

14163

+"POT-Creation-Date: 2013-03-15 17:42+0000\n"

14164

+"PO-Revision-Date: 2013-11-01 22:29+0100\n"

14165

+"Last-Translator: Volkan Gezer <vlkngzr@gmail.com>\n"

14166

"Language-Team: Turkish <gnu-tr-u12a@lists.sourceforge.net>\n"

14167

"Language: tr\n"

14168

"MIME-Version: 1.0\n"

14169

"Content-Type: text/plain; charset=UTF-8\n"

14170

"Content-Transfer-Encoding: 8bit\n"

14171

-"X-Generator: KBabel 1.11.4\n"

14172

+"X-Generator: Lokalize 1.5\n"

14173

"Plural-Forms: nplurals=2; plural=(n != 1);\n"

14174

14175

#: charset.c:673

14176

@@ -121,10 +123,9 @@

14177

msgstr "ISO standardı olmayan önceleme dizgesi, '\\%c'"

14178

14179

#: charset.c:1320

14180

-#, fuzzy, c-format

14181

-#| msgid "unknown escape sequence '\\%c'"

14182

+#, c-format

14183

msgid "unknown escape sequence: '\\%c'"

14184

-msgstr "bilinmeyen önceleme dizgesi '\\%c'"

14185

+msgstr "bilinmeyen kaçış dizgesi: '\\%c'"

14186

14187

#: charset.c:1328

14188

#, c-format

14189

@@ -163,10 +164,9 @@

14190

msgstr "#%s bir GCC uzantısıdır"

14191

14192

#: directives.c:362

14193

-#, fuzzy, c-format

14194

-#| msgid "#%s is a GCC extension"

14195

+#, c-format

14196

msgid "#%s is a deprecated GCC extension"

14197

-msgstr "#%s bir GCC uzantısıdır"

14198

+msgstr "#%s eskimiş bir GCC uzantısıdır"

14199

14200

#: directives.c:375

14201

msgid "suggest not using #elif in traditional C"

14202

@@ -247,7 +247,7 @@

14203

14204

#: directives.c:909

14205

msgid "unexpected end of file after #line"

14206

-msgstr ""

14207

+msgstr "#line satırından sonra beklenmeyen dosya sonu"

14208

14209

#: directives.c:912

14210

#, c-format

14211

@@ -271,7 +271,7 @@

14212

#: directives.c:1068 directives.c:1070 directives.c:1072 directives.c:1658

14213

#, c-format

14214

msgid "%s"

14215

-msgstr ""

14216

+msgstr "%s"

14217

14218

#: directives.c:1096

14219

#, c-format

14220

@@ -312,16 +312,12 @@

14221

msgstr "main dosyasında '#pragma once'"

14222

14223

#: directives.c:1462

14224

-#, fuzzy

14225

-#| msgid "invalid #pragma GCC poison directive"

14226

msgid "invalid #pragma push_macro directive"

14227

-msgstr "geçersiz #pragma GCC poison yönergesi"

14228

+msgstr "geçersiz #pragma güdümlü_makro yönergesi"

14229

14230

#: directives.c:1517

14231

-#, fuzzy

14232

-#| msgid "invalid #pragma GCC poison directive"

14233

msgid "invalid #pragma pop_macro directive"

14234

-msgstr "geçersiz #pragma GCC poison yönergesi"

14235

+msgstr "geçersiz #pragma güdümlü_makro yönergesi"

14236

14237

#: directives.c:1572

14238

msgid "invalid #pragma GCC poison directive"

14239

@@ -347,10 +343,9 @@

14240

msgstr "mevcut dosya %s den daha eski"

14241

14242

#: directives.c:1653

14243

-#, fuzzy, c-format

14244

-#| msgid "invalid #pragma GCC poison directive"

14245

+#, c-format

14246

msgid "invalid \"#pragma GCC %s\" directive"

14247

-msgstr "geçersiz #pragma GCC poison yönergesi"

14248

+msgstr "geçersiz \"#pragma GCC %s\" yönergesi"

14249

14250

#: directives.c:1847

14251

msgid "_Pragma takes a parenthesized string literal"

14252

@@ -405,7 +400,7 @@

14253

msgid "\"%s\" re-asserted"

14254

msgstr "\"%s\" tekrar olumlanmış"

14255

14256

-#: directives.c:2566

14257

+#: directives.c:2567

14258

#, c-format

14259

msgid "unterminated #%s"

14260

msgstr "sonlandırılmamış #%s"

14261

@@ -424,16 +419,12 @@

14262

msgstr "%s: %s"

14263

14264

#: expr.c:479 expr.c:577

14265

-#, fuzzy

14266

-#| msgid "imaginary constants are a GCC extension"

14267

msgid "fixed-point constants are a GCC extension"

14268

-msgstr "sanal sabitler bir GCC genişletmesidir"

14269

+msgstr "sabit noktalı sabitler bir GCC uzantısıdır"

14270

14271

#: expr.c:504

14272

-#, fuzzy

14273

-#| msgid "invalid suffix \"%.*s\" on floating constant"

14274

msgid "invalid prefix \"0b\" for floating constant"

14275

-msgstr "gerçel sabitin \"%.*s\" soneki geçersiz"

14276

+msgstr "kayan nokta için geçerisz \"0b\" öntakısı"

14277

14278

#: expr.c:514

14279

msgid "use of C99 hexadecimal floating constant"

14280

@@ -450,10 +441,8 @@

14281

msgstr "geleneksel C \"%.*s\" sonekini kullanmaz"

14282

14283

#: expr.c:564

14284

-#, fuzzy

14285

-#| msgid "imaginary constants are a GCC extension"

14286

msgid "suffix for double constant is a GCC extension"

14287

-msgstr "sanal sabitler bir GCC genişletmesidir"

14288

+msgstr "çift sabit için öntakı bir GCC uzantısıdır"

14289

14290

#: expr.c:570

14291

#, c-format

14292

@@ -461,10 +450,8 @@

14293

msgstr "onaltılık kayan sabitli \"%.*s\" soneki geçersiz"

14294

14295

#: expr.c:581

14296

-#, fuzzy

14297

-#| msgid "imaginary constants are a GCC extension"

14298

msgid "decimal float constants are a GCC extension"

14299

-msgstr "sanal sabitler bir GCC genişletmesidir"

14300

+msgstr "onluk kayan sabitler bir GCC uzantısıdır"

14301

14302

#: expr.c:599

14303

#, c-format

14304

@@ -472,10 +459,8 @@

14305

msgstr "tamsayı sabitte sonek \"%.*s\" soneki geçersiz"

14306

14307

#: expr.c:624

14308

-#, fuzzy

14309

-#| msgid "use of C99 long long integer constant"

14310

msgid "use of C++0x long long integer constant"

14311

-msgstr "ISO C99 long long tamsayı sabitleri yasaklar"

14312

+msgstr "ISO C++0x long long tamsayı sabitlerinin kullanımı"

14313

14314

#: expr.c:625

14315

msgid "use of C99 long long integer constant"

14316

@@ -486,10 +471,8 @@

14317

msgstr "sanal sabitler bir GCC genişletmesidir"

14318

14319

#: expr.c:644

14320

-#, fuzzy

14321

-#| msgid "imaginary constants are a GCC extension"

14322

msgid "binary constants are a GCC extension"

14323

-msgstr "sanal sabitler bir GCC genişletmesidir"

14324

+msgstr "ikili sabitler bir GCC uzantısıdır"

14325

14326

#: expr.c:737

14327

msgid "integer constant is too large for its type"

14328

@@ -517,10 +500,8 @@

14329

msgstr "\"defined\" bu kullanımıyla uyarlanabilir olmayabilir"

14330

14331

#: expr.c:948

14332

-#, fuzzy

14333

-#| msgid "integer overflow in preprocessor expression"

14334

msgid "user-defined literal in preprocessor expression"

14335

-msgstr "önişlemci ifadesinde tamsayı taşması"

14336

+msgstr "önişleyici ifadesinde kullanıcı tanımlı bağımlı"

14337

14338

#: expr.c:953

14339

msgid "floating constant in preprocessor expression"

14340

@@ -536,20 +517,17 @@

14341

msgstr "\"%s\" tanımlı değil"

14342

14343

#: expr.c:1020

14344

-#, fuzzy

14345

-#| msgid "#%s is a GCC extension"

14346

msgid "assertions are a GCC extension"

14347

-msgstr "#%s bir GCC uzantısıdır"

14348

+msgstr "belirteçler bir GCC uzantısıdır"

14349

14350

#: expr.c:1023

14351

msgid "assertions are a deprecated extension"

14352

-msgstr ""

14353

+msgstr "belirteçler artık kullanılmayan bir ifadedir"

14354

14355

#: expr.c:1268

14356

-#, fuzzy, c-format

14357

-#| msgid "unbalanced stack in #if"

14358

+#, c-format

14359

msgid "unbalanced stack in %s"

14360

-msgstr "#if ifadesinde karşılıksız yığın"

14361

+msgstr "%s içinde dengelenmemiş yığın"

14362

14363

#: expr.c:1288

14364

#, c-format

14365

@@ -594,39 +572,39 @@

14366

msgid "division by zero in #if"

14367

msgstr "#if içinde sıfırla bölme"

14368

14369

-#: files.c:504

14370

+#: files.c:505

14371

msgid "NULL directory in find_file"

14372

msgstr "find_file içinde boş dizin"

14373

14374

-#: files.c:542

14375

+#: files.c:553

14376

msgid "one or more PCH files were found, but they were invalid"

14377

msgstr "bir veya daha fazla PCH dosyası bulundu ama bunlar geçersiz"

14378

14379

-#: files.c:545

14380

+#: files.c:556

14381

msgid "use -Winvalid-pch for more information"

14382

msgstr "daha fazla bilgi almak için -Winvalid-pch kullanın"

14383

14384

-#: files.c:643

14385

+#: files.c:660

14386

#, c-format

14387

msgid "%s is a block device"

14388

msgstr "%s bir blok aygıtıdır"

14389

14390

-#: files.c:660

14391

+#: files.c:677

14392

#, c-format

14393

msgid "%s is too large"

14394

msgstr "%s çok büyük"

14395

14396

-#: files.c:700

14397

+#: files.c:717

14398

#, c-format

14399

msgid "%s is shorter than expected"

14400

msgstr "%s beklenenden daha kısa"

14401

14402

-#: files.c:935

14403

+#: files.c:953

14404

#, c-format

14405

msgid "no include path in which to search for %s"

14406

msgstr "%s için aranacaklar içinde başlık dosyaları yolu yok"

14407

14408

-#: files.c:1363

14409

+#: files.c:1381

14410

msgid "Multiple include guards may be useful for:\n"

14411

msgstr "Çoklu include önlemleri aşağıdakiler için kullanışlı olabilir:\n"

14412

14413

@@ -717,27 +695,24 @@

14414

#: lex.c:1178 lex.c:1255

14415

#, c-format

14416

msgid "identifier \"%s\" is a special operator name in C++"

14417

-msgstr ""

14418

+msgstr "\"%s\" belirteci, C++'da özel bir işleç adıdır"

14419

14420

#: lex.c:1399

14421

msgid "raw string delimiter longer than 16 characters"

14422

-msgstr ""

14423

+msgstr "ham dizge ayracı 16 karakterden uzun"

14424

14425

#: lex.c:1402

14426

-#, fuzzy, c-format

14427

-#| msgid "universal character %.*s is not valid in an identifier"

14428

+#, c-format

14429

msgid "invalid character '%c' in raw string delimiter"

14430

-msgstr "evrensel karakter %.*s bir belirteç içinde geçerli değil"

14431

+msgstr "ham dizge ayracında geçersiz karakter '%c'"

14432

14433

#: lex.c:1525 lex.c:1547

14434

-#, fuzzy

14435

-#| msgid "unterminated #%s"

14436

msgid "unterminated raw string"

14437

-msgstr "sonlandırılmamış #%s"

14438

+msgstr "bitirilmemiş ham dizge"

14439

14440

#: lex.c:1573 lex.c:1706

14441

msgid "invalid suffix on literal; C++11 requires a space between literal and identifier"

14442

-msgstr ""

14443

+msgstr "geçersiz ifade soneki; C++11 ifade ve tanımlayıcı arasında bir boşluk gerektirir"

14444

14445

#: lex.c:1684

14446

msgid "null character(s) preserved in literal"

14447

@@ -785,7 +760,7 @@

14448

14449

#: macro.c:377

14450

msgid "__COUNTER__ expanded inside directive with -fdirectives-only"

14451

-msgstr ""

14452

+msgstr "__COUNTER__ -fdirectives-only ile talimat içerisinde genişletildi"

14453

14454

#: macro.c:535

14455

msgid "invalid string literal, ignoring final '\\'"

14456

@@ -823,7 +798,7 @@

14457

#: macro.c:1746

14458

#, c-format

14459

msgid "invoking macro %s argument %d: empty macro arguments are undefined in ISO C90 and ISO C++98"

14460

-msgstr ""

14461

+msgstr "%s makrosu %d argümanı uygulanıyor: ISO C90 ve ISO C++98 içerisinde boş makro argümanları tanımsızdır"

14462

14463

#: macro.c:2708

14464

#, c-format

14465

@@ -890,38 +865,36 @@

14466

msgid "invalid hash type %d in cpp_macro_definition"

14467

msgstr "cpp_macro_definition içindeki isimli yapı türü %d geçersiz"

14468

14469

-#: pch.c:87 pch.c:335 pch.c:347 pch.c:365 pch.c:371 pch.c:380 pch.c:387

14470

+#: pch.c:87 pch.c:345 pch.c:359 pch.c:377 pch.c:383 pch.c:392 pch.c:399

14471

msgid "while writing precompiled header"

14472

msgstr "önderlemeli başlık yazılırken"

14473

14474

-#: pch.c:607

14475

-#, fuzzy, c-format

14476

-#| msgid "%s: not used because `%s' is defined"

14477

+#: pch.c:619

14478

+#, c-format

14479

msgid "%s: not used because `%.*s' is poisoned"

14480

-msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

14481

+msgstr "%s: `%.*s' zehirli olduğu için kullanılmadı"

14482

14483

-#: pch.c:629

14484

+#: pch.c:641

14485

#, c-format

14486

msgid "%s: not used because `%.*s' not defined"

14487

msgstr "%s: `%.*s' tanımlı olmadığından kullanılmadı"

14488

14489

-#: pch.c:641

14490

+#: pch.c:653

14491

#, c-format

14492

msgid "%s: not used because `%.*s' defined as `%s' not `%.*s'"

14493

msgstr "%s: `%.*s' kullanılmadı çünkü `%s' olarak tanımlı, `%.*s' değil"

14494

14495

-#: pch.c:682

14496

+#: pch.c:694

14497

#, c-format

14498

msgid "%s: not used because `%s' is defined"

14499

msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

14500

14501

-#: pch.c:702

14502

-#, fuzzy, c-format

14503

-#| msgid "%s: not used because `%s' is defined"

14504

+#: pch.c:714

14505

+#, c-format

14506

msgid "%s: not used because `__COUNTER__' is invalid"

14507

-msgstr "%s: `%s' tanımlı olduğundan kullanılmadı"

14508

+msgstr "%s: `__COUNTER__' geçersiz olduğundan kullanılmadı"

14509

14510

-#: pch.c:711 pch.c:886

14511

+#: pch.c:723 pch.c:898

14512

msgid "while reading precompiled header"

14513

msgstr "önderlemeli başlık okunurken"

14514

14515

Index: .

14516

===================================================================

14517

--- a/src/. (.../tags/gcc_4_8_2_release)

14518

+++ b/src/. (.../branches/gcc-4_8-branch)

14519

14520

Property changes on: .

14521

___________________________________________________________________

14522

Modified: svn:mergeinfo

14523

Merged /trunk:r202766,204547